Lines Matching defs:n_ptrs
197 void *n_ptrs[RADIX_TREE_PTR_PER_NODE];
203 * p_refs[n].pptr == &(*p_refs[n-1])->n_ptrs[x]
359 sum |= (uintptr_t)n->n_ptrs[i];
371 sum = (uintptr_t)n->n_ptrs[0];
372 sum |= (uintptr_t)n->n_ptrs[1];
373 sum |= (uintptr_t)n->n_ptrs[2];
374 sum |= (uintptr_t)n->n_ptrs[3];
376 sum |= (uintptr_t)n->n_ptrs[4];
377 sum |= (uintptr_t)n->n_ptrs[5];
378 sum |= (uintptr_t)n->n_ptrs[6];
379 sum |= (uintptr_t)n->n_ptrs[7];
382 sum |= (uintptr_t)n->n_ptrs[8];
383 sum |= (uintptr_t)n->n_ptrs[9];
384 sum |= (uintptr_t)n->n_ptrs[10];
385 sum |= (uintptr_t)n->n_ptrs[11];
386 sum |= (uintptr_t)n->n_ptrs[12];
387 sum |= (uintptr_t)n->n_ptrs[13];
388 sum |= (uintptr_t)n->n_ptrs[14];
389 sum |= (uintptr_t)n->n_ptrs[15];
401 c += (n->n_ptrs[i] != NULL);
466 newnodes[h]->n_ptrs[0] = NULL;
471 newnodes[h]->n_ptrs[0] = root;
568 vpp = &n->n_ptrs[i];
820 * n_ptrs as the following.
823 * visit n->n_ptrs[i];
879 for (i = vpp - n->n_ptrs + step; i != guard; i += step) {
881 if (entry_match_p(n->n_ptrs[i], tagmask)) {
882 vpp = &n->n_ptrs[i];
909 vpp = &n->n_ptrs[first];
1163 for (i = 0; i < __arraycount(n->n_ptrs); i++) {
1166 c = n->n_ptrs[i];