1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/*-
* Copyright (C) 2008 Jung-uk Kim <jkim@FreeBSD.org>. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <net/bpf.h>
#include BPF_TEST_H
#define PASSED 0
#define FAILED 1
#define FATAL -1
#ifndef LOG_LEVEL
#define LOG_LEVEL 1
#endif
static void sig_handler(int);
static int nins = sizeof(pc) / sizeof(pc[0]);
static int verbose = LOG_LEVEL;
#ifdef BPF_JIT_COMPILER
#include <string.h>
#include <net/bpf_jitter.h>
bpf_filter_func bpf_jit_compile(struct bpf_insn *, u_int, int *);
static u_int
bpf_compile_and_filter(void)
{
bpf_jit_filter filter;
u_int ret;
/* Do not use BPF JIT compiler for an empty program */
if (nins == 0)
return (0);
/* Create the binary */
if ((filter.func = bpf_jit_compile(pc, nins, filter.mem)) == NULL) {
if (verbose > 1)
printf("Failed to allocate memory:\t");
if (verbose > 0)
printf("FATAL\n");
exit(FATAL);
}
ret = (*(filter.func))(pkt, wirelen, buflen);
free(filter.func);
return (ret);
}
#else
u_int bpf_filter(struct bpf_insn *, u_char *, u_int, u_int);
#endif
#ifdef BPF_VALIDATE
/*
* XXX Copied from sys/net/bpf_filter.c and modified.
*
* Return true if the 'fcode' is a valid filter program.
* The constraints are that each jump be forward and to a valid
* code. The code must terminate with either an accept or reject.
*
* The kernel needs to be able to verify an application's filter code.
* Otherwise, a bogus program could easily crash the system.
*/
static int
bpf_validate(const struct bpf_insn *f, int len)
{
register int i;
register const struct bpf_insn *p;
/* Do not accept negative length filter. */
if (len < 0)
return (0);
/* An empty filter means accept all. */
if (len == 0)
return (1);
for (i = 0; i < len; ++i) {
/*
* Check that that jumps are forward, and within
* the code block.
*/
p = &f[i];
if (BPF_CLASS(p->code) == BPF_JMP) {
register int from = i + 1;
if (BPF_OP(p->code) == BPF_JA) {
if (from >= len || p->k >= (u_int)len - from)
return (0);
}
else if (from >= len || p->jt >= len - from ||
p->jf >= len - from)
return (0);
}
/*
* Check that memory operations use valid addresses.
*/
if ((BPF_CLASS(p->code) == BPF_ST ||
(BPF_CLASS(p->code) == BPF_LD &&
(p->code & 0xe0) == BPF_MEM)) &&
p->k >= BPF_MEMWORDS)
return (0);
/*
* Check for constant division by 0.
*/
if (p->code == (BPF_ALU|BPF_DIV|BPF_K) && p->k == 0)
return (0);
}
return (BPF_CLASS(f[len - 1].code) == BPF_RET);
}
#endif
int
main(void)
{
u_int ret;
int sig;
#ifdef BPF_VALIDATE
int valid;
#endif
/* Try to catch all signals */
for (sig = SIGHUP; sig <= SIGUSR2; sig++)
signal(sig, sig_handler);
#ifdef BPF_VALIDATE
valid = bpf_validate(pc, nins);
if (valid != 0 && invalid != 0) {
if (verbose > 1)
printf("Validated invalid instructions:\t");
if (verbose > 0)
printf("FAILED\n");
return (FAILED);
} else if (valid == 0 && invalid == 0) {
if (verbose > 1)
printf("Invalidated valid instructions:\t");
if (verbose > 0)
printf("FAILED\n");
return (FAILED);
}
#endif
#ifdef BPF_JIT_COMPILER
ret = bpf_compile_and_filter();
#else
ret = bpf_filter(pc, pkt, wirelen, buflen);
#endif
if (ret != expect) {
if (verbose > 1)
printf("Expected 0x%x but got 0x%x:\t", expect, ret);
if (verbose > 0)
printf("FAILED\n");
return (FAILED);
}
if (verbose > 1)
printf("Expected and got 0x%x:\t", ret);
if (verbose > 0)
printf("PASSED\n");
return (PASSED);
}
static void
sig_handler(int sig)
{
if (expect_signal == 0) {
if (verbose > 1)
printf("Received unexpected signal %d:\t", sig);
if (verbose > 0)
printf("FATAL\n");
exit(FATAL);
}
if (expect_signal != sig) {
if (verbose > 1)
printf("Expected signal %d but got %d:\t",
expect_signal, sig);
if (verbose > 0)
printf("FAILED\n");
exit(FAILED);
}
if (verbose > 1)
printf("Expected and got signal %d:\t", sig);
if (verbose > 0)
printf("PASSED\n");
exit(PASSED);
}
|
