| /net/mac80211/ |
| D | mesh_pathtbl.c | 77 struct mpath_node *node; in mesh_path_lookup() local
82 hlist_for_each_entry_rcu(node, n, bucket, list) { in mesh_path_lookup()
83 mpath = node->mpath; in mesh_path_lookup()
104 struct mpath_node *node; in mpp_path_lookup() local
109 hlist_for_each_entry_rcu(node, n, bucket, list) { in mpp_path_lookup()
110 mpath = node->mpath; in mpp_path_lookup()
137 struct mpath_node *node; in mesh_path_lookup_by_idx() local
142 for_each_mesh_entry(mesh_paths, p, node, i) { in mesh_path_lookup_by_idx()
143 if (sdata && node->mpath->sdata != sdata) in mesh_path_lookup_by_idx()
146 if (MPATH_EXPIRED(node->mpath)) { in mesh_path_lookup_by_idx()
[all …]
|
| /net/ipx/ |
| D | ipx_proc.c | 20 list_for_each_entry(i, &ipx_interfaces, node) in ipx_get_interface_idx()
32 if (i->node.next != &ipx_interfaces) in ipx_interfaces_next()
33 rc = list_entry(i->node.next, struct ipx_interface, node); in ipx_interfaces_next()
97 rc = list_entry(ipx_routes.next, struct ipx_route, node); in ipx_routes_head()
105 if (r->node.next != &ipx_routes) in ipx_routes_next()
106 rc = list_entry(r->node.next, struct ipx_route, node); in ipx_routes_next()
114 list_for_each_entry(r, &ipx_routes, node) in ipx_get_route_idx()
171 struct hlist_node *node; in ipx_get_socket_idx() local
174 list_for_each_entry(i, &ipx_interfaces, node) { in ipx_get_socket_idx()
176 sk_for_each(s, node, &i->if_sklist) { in ipx_get_socket_idx()
[all …]
|
| D | ipx_route.c | 29 char *node);
37 list_for_each_entry(r, &ipx_routes, node) in ipxrtr_lookup()
52 unsigned char *node) in ipxrtr_add_route() argument
68 list_add(&rt->node, &ipx_routes); in ipxrtr_add_route()
78 if (!node) { in ipxrtr_add_route()
82 memcpy(rt->ir_router_node, node, IPX_NODE_LEN); in ipxrtr_add_route()
98 list_for_each_entry_safe(r, tmp, &ipx_routes, node) in ipxrtr_del_routes()
100 list_del(&r->node); in ipxrtr_del_routes()
127 list_for_each_entry_safe(r, tmp, &ipx_routes, node) in ipxrtr_delete()
133 list_del(&r->node); in ipxrtr_delete()
[all …]
|
| D | af_ipx.c | 87 unsigned char *node);
101 struct ipx_interface, node); in ipx_interfaces_head()
172 list_for_each_entry(i, &ipx_interfaces, node) in __ipxitf_find_using_phys()
199 list_for_each_entry(i, &ipx_interfaces, node) in ipxitf_find_using_net()
231 struct hlist_node *node; in __ipxitf_find_socket() local
233 sk_for_each(s, node, &intrfc->if_sklist) in __ipxitf_find_socket()
262 struct hlist_node *node; in ipxitf_find_internal_socket() local
267 sk_for_each(s, node, &intrfc->if_sklist) { in ipxitf_find_internal_socket()
271 !memcmp(ipx_node, ipxs->node, IPX_NODE_LEN)) in ipxitf_find_internal_socket()
285 struct hlist_node *node, *t; in __ipxitf_down() local
[all …]
|
| /net/tipc/ |
| D | node_subscr.c | 51 node_sub->node = NULL; in tipc_nodesub_subscribe()
55 node_sub->node = tipc_node_find(addr); in tipc_nodesub_subscribe()
56 if (!node_sub->node) { in tipc_nodesub_subscribe()
63 tipc_node_lock(node_sub->node); in tipc_nodesub_subscribe()
64 list_add_tail(&node_sub->nodesub_list, &node_sub->node->nsub); in tipc_nodesub_subscribe()
65 tipc_node_unlock(node_sub->node); in tipc_nodesub_subscribe()
74 if (!node_sub->node) in tipc_nodesub_unsubscribe()
77 tipc_node_lock(node_sub->node); in tipc_nodesub_unsubscribe()
79 tipc_node_unlock(node_sub->node); in tipc_nodesub_unsubscribe()
|
| D | bcast.c | 113 struct tipc_node node; member
421 struct tipc_node* node = tipc_node_find(msg_prevnode(msg)); in tipc_bclink_recv_pkt() local
428 if (unlikely(!node || !tipc_node_is_up(node) || !node->bclink.supported || in tipc_bclink_recv_pkt()
437 tipc_node_lock(node); in tipc_bclink_recv_pkt()
438 tipc_bclink_acknowledge(node, msg_bcast_ack(msg)); in tipc_bclink_recv_pkt()
439 tipc_node_unlock(node); in tipc_bclink_recv_pkt()
442 bcl->owner->next = node; /* remember requestor */ in tipc_bclink_recv_pkt()
465 tipc_node_lock(node); in tipc_bclink_recv_pkt()
467 deferred = node->bclink.deferred_head; in tipc_bclink_recv_pkt()
468 next_in = mod(node->bclink.last_in + 1); in tipc_bclink_recv_pkt()
[all …]
|
| D | name_distr.c | 164 void tipc_named_node_up(unsigned long node) in tipc_named_node_up() argument
182 buf = named_prepare_buf(PUBLICATION, left, node); in tipc_named_node_up()
193 msg_set_link_selector(buf_msg(buf), node); in tipc_named_node_up()
195 "<%u.%u.%u>\n", tipc_zone(node), in tipc_named_node_up()
196 tipc_cluster(node), tipc_node(node)); in tipc_named_node_up()
197 tipc_link_send(buf, node, node); in tipc_named_node_up()
225 publ->node, publ->ref, publ->key); in node_is_down()
231 publ->type, publ->lower, publ->node, publ->ref, publ->key); in node_is_down()
313 if (publ->node == tipc_own_addr) in tipc_named_reinit()
315 publ->node = tipc_own_addr; in tipc_named_reinit()
|
| D | name_table.c | 127 u32 scope, u32 node, u32 port_ref, in publ_create() argument
140 publ->node = node; in publ_create()
250 u32 scope, u32 node, u32 port, u32 key) in tipc_nameseq_insert_publ() argument
319 type, lower, upper, node, port, sseq, in tipc_nameseq_insert_publ()
324 publ = publ_create(type, lower, upper, scope, node, port, key); in tipc_nameseq_insert_publ()
328 publ, node, publ->node, publ->subscr.node); in tipc_nameseq_insert_publ()
338 if (in_own_cluster(node)) { in tipc_nameseq_insert_publ()
349 if (node == tipc_own_addr) { in tipc_nameseq_insert_publ()
369 publ->node, in tipc_nameseq_insert_publ()
388 u32 node, u32 ref, u32 key) in tipc_nameseq_remove_publ() argument
[all …]
|
| D | name_table.h | 76 u32 node; member
91 u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *node);
100 u32 scope, u32 node, u32 ref, u32 key);
102 u32 node, u32 ref, u32 key);
|
| /net/ipv4/ |
| D | inetpeer.c | 188 struct inet_peer **nodep, *node, *l, *r; in peer_avl_rebalance() local
193 node = *nodep; in peer_avl_rebalance()
194 l = node->avl_left; in peer_avl_rebalance()
195 r = node->avl_right; in peer_avl_rebalance()
205 node->avl_left = lr; /* lr: RH or RH+1 */ in peer_avl_rebalance()
206 node->avl_right = r; /* r: RH */ in peer_avl_rebalance()
207 node->avl_height = lrh + 1; /* RH+1 or RH+2 */ in peer_avl_rebalance()
209 l->avl_right = node; /* node: RH+1 or RH+2 */ in peer_avl_rebalance()
210 l->avl_height = node->avl_height + 1; in peer_avl_rebalance()
215 node->avl_left = lrr; /* lrr: RH or RH-1 */ in peer_avl_rebalance()
[all …]
|
| D | fib_trie.c | 92 #define NODE_TYPE(node) ((node)->parent & NODE_TYPE_MASK) argument
97 struct node { struct
127 struct node *child[0];
152 struct node *trie;
158 static void put_child(struct trie *t, struct tnode *tn, int i, struct node *n);
159 static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n,
161 static struct node *resize(struct trie *t, struct tnode *tn);
168 static inline struct tnode *node_parent(struct node *node) in node_parent() argument
170 return (struct tnode *)(node->parent & ~NODE_TYPE_MASK); in node_parent()
173 static inline struct tnode *node_parent_rcu(struct node *node) in node_parent_rcu() argument
[all …]
|
| D | inet_hashtables.c | 42 hlist_add_head(&tb->node, &head->chain); in inet_bind_bucket_create()
53 __hlist_del(&tb->node); in inet_bind_bucket_destroy()
152 struct hlist_nulls_node *node; in __inet_lookup_listener() local
161 sk_nulls_for_each_rcu(sk, node, &ilb->head) { in __inet_lookup_listener()
173 if (get_nulls_value(node) != hash + LISTENING_NULLS_BASE) in __inet_lookup_listener()
198 const struct hlist_nulls_node *node; in __inet_lookup_established() local
208 sk_nulls_for_each_rcu(sk, node, &head->chain) { in __inet_lookup_established()
226 if (get_nulls_value(node) != slot) in __inet_lookup_established()
231 sk_nulls_for_each_rcu(sk, node, &head->twchain) { in __inet_lookup_established()
251 if (get_nulls_value(node) != slot) in __inet_lookup_established()
[all …]
|
| D | fib_hash.c | 119 struct hlist_node *node, *n; in fn_rebuild_zone() local
122 hlist_for_each_entry_safe(f, node, n, &old_ht[i], fn_hash) { in fn_rebuild_zone()
255 struct hlist_node *node; in fn_hash_lookup() local
260 hlist_for_each_entry(f, node, head, fn_hash) { in fn_hash_lookup()
282 struct hlist_node *node; in fn_hash_select_default() local
297 hlist_for_each_entry(f, node, &fz->fz_hash[0], fn_hash) { in fn_hash_select_default()
359 struct hlist_node *node; in fib_find_node() local
362 hlist_for_each_entry(f, node, head, fn_hash) { in fib_find_node()
632 struct hlist_node *node, *n; in fn_flush_list() local
636 hlist_for_each_entry_safe(f, node, n, head, fn_hash) { in fn_flush_list()
[all …]
|
| /net/ax25/ |
| D | ax25_uid.c | 56 struct hlist_node *node; in ax25_findbyuid() local
59 ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) { in ax25_findbyuid()
76 struct hlist_node *node; in ax25_uid_ioctl() local
84 ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) { in ax25_uid_ioctl()
123 ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) { in ax25_uid_ioctl()
150 struct hlist_node *node; in ax25_uid_seq_start() local
154 ax25_uid_for_each(pt, node, &ax25_uid_list) { in ax25_uid_seq_start()
218 struct hlist_node *node; in ax25_uid_free() local
222 ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) { in ax25_uid_free()
|
| /net/x25/ |
| D | x25_proc.c | 34 rt = list_entry(route_entry, struct x25_route, node); in x25_get_route_idx()
61 struct x25_route, node); in x25_seq_route_next()
65 if (rt->node.next != &x25_route_list) in x25_seq_route_next()
66 rt = list_entry(rt->node.next, struct x25_route, node); in x25_seq_route_next()
99 struct hlist_node *node; in x25_get_socket_idx() local
101 sk_for_each(s, node, &x25_list) in x25_get_socket_idx()
179 f = list_entry(entry, struct x25_forward, node); in x25_get_forward_idx()
207 struct x25_forward, node); in x25_seq_forward_next()
211 if (f->node.next != &x25_forward_list) in x25_seq_forward_next()
212 f = list_entry(f->node.next, struct x25_forward, node); in x25_seq_forward_next()
|
| D | x25_route.c | 40 rt = list_entry(entry, struct x25_route, node); in x25_add_route()
59 list_add(&rt->node, &x25_route_list); in x25_add_route()
75 if (rt->node.next) { in __x25_remove_route()
76 list_del(&rt->node); in __x25_remove_route()
91 rt = list_entry(entry, struct x25_route, node); in x25_del_route()
116 rt = list_entry(entry, struct x25_route, node); in x25_route_device_down()
159 rt = list_entry(entry, struct x25_route, node); in x25_get_route()
219 rt = list_entry(entry, struct x25_route, node); in x25_route_free()
|
| D | x25_forward.c | 51 x25_frwd = list_entry(entry, struct x25_forward, node); in x25_forward_call()
70 list_add(&new_frwd->node, &x25_forward_list); in x25_forward_call()
104 frwd = list_entry(entry, struct x25_forward, node); in x25_forward_data()
141 fwd = list_entry(entry, struct x25_forward, node); in x25_clear_forward_by_lci()
143 list_del(&fwd->node); in x25_clear_forward_by_lci()
159 fwd = list_entry(entry, struct x25_forward, node); in x25_clear_forward_by_dev()
161 list_del(&fwd->node); in x25_clear_forward_by_dev()
|
| /net/ipv6/ |
| D | inet6_hashtables.c | 70 const struct hlist_nulls_node *node; in __inet6_lookup_established() local
82 sk_nulls_for_each_rcu(sk, node, &head->chain) { in __inet6_lookup_established()
94 if (get_nulls_value(node) != slot) in __inet6_lookup_established()
99 sk_nulls_for_each_rcu(sk, node, &head->twchain) { in __inet6_lookup_established()
112 if (get_nulls_value(node) != slot) in __inet6_lookup_established()
152 const struct hlist_nulls_node *node; in inet6_lookup_listener() local
162 sk_nulls_for_each(sk, node, &ilb->head) { in inet6_lookup_listener()
174 if (get_nulls_value(node) != hash + LISTENING_NULLS_BASE) in inet6_lookup_listener()
224 const struct hlist_nulls_node *node; in __inet6_check_established() local
230 sk_nulls_for_each(sk2, node, &head->twchain) { in __inet6_check_established()
[all …]
|
| /net/netrom/ |
| D | nr_route.c | 51 struct hlist_node *node; in nr_node_get() local
54 nr_node_for_each(nr_node, node, &nr_node_list) in nr_node_get()
69 struct hlist_node *node; in nr_neigh_get_dev() local
72 nr_neigh_for_each(nr_neigh, node, &nr_neigh_list) in nr_neigh_get_dev()
116 struct hlist_node *node; in nr_add_node() local
119 nr_node_for_each(nr_nodet, node, &nr_node_list) { in nr_add_node()
484 struct hlist_node *node, *nodet; in nr_dec_obs() local
488 nr_node_for_each_safe(s, node, nodet, &nr_node_list) { in nr_dec_obs()
538 struct hlist_node *node, *nodet, *node2, *node2t; in nr_rt_device_down() local
543 nr_neigh_for_each_safe(s, node, nodet, &nr_neigh_list) { in nr_rt_device_down()
[all …]
|
| /net/decnet/ |
| D | sysctl_net_decnet.c | 90 __u16 area, node; in parse_addr() local
109 node = *str++ - '0'; in parse_addr()
111 node *= 10; in parse_addr()
112 node += (*str++ - '0'); in parse_addr()
115 node *= 10; in parse_addr()
116 node += (*str++ - '0'); in parse_addr()
119 node *= 10; in parse_addr()
120 node += (*str++ - '0'); in parse_addr()
123 if ((node > 1023) || (area > 63)) in parse_addr()
129 *addr = cpu_to_le16((area << 10) | node); in parse_addr()
|
| /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 | 128 struct ias_object *node; in irias_delete_object() local
134 node = hashbin_remove_this(irias_objects, (irda_queue_t *) obj); in irias_delete_object()
135 if (!node) in irias_delete_object()
156 struct ias_attrib *node; in irias_delete_attrib() local
163 node = hashbin_remove_this(obj->attribs, (irda_queue_t *) attrib); in irias_delete_attrib()
164 if (!node) in irias_delete_attrib()
168 __irias_delete_attrib(node); in irias_delete_attrib()
175 node = (struct ias_attrib *) hashbin_get_first(obj->attribs); in irias_delete_attrib()
176 if (cleanobject && !node) in irias_delete_attrib()
|
| /net/core/ |
| D | gen_estimator.c | 93 struct rb_node node; member
155 e = rb_entry(parent, struct gen_estimator, node); in gen_add_node()
162 rb_link_node(&est->node, parent, p); in gen_add_node()
163 rb_insert_color(&est->node, &est_root); in gen_add_node()
175 e = rb_entry(p, struct gen_estimator, node); in gen_find_node()
270 rb_erase(&e->node, &est_root); in gen_kill_estimator()
|
| /net/802/ |
| D | garp.c | 156 attr = rb_entry(parent, struct garp_attr, node); in garp_attr_lookup()
176 attr = rb_entry(parent, struct garp_attr, node); in garp_attr_insert()
183 rb_link_node(&new->node, parent, p); in garp_attr_insert()
184 rb_insert_color(&new->node, &app->gid); in garp_attr_insert()
205 rb_erase(&attr->node, &app->gid); in garp_attr_destroy()
385 struct rb_node *node, *next; in garp_gid_event() local
388 for (node = rb_first(&app->gid); in garp_gid_event()
389 next = node ? rb_next(node) : NULL, node != NULL; in garp_gid_event()
390 node = next) { in garp_gid_event()
391 attr = rb_entry(node, struct garp_attr, node); in garp_gid_event()
|
| /net/llc/ |
| D | llc_proc.c | 37 struct hlist_node *node; in llc_get_sk_idx() local
41 sap = list_entry(sap_entry, struct llc_sap, node); in llc_get_sk_idx()
44 sk_for_each(sk, node, &sap->sk_list.list) { in llc_get_sk_idx()
86 if (sap->node.next == &llc_sap_list) in llc_seq_next()
88 sap = list_entry(sap->node.next, struct llc_sap, node); in llc_seq_next()
|