Lines Matching refs:bkey
150 static unsigned long *bkey(struct btree_geo *geo, unsigned long *node, int n) in bkey() function
163 longcpy(bkey(geo, node, n), key, geo->keylen); in setkey()
174 longset(bkey(geo, node, n), 0, geo->keylen); in clearpair()
221 longcpy(key, bkey(geo, node, 0), geo->keylen); in btree_last()
229 return longcmp(bkey(geo, node, pos), key, geo->keylen); in keycmp()
340 retry_key = bkey(geo, oldnode, i); in btree_get_prev()
349 longcpy(__key, bkey(geo, node, i), geo->keylen); in btree_get_prev()
426 setkey(geo, node, 0, bkey(geo, head->node, fill - 1)); in btree_grow()
479 bkey(geo, node, fill / 2 - 1), in btree_insert_level()
486 setkey(geo, new, i, bkey(geo, node, i)); in btree_insert_level()
488 setkey(geo, node, i, bkey(geo, node, i + fill / 2)); in btree_insert_level()
493 setkey(geo, node, i, bkey(geo, node, fill - 1)); in btree_insert_level()
503 setkey(geo, node, i, bkey(geo, node, i - 1)); in btree_insert_level()
531 setkey(geo, left, lfill + i, bkey(geo, right, i)); in merge()
538 btree_remove_level(head, geo, bkey(geo, parent, lpos), level + 1); in merge()
616 setkey(geo, node, i, bkey(geo, node, i + 1)); in btree_remove_level()
696 func(child, opaque, bkey(geo, node, i), count++, in __btree_for_each()