/net/tipc/ |
H A D | node_subscr.c | 2 * net/tipc/node_subscr.c: TIPC "node down" subscription handling 39 #include "node.h" 42 * tipc_nodesub_subscribe - create "node down" subscription for specified node 48 node_sub->node = NULL; 52 node_sub->node = tipc_node_find(addr); 53 if (!node_sub->node) { 54 pr_warn("Node subscription rejected, unknown node 0x%x\n", 61 tipc_node_lock(node_sub->node); 62 list_add_tail(&node_sub->nodesub_list, &node_sub->node [all...] |
H A D | node.h | 2 * net/tipc/node.h: Include file for TIPC node management routines 47 * Out-of-range value for node signature 53 * TIPC_WAIT_OWN_LINKS_DOWN: wait until peer node is declared down 54 * TIPC_NOTIFY_NODE_DOWN: notify node is down 55 * TIPC_NOTIFY_NODE_UP: notify node is up 70 * struct tipc_node_bclink - TIPC node bclink structure 71 * @acked: sequence # of last outbound b'cast message acknowledged by node 72 * @last_in: sequence # of last in-sequence b'cast message received from node 73 * @last_sent: sequence # of last b'cast message sent by node 148 tipc_node_lock(struct tipc_node *node) argument 153 tipc_node_blocked(struct tipc_node *node) argument 161 struct tipc_node *node; local [all...] |
H A D | node.c | 2 * net/tipc/node.c: TIPC node management routines 39 #include "node.h" 65 * usually be much smaller (typically only a single node). 73 * tipc_node_find - locate specified node object, if it exists 77 struct tipc_node *node; local 83 hlist_for_each_entry_rcu(node, &node_htable[tipc_hashfn(addr)], hash) { 84 if (node->addr == addr) { 86 return node; 141 struct tipc_node *node, *t_nod local 151 struct tipc_node *node; local 177 struct tipc_node *node; local 534 struct tipc_node *node = tipc_node_find(addr); local 549 tipc_node_unlock(struct tipc_node *node) argument [all...] |
H A D | bcast.c | 69 * @remains: temporary node map used by tipc_bcbearer_send() 70 * @remains_new: temporary node map used tipc_bcbearer_send() 90 * @node: (non-standard) node structure representing b'cast link's peer node 93 * @retransmit_to: node that most recently requested a retransmit 100 struct tipc_node node; member in struct:tipc_bclink 115 static void tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node); 116 static void tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node); 125 struct tipc_node *node local 194 bclink_update_last_sent(struct tipc_node *node, u32 seqno) argument 454 bclink_accept_pkt(struct tipc_node *node, u32 seqno) argument 481 struct tipc_node *node; local 712 tipc_bcbearer_sort(struct tipc_node_map *nm_ptr, u32 node, bool action) argument 883 tipc_nmap_add(struct tipc_node_map *nm_ptr, u32 node) argument 898 tipc_nmap_remove(struct tipc_node_map *nm_ptr, u32 node) argument [all...] |
H A D | name_table.h | 56 * @node: network address of publishing port's node 59 * @subscr: subscription to "node down" event (for off-node publications only) 60 * @local_list: adjacent entries in list of publications made by this node 62 * @node_list: adjacent matching name seq publications with >= node scope 66 * Note that the node list, cluster list, and zone list are circular lists. 73 u32 node; member in struct:publication 88 u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *node); 95 u32 scope, u32 node, u3 [all...] |
H A D | node_subscr.h | 2 * net/tipc/node_subscr.h: Include file for TIPC "node down" subscription handling 45 * struct tipc_node_subscr - "node down" subscription entry 46 * @node: ptr to node structure of interest (or NULL, if none) 47 * @handle_node_down: routine to invoke when node fails 48 * @usr_handle: argument to pass to routine when node fails 49 * @nodesub_list: adjacent entries in list of subscriptions for the node 52 struct tipc_node *node; member in struct:tipc_node_subscr
|
H A D | name_distr.c | 42 * struct publ_list - list of publications made by this node 84 u32 node; member in struct:distr_queue_item 120 struct tipc_node *node; local 124 list_for_each_entry_rcu(node, &tipc_node_list, list) { 125 dnode = node->addr; 128 if (!tipc_node_active_links(node)) 142 * tipc_named_publish - tell other nodes about a new publication by this node 167 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node 192 * named_distribute - prepare name info for bulk distribution to another node 194 * @dnode: node t 287 tipc_update_nametbl(struct distr_item *i, u32 node, u32 dtype) argument 321 tipc_named_add_backlog(struct distr_item *i, u32 type, u32 node) argument 371 u32 node = msg_orignode(msg); local [all...] |
H A D | discover.c | 90 * disc_dupl_alert - issue node address duplication alert 92 * @node_addr: duplicated node address 93 * @media_addr: media address advertised by duplicated node 115 struct tipc_node *node; local 135 /* Ensure message from node is valid and communication is permitted */ 155 /* Locate, or if necessary, create, node: */ 156 node = tipc_node_find(onode); 157 if (!node) 158 node = tipc_node_create(onode); 159 if (!node) [all...] |
H A D | subscr.h | 75 u32 node, int must);
|
/net/hsr/ |
H A D | hsr_framereg.c | 30 /* Local slave through which AddrB frames are received from this node */ 62 struct hsr_node *node; local 64 node = list_first_or_null_rcu(&hsr->self_node_db, struct hsr_node, 66 if (!node) { 67 WARN_ONCE(1, "HSR: No self node\n"); 71 if (ether_addr_equal(addr, node->MacAddressA)) 73 if (ether_addr_equal(addr, node->MacAddressB)) 84 struct hsr_node *node; local 86 list_for_each_entry_rcu(node, node_db, mac_list) { 87 if (ether_addr_equal(node 102 struct hsr_node *node, *oldnode; local 135 struct hsr_node *node; local 164 struct hsr_node *node; local 254 hsr_addr_subst_source(struct hsr_node *node, struct sk_buff *skb) argument 298 hsr_register_frame_in(struct hsr_node *node, struct hsr_port *port, u16 sequence_nr) argument 320 hsr_register_frame_out(struct hsr_port *port, struct hsr_node *node, u16 sequence_nr) argument 331 get_late_port(struct hsr_priv *hsr, struct hsr_node *node) argument 358 struct hsr_node *node; local 413 struct hsr_node *node; local 442 struct hsr_node *node; local [all...] |
H A D | hsr_framereg.h | 27 void hsr_addr_subst_source(struct hsr_node *node, struct sk_buff *skb); 31 void hsr_register_frame_in(struct hsr_node *node, struct hsr_port *port, 33 int hsr_register_frame_out(struct hsr_port *port, struct hsr_node *node,
|
/net/batman-adv/ |
H A D | hash.h | 61 struct hlist_node *node, *node_tmp; local 70 hlist_for_each_safe(node, node_tmp, head) { 71 hlist_del_rcu(node); 74 free_cb(node, arg); 124 struct hlist_node *node; local 136 hlist_for_each(node, head) { 137 if (!compare(node, data)) 166 struct hlist_node *node; local 174 hlist_for_each(node, head) { 175 if (!compare(node, dat [all...] |
/net/netfilter/ |
H A D | xt_qtaguid_print.c | 280 "node=rb_node{...}, pid=%u, " 294 struct rb_node *node; local 310 for (node = rb_first(sock_tag_tree); 311 node; 312 node = rb_next(node)) { 313 sock_tag_entry = rb_entry(node, struct sock_tag, sock_node); 355 struct rb_node *node; local 370 for (node = rb_first(proc_qtu_data_tree); 371 node; 394 struct rb_node *node; local 429 struct rb_node *node; local 468 struct rb_node *node; local [all...] |
H A D | nft_rbtree.c | 28 struct rb_node node; member in struct:nft_rbtree_elem 45 rbe = rb_entry(parent, struct nft_rbtree_elem, node); 97 rbe = rb_entry(parent, struct nft_rbtree_elem, node); 106 rb_link_node(&new->node, parent, p); 107 rb_insert_color(&new->node, &priv->root); 149 rb_erase(&rbe->node, &priv->root); 163 rbe = rb_entry(parent, struct nft_rbtree_elem, node); 191 struct rb_node *node; local 194 for (node = rb_first(&priv->root); node ! 235 struct rb_node *node; local [all...] |
H A D | xt_qtaguid.c | 178 struct rb_node *node = root->rb_node; local 180 while (node) { 181 struct tag_node *data = rb_entry(node, struct tag_node, node); 184 " node=%p data=%p\n", tag, node, data); 190 node = node->rb_left; 192 node = node 233 struct tag_node *node = tag_node_tree_search(root, tag); local 248 struct tag_node *node = tag_node_tree_search(root, tag); local 262 struct tag_node *node = tag_node_tree_search(root, tag); local 271 struct rb_node *node = root->rb_node; local 310 struct rb_node *node; local 331 struct rb_node *node = root->rb_node; local 398 struct rb_node *node = root->rb_node; local 581 struct rb_node *node; local 1867 struct rb_node *node; local 1890 struct rb_node *node; local 1999 struct rb_node *node; local 2636 struct rb_node *node; local [all...] |
H A D | xt_connlimit.c | 47 struct hlist_node node; member in struct:xt_connlimit_conn 53 struct rb_node node; member in struct:xt_connlimit_rb 130 hlist_add_head(&conn->node, head); 149 hlist_for_each_entry_safe(conn, n, head, node) { 153 hlist_del(&conn->node); 173 hlist_del(&conn->node); 195 rb_erase(&rbconn->node, root); 221 rbconn = container_of(*rbnode, struct xt_connlimit_rb, node); 260 * existing node to re-use. (or gc_count is 0). 265 /* no match, need to insert new node */ 400 struct rb_node *node; local [all...] |
H A D | nft_hash.c | 27 struct rhash_head node; member in struct:nft_hash_elem 68 rhashtable_insert(priv, &he->node, GFP_KERNEL); 107 rht_for_each_entry_rcu(he, tbl->buckets[h], node) { 109 pprev = &he->node.next; 133 rht_for_each_entry_rcu(he, tbl->buckets[i], node) { 168 .head_offset = offsetof(struct nft_hash_elem, node), 188 for (he = rht_entry(tbl->buckets[i], struct nft_hash_elem, node); 190 next = rht_entry(he->node.next, struct nft_hash_elem, node);
|
/net/ipx/ |
H A D | ipx_proc.c | 47 i = list_entry(v, struct ipx_interface, node); 88 rt = list_entry(v, struct ipx_route, node); 108 list_for_each_entry(i, &ipx_interfaces, node) { 163 if (i->node.next == &ipx_interfaces) 165 i = list_entry(i->node.next, struct ipx_interface, node); 199 ipxs->node[0], ipxs->node[1], ipxs->node[2], ipxs->node[ [all...] |
H A D | ipx_route.c | 34 list_for_each_entry(r, &ipx_routes, node) 49 unsigned char *node) 65 list_add(&rt->node, &ipx_routes); 75 if (!node) { 79 memcpy(rt->ir_router_node, node, IPX_NODE_LEN); 95 list_for_each_entry_safe(r, tmp, &ipx_routes, node) 97 list_del(&r->node); 124 list_for_each_entry_safe(r, tmp, &ipx_routes, node) 130 list_del(&r->node); 157 r->ir_router_node : ipx->ipx_dest.node); 48 ipxrtr_add_route(__be32 network, struct ipx_interface *intrfc, unsigned char *node) argument [all...] |
/net/mac80211/ |
H A D | mesh_pathtbl.c | 75 #define for_each_mesh_entry(tbl, node, i) \ 77 hlist_for_each_entry_rcu(node, &tbl->hash_buckets[i], list) 339 struct mpath_node *node; local 342 hlist_for_each_entry_rcu(node, bucket, list) { 343 mpath = node->mpath; 392 struct mpath_node *node; local 396 for_each_mesh_entry(tbl, node, i) { 397 if (sdata && node->mpath->sdata != sdata) 400 if (mpath_expired(node->mpath)) { 401 spin_lock_bh(&node 505 struct mpath_node *node, *new_node; local 639 struct mpath_node *node, *new_node; local 724 struct mpath_node *node; local 750 struct mpath_node *node = container_of(rp, struct mpath_node, rcu); local 760 __mesh_path_del(struct mesh_table *tbl, struct mpath_node *node) argument 789 struct mpath_node *node; local 811 struct mpath_node *node; local 859 struct mpath_node *node; local 1009 struct mpath_node *node = hlist_entry(p, struct mpath_node, list); local 1022 struct mpath_node *node, *new_node; local 1089 struct mpath_node *node; local [all...] |
/net/x25/ |
H A D | x25_route.c | 41 rt = list_entry(entry, struct x25_route, node); 60 list_add(&rt->node, &x25_route_list); 76 if (rt->node.next) { 77 list_del(&rt->node); 92 rt = list_entry(entry, struct x25_route, node); 117 rt = list_entry(entry, struct x25_route, node); 162 rt = list_entry(entry, struct x25_route, node); 222 rt = list_entry(entry, struct x25_route, node);
|
H A D | x25_forward.c | 55 x25_frwd = list_entry(entry, struct x25_forward, node); 74 list_add(&new_frwd->node, &x25_forward_list); 108 frwd = list_entry(entry, struct x25_forward, node); 145 fwd = list_entry(entry, struct x25_forward, node); 147 list_del(&fwd->node); 163 fwd = list_entry(entry, struct x25_forward, node); 165 list_del(&fwd->node);
|
/net/decnet/ |
H A D | sysctl_net_decnet.c | 91 __u16 area, node; local 110 node = *str++ - '0'; 112 node *= 10; 113 node += (*str++ - '0'); 116 node *= 10; 117 node += (*str++ - '0'); 120 node *= 10; 121 node += (*str++ - '0'); 124 if ((node > 1023) || (area > 63)) 130 *addr = cpu_to_le16((area << 10) | node); [all...] |
/net/ceph/ |
H A D | auth_x.h | 15 struct rb_node node; member in struct:ceph_x_ticket_handler
|
/net/ipv4/ |
H A D | inetpeer.c | 31 * When it's happened the node may be removed when a sufficient amount of 50 * usually under some other lock to prevent node disappearing 262 struct inet_peer *node, *l, *r; local 267 node = rcu_deref_locked(*nodep, base); 268 l = rcu_deref_locked(node->avl_left, base); 269 r = rcu_deref_locked(node->avl_right, base); 279 RCU_INIT_POINTER(node->avl_left, lr); /* lr: RH or RH+1 */ 280 RCU_INIT_POINTER(node->avl_right, r); /* r: RH */ 281 node->avl_height = lrh + 1; /* RH+1 or RH+2 */ 283 RCU_INIT_POINTER(l->avl_right, node); /* nod [all...] |