Lines Matching refs:no_pairs
50 int no_pairs; member
56 .no_pairs = NODESIZE / sizeof(long) / 2,
64 .no_pairs = NODESIZE / sizeof(long) / (1 + LONG_PER_U64),
71 .no_pairs = NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64),
250 for (i = 0; i < geo->no_pairs; i++) in btree_lookup_node()
253 if (i == geo->no_pairs) in btree_lookup_node()
272 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
289 for (i = 0; i < geo->no_pairs; i++) in btree_update()
324 for (i = 0; i < geo->no_pairs; i++) in btree_get_prev()
327 if (i == geo->no_pairs) in btree_get_prev()
339 for (i = 0; i < geo->no_pairs; i++) { in btree_get_prev()
363 for (i = 0; i < geo->no_pairs; i++) { in getpos()
374 for (i = start; i < geo->no_pairs; i++) in getfill()
390 for (i = 0; i < geo->no_pairs; i++) in find_level()
394 if ((i == geo->no_pairs) || !bval(geo, node, i)) { in find_level()
464 if (fill == geo->no_pairs) { in btree_insert_level()
492 BUG_ON(fill >= geo->no_pairs); in btree_insert_level()
558 if (fill + no_left <= geo->no_pairs) { in rebalance()
569 if (fill + no_right <= geo->no_pairs) { in rebalance()
614 if (fill - 1 < geo->no_pairs / 2) { in btree_remove_level()
681 for (i = 0; i < geo->no_pairs; i++) { in __btree_for_each()