]>
Commit | Line | Data |
---|---|---|
2e4e6a17 HW |
1 | #ifndef _X_TABLES_H |
2 | #define _X_TABLES_H | |
3 | ||
4 | #define XT_FUNCTION_MAXNAMELEN 30 | |
5 | #define XT_TABLE_MAXNAMELEN 32 | |
6 | ||
1e30a014 DM |
7 | struct 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 | ||
32 | struct 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 | ||
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 | ||
1e30a014 DM |
65 | struct xt_standard_target |
66 | { | |
67 | struct xt_entry_target target; | |
68 | int verdict; | |
69 | }; | |
70 | ||
2e4e6a17 HW |
71 | /* The argument to IPT_SO_GET_REVISION_*. Returns highest revision |
72 | * kernel supports, if >= revision. */ | |
73 | struct 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 | ||
6fbfc968 DM |
86 | /* 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 | */ | |
91 | struct _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)) | |
2e4e6a17 HW |
101 | |
102 | /* Standard return verdict, or do jump. */ | |
103 | #define XT_STANDARD_TARGET "" | |
104 | /* Error verdict. */ | |
105 | #define XT_ERROR_TARGET "ERROR" | |
106 | ||
2e4e6a17 HW |
107 | #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 | ||
110 | struct xt_counters | |
111 | { | |
112 | u_int64_t pcnt, bcnt; /* Packet and byte counters */ | |
113 | }; | |
114 | ||
115 | /* The argument to IPT_SO_ADD_COUNTERS. */ | |
116 | struct 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 | ||
89c002d6 PM |
129 | /* 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 | ||
2e4e6a17 HW |
172 | #ifdef __KERNEL__ |
173 | ||
174 | #include <linux/netdevice.h> | |
175 | ||
2e4e6a17 HW |
176 | struct xt_match |
177 | { | |
178 | struct list_head list; | |
179 | ||
180 | const char name[XT_FUNCTION_MAXNAMELEN-1]; | |
181 | ||
2e4e6a17 HW |
182 | /* Return true or false: return FALSE and set *hotdrop = 1 to |
183 | force immediate packet drop. */ | |
184 | /* Arguments changed since 2.6.9, as this must now handle | |
185 | non-linear skb, using skb_header_pointer and | |
186 | skb_ip_make_writable. */ | |
1d93a9cb JE |
187 | bool (*match)(const struct sk_buff *skb, |
188 | const struct net_device *in, | |
189 | const struct net_device *out, | |
190 | const struct xt_match *match, | |
191 | const void *matchinfo, | |
192 | int offset, | |
193 | unsigned int protoff, | |
194 | bool *hotdrop); | |
2e4e6a17 HW |
195 | |
196 | /* Called when user tries to insert an entry of this type. */ | |
197 | /* Should return true or false. */ | |
ccb79bdc JE |
198 | bool (*checkentry)(const char *tablename, |
199 | const void *ip, | |
200 | const struct xt_match *match, | |
201 | void *matchinfo, | |
202 | unsigned int hook_mask); | |
2e4e6a17 HW |
203 | |
204 | /* Called when entry of this type deleted. */ | |
efa74165 | 205 | void (*destroy)(const struct xt_match *match, void *matchinfo); |
2e4e6a17 | 206 | |
2722971c | 207 | /* Called when userspace align differs from kernel space one */ |
9fa492cd PM |
208 | void (*compat_from_user)(void *dst, void *src); |
209 | int (*compat_to_user)(void __user *dst, void *src); | |
2722971c | 210 | |
2e4e6a17 HW |
211 | /* Set this to THIS_MODULE if you are a module, otherwise NULL */ |
212 | struct module *me; | |
37f9f733 | 213 | |
91270cf8 PM |
214 | /* Free to use by each match */ |
215 | unsigned long data; | |
216 | ||
37f9f733 PM |
217 | char *table; |
218 | unsigned int matchsize; | |
9fa492cd | 219 | unsigned int compatsize; |
37f9f733 PM |
220 | unsigned int hooks; |
221 | unsigned short proto; | |
c4b88513 PM |
222 | |
223 | unsigned short family; | |
37f9f733 | 224 | u_int8_t revision; |
2e4e6a17 HW |
225 | }; |
226 | ||
227 | /* Registration hooks for targets. */ | |
228 | struct xt_target | |
229 | { | |
230 | struct list_head list; | |
231 | ||
232 | const char name[XT_FUNCTION_MAXNAMELEN-1]; | |
233 | ||
2e4e6a17 HW |
234 | /* Returns verdict. Argument order changed since 2.6.9, as this |
235 | must now handle non-linear skbs, using skb_copy_bits and | |
236 | skb_ip_make_writable. */ | |
3db05fea | 237 | unsigned int (*target)(struct sk_buff *skb, |
2e4e6a17 HW |
238 | const struct net_device *in, |
239 | const struct net_device *out, | |
240 | unsigned int hooknum, | |
1c524830 | 241 | const struct xt_target *target, |
fe1cb108 | 242 | const void *targinfo); |
2e4e6a17 HW |
243 | |
244 | /* Called when user tries to insert an entry of this type: | |
245 | hook_mask is a bitmask of hooks from which it can be | |
246 | called. */ | |
247 | /* Should return true or false. */ | |
e1931b78 JE |
248 | bool (*checkentry)(const char *tablename, |
249 | const void *entry, | |
250 | const struct xt_target *target, | |
251 | void *targinfo, | |
252 | unsigned int hook_mask); | |
2e4e6a17 HW |
253 | |
254 | /* Called when entry of this type deleted. */ | |
efa74165 | 255 | void (*destroy)(const struct xt_target *target, void *targinfo); |
2e4e6a17 | 256 | |
2722971c | 257 | /* Called when userspace align differs from kernel space one */ |
9fa492cd PM |
258 | void (*compat_from_user)(void *dst, void *src); |
259 | int (*compat_to_user)(void __user *dst, void *src); | |
2722971c | 260 | |
2e4e6a17 HW |
261 | /* Set this to THIS_MODULE if you are a module, otherwise NULL */ |
262 | struct module *me; | |
37f9f733 PM |
263 | |
264 | char *table; | |
265 | unsigned int targetsize; | |
9fa492cd | 266 | unsigned int compatsize; |
37f9f733 PM |
267 | unsigned int hooks; |
268 | unsigned short proto; | |
c4b88513 PM |
269 | |
270 | unsigned short family; | |
37f9f733 | 271 | u_int8_t revision; |
2e4e6a17 HW |
272 | }; |
273 | ||
274 | /* Furniture shopping... */ | |
275 | struct xt_table | |
276 | { | |
277 | struct list_head list; | |
278 | ||
279 | /* A unique name... */ | |
280 | char name[XT_TABLE_MAXNAMELEN]; | |
281 | ||
282 | /* What hooks you will enter on */ | |
283 | unsigned int valid_hooks; | |
284 | ||
285 | /* Lock for the curtain */ | |
286 | rwlock_t lock; | |
287 | ||
288 | /* Man behind the curtain... */ | |
289 | //struct ip6t_table_info *private; | |
290 | void *private; | |
291 | ||
292 | /* Set this to THIS_MODULE if you are a module, otherwise NULL */ | |
293 | struct module *me; | |
294 | ||
295 | int af; /* address/protocol family */ | |
296 | }; | |
297 | ||
298 | #include <linux/netfilter_ipv4.h> | |
299 | ||
300 | /* The table itself */ | |
301 | struct xt_table_info | |
302 | { | |
303 | /* Size per table */ | |
304 | unsigned int size; | |
305 | /* Number of entries: FIXME. --RR */ | |
306 | unsigned int number; | |
307 | /* Initial number of entries. Needed for module usage count */ | |
308 | unsigned int initial_entries; | |
309 | ||
310 | /* Entry points and underflows */ | |
6e23ae2a PM |
311 | unsigned int hook_entry[NF_INET_NUMHOOKS]; |
312 | unsigned int underflow[NF_INET_NUMHOOKS]; | |
2e4e6a17 HW |
313 | |
314 | /* ipt_entry tables: one per CPU */ | |
259d4e41 ED |
315 | /* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */ |
316 | char *entries[1]; | |
2e4e6a17 HW |
317 | }; |
318 | ||
259d4e41 ED |
319 | #define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \ |
320 | + nr_cpu_ids * sizeof(char *)) | |
a45049c5 PNA |
321 | extern int xt_register_target(struct xt_target *target); |
322 | extern void xt_unregister_target(struct xt_target *target); | |
52d9c42e PM |
323 | extern int xt_register_targets(struct xt_target *target, unsigned int n); |
324 | extern void xt_unregister_targets(struct xt_target *target, unsigned int n); | |
325 | ||
a45049c5 PNA |
326 | extern int xt_register_match(struct xt_match *target); |
327 | extern void xt_unregister_match(struct xt_match *target); | |
52d9c42e PM |
328 | extern int xt_register_matches(struct xt_match *match, unsigned int n); |
329 | extern void xt_unregister_matches(struct xt_match *match, unsigned int n); | |
2e4e6a17 | 330 | |
37f9f733 PM |
331 | extern int xt_check_match(const struct xt_match *match, unsigned short family, |
332 | unsigned int size, const char *table, unsigned int hook, | |
333 | unsigned short proto, int inv_proto); | |
334 | extern int xt_check_target(const struct xt_target *target, unsigned short family, | |
335 | unsigned int size, const char *table, unsigned int hook, | |
336 | unsigned short proto, int inv_proto); | |
337 | ||
2e4e6a17 HW |
338 | extern int xt_register_table(struct xt_table *table, |
339 | struct xt_table_info *bootstrap, | |
340 | struct xt_table_info *newinfo); | |
341 | extern void *xt_unregister_table(struct xt_table *table); | |
342 | ||
343 | extern struct xt_table_info *xt_replace_table(struct xt_table *table, | |
344 | unsigned int num_counters, | |
345 | struct xt_table_info *newinfo, | |
346 | int *error); | |
347 | ||
348 | extern struct xt_match *xt_find_match(int af, const char *name, u8 revision); | |
349 | extern struct xt_target *xt_find_target(int af, const char *name, u8 revision); | |
350 | extern struct xt_target *xt_request_find_target(int af, const char *name, | |
351 | u8 revision); | |
352 | extern int xt_find_revision(int af, const char *name, u8 revision, int target, | |
353 | int *err); | |
354 | ||
355 | extern struct xt_table *xt_find_table_lock(int af, const char *name); | |
356 | extern void xt_table_unlock(struct xt_table *t); | |
357 | ||
358 | extern int xt_proto_init(int af); | |
359 | extern void xt_proto_fini(int af); | |
360 | ||
361 | extern struct xt_table_info *xt_alloc_table_info(unsigned int size); | |
362 | extern void xt_free_table_info(struct xt_table_info *info); | |
363 | ||
2722971c DM |
364 | #ifdef CONFIG_COMPAT |
365 | #include <net/compat.h> | |
366 | ||
367 | struct compat_xt_entry_match | |
368 | { | |
369 | union { | |
370 | struct { | |
371 | u_int16_t match_size; | |
372 | char name[XT_FUNCTION_MAXNAMELEN - 1]; | |
373 | u_int8_t revision; | |
374 | } user; | |
46c5ea3c PM |
375 | struct { |
376 | u_int16_t match_size; | |
377 | compat_uptr_t match; | |
378 | } kernel; | |
2722971c DM |
379 | u_int16_t match_size; |
380 | } u; | |
381 | unsigned char data[0]; | |
382 | }; | |
383 | ||
384 | struct compat_xt_entry_target | |
385 | { | |
386 | union { | |
387 | struct { | |
388 | u_int16_t target_size; | |
389 | char name[XT_FUNCTION_MAXNAMELEN - 1]; | |
390 | u_int8_t revision; | |
391 | } user; | |
46c5ea3c PM |
392 | struct { |
393 | u_int16_t target_size; | |
394 | compat_uptr_t target; | |
395 | } kernel; | |
2722971c DM |
396 | u_int16_t target_size; |
397 | } u; | |
398 | unsigned char data[0]; | |
399 | }; | |
400 | ||
401 | /* FIXME: this works only on 32 bit tasks | |
402 | * need to change whole approach in order to calculate align as function of | |
403 | * current task alignment */ | |
404 | ||
405 | struct compat_xt_counters | |
406 | { | |
55fe5866 | 407 | #if defined(CONFIG_X86_64) || defined(CONFIG_IA64) |
2722971c | 408 | u_int32_t cnt[4]; |
55fe5866 PM |
409 | #else |
410 | u_int64_t cnt[2]; | |
411 | #endif | |
2722971c DM |
412 | }; |
413 | ||
414 | struct compat_xt_counters_info | |
415 | { | |
416 | char name[XT_TABLE_MAXNAMELEN]; | |
417 | compat_uint_t num_counters; | |
418 | struct compat_xt_counters counters[0]; | |
419 | }; | |
420 | ||
421 | #define COMPAT_XT_ALIGN(s) (((s) + (__alignof__(struct compat_xt_counters)-1)) \ | |
422 | & ~(__alignof__(struct compat_xt_counters)-1)) | |
423 | ||
424 | extern void xt_compat_lock(int af); | |
425 | extern void xt_compat_unlock(int af); | |
9fa492cd | 426 | |
b386d9f5 PM |
427 | extern int xt_compat_add_offset(int af, unsigned int offset, short delta); |
428 | extern void xt_compat_flush_offsets(int af); | |
429 | extern short xt_compat_calc_jump(int af, unsigned int offset); | |
430 | ||
9fa492cd | 431 | extern int xt_compat_match_offset(struct xt_match *match); |
89566951 PM |
432 | extern int xt_compat_match_from_user(struct xt_entry_match *m, |
433 | void **dstptr, int *size); | |
9fa492cd | 434 | extern int xt_compat_match_to_user(struct xt_entry_match *m, |
3e597c60 | 435 | void __user **dstptr, int *size); |
9fa492cd PM |
436 | |
437 | extern int xt_compat_target_offset(struct xt_target *target); | |
438 | extern void xt_compat_target_from_user(struct xt_entry_target *t, | |
439 | void **dstptr, int *size); | |
440 | extern int xt_compat_target_to_user(struct xt_entry_target *t, | |
3e597c60 | 441 | void __user **dstptr, int *size); |
2722971c DM |
442 | |
443 | #endif /* CONFIG_COMPAT */ | |
2e4e6a17 HW |
444 | #endif /* __KERNEL__ */ |
445 | ||
446 | #endif /* _X_TABLES_H */ |