2 * Linux Socket Filter Data Structures
4 #ifndef __LINUX_FILTER_H__
5 #define __LINUX_FILTER_H__
9 #include <linux/atomic.h>
10 #include <linux/refcount.h>
11 #include <linux/compat.h>
12 #include <linux/skbuff.h>
13 #include <linux/linkage.h>
14 #include <linux/printk.h>
15 #include <linux/workqueue.h>
16 #include <linux/sched.h>
17 #include <linux/capability.h>
18 #include <linux/cryptohash.h>
20 #include <net/sch_generic.h>
22 #ifdef CONFIG_ARCH_HAS_SET_MEMORY
23 #include <asm/set_memory.h>
26 #include <uapi/linux/filter.h>
27 #include <uapi/linux/bpf.h>
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.
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
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
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().
57 #define BPF_REG_AX MAX_BPF_REG
58 #define MAX_BPF_JIT_REG (MAX_BPF_REG + 1)
60 /* unused opcode to mark special call to bpf_tail_call() helper */
61 #define BPF_TAIL_CALL 0xf0
63 /* As per nm, we expose JITed images as text (code) section for
64 * kallsyms. That way, tools like perf can find it to match
67 #define BPF_SYM_ELF_TYPE 't'
69 /* BPF program can access up to 512 bytes of stack space. */
70 #define MAX_BPF_STACK 512
72 /* Helper macros for filter block array initializers. */
74 /* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */
76 #define BPF_ALU64_REG(OP, DST, SRC) \
77 ((struct bpf_insn) { \
78 .code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \
84 #define BPF_ALU32_REG(OP, DST, SRC) \
85 ((struct bpf_insn) { \
86 .code = BPF_ALU | BPF_OP(OP) | BPF_X, \
92 /* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */
94 #define BPF_ALU64_IMM(OP, DST, IMM) \
95 ((struct bpf_insn) { \
96 .code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \
102 #define BPF_ALU32_IMM(OP, DST, IMM) \
103 ((struct bpf_insn) { \
104 .code = BPF_ALU | BPF_OP(OP) | BPF_K, \
110 /* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */
112 #define BPF_ENDIAN(TYPE, DST, LEN) \
113 ((struct bpf_insn) { \
114 .code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \
120 /* Short form of mov, dst_reg = src_reg */
122 #define BPF_MOV64_REG(DST, SRC) \
123 ((struct bpf_insn) { \
124 .code = BPF_ALU64 | BPF_MOV | BPF_X, \
130 #define BPF_MOV32_REG(DST, SRC) \
131 ((struct bpf_insn) { \
132 .code = BPF_ALU | BPF_MOV | BPF_X, \
138 /* Short form of mov, dst_reg = imm32 */
140 #define BPF_MOV64_IMM(DST, IMM) \
141 ((struct bpf_insn) { \
142 .code = BPF_ALU64 | BPF_MOV | BPF_K, \
148 #define BPF_MOV32_IMM(DST, IMM) \
149 ((struct bpf_insn) { \
150 .code = BPF_ALU | BPF_MOV | BPF_K, \
156 /* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */
157 #define BPF_LD_IMM64(DST, IMM) \
158 BPF_LD_IMM64_RAW(DST, 0, IMM)
160 #define BPF_LD_IMM64_RAW(DST, SRC, IMM) \
161 ((struct bpf_insn) { \
162 .code = BPF_LD | BPF_DW | BPF_IMM, \
166 .imm = (__u32) (IMM) }), \
167 ((struct bpf_insn) { \
168 .code = 0, /* zero is reserved opcode */ \
172 .imm = ((__u64) (IMM)) >> 32 })
174 /* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */
175 #define BPF_LD_MAP_FD(DST, MAP_FD) \
176 BPF_LD_IMM64_RAW(DST, BPF_PSEUDO_MAP_FD, MAP_FD)
178 /* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
180 #define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \
181 ((struct bpf_insn) { \
182 .code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \
188 #define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \
189 ((struct bpf_insn) { \
190 .code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \
196 /* Direct packet access, R0 = *(uint *) (skb->data + imm32) */
198 #define BPF_LD_ABS(SIZE, IMM) \
199 ((struct bpf_insn) { \
200 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \
206 /* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */
208 #define BPF_LD_IND(SIZE, SRC, IMM) \
209 ((struct bpf_insn) { \
210 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \
216 /* Memory load, dst_reg = *(uint *) (src_reg + off16) */
218 #define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \
219 ((struct bpf_insn) { \
220 .code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \
226 /* Memory store, *(uint *) (dst_reg + off16) = src_reg */
228 #define BPF_STX_MEM(SIZE, DST, SRC, OFF) \
229 ((struct bpf_insn) { \
230 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \
236 /* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */
238 #define BPF_STX_XADD(SIZE, DST, SRC, OFF) \
239 ((struct bpf_insn) { \
240 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD, \
246 /* Memory store, *(uint *) (dst_reg + off16) = imm32 */
248 #define BPF_ST_MEM(SIZE, DST, OFF, IMM) \
249 ((struct bpf_insn) { \
250 .code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \
256 /* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */
258 #define BPF_JMP_REG(OP, DST, SRC, OFF) \
259 ((struct bpf_insn) { \
260 .code = BPF_JMP | BPF_OP(OP) | BPF_X, \
266 /* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */
268 #define BPF_JMP_IMM(OP, DST, IMM, OFF) \
269 ((struct bpf_insn) { \
270 .code = BPF_JMP | BPF_OP(OP) | BPF_K, \
276 /* Unconditional jumps, goto pc + off16 */
278 #define BPF_JMP_A(OFF) \
279 ((struct bpf_insn) { \
280 .code = BPF_JMP | BPF_JA, \
288 #define BPF_EMIT_CALL(FUNC) \
289 ((struct bpf_insn) { \
290 .code = BPF_JMP | BPF_CALL, \
294 .imm = ((FUNC) - __bpf_call_base) })
296 /* Raw code statement block */
298 #define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \
299 ((struct bpf_insn) { \
308 #define BPF_EXIT_INSN() \
309 ((struct bpf_insn) { \
310 .code = BPF_JMP | BPF_EXIT, \
316 /* Internal classic blocks for direct assignment */
318 #define __BPF_STMT(CODE, K) \
319 ((struct sock_filter) BPF_STMT(CODE, K))
321 #define __BPF_JUMP(CODE, K, JT, JF) \
322 ((struct sock_filter) BPF_JUMP(CODE, K, JT, JF))
324 #define bytes_to_bpf_size(bytes) \
326 int bpf_size = -EINVAL; \
328 if (bytes == sizeof(u8)) \
330 else if (bytes == sizeof(u16)) \
332 else if (bytes == sizeof(u32)) \
334 else if (bytes == sizeof(u64)) \
340 #define bpf_size_to_bytes(bpf_size) \
342 int bytes = -EINVAL; \
344 if (bpf_size == BPF_B) \
345 bytes = sizeof(u8); \
346 else if (bpf_size == BPF_H) \
347 bytes = sizeof(u16); \
348 else if (bpf_size == BPF_W) \
349 bytes = sizeof(u32); \
350 else if (bpf_size == BPF_DW) \
351 bytes = sizeof(u64); \
356 #define BPF_SIZEOF(type) \
358 const int __size = bytes_to_bpf_size(sizeof(type)); \
359 BUILD_BUG_ON(__size < 0); \
363 #define BPF_FIELD_SIZEOF(type, field) \
365 const int __size = bytes_to_bpf_size(FIELD_SIZEOF(type, field)); \
366 BUILD_BUG_ON(__size < 0); \
370 #define BPF_LDST_BYTES(insn) \
372 const int __size = bpf_size_to_bytes(BPF_SIZE(insn->code)); \
373 WARN_ON(__size < 0); \
377 #define __BPF_MAP_0(m, v, ...) v
378 #define __BPF_MAP_1(m, v, t, a, ...) m(t, a)
379 #define __BPF_MAP_2(m, v, t, a, ...) m(t, a), __BPF_MAP_1(m, v, __VA_ARGS__)
380 #define __BPF_MAP_3(m, v, t, a, ...) m(t, a), __BPF_MAP_2(m, v, __VA_ARGS__)
381 #define __BPF_MAP_4(m, v, t, a, ...) m(t, a), __BPF_MAP_3(m, v, __VA_ARGS__)
382 #define __BPF_MAP_5(m, v, t, a, ...) m(t, a), __BPF_MAP_4(m, v, __VA_ARGS__)
384 #define __BPF_REG_0(...) __BPF_PAD(5)
385 #define __BPF_REG_1(...) __BPF_MAP(1, __VA_ARGS__), __BPF_PAD(4)
386 #define __BPF_REG_2(...) __BPF_MAP(2, __VA_ARGS__), __BPF_PAD(3)
387 #define __BPF_REG_3(...) __BPF_MAP(3, __VA_ARGS__), __BPF_PAD(2)
388 #define __BPF_REG_4(...) __BPF_MAP(4, __VA_ARGS__), __BPF_PAD(1)
389 #define __BPF_REG_5(...) __BPF_MAP(5, __VA_ARGS__)
391 #define __BPF_MAP(n, ...) __BPF_MAP_##n(__VA_ARGS__)
392 #define __BPF_REG(n, ...) __BPF_REG_##n(__VA_ARGS__)
394 #define __BPF_CAST(t, a) \
397 typeof(__builtin_choose_expr(sizeof(t) == sizeof(unsigned long), \
398 (unsigned long)0, (t)0))) a
402 #define __BPF_DECL_ARGS(t, a) t a
403 #define __BPF_DECL_REGS(t, a) u64 a
405 #define __BPF_PAD(n) \
406 __BPF_MAP(n, __BPF_DECL_ARGS, __BPF_N, u64, __ur_1, u64, __ur_2, \
407 u64, __ur_3, u64, __ur_4, u64, __ur_5)
409 #define BPF_CALL_x(x, name, ...) \
410 static __always_inline \
411 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)); \
412 u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)); \
413 u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)) \
415 return ____##name(__BPF_MAP(x,__BPF_CAST,__BPF_N,__VA_ARGS__));\
417 static __always_inline \
418 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__))
420 #define BPF_CALL_0(name, ...) BPF_CALL_x(0, name, __VA_ARGS__)
421 #define BPF_CALL_1(name, ...) BPF_CALL_x(1, name, __VA_ARGS__)
422 #define BPF_CALL_2(name, ...) BPF_CALL_x(2, name, __VA_ARGS__)
423 #define BPF_CALL_3(name, ...) BPF_CALL_x(3, name, __VA_ARGS__)
424 #define BPF_CALL_4(name, ...) BPF_CALL_x(4, name, __VA_ARGS__)
425 #define BPF_CALL_5(name, ...) BPF_CALL_x(5, name, __VA_ARGS__)
427 #define bpf_ctx_range(TYPE, MEMBER) \
428 offsetof(TYPE, MEMBER) ... offsetofend(TYPE, MEMBER) - 1
429 #define bpf_ctx_range_till(TYPE, MEMBER1, MEMBER2) \
430 offsetof(TYPE, MEMBER1) ... offsetofend(TYPE, MEMBER2) - 1
432 #define bpf_target_off(TYPE, MEMBER, SIZE, PTR_SIZE) \
434 BUILD_BUG_ON(FIELD_SIZEOF(TYPE, MEMBER) != (SIZE)); \
435 *(PTR_SIZE) = (SIZE); \
436 offsetof(TYPE, MEMBER); \
440 /* A struct sock_filter is architecture independent. */
441 struct compat_sock_fprog {
443 compat_uptr_t filter; /* struct sock_filter * */
447 struct sock_fprog_kern {
449 struct sock_filter *filter;
452 struct bpf_binary_header {
458 u16 pages; /* Number of allocated pages */
459 kmemcheck_bitfield_begin(meta);
460 u16 jited:1, /* Is our filter JIT'ed? */
461 locked:1, /* Program image locked? */
462 gpl_compatible:1, /* Is filter GPL compatible? */
463 cb_access:1, /* Is control block accessed? */
464 dst_needed:1; /* Do we need dst entry? */
465 kmemcheck_bitfield_end(meta);
466 enum bpf_prog_type type; /* Type of BPF program */
467 u32 len; /* Number of filter blocks */
468 u32 jited_len; /* Size of jited insns in bytes */
469 u8 tag[BPF_TAG_SIZE];
470 struct bpf_prog_aux *aux; /* Auxiliary fields */
471 struct sock_fprog_kern *orig_prog; /* Original BPF program */
472 unsigned int (*bpf_func)(const void *ctx,
473 const struct bpf_insn *insn);
474 /* Instructions for interpreter */
476 struct sock_filter insns[0];
477 struct bpf_insn insnsi[0];
484 struct bpf_prog *prog;
487 #define BPF_PROG_RUN(filter, ctx) (*filter->bpf_func)(ctx, filter->insnsi)
489 #define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN
491 struct bpf_skb_data_end {
492 struct qdisc_skb_cb qdisc_cb;
499 void *data_hard_start;
502 /* compute the linear packet data range [data, data_end) which
503 * will be accessed by cls_bpf, act_bpf and lwt programs
505 static inline void bpf_compute_data_end(struct sk_buff *skb)
507 struct bpf_skb_data_end *cb = (struct bpf_skb_data_end *)skb->cb;
509 BUILD_BUG_ON(sizeof(*cb) > FIELD_SIZEOF(struct sk_buff, cb));
510 cb->data_end = skb->data + skb_headlen(skb);
513 static inline u8 *bpf_skb_cb(struct sk_buff *skb)
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.
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.
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));
529 return qdisc_skb_cb(skb)->data;
532 static inline u32 bpf_prog_run_save_cb(const struct bpf_prog *prog,
535 u8 *cb_data = bpf_skb_cb(skb);
536 u8 cb_saved[BPF_SKB_CB_LEN];
539 if (unlikely(prog->cb_access)) {
540 memcpy(cb_saved, cb_data, sizeof(cb_saved));
541 memset(cb_data, 0, sizeof(cb_saved));
544 res = BPF_PROG_RUN(prog, skb);
546 if (unlikely(prog->cb_access))
547 memcpy(cb_data, cb_saved, sizeof(cb_saved));
552 static inline u32 bpf_prog_run_clear_cb(const struct bpf_prog *prog,
555 u8 *cb_data = bpf_skb_cb(skb);
557 if (unlikely(prog->cb_access))
558 memset(cb_data, 0, BPF_SKB_CB_LEN);
560 return BPF_PROG_RUN(prog, skb);
563 static __always_inline u32 bpf_prog_run_xdp(const struct bpf_prog *prog,
564 struct xdp_buff *xdp)
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.
572 return BPF_PROG_RUN(prog, xdp);
575 static inline u32 bpf_prog_insn_size(const struct bpf_prog *prog)
577 return prog->len * sizeof(struct bpf_insn);
580 static inline u32 bpf_prog_tag_scratch_size(const struct bpf_prog *prog)
582 return round_up(bpf_prog_insn_size(prog) +
583 sizeof(__be64) + 1, SHA_MESSAGE_BYTES);
586 static inline unsigned int bpf_prog_size(unsigned int proglen)
588 return max(sizeof(struct bpf_prog),
589 offsetof(struct bpf_prog, insns[proglen]));
592 static inline bool bpf_prog_was_classic(const struct bpf_prog *prog)
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.
599 return prog->type == BPF_PROG_TYPE_UNSPEC;
603 bpf_ctx_narrow_access_ok(u32 off, u32 size, const u32 size_default)
606 #ifdef __LITTLE_ENDIAN
607 off_ok = (off & (size_default - 1)) == 0;
609 off_ok = (off & (size_default - 1)) + size == size_default;
611 return off_ok && size <= size_default && (size & (size - 1)) == 0;
614 #define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
616 #ifdef CONFIG_ARCH_HAS_SET_MEMORY
617 static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
620 WARN_ON_ONCE(set_memory_ro((unsigned long)fp, fp->pages));
623 static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
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.
634 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr)
636 WARN_ON_ONCE(set_memory_ro((unsigned long)hdr, hdr->pages));
639 static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr)
641 WARN_ON_ONCE(set_memory_rw((unsigned long)hdr, hdr->pages));
644 static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
648 static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
652 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr)
656 static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr)
659 #endif /* CONFIG_ARCH_HAS_SET_MEMORY */
661 static inline struct bpf_binary_header *
662 bpf_jit_binary_hdr(const struct bpf_prog *fp)
664 unsigned long real_start = (unsigned long)fp->bpf_func;
665 unsigned long addr = real_start & PAGE_MASK;
670 int sk_filter_trim_cap(struct sock *sk, struct sk_buff *skb, unsigned int cap);
671 static inline int sk_filter(struct sock *sk, struct sk_buff *skb)
673 return sk_filter_trim_cap(sk, skb, 1);
676 struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err);
677 void bpf_prog_free(struct bpf_prog *fp);
679 struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags);
680 struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size,
681 gfp_t gfp_extra_flags);
682 void __bpf_prog_free(struct bpf_prog *fp);
684 static inline void bpf_prog_unlock_free(struct bpf_prog *fp)
686 bpf_prog_unlock_ro(fp);
690 typedef int (*bpf_aux_classic_check_t)(struct sock_filter *filter,
693 int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog);
694 int bpf_prog_create_from_user(struct bpf_prog **pfp, struct sock_fprog *fprog,
695 bpf_aux_classic_check_t trans, bool save_orig);
696 void bpf_prog_destroy(struct bpf_prog *fp);
698 int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
699 int sk_attach_bpf(u32 ufd, struct sock *sk);
700 int sk_reuseport_attach_filter(struct sock_fprog *fprog, struct sock *sk);
701 int sk_reuseport_attach_bpf(u32 ufd, struct sock *sk);
702 int sk_detach_filter(struct sock *sk);
703 int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
706 bool sk_filter_charge(struct sock *sk, struct sk_filter *fp);
707 void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
709 u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
711 struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog);
712 void bpf_jit_compile(struct bpf_prog *prog);
713 bool bpf_helper_changes_pkt_data(void *func);
715 struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off,
716 const struct bpf_insn *patch, u32 len);
717 void bpf_warn_invalid_xdp_action(u32 act);
719 #ifdef CONFIG_BPF_JIT
720 extern int bpf_jit_enable;
721 extern int bpf_jit_harden;
722 extern int bpf_jit_kallsyms;
724 typedef void (*bpf_jit_fill_hole_t)(void *area, unsigned int size);
726 struct bpf_binary_header *
727 bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr,
728 unsigned int alignment,
729 bpf_jit_fill_hole_t bpf_fill_ill_insns);
730 void bpf_jit_binary_free(struct bpf_binary_header *hdr);
732 void bpf_jit_free(struct bpf_prog *fp);
734 struct bpf_prog *bpf_jit_blind_constants(struct bpf_prog *fp);
735 void bpf_jit_prog_release_other(struct bpf_prog *fp, struct bpf_prog *fp_other);
737 static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
738 u32 pass, void *image)
740 pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen,
741 proglen, pass, image, current->comm, task_pid_nr(current));
744 print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
745 16, 1, image, proglen, false);
748 static inline bool bpf_jit_is_ebpf(void)
750 # ifdef CONFIG_HAVE_EBPF_JIT
757 static inline bool ebpf_jit_enabled(void)
759 return bpf_jit_enable && bpf_jit_is_ebpf();
762 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)
764 return fp->jited && bpf_jit_is_ebpf();
767 static inline bool bpf_jit_blinding_enabled(void)
769 /* These are the prerequisites, should someone ever have the
770 * idea to call blinding outside of them, we make sure to
773 if (!bpf_jit_is_ebpf())
779 if (bpf_jit_harden == 1 && capable(CAP_SYS_ADMIN))
785 static inline bool bpf_jit_kallsyms_enabled(void)
787 /* There are a couple of corner cases where kallsyms should
788 * not be enabled f.e. on hardening.
792 if (!bpf_jit_kallsyms)
794 if (bpf_jit_kallsyms == 1)
800 const char *__bpf_address_lookup(unsigned long addr, unsigned long *size,
801 unsigned long *off, char *sym);
802 bool is_bpf_text_address(unsigned long addr);
803 int bpf_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
806 static inline const char *
807 bpf_address_lookup(unsigned long addr, unsigned long *size,
808 unsigned long *off, char **modname, char *sym)
810 const char *ret = __bpf_address_lookup(addr, size, off, sym);
817 void bpf_prog_kallsyms_add(struct bpf_prog *fp);
818 void bpf_prog_kallsyms_del(struct bpf_prog *fp);
820 #else /* CONFIG_BPF_JIT */
822 static inline bool ebpf_jit_enabled(void)
827 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)
832 static inline void bpf_jit_free(struct bpf_prog *fp)
834 bpf_prog_unlock_free(fp);
837 static inline bool bpf_jit_kallsyms_enabled(void)
842 static inline const char *
843 __bpf_address_lookup(unsigned long addr, unsigned long *size,
844 unsigned long *off, char *sym)
849 static inline bool is_bpf_text_address(unsigned long addr)
854 static inline int bpf_get_kallsym(unsigned int symnum, unsigned long *value,
855 char *type, char *sym)
860 static inline const char *
861 bpf_address_lookup(unsigned long addr, unsigned long *size,
862 unsigned long *off, char **modname, char *sym)
867 static inline void bpf_prog_kallsyms_add(struct bpf_prog *fp)
871 static inline void bpf_prog_kallsyms_del(struct bpf_prog *fp)
874 #endif /* CONFIG_BPF_JIT */
876 #define BPF_ANC BIT(15)
878 static inline bool bpf_needs_clear_a(const struct sock_filter *first)
880 switch (first->code) {
881 case BPF_RET | BPF_K:
882 case BPF_LD | BPF_W | BPF_LEN:
885 case BPF_LD | BPF_W | BPF_ABS:
886 case BPF_LD | BPF_H | BPF_ABS:
887 case BPF_LD | BPF_B | BPF_ABS:
888 if (first->k == SKF_AD_OFF + SKF_AD_ALU_XOR_X)
897 static inline u16 bpf_anc_helper(const struct sock_filter *ftest)
899 BUG_ON(ftest->code & BPF_ANC);
901 switch (ftest->code) {
902 case BPF_LD | BPF_W | BPF_ABS:
903 case BPF_LD | BPF_H | BPF_ABS:
904 case BPF_LD | BPF_B | BPF_ABS:
905 #define BPF_ANCILLARY(CODE) case SKF_AD_OFF + SKF_AD_##CODE: \
906 return BPF_ANC | SKF_AD_##CODE
908 BPF_ANCILLARY(PROTOCOL);
909 BPF_ANCILLARY(PKTTYPE);
910 BPF_ANCILLARY(IFINDEX);
911 BPF_ANCILLARY(NLATTR);
912 BPF_ANCILLARY(NLATTR_NEST);
914 BPF_ANCILLARY(QUEUE);
915 BPF_ANCILLARY(HATYPE);
916 BPF_ANCILLARY(RXHASH);
918 BPF_ANCILLARY(ALU_XOR_X);
919 BPF_ANCILLARY(VLAN_TAG);
920 BPF_ANCILLARY(VLAN_TAG_PRESENT);
921 BPF_ANCILLARY(PAY_OFFSET);
922 BPF_ANCILLARY(RANDOM);
923 BPF_ANCILLARY(VLAN_TPID);
931 void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb,
932 int k, unsigned int size);
934 static inline void *bpf_load_pointer(const struct sk_buff *skb, int k,
935 unsigned int size, void *buffer)
938 return skb_header_pointer(skb, k, size, buffer);
940 return bpf_internal_load_pointer_neg_helper(skb, k, size);
943 static inline int bpf_tell_extensions(void)
948 struct bpf_sock_ops_kern {
957 #endif /* __LINUX_FILTER_H__ */