| /net/hsr/ |
| D | hsr_framereg.c | 62 struct hsr_node *node; in hsr_addr_is_self() local
64 node = list_first_or_null_rcu(&hsr->self_node_db, struct hsr_node, in hsr_addr_is_self()
66 if (!node) { in hsr_addr_is_self()
71 if (ether_addr_equal(addr, node->MacAddressA)) in hsr_addr_is_self()
73 if (ether_addr_equal(addr, node->MacAddressB)) in hsr_addr_is_self()
84 struct hsr_node *node; in find_node_by_AddrA() local
86 list_for_each_entry_rcu(node, node_db, mac_list) { in find_node_by_AddrA()
87 if (ether_addr_equal(node->MacAddressA, addr)) in find_node_by_AddrA()
88 return node; in find_node_by_AddrA()
102 struct hsr_node *node, *oldnode; in hsr_create_self_node() local
[all …]
|
| /net/qrtr/ |
| D | qrtr.c | 121 struct qrtr_node *node = container_of(kref, struct qrtr_node, ref); in __qrtr_node_release() local
123 if (node->nid != QRTR_EP_NID_AUTO) in __qrtr_node_release()
124 radix_tree_delete(&qrtr_nodes, node->nid); in __qrtr_node_release()
126 list_del(&node->item); in __qrtr_node_release()
129 skb_queue_purge(&node->rx_queue); in __qrtr_node_release()
130 kfree(node); in __qrtr_node_release()
134 static struct qrtr_node *qrtr_node_acquire(struct qrtr_node *node) in qrtr_node_acquire() argument
136 if (node) in qrtr_node_acquire()
137 kref_get(&node->ref); in qrtr_node_acquire()
138 return node; in qrtr_node_acquire()
[all …]
|
| /net/netfilter/ |
| D | xt_qtaguid_print.c | 294 struct rb_node *node; in prdebug_sock_tag_tree() local
310 for (node = rb_first(sock_tag_tree); in prdebug_sock_tag_tree()
311 node; in prdebug_sock_tag_tree()
312 node = rb_next(node)) { in prdebug_sock_tag_tree()
313 sock_tag_entry = rb_entry(node, struct sock_tag, sock_node); in prdebug_sock_tag_tree()
355 struct rb_node *node; in prdebug_proc_qtu_data_tree() local
370 for (node = rb_first(proc_qtu_data_tree); in prdebug_proc_qtu_data_tree()
371 node; in prdebug_proc_qtu_data_tree()
372 node = rb_next(node)) { in prdebug_proc_qtu_data_tree()
373 proc_qtu_data_entry = rb_entry(node, in prdebug_proc_qtu_data_tree()
[all …]
|
| D | nft_set_rbtree.c | 28 struct rb_node node; member
57 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in nft_rbtree_lookup()
112 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in __nft_rbtree_insert()
135 rb_link_node(&new->node, parent, p); in __nft_rbtree_insert()
136 rb_insert_color(&new->node, &priv->root); in __nft_rbtree_insert()
161 rb_erase(&rbe->node, &priv->root); in nft_rbtree_remove()
185 rbe = rb_entry(parent, struct nft_rbtree_elem, node); in nft_rbtree_deactivate()
221 struct rb_node *node; in nft_rbtree_walk() local
224 for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { in nft_rbtree_walk()
225 rbe = rb_entry(node, struct nft_rbtree_elem, node); in nft_rbtree_walk()
[all …]
|
| D | xt_qtaguid.c | 179 struct rb_node *node = root->rb_node; in tag_node_tree_search() local
181 while (node) { in tag_node_tree_search()
182 struct tag_node *data = rb_entry(node, struct tag_node, node); in tag_node_tree_search()
185 " node=%p data=%p\n", tag, node, data); in tag_node_tree_search()
191 node = node->rb_left; in tag_node_tree_search()
193 node = node->rb_right; in tag_node_tree_search()
207 node); in tag_node_tree_insert()
223 rb_link_node(&data->node, parent, new); in tag_node_tree_insert()
224 rb_insert_color(&data->node, root); in tag_node_tree_insert()
234 struct tag_node *node = tag_node_tree_search(root, tag); in tag_stat_tree_search() local
[all …]
|
| D | xt_connlimit.c | 47 struct hlist_node node; member
53 struct rb_node node; member
130 hlist_add_head(&conn->node, head); in add_hlist()
150 hlist_for_each_entry_safe(conn, n, head, node) { in check_hlist()
153 hlist_del(&conn->node); in check_hlist()
173 hlist_del(&conn->node); in check_hlist()
195 rb_erase(&rbconn->node, root); in tree_nodes_free()
221 rbconn = container_of(*rbnode, struct xt_connlimit_rb, node); in count_tree()
281 hlist_add_head(&conn->node, &rbconn->hhead); in count_tree()
283 rb_link_node(&rbconn->node, parent, rbnode); in count_tree()
[all …]
|
| /net/batman-adv/ |
| D | hash.h | 73 struct hlist_node *node, *node_tmp; in batadv_hash_delete() local
82 hlist_for_each_safe(node, node_tmp, head) { in batadv_hash_delete()
83 hlist_del_rcu(node); in batadv_hash_delete()
86 free_cb(node, arg); in batadv_hash_delete()
114 struct hlist_node *node; in batadv_hash_add() local
126 hlist_for_each(node, head) { in batadv_hash_add()
127 if (!compare(node, data)) in batadv_hash_add()
157 struct hlist_node *node; in batadv_hash_remove() local
165 hlist_for_each(node, head) { in batadv_hash_remove()
166 if (!compare(node, data)) in batadv_hash_remove()
[all …]
|
| D | multicast.c | 950 struct hlist_node *node = &orig->mcast_want_all_unsnoopables_node; in batadv_mcast_want_unsnoop_update() local
962 WARN_ON(!hlist_unhashed(node)); in batadv_mcast_want_unsnoop_update()
964 hlist_add_head_rcu(node, head); in batadv_mcast_want_unsnoop_update()
973 WARN_ON(hlist_unhashed(node)); in batadv_mcast_want_unsnoop_update()
975 hlist_del_init_rcu(node); in batadv_mcast_want_unsnoop_update()
995 struct hlist_node *node = &orig->mcast_want_all_ipv4_node; in batadv_mcast_want_ipv4_update() local
1007 WARN_ON(!hlist_unhashed(node)); in batadv_mcast_want_ipv4_update()
1009 hlist_add_head_rcu(node, head); in batadv_mcast_want_ipv4_update()
1018 WARN_ON(hlist_unhashed(node)); in batadv_mcast_want_ipv4_update()
1020 hlist_del_init_rcu(node); in batadv_mcast_want_ipv4_update()
[all …]
|
| /net/tipc/ |
| D | node.c | 155 static void tipc_node_delete(struct tipc_node *node);
159 static void tipc_node_put(struct tipc_node *node);
217 static void tipc_node_put(struct tipc_node *node) in tipc_node_put() argument
219 kref_put(&node->kref, tipc_node_kref_release); in tipc_node_put()
222 static void tipc_node_get(struct tipc_node *node) in tipc_node_get() argument
224 kref_get(&node->kref); in tipc_node_get()
233 struct tipc_node *node; in tipc_node_find() local
240 hlist_for_each_entry_rcu(node, &tn->node_htable[thash], hash) { in tipc_node_find()
241 if (node->addr != addr) in tipc_node_find()
243 if (!kref_get_unless_zero(&node->kref)) in tipc_node_find()
[all …]
|
| D | name_distr.c | 46 u32 node; member
215 publ->node, publ->ref, publ->key); in tipc_publ_purge()
223 publ->type, publ->lower, publ->node, publ->ref, in tipc_publ_purge()
240 if (e->node != addr) in tipc_dist_queue_purge()
265 u32 node, u32 dtype) in tipc_update_nametbl() argument
273 TIPC_CLUSTER_SCOPE, node, in tipc_update_nametbl()
276 tipc_node_subscribe(net, &publ->nodesub_list, node); in tipc_update_nametbl()
282 node, ntohl(i->ref), in tipc_update_nametbl()
285 tipc_node_unsubscribe(net, &publ->nodesub_list, node); in tipc_update_nametbl()
300 u32 type, u32 node) in tipc_named_add_backlog() argument
[all …]
|
| D | name_table.c | 116 u32 scope, u32 node, u32 port_ref, in publ_create() argument
129 publ->node = node; in publ_create()
231 u32 node, u32 port, u32 key) in tipc_nameseq_insert_publ() argument
253 (!publ->node || (publ->node == node))) in tipc_nameseq_insert_publ()
309 publ = publ_create(type, lower, upper, scope, node, port, key); in tipc_nameseq_insert_publ()
316 if (in_own_cluster(net, node)) { in tipc_nameseq_insert_publ()
321 if (in_own_node(net, node)) { in tipc_nameseq_insert_publ()
330 publ->node, created_subseq); in tipc_nameseq_insert_publ()
348 u32 inst, u32 node, in tipc_nameseq_remove_publ() argument
366 (!publ->node || (publ->node == node))) in tipc_nameseq_remove_publ()
[all …]
|
| D | name_table.h | 74 u32 node; member
100 u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance, u32 *node);
110 u32 node, u32 ref, u32 key);
112 u32 lower, u32 node, u32 ref,
|
| /net/ceph/ |
| D | string_table.c | 20 exist = rb_entry(*p, struct ceph_string, node); in ceph_find_or_create_string()
31 rb_erase(&exist->node, &string_tree); in ceph_find_or_create_string()
32 RB_CLEAR_NODE(&exist->node); in ceph_find_or_create_string()
55 exist = rb_entry(*p, struct ceph_string, node); in ceph_find_or_create_string()
67 rb_link_node(&cs->node, parent, p); in ceph_find_or_create_string()
68 rb_insert_color(&cs->node, &string_tree); in ceph_find_or_create_string()
70 rb_erase(&exist->node, &string_tree); in ceph_find_or_create_string()
71 RB_CLEAR_NODE(&exist->node); in ceph_find_or_create_string()
92 if (!RB_EMPTY_NODE(&cs->node)) { in ceph_release_string()
93 rb_erase(&cs->node, &string_tree); in ceph_release_string()
[all …]
|
| /net/ipx/ |
| D | ipx_proc.c | 47 i = list_entry(v, struct ipx_interface, node); in ipx_seq_interface_show()
88 rt = list_entry(v, struct ipx_route, node); in ipx_seq_route_show()
108 list_for_each_entry(i, &ipx_interfaces, node) { in ipx_get_socket_idx()
163 if (i->node.next == &ipx_interfaces) in ipx_seq_socket_next()
165 i = list_entry(i->node.next, struct ipx_interface, node); in ipx_seq_socket_next()
199 ipxs->node[0], ipxs->node[1], ipxs->node[2], ipxs->node[3], in ipx_seq_socket_show()
200 ipxs->node[4], ipxs->node[5], ntohs(ipxs->port)); in ipx_seq_socket_show()
210 ipxs->dest_addr.node[0], ipxs->dest_addr.node[1], in ipx_seq_socket_show()
211 ipxs->dest_addr.node[2], ipxs->dest_addr.node[3], in ipx_seq_socket_show()
212 ipxs->dest_addr.node[4], ipxs->dest_addr.node[5], in ipx_seq_socket_show()
|
| D | ipx_route.c | 34 list_for_each_entry(r, &ipx_routes, node) in ipxrtr_lookup()
49 unsigned char *node) in ipxrtr_add_route() argument
65 list_add(&rt->node, &ipx_routes); in ipxrtr_add_route()
75 if (!node) { in ipxrtr_add_route()
79 memcpy(rt->ir_router_node, node, IPX_NODE_LEN); in ipxrtr_add_route()
95 list_for_each_entry_safe(r, tmp, &ipx_routes, node) in ipxrtr_del_routes()
97 list_del(&r->node); in ipxrtr_del_routes()
124 list_for_each_entry_safe(r, tmp, &ipx_routes, node) in ipxrtr_delete()
130 list_del(&r->node); in ipxrtr_delete()
157 r->ir_router_node : ipx->ipx_dest.node); in ipxrtr_route_skb()
[all …]
|
| D | af_ipx.c | 87 struct ipx_interface, node); in ipx_interfaces_head()
157 list_for_each_entry(i, &ipx_interfaces, node) in __ipxitf_find_using_phys()
184 list_for_each_entry(i, &ipx_interfaces, node) in ipxitf_find_using_net()
254 !memcmp(ipx_node, ipxs->node, IPX_NODE_LEN)) in ipxitf_find_internal_socket()
289 list_del(&intrfc->node); in __ipxitf_down()
328 list_for_each_entry_safe(i, tmp, &ipx_interfaces, node) in ipxitf_device_event()
346 list_for_each_entry_safe(i, tmp, &ipx_interfaces, node) in ipxitf_cleanup()
368 int is_broadcast = !memcmp(ipx->ipx_dest.node, ipx_broadcast_node, in ipxitf_demux_socket()
379 (is_broadcast || !memcmp(ipx->ipx_dest.node, in ipxitf_demux_socket()
380 ipxs->node, IPX_NODE_LEN))) { in ipxitf_demux_socket()
[all …]
|
| /net/ipv4/ |
| D | inetpeer.c | 246 struct inet_peer *node, *l, *r; in peer_avl_rebalance() local
251 node = rcu_deref_locked(*nodep, base); in peer_avl_rebalance()
252 l = rcu_deref_locked(node->avl_left, base); in peer_avl_rebalance()
253 r = rcu_deref_locked(node->avl_right, base); in peer_avl_rebalance()
263 RCU_INIT_POINTER(node->avl_left, lr); /* lr: RH or RH+1 */ in peer_avl_rebalance()
264 RCU_INIT_POINTER(node->avl_right, r); /* r: RH */ in peer_avl_rebalance()
265 node->avl_height = lrh + 1; /* RH+1 or RH+2 */ in peer_avl_rebalance()
267 RCU_INIT_POINTER(l->avl_right, node); /* node: RH+1 or RH+2 */ in peer_avl_rebalance()
268 l->avl_height = node->avl_height + 1; in peer_avl_rebalance()
273 RCU_INIT_POINTER(node->avl_left, lrr); /* lrr: RH or RH-1 */ in peer_avl_rebalance()
[all …]
|
| /net/6lowpan/ |
| D | nhc.c | 31 node); in lowpan_nhc_insert()
55 rb_link_node(&nhc->node, parent, new); in lowpan_nhc_insert()
56 rb_insert_color(&nhc->node, &rb_root); in lowpan_nhc_insert()
63 rb_erase(&nhc->node, &rb_root); in lowpan_nhc_remove()
68 struct rb_node *node = rb_root.rb_node; in lowpan_nhc_by_nhcid() local
71 while (node) { in lowpan_nhc_by_nhcid()
72 struct lowpan_nhc *nhc = container_of(node, struct lowpan_nhc, in lowpan_nhc_by_nhcid()
73 node); in lowpan_nhc_by_nhcid()
87 node = node->rb_left; in lowpan_nhc_by_nhcid()
89 node = node->rb_right; in lowpan_nhc_by_nhcid()
|
| /net/decnet/ |
| D | sysctl_net_decnet.c | 91 __u16 area, node; in parse_addr() local
110 node = *str++ - '0'; in parse_addr()
112 node *= 10; in parse_addr()
113 node += (*str++ - '0'); in parse_addr()
116 node *= 10; in parse_addr()
117 node += (*str++ - '0'); in parse_addr()
120 node *= 10; in parse_addr()
121 node += (*str++ - '0'); in parse_addr()
124 if ((node > 1023) || (area > 63)) in parse_addr()
130 *addr = cpu_to_le16((area << 10) | node); in parse_addr()
|
| /net/x25/ |
| D | x25_route.c | 41 rt = list_entry(entry, struct x25_route, node); in x25_add_route()
60 list_add(&rt->node, &x25_route_list); in x25_add_route()
76 if (rt->node.next) { in __x25_remove_route()
77 list_del(&rt->node); in __x25_remove_route()
92 rt = list_entry(entry, struct x25_route, node); in x25_del_route()
117 rt = list_entry(entry, struct x25_route, node); in x25_route_device_down()
162 rt = list_entry(entry, struct x25_route, node); in x25_get_route()
222 rt = list_entry(entry, struct x25_route, node); in x25_route_free()
|
| D | x25_forward.c | 55 x25_frwd = list_entry(entry, struct x25_forward, node); in x25_forward_call()
74 list_add(&new_frwd->node, &x25_forward_list); in x25_forward_call()
108 frwd = list_entry(entry, struct x25_forward, node); in x25_forward_data()
145 fwd = list_entry(entry, struct x25_forward, node); in x25_clear_forward_by_lci()
147 list_del(&fwd->node); in x25_clear_forward_by_lci()
163 fwd = list_entry(entry, struct x25_forward, node); in x25_clear_forward_by_dev()
165 list_del(&fwd->node); in x25_clear_forward_by_dev()
|
| /net/irda/ |
| D | discovery.c | 62 discovery_t *discovery, *node; in irlmp_add_discovery() local
78 node = discovery; in irlmp_add_discovery()
83 if ((node->data.saddr == new->data.saddr) && in irlmp_add_discovery()
84 ((node->data.daddr == new->data.daddr) || in irlmp_add_discovery()
85 (strcmp(node->data.info, new->data.info) == 0))) in irlmp_add_discovery()
90 hashbin_remove_this(cachelog, (irda_queue_t *) node); in irlmp_add_discovery()
92 if (get_unaligned((__u16 *)node->data.hints) == get_unaligned((__u16 *)new->data.hints)) in irlmp_add_discovery()
94 new->firststamp = node->firststamp; in irlmp_add_discovery()
95 kfree(node); in irlmp_add_discovery()
|
| D | irias_object.c | 127 struct ias_object *node; in irias_delete_object() local
133 node = hashbin_remove_this(irias_objects, (irda_queue_t *) obj); in irias_delete_object()
134 if (!node) in irias_delete_object()
155 struct ias_attrib *node; in irias_delete_attrib() local
162 node = hashbin_remove_this(obj->attribs, (irda_queue_t *) attrib); in irias_delete_attrib()
163 if (!node) in irias_delete_attrib()
167 __irias_delete_attrib(node); in irias_delete_attrib()
174 node = (struct ias_attrib *) hashbin_get_first(obj->attribs); in irias_delete_attrib()
175 if (cleanobject && !node) in irias_delete_attrib()
|
| /net/sunrpc/ |
| D | svc.c | 112 unsigned int node; in svc_pool_map_choose_mode() local
122 node = first_online_node; in svc_pool_map_choose_mode()
123 if (nr_cpus_node(node) > 2) { in svc_pool_map_choose_mode()
197 unsigned int node; in svc_pool_map_init_pernode() local
204 for_each_node_with_cpus(node) { in svc_pool_map_init_pernode()
207 m->to_pool[node] = pidx; in svc_pool_map_init_pernode()
208 m->pool_to[pidx] = node; in svc_pool_map_init_pernode()
305 unsigned int node = m->pool_to[pidx]; in svc_pool_map_set_cpumask() local
318 set_cpus_allowed_ptr(task, cpumask_of(node)); in svc_pool_map_set_cpumask()
323 set_cpus_allowed_ptr(task, cpumask_of_node(node)); in svc_pool_map_set_cpumask()
[all …]
|
| /net/caif/ |
| D | cfmuxl.c | 70 list_add_rcu(&dn->node, &muxl->frml_list); in cfmuxl_set_dnlayer()
78 list_for_each_entry_rcu(lyr, list, node) { in get_from_id()
96 list_del_rcu(&old->node); in cfmuxl_set_uplayer()
98 list_add_rcu(&up->node, &muxl->srvl_list); in cfmuxl_set_uplayer()
116 list_del_rcu(&dn->node); in cfmuxl_remove_dnlayer()
168 list_del_rcu(&up->node); in cfmuxl_remove_uplayer()
253 list_for_each_entry_rcu(layer, &muxl->srvl_list, node) { in cfmuxl_ctrlcmd()
|