]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Linux Socket Filter Data Structures | |
3 | */ | |
1da177e4 LT |
4 | #ifndef __LINUX_FILTER_H__ |
5 | #define __LINUX_FILTER_H__ | |
6 | ||
b954d834 DB |
7 | #include <stdarg.h> |
8 | ||
60063497 | 9 | #include <linux/atomic.h> |
0c5fe1b4 | 10 | #include <linux/compat.h> |
9f12fbe6 | 11 | #include <linux/skbuff.h> |
b954d834 DB |
12 | #include <linux/linkage.h> |
13 | #include <linux/printk.h> | |
d45ed4a4 | 14 | #include <linux/workqueue.h> |
b13138ef | 15 | #include <linux/sched.h> |
4f3446bb | 16 | #include <linux/capability.h> |
7bd509e3 | 17 | #include <linux/cryptohash.h> |
4f3446bb | 18 | |
ff936a04 | 19 | #include <net/sch_generic.h> |
b954d834 | 20 | |
60a3b225 | 21 | #include <asm/cacheflush.h> |
b954d834 DB |
22 | |
23 | #include <uapi/linux/filter.h> | |
daedfb22 | 24 | #include <uapi/linux/bpf.h> |
60a3b225 DB |
25 | |
26 | struct sk_buff; | |
27 | struct sock; | |
28 | struct seccomp_data; | |
09756af4 | 29 | struct bpf_prog_aux; |
792d4b5c | 30 | |
30743837 DB |
31 | /* ArgX, context and stack frame pointer register positions. Note, |
32 | * Arg1, Arg2, Arg3, etc are used as argument mappings of function | |
33 | * calls in BPF_CALL instruction. | |
34 | */ | |
35 | #define BPF_REG_ARG1 BPF_REG_1 | |
36 | #define BPF_REG_ARG2 BPF_REG_2 | |
37 | #define BPF_REG_ARG3 BPF_REG_3 | |
38 | #define BPF_REG_ARG4 BPF_REG_4 | |
39 | #define BPF_REG_ARG5 BPF_REG_5 | |
40 | #define BPF_REG_CTX BPF_REG_6 | |
41 | #define BPF_REG_FP BPF_REG_10 | |
42 | ||
43 | /* Additional register mappings for converted user programs. */ | |
44 | #define BPF_REG_A BPF_REG_0 | |
45 | #define BPF_REG_X BPF_REG_7 | |
46 | #define BPF_REG_TMP BPF_REG_8 | |
bd4cf0ed | 47 | |
4f3446bb DB |
48 | /* Kernel hidden auxiliary/helper register for hardening step. |
49 | * Only used by eBPF JITs. It's nothing more than a temporary | |
50 | * register that JITs use internally, only that here it's part | |
51 | * of eBPF instructions that have been rewritten for blinding | |
52 | * constants. See JIT pre-step in bpf_jit_blind_constants(). | |
53 | */ | |
54 | #define BPF_REG_AX MAX_BPF_REG | |
55 | #define MAX_BPF_JIT_REG (MAX_BPF_REG + 1) | |
56 | ||
bd4cf0ed AS |
57 | /* BPF program can access up to 512 bytes of stack space. */ |
58 | #define MAX_BPF_STACK 512 | |
59 | ||
f1f7714e DB |
60 | #define BPF_TAG_SIZE 8 |
61 | ||
f8f6d679 DB |
62 | /* Helper macros for filter block array initializers. */ |
63 | ||
e430f34e | 64 | /* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */ |
f8f6d679 | 65 | |
e430f34e | 66 | #define BPF_ALU64_REG(OP, DST, SRC) \ |
2695fb55 | 67 | ((struct bpf_insn) { \ |
f8f6d679 | 68 | .code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \ |
e430f34e AS |
69 | .dst_reg = DST, \ |
70 | .src_reg = SRC, \ | |
f8f6d679 DB |
71 | .off = 0, \ |
72 | .imm = 0 }) | |
73 | ||
e430f34e | 74 | #define BPF_ALU32_REG(OP, DST, SRC) \ |
2695fb55 | 75 | ((struct bpf_insn) { \ |
f8f6d679 | 76 | .code = BPF_ALU | BPF_OP(OP) | BPF_X, \ |
e430f34e AS |
77 | .dst_reg = DST, \ |
78 | .src_reg = SRC, \ | |
f8f6d679 DB |
79 | .off = 0, \ |
80 | .imm = 0 }) | |
81 | ||
e430f34e | 82 | /* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */ |
f8f6d679 | 83 | |
e430f34e | 84 | #define BPF_ALU64_IMM(OP, DST, IMM) \ |
2695fb55 | 85 | ((struct bpf_insn) { \ |
f8f6d679 | 86 | .code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \ |
e430f34e AS |
87 | .dst_reg = DST, \ |
88 | .src_reg = 0, \ | |
f8f6d679 DB |
89 | .off = 0, \ |
90 | .imm = IMM }) | |
91 | ||
e430f34e | 92 | #define BPF_ALU32_IMM(OP, DST, IMM) \ |
2695fb55 | 93 | ((struct bpf_insn) { \ |
f8f6d679 | 94 | .code = BPF_ALU | BPF_OP(OP) | BPF_K, \ |
e430f34e AS |
95 | .dst_reg = DST, \ |
96 | .src_reg = 0, \ | |
f8f6d679 DB |
97 | .off = 0, \ |
98 | .imm = IMM }) | |
99 | ||
100 | /* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */ | |
101 | ||
e430f34e | 102 | #define BPF_ENDIAN(TYPE, DST, LEN) \ |
2695fb55 | 103 | ((struct bpf_insn) { \ |
f8f6d679 | 104 | .code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \ |
e430f34e AS |
105 | .dst_reg = DST, \ |
106 | .src_reg = 0, \ | |
f8f6d679 DB |
107 | .off = 0, \ |
108 | .imm = LEN }) | |
109 | ||
e430f34e | 110 | /* Short form of mov, dst_reg = src_reg */ |
f8f6d679 | 111 | |
e430f34e | 112 | #define BPF_MOV64_REG(DST, SRC) \ |
2695fb55 | 113 | ((struct bpf_insn) { \ |
f8f6d679 | 114 | .code = BPF_ALU64 | BPF_MOV | BPF_X, \ |
e430f34e AS |
115 | .dst_reg = DST, \ |
116 | .src_reg = SRC, \ | |
f8f6d679 DB |
117 | .off = 0, \ |
118 | .imm = 0 }) | |
119 | ||
e430f34e | 120 | #define BPF_MOV32_REG(DST, SRC) \ |
2695fb55 | 121 | ((struct bpf_insn) { \ |
f8f6d679 | 122 | .code = BPF_ALU | BPF_MOV | BPF_X, \ |
e430f34e AS |
123 | .dst_reg = DST, \ |
124 | .src_reg = SRC, \ | |
f8f6d679 DB |
125 | .off = 0, \ |
126 | .imm = 0 }) | |
127 | ||
e430f34e | 128 | /* Short form of mov, dst_reg = imm32 */ |
f8f6d679 | 129 | |
e430f34e | 130 | #define BPF_MOV64_IMM(DST, IMM) \ |
2695fb55 | 131 | ((struct bpf_insn) { \ |
f8f6d679 | 132 | .code = BPF_ALU64 | BPF_MOV | BPF_K, \ |
e430f34e AS |
133 | .dst_reg = DST, \ |
134 | .src_reg = 0, \ | |
f8f6d679 DB |
135 | .off = 0, \ |
136 | .imm = IMM }) | |
137 | ||
e430f34e | 138 | #define BPF_MOV32_IMM(DST, IMM) \ |
2695fb55 | 139 | ((struct bpf_insn) { \ |
f8f6d679 | 140 | .code = BPF_ALU | BPF_MOV | BPF_K, \ |
e430f34e AS |
141 | .dst_reg = DST, \ |
142 | .src_reg = 0, \ | |
f8f6d679 DB |
143 | .off = 0, \ |
144 | .imm = IMM }) | |
145 | ||
02ab695b AS |
146 | /* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */ |
147 | #define BPF_LD_IMM64(DST, IMM) \ | |
148 | BPF_LD_IMM64_RAW(DST, 0, IMM) | |
149 | ||
150 | #define BPF_LD_IMM64_RAW(DST, SRC, IMM) \ | |
151 | ((struct bpf_insn) { \ | |
152 | .code = BPF_LD | BPF_DW | BPF_IMM, \ | |
153 | .dst_reg = DST, \ | |
154 | .src_reg = SRC, \ | |
155 | .off = 0, \ | |
156 | .imm = (__u32) (IMM) }), \ | |
157 | ((struct bpf_insn) { \ | |
158 | .code = 0, /* zero is reserved opcode */ \ | |
159 | .dst_reg = 0, \ | |
160 | .src_reg = 0, \ | |
161 | .off = 0, \ | |
162 | .imm = ((__u64) (IMM)) >> 32 }) | |
163 | ||
0246e64d AS |
164 | /* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */ |
165 | #define BPF_LD_MAP_FD(DST, MAP_FD) \ | |
166 | BPF_LD_IMM64_RAW(DST, BPF_PSEUDO_MAP_FD, MAP_FD) | |
167 | ||
e430f34e | 168 | /* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */ |
f8f6d679 | 169 | |
e430f34e | 170 | #define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \ |
2695fb55 | 171 | ((struct bpf_insn) { \ |
f8f6d679 | 172 | .code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \ |
e430f34e AS |
173 | .dst_reg = DST, \ |
174 | .src_reg = SRC, \ | |
f8f6d679 DB |
175 | .off = 0, \ |
176 | .imm = IMM }) | |
177 | ||
e430f34e | 178 | #define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \ |
2695fb55 | 179 | ((struct bpf_insn) { \ |
f8f6d679 | 180 | .code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \ |
e430f34e AS |
181 | .dst_reg = DST, \ |
182 | .src_reg = SRC, \ | |
f8f6d679 DB |
183 | .off = 0, \ |
184 | .imm = IMM }) | |
185 | ||
e430f34e | 186 | /* Direct packet access, R0 = *(uint *) (skb->data + imm32) */ |
f8f6d679 | 187 | |
e430f34e | 188 | #define BPF_LD_ABS(SIZE, IMM) \ |
2695fb55 | 189 | ((struct bpf_insn) { \ |
f8f6d679 | 190 | .code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \ |
e430f34e AS |
191 | .dst_reg = 0, \ |
192 | .src_reg = 0, \ | |
f8f6d679 | 193 | .off = 0, \ |
e430f34e | 194 | .imm = IMM }) |
f8f6d679 | 195 | |
e430f34e | 196 | /* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */ |
f8f6d679 | 197 | |
e430f34e | 198 | #define BPF_LD_IND(SIZE, SRC, IMM) \ |
2695fb55 | 199 | ((struct bpf_insn) { \ |
f8f6d679 | 200 | .code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \ |
e430f34e AS |
201 | .dst_reg = 0, \ |
202 | .src_reg = SRC, \ | |
f8f6d679 | 203 | .off = 0, \ |
e430f34e | 204 | .imm = IMM }) |
f8f6d679 | 205 | |
e430f34e | 206 | /* Memory load, dst_reg = *(uint *) (src_reg + off16) */ |
f8f6d679 | 207 | |
e430f34e | 208 | #define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \ |
2695fb55 | 209 | ((struct bpf_insn) { \ |
f8f6d679 | 210 | .code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \ |
e430f34e AS |
211 | .dst_reg = DST, \ |
212 | .src_reg = SRC, \ | |
f8f6d679 DB |
213 | .off = OFF, \ |
214 | .imm = 0 }) | |
215 | ||
e430f34e AS |
216 | /* Memory store, *(uint *) (dst_reg + off16) = src_reg */ |
217 | ||
218 | #define BPF_STX_MEM(SIZE, DST, SRC, OFF) \ | |
2695fb55 | 219 | ((struct bpf_insn) { \ |
f8f6d679 | 220 | .code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \ |
e430f34e AS |
221 | .dst_reg = DST, \ |
222 | .src_reg = SRC, \ | |
f8f6d679 DB |
223 | .off = OFF, \ |
224 | .imm = 0 }) | |
225 | ||
cffc642d MH |
226 | /* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */ |
227 | ||
228 | #define BPF_STX_XADD(SIZE, DST, SRC, OFF) \ | |
229 | ((struct bpf_insn) { \ | |
230 | .code = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD, \ | |
231 | .dst_reg = DST, \ | |
232 | .src_reg = SRC, \ | |
233 | .off = OFF, \ | |
234 | .imm = 0 }) | |
235 | ||
e430f34e AS |
236 | /* Memory store, *(uint *) (dst_reg + off16) = imm32 */ |
237 | ||
238 | #define BPF_ST_MEM(SIZE, DST, OFF, IMM) \ | |
2695fb55 | 239 | ((struct bpf_insn) { \ |
e430f34e AS |
240 | .code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \ |
241 | .dst_reg = DST, \ | |
242 | .src_reg = 0, \ | |
243 | .off = OFF, \ | |
244 | .imm = IMM }) | |
245 | ||
246 | /* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */ | |
f8f6d679 | 247 | |
e430f34e | 248 | #define BPF_JMP_REG(OP, DST, SRC, OFF) \ |
2695fb55 | 249 | ((struct bpf_insn) { \ |
f8f6d679 | 250 | .code = BPF_JMP | BPF_OP(OP) | BPF_X, \ |
e430f34e AS |
251 | .dst_reg = DST, \ |
252 | .src_reg = SRC, \ | |
f8f6d679 DB |
253 | .off = OFF, \ |
254 | .imm = 0 }) | |
255 | ||
e430f34e | 256 | /* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */ |
f8f6d679 | 257 | |
e430f34e | 258 | #define BPF_JMP_IMM(OP, DST, IMM, OFF) \ |
2695fb55 | 259 | ((struct bpf_insn) { \ |
f8f6d679 | 260 | .code = BPF_JMP | BPF_OP(OP) | BPF_K, \ |
e430f34e AS |
261 | .dst_reg = DST, \ |
262 | .src_reg = 0, \ | |
f8f6d679 DB |
263 | .off = OFF, \ |
264 | .imm = IMM }) | |
265 | ||
266 | /* Function call */ | |
267 | ||
268 | #define BPF_EMIT_CALL(FUNC) \ | |
2695fb55 | 269 | ((struct bpf_insn) { \ |
f8f6d679 | 270 | .code = BPF_JMP | BPF_CALL, \ |
e430f34e AS |
271 | .dst_reg = 0, \ |
272 | .src_reg = 0, \ | |
f8f6d679 DB |
273 | .off = 0, \ |
274 | .imm = ((FUNC) - __bpf_call_base) }) | |
275 | ||
276 | /* Raw code statement block */ | |
277 | ||
e430f34e | 278 | #define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \ |
2695fb55 | 279 | ((struct bpf_insn) { \ |
f8f6d679 | 280 | .code = CODE, \ |
e430f34e AS |
281 | .dst_reg = DST, \ |
282 | .src_reg = SRC, \ | |
f8f6d679 DB |
283 | .off = OFF, \ |
284 | .imm = IMM }) | |
285 | ||
286 | /* Program exit */ | |
287 | ||
288 | #define BPF_EXIT_INSN() \ | |
2695fb55 | 289 | ((struct bpf_insn) { \ |
f8f6d679 | 290 | .code = BPF_JMP | BPF_EXIT, \ |
e430f34e AS |
291 | .dst_reg = 0, \ |
292 | .src_reg = 0, \ | |
f8f6d679 DB |
293 | .off = 0, \ |
294 | .imm = 0 }) | |
295 | ||
a4afd37b DB |
296 | /* Internal classic blocks for direct assignment */ |
297 | ||
298 | #define __BPF_STMT(CODE, K) \ | |
299 | ((struct sock_filter) BPF_STMT(CODE, K)) | |
300 | ||
301 | #define __BPF_JUMP(CODE, K, JT, JF) \ | |
302 | ((struct sock_filter) BPF_JUMP(CODE, K, JT, JF)) | |
303 | ||
f8f6d679 DB |
304 | #define bytes_to_bpf_size(bytes) \ |
305 | ({ \ | |
306 | int bpf_size = -EINVAL; \ | |
307 | \ | |
308 | if (bytes == sizeof(u8)) \ | |
309 | bpf_size = BPF_B; \ | |
310 | else if (bytes == sizeof(u16)) \ | |
311 | bpf_size = BPF_H; \ | |
312 | else if (bytes == sizeof(u32)) \ | |
313 | bpf_size = BPF_W; \ | |
314 | else if (bytes == sizeof(u64)) \ | |
315 | bpf_size = BPF_DW; \ | |
316 | \ | |
317 | bpf_size; \ | |
318 | }) | |
9739eef1 | 319 | |
f035a515 DB |
320 | #define BPF_SIZEOF(type) \ |
321 | ({ \ | |
322 | const int __size = bytes_to_bpf_size(sizeof(type)); \ | |
323 | BUILD_BUG_ON(__size < 0); \ | |
324 | __size; \ | |
325 | }) | |
326 | ||
327 | #define BPF_FIELD_SIZEOF(type, field) \ | |
328 | ({ \ | |
329 | const int __size = bytes_to_bpf_size(FIELD_SIZEOF(type, field)); \ | |
330 | BUILD_BUG_ON(__size < 0); \ | |
331 | __size; \ | |
332 | }) | |
333 | ||
f3694e00 DB |
334 | #define __BPF_MAP_0(m, v, ...) v |
335 | #define __BPF_MAP_1(m, v, t, a, ...) m(t, a) | |
336 | #define __BPF_MAP_2(m, v, t, a, ...) m(t, a), __BPF_MAP_1(m, v, __VA_ARGS__) | |
337 | #define __BPF_MAP_3(m, v, t, a, ...) m(t, a), __BPF_MAP_2(m, v, __VA_ARGS__) | |
338 | #define __BPF_MAP_4(m, v, t, a, ...) m(t, a), __BPF_MAP_3(m, v, __VA_ARGS__) | |
339 | #define __BPF_MAP_5(m, v, t, a, ...) m(t, a), __BPF_MAP_4(m, v, __VA_ARGS__) | |
340 | ||
341 | #define __BPF_REG_0(...) __BPF_PAD(5) | |
342 | #define __BPF_REG_1(...) __BPF_MAP(1, __VA_ARGS__), __BPF_PAD(4) | |
343 | #define __BPF_REG_2(...) __BPF_MAP(2, __VA_ARGS__), __BPF_PAD(3) | |
344 | #define __BPF_REG_3(...) __BPF_MAP(3, __VA_ARGS__), __BPF_PAD(2) | |
345 | #define __BPF_REG_4(...) __BPF_MAP(4, __VA_ARGS__), __BPF_PAD(1) | |
346 | #define __BPF_REG_5(...) __BPF_MAP(5, __VA_ARGS__) | |
347 | ||
348 | #define __BPF_MAP(n, ...) __BPF_MAP_##n(__VA_ARGS__) | |
349 | #define __BPF_REG(n, ...) __BPF_REG_##n(__VA_ARGS__) | |
350 | ||
351 | #define __BPF_CAST(t, a) \ | |
352 | (__force t) \ | |
353 | (__force \ | |
354 | typeof(__builtin_choose_expr(sizeof(t) == sizeof(unsigned long), \ | |
355 | (unsigned long)0, (t)0))) a | |
356 | #define __BPF_V void | |
357 | #define __BPF_N | |
358 | ||
359 | #define __BPF_DECL_ARGS(t, a) t a | |
360 | #define __BPF_DECL_REGS(t, a) u64 a | |
361 | ||
362 | #define __BPF_PAD(n) \ | |
363 | __BPF_MAP(n, __BPF_DECL_ARGS, __BPF_N, u64, __ur_1, u64, __ur_2, \ | |
364 | u64, __ur_3, u64, __ur_4, u64, __ur_5) | |
365 | ||
366 | #define BPF_CALL_x(x, name, ...) \ | |
367 | static __always_inline \ | |
368 | u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)); \ | |
369 | u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)); \ | |
370 | u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)) \ | |
371 | { \ | |
372 | return ____##name(__BPF_MAP(x,__BPF_CAST,__BPF_N,__VA_ARGS__));\ | |
373 | } \ | |
374 | static __always_inline \ | |
375 | u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)) | |
376 | ||
377 | #define BPF_CALL_0(name, ...) BPF_CALL_x(0, name, __VA_ARGS__) | |
378 | #define BPF_CALL_1(name, ...) BPF_CALL_x(1, name, __VA_ARGS__) | |
379 | #define BPF_CALL_2(name, ...) BPF_CALL_x(2, name, __VA_ARGS__) | |
380 | #define BPF_CALL_3(name, ...) BPF_CALL_x(3, name, __VA_ARGS__) | |
381 | #define BPF_CALL_4(name, ...) BPF_CALL_x(4, name, __VA_ARGS__) | |
382 | #define BPF_CALL_5(name, ...) BPF_CALL_x(5, name, __VA_ARGS__) | |
383 | ||
bd4cf0ed AS |
384 | #ifdef CONFIG_COMPAT |
385 | /* A struct sock_filter is architecture independent. */ | |
0c5fe1b4 WD |
386 | struct compat_sock_fprog { |
387 | u16 len; | |
bd4cf0ed | 388 | compat_uptr_t filter; /* struct sock_filter * */ |
0c5fe1b4 WD |
389 | }; |
390 | #endif | |
391 | ||
a3ea269b DB |
392 | struct sock_fprog_kern { |
393 | u16 len; | |
394 | struct sock_filter *filter; | |
395 | }; | |
396 | ||
738cbe72 DB |
397 | struct bpf_binary_header { |
398 | unsigned int pages; | |
399 | u8 image[]; | |
400 | }; | |
401 | ||
7ae457c1 | 402 | struct bpf_prog { |
286aad3c | 403 | u16 pages; /* Number of allocated pages */ |
a91263d5 DB |
404 | kmemcheck_bitfield_begin(meta); |
405 | u16 jited:1, /* Is our filter JIT'ed? */ | |
c46646d0 | 406 | gpl_compatible:1, /* Is filter GPL compatible? */ |
ff936a04 | 407 | cb_access:1, /* Is control block accessed? */ |
17bedab2 MKL |
408 | dst_needed:1, /* Do we need dst entry? */ |
409 | xdp_adjust_head:1; /* Adjusting pkt head? */ | |
a91263d5 | 410 | kmemcheck_bitfield_end(meta); |
24701ece | 411 | enum bpf_prog_type type; /* Type of BPF program */ |
7bd509e3 | 412 | u32 len; /* Number of filter blocks */ |
f1f7714e | 413 | u8 tag[BPF_TAG_SIZE]; |
09756af4 | 414 | struct bpf_prog_aux *aux; /* Auxiliary fields */ |
24701ece | 415 | struct sock_fprog_kern *orig_prog; /* Original BPF program */ |
88575199 DB |
416 | unsigned int (*bpf_func)(const void *ctx, |
417 | const struct bpf_insn *insn); | |
60a3b225 | 418 | /* Instructions for interpreter */ |
d45ed4a4 | 419 | union { |
bd4cf0ed | 420 | struct sock_filter insns[0]; |
2695fb55 | 421 | struct bpf_insn insnsi[0]; |
d45ed4a4 | 422 | }; |
b715631f SH |
423 | }; |
424 | ||
7ae457c1 AS |
425 | struct sk_filter { |
426 | atomic_t refcnt; | |
427 | struct rcu_head rcu; | |
428 | struct bpf_prog *prog; | |
429 | }; | |
430 | ||
431 | #define BPF_PROG_RUN(filter, ctx) (*filter->bpf_func)(ctx, filter->insnsi) | |
432 | ||
01dd194c DB |
433 | #define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN |
434 | ||
db58ba45 AS |
435 | struct bpf_skb_data_end { |
436 | struct qdisc_skb_cb qdisc_cb; | |
437 | void *data_end; | |
438 | }; | |
439 | ||
6a773a15 BB |
440 | struct xdp_buff { |
441 | void *data; | |
442 | void *data_end; | |
17bedab2 | 443 | void *data_hard_start; |
6a773a15 BB |
444 | }; |
445 | ||
db58ba45 | 446 | /* compute the linear packet data range [data, data_end) which |
3a0af8fd | 447 | * will be accessed by cls_bpf, act_bpf and lwt programs |
db58ba45 AS |
448 | */ |
449 | static inline void bpf_compute_data_end(struct sk_buff *skb) | |
450 | { | |
451 | struct bpf_skb_data_end *cb = (struct bpf_skb_data_end *)skb->cb; | |
452 | ||
453 | BUILD_BUG_ON(sizeof(*cb) > FIELD_SIZEOF(struct sk_buff, cb)); | |
454 | cb->data_end = skb->data + skb_headlen(skb); | |
455 | } | |
456 | ||
01dd194c DB |
457 | static inline u8 *bpf_skb_cb(struct sk_buff *skb) |
458 | { | |
459 | /* eBPF programs may read/write skb->cb[] area to transfer meta | |
460 | * data between tail calls. Since this also needs to work with | |
461 | * tc, that scratch memory is mapped to qdisc_skb_cb's data area. | |
462 | * | |
463 | * In some socket filter cases, the cb unfortunately needs to be | |
464 | * saved/restored so that protocol specific skb->cb[] data won't | |
465 | * be lost. In any case, due to unpriviledged eBPF programs | |
466 | * attached to sockets, we need to clear the bpf_skb_cb() area | |
467 | * to not leak previous contents to user space. | |
468 | */ | |
469 | BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != BPF_SKB_CB_LEN); | |
470 | BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != | |
471 | FIELD_SIZEOF(struct qdisc_skb_cb, data)); | |
472 | ||
473 | return qdisc_skb_cb(skb)->data; | |
474 | } | |
475 | ||
ff936a04 AS |
476 | static inline u32 bpf_prog_run_save_cb(const struct bpf_prog *prog, |
477 | struct sk_buff *skb) | |
478 | { | |
01dd194c DB |
479 | u8 *cb_data = bpf_skb_cb(skb); |
480 | u8 cb_saved[BPF_SKB_CB_LEN]; | |
ff936a04 AS |
481 | u32 res; |
482 | ||
ff936a04 | 483 | if (unlikely(prog->cb_access)) { |
01dd194c DB |
484 | memcpy(cb_saved, cb_data, sizeof(cb_saved)); |
485 | memset(cb_data, 0, sizeof(cb_saved)); | |
ff936a04 AS |
486 | } |
487 | ||
488 | res = BPF_PROG_RUN(prog, skb); | |
489 | ||
490 | if (unlikely(prog->cb_access)) | |
01dd194c | 491 | memcpy(cb_data, cb_saved, sizeof(cb_saved)); |
ff936a04 AS |
492 | |
493 | return res; | |
494 | } | |
495 | ||
496 | static inline u32 bpf_prog_run_clear_cb(const struct bpf_prog *prog, | |
497 | struct sk_buff *skb) | |
498 | { | |
01dd194c | 499 | u8 *cb_data = bpf_skb_cb(skb); |
ff936a04 AS |
500 | |
501 | if (unlikely(prog->cb_access)) | |
01dd194c DB |
502 | memset(cb_data, 0, BPF_SKB_CB_LEN); |
503 | ||
ff936a04 AS |
504 | return BPF_PROG_RUN(prog, skb); |
505 | } | |
506 | ||
366cbf2f DB |
507 | static __always_inline u32 bpf_prog_run_xdp(const struct bpf_prog *prog, |
508 | struct xdp_buff *xdp) | |
6a773a15 | 509 | { |
366cbf2f DB |
510 | /* Caller needs to hold rcu_read_lock() (!), otherwise program |
511 | * can be released while still running, or map elements could be | |
512 | * freed early while still having concurrent users. XDP fastpath | |
513 | * already takes rcu_read_lock() when fetching the program, so | |
514 | * it's not necessary here anymore. | |
515 | */ | |
516 | return BPF_PROG_RUN(prog, xdp); | |
6a773a15 BB |
517 | } |
518 | ||
aafe6ae9 DB |
519 | static inline u32 bpf_prog_insn_size(const struct bpf_prog *prog) |
520 | { | |
521 | return prog->len * sizeof(struct bpf_insn); | |
522 | } | |
523 | ||
f1f7714e | 524 | static inline u32 bpf_prog_tag_scratch_size(const struct bpf_prog *prog) |
aafe6ae9 DB |
525 | { |
526 | return round_up(bpf_prog_insn_size(prog) + | |
527 | sizeof(__be64) + 1, SHA_MESSAGE_BYTES); | |
528 | } | |
529 | ||
7ae457c1 | 530 | static inline unsigned int bpf_prog_size(unsigned int proglen) |
b715631f | 531 | { |
7ae457c1 AS |
532 | return max(sizeof(struct bpf_prog), |
533 | offsetof(struct bpf_prog, insns[proglen])); | |
b715631f SH |
534 | } |
535 | ||
7b36f929 DB |
536 | static inline bool bpf_prog_was_classic(const struct bpf_prog *prog) |
537 | { | |
538 | /* When classic BPF programs have been loaded and the arch | |
539 | * does not have a classic BPF JIT (anymore), they have been | |
540 | * converted via bpf_migrate_filter() to eBPF and thus always | |
541 | * have an unspec program type. | |
542 | */ | |
543 | return prog->type == BPF_PROG_TYPE_UNSPEC; | |
544 | } | |
545 | ||
009937e7 | 546 | #define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0])) |
a3ea269b | 547 | |
60a3b225 DB |
548 | #ifdef CONFIG_DEBUG_SET_MODULE_RONX |
549 | static inline void bpf_prog_lock_ro(struct bpf_prog *fp) | |
550 | { | |
551 | set_memory_ro((unsigned long)fp, fp->pages); | |
552 | } | |
553 | ||
554 | static inline void bpf_prog_unlock_ro(struct bpf_prog *fp) | |
555 | { | |
556 | set_memory_rw((unsigned long)fp, fp->pages); | |
557 | } | |
558 | #else | |
559 | static inline void bpf_prog_lock_ro(struct bpf_prog *fp) | |
560 | { | |
561 | } | |
562 | ||
563 | static inline void bpf_prog_unlock_ro(struct bpf_prog *fp) | |
564 | { | |
565 | } | |
566 | #endif /* CONFIG_DEBUG_SET_MODULE_RONX */ | |
567 | ||
f4979fce WB |
568 | int sk_filter_trim_cap(struct sock *sk, struct sk_buff *skb, unsigned int cap); |
569 | static inline int sk_filter(struct sock *sk, struct sk_buff *skb) | |
570 | { | |
571 | return sk_filter_trim_cap(sk, skb, 1); | |
572 | } | |
bd4cf0ed | 573 | |
d1c55ab5 | 574 | struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err); |
7ae457c1 | 575 | void bpf_prog_free(struct bpf_prog *fp); |
bd4cf0ed | 576 | |
60a3b225 DB |
577 | struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags); |
578 | struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size, | |
579 | gfp_t gfp_extra_flags); | |
580 | void __bpf_prog_free(struct bpf_prog *fp); | |
581 | ||
582 | static inline void bpf_prog_unlock_free(struct bpf_prog *fp) | |
583 | { | |
584 | bpf_prog_unlock_ro(fp); | |
585 | __bpf_prog_free(fp); | |
586 | } | |
587 | ||
ac67eb2c DB |
588 | typedef int (*bpf_aux_classic_check_t)(struct sock_filter *filter, |
589 | unsigned int flen); | |
590 | ||
7ae457c1 | 591 | int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog); |
ac67eb2c | 592 | int bpf_prog_create_from_user(struct bpf_prog **pfp, struct sock_fprog *fprog, |
bab18991 | 593 | bpf_aux_classic_check_t trans, bool save_orig); |
7ae457c1 | 594 | void bpf_prog_destroy(struct bpf_prog *fp); |
a3ea269b | 595 | |
fbc907f0 | 596 | int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk); |
89aa0758 | 597 | int sk_attach_bpf(u32 ufd, struct sock *sk); |
538950a1 CG |
598 | int sk_reuseport_attach_filter(struct sock_fprog *fprog, struct sock *sk); |
599 | int sk_reuseport_attach_bpf(u32 ufd, struct sock *sk); | |
fbc907f0 | 600 | int sk_detach_filter(struct sock *sk); |
fbc907f0 DB |
601 | int sk_get_filter(struct sock *sk, struct sock_filter __user *filter, |
602 | unsigned int len); | |
fbc907f0 | 603 | |
278571ba | 604 | bool sk_filter_charge(struct sock *sk, struct sk_filter *fp); |
fbc907f0 | 605 | void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp); |
0a14842f | 606 | |
62258278 | 607 | u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5); |
d1c55ab5 DB |
608 | |
609 | struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog); | |
17bedab2 | 610 | bool bpf_helper_changes_pkt_data(void *func); |
62258278 | 611 | |
c237ee5e DB |
612 | struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off, |
613 | const struct bpf_insn *patch, u32 len); | |
6a773a15 | 614 | void bpf_warn_invalid_xdp_action(u32 act); |
c237ee5e | 615 | |
b954d834 | 616 | #ifdef CONFIG_BPF_JIT |
c94987e4 | 617 | extern int bpf_jit_enable; |
4f3446bb | 618 | extern int bpf_jit_harden; |
c94987e4 | 619 | |
b954d834 DB |
620 | typedef void (*bpf_jit_fill_hole_t)(void *area, unsigned int size); |
621 | ||
622 | struct bpf_binary_header * | |
623 | bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr, | |
624 | unsigned int alignment, | |
625 | bpf_jit_fill_hole_t bpf_fill_ill_insns); | |
626 | void bpf_jit_binary_free(struct bpf_binary_header *hdr); | |
627 | ||
628 | void bpf_jit_compile(struct bpf_prog *fp); | |
629 | void bpf_jit_free(struct bpf_prog *fp); | |
630 | ||
4f3446bb DB |
631 | struct bpf_prog *bpf_jit_blind_constants(struct bpf_prog *fp); |
632 | void bpf_jit_prog_release_other(struct bpf_prog *fp, struct bpf_prog *fp_other); | |
633 | ||
b954d834 DB |
634 | static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen, |
635 | u32 pass, void *image) | |
636 | { | |
b13138ef DB |
637 | pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen, |
638 | proglen, pass, image, current->comm, task_pid_nr(current)); | |
639 | ||
b954d834 DB |
640 | if (image) |
641 | print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET, | |
642 | 16, 1, image, proglen, false); | |
643 | } | |
4f3446bb DB |
644 | |
645 | static inline bool bpf_jit_is_ebpf(void) | |
646 | { | |
647 | # ifdef CONFIG_HAVE_EBPF_JIT | |
648 | return true; | |
649 | # else | |
650 | return false; | |
651 | # endif | |
652 | } | |
653 | ||
654 | static inline bool bpf_jit_blinding_enabled(void) | |
655 | { | |
656 | /* These are the prerequisites, should someone ever have the | |
657 | * idea to call blinding outside of them, we make sure to | |
658 | * bail out. | |
659 | */ | |
660 | if (!bpf_jit_is_ebpf()) | |
661 | return false; | |
662 | if (!bpf_jit_enable) | |
663 | return false; | |
664 | if (!bpf_jit_harden) | |
665 | return false; | |
666 | if (bpf_jit_harden == 1 && capable(CAP_SYS_ADMIN)) | |
667 | return false; | |
668 | ||
669 | return true; | |
670 | } | |
b954d834 DB |
671 | #else |
672 | static inline void bpf_jit_compile(struct bpf_prog *fp) | |
673 | { | |
674 | } | |
675 | ||
676 | static inline void bpf_jit_free(struct bpf_prog *fp) | |
677 | { | |
678 | bpf_prog_unlock_free(fp); | |
679 | } | |
680 | #endif /* CONFIG_BPF_JIT */ | |
681 | ||
34805931 DB |
682 | #define BPF_ANC BIT(15) |
683 | ||
55795ef5 RV |
684 | static inline bool bpf_needs_clear_a(const struct sock_filter *first) |
685 | { | |
686 | switch (first->code) { | |
687 | case BPF_RET | BPF_K: | |
688 | case BPF_LD | BPF_W | BPF_LEN: | |
689 | return false; | |
690 | ||
691 | case BPF_LD | BPF_W | BPF_ABS: | |
692 | case BPF_LD | BPF_H | BPF_ABS: | |
693 | case BPF_LD | BPF_B | BPF_ABS: | |
694 | if (first->k == SKF_AD_OFF + SKF_AD_ALU_XOR_X) | |
695 | return true; | |
696 | return false; | |
697 | ||
698 | default: | |
699 | return true; | |
700 | } | |
701 | } | |
702 | ||
34805931 DB |
703 | static inline u16 bpf_anc_helper(const struct sock_filter *ftest) |
704 | { | |
705 | BUG_ON(ftest->code & BPF_ANC); | |
706 | ||
707 | switch (ftest->code) { | |
708 | case BPF_LD | BPF_W | BPF_ABS: | |
709 | case BPF_LD | BPF_H | BPF_ABS: | |
710 | case BPF_LD | BPF_B | BPF_ABS: | |
711 | #define BPF_ANCILLARY(CODE) case SKF_AD_OFF + SKF_AD_##CODE: \ | |
712 | return BPF_ANC | SKF_AD_##CODE | |
713 | switch (ftest->k) { | |
714 | BPF_ANCILLARY(PROTOCOL); | |
715 | BPF_ANCILLARY(PKTTYPE); | |
716 | BPF_ANCILLARY(IFINDEX); | |
717 | BPF_ANCILLARY(NLATTR); | |
718 | BPF_ANCILLARY(NLATTR_NEST); | |
719 | BPF_ANCILLARY(MARK); | |
720 | BPF_ANCILLARY(QUEUE); | |
721 | BPF_ANCILLARY(HATYPE); | |
722 | BPF_ANCILLARY(RXHASH); | |
723 | BPF_ANCILLARY(CPU); | |
724 | BPF_ANCILLARY(ALU_XOR_X); | |
725 | BPF_ANCILLARY(VLAN_TAG); | |
726 | BPF_ANCILLARY(VLAN_TAG_PRESENT); | |
727 | BPF_ANCILLARY(PAY_OFFSET); | |
728 | BPF_ANCILLARY(RANDOM); | |
27cd5452 | 729 | BPF_ANCILLARY(VLAN_TPID); |
34805931 DB |
730 | } |
731 | /* Fallthrough. */ | |
732 | default: | |
733 | return ftest->code; | |
734 | } | |
735 | } | |
736 | ||
9f12fbe6 ZSL |
737 | void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb, |
738 | int k, unsigned int size); | |
739 | ||
740 | static inline void *bpf_load_pointer(const struct sk_buff *skb, int k, | |
741 | unsigned int size, void *buffer) | |
742 | { | |
743 | if (k >= 0) | |
744 | return skb_header_pointer(skb, k, size, buffer); | |
745 | ||
746 | return bpf_internal_load_pointer_neg_helper(skb, k, size); | |
747 | } | |
748 | ||
ea02f941 MS |
749 | static inline int bpf_tell_extensions(void) |
750 | { | |
37692299 | 751 | return SKF_AD_MAX; |
ea02f941 MS |
752 | } |
753 | ||
1da177e4 | 754 | #endif /* __LINUX_FILTER_H__ */ |