[GitHub/mt8127/android_kernel_alcatel_ttab.git] / include / linux / netfilter / x_tables.h

#ifndef _X_TABLES_H
#define _X_TABLES_H

#include <linux/types.h>

#define XT_FUNCTION_MAXNAMELEN 30
#define XT_TABLE_MAXNAMELEN 32

struct xt_entry_match {
	union {
		struct {
			__u16 match_size;

			/* Used by userspace */
			char name[XT_FUNCTION_MAXNAMELEN-1];

			__u8 revision;
		} user;
		struct {
			__u16 match_size;

			/* Used inside the kernel */
			struct xt_match *match;
		} kernel;

		/* Total length */
		__u16 match_size;
	} u;

	unsigned char data[0];
};

struct xt_entry_target {
	union {
		struct {
			__u16 target_size;

			/* Used by userspace */
			char name[XT_FUNCTION_MAXNAMELEN-1];

			__u8 revision;
		} user;
		struct {
			__u16 target_size;

			/* Used inside the kernel */
			struct xt_target *target;
		} kernel;

		/* Total length */
		__u16 target_size;
	} u;

	unsigned char data[0];
};

#define XT_TARGET_INIT(__name, __size)					       \
{									       \
	.target.u.user = {						       \
		.target_size	= XT_ALIGN(__size),			       \
		.name		= __name,				       \
	},								       \
}

struct xt_standard_target {
	struct xt_entry_target target;
	int verdict;
};

/* The argument to IPT_SO_GET_REVISION_*.  Returns highest revision
 * kernel supports, if >= revision. */
struct xt_get_revision {
	char name[XT_FUNCTION_MAXNAMELEN-1];

	__u8 revision;
};

/* CONTINUE verdict for targets */
#define XT_CONTINUE 0xFFFFFFFF

/* For standard target */
#define XT_RETURN (-NF_REPEAT - 1)

/* this is a dummy structure to find out the alignment requirement for a struct
 * containing all the fundamental data types that are used in ipt_entry,
 * ip6t_entry and arpt_entry.  This sucks, and it is a hack.  It will be my
 * personal pleasure to remove it -HW
 */
struct _xt_align {
	__u8 u8;
	__u16 u16;
	__u32 u32;
	__u64 u64;
};

#define XT_ALIGN(s) (((s) + (__alignof__(struct _xt_align)-1)) 	\
			& ~(__alignof__(struct _xt_align)-1))

/* Standard return verdict, or do jump. */
#define XT_STANDARD_TARGET ""
/* Error verdict. */
#define XT_ERROR_TARGET "ERROR"

#define SET_COUNTER(c,b,p) do { (c).bcnt = (b); (c).pcnt = (p); } while(0)
#define ADD_COUNTER(c,b,p) do { (c).bcnt += (b); (c).pcnt += (p); } while(0)

struct xt_counters {
	__u64 pcnt, bcnt;			/* Packet and byte counters */
};

/* The argument to IPT_SO_ADD_COUNTERS. */
struct xt_counters_info {
	/* Which table. */
	char name[XT_TABLE_MAXNAMELEN];

	unsigned int num_counters;

	/* The counters (actually `number' of these). */
	struct xt_counters counters[0];
};

#define XT_INV_PROTO		0x40	/* Invert the sense of PROTO. */

