Lines Matching defs:nodes
77 * Per-cpu pool of preloaded nodes
81 struct radix_tree_node *nodes[RADIX_TREE_MAX_PATH];
171 ret = rtp->nodes[rtp->nr - 1];
172 rtp->nodes[rtp->nr - 1] = NULL;
190 * must only free zeroed nodes into the slab. radix_tree_shrink
226 while (rtp->nr < ARRAY_SIZE(rtp->nodes)) {
233 if (rtp->nr < ARRAY_SIZE(rtp->nodes))
234 rtp->nodes[rtp->nr++] = node;
435 * must manage lifetimes of leaf nodes (eg. RCU may also be used to free
639 * setting any tags on intermediate nodes. If we set tags as we descend, then
709 /* walk back up the path tagging interior nodes */
1317 /* Now free the nodes we do not need anymore */
1394 /* Free per-cpu pool of perloaded nodes */
1399 rtp->nodes[rtp->nr-1]);
1400 rtp->nodes[rtp->nr-1] = NULL;