Home
last modified time | relevance | path

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

12345678

/net/ceph/crush/
Dhash.c13 #define crush_hashmix(a, b, c) do { \ argument
14 a = a-b; a = a-c; a = a^(c>>13); \
15 b = b-c; b = b-a; b = b^(a<<8); \
16 c = c-a; c = c-b; c = c^(b>>13); \
17 a = a-b; a = a-c; a = a^(c>>12); \
18 b = b-c; b = b-a; b = b^(a<<16); \
19 c = c-a; c = c-b; c = c^(b>>5); \
20 a = a-b; a = a-c; a = a^(c>>3); \
21 b = b-c; b = b-a; b = b^(a<<10); \
22 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.c43 unsigned char a, b, c; in ceph_armor() local
45 a = *src++; in ceph_armor()
46 *dst++ = encode_bits(a >> 2); in ceph_armor()
49 *dst++ = encode_bits(((a & 3) << 4) | (b >> 4)); in ceph_armor()
60 *dst++ = encode_bits(((a & 3) << 4)); in ceph_armor()
80 int a, b, c, d; in ceph_unarmor() local
88 a = decode_bits(src[0]); in ceph_unarmor()
92 if (a < 0 || b < 0 || c < 0 || d < 0) in ceph_unarmor()
95 *dst++ = (a << 2) | (b >> 4); in ceph_unarmor()
/net/openvswitch/
Dflow_netlink.c462 const struct nlattr *a[], in __parse_flow_nlattrs() argument
494 a[type] = nla; in __parse_flow_nlattrs()
507 const struct nlattr *a[], u64 *attrsp, in parse_flow_mask_nlattrs() argument
510 return __parse_flow_nlattrs(attr, a, attrsp, log, true); in parse_flow_mask_nlattrs()
513 int parse_flow_nlattrs(const struct nlattr *attr, const struct nlattr *a[], in parse_flow_nlattrs() argument
516 return __parse_flow_nlattrs(attr, a, attrsp, log, false); in parse_flow_nlattrs()
519 static int genev_tun_opt_from_nlattr(const struct nlattr *a, in genev_tun_opt_from_nlattr() argument
525 if (nla_len(a) > sizeof(match->key->tun_opts)) { in genev_tun_opt_from_nlattr()
527 nla_len(a), sizeof(match->key->tun_opts)); in genev_tun_opt_from_nlattr()
531 if (nla_len(a) % 4 != 0) { in genev_tun_opt_from_nlattr()
[all …]
Dactions.c568 const struct nlattr *a) in set_nsh() argument
580 err = nsh_key_from_nlattr(a, &key, &mask); in set_nsh()
916 const struct nlattr *a; in output_userspace() local
923 for (a = nla_data(attr), rem = nla_len(attr); rem > 0; in output_userspace()
924 a = nla_next(a, &rem)) { in output_userspace()
925 switch (nla_type(a)) { in output_userspace()
927 upcall.userdata = a; in output_userspace()
931 upcall.portid = nla_get_u32(a); in output_userspace()
938 vport = ovs_vport_rcu(dp, nla_get_u32(a)); in output_userspace()
1033 const struct nlattr *a) in execute_set_action() argument
[all …]
Ddatapath.c537 struct nlattr **a = info->attrs; in ovs_packet_cmd_execute() local
547 bool log = !a[OVS_PACKET_ATTR_PROBE]; in ovs_packet_cmd_execute()
550 if (!a[OVS_PACKET_ATTR_PACKET] || !a[OVS_PACKET_ATTR_KEY] || in ovs_packet_cmd_execute()
551 !a[OVS_PACKET_ATTR_ACTIONS]) in ovs_packet_cmd_execute()
554 len = nla_len(a[OVS_PACKET_ATTR_PACKET]); in ovs_packet_cmd_execute()
561 nla_memcpy(__skb_put(packet, len), a[OVS_PACKET_ATTR_PACKET], len); in ovs_packet_cmd_execute()
564 if (a[OVS_PACKET_ATTR_MRU]) { in ovs_packet_cmd_execute()
565 mru = nla_get_u16(a[OVS_PACKET_ATTR_MRU]); in ovs_packet_cmd_execute()
576 err = ovs_flow_key_extract_userspace(net, a[OVS_PACKET_ATTR_KEY], in ovs_packet_cmd_execute()
581 err = ovs_nla_copy_actions(net, a[OVS_PACKET_ATTR_ACTIONS], in ovs_packet_cmd_execute()
[all …]
/net/appletalk/
Daarp.c87 static void __aarp_expire(struct aarp_entry *a) in __aarp_expire() argument
89 skb_queue_purge(&a->packet_queue); in __aarp_expire()
90 kfree(a); in __aarp_expire()
98 static void __aarp_send_query(struct aarp_entry *a) in __aarp_send_query() argument
102 struct net_device *dev = a->dev; in __aarp_send_query()
141 eah->pa_dst_net = a->target_addr.s_net; in __aarp_send_query()
142 eah->pa_dst_node = a->target_addr.s_node; in __aarp_send_query()
147 a->xmit_count++; in __aarp_send_query()
148 a->last_sent = jiffies; in __aarp_send_query()
382 struct aarp_entry *a = kmalloc(sizeof(*a), GFP_ATOMIC); in aarp_alloc() local
[all …]
/net/sched/
Dact_simple.c25 static int tcf_simp_act(struct sk_buff *skb, const struct tc_action *a, in tcf_simp_act() argument
28 struct tcf_defact *d = to_defact(a); in tcf_simp_act()
44 static void tcf_simp_release(struct tc_action *a) in tcf_simp_release() argument
46 struct tcf_defact *d = to_defact(a); in tcf_simp_release()
59 static int reset_policy(struct tc_action *a, const struct nlattr *defdata, in reset_policy() argument
70 d = to_defact(a); in reset_policy()
72 goto_ch = tcf_action_set_ctrlact(a, p->action, goto_ch); in reset_policy()
87 struct nlattr *est, struct tc_action **a, in tcf_simp_init() argument
113 err = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_simp_init()
122 tcf_idr_release(*a, bind); in tcf_simp_init()
[all …]
Dact_vlan.c22 static int tcf_vlan_act(struct sk_buff *skb, const struct tc_action *a, in tcf_vlan_act() argument
25 struct tcf_vlan *v = to_vlan(a); in tcf_vlan_act()
103 struct nlattr *est, struct tc_action **a, in tcf_vlan_init() argument
133 err = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_vlan_init()
147 tcf_idr_release(*a, bind); in tcf_vlan_init()
155 tcf_idr_release(*a, bind); in tcf_vlan_init()
169 tcf_idr_release(*a, bind); in tcf_vlan_init()
183 tcf_idr_release(*a, bind); in tcf_vlan_init()
191 ret = tcf_idr_create(tn, index, est, a, in tcf_vlan_init()
200 tcf_idr_release(*a, bind); in tcf_vlan_init()
[all …]
Dact_api.c25 static void tcf_action_goto_chain_exec(const struct tc_action *a, in tcf_action_goto_chain_exec() argument
28 const struct tcf_chain *chain = rcu_dereference_bh(a->goto_chain); in tcf_action_goto_chain_exec()
87 struct tcf_chain *tcf_action_set_ctrlact(struct tc_action *a, int action, in tcf_action_set_ctrlact() argument
90 a->tcfa_action = action; in tcf_action_set_ctrlact()
91 rcu_swap_protected(a->goto_chain, goto_chain, 1); in tcf_action_set_ctrlact()
346 int tcf_idr_search(struct tc_action_net *tn, struct tc_action **a, u32 index) in tcf_idr_search() argument
360 *a = p; in tcf_idr_search()
401 struct tc_action **a, const struct tc_action_ops *ops, in tcf_idr_create() argument
440 *a = p; in tcf_idr_create()
454 void tcf_idr_insert(struct tc_action_net *tn, struct tc_action *a) in tcf_idr_insert() argument
[all …]
Dact_mirred.c70 static void tcf_mirred_release(struct tc_action *a) in tcf_mirred_release() argument
72 struct tcf_mirred *m = to_mirred(a); in tcf_mirred_release()
93 struct nlattr *est, struct tc_action **a, in tcf_mirred_init() argument
123 err = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_mirred_init()
138 tcf_idr_release(*a, bind); in tcf_mirred_init()
151 ret = tcf_idr_create(tn, index, est, a, in tcf_mirred_init()
159 tcf_idr_release(*a, bind); in tcf_mirred_init()
163 m = to_mirred(*a); in tcf_mirred_init()
187 goto_ch = tcf_action_set_ctrlact(*a, parm->action, goto_ch); in tcf_mirred_init()
198 tcf_idr_insert(tn, *a); in tcf_mirred_init()
[all …]
Dact_ipt.c77 static void tcf_ipt_release(struct tc_action *a) in tcf_ipt_release() argument
79 struct tcf_ipt *ipt = to_ipt(a); in tcf_ipt_release()
82 ipt_destroy_target(ipt->tcfi_t, a->idrinfo->net); in tcf_ipt_release()
96 struct nlattr *est, struct tc_action **a, in __tcf_ipt_init() argument
121 err = tcf_idr_check_alloc(tn, &index, a, bind); in __tcf_ipt_init()
130 tcf_idr_release(*a, bind); in __tcf_ipt_init()
139 tcf_idr_release(*a, bind); in __tcf_ipt_init()
146 ret = tcf_idr_create(tn, index, est, a, ops, bind, in __tcf_ipt_init()
158 tcf_idr_release(*a, bind); in __tcf_ipt_init()
180 ipt = to_ipt(*a); in __tcf_ipt_init()
[all …]
DKconfig10 When the kernel has several packets to send out over a network
17 is a FIFO (first come, first served). If you say Y here, you will be
21 need a certain minimum data flow rate, or if you need to limit the
53 into a tree-like hierarchy of classes; the leaves of this tree are
58 CBQ is a commonly used scheduler, so if you're unsure, you should
62 To compile this code as a module, choose M here: the
76 To compile this code as a module, choose M here: the
85 To compile this code as a module, choose M here: the
93 provides a framework for invoking classifiers, which in turn
95 the flow(s) it is handling to a given virtual circuit.
[all …]
Dact_connmark.c31 static int tcf_connmark_act(struct sk_buff *skb, const struct tc_action *a, in tcf_connmark_act() argument
37 struct tcf_connmark_info *ca = to_connmark(a); in tcf_connmark_act()
95 struct nlattr *est, struct tc_action **a, in tcf_connmark_init() argument
121 ret = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_connmark_init()
123 ret = tcf_idr_create(tn, index, est, a, in tcf_connmark_init()
130 ci = to_connmark(*a); in tcf_connmark_init()
135 tcf_action_set_ctrlact(*a, parm->action, goto_ch); in tcf_connmark_init()
139 tcf_idr_insert(tn, *a); in tcf_connmark_init()
142 ci = to_connmark(*a); in tcf_connmark_init()
146 tcf_idr_release(*a, bind); in tcf_connmark_init()
[all …]
Dact_sample.c37 struct nlattr *est, struct tc_action **a, int ovr, in tcf_sample_init() argument
63 err = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_sample_init()
71 ret = tcf_idr_create(tn, index, est, a, in tcf_sample_init()
79 tcf_idr_release(*a, bind); in tcf_sample_init()
99 s = to_sample(*a); in tcf_sample_init()
102 goto_ch = tcf_action_set_ctrlact(*a, parm->action, goto_ch); in tcf_sample_init()
120 tcf_idr_insert(tn, *a); in tcf_sample_init()
126 tcf_idr_release(*a, bind); in tcf_sample_init()
130 static void tcf_sample_cleanup(struct tc_action *a) in tcf_sample_cleanup() argument
132 struct tcf_sample *s = to_sample(a); in tcf_sample_cleanup()
[all …]
Dact_skbmod.c24 static int tcf_skbmod_act(struct sk_buff *skb, const struct tc_action *a, in tcf_skbmod_act() argument
27 struct tcf_skbmod *d = to_skbmod(a); in tcf_skbmod_act()
80 struct nlattr *est, struct tc_action **a, in tcf_skbmod_init() argument
129 err = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_skbmod_init()
138 tcf_idr_release(*a, bind); in tcf_skbmod_init()
145 ret = tcf_idr_create(tn, index, est, a, in tcf_skbmod_init()
154 tcf_idr_release(*a, bind); in tcf_skbmod_init()
161 d = to_skbmod(*a); in tcf_skbmod_init()
174 goto_ch = tcf_action_set_ctrlact(*a, parm->action, goto_ch); in tcf_skbmod_init()
194 tcf_idr_insert(tn, *a); in tcf_skbmod_init()
[all …]
Dact_gact.c54 struct nlattr *est, struct tc_action **a, in tcf_gact_init() argument
99 err = tcf_idr_check_alloc(tn, &index, a, bind); in tcf_gact_init()
101 ret = tcf_idr_create(tn, index, est, a, in tcf_gact_init()
112 tcf_idr_release(*a, bind); in tcf_gact_init()
122 gact = to_gact(*a); in tcf_gact_init()
125 goto_ch = tcf_action_set_ctrlact(*a, parm->action, goto_ch); in tcf_gact_init()
143 tcf_idr_insert(tn, *a); in tcf_gact_init()
146 tcf_idr_release(*a, bind); in tcf_gact_init()
150 static int tcf_gact_act(struct sk_buff *skb, const struct tc_action *a, in tcf_gact_act() argument
153 struct tcf_gact *gact = to_gact(a); in tcf_gact_act()
[all …]
/net/netfilter/ipset/
DKconfig12 To compile it as a module, choose M here. If unsure, say N.
33 can store IPv4 addresses (or network addresse) from a range.
35 To compile it as a module, choose M here. If unsure, say N.
42 can store IPv4 address and (source) MAC address pairs from a range.
44 To compile it as a module, choose M here. If unsure, say N.
51 can store TCP/UDP port numbers from a range.
53 To compile it as a module, choose M here. If unsure, say N.
61 in a set.
63 To compile it as a module, choose M here. If unsure, say N.
72 To compile it as a module, choose M here. If unsure, say N.
[all …]
/net/netfilter/
DKconfig64 Connection tracking keeps a record of what packets have passed
72 To compile it as a module, choose M here. If unsure, say N.
112 Normally, each connection needs to have a unique system wide
134 provide a notifier chain that can be used by other kernel code
215 To compile it as a module, choose M here. If unsure, say N.
227 To compile it as a module, choose M here. If unsure, say N.
234 H.323 is a VoIP signalling protocol from ITU-T. As one of the most
239 With this module you can support H.323 on a connection tracking/NAT
247 To compile it as a module, choose M here. If unsure, say N.
253 There is a commonly-used extension to IRC called
[all …]
/net/
Dcompat.c721 u32 a[AUDITSC_ARGS]; in COMPAT_SYSCALL_DEFINE2() local
729 if (len > sizeof(a)) in COMPAT_SYSCALL_DEFINE2()
732 if (copy_from_user(a, args, len)) in COMPAT_SYSCALL_DEFINE2()
735 ret = audit_socketcall_compat(len / sizeof(a[0]), a); in COMPAT_SYSCALL_DEFINE2()
739 a0 = a[0]; in COMPAT_SYSCALL_DEFINE2()
740 a1 = a[1]; in COMPAT_SYSCALL_DEFINE2()
744 ret = __sys_socket(a0, a1, a[2]); in COMPAT_SYSCALL_DEFINE2()
747 ret = __sys_bind(a0, compat_ptr(a1), a[2]); in COMPAT_SYSCALL_DEFINE2()
750 ret = __sys_connect(a0, compat_ptr(a1), a[2]); in COMPAT_SYSCALL_DEFINE2()
756 ret = __sys_accept4(a0, compat_ptr(a1), compat_ptr(a[2]), 0); in COMPAT_SYSCALL_DEFINE2()
[all …]
/net/ipv4/netfilter/
DKconfig67 To compile it as a module, choose M here.
100 SNMP payloads. In conjunction with NAT, it allows a network
107 To compile it as a module, choose M here. If unsure, say N.
126 iptables is a general, extensible packet identification framework.
131 To compile it as a module, choose M here. If unsure, say N.
140 This match extension allows you to match a range of SPIs
143 To compile it as a module, choose M here. If unsure, say N.
150 This is a backwards-compat option for the user's convenience
162 To compile it as a module, choose M here. If unsure, say N.
170 This is a backwards-compat option for the user's convenience
[all …]
/net/bridge/netfilter/
DKconfig35 Connection tracking keeps a record of what packets have passed
39 the bridge. This provides a replacement for the `br_netfilter'
42 To compile it as a module, choose M here. If unsure, say N.
49 ebtables is a general, extensible frame/packet identification
62 bridging and routing frames, giving Linux the functionality of a
66 To compile it as a module, choose M here. If unsure, say N.
75 To compile it as a module, choose M here. If unsure, say N.
84 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.
99 and/or destination address on a list of addresses. Optionally,
[all …]
/net/dccp/ccids/lib/
Dtfrc.h21 #define tfrc_pr_debug(format, a...) DCCP_PR_DEBUG(tfrc_debug, format, ##a) argument
23 #define tfrc_pr_debug(format, a...) argument
27 static inline u64 scaled_div(u64 a, u64 b) in scaled_div() argument
30 return div64_u64(a * 1000000, b); in scaled_div()
33 static inline u32 scaled_div32(u64 a, u64 b) in scaled_div32() argument
35 u64 result = scaled_div(a, b); in scaled_div32()
39 (unsigned long long)a, (unsigned long long)b); in scaled_div32()
/net/ipv6/netfilter/
DKconfig56 To compile it as a module, choose M here.
80 ip6tables is a general, extensible packet identification framework.
85 To compile it as a module, choose M here. If unsure, say N.
96 To compile it as a module, choose M here. If unsure, say N.
106 To compile it as a module, choose M here. If unsure, say N.
115 To compile it as a module, choose M here. If unsure, say N.
122 and destination options headers of a packet.
124 To compile it as a module, choose M here. If unsure, say N.
131 This is a backwards-compat option for the user's convenience
142 To compile it as a module, choose M here. If unsure, say N.
[all …]
/net/6lowpan/
Diphc.c98 #define is_addr_mac_addr_based(a, m) \ argument
99 ((((a)->s6_addr[8]) == (((m)[0]) ^ 0x02)) && \
100 (((a)->s6_addr[9]) == (m)[1]) && \
101 (((a)->s6_addr[10]) == (m)[2]) && \
102 (((a)->s6_addr[11]) == (m)[3]) && \
103 (((a)->s6_addr[12]) == (m)[4]) && \
104 (((a)->s6_addr[13]) == (m)[5]) && \
105 (((a)->s6_addr[14]) == (m)[6]) && \
106 (((a)->s6_addr[15]) == (m)[7]))
111 #define lowpan_is_iid_16_bit_compressable(a) \ argument
[all …]

12345678