94 	KEYS_PER_NODE	= NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)),  enumerator
121 	uint64_t		keys[KEYS_PER_NODE];
123 	void			*ptrs[KEYS_PER_NODE];
190 		for (i = 1; i < KEYS_PER_NODE; i++)  in xfs_iext_find_last_leaf()
320 		for (i = 1; i < KEYS_PER_NODE; i++)  in xfs_iext_find_level()
339 	for (i = 1; i < KEYS_PER_NODE; i++) {  in xfs_iext_node_pos()
354 	for (i = 0; i < KEYS_PER_NODE; i++) {  in xfs_iext_node_insert_pos()
359 	return KEYS_PER_NODE;  in xfs_iext_node_insert_pos()
369 	for (i = start; i < KEYS_PER_NODE; i++) {  in xfs_iext_node_nr_entries()
422 	for (i = 1; i < KEYS_PER_NODE; i++)  in xfs_iext_grow()
441 		for (i = 0; i < KEYS_PER_NODE; i++) {  in xfs_iext_update_node()
462 	const int		nr_move = KEYS_PER_NODE / 2;  in xfs_iext_split_node()
463 	int			nr_keep = nr_move + (KEYS_PER_NODE & 1);  in xfs_iext_split_node()
467 	if (*pos == KEYS_PER_NODE) {  in xfs_iext_split_node()
491 	for (; i < KEYS_PER_NODE; i++)  in xfs_iext_split_node()
516 	ASSERT(nr_entries <= KEYS_PER_NODE);  in xfs_iext_insert_node()
518 	if (nr_entries == KEYS_PER_NODE)  in xfs_iext_insert_node()
695 		if (nr_prev + nr_entries <= KEYS_PER_NODE) {  in xfs_iext_rebalance_node()
708 		if (nr_entries + nr_next <= KEYS_PER_NODE) {  in xfs_iext_rebalance_node()
758 	if (nr_entries >= KEYS_PER_NODE / 2)  in xfs_iext_remove_node()
771 		ASSERT(pos != KEYS_PER_NODE);  in xfs_iext_remove_node()
1036 		for (i = 0; i < KEYS_PER_NODE; i++) {  in xfs_iext_destroy_node()