Lines Matching refs:node
178 struct rb_node *node = root->rb_node;
180 while (node) {
181 struct tag_node *data = rb_entry(node, struct tag_node, node);
184 " node=%p data=%p\n", tag, node, data);
190 node = node->rb_left;
192 node = node->rb_right;
203 /* Figure out where to put new node */
206 node);
221 /* Add new node and rebalance tree. */
222 rb_link_node(&data->node, parent, new);
223 rb_insert_color(&data->node, root);
233 struct tag_node *node = tag_node_tree_search(root, tag);
234 if (!node)
236 return rb_entry(&node->node, struct tag_stat, tn.node);
248 struct tag_node *node = tag_node_tree_search(root, tag);
249 if (!node)
251 return rb_entry(&node->node, struct tag_counter_set, tn.node);
262 struct tag_node *node = tag_node_tree_search(root, tag);
263 if (!node)
265 return rb_entry(&node->node, struct tag_ref, tn.node);
271 struct rb_node *node = root->rb_node;
273 while (node) {
274 struct sock_tag *data = rb_entry(node, struct sock_tag,
277 node = node->rb_left;
279 node = node->rb_right;
290 /* Figure out where to put new node */
303 /* Add new node and rebalance tree. */
310 struct rb_node *node;
313 node = rb_first(st_to_free_tree);
314 while (node) {
315 st_entry = rb_entry(node, struct sock_tag, sock_node);
316 node = rb_next(node);
331 struct rb_node *node = root->rb_node;
333 while (node) {
334 struct proc_qtu_data *data = rb_entry(node,
336 node);
338 node = node->rb_left;
340 node = node->rb_right;
352 /* Figure out where to put new node */
356 node);
366 /* Add new node and rebalance tree. */
367 rb_link_node(&data->node, parent, new);
368 rb_insert_color(&data->node, root);
376 /* Figure out where to put new node */
380 node);
390 /* Add new node and rebalance tree. */
391 rb_link_node(&data->node, parent, new);
392 rb_insert_color(&data->node, root);
398 struct rb_node *node = root->rb_node;
400 while (node) {
401 struct uid_tag_data *data = rb_entry(node,
403 node);
405 node = node->rb_left;
407 node = node->rb_right;
547 rb_erase(&utd_entry->node, &uid_tag_data_tree);
573 rb_erase(&tr_entry->tn.node, &utd_entry->tag_ref_tree);
581 struct rb_node *node;
588 node = rb_first(&utd_entry->tag_ref_tree);
589 while (node) {
590 tr_entry = rb_entry(node, struct tag_ref, tn.node);
591 node = rb_next(node);
1867 struct rb_node *node;
1874 node = rb_next(&sock_tag_entry->sock_node);
1875 if (!node) {
1879 sock_tag_entry = rb_entry(node, struct sock_tag, sock_node);
1890 struct rb_node *node;
1899 node = rb_first(&sock_tag_tree);
1900 if (!node) {
1904 sock_tag_entry = rb_entry(node, struct sock_tag, sock_node);
1999 struct rb_node *node;
2039 node = rb_first(&sock_tag_tree);
2040 while (node) {
2041 st_entry = rb_entry(node, struct sock_tag, sock_node);
2043 node = rb_next(node);
2083 rb_erase(&tcs_entry->tn.node, &tag_counter_set_tree);
2095 node = rb_first(&iface_entry->tag_stat_tree);
2096 while (node) {
2097 ts_entry = rb_entry(node, struct tag_stat, tn.node);
2099 node = rb_next(node);
2113 rb_erase(&ts_entry->tn.node,
2124 node = rb_first(&uid_tag_data_tree);
2125 while (node) {
2126 utd_entry = rb_entry(node, struct uid_tag_data, node);
2128 node = rb_next(node);
2636 struct rb_node *node;
2649 node = rb_first(&ppi->iface_entry->tag_stat_tree);
2651 node = rb_next(&((struct tag_stat *)v)->tn.node);
2653 while (!node) {
2657 node = rb_first(&ppi->iface_entry->tag_stat_tree);
2660 ts_entry = rb_entry(node, struct tag_stat, tn.node);
2807 rb_erase(&utd_entry->node, &uid_tag_data_tree);
2877 rb_erase(&pqd_entry->node, &proc_qtu_data_tree);