Lines Matching refs:KEYS_PER_NODE
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)),
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;
365 for (i = start; i < KEYS_PER_NODE; i++) {
425 for (i = 1; i < KEYS_PER_NODE; i++)
444 for (i = 0; i < KEYS_PER_NODE; i++) {
465 const int nr_move = KEYS_PER_NODE / 2;
466 int nr_keep = nr_move + (KEYS_PER_NODE & 1);
470 if (*pos == KEYS_PER_NODE) {
494 for (; i < KEYS_PER_NODE; i++)
519 ASSERT(nr_entries <= KEYS_PER_NODE);
521 if (nr_entries == KEYS_PER_NODE)
707 if (nr_prev + nr_entries <= KEYS_PER_NODE) {
720 if (nr_entries + nr_next <= KEYS_PER_NODE) {
770 if (nr_entries >= KEYS_PER_NODE / 2)
783 ASSERT(pos != KEYS_PER_NODE);
1048 for (i = 0; i < KEYS_PER_NODE; i++) {