/* fn returns 0 to continue iteration */
#define XT_MATCH_ITERATE(type, e, fn, args...)			\
({								\
	unsigned int __i;					\
	int __ret = 0;						\
	struct xt_entry_match *__m;				\
								\
	for (__i = sizeof(type);				\
	     __i < (e)->target_offset;				\
	     __i += __m->u.match_size) {			\
		__m = (void *)e + __i;				\
								\
		__ret = fn(__m , ## args);			\
		if (__ret != 0)					\
			break;					\
	}							\
	__ret;							\
})

/* fn returns 0 to continue iteration */
#define XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \
({								\
	unsigned int __i, __n;					\
	int __ret = 0;						\
	type *__entry;						\
								\
	for (__i = 0, __n = 0; __i < (size);			\
	     __i += __entry->next_offset, __n++) { 		\
		__entry = (void *)(entries) + __i;		\
		if (__n < n)					\
			continue;				\
								\
		__ret = fn(__entry , ## args);			\
		if (__ret != 0)					\
			break;					\
	}							\
	__ret;							\
})

/* fn returns 0 to continue iteration */
#define XT_ENTRY_ITERATE(type, entries, size, fn, args...) \
	XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)

#ifdef __KERNEL__

#include <linux/netdevice.h>

/**
 * struct xt_match_param - parameters for match extensions' match functions
 *
 * @in:		input netdevice
 * @out:	output netdevice
 * @match:	struct xt_match through which this function was invoked
 * @matchinfo:	per-match data
 * @fragoff:	packet is a fragment, this is the data offset
 * @thoff:	position of transport header relative to skb->data
 * @hook:	hook number given packet came from
 * @family:	Actual NFPROTO_* through which the function is invoked
 * 		(helpful when match->family == NFPROTO_UNSPEC)
 * @hotdrop:	drop packet if we had inspection problems
 */
struct xt_match_param {
	const struct net_device *in, *out;
	const struct xt_match *match;
	const void *matchinfo;
	int fragoff;
	unsigned int thoff;
	unsigned int hooknum;
	u_int8_t family;
	bool *hotdrop;
};

/**
 * struct xt_mtchk_param - parameters for match extensions'
 * checkentry functions
 *
 * @table:	table the rule is tried to be inserted into
 * @entryinfo:	the family-specific rule data
 * 		(struct ipt_ip, ip6t_ip, ebt_entry)
 * @match:	struct xt_match through which this function was invoked
 * @matchinfo:	per-match data
 * @hook_mask:	via which hooks the new rule is reachable
 */
struct xt_mtchk_param {
	const char *table;
	const void *entryinfo;
	const struct xt_match *match;
	void *matchinfo;
	unsigned int hook_mask;
	u_int8_t family;
};

/* Match destructor parameters */
struct xt_mtdtor_param {
	const struct xt_match *match;
	void *matchinfo;
	u_int8_t family;
};

/**
 * struct xt_target_param - parameters for target extensions' target functions
 *
 * @hooknum:	hook through which this target was invoked
 * @target:	struct xt_target through which this function was invoked
 * @targinfo:	per-target data
 *
 * Other fields see above.
 */
struct xt_target_param {
	const struct net_device *in, *out;
	const struct xt_target *target;
	const void *targinfo;
	unsigned int hooknum;
	u_int8_t family;
};

/**
 * 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 {
	const char *table;
	const void *entryinfo;
	const struct xt_target *target;
	void *targinfo;
	unsigned int hook_mask;
	u_int8_t family;
};

/* Target destructor parameters */
struct xt_tgdtor_param {
	const struct xt_target *target;
	void *targinfo;
	u_int8_t family;
};

struct xt_match {
	struct list_head list;

	const char name[XT_FUNCTION_MAXNAMELEN-1];
	u_int8_t revision;

	/* 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. */
	bool (*match)(const struct sk_buff *skb,
		      const struct xt_match_param *);

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

	/* Called when entry of this type deleted. */
	void (*destroy)(const struct xt_mtdtor_param *);

	/* Called when userspace align differs from kernel space one */
	void (*compat_from_user)(void *dst, void *src);
	int (*compat_to_user)(void __user *dst, void *src);

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

	/* Free to use by each match */
	unsigned long data;

	const char *table;
	unsigned int matchsize;
	unsigned int compatsize;
	unsigned int hooks;
	unsigned short proto;

	unsigned short family;
};

/* Registration hooks for targets. */
struct xt_target {
	struct list_head list;

	const char name[XT_FUNCTION_MAXNAMELEN-1];

	/* 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. */
	unsigned int (*target)(struct sk_buff *skb,
			       const struct xt_target_param *);

	/* Called when user tries to insert an entry of this type:
           hook_mask is a bitmask of hooks from which it can be
           called. */
	/* Should return true or false. */
	bool (*checkentry)(const struct xt_tgchk_param *);

	/* Called when entry of this type deleted. */
	void (*destroy)(const struct xt_tgdtor_param *);

	/* Called when userspace align differs from kernel space one */
	void (*compat_from_user)(void *dst, void *src);
	int (*compat_to_user)(void __user *dst, void *src);

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

	const char *table;
	unsigned int targetsize;
	unsigned int compatsize;
	unsigned int hooks;
	unsigned short proto;

	unsigned short family;
	u_int8_t revision;
};

/* Furniture shopping... */
struct xt_table {
	struct list_head list;

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

	/* Man behind the curtain... */
	struct xt_table_info *private;

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

	u_int8_t af;		/* address/protocol family */

	/* A unique name... */
	const char name[XT_TABLE_MAXNAMELEN];
};

#include <linux/netfilter_ipv4.h>

/* The table itself */
struct xt_table_info {
	/* 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 */
	unsigned int hook_entry[NF_INET_NUMHOOKS];
	unsigned int underflow[NF_INET_NUMHOOKS];

	/* ipt_entry tables: one per CPU */
	/* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */
	void *entries[1];
};

#define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
			  + nr_cpu_ids * sizeof(char *))
extern int xt_register_target(struct xt_target *target);
extern void xt_unregister_target(struct xt_target *target);
extern int xt_register_targets(struct xt_target *target, unsigned int n);
extern void xt_unregister_targets(struct xt_target *target, unsigned int n);

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

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

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

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

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

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

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

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

