x_tables.h 12.2 KB
Newer Older
1 2
#ifndef _X_TABLES_H
#define _X_TABLES_H
3

4 5

#include <linux/netdevice.h>
6
#include <uapi/linux/netfilter/x_tables.h>
7

8
/**
9
 * struct xt_action_param - parameters for matches/targets
10
 *
11 12 13 14
 * @match:	the match extension
 * @target:	the target extension
 * @matchinfo:	per-match data
 * @targetinfo:	per-target data
15 16 17 18
 * @in:		input netdevice
 * @out:	output netdevice
 * @fragoff:	packet is a fragment, this is the data offset
 * @thoff:	position of transport header relative to skb->data
19
 * @hook:	hook number given packet came from
20 21
 * @family:	Actual NFPROTO_* through which the function is invoked
 * 		(helpful when match->family == NFPROTO_UNSPEC)
22 23 24
 *
 * Fields written to by extensions:
 *
25
 * @hotdrop:	drop packet if we had inspection problems
26
 * Network namespace obtainable using dev_net(in/out)
27
 */
28 29 30 31 32 33 34 35
struct xt_action_param {
	union {
		const struct xt_match *match;
		const struct xt_target *target;
	};
	union {
		const void *matchinfo, *targinfo;
	};
36 37 38
	const struct net_device *in, *out;
	int fragoff;
	unsigned int thoff;
39
	unsigned int hooknum;
40
	u_int8_t family;
41
	bool hotdrop;
42 43
};

44 45 46 47
/**
 * struct xt_mtchk_param - parameters for match extensions'
 * checkentry functions
 *
48
 * @net:	network namespace through which the check was invoked
49 50
 * @table:	table the rule is tried to be inserted into
 * @entryinfo:	the family-specific rule data
51
 * 		(struct ipt_ip, ip6t_ip, arpt_arp or (note) ebt_entry)
52 53 54
 * @match:	struct xt_match through which this function was invoked
 * @matchinfo:	per-match data
 * @hook_mask:	via which hooks the new rule is reachable
55
 * Other fields as above.
56 57
 */
struct xt_mtchk_param {
58
	struct net *net;
59 60 61 62 63
	const char *table;
	const void *entryinfo;
	const struct xt_match *match;
	void *matchinfo;
	unsigned int hook_mask;
64
	u_int8_t family;
65 66
};

67 68 69 70
/**
 * struct xt_mdtor_param - match destructor parameters
 * Fields as above.
 */
71
struct xt_mtdtor_param {
72
	struct net *net;
73 74
	const struct xt_match *match;
	void *matchinfo;
75
	u_int8_t family;
76 77
};

78 79 80 81 82 83 84 85 86 87
/**
 * struct xt_tgchk_param - parameters for target extensions'
 * checkentry functions
 *
 * @entryinfo:	the family-specific rule data
 * 		(struct ipt_entry, ip6t_entry, arpt_entry, ebt_entry)
 *
 * Other fields see above.
 */
struct xt_tgchk_param {
88
	struct net *net;
89
	const char *table;
90
	const void *entryinfo;
91 92 93
	const struct xt_target *target;
	void *targinfo;
	unsigned int hook_mask;
94
	u_int8_t family;
95 96
};

97 98
/* Target destructor parameters */
struct xt_tgdtor_param {
99
	struct net *net;
100 101
	const struct xt_target *target;
	void *targinfo;
102
	u_int8_t family;
103 104
};

E
Eric Dumazet 已提交
105
struct xt_match {
106 107
	struct list_head list;

108
	const char name[XT_EXTENSION_MAXNAMELEN];
109
	u_int8_t revision;
110 111 112 113 114 115

	/* Return true or false: return FALSE and set *hotdrop = 1 to
           force immediate packet drop. */
	/* Arguments changed since 2.6.9, as this must now handle
	   non-linear skb, using skb_header_pointer and
	   skb_ip_make_writable. */
116
	bool (*match)(const struct sk_buff *skb,
117
		      struct xt_action_param *);
118 119

