Lines Matching refs:bval
153 static void *bval(struct btree_geo *geo, unsigned long *node, int n) in bval() function
217 node = bval(geo, node, 0); in btree_last()
220 return bval(geo, node, 0); in btree_last()
256 node = bval(geo, node, i); in btree_lookup()
266 return bval(geo, node, i); in btree_lookup()
286 node = bval(geo, node, i); in btree_update()
335 node = bval(geo, node, i); in btree_get_prev()
346 if (bval(geo, node, i)) { in btree_get_prev()
348 return bval(geo, node, i); in btree_get_prev()
380 if (!bval(geo, node, i)) in getfill()
399 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
407 node = bval(geo, node, i); in find_level()
443 head->node = bval(geo, node, 0); in btree_shrink()
485 setval(geo, new, i, bval(geo, node, i)); in btree_insert_level()
487 setval(geo, node, i, bval(geo, node, i + fill / 2)); in btree_insert_level()
492 setval(geo, node, i, bval(geo, node, fill - 1)); in btree_insert_level()
502 setval(geo, node, i, bval(geo, node, i - 1)); in btree_insert_level()
530 setval(geo, left, lfill + i, bval(geo, right, i)); in merge()
558 BUG_ON(bval(geo, parent, i) != child); in rebalance()
561 left = bval(geo, parent, i - 1); in rebalance()
572 right = bval(geo, parent, i + 1); in rebalance()
610 ret = bval(geo, node, pos); in btree_remove_level()
615 setval(geo, node, i, bval(geo, node, i + 1)); in btree_remove_level()
687 child = bval(geo, node, i); in __btree_for_each()