Lines Matching refs:bval
155 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() function
219 node = bval(geo, node, 0); in btree_last()
222 return bval(geo, node, 0); in btree_last()
258 node = bval(geo, node, i); in btree_lookup()
268 return bval(geo, node, i); in btree_lookup()
288 node = bval(geo, node, i); in btree_update()
337 node = bval(geo, node, i); in btree_get_prev()
348 if (bval(geo, node, i)) { in btree_get_prev()
350 return bval(geo, node, i); in btree_get_prev()
382 if (!bval(geo, node, i)) in getfill()
401 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
409 node = bval(geo, node, i); in find_level()
445 head->node = bval(geo, node, 0); in btree_shrink()
487 setval(geo, new, i, bval(geo, node, i)); in btree_insert_level()
489 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
494 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
504 setval(geo, node, i, bval(geo, node, i - 1)); in btree_insert_level()
532 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
560 BUG_ON(bval(geo, parent, i) != child); in rebalance()
563 left = bval(geo, parent, i - 1); in rebalance()
574 right = bval(geo, parent, i + 1); in rebalance()
612 ret = bval(geo, node, pos); in btree_remove_level()
617 setval(geo, node, i, bval(geo, node, i + 1)); in btree_remove_level()
689 child = bval(geo, node, i); in __btree_for_each()