Home
last modified time | relevance | path

Searched refs:KEYS_PER_NODE (Results 1 – 2 of 2) sorted by relevance

/linux/fs/xfs/libxfs/
A Dxfs_iext_tree.c117 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()
355 return KEYS_PER_NODE; in xfs_iext_node_insert_pos()
418 for (i = 1; i < KEYS_PER_NODE; i++) in xfs_iext_grow()
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()
[all …]
/linux/drivers/md/
A Ddm-table.c29 #define KEYS_PER_NODE (NODE_SIZE / sizeof(sector_t)) macro
30 #define CHILDREN_PER_NODE (KEYS_PER_NODE + 1)
61 return t->index[l] + (n * KEYS_PER_NODE); in get_node()
76 return get_node(t, l, n)[KEYS_PER_NODE - 1]; in high()
91 for (k = 0U; k < KEYS_PER_NODE; k++) in setup_btree_index()
138 num_targets = KEYS_PER_NODE; in dm_table_create()
140 num_targets = dm_round_up(num_targets, KEYS_PER_NODE); in dm_table_create()
1064 indexes += (KEYS_PER_NODE * t->counts[i]); in setup_indexes()
1080 leaf_nodes = dm_div_up(t->num_targets, KEYS_PER_NODE); in dm_table_build_index()
1477 for (k = 0; k < KEYS_PER_NODE; k++) in dm_table_find_target()
[all …]

Completed in 12 milliseconds