Lines Matching refs:bval
152 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() function
216 node = bval(geo, node, 0); in btree_last()
219 return bval(geo, node, 0); in btree_last()
255 node = bval(geo, node, i); in btree_lookup_node()
274 return bval(geo, node, i); in btree_lookup()
330 node = bval(geo, node, i); in btree_get_prev()
341 if (bval(geo, node, i)) { in btree_get_prev()
343 return bval(geo, node, i); in btree_get_prev()
375 if (!bval(geo, node, i)) in getfill()
394 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
402 node = bval(geo, node, i); in find_level()
438 head->node = bval(geo, node, 0); in btree_shrink()
480 setval(geo, new, i, bval(geo, node, i)); in btree_insert_level()
482 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
487 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
497 setval(geo, node, i, bval(geo, node, i - 1)); in btree_insert_level()
525 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
553 BUG_ON(bval(geo, parent, i) != child); in rebalance()
556 left = bval(geo, parent, i - 1); in rebalance()
567 right = bval(geo, parent, i + 1); in rebalance()
605 ret = bval(geo, node, pos); in btree_remove_level()
610 setval(geo, node, i, bval(geo, node, i + 1)); in btree_remove_level()
682 child = bval(geo, node, i); in __btree_for_each()