netfilter: ebtables: avoid explicit XT_ALIGN() in match/targets
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / include / linux / netfilter / x_tables.h
CommitLineData
2e4e6a17
HW
1#ifndef _X_TABLES_H
2#define _X_TABLES_H
3
60c195c7
AB
4#include <linux/types.h>
5
2e4e6a17
HW
6#define XT_FUNCTION_MAXNAMELEN 30
7#define XT_TABLE_MAXNAMELEN 32
8
d94d9fee 9struct xt_entry_match {
1e30a014
DM
10 union {
11 struct {
60c195c7 12 __u16 match_size;
1e30a014
DM
13
14 /* Used by userspace */
15 char name[XT_FUNCTION_MAXNAMELEN-1];
16
60c195c7 17 __u8 revision;
1e30a014
DM
18 } user;
19 struct {
60c195c7 20 __u16 match_size;
1e30a014
DM
21
22 /* Used inside the kernel */
23 struct xt_match *match;
24 } kernel;
25
26 /* Total length */
60c195c7 27 __u16 match_size;
1e30a014
DM
28 } u;
29
30 unsigned char data[0];
31};
32
d94d9fee 33struct xt_entry_target {
1e30a014
DM
34 union {
35 struct {
60c195c7 36 __u16 target_size;
1e30a014
DM
37
38 /* Used by userspace */
39 char name[XT_FUNCTION_MAXNAMELEN-1];
40
60c195c7 41 __u8 revision;
1e30a014
DM
42 } user;
43 struct {
60c195c7 44 __u16 target_size;
1e30a014
DM
45
46 /* Used inside the kernel */
47 struct xt_target *target;
48 } kernel;
49
50 /* Total length */
60c195c7 51 __u16 target_size;
1e30a014
DM
52 } u;
53
54 unsigned char data[0];
55};
56
3c2ad469
PM
57#define XT_TARGET_INIT(__name, __size) \
58{ \
59 .target.u.user = { \
60 .target_size = XT_ALIGN(__size), \
61 .name = __name, \
62 }, \
63}
64
d94d9fee 65struct xt_standard_target {
1e30a014
DM
66 struct xt_entry_target target;
67 int verdict;
68};
69
2e4e6a17
HW
70/* The argument to IPT_SO_GET_REVISION_*. Returns highest revision
71 * kernel supports, if >= revision. */
d94d9fee 72struct xt_get_revision {
2e4e6a17
HW
73 char name[XT_FUNCTION_MAXNAMELEN-1];
74
60c195c7 75 __u8 revision;
2e4e6a17
HW
76};
77
78/* CONTINUE verdict for targets */
79#define XT_CONTINUE 0xFFFFFFFF
80
81/* For standard target */
82#define XT_RETURN (-NF_REPEAT - 1)
83
6fbfc968
DM
84/* this is a dummy structure to find out the alignment requirement for a struct
85 * containing all the fundamental data types that are used in ipt_entry,
86 * ip6t_entry and arpt_entry. This sucks, and it is a hack. It will be my
87 * personal pleasure to remove it -HW
88 */
d94d9fee 89struct _xt_align {
60c195c7
AB
90 __u8 u8;
91 __u16 u16;
92 __u32 u32;
93 __u64 u64;
6fbfc968
DM
94};
95
42107f50 96#define XT_ALIGN(s) ALIGN((s), __alignof__(struct _xt_align))
2e4e6a17
HW
97
98/* Standard return verdict, or do jump. */
99#define XT_STANDARD_TARGET ""
100/* Error verdict. */
101#define XT_ERROR_TARGET "ERROR"
102
2e4e6a17
HW
103#define SET_COUNTER(c,b,p) do { (c).bcnt = (b); (c).pcnt = (p); } while(0)
104#define ADD_COUNTER(c,b,p) do { (c).bcnt += (b); (c).pcnt += (p); } while(0)
105
d94d9fee 106struct xt_counters {
60c195c7 107 __u64 pcnt, bcnt; /* Packet and byte counters */
2e4e6a17
HW
108};
109
110/* The argument to IPT_SO_ADD_COUNTERS. */
d94d9fee 111struct xt_counters_info {
2e4e6a17
HW
112 /* Which table. */
113 char name[XT_TABLE_MAXNAMELEN];
114
115 unsigned int num_counters;
116
117 /* The counters (actually `number' of these). */
118 struct xt_counters counters[0];
119};
120
121#define XT_INV_PROTO 0x40 /* Invert the sense of PROTO. */
122
89c002d6
PM
123/* fn returns 0 to continue iteration */
124#define XT_MATCH_ITERATE(type, e, fn, args...) \
125({ \
126 unsigned int __i; \
127 int __ret = 0; \
128 struct xt_entry_match *__m; \
129 \
130 for (__i = sizeof(type); \
131 __i < (e)->target_offset; \
132 __i += __m->u.match_size) { \
133 __m = (void *)e + __i; \
134 \
135 __ret = fn(__m , ## args); \
136 if (__ret != 0) \
137 break; \
138 } \
139 __ret; \
140})
141
142/* fn returns 0 to continue iteration */
143#define XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \
144({ \
145 unsigned int __i, __n; \
146 int __ret = 0; \
147 type *__entry; \
148 \
149 for (__i = 0, __n = 0; __i < (size); \
150 __i += __entry->next_offset, __n++) { \
151 __entry = (void *)(entries) + __i; \
152 if (__n < n) \
153 continue; \
154 \
155 __ret = fn(__entry , ## args); \
156 if (__ret != 0) \
157 break; \
158 } \
159 __ret; \
160})
161
162/* fn returns 0 to continue iteration */
163#define XT_ENTRY_ITERATE(type, entries, size, fn, args...) \
164 XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)
165
2e4e6a17
HW
166#ifdef __KERNEL__
167
168#include <linux/netdevice.h>
169
f7108a20
JE
170/**
171 * struct xt_match_param - parameters for match extensions' match functions
172 *
173 * @in: input netdevice
174 * @out: output netdevice
175 * @match: struct xt_match through which this function was invoked
176 * @matchinfo: per-match data
177 * @fragoff: packet is a fragment, this is the data offset
178 * @thoff: position of transport header relative to skb->data
a5e78820 179 * @hook: hook number given packet came from
916a917d
JE
180 * @family: Actual NFPROTO_* through which the function is invoked
181 * (helpful when match->family == NFPROTO_UNSPEC)
a5e78820 182 * @hotdrop: drop packet if we had inspection problems
f7108a20
JE
183 */
184struct xt_match_param {
185 const struct net_device *in, *out;
186 const struct xt_match *match;
187 const void *matchinfo;
188 int fragoff;
189 unsigned int thoff;
a5e78820 190 unsigned int hooknum;
916a917d 191 u_int8_t family;
a5e78820 192 bool *hotdrop;
f7108a20
JE
193};
194
9b4fce7a
JE
195/**
196 * struct xt_mtchk_param - parameters for match extensions'
197 * checkentry functions
198 *
199 * @table: table the rule is tried to be inserted into
200 * @entryinfo: the family-specific rule data
201 * (struct ipt_ip, ip6t_ip, ebt_entry)
202 * @match: struct xt_match through which this function was invoked
203 * @matchinfo: per-match data
204 * @hook_mask: via which hooks the new rule is reachable
205 */
206struct xt_mtchk_param {
a83d8e8d 207 struct net *net;
9b4fce7a
JE
208 const char *table;
209 const void *entryinfo;
210 const struct xt_match *match;
211 void *matchinfo;
212 unsigned int hook_mask;
916a917d 213 u_int8_t family;
9b4fce7a
JE
214};
215
6be3d859
JE
216/* Match destructor parameters */
217struct xt_mtdtor_param {
f54e9367 218 struct net *net;
6be3d859
JE
219 const struct xt_match *match;
220 void *matchinfo;
916a917d 221 u_int8_t family;
6be3d859
JE
222};
223
7eb35586
JE
224/**
225 * struct xt_target_param - parameters for target extensions' target functions
226 *
227 * @hooknum: hook through which this target was invoked
228 * @target: struct xt_target through which this function was invoked
229 * @targinfo: per-target data
230 *
231 * Other fields see above.
232 */
233struct xt_target_param {
234 const struct net_device *in, *out;
7eb35586
JE
235 const struct xt_target *target;
236 const void *targinfo;
98d89b41 237 unsigned int hooknum;
916a917d 238 u_int8_t family;
7eb35586
JE
239};
240
af5d6dc2
JE
241/**
242 * struct xt_tgchk_param - parameters for target extensions'
243 * checkentry functions
244 *
245 * @entryinfo: the family-specific rule data
246 * (struct ipt_entry, ip6t_entry, arpt_entry, ebt_entry)
247 *
248 * Other fields see above.
249 */
250struct xt_tgchk_param {
add67461 251 struct net *net;
af5d6dc2 252 const char *table;
f79fca55 253 const void *entryinfo;
af5d6dc2
JE
254 const struct xt_target *target;
255 void *targinfo;
256 unsigned int hook_mask;
916a917d 257 u_int8_t family;
af5d6dc2
JE
258};
259
a2df1648
JE
260/* Target destructor parameters */
261struct xt_tgdtor_param {
add67461 262 struct net *net;
a2df1648
JE
263 const struct xt_target *target;
264 void *targinfo;
916a917d 265 u_int8_t family;
a2df1648
JE
266};
267
d94d9fee 268struct xt_match {
2e4e6a17
HW
269 struct list_head list;
270
271 const char name[XT_FUNCTION_MAXNAMELEN-1];
daaf83d2 272 u_int8_t revision;
2e4e6a17 273
2e4e6a17
HW
274 /* Return true or false: return FALSE and set *hotdrop = 1 to
275 force immediate packet drop. */
276 /* Arguments changed since 2.6.9, as this must now handle
277 non-linear skb, using skb_header_pointer and
278 skb_ip_make_writable. */
1d93a9cb 279 bool (*match)(const struct sk_buff *skb,
f7108a20 280 const struct xt_match_param *);
2e4e6a17
HW
281
282 /* Called when user tries to insert an entry of this type. */
9b4fce7a 283 bool (*checkentry)(const struct xt_mtchk_param *);
2e4e6a17
HW
284
285 /* Called when entry of this type deleted. */
6be3d859 286 void (*destroy)(const struct xt_mtdtor_param *);
c30f540b 287#ifdef CONFIG_COMPAT
2722971c 288 /* Called when userspace align differs from kernel space one */
739674fb
JE
289 void (*compat_from_user)(void *dst, const void *src);
290 int (*compat_to_user)(void __user *dst, const void *src);
c30f540b 291#endif
2e4e6a17
HW
292 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
293 struct module *me;
37f9f733 294
91270cf8
PM
295 /* Free to use by each match */
296 unsigned long data;
297
ecb6f85e 298 const char *table;
37f9f733 299 unsigned int matchsize;
c30f540b 300#ifdef CONFIG_COMPAT
9fa492cd 301 unsigned int compatsize;
c30f540b 302#endif
37f9f733
PM
303 unsigned int hooks;
304 unsigned short proto;
c4b88513
PM
305
306 unsigned short family;
2e4e6a17
HW
307};
308
309/* Registration hooks for targets. */
d94d9fee 310struct xt_target {
2e4e6a17
HW
311 struct list_head list;
312
313 const char name[XT_FUNCTION_MAXNAMELEN-1];
314
2e4e6a17
HW
315 /* Returns verdict. Argument order changed since 2.6.9, as this
316 must now handle non-linear skbs, using skb_copy_bits and
317 skb_ip_make_writable. */
3db05fea 318 unsigned int (*target)(struct sk_buff *skb,
7eb35586 319 const struct xt_target_param *);
2e4e6a17
HW
320
321 /* Called when user tries to insert an entry of this type:
322 hook_mask is a bitmask of hooks from which it can be
323 called. */
324 /* Should return true or false. */
af5d6dc2 325 bool (*checkentry)(const struct xt_tgchk_param *);
2e4e6a17
HW
326
327 /* Called when entry of this type deleted. */
a2df1648 328 void (*destroy)(const struct xt_tgdtor_param *);
c30f540b 329#ifdef CONFIG_COMPAT
2722971c 330 /* Called when userspace align differs from kernel space one */
739674fb
JE
331 void (*compat_from_user)(void *dst, const void *src);
332 int (*compat_to_user)(void __user *dst, const void *src);
c30f540b 333#endif
2e4e6a17
HW
334 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
335 struct module *me;
37f9f733 336
ecb6f85e 337 const char *table;
37f9f733 338 unsigned int targetsize;
c30f540b 339#ifdef CONFIG_COMPAT
9fa492cd 340 unsigned int compatsize;
c30f540b 341#endif
37f9f733
PM
342 unsigned int hooks;
343 unsigned short proto;
c4b88513
PM
344
345 unsigned short family;
37f9f733 346 u_int8_t revision;
2e4e6a17
HW
347};
348
349/* Furniture shopping... */
d94d9fee 350struct xt_table {
2e4e6a17
HW
351 struct list_head list;
352
2e4e6a17
HW
353 /* What hooks you will enter on */
354 unsigned int valid_hooks;
355
2e4e6a17 356 /* Man behind the curtain... */
4a2f965c 357 struct xt_table_info *private;
2e4e6a17
HW
358
359 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
360 struct module *me;
361
76108cea 362 u_int8_t af; /* address/protocol family */
2b95efe7 363 int priority; /* hook order */
4a2f965c
SH
364
365 /* A unique name... */
366 const char name[XT_TABLE_MAXNAMELEN];
2e4e6a17
HW
367};
368
369#include <linux/netfilter_ipv4.h>
370
371/* The table itself */
d94d9fee 372struct xt_table_info {
2e4e6a17
HW
373 /* Size per table */
374 unsigned int size;
375 /* Number of entries: FIXME. --RR */
376 unsigned int number;
377 /* Initial number of entries. Needed for module usage count */
378 unsigned int initial_entries;
379
380 /* Entry points and underflows */
6e23ae2a
PM
381 unsigned int hook_entry[NF_INET_NUMHOOKS];
382 unsigned int underflow[NF_INET_NUMHOOKS];
2e4e6a17
HW
383
384 /* ipt_entry tables: one per CPU */
259d4e41 385 /* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */
78454473 386 void *entries[1];
2e4e6a17
HW
387};
388
259d4e41
ED
389#define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
390 + nr_cpu_ids * sizeof(char *))
a45049c5
PNA
391extern int xt_register_target(struct xt_target *target);
392extern void xt_unregister_target(struct xt_target *target);
52d9c42e
PM
393extern int xt_register_targets(struct xt_target *target, unsigned int n);
394extern void xt_unregister_targets(struct xt_target *target, unsigned int n);
395
a45049c5
PNA
396extern int xt_register_match(struct xt_match *target);
397extern void xt_unregister_match(struct xt_match *target);
52d9c42e
PM
398extern int xt_register_matches(struct xt_match *match, unsigned int n);
399extern void xt_unregister_matches(struct xt_match *match, unsigned int n);
2e4e6a17 400
916a917d 401extern int xt_check_match(struct xt_mtchk_param *,
9b4fce7a 402 unsigned int size, u_int8_t proto, bool inv_proto);
916a917d 403extern int xt_check_target(struct xt_tgchk_param *,
af5d6dc2 404 unsigned int size, u_int8_t proto, bool inv_proto);
37f9f733 405
8d870052 406extern struct xt_table *xt_register_table(struct net *net,
35aad0ff 407 const struct xt_table *table,
a98da11d
AD
408 struct xt_table_info *bootstrap,
409 struct xt_table_info *newinfo);
2e4e6a17
HW
410extern void *xt_unregister_table(struct xt_table *table);
411
412extern struct xt_table_info *xt_replace_table(struct xt_table *table,
413 unsigned int num_counters,
414 struct xt_table_info *newinfo,
415 int *error);
416
76108cea
JE
417extern struct xt_match *xt_find_match(u8 af, const char *name, u8 revision);
418extern struct xt_target *xt_find_target(u8 af, const char *name, u8 revision);
419extern struct xt_target *xt_request_find_target(u8 af, const char *name,
2e4e6a17 420 u8 revision);
76108cea
JE
421extern int xt_find_revision(u8 af, const char *name, u8 revision,
422 int target, int *err);
2e4e6a17 423
76108cea 424extern struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
8d870052 425 const char *name);
2e4e6a17
HW
426extern void xt_table_unlock(struct xt_table *t);
427
76108cea
JE
428extern int xt_proto_init(struct net *net, u_int8_t af);
429extern void xt_proto_fini(struct net *net, u_int8_t af);
2e4e6a17
HW
430
431extern struct xt_table_info *xt_alloc_table_info(unsigned int size);
432extern void xt_free_table_info(struct xt_table_info *info);
942e4a2b
SH
433
434/*
435 * Per-CPU spinlock associated with per-cpu table entries, and
436 * with a counter for the "reading" side that allows a recursive
437 * reader to avoid taking the lock and deadlocking.
438 *
439 * "reading" is used by ip/arp/ip6 tables rule processing which runs per-cpu.
440 * It needs to ensure that the rules are not being changed while the packet
441 * is being processed. In some cases, the read lock will be acquired
442 * twice on the same CPU; this is okay because of the count.
443 *
444 * "writing" is used when reading counters.
445 * During replace any readers that are using the old tables have to complete
446 * before freeing the old table. This is handled by the write locking
447 * necessary for reading the counters.
448 */
449struct xt_info_lock {
450 spinlock_t lock;
451 unsigned char readers;
452};
453DECLARE_PER_CPU(struct xt_info_lock, xt_info_locks);
454
455/*
456 * Note: we need to ensure that preemption is disabled before acquiring
457 * the per-cpu-variable, so we do it as a two step process rather than
458 * using "spin_lock_bh()".
459 *
460 * We _also_ need to disable bottom half processing before updating our
461 * nesting count, to make sure that the only kind of re-entrancy is this
462 * code being called by itself: since the count+lock is not an atomic
463 * operation, we can allow no races.
464 *
465 * _Only_ that special combination of being per-cpu and never getting
466 * re-entered asynchronously means that the count is safe.
467 */
468static inline void xt_info_rdlock_bh(void)
469{
470 struct xt_info_lock *lock;
471
472 local_bh_disable();
473 lock = &__get_cpu_var(xt_info_locks);
0f3d042e 474 if (likely(!lock->readers++))
942e4a2b
SH
475 spin_lock(&lock->lock);
476}
477
478static inline void xt_info_rdunlock_bh(void)
479{
480 struct xt_info_lock *lock = &__get_cpu_var(xt_info_locks);
481
0f3d042e 482 if (likely(!--lock->readers))
942e4a2b
SH
483 spin_unlock(&lock->lock);
484 local_bh_enable();
485}
486
487/*
488 * The "writer" side needs to get exclusive access to the lock,
489 * regardless of readers. This must be called with bottom half
490 * processing (and thus also preemption) disabled.
491 */
492static inline void xt_info_wrlock(unsigned int cpu)
493{
494 spin_lock(&per_cpu(xt_info_locks, cpu).lock);
495}
496
497static inline void xt_info_wrunlock(unsigned int cpu)
498{
499 spin_unlock(&per_cpu(xt_info_locks, cpu).lock);
500}
2e4e6a17 501
b8dfe498
ED
502/*
503 * This helper is performance critical and must be inlined
504 */
505static inline unsigned long ifname_compare_aligned(const char *_a,
506 const char *_b,
507 const char *_mask)
508{
509 const unsigned long *a = (const unsigned long *)_a;
510 const unsigned long *b = (const unsigned long *)_b;
511 const unsigned long *mask = (const unsigned long *)_mask;
512 unsigned long ret;
513
514 ret = (a[0] ^ b[0]) & mask[0];
515 if (IFNAMSIZ > sizeof(unsigned long))
516 ret |= (a[1] ^ b[1]) & mask[1];
517 if (IFNAMSIZ > 2 * sizeof(unsigned long))
518 ret |= (a[2] ^ b[2]) & mask[2];
519 if (IFNAMSIZ > 3 * sizeof(unsigned long))
520 ret |= (a[3] ^ b[3]) & mask[3];
521 BUILD_BUG_ON(IFNAMSIZ > 4 * sizeof(unsigned long));
522 return ret;
523}
524
2b95efe7
JE
525extern struct nf_hook_ops *xt_hook_link(const struct xt_table *, nf_hookfn *);
526extern void xt_hook_unlink(const struct xt_table *, struct nf_hook_ops *);
527
2722971c
DM
528#ifdef CONFIG_COMPAT
529#include <net/compat.h>
530
d94d9fee 531struct compat_xt_entry_match {
2722971c
DM
532 union {
533 struct {
534 u_int16_t match_size;
535 char name[XT_FUNCTION_MAXNAMELEN - 1];
536 u_int8_t revision;
537 } user;
46c5ea3c
PM
538 struct {
539 u_int16_t match_size;
540 compat_uptr_t match;
541 } kernel;
2722971c
DM
542 u_int16_t match_size;
543 } u;
544 unsigned char data[0];
545};
546
d94d9fee 547struct compat_xt_entry_target {
2722971c
DM
548 union {
549 struct {
550 u_int16_t target_size;
551 char name[XT_FUNCTION_MAXNAMELEN - 1];
552 u_int8_t revision;
553 } user;
46c5ea3c
PM
554 struct {
555 u_int16_t target_size;
556 compat_uptr_t target;
557 } kernel;
2722971c
DM
558 u_int16_t target_size;
559 } u;
560 unsigned char data[0];
561};
562
563/* FIXME: this works only on 32 bit tasks
564 * need to change whole approach in order to calculate align as function of
565 * current task alignment */
566
d94d9fee 567struct compat_xt_counters {
0a026046 568 compat_u64 pcnt, bcnt; /* Packet and byte counters */
2722971c
DM
569};
570
d94d9fee 571struct compat_xt_counters_info {
2722971c
DM
572 char name[XT_TABLE_MAXNAMELEN];
573 compat_uint_t num_counters;
574 struct compat_xt_counters counters[0];
575};
576
42107f50
AD
577struct _compat_xt_align {
578 __u8 u8;
579 __u16 u16;
580 __u32 u32;
581 compat_u64 u64;
582};
583
584#define COMPAT_XT_ALIGN(s) ALIGN((s), __alignof__(struct _compat_xt_align))
2722971c 585
76108cea
JE
586extern void xt_compat_lock(u_int8_t af);
587extern void xt_compat_unlock(u_int8_t af);
9fa492cd 588
76108cea
JE
589extern int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta);
590extern void xt_compat_flush_offsets(u_int8_t af);
591extern short xt_compat_calc_jump(u_int8_t af, unsigned int offset);
b386d9f5 592
5452e425 593extern int xt_compat_match_offset(const struct xt_match *match);
89566951 594extern int xt_compat_match_from_user(struct xt_entry_match *m,
b0a6363c 595 void **dstptr, unsigned int *size);
739674fb 596extern int xt_compat_match_to_user(const struct xt_entry_match *m,
b0a6363c 597 void __user **dstptr, unsigned int *size);
9fa492cd 598
5452e425 599extern int xt_compat_target_offset(const struct xt_target *target);
9fa492cd 600extern void xt_compat_target_from_user(struct xt_entry_target *t,
b0a6363c 601 void **dstptr, unsigned int *size);
739674fb 602extern int xt_compat_target_to_user(const struct xt_entry_target *t,
b0a6363c 603 void __user **dstptr, unsigned int *size);
2722971c
DM
604
605#endif /* CONFIG_COMPAT */
2e4e6a17
HW
606#endif /* __KERNEL__ */
607
608#endif /* _X_TABLES_H */