Searched defs:next (Results 1 - 25 of 102) sorted by relevance

12345

/net/tipc/
H A Dbcast.h58 * @next: pointer to next entry in list
63 struct tipc_port_list *next; member in struct:tipc_port_list
/net/atm/
H A Dmpc.h15 struct mpoa_client *next; member in struct:mpoa_client
41 struct atm_mpoa_qos *next; member in struct:atm_mpoa_qos
H A Dlec_arpc.h14 struct hlist_node next; /* Linked entry list */ member in struct:lec_arp_table
H A Dmpoa_caches.h15 struct in_cache_entry *next; member in struct:in_cache_entry
52 struct eg_cache_entry *next; member in struct:eg_cache_entry
/net/ax25/
H A Dax25_iface.c38 struct listen_struct *next; member in struct:listen_struct
51 ap->next = protocol_list;
68 protocol_list = protocol->next;
72 while (protocol != NULL && protocol->next != NULL) {
73 if (protocol->next->pid == pid) {
74 protocol->next = protocol->next->next;
78 protocol = protocol->next;
118 listen->next
[all...]
H A Dax25_out.c249 unsigned short start, end, next; local
291 next = (ax25->vs + 1) % ax25->modulus;
292 last = (next == end);
312 ax25->vs = next;
/net/dccp/ccids/lib/
H A Dpacket_history.h45 * @next: next oldest entry (LIFO order)
50 struct tfrc_tx_hist_entry *next; member in struct:tfrc_tx_hist_entry
59 head = head->next;
H A Dpacket_history.c70 entry->next = *headp;
80 struct tfrc_tx_hist_entry *next = head->next; local
83 head = next;
445 h->rtt_sample_prev = 0; /* use current entry as next reference */
/net/mac802154/
H A Dieee802154_dev.c272 struct mac802154_sub_if_data *sdata, *next; local
283 list_for_each_entry_safe(sdata, next, &priv->slaves, list) {
/net/ipx/
H A Dipx_proc.c137 struct sock* sk, *next; local
153 next = sk_next(sk);
154 if (next) {
155 sk = next;
163 if (i->node.next == &ipx_interfaces)
165 i = list_entry(i->node.next, struct ipx_interface, node);
227 .next = ipx_seq_interface_next,
234 .next = ipx_seq_route_next,
241 .next = ipx_seq_socket_next,
/net/llc/
H A Dllc_proc.c82 struct sock* sk, *next; local
92 next = sk_nulls_next(sk);
93 if (next) {
94 sk = next;
205 .next = llc_seq_next,
212 .next = llc_seq_next,
/net/rds/
H A Diw.c131 struct rds_iw_cm_id *i_cm_id, *next; local
138 list_for_each_entry_safe(i_cm_id, next, &rds_iwdev->cm_id_list, list) {
/net/unix/
H A Dgarbage.c160 struct sk_buff *next; local
163 skb_queue_walk_safe(&x->sk_receive_queue, skb, next) {
210 struct sk_buff *next; local
219 skb_queue_walk_safe(&x->sk_receive_queue, skb, next) {
232 u = list_entry(embryos.next, struct unix_sock, link);
279 struct unix_sock *next; local
307 list_for_each_entry_safe(u, next, &gc_inflight_list, link) {
339 while (cursor.next != &gc_candidates) {
340 u = list_entry(cursor.next, struct unix_sock, link);
358 u = list_entry(not_cycle_list.next, struc
[all...]
/net/wireless/
H A Dlib80211.c122 struct lib80211_crypt_data *entry, *next; local
126 list_for_each_entry_safe(entry, next, &info->crypt_deinit_list, list) {
/net/802/
H A Dgarp.c327 * order to retry on next TRANSMIT_PDU event. */
385 struct rb_node *node, *next; local
389 next = node ? rb_next(node) : NULL, node != NULL;
390 node = next) {
/net/core/
H A Ddst.c68 struct dst_entry *dst, *next, head; local
72 next = dst_busy_list;
75 while ((dst = next) != NULL) {
76 next = dst->next;
77 prefetch(&next->next);
80 last->next = dst;
101 dst->next = next;
[all...]
/net/dccp/
H A Dackvec.c33 struct dccp_ackvec_record *cur, *next; local
35 list_for_each_entry_safe(cur, next, &av->av_records, avr_node)
287 struct dccp_ackvec_record *avr, *next; local
314 * backwards (towards higher indices), to its next-oldest neighbour.
341 list_for_each_entry_safe_from(avr, next, &av->av_records, avr_node) {
367 struct dccp_ackvec_parsed *cur, *next; local
369 list_for_each_entry_safe(cur, next, parsed_chunks, node)
/net/dccp/ccids/
H A Dccid2.c237 struct ccid2_seq *next; local
266 next = hc->tx_seqh->ccid2s_next;
268 if (next == hc->tx_seqt) {
274 next = hc->tx_seqh->ccid2s_next;
275 BUG_ON(next == hc->tx_seqt);
277 hc->tx_seqh = next;
/net/ipv6/
H A Danycast.c203 struct ipv6_ac_socklist *next = pac->acl_next; local
212 pac = next;
512 .next = ac6_seq_next,
/net/irda/irnet/
H A Dirnet_ppp.c51 char * next; /* Next command to process */ local
73 next = command;
74 while(next != NULL)
76 /* Look at the next command */
77 start = next;
83 next = strchr(start, ',');
84 if(next)
86 *next = '\0'; /* Terminate command */
87 length = next - start; /* Length */
88 next
[all...]
/net/netfilter/ipset/
H A Dip_set_hash_ip.c84 hash_ip4_data_next(struct hash_ip4_elem *next, const struct hash_ip4_elem *e) argument
86 next->ip = e->ip;
166 ip = ntohl(h->next.ip);
232 hash_ip6_data_next(struct hash_ip4_elem *next, const struct hash_ip6_elem *e) argument
H A Dip_set_hash_ipport.c101 hash_ipport4_data_next(struct hash_ipport4_elem *next, argument
104 next->ip = d->ip;
105 next->port = d->port;
207 ip = ntohl(h->next.ip);
209 p = retried && ip == ntohl(h->next.ip) ? ntohs(h->next.port)
286 hash_ipport6_data_next(struct hash_ipport4_elem *next, argument
289 next->port = d->port;
380 port = ntohs(h->next.port);
H A Dip_set_hash_ipportip.c105 hash_ipportip4_data_next(struct hash_ipportip4_elem *next, argument
108 next->ip = d->ip;
109 next->port = d->port;
216 ip = ntohl(h->next.ip);
218 p = retried && ip == ntohl(h->next.ip) ? ntohs(h->next.port)
301 hash_ipportip6_data_next(struct hash_ipportip4_elem *next, argument
304 next->port = d->port;
398 port = ntohs(h->next.port);
/net/netfilter/
H A Dnf_conntrack_helper.c396 const struct hlist_node *next; local
402 hlist_for_each_entry_safe(exp, next,
/net/sched/
H A Dcls_fw.c40 struct fw_filter *next; member in struct:fw_filter
90 for (f = head->ht[fw_hash(id)]; f; f = f->next) {
125 for (f = head->ht[fw_hash(handle)]; f; f = f->next) {
159 head->ht[h] = f->next;
175 for (fp = &head->ht[fw_hash(f->id)]; *fp; fp = &(*fp)->next) {
178 *fp = f->next;
289 f->next = head->ht[fw_hash(handle)];
316 for (f = head->ht[h]; f; f = f->next) {

Completed in 688 milliseconds

12345