blob: 72918b7cbe85558cc762bff6af7c56e2fac0d929 [file] [log] [blame]
Harald Welte2e4e6a12006-01-12 13:30:04 -08001#ifndef _X_TABLES_H
2#define _X_TABLES_H
3
4#define XT_FUNCTION_MAXNAMELEN 30
5#define XT_TABLE_MAXNAMELEN 32
6
Dmitry Mishin1e30a012006-03-22 13:56:56 -08007struct xt_entry_match
8{
9 union {
10 struct {
11 u_int16_t match_size;
12
13 /* Used by userspace */
14 char name[XT_FUNCTION_MAXNAMELEN-1];
15
16 u_int8_t revision;
17 } user;
18 struct {
19 u_int16_t match_size;
20
21 /* Used inside the kernel */
22 struct xt_match *match;
23 } kernel;
24
25 /* Total length */
26 u_int16_t match_size;
27 } u;
28
29 unsigned char data[0];
30};
31
32struct xt_entry_target
33{
34 union {
35 struct {
36 u_int16_t target_size;
37
38 /* Used by userspace */
39 char name[XT_FUNCTION_MAXNAMELEN-1];
40
41 u_int8_t revision;
42 } user;
43 struct {
44 u_int16_t target_size;
45
46 /* Used inside the kernel */
47 struct xt_target *target;
48 } kernel;
49
50 /* Total length */
51 u_int16_t target_size;
52 } u;
53
54 unsigned char data[0];
55};
56
Patrick McHardy3c2ad462007-05-10 14:14:16 -070057#define XT_TARGET_INIT(__name, __size) \
58{ \
59 .target.u.user = { \
60 .target_size = XT_ALIGN(__size), \
61 .name = __name, \
62 }, \
63}
64
Dmitry Mishin1e30a012006-03-22 13:56:56 -080065struct xt_standard_target
66{
67 struct xt_entry_target target;
68 int verdict;
69};
70
Harald Welte2e4e6a12006-01-12 13:30:04 -080071/* The argument to IPT_SO_GET_REVISION_*. Returns highest revision
72 * kernel supports, if >= revision. */
73struct xt_get_revision
74{
75 char name[XT_FUNCTION_MAXNAMELEN-1];
76
77 u_int8_t revision;
78};
79
80/* CONTINUE verdict for targets */
81#define XT_CONTINUE 0xFFFFFFFF
82
83/* For standard target */
84#define XT_RETURN (-NF_REPEAT - 1)
85
David S. Miller6fbfc962006-01-20 11:57:07 -080086/* this is a dummy structure to find out the alignment requirement for a struct
87 * containing all the fundamental data types that are used in ipt_entry,
88 * ip6t_entry and arpt_entry. This sucks, and it is a hack. It will be my
89 * personal pleasure to remove it -HW
90 */
91struct _xt_align
92{
93 u_int8_t u8;
94 u_int16_t u16;
95 u_int32_t u32;
96 u_int64_t u64;
97};
98
99#define XT_ALIGN(s) (((s) + (__alignof__(struct _xt_align)-1)) \
100 & ~(__alignof__(struct _xt_align)-1))
Harald Welte2e4e6a12006-01-12 13:30:04 -0800101
102/* Standard return verdict, or do jump. */
103#define XT_STANDARD_TARGET ""
104/* Error verdict. */
105#define XT_ERROR_TARGET "ERROR"
106
Harald Welte2e4e6a12006-01-12 13:30:04 -0800107#define SET_COUNTER(c,b,p) do { (c).bcnt = (b); (c).pcnt = (p); } while(0)
108#define ADD_COUNTER(c,b,p) do { (c).bcnt += (b); (c).pcnt += (p); } while(0)
109
110struct xt_counters
111{
112 u_int64_t pcnt, bcnt; /* Packet and byte counters */
113};
114
115/* The argument to IPT_SO_ADD_COUNTERS. */
116struct xt_counters_info
117{
118 /* Which table. */
119 char name[XT_TABLE_MAXNAMELEN];
120
121 unsigned int num_counters;
122
123 /* The counters (actually `number' of these). */
124 struct xt_counters counters[0];
125};
126
127#define XT_INV_PROTO 0x40 /* Invert the sense of PROTO. */
128
Patrick McHardy89c002d2007-12-17 21:46:59 -0800129/* fn returns 0 to continue iteration */
130#define XT_MATCH_ITERATE(type, e, fn, args...) \
131({ \
132 unsigned int __i; \
133 int __ret = 0; \
134 struct xt_entry_match *__m; \
135 \
136 for (__i = sizeof(type); \
137 __i < (e)->target_offset; \
138 __i += __m->u.match_size) { \
139 __m = (void *)e + __i; \
140 \
141 __ret = fn(__m , ## args); \
142 if (__ret != 0) \
143 break; \
144 } \
145 __ret; \
146})
147
148/* fn returns 0 to continue iteration */
149#define XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \
150({ \
151 unsigned int __i, __n; \
152 int __ret = 0; \
153 type *__entry; \
154 \
155 for (__i = 0, __n = 0; __i < (size); \
156 __i += __entry->next_offset, __n++) { \
157 __entry = (void *)(entries) + __i; \
158 if (__n < n) \
159 continue; \
160 \
161 __ret = fn(__entry , ## args); \
162 if (__ret != 0) \
163 break; \
164 } \
165 __ret; \
166})
167
168/* fn returns 0 to continue iteration */
169#define XT_ENTRY_ITERATE(type, entries, size, fn, args...) \
170 XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)
171
Harald Welte2e4e6a12006-01-12 13:30:04 -0800172#ifdef __KERNEL__
173
174#include <linux/netdevice.h>
175
Jan Engelhardtf7108a22008-10-08 11:35:18 +0200176/**
177 * struct xt_match_param - parameters for match extensions' match functions
178 *
179 * @in: input netdevice
180 * @out: output netdevice
181 * @match: struct xt_match through which this function was invoked
182 * @matchinfo: per-match data
183 * @fragoff: packet is a fragment, this is the data offset
184 * @thoff: position of transport header relative to skb->data
185 * @hotdrop: drop packet if we had inspection problems
Jan Engelhardt916a9172008-10-08 11:35:20 +0200186 * @family: Actual NFPROTO_* through which the function is invoked
187 * (helpful when match->family == NFPROTO_UNSPEC)
Jan Engelhardtf7108a22008-10-08 11:35:18 +0200188 */
189struct xt_match_param {
190 const struct net_device *in, *out;
191 const struct xt_match *match;
192 const void *matchinfo;
193 int fragoff;
194 unsigned int thoff;
195 bool *hotdrop;
Jan Engelhardt916a9172008-10-08 11:35:20 +0200196 u_int8_t family;
Jan Engelhardtf7108a22008-10-08 11:35:18 +0200197};
198
Jan Engelhardt9b4fce72008-10-08 11:35:18 +0200199/**
200 * struct xt_mtchk_param - parameters for match extensions'
201 * checkentry functions
202 *
203 * @table: table the rule is tried to be inserted into
204 * @entryinfo: the family-specific rule data
205 * (struct ipt_ip, ip6t_ip, ebt_entry)
206 * @match: struct xt_match through which this function was invoked
207 * @matchinfo: per-match data
208 * @hook_mask: via which hooks the new rule is reachable
209 */
210struct xt_mtchk_param {
211 const char *table;
212 const void *entryinfo;
213 const struct xt_match *match;
214 void *matchinfo;
215 unsigned int hook_mask;
Jan Engelhardt916a9172008-10-08 11:35:20 +0200216 u_int8_t family;
Jan Engelhardt9b4fce72008-10-08 11:35:18 +0200217};
218
Jan Engelhardt6be3d852008-10-08 11:35:19 +0200219/* Match destructor parameters */
220struct xt_mtdtor_param {
221 const struct xt_match *match;
222 void *matchinfo;
Jan Engelhardt916a9172008-10-08 11:35:20 +0200223 u_int8_t family;
Jan Engelhardt6be3d852008-10-08 11:35:19 +0200224};
225
Jan Engelhardt7eb35582008-10-08 11:35:19 +0200226/**
227 * struct xt_target_param - parameters for target extensions' target functions
228 *
229 * @hooknum: hook through which this target was invoked
230 * @target: struct xt_target through which this function was invoked
231 * @targinfo: per-target data
232 *
233 * Other fields see above.
234 */
235struct xt_target_param {
236 const struct net_device *in, *out;
237 unsigned int hooknum;
238 const struct xt_target *target;
239 const void *targinfo;
Jan Engelhardt916a9172008-10-08 11:35:20 +0200240 u_int8_t family;
Jan Engelhardt7eb35582008-10-08 11:35:19 +0200241};
242
Jan Engelhardtaf5d6dc2008-10-08 11:35:19 +0200243/**
244 * struct xt_tgchk_param - parameters for target extensions'
245 * checkentry functions
246 *
247 * @entryinfo: the family-specific rule data
248 * (struct ipt_entry, ip6t_entry, arpt_entry, ebt_entry)
249 *
250 * Other fields see above.
251 */
252struct xt_tgchk_param {
253 const char *table;
Jan Engelhardtf79fca52008-11-24 16:06:17 -0800254 const void *entryinfo;
Jan Engelhardtaf5d6dc2008-10-08 11:35:19 +0200255 const struct xt_target *target;
256 void *targinfo;
257 unsigned int hook_mask;
Jan Engelhardt916a9172008-10-08 11:35:20 +0200258 u_int8_t family;
Jan Engelhardtaf5d6dc2008-10-08 11:35:19 +0200259};
260
Jan Engelhardta2df1642008-10-08 11:35:19 +0200261/* Target destructor parameters */
262struct xt_tgdtor_param {
263 const struct xt_target *target;
264 void *targinfo;
Jan Engelhardt916a9172008-10-08 11:35:20 +0200265 u_int8_t family;
Jan Engelhardta2df1642008-10-08 11:35:19 +0200266};
267
Harald Welte2e4e6a12006-01-12 13:30:04 -0800268struct xt_match
269{
270 struct list_head list;
271
272 const char name[XT_FUNCTION_MAXNAMELEN-1];
Richard Kennedydaaf83d2009-01-12 00:06:11 +0000273 u_int8_t revision;
Harald Welte2e4e6a12006-01-12 13:30:04 -0800274
Harald Welte2e4e6a12006-01-12 13:30:04 -0800275 /* Return true or false: return FALSE and set *hotdrop = 1 to
276 force immediate packet drop. */
277 /* Arguments changed since 2.6.9, as this must now handle
278 non-linear skb, using skb_header_pointer and
279 skb_ip_make_writable. */
Jan Engelhardt1d93a9c2007-07-07 22:15:35 -0700280 bool (*match)(const struct sk_buff *skb,
Jan Engelhardtf7108a22008-10-08 11:35:18 +0200281 const struct xt_match_param *);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800282
283 /* Called when user tries to insert an entry of this type. */
Jan Engelhardt9b4fce72008-10-08 11:35:18 +0200284 bool (*checkentry)(const struct xt_mtchk_param *);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800285
286 /* Called when entry of this type deleted. */
Jan Engelhardt6be3d852008-10-08 11:35:19 +0200287 void (*destroy)(const struct xt_mtdtor_param *);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800288
Dmitry Mishin27229712006-04-01 02:25:19 -0800289 /* Called when userspace align differs from kernel space one */
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700290 void (*compat_from_user)(void *dst, void *src);
291 int (*compat_to_user)(void __user *dst, void *src);
Dmitry Mishin27229712006-04-01 02:25:19 -0800292
Harald Welte2e4e6a12006-01-12 13:30:04 -0800293 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
294 struct module *me;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800295
Patrick McHardy91270cf2006-08-22 00:43:38 -0700296 /* Free to use by each match */
297 unsigned long data;
298
Jan Engelhardtecb6f852008-01-31 03:54:47 -0800299 const char *table;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800300 unsigned int matchsize;
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700301 unsigned int compatsize;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800302 unsigned int hooks;
303 unsigned short proto;
Patrick McHardyc4b88512006-03-20 18:03:40 -0800304
305 unsigned short family;
Harald Welte2e4e6a12006-01-12 13:30:04 -0800306};
307
308/* Registration hooks for targets. */
309struct xt_target
310{
311 struct list_head list;
312
313 const char name[XT_FUNCTION_MAXNAMELEN-1];
314
Harald Welte2e4e6a12006-01-12 13:30:04 -0800315 /* 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. */
Herbert Xu3db05fe2007-10-15 00:53:15 -0700318 unsigned int (*target)(struct sk_buff *skb,
Jan Engelhardt7eb35582008-10-08 11:35:19 +0200319 const struct xt_target_param *);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800320
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. */
Jan Engelhardtaf5d6dc2008-10-08 11:35:19 +0200325 bool (*checkentry)(const struct xt_tgchk_param *);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800326
327 /* Called when entry of this type deleted. */
Jan Engelhardta2df1642008-10-08 11:35:19 +0200328 void (*destroy)(const struct xt_tgdtor_param *);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800329
Dmitry Mishin27229712006-04-01 02:25:19 -0800330 /* Called when userspace align differs from kernel space one */
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700331 void (*compat_from_user)(void *dst, void *src);
332 int (*compat_to_user)(void __user *dst, void *src);
Dmitry Mishin27229712006-04-01 02:25:19 -0800333
Harald Welte2e4e6a12006-01-12 13:30:04 -0800334 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
335 struct module *me;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800336
Jan Engelhardtecb6f852008-01-31 03:54:47 -0800337 const char *table;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800338 unsigned int targetsize;
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700339 unsigned int compatsize;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800340 unsigned int hooks;
341 unsigned short proto;
Patrick McHardyc4b88512006-03-20 18:03:40 -0800342
343 unsigned short family;
Patrick McHardy37f9f732006-03-20 17:59:06 -0800344 u_int8_t revision;
Harald Welte2e4e6a12006-01-12 13:30:04 -0800345};
346
347/* Furniture shopping... */
348struct xt_table
349{
350 struct list_head list;
351
Harald Welte2e4e6a12006-01-12 13:30:04 -0800352 /* What hooks you will enter on */
353 unsigned int valid_hooks;
354
355 /* Lock for the curtain */
Stephen Hemminger78454472009-02-20 10:35:32 +0100356 struct mutex lock;
Harald Welte2e4e6a12006-01-12 13:30:04 -0800357
358 /* Man behind the curtain... */
Stephen Hemminger4a2f9652009-02-18 16:29:44 +0100359 struct xt_table_info *private;
Harald Welte2e4e6a12006-01-12 13:30:04 -0800360
361 /* Set this to THIS_MODULE if you are a module, otherwise NULL */
362 struct module *me;
363
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200364 u_int8_t af; /* address/protocol family */
Stephen Hemminger4a2f9652009-02-18 16:29:44 +0100365
366 /* A unique name... */
367 const char name[XT_TABLE_MAXNAMELEN];
Harald Welte2e4e6a12006-01-12 13:30:04 -0800368};
369
370#include <linux/netfilter_ipv4.h>
371
372/* The table itself */
373struct xt_table_info
374{
375 /* Size per table */
376 unsigned int size;
377 /* Number of entries: FIXME. --RR */
378 unsigned int number;
379 /* Initial number of entries. Needed for module usage count */
380 unsigned int initial_entries;
381
382 /* Entry points and underflows */
Patrick McHardy6e23ae22007-11-19 18:53:30 -0800383 unsigned int hook_entry[NF_INET_NUMHOOKS];
384 unsigned int underflow[NF_INET_NUMHOOKS];
Harald Welte2e4e6a12006-01-12 13:30:04 -0800385
386 /* ipt_entry tables: one per CPU */
Eric Dumazet259d4e42007-12-04 23:24:56 -0800387 /* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */
Stephen Hemminger78454472009-02-20 10:35:32 +0100388 void *entries[1];
Harald Welte2e4e6a12006-01-12 13:30:04 -0800389};
390
Eric Dumazet259d4e42007-12-04 23:24:56 -0800391#define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
392 + nr_cpu_ids * sizeof(char *))
Pablo Neira Ayusoa45049c2006-03-22 13:55:40 -0800393extern int xt_register_target(struct xt_target *target);
394extern void xt_unregister_target(struct xt_target *target);
Patrick McHardy52d9c422006-08-22 00:33:45 -0700395extern int xt_register_targets(struct xt_target *target, unsigned int n);
396extern void xt_unregister_targets(struct xt_target *target, unsigned int n);
397
Pablo Neira Ayusoa45049c2006-03-22 13:55:40 -0800398extern int xt_register_match(struct xt_match *target);
399extern void xt_unregister_match(struct xt_match *target);
Patrick McHardy52d9c422006-08-22 00:33:45 -0700400extern int xt_register_matches(struct xt_match *match, unsigned int n);
401extern void xt_unregister_matches(struct xt_match *match, unsigned int n);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800402
Jan Engelhardt916a9172008-10-08 11:35:20 +0200403extern int xt_check_match(struct xt_mtchk_param *,
Jan Engelhardt9b4fce72008-10-08 11:35:18 +0200404 unsigned int size, u_int8_t proto, bool inv_proto);
Jan Engelhardt916a9172008-10-08 11:35:20 +0200405extern int xt_check_target(struct xt_tgchk_param *,
Jan Engelhardtaf5d6dc2008-10-08 11:35:19 +0200406 unsigned int size, u_int8_t proto, bool inv_proto);
Patrick McHardy37f9f732006-03-20 17:59:06 -0800407
Alexey Dobriyan8d870052008-01-31 04:02:13 -0800408extern struct xt_table *xt_register_table(struct net *net,
409 struct xt_table *table,
Alexey Dobriyana98da112008-01-31 04:01:49 -0800410 struct xt_table_info *bootstrap,
411 struct xt_table_info *newinfo);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800412extern void *xt_unregister_table(struct xt_table *table);
413
414extern struct xt_table_info *xt_replace_table(struct xt_table *table,
415 unsigned int num_counters,
416 struct xt_table_info *newinfo,
417 int *error);
418
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200419extern struct xt_match *xt_find_match(u8 af, const char *name, u8 revision);
420extern struct xt_target *xt_find_target(u8 af, const char *name, u8 revision);
421extern struct xt_target *xt_request_find_target(u8 af, const char *name,
Harald Welte2e4e6a12006-01-12 13:30:04 -0800422 u8 revision);
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200423extern int xt_find_revision(u8 af, const char *name, u8 revision,
424 int target, int *err);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800425
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200426extern struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
Alexey Dobriyan8d870052008-01-31 04:02:13 -0800427 const char *name);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800428extern void xt_table_unlock(struct xt_table *t);
429
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200430extern int xt_proto_init(struct net *net, u_int8_t af);
431extern void xt_proto_fini(struct net *net, u_int8_t af);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800432
433extern struct xt_table_info *xt_alloc_table_info(unsigned int size);
434extern void xt_free_table_info(struct xt_table_info *info);
Stephen Hemminger78454472009-02-20 10:35:32 +0100435extern void xt_table_entry_swap_rcu(struct xt_table_info *old,
436 struct xt_table_info *new);
Harald Welte2e4e6a12006-01-12 13:30:04 -0800437
Eric Dumazetb8dfe492009-03-25 17:31:52 +0100438/*
439 * This helper is performance critical and must be inlined
440 */
441static inline unsigned long ifname_compare_aligned(const char *_a,
442 const char *_b,
443 const char *_mask)
444{
445 const unsigned long *a = (const unsigned long *)_a;
446 const unsigned long *b = (const unsigned long *)_b;
447 const unsigned long *mask = (const unsigned long *)_mask;
448 unsigned long ret;
449
450 ret = (a[0] ^ b[0]) & mask[0];
451 if (IFNAMSIZ > sizeof(unsigned long))
452 ret |= (a[1] ^ b[1]) & mask[1];
453 if (IFNAMSIZ > 2 * sizeof(unsigned long))
454 ret |= (a[2] ^ b[2]) & mask[2];
455 if (IFNAMSIZ > 3 * sizeof(unsigned long))
456 ret |= (a[3] ^ b[3]) & mask[3];
457 BUILD_BUG_ON(IFNAMSIZ > 4 * sizeof(unsigned long));
458 return ret;
459}
460
Dmitry Mishin27229712006-04-01 02:25:19 -0800461#ifdef CONFIG_COMPAT
462#include <net/compat.h>
463
464struct compat_xt_entry_match
465{
466 union {
467 struct {
468 u_int16_t match_size;
469 char name[XT_FUNCTION_MAXNAMELEN - 1];
470 u_int8_t revision;
471 } user;
Patrick McHardy46c5ea3c2006-05-02 05:12:22 +0200472 struct {
473 u_int16_t match_size;
474 compat_uptr_t match;
475 } kernel;
Dmitry Mishin27229712006-04-01 02:25:19 -0800476 u_int16_t match_size;
477 } u;
478 unsigned char data[0];
479};
480
481struct compat_xt_entry_target
482{
483 union {
484 struct {
485 u_int16_t target_size;
486 char name[XT_FUNCTION_MAXNAMELEN - 1];
487 u_int8_t revision;
488 } user;
Patrick McHardy46c5ea3c2006-05-02 05:12:22 +0200489 struct {
490 u_int16_t target_size;
491 compat_uptr_t target;
492 } kernel;
Dmitry Mishin27229712006-04-01 02:25:19 -0800493 u_int16_t target_size;
494 } u;
495 unsigned char data[0];
496};
497
498/* FIXME: this works only on 32 bit tasks
499 * need to change whole approach in order to calculate align as function of
500 * current task alignment */
501
502struct compat_xt_counters
503{
Patrick McHardy55fe5862006-04-24 17:16:28 -0700504#if defined(CONFIG_X86_64) || defined(CONFIG_IA64)
Dmitry Mishin27229712006-04-01 02:25:19 -0800505 u_int32_t cnt[4];
Patrick McHardy55fe5862006-04-24 17:16:28 -0700506#else
507 u_int64_t cnt[2];
508#endif
Dmitry Mishin27229712006-04-01 02:25:19 -0800509};
510
511struct compat_xt_counters_info
512{
513 char name[XT_TABLE_MAXNAMELEN];
514 compat_uint_t num_counters;
515 struct compat_xt_counters counters[0];
516};
517
518#define COMPAT_XT_ALIGN(s) (((s) + (__alignof__(struct compat_xt_counters)-1)) \
519 & ~(__alignof__(struct compat_xt_counters)-1))
520
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200521extern void xt_compat_lock(u_int8_t af);
522extern void xt_compat_unlock(u_int8_t af);
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700523
Jan Engelhardt76108ce2008-10-08 11:35:00 +0200524extern int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta);
525extern void xt_compat_flush_offsets(u_int8_t af);
526extern short xt_compat_calc_jump(u_int8_t af, unsigned int offset);
Patrick McHardyb386d9f2007-12-17 21:47:48 -0800527
Jan Engelhardt5452e422008-04-14 11:15:35 +0200528extern int xt_compat_match_offset(const struct xt_match *match);
Patrick McHardy89566952007-12-17 21:46:40 -0800529extern int xt_compat_match_from_user(struct xt_entry_match *m,
Patrick McHardyb0a63632008-01-31 04:10:18 -0800530 void **dstptr, unsigned int *size);
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700531extern int xt_compat_match_to_user(struct xt_entry_match *m,
Patrick McHardyb0a63632008-01-31 04:10:18 -0800532 void __user **dstptr, unsigned int *size);
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700533
Jan Engelhardt5452e422008-04-14 11:15:35 +0200534extern int xt_compat_target_offset(const struct xt_target *target);
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700535extern void xt_compat_target_from_user(struct xt_entry_target *t,
Patrick McHardyb0a63632008-01-31 04:10:18 -0800536 void **dstptr, unsigned int *size);
Patrick McHardy9fa492c2006-09-20 12:05:37 -0700537extern int xt_compat_target_to_user(struct xt_entry_target *t,
Patrick McHardyb0a63632008-01-31 04:10:18 -0800538 void __user **dstptr, unsigned int *size);
Dmitry Mishin27229712006-04-01 02:25:19 -0800539
540#endif /* CONFIG_COMPAT */
Harald Welte2e4e6a12006-01-12 13:30:04 -0800541#endif /* __KERNEL__ */
542
543#endif /* _X_TABLES_H */