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