	/* Called when user tries to insert an entry of this type. */
120
	int (*checkentry)(const struct xt_mtchk_param *);
121 122

	/* Called when entry of this type deleted. */
123
	void (*destroy)(const struct xt_mtdtor_param *);
124
#ifdef CONFIG_COMPAT
125
	/* Called when userspace align differs from kernel space one */
126 127
	void (*compat_from_user)(void *dst, const void *src);
	int (*compat_to_user)(void __user *dst, const void *src);
128
#endif
129 130
	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
	struct module *me;
131

132
	const char *table;
133
	unsigned int matchsize;
134
#ifdef CONFIG_COMPAT
135
	unsigned int compatsize;
136
#endif
137 138
	unsigned int hooks;
	unsigned short proto;
139 140

	unsigned short family;
141 142 143
};

/* Registration hooks for targets. */
E
Eric Dumazet 已提交
144
struct xt_target {
145 146
	struct list_head list;

147
	const char name[XT_EXTENSION_MAXNAMELEN];
148
	u_int8_t revision;
149 150 151 152

	/* Returns verdict. Argument order changed since 2.6.9, as this
	   must now handle non-linear skbs, using skb_copy_bits and
	   skb_ip_make_writable. */
153
	unsigned int (*target)(struct sk_buff *skb,
154
			       const struct xt_action_param *);
155 156 157 158

	/* Called when user tries to insert an entry of this type:
           hook_mask is a bitmask of hooks from which it can be
           called. */
159
	/* Should return 0 on success or an error code otherwise (-Exxxx). */
160
	int (*checkentry)(const struct xt_tgchk_param *);
161 162

	/* Called when entry of this type deleted. */
163
	void (*destroy)(const struct xt_tgdtor_param *);
164
#ifdef CONFIG_COMPAT
165
	/* Called when userspace align differs from kernel space one */
166 167
	void (*compat_from_user)(void *dst, const void *src);
	int (*compat_to_user)(void __user *dst, const void *src);
168
#endif
169 170
	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
	struct module *me;
171

172
	const char *table;
173
	unsigned int targetsize;
174
#ifdef CONFIG_COMPAT
175
	unsigned int compatsize;
176
#endif
177 178
	unsigned int hooks;
	unsigned short proto;
179 180

	unsigned short family;
181 182 183
};

/* Furniture shopping... */
E
Eric Dumazet 已提交
184
struct xt_table {
185 186 187 188 189 190
	struct list_head list;

	/* What hooks you will enter on */
	unsigned int valid_hooks;

	/* Man behind the curtain... */
191
	struct xt_table_info *private;
192 193 194 195

	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
	struct module *me;

196
	u_int8_t af;		/* address/protocol family */
197
	int priority;		/* hook order */
198 199 200

	/* A unique name... */
	const char name[XT_TABLE_MAXNAMELEN];
201 202 203 204 205
};

#include <linux/netfilter_ipv4.h>

/* The table itself */
E
Eric Dumazet 已提交
206
struct xt_table_info {
207 208 209 210 211 212 213 214
	/* Size per table */
	unsigned int size;
	/* Number of entries: FIXME. --RR */
	unsigned int number;
	/* Initial number of entries. Needed for module usage count */
	unsigned int initial_entries;

	/* Entry points and underflows */
215 216
	unsigned int hook_entry[NF_INET_NUMHOOKS];
	unsigned int underflow[NF_INET_NUMHOOKS];
217

218 219 220 221 222
	/*
	 * Number of user chains. Since tables cannot have loops, at most
	 * @stacksize jumps (number of user chains) can possibly be made.
	 */
	unsigned int stacksize;
223
	unsigned int __percpu *stackptr;
224
	void ***jumpstack;
225
	/* ipt_entry tables: one per CPU */
226
	/* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */
227
	void *entries[1];
228 229
};

230 231
#define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
			  + nr_cpu_ids * sizeof(char *))
