/net/tipc/ |
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 61 void tipc_nodesub_notify(struct tipc_node *node);
|
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 84 tipc_nodesub_notify(struct tipc_node *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 | net.c | 42 #include "node.h" 48 * port and node/link instances. The code consists of three major 52 * Comprises the structures 'zone', 'cluster', 'node', 'link' 61 * Within the tipc_net_lock domain there are two sub-domains;'node' and 64 * per instance. Code holding tipc_net_lock(read) and a node spin_lock 65 * is permitted to poke around in both the node itself and its 68 * "active_links" array in the node; but it can _not_ remove a link 69 * or a node from the overall structure. 144 /* Handle message for this node */ 169 /* Handle message for another node */ 194 struct tipc_node *node, *t_node; local [all...] |
H A D | node.c | 2 * net/tipc/node.c: TIPC node management routines 39 #include "node.h" 59 * usually be much smaller (typically only a single node). 67 * tipc_node_find - locate specified node object, if it exists 71 struct tipc_node *node; local 76 hlist_for_each_entry(node, &node_htable[tipc_hashfn(addr)], hash) { 77 if (node->addr == addr) 78 return node; 84 * tipc_node_create - create neighboring node [all...] |
H A D | name_distr.c | 58 * Note: There is no field that identifies the publishing node because it is 70 * struct publ_list - list of publications made by this node 149 * tipc_named_publish - tell other nodes about a new publication by this node 174 * tipc_named_withdraw - tell other nodes about a withdrawn publication by this node 199 * named_distribute - prepare name info for bulk distribution to another node 201 static void named_distribute(struct list_head *message_list, u32 node, argument 214 buf = named_prepare_buf(PUBLICATION, left, node); 232 * tipc_named_node_up - tell specified node about all publications by this node 239 u32 node local [all...] |
H A D | subscr.c | 95 u32 node) 106 sub->evt.port.node = htohl(node, sub->swap); 139 u32 node, 147 subscr_send_event(sub, found_lower, found_upper, event, port_ref, node); 90 subscr_send_event(struct tipc_subscription *sub, u32 found_lower, u32 found_upper, u32 event, u32 port_ref, u32 node) argument 134 tipc_subscr_report_overlap(struct tipc_subscription *sub, u32 found_lower, u32 found_upper, u32 event, u32 port_ref, u32 node, int must) argument
|
/net/ceph/ |
H A D | auth_x.h | 15 struct rb_node node; member in struct:ceph_x_ticket_handler
|
/net/batman-adv/ |
H A D | hash.h | 63 struct hlist_node *node, *node_tmp; local 72 hlist_for_each_safe(node, node_tmp, head) { 73 hlist_del_rcu(node); 76 free_cb(node, arg); 126 struct hlist_node *node; local 138 hlist_for_each(node, head) { 139 if (!compare(node, data)) 168 struct hlist_node *node; local 176 hlist_for_each(node, head) { 177 if (!compare(node, dat [all...] |
/net/core/ |
H A D | gen_estimator.c | 93 struct rb_node node; member in struct:gen_estimator 157 e = rb_entry(parent, struct gen_estimator, node); 164 rb_link_node(&est->node, parent, p); 165 rb_insert_color(&est->node, &est_root); 177 e = rb_entry(p, struct gen_estimator, node); 267 rb_erase(&e->node, &est_root);
|
/net/dccp/ |
H A D | ackvec.h | 86 * @avr_node: the list node in @av_records 125 * @node: FIFO - arranged in descending order of ack_ackno 133 struct list_head node; member in struct:dccp_ackvec_parsed
|
H A D | feat.h | 67 * @node: list pointers, entries arranged in FIFO order 79 struct list_head node; member in struct:dccp_feat_entry
|
/net/ipv4/ |
H A D | udp_diag.c | 104 struct hlist_nulls_node *node; local 111 sk_nulls_for_each(sk, node, &hslot->head) {
|
H A D | inet_timewait_sock.c | 248 * do a fresh re-read of the hlist head node with the 485 struct hlist_nulls_node *node; local 493 sk_nulls_for_each_rcu(sk, node, &head->twchain) { 519 if (get_nulls_value(node) != slot)
|
/net/ipv6/ |
H A D | inet6_hashtables.c | 77 const struct hlist_nulls_node *node; local 89 sk_nulls_for_each_rcu(sk, node, &head->chain) { 103 if (get_nulls_value(node) != slot) 108 sk_nulls_for_each_rcu(sk, node, &head->twchain) { 125 if (get_nulls_value(node) != slot) 166 const struct hlist_nulls_node *node; local 177 sk_nulls_for_each(sk, node, &ilb->head) { 200 if (get_nulls_value(node) != hash + LISTENING_NULLS_BASE) 250 const struct hlist_nulls_node *node; local 257 sk_nulls_for_each(sk2, node, [all...] |
/net/ipx/ |
H A D | ipx_route.c | 30 char *node); 38 list_for_each_entry(r, &ipx_routes, node) 53 unsigned char *node) 69 list_add(&rt->node, &ipx_routes); 79 if (!node) { 83 memcpy(rt->ir_router_node, node, IPX_NODE_LEN); 99 list_for_each_entry_safe(r, tmp, &ipx_routes, node) 101 list_del(&r->node); 128 list_for_each_entry_safe(r, tmp, &ipx_routes, node) 134 list_del(&r->node); 52 ipxrtr_add_route(__be32 network, struct ipx_interface *intrfc, unsigned char *node) argument [all...] |
/net/irda/ |
H A D | discovery.c | 64 discovery_t *discovery, *node; local 67 /* Set time of first discovery if node is new (see below) */ 80 node = discovery; 85 if ((node->data.saddr == new->data.saddr) && 86 ((node->data.daddr == new->data.daddr) || 87 (strcmp(node->data.info, new->data.info) == 0))) 92 hashbin_remove_this(cachelog, (irda_queue_t *) node); 94 if (get_unaligned((__u16 *)node->data.hints) == get_unaligned((__u16 *)new->data.hints)) 95 /* Set time of first discovery for this node */ 96 new->firststamp = node [all...] |
H A D | irias_object.c | 129 struct ias_object *node; local 135 node = hashbin_remove_this(irias_objects, (irda_queue_t *) obj); 136 if (!node) 157 struct ias_attrib *node; local 164 node = hashbin_remove_this(obj->attribs, (irda_queue_t *) attrib); 165 if (!node) 169 __irias_delete_attrib(node); 176 node = (struct ias_attrib *) hashbin_get_first(obj->attribs); 177 if (cleanobject && !node)
|
/net/llc/ |
H A D | llc_proc.c | 40 list_for_each_entry_rcu(sap, &llc_sap_list, node) { 44 struct hlist_nulls_node *node; local 46 sk_nulls_for_each(sk, node, head) { 69 struct hlist_nulls_node *node; local 73 sk_nulls_for_each(sk, node, &sap->sk_laddr_hash[bucket]) 103 list_for_each_entry_continue_rcu(sap, &llc_sap_list, node) {
|
H A D | llc_sap.c | 320 struct hlist_nulls_node *node; local 326 sk_nulls_for_each_rcu(rc, node, laddr_hb) { 345 if (unlikely(get_nulls_value(node) != slot))
|
/net/rds/ |
H A D | cong.c | 55 * This is implemented by having each node maintain bitmaps which indicate 379 struct rb_node *node; local 383 while ((node = rb_first(&rds_cong_tree))) { 384 map = rb_entry(node, struct rds_cong_map, m_rb_node);
|
/net/802/ |
H A D | garp.c | 158 attr = rb_entry(parent, struct garp_attr, node); 179 attr = rb_entry(parent, struct garp_attr, node); 198 rb_link_node(&attr->node, parent, p); 199 rb_insert_color(&attr->node, &app->gid); 205 rb_erase(&attr->node, &app->gid); 385 struct rb_node *node, *next; local 388 for (node = rb_first(&app->gid); 389 next = node ? rb_next(node) : NULL, node ! [all...] |
/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/netfilter/ |
H A D | xt_connlimit.c | 36 struct hlist_node node; member in struct:xt_connlimit_conn 118 hlist_for_each_entry_safe(conn, n, hash, node) { 138 hlist_del(&conn->node); 149 hlist_del(&conn->node); 169 hlist_add_head(&conn->node, hash); 268 hlist_for_each_entry_safe(conn, n, &hash[i], node) { 269 hlist_del(&conn->node);
|
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...] |