Lines Matching refs:no_pairs
53 int no_pairs; member
59 .no_pairs = NODESIZE / sizeof(long) / 2,
67 .no_pairs = NODESIZE / sizeof(long) / (1 + LONG_PER_U64),
74 .no_pairs = NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64),
253 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
256 if (i == geo->no_pairs) in btree_lookup()
266 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
283 for (i = 0; i < geo->no_pairs; i++) in btree_update()
286 if (i == geo->no_pairs) in btree_update()
296 for (i = 0; i < geo->no_pairs; i++) in btree_update()
331 for (i = 0; i < geo->no_pairs; i++) in btree_get_prev()
334 if (i == geo->no_pairs) in btree_get_prev()
346 for (i = 0; i < geo->no_pairs; i++) { in btree_get_prev()
370 for (i = 0; i < geo->no_pairs; i++) { in getpos()
381 for (i = start; i < geo->no_pairs; i++) in getfill()
397 for (i = 0; i < geo->no_pairs; i++) in find_level()
401 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
471 if (fill == geo->no_pairs) { in btree_insert_level()
499 BUG_ON(fill >= geo->no_pairs); in btree_insert_level()
565 if (fill + no_left <= geo->no_pairs) { in rebalance()
576 if (fill + no_right <= geo->no_pairs) { in rebalance()
621 if (fill - 1 < geo->no_pairs / 2) { in btree_remove_level()
688 for (i = 0; i < geo->no_pairs; i++) { in __btree_for_each()