[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.
 */

#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 <linux/filter.h>

/* No hurry in this branch */
static u8 *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;
}

/**
 *	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.
 */
 
int sk_run_filter(struct sk_buff *skb, struct sock_filter *filter, int flen)
{
	unsigned char *data = skb->data;
	/* len is UNSIGNED. Byte wide insns relies only on implicit
	   type casts to prevent reading arbitrary memory locations.
	 */
	unsigned int len = skb->len-skb->data_len;
	struct sock_filter *fentry;	/* We walk down these */
	u32 A = 0;	   		/* Accumulator */
	u32 X = 0;   			/* Index Register */
	u32 mem[BPF_MEMWORDS];		/* Scratch Memory Store */
	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:
			if (fentry->k == 0)
				return 0;
			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:
			if (k < 0) {
				u8 *ptr;

				if (k >= SKF_AD_OFF)
					break;
				ptr = load_pointer(skb, k);
				if (ptr) {
					A = ntohl(*(u32*)ptr);
					continue;
				}
			} else {
				u32 _tmp, *p;
				p = skb_header_pointer(skb, k, 4, &_tmp);
				if (p != NULL) {
					A = ntohl(*p);
					continue;
				}
			}
			return 0;
		case BPF_LD|BPF_H|BPF_ABS:
			k = fentry->k;
 load_h:
			if (k < 0) {
				u8 *ptr;

				if (k >= SKF_AD_OFF)
					break;
				ptr = load_pointer(skb, k);
				if (ptr) {
					A = ntohs(*(u16*)ptr);
					continue;
				}
			} else {
				u16 _tmp, *p;
				p = skb_header_pointer(skb, k, 2, &_tmp);
				if (p != NULL) {
					A = ntohs(*p);
					continue;
				}
			}
			return 0;
		case BPF_LD|BPF_B|BPF_ABS:
			k = fentry->k;
load_b:
			if (k < 0) {
				u8 *ptr;

				if (k >= SKF_AD_OFF)
					break;
				ptr = load_pointer(skb, k);
				if (ptr) {
					A = *ptr;
					continue;
				}
			} else {
				u8 _tmp, *p;
				p = skb_header_pointer(skb, k, 1, &_tmp);
				if (p != NULL) {
					A = *p;
					continue;
				}
			}
			return 0;
		case BPF_LD|BPF_W|BPF_LEN:
			A = len;
			continue;
		case BPF_LDX|BPF_W|BPF_LEN:
			X = 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:
			if (fentry->k >= len)
				return 0;
			X = (data[fentry->k] & 0xf) << 2;
			continue;
		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 ((unsigned int)fentry->k);
		case BPF_RET|BPF_A:
			return ((unsigned int)A);
		case BPF_ST:
			mem[fentry->k] = A;
			continue;
		case BPF_STX:
			mem[fentry->k] = X;
			continue;
		default:
			/* Invalid instruction counts as RET */
			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 = htons(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 no backward jumps. It must end with a RET instruction
 *
 * Returns 0 if the rule set is legal or a negative errno code if not.
 */
int sk_chk_filter(struct sock_filter *filter, int flen)
{
	struct sock_filter *ftest;
	int pc;

	if (((unsigned int)flen >= (~0U / sizeof(struct sock_filter))) || flen == 0)
		return -EINVAL;

	/* check the filter code now */
	for (pc = 0; pc < flen; pc++) {
		/* all jumps are forward as they are not signed */
		ftest = &filter[pc];
		if (BPF_CLASS(ftest->code) == BPF_JMP) {
			/* but they mustn't jump off the end */
			if (BPF_OP(ftest->code) == 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;
			} else {
				/* for conditionals both must be safe */
 				if (pc + ftest->jt +1 >= flen ||
				    pc + ftest->jf +1 >= flen)
					return -EINVAL;
			}
		}

		/* check that memory operations use valid addresses. */
		if (ftest->k >= BPF_MEMWORDS) {
			/* but it might not be a memory operation... */
			switch (ftest->code) {
			case BPF_ST:	
			case BPF_STX:	
			case BPF_LD|BPF_MEM:	
			case BPF_LDX|BPF_MEM:	
				return -EINVAL;
			}
		}
	}

	/*
	 * The program must end with a return. We don't care where they
	 * jumped within the script (its always forwards) but in the end
	 * they _will_ hit this.
	 */
        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 || fprog->len > BPF_MAXINSNS)
                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;

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