/net/unix/ |
H A D | garbage.c | 132 BUG_ON(!list_empty(&u->link)); 133 list_add_tail(&u->link, &gc_inflight_list); 135 BUG_ON(list_empty(&u->link)); 148 BUG_ON(list_empty(&u->link)); 150 list_del_init(&u->link); 224 * to use the list link. 226 BUG_ON(!list_empty(&u->link)); 227 list_add_tail(&u->link, &embryos); 232 u = list_entry(embryos.next, struct unix_sock, link); 234 list_del_init(&u->link); [all...] |
/net/tipc/ |
H A D | discover.c | 38 #include "link.h" 48 * struct tipc_link_req - information about an ongoing link setup request 52 * @num_nodes: number of nodes currently discovered (i.e. with an active link) 68 * tipc_disc_init_msg - initialize a link setup message 112 * tipc_disc_recv_msg - handle incoming link setup message (request or response) 119 struct tipc_link *link; local 164 link = n_ptr->links[b_ptr->identity]; 165 addr_mismatch = (link != NULL) && 166 memcmp(&link->media_addr, &media_addr, sizeof(media_addr)); 171 * If signature is incorrect and there is no working link t [all...] |
H A D | Makefile | 8 core.o handler.o link.o discover.o msg.o \
|
/net/rxrpc/ |
H A D | ar-transport.c | 42 INIT_LIST_HEAD(&trans->link); 90 list_for_each_entry(trans, &rxrpc_transports, link) { 106 list_for_each_entry(trans, &rxrpc_transports, link) { 118 list_add_tail(&trans->link, &rxrpc_transports); 163 list_for_each_entry(trans, &rxrpc_transports, link) { 230 list_for_each_entry_safe(trans, _p, &rxrpc_transports, link) { 240 list_move_tail(&trans->link, &graveyard); 256 link); 257 list_del_init(&trans->link);
|
H A D | ar-peer.c | 71 INIT_LIST_HEAD(&peer->link); 120 list_for_each_entry(peer, &rxrpc_peers, link) { 147 list_for_each_entry(peer, &rxrpc_peers, link) { 162 list_add_tail(&peer->link, &rxrpc_peers); 208 list_for_each_entry(peer, &rxrpc_peers, link) { 267 list_del(&peer->link);
|
H A D | ar-local.c | 41 INIT_LIST_HEAD(&local->link); 106 list_add(&local->link, &rxrpc_locals); 146 list_for_each_entry(local, &rxrpc_locals, link) { 258 list_del(&local->link);
|
H A D | ar-security.c | 52 list_for_each_entry(sec, &rxrpc_security_methods, link) { 82 list_for_each_entry(psec, &rxrpc_security_methods, link) { 87 list_add(&sec->link, &rxrpc_security_methods); 112 list_del_init(&sec->link);
|
H A D | ar-proc.c | 61 call = list_entry(v, struct rxrpc_call, link); 144 conn = list_entry(v, struct rxrpc_connection, link);
|
/net/sched/ |
H A D | sch_atm.c | 62 struct atm_flow_data link; /* unclassified skbs go here */ member in struct:atm_qdisc_data 63 struct list_head flows; /* NB: "link" is also on this 154 if (flow != &p->link) 157 * If flow == &p->link, the qdisc no longer works at this point and 291 list_add(&flow->list, &p->link.list); 314 if (flow->filter_list || flow == &p->link) 354 return flow ? &flow->filter_list : &p->link.filter_list; 390 flow = &p->link; 433 if (flow == &p->link) { 457 if (flow == &p->link) [all...] |
H A D | em_cmp.c | 81 .link = LIST_HEAD_INIT(em_cmp_ops.link)
|
H A D | em_u32.c | 46 .link = LIST_HEAD_INIT(em_u32_ops.link)
|
H A D | cls_basic.c | 34 struct list_head link; member in struct:basic_filter 49 list_for_each_entry(f, &head->flist, link) { 70 list_for_each_entry(f, &head->flist, link) 106 list_for_each_entry_safe(f, n, &head->flist, link) { 107 list_del(&f->link); 118 list_for_each_entry(t, &head->flist, link) 121 list_del(&t->link); 217 list_add(&f->link, &head->flist); 234 list_for_each_entry(f, &head->flist, link) {
|
H A D | sch_cbq.c | 68 internal device queueing, but on a permanently loaded link it is true. 149 struct cbq_class link; member in struct:cbq_sched_data 208 * it allows us to combine link sharing and priority scheduling 211 * Namely, you can put link sharing rules (f.e. route based) at root of CBQ, 221 struct cbq_class *head = &q->link; 273 * Step 3+n. If classifier selected a link sharing class, 761 idle -= L2T(&q->link, len); 797 * only if link is completely congested. 960 incr2 = L2T(&q->link, q->tx_len); 1002 q->link [all...] |
H A D | em_nbyte.c | 62 .link = LIST_HEAD_INIT(em_nbyte_ops.link)
|
H A D | em_ipset.c | 115 .link = LIST_HEAD_INIT(em_ipset_ops.link)
|
H A D | em_canid.c | 222 .link = LIST_HEAD_INIT(em_canid_ops.link)
|
H A D | em_text.c | 140 .link = LIST_HEAD_INIT(em_text_ops.link)
|
H A D | ematch.c | 101 list_for_each_entry(e, &ematch_ops, link) { 135 list_for_each_entry(e, &ematch_ops, link) 139 list_add_tail(&ops->link, &ematch_ops); 161 list_del(&ops->link);
|
/net/ipv4/ |
H A D | ip_tunnel.c | 141 int link, __be16 flags, 161 if (t->parms.link == link) 175 if (t->parms.link == link) 194 if (t->parms.link == link) 208 if (t->parms.link == link) 260 int link local 140 ip_tunnel_lookup(struct ip_tunnel_net *itn, int link, __be16 flags, __be32 remote, __be32 local, __be32 key) argument [all...] |
H A D | ip_vti.c | 261 t->parms.link, 0, IPPROTO_IPIP, 0); 329 flowi4_init_output(&fl4, tunnel->parms.link, 395 flowi4_init_output(&fl4, tunnel->parms.link, 408 if (!tdev && tunnel->parms.link) 409 tdev = __dev_get_by_index(dev_net(dev), tunnel->parms.link); 416 dev->iflink = tunnel->parms.link; 500 if (t->parms.link != p.link) { 501 t->parms.link = p.link; [all...] |
/net/ipv6/ |
H A D | ip6_gre.c | 121 int link = dev->ifindex; local 142 if (t->parms.link != link) 166 if (t->parms.link != link) 192 if (t->parms.link != link) 215 if (t->parms.link != link) 292 int link local [all...] |
H A D | sit.c | 104 (!dev || !t->parms.link || dev->iflink == t->parms.link) && 110 (!dev || !t->parms.link || dev->iflink == t->parms.link) && 116 (!dev || !t->parms.link || dev->iflink == t->parms.link) && 238 parms->link == t->parms.link) { 771 tunnel->parms.link); 896 tunnel->parms.link); [all...] |
/net/lapb/ |
H A D | Kconfig | 8 Link Access Procedure, Balanced (LAPB) is the data link layer (i.e.
|
/net/dsa/ |
H A D | dsa.c | 214 /* link polling *************************************************************/ 298 struct device_node *link) 307 parent_sw = of_get_parent(link); 330 reg = of_get_property(link, "reg", NULL); 366 struct device_node *child, *mdio, *ethernet, *port, *link; local 441 link = of_parse_phandle(port, "link", 0); 443 if (!strcmp(port_name, "dsa") && link && 446 chip_index, link); 295 dsa_of_setup_routing_table(struct dsa_platform_data *pd, struct dsa_chip_data *cd, int chip_index, struct device_node *link) argument
|
/net/irda/ |
H A D | irlmp.c | 244 * Find out if we should remove this LSAP from a link or from the 245 * list of unconnected lsaps (not associated with a link) 259 /* Now, remove from the link */ 329 * We set only this variable so IrLAP can tell us on which link the 344 struct lap_cb *link; local 349 * that no more LSAPs will be open on this link and no discovery 351 link = hashbin_remove(irlmp->links, saddr, NULL); 352 if (link) { 353 IRDA_ASSERT(link->magic == LMP_LAP_MAGIC, return;); 355 /* Kill all the LSAPs on this link 1299 irlmp_status_indication(struct lap_cb *self, LINK_STATUS link, LOCK_STATUS lock) argument [all...] |