[net-next-2.6.git] / net / core / filter.c

/*
 * Linux Socket Filter - Kernel level socket filtering
 *
 * Author:
 *     Jay Schulist <jschlst@samba.org>
 *
 * Based on the design of:
 *     - The Berkeley Packet Filter
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version
 * 2 of the License, or (at your option) any later version.
 *
 * Andi Kleen - Fix a few bad bugs and races.
 * Kris Katterjohn - Added many additional checks in sk_chk_filter()
 */

#include <linux/module.h>
#include <linux/types.h>
#include <linux/sched.h>
#include <linux/mm.h>
#include <linux/fcntl.h>
#include <linux/socket.h>
#include <linux/in.h>
#include <linux/inet.h>
#include <linux/netdevice.h>
#include <linux/if_packet.h>
#include <net/ip.h>
#include <net/protocol.h>
#include <linux/skbuff.h>
#include <net/sock.h>
#include <linux/errno.h>
#include <linux/timer.h>
#include <asm/system.h>
#include <asm/uaccess.h>
#include <asm/unaligned.h>
#include <linux/filter.h>

/* No hurry in this branch */
static void *__load_pointer(struct sk_buff *skb, int k)
{
	u8 *ptr = NULL;

	if (k >= SKF_NET_OFF)
		ptr = skb->nh.raw + k - SKF_NET_OFF;
	else if (k >= SKF_LL_OFF)
		ptr = skb->mac.raw + k - SKF_LL_OFF;

	if (ptr >= skb->head && ptr < skb->tail)
		return ptr;
	return NULL;
}

static inline void *load_pointer(struct sk_buff *skb, int k,
                                 unsigned int size, void *buffer)
{
	if (k >= 0)
		return skb_header_pointer(skb, k, size, buffer);
	else {
		if (k >= SKF_AD_OFF)
			return NULL;
		return __load_pointer(skb, k);
	}
}

/**
 *	sk_run_filter - run a filter on a socket
 *	@skb: buffer to run the filter on
 *	@filter: filter to apply
 *	@flen: length of filter
 *
 * Decode and apply filter instructions to the skb->data.
 * Return length to keep, 0 for none. skb is the data we are
 * filtering, filter is the array of filter instructions, and
 * len is the number of filter blocks in the array.
 */
