]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - include/linux/netfilter/x_tables.h
netfilter: x_tables: pass xt_counters struct to counter allocator
[mirror_ubuntu-artful-kernel.git] / include / linux / netfilter / x_tables.h
CommitLineData
2e4e6a17
HW
1#ifndef _X_TABLES_H
2#define _X_TABLES_H
60c195c7 3
2e4e6a17
HW
4
5#include <linux/netdevice.h>
dcebd315 6#include <linux/static_key.h>
613dbd95 7#include <linux/netfilter.h>
94d0ec58 8#include <uapi/linux/netfilter/x_tables.h>
2e4e6a17 9
c37a2dfa
JP
10/* Test a struct->invflags and a boolean for inequality */
11#define NF_INVF(ptr, flag, boolean) \
12 ((boolean) ^ !!((ptr)->invflags & (flag)))
13
f7108a20 14/**
de74c169 15 * struct xt_action_param - parameters for matches/targets
f7108a20 16 *
de74c169
JE
17 * @match: the match extension
18 * @target: the target extension
19 * @matchinfo: per-match data
20 * @targetinfo: per-target data
613dbd95 21 * @state: pointer to hook state this packet came from
f7108a20
JE
22 * @fragoff: packet is a fragment, this is the data offset
23 * @thoff: position of transport header relative to skb->data
b4ba2611
JE
24 *
25 * Fields written to by extensions:
26 *
a5e78820 27 * @hotdrop: drop packet if we had inspection problems
f7108a20 28 */
de74c169
JE
29struct xt_action_param {
30 union {
31 const struct xt_match *match;
32 const struct xt_target *target;
33 };
34 union {
35 const void *matchinfo, *targinfo;
36 };
613dbd95 37 const struct nf_hook_state *state;
f7108a20
JE
38 int fragoff;
39 unsigned int thoff;
b4ba2611 40 bool hotdrop;
f7108a20
JE
41};
42
613dbd95
PNA
43static inline struct net *xt_net(const struct xt_action_param *par)
44{
45 return par->state->net;
46}
47
48static inline struct net_device *xt_in(const struct xt_action_param *par)
49{
50 return par->state->in;
51}
52
53static inline const char *xt_inname(const struct xt_action_param *par)
54{
55 return par->state->in->name;
56}
57
58static inline struct net_device *xt_out(const struct xt_action_param *par)
59{
60 return par->state->out;
61}
62
63static inline const char *xt_outname(const struct xt_action_param *par)
64{
65 return par->state->out->name;
66}
67
68static inline unsigned int xt_hooknum(const struct xt_action_param *par)
69{
70 return par->state->hook;
71}
72
73static inline u_int8_t xt_family(const struct xt_action_param *par)
74{
75 return par->state->pf;
76}
77
9b4fce7a
JE
78/**
79 * struct xt_mtchk_param - parameters for match extensions'
80 * checkentry functions
81 *
16599786 82 * @net: network namespace through which the check was invoked
9b4fce7a
JE
83 * @table: table the rule is tried to be inserted into
84 * @entryinfo: the family-specific rule data
16599786 85 * (struct ipt_ip, ip6t_ip, arpt_arp or (note) ebt_entry)
9b4fce7a
JE
86 * @match: struct xt_match through which this function was invoked
87 * @matchinfo: per-match data
88 * @hook_mask: via which hooks the new rule is reachable
16599786 89 * Other fields as above.
9b4fce7a
JE
90 */
91struct xt_mtchk_param {
a83d8e8d 92 struct net *net;
9b4fce7a
JE
93 const char *table;
94 const void *entryinfo;
95 const struct xt_match *match;
96 void *matchinfo;
97 unsigned int hook_mask;
916a917d 98 u_int8_t family;
55917a21 99 bool nft_compat;
9b4fce7a
JE
100};
101
16599786
JE
102/**
103 * struct xt_mdtor_param - match destructor parameters
104 * Fields as above.
105 */
6be3d859 106struct xt_mtdtor_param {
f54e9367 107 struct net *net;
6be3d859
JE
108 const struct xt_match *match;
109 void *matchinfo;
916a917d 110 u_int8_t family;
6be3d859
JE
111};
112
af5d6dc2
JE
113/**
114 * struct xt_tgchk_param - parameters for target extensions'
115 * checkentry functions
116 *
117 * @entryinfo: the family-specific rule data
118 * (struct ipt_entry, ip6t_entry, arpt_entry, ebt_entry)
119 *
120 * Other fields see above.
121 */
122struct xt_tgchk_param {
add67461 123 struct net *net;
af5d6dc2 124 const char *table;
f79fca55 125 const void *entryinfo;
af5d6dc2
JE
126 const struct xt_target *target;
127 void *targinfo;
128 unsigned int hook_mask;
916a917d 129 u_int8_t family;
55917a21 130 bool nft_compat;
af5d6dc2
JE
131};
132
a2df1648
JE
133/* Target destructor parameters */
134struct xt_tgdtor_param {
add67461 135 struct net *net;
a2df1648
JE
136 const struct xt_target *target;
137 void *targinfo;
916a917d 138 u_int8_t family;
a2df1648
JE
139};
140
d94d9fee 141struct xt_match {
2e4e6a17
HW
142 struct list_head list;
143
4b2cbd42 144 const char name[XT_EXTENSION_MAXNAMELEN];
daaf83d2 145 u_int8_t revision;
2e4e6a17 146
2e4e6a17
HW
147 /* Return true or false: return FALSE and set *hotdrop = 1 to
148 force immediate packet drop. */
149 /* Arguments changed since 2.6.9, as this must now handle
150 non-linear skb, using skb_header_pointer and
151 skb_ip_make_writable. */
1d93a9cb 152 bool (*match)(const struct sk_buff *skb,
62fc8051 153 struct xt_action_param *);
2e4e6a17
HW
154
155 /* Called when user tries to insert an entry of this type. */
b0f38452 156 int (*checkentry)(const struct xt_mtchk_param *);
2e4e6a17
HW
157
158 /* Called when entry of this type deleted. */
6be3d859 159 void (*destroy)(const struct xt_mtdtor_param *);
c30f540b 160#ifdef CONFIG_COMPAT
2722971c 161 /* Called when userspace align differs from kernel space one */
739674fb
JE
162 void (*compat_from_user)(void *dst, const void *src);
163 int (*compat_to_user)(void __user *dst, const void *src);
c30f540b 164#endif
2e4e6a17
HW
165 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
166 struct module *me;
37f9f733 167
ecb6f85e 168 const char *table;
37f9f733 169 unsigned int matchsize;
c30f540b 170#ifdef CONFIG_COMPAT
9fa492cd 171 unsigned int compatsize;
c30f540b 172#endif
37f9f733
PM
173 unsigned int hooks;
174 unsigned short proto;
c4b88513
PM
175
176 unsigned short family;
2e4e6a17
HW
177};
178
179/* Registration hooks for targets. */
d94d9fee 180struct xt_target {
2e4e6a17
HW
181 struct list_head list;
182
4b2cbd42 183 const char name[XT_EXTENSION_MAXNAMELEN];
f5c511c6 184 u_int8_t revision;
2e4e6a17 185
2e4e6a17
HW
186 /* Returns verdict. Argument order changed since 2.6.9, as this
187 must now handle non-linear skbs, using skb_copy_bits and
188 skb_ip_make_writable. */
3db05fea 189 unsigned int (*target)(struct sk_buff *skb,
de74c169 190 const struct xt_action_param *);
2e4e6a17
HW
191
192 /* Called when user tries to insert an entry of this type:
193 hook_mask is a bitmask of hooks from which it can be
194 called. */
7ea7b858 195 /* Should return 0 on success or an error code otherwise (-Exxxx). */
135367b8 196 int (*checkentry)(const struct xt_tgchk_param *);
2e4e6a17
HW
197
198 /* Called when entry of this type deleted. */
a2df1648 199 void (*destroy)(const struct xt_tgdtor_param *);
c30f540b 200#ifdef CONFIG_COMPAT
2722971c 201 /* Called when userspace align differs from kernel space one */
739674fb
JE
202 void (*compat_from_user)(void *dst, const void *src);
203 int (*compat_to_user)(void __user *dst, const void *src);
c30f540b 204#endif
2e4e6a17
HW
205 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
206 struct module *me;
37f9f733 207
ecb6f85e 208 const char *table;
37f9f733 209 unsigned int targetsize;
c30f540b 210#ifdef CONFIG_COMPAT
9fa492cd 211 unsigned int compatsize;
c30f540b 212#endif
37f9f733
PM
213 unsigned int hooks;
214 unsigned short proto;
c4b88513
PM
215
216 unsigned short family;
2e4e6a17
HW
217};
218
219/* Furniture shopping... */
d94d9fee 220struct xt_table {
2e4e6a17
HW
221 struct list_head list;
222
2e4e6a17
HW
223 /* What hooks you will enter on */
224 unsigned int valid_hooks;
225
2e4e6a17 226 /* Man behind the curtain... */
4a2f965c 227 struct xt_table_info *private;
2e4e6a17
HW
228
229 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
230 struct module *me;
231
76108cea 232 u_int8_t af; /* address/protocol family */
2b95efe7 233 int priority; /* hook order */
4a2f965c 234
b9e69e12
FW
235 /* called when table is needed in the given netns */
236 int (*table_init)(struct net *net);
237
4a2f965c
SH
238 /* A unique name... */
239 const char name[XT_TABLE_MAXNAMELEN];
2e4e6a17
HW
240};
241
242#include <linux/netfilter_ipv4.h>
243
244/* The table itself */
d94d9fee 245struct xt_table_info {
2e4e6a17
HW
246 /* Size per table */
247 unsigned int size;
248 /* Number of entries: FIXME. --RR */
249 unsigned int number;
250 /* Initial number of entries. Needed for module usage count */
251 unsigned int initial_entries;
252
253 /* Entry points and underflows */
6e23ae2a
PM
254 unsigned int hook_entry[NF_INET_NUMHOOKS];
255 unsigned int underflow[NF_INET_NUMHOOKS];
2e4e6a17 256
f3c5c1bf
JE
257 /*
258 * Number of user chains. Since tables cannot have loops, at most
259 * @stacksize jumps (number of user chains) can possibly be made.
260 */
261 unsigned int stacksize;
f3c5c1bf 262 void ***jumpstack;
482cfc31 263
711bdde6 264 unsigned char entries[0] __aligned(8);
2e4e6a17
HW
265};
266
a0f4ecf3
JP
267int xt_register_target(struct xt_target *target);
268void xt_unregister_target(struct xt_target *target);
269int xt_register_targets(struct xt_target *target, unsigned int n);
270void xt_unregister_targets(struct xt_target *target, unsigned int n);
271
272int xt_register_match(struct xt_match *target);
273void xt_unregister_match(struct xt_match *target);
274int xt_register_matches(struct xt_match *match, unsigned int n);
275void xt_unregister_matches(struct xt_match *match, unsigned int n);
276
ce683e5f 277int xt_check_entry_offsets(const void *base, const char *elems,
7d35812c
FW
278 unsigned int target_offset,
279 unsigned int next_offset);
280
f4dc7771
FW
281unsigned int *xt_alloc_entry_offsets(unsigned int size);
282bool xt_find_jump_offset(const unsigned int *offsets,
283 unsigned int target, unsigned int size);
284
a0f4ecf3
JP
285int xt_check_match(struct xt_mtchk_param *, unsigned int size, u_int8_t proto,
286 bool inv_proto);
287int xt_check_target(struct xt_tgchk_param *, unsigned int size, u_int8_t proto,
288 bool inv_proto);
289
d7591f0c
FW
290void *xt_copy_counters_from_user(const void __user *user, unsigned int len,
291 struct xt_counters_info *info, bool compat);
292
a0f4ecf3
JP
293struct xt_table *xt_register_table(struct net *net,
294 const struct xt_table *table,
295 struct xt_table_info *bootstrap,
296 struct xt_table_info *newinfo);
297void *xt_unregister_table(struct xt_table *table);
298
299struct xt_table_info *xt_replace_table(struct xt_table *table,
300 unsigned int num_counters,
301 struct xt_table_info *newinfo,
302 int *error);
303
304struct xt_match *xt_find_match(u8 af, const char *name, u8 revision);
305struct xt_target *xt_find_target(u8 af, const char *name, u8 revision);
306struct xt_match *xt_request_find_match(u8 af, const char *name, u8 revision);
307struct xt_target *xt_request_find_target(u8 af, const char *name, u8 revision);
308int xt_find_revision(u8 af, const char *name, u8 revision, int target,
309 int *err);
310
311struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
312 const char *name);
313void xt_table_unlock(struct xt_table *t);
314
315int xt_proto_init(struct net *net, u_int8_t af);
316void xt_proto_fini(struct net *net, u_int8_t af);
317
318struct xt_table_info *xt_alloc_table_info(unsigned int size);
319void xt_free_table_info(struct xt_table_info *info);
942e4a2b 320
7f5c6d4f
ED
321/**
322 * xt_recseq - recursive seqcount for netfilter use
323 *
324 * Packet processing changes the seqcount only if no recursion happened
325 * get_counters() can use read_seqcount_begin()/read_seqcount_retry(),
326 * because we use the normal seqcount convention :
327 * Low order bit set to 1 if a writer is active.
942e4a2b 328 */
7f5c6d4f 329DECLARE_PER_CPU(seqcount_t, xt_recseq);
942e4a2b 330
dcebd315
FW
331/* xt_tee_enabled - true if x_tables needs to handle reentrancy
332 *
333 * Enabled if current ip(6)tables ruleset has at least one -j TEE rule.
334 */
335extern struct static_key xt_tee_enabled;
336
7f5c6d4f
ED
337/**
338 * xt_write_recseq_begin - start of a write section
942e4a2b 339 *
7f5c6d4f
ED
340 * Begin packet processing : all readers must wait the end
341 * 1) Must be called with preemption disabled
933393f5 342 * 2) softirqs must be disabled too (or we should use this_cpu_add())
7f5c6d4f
ED
343 * Returns :
344 * 1 if no recursion on this cpu
345 * 0 if recursion detected
942e4a2b 346 */
7f5c6d4f 347static inline unsigned int xt_write_recseq_begin(void)
942e4a2b 348{
7f5c6d4f 349 unsigned int addend;
942e4a2b 350
7f5c6d4f
ED
351 /*
352 * Low order bit of sequence is set if we already
353 * called xt_write_recseq_begin().
354 */
355 addend = (__this_cpu_read(xt_recseq.sequence) + 1) & 1;
942e4a2b 356
7f5c6d4f
ED
357 /*
358 * This is kind of a write_seqcount_begin(), but addend is 0 or 1
359 * We dont check addend value to avoid a test and conditional jump,
360 * since addend is most likely 1
361 */
362 __this_cpu_add(xt_recseq.sequence, addend);
363 smp_wmb();
942e4a2b 364
7f5c6d4f 365 return addend;
942e4a2b
SH
366}
367
7f5c6d4f
ED
368/**
369 * xt_write_recseq_end - end of a write section
370 * @addend: return value from previous xt_write_recseq_begin()
371 *
372 * End packet processing : all readers can proceed
373 * 1) Must be called with preemption disabled
933393f5 374 * 2) softirqs must be disabled too (or we should use this_cpu_add())
942e4a2b 375 */
7f5c6d4f 376static inline void xt_write_recseq_end(unsigned int addend)
942e4a2b 377{
7f5c6d4f
ED
378 /* this is kind of a write_seqcount_end(), but addend is 0 or 1 */
379 smp_wmb();
380 __this_cpu_add(xt_recseq.sequence, addend);
942e4a2b 381}
2e4e6a17 382
b8dfe498
ED
383/*
384 * This helper is performance critical and must be inlined
385 */
386static inline unsigned long ifname_compare_aligned(const char *_a,
387 const char *_b,
388 const char *_mask)
389{
390 const unsigned long *a = (const unsigned long *)_a;
391 const unsigned long *b = (const unsigned long *)_b;
392 const unsigned long *mask = (const unsigned long *)_mask;
393 unsigned long ret;
394
395 ret = (a[0] ^ b[0]) & mask[0];
396 if (IFNAMSIZ > sizeof(unsigned long))
397 ret |= (a[1] ^ b[1]) & mask[1];
398 if (IFNAMSIZ > 2 * sizeof(unsigned long))
399 ret |= (a[2] ^ b[2]) & mask[2];
400 if (IFNAMSIZ > 3 * sizeof(unsigned long))
401 ret |= (a[3] ^ b[3]) & mask[3];
402 BUILD_BUG_ON(IFNAMSIZ > 4 * sizeof(unsigned long));
403 return ret;
404}
405
71ae0dff 406
f28e15ba 407bool xt_percpu_counter_alloc(struct xt_counters *counters);
4d31eef5 408void xt_percpu_counter_free(struct xt_counters *cnt);
71ae0dff
FW
409
410static inline struct xt_counters *
411xt_get_this_cpu_counter(struct xt_counters *cnt)
412{
413 if (nr_cpu_ids > 1)
dcb8f5c8 414 return this_cpu_ptr((void __percpu *) (unsigned long) cnt->pcnt);
71ae0dff
FW
415
416 return cnt;
417}
418
419static inline struct xt_counters *
420xt_get_per_cpu_counter(struct xt_counters *cnt, unsigned int cpu)
421{
422 if (nr_cpu_ids > 1)
dcb8f5c8 423 return per_cpu_ptr((void __percpu *) (unsigned long) cnt->pcnt, cpu);
71ae0dff
FW
424
425 return cnt;
426}
427
b9e69e12 428struct nf_hook_ops *xt_hook_ops_alloc(const struct xt_table *, nf_hookfn *);
2b95efe7 429
2722971c
DM
430#ifdef CONFIG_COMPAT
431#include <net/compat.h>
432
d94d9fee 433struct compat_xt_entry_match {
2722971c
DM
434 union {
435 struct {
436 u_int16_t match_size;
437 char name[XT_FUNCTION_MAXNAMELEN - 1];
438 u_int8_t revision;
439 } user;
46c5ea3c
PM
440 struct {
441 u_int16_t match_size;
442 compat_uptr_t match;
443 } kernel;
2722971c
DM
444 u_int16_t match_size;
445 } u;
446 unsigned char data[0];
447};
448
d94d9fee 449struct compat_xt_entry_target {
2722971c
DM
450 union {
451 struct {
452 u_int16_t target_size;
453 char name[XT_FUNCTION_MAXNAMELEN - 1];
454 u_int8_t revision;
455 } user;
46c5ea3c
PM
456 struct {
457 u_int16_t target_size;
458 compat_uptr_t target;
459 } kernel;
2722971c
DM
460 u_int16_t target_size;
461 } u;
462 unsigned char data[0];
463};
464
465/* FIXME: this works only on 32 bit tasks
466 * need to change whole approach in order to calculate align as function of
467 * current task alignment */
468
d94d9fee 469struct compat_xt_counters {
0a026046 470 compat_u64 pcnt, bcnt; /* Packet and byte counters */
2722971c
DM
471};
472
d94d9fee 473struct compat_xt_counters_info {
2722971c
DM
474 char name[XT_TABLE_MAXNAMELEN];
475 compat_uint_t num_counters;
476 struct compat_xt_counters counters[0];
477};
478
42107f50
AD
479struct _compat_xt_align {
480 __u8 u8;
481 __u16 u16;
482 __u32 u32;
483 compat_u64 u64;
484};
485
a79ff731 486#define COMPAT_XT_ALIGN(s) __ALIGN_KERNEL((s), __alignof__(struct _compat_xt_align))
2722971c 487
a0f4ecf3
JP
488void xt_compat_lock(u_int8_t af);
489void xt_compat_unlock(u_int8_t af);
490
491int xt_compat_add_offset(u_int8_t af, unsigned int offset, int delta);
492void xt_compat_flush_offsets(u_int8_t af);
493void xt_compat_init_offsets(u_int8_t af, unsigned int number);
494int xt_compat_calc_jump(u_int8_t af, unsigned int offset);
495
496int xt_compat_match_offset(const struct xt_match *match);
0188346f 497void xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
a0f4ecf3
JP
498 unsigned int *size);
499int xt_compat_match_to_user(const struct xt_entry_match *m,
500 void __user **dstptr, unsigned int *size);
501
502int xt_compat_target_offset(const struct xt_target *target);
503void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
504 unsigned int *size);
505int xt_compat_target_to_user(const struct xt_entry_target *t,
506 void __user **dstptr, unsigned int *size);
ce683e5f 507int xt_compat_check_entry_offsets(const void *base, const char *elems,
fc1221b3
FW
508 unsigned int target_offset,
509 unsigned int next_offset);
2722971c
DM
510
511#endif /* CONFIG_COMPAT */
2e4e6a17 512#endif /* _X_TABLES_H */