Lines Matching refs:KEYS_PER_NODE
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)), enumerator
117 uint64_t keys[KEYS_PER_NODE];
119 void *ptrs[KEYS_PER_NODE];
186 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_find_last_leaf()
316 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_find_level()
335 for (i = 1; i < KEYS_PER_NODE; i++) { in xfs_iext_node_pos()
350 for (i = 0; i < KEYS_PER_NODE; i++) { in xfs_iext_node_insert_pos()
355 return KEYS_PER_NODE; in xfs_iext_node_insert_pos()
365 for (i = start; i < KEYS_PER_NODE; i++) { in xfs_iext_node_nr_entries()
418 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_grow()
437 for (i = 0; i < KEYS_PER_NODE; i++) { in xfs_iext_update_node()
458 const int nr_move = KEYS_PER_NODE / 2; in xfs_iext_split_node()
459 int nr_keep = nr_move + (KEYS_PER_NODE & 1); in xfs_iext_split_node()
463 if (*pos == KEYS_PER_NODE) { in xfs_iext_split_node()
487 for (; i < KEYS_PER_NODE; i++) in xfs_iext_split_node()
512 ASSERT(nr_entries <= KEYS_PER_NODE); in xfs_iext_insert_node()
514 if (nr_entries == KEYS_PER_NODE) in xfs_iext_insert_node()
690 if (nr_prev + nr_entries <= KEYS_PER_NODE) { in xfs_iext_rebalance_node()
703 if (nr_entries + nr_next <= KEYS_PER_NODE) { in xfs_iext_rebalance_node()
753 if (nr_entries >= KEYS_PER_NODE / 2) in xfs_iext_remove_node()
766 ASSERT(pos != KEYS_PER_NODE); in xfs_iext_remove_node()
1031 for (i = 0; i < KEYS_PER_NODE; i++) { in xfs_iext_destroy_node()