unsigned int sk_run_filter(struct sk_buff *skb, struct sock_filter *filter, int flen)
{
	struct sock_filter *fentry;	/* We walk down these */
	void *ptr;
	u32 A = 0;			/* Accumulator */
	u32 X = 0;			/* Index Register */
	u32 mem[BPF_MEMWORDS];		/* Scratch Memory Store */
	u32 tmp;
	int k;
	int pc;

	/*
	 * Process array of filter instructions.
	 */
	for (pc = 0; pc < flen; pc++) {
		fentry = &filter[pc];
			
		switch (fentry->code) {
		case BPF_ALU|BPF_ADD|BPF_X:
			A += X;
			continue;
		case BPF_ALU|BPF_ADD|BPF_K:
			A += fentry->k;
			continue;
		case BPF_ALU|BPF_SUB|BPF_X:
			A -= X;
			continue;
		case BPF_ALU|BPF_SUB|BPF_K:
			A -= fentry->k;
			continue;
		case BPF_ALU|BPF_MUL|BPF_X:
			A *= X;
			continue;
		case BPF_ALU|BPF_MUL|BPF_K:
			A *= fentry->k;
			continue;
		case BPF_ALU|BPF_DIV|BPF_X:
			if (X == 0)
				return 0;
			A /= X;
			continue;
		case BPF_ALU|BPF_DIV|BPF_K:
			A /= fentry->k;
			continue;
		case BPF_ALU|BPF_AND|BPF_X:
			A &= X;
			continue;
		case BPF_ALU|BPF_AND|BPF_K:
			A &= fentry->k;
			continue;
		case BPF_ALU|BPF_OR|BPF_X:
			A |= X;
			continue;
		case BPF_ALU|BPF_OR|BPF_K:
			A |= fentry->k;
			continue;
		case BPF_ALU|BPF_LSH|BPF_X:
			A <<= X;
			continue;
		case BPF_ALU|BPF_LSH|BPF_K:
			A <<= fentry->k;
			continue;
		case BPF_ALU|BPF_RSH|BPF_X:
			A >>= X;
			continue;
		case BPF_ALU|BPF_RSH|BPF_K:
			A >>= fentry->k;
			continue;
		case BPF_ALU|BPF_NEG:
			A = -A;
			continue;
		case BPF_JMP|BPF_JA:
			pc += fentry->k;
			continue;
		case BPF_JMP|BPF_JGT|BPF_K:
			pc += (A > fentry->k) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JGE|BPF_K:
			pc += (A >= fentry->k) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JEQ|BPF_K:
			pc += (A == fentry->k) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JSET|BPF_K:
			pc += (A & fentry->k) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JGT|BPF_X:
			pc += (A > X) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JGE|BPF_X:
			pc += (A >= X) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JEQ|BPF_X:
			pc += (A == X) ? fentry->jt : fentry->jf;
			continue;
		case BPF_JMP|BPF_JSET|BPF_X:
			pc += (A & X) ? fentry->jt : fentry->jf;
			continue;
		case BPF_LD|BPF_W|BPF_ABS:
			k = fentry->k;
load_w:
			ptr = load_pointer(skb, k, 4, &tmp);
			if (ptr != NULL) {
				A = ntohl(get_unaligned((__be32 *)ptr));
				continue;
			}
			break;
		case BPF_LD|BPF_H|BPF_ABS:
			k = fentry->k;
load_h:
			ptr = load_pointer(skb, k, 2, &tmp);
			if (ptr != NULL) {
				A = ntohs(get_unaligned((__be16 *)ptr));
				continue;
			}
			break;
		case BPF_LD|BPF_B|BPF_ABS:
			k = fentry->k;
load_b:
			ptr = load_pointer(skb, k, 1, &tmp);
			if (ptr != NULL) {
				A = *(u8 *)ptr;
				continue;
			}
			break;
		case BPF_LD|BPF_W|BPF_LEN:
			A = skb->len;
			continue;
		case BPF_LDX|BPF_W|BPF_LEN:
			X = skb->len;
			continue;
		case BPF_LD|BPF_W|BPF_IND:
			k = X + fentry->k;
			goto load_w;
		case BPF_LD|BPF_H|BPF_IND:
			k = X + fentry->k;
			goto load_h;
		case BPF_LD|BPF_B|BPF_IND:
			k = X + fentry->k;
			goto load_b;
		case BPF_LDX|BPF_B|BPF_MSH:
			ptr = load_pointer(skb, fentry->k, 1, &tmp);
			if (ptr != NULL) {
				X = (*(u8 *)ptr & 0xf) << 2;
				continue;
			}
			return 0;
		case BPF_LD|BPF_IMM:
			A = fentry->k;
			continue;
		case BPF_LDX|BPF_IMM:
			X = fentry->k;
			continue;
		case BPF_LD|BPF_MEM:
			A = mem[fentry->k];
			continue;
		case BPF_LDX|BPF_MEM:
			X = mem[fentry->k];
			continue;
		case BPF_MISC|BPF_TAX:
			X = A;
			continue;
		case BPF_MISC|BPF_TXA:
			A = X;
			continue;
		case BPF_RET|BPF_K:
			return fentry->k;
		case BPF_RET|BPF_A:
			return A;
		case BPF_ST:
			mem[fentry->k] = A;
			continue;
		case BPF_STX:
			mem[fentry->k] = X;
			continue;
		default:
			WARN_ON(1);
			return 0;
		}

		/*
		 * Handle ancillary data, which are impossible
		 * (or very difficult) to get parsing packet contents.
		 */
		switch (k-SKF_AD_OFF) {
		case SKF_AD_PROTOCOL:
			A = ntohs(skb->protocol);
			continue;
		case SKF_AD_PKTTYPE:
			A = skb->pkt_type;
			continue;
		case SKF_AD_IFINDEX:
			A = skb->dev->ifindex;
			continue;
		default:
			return 0;
		}
	}

	return 0;
}

