51 	int no_pairs;  member
57 	.no_pairs = NODESIZE / sizeof(long) / 2,
65 	.no_pairs = NODESIZE / sizeof(long) / (1 + LONG_PER_U64),
72 	.no_pairs = NODESIZE / sizeof(long) / (1 + 2 * LONG_PER_U64),
251 		for (i = 0; i < geo->no_pairs; i++)  in btree_lookup_node()
254 		if (i == geo->no_pairs)  in btree_lookup_node()
273 	for (i = 0; i < geo->no_pairs; i++)  in btree_lookup()
290 	for (i = 0; i < geo->no_pairs; i++)  in btree_update()
325 		for (i = 0; i < geo->no_pairs; i++)  in btree_get_prev()
328 		if (i == geo->no_pairs)  in btree_get_prev()
340 	for (i = 0; i < geo->no_pairs; i++) {  in btree_get_prev()
364 	for (i = 0; i < geo->no_pairs; i++) {  in getpos()
375 	for (i = start; i < geo->no_pairs; i++)  in getfill()
391 		for (i = 0; i < geo->no_pairs; i++)  in find_level()
395 		if ((i == geo->no_pairs) || !bval(geo, node, i)) {  in find_level()
465 	if (fill == geo->no_pairs) {  in btree_insert_level()
493 	BUG_ON(fill >= geo->no_pairs);  in btree_insert_level()
559 		if (fill + no_left <= geo->no_pairs) {  in rebalance()
570 		if (fill + no_right <= geo->no_pairs) {  in rebalance()
615 	if (fill - 1 < geo->no_pairs / 2) {  in btree_remove_level()
682 	for (i = 0; i < geo->no_pairs; i++) {  in __btree_for_each()