2 * Linux Socket Filter - Kernel level socket filtering
5 * Jay Schulist <jschlst@samba.org>
7 * Based on the design of:
8 * - The Berkeley Packet Filter
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.
15 * Andi Kleen - Fix a few bad bugs and races.
18 #include <linux/module.h>
19 #include <linux/types.h>
20 #include <linux/sched.h>
22 #include <linux/fcntl.h>
23 #include <linux/socket.h>
25 #include <linux/inet.h>
26 #include <linux/netdevice.h>
27 #include <linux/if_packet.h>
29 #include <net/protocol.h>
30 #include <linux/skbuff.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>
38 /* No hurry in this branch */
39 static u8 *load_pointer(struct sk_buff *skb, int k)
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;
48 if (ptr >= skb->head && ptr < skb->tail)
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
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.
65 int sk_run_filter(struct sk_buff *skb, struct sock_filter *filter, int flen)
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.
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 */
80 * Process array of filter instructions.
82 for (pc = 0; pc < flen; pc++) {
85 switch (fentry->code) {
86 case BPF_ALU|BPF_ADD|BPF_X:
89 case BPF_ALU|BPF_ADD|BPF_K:
92 case BPF_ALU|BPF_SUB|BPF_X:
95 case BPF_ALU|BPF_SUB|BPF_K:
98 case BPF_ALU|BPF_MUL|BPF_X:
101 case BPF_ALU|BPF_MUL|BPF_K:
104 case BPF_ALU|BPF_DIV|BPF_X:
109 case BPF_ALU|BPF_DIV|BPF_K:
114 case BPF_ALU|BPF_AND|BPF_X:
117 case BPF_ALU|BPF_AND|BPF_K:
120 case BPF_ALU|BPF_OR|BPF_X:
123 case BPF_ALU|BPF_OR|BPF_K:
126 case BPF_ALU|BPF_LSH|BPF_X:
129 case BPF_ALU|BPF_LSH|BPF_K:
132 case BPF_ALU|BPF_RSH|BPF_X:
135 case BPF_ALU|BPF_RSH|BPF_K:
138 case BPF_ALU|BPF_NEG:
144 case BPF_JMP|BPF_JGT|BPF_K:
145 pc += (A > fentry->k) ? fentry->jt : fentry->jf;
147 case BPF_JMP|BPF_JGE|BPF_K:
148 pc += (A >= fentry->k) ? fentry->jt : fentry->jf;
150 case BPF_JMP|BPF_JEQ|BPF_K:
151 pc += (A == fentry->k) ? fentry->jt : fentry->jf;
153 case BPF_JMP|BPF_JSET|BPF_K:
154 pc += (A & fentry->k) ? fentry->jt : fentry->jf;
156 case BPF_JMP|BPF_JGT|BPF_X:
157 pc += (A > X) ? fentry->jt : fentry->jf;
159 case BPF_JMP|BPF_JGE|BPF_X:
160 pc += (A >= X) ? fentry->jt : fentry->jf;
162 case BPF_JMP|BPF_JEQ|BPF_X:
163 pc += (A == X) ? fentry->jt : fentry->jf;
165 case BPF_JMP|BPF_JSET|BPF_X:
166 pc += (A & X) ? fentry->jt : fentry->jf;
168 case BPF_LD|BPF_W|BPF_ABS:
171 if (k >= 0 && (unsigned int)(k+sizeof(u32)) <= len) {
172 A = ntohl(*(u32*)&data[k]);
180 ptr = load_pointer(skb, k);
182 A = ntohl(*(u32*)ptr);
187 if (!skb_copy_bits(skb, k, &tmp, 4)) {
193 case BPF_LD|BPF_H|BPF_ABS:
196 if (k >= 0 && (unsigned int)(k + sizeof(u16)) <= len) {
197 A = ntohs(*(u16*)&data[k]);
205 ptr = load_pointer(skb, k);
207 A = ntohs(*(u16*)ptr);
212 if (!skb_copy_bits(skb, k, &tmp, 2)) {
218 case BPF_LD|BPF_B|BPF_ABS:
221 if (k >= 0 && (unsigned int)k < len) {
230 ptr = load_pointer(skb, k);
237 if (!skb_copy_bits(skb, k, &tmp, 1)) {
243 case BPF_LD|BPF_W|BPF_LEN:
246 case BPF_LDX|BPF_W|BPF_LEN:
249 case BPF_LD|BPF_W|BPF_IND:
252 case BPF_LD|BPF_H|BPF_IND:
255 case BPF_LD|BPF_B|BPF_IND:
258 case BPF_LDX|BPF_B|BPF_MSH:
259 if (fentry->k >= len)
261 X = (data[fentry->k] & 0xf) << 2;
266 case BPF_LDX|BPF_IMM:
272 case BPF_LDX|BPF_MEM:
275 case BPF_MISC|BPF_TAX:
278 case BPF_MISC|BPF_TXA:
282 return ((unsigned int)fentry->k);
284 return ((unsigned int)A);
292 /* Invalid instruction counts as RET */
297 * Handle ancillary data, which are impossible
298 * (or very difficult) to get parsing packet contents.
300 switch (k-SKF_AD_OFF) {
301 case SKF_AD_PROTOCOL:
302 A = htons(skb->protocol);
308 A = skb->dev->ifindex;
319 * sk_chk_filter - verify socket filter code
320 * @filter: filter to verify
321 * @flen: length of filter
323 * Check the user's filter code. If we let some ugly
324 * filter code slip through kaboom! The filter must contain
325 * no references or jumps that are out of range, no illegal instructions
326 * and no backward jumps. It must end with a RET instruction
328 * Returns 0 if the rule set is legal or a negative errno code if not.
330 int sk_chk_filter(struct sock_filter *filter, int flen)
332 struct sock_filter *ftest;
335 if (((unsigned int)flen >= (~0U / sizeof(struct sock_filter))) || flen == 0)
338 /* check the filter code now */
339 for (pc = 0; pc < flen; pc++) {
340 /* all jumps are forward as they are not signed */
342 if (BPF_CLASS(ftest->code) == BPF_JMP) {
343 /* but they mustn't jump off the end */
344 if (BPF_OP(ftest->code) == BPF_JA) {
346 * Note, the large ftest->k might cause loops.
347 * Compare this with conditional jumps below,
348 * where offsets are limited. --ANK (981016)
350 if (ftest->k >= (unsigned)(flen-pc-1))
353 /* for conditionals both must be safe */
354 if (pc + ftest->jt +1 >= flen ||
355 pc + ftest->jf +1 >= flen)
360 /* check that memory operations use valid addresses. */
361 if (ftest->k >= BPF_MEMWORDS) {
362 /* but it might not be a memory operation... */
363 switch (ftest->code) {
367 case BPF_LDX|BPF_MEM:
374 * The program must end with a return. We don't care where they
375 * jumped within the script (its always forwards) but in the end
376 * they _will_ hit this.
378 return (BPF_CLASS(filter[flen - 1].code) == BPF_RET) ? 0 : -EINVAL;
382 * sk_attach_filter - attach a socket filter
383 * @fprog: the filter program
384 * @sk: the socket to use
386 * Attach the user's filter code. We first run some sanity checks on
387 * it to make sure it does not explode on us later. If an error
388 * occurs or there is insufficient memory for the filter a negative
389 * errno code is returned. On success the return is zero.
391 int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk)
393 struct sk_filter *fp;
394 unsigned int fsize = sizeof(struct sock_filter) * fprog->len;
397 /* Make sure new filter is there and in the right amounts. */
398 if (fprog->filter == NULL || fprog->len > BPF_MAXINSNS)
401 fp = sock_kmalloc(sk, fsize+sizeof(*fp), GFP_KERNEL);
404 if (copy_from_user(fp->insns, fprog->filter, fsize)) {
405 sock_kfree_s(sk, fp, fsize+sizeof(*fp));
409 atomic_set(&fp->refcnt, 1);
410 fp->len = fprog->len;
412 err = sk_chk_filter(fp->insns, fp->len);
414 struct sk_filter *old_fp;
416 spin_lock_bh(&sk->sk_lock.slock);
417 old_fp = sk->sk_filter;
419 spin_unlock_bh(&sk->sk_lock.slock);
424 sk_filter_release(sk, fp);
428 EXPORT_SYMBOL(sk_chk_filter);
429 EXPORT_SYMBOL(sk_run_filter);