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>
22 #include <net/sch_generic.h>
24 #include <uapi/linux/filter.h>
25 #include <uapi/linux/bpf.h>
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.
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
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
49 /* Kernel hidden auxiliary/helper register. */
50 #define BPF_REG_AX MAX_BPF_REG
51 #define MAX_BPF_EXT_REG (MAX_BPF_REG + 1)
52 #define MAX_BPF_JIT_REG MAX_BPF_EXT_REG
54 /* unused opcode to mark special call to bpf_tail_call() helper */
55 #define BPF_TAIL_CALL 0xf0
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
61 #define BPF_SYM_ELF_TYPE 't'
63 /* BPF program can access up to 512 bytes of stack space. */
64 #define MAX_BPF_STACK 512
66 /* Helper macros for filter block array initializers. */
68 /* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */
70 #define BPF_ALU64_REG(OP, DST, SRC) \
71 ((struct bpf_insn) { \
72 .code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \
78 #define BPF_ALU32_REG(OP, DST, SRC) \
79 ((struct bpf_insn) { \
80 .code = BPF_ALU | BPF_OP(OP) | BPF_X, \
86 /* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */
88 #define BPF_ALU64_IMM(OP, DST, IMM) \
89 ((struct bpf_insn) { \
90 .code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \
96 #define BPF_ALU32_IMM(OP, DST, IMM) \
97 ((struct bpf_insn) { \
98 .code = BPF_ALU | BPF_OP(OP) | BPF_K, \
104 /* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */
106 #define BPF_ENDIAN(TYPE, DST, LEN) \
107 ((struct bpf_insn) { \
108 .code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \
114 /* Short form of mov, dst_reg = src_reg */
116 #define BPF_MOV64_REG(DST, SRC) \
117 ((struct bpf_insn) { \
118 .code = BPF_ALU64 | BPF_MOV | BPF_X, \
124 #define BPF_MOV32_REG(DST, SRC) \
125 ((struct bpf_insn) { \
126 .code = BPF_ALU | BPF_MOV | BPF_X, \
132 /* Short form of mov, dst_reg = imm32 */
134 #define BPF_MOV64_IMM(DST, IMM) \
135 ((struct bpf_insn) { \
136 .code = BPF_ALU64 | BPF_MOV | BPF_K, \
142 #define BPF_MOV32_IMM(DST, IMM) \
143 ((struct bpf_insn) { \
144 .code = BPF_ALU | BPF_MOV | BPF_K, \
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)
154 #define BPF_LD_IMM64_RAW(DST, SRC, IMM) \
155 ((struct bpf_insn) { \
156 .code = BPF_LD | BPF_DW | BPF_IMM, \
160 .imm = (__u32) (IMM) }), \
161 ((struct bpf_insn) { \
162 .code = 0, /* zero is reserved opcode */ \
166 .imm = ((__u64) (IMM)) >> 32 })
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)
172 /* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
174 #define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \
175 ((struct bpf_insn) { \
176 .code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \
182 #define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \
183 ((struct bpf_insn) { \
184 .code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \
190 /* Direct packet access, R0 = *(uint *) (skb->data + imm32) */
192 #define BPF_LD_ABS(SIZE, IMM) \
193 ((struct bpf_insn) { \
194 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \
200 /* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */
202 #define BPF_LD_IND(SIZE, SRC, IMM) \
203 ((struct bpf_insn) { \
204 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \
210 /* Memory load, dst_reg = *(uint *) (src_reg + off16) */
212 #define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \
213 ((struct bpf_insn) { \
214 .code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \
220 /* Memory store, *(uint *) (dst_reg + off16) = src_reg */
222 #define BPF_STX_MEM(SIZE, DST, SRC, OFF) \
223 ((struct bpf_insn) { \
224 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \
230 /* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */
232 #define BPF_STX_XADD(SIZE, DST, SRC, OFF) \
233 ((struct bpf_insn) { \
234 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD, \
240 /* Memory store, *(uint *) (dst_reg + off16) = imm32 */
242 #define BPF_ST_MEM(SIZE, DST, OFF, IMM) \
243 ((struct bpf_insn) { \
244 .code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \
250 /* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */
252 #define BPF_JMP_REG(OP, DST, SRC, OFF) \
253 ((struct bpf_insn) { \
254 .code = BPF_JMP | BPF_OP(OP) | BPF_X, \
260 /* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */
262 #define BPF_JMP_IMM(OP, DST, IMM, OFF) \
263 ((struct bpf_insn) { \
264 .code = BPF_JMP | BPF_OP(OP) | BPF_K, \
270 /* Unconditional jumps, goto pc + off16 */
272 #define BPF_JMP_A(OFF) \
273 ((struct bpf_insn) { \
274 .code = BPF_JMP | BPF_JA, \
282 #define BPF_EMIT_CALL(FUNC) \
283 ((struct bpf_insn) { \
284 .code = BPF_JMP | BPF_CALL, \
288 .imm = ((FUNC) - __bpf_call_base) })
290 /* Raw code statement block */
292 #define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \
293 ((struct bpf_insn) { \
302 #define BPF_EXIT_INSN() \
303 ((struct bpf_insn) { \
304 .code = BPF_JMP | BPF_EXIT, \
310 /* Internal classic blocks for direct assignment */
312 #define __BPF_STMT(CODE, K) \
313 ((struct sock_filter) BPF_STMT(CODE, K))
315 #define __BPF_JUMP(CODE, K, JT, JF) \
316 ((struct sock_filter) BPF_JUMP(CODE, K, JT, JF))
318 #define bytes_to_bpf_size(bytes) \
320 int bpf_size = -EINVAL; \
322 if (bytes == sizeof(u8)) \
324 else if (bytes == sizeof(u16)) \
326 else if (bytes == sizeof(u32)) \
328 else if (bytes == sizeof(u64)) \
334 #define bpf_size_to_bytes(bpf_size) \
336 int bytes = -EINVAL; \
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); \
350 #define BPF_SIZEOF(type) \
352 const int __size = bytes_to_bpf_size(sizeof(type)); \
353 BUILD_BUG_ON(__size < 0); \
357 #define BPF_FIELD_SIZEOF(type, field) \
359 const int __size = bytes_to_bpf_size(FIELD_SIZEOF(type, field)); \
360 BUILD_BUG_ON(__size < 0); \
364 #define BPF_LDST_BYTES(insn) \
366 const int __size = bpf_size_to_bytes(BPF_SIZE(insn->code)); \
367 WARN_ON(__size < 0); \
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__)
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__)
385 #define __BPF_MAP(n, ...) __BPF_MAP_##n(__VA_ARGS__)
386 #define __BPF_REG(n, ...) __BPF_REG_##n(__VA_ARGS__)
388 #define __BPF_CAST(t, a) \
391 typeof(__builtin_choose_expr(sizeof(t) == sizeof(unsigned long), \
392 (unsigned long)0, (t)0))) a
396 #define __BPF_DECL_ARGS(t, a) t a
397 #define __BPF_DECL_REGS(t, a) u64 a
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)
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__)) \
409 return ____##name(__BPF_MAP(x,__BPF_CAST,__BPF_N,__VA_ARGS__));\
411 static __always_inline \
412 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__))
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__)
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
426 #define bpf_target_off(TYPE, MEMBER, SIZE, PTR_SIZE) \
428 BUILD_BUG_ON(FIELD_SIZEOF(TYPE, MEMBER) != (SIZE)); \
429 *(PTR_SIZE) = (SIZE); \
430 offsetof(TYPE, MEMBER); \
434 /* A struct sock_filter is architecture independent. */
435 struct compat_sock_fprog {
437 compat_uptr_t filter; /* struct sock_filter * */
441 struct sock_fprog_kern {
443 struct sock_filter *filter;
446 struct bpf_binary_header {
452 u16 pages; /* Number of allocated pages */
453 u16 jited:1, /* Is our filter JIT'ed? */
454 locked:1, /* Program image locked? */
455 gpl_compatible:1, /* Is filter GPL compatible? */
456 cb_access:1, /* Is control block accessed? */
457 dst_needed:1; /* Do we need dst entry? */
458 enum bpf_prog_type type; /* Type of BPF program */
459 u32 len; /* Number of filter blocks */
460 u32 jited_len; /* Size of jited insns in bytes */
461 u8 tag[BPF_TAG_SIZE];
462 struct bpf_prog_aux *aux; /* Auxiliary fields */
463 struct sock_fprog_kern *orig_prog; /* Original BPF program */
464 unsigned int (*bpf_func)(const void *ctx,
465 const struct bpf_insn *insn);
466 /* Instructions for interpreter */
468 struct sock_filter insns[0];
469 struct bpf_insn insnsi[0];
476 struct bpf_prog *prog;
479 #define BPF_PROG_RUN(filter, ctx) (*filter->bpf_func)(ctx, filter->insnsi)
481 #define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN
483 struct bpf_skb_data_end {
484 struct qdisc_skb_cb qdisc_cb;
491 void *data_hard_start;
494 /* compute the linear packet data range [data, data_end) which
495 * will be accessed by cls_bpf, act_bpf and lwt programs
497 static inline void bpf_compute_data_end(struct sk_buff *skb)
499 struct bpf_skb_data_end *cb = (struct bpf_skb_data_end *)skb->cb;
501 BUILD_BUG_ON(sizeof(*cb) > FIELD_SIZEOF(struct sk_buff, cb));
502 cb->data_end = skb->data + skb_headlen(skb);
505 static inline u8 *bpf_skb_cb(struct sk_buff *skb)
507 /* eBPF programs may read/write skb->cb[] area to transfer meta
508 * data between tail calls. Since this also needs to work with
509 * tc, that scratch memory is mapped to qdisc_skb_cb's data area.
511 * In some socket filter cases, the cb unfortunately needs to be
512 * saved/restored so that protocol specific skb->cb[] data won't
513 * be lost. In any case, due to unpriviledged eBPF programs
514 * attached to sockets, we need to clear the bpf_skb_cb() area
515 * to not leak previous contents to user space.
517 BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != BPF_SKB_CB_LEN);
518 BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) !=
519 FIELD_SIZEOF(struct qdisc_skb_cb, data));
521 return qdisc_skb_cb(skb)->data;
524 static inline u32 bpf_prog_run_save_cb(const struct bpf_prog *prog,
527 u8 *cb_data = bpf_skb_cb(skb);
528 u8 cb_saved[BPF_SKB_CB_LEN];
531 if (unlikely(prog->cb_access)) {
532 memcpy(cb_saved, cb_data, sizeof(cb_saved));
533 memset(cb_data, 0, sizeof(cb_saved));
536 res = BPF_PROG_RUN(prog, skb);
538 if (unlikely(prog->cb_access))
539 memcpy(cb_data, cb_saved, sizeof(cb_saved));
544 static inline u32 bpf_prog_run_clear_cb(const struct bpf_prog *prog,
547 u8 *cb_data = bpf_skb_cb(skb);
549 if (unlikely(prog->cb_access))
550 memset(cb_data, 0, BPF_SKB_CB_LEN);
552 return BPF_PROG_RUN(prog, skb);
555 static __always_inline u32 bpf_prog_run_xdp(const struct bpf_prog *prog,
556 struct xdp_buff *xdp)
558 /* Caller needs to hold rcu_read_lock() (!), otherwise program
559 * can be released while still running, or map elements could be
560 * freed early while still having concurrent users. XDP fastpath
561 * already takes rcu_read_lock() when fetching the program, so
562 * it's not necessary here anymore.
564 return BPF_PROG_RUN(prog, xdp);
567 static inline u32 bpf_prog_insn_size(const struct bpf_prog *prog)
569 return prog->len * sizeof(struct bpf_insn);
572 static inline u32 bpf_prog_tag_scratch_size(const struct bpf_prog *prog)
574 return round_up(bpf_prog_insn_size(prog) +
575 sizeof(__be64) + 1, SHA_MESSAGE_BYTES);
578 static inline unsigned int bpf_prog_size(unsigned int proglen)
580 return max(sizeof(struct bpf_prog),
581 offsetof(struct bpf_prog, insns[proglen]));
584 static inline bool bpf_prog_was_classic(const struct bpf_prog *prog)
586 /* When classic BPF programs have been loaded and the arch
587 * does not have a classic BPF JIT (anymore), they have been
588 * converted via bpf_migrate_filter() to eBPF and thus always
589 * have an unspec program type.
591 return prog->type == BPF_PROG_TYPE_UNSPEC;
595 bpf_ctx_narrow_access_ok(u32 off, u32 size, const u32 size_default)
598 #ifdef __LITTLE_ENDIAN
599 off_ok = (off & (size_default - 1)) == 0;
601 off_ok = (off & (size_default - 1)) + size == size_default;
603 return off_ok && size <= size_default && (size & (size - 1)) == 0;
606 #define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
608 #ifdef CONFIG_ARCH_HAS_SET_MEMORY
609 static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
612 WARN_ON_ONCE(set_memory_ro((unsigned long)fp, fp->pages));
615 static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
618 WARN_ON_ONCE(set_memory_rw((unsigned long)fp, fp->pages));
619 /* In case set_memory_rw() fails, we want to be the first
620 * to crash here instead of some random place later on.
626 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr)
628 WARN_ON_ONCE(set_memory_ro((unsigned long)hdr, hdr->pages));
631 static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr)
633 WARN_ON_ONCE(set_memory_rw((unsigned long)hdr, hdr->pages));
636 static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
640 static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
644 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header *hdr)
648 static inline void bpf_jit_binary_unlock_ro(struct bpf_binary_header *hdr)
651 #endif /* CONFIG_ARCH_HAS_SET_MEMORY */
653 static inline struct bpf_binary_header *
654 bpf_jit_binary_hdr(const struct bpf_prog *fp)
656 unsigned long real_start = (unsigned long)fp->bpf_func;
657 unsigned long addr = real_start & PAGE_MASK;
662 int sk_filter_trim_cap(struct sock *sk, struct sk_buff *skb, unsigned int cap);
663 static inline int sk_filter(struct sock *sk, struct sk_buff *skb)
665 return sk_filter_trim_cap(sk, skb, 1);
668 struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err);
669 void bpf_prog_free(struct bpf_prog *fp);
671 struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags);
672 struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size,
673 gfp_t gfp_extra_flags);
674 void __bpf_prog_free(struct bpf_prog *fp);
676 static inline void bpf_prog_unlock_free(struct bpf_prog *fp)
678 bpf_prog_unlock_ro(fp);
682 typedef int (*bpf_aux_classic_check_t)(struct sock_filter *filter,
685 int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog);
686 int bpf_prog_create_from_user(struct bpf_prog **pfp, struct sock_fprog *fprog,
687 bpf_aux_classic_check_t trans, bool save_orig);
688 void bpf_prog_destroy(struct bpf_prog *fp);
690 int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
691 int sk_attach_bpf(u32 ufd, struct sock *sk);
692 int sk_reuseport_attach_filter(struct sock_fprog *fprog, struct sock *sk);
693 int sk_reuseport_attach_bpf(u32 ufd, struct sock *sk);
694 int sk_detach_filter(struct sock *sk);
695 int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
698 bool sk_filter_charge(struct sock *sk, struct sk_filter *fp);
699 void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
701 u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
703 struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog);
704 void bpf_jit_compile(struct bpf_prog *prog);
705 bool bpf_helper_changes_pkt_data(void *func);
707 struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off,
708 const struct bpf_insn *patch, u32 len);
710 /* The pair of xdp_do_redirect and xdp_do_flush_map MUST be called in the
711 * same cpu context. Further for best results no more than a single map
712 * for the do_redirect/do_flush pair should be used. This limitation is
713 * because we only track one map and force a flush when the map changes.
714 * This does not appear to be a real limitation for existing software.
716 int xdp_do_generic_redirect(struct net_device *dev, struct sk_buff *skb,
717 struct bpf_prog *prog);
718 int xdp_do_redirect(struct net_device *dev,
719 struct xdp_buff *xdp,
720 struct bpf_prog *prog);
721 void xdp_do_flush_map(void);
723 void bpf_warn_invalid_xdp_action(u32 act);
724 void bpf_warn_invalid_xdp_redirect(u32 ifindex);
726 struct sock *do_sk_redirect_map(struct sk_buff *skb);
728 #ifdef CONFIG_BPF_JIT
729 extern int bpf_jit_enable;
730 extern int bpf_jit_harden;
731 extern int bpf_jit_kallsyms;
732 extern long bpf_jit_limit;
733 extern long bpf_jit_limit_max;
735 typedef void (*bpf_jit_fill_hole_t)(void *area, unsigned int size);
737 struct bpf_binary_header *
738 bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr,
739 unsigned int alignment,
740 bpf_jit_fill_hole_t bpf_fill_ill_insns);
741 void bpf_jit_binary_free(struct bpf_binary_header *hdr);
742 u64 bpf_jit_alloc_exec_limit(void);
743 void *bpf_jit_alloc_exec(unsigned long size);
744 void bpf_jit_free_exec(void *addr);
745 void bpf_jit_free(struct bpf_prog *fp);
747 struct bpf_prog *bpf_jit_blind_constants(struct bpf_prog *fp);
748 void bpf_jit_prog_release_other(struct bpf_prog *fp, struct bpf_prog *fp_other);
750 static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
751 u32 pass, void *image)
753 pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen,
754 proglen, pass, image, current->comm, task_pid_nr(current));
757 print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
758 16, 1, image, proglen, false);
761 static inline bool bpf_jit_is_ebpf(void)
763 # ifdef CONFIG_HAVE_EBPF_JIT
770 static inline bool ebpf_jit_enabled(void)
772 return bpf_jit_enable && bpf_jit_is_ebpf();
775 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)
777 return fp->jited && bpf_jit_is_ebpf();
780 static inline bool bpf_jit_blinding_enabled(void)
782 /* These are the prerequisites, should someone ever have the
783 * idea to call blinding outside of them, we make sure to
786 if (!bpf_jit_is_ebpf())
792 if (bpf_jit_harden == 1 && capable(CAP_SYS_ADMIN))
798 static inline bool bpf_jit_kallsyms_enabled(void)
800 /* There are a couple of corner cases where kallsyms should
801 * not be enabled f.e. on hardening.
805 if (!bpf_jit_kallsyms)
807 if (bpf_jit_kallsyms == 1)
813 const char *__bpf_address_lookup(unsigned long addr, unsigned long *size,
814 unsigned long *off, char *sym);
815 bool is_bpf_text_address(unsigned long addr);
816 int bpf_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
819 static inline const char *
820 bpf_address_lookup(unsigned long addr, unsigned long *size,
821 unsigned long *off, char **modname, char *sym)
823 const char *ret = __bpf_address_lookup(addr, size, off, sym);
830 void bpf_prog_kallsyms_add(struct bpf_prog *fp);
831 void bpf_prog_kallsyms_del(struct bpf_prog *fp);
833 #else /* CONFIG_BPF_JIT */
835 static inline bool ebpf_jit_enabled(void)
840 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog *fp)
845 static inline void bpf_jit_free(struct bpf_prog *fp)
847 bpf_prog_unlock_free(fp);
850 static inline bool bpf_jit_kallsyms_enabled(void)
855 static inline const char *
856 __bpf_address_lookup(unsigned long addr, unsigned long *size,
857 unsigned long *off, char *sym)
862 static inline bool is_bpf_text_address(unsigned long addr)
867 static inline int bpf_get_kallsym(unsigned int symnum, unsigned long *value,
868 char *type, char *sym)
873 static inline const char *
874 bpf_address_lookup(unsigned long addr, unsigned long *size,
875 unsigned long *off, char **modname, char *sym)
880 static inline void bpf_prog_kallsyms_add(struct bpf_prog *fp)
884 static inline void bpf_prog_kallsyms_del(struct bpf_prog *fp)
887 #endif /* CONFIG_BPF_JIT */
889 #define BPF_ANC BIT(15)
891 static inline bool bpf_needs_clear_a(const struct sock_filter *first)
893 switch (first->code) {
894 case BPF_RET | BPF_K:
895 case BPF_LD | BPF_W | BPF_LEN:
898 case BPF_LD | BPF_W | BPF_ABS:
899 case BPF_LD | BPF_H | BPF_ABS:
900 case BPF_LD | BPF_B | BPF_ABS:
901 if (first->k == SKF_AD_OFF + SKF_AD_ALU_XOR_X)
910 static inline u16 bpf_anc_helper(const struct sock_filter *ftest)
912 BUG_ON(ftest->code & BPF_ANC);
914 switch (ftest->code) {
915 case BPF_LD | BPF_W | BPF_ABS:
916 case BPF_LD | BPF_H | BPF_ABS:
917 case BPF_LD | BPF_B | BPF_ABS:
918 #define BPF_ANCILLARY(CODE) case SKF_AD_OFF + SKF_AD_##CODE: \
919 return BPF_ANC | SKF_AD_##CODE
921 BPF_ANCILLARY(PROTOCOL);
922 BPF_ANCILLARY(PKTTYPE);
923 BPF_ANCILLARY(IFINDEX);
924 BPF_ANCILLARY(NLATTR);
925 BPF_ANCILLARY(NLATTR_NEST);
927 BPF_ANCILLARY(QUEUE);
928 BPF_ANCILLARY(HATYPE);
929 BPF_ANCILLARY(RXHASH);
931 BPF_ANCILLARY(ALU_XOR_X);
932 BPF_ANCILLARY(VLAN_TAG);
933 BPF_ANCILLARY(VLAN_TAG_PRESENT);
934 BPF_ANCILLARY(PAY_OFFSET);
935 BPF_ANCILLARY(RANDOM);
936 BPF_ANCILLARY(VLAN_TPID);
944 void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb,
945 int k, unsigned int size);
947 static inline void *bpf_load_pointer(const struct sk_buff *skb, int k,
948 unsigned int size, void *buffer)
951 return skb_header_pointer(skb, k, size, buffer);
953 return bpf_internal_load_pointer_neg_helper(skb, k, size);
956 static inline int bpf_tell_extensions(void)
961 struct bpf_sock_ops_kern {
970 #endif /* __LINUX_FILTER_H__ */