/**
 *	sk_chk_filter - verify socket filter code
 *	@filter: filter to verify
 *	@flen: length of filter
 *
 * Check the user's filter code. If we let some ugly
 * filter code slip through kaboom! The filter must contain
 * no references or jumps that are out of range, no illegal
 * instructions, and must end with a RET instruction.
 *
 * All jumps are forward as they are not signed.
 *
 * Returns 0 if the rule set is legal or -EINVAL if not.
 */
int sk_chk_filter(struct sock_filter *filter, int flen)
{
	struct sock_filter *ftest;
	int pc;

	if (flen == 0 || flen > BPF_MAXINSNS)
		return -EINVAL;

	/* check the filter code now */
	for (pc = 0; pc < flen; pc++) {
		ftest = &filter[pc];

		/* Only allow valid instructions */
		switch (ftest->code) {
		case BPF_ALU|BPF_ADD|BPF_K:
		case BPF_ALU|BPF_ADD|BPF_X:
		case BPF_ALU|BPF_SUB|BPF_K:
		case BPF_ALU|BPF_SUB|BPF_X:
		case BPF_ALU|BPF_MUL|BPF_K:
		case BPF_ALU|BPF_MUL|BPF_X:
		case BPF_ALU|BPF_DIV|BPF_X:
		case BPF_ALU|BPF_AND|BPF_K:
		case BPF_ALU|BPF_AND|BPF_X:
		case BPF_ALU|BPF_OR|BPF_K:
		case BPF_ALU|BPF_OR|BPF_X:
		case BPF_ALU|BPF_LSH|BPF_K:
		case BPF_ALU|BPF_LSH|BPF_X:
		case BPF_ALU|BPF_RSH|BPF_K:
		case BPF_ALU|BPF_RSH|BPF_X:
		case BPF_ALU|BPF_NEG:
		case BPF_LD|BPF_W|BPF_ABS:
		case BPF_LD|BPF_H|BPF_ABS:
		case BPF_LD|BPF_B|BPF_ABS:
		case BPF_LD|BPF_W|BPF_LEN:
		case BPF_LD|BPF_W|BPF_IND:
		case BPF_LD|BPF_H|BPF_IND:
		case BPF_LD|BPF_B|BPF_IND:
		case BPF_LD|BPF_IMM:
		case BPF_LDX|BPF_W|BPF_LEN:
		case BPF_LDX|BPF_B|BPF_MSH:
		case BPF_LDX|BPF_IMM:
		case BPF_MISC|BPF_TAX:
		case BPF_MISC|BPF_TXA:
		case BPF_RET|BPF_K:
		case BPF_RET|BPF_A:
			break;

		/* Some instructions need special checks */

		case BPF_ALU|BPF_DIV|BPF_K:
			/* check for division by zero */
			if (ftest->k == 0)
				return -EINVAL;
			break;

		case BPF_LD|BPF_MEM:
		case BPF_LDX|BPF_MEM:
		case BPF_ST:
		case BPF_STX:
			/* check for invalid memory addresses */
			if (ftest->k >= BPF_MEMWORDS)
				return -EINVAL;
			break;

		case BPF_JMP|BPF_JA:
			/*
			 * Note, the large ftest->k might cause loops.
			 * Compare this with conditional jumps below,
			 * where offsets are limited. --ANK (981016)
			 */
			if (ftest->k >= (unsigned)(flen-pc-1))
				return -EINVAL;
			break;

		case BPF_JMP|BPF_JEQ|BPF_K:
		case BPF_JMP|BPF_JEQ|BPF_X:
		case BPF_JMP|BPF_JGE|BPF_K:
		case BPF_JMP|BPF_JGE|BPF_X:
		case BPF_JMP|BPF_JGT|BPF_K:
		case BPF_JMP|BPF_JGT|BPF_X:
		case BPF_JMP|BPF_JSET|BPF_K:
		case BPF_JMP|BPF_JSET|BPF_X:
			/* for conditionals both must be safe */
			if (pc + ftest->jt + 1 >= flen ||
			    pc + ftest->jf + 1 >= flen)
				return -EINVAL;
			break;

		default:
			return -EINVAL;
		}
	}

	return (BPF_CLASS(filter[flen - 1].code) == BPF_RET) ? 0 : -EINVAL;
}

