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