| /net/sched/ |
| D | cls_u32.c | 105 struct tc_u_knode *n; in u32_classify() local
115 n = ht->ht[sel]; in u32_classify()
118 if (n) { in u32_classify()
119 struct tc_u32_key *key = n->sel.keys; in u32_classify()
122 n->pf->rcnt +=1; in u32_classify()
127 if ((skb->mark & n->mark.mask) != n->mark.val) { in u32_classify()
128 n = n->next; in u32_classify()
131 n->mark.success++; in u32_classify()
135 for (i = n->sel.nkeys; i>0; i--, key++) { in u32_classify()
138 n = n->next; in u32_classify()
[all …]
|
| D | sch_teql.c | 124 teql_neigh_release(struct neighbour *n) in teql_neigh_release() argument
126 if (n) in teql_neigh_release()
127 neigh_release(n); in teql_neigh_release()
227 struct neighbour *n = q->ncache; in __teql_resolve() local
231 if (n && n->tbl == mn->tbl && in __teql_resolve()
232 memcmp(n->primary_key, mn->primary_key, mn->tbl->key_len) == 0) { in __teql_resolve()
233 atomic_inc(&n->refcnt); in __teql_resolve()
235 n = __neigh_lookup_errno(mn->tbl, mn->primary_key, dev); in __teql_resolve()
236 if (IS_ERR(n)) in __teql_resolve()
237 return PTR_ERR(n); in __teql_resolve()
[all …]
|
| D | cls_api.c | 101 static int tfilter_notify(struct sk_buff *oskb, struct nlmsghdr *n,
119 static int tc_ctl_tfilter(struct sk_buff *skb, struct nlmsghdr *n, void *arg) in tc_ctl_tfilter() argument
143 t = NLMSG_DATA(n); in tc_ctl_tfilter()
152 if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE)) in tc_ctl_tfilter()
164 err = nlmsg_parse(n, sizeof(*t), tca, TCA_MAX, NULL); in tc_ctl_tfilter()
217 if (n->nlmsg_type != RTM_NEWTFILTER || !(n->nlmsg_flags&NLM_F_CREATE)) in tc_ctl_tfilter()
280 if (n->nlmsg_type == RTM_DELTFILTER && t->tcm_handle == 0) { in tc_ctl_tfilter()
285 tfilter_notify(skb, n, tp, fh, RTM_DELTFILTER); in tc_ctl_tfilter()
292 if (n->nlmsg_type != RTM_NEWTFILTER || in tc_ctl_tfilter()
293 !(n->nlmsg_flags & NLM_F_CREATE)) in tc_ctl_tfilter()
[all …]
|
| D | sch_api.c | 37 static int qdisc_notify(struct sk_buff *oskb, struct nlmsghdr *n, u32 clid,
39 static int tclass_notify(struct sk_buff *oskb, struct nlmsghdr *n,
488 static struct hlist_head *qdisc_class_hash_alloc(unsigned int n) in qdisc_class_hash_alloc() argument
490 unsigned int size = n * sizeof(struct hlist_head), i; in qdisc_class_hash_alloc()
500 for (i = 0; i < n; i++) in qdisc_class_hash_alloc()
506 static void qdisc_class_hash_free(struct hlist_head *h, unsigned int n) in qdisc_class_hash_free() argument
508 unsigned int size = n * sizeof(struct hlist_head); in qdisc_class_hash_free()
519 struct hlist_node *n, *next; in qdisc_class_hash_grow() local
538 hlist_for_each_entry_safe(cl, n, next, &ohash[i], hnode) { in qdisc_class_hash_grow()
634 void qdisc_tree_decrease_qlen(struct Qdisc *sch, unsigned int n) in qdisc_tree_decrease_qlen() argument
[all …]
|
| /net/tipc/ |
| D | msg.h | 110 static inline void msg_set_user(struct tipc_msg *m, u32 n) in msg_set_user() argument
112 msg_set_bits(m, 0, 25, 0xf, n); in msg_set_user()
120 static inline void msg_set_hdr_sz(struct tipc_msg *m,u32 n) in msg_set_hdr_sz() argument
122 msg_set_bits(m, 0, 21, 0xf, n>>2); in msg_set_hdr_sz()
130 static inline void msg_set_non_seq(struct tipc_msg *m, u32 n) in msg_set_non_seq() argument
132 msg_set_bits(m, 0, 20, 1, n); in msg_set_non_seq()
165 static inline void msg_set_type(struct tipc_msg *m, u32 n) in msg_set_type() argument
167 msg_set_bits(m, 1, 29, 0x7, n); in msg_set_type()
195 static inline void msg_set_lookup_scope(struct tipc_msg *m, u32 n) in msg_set_lookup_scope() argument
197 msg_set_bits(m, 1, 19, 0x3, n); in msg_set_lookup_scope()
[all …]
|
| /net/core/ |
| D | neighbour.c | 59 static void __neigh_notify(struct neighbour *n, int type, int flags);
138 struct neighbour *n, **np; in neigh_forced_gc() local
141 while ((n = *np) != NULL) { in neigh_forced_gc()
146 write_lock(&n->lock); in neigh_forced_gc()
147 if (atomic_read(&n->refcnt) == 1 && in neigh_forced_gc()
148 !(n->nud_state & NUD_PERMANENT)) { in neigh_forced_gc()
149 *np = n->next; in neigh_forced_gc()
150 n->dead = 1; in neigh_forced_gc()
152 write_unlock(&n->lock); in neigh_forced_gc()
153 neigh_cleanup_and_release(n); in neigh_forced_gc()
[all …]
|
| /net/irda/ |
| D | parameters.c | 132 int n = 0; in irda_insert_integer() local
171 n += irda_param_pack(buf, "bbb", p.pi, p.pl, (__u8) p.pv.i); in irda_insert_integer()
178 n += irda_param_pack(buf, "bbs", p.pi, p.pl, (__u16) p.pv.i); in irda_insert_integer()
185 n += irda_param_pack(buf, "bbi", p.pi, p.pl, p.pv.i); in irda_insert_integer()
208 int n = 0; in irda_extract_integer() local
253 n += irda_param_unpack(buf+2, "b", &p.pv.i); in irda_extract_integer()
256 n += irda_param_unpack(buf+2, "s", &p.pv.i); in irda_extract_integer()
263 n += irda_param_unpack(buf+2, "i", &p.pv.i); in irda_extract_integer()
370 int n = 0; in irda_param_pack() local
377 buf[n++] = (__u8)va_arg(args, int); in irda_param_pack()
[all …]
|
| D | iriap.c | 443 int n; in iriap_getvaluebyclass_confirm() local
451 n = 2; in iriap_getvaluebyclass_confirm()
454 len = get_unaligned_be16(fp + n); in iriap_getvaluebyclass_confirm()
455 n += 2; in iriap_getvaluebyclass_confirm()
460 obj_id = get_unaligned_be16(fp + n); in iriap_getvaluebyclass_confirm()
461 n += 2; in iriap_getvaluebyclass_confirm()
463 type = fp[n++]; in iriap_getvaluebyclass_confirm()
468 memcpy(&tmp_cpu32, fp+n, 4); n += 4; in iriap_getvaluebyclass_confirm()
476 charset = fp[n++]; in iriap_getvaluebyclass_confirm()
500 value_len = fp[n++]; in iriap_getvaluebyclass_confirm()
[all …]
|
| D | wrapper.c | 88 int n; in async_wrap_skb() local
96 n = 0; in async_wrap_skb()
123 memset(tx_buff + n, XBOF, xbofs); in async_wrap_skb()
124 n += xbofs; in async_wrap_skb()
127 tx_buff[n++] = BOF; in async_wrap_skb()
136 if(n >= (buffsize-5)) { in async_wrap_skb()
138 __func__, n); in async_wrap_skb()
139 return n; in async_wrap_skb()
142 n += stuff_byte(skb->data[i], tx_buff+n); in async_wrap_skb()
149 n += stuff_byte(fcs.bytes[0], tx_buff+n); in async_wrap_skb()
[all …]
|
| D | irttp.c | 236 int n = 0; /* Fragment index */ in irttp_reassemble_skb() local
259 skb_copy_to_linear_data_offset(skb, n, frag->data, frag->len); in irttp_reassemble_skb()
260 n += frag->len; in irttp_reassemble_skb()
267 __func__, n, self->rx_sdu_size, self->rx_max_sdu_size); in irttp_reassemble_skb()
274 IRDA_ASSERT(n <= self->rx_sdu_size, n = self->rx_sdu_size;); in irttp_reassemble_skb()
277 skb_trim(skb, n); in irttp_reassemble_skb()
704 int n; in irttp_run_tx_queue() local
728 n = self->avail_credit; in irttp_run_tx_queue()
732 if (n > 127) { in irttp_run_tx_queue()
733 self->avail_credit = n-127; in irttp_run_tx_queue()
[all …]
|
| /net/xfrm/ |
| D | xfrm_hash.c | 17 struct hlist_head *n; in xfrm_hash_alloc() local
20 n = kzalloc(sz, GFP_KERNEL); in xfrm_hash_alloc()
22 n = __vmalloc(sz, GFP_KERNEL | __GFP_ZERO, PAGE_KERNEL); in xfrm_hash_alloc()
24 n = (struct hlist_head *) in xfrm_hash_alloc()
28 return n; in xfrm_hash_alloc()
31 void xfrm_hash_free(struct hlist_head *n, unsigned int sz) in xfrm_hash_free() argument
34 kfree(n); in xfrm_hash_free()
36 vfree(n); in xfrm_hash_free()
38 free_pages((unsigned long)n, get_order(sz)); in xfrm_hash_free()
|
| /net/ipv4/ |
| D | fib_trie.c | 94 #define IS_TNODE(n) (!(n->parent & T_LEAF)) argument
95 #define IS_LEAF(n) (n->parent & T_LEAF) argument
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,
432 static inline int tnode_full(const struct tnode *tn, const struct node *n) in tnode_full() argument
434 if (n == NULL || IS_LEAF(n)) in tnode_full()
437 return ((struct tnode *) n)->pos == tn->pos + tn->bits; in tnode_full()
441 struct node *n) in put_child() argument
443 tnode_put_child_reorg(tn, i, n, -1); in put_child()
451 static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n, in tnode_put_child_reorg() argument
[all …]
|
| D | arp.c | 469 struct neighbour *n; in arp_find() local
482 n = __neigh_lookup(&arp_tbl, &paddr, dev, 1); in arp_find()
484 if (n) { in arp_find()
485 n->used = jiffies; in arp_find()
486 if (n->nud_state&NUD_VALID || neigh_event_send(n, skb) == 0) { in arp_find()
487 read_lock_bh(&n->lock); in arp_find()
488 memcpy(haddr, n->ha, dev->addr_len); in arp_find()
489 read_unlock_bh(&n->lock); in arp_find()
490 neigh_release(n); in arp_find()
493 neigh_release(n); in arp_find()
[all …]
|
| D | inetpeer.c | 261 #define link_to_pool(n) \ argument
263 n->avl_height = 1; \
264 n->avl_left = peer_avl_empty; \
265 n->avl_right = peer_avl_empty; \
266 **--stackptr = n; \
366 struct inet_peer *p, *n; in inet_getpeer() local
387 n = kmem_cache_alloc(peer_cachep, GFP_ATOMIC); in inet_getpeer()
388 if (n == NULL) in inet_getpeer()
390 n->v4daddr = daddr; in inet_getpeer()
391 atomic_set(&n->refcnt, 1); in inet_getpeer()
[all …]
|
| /net/netlabel/ |
| D | netlabel_addrlist.h | 77 struct netlbl_af4list *n = __af4list_entry(s); in __af4list_valid() local
78 while (i != h && !n->valid) { in __af4list_valid()
80 n = __af4list_entry(i); in __af4list_valid()
82 return n; in __af4list_valid()
89 struct netlbl_af4list *n = __af4list_entry(s); in __af4list_valid_rcu() local
90 while (i != h && !n->valid) { in __af4list_valid_rcu()
92 n = __af4list_entry(i); in __af4list_valid_rcu()
94 return n; in __af4list_valid_rcu()
145 struct netlbl_af6list *n = __af6list_entry(s); in __af6list_valid() local
146 while (i != h && !n->valid) { in __af6list_valid()
[all …]
|
| /net/ax25/ |
| D | ax25_addr.c | 53 int n; in ax2asc() local
55 for (n = 0, s = buf; n < 6; n++) { in ax2asc()
56 c = (a->ax25_call[n] >> 1) & 0x7F; in ax2asc()
63 if ((n = ((a->ax25_call[6] >> 1) & 0x0F)) > 9) { in ax2asc()
65 n -= 10; in ax2asc()
68 *s++ = n + '0'; in ax2asc()
86 int n; in asc2ax() local
88 for (s = callsign, n = 0; n < 6; n++) { in asc2ax()
90 addr->ax25_call[n] = *s++; in asc2ax()
92 addr->ax25_call[n] = ' '; in asc2ax()
[all …]
|
| D | sysctl_net_ax25.c | 192 int n, k; in ax25_register_sysctl() local
203 for (n = 0, ax25_dev = ax25_dev_list; ax25_dev != NULL; ax25_dev = ax25_dev->next) { in ax25_register_sysctl()
208 while (n--) in ax25_register_sysctl()
209 kfree(ax25_table[n].child); in ax25_register_sysctl()
214 ax25_table[n].child = ax25_dev->systable = child; in ax25_register_sysctl()
215 ax25_table[n].ctl_name = n + 1; in ax25_register_sysctl()
216 ax25_table[n].procname = ax25_dev->dev->name; in ax25_register_sysctl()
217 ax25_table[n].mode = 0555; in ax25_register_sysctl()
224 n++; in ax25_register_sysctl()
|
| /net/9p/ |
| D | trans_fd.c | 225 int ret, n; in p9_fd_poll() local
245 n = ts->wr->f_op->poll(ts->wr, pt); in p9_fd_poll()
246 if (n < 0) in p9_fd_poll()
247 return n; in p9_fd_poll()
248 ret = (ret & ~POLLOUT) | (n & ~POLLIN); in p9_fd_poll()
290 int n, err; in p9_read_work() local
326 n = le32_to_cpu(*(__le32 *) m->rbuf); /* read packet size */ in p9_read_work()
327 if (n >= m->client->msize) { in p9_read_work()
329 "requested packet size too big: %d\n", n); in p9_read_work()
336 "mux %p pkt: size: %d bytes tag: %d\n", m, n, tag); in p9_read_work()
[all …]
|
| /net/sunrpc/xprtrdma/ |
| D | rpc_rdma.c | 89 int len, n = 0, p; in rpcrdma_convert_iovs() local
92 seg[n].mr_page = NULL; in rpcrdma_convert_iovs()
93 seg[n].mr_offset = xdrbuf->head[0].iov_base; in rpcrdma_convert_iovs()
94 seg[n].mr_len = xdrbuf->head[0].iov_len; in rpcrdma_convert_iovs()
95 ++n; in rpcrdma_convert_iovs()
99 if (n == nsegs) in rpcrdma_convert_iovs()
101 seg[n].mr_page = xdrbuf->pages[0]; in rpcrdma_convert_iovs()
102 seg[n].mr_offset = (void *)(unsigned long) xdrbuf->page_base; in rpcrdma_convert_iovs()
103 seg[n].mr_len = min_t(u32, in rpcrdma_convert_iovs()
105 len = xdrbuf->page_len - seg[n].mr_len; in rpcrdma_convert_iovs()
[all …]
|
| /net/rose/ |
| D | af_rose.c | 669 int n; in rose_bind() local
709 for (n = 0 ; n < addr->srose_ndigis ; n++) in rose_bind()
710 rose->source_digis[n] = full_addr->srose_digis[n]; in rose_bind()
732 int n, err = 0; in rose_connect() local
815 for (n = 0 ; n < addr->srose_ndigis ; n++) in rose_connect()
816 rose->dest_digis[n] = full_addr->srose_digis[n]; in rose_connect()
958 int n; in rose_getname() local
967 for (n = 0; n < rose->dest_ndigis; n++) in rose_getname()
968 srose->srose_digis[n] = rose->dest_digis[n]; in rose_getname()
974 for (n = 0; n < rose->source_ndigis; n++) in rose_getname()
[all …]
|
| /net/appletalk/ |
| D | aarp.c | 255 static void __aarp_expire_timer(struct aarp_entry **n) in __aarp_expire_timer() argument
259 while (*n) in __aarp_expire_timer()
261 if (time_after(jiffies, (*n)->expires_at)) { in __aarp_expire_timer()
262 t = *n; in __aarp_expire_timer()
263 *n = (*n)->next; in __aarp_expire_timer()
266 n = &((*n)->next); in __aarp_expire_timer()
274 static void __aarp_kick(struct aarp_entry **n) in __aarp_kick() argument
278 while (*n) in __aarp_kick()
280 if ((*n)->xmit_count >= sysctl_aarp_retransmit_limit) { in __aarp_kick()
281 t = *n; in __aarp_kick()
[all …]
|
| /net/netfilter/ |
| D | xt_u32.c | 25 __be32 n; in u32_match_it() local
42 if (skb_copy_bits(skb, pos, &n, sizeof(n)) < 0) in u32_match_it()
44 val = ntohl(n); in u32_match_it()
69 if (skb_copy_bits(skb, at + pos, &n, in u32_match_it()
70 sizeof(n)) < 0) in u32_match_it()
72 val = ntohl(n); in u32_match_it()
|
| D | nf_conntrack_helper.c | 53 struct hlist_node *n; in __nf_ct_helper_find() local
60 hlist_for_each_entry_rcu(helper, n, &nf_ct_helper_hash[h], hnode) { in __nf_ct_helper_find()
71 struct hlist_node *n; in __nf_conntrack_helper_find_byname() local
75 hlist_for_each_entry_rcu(h, n, &nf_ct_helper_hash[i], hnode) { in __nf_conntrack_helper_find_byname()
160 const struct hlist_node *n, *next; in __nf_conntrack_helper_unregister() local
165 hlist_for_each_entry_safe(exp, n, next, in __nf_conntrack_helper_unregister()
177 hlist_for_each_entry(h, n, &net->ct.unconfirmed, hnode) in __nf_conntrack_helper_unregister()
180 hlist_for_each_entry(h, n, &net->ct.hash[i], hnode) in __nf_conntrack_helper_unregister()
|
| /net/dsa/ |
| D | Kconfig | 3 default n
16 default n
20 default n
24 default n
30 default n
41 default n
|
| /net/bluetooth/bnep/ |
| D | core.c | 127 int n; in bnep_ctrl_set_netfilter() local
132 n = get_unaligned_be16(data); in bnep_ctrl_set_netfilter()
135 if (len < n) in bnep_ctrl_set_netfilter()
138 BT_DBG("filter len %d", n); in bnep_ctrl_set_netfilter()
141 n /= 4; in bnep_ctrl_set_netfilter()
142 if (n <= BNEP_MAX_PROTO_FILTERS) { in bnep_ctrl_set_netfilter()
146 for (i = 0; i < n; i++) { in bnep_ctrl_set_netfilter()
157 if (n == 0) in bnep_ctrl_set_netfilter()
172 int n; in bnep_ctrl_set_mcfilter() local
177 n = get_unaligned_be16(data); in bnep_ctrl_set_mcfilter()
[all …]
|