232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273
int xt_register_target(struct xt_target *target);
void xt_unregister_target(struct xt_target *target);
int xt_register_targets(struct xt_target *target, unsigned int n);
void xt_unregister_targets(struct xt_target *target, unsigned int n);

int xt_register_match(struct xt_match *target);
void xt_unregister_match(struct xt_match *target);
int xt_register_matches(struct xt_match *match, unsigned int n);
void xt_unregister_matches(struct xt_match *match, unsigned int n);

int xt_check_match(struct xt_mtchk_param *, unsigned int size, u_int8_t proto,
		   bool inv_proto);
int xt_check_target(struct xt_tgchk_param *, unsigned int size, u_int8_t proto,
		    bool inv_proto);

struct xt_table *xt_register_table(struct net *net,
				   const struct xt_table *table,
				   struct xt_table_info *bootstrap,
				   struct xt_table_info *newinfo);
void *xt_unregister_table(struct xt_table *table);

struct xt_table_info *xt_replace_table(struct xt_table *table,
				       unsigned int num_counters,
				       struct xt_table_info *newinfo,
				       int *error);

struct xt_match *xt_find_match(u8 af, const char *name, u8 revision);
struct xt_target *xt_find_target(u8 af, const char *name, u8 revision);
struct xt_match *xt_request_find_match(u8 af, const char *name, u8 revision);
struct xt_target *xt_request_find_target(u8 af, const char *name, u8 revision);
int xt_find_revision(u8 af, const char *name, u8 revision, int target,
		     int *err);

struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
				    const char *name);
void xt_table_unlock(struct xt_table *t);

int xt_proto_init(struct net *net, u_int8_t af);
void xt_proto_fini(struct net *net, u_int8_t af);

struct xt_table_info *xt_alloc_table_info(unsigned int size);
void xt_free_table_info(struct xt_table_info *info);
274

275 276 277 278 279 280 281
/**
 * xt_recseq - recursive seqcount for netfilter use
 * 
 * Packet processing changes the seqcount only if no recursion happened
 * get_counters() can use read_seqcount_begin()/read_seqcount_retry(),
 * because we use the normal seqcount convention :
 * Low order bit set to 1 if a writer is active.
282
 */
283
DECLARE_PER_CPU(seqcount_t, xt_recseq);
284

285 286
/**
 * xt_write_recseq_begin - start of a write section
287
 *
288 289
 * Begin packet processing : all readers must wait the end
 * 1) Must be called with preemption disabled
290
 * 2) softirqs must be disabled too (or we should use this_cpu_add())
291 292 293
 * Returns :
 *  1 if no recursion on this cpu
 *  0 if recursion detected
294
 */
295
static inline unsigned int xt_write_recseq_begin(void)
296
{
297
	unsigned int addend;
298

299 300 301 302 303
	/*
	 * Low order bit of sequence is set if we already
	 * called xt_write_recseq_begin().
	 */
	addend = (__this_cpu_read(xt_recseq.sequence) + 1) & 1;
304

305 306 307 308 309 310 311
	/*
	 * This is kind of a write_seqcount_begin(), but addend is 0 or 1
	 * We dont check addend value to avoid a test and conditional jump,
	 * since addend is most likely 1
	 */
	__this_cpu_add(xt_recseq.sequence, addend);
	smp_wmb();
312

313
	return addend;
314 315
}

316 317 318 319 320 321
/**
 * xt_write_recseq_end - end of a write section
 * @addend: return value from previous xt_write_recseq_begin()
 *
 * End packet processing : all readers can proceed
 * 1) Must be called with preemption disabled
322
 * 2) softirqs must be disabled too (or we should use this_cpu_add())
323
 */
324
static inline void xt_write_recseq_end(unsigned int addend)
325
{
326 327 328
	/* this is kind of a write_seqcount_end(), but addend is 0 or 1 */
	smp_wmb();
	__this_cpu_add(xt_recseq.sequence, addend);
329
}
330

