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/set_memory.h>
20 #include <linux/kallsyms.h>
21 #include <linux/if_vlan.h>
22 #include <linux/vmalloc.h>
23 #include <linux/sockptr.h>
24 #include <crypto/sha1.h>
25 #include <linux/u64_stats_sync.h>
27 #include <net/sch_generic.h>
29 #include <asm/byteorder.h>
30 #include <uapi/linux/filter.h>
31 #include <uapi/linux/bpf.h>
39 struct sock_reuseport
;
41 struct ctl_table_header
;
43 /* ArgX, context and stack frame pointer register positions. Note,
44 * Arg1, Arg2, Arg3, etc are used as argument mappings of function
45 * calls in BPF_CALL instruction.
47 #define BPF_REG_ARG1 BPF_REG_1
48 #define BPF_REG_ARG2 BPF_REG_2
49 #define BPF_REG_ARG3 BPF_REG_3
50 #define BPF_REG_ARG4 BPF_REG_4
51 #define BPF_REG_ARG5 BPF_REG_5
52 #define BPF_REG_CTX BPF_REG_6
53 #define BPF_REG_FP BPF_REG_10
55 /* Additional register mappings for converted user programs. */
56 #define BPF_REG_A BPF_REG_0
57 #define BPF_REG_X BPF_REG_7
58 #define BPF_REG_TMP BPF_REG_2 /* scratch reg */
59 #define BPF_REG_D BPF_REG_8 /* data, callee-saved */
60 #define BPF_REG_H BPF_REG_9 /* hlen, callee-saved */
62 /* Kernel hidden auxiliary/helper register. */
63 #define BPF_REG_AX MAX_BPF_REG
64 #define MAX_BPF_EXT_REG (MAX_BPF_REG + 1)
65 #define MAX_BPF_JIT_REG MAX_BPF_EXT_REG
67 /* unused opcode to mark special call to bpf_tail_call() helper */
68 #define BPF_TAIL_CALL 0xf0
70 /* unused opcode to mark special load instruction. Same as BPF_ABS */
71 #define BPF_PROBE_MEM 0x20
73 /* unused opcode to mark call to interpreter with arguments */
74 #define BPF_CALL_ARGS 0xe0
76 /* unused opcode to mark speculation barrier for mitigating
77 * Speculative Store Bypass
79 #define BPF_NOSPEC 0xc0
81 /* As per nm, we expose JITed images as text (code) section for
82 * kallsyms. That way, tools like perf can find it to match
85 #define BPF_SYM_ELF_TYPE 't'
87 /* BPF program can access up to 512 bytes of stack space. */
88 #define MAX_BPF_STACK 512
90 /* Helper macros for filter block array initializers. */
92 /* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */
94 #define BPF_ALU64_REG(OP, DST, SRC) \
95 ((struct bpf_insn) { \
96 .code = BPF_ALU64 | BPF_OP(OP) | BPF_X, \
102 #define BPF_ALU32_REG(OP, DST, SRC) \
103 ((struct bpf_insn) { \
104 .code = BPF_ALU | BPF_OP(OP) | BPF_X, \
110 /* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */
112 #define BPF_ALU64_IMM(OP, DST, IMM) \
113 ((struct bpf_insn) { \
114 .code = BPF_ALU64 | BPF_OP(OP) | BPF_K, \
120 #define BPF_ALU32_IMM(OP, DST, IMM) \
121 ((struct bpf_insn) { \
122 .code = BPF_ALU | BPF_OP(OP) | BPF_K, \
128 /* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */
130 #define BPF_ENDIAN(TYPE, DST, LEN) \
131 ((struct bpf_insn) { \
132 .code = BPF_ALU | BPF_END | BPF_SRC(TYPE), \
138 /* Short form of mov, dst_reg = src_reg */
140 #define BPF_MOV64_REG(DST, SRC) \
141 ((struct bpf_insn) { \
142 .code = BPF_ALU64 | BPF_MOV | BPF_X, \
148 #define BPF_MOV32_REG(DST, SRC) \
149 ((struct bpf_insn) { \
150 .code = BPF_ALU | BPF_MOV | BPF_X, \
156 /* Short form of mov, dst_reg = imm32 */
158 #define BPF_MOV64_IMM(DST, IMM) \
159 ((struct bpf_insn) { \
160 .code = BPF_ALU64 | BPF_MOV | BPF_K, \
166 #define BPF_MOV32_IMM(DST, IMM) \
167 ((struct bpf_insn) { \
168 .code = BPF_ALU | BPF_MOV | BPF_K, \
174 /* Special form of mov32, used for doing explicit zero extension on dst. */
175 #define BPF_ZEXT_REG(DST) \
176 ((struct bpf_insn) { \
177 .code = BPF_ALU | BPF_MOV | BPF_X, \
183 static inline bool insn_is_zext(const struct bpf_insn
*insn
)
185 return insn
->code
== (BPF_ALU
| BPF_MOV
| BPF_X
) && insn
->imm
== 1;
188 /* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */
189 #define BPF_LD_IMM64(DST, IMM) \
190 BPF_LD_IMM64_RAW(DST, 0, IMM)
192 #define BPF_LD_IMM64_RAW(DST, SRC, IMM) \
193 ((struct bpf_insn) { \
194 .code = BPF_LD | BPF_DW | BPF_IMM, \
198 .imm = (__u32) (IMM) }), \
199 ((struct bpf_insn) { \
200 .code = 0, /* zero is reserved opcode */ \
204 .imm = ((__u64) (IMM)) >> 32 })
206 /* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */
207 #define BPF_LD_MAP_FD(DST, MAP_FD) \
208 BPF_LD_IMM64_RAW(DST, BPF_PSEUDO_MAP_FD, MAP_FD)
210 /* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
212 #define BPF_MOV64_RAW(TYPE, DST, SRC, IMM) \
213 ((struct bpf_insn) { \
214 .code = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE), \
220 #define BPF_MOV32_RAW(TYPE, DST, SRC, IMM) \
221 ((struct bpf_insn) { \
222 .code = BPF_ALU | BPF_MOV | BPF_SRC(TYPE), \
228 /* Direct packet access, R0 = *(uint *) (skb->data + imm32) */
230 #define BPF_LD_ABS(SIZE, IMM) \
231 ((struct bpf_insn) { \
232 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS, \
238 /* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */
240 #define BPF_LD_IND(SIZE, SRC, IMM) \
241 ((struct bpf_insn) { \
242 .code = BPF_LD | BPF_SIZE(SIZE) | BPF_IND, \
248 /* Memory load, dst_reg = *(uint *) (src_reg + off16) */
250 #define BPF_LDX_MEM(SIZE, DST, SRC, OFF) \
251 ((struct bpf_insn) { \
252 .code = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM, \
258 /* Memory store, *(uint *) (dst_reg + off16) = src_reg */
260 #define BPF_STX_MEM(SIZE, DST, SRC, OFF) \
261 ((struct bpf_insn) { \
262 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM, \
272 * BPF_ADD *(uint *) (dst_reg + off16) += src_reg
273 * BPF_AND *(uint *) (dst_reg + off16) &= src_reg
274 * BPF_OR *(uint *) (dst_reg + off16) |= src_reg
275 * BPF_XOR *(uint *) (dst_reg + off16) ^= src_reg
276 * BPF_ADD | BPF_FETCH src_reg = atomic_fetch_add(dst_reg + off16, src_reg);
277 * BPF_AND | BPF_FETCH src_reg = atomic_fetch_and(dst_reg + off16, src_reg);
278 * BPF_OR | BPF_FETCH src_reg = atomic_fetch_or(dst_reg + off16, src_reg);
279 * BPF_XOR | BPF_FETCH src_reg = atomic_fetch_xor(dst_reg + off16, src_reg);
280 * BPF_XCHG src_reg = atomic_xchg(dst_reg + off16, src_reg)
281 * BPF_CMPXCHG r0 = atomic_cmpxchg(dst_reg + off16, r0, src_reg)
284 #define BPF_ATOMIC_OP(SIZE, OP, DST, SRC, OFF) \
285 ((struct bpf_insn) { \
286 .code = BPF_STX | BPF_SIZE(SIZE) | BPF_ATOMIC, \
293 #define BPF_STX_XADD(SIZE, DST, SRC, OFF) BPF_ATOMIC_OP(SIZE, BPF_ADD, DST, SRC, OFF)
295 /* Memory store, *(uint *) (dst_reg + off16) = imm32 */
297 #define BPF_ST_MEM(SIZE, DST, OFF, IMM) \
298 ((struct bpf_insn) { \
299 .code = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM, \
305 /* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */
307 #define BPF_JMP_REG(OP, DST, SRC, OFF) \
308 ((struct bpf_insn) { \
309 .code = BPF_JMP | BPF_OP(OP) | BPF_X, \
315 /* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */
317 #define BPF_JMP_IMM(OP, DST, IMM, OFF) \
318 ((struct bpf_insn) { \
319 .code = BPF_JMP | BPF_OP(OP) | BPF_K, \
325 /* Like BPF_JMP_REG, but with 32-bit wide operands for comparison. */
327 #define BPF_JMP32_REG(OP, DST, SRC, OFF) \
328 ((struct bpf_insn) { \
329 .code = BPF_JMP32 | BPF_OP(OP) | BPF_X, \
335 /* Like BPF_JMP_IMM, but with 32-bit wide operands for comparison. */
337 #define BPF_JMP32_IMM(OP, DST, IMM, OFF) \
338 ((struct bpf_insn) { \
339 .code = BPF_JMP32 | BPF_OP(OP) | BPF_K, \
345 /* Unconditional jumps, goto pc + off16 */
347 #define BPF_JMP_A(OFF) \
348 ((struct bpf_insn) { \
349 .code = BPF_JMP | BPF_JA, \
357 #define BPF_CALL_REL(TGT) \
358 ((struct bpf_insn) { \
359 .code = BPF_JMP | BPF_CALL, \
361 .src_reg = BPF_PSEUDO_CALL, \
367 #define BPF_CAST_CALL(x) \
368 ((u64 (*)(u64, u64, u64, u64, u64))(x))
370 #define BPF_EMIT_CALL(FUNC) \
371 ((struct bpf_insn) { \
372 .code = BPF_JMP | BPF_CALL, \
376 .imm = ((FUNC) - __bpf_call_base) })
378 /* Raw code statement block */
380 #define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM) \
381 ((struct bpf_insn) { \
390 #define BPF_EXIT_INSN() \
391 ((struct bpf_insn) { \
392 .code = BPF_JMP | BPF_EXIT, \
398 /* Speculation barrier */
400 #define BPF_ST_NOSPEC() \
401 ((struct bpf_insn) { \
402 .code = BPF_ST | BPF_NOSPEC, \
408 /* Internal classic blocks for direct assignment */
410 #define __BPF_STMT(CODE, K) \
411 ((struct sock_filter) BPF_STMT(CODE, K))
413 #define __BPF_JUMP(CODE, K, JT, JF) \
414 ((struct sock_filter) BPF_JUMP(CODE, K, JT, JF))
416 #define bytes_to_bpf_size(bytes) \
418 int bpf_size = -EINVAL; \
420 if (bytes == sizeof(u8)) \
422 else if (bytes == sizeof(u16)) \
424 else if (bytes == sizeof(u32)) \
426 else if (bytes == sizeof(u64)) \
432 #define bpf_size_to_bytes(bpf_size) \
434 int bytes = -EINVAL; \
436 if (bpf_size == BPF_B) \
437 bytes = sizeof(u8); \
438 else if (bpf_size == BPF_H) \
439 bytes = sizeof(u16); \
440 else if (bpf_size == BPF_W) \
441 bytes = sizeof(u32); \
442 else if (bpf_size == BPF_DW) \
443 bytes = sizeof(u64); \
448 #define BPF_SIZEOF(type) \
450 const int __size = bytes_to_bpf_size(sizeof(type)); \
451 BUILD_BUG_ON(__size < 0); \
455 #define BPF_FIELD_SIZEOF(type, field) \
457 const int __size = bytes_to_bpf_size(sizeof_field(type, field)); \
458 BUILD_BUG_ON(__size < 0); \
462 #define BPF_LDST_BYTES(insn) \
464 const int __size = bpf_size_to_bytes(BPF_SIZE((insn)->code)); \
465 WARN_ON(__size < 0); \
469 #define __BPF_MAP_0(m, v, ...) v
470 #define __BPF_MAP_1(m, v, t, a, ...) m(t, a)
471 #define __BPF_MAP_2(m, v, t, a, ...) m(t, a), __BPF_MAP_1(m, v, __VA_ARGS__)
472 #define __BPF_MAP_3(m, v, t, a, ...) m(t, a), __BPF_MAP_2(m, v, __VA_ARGS__)
473 #define __BPF_MAP_4(m, v, t, a, ...) m(t, a), __BPF_MAP_3(m, v, __VA_ARGS__)
474 #define __BPF_MAP_5(m, v, t, a, ...) m(t, a), __BPF_MAP_4(m, v, __VA_ARGS__)
476 #define __BPF_REG_0(...) __BPF_PAD(5)
477 #define __BPF_REG_1(...) __BPF_MAP(1, __VA_ARGS__), __BPF_PAD(4)
478 #define __BPF_REG_2(...) __BPF_MAP(2, __VA_ARGS__), __BPF_PAD(3)
479 #define __BPF_REG_3(...) __BPF_MAP(3, __VA_ARGS__), __BPF_PAD(2)
480 #define __BPF_REG_4(...) __BPF_MAP(4, __VA_ARGS__), __BPF_PAD(1)
481 #define __BPF_REG_5(...) __BPF_MAP(5, __VA_ARGS__)
483 #define __BPF_MAP(n, ...) __BPF_MAP_##n(__VA_ARGS__)
484 #define __BPF_REG(n, ...) __BPF_REG_##n(__VA_ARGS__)
486 #define __BPF_CAST(t, a) \
489 typeof(__builtin_choose_expr(sizeof(t) == sizeof(unsigned long), \
490 (unsigned long)0, (t)0))) a
494 #define __BPF_DECL_ARGS(t, a) t a
495 #define __BPF_DECL_REGS(t, a) u64 a
497 #define __BPF_PAD(n) \
498 __BPF_MAP(n, __BPF_DECL_ARGS, __BPF_N, u64, __ur_1, u64, __ur_2, \
499 u64, __ur_3, u64, __ur_4, u64, __ur_5)
501 #define BPF_CALL_x(x, name, ...) \
502 static __always_inline \
503 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)); \
504 typedef u64 (*btf_##name)(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__)); \
505 u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)); \
506 u64 name(__BPF_REG(x, __BPF_DECL_REGS, __BPF_N, __VA_ARGS__)) \
508 return ((btf_##name)____##name)(__BPF_MAP(x,__BPF_CAST,__BPF_N,__VA_ARGS__));\
510 static __always_inline \
511 u64 ____##name(__BPF_MAP(x, __BPF_DECL_ARGS, __BPF_V, __VA_ARGS__))
513 #define BPF_CALL_0(name, ...) BPF_CALL_x(0, name, __VA_ARGS__)
514 #define BPF_CALL_1(name, ...) BPF_CALL_x(1, name, __VA_ARGS__)
515 #define BPF_CALL_2(name, ...) BPF_CALL_x(2, name, __VA_ARGS__)
516 #define BPF_CALL_3(name, ...) BPF_CALL_x(3, name, __VA_ARGS__)
517 #define BPF_CALL_4(name, ...) BPF_CALL_x(4, name, __VA_ARGS__)
518 #define BPF_CALL_5(name, ...) BPF_CALL_x(5, name, __VA_ARGS__)
520 #define bpf_ctx_range(TYPE, MEMBER) \
521 offsetof(TYPE, MEMBER) ... offsetofend(TYPE, MEMBER) - 1
522 #define bpf_ctx_range_till(TYPE, MEMBER1, MEMBER2) \
523 offsetof(TYPE, MEMBER1) ... offsetofend(TYPE, MEMBER2) - 1
524 #if BITS_PER_LONG == 64
525 # define bpf_ctx_range_ptr(TYPE, MEMBER) \
526 offsetof(TYPE, MEMBER) ... offsetofend(TYPE, MEMBER) - 1
528 # define bpf_ctx_range_ptr(TYPE, MEMBER) \
529 offsetof(TYPE, MEMBER) ... offsetof(TYPE, MEMBER) + 8 - 1
530 #endif /* BITS_PER_LONG == 64 */
532 #define bpf_target_off(TYPE, MEMBER, SIZE, PTR_SIZE) \
534 BUILD_BUG_ON(sizeof_field(TYPE, MEMBER) != (SIZE)); \
535 *(PTR_SIZE) = (SIZE); \
536 offsetof(TYPE, MEMBER); \
539 /* A struct sock_filter is architecture independent. */
540 struct compat_sock_fprog
{
542 compat_uptr_t filter
; /* struct sock_filter * */
545 struct sock_fprog_kern
{
547 struct sock_filter
*filter
;
550 /* Some arches need doubleword alignment for their instructions and/or data */
551 #define BPF_IMAGE_ALIGNMENT 8
553 struct bpf_binary_header
{
555 u8 image
[] __aligned(BPF_IMAGE_ALIGNMENT
);
558 struct bpf_prog_stats
{
562 struct u64_stats_sync syncp
;
563 } __aligned(2 * sizeof(u64
));
566 u16 pages
; /* Number of allocated pages */
567 u16 jited
:1, /* Is our filter JIT'ed? */
568 jit_requested
:1,/* archs need to JIT the prog */
569 gpl_compatible
:1, /* Is filter GPL compatible? */
570 cb_access
:1, /* Is control block accessed? */
571 dst_needed
:1, /* Do we need dst entry? */
572 blinded
:1, /* Was blinded */
573 is_func
:1, /* program is a bpf function */
574 kprobe_override
:1, /* Do we override a kprobe? */
575 has_callchain_buf
:1, /* callchain buffer allocated? */
576 enforce_expected_attach_type
:1, /* Enforce expected_attach_type checking at attach time */
577 call_get_stack
:1, /* Do we call bpf_get_stack() or bpf_get_stackid() */
578 call_get_func_ip
:1; /* Do we call get_func_ip() */
579 enum bpf_prog_type type
; /* Type of BPF program */
580 enum bpf_attach_type expected_attach_type
; /* For some prog types */
581 u32 len
; /* Number of filter blocks */
582 u32 jited_len
; /* Size of jited insns in bytes */
583 u8 tag
[BPF_TAG_SIZE
];
584 struct bpf_prog_stats __percpu
*stats
;
585 int __percpu
*active
;
586 unsigned int (*bpf_func
)(const void *ctx
,
587 const struct bpf_insn
*insn
);
588 struct bpf_prog_aux
*aux
; /* Auxiliary fields */
589 struct sock_fprog_kern
*orig_prog
; /* Original BPF program */
590 /* Instructions for interpreter */
591 struct sock_filter insns
[0];
592 struct bpf_insn insnsi
[];
598 struct bpf_prog
*prog
;
601 DECLARE_STATIC_KEY_FALSE(bpf_stats_enabled_key
);
603 typedef unsigned int (*bpf_dispatcher_fn
)(const void *ctx
,
604 const struct bpf_insn
*insnsi
,
605 unsigned int (*bpf_func
)(const void *,
606 const struct bpf_insn
*));
608 static __always_inline u32
__bpf_prog_run(const struct bpf_prog
*prog
,
610 bpf_dispatcher_fn dfunc
)
615 if (static_branch_unlikely(&bpf_stats_enabled_key
)) {
616 struct bpf_prog_stats
*stats
;
617 u64 start
= sched_clock();
619 ret
= dfunc(ctx
, prog
->insnsi
, prog
->bpf_func
);
620 stats
= this_cpu_ptr(prog
->stats
);
621 u64_stats_update_begin(&stats
->syncp
);
623 stats
->nsecs
+= sched_clock() - start
;
624 u64_stats_update_end(&stats
->syncp
);
626 ret
= dfunc(ctx
, prog
->insnsi
, prog
->bpf_func
);
631 static __always_inline u32
bpf_prog_run(const struct bpf_prog
*prog
, const void *ctx
)
633 return __bpf_prog_run(prog
, ctx
, bpf_dispatcher_nop_func
);
637 * Use in preemptible and therefore migratable context to make sure that
638 * the execution of the BPF program runs on one CPU.
640 * This uses migrate_disable/enable() explicitly to document that the
641 * invocation of a BPF program does not require reentrancy protection
642 * against a BPF program which is invoked from a preempting task.
644 * For non RT enabled kernels migrate_disable/enable() maps to
645 * preempt_disable/enable(), i.e. it disables also preemption.
647 static inline u32
bpf_prog_run_pin_on_cpu(const struct bpf_prog
*prog
,
653 ret
= bpf_prog_run(prog
, ctx
);
658 #define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN
660 struct bpf_skb_data_end
{
661 struct qdisc_skb_cb qdisc_cb
;
666 struct bpf_nh_params
{
670 struct in6_addr ipv6_nh
;
674 struct bpf_redirect_info
{
680 enum bpf_map_type map_type
;
682 struct bpf_nh_params nh
;
685 DECLARE_PER_CPU(struct bpf_redirect_info
, bpf_redirect_info
);
687 /* flags for bpf_redirect_info kern_flags */
688 #define BPF_RI_F_RF_NO_DIRECT BIT(0) /* no napi_direct on return_frame */
690 /* Compute the linear packet data range [data, data_end) which
691 * will be accessed by various program types (cls_bpf, act_bpf,
692 * lwt, ...). Subsystems allowing direct data access must (!)
693 * ensure that cb[] area can be written to when BPF program is
694 * invoked (otherwise cb[] save/restore is necessary).
696 static inline void bpf_compute_data_pointers(struct sk_buff
*skb
)
698 struct bpf_skb_data_end
*cb
= (struct bpf_skb_data_end
*)skb
->cb
;
700 BUILD_BUG_ON(sizeof(*cb
) > sizeof_field(struct sk_buff
, cb
));
701 cb
->data_meta
= skb
->data
- skb_metadata_len(skb
);
702 cb
->data_end
= skb
->data
+ skb_headlen(skb
);
705 /* Similar to bpf_compute_data_pointers(), except that save orginal
706 * data in cb->data and cb->meta_data for restore.
708 static inline void bpf_compute_and_save_data_end(
709 struct sk_buff
*skb
, void **saved_data_end
)
711 struct bpf_skb_data_end
*cb
= (struct bpf_skb_data_end
*)skb
->cb
;
713 *saved_data_end
= cb
->data_end
;
714 cb
->data_end
= skb
->data
+ skb_headlen(skb
);
717 /* Restore data saved by bpf_compute_data_pointers(). */
718 static inline void bpf_restore_data_end(
719 struct sk_buff
*skb
, void *saved_data_end
)
721 struct bpf_skb_data_end
*cb
= (struct bpf_skb_data_end
*)skb
->cb
;
723 cb
->data_end
= saved_data_end
;
726 static inline u8
*bpf_skb_cb(struct sk_buff
*skb
)
728 /* eBPF programs may read/write skb->cb[] area to transfer meta
729 * data between tail calls. Since this also needs to work with
730 * tc, that scratch memory is mapped to qdisc_skb_cb's data area.
732 * In some socket filter cases, the cb unfortunately needs to be
733 * saved/restored so that protocol specific skb->cb[] data won't
734 * be lost. In any case, due to unpriviledged eBPF programs
735 * attached to sockets, we need to clear the bpf_skb_cb() area
736 * to not leak previous contents to user space.
738 BUILD_BUG_ON(sizeof_field(struct __sk_buff
, cb
) != BPF_SKB_CB_LEN
);
739 BUILD_BUG_ON(sizeof_field(struct __sk_buff
, cb
) !=
740 sizeof_field(struct qdisc_skb_cb
, data
));
742 return qdisc_skb_cb(skb
)->data
;
745 /* Must be invoked with migration disabled */
746 static inline u32
__bpf_prog_run_save_cb(const struct bpf_prog
*prog
,
749 u8
*cb_data
= bpf_skb_cb(skb
);
750 u8 cb_saved
[BPF_SKB_CB_LEN
];
753 if (unlikely(prog
->cb_access
)) {
754 memcpy(cb_saved
, cb_data
, sizeof(cb_saved
));
755 memset(cb_data
, 0, sizeof(cb_saved
));
758 res
= bpf_prog_run(prog
, skb
);
760 if (unlikely(prog
->cb_access
))
761 memcpy(cb_data
, cb_saved
, sizeof(cb_saved
));
766 static inline u32
bpf_prog_run_save_cb(const struct bpf_prog
*prog
,
772 res
= __bpf_prog_run_save_cb(prog
, skb
);
777 static inline u32
bpf_prog_run_clear_cb(const struct bpf_prog
*prog
,
780 u8
*cb_data
= bpf_skb_cb(skb
);
783 if (unlikely(prog
->cb_access
))
784 memset(cb_data
, 0, BPF_SKB_CB_LEN
);
786 res
= bpf_prog_run_pin_on_cpu(prog
, skb
);
790 DECLARE_BPF_DISPATCHER(xdp
)
792 DECLARE_STATIC_KEY_FALSE(bpf_master_redirect_enabled_key
);
794 u32
xdp_master_redirect(struct xdp_buff
*xdp
);
796 static __always_inline u32
bpf_prog_run_xdp(const struct bpf_prog
*prog
,
797 struct xdp_buff
*xdp
)
799 /* Driver XDP hooks are invoked within a single NAPI poll cycle and thus
800 * under local_bh_disable(), which provides the needed RCU protection
801 * for accessing map entries.
803 u32 act
= __bpf_prog_run(prog
, xdp
, BPF_DISPATCHER_FUNC(xdp
));
805 if (static_branch_unlikely(&bpf_master_redirect_enabled_key
)) {
806 if (act
== XDP_TX
&& netif_is_bond_slave(xdp
->rxq
->dev
))
807 act
= xdp_master_redirect(xdp
);
813 void bpf_prog_change_xdp(struct bpf_prog
*prev_prog
, struct bpf_prog
*prog
);
815 static inline u32
bpf_prog_insn_size(const struct bpf_prog
*prog
)
817 return prog
->len
* sizeof(struct bpf_insn
);
820 static inline u32
bpf_prog_tag_scratch_size(const struct bpf_prog
*prog
)
822 return round_up(bpf_prog_insn_size(prog
) +
823 sizeof(__be64
) + 1, SHA1_BLOCK_SIZE
);
826 static inline unsigned int bpf_prog_size(unsigned int proglen
)
828 return max(sizeof(struct bpf_prog
),
829 offsetof(struct bpf_prog
, insns
[proglen
]));
832 static inline bool bpf_prog_was_classic(const struct bpf_prog
*prog
)
834 /* When classic BPF programs have been loaded and the arch
835 * does not have a classic BPF JIT (anymore), they have been
836 * converted via bpf_migrate_filter() to eBPF and thus always
837 * have an unspec program type.
839 return prog
->type
== BPF_PROG_TYPE_UNSPEC
;
842 static inline u32
bpf_ctx_off_adjust_machine(u32 size
)
844 const u32 size_machine
= sizeof(unsigned long);
846 if (size
> size_machine
&& size
% size_machine
== 0)
853 bpf_ctx_narrow_access_ok(u32 off
, u32 size
, u32 size_default
)
855 return size
<= size_default
&& (size
& (size
- 1)) == 0;
859 bpf_ctx_narrow_access_offset(u32 off
, u32 size
, u32 size_default
)
861 u8 access_off
= off
& (size_default
- 1);
863 #ifdef __LITTLE_ENDIAN
866 return size_default
- (access_off
+ size
);
870 #define bpf_ctx_wide_access_ok(off, size, type, field) \
871 (size == sizeof(__u64) && \
872 off >= offsetof(type, field) && \
873 off + sizeof(__u64) <= offsetofend(type, field) && \
874 off % sizeof(__u64) == 0)
876 #define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
878 static inline void bpf_prog_lock_ro(struct bpf_prog
*fp
)
880 #ifndef CONFIG_BPF_JIT_ALWAYS_ON
882 set_vm_flush_reset_perms(fp
);
883 set_memory_ro((unsigned long)fp
, fp
->pages
);
888 static inline void bpf_jit_binary_lock_ro(struct bpf_binary_header
*hdr
)
890 set_vm_flush_reset_perms(hdr
);
891 set_memory_ro((unsigned long)hdr
, hdr
->pages
);
892 set_memory_x((unsigned long)hdr
, hdr
->pages
);
895 static inline struct bpf_binary_header
*
896 bpf_jit_binary_hdr(const struct bpf_prog
*fp
)
898 unsigned long real_start
= (unsigned long)fp
->bpf_func
;
899 unsigned long addr
= real_start
& PAGE_MASK
;
904 int sk_filter_trim_cap(struct sock
*sk
, struct sk_buff
*skb
, unsigned int cap
);
905 static inline int sk_filter(struct sock
*sk
, struct sk_buff
*skb
)
907 return sk_filter_trim_cap(sk
, skb
, 1);
910 struct bpf_prog
*bpf_prog_select_runtime(struct bpf_prog
*fp
, int *err
);
911 void bpf_prog_free(struct bpf_prog
*fp
);
913 bool bpf_opcode_in_insntable(u8 code
);
915 void bpf_prog_free_linfo(struct bpf_prog
*prog
);
916 void bpf_prog_fill_jited_linfo(struct bpf_prog
*prog
,
917 const u32
*insn_to_jit_off
);
918 int bpf_prog_alloc_jited_linfo(struct bpf_prog
*prog
);
919 void bpf_prog_jit_attempt_done(struct bpf_prog
*prog
);
921 struct bpf_prog
*bpf_prog_alloc(unsigned int size
, gfp_t gfp_extra_flags
);
922 struct bpf_prog
*bpf_prog_alloc_no_stats(unsigned int size
, gfp_t gfp_extra_flags
);
923 struct bpf_prog
*bpf_prog_realloc(struct bpf_prog
*fp_old
, unsigned int size
,
924 gfp_t gfp_extra_flags
);
925 void __bpf_prog_free(struct bpf_prog
*fp
);
927 static inline void bpf_prog_unlock_free(struct bpf_prog
*fp
)
932 typedef int (*bpf_aux_classic_check_t
)(struct sock_filter
*filter
,
935 int bpf_prog_create(struct bpf_prog
**pfp
, struct sock_fprog_kern
*fprog
);
936 int bpf_prog_create_from_user(struct bpf_prog
**pfp
, struct sock_fprog
*fprog
,
937 bpf_aux_classic_check_t trans
, bool save_orig
);
938 void bpf_prog_destroy(struct bpf_prog
*fp
);
940 int sk_attach_filter(struct sock_fprog
*fprog
, struct sock
*sk
);
941 int sk_attach_bpf(u32 ufd
, struct sock
*sk
);
942 int sk_reuseport_attach_filter(struct sock_fprog
*fprog
, struct sock
*sk
);
943 int sk_reuseport_attach_bpf(u32 ufd
, struct sock
*sk
);
944 void sk_reuseport_prog_free(struct bpf_prog
*prog
);
945 int sk_detach_filter(struct sock
*sk
);
946 int sk_get_filter(struct sock
*sk
, struct sock_filter __user
*filter
,
949 bool sk_filter_charge(struct sock
*sk
, struct sk_filter
*fp
);
950 void sk_filter_uncharge(struct sock
*sk
, struct sk_filter
*fp
);
952 u64
__bpf_call_base(u64 r1
, u64 r2
, u64 r3
, u64 r4
, u64 r5
);
953 #define __bpf_call_base_args \
954 ((u64 (*)(u64, u64, u64, u64, u64, const struct bpf_insn *)) \
955 (void *)__bpf_call_base)
957 struct bpf_prog
*bpf_int_jit_compile(struct bpf_prog
*prog
);
958 void bpf_jit_compile(struct bpf_prog
*prog
);
959 bool bpf_jit_needs_zext(void);
960 bool bpf_jit_supports_kfunc_call(void);
961 bool bpf_helper_changes_pkt_data(void *func
);
963 static inline bool bpf_dump_raw_ok(const struct cred
*cred
)
965 /* Reconstruction of call-sites is dependent on kallsyms,
966 * thus make dump the same restriction.
968 return kallsyms_show_value(cred
);
971 struct bpf_prog
*bpf_patch_insn_single(struct bpf_prog
*prog
, u32 off
,
972 const struct bpf_insn
*patch
, u32 len
);
973 int bpf_remove_insns(struct bpf_prog
*prog
, u32 off
, u32 cnt
);
975 void bpf_clear_redirect_map(struct bpf_map
*map
);
977 static inline bool xdp_return_frame_no_direct(void)
979 struct bpf_redirect_info
*ri
= this_cpu_ptr(&bpf_redirect_info
);
981 return ri
->kern_flags
& BPF_RI_F_RF_NO_DIRECT
;
984 static inline void xdp_set_return_frame_no_direct(void)
986 struct bpf_redirect_info
*ri
= this_cpu_ptr(&bpf_redirect_info
);
988 ri
->kern_flags
|= BPF_RI_F_RF_NO_DIRECT
;
991 static inline void xdp_clear_return_frame_no_direct(void)
993 struct bpf_redirect_info
*ri
= this_cpu_ptr(&bpf_redirect_info
);
995 ri
->kern_flags
&= ~BPF_RI_F_RF_NO_DIRECT
;
998 static inline int xdp_ok_fwd_dev(const struct net_device
*fwd
,
1003 if (unlikely(!(fwd
->flags
& IFF_UP
)))
1006 len
= fwd
->mtu
+ fwd
->hard_header_len
+ VLAN_HLEN
;
1013 /* The pair of xdp_do_redirect and xdp_do_flush MUST be called in the
1014 * same cpu context. Further for best results no more than a single map
1015 * for the do_redirect/do_flush pair should be used. This limitation is
1016 * because we only track one map and force a flush when the map changes.
1017 * This does not appear to be a real limitation for existing software.
1019 int xdp_do_generic_redirect(struct net_device
*dev
, struct sk_buff
*skb
,
1020 struct xdp_buff
*xdp
, struct bpf_prog
*prog
);
1021 int xdp_do_redirect(struct net_device
*dev
,
1022 struct xdp_buff
*xdp
,
1023 struct bpf_prog
*prog
);
1024 void xdp_do_flush(void);
1026 /* The xdp_do_flush_map() helper has been renamed to drop the _map suffix, as
1027 * it is no longer only flushing maps. Keep this define for compatibility
1028 * until all drivers are updated - do not use xdp_do_flush_map() in new code!
1030 #define xdp_do_flush_map xdp_do_flush
1032 void bpf_warn_invalid_xdp_action(u32 act
);
1035 struct sock
*bpf_run_sk_reuseport(struct sock_reuseport
*reuse
, struct sock
*sk
,
1036 struct bpf_prog
*prog
, struct sk_buff
*skb
,
1037 struct sock
*migrating_sk
,
1040 static inline struct sock
*
1041 bpf_run_sk_reuseport(struct sock_reuseport
*reuse
, struct sock
*sk
,
1042 struct bpf_prog
*prog
, struct sk_buff
*skb
,
1043 struct sock
*migrating_sk
,
1050 #ifdef CONFIG_BPF_JIT
1051 extern int bpf_jit_enable
;
1052 extern int bpf_jit_harden
;
1053 extern int bpf_jit_kallsyms
;
1054 extern long bpf_jit_limit
;
1056 typedef void (*bpf_jit_fill_hole_t
)(void *area
, unsigned int size
);
1058 struct bpf_binary_header
*
1059 bpf_jit_binary_alloc(unsigned int proglen
, u8
**image_ptr
,
1060 unsigned int alignment
,
1061 bpf_jit_fill_hole_t bpf_fill_ill_insns
);
1062 void bpf_jit_binary_free(struct bpf_binary_header
*hdr
);
1063 u64
bpf_jit_alloc_exec_limit(void);
1064 void *bpf_jit_alloc_exec(unsigned long size
);
1065 void bpf_jit_free_exec(void *addr
);
1066 void bpf_jit_free(struct bpf_prog
*fp
);
1068 int bpf_jit_add_poke_descriptor(struct bpf_prog
*prog
,
1069 struct bpf_jit_poke_descriptor
*poke
);
1071 int bpf_jit_get_func_addr(const struct bpf_prog
*prog
,
1072 const struct bpf_insn
*insn
, bool extra_pass
,
1073 u64
*func_addr
, bool *func_addr_fixed
);
1075 struct bpf_prog
*bpf_jit_blind_constants(struct bpf_prog
*fp
);
1076 void bpf_jit_prog_release_other(struct bpf_prog
*fp
, struct bpf_prog
*fp_other
);
1078 static inline void bpf_jit_dump(unsigned int flen
, unsigned int proglen
,
1079 u32 pass
, void *image
)
1081 pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen
,
1082 proglen
, pass
, image
, current
->comm
, task_pid_nr(current
));
1085 print_hex_dump(KERN_ERR
, "JIT code: ", DUMP_PREFIX_OFFSET
,
1086 16, 1, image
, proglen
, false);
1089 static inline bool bpf_jit_is_ebpf(void)
1091 # ifdef CONFIG_HAVE_EBPF_JIT
1098 static inline bool ebpf_jit_enabled(void)
1100 return bpf_jit_enable
&& bpf_jit_is_ebpf();
1103 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog
*fp
)
1105 return fp
->jited
&& bpf_jit_is_ebpf();
1108 static inline bool bpf_jit_blinding_enabled(struct bpf_prog
*prog
)
1110 /* These are the prerequisites, should someone ever have the
1111 * idea to call blinding outside of them, we make sure to
1114 if (!bpf_jit_is_ebpf())
1116 if (!prog
->jit_requested
)
1118 if (!bpf_jit_harden
)
1120 if (bpf_jit_harden
== 1 && capable(CAP_SYS_ADMIN
))
1126 static inline bool bpf_jit_kallsyms_enabled(void)
1128 /* There are a couple of corner cases where kallsyms should
1129 * not be enabled f.e. on hardening.
1133 if (!bpf_jit_kallsyms
)
1135 if (bpf_jit_kallsyms
== 1)
1141 const char *__bpf_address_lookup(unsigned long addr
, unsigned long *size
,
1142 unsigned long *off
, char *sym
);
1143 bool is_bpf_text_address(unsigned long addr
);
1144 int bpf_get_kallsym(unsigned int symnum
, unsigned long *value
, char *type
,
1147 static inline const char *
1148 bpf_address_lookup(unsigned long addr
, unsigned long *size
,
1149 unsigned long *off
, char **modname
, char *sym
)
1151 const char *ret
= __bpf_address_lookup(addr
, size
, off
, sym
);
1158 void bpf_prog_kallsyms_add(struct bpf_prog
*fp
);
1159 void bpf_prog_kallsyms_del(struct bpf_prog
*fp
);
1161 #else /* CONFIG_BPF_JIT */
1163 static inline bool ebpf_jit_enabled(void)
1168 static inline bool bpf_jit_blinding_enabled(struct bpf_prog
*prog
)
1173 static inline bool bpf_prog_ebpf_jited(const struct bpf_prog
*fp
)
1179 bpf_jit_add_poke_descriptor(struct bpf_prog
*prog
,
1180 struct bpf_jit_poke_descriptor
*poke
)
1185 static inline void bpf_jit_free(struct bpf_prog
*fp
)
1187 bpf_prog_unlock_free(fp
);
1190 static inline bool bpf_jit_kallsyms_enabled(void)
1195 static inline const char *
1196 __bpf_address_lookup(unsigned long addr
, unsigned long *size
,
1197 unsigned long *off
, char *sym
)
1202 static inline bool is_bpf_text_address(unsigned long addr
)
1207 static inline int bpf_get_kallsym(unsigned int symnum
, unsigned long *value
,
1208 char *type
, char *sym
)
1213 static inline const char *
1214 bpf_address_lookup(unsigned long addr
, unsigned long *size
,
1215 unsigned long *off
, char **modname
, char *sym
)
1220 static inline void bpf_prog_kallsyms_add(struct bpf_prog
*fp
)
1224 static inline void bpf_prog_kallsyms_del(struct bpf_prog
*fp
)
1228 #endif /* CONFIG_BPF_JIT */
1230 void bpf_prog_kallsyms_del_all(struct bpf_prog
*fp
);
1232 #define BPF_ANC BIT(15)
1234 static inline bool bpf_needs_clear_a(const struct sock_filter
*first
)
1236 switch (first
->code
) {
1237 case BPF_RET
| BPF_K
:
1238 case BPF_LD
| BPF_W
| BPF_LEN
:
1241 case BPF_LD
| BPF_W
| BPF_ABS
:
1242 case BPF_LD
| BPF_H
| BPF_ABS
:
1243 case BPF_LD
| BPF_B
| BPF_ABS
:
1244 if (first
->k
== SKF_AD_OFF
+ SKF_AD_ALU_XOR_X
)
1253 static inline u16
bpf_anc_helper(const struct sock_filter
*ftest
)
1255 BUG_ON(ftest
->code
& BPF_ANC
);
1257 switch (ftest
->code
) {
1258 case BPF_LD
| BPF_W
| BPF_ABS
:
1259 case BPF_LD
| BPF_H
| BPF_ABS
:
1260 case BPF_LD
| BPF_B
| BPF_ABS
:
1261 #define BPF_ANCILLARY(CODE) case SKF_AD_OFF + SKF_AD_##CODE: \
1262 return BPF_ANC | SKF_AD_##CODE
1264 BPF_ANCILLARY(PROTOCOL
);
1265 BPF_ANCILLARY(PKTTYPE
);
1266 BPF_ANCILLARY(IFINDEX
);
1267 BPF_ANCILLARY(NLATTR
);
1268 BPF_ANCILLARY(NLATTR_NEST
);
1269 BPF_ANCILLARY(MARK
);
1270 BPF_ANCILLARY(QUEUE
);
1271 BPF_ANCILLARY(HATYPE
);
1272 BPF_ANCILLARY(RXHASH
);
1274 BPF_ANCILLARY(ALU_XOR_X
);
1275 BPF_ANCILLARY(VLAN_TAG
);
1276 BPF_ANCILLARY(VLAN_TAG_PRESENT
);
1277 BPF_ANCILLARY(PAY_OFFSET
);
1278 BPF_ANCILLARY(RANDOM
);
1279 BPF_ANCILLARY(VLAN_TPID
);
1287 void *bpf_internal_load_pointer_neg_helper(const struct sk_buff
*skb
,
1288 int k
, unsigned int size
);
1290 static inline int bpf_tell_extensions(void)
1295 struct bpf_sock_addr_kern
{
1297 struct sockaddr
*uaddr
;
1298 /* Temporary "register" to make indirect stores to nested structures
1299 * defined above. We need three registers to make such a store, but
1300 * only two (src and dst) are available at convert_ctx_access time
1303 void *t_ctx
; /* Attach type specific context. */
1306 struct bpf_sock_ops_kern
{
1313 struct sk_buff
*syn_skb
;
1314 struct sk_buff
*skb
;
1318 u8 remaining_opt_len
;
1319 u64 temp
; /* temp and everything after is not
1320 * initialized to 0 before calling
1321 * the BPF program. New fields that
1322 * should be initialized to 0 should
1323 * be inserted before temp.
1324 * temp is scratch storage used by
1325 * sock_ops_convert_ctx_access
1326 * as temporary storage of a register.
1330 struct bpf_sysctl_kern
{
1331 struct ctl_table_header
*head
;
1332 struct ctl_table
*table
;
1340 /* Temporary "register" for indirect stores to ppos. */
1344 #define BPF_SOCKOPT_KERN_BUF_SIZE 32
1345 struct bpf_sockopt_buf
{
1346 u8 data
[BPF_SOCKOPT_KERN_BUF_SIZE
];
1349 struct bpf_sockopt_kern
{
1359 int copy_bpf_fprog_from_user(struct sock_fprog
*dst
, sockptr_t src
, int len
);
1361 struct bpf_sk_lookup_kern
{
1371 const struct in6_addr
*saddr
;
1372 const struct in6_addr
*daddr
;
1374 struct sock
*selected_sk
;
1378 extern struct static_key_false bpf_sk_lookup_enabled
;
1380 /* Runners for BPF_SK_LOOKUP programs to invoke on socket lookup.
1382 * Allowed return values for a BPF SK_LOOKUP program are SK_PASS and
1383 * SK_DROP. Their meaning is as follows:
1385 * SK_PASS && ctx.selected_sk != NULL: use selected_sk as lookup result
1386 * SK_PASS && ctx.selected_sk == NULL: continue to htable-based socket lookup
1387 * SK_DROP : terminate lookup with -ECONNREFUSED
1389 * This macro aggregates return values and selected sockets from
1390 * multiple BPF programs according to following rules in order:
1392 * 1. If any program returned SK_PASS and a non-NULL ctx.selected_sk,
1393 * macro result is SK_PASS and last ctx.selected_sk is used.
1394 * 2. If any program returned SK_DROP return value,
1395 * macro result is SK_DROP.
1396 * 3. Otherwise result is SK_PASS and ctx.selected_sk is NULL.
1398 * Caller must ensure that the prog array is non-NULL, and that the
1399 * array as well as the programs it contains remain valid.
1401 #define BPF_PROG_SK_LOOKUP_RUN_ARRAY(array, ctx, func) \
1403 struct bpf_sk_lookup_kern *_ctx = &(ctx); \
1404 struct bpf_prog_array_item *_item; \
1405 struct sock *_selected_sk = NULL; \
1406 bool _no_reuseport = false; \
1407 struct bpf_prog *_prog; \
1408 bool _all_pass = true; \
1411 migrate_disable(); \
1412 _item = &(array)->items[0]; \
1413 while ((_prog = READ_ONCE(_item->prog))) { \
1414 /* restore most recent selection */ \
1415 _ctx->selected_sk = _selected_sk; \
1416 _ctx->no_reuseport = _no_reuseport; \
1418 _ret = func(_prog, _ctx); \
1419 if (_ret == SK_PASS && _ctx->selected_sk) { \
1420 /* remember last non-NULL socket */ \
1421 _selected_sk = _ctx->selected_sk; \
1422 _no_reuseport = _ctx->no_reuseport; \
1423 } else if (_ret == SK_DROP && _all_pass) { \
1424 _all_pass = false; \
1428 _ctx->selected_sk = _selected_sk; \
1429 _ctx->no_reuseport = _no_reuseport; \
1431 _all_pass || _selected_sk ? SK_PASS : SK_DROP; \
1434 static inline bool bpf_sk_lookup_run_v4(struct net
*net
, int protocol
,
1435 const __be32 saddr
, const __be16 sport
,
1436 const __be32 daddr
, const u16 dport
,
1439 struct bpf_prog_array
*run_array
;
1440 struct sock
*selected_sk
= NULL
;
1441 bool no_reuseport
= false;
1444 run_array
= rcu_dereference(net
->bpf
.run_array
[NETNS_BPF_SK_LOOKUP
]);
1446 struct bpf_sk_lookup_kern ctx
= {
1448 .protocol
= protocol
,
1456 act
= BPF_PROG_SK_LOOKUP_RUN_ARRAY(run_array
, ctx
, bpf_prog_run
);
1457 if (act
== SK_PASS
) {
1458 selected_sk
= ctx
.selected_sk
;
1459 no_reuseport
= ctx
.no_reuseport
;
1461 selected_sk
= ERR_PTR(-ECONNREFUSED
);
1466 return no_reuseport
;
1469 #if IS_ENABLED(CONFIG_IPV6)
1470 static inline bool bpf_sk_lookup_run_v6(struct net
*net
, int protocol
,
1471 const struct in6_addr
*saddr
,
1473 const struct in6_addr
*daddr
,
1477 struct bpf_prog_array
*run_array
;
1478 struct sock
*selected_sk
= NULL
;
1479 bool no_reuseport
= false;
1482 run_array
= rcu_dereference(net
->bpf
.run_array
[NETNS_BPF_SK_LOOKUP
]);
1484 struct bpf_sk_lookup_kern ctx
= {
1486 .protocol
= protocol
,
1494 act
= BPF_PROG_SK_LOOKUP_RUN_ARRAY(run_array
, ctx
, bpf_prog_run
);
1495 if (act
== SK_PASS
) {
1496 selected_sk
= ctx
.selected_sk
;
1497 no_reuseport
= ctx
.no_reuseport
;
1499 selected_sk
= ERR_PTR(-ECONNREFUSED
);
1504 return no_reuseport
;
1506 #endif /* IS_ENABLED(CONFIG_IPV6) */
1508 static __always_inline
int __bpf_xdp_redirect_map(struct bpf_map
*map
, u32 ifindex
,
1509 u64 flags
, const u64 flag_mask
,
1510 void *lookup_elem(struct bpf_map
*map
, u32 key
))
1512 struct bpf_redirect_info
*ri
= this_cpu_ptr(&bpf_redirect_info
);
1513 const u64 action_mask
= XDP_ABORTED
| XDP_DROP
| XDP_PASS
| XDP_TX
;
1515 /* Lower bits of the flags are used as return code on lookup failure */
1516 if (unlikely(flags
& ~(action_mask
| flag_mask
)))
1519 ri
->tgt_value
= lookup_elem(map
, ifindex
);
1520 if (unlikely(!ri
->tgt_value
) && !(flags
& BPF_F_BROADCAST
)) {
1521 /* If the lookup fails we want to clear out the state in the
1522 * redirect_info struct completely, so that if an eBPF program
1523 * performs multiple lookups, the last one always takes
1526 ri
->map_id
= INT_MAX
; /* Valid map id idr range: [1,INT_MAX[ */
1527 ri
->map_type
= BPF_MAP_TYPE_UNSPEC
;
1528 return flags
& action_mask
;
1531 ri
->tgt_index
= ifindex
;
1532 ri
->map_id
= map
->id
;
1533 ri
->map_type
= map
->map_type
;
1535 if (flags
& BPF_F_BROADCAST
) {
1536 WRITE_ONCE(ri
->map
, map
);
1539 WRITE_ONCE(ri
->map
, NULL
);
1543 return XDP_REDIRECT
;
1546 #endif /* __LINUX_FILTER_H__ */