| /net/netfilter/ |
| D | nft_set_rbtree.c | 62 const struct rb_node *parent; in __nft_rbtree_lookup() local
65 parent = rcu_dereference_raw(priv->root.rb_node); in __nft_rbtree_lookup()
66 while (parent != NULL) { in __nft_rbtree_lookup()
70 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_lookup()
74 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
82 parent = rcu_dereference_raw(parent->rb_right); in __nft_rbtree_lookup()
85 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
95 parent = rcu_dereference_raw(parent->rb_left); in __nft_rbtree_lookup()
142 const struct rb_node *parent; in __nft_rbtree_get() local
146 parent = rcu_dereference_raw(priv->root.rb_node); in __nft_rbtree_get()
[all …]
|
| D | nf_conncount.c | 320 struct rb_node **rbnode, *parent; in insert_tree() local
329 parent = NULL; in insert_tree()
335 parent = *rbnode; in insert_tree()
388 rb_link_node_rcu(&rbconn->node, parent, rbnode); in insert_tree()
403 struct rb_node *parent; in count_tree() local
411 parent = rcu_dereference_raw(root->rb_node); in count_tree()
412 while (parent) { in count_tree()
415 rbconn = rb_entry(parent, struct nf_conncount_rb, node); in count_tree()
419 parent = rcu_dereference_raw(parent->rb_left); in count_tree()
421 parent = rcu_dereference_raw(parent->rb_right); in count_tree()
|
| /net/devlink/ |
| D | rate.c | 127 if (devlink_rate->parent) in devlink_nl_rate_fill()
129 devlink_rate->parent->name)) in devlink_nl_rate_fill()
244 struct devlink_rate *parent) in devlink_rate_is_parent_node() argument
246 while (parent) { in devlink_rate_is_parent_node()
247 if (parent == devlink_rate) in devlink_rate_is_parent_node()
249 parent = parent->parent; in devlink_rate_is_parent_node()
263 struct devlink_rate *parent; in devlink_nl_rate_parent_node_set() local
266 parent = devlink_rate->parent; in devlink_nl_rate_parent_node_set()
268 if (parent && !len) { in devlink_nl_rate_parent_node_set()
280 refcount_dec(&parent->refcnt); in devlink_nl_rate_parent_node_set()
[all …]
|
| /net/sched/ |
| D | sch_htb.c | 108 struct htb_class *parent; /* parent class */ member
290 struct rb_node **p = &root->rb_node, *parent = NULL; in htb_add_to_id_tree() local
294 parent = *p; in htb_add_to_id_tree()
295 c = rb_entry(parent, struct htb_class, node[prio]); in htb_add_to_id_tree()
298 p = &parent->rb_right; in htb_add_to_id_tree()
300 p = &parent->rb_left; in htb_add_to_id_tree()
302 rb_link_node(&cl->node[prio], parent, p); 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() local
331 parent = *p; in htb_add_to_wait_tree()
332 c = rb_entry(parent, struct htb_class, pq_node); in htb_add_to_wait_tree()
[all …]
|
| D | sch_fq.c | 181 struct rb_node **p = &q->delayed.rb_node, *parent = NULL; in fq_flow_set_throttled() local
186 parent = *p; in fq_flow_set_throttled()
187 aux = rb_entry(parent, struct fq_flow, rate_node); in fq_flow_set_throttled()
189 p = &parent->rb_right; in fq_flow_set_throttled()
191 p = &parent->rb_left; in fq_flow_set_throttled()
193 rb_link_node(&f->rate_node, parent, p); in fq_flow_set_throttled()
221 struct rb_node **p, *parent; in fq_gc() local
227 parent = NULL; in fq_gc()
229 parent = *p; in fq_gc()
231 f = rb_entry(parent, struct fq_flow, fq_node); in fq_gc()
[all …]
|
| D | sch_hfsc.c | 188 struct rb_node *parent = NULL; in eltree_insert() local
192 parent = *p; in eltree_insert()
193 cl1 = rb_entry(parent, struct hfsc_class, el_node); in eltree_insert()
195 p = &parent->rb_right; in eltree_insert()
197 p = &parent->rb_left; in eltree_insert()
199 rb_link_node(&cl->el_node, parent, p); in eltree_insert()
253 struct rb_node *parent = NULL; in vttree_insert() local
257 parent = *p; in vttree_insert()
258 cl1 = rb_entry(parent, struct hfsc_class, vt_node); in vttree_insert()
260 p = &parent->rb_right; in vttree_insert()
[all …]
|
| D | sch_fifo.c | 65 qopt.parent = sch->parent; in fifo_offload_init()
79 qopt.parent = sch->parent; in fifo_offload_destroy()
89 qopt.parent = sch->parent; in fifo_offload_dump()
|
| D | cls_api.c | 1150 u32 *parent, int ifindex, bool rtnl_held, in __tcf_qdisc_find() argument
1170 if (!*parent) { in __tcf_qdisc_find()
1172 *parent = (*q)->handle; in __tcf_qdisc_find()
1174 *q = qdisc_lookup_rcu(dev, TC_H_MAJ(*parent)); in __tcf_qdisc_find()
1224 static int __tcf_qdisc_cl_find(struct Qdisc *q, u32 parent, unsigned long *cl, in __tcf_qdisc_cl_find() argument
1231 if (TC_H_MIN(parent)) { in __tcf_qdisc_cl_find()
1234 *cl = cops->find(q, parent); in __tcf_qdisc_cl_find()
1319 u32 *parent, unsigned long *cl, in tcf_block_find() argument
1328 err = __tcf_qdisc_find(net, q, parent, ifindex, true, extack); in tcf_block_find()
1332 err = __tcf_qdisc_cl_find(*q, *parent, cl, ifindex, extack); in tcf_block_find()
[all …]
|
| D | sch_ingress.c | 35 unsigned long parent, u32 classid) in ingress_bind_filter() argument
86 if (sch->parent != TC_H_INGRESS) in ingress_init()
118 if (sch->parent != TC_H_INGRESS) in ingress_destroy()
193 unsigned long parent, u32 classid) in clsact_bind_filter() argument
250 if (sch->parent != TC_H_CLSACT) in clsact_init()
297 if (sch->parent != TC_H_CLSACT) in clsact_destroy()
|
| D | sch_prio.c | 145 .parent = sch->parent, in prio_offload()
250 .parent = sch->parent, in prio_dump_offload()
305 graft_offload.parent = sch->parent; in prio_graft()
335 static unsigned long prio_bind(struct Qdisc *sch, unsigned long parent, u32 classid) in prio_bind() argument
|
| D | sch_tbf.c | 153 qopt.parent = sch->parent; in tbf_offload_change()
171 qopt.parent = sch->parent; in tbf_offload_destroy()
181 qopt.parent = sch->parent; in tbf_offload_dump()
193 .parent = sch->parent, in tbf_offload_graft()
|
| /net/bluetooth/rfcomm/ |
| D | sock.c | 66 struct sock *sk = d->owner, *parent; in rfcomm_sk_state_change() local
80 parent = bt_sk(sk)->parent; in rfcomm_sk_state_change()
81 if (parent) { in rfcomm_sk_state_change()
86 parent->sk_data_ready(parent); in rfcomm_sk_state_change()
96 if (parent && sock_flag(sk, SOCK_ZAPPED)) { in rfcomm_sk_state_change()
173 static void rfcomm_sock_cleanup_listen(struct sock *parent) in rfcomm_sock_cleanup_listen() argument
177 BT_DBG("parent %p", parent); in rfcomm_sock_cleanup_listen()
180 while ((sk = bt_accept_dequeue(parent, NULL))) { in rfcomm_sock_cleanup_listen()
185 parent->sk_state = BT_CLOSED; in rfcomm_sock_cleanup_listen()
186 sock_set_flag(parent, SOCK_ZAPPED); in rfcomm_sock_cleanup_listen()
[all …]
|
| /net/bluetooth/ |
| D | iso.c | 167 struct sock *parent; in iso_chan_del() local
186 parent = bt_sk(sk)->parent; in iso_chan_del()
187 if (parent) { in iso_chan_del()
189 parent->sk_data_ready(parent); in iso_chan_del()
211 struct sock *parent; in iso_conn_del() local
234 parent = iso_get_sock_listen(&hcon->src, in iso_conn_del()
239 if (parent) { in iso_conn_del()
241 &iso_pi(parent)->flags); in iso_conn_del()
242 sock_put(parent); in iso_conn_del()
260 struct sock *parent) in __iso_chan_add() argument
[all …]
|
| D | af_bluetooth.c | 188 void bt_accept_enqueue(struct sock *parent, struct sock *sk, bool bh) in bt_accept_enqueue() argument
193 BT_DBG("parent %p, sk %p", parent, sk); in bt_accept_enqueue()
202 list_add_tail(&bt_sk(sk)->accept_q, &bt_sk(parent)->accept_q); in bt_accept_enqueue()
203 bt_sk(sk)->parent = parent; in bt_accept_enqueue()
211 sk->sk_peer_pid = get_pid(parent->sk_peer_pid); in bt_accept_enqueue()
212 sk->sk_peer_cred = get_cred(parent->sk_peer_cred); in bt_accept_enqueue()
223 sk_acceptq_added(parent); in bt_accept_enqueue()
235 sk_acceptq_removed(bt_sk(sk)->parent); in bt_accept_unlink()
236 bt_sk(sk)->parent = NULL; in bt_accept_unlink()
241 struct sock *bt_accept_dequeue(struct sock *parent, struct socket *newsock) in bt_accept_dequeue() argument
[all …]
|
| D | l2cap_sock.c | 46 static void l2cap_sock_init(struct sock *sk, struct sock *parent);
49 static void l2cap_sock_cleanup_listen(struct sock *parent);
1440 static void l2cap_sock_cleanup_listen(struct sock *parent) in l2cap_sock_cleanup_listen() argument
1444 BT_DBG("parent %p state %s", parent, in l2cap_sock_cleanup_listen()
1445 state_to_string(parent->sk_state)); in l2cap_sock_cleanup_listen()
1448 while ((sk = bt_accept_dequeue(parent, NULL))) { in l2cap_sock_cleanup_listen()
1468 struct sock *sk, *parent = chan->data; in l2cap_sock_new_connection_cb() local
1470 lock_sock(parent); in l2cap_sock_new_connection_cb()
1473 if (sk_acceptq_is_full(parent)) { in l2cap_sock_new_connection_cb()
1474 BT_DBG("backlog full %d", parent->sk_ack_backlog); in l2cap_sock_new_connection_cb()
[all …]
|
| D | sco.c | 218 struct sock *parent) in __sco_chan_add() argument
225 if (parent) in __sco_chan_add()
226 bt_accept_enqueue(parent, sk, true); in __sco_chan_add()
230 struct sock *parent) in sco_chan_add() argument
238 __sco_chan_add(conn, sk, parent); in sco_chan_add()
401 static void sco_sock_cleanup_listen(struct sock *parent) in sco_sock_cleanup_listen() argument
405 BT_DBG("parent %p", parent); in sco_sock_cleanup_listen()
408 while ((sk = bt_accept_dequeue(parent, NULL))) { in sco_sock_cleanup_listen()
413 parent->sk_state = BT_CLOSED; in sco_sock_cleanup_listen()
414 sock_set_flag(parent, SOCK_ZAPPED); in sco_sock_cleanup_listen()
[all …]
|
| /net/ipv4/ |
| D | inetpeer.c | 99 struct rb_node **pp, *parent, *next; in lookup() local
103 parent = NULL; in lookup()
110 parent = next; in lookup()
111 p = rb_entry(parent, struct inet_peer, rb_node); in lookup()
129 *parent_p = parent; in lookup()
184 struct rb_node **pp, *parent; in inet_getpeer() local
193 p = lookup(daddr, base, seq, NULL, &gc_cnt, &parent, &pp); in inet_getpeer()
207 parent = NULL; in inet_getpeer()
211 p = lookup(daddr, base, seq, gc_stack, &gc_cnt, &parent, &pp); in inet_getpeer()
227 rb_link_node(&p->rb_node, parent, pp); in inet_getpeer()
|
| /net/sunrpc/ |
| D | rpc_pipe.c | 631 static struct dentry *__rpc_lookup_create_exclusive(struct dentry *parent, in __rpc_lookup_create_exclusive() argument
635 struct dentry *dentry = d_hash_and_lookup(parent, &q); in __rpc_lookup_create_exclusive()
637 dentry = d_alloc(parent, &q); in __rpc_lookup_create_exclusive()
650 static void __rpc_depopulate(struct dentry *parent, in __rpc_depopulate() argument
654 struct inode *dir = d_inode(parent); in __rpc_depopulate()
662 dentry = d_hash_and_lookup(parent, &name); in __rpc_depopulate()
682 static void rpc_depopulate(struct dentry *parent, in rpc_depopulate() argument
686 struct inode *dir = d_inode(parent); in rpc_depopulate()
689 __rpc_depopulate(parent, files, start, eof); in rpc_depopulate()
693 static int rpc_populate(struct dentry *parent, in rpc_populate() argument
[all …]
|
| /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/rxrpc/ |
| 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/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()
|
| D | dev_addr_lists.c | 24 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_insert() local
35 parent = *ins_point; in __hw_addr_insert()
37 ins_point = &parent->rb_left; in __hw_addr_insert()
39 ins_point = &parent->rb_right; in __hw_addr_insert()
44 rb_link_node_rcu(&new->node, parent, ins_point); in __hw_addr_insert()
78 struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL; in __hw_addr_add_ex() local
92 parent = *ins_point; in __hw_addr_add_ex()
94 ins_point = &parent->rb_left; in __hw_addr_add_ex()
96 ins_point = &parent->rb_right; in __hw_addr_add_ex()
122 rb_link_node(&ha->node, parent, ins_point); in __hw_addr_add_ex()
|
| /net/nfc/ |
| D | llcp_sock.c | 388 sk_acceptq_removed(llcp_sock->parent); in nfc_llcp_accept_unlink()
389 llcp_sock->parent = NULL; in nfc_llcp_accept_unlink()
394 void nfc_llcp_accept_enqueue(struct sock *parent, struct sock *sk) in nfc_llcp_accept_enqueue() argument
397 struct nfc_llcp_sock *llcp_sock_parent = nfc_llcp_sock(parent); in nfc_llcp_accept_enqueue()
404 llcp_sock->parent = parent; in nfc_llcp_accept_enqueue()
405 sk_acceptq_added(parent); in nfc_llcp_accept_enqueue()
408 struct sock *nfc_llcp_accept_dequeue(struct sock *parent, in nfc_llcp_accept_dequeue() argument
414 llcp_parent = nfc_llcp_sock(parent); in nfc_llcp_accept_dequeue()
438 sk_acceptq_removed(parent); in nfc_llcp_accept_dequeue()
537 static inline __poll_t llcp_accept_poll(struct sock *parent) in llcp_accept_poll() argument
[all …]
|