/**
 *	sk_attach_filter - attach a socket filter
 *	@fprog: the filter program
 *	@sk: the socket to use
 *
 * Attach the user's filter code. We first run some sanity checks on
 * it to make sure it does not explode on us later. If an error
 * occurs or there is insufficient memory for the filter a negative
 * errno code is returned. On success the return is zero.
 */
int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk)
{
	struct sk_filter *fp; 
	unsigned int fsize = sizeof(struct sock_filter) * fprog->len;
	int err;

	/* Make sure new filter is there and in the right amounts. */
	if (fprog->filter == NULL)
		return -EINVAL;

	fp = sock_kmalloc(sk, fsize+sizeof(*fp), GFP_KERNEL);
	if (!fp)
		return -ENOMEM;
	if (copy_from_user(fp->insns, fprog->filter, fsize)) {
		sock_kfree_s(sk, fp, fsize+sizeof(*fp)); 
		return -EFAULT;
	}

	atomic_set(&fp->refcnt, 1);
	fp->len = fprog->len;

	err = sk_chk_filter(fp->insns, fp->len);
	if (!err) {
		struct sk_filter *old_fp;

		rcu_read_lock_bh();
		old_fp = rcu_dereference(sk->sk_filter);
		rcu_assign_pointer(sk->sk_filter, fp);
		rcu_read_unlock_bh();
		fp = old_fp;
	}

	if (fp)
		sk_filter_release(sk, fp);
	return err;
}

EXPORT_SYMBOL(sk_chk_filter);
EXPORT_SYMBOL(sk_run_filter);
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Linux Socket Filter - Kernel level socket filtering
	3	*
	4	* Author:
	5	* Jay Schulist <jschlst@samba.org>
	6	*
	7	* Based on the design of:
	8	* - The Berkeley Packet Filter
	9	*
	10	* This program is free software; you can redistribute it and/or
	11	* modify it under the terms of the GNU General Public License
	12	* as published by the Free Software Foundation; either version
	13	* 2 of the License, or (at your option) any later version.
	14	*
	15	* Andi Kleen - Fix a few bad bugs and races.
93699863	16	* Kris Katterjohn - Added many additional checks in sk_chk_filter()
1da177e4 LT	17	*/
	18
	19	#include <linux/module.h>
	20	#include <linux/types.h>
	21	#include <linux/sched.h>
	22	#include <linux/mm.h>
	23	#include <linux/fcntl.h>
	24	#include <linux/socket.h>
	25	#include <linux/in.h>
	26	#include <linux/inet.h>
	27	#include <linux/netdevice.h>
	28	#include <linux/if_packet.h>
	29	#include <net/ip.h>
	30	#include <net/protocol.h>
	31	#include <linux/skbuff.h>
	32	#include <net/sock.h>
	33	#include <linux/errno.h>
	34	#include <linux/timer.h>
	35	#include <asm/system.h>
	36	#include <asm/uaccess.h>
40daafc8	37	#include <asm/unaligned.h>
1da177e4 LT	38	#include <linux/filter.h>
	39
	40	/* No hurry in this branch */
0b05b2a4	41	static void __load_pointer(struct sk_buff skb, int k)
1da177e4 LT	42	{
	43	u8 *ptr = NULL;
	44
	45	if (k >= SKF_NET_OFF)
	46	ptr = skb->nh.raw + k - SKF_NET_OFF;
	47	else if (k >= SKF_LL_OFF)
	48	ptr = skb->mac.raw + k - SKF_LL_OFF;
	49
	50	if (ptr >= skb->head && ptr < skb->tail)
	51	return ptr;
	52	return NULL;
	53	}
	54
0b05b2a4 PM	55	static inline void load_pointer(struct sk_buff skb, int k,
	56	unsigned int size, void *buffer)
	57	{
	58	if (k >= 0)
	59	return skb_header_pointer(skb, k, size, buffer);
	60	else {
	61	if (k >= SKF_AD_OFF)
	62	return NULL;
	63	return __load_pointer(skb, k);
	64	}
	65	}
	66
