Lines Matching refs:level
384 unsigned long *key, int level) in find_level() argument
389 for (height = head->height; height > level; height--) { in find_level()
444 unsigned long *key, void *val, int level, in btree_insert_level() argument
451 if (head->height < level) { in btree_insert_level()
458 node = find_level(head, geo, key, level); in btree_insert_level()
473 new, level + 1, gfp); in btree_insert_level()
514 unsigned long *key, int level);
515 static void merge(struct btree_head *head, struct btree_geo *geo, int level, in merge() argument
531 btree_remove_level(head, geo, bkey(geo, parent, lpos), level + 1); in merge()
536 unsigned long *key, int level, unsigned long *child, int fill) in rebalance() argument
546 btree_remove_level(head, geo, key, level + 1); in rebalance()
551 parent = find_level(head, geo, key, level + 1); in rebalance()
559 merge(head, geo, level, in rebalance()
570 merge(head, geo, level, in rebalance()
587 unsigned long *key, int level) in btree_remove_level() argument
593 if (level > head->height) { in btree_remove_level()
600 node = find_level(head, geo, key, level); in btree_remove_level()
603 if ((level == 1) && (keycmp(geo, node, pos, key) != 0)) in btree_remove_level()
615 if (level < head->height) in btree_remove_level()
616 rebalance(head, geo, key, level, node, fill - 1); in btree_remove_level()