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

/linux-master/fs/xfs/libxfs/
H A Dxfs_iext_tree.c90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)), enumerator in enum:__anon1045
100 * The leaf blocks are made up by %KEYS_PER_NODE extent records, which each
105 * The inner (non-leaf) blocks first contain KEYS_PER_NODE lookup keys, followed
117 uint64_t keys[KEYS_PER_NODE];
119 void *ptrs[KEYS_PER_NODE];
186 for (i = 1; i < KEYS_PER_NODE; i++)
316 for (i = 1; i < KEYS_PER_NODE; i++)
335 for (i = 1; i < KEYS_PER_NODE; i++) {
350 for (i = 0; i < KEYS_PER_NODE; i++) {
355 return KEYS_PER_NODE;
[all...]
/linux-master/drivers/md/
H A Ddm-table.c31 #define KEYS_PER_NODE (NODE_SIZE / sizeof(sector_t)) macro
32 #define CHILDREN_PER_NODE (KEYS_PER_NODE + 1)
63 return t->index[l] + (n * KEYS_PER_NODE);
78 return get_node(t, l, n)[KEYS_PER_NODE - 1];
93 for (k = 0U; k < KEYS_PER_NODE; k++)
146 num_targets = KEYS_PER_NODE;
148 num_targets = dm_round_up(num_targets, KEYS_PER_NODE);
1093 indexes += (KEYS_PER_NODE * t->counts[i]);
1109 leaf_nodes = dm_div_up(t->num_targets, KEYS_PER_NODE);
1488 for (k = 0; k < KEYS_PER_NODE;
[all...]

Completed in 124 milliseconds