1da177e4	67	/**
2966b66c	68	* sk_run_filter - run a filter on a socket
1da177e4 LT	69	* @skb: buffer to run the filter on
	70	* @filter: filter to apply
	71	* @flen: length of filter
	72	*
	73	* Decode and apply filter instructions to the skb->data.
	74	* Return length to keep, 0 for none. skb is the data we are
	75	* filtering, filter is the array of filter instructions, and
	76	* len is the number of filter blocks in the array.
	77	*/
4bad4dc9	78	unsigned int sk_run_filter(struct sk_buff skb, struct sock_filter filter, int flen)
1da177e4	79	{
1da177e4	80	struct sock_filter fentry; / We walk down these */
0b05b2a4	81	void *ptr;
2966b66c KK	82	u32 A = 0; /* Accumulator */
2966b66c KK	83	u32 X = 0; /* Index Register */
1da177e4	84	u32 mem[BPF_MEMWORDS]; /* Scratch Memory Store */
0b05b2a4	85	u32 tmp;
1da177e4 LT	86	int k;
	87	int pc;
	88
	89	/*
	90	* Process array of filter instructions.
	91	*/
	92	for (pc = 0; pc < flen; pc++) {
	93	fentry = &filter[pc];
	94
	95	switch (fentry->code) {
	96	case BPF_ALU\|BPF_ADD\|BPF_X:
	97	A += X;
	98	continue;
	99	case BPF_ALU\|BPF_ADD\|BPF_K:
	100	A += fentry->k;
	101	continue;
	102	case BPF_ALU\|BPF_SUB\|BPF_X:
	103	A -= X;
	104	continue;
	105	case BPF_ALU\|BPF_SUB\|BPF_K:
	106	A -= fentry->k;
	107	continue;
	108	case BPF_ALU\|BPF_MUL\|BPF_X:
	109	A *= X;
	110	continue;
	111	case BPF_ALU\|BPF_MUL\|BPF_K:
	112	A *= fentry->k;
	113	continue;
	114	case BPF_ALU\|BPF_DIV\|BPF_X:
	115	if (X == 0)
	116	return 0;
	117	A /= X;
	118	continue;
	119	case BPF_ALU\|BPF_DIV\|BPF_K:
1da177e4 LT	120	A /= fentry->k;
	121	continue;
	122	case BPF_ALU\|BPF_AND\|BPF_X:
	123	A &= X;
	124	continue;
	125	case BPF_ALU\|BPF_AND\|BPF_K:
	126	A &= fentry->k;
	127	continue;
	128	case BPF_ALU\|BPF_OR\|BPF_X:
	129	A \|= X;
	130	continue;
	131	case BPF_ALU\|BPF_OR\|BPF_K:
	132	A \|= fentry->k;
	133	continue;
	134	case BPF_ALU\|BPF_LSH\|BPF_X:
	135	A <<= X;
	136	continue;
	137	case BPF_ALU\|BPF_LSH\|BPF_K:
	138	A <<= fentry->k;
	139	continue;
	140	case BPF_ALU\|BPF_RSH\|BPF_X:
	141	A >>= X;
	142	continue;
	143	case BPF_ALU\|BPF_RSH\|BPF_K:
	144	A >>= fentry->k;
	145	continue;
	146	case BPF_ALU\|BPF_NEG:
	147	A = -A;
	148	continue;
	149	case BPF_JMP\|BPF_JA:
	150	pc += fentry->k;
	151	continue;
	152	case BPF_JMP\|BPF_JGT\|BPF_K:
	153	pc += (A > fentry->k) ? fentry->jt : fentry->jf;
	154	continue;
	155	case BPF_JMP\|BPF_JGE\|BPF_K:
	156	pc += (A >= fentry->k) ? fentry->jt : fentry->jf;
	157	continue;
	158	case BPF_JMP\|BPF_JEQ\|BPF_K:
	159	pc += (A == fentry->k) ? fentry->jt : fentry->jf;
	160	continue;
	161	case BPF_JMP\|BPF_JSET\|BPF_K:
	162	pc += (A & fentry->k) ? fentry->jt : fentry->jf;
	163	continue;
	164	case BPF_JMP\|BPF_JGT\|BPF_X:
	165	pc += (A > X) ? fentry->jt : fentry->jf;
	166	continue;
	167	case BPF_JMP\|BPF_JGE\|BPF_X:
	168	pc += (A >= X) ? fentry->jt : fentry->jf;
	169	continue;
	170	case BPF_JMP\|BPF_JEQ\|BPF_X:
	171	pc += (A == X) ? fentry->jt : fentry->jf;
	172	continue;
	173	case BPF_JMP\|BPF_JSET\|BPF_X:
	174	pc += (A & X) ? fentry->jt : fentry->jf;
	175	continue;
	176	case BPF_LD\|BPF_W\|BPF_ABS:
	177	k = fentry->k;
e35bedf3	178	load_w:
0b05b2a4 PM	179	ptr = load_pointer(skb, k, 4, &tmp);
0b05b2a4 PM	180	if (ptr != NULL) {
252e3346	181	A = ntohl(get_unaligned((__be32 *)ptr));
0b05b2a4	182	continue;
1da177e4	183	}
1198ad00	184	break;
1da177e4 LT	185	case BPF_LD\|BPF_H\|BPF_ABS:
1da177e4 LT	186	k = fentry->k;
e35bedf3	187	load_h:
0b05b2a4 PM	188	ptr = load_pointer(skb, k, 2, &tmp);
0b05b2a4 PM	189	if (ptr != NULL) {
252e3346	190	A = ntohs(get_unaligned((__be16 *)ptr));
0b05b2a4	191	continue;
1da177e4	192	}
1198ad00	193	break;
1da177e4 LT	194	case BPF_LD\|BPF_B\|BPF_ABS:
	195	k = fentry->k;
	196	load_b:
0b05b2a4 PM	197	ptr = load_pointer(skb, k, 1, &tmp);
	198	if (ptr != NULL) {
	199	A = (u8 )ptr;
	200	continue;
1da177e4	201	}
1198ad00	202	break;
1da177e4	203	case BPF_LD\|BPF_W\|BPF_LEN:
3154e540	204	A = skb->len;
1da177e4 LT	205	continue;
1da177e4 LT	206	case BPF_LDX\|BPF_W\|BPF_LEN:
3154e540	207	X = skb->len;
1da177e4 LT	208	continue;
	209	case BPF_LD\|BPF_W\|BPF_IND:
	210	k = X + fentry->k;
	211	goto load_w;
	212	case BPF_LD\|BPF_H\|BPF_IND:
	213	k = X + fentry->k;
	214	goto load_h;
	215	case BPF_LD\|BPF_B\|BPF_IND:
	216	k = X + fentry->k;
	217	goto load_b;
	218	case BPF_LDX\|BPF_B\|BPF_MSH:
0b05b2a4 PM	219	ptr = load_pointer(skb, fentry->k, 1, &tmp);
	220	if (ptr != NULL) {
	221	X = ((u8 )ptr & 0xf) << 2;
	222	continue;
	223	}
	224	return 0;
1da177e4 LT	225	case BPF_LD\|BPF_IMM:
	226	A = fentry->k;
	227	continue;
	228	case BPF_LDX\|BPF_IMM:
	229	X = fentry->k;
	230	continue;
	231	case BPF_LD\|BPF_MEM:
	232	A = mem[fentry->k];
	233	continue;
	234	case BPF_LDX\|BPF_MEM:
	235	X = mem[fentry->k];
	236	continue;
	237	case BPF_MISC\|BPF_TAX:
	238	X = A;
	239	continue;
	240	case BPF_MISC\|BPF_TXA:
	241	A = X;
	242	continue;
	243	case BPF_RET\|BPF_K:
4bad4dc9	244	return fentry->k;
1da177e4	245	case BPF_RET\|BPF_A:
4bad4dc9	246	return A;
1da177e4 LT	247	case BPF_ST:
	248	mem[fentry->k] = A;
	249	continue;
	250	case BPF_STX:
	251	mem[fentry->k] = X;
	252	continue;
	253	default:
93699863	254	WARN_ON(1);
1da177e4 LT	255	return 0;
	256	}
	257
	258	/*
	259	* Handle ancillary data, which are impossible
	260	* (or very difficult) to get parsing packet contents.
	261	*/
	262	switch (k-SKF_AD_OFF) {
	263	case SKF_AD_PROTOCOL:
252e3346	264	A = ntohs(skb->protocol);
1da177e4 LT	265	continue;
	266	case SKF_AD_PKTTYPE:
	267	A = skb->pkt_type;
	268	continue;
	269	case SKF_AD_IFINDEX:
	270	A = skb->dev->ifindex;
	271	continue;
	272	default:
	273	return 0;
	274	}
	275	}
	276
	277	return 0;
	278	}
	279
	280	/**
	281	* sk_chk_filter - verify socket filter code
	282	* @filter: filter to verify
	283	* @flen: length of filter
	284	*
	285	* Check the user's filter code. If we let some ugly
	286	* filter code slip through kaboom! The filter must contain
93699863 KK	287	* no references or jumps that are out of range, no illegal
93699863 KK	288	* instructions, and must end with a RET instruction.
1da177e4	289	*
7b11f69f KK	290	* All jumps are forward as they are not signed.
	291	*
	292	* Returns 0 if the rule set is legal or -EINVAL if not.
1da177e4 LT	293	*/
	294	int sk_chk_filter(struct sock_filter *filter, int flen)
	295	{
	296	struct sock_filter *ftest;
	297	int pc;
	298
1b93ae64	299	if (flen == 0 \|\| flen > BPF_MAXINSNS)
1da177e4 LT	300	return -EINVAL;
	301
	302	/* check the filter code now */
	303	for (pc = 0; pc < flen; pc++) {
1da177e4	304	ftest = &filter[pc];
1da177e4	305
93699863 KK	306	/* Only allow valid instructions */
	307	switch (ftest->code) {
	308	case BPF_ALU\|BPF_ADD\|BPF_K:
	309	case BPF_ALU\|BPF_ADD\|BPF_X:
	310	case BPF_ALU\|BPF_SUB\|BPF_K:
	311	case BPF_ALU\|BPF_SUB\|BPF_X:
	312	case BPF_ALU\|BPF_MUL\|BPF_K:
	313	case BPF_ALU\|BPF_MUL\|BPF_X:
	314	case BPF_ALU\|BPF_DIV\|BPF_X:
	315	case BPF_ALU\|BPF_AND\|BPF_K:
	316	case BPF_ALU\|BPF_AND\|BPF_X:
	317	case BPF_ALU\|BPF_OR\|BPF_K:
	318	case BPF_ALU\|BPF_OR\|BPF_X:
	319	case BPF_ALU\|BPF_LSH\|BPF_K:
	320	case BPF_ALU\|BPF_LSH\|BPF_X:
	321	case BPF_ALU\|BPF_RSH\|BPF_K:
	322	case BPF_ALU\|BPF_RSH\|BPF_X:
	323	case BPF_ALU\|BPF_NEG:
	324	case BPF_LD\|BPF_W\|BPF_ABS:
	325	case BPF_LD\|BPF_H\|BPF_ABS:
	326	case BPF_LD\|BPF_B\|BPF_ABS:
	327	case BPF_LD\|BPF_W\|BPF_LEN:
	328	case BPF_LD\|BPF_W\|BPF_IND:
	329	case BPF_LD\|BPF_H\|BPF_IND:
	330	case BPF_LD\|BPF_B\|BPF_IND:
	331	case BPF_LD\|BPF_IMM:
	332	case BPF_LDX\|BPF_W\|BPF_LEN:
	333	case BPF_LDX\|BPF_B\|BPF_MSH:
	334	case BPF_LDX\|BPF_IMM:
	335	case BPF_MISC\|BPF_TAX:
	336	case BPF_MISC\|BPF_TXA:
	337	case BPF_RET\|BPF_K:
	338	case BPF_RET\|BPF_A:
	339	break;
	340
	341	/* Some instructions need special checks */
fb0d366b	342
93699863 KK	343	case BPF_ALU\|BPF_DIV\|BPF_K:
	344	/* check for division by zero */
	345	if (ftest->k == 0)
1da177e4	346	return -EINVAL;
93699863 KK	347	break;
	348
	349	case BPF_LD\|BPF_MEM:
	350	case BPF_LDX\|BPF_MEM:
	351	case BPF_ST:
	352	case BPF_STX:
	353	/* check for invalid memory addresses */
	354	if (ftest->k >= BPF_MEMWORDS)
	355	return -EINVAL;
	356	break;
	357
	358	case BPF_JMP\|BPF_JA:
	359	/*
	360	* Note, the large ftest->k might cause loops.
	361	* Compare this with conditional jumps below,
	362	* where offsets are limited. --ANK (981016)
	363	*/
	364	if (ftest->k >= (unsigned)(flen-pc-1))
	365	return -EINVAL;
	366	break;
	367
	368	case BPF_JMP\|BPF_JEQ\|BPF_K:
	369	case BPF_JMP\|BPF_JEQ\|BPF_X:
	370	case BPF_JMP\|BPF_JGE\|BPF_K:
	371	case BPF_JMP\|BPF_JGE\|BPF_X:
	372	case BPF_JMP\|BPF_JGT\|BPF_K:
	373	case BPF_JMP\|BPF_JGT\|BPF_X:
	374	case BPF_JMP\|BPF_JSET\|BPF_K:
	375	case BPF_JMP\|BPF_JSET\|BPF_X:
	376	/* for conditionals both must be safe */
e35bedf3	377	if (pc + ftest->jt + 1 >= flen \|\|
93699863 KK	378	pc + ftest->jf + 1 >= flen)
	379	return -EINVAL;
	380	break;
	381
	382	default:
	383	return -EINVAL;
1da177e4 LT	384	}
	385	}
	386
e35bedf3	387	return (BPF_CLASS(filter[flen - 1].code) == BPF_RET) ? 0 : -EINVAL;
1da177e4 LT	388	}
	389
	390	/**
	391	* sk_attach_filter - attach a socket filter
	392	* @fprog: the filter program
	393	* @sk: the socket to use
	394	*
	395	* Attach the user's filter code. We first run some sanity checks on
	396	* it to make sure it does not explode on us later. If an error
	397	* occurs or there is insufficient memory for the filter a negative
	398	* errno code is returned. On success the return is zero.
	399	*/
	400	int sk_attach_filter(struct sock_fprog fprog, struct sock sk)
	401	{
	402	struct sk_filter *fp;
	403	unsigned int fsize = sizeof(struct sock_filter) * fprog->len;
	404	int err;
	405
	406	/* Make sure new filter is there and in the right amounts. */
e35bedf3 KK	407	if (fprog->filter == NULL)
e35bedf3 KK	408	return -EINVAL;
1da177e4 LT	409
	410	fp = sock_kmalloc(sk, fsize+sizeof(*fp), GFP_KERNEL);
	411	if (!fp)
	412	return -ENOMEM;
	413	if (copy_from_user(fp->insns, fprog->filter, fsize)) {
	414	sock_kfree_s(sk, fp, fsize+sizeof(*fp));
	415	return -EFAULT;
	416	}
	417
	418	atomic_set(&fp->refcnt, 1);
	419	fp->len = fprog->len;
	420
	421	err = sk_chk_filter(fp->insns, fp->len);
	422	if (!err) {
	423	struct sk_filter *old_fp;
	424
fda9ef5d DM	425	rcu_read_lock_bh();
	426	old_fp = rcu_dereference(sk->sk_filter);
	427	rcu_assign_pointer(sk->sk_filter, fp);
	428	rcu_read_unlock_bh();
1da177e4 LT	429	fp = old_fp;
	430	}
	431
	432	if (fp)
	433	sk_filter_release(sk, fp);
	434	return err;
	435	}
	436
	437	EXPORT_SYMBOL(sk_chk_filter);
	438	EXPORT_SYMBOL(sk_run_filter);