/net/sched/ |
D | cls_route.c | 77 struct route4_filter *f) in route4_set_fastmap() argument 85 head->fastmap[h].filter = f; in route4_set_fastmap() 111 *res = f->res; \ 112 if (tcf_exts_has_actions(&f->exts)) { \ 113 int r = tcf_exts_exec(skb, &f->exts, res); \ 120 route4_set_fastmap(head, id, iif, f); \ 130 struct route4_filter *f; in route4_classify() local 147 (f = head->fastmap[h].filter) != NULL) { in route4_classify() 148 if (f == ROUTE4_FAILURE) { in route4_classify() 153 *res = f->res; in route4_classify() [all …]
|
D | cls_fw.c | 54 struct fw_filter *f; in fw_classify() local 61 for (f = rcu_dereference_bh(head->ht[fw_hash(id)]); f; in fw_classify() 62 f = rcu_dereference_bh(f->next)) { in fw_classify() 63 if (f->id == id) { in fw_classify() 64 *res = f->res; in fw_classify() 65 if (!tcf_match_indev(skb, f->ifindex)) in fw_classify() 67 r = tcf_exts_exec(skb, &f->exts, res); in fw_classify() 92 struct fw_filter *f; in fw_get() local 97 f = rtnl_dereference(head->ht[fw_hash(handle)]); in fw_get() 98 for (; f; f = rtnl_dereference(f->next)) { in fw_get() [all …]
|
D | cls_rsvp.h | 120 int r = tcf_exts_exec(skb, &f->exts, res); \ 132 struct rsvp_filter *f; in rsvp_classify() local 183 for (f = rcu_dereference_bh(s->ht[h2]); f; in rsvp_classify() 184 f = rcu_dereference_bh(f->next)) { in rsvp_classify() 185 if (src[RSVP_DST_LEN-1] == f->src[RSVP_DST_LEN - 1] && in rsvp_classify() 186 !(f->spi.mask & (*(u32 *)(xprt + f->spi.offset) ^ f->spi.key)) in rsvp_classify() 189 src[0] == f->src[0] && in rsvp_classify() 190 src[1] == f->src[1] && in rsvp_classify() 191 src[2] == f->src[2] in rsvp_classify() 194 *res = f->res; in rsvp_classify() [all …]
|
D | cls_basic.c | 44 struct basic_filter *f; in basic_classify() local 46 list_for_each_entry_rcu(f, &head->flist, link) { in basic_classify() 47 __this_cpu_inc(f->pf->rcnt); in basic_classify() 48 if (!tcf_em_tree_match(skb, &f->ematches, NULL)) in basic_classify() 50 __this_cpu_inc(f->pf->rhit); in basic_classify() 51 *res = f->res; in basic_classify() 52 r = tcf_exts_exec(skb, &f->exts, res); in basic_classify() 63 struct basic_filter *f; in basic_get() local 65 list_for_each_entry(f, &head->flist, link) { in basic_get() 66 if (f->handle == handle) { in basic_get() [all …]
|
D | cls_flow.c | 299 struct flow_filter *f; in flow_classify() local 305 list_for_each_entry_rcu(f, &head->filters, list) { in flow_classify() 309 if (!tcf_em_tree_match(skb, &f->ematches, NULL)) in flow_classify() 312 keymask = f->keymask; in flow_classify() 316 for (n = 0; n < f->nkeys; n++) { in flow_classify() 322 if (f->mode == FLOW_MODE_HASH) in flow_classify() 323 classid = jhash2(keys, f->nkeys, f->hashrnd); in flow_classify() 326 classid = (classid & f->mask) ^ f->xor; in flow_classify() 327 classid = (classid >> f->rshift) + f->addend; in flow_classify() 330 if (f->divisor) in flow_classify() [all …]
|
D | sch_fq.c | 130 static void fq_flow_set_detached(struct fq_flow *f) in fq_flow_set_detached() argument 132 f->next = &detached; in fq_flow_set_detached() 133 f->age = jiffies; in fq_flow_set_detached() 136 static bool fq_flow_is_detached(const struct fq_flow *f) in fq_flow_is_detached() argument 138 return f->next == &detached; in fq_flow_is_detached() 141 static bool fq_flow_is_throttled(const struct fq_flow *f) in fq_flow_is_throttled() argument 143 return f->next == &throttled; in fq_flow_is_throttled() 156 static void fq_flow_unset_throttled(struct fq_sched_data *q, struct fq_flow *f) in fq_flow_unset_throttled() argument 158 rb_erase(&f->rate_node, &q->delayed); in fq_flow_unset_throttled() 160 fq_flow_add_tail(&q->old_flows, f); in fq_flow_unset_throttled() [all …]
|
D | cls_tcindex.c | 64 struct tcindex_filter_result *f = p->perfect + key; in tcindex_lookup() local 66 return tcindex_filter_is_set(f) ? f : NULL; in tcindex_lookup() 69 struct tcindex_filter *f; in tcindex_lookup() local 72 for (f = rcu_dereference_bh_rtnl(*fp); in tcindex_lookup() 73 f; in tcindex_lookup() 74 fp = &f->next, f = rcu_dereference_bh_rtnl(*fp)) in tcindex_lookup() 75 if (f->key == key) in tcindex_lookup() 76 return &f->result; in tcindex_lookup() 87 struct tcindex_filter_result *f; in tcindex_classify() local 93 f = tcindex_lookup(p, key); in tcindex_classify() [all …]
|
D | cls_flower.c | 257 struct cls_fl_filter *filter, *f; in fl_lookup_range() local 266 f = __fl_lookup(mask, mkey); in fl_lookup_range() 267 if (f) in fl_lookup_range() 268 return f; in fl_lookup_range() 303 struct cls_fl_filter *f; in fl_classify() local 321 f = fl_lookup(mask, &skb_mkey, &skb_key); in fl_classify() 322 if (f && !tc_skip_sw(f->flags)) { in fl_classify() 323 *res = f->res; in fl_classify() 324 return tcf_exts_exec(skb, &f->exts, res); in fl_classify() 399 static void __fl_destroy_filter(struct cls_fl_filter *f) in __fl_destroy_filter() argument [all …]
|
/net/decnet/ |
D | dn_table.c | 73 #define DN_FIB_SCAN(f, fp) \ argument 74 for( ; ((f) = *(fp)) != NULL; (fp) = &(f)->fn_next) 76 #define DN_FIB_SCAN_KEY(f, fp, key) \ argument 77 for( ; ((f) = *(fp)) != NULL && dn_key_eq((f)->fn_key, (key)); (fp) = &(f)->fn_next) 127 struct dn_fib_node *f, **fp, *next; in dn_rebuild_zone() local 131 for(f = old_ht[i]; f; f = next) { in dn_rebuild_zone() 132 next = f->fn_next; in dn_rebuild_zone() 133 for(fp = dn_chain_p(f->fn_key, dz); in dn_rebuild_zone() 134 *fp && dn_key_leq((*fp)->fn_key, f->fn_key); in dn_rebuild_zone() 137 f->fn_next = *fp; in dn_rebuild_zone() [all …]
|
/net/netfilter/ |
D | nf_conntrack_h323_asn1.c | 110 static int decode_nul(struct bitstr *bs, const struct field_t *f, char *base, int level); 111 static int decode_bool(struct bitstr *bs, const struct field_t *f, char *base, int level); 112 static int decode_oid(struct bitstr *bs, const struct field_t *f, char *base, int level); 113 static int decode_int(struct bitstr *bs, const struct field_t *f, char *base, int level); 114 static int decode_enum(struct bitstr *bs, const struct field_t *f, char *base, int level); 115 static int decode_bitstr(struct bitstr *bs, const struct field_t *f, char *base, int level); 116 static int decode_numstr(struct bitstr *bs, const struct field_t *f, char *base, int level); 117 static int decode_octstr(struct bitstr *bs, const struct field_t *f, char *base, int level); 118 static int decode_bmpstr(struct bitstr *bs, const struct field_t *f, char *base, int level); 119 static int decode_seq(struct bitstr *bs, const struct field_t *f, char *base, int level); [all …]
|
D | nfnetlink_osf.c | 65 const struct nf_osf_user_finger *f, in nf_osf_match_one() argument 75 if (ctx->totlen != f->ss || !nf_osf_ttl(skb, ttl_check, f->ttl)) in nf_osf_match_one() 81 if (f->wss.wc >= OSF_WSS_MAX) in nf_osf_match_one() 87 for (optnum = 0; optnum < f->opt_num; ++optnum) in nf_osf_match_one() 88 foptsize += f->opt[optnum].length; in nf_osf_match_one() 95 check_WSS = f->wss.wc; in nf_osf_match_one() 97 for (optnum = 0; optnum < f->opt_num; ++optnum) { in nf_osf_match_one() 98 if (f->opt[optnum].kind == *ctx->optp) { in nf_osf_match_one() 99 __u32 len = f->opt[optnum].length; in nf_osf_match_one() 129 if (f->wss.val == 0 || ctx->window == f->wss.val) in nf_osf_match_one() [all …]
|
/net/bridge/ |
D | br_fdb.c | 123 struct net_bridge_fdb_entry *f; in br_fdb_find_port() local 134 f = br_fdb_find_rcu(br, addr, vid); in br_fdb_find_port() 135 if (f && f->dst) in br_fdb_find_port() 136 dev = f->dst->dev; in br_fdb_find_port() 195 static void fdb_delete(struct net_bridge *br, struct net_bridge_fdb_entry *f, in fdb_delete() argument 198 trace_fdb_delete(br, f); in fdb_delete() 200 if (f->is_static) in fdb_delete() 201 fdb_del_hw_addr(br, f->key.addr.addr); in fdb_delete() 203 hlist_del_init_rcu(&f->fdb_node); in fdb_delete() 204 rhashtable_remove_fast(&br->fdb_hash_tbl, &f->rhnode, in fdb_delete() [all …]
|
D | br_arp_nd_proxy.c | 186 struct net_bridge_fdb_entry *f; in br_do_proxy_suppress_arp() local 193 f = br_fdb_find_rcu(br, n->ha, vid); in br_do_proxy_suppress_arp() 194 if (f) { in br_do_proxy_suppress_arp() 198 (f->dst && (f->dst->flags & (BR_PROXYARP_WIFI | in br_do_proxy_suppress_arp() 437 struct net_bridge_fdb_entry *f; in br_do_suppress_nd() local 444 f = br_fdb_find_rcu(br, n->ha, vid); in br_do_suppress_nd() 445 if (f) { in br_do_suppress_nd() 448 if (f->dst && (f->dst->flags & BR_NEIGH_SUPPRESS)) { in br_do_suppress_nd()
|
/net/ipv4/ |
D | inet_fragment.c | 102 int inet_frags_init(struct inet_frags *f) in inet_frags_init() argument 104 f->frags_cachep = kmem_cache_create(f->frags_cache_name, f->qsize, 0, 0, in inet_frags_init() 106 if (!f->frags_cachep) in inet_frags_init() 109 refcount_set(&f->refcnt, 1); in inet_frags_init() 110 init_completion(&f->completion); in inet_frags_init() 115 void inet_frags_fini(struct inet_frags *f) in inet_frags_fini() argument 117 if (refcount_dec_and_test(&f->refcnt)) in inet_frags_fini() 118 complete(&f->completion); in inet_frags_fini() 120 wait_for_completion(&f->completion); in inet_frags_fini() 122 kmem_cache_destroy(f->frags_cachep); in inet_frags_fini() [all …]
|
/net/bluetooth/ |
D | hci_debugfs.c | 76 static int __name ## _show(struct seq_file *f, void *ptr) \ 78 struct hci_dev *hdev = f->private; \ 81 seq_printf(f, "%s\n", hdev->__field ? : ""); \ 89 static int features_show(struct seq_file *f, void *ptr) in features_show() argument 91 struct hci_dev *hdev = f->private; in features_show() 96 seq_printf(f, "%2u: %8ph\n", p, hdev->features[p]); in features_show() 98 seq_printf(f, "LE: %8ph\n", hdev->le_features); in features_show() 106 static int device_id_show(struct seq_file *f, void *ptr) in device_id_show() argument 108 struct hci_dev *hdev = f->private; in device_id_show() 111 seq_printf(f, "%4.4x:%4.4x:%4.4x:%4.4x\n", hdev->devid_source, in device_id_show() [all …]
|
/net/sunrpc/ |
D | debugfs.c | 20 tasks_show(struct seq_file *f, void *v) in tasks_show() argument 33 seq_printf(f, "%5u %04x %6d 0x%x 0x%x %8ld %ps %sv%u %s a:%ps q:%s\n", in tasks_show() 42 tasks_start(struct seq_file *f, loff_t *ppos) in tasks_start() argument 45 struct rpc_clnt *clnt = f->private; in tasks_start() 57 tasks_next(struct seq_file *f, void *v, loff_t *pos) in tasks_next() argument 59 struct rpc_clnt *clnt = f->private; in tasks_next() 72 tasks_stop(struct seq_file *f, void *v) in tasks_stop() argument 75 struct rpc_clnt *clnt = f->private; in tasks_stop() 174 xprt_info_show(struct seq_file *f, void *v) in xprt_info_show() argument 176 struct rpc_xprt *xprt = f->private; in xprt_info_show() [all …]
|
/net/packet/ |
D | af_packet.c | 1317 static unsigned int fanout_demux_hash(struct packet_fanout *f, in fanout_demux_hash() argument 1324 static unsigned int fanout_demux_lb(struct packet_fanout *f, in fanout_demux_lb() argument 1328 unsigned int val = atomic_inc_return(&f->rr_cur); in fanout_demux_lb() 1333 static unsigned int fanout_demux_cpu(struct packet_fanout *f, in fanout_demux_cpu() argument 1340 static unsigned int fanout_demux_rnd(struct packet_fanout *f, in fanout_demux_rnd() argument 1347 static unsigned int fanout_demux_rollover(struct packet_fanout *f, in fanout_demux_rollover() argument 1355 po = pkt_sk(f->arr[idx]); in fanout_demux_rollover() 1367 po_next = pkt_sk(f->arr[i]); in fanout_demux_rollover() 1386 static unsigned int fanout_demux_qm(struct packet_fanout *f, in fanout_demux_qm() argument 1393 static unsigned int fanout_demux_bpf(struct packet_fanout *f, in fanout_demux_bpf() argument [all …]
|
/net/dccp/ccids/lib/ |
D | tfrc_equation.c | 616 u32 f; in tfrc_calc_x() local 635 f = tfrc_calc_x_lookup[index][1]; in tfrc_calc_x() 640 f = tfrc_calc_x_lookup[index][0]; in tfrc_calc_x() 653 return scaled_div32(result, f); in tfrc_calc_x()
|
/net/netlink/ |
D | genetlink.c | 994 struct genl_family *f; in genl_bind() local 1000 idr_for_each_entry(&genl_fam_idr, f, id) { in genl_bind() 1001 if (group >= f->mcgrp_offset && in genl_bind() 1002 group < f->mcgrp_offset + f->n_mcgrps) { in genl_bind() 1003 int fam_grp = group - f->mcgrp_offset; in genl_bind() 1005 if (!f->netnsok && net != &init_net) in genl_bind() 1007 else if (f->mcast_bind) in genl_bind() 1008 err = f->mcast_bind(net, fam_grp); in genl_bind() 1021 struct genl_family *f; in genl_unbind() local 1026 idr_for_each_entry(&genl_fam_idr, f, id) { in genl_unbind() [all …]
|
/net/x25/ |
D | x25_proc.c | 133 struct x25_forward *f = list_entry(v, struct x25_forward, node); in x25_seq_forward_show() local 140 f = v; in x25_seq_forward_show() 143 f->lci, f->dev1->name, f->dev2->name); in x25_seq_forward_show()
|
/net/can/j1939/ |
D | socket.c | 261 const struct j1939_filter *f = jsk->filters; in j1939_sk_match_filter() local 268 for (; nfilter; ++f, --nfilter) { in j1939_sk_match_filter() 269 if ((skcb->addr.pgn & f->pgn_mask) != f->pgn) in j1939_sk_match_filter() 271 if ((skcb->addr.sa & f->addr_mask) != f->addr) in j1939_sk_match_filter() 273 if ((skcb->addr.src_name & f->name_mask) != f->name) in j1939_sk_match_filter() 662 struct j1939_filter *f; in j1939_sk_setsockopt() local 677 for (f = filters, c = count; c; f++, c--) { in j1939_sk_setsockopt() 678 f->name &= f->name_mask; in j1939_sk_setsockopt() 679 f->pgn &= f->pgn_mask; in j1939_sk_setsockopt() 680 f->addr &= f->addr_mask; in j1939_sk_setsockopt()
|
/net/core/ |
D | flow_offload.c | 246 int flow_block_cb_setup_simple(struct flow_block_offload *f, in flow_block_cb_setup_simple() argument 255 f->binder_type != FLOW_BLOCK_BINDER_TYPE_CLSACT_INGRESS) in flow_block_cb_setup_simple() 258 f->driver_block_list = driver_block_list; in flow_block_cb_setup_simple() 260 switch (f->command) { in flow_block_cb_setup_simple() 269 flow_block_cb_add(block_cb, f); in flow_block_cb_setup_simple() 273 block_cb = flow_block_cb_lookup(f->block, cb, cb_ident); in flow_block_cb_setup_simple() 277 flow_block_cb_remove(block_cb, f); in flow_block_cb_setup_simple()
|
/net/tipc/ |
D | trace.h | 284 TP_PROTO(struct tipc_link *r, u16 f, u16 t, struct sk_buff_head *tq), 286 TP_ARGS(r, f, t, tq), 299 __entry->from = f; 312 TP_PROTO(struct tipc_link *r, u16 f, u16 t, struct sk_buff_head *tq), 313 TP_ARGS(r, f, t, tq) 317 TP_PROTO(struct tipc_link *r, u16 f, u16 t, struct sk_buff_head *tq), 318 TP_ARGS(r, f, t, tq),
|
/net/bluetooth/bnep/ |
D | netdev.c | 151 struct bnep_proto_filter *f = s->proto_filter; in bnep_net_proto_filter() local 154 for (i = 0; i < BNEP_MAX_PROTO_FILTERS && f[i].end; i++) { in bnep_net_proto_filter() 155 if (proto >= f[i].start && proto <= f[i].end) in bnep_net_proto_filter()
|
/net/wireless/ |
D | Makefile | 41 for f in $^ ; do \ 42 test -f $$f || continue;\ 44 thisf=$$(od -An -v -tx1 < $$f | \
|