2 * Copyright (C) 2002-2003 NetGroup, Politecnico di Torino (Italy)
3 * Copyright (C) 2005-2009 Jung-uk Kim <jkim@FreeBSD.org>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the Politecnico di Torino nor the names of its
16 * contributors may be used to endorse or promote products derived from
17 * this software without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
37 #include <sys/param.h>
38 #include <sys/systm.h>
39 #include <sys/kernel.h>
40 #include <sys/socket.h>
41 #include <sys/malloc.h>
48 #include <sys/param.h>
51 #include <sys/types.h>
54 #include <net/bpf_jitter.h>
56 #include <amd64/amd64/bpf_jit_machdep.h>
58 bpf_filter_func bpf_jit_compile(struct bpf_insn *, u_int, size_t *);
61 * Emit routine to update the jump table.
64 emit_length(bpf_bin_stream *stream, __unused u_int value, u_int len)
67 if (stream->refs != NULL)
68 (stream->refs)[stream->bpf_pc] += len;
69 stream->cur_ip += len;
73 * Emit routine to output the actual binary code.
76 emit_code(bpf_bin_stream *stream, u_int value, u_int len)
81 stream->ibuf[stream->cur_ip] = (u_char)value;
86 *((u_short *)(stream->ibuf + stream->cur_ip)) = (u_short)value;
91 *((u_int *)(stream->ibuf + stream->cur_ip)) = value;
100 * Scan the filter program and find possible optimization.
103 bpf_jit_optimize(struct bpf_insn *prog, u_int nins)
108 /* Do we return immediately? */
109 if (BPF_CLASS(prog[0].code) == BPF_RET)
110 return (BPF_JIT_FRET);
112 for (flags = 0, i = 0; i < nins; i++) {
113 switch (prog[i].code) {
114 case BPF_LD|BPF_W|BPF_ABS:
115 case BPF_LD|BPF_H|BPF_ABS:
116 case BPF_LD|BPF_B|BPF_ABS:
117 case BPF_LD|BPF_W|BPF_IND:
118 case BPF_LD|BPF_H|BPF_IND:
119 case BPF_LD|BPF_B|BPF_IND:
120 case BPF_LDX|BPF_MSH|BPF_B:
121 flags |= BPF_JIT_FPKT;
124 case BPF_LDX|BPF_MEM:
127 flags |= BPF_JIT_FMEM;
129 case BPF_LD|BPF_W|BPF_LEN:
130 case BPF_LDX|BPF_W|BPF_LEN:
131 flags |= BPF_JIT_FLEN;
134 case BPF_JMP|BPF_JGT|BPF_K:
135 case BPF_JMP|BPF_JGE|BPF_K:
136 case BPF_JMP|BPF_JEQ|BPF_K:
137 case BPF_JMP|BPF_JSET|BPF_K:
138 case BPF_JMP|BPF_JGT|BPF_X:
139 case BPF_JMP|BPF_JGE|BPF_X:
140 case BPF_JMP|BPF_JEQ|BPF_X:
141 case BPF_JMP|BPF_JSET|BPF_X:
142 flags |= BPF_JIT_FJMP;
145 if (flags == BPF_JIT_FLAG_ALL)
153 * Function that does the real stuff.
156 bpf_jit_compile(struct bpf_insn *prog, u_int nins, size_t *size)
158 bpf_bin_stream stream;
159 struct bpf_insn *ins;
160 int flags, fret, fpkt, fmem, fjmp, flen;
164 * NOTE: Do not modify the name of this variable, as it's used by
165 * the macros to emit code.
169 flags = bpf_jit_optimize(prog, nins);
170 fret = (flags & BPF_JIT_FRET) != 0;
171 fpkt = (flags & BPF_JIT_FPKT) != 0;
172 fmem = (flags & BPF_JIT_FMEM) != 0;
173 fjmp = (flags & BPF_JIT_FJMP) != 0;
174 flen = (flags & BPF_JIT_FLEN) != 0;
179 memset(&stream, 0, sizeof(stream));
181 /* Allocate the reference table for the jumps. */
184 stream.refs = malloc((nins + 1) * sizeof(u_int), M_BPFJIT,
187 stream.refs = calloc(nins + 1, sizeof(u_int));
189 if (stream.refs == NULL)
194 * The first pass will emit the lengths of the instructions
195 * to create the reference table.
199 for (pass = 0; pass < 2; pass++) {
202 /* Create the procedure header. */
206 SUBib(BPF_MEMWORDS * sizeof(uint32_t), RSP);
215 for (i = 0; i < nins; i++) {
239 case BPF_LD|BPF_W|BPF_ABS:
245 CMPid(sizeof(int32_t), ECX);
256 MOVobd(RCX, RSI, EAX);
260 case BPF_LD|BPF_H|BPF_ABS:
267 CMPid(sizeof(int16_t), ECX);
275 MOVobw(RCX, RSI, AX);
279 case BPF_LD|BPF_B|BPF_ABS:
290 MOVobb(RCX, RSI, AL);
293 case BPF_LD|BPF_W|BPF_LEN:
297 case BPF_LDX|BPF_W|BPF_LEN:
301 case BPF_LD|BPF_W|BPF_IND:
312 CMPid(sizeof(int32_t), ECX);
323 MOVobd(RCX, RSI, EAX);
327 case BPF_LD|BPF_H|BPF_IND:
339 CMPid(sizeof(int16_t), ECX);
347 MOVobw(RCX, RSI, AX);
351 case BPF_LD|BPF_B|BPF_IND:
367 MOVobb(RCX, RSI, AL);
370 case BPF_LDX|BPF_MSH|BPF_B:
384 MOVobb(RCX, RSI, DL);
393 case BPF_LDX|BPF_IMM:
398 MOVid(ins->k * sizeof(uint32_t), ESI);
399 MOVobd(RSP, RSI, EAX);
402 case BPF_LDX|BPF_MEM:
403 MOVid(ins->k * sizeof(uint32_t), ESI);
404 MOVobd(RSP, RSI, EDX);
409 * XXX this command and the following could
410 * be optimized if the previous instruction
411 * was already of this type
413 MOVid(ins->k * sizeof(uint32_t), ESI);
414 MOVomd(EAX, RSP, RSI);
418 MOVid(ins->k * sizeof(uint32_t), ESI);
419 MOVomd(EDX, RSP, RSI);
426 case BPF_JMP|BPF_JGT|BPF_K:
427 if (ins->jt == ins->jf) {
435 case BPF_JMP|BPF_JGE|BPF_K:
436 if (ins->jt == ins->jf) {
444 case BPF_JMP|BPF_JEQ|BPF_K:
445 if (ins->jt == ins->jf) {
453 case BPF_JMP|BPF_JSET|BPF_K:
454 if (ins->jt == ins->jf) {
462 case BPF_JMP|BPF_JGT|BPF_X:
463 if (ins->jt == ins->jf) {
471 case BPF_JMP|BPF_JGE|BPF_X:
472 if (ins->jt == ins->jf) {
480 case BPF_JMP|BPF_JEQ|BPF_X:
481 if (ins->jt == ins->jf) {
489 case BPF_JMP|BPF_JSET|BPF_X:
490 if (ins->jt == ins->jf) {
498 case BPF_ALU|BPF_ADD|BPF_X:
502 case BPF_ALU|BPF_SUB|BPF_X:
506 case BPF_ALU|BPF_MUL|BPF_X:
512 case BPF_ALU|BPF_DIV|BPF_X:
529 case BPF_ALU|BPF_AND|BPF_X:
533 case BPF_ALU|BPF_OR|BPF_X:
537 case BPF_ALU|BPF_LSH|BPF_X:
542 case BPF_ALU|BPF_RSH|BPF_X:
547 case BPF_ALU|BPF_ADD|BPF_K:
551 case BPF_ALU|BPF_SUB|BPF_K:
555 case BPF_ALU|BPF_MUL|BPF_K:
562 case BPF_ALU|BPF_DIV|BPF_K:
570 case BPF_ALU|BPF_AND|BPF_K:
574 case BPF_ALU|BPF_OR|BPF_K:
578 case BPF_ALU|BPF_LSH|BPF_K:
579 SHLib((ins->k) & 0xff, EAX);
582 case BPF_ALU|BPF_RSH|BPF_K:
583 SHRib((ins->k) & 0xff, EAX);
586 case BPF_ALU|BPF_NEG:
590 case BPF_MISC|BPF_TAX:
594 case BPF_MISC|BPF_TXA:
604 *size = stream.cur_ip;
606 stream.ibuf = malloc(*size, M_BPFJIT, M_NOWAIT);
607 if (stream.ibuf == NULL)
610 stream.ibuf = mmap(NULL, *size, PROT_READ | PROT_WRITE,
612 if (stream.ibuf == MAP_FAILED) {
619 * Modify the reference table to contain the offsets and
620 * not the lengths of the instructions.
623 for (i = 1; i < nins + 1; i++)
624 stream.refs[i] += stream.refs[i - 1];
626 /* Reset the counters. */
630 /* The second pass creates the actual code. */
635 * The reference table is needed only during compilation,
636 * now we can free it.
640 free(stream.refs, M_BPFJIT);
646 if (stream.ibuf != NULL &&
647 mprotect(stream.ibuf, *size, PROT_READ | PROT_EXEC) != 0) {
648 munmap(stream.ibuf, *size);
653 return ((bpf_filter_func)stream.ibuf);