Home | History | Annotate | Download | only in gen

Lines Matching defs:nodes

37  * Leaf nodes are just void * and this implementation doesn't care about
42  * Intermediate nodes and memory allocation:
44  * Intermediate nodes are automatically allocated and freed internally and
48  * memory for intermediate nodes and thus can fail for ENOMEM.
53  * The memory consumption (number of necessary intermediate nodes) heavily
55  * consumes less nodes per item.  Approximately,
68  *  - the worst case: RADIX_TREE_MAX_HEIGHT intermediate nodes per item.
88  * (struct radix_tree) without allocating any intermediate nodes.  In that
93  * This implementation provides a way to scan many nodes quickly via
99  * scanning of a subset of leaf nodes.  Leaf nodes are untagged when inserted
102  * leaf nodes with the given tag.  To reduce amount of nodes to visit for
104  * intermediate nodes and quickly skips uninterested parts of a tree.
187  * we don't care the type of leaf nodes.  they are just void *.
189  * we used to maintain a count of non-NULL nodes in this structure, but it
284  * Return true if the tree has any nodes with the given tag.  Otherwise
324  * maximum possible required number of nodes is available.
330 	struct radix_tree_node *nodes[RADIX_TREE_MAX_HEIGHT];
333 	for (i = 0; i < __arraycount(nodes); i++) {
334 		nodes[i] = kmem_intr_alloc(sizeof(struct radix_tree_node),
338 		kmem_intr_free(nodes[i], sizeof(struct radix_tree_node));
348  * check for tag masks or empty nodes.
492  * if tagmask is not zero, search only for nodes with the tag set.
603 		 * no nodes were inserted.
641  * nodes.  If _KERNEL, it's done with no-sleep IPL_NONE memory allocation.
920  * return found nodes.
923  * This function returns the number of nodes found, up to maxresults.
924  * Returning less than maxresults means there are no more nodes in the tree.
929  * maxresults nodes are found or it reaches the limit of the index range.
934  * multiple nodes at once.  Especially, it's expected to be much cheaper when
937  * Note that this function doesn't return index values of found nodes.
940  * by examining the returned nodes using some caller-specific knowledge
977  * nodes tagged with tagid.
1475 	struct testnode *nodes;
1479 	nodes = malloc(nnodes * sizeof(*nodes));
1485 		n = &nodes[i];
1513 		n = &nodes[i];
1526 			n = &nodes[i];
1544 		n = &nodes[i];
1552 		n = &nodes[i];
1564 			n = &nodes[i];
1738 	free(nodes);