Lines Matching refs:new
56 Creating a new rbtree
107 new node, then inserting the node and rebalancing ("recoloring") the tree.
110 location of the pointer on which to graft the new node. The new node also
117 struct rb_node **new = &(root->rb_node), *parent = NULL;
119 /* Figure out where to put new node */
120 while (*new) {
121 struct mytype *this = container_of(*new, struct mytype, node);
124 parent = *new;
126 new = &((*new)->rb_left);
128 new = &((*new)->rb_right);
133 /* Add new node and rebalance tree. */
134 rb_link_node(&data->node, parent, new);
156 To replace an existing node in a tree with a new one with the same key, call:
158 void rb_replace_node(struct rb_node *old, struct rb_node *new,
161 Replacing a node this way does not re-sort the tree: If the new node doesn't
199 be used to augment some new functionality to rbtree. Augmented rbtree
251 interval ranges like [lo:hi] and do a quick lookup for any overlap with a new
252 lo:hi or to find whether there is an exact match for a new lo:hi.
344 struct interval_tree_node *new =
347 new->__subtree_last = old->__subtree_last;
354 struct interval_tree_node *new =
357 new->__subtree_last = old->__subtree_last;