Home
last modified time | relevance | path

Searched refs:a (Results 1 – 25 of 153) sorted by relevance

1234567

/net/ceph/crush/
Dhash.c10 #define crush_hashmix(a, b, c) do { \ argument
11 a = a-b; a = a-c; a = a^(c>>13); \
12 b = b-c; b = b-a; b = b^(a<<8); \
13 c = c-a; c = c-b; c = c^(b>>13); \
14 a = a-b; a = a-c; a = a^(c>>12); \
15 b = b-c; b = b-a; b = b^(a<<16); \
16 c = c-a; c = c-b; c = c^(b>>5); \
17 a = a-b; a = a-c; a = a^(c>>3); \
18 b = b-c; b = b-a; b = b^(a<<10); \
19 c = c-a; c = c-b; c = c^(b>>15); \
[all …]
/net/ceph/
Dceph_hash.c10 #define mix(a, b, c) \ argument
12 a = a - b; a = a - c; a = a ^ (c >> 13); \
13 b = b - c; b = b - a; b = b ^ (a << 8); \
14 c = c - a; c = c - b; c = c ^ (b >> 13); \
15 a = a - b; a = a - c; a = a ^ (c >> 12); \
16 b = b - c; b = b - a; b = b ^ (a << 16); \
17 c = c - a; c = c - b; c = c ^ (b >> 5); \
18 a = a - b; a = a - c; a = a ^ (c >> 3); \
19 b = b - c; b = b - a; b = b ^ (a << 10); \
20 c = c - a; c = c - b; c = c ^ (b >> 15); \
[all …]
Darmor.c42 unsigned char a, b, c; in ceph_armor() local
44 a = *src++; in ceph_armor()
45 *dst++ = encode_bits(a >> 2); in ceph_armor()
48 *dst++ = encode_bits(((a & 3) << 4) | (b >> 4)); in ceph_armor()
59 *dst++ = encode_bits(((a & 3) << 4)); in ceph_armor()
79 int a, b, c, d; in ceph_unarmor() local
87 a = decode_bits(src[0]); in ceph_unarmor()
91 if (a < 0 || b < 0 || c < 0 || d < 0) in ceph_unarmor()
94 *dst++ = (a << 2) | (b >> 4); in ceph_unarmor()
/net/sched/
Dact_api.c30 void tcf_hash_destroy(struct tc_action *a) in tcf_hash_destroy() argument
32 struct tcf_common *p = a->priv; in tcf_hash_destroy()
33 struct tcf_hashinfo *hinfo = a->ops->hinfo; in tcf_hash_destroy()
48 int tcf_hash_release(struct tc_action *a, int bind) in tcf_hash_release() argument
50 struct tcf_common *p = a->priv; in tcf_hash_release()
61 if (a->ops->cleanup) in tcf_hash_release()
62 a->ops->cleanup(a, bind); in tcf_hash_release()
63 tcf_hash_destroy(a); in tcf_hash_release()
72 struct tc_action *a) in tcf_dump_walker() argument
74 struct tcf_hashinfo *hinfo = a->ops->hinfo; in tcf_dump_walker()
[all …]
Dact_simple.c30 static int tcf_simp(struct sk_buff *skb, const struct tc_action *a, in tcf_simp() argument
33 struct tcf_defact *d = a->priv; in tcf_simp()
49 static void tcf_simp_release(struct tc_action *a, int bind) in tcf_simp_release() argument
51 struct tcf_defact *d = to_defact(a); in tcf_simp_release()
80 struct nlattr *est, struct tc_action *a, in tcf_simp_init() argument
105 if (!tcf_hash_check(parm->index, a, bind)) { in tcf_simp_init()
106 ret = tcf_hash_create(parm->index, est, a, sizeof(*d), bind); in tcf_simp_init()
110 d = to_defact(a); in tcf_simp_init()
113 tcf_hash_cleanup(a, est); in tcf_simp_init()
119 d = to_defact(a); in tcf_simp_init()
[all …]
DKconfig9 When the kernel has several packets to send out over a network
16 is a FIFO (first come, first served). If you say Y here, you will be
20 need a certain minimum data flow rate, or if you need to limit the
51 into a tree-like hierarchy of classes; the leaves of this tree are
56 CBQ is a commonly used scheduler, so if you're unsure, you should
60 To compile this code as a module, choose M here: the
74 To compile this code as a module, choose M here: the
83 To compile this code as a module, choose M here: the
91 provides a framework for invoking classifiers, which in turn
93 the flow(s) it is handling to a given virtual circuit.
[all …]
Dact_pedit.c33 struct nlattr *est, struct tc_action *a, in tcf_pedit_init() argument
57 if (!tcf_hash_check(parm->index, a, bind)) { in tcf_pedit_init()
60 ret = tcf_hash_create(parm->index, est, a, sizeof(*p), bind); in tcf_pedit_init()
63 p = to_pedit(a); in tcf_pedit_init()
66 tcf_hash_cleanup(a, est); in tcf_pedit_init()
71 p = to_pedit(a); in tcf_pedit_init()
72 tcf_hash_release(a, bind); in tcf_pedit_init()
96 tcf_hash_insert(a); in tcf_pedit_init()
100 static void tcf_pedit_cleanup(struct tc_action *a, int bind) in tcf_pedit_cleanup() argument
102 struct tcf_pedit *p = a->priv; in tcf_pedit_cleanup()
[all …]
Dact_skbedit.c32 static int tcf_skbedit(struct sk_buff *skb, const struct tc_action *a, in tcf_skbedit() argument
35 struct tcf_skbedit *d = a->priv; in tcf_skbedit()
61 struct nlattr *est, struct tc_action *a, in tcf_skbedit_init() argument
101 if (!tcf_hash_check(parm->index, a, bind)) { in tcf_skbedit_init()
102 ret = tcf_hash_create(parm->index, est, a, sizeof(*d), bind); in tcf_skbedit_init()
106 d = to_skbedit(a); in tcf_skbedit_init()
109 d = to_skbedit(a); in tcf_skbedit_init()
112 tcf_hash_release(a, bind); in tcf_skbedit_init()
132 tcf_hash_insert(a); in tcf_skbedit_init()
136 static int tcf_skbedit_dump(struct sk_buff *skb, struct tc_action *a, in tcf_skbedit_dump() argument
[all …]
Dact_mirred.c35 static void tcf_mirred_release(struct tc_action *a, int bind) in tcf_mirred_release() argument
37 struct tcf_mirred *m = to_mirred(a); in tcf_mirred_release()
48 struct nlattr *est, struct tc_action *a, int ovr, in tcf_mirred_init() argument
93 if (!tcf_hash_check(parm->index, a, bind)) { in tcf_mirred_init()
96 ret = tcf_hash_create(parm->index, est, a, sizeof(*m), bind); in tcf_mirred_init()
102 tcf_hash_release(a, bind); in tcf_mirred_init()
106 m = to_mirred(a); in tcf_mirred_init()
122 tcf_hash_insert(a); in tcf_mirred_init()
128 static int tcf_mirred(struct sk_buff *skb, const struct tc_action *a, in tcf_mirred() argument
131 struct tcf_mirred *m = a->priv; in tcf_mirred()
[all …]
Dact_police.c59 int type, struct tc_action *a) in tcf_act_police_walker() argument
61 struct tcf_hashinfo *hinfo = a->ops->hinfo; in tcf_act_police_walker()
78 a->priv = p; in tcf_act_police_walker()
79 a->order = index; in tcf_act_police_walker()
80 nest = nla_nest_start(skb, a->order); in tcf_act_police_walker()
84 err = tcf_action_dump_1(skb, a, 0, 1); in tcf_act_police_walker()
86 err = tcf_action_dump_1(skb, a, 0, 0); in tcf_act_police_walker()
115 struct nlattr *est, struct tc_action *a, in tcf_act_police_locate() argument
124 struct tcf_hashinfo *hinfo = a->ops->hinfo; in tcf_act_police_locate()
142 if (tcf_hash_search(a, parm->index)) { in tcf_act_police_locate()
[all …]
Dact_gact.c53 struct nlattr *est, struct tc_action *a, in tcf_gact_init() argument
87 if (!tcf_hash_check(parm->index, a, bind)) { in tcf_gact_init()
88 ret = tcf_hash_create(parm->index, est, a, sizeof(*gact), bind); in tcf_gact_init()
95 tcf_hash_release(a, bind); in tcf_gact_init()
100 gact = to_gact(a); in tcf_gact_init()
113 tcf_hash_insert(a); in tcf_gact_init()
117 static int tcf_gact(struct sk_buff *skb, const struct tc_action *a, in tcf_gact() argument
120 struct tcf_gact *gact = a->priv; in tcf_gact()
142 static int tcf_gact_dump(struct sk_buff *skb, struct tc_action *a, int bind, int ref) in tcf_gact_dump() argument
145 struct tcf_gact *gact = a->priv; in tcf_gact_dump()
/net/openvswitch/
Dflow_netlink.c286 const struct nlattr *a[], in __parse_flow_nlattrs() argument
319 a[type] = nla; in __parse_flow_nlattrs()
332 const struct nlattr *a[], u64 *attrsp) in parse_flow_mask_nlattrs() argument
334 return __parse_flow_nlattrs(attr, a, attrsp, true); in parse_flow_mask_nlattrs()
338 const struct nlattr *a[], u64 *attrsp) in parse_flow_nlattrs() argument
340 return __parse_flow_nlattrs(attr, a, attrsp, false); in parse_flow_nlattrs()
346 struct nlattr *a; in ipv4_tun_from_nlattr() local
352 nla_for_each_nested(a, attr, rem) { in ipv4_tun_from_nlattr()
353 int type = nla_type(a); in ipv4_tun_from_nlattr()
372 if (ovs_tunnel_key_lens[type] != nla_len(a) && in ipv4_tun_from_nlattr()
[all …]
Dactions.c489 const struct nlattr *a; in output_userspace() local
497 for (a = nla_data(attr), rem = nla_len(attr); rem > 0; in output_userspace()
498 a = nla_next(a, &rem)) { in output_userspace()
499 switch (nla_type(a)) { in output_userspace()
501 upcall.userdata = a; in output_userspace()
505 upcall.portid = nla_get_u32(a); in output_userspace()
513 static bool last_action(const struct nlattr *a, int rem) in last_action() argument
515 return a->nla_len == rem; in last_action()
522 const struct nlattr *a; in sample() local
525 for (a = nla_data(attr), rem = nla_len(attr); rem > 0; in sample()
[all …]
Ddatapath.c508 struct nlattr **a = info->attrs; in ovs_packet_cmd_execute() local
519 if (!a[OVS_PACKET_ATTR_PACKET] || !a[OVS_PACKET_ATTR_KEY] || in ovs_packet_cmd_execute()
520 !a[OVS_PACKET_ATTR_ACTIONS]) in ovs_packet_cmd_execute()
523 len = nla_len(a[OVS_PACKET_ATTR_PACKET]); in ovs_packet_cmd_execute()
530 nla_memcpy(__skb_put(packet, len), a[OVS_PACKET_ATTR_PACKET], len); in ovs_packet_cmd_execute()
549 err = ovs_flow_key_extract_userspace(a[OVS_PACKET_ATTR_KEY], packet, in ovs_packet_cmd_execute()
554 acts = ovs_nla_alloc_flow_actions(nla_len(a[OVS_PACKET_ATTR_ACTIONS])); in ovs_packet_cmd_execute()
559 err = ovs_nla_copy_actions(a[OVS_PACKET_ATTR_ACTIONS], in ovs_packet_cmd_execute()
804 struct nlattr **a = info->attrs; in ovs_flow_cmd_new() local
816 if (!a[OVS_FLOW_ATTR_KEY]) in ovs_flow_cmd_new()
[all …]
/net/appletalk/
Daarp.c93 static void __aarp_expire(struct aarp_entry *a) in __aarp_expire() argument
95 skb_queue_purge(&a->packet_queue); in __aarp_expire()
96 kfree(a); in __aarp_expire()
104 static void __aarp_send_query(struct aarp_entry *a) in __aarp_send_query() argument
108 struct net_device *dev = a->dev; in __aarp_send_query()
147 eah->pa_dst_net = a->target_addr.s_net; in __aarp_send_query()
148 eah->pa_dst_node = a->target_addr.s_node; in __aarp_send_query()
153 a->xmit_count++; in __aarp_send_query()
154 a->last_sent = jiffies; in __aarp_send_query()
388 struct aarp_entry *a = kmalloc(sizeof(*a), GFP_ATOMIC); in aarp_alloc() local
[all …]
/net/netfilter/ipset/
DKconfig11 To compile it as a module, choose M here. If unsure, say N.
32 can store IPv4 addresses (or network addresse) from a range.
34 To compile it as a module, choose M here. If unsure, say N.
41 can store IPv4 address and (source) MAC address pairs from a range.
43 To compile it as a module, choose M here. If unsure, say N.
50 can store TCP/UDP port numbers from a range.
52 To compile it as a module, choose M here. If unsure, say N.
60 in a set.
62 To compile it as a module, choose M here. If unsure, say N.
71 To compile it as a module, choose M here. If unsure, say N.
[all …]
/net/netfilter/
DKconfig39 Connection tracking keeps a record of what packets have passed
47 To compile it as a module, choose M here. If unsure, say N.
82 Normally, each connection needs to have a unique system wide
104 provide a notifier chain that can be used by other kernel code
157 If you want to compile it as a module, say M here and read
168 To compile it as a module, choose M here. If unsure, say N.
183 To compile it as a module, choose M here. If unsure, say N.
197 To compile it as a module, choose M here. If unsure, say N.
204 H.323 is a VoIP signalling protocol from ITU-T. As one of the most
209 With this module you can support H.323 on a connection tracking/NAT
[all …]
/net/dccp/ccids/lib/
Dtfrc.h25 #define tfrc_pr_debug(format, a...) DCCP_PR_DEBUG(tfrc_debug, format, ##a) argument
27 #define tfrc_pr_debug(format, a...) argument
31 static inline u64 scaled_div(u64 a, u64 b) in scaled_div() argument
34 return div64_u64(a * 1000000, b); in scaled_div()
37 static inline u32 scaled_div32(u64 a, u64 b) in scaled_div32() argument
39 u64 result = scaled_div(a, b); in scaled_div32()
43 (unsigned long long)a, (unsigned long long)b); in scaled_div32()
/net/ipv4/netfilter/
DKconfig18 Connection tracking keeps a record of what packets have passed
26 To compile it as a module, choose M here. If unsure, say N.
124 SNMP payloads. In conjunction with NAT, it allows a network
131 To compile it as a module, choose M here. If unsure, say N.
155 iptables is a general, extensible packet identification framework.
160 To compile it as a module, choose M here. If unsure, say N.
169 This match extension allows you to match a range of SPIs
172 To compile it as a module, choose M here. If unsure, say N.
179 This is a backwards-compat option for the user's convenience
191 To compile it as a module, choose M here. If unsure, say N.
[all …]
/net/
Dcompat.c800 u32 a[AUDITSC_ARGS]; in COMPAT_SYSCALL_DEFINE2() local
808 if (len > sizeof(a)) in COMPAT_SYSCALL_DEFINE2()
811 if (copy_from_user(a, args, len)) in COMPAT_SYSCALL_DEFINE2()
814 ret = audit_socketcall_compat(len / sizeof(a[0]), a); in COMPAT_SYSCALL_DEFINE2()
818 a0 = a[0]; in COMPAT_SYSCALL_DEFINE2()
819 a1 = a[1]; in COMPAT_SYSCALL_DEFINE2()
823 ret = sys_socket(a0, a1, a[2]); in COMPAT_SYSCALL_DEFINE2()
826 ret = sys_bind(a0, compat_ptr(a1), a[2]); in COMPAT_SYSCALL_DEFINE2()
829 ret = sys_connect(a0, compat_ptr(a1), a[2]); in COMPAT_SYSCALL_DEFINE2()
835 ret = sys_accept4(a0, compat_ptr(a1), compat_ptr(a[2]), 0); in COMPAT_SYSCALL_DEFINE2()
[all …]
/net/bridge/netfilter/
DKconfig32 ebtables is a general, extensible frame/packet identification
45 bridging and routing frames, giving Linux the functionality of a
49 To compile it as a module, choose M here. If unsure, say N.
58 To compile it as a module, choose M here. If unsure, say N.
67 To compile it as a module, choose M here. If unsure, say N.
76 To compile it as a module, choose M here. If unsure, say N.
82 and/or destination address on a list of addresses. Optionally,
85 To compile it as a module, choose M here. If unsure, say N.
93 To compile it as a module, choose M here. If unsure, say N.
101 To compile it as a module, choose M here. If unsure, say N.
[all …]
/net/ipv6/netfilter/
DKconfig18 Connection tracking keeps a record of what packets have passed
26 To compile it as a module, choose M here. If unsure, say N.
102 ip6tables is a general, extensible packet identification framework.
107 To compile it as a module, choose M here. If unsure, say N.
118 To compile it as a module, choose M here. If unsure, say N.
128 To compile it as a module, choose M here. If unsure, say N.
137 To compile it as a module, choose M here. If unsure, say N.
144 and destination options headers of a packet.
146 To compile it as a module, choose M here. If unsure, say N.
153 This is a backwards-compat option for the user's convenience
[all …]
/net/dccp/
Ddccp.h25 #define DCCP_WARN(fmt, a...) LIMIT_NETDEBUG(KERN_WARNING "%s: " fmt, \ argument
26 __func__, ##a)
27 #define DCCP_CRIT(fmt, a...) printk(KERN_CRIT fmt " at %s:%d/%s()\n", ##a, \ argument
29 #define DCCP_BUG(a...) do { DCCP_CRIT("BUG: " a); dump_stack(); } while(0) argument
38 #define DCCP_PR_DEBUG(enable, fmt, a...) DCCP_PRINTK(enable, KERN_DEBUG \ argument
39 "%s: " fmt, __func__, ##a)
43 #define dccp_pr_debug(format, a...) DCCP_PR_DEBUG(dccp_debug, format, ##a) argument
44 #define dccp_pr_debug_cat(format, a...) DCCP_PRINTK(dccp_debug, format, ##a) argument
45 #define dccp_debug(fmt, a...) dccp_pr_debug_cat(KERN_DEBUG fmt, ##a) argument
47 #define dccp_pr_debug(format, a...) argument
[all …]
/net/ipv4/
DKconfig9 intend to participate in the MBONE, a high bandwidth network on top
17 If you intend to run your Linux box mostly as a router, i.e. as a
26 Note that your box can only act as a router if you enable IP
40 asymmetric routing (packets from you to a host take a different path
41 than packets from that host to you) or if you operate a non-routing
67 Normally, a router decides what to do with a received packet based
85 Normally, the routing tables specify a single action to be taken in
86 a deterministic manner for a given packet. If you say Y here
87 however, it becomes possible to attach several actions to a packet
90 equal "cost" and chooses one of them in a non-deterministic fashion
[all …]
/net/caif/
DKconfig10 The "Communication CPU to Application CPU Interface" (CAIF) is a packet
14 Say Y (or M) here if you build for a phone product (e.g. Android or
21 See Documentation/networking/caif for a further explanation on how to
38 Say Y if you will be using a CAIF based GPRS network device.
39 This can be either built-in or a loadable module,
40 If you select to build it as a built-in then the main CAIF device must
41 also be a built-in.
50 This can be either built-in or a loadable module,
51 If you select to build it as a built-in then the main CAIF device must
52 also be a built-in.

1234567