2 * Linux Socket Filter - Kernel level socket filtering
4 * Based on the design of the Berkeley Packet Filter. The new
5 * internal format has been designed by PLUMgrid:
7 * Copyright (c) 2011 - 2014 PLUMgrid, http://plumgrid.com
11 * Jay Schulist <jschlst@samba.org>
12 * Alexei Starovoitov <ast@plumgrid.com>
13 * Daniel Borkmann <dborkman@redhat.com>
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version
18 * 2 of the License, or (at your option) any later version.
20 * Andi Kleen - Fix a few bad bugs and races.
21 * Kris Katterjohn - Added many additional checks in bpf_check_classic()
24 #include <linux/filter.h>
25 #include <linux/skbuff.h>
26 #include <linux/vmalloc.h>
27 #include <linux/random.h>
28 #include <linux/moduleloader.h>
29 #include <linux/bpf.h>
30 #include <linux/frame.h>
31 #include <linux/rbtree_latch.h>
32 #include <linux/kallsyms.h>
33 #include <linux/rcupdate.h>
35 #include <asm/unaligned.h>
38 #define BPF_R0 regs[BPF_REG_0]
39 #define BPF_R1 regs[BPF_REG_1]
40 #define BPF_R2 regs[BPF_REG_2]
41 #define BPF_R3 regs[BPF_REG_3]
42 #define BPF_R4 regs[BPF_REG_4]
43 #define BPF_R5 regs[BPF_REG_5]
44 #define BPF_R6 regs[BPF_REG_6]
45 #define BPF_R7 regs[BPF_REG_7]
46 #define BPF_R8 regs[BPF_REG_8]
47 #define BPF_R9 regs[BPF_REG_9]
48 #define BPF_R10 regs[BPF_REG_10]
51 #define DST regs[insn->dst_reg]
52 #define SRC regs[insn->src_reg]
53 #define FP regs[BPF_REG_FP]
54 #define AX regs[BPF_REG_AX]
55 #define ARG1 regs[BPF_REG_ARG1]
56 #define CTX regs[BPF_REG_CTX]
59 /* No hurry in this branch
61 * Exported for the bpf jit load helper.
63 void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb, int k, unsigned int size)
68 ptr = skb_network_header(skb) + k - SKF_NET_OFF;
69 else if (k >= SKF_LL_OFF)
70 ptr = skb_mac_header(skb) + k - SKF_LL_OFF;
72 if (ptr >= skb->head && ptr + size <= skb_tail_pointer(skb))
78 struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags)
80 gfp_t gfp_flags = GFP_KERNEL | __GFP_ZERO | gfp_extra_flags;
81 struct bpf_prog_aux *aux;
84 size = round_up(size, PAGE_SIZE);
85 fp = __vmalloc(size, gfp_flags, PAGE_KERNEL);
89 aux = kzalloc(sizeof(*aux), GFP_KERNEL | gfp_extra_flags);
95 fp->pages = size / PAGE_SIZE;
99 INIT_LIST_HEAD_RCU(&fp->aux->ksym_lnode);
103 EXPORT_SYMBOL_GPL(bpf_prog_alloc);
105 struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size,
106 gfp_t gfp_extra_flags)
108 gfp_t gfp_flags = GFP_KERNEL | __GFP_ZERO | gfp_extra_flags;
113 BUG_ON(fp_old == NULL);
115 size = round_up(size, PAGE_SIZE);
116 pages = size / PAGE_SIZE;
117 if (pages <= fp_old->pages)
120 delta = pages - fp_old->pages;
121 ret = __bpf_prog_charge(fp_old->aux->user, delta);
125 fp = __vmalloc(size, gfp_flags, PAGE_KERNEL);
127 __bpf_prog_uncharge(fp_old->aux->user, delta);
129 memcpy(fp, fp_old, fp_old->pages * PAGE_SIZE);
133 /* We keep fp->aux from fp_old around in the new
134 * reallocated structure.
137 __bpf_prog_free(fp_old);
143 void __bpf_prog_free(struct bpf_prog *fp)
149 int bpf_prog_calc_tag(struct bpf_prog *fp)
151 const u32 bits_offset = SHA_MESSAGE_BYTES - sizeof(__be64);
152 u32 raw_size = bpf_prog_tag_scratch_size(fp);
153 u32 digest[SHA_DIGEST_WORDS];
154 u32 ws[SHA_WORKSPACE_WORDS];
155 u32 i, bsize, psize, blocks;
156 struct bpf_insn *dst;
162 raw = vmalloc(raw_size);
167 memset(ws, 0, sizeof(ws));
169 /* We need to take out the map fd for the digest calculation
170 * since they are unstable from user space side.
173 for (i = 0, was_ld_map = false; i < fp->len; i++) {
174 dst[i] = fp->insnsi[i];
176 dst[i].code == (BPF_LD | BPF_IMM | BPF_DW) &&
177 dst[i].src_reg == BPF_PSEUDO_MAP_FD) {
180 } else if (was_ld_map &&
182 dst[i].dst_reg == 0 &&
183 dst[i].src_reg == 0 &&
192 psize = bpf_prog_insn_size(fp);
193 memset(&raw[psize], 0, raw_size - psize);
196 bsize = round_up(psize, SHA_MESSAGE_BYTES);
197 blocks = bsize / SHA_MESSAGE_BYTES;
199 if (bsize - psize >= sizeof(__be64)) {
200 bits = (__be64 *)(todo + bsize - sizeof(__be64));
202 bits = (__be64 *)(todo + bsize + bits_offset);
205 *bits = cpu_to_be64((psize - 1) << 3);
208 sha_transform(digest, todo, ws);
209 todo += SHA_MESSAGE_BYTES;
212 result = (__force __be32 *)digest;
213 for (i = 0; i < SHA_DIGEST_WORDS; i++)
214 result[i] = cpu_to_be32(digest[i]);
215 memcpy(fp->tag, result, sizeof(fp->tag));
221 static bool bpf_is_jmp_and_has_target(const struct bpf_insn *insn)
223 return BPF_CLASS(insn->code) == BPF_JMP &&
224 /* Call and Exit are both special jumps with no
225 * target inside the BPF instruction image.
227 BPF_OP(insn->code) != BPF_CALL &&
228 BPF_OP(insn->code) != BPF_EXIT;
231 static void bpf_adj_branches(struct bpf_prog *prog, u32 pos, u32 delta)
233 struct bpf_insn *insn = prog->insnsi;
234 u32 i, insn_cnt = prog->len;
236 for (i = 0; i < insn_cnt; i++, insn++) {
237 if (!bpf_is_jmp_and_has_target(insn))
240 /* Adjust offset of jmps if we cross boundaries. */
241 if (i < pos && i + insn->off + 1 > pos)
243 else if (i > pos + delta && i + insn->off + 1 <= pos + delta)
248 struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off,
249 const struct bpf_insn *patch, u32 len)
251 u32 insn_adj_cnt, insn_rest, insn_delta = len - 1;
252 struct bpf_prog *prog_adj;
254 /* Since our patchlet doesn't expand the image, we're done. */
255 if (insn_delta == 0) {
256 memcpy(prog->insnsi + off, patch, sizeof(*patch));
260 insn_adj_cnt = prog->len + insn_delta;
262 /* Several new instructions need to be inserted. Make room
263 * for them. Likely, there's no need for a new allocation as
264 * last page could have large enough tailroom.
266 prog_adj = bpf_prog_realloc(prog, bpf_prog_size(insn_adj_cnt),
271 prog_adj->len = insn_adj_cnt;
273 /* Patching happens in 3 steps:
275 * 1) Move over tail of insnsi from next instruction onwards,
276 * so we can patch the single target insn with one or more
277 * new ones (patching is always from 1 to n insns, n > 0).
278 * 2) Inject new instructions at the target location.
279 * 3) Adjust branch offsets if necessary.
281 insn_rest = insn_adj_cnt - off - len;
283 memmove(prog_adj->insnsi + off + len, prog_adj->insnsi + off + 1,
284 sizeof(*patch) * insn_rest);
285 memcpy(prog_adj->insnsi + off, patch, sizeof(*patch) * len);
287 bpf_adj_branches(prog_adj, off, insn_delta);
292 #ifdef CONFIG_BPF_JIT
293 /* All BPF JIT sysctl knobs here. */
294 int bpf_jit_enable __read_mostly = IS_BUILTIN(CONFIG_BPF_JIT_ALWAYS_ON);
295 int bpf_jit_harden __read_mostly;
296 int bpf_jit_kallsyms __read_mostly;
297 long bpf_jit_limit __read_mostly;
299 static __always_inline void
300 bpf_get_prog_addr_region(const struct bpf_prog *prog,
301 unsigned long *symbol_start,
302 unsigned long *symbol_end)
304 const struct bpf_binary_header *hdr = bpf_jit_binary_hdr(prog);
305 unsigned long addr = (unsigned long)hdr;
307 WARN_ON_ONCE(!bpf_prog_ebpf_jited(prog));
309 *symbol_start = addr;
310 *symbol_end = addr + hdr->pages * PAGE_SIZE;
313 static void bpf_get_prog_name(const struct bpf_prog *prog, char *sym)
315 BUILD_BUG_ON(sizeof("bpf_prog_") +
316 sizeof(prog->tag) * 2 + 1 > KSYM_NAME_LEN);
318 sym += snprintf(sym, KSYM_NAME_LEN, "bpf_prog_");
319 sym = bin2hex(sym, prog->tag, sizeof(prog->tag));
323 static __always_inline unsigned long
324 bpf_get_prog_addr_start(struct latch_tree_node *n)
326 unsigned long symbol_start, symbol_end;
327 const struct bpf_prog_aux *aux;
329 aux = container_of(n, struct bpf_prog_aux, ksym_tnode);
330 bpf_get_prog_addr_region(aux->prog, &symbol_start, &symbol_end);
335 static __always_inline bool bpf_tree_less(struct latch_tree_node *a,
336 struct latch_tree_node *b)
338 return bpf_get_prog_addr_start(a) < bpf_get_prog_addr_start(b);
341 static __always_inline int bpf_tree_comp(void *key, struct latch_tree_node *n)
343 unsigned long val = (unsigned long)key;
344 unsigned long symbol_start, symbol_end;
345 const struct bpf_prog_aux *aux;
347 aux = container_of(n, struct bpf_prog_aux, ksym_tnode);
348 bpf_get_prog_addr_region(aux->prog, &symbol_start, &symbol_end);
350 if (val < symbol_start)
352 if (val >= symbol_end)
358 static const struct latch_tree_ops bpf_tree_ops = {
359 .less = bpf_tree_less,
360 .comp = bpf_tree_comp,
363 static DEFINE_SPINLOCK(bpf_lock);
364 static LIST_HEAD(bpf_kallsyms);
365 static struct latch_tree_root bpf_tree __cacheline_aligned;
367 static void bpf_prog_ksym_node_add(struct bpf_prog_aux *aux)
369 WARN_ON_ONCE(!list_empty(&aux->ksym_lnode));
370 list_add_tail_rcu(&aux->ksym_lnode, &bpf_kallsyms);
371 latch_tree_insert(&aux->ksym_tnode, &bpf_tree, &bpf_tree_ops);
374 static void bpf_prog_ksym_node_del(struct bpf_prog_aux *aux)
376 if (list_empty(&aux->ksym_lnode))
379 latch_tree_erase(&aux->ksym_tnode, &bpf_tree, &bpf_tree_ops);
380 list_del_rcu(&aux->ksym_lnode);
383 static bool bpf_prog_kallsyms_candidate(const struct bpf_prog *fp)
385 return fp->jited && !bpf_prog_was_classic(fp);
388 static bool bpf_prog_kallsyms_verify_off(const struct bpf_prog *fp)
390 return list_empty(&fp->aux->ksym_lnode) ||
391 fp->aux->ksym_lnode.prev == LIST_POISON2;
394 void bpf_prog_kallsyms_add(struct bpf_prog *fp)
396 if (!bpf_prog_kallsyms_candidate(fp) ||
397 !capable(CAP_SYS_ADMIN))
400 spin_lock_bh(&bpf_lock);
401 bpf_prog_ksym_node_add(fp->aux);
402 spin_unlock_bh(&bpf_lock);
405 void bpf_prog_kallsyms_del(struct bpf_prog *fp)
407 if (!bpf_prog_kallsyms_candidate(fp))
410 spin_lock_bh(&bpf_lock);
411 bpf_prog_ksym_node_del(fp->aux);
412 spin_unlock_bh(&bpf_lock);
415 static struct bpf_prog *bpf_prog_kallsyms_find(unsigned long addr)
417 struct latch_tree_node *n;
419 if (!bpf_jit_kallsyms_enabled())
422 n = latch_tree_find((void *)addr, &bpf_tree, &bpf_tree_ops);
424 container_of(n, struct bpf_prog_aux, ksym_tnode)->prog :
428 const char *__bpf_address_lookup(unsigned long addr, unsigned long *size,
429 unsigned long *off, char *sym)
431 unsigned long symbol_start, symbol_end;
432 struct bpf_prog *prog;
436 prog = bpf_prog_kallsyms_find(addr);
438 bpf_get_prog_addr_region(prog, &symbol_start, &symbol_end);
439 bpf_get_prog_name(prog, sym);
443 *size = symbol_end - symbol_start;
445 *off = addr - symbol_start;
452 bool is_bpf_text_address(unsigned long addr)
457 ret = bpf_prog_kallsyms_find(addr) != NULL;
463 int bpf_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
466 unsigned long symbol_start, symbol_end;
467 struct bpf_prog_aux *aux;
471 if (!bpf_jit_kallsyms_enabled())
475 list_for_each_entry_rcu(aux, &bpf_kallsyms, ksym_lnode) {
479 bpf_get_prog_addr_region(aux->prog, &symbol_start, &symbol_end);
480 bpf_get_prog_name(aux->prog, sym);
482 *value = symbol_start;
483 *type = BPF_SYM_ELF_TYPE;
493 static atomic_long_t bpf_jit_current;
495 /* Can be overridden by an arch's JIT compiler if it has a custom,
496 * dedicated BPF backend memory area, or if neither of the two
499 u64 __weak bpf_jit_alloc_exec_limit(void)
501 #if defined(MODULES_VADDR)
502 return MODULES_END - MODULES_VADDR;
504 return VMALLOC_END - VMALLOC_START;
508 static int __init bpf_jit_charge_init(void)
510 /* Only used as heuristic here to derive limit. */
511 bpf_jit_limit = min_t(u64, round_up(bpf_jit_alloc_exec_limit() >> 2,
512 PAGE_SIZE), LONG_MAX);
515 pure_initcall(bpf_jit_charge_init);
517 static int bpf_jit_charge_modmem(u32 pages)
519 if (atomic_long_add_return(pages, &bpf_jit_current) >
520 (bpf_jit_limit >> PAGE_SHIFT)) {
521 if (!capable(CAP_SYS_ADMIN)) {
522 atomic_long_sub(pages, &bpf_jit_current);
530 static void bpf_jit_uncharge_modmem(u32 pages)
532 atomic_long_sub(pages, &bpf_jit_current);
535 struct bpf_binary_header *
536 bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr,
537 unsigned int alignment,
538 bpf_jit_fill_hole_t bpf_fill_ill_insns)
540 struct bpf_binary_header *hdr;
541 u32 size, hole, start, pages;
543 /* Most of BPF filters are really small, but if some of them
544 * fill a page, allow at least 128 extra bytes to insert a
545 * random section of illegal instructions.
547 size = round_up(proglen + sizeof(*hdr) + 128, PAGE_SIZE);
548 pages = size / PAGE_SIZE;
550 if (bpf_jit_charge_modmem(pages))
552 hdr = module_alloc(size);
554 bpf_jit_uncharge_modmem(pages);
558 /* Fill space with illegal/arch-dep instructions. */
559 bpf_fill_ill_insns(hdr, size);
562 hole = min_t(unsigned int, size - (proglen + sizeof(*hdr)),
563 PAGE_SIZE - sizeof(*hdr));
564 start = (get_random_int() % hole) & ~(alignment - 1);
566 /* Leave a random number of instructions before BPF code. */
567 *image_ptr = &hdr->image[start];
572 void bpf_jit_binary_free(struct bpf_binary_header *hdr)
574 u32 pages = hdr->pages;
577 bpf_jit_uncharge_modmem(pages);
580 /* This symbol is only overridden by archs that have different
581 * requirements than the usual eBPF JITs, f.e. when they only
582 * implement cBPF JIT, do not set images read-only, etc.
584 void __weak bpf_jit_free(struct bpf_prog *fp)
587 struct bpf_binary_header *hdr = bpf_jit_binary_hdr(fp);
589 bpf_jit_binary_unlock_ro(hdr);
590 bpf_jit_binary_free(hdr);
592 WARN_ON_ONCE(!bpf_prog_kallsyms_verify_off(fp));
595 bpf_prog_unlock_free(fp);
598 static int bpf_jit_blind_insn(const struct bpf_insn *from,
599 const struct bpf_insn *aux,
600 struct bpf_insn *to_buff)
602 struct bpf_insn *to = to_buff;
603 u32 imm_rnd = get_random_int();
606 BUILD_BUG_ON(BPF_REG_AX + 1 != MAX_BPF_JIT_REG);
607 BUILD_BUG_ON(MAX_BPF_REG + 1 != MAX_BPF_JIT_REG);
609 /* Constraints on AX register:
611 * AX register is inaccessible from user space. It is mapped in
612 * all JITs, and used here for constant blinding rewrites. It is
613 * typically "stateless" meaning its contents are only valid within
614 * the executed instruction, but not across several instructions.
615 * There are a few exceptions however which are further detailed
618 * Constant blinding is only used by JITs, not in the interpreter.
619 * The interpreter uses AX in some occasions as a local temporary
620 * register e.g. in DIV or MOD instructions.
622 * In restricted circumstances, the verifier can also use the AX
623 * register for rewrites as long as they do not interfere with
626 if (from->dst_reg == BPF_REG_AX || from->src_reg == BPF_REG_AX)
629 if (from->imm == 0 &&
630 (from->code == (BPF_ALU | BPF_MOV | BPF_K) ||
631 from->code == (BPF_ALU64 | BPF_MOV | BPF_K))) {
632 *to++ = BPF_ALU64_REG(BPF_XOR, from->dst_reg, from->dst_reg);
636 switch (from->code) {
637 case BPF_ALU | BPF_ADD | BPF_K:
638 case BPF_ALU | BPF_SUB | BPF_K:
639 case BPF_ALU | BPF_AND | BPF_K:
640 case BPF_ALU | BPF_OR | BPF_K:
641 case BPF_ALU | BPF_XOR | BPF_K:
642 case BPF_ALU | BPF_MUL | BPF_K:
643 case BPF_ALU | BPF_MOV | BPF_K:
644 case BPF_ALU | BPF_DIV | BPF_K:
645 case BPF_ALU | BPF_MOD | BPF_K:
646 *to++ = BPF_ALU32_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ from->imm);
647 *to++ = BPF_ALU32_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
648 *to++ = BPF_ALU32_REG(from->code, from->dst_reg, BPF_REG_AX);
651 case BPF_ALU64 | BPF_ADD | BPF_K:
652 case BPF_ALU64 | BPF_SUB | BPF_K:
653 case BPF_ALU64 | BPF_AND | BPF_K:
654 case BPF_ALU64 | BPF_OR | BPF_K:
655 case BPF_ALU64 | BPF_XOR | BPF_K:
656 case BPF_ALU64 | BPF_MUL | BPF_K:
657 case BPF_ALU64 | BPF_MOV | BPF_K:
658 case BPF_ALU64 | BPF_DIV | BPF_K:
659 case BPF_ALU64 | BPF_MOD | BPF_K:
660 *to++ = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ from->imm);
661 *to++ = BPF_ALU64_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
662 *to++ = BPF_ALU64_REG(from->code, from->dst_reg, BPF_REG_AX);
665 case BPF_JMP | BPF_JEQ | BPF_K:
666 case BPF_JMP | BPF_JNE | BPF_K:
667 case BPF_JMP | BPF_JGT | BPF_K:
668 case BPF_JMP | BPF_JLT | BPF_K:
669 case BPF_JMP | BPF_JGE | BPF_K:
670 case BPF_JMP | BPF_JLE | BPF_K:
671 case BPF_JMP | BPF_JSGT | BPF_K:
672 case BPF_JMP | BPF_JSLT | BPF_K:
673 case BPF_JMP | BPF_JSGE | BPF_K:
674 case BPF_JMP | BPF_JSLE | BPF_K:
675 case BPF_JMP | BPF_JSET | BPF_K:
676 /* Accommodate for extra offset in case of a backjump. */
680 *to++ = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ from->imm);
681 *to++ = BPF_ALU64_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
682 *to++ = BPF_JMP_REG(from->code, from->dst_reg, BPF_REG_AX, off);
685 case BPF_LD | BPF_ABS | BPF_W:
686 case BPF_LD | BPF_ABS | BPF_H:
687 case BPF_LD | BPF_ABS | BPF_B:
688 *to++ = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ from->imm);
689 *to++ = BPF_ALU64_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
690 *to++ = BPF_LD_IND(from->code, BPF_REG_AX, 0);
693 case BPF_LD | BPF_IND | BPF_W:
694 case BPF_LD | BPF_IND | BPF_H:
695 case BPF_LD | BPF_IND | BPF_B:
696 *to++ = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ from->imm);
697 *to++ = BPF_ALU64_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
698 *to++ = BPF_ALU32_REG(BPF_ADD, BPF_REG_AX, from->src_reg);
699 *to++ = BPF_LD_IND(from->code, BPF_REG_AX, 0);
702 case BPF_LD | BPF_IMM | BPF_DW:
703 *to++ = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ aux[1].imm);
704 *to++ = BPF_ALU64_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
705 *to++ = BPF_ALU64_IMM(BPF_LSH, BPF_REG_AX, 32);
706 *to++ = BPF_ALU64_REG(BPF_MOV, aux[0].dst_reg, BPF_REG_AX);
708 case 0: /* Part 2 of BPF_LD | BPF_IMM | BPF_DW. */
709 *to++ = BPF_ALU32_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ aux[0].imm);
710 *to++ = BPF_ALU32_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
711 *to++ = BPF_ALU64_REG(BPF_OR, aux[0].dst_reg, BPF_REG_AX);
714 case BPF_ST | BPF_MEM | BPF_DW:
715 case BPF_ST | BPF_MEM | BPF_W:
716 case BPF_ST | BPF_MEM | BPF_H:
717 case BPF_ST | BPF_MEM | BPF_B:
718 *to++ = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, imm_rnd ^ from->imm);
719 *to++ = BPF_ALU64_IMM(BPF_XOR, BPF_REG_AX, imm_rnd);
720 *to++ = BPF_STX_MEM(from->code, from->dst_reg, BPF_REG_AX, from->off);
727 static struct bpf_prog *bpf_prog_clone_create(struct bpf_prog *fp_other,
728 gfp_t gfp_extra_flags)
730 gfp_t gfp_flags = GFP_KERNEL | __GFP_ZERO | gfp_extra_flags;
733 fp = __vmalloc(fp_other->pages * PAGE_SIZE, gfp_flags, PAGE_KERNEL);
735 /* aux->prog still points to the fp_other one, so
736 * when promoting the clone to the real program,
737 * this still needs to be adapted.
739 memcpy(fp, fp_other, fp_other->pages * PAGE_SIZE);
745 static void bpf_prog_clone_free(struct bpf_prog *fp)
747 /* aux was stolen by the other clone, so we cannot free
748 * it from this path! It will be freed eventually by the
749 * other program on release.
751 * At this point, we don't need a deferred release since
752 * clone is guaranteed to not be locked.
758 void bpf_jit_prog_release_other(struct bpf_prog *fp, struct bpf_prog *fp_other)
760 /* We have to repoint aux->prog to self, as we don't
761 * know whether fp here is the clone or the original.
764 bpf_prog_clone_free(fp_other);
767 struct bpf_prog *bpf_jit_blind_constants(struct bpf_prog *prog)
769 struct bpf_insn insn_buff[16], aux[2];
770 struct bpf_prog *clone, *tmp;
771 int insn_delta, insn_cnt;
772 struct bpf_insn *insn;
775 if (!bpf_jit_blinding_enabled())
778 clone = bpf_prog_clone_create(prog, GFP_USER);
780 return ERR_PTR(-ENOMEM);
782 insn_cnt = clone->len;
783 insn = clone->insnsi;
785 for (i = 0; i < insn_cnt; i++, insn++) {
786 /* We temporarily need to hold the original ld64 insn
787 * so that we can still access the first part in the
788 * second blinding run.
790 if (insn[0].code == (BPF_LD | BPF_IMM | BPF_DW) &&
792 memcpy(aux, insn, sizeof(aux));
794 rewritten = bpf_jit_blind_insn(insn, aux, insn_buff);
798 tmp = bpf_patch_insn_single(clone, i, insn_buff, rewritten);
800 /* Patching may have repointed aux->prog during
801 * realloc from the original one, so we need to
802 * fix it up here on error.
804 bpf_jit_prog_release_other(prog, clone);
805 return ERR_PTR(-ENOMEM);
809 insn_delta = rewritten - 1;
811 /* Walk new program and skip insns we just inserted. */
812 insn = clone->insnsi + i + insn_delta;
813 insn_cnt += insn_delta;
819 #endif /* CONFIG_BPF_JIT */
821 /* Base function for offset calculation. Needs to go into .text section,
822 * therefore keeping it non-static as well; will also be used by JITs
823 * anyway later on, so do not let the compiler omit it.
825 noinline u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5)
829 EXPORT_SYMBOL_GPL(__bpf_call_base);
831 #ifndef CONFIG_BPF_JIT_ALWAYS_ON
833 * __bpf_prog_run - run eBPF program on a given context
834 * @ctx: is the data we are operating on
835 * @insn: is the array of eBPF instructions
837 * Decode and execute eBPF instructions.
839 static unsigned int ___bpf_prog_run(u64 *regs, const struct bpf_insn *insn,
843 static const void *jumptable[256] = {
844 [0 ... 255] = &&default_label,
845 /* Now overwrite non-defaults ... */
846 /* 32 bit ALU operations */
847 [BPF_ALU | BPF_ADD | BPF_X] = &&ALU_ADD_X,
848 [BPF_ALU | BPF_ADD | BPF_K] = &&ALU_ADD_K,
849 [BPF_ALU | BPF_SUB | BPF_X] = &&ALU_SUB_X,
850 [BPF_ALU | BPF_SUB | BPF_K] = &&ALU_SUB_K,
851 [BPF_ALU | BPF_AND | BPF_X] = &&ALU_AND_X,
852 [BPF_ALU | BPF_AND | BPF_K] = &&ALU_AND_K,
853 [BPF_ALU | BPF_OR | BPF_X] = &&ALU_OR_X,
854 [BPF_ALU | BPF_OR | BPF_K] = &&ALU_OR_K,
855 [BPF_ALU | BPF_LSH | BPF_X] = &&ALU_LSH_X,
856 [BPF_ALU | BPF_LSH | BPF_K] = &&ALU_LSH_K,
857 [BPF_ALU | BPF_RSH | BPF_X] = &&ALU_RSH_X,
858 [BPF_ALU | BPF_RSH | BPF_K] = &&ALU_RSH_K,
859 [BPF_ALU | BPF_XOR | BPF_X] = &&ALU_XOR_X,
860 [BPF_ALU | BPF_XOR | BPF_K] = &&ALU_XOR_K,
861 [BPF_ALU | BPF_MUL | BPF_X] = &&ALU_MUL_X,
862 [BPF_ALU | BPF_MUL | BPF_K] = &&ALU_MUL_K,
863 [BPF_ALU | BPF_MOV | BPF_X] = &&ALU_MOV_X,
864 [BPF_ALU | BPF_MOV | BPF_K] = &&ALU_MOV_K,
865 [BPF_ALU | BPF_DIV | BPF_X] = &&ALU_DIV_X,
866 [BPF_ALU | BPF_DIV | BPF_K] = &&ALU_DIV_K,
867 [BPF_ALU | BPF_MOD | BPF_X] = &&ALU_MOD_X,
868 [BPF_ALU | BPF_MOD | BPF_K] = &&ALU_MOD_K,
869 [BPF_ALU | BPF_NEG] = &&ALU_NEG,
870 [BPF_ALU | BPF_END | BPF_TO_BE] = &&ALU_END_TO_BE,
871 [BPF_ALU | BPF_END | BPF_TO_LE] = &&ALU_END_TO_LE,
872 /* 64 bit ALU operations */
873 [BPF_ALU64 | BPF_ADD | BPF_X] = &&ALU64_ADD_X,
874 [BPF_ALU64 | BPF_ADD | BPF_K] = &&ALU64_ADD_K,
875 [BPF_ALU64 | BPF_SUB | BPF_X] = &&ALU64_SUB_X,
876 [BPF_ALU64 | BPF_SUB | BPF_K] = &&ALU64_SUB_K,
877 [BPF_ALU64 | BPF_AND | BPF_X] = &&ALU64_AND_X,
878 [BPF_ALU64 | BPF_AND | BPF_K] = &&ALU64_AND_K,
879 [BPF_ALU64 | BPF_OR | BPF_X] = &&ALU64_OR_X,
880 [BPF_ALU64 | BPF_OR | BPF_K] = &&ALU64_OR_K,
881 [BPF_ALU64 | BPF_LSH | BPF_X] = &&ALU64_LSH_X,
882 [BPF_ALU64 | BPF_LSH | BPF_K] = &&ALU64_LSH_K,
883 [BPF_ALU64 | BPF_RSH | BPF_X] = &&ALU64_RSH_X,
884 [BPF_ALU64 | BPF_RSH | BPF_K] = &&ALU64_RSH_K,
885 [BPF_ALU64 | BPF_XOR | BPF_X] = &&ALU64_XOR_X,
886 [BPF_ALU64 | BPF_XOR | BPF_K] = &&ALU64_XOR_K,
887 [BPF_ALU64 | BPF_MUL | BPF_X] = &&ALU64_MUL_X,
888 [BPF_ALU64 | BPF_MUL | BPF_K] = &&ALU64_MUL_K,
889 [BPF_ALU64 | BPF_MOV | BPF_X] = &&ALU64_MOV_X,
890 [BPF_ALU64 | BPF_MOV | BPF_K] = &&ALU64_MOV_K,
891 [BPF_ALU64 | BPF_ARSH | BPF_X] = &&ALU64_ARSH_X,
892 [BPF_ALU64 | BPF_ARSH | BPF_K] = &&ALU64_ARSH_K,
893 [BPF_ALU64 | BPF_DIV | BPF_X] = &&ALU64_DIV_X,
894 [BPF_ALU64 | BPF_DIV | BPF_K] = &&ALU64_DIV_K,
895 [BPF_ALU64 | BPF_MOD | BPF_X] = &&ALU64_MOD_X,
896 [BPF_ALU64 | BPF_MOD | BPF_K] = &&ALU64_MOD_K,
897 [BPF_ALU64 | BPF_NEG] = &&ALU64_NEG,
898 /* Call instruction */
899 [BPF_JMP | BPF_CALL] = &&JMP_CALL,
900 [BPF_JMP | BPF_TAIL_CALL] = &&JMP_TAIL_CALL,
902 [BPF_JMP | BPF_JA] = &&JMP_JA,
903 [BPF_JMP | BPF_JEQ | BPF_X] = &&JMP_JEQ_X,
904 [BPF_JMP | BPF_JEQ | BPF_K] = &&JMP_JEQ_K,
905 [BPF_JMP | BPF_JNE | BPF_X] = &&JMP_JNE_X,
906 [BPF_JMP | BPF_JNE | BPF_K] = &&JMP_JNE_K,
907 [BPF_JMP | BPF_JGT | BPF_X] = &&JMP_JGT_X,
908 [BPF_JMP | BPF_JGT | BPF_K] = &&JMP_JGT_K,
909 [BPF_JMP | BPF_JLT | BPF_X] = &&JMP_JLT_X,
910 [BPF_JMP | BPF_JLT | BPF_K] = &&JMP_JLT_K,
911 [BPF_JMP | BPF_JGE | BPF_X] = &&JMP_JGE_X,
912 [BPF_JMP | BPF_JGE | BPF_K] = &&JMP_JGE_K,
913 [BPF_JMP | BPF_JLE | BPF_X] = &&JMP_JLE_X,
914 [BPF_JMP | BPF_JLE | BPF_K] = &&JMP_JLE_K,
915 [BPF_JMP | BPF_JSGT | BPF_X] = &&JMP_JSGT_X,
916 [BPF_JMP | BPF_JSGT | BPF_K] = &&JMP_JSGT_K,
917 [BPF_JMP | BPF_JSLT | BPF_X] = &&JMP_JSLT_X,
918 [BPF_JMP | BPF_JSLT | BPF_K] = &&JMP_JSLT_K,
919 [BPF_JMP | BPF_JSGE | BPF_X] = &&JMP_JSGE_X,
920 [BPF_JMP | BPF_JSGE | BPF_K] = &&JMP_JSGE_K,
921 [BPF_JMP | BPF_JSLE | BPF_X] = &&JMP_JSLE_X,
922 [BPF_JMP | BPF_JSLE | BPF_K] = &&JMP_JSLE_K,
923 [BPF_JMP | BPF_JSET | BPF_X] = &&JMP_JSET_X,
924 [BPF_JMP | BPF_JSET | BPF_K] = &&JMP_JSET_K,
926 [BPF_JMP | BPF_EXIT] = &&JMP_EXIT,
927 /* Store instructions */
928 [BPF_STX | BPF_MEM | BPF_B] = &&STX_MEM_B,
929 [BPF_STX | BPF_MEM | BPF_H] = &&STX_MEM_H,
930 [BPF_STX | BPF_MEM | BPF_W] = &&STX_MEM_W,
931 [BPF_STX | BPF_MEM | BPF_DW] = &&STX_MEM_DW,
932 [BPF_STX | BPF_XADD | BPF_W] = &&STX_XADD_W,
933 [BPF_STX | BPF_XADD | BPF_DW] = &&STX_XADD_DW,
934 [BPF_ST | BPF_MEM | BPF_B] = &&ST_MEM_B,
935 [BPF_ST | BPF_MEM | BPF_H] = &&ST_MEM_H,
936 [BPF_ST | BPF_MEM | BPF_W] = &&ST_MEM_W,
937 [BPF_ST | BPF_MEM | BPF_DW] = &&ST_MEM_DW,
938 /* Load instructions */
939 [BPF_LDX | BPF_MEM | BPF_B] = &&LDX_MEM_B,
940 [BPF_LDX | BPF_MEM | BPF_H] = &&LDX_MEM_H,
941 [BPF_LDX | BPF_MEM | BPF_W] = &&LDX_MEM_W,
942 [BPF_LDX | BPF_MEM | BPF_DW] = &&LDX_MEM_DW,
943 [BPF_LD | BPF_ABS | BPF_W] = &&LD_ABS_W,
944 [BPF_LD | BPF_ABS | BPF_H] = &&LD_ABS_H,
945 [BPF_LD | BPF_ABS | BPF_B] = &&LD_ABS_B,
946 [BPF_LD | BPF_IND | BPF_W] = &&LD_IND_W,
947 [BPF_LD | BPF_IND | BPF_H] = &&LD_IND_H,
948 [BPF_LD | BPF_IND | BPF_B] = &&LD_IND_B,
949 [BPF_LD | BPF_IMM | BPF_DW] = &&LD_IMM_DW,
951 u32 tail_call_cnt = 0;
955 #define CONT ({ insn++; goto select_insn; })
956 #define CONT_JMP ({ insn++; goto select_insn; })
959 goto *jumptable[insn->code];
962 #define ALU(OPCODE, OP) \
963 ALU64_##OPCODE##_X: \
967 DST = (u32) DST OP (u32) SRC; \
969 ALU64_##OPCODE##_K: \
973 DST = (u32) DST OP (u32) IMM; \
1004 DST = (u64) (u32) insn[0].imm | ((u64) (u32) insn[1].imm) << 32;
1008 (*(s64 *) &DST) >>= SRC;
1011 (*(s64 *) &DST) >>= IMM;
1014 if (unlikely(SRC == 0))
1016 div64_u64_rem(DST, SRC, &AX);
1020 if (unlikely((u32)SRC == 0))
1023 DST = do_div(AX, (u32) SRC);
1026 div64_u64_rem(DST, IMM, &AX);
1031 DST = do_div(AX, (u32) IMM);
1034 if (unlikely(SRC == 0))
1036 DST = div64_u64(DST, SRC);
1039 if (unlikely((u32)SRC == 0))
1042 do_div(AX, (u32) SRC);
1046 DST = div64_u64(DST, IMM);
1050 do_div(AX, (u32) IMM);
1056 DST = (__force u16) cpu_to_be16(DST);
1059 DST = (__force u32) cpu_to_be32(DST);
1062 DST = (__force u64) cpu_to_be64(DST);
1069 DST = (__force u16) cpu_to_le16(DST);
1072 DST = (__force u32) cpu_to_le32(DST);
1075 DST = (__force u64) cpu_to_le64(DST);
1082 /* Function call scratches BPF_R1-BPF_R5 registers,
1083 * preserves BPF_R6-BPF_R9, and stores return value
1086 BPF_R0 = (__bpf_call_base + insn->imm)(BPF_R1, BPF_R2, BPF_R3,
1091 struct bpf_map *map = (struct bpf_map *) (unsigned long) BPF_R2;
1092 struct bpf_array *array = container_of(map, struct bpf_array, map);
1093 struct bpf_prog *prog;
1096 if (unlikely(index >= array->map.max_entries))
1098 if (unlikely(tail_call_cnt > MAX_TAIL_CALL_CNT))
1103 prog = READ_ONCE(array->ptrs[index]);
1107 /* ARG1 at this point is guaranteed to point to CTX from
1108 * the verifier side due to the fact that the tail call is
1109 * handeled like a helper, that is, bpf_tail_call_proto,
1110 * where arg1_type is ARG_PTR_TO_CTX.
1112 insn = prog->insnsi;
1194 if (((s64) DST) > ((s64) SRC)) {
1200 if (((s64) DST) > ((s64) IMM)) {
1206 if (((s64) DST) < ((s64) SRC)) {
1212 if (((s64) DST) < ((s64) IMM)) {
1218 if (((s64) DST) >= ((s64) SRC)) {
1224 if (((s64) DST) >= ((s64) IMM)) {
1230 if (((s64) DST) <= ((s64) SRC)) {
1236 if (((s64) DST) <= ((s64) IMM)) {
1256 /* STX and ST and LDX*/
1257 #define LDST(SIZEOP, SIZE) \
1259 *(SIZE *)(unsigned long) (DST + insn->off) = SRC; \
1262 *(SIZE *)(unsigned long) (DST + insn->off) = IMM; \
1265 DST = *(SIZE *)(unsigned long) (SRC + insn->off); \
1273 STX_XADD_W: /* lock xadd *(u32 *)(dst_reg + off16) += src_reg */
1274 atomic_add((u32) SRC, (atomic_t *)(unsigned long)
1277 STX_XADD_DW: /* lock xadd *(u64 *)(dst_reg + off16) += src_reg */
1278 atomic64_add((u64) SRC, (atomic64_t *)(unsigned long)
1281 LD_ABS_W: /* BPF_R0 = ntohl(*(u32 *) (skb->data + imm32)) */
1284 /* BPF_LD + BPD_ABS and BPF_LD + BPF_IND insns are only
1285 * appearing in the programs where ctx == skb
1286 * (see may_access_skb() in the verifier). All programs
1287 * keep 'ctx' in regs[BPF_REG_CTX] == BPF_R6,
1288 * bpf_convert_filter() saves it in BPF_R6, internal BPF
1289 * verifier will check that BPF_R6 == ctx.
1291 * BPF_ABS and BPF_IND are wrappers of function calls,
1292 * so they scratch BPF_R1-BPF_R5 registers, preserve
1293 * BPF_R6-BPF_R9, and store return value into BPF_R0.
1296 * ctx == skb == BPF_R6 == CTX
1299 * SRC == any register
1300 * IMM == 32-bit immediate
1303 * BPF_R0 - 8/16/32-bit skb data converted to cpu endianness
1306 ptr = bpf_load_pointer((struct sk_buff *) (unsigned long) CTX, off, 4, &tmp);
1307 if (likely(ptr != NULL)) {
1308 BPF_R0 = get_unaligned_be32(ptr);
1313 LD_ABS_H: /* BPF_R0 = ntohs(*(u16 *) (skb->data + imm32)) */
1316 ptr = bpf_load_pointer((struct sk_buff *) (unsigned long) CTX, off, 2, &tmp);
1317 if (likely(ptr != NULL)) {
1318 BPF_R0 = get_unaligned_be16(ptr);
1323 LD_ABS_B: /* BPF_R0 = *(u8 *) (skb->data + imm32) */
1326 ptr = bpf_load_pointer((struct sk_buff *) (unsigned long) CTX, off, 1, &tmp);
1327 if (likely(ptr != NULL)) {
1328 BPF_R0 = *(u8 *)ptr;
1333 LD_IND_W: /* BPF_R0 = ntohl(*(u32 *) (skb->data + src_reg + imm32)) */
1336 LD_IND_H: /* BPF_R0 = ntohs(*(u16 *) (skb->data + src_reg + imm32)) */
1339 LD_IND_B: /* BPF_R0 = *(u8 *) (skb->data + src_reg + imm32) */
1344 /* If we ever reach this, we have a bug somewhere. */
1345 WARN_RATELIMIT(1, "unknown opcode %02x\n", insn->code);
1348 STACK_FRAME_NON_STANDARD(___bpf_prog_run); /* jump table */
1350 #define PROG_NAME(stack_size) __bpf_prog_run##stack_size
1351 #define DEFINE_BPF_PROG_RUN(stack_size) \
1352 static unsigned int PROG_NAME(stack_size)(const void *ctx, const struct bpf_insn *insn) \
1354 u64 stack[stack_size / sizeof(u64)]; \
1355 u64 regs[MAX_BPF_EXT_REG]; \
1357 FP = (u64) (unsigned long) &stack[ARRAY_SIZE(stack)]; \
1358 ARG1 = (u64) (unsigned long) ctx; \
1359 return ___bpf_prog_run(regs, insn, stack); \
1362 #define EVAL1(FN, X) FN(X)
1363 #define EVAL2(FN, X, Y...) FN(X) EVAL1(FN, Y)
1364 #define EVAL3(FN, X, Y...) FN(X) EVAL2(FN, Y)
1365 #define EVAL4(FN, X, Y...) FN(X) EVAL3(FN, Y)
1366 #define EVAL5(FN, X, Y...) FN(X) EVAL4(FN, Y)
1367 #define EVAL6(FN, X, Y...) FN(X) EVAL5(FN, Y)
1369 EVAL6(DEFINE_BPF_PROG_RUN, 32, 64, 96, 128, 160, 192);
1370 EVAL6(DEFINE_BPF_PROG_RUN, 224, 256, 288, 320, 352, 384);
1371 EVAL4(DEFINE_BPF_PROG_RUN, 416, 448, 480, 512);
1373 #define PROG_NAME_LIST(stack_size) PROG_NAME(stack_size),
1375 static unsigned int (*interpreters[])(const void *ctx,
1376 const struct bpf_insn *insn) = {
1377 EVAL6(PROG_NAME_LIST, 32, 64, 96, 128, 160, 192)
1378 EVAL6(PROG_NAME_LIST, 224, 256, 288, 320, 352, 384)
1379 EVAL4(PROG_NAME_LIST, 416, 448, 480, 512)
1383 static unsigned int __bpf_prog_ret0_warn(const void *ctx,
1384 const struct bpf_insn *insn)
1386 /* If this handler ever gets executed, then BPF_JIT_ALWAYS_ON
1387 * is not working properly, so warn about it!
1394 bool bpf_prog_array_compatible(struct bpf_array *array,
1395 const struct bpf_prog *fp)
1397 if (!array->owner_prog_type) {
1398 /* There's no owner yet where we could check for
1401 array->owner_prog_type = fp->type;
1402 array->owner_jited = fp->jited;
1407 return array->owner_prog_type == fp->type &&
1408 array->owner_jited == fp->jited;
1411 static int bpf_check_tail_call(const struct bpf_prog *fp)
1413 struct bpf_prog_aux *aux = fp->aux;
1416 for (i = 0; i < aux->used_map_cnt; i++) {
1417 struct bpf_map *map = aux->used_maps[i];
1418 struct bpf_array *array;
1420 if (map->map_type != BPF_MAP_TYPE_PROG_ARRAY)
1423 array = container_of(map, struct bpf_array, map);
1424 if (!bpf_prog_array_compatible(array, fp))
1432 * bpf_prog_select_runtime - select exec runtime for BPF program
1433 * @fp: bpf_prog populated with internal BPF program
1434 * @err: pointer to error variable
1436 * Try to JIT eBPF program, if JIT is not available, use interpreter.
1437 * The BPF program will be executed via BPF_PROG_RUN() macro.
1439 struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err)
1441 #ifndef CONFIG_BPF_JIT_ALWAYS_ON
1442 u32 stack_depth = max_t(u32, fp->aux->stack_depth, 1);
1444 fp->bpf_func = interpreters[(round_up(stack_depth, 32) / 32) - 1];
1446 fp->bpf_func = __bpf_prog_ret0_warn;
1449 /* eBPF JITs can rewrite the program in case constant
1450 * blinding is active. However, in case of error during
1451 * blinding, bpf_int_jit_compile() must always return a
1452 * valid program, which in this case would simply not
1453 * be JITed, but falls back to the interpreter.
1455 fp = bpf_int_jit_compile(fp);
1456 #ifdef CONFIG_BPF_JIT_ALWAYS_ON
1462 bpf_prog_lock_ro(fp);
1464 /* The tail call compatibility check can only be done at
1465 * this late stage as we need to determine, if we deal
1466 * with JITed or non JITed program concatenations and not
1467 * all eBPF JITs might immediately support all features.
1469 *err = bpf_check_tail_call(fp);
1473 EXPORT_SYMBOL_GPL(bpf_prog_select_runtime);
1475 static void bpf_prog_free_deferred(struct work_struct *work)
1477 struct bpf_prog_aux *aux;
1479 aux = container_of(work, struct bpf_prog_aux, work);
1480 bpf_jit_free(aux->prog);
1483 /* Free internal BPF program */
1484 void bpf_prog_free(struct bpf_prog *fp)
1486 struct bpf_prog_aux *aux = fp->aux;
1488 INIT_WORK(&aux->work, bpf_prog_free_deferred);
1489 schedule_work(&aux->work);
1491 EXPORT_SYMBOL_GPL(bpf_prog_free);
1493 /* RNG for unpriviledged user space with separated state from prandom_u32(). */
1494 static DEFINE_PER_CPU(struct rnd_state, bpf_user_rnd_state);
1496 void bpf_user_rnd_init_once(void)
1498 prandom_init_once(&bpf_user_rnd_state);
1501 BPF_CALL_0(bpf_user_rnd_u32)
1503 /* Should someone ever have the rather unwise idea to use some
1504 * of the registers passed into this function, then note that
1505 * this function is called from native eBPF and classic-to-eBPF
1506 * transformations. Register assignments from both sides are
1507 * different, f.e. classic always sets fn(ctx, A, X) here.
1509 struct rnd_state *state;
1512 state = &get_cpu_var(bpf_user_rnd_state);
1513 res = prandom_u32_state(state);
1514 put_cpu_var(bpf_user_rnd_state);
1519 /* Weak definitions of helper functions in case we don't have bpf syscall. */
1520 const struct bpf_func_proto bpf_map_lookup_elem_proto __weak;
1521 const struct bpf_func_proto bpf_map_update_elem_proto __weak;
1522 const struct bpf_func_proto bpf_map_delete_elem_proto __weak;
1524 const struct bpf_func_proto bpf_get_prandom_u32_proto __weak;
1525 const struct bpf_func_proto bpf_get_smp_processor_id_proto __weak;
1526 const struct bpf_func_proto bpf_get_numa_node_id_proto __weak;
1527 const struct bpf_func_proto bpf_ktime_get_ns_proto __weak;
1529 const struct bpf_func_proto bpf_get_current_pid_tgid_proto __weak;
1530 const struct bpf_func_proto bpf_get_current_uid_gid_proto __weak;
1531 const struct bpf_func_proto bpf_get_current_comm_proto __weak;
1532 const struct bpf_func_proto bpf_sock_map_update_proto __weak;
1534 const struct bpf_func_proto * __weak bpf_get_trace_printk_proto(void)
1540 bpf_event_output(struct bpf_map *map, u64 flags, void *meta, u64 meta_size,
1541 void *ctx, u64 ctx_size, bpf_ctx_copy_t ctx_copy)
1546 /* Always built-in helper functions. */
1547 const struct bpf_func_proto bpf_tail_call_proto = {
1550 .ret_type = RET_VOID,
1551 .arg1_type = ARG_PTR_TO_CTX,
1552 .arg2_type = ARG_CONST_MAP_PTR,
1553 .arg3_type = ARG_ANYTHING,
1556 /* Stub for JITs that only support cBPF. eBPF programs are interpreted.
1557 * It is encouraged to implement bpf_int_jit_compile() instead, so that
1558 * eBPF and implicitly also cBPF can get JITed!
1560 struct bpf_prog * __weak bpf_int_jit_compile(struct bpf_prog *prog)
1565 /* Stub for JITs that support eBPF. All cBPF code gets transformed into
1566 * eBPF by the kernel and is later compiled by bpf_int_jit_compile().
1568 void __weak bpf_jit_compile(struct bpf_prog *prog)
1572 bool __weak bpf_helper_changes_pkt_data(void *func)
1577 /* To execute LD_ABS/LD_IND instructions __bpf_prog_run() may call
1578 * skb_copy_bits(), so provide a weak definition of it for NET-less config.
1580 int __weak skb_copy_bits(const struct sk_buff *skb, int offset, void *to,
1586 /* All definitions of tracepoints related to BPF. */
1587 #define CREATE_TRACE_POINTS
1588 #include <linux/bpf_trace.h>
1590 EXPORT_TRACEPOINT_SYMBOL_GPL(xdp_exception);
1592 EXPORT_TRACEPOINT_SYMBOL_GPL(bpf_prog_get_type);
1593 EXPORT_TRACEPOINT_SYMBOL_GPL(bpf_prog_put_rcu);