| /net/netfilter/ |
| D | nft_set_rbtree.c | 65 const struct rb_node *parent; in __nft_rbtree_lookup() local
68 parent = rcu_dereference_raw(priv->root.rb_node); in __nft_rbtree_lookup()
69 while (parent != NULL) { in __nft_rbtree_lookup()
73 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_lookup()
77 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
85 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
88 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
98 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
144 const struct rb_node *parent; in __nft_rbtree_get() local
148 parent = rcu_dereference_raw(priv->root.rb_node); in __nft_rbtree_get()
[all …]
|
| D | nf_conncount.c | 309 struct rb_node **rbnode, *parent; in insert_tree() local
318 parent = NULL; in insert_tree()
324 parent = *rbnode; in insert_tree()
377 rb_link_node_rcu(&rbconn->node, parent, rbnode); in insert_tree()
392 struct rb_node *parent; in count_tree() local
400 parent = rcu_dereference_raw(root->rb_node); in count_tree()
401 while (parent) { in count_tree()
404 rbconn = rb_entry(parent, struct nf_conncount_rb, node); in count_tree()
408 parent = rcu_dereference_raw(parent->rb_left); in count_tree()
410 parent = rcu_dereference_raw(parent->rb_right); in count_tree()
|
| /net/sched/ |
| D | sch_htb.c | 109 struct htb_class *parent; /* parent class */ member
277 struct rb_node **p = &root->rb_node, *parent = NULL; in htb_add_to_id_tree() local
281 parent = *p; in htb_add_to_id_tree()
282 c = rb_entry(parent, struct htb_class, node[prio]); in htb_add_to_id_tree()
285 p = &parent->rb_right; in htb_add_to_id_tree()
287 p = &parent->rb_left; in htb_add_to_id_tree()
289 rb_link_node(&cl->node[prio], parent, p); in htb_add_to_id_tree()
303 struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL; in htb_add_to_wait_tree() local
315 parent = *p; in htb_add_to_wait_tree()
316 c = rb_entry(parent, struct htb_class, pq_node); in htb_add_to_wait_tree()
[all …]
|
| D | sch_fq.c | 165 struct rb_node **p = &q->delayed.rb_node, *parent = NULL; in fq_flow_set_throttled() local
170 parent = *p; in fq_flow_set_throttled()
171 aux = rb_entry(parent, struct fq_flow, rate_node); in fq_flow_set_throttled()
173 p = &parent->rb_right; in fq_flow_set_throttled()
175 p = &parent->rb_left; in fq_flow_set_throttled()
177 rb_link_node(&f->rate_node, parent, p); in fq_flow_set_throttled()
206 struct rb_node **p, *parent; in fq_gc() local
210 parent = NULL; in fq_gc()
212 parent = *p; in fq_gc()
214 f = rb_entry(parent, struct fq_flow, fq_node); in fq_gc()
[all …]
|
| D | sch_hfsc.c | 189 struct rb_node *parent = NULL; in eltree_insert() local
193 parent = *p; in eltree_insert()
194 cl1 = rb_entry(parent, struct hfsc_class, el_node); in eltree_insert()
196 p = &parent->rb_right; in eltree_insert()
198 p = &parent->rb_left; in eltree_insert()
200 rb_link_node(&cl->el_node, parent, p); in eltree_insert()
254 struct rb_node *parent = NULL; in vttree_insert() local
258 parent = *p; in vttree_insert()
259 cl1 = rb_entry(parent, struct hfsc_class, vt_node); in vttree_insert()
261 p = &parent->rb_right; in vttree_insert()
[all …]
|
| D | cls_api.c | 1061 u32 *parent, int ifindex, bool rtnl_held, in __tcf_qdisc_find() argument
1081 if (!*parent) { in __tcf_qdisc_find()
1083 *parent = (*q)->handle; in __tcf_qdisc_find()
1085 *q = qdisc_lookup_rcu(dev, TC_H_MAJ(*parent)); in __tcf_qdisc_find()
1135 static int __tcf_qdisc_cl_find(struct Qdisc *q, u32 parent, unsigned long *cl, in __tcf_qdisc_cl_find() argument
1142 if (TC_H_MIN(parent)) { in __tcf_qdisc_cl_find()
1145 *cl = cops->find(q, parent); in __tcf_qdisc_cl_find()
1230 u32 *parent, unsigned long *cl, in tcf_block_find() argument
1239 err = __tcf_qdisc_find(net, q, parent, ifindex, true, extack); in tcf_block_find()
1243 err = __tcf_qdisc_cl_find(*q, *parent, cl, ifindex, extack); in tcf_block_find()
[all …]
|
| D | sch_ingress.c | 34 unsigned long parent, u32 classid) in ingress_bind_filter() argument
82 if (sch->parent != TC_H_INGRESS) in ingress_init()
100 if (sch->parent != TC_H_INGRESS) in ingress_destroy()
166 unsigned long parent, u32 classid) in clsact_bind_filter() argument
221 if (sch->parent != TC_H_CLSACT) in clsact_init()
251 if (sch->parent != TC_H_CLSACT) in clsact_destroy()
|
| D | sch_red.c | 156 .parent = sch->parent, in red_offload()
294 .parent = sch->parent, in red_dump_offload_stats()
346 .parent = sch->parent, in red_dump_stats()
378 .parent = sch->parent, in red_graft_offload()
|
| D | sch_prio.c | 147 .parent = sch->parent, in prio_offload()
252 .parent = sch->parent, in prio_dump_offload()
307 graft_offload.parent = sch->parent; in prio_graft()
337 static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid) in prio_bind() argument
|
| D | sch_etf.c | 166 struct rb_node **p = &q->head.rb_root.rb_node, *parent = NULL; in etf_enqueue_timesortedlist() local
179 parent = *p; in etf_enqueue_timesortedlist()
180 skb = rb_to_skb(parent); in etf_enqueue_timesortedlist()
182 p = &parent->rb_right; in etf_enqueue_timesortedlist()
185 p = &parent->rb_left; in etf_enqueue_timesortedlist()
188 rb_link_node(&nskb->rbnode, parent, p); in etf_enqueue_timesortedlist()
|
| /net/bluetooth/rfcomm/ |
| D | sock.c | 66 struct sock *sk = d->owner, *parent; in rfcomm_sk_state_change() local
82 parent = bt_sk(sk)->parent; in rfcomm_sk_state_change()
83 if (parent) { in rfcomm_sk_state_change()
88 parent->sk_data_ready(parent); in rfcomm_sk_state_change()
99 if (parent && sock_flag(sk, SOCK_ZAPPED)) { in rfcomm_sk_state_change()
176 static void rfcomm_sock_cleanup_listen(struct sock *parent) in rfcomm_sock_cleanup_listen() argument
180 BT_DBG("parent %p", parent); in rfcomm_sock_cleanup_listen()
183 while ((sk = bt_accept_dequeue(parent, NULL))) { in rfcomm_sock_cleanup_listen()
188 parent->sk_state = BT_CLOSED; in rfcomm_sock_cleanup_listen()
189 sock_set_flag(parent, SOCK_ZAPPED); in rfcomm_sock_cleanup_listen()
[all …]
|
| /net/ipv4/ |
| D | inetpeer.c | 106 struct rb_node **pp, *parent, *next; in lookup() local
110 parent = NULL; in lookup()
117 parent = next; in lookup()
118 p = rb_entry(parent, struct inet_peer, rb_node); in lookup()
136 *parent_p = parent; in lookup()
191 struct rb_node **pp, *parent; in inet_getpeer() local
200 p = lookup(daddr, base, seq, NULL, &gc_cnt, &parent, &pp); in inet_getpeer()
214 parent = NULL; in inet_getpeer()
218 p = lookup(daddr, base, seq, gc_stack, &gc_cnt, &parent, &pp); in inet_getpeer()
234 rb_link_node(&p->rb_node, parent, pp); in inet_getpeer()
|
| D | inet_fragment.c | 375 struct rb_node **rbn, *parent; in inet_frag_queue_insert() local
382 parent = *rbn; in inet_frag_queue_insert()
383 curr = rb_to_skb(parent); in inet_frag_queue_insert()
387 rbn = &parent->rb_left; in inet_frag_queue_insert()
389 rbn = &parent->rb_right; in inet_frag_queue_insert()
400 rb_link_node(&skb->rbnode, parent, rbn); in inet_frag_queue_insert()
411 struct sk_buff *parent) in inet_frag_reasm_prepare() argument
423 FRAG_CB(parent)->next_frag = fp; in inet_frag_reasm_prepare()
|
| /net/bluetooth/ |
| D | l2cap_sock.c | 45 static void l2cap_sock_init(struct sock *sk, struct sock *parent);
48 static void l2cap_sock_cleanup_listen(struct sock *parent);
1246 static void l2cap_sock_cleanup_listen(struct sock *parent) in l2cap_sock_cleanup_listen() argument
1250 BT_DBG("parent %p state %s", parent, in l2cap_sock_cleanup_listen()
1251 state_to_string(parent->sk_state)); in l2cap_sock_cleanup_listen()
1254 while ((sk = bt_accept_dequeue(parent, NULL))) { in l2cap_sock_cleanup_listen()
1274 struct sock *sk, *parent = chan->data; in l2cap_sock_new_connection_cb() local
1276 lock_sock(parent); in l2cap_sock_new_connection_cb()
1279 if (sk_acceptq_is_full(parent)) { in l2cap_sock_new_connection_cb()
1280 BT_DBG("backlog full %d", parent->sk_ack_backlog); in l2cap_sock_new_connection_cb()
[all …]
|
| D | af_bluetooth.c | 157 void bt_accept_enqueue(struct sock *parent, struct sock *sk, bool bh) in bt_accept_enqueue() argument
159 BT_DBG("parent %p, sk %p", parent, sk); in bt_accept_enqueue()
168 list_add_tail(&bt_sk(sk)->accept_q, &bt_sk(parent)->accept_q); in bt_accept_enqueue()
169 bt_sk(sk)->parent = parent; in bt_accept_enqueue()
176 parent->sk_ack_backlog++; in bt_accept_enqueue()
188 bt_sk(sk)->parent->sk_ack_backlog--; in bt_accept_unlink()
189 bt_sk(sk)->parent = NULL; in bt_accept_unlink()
194 struct sock *bt_accept_dequeue(struct sock *parent, struct socket *newsock) in bt_accept_dequeue() argument
199 BT_DBG("parent %p", parent); in bt_accept_dequeue()
202 list_for_each_entry_safe(s, n, &bt_sk(parent)->accept_q, accept_q) { in bt_accept_dequeue()
[all …]
|
| D | sco.c | 210 struct sock *parent) in __sco_chan_add() argument
217 if (parent) in __sco_chan_add()
218 bt_accept_enqueue(parent, sk, true); in __sco_chan_add()
222 struct sock *parent) in sco_chan_add() argument
230 __sco_chan_add(conn, sk, parent); in sco_chan_add()
372 static void sco_sock_cleanup_listen(struct sock *parent) in sco_sock_cleanup_listen() argument
376 BT_DBG("parent %p", parent); in sco_sock_cleanup_listen()
379 while ((sk = bt_accept_dequeue(parent, NULL))) { in sco_sock_cleanup_listen()
384 parent->sk_state = BT_CLOSED; in sco_sock_cleanup_listen()
385 sock_set_flag(parent, SOCK_ZAPPED); in sco_sock_cleanup_listen()
[all …]
|
| /net/sunrpc/ |
| D | rpc_pipe.c | 630 static struct dentry *__rpc_lookup_create_exclusive(struct dentry *parent, in __rpc_lookup_create_exclusive() argument
634 struct dentry *dentry = d_hash_and_lookup(parent, &q); in __rpc_lookup_create_exclusive()
636 dentry = d_alloc(parent, &q); in __rpc_lookup_create_exclusive()
649 static void __rpc_depopulate(struct dentry *parent, in __rpc_depopulate() argument
653 struct inode *dir = d_inode(parent); in __rpc_depopulate()
661 dentry = d_hash_and_lookup(parent, &name); in __rpc_depopulate()
681 static void rpc_depopulate(struct dentry *parent, in rpc_depopulate() argument
685 struct inode *dir = d_inode(parent); in rpc_depopulate()
688 __rpc_depopulate(parent, files, start, eof); in rpc_depopulate()
692 static int rpc_populate(struct dentry *parent, in rpc_populate() argument
[all …]
|
| /net/rxrpc/ |
| D | call_accept.c | 112 struct rb_node *parent, **pp; in rxrpc_service_prealloc_one() local
116 parent = NULL; in rxrpc_service_prealloc_one()
118 parent = *pp; in rxrpc_service_prealloc_one()
119 xcall = rb_entry(parent, struct rxrpc_call, sock_node); in rxrpc_service_prealloc_one()
133 rb_link_node(&call->sock_node, parent, pp); in rxrpc_service_prealloc_one()
475 struct rb_node *parent, **pp; in rxrpc_accept_call() local
493 parent = NULL; in rxrpc_accept_call()
495 parent = *pp; in rxrpc_accept_call()
496 call = rb_entry(parent, struct rxrpc_call, sock_node); in rxrpc_accept_call()
531 parent = NULL; in rxrpc_accept_call()
[all …]
|
| D | conn_service.c | 69 struct rb_node **pp, *parent; in rxrpc_publish_service_conn() local
74 parent = NULL; in rxrpc_publish_service_conn()
76 parent = *pp; in rxrpc_publish_service_conn()
77 cursor = rb_entry(parent, in rxrpc_publish_service_conn()
88 rb_link_node_rcu(&conn->service_node, parent, pp); in rxrpc_publish_service_conn()
|
| /net/802/ |
| D | garp.c | 150 struct rb_node *parent = app->gid.rb_node; in garp_attr_lookup() local
154 while (parent) { in garp_attr_lookup()
155 attr = rb_entry(parent, struct garp_attr, node); in garp_attr_lookup()
158 parent = parent->rb_left; in garp_attr_lookup()
160 parent = parent->rb_right; in garp_attr_lookup()
170 struct rb_node *parent = NULL, **p = &app->gid.rb_node; in garp_attr_create() local
175 parent = *p; in garp_attr_create()
176 attr = rb_entry(parent, struct garp_attr, node); in garp_attr_create()
179 p = &parent->rb_left; in garp_attr_create()
181 p = &parent->rb_right; in garp_attr_create()
[all …]
|
| D | mrp.c | 239 struct rb_node *parent = app->mad.rb_node; in mrp_attr_lookup() local
243 while (parent) { in mrp_attr_lookup()
244 attr = rb_entry(parent, struct mrp_attr, node); in mrp_attr_lookup()
247 parent = parent->rb_left; in mrp_attr_lookup()
249 parent = parent->rb_right; in mrp_attr_lookup()
259 struct rb_node *parent = NULL, **p = &app->mad.rb_node; in mrp_attr_create() local
264 parent = *p; in mrp_attr_create()
265 attr = rb_entry(parent, struct mrp_attr, node); in mrp_attr_create()
268 p = &parent->rb_left; in mrp_attr_create()
270 p = &parent->rb_right; in mrp_attr_create()
[all …]
|
| /net/ceph/ |
| D | string_table.c | 14 struct rb_node **p, *parent; in ceph_find_or_create_string() local
51 parent = NULL; in ceph_find_or_create_string()
55 parent = *p; in ceph_find_or_create_string()
68 rb_link_node(&cs->node, parent, p); in ceph_find_or_create_string()
|
| /net/core/ |
| D | netclassid_cgroup.c | 43 struct cgroup_cls_state *parent = css_cls_state(css->parent); in cgrp_css_online() local
45 if (parent) in cgrp_css_online()
46 cs->classid = parent->classid; in cgrp_css_online()
|
| /net/nfc/ |
| D | llcp_sock.c | 383 sk_acceptq_removed(llcp_sock->parent); in nfc_llcp_accept_unlink()
384 llcp_sock->parent = NULL; in nfc_llcp_accept_unlink()
389 void nfc_llcp_accept_enqueue(struct sock *parent, struct sock *sk) in nfc_llcp_accept_enqueue() argument
392 struct nfc_llcp_sock *llcp_sock_parent = nfc_llcp_sock(parent); in nfc_llcp_accept_enqueue()
399 llcp_sock->parent = parent; in nfc_llcp_accept_enqueue()
400 sk_acceptq_added(parent); in nfc_llcp_accept_enqueue()
403 struct sock *nfc_llcp_accept_dequeue(struct sock *parent, in nfc_llcp_accept_dequeue() argument
409 llcp_parent = nfc_llcp_sock(parent); in nfc_llcp_accept_dequeue()
433 sk_acceptq_removed(parent); in nfc_llcp_accept_dequeue()
532 static inline __poll_t llcp_accept_poll(struct sock *parent) in llcp_accept_poll() argument
[all …]
|
| /net/dsa/ |
| D | dsa.c | 142 static struct device *dev_find_class(struct device *parent, char *class) in dev_find_class() argument
144 if (dev_is_class(parent, class)) { in dev_find_class()
145 get_device(parent); in dev_find_class()
146 return parent; in dev_find_class()
149 return device_find_child(parent, class, dev_is_class); in dev_find_class()
|