| /net/bridge/ |
| A D | br_multicast_eht.c | 47 struct rb_node *node = pg->eht_host_tree.rb_node; in br_multicast_eht_host_lookup()
54 rb_node); in br_multicast_eht_host_lookup()
83 struct rb_node *node = eht_set->entry_tree.rb_node; in br_multicast_eht_set_entry_lookup()
90 rb_node); in br_multicast_eht_set_entry_lookup()
107 struct rb_node *node = pg->eht_set_tree.rb_node; in br_multicast_eht_set_lookup()
114 rb_node); in br_multicast_eht_set_lookup()
186 rb_node); in br_multicast_del_eht_set()
203 rb_node); in br_multicast_eht_clean_sets()
255 rb_node); in __eht_lookup_create_host()
300 rb_node); in __eht_lookup_create_set_entry()
[all …]
|
| A D | br_private_mcast_eht.h | 18 struct rb_node rb_node; member
29 struct rb_node rb_node; member
42 struct rb_node rb_node; member
|
| /net/ipv4/ |
| A D | inetpeer.c | 93 struct rb_node **parent_p, in lookup()
94 struct rb_node ***pp_p) in lookup()
96 struct rb_node **pp, *parent, *next; in lookup()
100 pp = &base->rb_root.rb_node; in lookup()
109 p = rb_entry(parent, struct inet_peer, rb_node); in lookup()
163 rb_erase(&p->rb_node, &base->rb_root); in inet_peer_gc()
175 struct rb_node **pp, *parent; in inet_getpeer()
210 rb_link_node(&p->rb_node, parent, pp); in inet_getpeer()
211 rb_insert_color(&p->rb_node, &base->rb_root); in inet_getpeer()
276 struct rb_node *p = rb_first(&base->rb_root); in inetpeer_invalidate_tree()
[all …]
|
| A D | inet_fragment.c | 77 rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node); in fragrun_create()
269 struct rb_node *p = rb_first(root); in inet_frag_rbtree_purge()
414 struct rb_node **rbn, *parent; in inet_frag_queue_insert()
416 rbn = &q->rb_fragments.rb_node; in inet_frag_queue_insert()
560 struct rb_node *rbn; in inet_frag_reasm_finish()
608 struct rb_node *rbnext = rb_next(rbn); in inet_frag_reasm_finish()
|
| A D | nexthop.c | 593 struct rb_node **pp, *parent = NULL, *next; in nexthop_find_by_id()
595 pp = &net->nexthop.rb_root.rb_node; in nexthop_find_by_id()
604 nh = rb_entry(parent, struct nexthop, rb_node); in nexthop_find_by_id()
2176 rb_erase(&nh->rb_node, &net->nexthop.rb_root); in remove_nexthop()
2570 struct rb_node **pp, *parent = NULL, *next; in insert_nexthop()
2578 pp = &root->rb_node; in insert_nexthop()
2638 rb_insert_color(&new_nh->rb_node, root); in insert_nexthop()
2685 struct rb_node *node; in flush_all_nexthops()
2689 nh = rb_entry(node, struct nexthop, rb_node); in flush_all_nexthops()
3509 struct rb_node *node; in rtm_dump_walk_nexthops()
[all …]
|
| /net/netfilter/ |
| A D | nft_set_rbtree.c | 27 struct rb_node node;
62 const struct rb_node *parent; in __nft_rbtree_lookup()
140 const struct rb_node *parent; in __nft_rbtree_get()
291 struct rb_node *first) in nft_rbtree_update_first()
322 p = &priv->root.rb_node; in __nft_rbtree_insert()
463 p = &priv->root.rb_node; in __nft_rbtree_insert()
551 const struct rb_node *parent = priv->root.rb_node; in nft_rbtree_deactivate()
593 struct rb_node *node; in nft_rbtree_walk()
627 struct rb_node *node, *next; in nft_rbtree_gc()
709 struct rb_node *node; in nft_rbtree_destroy()
[all …]
|
| A D | nf_conncount.c | 50 struct rb_node node;
320 struct rb_node **rbnode, *parent; in insert_tree()
329 rbnode = &(root->rb_node); in insert_tree()
404 struct rb_node *parent; in count_tree()
411 parent = rcu_dereference_raw(root->rb_node); in count_tree()
460 struct rb_node *node; in tree_gc_worker()
566 struct rb_node *node; in destroy_tree()
|
| /net/rxrpc/ |
| A D | conn_service.c | 27 struct rb_node *p; in rxrpc_find_service_conn_rcu()
41 p = rcu_dereference_raw(peer->service_conns.rb_node); in rxrpc_find_service_conn_rcu()
69 struct rb_node **pp, *parent; in rxrpc_publish_service_conn()
73 pp = &peer->service_conns.rb_node; in rxrpc_publish_service_conn()
|
| A D | oob.c | 71 struct rb_node *p; in rxrpc_find_pending_oob()
74 p = rx->pending_oobq.rb_node; in rxrpc_find_pending_oob()
97 struct rb_node **pp = &rx->pending_oobq.rb_node, *p = NULL; in rxrpc_add_pending_oob()
|
| A D | call_object.c | 89 struct rb_node *p; in rxrpc_find_call_by_user_ID()
95 p = rx->calls.rb_node; in rxrpc_find_call_by_user_ID()
331 struct rb_node *parent, **pp; in rxrpc_new_client_call()
363 pp = &rx->calls.rb_node; in rxrpc_new_client_call()
|
| A D | conn_client.c | 254 struct rb_node *p, **pp, *parent; in rxrpc_look_up_bundle()
270 p = local->client_bundles.rb_node; in rxrpc_look_up_bundle()
297 pp = &local->client_bundles.rb_node; in rxrpc_look_up_bundle()
|
| /net/sched/ |
| A D | sch_hfsc.c | 192 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()
193 struct rb_node *parent = NULL; in eltree_insert()
229 struct rb_node *n; in eltree_get_mindl()
245 struct rb_node *n; in eltree_get_minel()
260 struct rb_node **p = &cl->cl_parent->vt_tree.rb_node; in vttree_insert()
261 struct rb_node *parent = NULL; in vttree_insert()
293 struct rb_node *n; in vttree_firstfit()
329 struct rb_node **p = &cl->cl_parent->cf_tree.rb_node; in cftree_insert()
330 struct rb_node *parent = NULL; in cftree_insert()
660 struct rb_node *n = rb_first(&cl->cf_tree); in update_cfmin()
[all …]
|
| A D | sch_fq.c | 222 struct rb_node **p = &q->delayed.rb_node, *parent = NULL; in fq_flow_set_throttled()
262 struct rb_node **p, *parent; in fq_gc()
267 p = &root->rb_node; in fq_gc()
358 struct rb_node **p, *parent; in fq_classify()
407 p = &root->rb_node; in fq_classify()
504 struct rb_node **p, *parent; in flow_queue_add()
519 p = &flow->t_root.rb_node; in flow_queue_add()
610 struct rb_node *p; in fq_check_throttled()
803 struct rb_node *p; in fq_reset()
840 struct rb_node *op, **np, *parent; in fq_rehash()
[all …]
|
| A D | sch_htb.c | 81 struct rb_node *ptr;
290 struct rb_node **p = &root->rb_node, *parent = NULL; in htb_add_to_id_tree()
319 struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL; in htb_add_to_wait_tree()
411 if (!hprio->row.rb_node) in htb_remove_class_from_row()
788 static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n, in htb_id_find_next_upper()
791 struct rb_node *r = NULL; in htb_id_find_next_upper()
819 struct rb_node *root; in htb_lookup_leaf()
820 struct rb_node **pptr; in htb_lookup_leaf()
824 if (unlikely(!hprio->row.rb_node)) in htb_lookup_leaf()
827 sp->root = hprio->row.rb_node; in htb_lookup_leaf()
[all …]
|
| A D | sch_etf.c | 111 struct rb_node *p; in etf_peek_timesortedlist()
166 struct rb_node **p = &q->head.rb_root.rb_node, *parent = NULL; in etf_enqueue_timesortedlist()
420 struct rb_node *p = rb_first_cached(&q->head); in timesortedlist_clear()
|
| /net/ceph/ |
| A D | string_table.c | 14 struct rb_node **p, *parent; in ceph_find_or_create_string()
19 p = &string_tree.rb_node; in ceph_find_or_create_string()
52 p = &string_tree.rb_node; in ceph_find_or_create_string()
|
| A D | debugfs.c | 60 struct rb_node *n; in osdmap_show()
143 struct rb_node *rp; in monc_show()
236 struct rb_node *n; in dump_requests()
262 struct rb_node *n; in dump_linger_requests()
323 struct rb_node *n; in dump_backoffs()
346 struct rb_node *n; in osdc_show()
|
| A D | auth_x.h | 16 struct rb_node node;
|
| /net/tipc/ |
| A D | name_table.c | 65 struct rb_node tree_node;
111 for (sr = service_range_match_first((sc)->ranges.rb_node, \ in RB_DECLARE_CALLBACKS_MAX()
128 static struct service_range *service_range_match_first(struct rb_node *n,
132 struct rb_node *l, *r;
178 static struct service_range *service_range_match_next(struct rb_node *n, in service_range_match_next()
182 struct rb_node *p, *r; in service_range_match_next()
299 struct rb_node **n, *parent = NULL; in tipc_service_create_range()
304 n = &sc->ranges.rb_node; in tipc_service_create_range()
647 sr = service_range_match_first(sc->ranges.rb_node, inst, inst); in tipc_nametbl_lookup_group()
736 struct rb_node *n; in tipc_nametbl_build_group()
[all …]
|
| A D | group.c | 64 struct rb_node tree_node;
235 struct rb_node *n = grp->members.rb_node; in tipc_group_find_member()
267 struct rb_node *n; in tipc_group_find_node()
281 struct rb_node **n, *parent = NULL; in tipc_group_add_to_tree()
284 n = &grp->members.rb_node; in tipc_group_add_to_tree()
399 struct rb_node *n; in tipc_group_update_bc_members()
|
| /net/rds/ |
| A D | cong.c | 107 struct rb_node **p = &rds_cong_tree.rb_node; in rds_cong_tree_walk()
108 struct rb_node *parent = NULL; in rds_cong_tree_walk()
401 struct rb_node *node; in rds_cong_exit()
|
| A D | rdma.c | 68 struct rb_node **p = &root->rb_node; in rds_mr_tree_walk()
69 struct rb_node *parent = NULL; in rds_mr_tree_walk()
130 struct rb_node *node; in rds_rdma_drop_keys()
|
| /net/core/ |
| A D | dev_addr_lists.c | 24 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_insert()
78 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_add_ex()
170 struct rb_node *node; in __hw_addr_lookup()
172 node = list->tree.rb_node; in __hw_addr_lookup()
|
| /net/802/ |
| A D | garp.c | 151 struct rb_node *parent = app->gid.rb_node; in garp_attr_lookup()
171 struct rb_node *parent = NULL, **p = &app->gid.rb_node; in garp_attr_create()
209 struct rb_node *node, *next; in garp_attr_destroy_all()
396 struct rb_node *node, *next; in garp_gid_event()
|
| A D | mrp.c | 240 struct rb_node *parent = app->mad.rb_node; in mrp_attr_lookup()
260 struct rb_node *parent = NULL, **p = &app->mad.rb_node; in mrp_attr_create()
298 struct rb_node *node, *next; in mrp_attr_destroy_all()
581 struct rb_node *node, *next; in mrp_mad_event()
|