/*
 * Per-CPU spinlock associated with per-cpu table entries, and
 * with a counter for the "reading" side that allows a recursive
 * reader to avoid taking the lock and deadlocking.
 *
 * "reading" is used by ip/arp/ip6 tables rule processing which runs per-cpu.
 * It needs to ensure that the rules are not being changed while the packet
 * is being processed. In some cases, the read lock will be acquired
 * twice on the same CPU; this is okay because of the count.
 *
 * "writing" is used when reading counters.
 *  During replace any readers that are using the old tables have to complete
 *  before freeing the old table. This is handled by the write locking
 *  necessary for reading the counters.
 */
struct xt_info_lock {
	spinlock_t lock;
	unsigned char readers;
};
DECLARE_PER_CPU(struct xt_info_lock, xt_info_locks);

/*
 * Note: we need to ensure that preemption is disabled before acquiring
 * the per-cpu-variable, so we do it as a two step process rather than
 * using "spin_lock_bh()".
 *
 * We _also_ need to disable bottom half processing before updating our
 * nesting count, to make sure that the only kind of re-entrancy is this
 * code being called by itself: since the count+lock is not an atomic
 * operation, we can allow no races.
 *
 * _Only_ that special combination of being per-cpu and never getting
 * re-entered asynchronously means that the count is safe.
 */
static inline void xt_info_rdlock_bh(void)
{
	struct xt_info_lock *lock;

	local_bh_disable();
	lock = &__get_cpu_var(xt_info_locks);
	if (likely(!lock->readers++))
		spin_lock(&lock->lock);
}

static inline void xt_info_rdunlock_bh(void)
{
	struct xt_info_lock *lock = &__get_cpu_var(xt_info_locks);

	if (likely(!--lock->readers))
		spin_unlock(&lock->lock);
	local_bh_enable();
}

/*
 * The "writer" side needs to get exclusive access to the lock,
 * regardless of readers.  This must be called with bottom half
 * processing (and thus also preemption) disabled.
 */
static inline void xt_info_wrlock(unsigned int cpu)
{
	spin_lock(&per_cpu(xt_info_locks, cpu).lock);
}

static inline void xt_info_wrunlock(unsigned int cpu)
{
	spin_unlock(&per_cpu(xt_info_locks, cpu).lock);
}

/*
 * 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;
}

#ifdef CONFIG_COMPAT
#include <net/compat.h>

struct compat_xt_entry_match {
	union {
		struct {
			u_int16_t match_size;
			char name[XT_FUNCTION_MAXNAMELEN - 1];
			u_int8_t revision;
		} user;
		struct {
			u_int16_t match_size;
			compat_uptr_t match;
		} kernel;
		u_int16_t match_size;
	} u;
	unsigned char data[0];
};

struct compat_xt_entry_target {
	union {
		struct {
			u_int16_t target_size;
			char name[XT_FUNCTION_MAXNAMELEN - 1];
			u_int8_t revision;
		} user;
		struct {
			u_int16_t target_size;
			compat_uptr_t target;
		} kernel;
		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 */

struct compat_xt_counters {
#if defined(CONFIG_X86_64) || defined(CONFIG_IA64)
	u_int32_t cnt[4];
#else
	u_int64_t cnt[2];
#endif
};

struct compat_xt_counters_info {
	char name[XT_TABLE_MAXNAMELEN];
	compat_uint_t num_counters;
	struct compat_xt_counters counters[0];
};

#define COMPAT_XT_ALIGN(s) (((s) + (__alignof__(struct compat_xt_counters)-1)) \
		& ~(__alignof__(struct compat_xt_counters)-1))

extern void xt_compat_lock(u_int8_t af);
extern void xt_compat_unlock(u_int8_t af);

extern int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta);
extern void xt_compat_flush_offsets(u_int8_t af);
extern short xt_compat_calc_jump(u_int8_t af, unsigned int offset);

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

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

#endif /* CONFIG_COMPAT */
#endif /* __KERNEL__ */

#endif /* _X_TABLES_H */
Commit	Line	Data
2e4e6a17 HW	1	#ifndef _X_TABLES_H
	2	#define _X_TABLES_H
	3
60c195c7 AB	4	#include <linux/types.h>
60c195c7 AB	5
2e4e6a17 HW	6	#define XT_FUNCTION_MAXNAMELEN 30
	7	#define XT_TABLE_MAXNAMELEN 32
	8
d94d9fee	9	struct xt_entry_match {
1e30a014 DM	10	union {
1e30a014 DM	11	struct {
60c195c7	12	__u16 match_size;
1e30a014 DM	13
	14	/* Used by userspace */
	15	char name[XT_FUNCTION_MAXNAMELEN-1];
	16
60c195c7	17	__u8 revision;
1e30a014 DM	18	} user;
1e30a014 DM	19	struct {
60c195c7	20	__u16 match_size;
1e30a014 DM	21
	22	/* Used inside the kernel */
	23	struct xt_match *match;
	24	} kernel;
	25
	26	/* Total length */
60c195c7	27	__u16 match_size;
1e30a014 DM	28	} u;
	29
	30	unsigned char data[0];
	31	};
	32
