Lines Matching defs:tree
93 /* Initialise the fields in a pair of radix tree nodes according to the */
138 /* Returns: ipf_rdx_node_t * - pointer to a node in the radix tree. */
139 /* Parameters: tree(I) - pointer to first right node in tree to search */
142 /* Walk the radix tree given by "tree", looking for a leaf node that is a */
146 ipf_rx_find_addr(ipf_rdx_node_t *tree, u_32_t *addr)
150 for (cur = tree; cur->index >= 0;) {
165 /* added to the tree. */
166 /* Paramters: head(I) - pointer to tree head to search */
169 /* Search the radix tree for the best match to the address pointed to by */
172 /* them are considered to be part of the tree of data being stored. */
235 /* added to the tree. */
236 /* Paramters: head(I) - pointer to tree head to search */
241 /* is to see if a given key is in the tree, not to see if a route exists. */
256 * It is possible to find a matching address in the tree but for the
284 /* Parameters: node(I) - pointer to a radix tree node */
307 /* added to the tree. */
308 /* Paramters: head(I) - pointer to tree head to add nodes to */
312 /* Add the new radix tree entry that owns nodes[] to the tree given by head.*/
367 * Walk through the tree and look for the correct place to attach
372 * added higher up the tree even if there are lower branches.
405 * Find the node up the tree with the largest pattern that still
476 /* added to the tree. */
477 /* Paramters: head(I) - pointer to tree head to search */
480 /* nodes(I) - radix tree data nodes inside allocate structure */
482 /* Attempt to add a node to the radix tree. The key for the node is the */
487 /* be promoted further up the tree. */
489 /* the key material (addr,mask) and the radix tree nodes[]. */
491 /* The mechanics of inserting the node into the tree is handled by the */
556 /* the tree. */
557 /* Paramters: head(I) - pointer to tree head to search */
561 /* Search for an entry in the radix tree that is an exact match for (addr, */
563 /* a unique key, the tree structure itself is not changed - only the list */
594 * the previous node on the list (rather than tree)
605 * to other tree nodes need to be preserved and
623 * Remove the node from the tree and reconnect the subtree
627 * If there is a tree to the left, look for something to
735 /* Paramters: head(I) - pointer to tree head to search */
736 /* walker(I) - function to call for each node in the tree */
740 /* A standard tree walking function except that it is iterative, rather */
781 /* headp(O) - location for where to store allocated tree head */
783 /* This function allocates and initialises a radix tree head structure. */
784 /* As a traditional radix tree, node 0 is used as the "0" sentinel and node */
786 /* which the tree is hung with node "0" on its left and node "2" to the */
839 /* Paramters: head(I) - pointer to tree head to free */
841 /* This function simply free's up the radix tree head. Prior to calling */
842 /* this function, it is expected that the tree will have been emptied. */