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

#ifndef _X_TABLES_H
#define _X_TABLES_H

#define XT_FUNCTION_MAXNAMELEN 30
#define XT_TABLE_MAXNAMELEN 32

struct xt_entry_match
{
	union {
		struct {
			u_int16_t match_size;

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

			u_int8_t revision;
		} user;
		struct {
			u_int16_t match_size;

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

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

	unsigned char data[0];
};

struct xt_entry_target
{
	union {
		struct {
			u_int16_t target_size;

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

			u_int8_t revision;
		} user;
		struct {
			u_int16_t target_size;

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

		/* Total length */
		u_int16_t 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];

	u_int8_t 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
{
	u_int8_t u8;
	u_int16_t u16;
	u_int32_t u32;
	u_int64_t 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
{
	u_int64_t 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
 * @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;
	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;
};

struct xt_match
{
	struct list_head list;

	const char name[XT_FUNCTION_MAXNAMELEN-1];

	/* 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_match *match, void *matchinfo);

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

/* 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 net_device *in,
			       const struct net_device *out,
			       unsigned int hooknum,
			       const struct xt_target *target,
			       const void *targinfo);

	/* 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 char *tablename,
			   const void *entry,
			   const struct xt_target *target,
			   void *targinfo,
			   unsigned int hook_mask);

	/* Called when entry of this type deleted. */
	void (*destroy)(const struct xt_target *target, void *targinfo);

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

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

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

	/* Lock for the curtain */
	rwlock_t lock;

	/* Man behind the curtain... */
	//struct ip6t_table_info *private;
	void *private;

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

	u_int8_t af;		/* address/protocol family */
};

#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 */
	char *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 *, u_int8_t family,
			  unsigned int size, u_int8_t proto, bool inv_proto);
extern int xt_check_target(const struct xt_target *target, unsigned short family,
			   unsigned int size, const char *table, unsigned int hook,
			   unsigned short proto, int inv_proto,
			   const void *entry, void *targinfo);

extern struct xt_table *xt_register_table(struct net *net,
					  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);

#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
	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
f7108a20 JE	176	/**
	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
	186	*/
	187	struct xt_match_param {
	188	const struct net_device in, out;
	189	const struct xt_match *match;
	190	const void *matchinfo;
	191	int fragoff;
	192	unsigned int thoff;
	193	bool *hotdrop;
	194	};
	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;
	213	};
	214
2e4e6a17 HW	215	struct xt_match
	216	{
	217	struct list_head list;
	218
	219	const char name[XT_FUNCTION_MAXNAMELEN-1];
	220
2e4e6a17 HW	221	/* Return true or false: return FALSE and set *hotdrop = 1 to
	222	force immediate packet drop. */
	223	/* Arguments changed since 2.6.9, as this must now handle
	224	non-linear skb, using skb_header_pointer and
	225	skb_ip_make_writable. */
1d93a9cb	226	bool (match)(const struct sk_buff skb,
f7108a20	227	const struct xt_match_param *);
2e4e6a17 HW	228
2e4e6a17 HW	229	/* Called when user tries to insert an entry of this type. */
9b4fce7a	230	bool (checkentry)(const struct xt_mtchk_param );
2e4e6a17 HW	231
2e4e6a17 HW	232	/* Called when entry of this type deleted. */
efa74165	233	void (destroy)(const struct xt_match match, void *matchinfo);
2e4e6a17	234
2722971c	235	/* Called when userspace align differs from kernel space one */
9fa492cd PM	236	void (compat_from_user)(void dst, void *src);
9fa492cd PM	237	int (compat_to_user)(void __user dst, void *src);
2722971c	238
2e4e6a17 HW	239	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
2e4e6a17 HW	240	struct module *me;
37f9f733	241
91270cf8 PM	242	/* Free to use by each match */
	243	unsigned long data;
	244
ecb6f85e	245	const char *table;
37f9f733	246	unsigned int matchsize;
9fa492cd	247	unsigned int compatsize;
37f9f733 PM	248	unsigned int hooks;
37f9f733 PM	249	unsigned short proto;
c4b88513 PM	250
c4b88513 PM	251	unsigned short family;
37f9f733	252	u_int8_t revision;
2e4e6a17 HW	253	};
	254
	255	/* Registration hooks for targets. */
	256	struct xt_target
	257	{
	258	struct list_head list;
	259
	260	const char name[XT_FUNCTION_MAXNAMELEN-1];
	261
2e4e6a17 HW	262	/* Returns verdict. Argument order changed since 2.6.9, as this
	263	must now handle non-linear skbs, using skb_copy_bits and
	264	skb_ip_make_writable. */
3db05fea	265	unsigned int (target)(struct sk_buff skb,
2e4e6a17 HW	266	const struct net_device *in,
	267	const struct net_device *out,
	268	unsigned int hooknum,
1c524830	269	const struct xt_target *target,
fe1cb108	270	const void *targinfo);
2e4e6a17 HW	271
	272	/* Called when user tries to insert an entry of this type:
	273	hook_mask is a bitmask of hooks from which it can be
	274	called. */
	275	/* Should return true or false. */
e1931b78 JE	276	bool (checkentry)(const char tablename,
	277	const void *entry,
	278	const struct xt_target *target,
	279	void *targinfo,
	280	unsigned int hook_mask);
2e4e6a17 HW	281
2e4e6a17 HW	282	/* Called when entry of this type deleted. */
efa74165	283	void (destroy)(const struct xt_target target, void *targinfo);
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
ecb6f85e	292	const char *table;
37f9f733	293	unsigned int targetsize;
9fa492cd	294	unsigned int compatsize;
37f9f733 PM	295	unsigned int hooks;
37f9f733 PM	296	unsigned short proto;
c4b88513 PM	297
c4b88513 PM	298	unsigned short family;
37f9f733	299	u_int8_t revision;
2e4e6a17 HW	300	};
	301
	302	/* Furniture shopping... */
	303	struct xt_table
	304	{
	305	struct list_head list;
	306
	307	/* A unique name... */
ecb6f85e	308	const char name[XT_TABLE_MAXNAMELEN];
2e4e6a17 HW	309
	310	/* What hooks you will enter on */
	311	unsigned int valid_hooks;
	312
	313	/* Lock for the curtain */
	314	rwlock_t lock;
	315
	316	/* Man behind the curtain... */
	317	//struct ip6t_table_info *private;
	318	void *private;
	319
	320	/* Set this to THIS_MODULE if you are a module, otherwise NULL */
	321	struct module *me;
	322
76108cea	323	u_int8_t af; /* address/protocol family */
2e4e6a17 HW	324	};
	325
	326	#include <linux/netfilter_ipv4.h>
	327
	328	/* The table itself */
	329	struct xt_table_info
	330	{
	331	/* Size per table */
	332	unsigned int size;
	333	/* Number of entries: FIXME. --RR */
	334	unsigned int number;
	335	/* Initial number of entries. Needed for module usage count */
	336	unsigned int initial_entries;
	337
	338	/* Entry points and underflows */
6e23ae2a PM	339	unsigned int hook_entry[NF_INET_NUMHOOKS];
6e23ae2a PM	340	unsigned int underflow[NF_INET_NUMHOOKS];
2e4e6a17 HW	341
2e4e6a17 HW	342	/* ipt_entry tables: one per CPU */
259d4e41 ED	343	/* Note : this field MUST be the last one, see XT_TABLE_INFO_SZ */
259d4e41 ED	344	char *entries[1];
2e4e6a17 HW	345	};
2e4e6a17 HW	346
259d4e41 ED	347	#define XT_TABLE_INFO_SZ (offsetof(struct xt_table_info, entries) \
259d4e41 ED	348	+ nr_cpu_ids * sizeof(char *))
a45049c5 PNA	349	extern int xt_register_target(struct xt_target *target);
a45049c5 PNA	350	extern void xt_unregister_target(struct xt_target *target);
52d9c42e PM	351	extern int xt_register_targets(struct xt_target *target, unsigned int n);
	352	extern void xt_unregister_targets(struct xt_target *target, unsigned int n);
	353
a45049c5 PNA	354	extern int xt_register_match(struct xt_match *target);
a45049c5 PNA	355	extern void xt_unregister_match(struct xt_match *target);
52d9c42e PM	356	extern int xt_register_matches(struct xt_match *match, unsigned int n);
52d9c42e PM	357	extern void xt_unregister_matches(struct xt_match *match, unsigned int n);
2e4e6a17	358
9b4fce7a JE	359	extern int xt_check_match(struct xt_mtchk_param *, u_int8_t family,
9b4fce7a JE	360	unsigned int size, u_int8_t proto, bool inv_proto);
37f9f733 PM	361	extern int xt_check_target(const struct xt_target *target, unsigned short family,
37f9f733 PM	362	unsigned int size, const char *table, unsigned int hook,
367c6790 JE	363	unsigned short proto, int inv_proto,
367c6790 JE	364	const void entry, void targinfo);
37f9f733	365
8d870052 AD	366	extern struct xt_table xt_register_table(struct net net,
8d870052 AD	367	struct xt_table *table,
a98da11d AD	368	struct xt_table_info *bootstrap,
a98da11d AD	369	struct xt_table_info *newinfo);
2e4e6a17 HW	370	extern void xt_unregister_table(struct xt_table table);
	371
	372	extern struct xt_table_info xt_replace_table(struct xt_table table,
	373	unsigned int num_counters,
	374	struct xt_table_info *newinfo,
	375	int *error);
	376
76108cea JE	377	extern struct xt_match xt_find_match(u8 af, const char name, u8 revision);
	378	extern struct xt_target xt_find_target(u8 af, const char name, u8 revision);
	379	extern struct xt_target xt_request_find_target(u8 af, const char name,
2e4e6a17	380	u8 revision);
76108cea JE	381	extern int xt_find_revision(u8 af, const char *name, u8 revision,
76108cea JE	382	int target, int *err);
2e4e6a17	383
76108cea	384	extern struct xt_table xt_find_table_lock(struct net net, u_int8_t af,
8d870052	385	const char *name);
2e4e6a17 HW	386	extern void xt_table_unlock(struct xt_table *t);
2e4e6a17 HW	387
76108cea JE	388	extern int xt_proto_init(struct net *net, u_int8_t af);
76108cea JE	389	extern void xt_proto_fini(struct net *net, u_int8_t af);
2e4e6a17 HW	390
	391	extern struct xt_table_info *xt_alloc_table_info(unsigned int size);
	392	extern void xt_free_table_info(struct xt_table_info *info);
	393
2722971c DM	394	#ifdef CONFIG_COMPAT
	395	#include <net/compat.h>
	396
	397	struct compat_xt_entry_match
	398	{
	399	union {
	400	struct {
	401	u_int16_t match_size;
	402	char name[XT_FUNCTION_MAXNAMELEN - 1];
	403	u_int8_t revision;
	404	} user;
46c5ea3c PM	405	struct {
	406	u_int16_t match_size;
	407	compat_uptr_t match;
	408	} kernel;
2722971c DM	409	u_int16_t match_size;
	410	} u;
	411	unsigned char data[0];
	412	};
	413
	414	struct compat_xt_entry_target
	415	{
	416	union {
	417	struct {
	418	u_int16_t target_size;
	419	char name[XT_FUNCTION_MAXNAMELEN - 1];
	420	u_int8_t revision;
	421	} user;
46c5ea3c PM	422	struct {
	423	u_int16_t target_size;
	424	compat_uptr_t target;
	425	} kernel;
2722971c DM	426	u_int16_t target_size;
	427	} u;
	428	unsigned char data[0];
	429	};
	430
	431	/* FIXME: this works only on 32 bit tasks
	432	* need to change whole approach in order to calculate align as function of
	433	* current task alignment */
	434
	435	struct compat_xt_counters
	436	{
55fe5866	437	#if defined(CONFIG_X86_64) \|\| defined(CONFIG_IA64)
2722971c	438	u_int32_t cnt[4];
55fe5866 PM	439	#else
	440	u_int64_t cnt[2];
	441	#endif
2722971c DM	442	};
	443
	444	struct compat_xt_counters_info
	445	{
	446	char name[XT_TABLE_MAXNAMELEN];
	447	compat_uint_t num_counters;
	448	struct compat_xt_counters counters[0];
	449	};
	450
	451	#define COMPAT_XT_ALIGN(s) (((s) + (__alignof__(struct compat_xt_counters)-1)) \
	452	& ~(__alignof__(struct compat_xt_counters)-1))
	453
76108cea JE	454	extern void xt_compat_lock(u_int8_t af);
76108cea JE	455	extern void xt_compat_unlock(u_int8_t af);
9fa492cd	456
76108cea JE	457	extern int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta);
	458	extern void xt_compat_flush_offsets(u_int8_t af);
	459	extern short xt_compat_calc_jump(u_int8_t af, unsigned int offset);
b386d9f5	460
5452e425	461	extern int xt_compat_match_offset(const struct xt_match *match);
89566951	462	extern int xt_compat_match_from_user(struct xt_entry_match *m,
b0a6363c	463	void *dstptr, unsigned int size);
9fa492cd	464	extern int xt_compat_match_to_user(struct xt_entry_match *m,
b0a6363c	465	void __user *dstptr, unsigned int size);
9fa492cd	466
5452e425	467	extern int xt_compat_target_offset(const struct xt_target *target);
9fa492cd	468	extern void xt_compat_target_from_user(struct xt_entry_target *t,
b0a6363c	469	void *dstptr, unsigned int size);
9fa492cd	470	extern int xt_compat_target_to_user(struct xt_entry_target *t,
b0a6363c	471	void __user *dstptr, unsigned int size);
2722971c DM	472
2722971c DM	473	#endif /* CONFIG_COMPAT */
2e4e6a17 HW	474	#endif /* __KERNEL__ */
	475
	476	#endif /* _X_TABLES_H */