1 /* SPDX-License-Identifier: GPL-2.0 */
3 * Linux Socket Filter Data Structures
5 #ifndef __LINUX_FILTER_H__
6 #define __LINUX_FILTER_H__
10 #include <linux/atomic.h>
11 #include <linux/refcount.h>
12 #include <linux/compat.h>
13 #include <linux/skbuff.h>
14 #include <linux/linkage.h>
15 #include <linux/printk.h>
16 #include <linux/workqueue.h>
17 #include <linux/sched.h>
18 #include <linux/capability.h>
19 #include <linux/cryptohash.h>
20 #include <linux/set_memory.h>
21 #include <linux/kallsyms.h>
23 #include <net/sch_generic.h>
25 #include <uapi/linux/filter.h>
26 #include <uapi/linux/bpf.h>
35 /* ArgX, context and stack frame pointer register positions. Note,
36 * Arg1, Arg2, Arg3, etc are used as argument mappings of function
37 * calls in BPF_CALL instruction.
39 #define BPF_REG_ARG1 BPF_REG_1
40 #define BPF_REG_ARG2 BPF_REG_2
41 #define BPF_REG_ARG3 BPF_REG_3
42 #define BPF_REG_ARG4 BPF_REG_4
43 #define BPF_REG_ARG5 BPF_REG_5
44 #define BPF_REG_CTX BPF_REG_6
45 #define BPF_REG_FP BPF_REG_10
47 /* Additional register mappings for converted user programs. */
48 #define BPF_REG_A BPF_REG_0
49 #define BPF_REG_X BPF_REG_7
50 #define BPF_REG_TMP BPF_REG_8
52 /* Kernel hidden auxiliary/helper register for hardening step.
53 * Only used by eBPF JITs. It's nothing more than a temporary
54 * register that JITs use internally, only that here it's part
55 * of eBPF instructions that have been rewritten for blinding
56 * constants. See JIT pre-step in bpf_jit_blind_constants().
58 #define BPF_REG_AX MAX_BPF_REG
59 #define MAX_BPF_JIT_REG (MAX_BPF_REG + 1)
61 /* unused opcode to mark special call to bpf_tail_call() helper */
62 #define BPF_TAIL_CALL 0xf0
64 /* unused opcode to mark call to interpreter with arguments */
65 #define BPF_CALL_ARGS 0xe0
67 /* As per nm, we expose JITed images as text (code) section for
68 * kallsyms. That way, tools like perf can find it to match
71 #define BPF_SYM_ELF_TYPE 't'
73 /* BPF program can access up to 512 bytes of stack space. */
74 #define MAX_BPF_STACK 512
76 /* Helper macros for filter block array initializers. */
78 /* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */
80 #define BPF_ALU64_REG(OP, DST, SRC) \
81 ((struct bpf_insn) { \
82 .code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \
88 #define BPF_ALU32_REG(OP, DST, SRC) \
89 ((struct bpf_insn) { \
90 .code = BPF_ALU | BPF_OP(OP) | BPF_X, \
96 /* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */
98 #define BPF_ALU64_IMM(OP, DST, IMM) \
99 ((struct bpf_insn) { \
100 .code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \
106 #define BPF_ALU32_IMM(OP, DST, IMM) \
107 ((struct bpf_insn) { \
108 .code = BPF_ALU | BPF_OP(OP) | BPF_K, \
114 /* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */
116 #define BPF_ENDIAN(TYPE, DST, LEN) \
117 ((struct bpf_insn) { \
118 .code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \
124 /* Short form of mov, dst_reg = src_reg */
126 #define BPF_MOV64_REG(DST, SRC) \
127 ((struct bpf_insn) { \
128 .code = BPF_ALU64 | BPF_MOV | BPF_X, \
134 #define BPF_MOV32_REG(DST, SRC) \
135 ((struct bpf_insn) { \
136 .code = BPF_ALU | BPF_MOV | BPF_X, \
142 /* Short form of mov, dst_reg = imm32 */
144 #define BPF_MOV64_IMM(DST, IMM) \
145 ((struct bpf_insn) { \
146 .code = BPF_ALU64 | BPF_MOV | BPF_K, \
152 #define BPF_MOV32_IMM(DST, IMM) \
153 ((struct bpf_insn) { \
154 .code = BPF_ALU | BPF_MOV | BPF_K, \
160 /* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */
161 #define BPF_LD_IMM64(DST, IMM) \
162 BPF_LD_IMM64_RAW(DST, 0, IMM)
164 #define BPF_LD_IMM64_RAW(DST, SRC, IMM) \
165 ((struct bpf_insn) { \
166 .code = BPF_LD | BPF_DW | BPF_IMM, \
170 .imm = (__u32) (IMM) }), \
171 ((struct bpf_insn) { \
172 .code = 0, /* zero is reserved opcode */ \
176 .imm = ((__u64) (IMM)) >> 32 })
178 /* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */
179 #define BPF_LD_MAP_FD(DST, MAP_FD) \
180 BPF_LD_IMM64_RAW(DST, BPF_PSEUDO_MAP_FD, MAP_FD)
182 /* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
184 #define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \
185 ((struct bpf_insn) { \
186 .code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \
192 #define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \
193 ((struct bpf_insn) { \
194 .code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \
200 /* Direct packet access, R0 = *(uint *) (skb->data + imm32) */
202 #define BPF_LD_ABS(SIZE, IMM) \
203 ((struct bpf_insn) { \
204 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \
210 /* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */
212 #define BPF_LD_IND(SIZE, SRC, IMM) \
213 ((struct bpf_insn) { \
214 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \
220 /* Memory load, dst_reg = *(uint *) (src_reg + off16) */
222 #define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \
223 ((struct bpf_insn) { \
224 .code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \
230 /* Memory store, *(uint *) (dst_reg + off16) = src_reg */
232 #define BPF_STX_MEM(SIZE, DST, SRC, OFF) \
233 ((struct bpf_insn) { \
234 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \
240 /* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */
242 #define BPF_STX_XADD(SIZE, DST, SRC, OFF) \
243 ((struct bpf_insn) { \
244 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD, \
250 /* Memory store, *(uint *) (dst_reg + off16) = imm32 */
252 #define BPF_ST_MEM(SIZE, DST, OFF, IMM) \
253 ((struct bpf_insn) { \
254 .code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \
260 /* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */
262 #define BPF_JMP_REG(OP, DST, SRC, OFF) \
263 ((struct bpf_insn) { \
264 .code = BPF_JMP | BPF_OP(OP) | BPF_X, \
270 /* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */
272 #define BPF_JMP_IMM(OP, DST, IMM, OFF) \
273 ((struct bpf_insn) { \
274 .code = BPF_JMP | BPF_OP(OP) | BPF_K, \
280 /* Unconditional jumps, goto pc + off16 */
282 #define BPF_JMP_A(OFF) \
283 ((struct bpf_insn) { \
284 .code = BPF_JMP | BPF_JA, \
292 #define BPF_EMIT_CALL(FUNC) \
293 ((struct bpf_insn) { \
294 .code = BPF_JMP | BPF_CALL, \
298 .imm = ((FUNC) - __bpf_call_base) })
300 /* Raw code statement block */
302 #define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \
303 ((struct bpf_insn) { \
312 #define BPF_EXIT_INSN() \
313 ((struct bpf_insn) { \
314 .code = BPF_JMP | BPF_EXIT, \
320 /* Internal classic blocks for direct assignment */
322 #define __BPF_STMT(CODE, K) \
323 ((struct sock_filter) BPF_STMT(CODE, K))
325 #define __BPF_JUMP(CODE, K, JT, JF) \
326 ((struct sock_filter) BPF_JUMP(CODE, K, JT, JF))
328 #define bytes_to_bpf_size(bytes) \
330 int bpf_size = -EINVAL; \
332 if (bytes == sizeof(u8)) \
334 else if (bytes == sizeof(u16)) \
336 else if (bytes == sizeof(u32)) \
338 else if (bytes == sizeof(u64)) \
344 #define bpf_size_to_bytes(bpf_size) \
346 int bytes = -EINVAL; \
348 if (bpf_size == BPF_B) \
349 bytes = sizeof(u8); \
350 else if (bpf_size == BPF_H) \
351 bytes = sizeof(u16); \
352 else if (bpf_size == BPF_W) \
353 bytes = sizeof(u32); \
354 else if (bpf_size == BPF_DW) \
355 bytes = sizeof(u64); \
360 #define BPF_SIZEOF(type) \
362 const int __size = bytes_to_bpf_size(sizeof(type)); \
363 BUILD_BUG_ON(__size < 0); \
367 #define BPF_FIELD_SIZEOF(type, field) \
369 const int __size = bytes_to_bpf_size(FIELD_SIZEOF(type, field)); \
370 BUILD_BUG_ON(__size < 0); \
374 #define BPF_LDST_BYTES(insn) \
376 const int __size = bpf_size_to_bytes(BPF_SIZE((insn)->code)); \
377 WARN_ON(__size < 0); \
381 #define __BPF_MAP_0(m, v, ...) v
382 #define __BPF_MAP_1(m, v, t, a, ...) m(t, a)
383 #define __BPF_MAP_2(m, v, t, a, ...) m(t, a), __BPF_MAP_1(m, v, __VA_ARGS__)
384 #define __BPF_MAP_3(m, v, t, a, ...) m(t, a), __BPF_MAP_2(m, v, __VA_ARGS__)
385 #define __BPF_MAP_4(m, v, t, a, ...) m(t, a), __BPF_MAP_3(m, v, __VA_ARGS__)
386 #define __BPF_MAP_5(m, v, t, a, ...) m(t, a), __BPF_MAP_4(m, v, __VA_ARGS__)
388 #define __BPF_REG_0(...) __BPF_PAD(5)
389 #define __BPF_REG_1(...) __BPF_MAP(1, __VA_ARGS__), __BPF_PAD(4)
390 #define __BPF_REG_2(...) __BPF_MAP(2, __VA_ARGS__), __BPF_PAD(3)
391 #define __BPF_REG_3(...) __BPF_MAP(3, __VA_ARGS__), __BPF_PAD(2)
392 #define __BPF_REG_4(...) __BPF_MAP(4, __VA_ARGS__), __BPF_PAD(1)
393 #define __BPF_REG_5(...) __BPF_MAP(5, __VA_ARGS__)
395 #define __BPF_MAP(n, ...) __BPF_MAP_##n(__VA_ARGS__)
396 #define __BPF_REG(n, ...) __BPF_REG_##n(__VA_ARGS__)
398 #define __BPF_CAST(t, a) \
401 typeof(__builtin_choose_expr(sizeof(t) == sizeof(unsigned long), \
402 (unsigned long)0, (t)0))) a
406 #define __BPF_DECL_ARGS(t, a) t a
407 #define __BPF_DECL_REGS(t, a) u64 a
409 #define __BPF_PAD(n) \
410 __BPF_MAP(n, __BPF_DECL_ARGS, __BPF_N, u64, __ur_1, u64, __ur_2, \
411 u64, __ur_3, u64, __ur_4, u64, __ur_5)
413 #define BPF_CALL_x(x, name, ...) \
414 static __always_inline \
415 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)); \
416 u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)); \
417 u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)) \
419 return ____##name(__BPF_MAP(x,__BPF_CAST,__BPF_N,__VA_ARGS__));\
421 static __always_inline \
422 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__))
424 #define BPF_CALL_0(name, ...) BPF_CALL_x(0, name, __VA_ARGS__)
425 #define BPF_CALL_1(name, ...) BPF_CALL_x(1, name, __VA_ARGS__)
426 #define BPF_CALL_2(name, ...) BPF_CALL_x(2, name, __VA_ARGS__)
427 #define BPF_CALL_3(name, ...) BPF_CALL_x(3, name, __VA_ARGS__)
428 #define BPF_CALL_4(name, ...) BPF_CALL_x(4, name, __VA_ARGS__)
429 #define BPF_CALL_5(name, ...) BPF_CALL_x(5, name, __VA_ARGS__)
431 #define bpf_ctx_range(TYPE, MEMBER) \
432 offsetof(TYPE, MEMBER) ... offsetofend(TYPE, MEMBER) - 1
433 #define bpf_ctx_range_till(TYPE, MEMBER1, MEMBER2) \
434 offsetof(TYPE, MEMBER1) ... offsetofend(TYPE, MEMBER2) - 1
436 #define bpf_target_off(TYPE, MEMBER, SIZE, PTR_SIZE) \
438 BUILD_BUG_ON(FIELD_SIZEOF(TYPE, MEMBER) != (SIZE)); \
439 *(PTR_SIZE) = (SIZE); \
440 offsetof(TYPE, MEMBER); \
444 /* A struct sock_filter is architecture independent. */
445 struct compat_sock_fprog {
447 compat_uptr_t filter; /* struct sock_filter * */
451 struct sock_fprog_kern {
453 struct sock_filter *filter;
456 struct bpf_binary_header {
462 u16 pages; /* Number of allocated pages */
463 u16 jited:1, /* Is our filter JIT'ed? */
464 jit_requested:1,/* archs need to JIT the prog */
465 locked:1, /* Program image locked? */
466 gpl_compatible:1, /* Is filter GPL compatible? */
467 cb_access:1, /* Is control block accessed? */
468 dst_needed:1, /* Do we need dst entry? */
469 blinded:1, /* Was blinded */
470 is_func:1, /* program is a bpf function */
471 kprobe_override:1; /* Do we override a kprobe? */
472 enum bpf_prog_type type; /* Type of BPF program */
473 enum bpf_attach_type expected_attach_type; /* For some prog types */
474 u32 len; /* Number of filter blocks */
475 u32 jited_len; /* Size of jited insns in bytes */
476 u8 tag[BPF_TAG_SIZE];
477 struct bpf_prog_aux *aux; /* Auxiliary fields */
478 struct sock_fprog_kern *orig_prog; /* Original BPF program */
479 unsigned int (*bpf_func)(const void *ctx,
480 const struct bpf_insn *insn);
481 /* Instructions for interpreter */
483 struct sock_filter insns[0];
484 struct bpf_insn insnsi[0];
491 struct bpf_prog *prog;
494 #define BPF_PROG_RUN(filter, ctx) (*(filter)->bpf_func)(ctx, (filter)->insnsi)
496 #define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN
498 struct bpf_skb_data_end {
499 struct qdisc_skb_cb qdisc_cb;
513 struct scatterlist sg_data[MAX_SKB_FRAGS];
514 bool sg_copy[MAX_SKB_FRAGS];
519 struct list_head list;
522 /* Compute the linear packet data range [data, data_end) which
523 * will be accessed by various program types (cls_bpf, act_bpf,
524 * lwt, ...). Subsystems allowing direct data access must (!)
525 * ensure that cb[] area can be written to when BPF program is
526 * invoked (otherwise cb[] save/restore is necessary).
528 static inline void bpf_compute_data_pointers(struct sk_buff *skb)
530 struct bpf_skb_data_end *cb = (struct bpf_skb_data_end *)skb->cb;
532 BUILD_BUG_ON(sizeof(*cb) > FIELD_SIZEOF(struct sk_buff, cb));
533 cb->data_meta = skb->data - skb_metadata_len(skb);
534 cb->data_end = skb->data + skb_headlen(skb);
537 static inline u8 *bpf_skb_cb(struct sk_buff *skb)
539 /* eBPF programs may read/write skb->cb[] area to transfer meta
540 * data between tail calls. Since this also needs to work with
541 * tc, that scratch memory is mapped to qdisc_skb_cb's data area.
543 * In some socket filter cases, the cb unfortunately needs to be
544 * saved/restored so that protocol specific skb->cb[] data won't
545 * be lost. In any case, due to unpriviledged eBPF programs
546 * attached to sockets, we need to clear the bpf_skb_cb() area
547 * to not leak previous contents to user space.
549 BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != BPF_SKB_CB_LEN);
550 BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) !=
551 FIELD_SIZEOF(struct qdisc_skb_cb, data));
553 return qdisc_skb_cb(skb)->data;
556 static inline u32 bpf_prog_run_save_cb(const struct bpf_prog *prog,
559 u8 *cb_data = bpf_skb_cb(skb);
560 u8 cb_saved[BPF_SKB_CB_LEN];
563 if (unlikely(prog->cb_access)) {
564 memcpy(cb_saved, cb_data, sizeof(cb_saved));
565 memset(cb_data, 0, sizeof(cb_saved));
568 res = BPF_PROG_RUN(prog, skb);
570 if (unlikely(prog->cb_access))
571 memcpy(cb_data, cb_saved, sizeof(cb_saved));
576 static inline u32 bpf_prog_run_clear_cb(const struct bpf_prog *prog,
579 u8 *cb_data = bpf_skb_cb(skb);
581 if (unlikely(prog->cb_access))
582 memset(cb_data, 0, BPF_SKB_CB_LEN);
584 return BPF_PROG_RUN(prog, skb);
587 static __always_inline u32 bpf_prog_run_xdp(const struct bpf_prog *prog,
588 struct xdp_buff *xdp)
590 /* Caller needs to hold rcu_read_lock() (!), otherwise program
591 * can be released while still running, or map elements could be
592 * freed early while still having concurrent users. XDP fastpath
593 * already takes rcu_read_lock() when fetching the program, so
594 * it's not necessary here anymore.
596 return BPF_PROG_RUN(prog, xdp);
599 static inline u32 bpf_prog_insn_size(const struct bpf_prog *prog)
601 return prog->len * sizeof(struct bpf_insn);
604 static inline u32 bpf_prog_tag_scratch_size(const struct bpf_prog *prog)
606 return round_up(bpf_prog_insn_size(prog) +
607 sizeof(__be64) + 1, SHA_MESSAGE_BYTES);
610 static inline unsigned int bpf_prog_size(unsigned int proglen)
612 return max(sizeof(struct bpf_prog),
613 offsetof(struct bpf_prog, insns[proglen]));
616 static inline bool bpf_prog_was_classic(const struct bpf_prog *prog)
618 /* When classic BPF programs have been loaded and the arch
619 * does not have a classic BPF JIT (anymore), they have been
620 * converted via bpf_migrate_filter() to eBPF and thus always
621 * have an unspec program type.
623 return prog->type == BPF_PROG_TYPE_UNSPEC;
627 bpf_ctx_narrow_access_ok(u32 off, u32 size, const u32 size_default)
630 #ifdef __LITTLE_ENDIAN
631 off_ok = (off & (size_default - 1)) == 0;
633 off_ok = (off & (size_default - 1)) + size == size_default;
635 return off_ok && size <= size_default && (size & (size - 1)) == 0;
638 #define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
640 #ifdef CONFIG_ARCH_HAS_SET_MEMORY
641 static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
644 WARN_ON_ONCE(set_memory_ro((unsigned long)fp, fp->pages));
647 static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
650 WARN_ON_ONCE(set_memory_rw((unsigned long)fp, fp->pages));
651 /* In case set_memory_rw() fails, we want to be the first
652 * to crash here instead of some random place later on.
658 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr)
660 WARN_ON_ONCE(set_memory_ro((unsigned long)hdr, hdr->pages));
663 static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr)
665 WARN_ON_ONCE(set_memory_rw((unsigned long)hdr, hdr->pages));
668 static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
672 static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
676 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr)
680 static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr)
683 #endif /* CONFIG_ARCH_HAS_SET_MEMORY */
685 static inline struct bpf_binary_header *
686 bpf_jit_binary_hdr(const struct bpf_prog *fp)
688 unsigned long real_start = (unsigned long)fp->bpf_func;
689 unsigned long addr = real_start & PAGE_MASK;
694 int sk_filter_trim_cap(struct sock *sk, struct sk_buff *skb, unsigned int cap);
695 static inline int sk_filter(struct sock *sk, struct sk_buff *skb)
697 return sk_filter_trim_cap(sk, skb, 1);
700 struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err);
701 void bpf_prog_free(struct bpf_prog *fp);
703 bool bpf_opcode_in_insntable(u8 code);
705 struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags);
706 struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size,
707 gfp_t gfp_extra_flags);
708 void __bpf_prog_free(struct bpf_prog *fp);
710 static inline void bpf_prog_unlock_free(struct bpf_prog *fp)
712 bpf_prog_unlock_ro(fp);
716 typedef int (*bpf_aux_classic_check_t)(struct sock_filter *filter,
719 int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog);
720 int bpf_prog_create_from_user(struct bpf_prog **pfp, struct sock_fprog *fprog,
721 bpf_aux_classic_check_t trans, bool save_orig);
722 void bpf_prog_destroy(struct bpf_prog *fp);
724 int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
725 int sk_attach_bpf(u32 ufd, struct sock *sk);
726 int sk_reuseport_attach_filter(struct sock_fprog *fprog, struct sock *sk);
727 int sk_reuseport_attach_bpf(u32 ufd, struct sock *sk);
728 int sk_detach_filter(struct sock *sk);
729 int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
732 bool sk_filter_charge(struct sock *sk, struct sk_filter *fp);
733 void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
735 u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
736 #define __bpf_call_base_args \
737 ((u64 (*)(u64, u64, u64, u64, u64, const struct bpf_insn *)) \
740 struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog);
741 void bpf_jit_compile(struct bpf_prog *prog);
742 bool bpf_helper_changes_pkt_data(void *func);
744 static inline bool bpf_dump_raw_ok(void)
746 /* Reconstruction of call-sites is dependent on kallsyms,
747 * thus make dump the same restriction.
749 return kallsyms_show_value() == 1;
752 struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off,
753 const struct bpf_insn *patch, u32 len);
755 /* The pair of xdp_do_redirect and xdp_do_flush_map MUST be called in the
756 * same cpu context. Further for best results no more than a single map
757 * for the do_redirect/do_flush pair should be used. This limitation is
758 * because we only track one map and force a flush when the map changes.
759 * This does not appear to be a real limitation for existing software.
761 int xdp_do_generic_redirect(struct net_device *dev, struct sk_buff *skb,
762 struct bpf_prog *prog);
763 int xdp_do_redirect(struct net_device *dev,
764 struct xdp_buff *xdp,
765 struct bpf_prog *prog);
766 void xdp_do_flush_map(void);
768 void bpf_warn_invalid_xdp_action(u32 act);
770 struct sock *do_sk_redirect_map(struct sk_buff *skb);
771 struct sock *do_msg_redirect_map(struct sk_msg_buff *md);
773 #ifdef CONFIG_BPF_JIT
774 extern int bpf_jit_enable;
775 extern int bpf_jit_harden;
776 extern int bpf_jit_kallsyms;
778 typedef void (*bpf_jit_fill_hole_t)(void *area, unsigned int size);
780 struct bpf_binary_header *
781 bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr,
782 unsigned int alignment,
783 bpf_jit_fill_hole_t bpf_fill_ill_insns);
784 void bpf_jit_binary_free(struct bpf_binary_header *hdr);
786 void bpf_jit_free(struct bpf_prog *fp);
788 struct bpf_prog *bpf_jit_blind_constants(struct bpf_prog *fp);
789 void bpf_jit_prog_release_other(struct bpf_prog *fp, struct bpf_prog *fp_other);
791 static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
792 u32 pass, void *image)
794 pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen,
795 proglen, pass, image, current->comm, task_pid_nr(current));
798 print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
799 16, 1, image, proglen, false);
802 static inline bool bpf_jit_is_ebpf(void)
804 # ifdef CONFIG_HAVE_EBPF_JIT
811 static inline bool ebpf_jit_enabled(void)
813 return bpf_jit_enable && bpf_jit_is_ebpf();
816 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)
818 return fp->jited && bpf_jit_is_ebpf();
821 static inline bool bpf_jit_blinding_enabled(struct bpf_prog *prog)
823 /* These are the prerequisites, should someone ever have the
824 * idea to call blinding outside of them, we make sure to
827 if (!bpf_jit_is_ebpf())
829 if (!prog->jit_requested)
833 if (bpf_jit_harden == 1 && capable(CAP_SYS_ADMIN))
839 static inline bool bpf_jit_kallsyms_enabled(void)
841 /* There are a couple of corner cases where kallsyms should
842 * not be enabled f.e. on hardening.
846 if (!bpf_jit_kallsyms)
848 if (bpf_jit_kallsyms == 1)
854 const char *__bpf_address_lookup(unsigned long addr, unsigned long *size,
855 unsigned long *off, char *sym);
856 bool is_bpf_text_address(unsigned long addr);
857 int bpf_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
860 static inline const char *
861 bpf_address_lookup(unsigned long addr, unsigned long *size,
862 unsigned long *off, char **modname, char *sym)
864 const char *ret = __bpf_address_lookup(addr, size, off, sym);
871 void bpf_prog_kallsyms_add(struct bpf_prog *fp);
872 void bpf_prog_kallsyms_del(struct bpf_prog *fp);
874 #else /* CONFIG_BPF_JIT */
876 static inline bool ebpf_jit_enabled(void)
881 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)
886 static inline void bpf_jit_free(struct bpf_prog *fp)
888 bpf_prog_unlock_free(fp);
891 static inline bool bpf_jit_kallsyms_enabled(void)
896 static inline const char *
897 __bpf_address_lookup(unsigned long addr, unsigned long *size,
898 unsigned long *off, char *sym)
903 static inline bool is_bpf_text_address(unsigned long addr)
908 static inline int bpf_get_kallsym(unsigned int symnum, unsigned long *value,
909 char *type, char *sym)
914 static inline const char *
915 bpf_address_lookup(unsigned long addr, unsigned long *size,
916 unsigned long *off, char **modname, char *sym)
921 static inline void bpf_prog_kallsyms_add(struct bpf_prog *fp)
925 static inline void bpf_prog_kallsyms_del(struct bpf_prog *fp)
928 #endif /* CONFIG_BPF_JIT */
930 #define BPF_ANC BIT(15)
932 static inline bool bpf_needs_clear_a(const struct sock_filter *first)
934 switch (first->code) {
935 case BPF_RET | BPF_K:
936 case BPF_LD | BPF_W | BPF_LEN:
939 case BPF_LD | BPF_W | BPF_ABS:
940 case BPF_LD | BPF_H | BPF_ABS:
941 case BPF_LD | BPF_B | BPF_ABS:
942 if (first->k == SKF_AD_OFF + SKF_AD_ALU_XOR_X)
951 static inline u16 bpf_anc_helper(const struct sock_filter *ftest)
953 BUG_ON(ftest->code & BPF_ANC);
955 switch (ftest->code) {
956 case BPF_LD | BPF_W | BPF_ABS:
957 case BPF_LD | BPF_H | BPF_ABS:
958 case BPF_LD | BPF_B | BPF_ABS:
959 #define BPF_ANCILLARY(CODE) case SKF_AD_OFF + SKF_AD_##CODE: \
960 return BPF_ANC | SKF_AD_##CODE
962 BPF_ANCILLARY(PROTOCOL);
963 BPF_ANCILLARY(PKTTYPE);
964 BPF_ANCILLARY(IFINDEX);
965 BPF_ANCILLARY(NLATTR);
966 BPF_ANCILLARY(NLATTR_NEST);
968 BPF_ANCILLARY(QUEUE);
969 BPF_ANCILLARY(HATYPE);
970 BPF_ANCILLARY(RXHASH);
972 BPF_ANCILLARY(ALU_XOR_X);
973 BPF_ANCILLARY(VLAN_TAG);
974 BPF_ANCILLARY(VLAN_TAG_PRESENT);
975 BPF_ANCILLARY(PAY_OFFSET);
976 BPF_ANCILLARY(RANDOM);
977 BPF_ANCILLARY(VLAN_TPID);
985 void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb,
986 int k, unsigned int size);
988 static inline void *bpf_load_pointer(const struct sk_buff *skb, int k,
989 unsigned int size, void *buffer)
992 return skb_header_pointer(skb, k, size, buffer);
994 return bpf_internal_load_pointer_neg_helper(skb, k, size);
997 static inline int bpf_tell_extensions(void)
1002 struct bpf_sock_addr_kern {
1004 struct sockaddr *uaddr;
1005 /* Temporary "register" to make indirect stores to nested structures
1006 * defined above. We need three registers to make such a store, but
1007 * only two (src and dst) are available at convert_ctx_access time
1012 struct bpf_sock_ops_kern {
1021 u64 temp; /* temp and everything after is not
1022 * initialized to 0 before calling
1023 * the BPF program. New fields that
1024 * should be initialized to 0 should
1025 * be inserted before temp.
1026 * temp is scratch storage used by
1027 * sock_ops_convert_ctx_access
1028 * as temporary storage of a register.
1032 #endif /* __LINUX_FILTER_H__ */