Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
1da177e4 LT |
2 | /* |
3 | * Linux Socket Filter Data Structures | |
4 | */ | |
1da177e4 LT |
5 | #ifndef __LINUX_FILTER_H__ |
6 | #define __LINUX_FILTER_H__ | |
7 | ||
b954d834 DB |
8 | #include <stdarg.h> |
9 | ||
60063497 | 10 | #include <linux/atomic.h> |
4c355cdf | 11 | #include <linux/refcount.h> |
0c5fe1b4 | 12 | #include <linux/compat.h> |
9f12fbe6 | 13 | #include <linux/skbuff.h> |
b954d834 DB |
14 | #include <linux/linkage.h> |
15 | #include <linux/printk.h> | |
d45ed4a4 | 16 | #include <linux/workqueue.h> |
b13138ef | 17 | #include <linux/sched.h> |
4f3446bb | 18 | #include <linux/capability.h> |
7bd509e3 | 19 | #include <linux/cryptohash.h> |
820a0b24 | 20 | #include <linux/set_memory.h> |
7105e828 | 21 | #include <linux/kallsyms.h> |
4f3446bb | 22 | |
ff936a04 | 23 | #include <net/sch_generic.h> |
b954d834 | 24 | |
b954d834 | 25 | #include <uapi/linux/filter.h> |
daedfb22 | 26 | #include <uapi/linux/bpf.h> |
60a3b225 DB |
27 | |
28 | struct sk_buff; | |
29 | struct sock; | |
30 | struct seccomp_data; | |
09756af4 | 31 | struct bpf_prog_aux; |
297dd12c | 32 | struct xdp_rxq_info; |
792d4b5c | 33 | |
30743837 DB |
34 | /* ArgX, context and stack frame pointer register positions. Note, |
35 | * Arg1, Arg2, Arg3, etc are used as argument mappings of function | |
36 | * calls in BPF_CALL instruction. | |
37 | */ | |
38 | #define BPF_REG_ARG1 BPF_REG_1 | |
39 | #define BPF_REG_ARG2 BPF_REG_2 | |
40 | #define BPF_REG_ARG3 BPF_REG_3 | |
41 | #define BPF_REG_ARG4 BPF_REG_4 | |
42 | #define BPF_REG_ARG5 BPF_REG_5 | |
43 | #define BPF_REG_CTX BPF_REG_6 | |
44 | #define BPF_REG_FP BPF_REG_10 | |
45 | ||
46 | /* Additional register mappings for converted user programs. */ | |
47 | #define BPF_REG_A BPF_REG_0 | |
48 | #define BPF_REG_X BPF_REG_7 | |
49 | #define BPF_REG_TMP BPF_REG_8 | |
bd4cf0ed | 50 | |
4f3446bb DB |
51 | /* Kernel hidden auxiliary/helper register for hardening step. |
52 | * Only used by eBPF JITs. It's nothing more than a temporary | |
53 | * register that JITs use internally, only that here it's part | |
54 | * of eBPF instructions that have been rewritten for blinding | |
55 | * constants. See JIT pre-step in bpf_jit_blind_constants(). | |
56 | */ | |
57 | #define BPF_REG_AX MAX_BPF_REG | |
58 | #define MAX_BPF_JIT_REG (MAX_BPF_REG + 1) | |
59 | ||
71189fa9 AS |
60 | /* unused opcode to mark special call to bpf_tail_call() helper */ |
61 | #define BPF_TAIL_CALL 0xf0 | |
62 | ||
1ea47e01 AS |
63 | /* unused opcode to mark call to interpreter with arguments */ |
64 | #define BPF_CALL_ARGS 0xe0 | |
65 | ||
74451e66 DB |
66 | /* As per nm, we expose JITed images as text (code) section for |
67 | * kallsyms. That way, tools like perf can find it to match | |
68 | * addresses. | |
69 | */ | |
70 | #define BPF_SYM_ELF_TYPE 't' | |
71 | ||
bd4cf0ed AS |
72 | /* BPF program can access up to 512 bytes of stack space. */ |
73 | #define MAX_BPF_STACK 512 | |
74 | ||
f8f6d679 DB |
75 | /* Helper macros for filter block array initializers. */ |
76 | ||
e430f34e | 77 | /* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */ |
f8f6d679 | 78 | |
e430f34e | 79 | #define BPF_ALU64_REG(OP, DST, SRC) \ |
2695fb55 | 80 | ((struct bpf_insn) { \ |
f8f6d679 | 81 | .code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \ |
e430f34e AS |
82 | .dst_reg = DST, \ |
83 | .src_reg = SRC, \ | |
f8f6d679 DB |
84 | .off = 0, \ |
85 | .imm = 0 }) | |
86 | ||
e430f34e | 87 | #define BPF_ALU32_REG(OP, DST, SRC) \ |
2695fb55 | 88 | ((struct bpf_insn) { \ |
f8f6d679 | 89 | .code = BPF_ALU | BPF_OP(OP) | BPF_X, \ |
e430f34e AS |
90 | .dst_reg = DST, \ |
91 | .src_reg = SRC, \ | |
f8f6d679 DB |
92 | .off = 0, \ |
93 | .imm = 0 }) | |
94 | ||
e430f34e | 95 | /* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */ |
f8f6d679 | 96 | |
e430f34e | 97 | #define BPF_ALU64_IMM(OP, DST, IMM) \ |
2695fb55 | 98 | ((struct bpf_insn) { \ |
f8f6d679 | 99 | .code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \ |
e430f34e AS |
100 | .dst_reg = DST, \ |
101 | .src_reg = 0, \ | |
f8f6d679 DB |
102 | .off = 0, \ |
103 | .imm = IMM }) | |
104 | ||
e430f34e | 105 | #define BPF_ALU32_IMM(OP, DST, IMM) \ |
2695fb55 | 106 | ((struct bpf_insn) { \ |
f8f6d679 | 107 | .code = BPF_ALU | BPF_OP(OP) | BPF_K, \ |
e430f34e AS |
108 | .dst_reg = DST, \ |
109 | .src_reg = 0, \ | |
f8f6d679 DB |
110 | .off = 0, \ |
111 | .imm = IMM }) | |
112 | ||
113 | /* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */ | |
114 | ||
e430f34e | 115 | #define BPF_ENDIAN(TYPE, DST, LEN) \ |
2695fb55 | 116 | ((struct bpf_insn) { \ |
f8f6d679 | 117 | .code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \ |
e430f34e AS |
118 | .dst_reg = DST, \ |
119 | .src_reg = 0, \ | |
f8f6d679 DB |
120 | .off = 0, \ |
121 | .imm = LEN }) | |
122 | ||
e430f34e | 123 | /* Short form of mov, dst_reg = src_reg */ |
f8f6d679 | 124 | |
e430f34e | 125 | #define BPF_MOV64_REG(DST, SRC) \ |
2695fb55 | 126 | ((struct bpf_insn) { \ |
f8f6d679 | 127 | .code = BPF_ALU64 | BPF_MOV | BPF_X, \ |
e430f34e AS |
128 | .dst_reg = DST, \ |
129 | .src_reg = SRC, \ | |
f8f6d679 DB |
130 | .off = 0, \ |
131 | .imm = 0 }) | |
132 | ||
e430f34e | 133 | #define BPF_MOV32_REG(DST, SRC) \ |
2695fb55 | 134 | ((struct bpf_insn) { \ |
f8f6d679 | 135 | .code = BPF_ALU | BPF_MOV | BPF_X, \ |
e430f34e AS |
136 | .dst_reg = DST, \ |
137 | .src_reg = SRC, \ | |
f8f6d679 DB |
138 | .off = 0, \ |
139 | .imm = 0 }) | |
140 | ||
e430f34e | 141 | /* Short form of mov, dst_reg = imm32 */ |
f8f6d679 | 142 | |
e430f34e | 143 | #define BPF_MOV64_IMM(DST, IMM) \ |
2695fb55 | 144 | ((struct bpf_insn) { \ |
f8f6d679 | 145 | .code = BPF_ALU64 | BPF_MOV | BPF_K, \ |
e430f34e AS |
146 | .dst_reg = DST, \ |
147 | .src_reg = 0, \ | |
f8f6d679 DB |
148 | .off = 0, \ |
149 | .imm = IMM }) | |
150 | ||
e430f34e | 151 | #define BPF_MOV32_IMM(DST, IMM) \ |
2695fb55 | 152 | ((struct bpf_insn) { \ |
f8f6d679 | 153 | .code = BPF_ALU | BPF_MOV | BPF_K, \ |
e430f34e AS |
154 | .dst_reg = DST, \ |
155 | .src_reg = 0, \ | |
f8f6d679 DB |
156 | .off = 0, \ |
157 | .imm = IMM }) | |
158 | ||
02ab695b AS |
159 | /* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */ |
160 | #define BPF_LD_IMM64(DST, IMM) \ | |
161 | BPF_LD_IMM64_RAW(DST, 0, IMM) | |
162 | ||
163 | #define BPF_LD_IMM64_RAW(DST, SRC, IMM) \ | |
164 | ((struct bpf_insn) { \ | |
165 | .code = BPF_LD | BPF_DW | BPF_IMM, \ | |
166 | .dst_reg = DST, \ | |
167 | .src_reg = SRC, \ | |
168 | .off = 0, \ | |
169 | .imm = (__u32) (IMM) }), \ | |
170 | ((struct bpf_insn) { \ | |
171 | .code = 0, /* zero is reserved opcode */ \ | |
172 | .dst_reg = 0, \ | |
173 | .src_reg = 0, \ | |
174 | .off = 0, \ | |
175 | .imm = ((__u64) (IMM)) >> 32 }) | |
176 | ||
0246e64d AS |
177 | /* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */ |
178 | #define BPF_LD_MAP_FD(DST, MAP_FD) \ | |
179 | BPF_LD_IMM64_RAW(DST, BPF_PSEUDO_MAP_FD, MAP_FD) | |
180 | ||
e430f34e | 181 | /* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */ |
f8f6d679 | 182 | |
e430f34e | 183 | #define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \ |
2695fb55 | 184 | ((struct bpf_insn) { \ |
f8f6d679 | 185 | .code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \ |
e430f34e AS |
186 | .dst_reg = DST, \ |
187 | .src_reg = SRC, \ | |
f8f6d679 DB |
188 | .off = 0, \ |
189 | .imm = IMM }) | |
190 | ||
e430f34e | 191 | #define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \ |
2695fb55 | 192 | ((struct bpf_insn) { \ |
f8f6d679 | 193 | .code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \ |
e430f34e AS |
194 | .dst_reg = DST, \ |
195 | .src_reg = SRC, \ | |
f8f6d679 DB |
196 | .off = 0, \ |
197 | .imm = IMM }) | |
198 | ||
e430f34e | 199 | /* Direct packet access, R0 = *(uint *) (skb->data + imm32) */ |
f8f6d679 | 200 | |
e430f34e | 201 | #define BPF_LD_ABS(SIZE, IMM) \ |
2695fb55 | 202 | ((struct bpf_insn) { \ |
f8f6d679 | 203 | .code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \ |
e430f34e AS |
204 | .dst_reg = 0, \ |
205 | .src_reg = 0, \ | |
f8f6d679 | 206 | .off = 0, \ |
e430f34e | 207 | .imm = IMM }) |
f8f6d679 | 208 | |
e430f34e | 209 | /* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */ |
f8f6d679 | 210 | |
e430f34e | 211 | #define BPF_LD_IND(SIZE, SRC, IMM) \ |
2695fb55 | 212 | ((struct bpf_insn) { \ |
f8f6d679 | 213 | .code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \ |
e430f34e AS |
214 | .dst_reg = 0, \ |
215 | .src_reg = SRC, \ | |
f8f6d679 | 216 | .off = 0, \ |
e430f34e | 217 | .imm = IMM }) |
f8f6d679 | 218 | |
e430f34e | 219 | /* Memory load, dst_reg = *(uint *) (src_reg + off16) */ |
f8f6d679 | 220 | |
e430f34e | 221 | #define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \ |
2695fb55 | 222 | ((struct bpf_insn) { \ |
f8f6d679 | 223 | .code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \ |
e430f34e AS |
224 | .dst_reg = DST, \ |
225 | .src_reg = SRC, \ | |
f8f6d679 DB |
226 | .off = OFF, \ |
227 | .imm = 0 }) | |
228 | ||
e430f34e AS |
229 | /* Memory store, *(uint *) (dst_reg + off16) = src_reg */ |
230 | ||
231 | #define BPF_STX_MEM(SIZE, DST, SRC, OFF) \ | |
2695fb55 | 232 | ((struct bpf_insn) { \ |
f8f6d679 | 233 | .code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \ |
e430f34e AS |
234 | .dst_reg = DST, \ |
235 | .src_reg = SRC, \ | |
f8f6d679 DB |
236 | .off = OFF, \ |
237 | .imm = 0 }) | |
238 | ||
cffc642d MH |
239 | /* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */ |
240 | ||
241 | #define BPF_STX_XADD(SIZE, DST, SRC, OFF) \ | |
242 | ((struct bpf_insn) { \ | |
243 | .code = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD, \ | |
244 | .dst_reg = DST, \ | |
245 | .src_reg = SRC, \ | |
246 | .off = OFF, \ | |
247 | .imm = 0 }) | |
248 | ||
e430f34e AS |
249 | /* Memory store, *(uint *) (dst_reg + off16) = imm32 */ |
250 | ||
251 | #define BPF_ST_MEM(SIZE, DST, OFF, IMM) \ | |
2695fb55 | 252 | ((struct bpf_insn) { \ |
e430f34e AS |
253 | .code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \ |
254 | .dst_reg = DST, \ | |
255 | .src_reg = 0, \ | |
256 | .off = OFF, \ | |
257 | .imm = IMM }) | |
258 | ||
259 | /* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */ | |
f8f6d679 | 260 | |
e430f34e | 261 | #define BPF_JMP_REG(OP, DST, SRC, OFF) \ |
2695fb55 | 262 | ((struct bpf_insn) { \ |
f8f6d679 | 263 | .code = BPF_JMP | BPF_OP(OP) | BPF_X, \ |
e430f34e AS |
264 | .dst_reg = DST, \ |
265 | .src_reg = SRC, \ | |
f8f6d679 DB |
266 | .off = OFF, \ |
267 | .imm = 0 }) | |
268 | ||
e430f34e | 269 | /* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */ |
f8f6d679 | 270 | |
e430f34e | 271 | #define BPF_JMP_IMM(OP, DST, IMM, OFF) \ |
2695fb55 | 272 | ((struct bpf_insn) { \ |
f8f6d679 | 273 | .code = BPF_JMP | BPF_OP(OP) | BPF_K, \ |
e430f34e AS |
274 | .dst_reg = DST, \ |
275 | .src_reg = 0, \ | |
f8f6d679 DB |
276 | .off = OFF, \ |
277 | .imm = IMM }) | |
278 | ||
614d0d77 DB |
279 | /* Unconditional jumps, goto pc + off16 */ |
280 | ||
281 | #define BPF_JMP_A(OFF) \ | |
282 | ((struct bpf_insn) { \ | |
283 | .code = BPF_JMP | BPF_JA, \ | |
284 | .dst_reg = 0, \ | |
285 | .src_reg = 0, \ | |
286 | .off = OFF, \ | |
287 | .imm = 0 }) | |
288 | ||
f8f6d679 DB |
289 | /* Function call */ |
290 | ||
291 | #define BPF_EMIT_CALL(FUNC) \ | |
2695fb55 | 292 | ((struct bpf_insn) { \ |
f8f6d679 | 293 | .code = BPF_JMP | BPF_CALL, \ |
e430f34e AS |
294 | .dst_reg = 0, \ |
295 | .src_reg = 0, \ | |
f8f6d679 DB |
296 | .off = 0, \ |
297 | .imm = ((FUNC) - __bpf_call_base) }) | |
298 | ||
299 | /* Raw code statement block */ | |
300 | ||
e430f34e | 301 | #define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \ |
2695fb55 | 302 | ((struct bpf_insn) { \ |
f8f6d679 | 303 | .code = CODE, \ |
e430f34e AS |
304 | .dst_reg = DST, \ |
305 | .src_reg = SRC, \ | |
f8f6d679 DB |
306 | .off = OFF, \ |
307 | .imm = IMM }) | |
308 | ||
309 | /* Program exit */ | |
310 | ||
311 | #define BPF_EXIT_INSN() \ | |
2695fb55 | 312 | ((struct bpf_insn) { \ |
f8f6d679 | 313 | .code = BPF_JMP | BPF_EXIT, \ |
e430f34e AS |
314 | .dst_reg = 0, \ |
315 | .src_reg = 0, \ | |
f8f6d679 DB |
316 | .off = 0, \ |
317 | .imm = 0 }) | |
318 | ||
a4afd37b DB |
319 | /* Internal classic blocks for direct assignment */ |
320 | ||
321 | #define __BPF_STMT(CODE, K) \ | |
322 | ((struct sock_filter) BPF_STMT(CODE, K)) | |
323 | ||
324 | #define __BPF_JUMP(CODE, K, JT, JF) \ | |
325 | ((struct sock_filter) BPF_JUMP(CODE, K, JT, JF)) | |
326 | ||
f8f6d679 DB |
327 | #define bytes_to_bpf_size(bytes) \ |
328 | ({ \ | |
329 | int bpf_size = -EINVAL; \ | |
330 | \ | |
331 | if (bytes == sizeof(u8)) \ | |
332 | bpf_size = BPF_B; \ | |
333 | else if (bytes == sizeof(u16)) \ | |
334 | bpf_size = BPF_H; \ | |
335 | else if (bytes == sizeof(u32)) \ | |
336 | bpf_size = BPF_W; \ | |
337 | else if (bytes == sizeof(u64)) \ | |
338 | bpf_size = BPF_DW; \ | |
339 | \ | |
340 | bpf_size; \ | |
341 | }) | |
9739eef1 | 342 | |
f96da094 DB |
343 | #define bpf_size_to_bytes(bpf_size) \ |
344 | ({ \ | |
345 | int bytes = -EINVAL; \ | |
346 | \ | |
347 | if (bpf_size == BPF_B) \ | |
348 | bytes = sizeof(u8); \ | |
349 | else if (bpf_size == BPF_H) \ | |
350 | bytes = sizeof(u16); \ | |
351 | else if (bpf_size == BPF_W) \ | |
352 | bytes = sizeof(u32); \ | |
353 | else if (bpf_size == BPF_DW) \ | |
354 | bytes = sizeof(u64); \ | |
355 | \ | |
356 | bytes; \ | |
357 | }) | |
358 | ||
f035a515 DB |
359 | #define BPF_SIZEOF(type) \ |
360 | ({ \ | |
361 | const int __size = bytes_to_bpf_size(sizeof(type)); \ | |
362 | BUILD_BUG_ON(__size < 0); \ | |
363 | __size; \ | |
364 | }) | |
365 | ||
366 | #define BPF_FIELD_SIZEOF(type, field) \ | |
367 | ({ \ | |
368 | const int __size = bytes_to_bpf_size(FIELD_SIZEOF(type, field)); \ | |
369 | BUILD_BUG_ON(__size < 0); \ | |
370 | __size; \ | |
371 | }) | |
372 | ||
f96da094 DB |
373 | #define BPF_LDST_BYTES(insn) \ |
374 | ({ \ | |
375 | const int __size = bpf_size_to_bytes(BPF_SIZE(insn->code)); \ | |
376 | WARN_ON(__size < 0); \ | |
377 | __size; \ | |
378 | }) | |
379 | ||
f3694e00 DB |
380 | #define __BPF_MAP_0(m, v, ...) v |
381 | #define __BPF_MAP_1(m, v, t, a, ...) m(t, a) | |
382 | #define __BPF_MAP_2(m, v, t, a, ...) m(t, a), __BPF_MAP_1(m, v, __VA_ARGS__) | |
383 | #define __BPF_MAP_3(m, v, t, a, ...) m(t, a), __BPF_MAP_2(m, v, __VA_ARGS__) | |
384 | #define __BPF_MAP_4(m, v, t, a, ...) m(t, a), __BPF_MAP_3(m, v, __VA_ARGS__) | |
385 | #define __BPF_MAP_5(m, v, t, a, ...) m(t, a), __BPF_MAP_4(m, v, __VA_ARGS__) | |
386 | ||
387 | #define __BPF_REG_0(...) __BPF_PAD(5) | |
388 | #define __BPF_REG_1(...) __BPF_MAP(1, __VA_ARGS__), __BPF_PAD(4) | |
389 | #define __BPF_REG_2(...) __BPF_MAP(2, __VA_ARGS__), __BPF_PAD(3) | |
390 | #define __BPF_REG_3(...) __BPF_MAP(3, __VA_ARGS__), __BPF_PAD(2) | |
391 | #define __BPF_REG_4(...) __BPF_MAP(4, __VA_ARGS__), __BPF_PAD(1) | |
392 | #define __BPF_REG_5(...) __BPF_MAP(5, __VA_ARGS__) | |
393 | ||
394 | #define __BPF_MAP(n, ...) __BPF_MAP_##n(__VA_ARGS__) | |
395 | #define __BPF_REG(n, ...) __BPF_REG_##n(__VA_ARGS__) | |
396 | ||
397 | #define __BPF_CAST(t, a) \ | |
398 | (__force t) \ | |
399 | (__force \ | |
400 | typeof(__builtin_choose_expr(sizeof(t) == sizeof(unsigned long), \ | |
401 | (unsigned long)0, (t)0))) a | |
402 | #define __BPF_V void | |
403 | #define __BPF_N | |
404 | ||
405 | #define __BPF_DECL_ARGS(t, a) t a | |
406 | #define __BPF_DECL_REGS(t, a) u64 a | |
407 | ||
408 | #define __BPF_PAD(n) \ | |
409 | __BPF_MAP(n, __BPF_DECL_ARGS, __BPF_N, u64, __ur_1, u64, __ur_2, \ | |
410 | u64, __ur_3, u64, __ur_4, u64, __ur_5) | |
411 | ||
412 | #define BPF_CALL_x(x, name, ...) \ | |
413 | static __always_inline \ | |
414 | u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)); \ | |
415 | u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)); \ | |
416 | u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)) \ | |
417 | { \ | |
418 | return ____##name(__BPF_MAP(x,__BPF_CAST,__BPF_N,__VA_ARGS__));\ | |
419 | } \ | |
420 | static __always_inline \ | |
421 | u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)) | |
422 | ||
423 | #define BPF_CALL_0(name, ...) BPF_CALL_x(0, name, __VA_ARGS__) | |
424 | #define BPF_CALL_1(name, ...) BPF_CALL_x(1, name, __VA_ARGS__) | |
425 | #define BPF_CALL_2(name, ...) BPF_CALL_x(2, name, __VA_ARGS__) | |
426 | #define BPF_CALL_3(name, ...) BPF_CALL_x(3, name, __VA_ARGS__) | |
427 | #define BPF_CALL_4(name, ...) BPF_CALL_x(4, name, __VA_ARGS__) | |
428 | #define BPF_CALL_5(name, ...) BPF_CALL_x(5, name, __VA_ARGS__) | |
429 | ||
f96da094 DB |
430 | #define bpf_ctx_range(TYPE, MEMBER) \ |
431 | offsetof(TYPE, MEMBER) ... offsetofend(TYPE, MEMBER) - 1 | |
432 | #define bpf_ctx_range_till(TYPE, MEMBER1, MEMBER2) \ | |
433 | offsetof(TYPE, MEMBER1) ... offsetofend(TYPE, MEMBER2) - 1 | |
434 | ||
435 | #define bpf_target_off(TYPE, MEMBER, SIZE, PTR_SIZE) \ | |
436 | ({ \ | |
437 | BUILD_BUG_ON(FIELD_SIZEOF(TYPE, MEMBER) != (SIZE)); \ | |
438 | *(PTR_SIZE) = (SIZE); \ | |
439 | offsetof(TYPE, MEMBER); \ | |
440 | }) | |
441 | ||
bd4cf0ed AS |
442 | #ifdef CONFIG_COMPAT |
443 | /* A struct sock_filter is architecture independent. */ | |
0c5fe1b4 WD |
444 | struct compat_sock_fprog { |
445 | u16 len; | |
bd4cf0ed | 446 | compat_uptr_t filter; /* struct sock_filter * */ |
0c5fe1b4 WD |
447 | }; |
448 | #endif | |
449 | ||
a3ea269b DB |
450 | struct sock_fprog_kern { |
451 | u16 len; | |
452 | struct sock_filter *filter; | |
453 | }; | |
454 | ||
738cbe72 DB |
455 | struct bpf_binary_header { |
456 | unsigned int pages; | |
457 | u8 image[]; | |
458 | }; | |
459 | ||
7ae457c1 | 460 | struct bpf_prog { |
286aad3c | 461 | u16 pages; /* Number of allocated pages */ |
a91263d5 | 462 | u16 jited:1, /* Is our filter JIT'ed? */ |
60b58afc | 463 | jit_requested:1,/* archs need to JIT the prog */ |
65869a47 | 464 | locked:1, /* Program image locked? */ |
c46646d0 | 465 | gpl_compatible:1, /* Is filter GPL compatible? */ |
ff936a04 | 466 | cb_access:1, /* Is control block accessed? */ |
9802d865 | 467 | dst_needed:1, /* Do we need dst entry? */ |
1c2a088a AS |
468 | blinded:1, /* Was blinded */ |
469 | is_func:1, /* program is a bpf function */ | |
9802d865 | 470 | kprobe_override:1; /* Do we override a kprobe? */ |
24701ece | 471 | enum bpf_prog_type type; /* Type of BPF program */ |
7bd509e3 | 472 | u32 len; /* Number of filter blocks */ |
783d28dd | 473 | u32 jited_len; /* Size of jited insns in bytes */ |
f1f7714e | 474 | u8 tag[BPF_TAG_SIZE]; |
09756af4 | 475 | struct bpf_prog_aux *aux; /* Auxiliary fields */ |
24701ece | 476 | struct sock_fprog_kern *orig_prog; /* Original BPF program */ |
88575199 DB |
477 | unsigned int (*bpf_func)(const void *ctx, |
478 | const struct bpf_insn *insn); | |
60a3b225 | 479 | /* Instructions for interpreter */ |
d45ed4a4 | 480 | union { |
bd4cf0ed | 481 | struct sock_filter insns[0]; |
2695fb55 | 482 | struct bpf_insn insnsi[0]; |
d45ed4a4 | 483 | }; |
b715631f SH |
484 | }; |
485 | ||
7ae457c1 | 486 | struct sk_filter { |
4c355cdf | 487 | refcount_t refcnt; |
7ae457c1 AS |
488 | struct rcu_head rcu; |
489 | struct bpf_prog *prog; | |
490 | }; | |
491 | ||
324bda9e | 492 | #define BPF_PROG_RUN(filter, ctx) (*(filter)->bpf_func)(ctx, (filter)->insnsi) |
7ae457c1 | 493 | |
01dd194c DB |
494 | #define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN |
495 | ||
db58ba45 AS |
496 | struct bpf_skb_data_end { |
497 | struct qdisc_skb_cb qdisc_cb; | |
de8f3a83 | 498 | void *data_meta; |
db58ba45 AS |
499 | void *data_end; |
500 | }; | |
501 | ||
6a773a15 BB |
502 | struct xdp_buff { |
503 | void *data; | |
504 | void *data_end; | |
de8f3a83 | 505 | void *data_meta; |
17bedab2 | 506 | void *data_hard_start; |
aecd67b6 | 507 | struct xdp_rxq_info *rxq; |
6a773a15 BB |
508 | }; |
509 | ||
6aaae2b6 DB |
510 | /* Compute the linear packet data range [data, data_end) which |
511 | * will be accessed by various program types (cls_bpf, act_bpf, | |
512 | * lwt, ...). Subsystems allowing direct data access must (!) | |
513 | * ensure that cb[] area can be written to when BPF program is | |
514 | * invoked (otherwise cb[] save/restore is necessary). | |
db58ba45 | 515 | */ |
6aaae2b6 | 516 | static inline void bpf_compute_data_pointers(struct sk_buff *skb) |
db58ba45 AS |
517 | { |
518 | struct bpf_skb_data_end *cb = (struct bpf_skb_data_end *)skb->cb; | |
519 | ||
520 | BUILD_BUG_ON(sizeof(*cb) > FIELD_SIZEOF(struct sk_buff, cb)); | |
de8f3a83 DB |
521 | cb->data_meta = skb->data - skb_metadata_len(skb); |
522 | cb->data_end = skb->data + skb_headlen(skb); | |
db58ba45 AS |
523 | } |
524 | ||
01dd194c DB |
525 | static inline u8 *bpf_skb_cb(struct sk_buff *skb) |
526 | { | |
527 | /* eBPF programs may read/write skb->cb[] area to transfer meta | |
528 | * data between tail calls. Since this also needs to work with | |
529 | * tc, that scratch memory is mapped to qdisc_skb_cb's data area. | |
530 | * | |
531 | * In some socket filter cases, the cb unfortunately needs to be | |
532 | * saved/restored so that protocol specific skb->cb[] data won't | |
533 | * be lost. In any case, due to unpriviledged eBPF programs | |
534 | * attached to sockets, we need to clear the bpf_skb_cb() area | |
535 | * to not leak previous contents to user space. | |
536 | */ | |
537 | BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != BPF_SKB_CB_LEN); | |
538 | BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != | |
539 | FIELD_SIZEOF(struct qdisc_skb_cb, data)); | |
540 | ||
541 | return qdisc_skb_cb(skb)->data; | |
542 | } | |
543 | ||
ff936a04 AS |
544 | static inline u32 bpf_prog_run_save_cb(const struct bpf_prog *prog, |
545 | struct sk_buff *skb) | |
546 | { | |
01dd194c DB |
547 | u8 *cb_data = bpf_skb_cb(skb); |
548 | u8 cb_saved[BPF_SKB_CB_LEN]; | |
ff936a04 AS |
549 | u32 res; |
550 | ||
ff936a04 | 551 | if (unlikely(prog->cb_access)) { |
01dd194c DB |
552 | memcpy(cb_saved, cb_data, sizeof(cb_saved)); |
553 | memset(cb_data, 0, sizeof(cb_saved)); | |
ff936a04 AS |
554 | } |
555 | ||
556 | res = BPF_PROG_RUN(prog, skb); | |
557 | ||
558 | if (unlikely(prog->cb_access)) | |
01dd194c | 559 | memcpy(cb_data, cb_saved, sizeof(cb_saved)); |
ff936a04 AS |
560 | |
561 | return res; | |
562 | } | |
563 | ||
564 | static inline u32 bpf_prog_run_clear_cb(const struct bpf_prog *prog, | |
565 | struct sk_buff *skb) | |
566 | { | |
01dd194c | 567 | u8 *cb_data = bpf_skb_cb(skb); |
ff936a04 AS |
568 | |
569 | if (unlikely(prog->cb_access)) | |
01dd194c DB |
570 | memset(cb_data, 0, BPF_SKB_CB_LEN); |
571 | ||
ff936a04 AS |
572 | return BPF_PROG_RUN(prog, skb); |
573 | } | |
574 | ||
366cbf2f DB |
575 | static __always_inline u32 bpf_prog_run_xdp(const struct bpf_prog *prog, |
576 | struct xdp_buff *xdp) | |
6a773a15 | 577 | { |
366cbf2f DB |
578 | /* Caller needs to hold rcu_read_lock() (!), otherwise program |
579 | * can be released while still running, or map elements could be | |
580 | * freed early while still having concurrent users. XDP fastpath | |
581 | * already takes rcu_read_lock() when fetching the program, so | |
582 | * it's not necessary here anymore. | |
583 | */ | |
584 | return BPF_PROG_RUN(prog, xdp); | |
6a773a15 BB |
585 | } |
586 | ||
aafe6ae9 DB |
587 | static inline u32 bpf_prog_insn_size(const struct bpf_prog *prog) |
588 | { | |
589 | return prog->len * sizeof(struct bpf_insn); | |
590 | } | |
591 | ||
f1f7714e | 592 | static inline u32 bpf_prog_tag_scratch_size(const struct bpf_prog *prog) |
aafe6ae9 DB |
593 | { |
594 | return round_up(bpf_prog_insn_size(prog) + | |
595 | sizeof(__be64) + 1, SHA_MESSAGE_BYTES); | |
596 | } | |
597 | ||
7ae457c1 | 598 | static inline unsigned int bpf_prog_size(unsigned int proglen) |
b715631f | 599 | { |
7ae457c1 AS |
600 | return max(sizeof(struct bpf_prog), |
601 | offsetof(struct bpf_prog, insns[proglen])); | |
b715631f SH |
602 | } |
603 | ||
7b36f929 DB |
604 | static inline bool bpf_prog_was_classic(const struct bpf_prog *prog) |
605 | { | |
606 | /* When classic BPF programs have been loaded and the arch | |
607 | * does not have a classic BPF JIT (anymore), they have been | |
608 | * converted via bpf_migrate_filter() to eBPF and thus always | |
609 | * have an unspec program type. | |
610 | */ | |
611 | return prog->type == BPF_PROG_TYPE_UNSPEC; | |
612 | } | |
613 | ||
f96da094 DB |
614 | static inline bool |
615 | bpf_ctx_narrow_access_ok(u32 off, u32 size, const u32 size_default) | |
616 | { | |
617 | bool off_ok; | |
618 | #ifdef __LITTLE_ENDIAN | |
619 | off_ok = (off & (size_default - 1)) == 0; | |
620 | #else | |
621 | off_ok = (off & (size_default - 1)) + size == size_default; | |
622 | #endif | |
623 | return off_ok && size <= size_default && (size & (size - 1)) == 0; | |
624 | } | |
625 | ||
009937e7 | 626 | #define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0])) |
a3ea269b | 627 | |
9d876e79 | 628 | #ifdef CONFIG_ARCH_HAS_SET_MEMORY |
60a3b225 DB |
629 | static inline void bpf_prog_lock_ro(struct bpf_prog *fp) |
630 | { | |
65869a47 DB |
631 | fp->locked = 1; |
632 | WARN_ON_ONCE(set_memory_ro((unsigned long)fp, fp->pages)); | |
60a3b225 DB |
633 | } |
634 | ||
635 | static inline void bpf_prog_unlock_ro(struct bpf_prog *fp) | |
636 | { | |
65869a47 DB |
637 | if (fp->locked) { |
638 | WARN_ON_ONCE(set_memory_rw((unsigned long)fp, fp->pages)); | |
639 | /* In case set_memory_rw() fails, we want to be the first | |
640 | * to crash here instead of some random place later on. | |
641 | */ | |
642 | fp->locked = 0; | |
643 | } | |
60a3b225 | 644 | } |
74451e66 | 645 | |
9d876e79 DB |
646 | static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr) |
647 | { | |
65869a47 | 648 | WARN_ON_ONCE(set_memory_ro((unsigned long)hdr, hdr->pages)); |
9d876e79 DB |
649 | } |
650 | ||
74451e66 DB |
651 | static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr) |
652 | { | |
65869a47 | 653 | WARN_ON_ONCE(set_memory_rw((unsigned long)hdr, hdr->pages)); |
74451e66 | 654 | } |
60a3b225 DB |
655 | #else |
656 | static inline void bpf_prog_lock_ro(struct bpf_prog *fp) | |
657 | { | |
658 | } | |
659 | ||
660 | static inline void bpf_prog_unlock_ro(struct bpf_prog *fp) | |
661 | { | |
662 | } | |
74451e66 | 663 | |
9d876e79 DB |
664 | static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr) |
665 | { | |
666 | } | |
667 | ||
74451e66 DB |
668 | static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr) |
669 | { | |
670 | } | |
9d876e79 | 671 | #endif /* CONFIG_ARCH_HAS_SET_MEMORY */ |
60a3b225 | 672 | |
74451e66 DB |
673 | static inline struct bpf_binary_header * |
674 | bpf_jit_binary_hdr(const struct bpf_prog *fp) | |
675 | { | |
676 | unsigned long real_start = (unsigned long)fp->bpf_func; | |
677 | unsigned long addr = real_start & PAGE_MASK; | |
678 | ||
679 | return (void *)addr; | |
680 | } | |
681 | ||
f4979fce WB |
682 | int sk_filter_trim_cap(struct sock *sk, struct sk_buff *skb, unsigned int cap); |
683 | static inline int sk_filter(struct sock *sk, struct sk_buff *skb) | |
684 | { | |
685 | return sk_filter_trim_cap(sk, skb, 1); | |
686 | } | |
bd4cf0ed | 687 | |
d1c55ab5 | 688 | struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err); |
7ae457c1 | 689 | void bpf_prog_free(struct bpf_prog *fp); |
bd4cf0ed | 690 | |
5e581dad DB |
691 | bool bpf_opcode_in_insntable(u8 code); |
692 | ||
60a3b225 DB |
693 | struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags); |
694 | struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size, | |
695 | gfp_t gfp_extra_flags); | |
696 | void __bpf_prog_free(struct bpf_prog *fp); | |
697 | ||
698 | static inline void bpf_prog_unlock_free(struct bpf_prog *fp) | |
699 | { | |
700 | bpf_prog_unlock_ro(fp); | |
701 | __bpf_prog_free(fp); | |
702 | } | |
703 | ||
ac67eb2c DB |
704 | typedef int (*bpf_aux_classic_check_t)(struct sock_filter *filter, |
705 | unsigned int flen); | |
706 | ||
7ae457c1 | 707 | int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog); |
ac67eb2c | 708 | int bpf_prog_create_from_user(struct bpf_prog **pfp, struct sock_fprog *fprog, |
bab18991 | 709 | bpf_aux_classic_check_t trans, bool save_orig); |
7ae457c1 | 710 | void bpf_prog_destroy(struct bpf_prog *fp); |
a3ea269b | 711 | |
fbc907f0 | 712 | int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk); |
89aa0758 | 713 | int sk_attach_bpf(u32 ufd, struct sock *sk); |
538950a1 CG |
714 | int sk_reuseport_attach_filter(struct sock_fprog *fprog, struct sock *sk); |
715 | int sk_reuseport_attach_bpf(u32 ufd, struct sock *sk); | |
fbc907f0 | 716 | int sk_detach_filter(struct sock *sk); |
fbc907f0 DB |
717 | int sk_get_filter(struct sock *sk, struct sock_filter __user *filter, |
718 | unsigned int len); | |
fbc907f0 | 719 | |
278571ba | 720 | bool sk_filter_charge(struct sock *sk, struct sk_filter *fp); |
fbc907f0 | 721 | void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp); |
0a14842f | 722 | |
62258278 | 723 | u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5); |
1ea47e01 AS |
724 | #define __bpf_call_base_args \ |
725 | ((u64 (*)(u64, u64, u64, u64, u64, const struct bpf_insn *)) \ | |
726 | __bpf_call_base) | |
d1c55ab5 DB |
727 | |
728 | struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog); | |
9383191d | 729 | void bpf_jit_compile(struct bpf_prog *prog); |
17bedab2 | 730 | bool bpf_helper_changes_pkt_data(void *func); |
62258278 | 731 | |
7105e828 DB |
732 | static inline bool bpf_dump_raw_ok(void) |
733 | { | |
734 | /* Reconstruction of call-sites is dependent on kallsyms, | |
735 | * thus make dump the same restriction. | |
736 | */ | |
737 | return kallsyms_show_value() == 1; | |
738 | } | |
739 | ||
c237ee5e DB |
740 | struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off, |
741 | const struct bpf_insn *patch, u32 len); | |
814abfab | 742 | |
11393cc9 JF |
743 | /* The pair of xdp_do_redirect and xdp_do_flush_map MUST be called in the |
744 | * same cpu context. Further for best results no more than a single map | |
745 | * for the do_redirect/do_flush pair should be used. This limitation is | |
746 | * because we only track one map and force a flush when the map changes. | |
2ddf71e2 | 747 | * This does not appear to be a real limitation for existing software. |
11393cc9 | 748 | */ |
2facaad6 JDB |
749 | int xdp_do_generic_redirect(struct net_device *dev, struct sk_buff *skb, |
750 | struct bpf_prog *prog); | |
5acaee0a JF |
751 | int xdp_do_redirect(struct net_device *dev, |
752 | struct xdp_buff *xdp, | |
753 | struct bpf_prog *prog); | |
11393cc9 | 754 | void xdp_do_flush_map(void); |
814abfab | 755 | |
de8f3a83 DB |
756 | /* Drivers not supporting XDP metadata can use this helper, which |
757 | * rejects any room expansion for metadata as a result. | |
758 | */ | |
759 | static __always_inline void | |
760 | xdp_set_data_meta_invalid(struct xdp_buff *xdp) | |
761 | { | |
762 | xdp->data_meta = xdp->data + 1; | |
763 | } | |
764 | ||
765 | static __always_inline bool | |
766 | xdp_data_meta_unsupported(const struct xdp_buff *xdp) | |
767 | { | |
768 | return unlikely(xdp->data_meta > xdp->data); | |
769 | } | |
770 | ||
6a773a15 | 771 | void bpf_warn_invalid_xdp_action(u32 act); |
c237ee5e | 772 | |
34f79502 | 773 | struct sock *do_sk_redirect_map(struct sk_buff *skb); |
174a79ff | 774 | |
b954d834 | 775 | #ifdef CONFIG_BPF_JIT |
c94987e4 | 776 | extern int bpf_jit_enable; |
4f3446bb | 777 | extern int bpf_jit_harden; |
74451e66 | 778 | extern int bpf_jit_kallsyms; |
c94987e4 | 779 | |
b954d834 DB |
780 | typedef void (*bpf_jit_fill_hole_t)(void *area, unsigned int size); |
781 | ||
782 | struct bpf_binary_header * | |
783 | bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr, | |
784 | unsigned int alignment, | |
785 | bpf_jit_fill_hole_t bpf_fill_ill_insns); | |
786 | void bpf_jit_binary_free(struct bpf_binary_header *hdr); | |
787 | ||
b954d834 DB |
788 | void bpf_jit_free(struct bpf_prog *fp); |
789 | ||
4f3446bb DB |
790 | struct bpf_prog *bpf_jit_blind_constants(struct bpf_prog *fp); |
791 | void bpf_jit_prog_release_other(struct bpf_prog *fp, struct bpf_prog *fp_other); | |
792 | ||
b954d834 DB |
793 | static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen, |
794 | u32 pass, void *image) | |
795 | { | |
b13138ef DB |
796 | pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen, |
797 | proglen, pass, image, current->comm, task_pid_nr(current)); | |
798 | ||
b954d834 DB |
799 | if (image) |
800 | print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET, | |
801 | 16, 1, image, proglen, false); | |
802 | } | |
4f3446bb DB |
803 | |
804 | static inline bool bpf_jit_is_ebpf(void) | |
805 | { | |
806 | # ifdef CONFIG_HAVE_EBPF_JIT | |
807 | return true; | |
808 | # else | |
809 | return false; | |
810 | # endif | |
811 | } | |
812 | ||
81ed18ab AS |
813 | static inline bool ebpf_jit_enabled(void) |
814 | { | |
815 | return bpf_jit_enable && bpf_jit_is_ebpf(); | |
816 | } | |
817 | ||
74451e66 DB |
818 | static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp) |
819 | { | |
820 | return fp->jited && bpf_jit_is_ebpf(); | |
821 | } | |
822 | ||
60b58afc | 823 | static inline bool bpf_jit_blinding_enabled(struct bpf_prog *prog) |
4f3446bb DB |
824 | { |
825 | /* These are the prerequisites, should someone ever have the | |
826 | * idea to call blinding outside of them, we make sure to | |
827 | * bail out. | |
828 | */ | |
829 | if (!bpf_jit_is_ebpf()) | |
830 | return false; | |
60b58afc | 831 | if (!prog->jit_requested) |
4f3446bb DB |
832 | return false; |
833 | if (!bpf_jit_harden) | |
834 | return false; | |
835 | if (bpf_jit_harden == 1 && capable(CAP_SYS_ADMIN)) | |
836 | return false; | |
837 | ||
838 | return true; | |
839 | } | |
74451e66 DB |
840 | |
841 | static inline bool bpf_jit_kallsyms_enabled(void) | |
842 | { | |
843 | /* There are a couple of corner cases where kallsyms should | |
844 | * not be enabled f.e. on hardening. | |
845 | */ | |
846 | if (bpf_jit_harden) | |
847 | return false; | |
848 | if (!bpf_jit_kallsyms) | |
849 | return false; | |
850 | if (bpf_jit_kallsyms == 1) | |
851 | return true; | |
852 | ||
853 | return false; | |
854 | } | |
855 | ||
856 | const char *__bpf_address_lookup(unsigned long addr, unsigned long *size, | |
857 | unsigned long *off, char *sym); | |
858 | bool is_bpf_text_address(unsigned long addr); | |
859 | int bpf_get_kallsym(unsigned int symnum, unsigned long *value, char *type, | |
860 | char *sym); | |
861 | ||
862 | static inline const char * | |
863 | bpf_address_lookup(unsigned long addr, unsigned long *size, | |
864 | unsigned long *off, char **modname, char *sym) | |
865 | { | |
866 | const char *ret = __bpf_address_lookup(addr, size, off, sym); | |
867 | ||
868 | if (ret && modname) | |
869 | *modname = NULL; | |
870 | return ret; | |
871 | } | |
872 | ||
873 | void bpf_prog_kallsyms_add(struct bpf_prog *fp); | |
874 | void bpf_prog_kallsyms_del(struct bpf_prog *fp); | |
875 | ||
876 | #else /* CONFIG_BPF_JIT */ | |
877 | ||
81ed18ab AS |
878 | static inline bool ebpf_jit_enabled(void) |
879 | { | |
880 | return false; | |
881 | } | |
882 | ||
74451e66 DB |
883 | static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp) |
884 | { | |
885 | return false; | |
886 | } | |
887 | ||
b954d834 DB |
888 | static inline void bpf_jit_free(struct bpf_prog *fp) |
889 | { | |
890 | bpf_prog_unlock_free(fp); | |
891 | } | |
74451e66 DB |
892 | |
893 | static inline bool bpf_jit_kallsyms_enabled(void) | |
894 | { | |
895 | return false; | |
896 | } | |
897 | ||
898 | static inline const char * | |
899 | __bpf_address_lookup(unsigned long addr, unsigned long *size, | |
900 | unsigned long *off, char *sym) | |
901 | { | |
902 | return NULL; | |
903 | } | |
904 | ||
905 | static inline bool is_bpf_text_address(unsigned long addr) | |
906 | { | |
907 | return false; | |
908 | } | |
909 | ||
910 | static inline int bpf_get_kallsym(unsigned int symnum, unsigned long *value, | |
911 | char *type, char *sym) | |
912 | { | |
913 | return -ERANGE; | |
914 | } | |
915 | ||
916 | static inline const char * | |
917 | bpf_address_lookup(unsigned long addr, unsigned long *size, | |
918 | unsigned long *off, char **modname, char *sym) | |
919 | { | |
920 | return NULL; | |
921 | } | |
922 | ||
923 | static inline void bpf_prog_kallsyms_add(struct bpf_prog *fp) | |
924 | { | |
925 | } | |
926 | ||
927 | static inline void bpf_prog_kallsyms_del(struct bpf_prog *fp) | |
928 | { | |
929 | } | |
b954d834 DB |
930 | #endif /* CONFIG_BPF_JIT */ |
931 | ||
34805931 DB |
932 | #define BPF_ANC BIT(15) |
933 | ||
55795ef5 RV |
934 | static inline bool bpf_needs_clear_a(const struct sock_filter *first) |
935 | { | |
936 | switch (first->code) { | |
937 | case BPF_RET | BPF_K: | |
938 | case BPF_LD | BPF_W | BPF_LEN: | |
939 | return false; | |
940 | ||
941 | case BPF_LD | BPF_W | BPF_ABS: | |
942 | case BPF_LD | BPF_H | BPF_ABS: | |
943 | case BPF_LD | BPF_B | BPF_ABS: | |
944 | if (first->k == SKF_AD_OFF + SKF_AD_ALU_XOR_X) | |
945 | return true; | |
946 | return false; | |
947 | ||
948 | default: | |
949 | return true; | |
950 | } | |
951 | } | |
952 | ||
34805931 DB |
953 | static inline u16 bpf_anc_helper(const struct sock_filter *ftest) |
954 | { | |
955 | BUG_ON(ftest->code & BPF_ANC); | |
956 | ||
957 | switch (ftest->code) { | |
958 | case BPF_LD | BPF_W | BPF_ABS: | |
959 | case BPF_LD | BPF_H | BPF_ABS: | |
960 | case BPF_LD | BPF_B | BPF_ABS: | |
961 | #define BPF_ANCILLARY(CODE) case SKF_AD_OFF + SKF_AD_##CODE: \ | |
962 | return BPF_ANC | SKF_AD_##CODE | |
963 | switch (ftest->k) { | |
964 | BPF_ANCILLARY(PROTOCOL); | |
965 | BPF_ANCILLARY(PKTTYPE); | |
966 | BPF_ANCILLARY(IFINDEX); | |
967 | BPF_ANCILLARY(NLATTR); | |
968 | BPF_ANCILLARY(NLATTR_NEST); | |
969 | BPF_ANCILLARY(MARK); | |
970 | BPF_ANCILLARY(QUEUE); | |
971 | BPF_ANCILLARY(HATYPE); | |
972 | BPF_ANCILLARY(RXHASH); | |
973 | BPF_ANCILLARY(CPU); | |
974 | BPF_ANCILLARY(ALU_XOR_X); | |
975 | BPF_ANCILLARY(VLAN_TAG); | |
976 | BPF_ANCILLARY(VLAN_TAG_PRESENT); | |
977 | BPF_ANCILLARY(PAY_OFFSET); | |
978 | BPF_ANCILLARY(RANDOM); | |
27cd5452 | 979 | BPF_ANCILLARY(VLAN_TPID); |
34805931 DB |
980 | } |
981 | /* Fallthrough. */ | |
982 | default: | |
983 | return ftest->code; | |
984 | } | |
985 | } | |
986 | ||
9f12fbe6 ZSL |
987 | void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb, |
988 | int k, unsigned int size); | |
989 | ||
990 | static inline void *bpf_load_pointer(const struct sk_buff *skb, int k, | |
991 | unsigned int size, void *buffer) | |
992 | { | |
993 | if (k >= 0) | |
994 | return skb_header_pointer(skb, k, size, buffer); | |
995 | ||
996 | return bpf_internal_load_pointer_neg_helper(skb, k, size); | |
997 | } | |
998 | ||
ea02f941 MS |
999 | static inline int bpf_tell_extensions(void) |
1000 | { | |
37692299 | 1001 | return SKF_AD_MAX; |
ea02f941 MS |
1002 | } |
1003 | ||
40304b2a LB |
1004 | struct bpf_sock_ops_kern { |
1005 | struct sock *sk; | |
1006 | u32 op; | |
1007 | union { | |
de525be2 | 1008 | u32 args[4]; |
40304b2a LB |
1009 | u32 reply; |
1010 | u32 replylong[4]; | |
1011 | }; | |
f19397a5 | 1012 | u32 is_fullsock; |
b73042b8 LB |
1013 | u64 temp; /* temp and everything after is not |
1014 | * initialized to 0 before calling | |
1015 | * the BPF program. New fields that | |
1016 | * should be initialized to 0 should | |
1017 | * be inserted before temp. | |
1018 | * temp is scratch storage used by | |
1019 | * sock_ops_convert_ctx_access | |
1020 | * as temporary storage of a register. | |
1021 | */ | |
40304b2a LB |
1022 | }; |
1023 | ||
1da177e4 | 1024 | #endif /* __LINUX_FILTER_H__ */ |