d94d9fee	33	struct xt_entry_target {
1e30a014 DM	34	union {
1e30a014 DM	35	struct {
60c195c7	36	__u16 target_size;
1e30a014 DM	37
	38	/* Used by userspace */
	39	char name[XT_FUNCTION_MAXNAMELEN-1];
	40
60c195c7	41	__u8 revision;
1e30a014 DM	42	} user;
1e30a014 DM	43	struct {
60c195c7	44	__u16 target_size;
1e30a014 DM	45
	46	/* Used inside the kernel */
	47	struct xt_target *target;
	48	} kernel;
	49
	50	/* Total length */
60c195c7	51	__u16 target_size;
1e30a014 DM	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
d94d9fee	65	struct xt_standard_target {
1e30a014 DM	66	struct xt_entry_target target;
	67	int verdict;
	68	};
	69
2e4e6a17 HW	70	/* The argument to IPT_SO_GET_REVISION_*. Returns highest revision
2e4e6a17 HW	71	* kernel supports, if >= revision. */
d94d9fee	72	struct xt_get_revision {
2e4e6a17 HW	73	char name[XT_FUNCTION_MAXNAMELEN-1];
2e4e6a17 HW	74
60c195c7	75	__u8 revision;
2e4e6a17 HW	76	};
	77
	78	/* CONTINUE verdict for targets */
	79	#define XT_CONTINUE 0xFFFFFFFF
	80
	81	/* For standard target */
	82	#define XT_RETURN (-NF_REPEAT - 1)
	83
6fbfc968 DM	84	/* this is a dummy structure to find out the alignment requirement for a struct
	85	* containing all the fundamental data types that are used in ipt_entry,
	86	* ip6t_entry and arpt_entry. This sucks, and it is a hack. It will be my
	87	* personal pleasure to remove it -HW
	88	*/
d94d9fee	89	struct _xt_align {
60c195c7 AB	90	__u8 u8;
	91	__u16 u16;
	92	__u32 u32;
	93	__u64 u64;
6fbfc968 DM	94	};
	95
	96	#define XT_ALIGN(s) (((s) + (__alignof__(struct _xt_align)-1)) \
	97	& ~(__alignof__(struct _xt_align)-1))
2e4e6a17 HW	98
	99	/* Standard return verdict, or do jump. */
	100	#define XT_STANDARD_TARGET ""
	101	/* Error verdict. */
	102	#define XT_ERROR_TARGET "ERROR"
	103
2e4e6a17 HW	104	#define SET_COUNTER(c,b,p) do { (c).bcnt = (b); (c).pcnt = (p); } while(0)
	105	#define ADD_COUNTER(c,b,p) do { (c).bcnt += (b); (c).pcnt += (p); } while(0)
	106
d94d9fee	107	struct xt_counters {
60c195c7	108	__u64 pcnt, bcnt; /* Packet and byte counters */
2e4e6a17 HW	109	};
	110
	111	/* The argument to IPT_SO_ADD_COUNTERS. */
d94d9fee	112	struct xt_counters_info {
2e4e6a17 HW	113	/* Which table. */
	114	char name[XT_TABLE_MAXNAMELEN];
	115
	116	unsigned int num_counters;
	117
	118	/* The counters (actually `number' of these). */
	119	struct xt_counters counters[0];
	120	};
	121
	122	#define XT_INV_PROTO 0x40 /* Invert the sense of PROTO. */
	123
89c002d6 PM	124	/* fn returns 0 to continue iteration */
	125	#define XT_MATCH_ITERATE(type, e, fn, args...) \
	126	({ \
	127	unsigned int __i; \
	128	int __ret = 0; \
	129	struct xt_entry_match *__m; \
	130	\
	131	for (__i = sizeof(type); \
	132	__i < (e)->target_offset; \
	133	__i += __m->u.match_size) { \
	134	__m = (void *)e + __i; \
	135	\
	136	__ret = fn(__m , ## args); \
	137	if (__ret != 0) \
	138	break; \
	139	} \
	140	__ret; \
	141	})
	142
	143	/* fn returns 0 to continue iteration */
	144	#define XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \
	145	({ \
	146	unsigned int __i, __n; \
	147	int __ret = 0; \
	148	type *__entry; \
	149	\
	150	for (__i = 0, __n = 0; __i < (size); \
	151	__i += __entry->next_offset, __n++) { \
	152	__entry = (void *)(entries) + __i; \
	153	if (__n < n) \
	154	continue; \
	155	\
	156	__ret = fn(__entry , ## args); \
	157	if (__ret != 0) \
	158	break; \
	159	} \
	160	__ret; \
	161	})
	162
	163	/* fn returns 0 to continue iteration */
	164	#define XT_ENTRY_ITERATE(type, entries, size, fn, args...) \
	165	XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)
	166
2e4e6a17 HW	167	#ifdef __KERNEL__
	168
	169	#include <linux/netdevice.h>
	170
f7108a20 JE	171	/**
	172	* struct xt_match_param - parameters for match extensions' match functions
	173	*
	174	* @in: input netdevice
	175	* @out: output netdevice
	176	* @match: struct xt_match through which this function was invoked
	177	* @matchinfo: per-match data
	178	* @fragoff: packet is a fragment, this is the data offset
	179	* @thoff: position of transport header relative to skb->data
a5e78820	180	* @hook: hook number given packet came from
916a917d JE	181	* @family: Actual NFPROTO_* through which the function is invoked
916a917d JE	182	* (helpful when match->family == NFPROTO_UNSPEC)
a5e78820	183	* @hotdrop: drop packet if we had inspection problems
f7108a20 JE	184	*/
	185	struct xt_match_param {
	186	const struct net_device in, out;
	187	const struct xt_match *match;
	188	const void *matchinfo;
	189	int fragoff;
	190	unsigned int thoff;
a5e78820	191	unsigned int hooknum;
916a917d	192	u_int8_t family;
a5e78820	193	bool *hotdrop;
f7108a20 JE	194	};
f7108a20 JE	195
9b4fce7a JE	196	/**
	197	* struct xt_mtchk_param - parameters for match extensions'
	198	* checkentry functions
	199	*
	200	* @table: table the rule is tried to be inserted into
	201	* @entryinfo: the family-specific rule data
	202	* (struct ipt_ip, ip6t_ip, ebt_entry)
	203	* @match: struct xt_match through which this function was invoked
	204	* @matchinfo: per-match data
	205	* @hook_mask: via which hooks the new rule is reachable
	206	*/
	207	struct xt_mtchk_param {
	208	const char *table;
	209	const void *entryinfo;
	210	const struct xt_match *match;
	211	void *matchinfo;
	212	unsigned int hook_mask;
916a917d	213	u_int8_t family;
9b4fce7a JE	214	};
9b4fce7a JE	215
6be3d859 JE	216	/* Match destructor parameters */
	217	struct xt_mtdtor_param {
	218	const struct xt_match *match;
	219	void *matchinfo;
916a917d	220	u_int8_t family;
6be3d859 JE	221	};
6be3d859 JE	222
7eb35586 JE	223	/**
	224	* struct xt_target_param - parameters for target extensions' target functions
	225	*
	226	* @hooknum: hook through which this target was invoked
	227	* @target: struct xt_target through which this function was invoked
	228	* @targinfo: per-target data
	229	*
	230	* Other fields see above.
	231	*/
	232	struct xt_target_param {
	233	const struct net_device in, out;
7eb35586 JE	234	const struct xt_target *target;
7eb35586 JE	235	const void *targinfo;
98d89b41	236	unsigned int hooknum;
916a917d	237	u_int8_t family;
7eb35586 JE	238	};
7eb35586 JE	239
af5d6dc2 JE	240	/**
	241	* struct xt_tgchk_param - parameters for target extensions'
	242	* checkentry functions
	243	*
	244	* @entryinfo: the family-specific rule data
	245	* (struct ipt_entry, ip6t_entry, arpt_entry, ebt_entry)
	246	*
	247	* Other fields see above.
	248	*/
	249	struct xt_tgchk_param {
	250	const char *table;
f79fca55	251	const void *entryinfo;
af5d6dc2 JE	252	const struct xt_target *target;
	253	void *targinfo;
	254	unsigned int hook_mask;
916a917d	255	u_int8_t family;
af5d6dc2 JE	256	};
af5d6dc2 JE	257
a2df1648 JE	258	/* Target destructor parameters */
	259	struct xt_tgdtor_param {
	260	const struct xt_target *target;
	261	void *targinfo;
916a917d	262	u_int8_t family;
a2df1648 JE	263	};
a2df1648 JE	264
d94d9fee	265	struct xt_match {
2e4e6a17 HW	266	struct list_head list;
	267
	268	const char name[XT_FUNCTION_MAXNAMELEN-1];
daaf83d2	269	u_int8_t revision;
2e4e6a17	270
2e4e6a17 HW	271	/* Return true or false: return FALSE and set *hotdrop = 1 to
	272	force immediate packet drop. */
	273	/* Arguments changed since 2.6.9, as this must now handle
	274	non-linear skb, using skb_header_pointer and
	275	skb_ip_make_writable. */
1d93a9cb	276	bool (match)(const struct sk_buff skb,
f7108a20	277	const struct xt_match_param *);
2e4e6a17 HW	278
2e4e6a17 HW	279	/* Called when user tries to insert an entry of this type. */
9b4fce7a	280	bool (checkentry)(const struct xt_mtchk_param );
2e4e6a17 HW	281
2e4e6a17 HW	282	/* Called when entry of this type deleted. */
6be3d859	283	void (destroy)(const struct xt_mtdtor_param );
2e4e6a17	284
2722971c	285	/* Called when userspace align differs from kernel space one */
9fa492cd PM	286	void (compat_from_user)(void dst, void *src);
9fa492cd PM	287	int (compat_to_user)(void __user dst, void *src);
2722971c	288
2e4e6a17 HW	289	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
2e4e6a17 HW	290	struct module *me;
37f9f733	291
91270cf8 PM	292	/* Free to use by each match */
	293	unsigned long data;
	294
ecb6f85e	295	const char *table;
37f9f733	296	unsigned int matchsize;
9fa492cd	297	unsigned int compatsize;
37f9f733 PM	298	unsigned int hooks;
37f9f733 PM	299	unsigned short proto;
c4b88513 PM	300
c4b88513 PM	301	unsigned short family;
2e4e6a17 HW	302	};
	303
	304	/* Registration hooks for targets. */
d94d9fee	305	struct xt_target {
2e4e6a17 HW	306	struct list_head list;
	307
	308	const char name[XT_FUNCTION_MAXNAMELEN-1];
	309
2e4e6a17 HW	310	/* Returns verdict. Argument order changed since 2.6.9, as this
	311	must now handle non-linear skbs, using skb_copy_bits and
	312	skb_ip_make_writable. */
3db05fea	313	unsigned int (target)(struct sk_buff skb,
7eb35586	314	const struct xt_target_param *);
2e4e6a17 HW	315
	316	/* Called when user tries to insert an entry of this type:
	317	hook_mask is a bitmask of hooks from which it can be
	318	called. */
	319	/* Should return true or false. */
af5d6dc2	320	bool (checkentry)(const struct xt_tgchk_param );
2e4e6a17 HW	321
2e4e6a17 HW	322	/* Called when entry of this type deleted. */
a2df1648	323	void (destroy)(const struct xt_tgdtor_param );
2e4e6a17	324
2722971c	325	/* Called when userspace align differs from kernel space one */
9fa492cd PM	326	void (compat_from_user)(void dst, void *src);
9fa492cd PM	327	int (compat_to_user)(void __user dst, void *src);
2722971c	328
2e4e6a17 HW	329	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
2e4e6a17 HW	330	struct module *me;
37f9f733	331
ecb6f85e	332	const char *table;
37f9f733	333	unsigned int targetsize;
9fa492cd	334	unsigned int compatsize;
37f9f733 PM	335	unsigned int hooks;
37f9f733 PM	336	unsigned short proto;
c4b88513 PM	337
c4b88513 PM	338	unsigned short family;
37f9f733	339	u_int8_t revision;
2e4e6a17 HW	340	};
	341
	342	/* Furniture shopping... */
d94d9fee	343	struct xt_table {
2e4e6a17 HW	344	struct list_head list;
2e4e6a17 HW	345
2e4e6a17 HW	346	/* What hooks you will enter on */
	347	unsigned int valid_hooks;
	348
2e4e6a17	349	/* Man behind the curtain... */
4a2f965c	350	struct xt_table_info *private;
2e4e6a17 HW	351
	352	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
	353	struct module *me;
	354
76108cea	355	u_int8_t af; /* address/protocol family */
4a2f965c SH	356
	357	/* A unique name... */
	358	const char name[XT_TABLE_MAXNAMELEN];
2e4e6a17 HW	359	};
	360
	361	#include <linux/netfilter_ipv4.h>
	362
	363	/* The table itself */
d94d9fee	364	struct xt_table_info {
2e4e6a17 HW	365	/* Size per table */
	366	unsigned int size;
	367	/* Number of entries: FIXME. --RR */
	368	unsigned int number;
	369	/* Initial number of entries. Needed for module usage count */
	370	unsigned int initial_entries;
	371
	372	/* Entry points and underflows */
6e23ae2a PM	373	unsigned int hook_entry[NF_INET_NUMHOOKS];
6e23ae2a PM	374	unsigned int underflow[NF_INET_NUMHOOKS];
2e4e6a17 HW	375
2e4e6a17 HW	376	/* ipt_entry tables: one per CPU */
259d4e41	377	/* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */
78454473	378	void *entries[1];
2e4e6a17 HW	379	};
2e4e6a17 HW	380
259d4e41 ED	381	#define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
259d4e41 ED	382	+ nr_cpu_ids * sizeof(char *))
a45049c5 PNA	383	extern int xt_register_target(struct xt_target *target);
a45049c5 PNA	384	extern void xt_unregister_target(struct xt_target *target);
52d9c42e PM	385	extern int xt_register_targets(struct xt_target *target, unsigned int n);
	386	extern void xt_unregister_targets(struct xt_target *target, unsigned int n);
	387
a45049c5 PNA	388	extern int xt_register_match(struct xt_match *target);
a45049c5 PNA	389	extern void xt_unregister_match(struct xt_match *target);
52d9c42e PM	390	extern int xt_register_matches(struct xt_match *match, unsigned int n);
52d9c42e PM	391	extern void xt_unregister_matches(struct xt_match *match, unsigned int n);
2e4e6a17	392
916a917d	393	extern int xt_check_match(struct xt_mtchk_param *,
9b4fce7a	394	unsigned int size, u_int8_t proto, bool inv_proto);
916a917d	395	extern int xt_check_target(struct xt_tgchk_param *,
af5d6dc2	396	unsigned int size, u_int8_t proto, bool inv_proto);
37f9f733	397
8d870052	398	extern struct xt_table xt_register_table(struct net net,
35aad0ff	399	const struct xt_table *table,
a98da11d AD	400	struct xt_table_info *bootstrap,
a98da11d AD	401	struct xt_table_info *newinfo);
2e4e6a17 HW	402	extern void xt_unregister_table(struct xt_table table);
	403
	404	extern struct xt_table_info xt_replace_table(struct xt_table table,
	405	unsigned int num_counters,
	406	struct xt_table_info *newinfo,
	407	int *error);
	408
76108cea JE	409	extern struct xt_match xt_find_match(u8 af, const char name, u8 revision);
	410	extern struct xt_target xt_find_target(u8 af, const char name, u8 revision);
	411	extern struct xt_target xt_request_find_target(u8 af, const char name,
2e4e6a17	412	u8 revision);
76108cea JE	413	extern int xt_find_revision(u8 af, const char *name, u8 revision,
76108cea JE	414	int target, int *err);
2e4e6a17	415
76108cea	416	extern struct xt_table xt_find_table_lock(struct net net, u_int8_t af,
8d870052	417	const char *name);
2e4e6a17 HW	418	extern void xt_table_unlock(struct xt_table *t);
2e4e6a17 HW	419
76108cea JE	420	extern int xt_proto_init(struct net *net, u_int8_t af);
76108cea JE	421	extern void xt_proto_fini(struct net *net, u_int8_t af);
2e4e6a17 HW	422
	423	extern struct xt_table_info *xt_alloc_table_info(unsigned int size);
	424	extern void xt_free_table_info(struct xt_table_info *info);
942e4a2b SH	425
	426	/*
	427	* Per-CPU spinlock associated with per-cpu table entries, and
	428	* with a counter for the "reading" side that allows a recursive
	429	* reader to avoid taking the lock and deadlocking.
	430	*
	431	* "reading" is used by ip/arp/ip6 tables rule processing which runs per-cpu.
	432	* It needs to ensure that the rules are not being changed while the packet
	433	* is being processed. In some cases, the read lock will be acquired
	434	* twice on the same CPU; this is okay because of the count.
	435	*
	436	* "writing" is used when reading counters.
	437	* During replace any readers that are using the old tables have to complete
	438	* before freeing the old table. This is handled by the write locking
	439	* necessary for reading the counters.
	440	*/
	441	struct xt_info_lock {
	442	spinlock_t lock;
	443	unsigned char readers;
	444	};
	445	DECLARE_PER_CPU(struct xt_info_lock, xt_info_locks);
	446
	447	/*
	448	* Note: we need to ensure that preemption is disabled before acquiring
	449	* the per-cpu-variable, so we do it as a two step process rather than
	450	* using "spin_lock_bh()".
	451	*
	452	* We _also_ need to disable bottom half processing before updating our
	453	* nesting count, to make sure that the only kind of re-entrancy is this
	454	* code being called by itself: since the count+lock is not an atomic
	455	* operation, we can allow no races.
	456	*
	457	* _Only_ that special combination of being per-cpu and never getting
	458	* re-entered asynchronously means that the count is safe.
	459	*/
	460	static inline void xt_info_rdlock_bh(void)
	461	{
	462	struct xt_info_lock *lock;
	463
	464	local_bh_disable();
	465	lock = &__get_cpu_var(xt_info_locks);
0f3d042e	466	if (likely(!lock->readers++))
942e4a2b SH	467	spin_lock(&lock->lock);
	468	}
	469
	470	static inline void xt_info_rdunlock_bh(void)
	471	{
	472	struct xt_info_lock *lock = &__get_cpu_var(xt_info_locks);
	473
0f3d042e	474	if (likely(!--lock->readers))
942e4a2b SH	475	spin_unlock(&lock->lock);
	476	local_bh_enable();
	477	}
	478
	479	/*
	480	* The "writer" side needs to get exclusive access to the lock,
	481	* regardless of readers. This must be called with bottom half
	482	* processing (and thus also preemption) disabled.
	483	*/
	484	static inline void xt_info_wrlock(unsigned int cpu)
	485	{
	486	spin_lock(&per_cpu(xt_info_locks, cpu).lock);
	487	}
	488
	489	static inline void xt_info_wrunlock(unsigned int cpu)
	490	{
	491	spin_unlock(&per_cpu(xt_info_locks, cpu).lock);
	492	}
2e4e6a17	493
b8dfe498 ED	494	/*
	495	* This helper is performance critical and must be inlined
	496	*/
	497	static inline unsigned long ifname_compare_aligned(const char *_a,
	498	const char *_b,
	499	const char *_mask)
	500	{
	501	const unsigned long a = (const unsigned long )_a;
	502	const unsigned long b = (const unsigned long )_b;
	503	const unsigned long mask = (const unsigned long )_mask;
	504	unsigned long ret;
	505
	506	ret = (a[0] ^ b[0]) & mask[0];
	507	if (IFNAMSIZ > sizeof(unsigned long))
	508	ret \|= (a[1] ^ b[1]) & mask[1];
	509	if (IFNAMSIZ > 2 * sizeof(unsigned long))
	510	ret \|= (a[2] ^ b[2]) & mask[2];
	511	if (IFNAMSIZ > 3 * sizeof(unsigned long))
	512	ret \|= (a[3] ^ b[3]) & mask[3];
	513	BUILD_BUG_ON(IFNAMSIZ > 4 * sizeof(unsigned long));
	514	return ret;
	515	}
	516
2722971c DM	517	#ifdef CONFIG_COMPAT
	518	#include <net/compat.h>
	519
d94d9fee	520	struct compat_xt_entry_match {
2722971c DM	521	union {
	522	struct {
	523	u_int16_t match_size;
	524	char name[XT_FUNCTION_MAXNAMELEN - 1];
	525	u_int8_t revision;
	526	} user;
46c5ea3c PM	527	struct {
	528	u_int16_t match_size;
	529	compat_uptr_t match;
	530	} kernel;
2722971c DM	531	u_int16_t match_size;
	532	} u;
	533	unsigned char data[0];
	534	};
	535
d94d9fee	536	struct compat_xt_entry_target {
2722971c DM	537	union {
	538	struct {
	539	u_int16_t target_size;
	540	char name[XT_FUNCTION_MAXNAMELEN - 1];
	541	u_int8_t revision;
	542	} user;
46c5ea3c PM	543	struct {
	544	u_int16_t target_size;
	545	compat_uptr_t target;
	546	} kernel;
2722971c DM	547	u_int16_t target_size;
	548	} u;
	549	unsigned char data[0];
	550	};
	551
	552	/* FIXME: this works only on 32 bit tasks
	553	* need to change whole approach in order to calculate align as function of
	554	* current task alignment */
	555
d94d9fee	556	struct compat_xt_counters {
55fe5866	557	#if defined(CONFIG_X86_64) \|\| defined(CONFIG_IA64)
2722971c	558	u_int32_t cnt[4];
55fe5866 PM	559	#else
	560	u_int64_t cnt[2];
	561	#endif
2722971c DM	562	};
2722971c DM	563
d94d9fee	564	struct compat_xt_counters_info {
2722971c DM	565	char name[XT_TABLE_MAXNAMELEN];
	566	compat_uint_t num_counters;
	567	struct compat_xt_counters counters[0];
	568	};
	569
	570	#define COMPAT_XT_ALIGN(s) (((s) + (__alignof__(struct compat_xt_counters)-1)) \
	571	& ~(__alignof__(struct compat_xt_counters)-1))
	572
