Searched refs:KEYS_PER_NODE (Results 1 – 2 of 2) sorted by relevance
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)), enumerator117 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()[all …]
31 #define KEYS_PER_NODE (NODE_SIZE / sizeof(sector_t)) macro32 #define CHILDREN_PER_NODE (KEYS_PER_NODE + 1)63 return t->index[l] + (n * KEYS_PER_NODE); in get_node()78 return get_node(t, l, n)[KEYS_PER_NODE - 1]; in high()93 for (k = 0U; k < KEYS_PER_NODE; k++) in setup_btree_index()141 num_targets = KEYS_PER_NODE; in dm_table_create()143 num_targets = dm_round_up(num_targets, KEYS_PER_NODE); in dm_table_create()1087 indexes += (KEYS_PER_NODE * t->counts[i]); in setup_indexes()1103 leaf_nodes = dm_div_up(t->num_targets, KEYS_PER_NODE); in dm_table_build_index()1482 for (k = 0; k < KEYS_PER_NODE; k++) in dm_table_find_target()[all …]
