Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 264) sorted by relevance

1234567891011

/net/tipc/
A Dnode.c243 if (!n) in tipc_node_get_id()
295 return (n) ? n->crypto_rx : NULL; in tipc_node_crypto_rx_by_addr()
412 TIPC_LINK_STATE, n->addr, n->addr); in tipc_node_write_unlock()
482 if (n) { in tipc_node_create()
491 n->capabilities, &n->bc_entry.inputq1, in tipc_node_create()
538 n = kzalloc(sizeof(*n), GFP_ATOMIC); in tipc_node_create()
581 n->capabilities, &n->bc_entry.inputq1, in tipc_node_create()
811 if (!node_is_up(n) && tipc_node_cleanup(n)) { in tipc_node_timeout()
1111 if (!n) in tipc_node_is_up()
1192 if (!n) in tipc_node_check_dest()
[all …]
A Dmsg.h254 msg_set_bits(m, 0, 25, 0xf, n); in msg_set_user()
289 msg_set_bits(m, 0, 20, 1, n); in msg_set_non_seq()
387 msg_set_bits(m, 1, 29, 0x7, n); in msg_set_type()
653 msg_set_word(m, 8, n); in msg_set_nametype()
668 msg_set_word(m, 9, n); in msg_set_namelower()
673 msg_set_namelower(m, n); in msg_set_nameinst()
683 msg_set_word(m, 10, n); in msg_set_nameupper()
787 msg_set_word(m, 2, n); in msg_set_dest_domain()
920 msg_set_bits(m, 5, 9, 0x7, n); in msg_set_bearer_id()
1125 msg_set_word(m, 13, n); in msg_set_peer_net_hash()
[all …]
A Dname_table.c135 if (!n || service_range_entry(n)->max < start)
138 while (n) {
145 n = l;
160 n = r;
184 while (n) { in service_range_match_next()
197 while ((p = rb_parent(n)) && n == p->rb_right) in service_range_match_next()
198 n = p; in service_range_match_next()
209 n = p; in service_range_match_next()
305 while (*n) { in tipc_service_create_range()
744 for (n = rb_first(&sc->ranges); n; n = rb_next(n)) { in tipc_nametbl_build_group()
[all …]
A Dgroup.c239 while (n) { in tipc_group_find_member()
243 n = n->rb_left; in tipc_group_find_member()
245 n = n->rb_right; in tipc_group_find_member()
267 struct rb_node *n; in tipc_group_find_node() local
269 for (n = rb_first(&grp->members); n; n = rb_next(n)) { in tipc_group_find_node()
285 while (*n) { in tipc_group_add_to_tree()
287 parent = *n; in tipc_group_add_to_tree()
291 n = &(*n)->rb_left; in tipc_group_add_to_tree()
293 n = &(*n)->rb_right; in tipc_group_add_to_tree()
399 struct rb_node *n; in tipc_group_update_bc_members() local
[all …]
/net/sched/
A Dcls_u32.c147 n = rcu_dereference_bh(n->next); in u32_classify()
152 if ((skb->mark & n->mask) != n->val) { in u32_classify()
153 n = rcu_dereference_bh(n->next); in u32_classify()
171 n = rcu_dereference_bh(n->next); in u32_classify()
187 n = rcu_dereference_bh(n->next); in u32_classify()
195 n = rcu_dereference_bh(n->next); in u32_classify()
201 n = rcu_dereference_bh(n->next); in u32_classify()
290 n = rtnl_dereference(n->next)) in u32_lookup_key()
544 &n->flags, &n->in_hw_count, true); in u32_remove_hw_knode()
1226 n = rtnl_dereference(n->next)) { in u32_walk()
[all …]
A Dsch_api.c674 for (i = 0; i < n; i++) in qdisc_class_hash_alloc()
784 drops = max_t(int, n, 0); in qdisc_tree_reduce_backlog()
808 sch->q.qlen -= n; in qdisc_tree_reduce_backlog()
1019 struct nlmsghdr *n, u32 clid, in qdisc_notify() argument
1565 n->nlmsg_flags & NLM_F_REPLACE); in req_create_or_replace()
1571 n->nlmsg_flags & NLM_F_EXCL); in req_create_exclusive()
1690 req_create_exclusive(n)) in __tc_modify_qdisc()
1692 else if (req_change(n)) in __tc_modify_qdisc()
1806 tcm = nlmsg_data(n); in tc_modify_qdisc()
2083 if (n && tp->ops->bind_class) { in tcf_node_bind()
[all …]
/net/ipv4/
A Dfib_trie.c117 #define IS_TRIE(n) ((n)->pos >= KEYLENGTH) argument
118 #define IS_TNODE(n) ((n)->bits) argument
119 #define IS_LEAF(n) (!(n)->bits) argument
406 return n && ((n->pos + n->bits) == tn->pos) && IS_TNODE(n); in tnode_full()
435 if (n && (tn->slen < n->slen)) in put_child()
723 if (!n || (n->slen <= slen)) in update_suffix()
938 n = get_child_rcu(n, index); in fib_find_node()
1474 if (n->slen > n->pos) { in fib_table_lookup()
1479 n = get_child_rcu(n, index); in fib_table_lookup()
1493 if (unlikely(prefix_mismatch(key, n)) || (n->slen == n->pos)) in fib_table_lookup()
[all …]
A Darp.c713 struct neighbour *n; in arp_process() local
853 if (n) { in arp_process()
869 if (n) in arp_process()
904 if (!n && in arp_process()
915 if (n) { in arp_process()
937 neigh_release(n); in arp_process()
1388 int n; in ax2asc2() local
1390 for (n = 0, s = buf; n < 6; n++) { in ax2asc2()
1399 if (n > 9) { in ax2asc2()
1401 n -= 10; in ax2asc2()
[all …]
/net/ceph/
A Ddebugfs.c69 for (n = rb_first(&map->pg_pools); n; n = rb_next(n)) { in osdmap_show()
92 for (n = rb_first(&map->pg_temp); n; n = rb_next(n)) { in osdmap_show()
103 for (n = rb_first(&map->primary_temp); n; n = rb_next(n)) { in osdmap_show()
110 for (n = rb_first(&map->pg_upmap); n; n = rb_next(n)) { in osdmap_show()
121 for (n = rb_first(&map->pg_upmap_items); n; n = rb_next(n)) { in osdmap_show()
239 for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) { in dump_requests()
265 for (n = rb_first(&osd->o_linger_requests); n; n = rb_next(n)) { in dump_linger_requests()
326 for (n = rb_first(&osd->o_backoffs_by_id); n; n = rb_next(n)) { in dump_backoffs()
352 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in osdc_show()
360 for (n = rb_first(&osdc->osds); n; n = rb_next(n)) { in osdc_show()
[all …]
/net/core/
A Dneighbour.c170 list_add_tail(&n->gc_list, &n->tbl->gc_list); in neigh_update_gc_list()
311 if (time_before(n->used, n->confirmed)) in neigh_add_timer()
312 n->used = n->confirmed; in neigh_add_timer()
529 n->updated = n->used = now; in neigh_alloc()
611 hash = tbl->hash(n->primary_key, n->dev, in neigh_hash_grow()
774 (n->dev == dev || !n->dev)) in pneigh_lookup()
834 netdev_put(n->dev, &n->dev_tracker); in pneigh_destroy()
1019 if (time_before(n->used, n->confirmed) && in neigh_periodic_work()
1021 n->used = n->confirmed; in neigh_periodic_work()
2829 n = rcu_dereference(n->next)) { in pneigh_dump_table()
[all …]
A Ddev.h213 return READ_ONCE(n->defer_hard_irqs); in napi_get_defer_hard_irqs()
223 WRITE_ONCE(n->defer_hard_irqs, defer); in napi_set_defer_hard_irqs()
254 napi_get_gro_flush_timeout(const struct napi_struct *n) in napi_get_gro_flush_timeout() argument
256 return READ_ONCE(n->gro_flush_timeout); in napi_get_gro_flush_timeout()
269 WRITE_ONCE(n->gro_flush_timeout, timeout); in napi_set_gro_flush_timeout()
302 return READ_ONCE(n->irq_suspend_timeout); in napi_get_irq_suspend_timeout()
315 WRITE_ONCE(n->irq_suspend_timeout, timeout); in napi_set_irq_suspend_timeout()
320 if (test_bit(NAPI_STATE_THREADED, &n->state)) in napi_get_threaded()
329 if (n->config) in napi_get_threaded_config()
330 return n->config->threaded; in napi_get_threaded_config()
[all …]
/net/netfilter/ipset/
A Dip_set_hash_gen.h344 h->nets[i].cidr[n] = h->nets[i - 1].cidr[n]; in mtype_add_cidr()
365 h->nets[j].cidr[n] = h->nets[j + 1].cidr[n]; in mtype_del_cidr()
410 if (!n) in mtype_flush()
436 if (!n) in mtype_ahash_destroy()
499 if (!n) in mtype_gc_do()
686 if (!n) in mtype_resize()
936 if (n->pos >= n->size) { in mtype_add()
950 n = kzalloc(sizeof(*n) + in mtype_add()
1059 if (!n) in mtype_del()
1189 if (!n) in mtype_test_cidrs()
[all …]
A Dip_set_list_set.c177 struct set_elem *e, *n; in set_cleanup_entries() local
245 n = prev = next = NULL; in list_set_uadd()
251 n = e; in list_set_uadd()
266 if (n) { in list_set_uadd()
270 ip_set_ext_destroy(set, n); in list_set_uadd()
292 if (n && in list_set_uadd()
295 n = NULL; in list_set_uadd()
304 if (n) in list_set_uadd()
419 struct set_elem *e, *n; in list_set_flush() local
443 u32 n = 0; in list_set_memsize() local
[all …]
/net/mac80211/tests/
A Dtpe.c30 u8 n; member
38 .n = 1,
46 .n = 2,
56 .n = 16,
64 .n = 16,
72 .n = 8,
80 .n = 8,
88 .n = 2,
98 .n = 4,
108 .n = 4,
[all …]
/net/rxrpc/
A Dskbuff.c24 int n = atomic_inc_return(select_skb_count(skb)); in rxrpc_new_skb() local
25 trace_rxrpc_skb(skb, refcount_read(&skb->users), n, why); in rxrpc_new_skb()
34 int n = atomic_read(select_skb_count(skb)); in rxrpc_see_skb() local
35 trace_rxrpc_skb(skb, refcount_read(&skb->users), n, why); in rxrpc_see_skb()
44 int n = atomic_inc_return(select_skb_count(skb)); in rxrpc_get_skb() local
45 trace_rxrpc_skb(skb, refcount_read(&skb->users), n, why); in rxrpc_get_skb()
54 int n = atomic_inc_return(&rxrpc_n_rx_skbs); in rxrpc_eaten_skb() local
55 trace_rxrpc_skb(skb, 0, n, why); in rxrpc_eaten_skb()
64 int n = atomic_dec_return(select_skb_count(skb)); in rxrpc_free_skb() local
78 int n = atomic_dec_return(select_skb_count(skb)); in rxrpc_purge_queue() local
[all …]
/net/ipv6/
A Drpl.c34 const struct in6_addr *daddr, unsigned char n) in ipv6_rpl_srh_decompress() argument
46 for (i = 0; i < n; i++) in ipv6_rpl_srh_decompress()
51 ipv6_rpl_addr_decompress(&outhdr->rpl_segaddr[n], daddr, in ipv6_rpl_srh_decompress()
52 ipv6_rpl_segdata_pos(inhdr, n), in ipv6_rpl_srh_decompress()
58 unsigned char n) in ipv6_rpl_srh_calc_cmpri() argument
64 for (i = 0; i < n; i++) { in ipv6_rpl_srh_calc_cmpri()
89 const struct in6_addr *daddr, unsigned char n) in ipv6_rpl_srh_compress() argument
95 cmpri = ipv6_rpl_srh_calc_cmpri(inhdr, daddr, n); in ipv6_rpl_srh_compress()
112 for (i = 0; i < n; i++) in ipv6_rpl_srh_compress()
116 ipv6_rpl_addr_compress(ipv6_rpl_segdata_pos(outhdr, n), in ipv6_rpl_srh_compress()
[all …]
/net/xfrm/
A Dxfrm_hash.c18 struct hlist_head *n; in xfrm_hash_alloc() local
21 n = kzalloc(sz, GFP_KERNEL); in xfrm_hash_alloc()
23 n = vzalloc(sz); in xfrm_hash_alloc()
25 n = (struct hlist_head *) in xfrm_hash_alloc()
29 return n; in xfrm_hash_alloc()
32 void xfrm_hash_free(struct hlist_head *n, unsigned int sz) in xfrm_hash_free() argument
35 kfree(n); in xfrm_hash_free()
37 vfree(n); in xfrm_hash_free()
39 free_pages((unsigned long)n, get_order(sz)); in xfrm_hash_free()
/net/ax25/
A Dax25_addr.c49 int n; in ax2asc() local
51 for (n = 0, s = buf; n < 6; n++) { in ax2asc()
52 c = (a->ax25_call[n] >> 1) & 0x7F; in ax2asc()
61 n -= 10; in ax2asc()
64 *s++ = n + '0'; in ax2asc()
82 int n; in asc2ax() local
84 for (s = callsign, n = 0; n < 6; n++) { in asc2ax()
86 addr->ax25_call[n] = *s++; in asc2ax()
88 addr->ax25_call[n] = ' '; in asc2ax()
89 addr->ax25_call[n] <<= 1; in asc2ax()
[all …]
/net/netlabel/
A Dnetlabel_addrlist.h63 while (i != h && !n->valid) { in __af4list_valid()
65 n = __af4list_entry(i); in __af4list_valid()
67 return n; in __af4list_valid()
75 while (i != h && !n->valid) { in __af4list_valid_rcu()
77 n = __af4list_entry(i); in __af4list_valid_rcu()
79 return n; in __af4list_valid_rcu()
130 while (i != h && !n->valid) { in __af6list_valid()
132 n = __af6list_entry(i); in __af6list_valid()
134 return n; in __af6list_valid()
144 n = __af6list_entry(i); in __af6list_valid_rcu()
[all …]
/net/bridge/
A Dbr_arp_nd_proxy.c130 struct neighbour *n; in br_do_proxy_suppress_arp() local
195 if (n) { in br_do_proxy_suppress_arp()
199 neigh_release(n); in br_do_proxy_suppress_arp()
212 sha, n->ha, sha, 0, 0); in br_do_proxy_suppress_arp()
215 sha, n->ha, sha, in br_do_proxy_suppress_arp()
229 neigh_release(n); in br_do_proxy_suppress_arp()
409 struct neighbour *n; in br_do_suppress_nd() local
459 if (n) { in br_do_suppress_nd()
463 neigh_release(n); in br_do_suppress_nd()
473 br_nd_send(br, p, skb, n, in br_do_suppress_nd()
[all …]
/net/9p/
A Dtrans_virtio.c322 int n; in p9_get_mapped_pages() local
334 if (n < 0) in p9_get_mapped_pages()
335 return n; in p9_get_mapped_pages()
339 return n; in p9_get_mapped_pages()
403 to += n; in handle_rerror()
404 size -= n; in handle_rerror()
441 if (n < 0) { in p9_virtio_zc_request()
442 err = n; in p9_virtio_zc_request()
449 outlen = n; in p9_virtio_zc_request()
461 err = n; in p9_virtio_zc_request()
[all …]
/net/rose/
A Daf_rose.c705 int n; in rose_bind() local
751 for (n = 0 ; n < addr->srose_ndigis ; n++) in rose_bind()
863 for (n = 0 ; n < addr->srose_ndigis ; n++) in rose_connect()
1001 int n; in rose_getname() local
1011 for (n = 0; n < rose->dest_ndigis; n++) in rose_getname()
1018 for (n = 0; n < rose->source_ndigis; n++) in rose_getname()
1066 for (n = 0 ; n < facilities.dest_ndigis ; n++) in rose_rx_call_request()
1071 for (n = 0 ; n < facilities.source_ndigis ; n++) in rose_rx_call_request()
1145 for (n = 0 ; n < srose.srose_ndigis ; n++) in rose_sendmsg()
1160 for (n = 0 ; n < rose->dest_ndigis ; n++) in rose_sendmsg()
[all …]
/net/appletalk/
A Daarp.c273 t = *n; in __aarp_expire_timer()
274 *n = (*n)->next; in __aarp_expire_timer()
277 n = &((*n)->next); in __aarp_expire_timer()
292 t = *n; in __aarp_kick()
293 *n = (*n)->next; in __aarp_kick()
297 n = &((*n)->next); in __aarp_kick()
313 t = *n; in __aarp_expire_device()
314 *n = (*n)->next; in __aarp_expire_device()
317 n = &((*n)->next); in __aarp_expire_device()
370 t = *n; in __aarp_expire_all()
[all …]
/net/6lowpan/
A Dndisc.c50 static void lowpan_ndisc_802154_update(struct neighbour *n, u32 flags, in lowpan_ndisc_802154_update() argument
54 struct lowpan_802154_neigh *neigh = lowpan_802154_neigh(neighbour_priv(n)); in lowpan_ndisc_802154_update()
85 write_lock_bh(&n->lock); in lowpan_ndisc_802154_update()
91 write_unlock_bh(&n->lock); in lowpan_ndisc_802154_update()
95 struct neighbour *n, u32 flags, u8 icmp6_type, in lowpan_ndisc_update() argument
103 lowpan_ndisc_802154_update(n, flags, icmp6_type, ndopts); in lowpan_ndisc_update()
110 struct lowpan_802154_neigh *n; in lowpan_ndisc_opt_addr_space() local
119 n = lowpan_802154_neigh(neighbour_priv(neigh)); in lowpan_ndisc_opt_addr_space()
122 if (lowpan_802154_is_valid_src_short_addr(n->short_addr)) { in lowpan_ndisc_opt_addr_space()
123 memcpy(ha_buf, &n->short_addr, in lowpan_ndisc_opt_addr_space()
/net/bluetooth/bnep/
A Dcore.c105 int n; in bnep_ctrl_set_netfilter() local
114 if (len < n) in bnep_ctrl_set_netfilter()
120 n /= 4; in bnep_ctrl_set_netfilter()
136 if (n == 0) in bnep_ctrl_set_netfilter()
151 int n; in bnep_ctrl_set_mcfilter() local
160 if (len < n) in bnep_ctrl_set_mcfilter()
166 n /= (ETH_ALEN * 2); in bnep_ctrl_set_mcfilter()
168 if (n > 0) { in bnep_ctrl_set_mcfilter()
177 for (; n > 0; n--) { in bnep_ctrl_set_mcfilter()
690 int err = 0, n = 0; in bnep_get_connlist() local
[all …]

Completed in 898 milliseconds

1234567891011