76108cea JE	573	extern void xt_compat_lock(u_int8_t af);
76108cea JE	574	extern void xt_compat_unlock(u_int8_t af);
9fa492cd	575
76108cea JE	576	extern int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta);
	577	extern void xt_compat_flush_offsets(u_int8_t af);
	578	extern short xt_compat_calc_jump(u_int8_t af, unsigned int offset);
b386d9f5	579
5452e425	580	extern int xt_compat_match_offset(const struct xt_match *match);
89566951	581	extern int xt_compat_match_from_user(struct xt_entry_match *m,
b0a6363c	582	void *dstptr, unsigned int size);
9fa492cd	583	extern int xt_compat_match_to_user(struct xt_entry_match *m,
b0a6363c	584	void __user *dstptr, unsigned int size);
9fa492cd	585
5452e425	586	extern int xt_compat_target_offset(const struct xt_target *target);
9fa492cd	587	extern void xt_compat_target_from_user(struct xt_entry_target *t,
b0a6363c	588	void *dstptr, unsigned int size);
9fa492cd	589	extern int xt_compat_target_to_user(struct xt_entry_target *t,
b0a6363c	590	void __user *dstptr, unsigned int size);
2722971c DM	591
2722971c DM	592	#endif /* CONFIG_COMPAT */
2e4e6a17 HW	593	#endif /* __KERNEL__ */
	594
	595	#endif /* _X_TABLES_H */