331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353
/*
 * This helper is performance critical and must be inlined
 */
static inline unsigned long ifname_compare_aligned(const char *_a,
						   const char *_b,
						   const char *_mask)
{
	const unsigned long *a = (const unsigned long *)_a;
	const unsigned long *b = (const unsigned long *)_b;
	const unsigned long *mask = (const unsigned long *)_mask;
	unsigned long ret;

	ret = (a[0] ^ b[0]) & mask[0];
	if (IFNAMSIZ > sizeof(unsigned long))
		ret |= (a[1] ^ b[1]) & mask[1];
	if (IFNAMSIZ > 2 * sizeof(unsigned long))
		ret |= (a[2] ^ b[2]) & mask[2];
	if (IFNAMSIZ > 3 * sizeof(unsigned long))
		ret |= (a[3] ^ b[3]) & mask[3];
	BUILD_BUG_ON(IFNAMSIZ > 4 * sizeof(unsigned long));
	return ret;
}

354 355
struct nf_hook_ops *xt_hook_link(const struct xt_table *, nf_hookfn *);
void xt_hook_unlink(const struct xt_table *, struct nf_hook_ops *);
356

357 358 359
#ifdef CONFIG_COMPAT
#include <net/compat.h>

E
Eric Dumazet 已提交
360
struct compat_xt_entry_match {
361 362 363 364 365 366
	union {
		struct {
			u_int16_t match_size;
			char name[XT_FUNCTION_MAXNAMELEN - 1];
			u_int8_t revision;
		} user;
367 368 369 370
		struct {
			u_int16_t match_size;
			compat_uptr_t match;
		} kernel;
371 372 373 374 375
		u_int16_t match_size;
	} u;
	unsigned char data[0];
};

E
Eric Dumazet 已提交
376
struct compat_xt_entry_target {
377 378 379 380 381 382
	union {
		struct {
			u_int16_t target_size;
			char name[XT_FUNCTION_MAXNAMELEN - 1];
			u_int8_t revision;
		} user;
383 384 385 386
		struct {
			u_int16_t target_size;
			compat_uptr_t target;
		} kernel;
387 388 389 390 391 392 393 394 395
		u_int16_t target_size;
	} u;
	unsigned char data[0];
};

/* FIXME: this works only on 32 bit tasks
 * need to change whole approach in order to calculate align as function of
 * current task alignment */

E
Eric Dumazet 已提交
396
struct compat_xt_counters {
397
	compat_u64 pcnt, bcnt;			/* Packet and byte counters */
398 399
};

E
Eric Dumazet 已提交
400
struct compat_xt_counters_info {
401 402 403 404 405
	char name[XT_TABLE_MAXNAMELEN];
	compat_uint_t num_counters;
	struct compat_xt_counters counters[0];
};

406 407 408 409 410 411 412
struct _compat_xt_align {
	__u8 u8;
	__u16 u16;
	__u32 u32;
	compat_u64 u64;
};

413
#define COMPAT_XT_ALIGN(s) __ALIGN_KERNEL((s), __alignof__(struct _compat_xt_align))
414

415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433
void xt_compat_lock(u_int8_t af);
void xt_compat_unlock(u_int8_t af);

int xt_compat_add_offset(u_int8_t af, unsigned int offset, int delta);
void xt_compat_flush_offsets(u_int8_t af);
void xt_compat_init_offsets(u_int8_t af, unsigned int number);
int xt_compat_calc_jump(u_int8_t af, unsigned int offset);

int xt_compat_match_offset(const struct xt_match *match);
int xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
			      unsigned int *size);
int xt_compat_match_to_user(const struct xt_entry_match *m,
			    void __user **dstptr, unsigned int *size);

int xt_compat_target_offset(const struct xt_target *target);
void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
				unsigned int *size);
int xt_compat_target_to_user(const struct xt_entry_target *t,
			     void __user **dstptr, unsigned int *size);
434 435

#endif /* CONFIG_COMPAT */
436
#endif /* _X_TABLES_H */