197 	void *n_ptrs[RADIX_TREE_PTR_PER_NODE];  member
359 		sum |= (uintptr_t)n->n_ptrs[i];  in radix_tree_sum_node()
371 	sum = (uintptr_t)n->n_ptrs[0];  in radix_tree_sum_node()
372 	sum |= (uintptr_t)n->n_ptrs[1];  in radix_tree_sum_node()
373 	sum |= (uintptr_t)n->n_ptrs[2];  in radix_tree_sum_node()
374 	sum |= (uintptr_t)n->n_ptrs[3];  in radix_tree_sum_node()
376 	sum |= (uintptr_t)n->n_ptrs[4];  in radix_tree_sum_node()
377 	sum |= (uintptr_t)n->n_ptrs[5];  in radix_tree_sum_node()
378 	sum |= (uintptr_t)n->n_ptrs[6];  in radix_tree_sum_node()
379 	sum |= (uintptr_t)n->n_ptrs[7];  in radix_tree_sum_node()
382 	sum |= (uintptr_t)n->n_ptrs[8];  in radix_tree_sum_node()
383 	sum |= (uintptr_t)n->n_ptrs[9];  in radix_tree_sum_node()
384 	sum |= (uintptr_t)n->n_ptrs[10];  in radix_tree_sum_node()
385 	sum |= (uintptr_t)n->n_ptrs[11];  in radix_tree_sum_node()
386 	sum |= (uintptr_t)n->n_ptrs[12];  in radix_tree_sum_node()
387 	sum |= (uintptr_t)n->n_ptrs[13];  in radix_tree_sum_node()
388 	sum |= (uintptr_t)n->n_ptrs[14];  in radix_tree_sum_node()
389 	sum |= (uintptr_t)n->n_ptrs[15];  in radix_tree_sum_node()
401 		c += (n->n_ptrs[i] != NULL);  in radix_tree_node_count_ptrs()
466 				newnodes[h]->n_ptrs[0] = NULL;  in radix_tree_grow()
471 		newnodes[h]->n_ptrs[0] = root;  in radix_tree_grow()
568 		vpp = &n->n_ptrs[i];  in radix_tree_lookup_ptr()
879 		for (i = vpp - n->n_ptrs + step; i != guard; i += step) {  in gang_lookup_scan()
881 			if (entry_match_p(n->n_ptrs[i], tagmask)) {  in gang_lookup_scan()
882 				vpp = &n->n_ptrs[i];  in gang_lookup_scan()
909 			vpp = &n->n_ptrs[first];  in gang_lookup_scan()
1163 	for (i = 0; i < __arraycount(n->n_ptrs); i++) {  in radix_tree_dump_node()
1166 		c = n->n_ptrs[i];  in radix_tree_dump_node()