1 // SPDX-License-Identifier: GPL-2.0-only
2 /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3 * Copyright (c) 2016 Facebook
4 * Copyright (c) 2018 Covalent IO, Inc. http://covalent.io
6 #include <uapi/linux/btf.h>
7 #include <linux/kernel.h>
8 #include <linux/types.h>
9 #include <linux/slab.h>
10 #include <linux/bpf.h>
11 #include <linux/btf.h>
12 #include <linux/bpf_verifier.h>
13 #include <linux/filter.h>
14 #include <net/netlink.h>
15 #include <linux/file.h>
16 #include <linux/vmalloc.h>
17 #include <linux/stringify.h>
18 #include <linux/bsearch.h>
19 #include <linux/sort.h>
20 #include <linux/perf_event.h>
21 #include <linux/ctype.h>
22 #include <linux/error-injection.h>
23 #include <linux/bpf_lsm.h>
24 #include <linux/btf_ids.h>
28 static const struct bpf_verifier_ops * const bpf_verifier_ops[] = {
29 #define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type) \
30 [_id] = & _name ## _verifier_ops,
31 #define BPF_MAP_TYPE(_id, _ops)
32 #define BPF_LINK_TYPE(_id, _name)
33 #include <linux/bpf_types.h>
39 /* bpf_check() is a static code analyzer that walks eBPF program
40 * instruction by instruction and updates register/stack state.
41 * All paths of conditional branches are analyzed until 'bpf_exit' insn.
43 * The first pass is depth-first-search to check that the program is a DAG.
44 * It rejects the following programs:
45 * - larger than BPF_MAXINSNS insns
46 * - if loop is present (detected via back-edge)
47 * - unreachable insns exist (shouldn't be a forest. program = one function)
48 * - out of bounds or malformed jumps
49 * The second pass is all possible path descent from the 1st insn.
50 * Since it's analyzing all pathes through the program, the length of the
51 * analysis is limited to 64k insn, which may be hit even if total number of
52 * insn is less then 4K, but there are too many branches that change stack/regs.
53 * Number of 'branches to be analyzed' is limited to 1k
55 * On entry to each instruction, each register has a type, and the instruction
56 * changes the types of the registers depending on instruction semantics.
57 * If instruction is BPF_MOV64_REG(BPF_REG_1, BPF_REG_5), then type of R5 is
60 * All registers are 64-bit.
61 * R0 - return register
62 * R1-R5 argument passing registers
63 * R6-R9 callee saved registers
64 * R10 - frame pointer read-only
66 * At the start of BPF program the register R1 contains a pointer to bpf_context
67 * and has type PTR_TO_CTX.
69 * Verifier tracks arithmetic operations on pointers in case:
70 * BPF_MOV64_REG(BPF_REG_1, BPF_REG_10),
71 * BPF_ALU64_IMM(BPF_ADD, BPF_REG_1, -20),
72 * 1st insn copies R10 (which has FRAME_PTR) type into R1
73 * and 2nd arithmetic instruction is pattern matched to recognize
74 * that it wants to construct a pointer to some element within stack.
75 * So after 2nd insn, the register R1 has type PTR_TO_STACK
76 * (and -20 constant is saved for further stack bounds checking).
77 * Meaning that this reg is a pointer to stack plus known immediate constant.
79 * Most of the time the registers have SCALAR_VALUE type, which
80 * means the register has some value, but it's not a valid pointer.
81 * (like pointer plus pointer becomes SCALAR_VALUE type)
83 * When verifier sees load or store instructions the type of base register
84 * can be: PTR_TO_MAP_VALUE, PTR_TO_CTX, PTR_TO_STACK, PTR_TO_SOCKET. These are
85 * four pointer types recognized by check_mem_access() function.
87 * PTR_TO_MAP_VALUE means that this register is pointing to 'map element value'
88 * and the range of [ptr, ptr + map's value_size) is accessible.
90 * registers used to pass values to function calls are checked against
91 * function argument constraints.
93 * ARG_PTR_TO_MAP_KEY is one of such argument constraints.
94 * It means that the register type passed to this function must be
95 * PTR_TO_STACK and it will be used inside the function as
96 * 'pointer to map element key'
98 * For example the argument constraints for bpf_map_lookup_elem():
99 * .ret_type = RET_PTR_TO_MAP_VALUE_OR_NULL,
100 * .arg1_type = ARG_CONST_MAP_PTR,
101 * .arg2_type = ARG_PTR_TO_MAP_KEY,
103 * ret_type says that this function returns 'pointer to map elem value or null'
104 * function expects 1st argument to be a const pointer to 'struct bpf_map' and
105 * 2nd argument should be a pointer to stack, which will be used inside
106 * the helper function as a pointer to map element key.
108 * On the kernel side the helper function looks like:
109 * u64 bpf_map_lookup_elem(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5)
111 * struct bpf_map *map = (struct bpf_map *) (unsigned long) r1;
112 * void *key = (void *) (unsigned long) r2;
115 * here kernel can access 'key' and 'map' pointers safely, knowing that
116 * [key, key + map->key_size) bytes are valid and were initialized on
117 * the stack of eBPF program.
120 * Corresponding eBPF program may look like:
121 * BPF_MOV64_REG(BPF_REG_2, BPF_REG_10), // after this insn R2 type is FRAME_PTR
122 * BPF_ALU64_IMM(BPF_ADD, BPF_REG_2, -4), // after this insn R2 type is PTR_TO_STACK
123 * BPF_LD_MAP_FD(BPF_REG_1, map_fd), // after this insn R1 type is CONST_PTR_TO_MAP
124 * BPF_RAW_INSN(BPF_JMP | BPF_CALL, 0, 0, 0, BPF_FUNC_map_lookup_elem),
125 * here verifier looks at prototype of map_lookup_elem() and sees:
126 * .arg1_type == ARG_CONST_MAP_PTR and R1->type == CONST_PTR_TO_MAP, which is ok,
127 * Now verifier knows that this map has key of R1->map_ptr->key_size bytes
129 * Then .arg2_type == ARG_PTR_TO_MAP_KEY and R2->type == PTR_TO_STACK, ok so far,
130 * Now verifier checks that [R2, R2 + map's key_size) are within stack limits
131 * and were initialized prior to this call.
132 * If it's ok, then verifier allows this BPF_CALL insn and looks at
133 * .ret_type which is RET_PTR_TO_MAP_VALUE_OR_NULL, so it sets
134 * R0->type = PTR_TO_MAP_VALUE_OR_NULL which means bpf_map_lookup_elem() function
135 * returns ether pointer to map value or NULL.
137 * When type PTR_TO_MAP_VALUE_OR_NULL passes through 'if (reg != 0) goto +off'
138 * insn, the register holding that pointer in the true branch changes state to
139 * PTR_TO_MAP_VALUE and the same register changes state to CONST_IMM in the false
140 * branch. See check_cond_jmp_op().
142 * After the call R0 is set to return type of the function and registers R1-R5
143 * are set to NOT_INIT to indicate that they are no longer readable.
145 * The following reference types represent a potential reference to a kernel
146 * resource which, after first being allocated, must be checked and freed by
148 * - PTR_TO_SOCKET_OR_NULL, PTR_TO_SOCKET
150 * When the verifier sees a helper call return a reference type, it allocates a
151 * pointer id for the reference and stores it in the current function state.
152 * Similar to the way that PTR_TO_MAP_VALUE_OR_NULL is converted into
153 * PTR_TO_MAP_VALUE, PTR_TO_SOCKET_OR_NULL becomes PTR_TO_SOCKET when the type
154 * passes through a NULL-check conditional. For the branch wherein the state is
155 * changed to CONST_IMM, the verifier releases the reference.
157 * For each helper function that allocates a reference, such as
158 * bpf_sk_lookup_tcp(), there is a corresponding release function, such as
159 * bpf_sk_release(). When a reference type passes into the release function,
160 * the verifier also releases the reference. If any unchecked or unreleased
161 * reference remains at the end of the program, the verifier rejects it.
164 /* verifier_state + insn_idx are pushed to stack when branch is encountered */
165 struct bpf_verifier_stack_elem {
166 /* verifer state is 'st'
167 * before processing instruction 'insn_idx'
168 * and after processing instruction 'prev_insn_idx'
170 struct bpf_verifier_state st;
173 struct bpf_verifier_stack_elem *next;
174 /* length of verifier log at the time this state was pushed on stack */
178 #define BPF_COMPLEXITY_LIMIT_JMP_SEQ 8192
179 #define BPF_COMPLEXITY_LIMIT_STATES 64
181 #define BPF_MAP_KEY_POISON (1ULL << 63)
182 #define BPF_MAP_KEY_SEEN (1ULL << 62)
184 #define BPF_MAP_PTR_UNPRIV 1UL
185 #define BPF_MAP_PTR_POISON ((void *)((0xeB9FUL << 1) + \
186 POISON_POINTER_DELTA))
187 #define BPF_MAP_PTR(X) ((struct bpf_map *)((X) & ~BPF_MAP_PTR_UNPRIV))
189 static bool bpf_map_ptr_poisoned(const struct bpf_insn_aux_data *aux)
191 return BPF_MAP_PTR(aux->map_ptr_state) == BPF_MAP_PTR_POISON;
194 static bool bpf_map_ptr_unpriv(const struct bpf_insn_aux_data *aux)
196 return aux->map_ptr_state & BPF_MAP_PTR_UNPRIV;
199 static void bpf_map_ptr_store(struct bpf_insn_aux_data *aux,
200 const struct bpf_map *map, bool unpriv)
202 BUILD_BUG_ON((unsigned long)BPF_MAP_PTR_POISON & BPF_MAP_PTR_UNPRIV);
203 unpriv |= bpf_map_ptr_unpriv(aux);
204 aux->map_ptr_state = (unsigned long)map |
205 (unpriv ? BPF_MAP_PTR_UNPRIV : 0UL);
208 static bool bpf_map_key_poisoned(const struct bpf_insn_aux_data *aux)
210 return aux->map_key_state & BPF_MAP_KEY_POISON;
213 static bool bpf_map_key_unseen(const struct bpf_insn_aux_data *aux)
215 return !(aux->map_key_state & BPF_MAP_KEY_SEEN);
218 static u64 bpf_map_key_immediate(const struct bpf_insn_aux_data *aux)
220 return aux->map_key_state & ~(BPF_MAP_KEY_SEEN | BPF_MAP_KEY_POISON);
223 static void bpf_map_key_store(struct bpf_insn_aux_data *aux, u64 state)
225 bool poisoned = bpf_map_key_poisoned(aux);
227 aux->map_key_state = state | BPF_MAP_KEY_SEEN |
228 (poisoned ? BPF_MAP_KEY_POISON : 0ULL);
231 struct bpf_call_arg_meta {
232 struct bpf_map *map_ptr;
245 struct btf *btf_vmlinux;
247 static DEFINE_MUTEX(bpf_verifier_lock);
249 static const struct bpf_line_info *
250 find_linfo(const struct bpf_verifier_env *env, u32 insn_off)
252 const struct bpf_line_info *linfo;
253 const struct bpf_prog *prog;
257 nr_linfo = prog->aux->nr_linfo;
259 if (!nr_linfo || insn_off >= prog->len)
262 linfo = prog->aux->linfo;
263 for (i = 1; i < nr_linfo; i++)
264 if (insn_off < linfo[i].insn_off)
267 return &linfo[i - 1];
270 void bpf_verifier_vlog(struct bpf_verifier_log *log, const char *fmt,
275 n = vscnprintf(log->kbuf, BPF_VERIFIER_TMP_LOG_SIZE, fmt, args);
277 WARN_ONCE(n >= BPF_VERIFIER_TMP_LOG_SIZE - 1,
278 "verifier log line truncated - local buffer too short\n");
280 n = min(log->len_total - log->len_used - 1, n);
283 if (log->level == BPF_LOG_KERNEL) {
284 pr_err("BPF:%s\n", log->kbuf);
287 if (!copy_to_user(log->ubuf + log->len_used, log->kbuf, n + 1))
293 static void bpf_vlog_reset(struct bpf_verifier_log *log, u32 new_pos)
297 if (!bpf_verifier_log_needed(log))
300 log->len_used = new_pos;
301 if (put_user(zero, log->ubuf + new_pos))
305 /* log_level controls verbosity level of eBPF verifier.
306 * bpf_verifier_log_write() is used to dump the verification trace to the log,
307 * so the user can figure out what's wrong with the program
309 __printf(2, 3) void bpf_verifier_log_write(struct bpf_verifier_env *env,
310 const char *fmt, ...)
314 if (!bpf_verifier_log_needed(&env->log))
318 bpf_verifier_vlog(&env->log, fmt, args);
321 EXPORT_SYMBOL_GPL(bpf_verifier_log_write);
323 __printf(2, 3) static void verbose(void *private_data, const char *fmt, ...)
325 struct bpf_verifier_env *env = private_data;
328 if (!bpf_verifier_log_needed(&env->log))
332 bpf_verifier_vlog(&env->log, fmt, args);
336 __printf(2, 3) void bpf_log(struct bpf_verifier_log *log,
337 const char *fmt, ...)
341 if (!bpf_verifier_log_needed(log))
345 bpf_verifier_vlog(log, fmt, args);
349 static const char *ltrim(const char *s)
357 __printf(3, 4) static void verbose_linfo(struct bpf_verifier_env *env,
359 const char *prefix_fmt, ...)
361 const struct bpf_line_info *linfo;
363 if (!bpf_verifier_log_needed(&env->log))
366 linfo = find_linfo(env, insn_off);
367 if (!linfo || linfo == env->prev_linfo)
373 va_start(args, prefix_fmt);
374 bpf_verifier_vlog(&env->log, prefix_fmt, args);
379 ltrim(btf_name_by_offset(env->prog->aux->btf,
382 env->prev_linfo = linfo;
385 static bool type_is_pkt_pointer(enum bpf_reg_type type)
387 return type == PTR_TO_PACKET ||
388 type == PTR_TO_PACKET_META;
391 static bool type_is_sk_pointer(enum bpf_reg_type type)
393 return type == PTR_TO_SOCKET ||
394 type == PTR_TO_SOCK_COMMON ||
395 type == PTR_TO_TCP_SOCK ||
396 type == PTR_TO_XDP_SOCK;
399 static bool reg_type_not_null(enum bpf_reg_type type)
401 return type == PTR_TO_SOCKET ||
402 type == PTR_TO_TCP_SOCK ||
403 type == PTR_TO_MAP_VALUE ||
404 type == PTR_TO_SOCK_COMMON;
407 static bool reg_type_may_be_null(enum bpf_reg_type type)
409 return type == PTR_TO_MAP_VALUE_OR_NULL ||
410 type == PTR_TO_SOCKET_OR_NULL ||
411 type == PTR_TO_SOCK_COMMON_OR_NULL ||
412 type == PTR_TO_TCP_SOCK_OR_NULL ||
413 type == PTR_TO_BTF_ID_OR_NULL ||
414 type == PTR_TO_MEM_OR_NULL ||
415 type == PTR_TO_RDONLY_BUF_OR_NULL ||
416 type == PTR_TO_RDWR_BUF_OR_NULL;
419 static bool reg_may_point_to_spin_lock(const struct bpf_reg_state *reg)
421 return reg->type == PTR_TO_MAP_VALUE &&
422 map_value_has_spin_lock(reg->map_ptr);
425 static bool reg_type_may_be_refcounted_or_null(enum bpf_reg_type type)
427 return type == PTR_TO_SOCKET ||
428 type == PTR_TO_SOCKET_OR_NULL ||
429 type == PTR_TO_TCP_SOCK ||
430 type == PTR_TO_TCP_SOCK_OR_NULL ||
431 type == PTR_TO_MEM ||
432 type == PTR_TO_MEM_OR_NULL;
435 static bool arg_type_may_be_refcounted(enum bpf_arg_type type)
437 return type == ARG_PTR_TO_SOCK_COMMON;
440 static bool arg_type_may_be_null(enum bpf_arg_type type)
442 return type == ARG_PTR_TO_MAP_VALUE_OR_NULL ||
443 type == ARG_PTR_TO_MEM_OR_NULL ||
444 type == ARG_PTR_TO_CTX_OR_NULL ||
445 type == ARG_PTR_TO_SOCKET_OR_NULL ||
446 type == ARG_PTR_TO_ALLOC_MEM_OR_NULL;
449 /* Determine whether the function releases some resources allocated by another
450 * function call. The first reference type argument will be assumed to be
451 * released by release_reference().
453 static bool is_release_function(enum bpf_func_id func_id)
455 return func_id == BPF_FUNC_sk_release ||
456 func_id == BPF_FUNC_ringbuf_submit ||
457 func_id == BPF_FUNC_ringbuf_discard;
460 static bool may_be_acquire_function(enum bpf_func_id func_id)
462 return func_id == BPF_FUNC_sk_lookup_tcp ||
463 func_id == BPF_FUNC_sk_lookup_udp ||
464 func_id == BPF_FUNC_skc_lookup_tcp ||
465 func_id == BPF_FUNC_map_lookup_elem ||
466 func_id == BPF_FUNC_ringbuf_reserve;
469 static bool is_acquire_function(enum bpf_func_id func_id,
470 const struct bpf_map *map)
472 enum bpf_map_type map_type = map ? map->map_type : BPF_MAP_TYPE_UNSPEC;
474 if (func_id == BPF_FUNC_sk_lookup_tcp ||
475 func_id == BPF_FUNC_sk_lookup_udp ||
476 func_id == BPF_FUNC_skc_lookup_tcp ||
477 func_id == BPF_FUNC_ringbuf_reserve)
480 if (func_id == BPF_FUNC_map_lookup_elem &&
481 (map_type == BPF_MAP_TYPE_SOCKMAP ||
482 map_type == BPF_MAP_TYPE_SOCKHASH))
488 static bool is_ptr_cast_function(enum bpf_func_id func_id)
490 return func_id == BPF_FUNC_tcp_sock ||
491 func_id == BPF_FUNC_sk_fullsock ||
492 func_id == BPF_FUNC_skc_to_tcp_sock ||
493 func_id == BPF_FUNC_skc_to_tcp6_sock ||
494 func_id == BPF_FUNC_skc_to_udp6_sock ||
495 func_id == BPF_FUNC_skc_to_tcp_timewait_sock ||
496 func_id == BPF_FUNC_skc_to_tcp_request_sock;
499 /* string representation of 'enum bpf_reg_type' */
500 static const char * const reg_type_str[] = {
502 [SCALAR_VALUE] = "inv",
503 [PTR_TO_CTX] = "ctx",
504 [CONST_PTR_TO_MAP] = "map_ptr",
505 [PTR_TO_MAP_VALUE] = "map_value",
506 [PTR_TO_MAP_VALUE_OR_NULL] = "map_value_or_null",
507 [PTR_TO_STACK] = "fp",
508 [PTR_TO_PACKET] = "pkt",
509 [PTR_TO_PACKET_META] = "pkt_meta",
510 [PTR_TO_PACKET_END] = "pkt_end",
511 [PTR_TO_FLOW_KEYS] = "flow_keys",
512 [PTR_TO_SOCKET] = "sock",
513 [PTR_TO_SOCKET_OR_NULL] = "sock_or_null",
514 [PTR_TO_SOCK_COMMON] = "sock_common",
515 [PTR_TO_SOCK_COMMON_OR_NULL] = "sock_common_or_null",
516 [PTR_TO_TCP_SOCK] = "tcp_sock",
517 [PTR_TO_TCP_SOCK_OR_NULL] = "tcp_sock_or_null",
518 [PTR_TO_TP_BUFFER] = "tp_buffer",
519 [PTR_TO_XDP_SOCK] = "xdp_sock",
520 [PTR_TO_BTF_ID] = "ptr_",
521 [PTR_TO_BTF_ID_OR_NULL] = "ptr_or_null_",
522 [PTR_TO_PERCPU_BTF_ID] = "percpu_ptr_",
523 [PTR_TO_MEM] = "mem",
524 [PTR_TO_MEM_OR_NULL] = "mem_or_null",
525 [PTR_TO_RDONLY_BUF] = "rdonly_buf",
526 [PTR_TO_RDONLY_BUF_OR_NULL] = "rdonly_buf_or_null",
527 [PTR_TO_RDWR_BUF] = "rdwr_buf",
528 [PTR_TO_RDWR_BUF_OR_NULL] = "rdwr_buf_or_null",
531 static char slot_type_char[] = {
532 [STACK_INVALID] = '?',
538 static void print_liveness(struct bpf_verifier_env *env,
539 enum bpf_reg_liveness live)
541 if (live & (REG_LIVE_READ | REG_LIVE_WRITTEN | REG_LIVE_DONE))
543 if (live & REG_LIVE_READ)
545 if (live & REG_LIVE_WRITTEN)
547 if (live & REG_LIVE_DONE)
551 static struct bpf_func_state *func(struct bpf_verifier_env *env,
552 const struct bpf_reg_state *reg)
554 struct bpf_verifier_state *cur = env->cur_state;
556 return cur->frame[reg->frameno];
559 const char *kernel_type_name(u32 id)
561 return btf_name_by_offset(btf_vmlinux,
562 btf_type_by_id(btf_vmlinux, id)->name_off);
565 static void print_verifier_state(struct bpf_verifier_env *env,
566 const struct bpf_func_state *state)
568 const struct bpf_reg_state *reg;
573 verbose(env, " frame%d:", state->frameno);
574 for (i = 0; i < MAX_BPF_REG; i++) {
575 reg = &state->regs[i];
579 verbose(env, " R%d", i);
580 print_liveness(env, reg->live);
581 verbose(env, "=%s", reg_type_str[t]);
582 if (t == SCALAR_VALUE && reg->precise)
584 if ((t == SCALAR_VALUE || t == PTR_TO_STACK) &&
585 tnum_is_const(reg->var_off)) {
586 /* reg->off should be 0 for SCALAR_VALUE */
587 verbose(env, "%lld", reg->var_off.value + reg->off);
589 if (t == PTR_TO_BTF_ID ||
590 t == PTR_TO_BTF_ID_OR_NULL ||
591 t == PTR_TO_PERCPU_BTF_ID)
592 verbose(env, "%s", kernel_type_name(reg->btf_id));
593 verbose(env, "(id=%d", reg->id);
594 if (reg_type_may_be_refcounted_or_null(t))
595 verbose(env, ",ref_obj_id=%d", reg->ref_obj_id);
596 if (t != SCALAR_VALUE)
597 verbose(env, ",off=%d", reg->off);
598 if (type_is_pkt_pointer(t))
599 verbose(env, ",r=%d", reg->range);
600 else if (t == CONST_PTR_TO_MAP ||
601 t == PTR_TO_MAP_VALUE ||
602 t == PTR_TO_MAP_VALUE_OR_NULL)
603 verbose(env, ",ks=%d,vs=%d",
604 reg->map_ptr->key_size,
605 reg->map_ptr->value_size);
606 if (tnum_is_const(reg->var_off)) {
607 /* Typically an immediate SCALAR_VALUE, but
608 * could be a pointer whose offset is too big
611 verbose(env, ",imm=%llx", reg->var_off.value);
613 if (reg->smin_value != reg->umin_value &&
614 reg->smin_value != S64_MIN)
615 verbose(env, ",smin_value=%lld",
616 (long long)reg->smin_value);
617 if (reg->smax_value != reg->umax_value &&
618 reg->smax_value != S64_MAX)
619 verbose(env, ",smax_value=%lld",
620 (long long)reg->smax_value);
621 if (reg->umin_value != 0)
622 verbose(env, ",umin_value=%llu",
623 (unsigned long long)reg->umin_value);
624 if (reg->umax_value != U64_MAX)
625 verbose(env, ",umax_value=%llu",
626 (unsigned long long)reg->umax_value);
627 if (!tnum_is_unknown(reg->var_off)) {
630 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
631 verbose(env, ",var_off=%s", tn_buf);
633 if (reg->s32_min_value != reg->smin_value &&
634 reg->s32_min_value != S32_MIN)
635 verbose(env, ",s32_min_value=%d",
636 (int)(reg->s32_min_value));
637 if (reg->s32_max_value != reg->smax_value &&
638 reg->s32_max_value != S32_MAX)
639 verbose(env, ",s32_max_value=%d",
640 (int)(reg->s32_max_value));
641 if (reg->u32_min_value != reg->umin_value &&
642 reg->u32_min_value != U32_MIN)
643 verbose(env, ",u32_min_value=%d",
644 (int)(reg->u32_min_value));
645 if (reg->u32_max_value != reg->umax_value &&
646 reg->u32_max_value != U32_MAX)
647 verbose(env, ",u32_max_value=%d",
648 (int)(reg->u32_max_value));
653 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) {
654 char types_buf[BPF_REG_SIZE + 1];
658 for (j = 0; j < BPF_REG_SIZE; j++) {
659 if (state->stack[i].slot_type[j] != STACK_INVALID)
661 types_buf[j] = slot_type_char[
662 state->stack[i].slot_type[j]];
664 types_buf[BPF_REG_SIZE] = 0;
667 verbose(env, " fp%d", (-i - 1) * BPF_REG_SIZE);
668 print_liveness(env, state->stack[i].spilled_ptr.live);
669 if (state->stack[i].slot_type[0] == STACK_SPILL) {
670 reg = &state->stack[i].spilled_ptr;
672 verbose(env, "=%s", reg_type_str[t]);
673 if (t == SCALAR_VALUE && reg->precise)
675 if (t == SCALAR_VALUE && tnum_is_const(reg->var_off))
676 verbose(env, "%lld", reg->var_off.value + reg->off);
678 verbose(env, "=%s", types_buf);
681 if (state->acquired_refs && state->refs[0].id) {
682 verbose(env, " refs=%d", state->refs[0].id);
683 for (i = 1; i < state->acquired_refs; i++)
684 if (state->refs[i].id)
685 verbose(env, ",%d", state->refs[i].id);
690 #define COPY_STATE_FN(NAME, COUNT, FIELD, SIZE) \
691 static int copy_##NAME##_state(struct bpf_func_state *dst, \
692 const struct bpf_func_state *src) \
696 if (WARN_ON_ONCE(dst->COUNT < src->COUNT)) { \
697 /* internal bug, make state invalid to reject the program */ \
698 memset(dst, 0, sizeof(*dst)); \
701 memcpy(dst->FIELD, src->FIELD, \
702 sizeof(*src->FIELD) * (src->COUNT / SIZE)); \
705 /* copy_reference_state() */
706 COPY_STATE_FN(reference, acquired_refs, refs, 1)
707 /* copy_stack_state() */
708 COPY_STATE_FN(stack, allocated_stack, stack, BPF_REG_SIZE)
711 #define REALLOC_STATE_FN(NAME, COUNT, FIELD, SIZE) \
712 static int realloc_##NAME##_state(struct bpf_func_state *state, int size, \
715 u32 old_size = state->COUNT; \
716 struct bpf_##NAME##_state *new_##FIELD; \
717 int slot = size / SIZE; \
719 if (size <= old_size || !size) { \
722 state->COUNT = slot * SIZE; \
723 if (!size && old_size) { \
724 kfree(state->FIELD); \
725 state->FIELD = NULL; \
729 new_##FIELD = kmalloc_array(slot, sizeof(struct bpf_##NAME##_state), \
735 memcpy(new_##FIELD, state->FIELD, \
736 sizeof(*new_##FIELD) * (old_size / SIZE)); \
737 memset(new_##FIELD + old_size / SIZE, 0, \
738 sizeof(*new_##FIELD) * (size - old_size) / SIZE); \
740 state->COUNT = slot * SIZE; \
741 kfree(state->FIELD); \
742 state->FIELD = new_##FIELD; \
745 /* realloc_reference_state() */
746 REALLOC_STATE_FN(reference, acquired_refs, refs, 1)
747 /* realloc_stack_state() */
748 REALLOC_STATE_FN(stack, allocated_stack, stack, BPF_REG_SIZE)
749 #undef REALLOC_STATE_FN
751 /* do_check() starts with zero-sized stack in struct bpf_verifier_state to
752 * make it consume minimal amount of memory. check_stack_write() access from
753 * the program calls into realloc_func_state() to grow the stack size.
754 * Note there is a non-zero 'parent' pointer inside bpf_verifier_state
755 * which realloc_stack_state() copies over. It points to previous
756 * bpf_verifier_state which is never reallocated.
758 static int realloc_func_state(struct bpf_func_state *state, int stack_size,
759 int refs_size, bool copy_old)
761 int err = realloc_reference_state(state, refs_size, copy_old);
764 return realloc_stack_state(state, stack_size, copy_old);
767 /* Acquire a pointer id from the env and update the state->refs to include
768 * this new pointer reference.
769 * On success, returns a valid pointer id to associate with the register
770 * On failure, returns a negative errno.
772 static int acquire_reference_state(struct bpf_verifier_env *env, int insn_idx)
774 struct bpf_func_state *state = cur_func(env);
775 int new_ofs = state->acquired_refs;
778 err = realloc_reference_state(state, state->acquired_refs + 1, true);
782 state->refs[new_ofs].id = id;
783 state->refs[new_ofs].insn_idx = insn_idx;
788 /* release function corresponding to acquire_reference_state(). Idempotent. */
789 static int release_reference_state(struct bpf_func_state *state, int ptr_id)
793 last_idx = state->acquired_refs - 1;
794 for (i = 0; i < state->acquired_refs; i++) {
795 if (state->refs[i].id == ptr_id) {
796 if (last_idx && i != last_idx)
797 memcpy(&state->refs[i], &state->refs[last_idx],
798 sizeof(*state->refs));
799 memset(&state->refs[last_idx], 0, sizeof(*state->refs));
800 state->acquired_refs--;
807 static int transfer_reference_state(struct bpf_func_state *dst,
808 struct bpf_func_state *src)
810 int err = realloc_reference_state(dst, src->acquired_refs, false);
813 err = copy_reference_state(dst, src);
819 static void free_func_state(struct bpf_func_state *state)
828 static void clear_jmp_history(struct bpf_verifier_state *state)
830 kfree(state->jmp_history);
831 state->jmp_history = NULL;
832 state->jmp_history_cnt = 0;
835 static void free_verifier_state(struct bpf_verifier_state *state,
840 for (i = 0; i <= state->curframe; i++) {
841 free_func_state(state->frame[i]);
842 state->frame[i] = NULL;
844 clear_jmp_history(state);
849 /* copy verifier state from src to dst growing dst stack space
850 * when necessary to accommodate larger src stack
852 static int copy_func_state(struct bpf_func_state *dst,
853 const struct bpf_func_state *src)
857 err = realloc_func_state(dst, src->allocated_stack, src->acquired_refs,
861 memcpy(dst, src, offsetof(struct bpf_func_state, acquired_refs));
862 err = copy_reference_state(dst, src);
865 return copy_stack_state(dst, src);
868 static int copy_verifier_state(struct bpf_verifier_state *dst_state,
869 const struct bpf_verifier_state *src)
871 struct bpf_func_state *dst;
872 u32 jmp_sz = sizeof(struct bpf_idx_pair) * src->jmp_history_cnt;
875 if (dst_state->jmp_history_cnt < src->jmp_history_cnt) {
876 kfree(dst_state->jmp_history);
877 dst_state->jmp_history = kmalloc(jmp_sz, GFP_USER);
878 if (!dst_state->jmp_history)
881 memcpy(dst_state->jmp_history, src->jmp_history, jmp_sz);
882 dst_state->jmp_history_cnt = src->jmp_history_cnt;
884 /* if dst has more stack frames then src frame, free them */
885 for (i = src->curframe + 1; i <= dst_state->curframe; i++) {
886 free_func_state(dst_state->frame[i]);
887 dst_state->frame[i] = NULL;
889 dst_state->speculative = src->speculative;
890 dst_state->curframe = src->curframe;
891 dst_state->active_spin_lock = src->active_spin_lock;
892 dst_state->branches = src->branches;
893 dst_state->parent = src->parent;
894 dst_state->first_insn_idx = src->first_insn_idx;
895 dst_state->last_insn_idx = src->last_insn_idx;
896 for (i = 0; i <= src->curframe; i++) {
897 dst = dst_state->frame[i];
899 dst = kzalloc(sizeof(*dst), GFP_KERNEL);
902 dst_state->frame[i] = dst;
904 err = copy_func_state(dst, src->frame[i]);
911 static void update_branch_counts(struct bpf_verifier_env *env, struct bpf_verifier_state *st)
914 u32 br = --st->branches;
916 /* WARN_ON(br > 1) technically makes sense here,
917 * but see comment in push_stack(), hence:
919 WARN_ONCE((int)br < 0,
920 "BUG update_branch_counts:branches_to_explore=%d\n",
928 static int pop_stack(struct bpf_verifier_env *env, int *prev_insn_idx,
929 int *insn_idx, bool pop_log)
931 struct bpf_verifier_state *cur = env->cur_state;
932 struct bpf_verifier_stack_elem *elem, *head = env->head;
935 if (env->head == NULL)
939 err = copy_verifier_state(cur, &head->st);
944 bpf_vlog_reset(&env->log, head->log_pos);
946 *insn_idx = head->insn_idx;
948 *prev_insn_idx = head->prev_insn_idx;
950 free_verifier_state(&head->st, false);
957 static struct bpf_verifier_state *push_stack(struct bpf_verifier_env *env,
958 int insn_idx, int prev_insn_idx,
961 struct bpf_verifier_state *cur = env->cur_state;
962 struct bpf_verifier_stack_elem *elem;
965 elem = kzalloc(sizeof(struct bpf_verifier_stack_elem), GFP_KERNEL);
969 elem->insn_idx = insn_idx;
970 elem->prev_insn_idx = prev_insn_idx;
971 elem->next = env->head;
972 elem->log_pos = env->log.len_used;
975 err = copy_verifier_state(&elem->st, cur);
978 elem->st.speculative |= speculative;
979 if (env->stack_size > BPF_COMPLEXITY_LIMIT_JMP_SEQ) {
980 verbose(env, "The sequence of %d jumps is too complex.\n",
984 if (elem->st.parent) {
985 ++elem->st.parent->branches;
986 /* WARN_ON(branches > 2) technically makes sense here,
988 * 1. speculative states will bump 'branches' for non-branch
990 * 2. is_state_visited() heuristics may decide not to create
991 * a new state for a sequence of branches and all such current
992 * and cloned states will be pointing to a single parent state
993 * which might have large 'branches' count.
998 free_verifier_state(env->cur_state, true);
999 env->cur_state = NULL;
1000 /* pop all elements and return */
1001 while (!pop_stack(env, NULL, NULL, false));
1005 #define CALLER_SAVED_REGS 6
1006 static const int caller_saved[CALLER_SAVED_REGS] = {
1007 BPF_REG_0, BPF_REG_1, BPF_REG_2, BPF_REG_3, BPF_REG_4, BPF_REG_5
1010 static void __mark_reg_not_init(const struct bpf_verifier_env *env,
1011 struct bpf_reg_state *reg);
1013 /* This helper doesn't clear reg->id */
1014 static void ___mark_reg_known(struct bpf_reg_state *reg, u64 imm)
1016 reg->var_off = tnum_const(imm);
1017 reg->smin_value = (s64)imm;
1018 reg->smax_value = (s64)imm;
1019 reg->umin_value = imm;
1020 reg->umax_value = imm;
1022 reg->s32_min_value = (s32)imm;
1023 reg->s32_max_value = (s32)imm;
1024 reg->u32_min_value = (u32)imm;
1025 reg->u32_max_value = (u32)imm;
1028 /* Mark the unknown part of a register (variable offset or scalar value) as
1029 * known to have the value @imm.
1031 static void __mark_reg_known(struct bpf_reg_state *reg, u64 imm)
1033 /* Clear id, off, and union(map_ptr, range) */
1034 memset(((u8 *)reg) + sizeof(reg->type), 0,
1035 offsetof(struct bpf_reg_state, var_off) - sizeof(reg->type));
1036 ___mark_reg_known(reg, imm);
1039 static void __mark_reg32_known(struct bpf_reg_state *reg, u64 imm)
1041 reg->var_off = tnum_const_subreg(reg->var_off, imm);
1042 reg->s32_min_value = (s32)imm;
1043 reg->s32_max_value = (s32)imm;
1044 reg->u32_min_value = (u32)imm;
1045 reg->u32_max_value = (u32)imm;
1048 /* Mark the 'variable offset' part of a register as zero. This should be
1049 * used only on registers holding a pointer type.
1051 static void __mark_reg_known_zero(struct bpf_reg_state *reg)
1053 __mark_reg_known(reg, 0);
1056 static void __mark_reg_const_zero(struct bpf_reg_state *reg)
1058 __mark_reg_known(reg, 0);
1059 reg->type = SCALAR_VALUE;
1062 static void mark_reg_known_zero(struct bpf_verifier_env *env,
1063 struct bpf_reg_state *regs, u32 regno)
1065 if (WARN_ON(regno >= MAX_BPF_REG)) {
1066 verbose(env, "mark_reg_known_zero(regs, %u)\n", regno);
1067 /* Something bad happened, let's kill all regs */
1068 for (regno = 0; regno < MAX_BPF_REG; regno++)
1069 __mark_reg_not_init(env, regs + regno);
1072 __mark_reg_known_zero(regs + regno);
1075 static bool reg_is_pkt_pointer(const struct bpf_reg_state *reg)
1077 return type_is_pkt_pointer(reg->type);
1080 static bool reg_is_pkt_pointer_any(const struct bpf_reg_state *reg)
1082 return reg_is_pkt_pointer(reg) ||
1083 reg->type == PTR_TO_PACKET_END;
1086 /* Unmodified PTR_TO_PACKET[_META,_END] register from ctx access. */
1087 static bool reg_is_init_pkt_pointer(const struct bpf_reg_state *reg,
1088 enum bpf_reg_type which)
1090 /* The register can already have a range from prior markings.
1091 * This is fine as long as it hasn't been advanced from its
1094 return reg->type == which &&
1097 tnum_equals_const(reg->var_off, 0);
1100 /* Reset the min/max bounds of a register */
1101 static void __mark_reg_unbounded(struct bpf_reg_state *reg)
1103 reg->smin_value = S64_MIN;
1104 reg->smax_value = S64_MAX;
1105 reg->umin_value = 0;
1106 reg->umax_value = U64_MAX;
1108 reg->s32_min_value = S32_MIN;
1109 reg->s32_max_value = S32_MAX;
1110 reg->u32_min_value = 0;
1111 reg->u32_max_value = U32_MAX;
1114 static void __mark_reg64_unbounded(struct bpf_reg_state *reg)
1116 reg->smin_value = S64_MIN;
1117 reg->smax_value = S64_MAX;
1118 reg->umin_value = 0;
1119 reg->umax_value = U64_MAX;
1122 static void __mark_reg32_unbounded(struct bpf_reg_state *reg)
1124 reg->s32_min_value = S32_MIN;
1125 reg->s32_max_value = S32_MAX;
1126 reg->u32_min_value = 0;
1127 reg->u32_max_value = U32_MAX;
1130 static void __update_reg32_bounds(struct bpf_reg_state *reg)
1132 struct tnum var32_off = tnum_subreg(reg->var_off);
1134 /* min signed is max(sign bit) | min(other bits) */
1135 reg->s32_min_value = max_t(s32, reg->s32_min_value,
1136 var32_off.value | (var32_off.mask & S32_MIN));
1137 /* max signed is min(sign bit) | max(other bits) */
1138 reg->s32_max_value = min_t(s32, reg->s32_max_value,
1139 var32_off.value | (var32_off.mask & S32_MAX));
1140 reg->u32_min_value = max_t(u32, reg->u32_min_value, (u32)var32_off.value);
1141 reg->u32_max_value = min(reg->u32_max_value,
1142 (u32)(var32_off.value | var32_off.mask));
1145 static void __update_reg64_bounds(struct bpf_reg_state *reg)
1147 /* min signed is max(sign bit) | min(other bits) */
1148 reg->smin_value = max_t(s64, reg->smin_value,
1149 reg->var_off.value | (reg->var_off.mask & S64_MIN));
1150 /* max signed is min(sign bit) | max(other bits) */
1151 reg->smax_value = min_t(s64, reg->smax_value,
1152 reg->var_off.value | (reg->var_off.mask & S64_MAX));
1153 reg->umin_value = max(reg->umin_value, reg->var_off.value);
1154 reg->umax_value = min(reg->umax_value,
1155 reg->var_off.value | reg->var_off.mask);
1158 static void __update_reg_bounds(struct bpf_reg_state *reg)
1160 __update_reg32_bounds(reg);
1161 __update_reg64_bounds(reg);
1164 /* Uses signed min/max values to inform unsigned, and vice-versa */
1165 static void __reg32_deduce_bounds(struct bpf_reg_state *reg)
1167 /* Learn sign from signed bounds.
1168 * If we cannot cross the sign boundary, then signed and unsigned bounds
1169 * are the same, so combine. This works even in the negative case, e.g.
1170 * -3 s<= x s<= -1 implies 0xf...fd u<= x u<= 0xf...ff.
1172 if (reg->s32_min_value >= 0 || reg->s32_max_value < 0) {
1173 reg->s32_min_value = reg->u32_min_value =
1174 max_t(u32, reg->s32_min_value, reg->u32_min_value);
1175 reg->s32_max_value = reg->u32_max_value =
1176 min_t(u32, reg->s32_max_value, reg->u32_max_value);
1179 /* Learn sign from unsigned bounds. Signed bounds cross the sign
1180 * boundary, so we must be careful.
1182 if ((s32)reg->u32_max_value >= 0) {
1183 /* Positive. We can't learn anything from the smin, but smax
1184 * is positive, hence safe.
1186 reg->s32_min_value = reg->u32_min_value;
1187 reg->s32_max_value = reg->u32_max_value =
1188 min_t(u32, reg->s32_max_value, reg->u32_max_value);
1189 } else if ((s32)reg->u32_min_value < 0) {
1190 /* Negative. We can't learn anything from the smax, but smin
1191 * is negative, hence safe.
1193 reg->s32_min_value = reg->u32_min_value =
1194 max_t(u32, reg->s32_min_value, reg->u32_min_value);
1195 reg->s32_max_value = reg->u32_max_value;
1199 static void __reg64_deduce_bounds(struct bpf_reg_state *reg)
1201 /* Learn sign from signed bounds.
1202 * If we cannot cross the sign boundary, then signed and unsigned bounds
1203 * are the same, so combine. This works even in the negative case, e.g.
1204 * -3 s<= x s<= -1 implies 0xf...fd u<= x u<= 0xf...ff.
1206 if (reg->smin_value >= 0 || reg->smax_value < 0) {
1207 reg->smin_value = reg->umin_value = max_t(u64, reg->smin_value,
1209 reg->smax_value = reg->umax_value = min_t(u64, reg->smax_value,
1213 /* Learn sign from unsigned bounds. Signed bounds cross the sign
1214 * boundary, so we must be careful.
1216 if ((s64)reg->umax_value >= 0) {
1217 /* Positive. We can't learn anything from the smin, but smax
1218 * is positive, hence safe.
1220 reg->smin_value = reg->umin_value;
1221 reg->smax_value = reg->umax_value = min_t(u64, reg->smax_value,
1223 } else if ((s64)reg->umin_value < 0) {
1224 /* Negative. We can't learn anything from the smax, but smin
1225 * is negative, hence safe.
1227 reg->smin_value = reg->umin_value = max_t(u64, reg->smin_value,
1229 reg->smax_value = reg->umax_value;
1233 static void __reg_deduce_bounds(struct bpf_reg_state *reg)
1235 __reg32_deduce_bounds(reg);
1236 __reg64_deduce_bounds(reg);
1239 /* Attempts to improve var_off based on unsigned min/max information */
1240 static void __reg_bound_offset(struct bpf_reg_state *reg)
1242 struct tnum var64_off = tnum_intersect(reg->var_off,
1243 tnum_range(reg->umin_value,
1245 struct tnum var32_off = tnum_intersect(tnum_subreg(reg->var_off),
1246 tnum_range(reg->u32_min_value,
1247 reg->u32_max_value));
1249 reg->var_off = tnum_or(tnum_clear_subreg(var64_off), var32_off);
1252 static void __reg_assign_32_into_64(struct bpf_reg_state *reg)
1254 reg->umin_value = reg->u32_min_value;
1255 reg->umax_value = reg->u32_max_value;
1256 /* Attempt to pull 32-bit signed bounds into 64-bit bounds
1257 * but must be positive otherwise set to worse case bounds
1258 * and refine later from tnum.
1260 if (reg->s32_min_value >= 0 && reg->s32_max_value >= 0)
1261 reg->smax_value = reg->s32_max_value;
1263 reg->smax_value = U32_MAX;
1264 if (reg->s32_min_value >= 0)
1265 reg->smin_value = reg->s32_min_value;
1267 reg->smin_value = 0;
1270 static void __reg_combine_32_into_64(struct bpf_reg_state *reg)
1272 /* special case when 64-bit register has upper 32-bit register
1273 * zeroed. Typically happens after zext or <<32, >>32 sequence
1274 * allowing us to use 32-bit bounds directly,
1276 if (tnum_equals_const(tnum_clear_subreg(reg->var_off), 0)) {
1277 __reg_assign_32_into_64(reg);
1279 /* Otherwise the best we can do is push lower 32bit known and
1280 * unknown bits into register (var_off set from jmp logic)
1281 * then learn as much as possible from the 64-bit tnum
1282 * known and unknown bits. The previous smin/smax bounds are
1283 * invalid here because of jmp32 compare so mark them unknown
1284 * so they do not impact tnum bounds calculation.
1286 __mark_reg64_unbounded(reg);
1287 __update_reg_bounds(reg);
1290 /* Intersecting with the old var_off might have improved our bounds
1291 * slightly. e.g. if umax was 0x7f...f and var_off was (0; 0xf...fc),
1292 * then new var_off is (0; 0x7f...fc) which improves our umax.
1294 __reg_deduce_bounds(reg);
1295 __reg_bound_offset(reg);
1296 __update_reg_bounds(reg);
1299 static bool __reg64_bound_s32(s64 a)
1301 if (a > S32_MIN && a < S32_MAX)
1306 static bool __reg64_bound_u32(u64 a)
1308 if (a > U32_MIN && a < U32_MAX)
1313 static void __reg_combine_64_into_32(struct bpf_reg_state *reg)
1315 __mark_reg32_unbounded(reg);
1317 if (__reg64_bound_s32(reg->smin_value))
1318 reg->s32_min_value = (s32)reg->smin_value;
1319 if (__reg64_bound_s32(reg->smax_value))
1320 reg->s32_max_value = (s32)reg->smax_value;
1321 if (__reg64_bound_u32(reg->umin_value))
1322 reg->u32_min_value = (u32)reg->umin_value;
1323 if (__reg64_bound_u32(reg->umax_value))
1324 reg->u32_max_value = (u32)reg->umax_value;
1326 /* Intersecting with the old var_off might have improved our bounds
1327 * slightly. e.g. if umax was 0x7f...f and var_off was (0; 0xf...fc),
1328 * then new var_off is (0; 0x7f...fc) which improves our umax.
1330 __reg_deduce_bounds(reg);
1331 __reg_bound_offset(reg);
1332 __update_reg_bounds(reg);
1335 /* Mark a register as having a completely unknown (scalar) value. */
1336 static void __mark_reg_unknown(const struct bpf_verifier_env *env,
1337 struct bpf_reg_state *reg)
1340 * Clear type, id, off, and union(map_ptr, range) and
1341 * padding between 'type' and union
1343 memset(reg, 0, offsetof(struct bpf_reg_state, var_off));
1344 reg->type = SCALAR_VALUE;
1345 reg->var_off = tnum_unknown;
1347 reg->precise = env->subprog_cnt > 1 || !env->bpf_capable;
1348 __mark_reg_unbounded(reg);
1351 static void mark_reg_unknown(struct bpf_verifier_env *env,
1352 struct bpf_reg_state *regs, u32 regno)
1354 if (WARN_ON(regno >= MAX_BPF_REG)) {
1355 verbose(env, "mark_reg_unknown(regs, %u)\n", regno);
1356 /* Something bad happened, let's kill all regs except FP */
1357 for (regno = 0; regno < BPF_REG_FP; regno++)
1358 __mark_reg_not_init(env, regs + regno);
1361 __mark_reg_unknown(env, regs + regno);
1364 static void __mark_reg_not_init(const struct bpf_verifier_env *env,
1365 struct bpf_reg_state *reg)
1367 __mark_reg_unknown(env, reg);
1368 reg->type = NOT_INIT;
1371 static void mark_reg_not_init(struct bpf_verifier_env *env,
1372 struct bpf_reg_state *regs, u32 regno)
1374 if (WARN_ON(regno >= MAX_BPF_REG)) {
1375 verbose(env, "mark_reg_not_init(regs, %u)\n", regno);
1376 /* Something bad happened, let's kill all regs except FP */
1377 for (regno = 0; regno < BPF_REG_FP; regno++)
1378 __mark_reg_not_init(env, regs + regno);
1381 __mark_reg_not_init(env, regs + regno);
1384 static void mark_btf_ld_reg(struct bpf_verifier_env *env,
1385 struct bpf_reg_state *regs, u32 regno,
1386 enum bpf_reg_type reg_type, u32 btf_id)
1388 if (reg_type == SCALAR_VALUE) {
1389 mark_reg_unknown(env, regs, regno);
1392 mark_reg_known_zero(env, regs, regno);
1393 regs[regno].type = PTR_TO_BTF_ID;
1394 regs[regno].btf_id = btf_id;
1397 #define DEF_NOT_SUBREG (0)
1398 static void init_reg_state(struct bpf_verifier_env *env,
1399 struct bpf_func_state *state)
1401 struct bpf_reg_state *regs = state->regs;
1404 for (i = 0; i < MAX_BPF_REG; i++) {
1405 mark_reg_not_init(env, regs, i);
1406 regs[i].live = REG_LIVE_NONE;
1407 regs[i].parent = NULL;
1408 regs[i].subreg_def = DEF_NOT_SUBREG;
1412 regs[BPF_REG_FP].type = PTR_TO_STACK;
1413 mark_reg_known_zero(env, regs, BPF_REG_FP);
1414 regs[BPF_REG_FP].frameno = state->frameno;
1417 #define BPF_MAIN_FUNC (-1)
1418 static void init_func_state(struct bpf_verifier_env *env,
1419 struct bpf_func_state *state,
1420 int callsite, int frameno, int subprogno)
1422 state->callsite = callsite;
1423 state->frameno = frameno;
1424 state->subprogno = subprogno;
1425 init_reg_state(env, state);
1429 SRC_OP, /* register is used as source operand */
1430 DST_OP, /* register is used as destination operand */
1431 DST_OP_NO_MARK /* same as above, check only, don't mark */
1434 static int cmp_subprogs(const void *a, const void *b)
1436 return ((struct bpf_subprog_info *)a)->start -
1437 ((struct bpf_subprog_info *)b)->start;
1440 static int find_subprog(struct bpf_verifier_env *env, int off)
1442 struct bpf_subprog_info *p;
1444 p = bsearch(&off, env->subprog_info, env->subprog_cnt,
1445 sizeof(env->subprog_info[0]), cmp_subprogs);
1448 return p - env->subprog_info;
1452 static int add_subprog(struct bpf_verifier_env *env, int off)
1454 int insn_cnt = env->prog->len;
1457 if (off >= insn_cnt || off < 0) {
1458 verbose(env, "call to invalid destination\n");
1461 ret = find_subprog(env, off);
1464 if (env->subprog_cnt >= BPF_MAX_SUBPROGS) {
1465 verbose(env, "too many subprograms\n");
1468 env->subprog_info[env->subprog_cnt++].start = off;
1469 sort(env->subprog_info, env->subprog_cnt,
1470 sizeof(env->subprog_info[0]), cmp_subprogs, NULL);
1474 static int check_subprogs(struct bpf_verifier_env *env)
1476 int i, ret, subprog_start, subprog_end, off, cur_subprog = 0;
1477 struct bpf_subprog_info *subprog = env->subprog_info;
1478 struct bpf_insn *insn = env->prog->insnsi;
1479 int insn_cnt = env->prog->len;
1481 /* Add entry function. */
1482 ret = add_subprog(env, 0);
1486 /* determine subprog starts. The end is one before the next starts */
1487 for (i = 0; i < insn_cnt; i++) {
1488 if (insn[i].code != (BPF_JMP | BPF_CALL))
1490 if (insn[i].src_reg != BPF_PSEUDO_CALL)
1492 if (!env->bpf_capable) {
1494 "function calls to other bpf functions are allowed for CAP_BPF and CAP_SYS_ADMIN\n");
1497 ret = add_subprog(env, i + insn[i].imm + 1);
1502 /* Add a fake 'exit' subprog which could simplify subprog iteration
1503 * logic. 'subprog_cnt' should not be increased.
1505 subprog[env->subprog_cnt].start = insn_cnt;
1507 if (env->log.level & BPF_LOG_LEVEL2)
1508 for (i = 0; i < env->subprog_cnt; i++)
1509 verbose(env, "func#%d @%d\n", i, subprog[i].start);
1511 /* now check that all jumps are within the same subprog */
1512 subprog_start = subprog[cur_subprog].start;
1513 subprog_end = subprog[cur_subprog + 1].start;
1514 for (i = 0; i < insn_cnt; i++) {
1515 u8 code = insn[i].code;
1517 if (code == (BPF_JMP | BPF_CALL) &&
1518 insn[i].imm == BPF_FUNC_tail_call &&
1519 insn[i].src_reg != BPF_PSEUDO_CALL)
1520 subprog[cur_subprog].has_tail_call = true;
1521 if (BPF_CLASS(code) == BPF_LD &&
1522 (BPF_MODE(code) == BPF_ABS || BPF_MODE(code) == BPF_IND))
1523 subprog[cur_subprog].has_ld_abs = true;
1524 if (BPF_CLASS(code) != BPF_JMP && BPF_CLASS(code) != BPF_JMP32)
1526 if (BPF_OP(code) == BPF_EXIT || BPF_OP(code) == BPF_CALL)
1528 off = i + insn[i].off + 1;
1529 if (off < subprog_start || off >= subprog_end) {
1530 verbose(env, "jump out of range from insn %d to %d\n", i, off);
1534 if (i == subprog_end - 1) {
1535 /* to avoid fall-through from one subprog into another
1536 * the last insn of the subprog should be either exit
1537 * or unconditional jump back
1539 if (code != (BPF_JMP | BPF_EXIT) &&
1540 code != (BPF_JMP | BPF_JA)) {
1541 verbose(env, "last insn is not an exit or jmp\n");
1544 subprog_start = subprog_end;
1546 if (cur_subprog < env->subprog_cnt)
1547 subprog_end = subprog[cur_subprog + 1].start;
1553 /* Parentage chain of this register (or stack slot) should take care of all
1554 * issues like callee-saved registers, stack slot allocation time, etc.
1556 static int mark_reg_read(struct bpf_verifier_env *env,
1557 const struct bpf_reg_state *state,
1558 struct bpf_reg_state *parent, u8 flag)
1560 bool writes = parent == state->parent; /* Observe write marks */
1564 /* if read wasn't screened by an earlier write ... */
1565 if (writes && state->live & REG_LIVE_WRITTEN)
1567 if (parent->live & REG_LIVE_DONE) {
1568 verbose(env, "verifier BUG type %s var_off %lld off %d\n",
1569 reg_type_str[parent->type],
1570 parent->var_off.value, parent->off);
1573 /* The first condition is more likely to be true than the
1574 * second, checked it first.
1576 if ((parent->live & REG_LIVE_READ) == flag ||
1577 parent->live & REG_LIVE_READ64)
1578 /* The parentage chain never changes and
1579 * this parent was already marked as LIVE_READ.
1580 * There is no need to keep walking the chain again and
1581 * keep re-marking all parents as LIVE_READ.
1582 * This case happens when the same register is read
1583 * multiple times without writes into it in-between.
1584 * Also, if parent has the stronger REG_LIVE_READ64 set,
1585 * then no need to set the weak REG_LIVE_READ32.
1588 /* ... then we depend on parent's value */
1589 parent->live |= flag;
1590 /* REG_LIVE_READ64 overrides REG_LIVE_READ32. */
1591 if (flag == REG_LIVE_READ64)
1592 parent->live &= ~REG_LIVE_READ32;
1594 parent = state->parent;
1599 if (env->longest_mark_read_walk < cnt)
1600 env->longest_mark_read_walk = cnt;
1604 /* This function is supposed to be used by the following 32-bit optimization
1605 * code only. It returns TRUE if the source or destination register operates
1606 * on 64-bit, otherwise return FALSE.
1608 static bool is_reg64(struct bpf_verifier_env *env, struct bpf_insn *insn,
1609 u32 regno, struct bpf_reg_state *reg, enum reg_arg_type t)
1614 class = BPF_CLASS(code);
1616 if (class == BPF_JMP) {
1617 /* BPF_EXIT for "main" will reach here. Return TRUE
1622 if (op == BPF_CALL) {
1623 /* BPF to BPF call will reach here because of marking
1624 * caller saved clobber with DST_OP_NO_MARK for which we
1625 * don't care the register def because they are anyway
1626 * marked as NOT_INIT already.
1628 if (insn->src_reg == BPF_PSEUDO_CALL)
1630 /* Helper call will reach here because of arg type
1631 * check, conservatively return TRUE.
1640 if (class == BPF_ALU64 || class == BPF_JMP ||
1641 /* BPF_END always use BPF_ALU class. */
1642 (class == BPF_ALU && op == BPF_END && insn->imm == 64))
1645 if (class == BPF_ALU || class == BPF_JMP32)
1648 if (class == BPF_LDX) {
1650 return BPF_SIZE(code) == BPF_DW;
1651 /* LDX source must be ptr. */
1655 if (class == BPF_STX) {
1656 if (reg->type != SCALAR_VALUE)
1658 return BPF_SIZE(code) == BPF_DW;
1661 if (class == BPF_LD) {
1662 u8 mode = BPF_MODE(code);
1665 if (mode == BPF_IMM)
1668 /* Both LD_IND and LD_ABS return 32-bit data. */
1672 /* Implicit ctx ptr. */
1673 if (regno == BPF_REG_6)
1676 /* Explicit source could be any width. */
1680 if (class == BPF_ST)
1681 /* The only source register for BPF_ST is a ptr. */
1684 /* Conservatively return true at default. */
1688 /* Return TRUE if INSN doesn't have explicit value define. */
1689 static bool insn_no_def(struct bpf_insn *insn)
1691 u8 class = BPF_CLASS(insn->code);
1693 return (class == BPF_JMP || class == BPF_JMP32 ||
1694 class == BPF_STX || class == BPF_ST);
1697 /* Return TRUE if INSN has defined any 32-bit value explicitly. */
1698 static bool insn_has_def32(struct bpf_verifier_env *env, struct bpf_insn *insn)
1700 if (insn_no_def(insn))
1703 return !is_reg64(env, insn, insn->dst_reg, NULL, DST_OP);
1706 static void mark_insn_zext(struct bpf_verifier_env *env,
1707 struct bpf_reg_state *reg)
1709 s32 def_idx = reg->subreg_def;
1711 if (def_idx == DEF_NOT_SUBREG)
1714 env->insn_aux_data[def_idx - 1].zext_dst = true;
1715 /* The dst will be zero extended, so won't be sub-register anymore. */
1716 reg->subreg_def = DEF_NOT_SUBREG;
1719 static int check_reg_arg(struct bpf_verifier_env *env, u32 regno,
1720 enum reg_arg_type t)
1722 struct bpf_verifier_state *vstate = env->cur_state;
1723 struct bpf_func_state *state = vstate->frame[vstate->curframe];
1724 struct bpf_insn *insn = env->prog->insnsi + env->insn_idx;
1725 struct bpf_reg_state *reg, *regs = state->regs;
1728 if (regno >= MAX_BPF_REG) {
1729 verbose(env, "R%d is invalid\n", regno);
1734 rw64 = is_reg64(env, insn, regno, reg, t);
1736 /* check whether register used as source operand can be read */
1737 if (reg->type == NOT_INIT) {
1738 verbose(env, "R%d !read_ok\n", regno);
1741 /* We don't need to worry about FP liveness because it's read-only */
1742 if (regno == BPF_REG_FP)
1746 mark_insn_zext(env, reg);
1748 return mark_reg_read(env, reg, reg->parent,
1749 rw64 ? REG_LIVE_READ64 : REG_LIVE_READ32);
1751 /* check whether register used as dest operand can be written to */
1752 if (regno == BPF_REG_FP) {
1753 verbose(env, "frame pointer is read only\n");
1756 reg->live |= REG_LIVE_WRITTEN;
1757 reg->subreg_def = rw64 ? DEF_NOT_SUBREG : env->insn_idx + 1;
1759 mark_reg_unknown(env, regs, regno);
1764 /* for any branch, call, exit record the history of jmps in the given state */
1765 static int push_jmp_history(struct bpf_verifier_env *env,
1766 struct bpf_verifier_state *cur)
1768 u32 cnt = cur->jmp_history_cnt;
1769 struct bpf_idx_pair *p;
1772 p = krealloc(cur->jmp_history, cnt * sizeof(*p), GFP_USER);
1775 p[cnt - 1].idx = env->insn_idx;
1776 p[cnt - 1].prev_idx = env->prev_insn_idx;
1777 cur->jmp_history = p;
1778 cur->jmp_history_cnt = cnt;
1782 /* Backtrack one insn at a time. If idx is not at the top of recorded
1783 * history then previous instruction came from straight line execution.
1785 static int get_prev_insn_idx(struct bpf_verifier_state *st, int i,
1790 if (cnt && st->jmp_history[cnt - 1].idx == i) {
1791 i = st->jmp_history[cnt - 1].prev_idx;
1799 /* For given verifier state backtrack_insn() is called from the last insn to
1800 * the first insn. Its purpose is to compute a bitmask of registers and
1801 * stack slots that needs precision in the parent verifier state.
1803 static int backtrack_insn(struct bpf_verifier_env *env, int idx,
1804 u32 *reg_mask, u64 *stack_mask)
1806 const struct bpf_insn_cbs cbs = {
1807 .cb_print = verbose,
1808 .private_data = env,
1810 struct bpf_insn *insn = env->prog->insnsi + idx;
1811 u8 class = BPF_CLASS(insn->code);
1812 u8 opcode = BPF_OP(insn->code);
1813 u8 mode = BPF_MODE(insn->code);
1814 u32 dreg = 1u << insn->dst_reg;
1815 u32 sreg = 1u << insn->src_reg;
1818 if (insn->code == 0)
1820 if (env->log.level & BPF_LOG_LEVEL) {
1821 verbose(env, "regs=%x stack=%llx before ", *reg_mask, *stack_mask);
1822 verbose(env, "%d: ", idx);
1823 print_bpf_insn(&cbs, insn, env->allow_ptr_leaks);
1826 if (class == BPF_ALU || class == BPF_ALU64) {
1827 if (!(*reg_mask & dreg))
1829 if (opcode == BPF_MOV) {
1830 if (BPF_SRC(insn->code) == BPF_X) {
1832 * dreg needs precision after this insn
1833 * sreg needs precision before this insn
1839 * dreg needs precision after this insn.
1840 * Corresponding register is already marked
1841 * as precise=true in this verifier state.
1842 * No further markings in parent are necessary
1847 if (BPF_SRC(insn->code) == BPF_X) {
1849 * both dreg and sreg need precision
1854 * dreg still needs precision before this insn
1857 } else if (class == BPF_LDX) {
1858 if (!(*reg_mask & dreg))
1862 /* scalars can only be spilled into stack w/o losing precision.
1863 * Load from any other memory can be zero extended.
1864 * The desire to keep that precision is already indicated
1865 * by 'precise' mark in corresponding register of this state.
1866 * No further tracking necessary.
1868 if (insn->src_reg != BPF_REG_FP)
1870 if (BPF_SIZE(insn->code) != BPF_DW)
1873 /* dreg = *(u64 *)[fp - off] was a fill from the stack.
1874 * that [fp - off] slot contains scalar that needs to be
1875 * tracked with precision
1877 spi = (-insn->off - 1) / BPF_REG_SIZE;
1879 verbose(env, "BUG spi %d\n", spi);
1880 WARN_ONCE(1, "verifier backtracking bug");
1883 *stack_mask |= 1ull << spi;
1884 } else if (class == BPF_STX || class == BPF_ST) {
1885 if (*reg_mask & dreg)
1886 /* stx & st shouldn't be using _scalar_ dst_reg
1887 * to access memory. It means backtracking
1888 * encountered a case of pointer subtraction.
1891 /* scalars can only be spilled into stack */
1892 if (insn->dst_reg != BPF_REG_FP)
1894 if (BPF_SIZE(insn->code) != BPF_DW)
1896 spi = (-insn->off - 1) / BPF_REG_SIZE;
1898 verbose(env, "BUG spi %d\n", spi);
1899 WARN_ONCE(1, "verifier backtracking bug");
1902 if (!(*stack_mask & (1ull << spi)))
1904 *stack_mask &= ~(1ull << spi);
1905 if (class == BPF_STX)
1907 } else if (class == BPF_JMP || class == BPF_JMP32) {
1908 if (opcode == BPF_CALL) {
1909 if (insn->src_reg == BPF_PSEUDO_CALL)
1911 /* regular helper call sets R0 */
1913 if (*reg_mask & 0x3f) {
1914 /* if backtracing was looking for registers R1-R5
1915 * they should have been found already.
1917 verbose(env, "BUG regs %x\n", *reg_mask);
1918 WARN_ONCE(1, "verifier backtracking bug");
1921 } else if (opcode == BPF_EXIT) {
1924 } else if (class == BPF_LD) {
1925 if (!(*reg_mask & dreg))
1928 /* It's ld_imm64 or ld_abs or ld_ind.
1929 * For ld_imm64 no further tracking of precision
1930 * into parent is necessary
1932 if (mode == BPF_IND || mode == BPF_ABS)
1933 /* to be analyzed */
1939 /* the scalar precision tracking algorithm:
1940 * . at the start all registers have precise=false.
1941 * . scalar ranges are tracked as normal through alu and jmp insns.
1942 * . once precise value of the scalar register is used in:
1943 * . ptr + scalar alu
1944 * . if (scalar cond K|scalar)
1945 * . helper_call(.., scalar, ...) where ARG_CONST is expected
1946 * backtrack through the verifier states and mark all registers and
1947 * stack slots with spilled constants that these scalar regisers
1948 * should be precise.
1949 * . during state pruning two registers (or spilled stack slots)
1950 * are equivalent if both are not precise.
1952 * Note the verifier cannot simply walk register parentage chain,
1953 * since many different registers and stack slots could have been
1954 * used to compute single precise scalar.
1956 * The approach of starting with precise=true for all registers and then
1957 * backtrack to mark a register as not precise when the verifier detects
1958 * that program doesn't care about specific value (e.g., when helper
1959 * takes register as ARG_ANYTHING parameter) is not safe.
1961 * It's ok to walk single parentage chain of the verifier states.
1962 * It's possible that this backtracking will go all the way till 1st insn.
1963 * All other branches will be explored for needing precision later.
1965 * The backtracking needs to deal with cases like:
1966 * R8=map_value(id=0,off=0,ks=4,vs=1952,imm=0) R9_w=map_value(id=0,off=40,ks=4,vs=1952,imm=0)
1969 * if r5 > 0x79f goto pc+7
1970 * R5_w=inv(id=0,umax_value=1951,var_off=(0x0; 0x7ff))
1973 * call bpf_perf_event_output#25
1974 * where .arg5_type = ARG_CONST_SIZE_OR_ZERO
1978 * call foo // uses callee's r6 inside to compute r0
1982 * to track above reg_mask/stack_mask needs to be independent for each frame.
1984 * Also if parent's curframe > frame where backtracking started,
1985 * the verifier need to mark registers in both frames, otherwise callees
1986 * may incorrectly prune callers. This is similar to
1987 * commit 7640ead93924 ("bpf: verifier: make sure callees don't prune with caller differences")
1989 * For now backtracking falls back into conservative marking.
1991 static void mark_all_scalars_precise(struct bpf_verifier_env *env,
1992 struct bpf_verifier_state *st)
1994 struct bpf_func_state *func;
1995 struct bpf_reg_state *reg;
1998 /* big hammer: mark all scalars precise in this path.
1999 * pop_stack may still get !precise scalars.
2001 for (; st; st = st->parent)
2002 for (i = 0; i <= st->curframe; i++) {
2003 func = st->frame[i];
2004 for (j = 0; j < BPF_REG_FP; j++) {
2005 reg = &func->regs[j];
2006 if (reg->type != SCALAR_VALUE)
2008 reg->precise = true;
2010 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {
2011 if (func->stack[j].slot_type[0] != STACK_SPILL)
2013 reg = &func->stack[j].spilled_ptr;
2014 if (reg->type != SCALAR_VALUE)
2016 reg->precise = true;
2021 static int __mark_chain_precision(struct bpf_verifier_env *env, int regno,
2024 struct bpf_verifier_state *st = env->cur_state;
2025 int first_idx = st->first_insn_idx;
2026 int last_idx = env->insn_idx;
2027 struct bpf_func_state *func;
2028 struct bpf_reg_state *reg;
2029 u32 reg_mask = regno >= 0 ? 1u << regno : 0;
2030 u64 stack_mask = spi >= 0 ? 1ull << spi : 0;
2031 bool skip_first = true;
2032 bool new_marks = false;
2035 if (!env->bpf_capable)
2038 func = st->frame[st->curframe];
2040 reg = &func->regs[regno];
2041 if (reg->type != SCALAR_VALUE) {
2042 WARN_ONCE(1, "backtracing misuse");
2049 reg->precise = true;
2053 if (func->stack[spi].slot_type[0] != STACK_SPILL) {
2057 reg = &func->stack[spi].spilled_ptr;
2058 if (reg->type != SCALAR_VALUE) {
2066 reg->precise = true;
2072 if (!reg_mask && !stack_mask)
2075 DECLARE_BITMAP(mask, 64);
2076 u32 history = st->jmp_history_cnt;
2078 if (env->log.level & BPF_LOG_LEVEL)
2079 verbose(env, "last_idx %d first_idx %d\n", last_idx, first_idx);
2080 for (i = last_idx;;) {
2085 err = backtrack_insn(env, i, ®_mask, &stack_mask);
2087 if (err == -ENOTSUPP) {
2088 mark_all_scalars_precise(env, st);
2093 if (!reg_mask && !stack_mask)
2094 /* Found assignment(s) into tracked register in this state.
2095 * Since this state is already marked, just return.
2096 * Nothing to be tracked further in the parent state.
2101 i = get_prev_insn_idx(st, i, &history);
2102 if (i >= env->prog->len) {
2103 /* This can happen if backtracking reached insn 0
2104 * and there are still reg_mask or stack_mask
2106 * It means the backtracking missed the spot where
2107 * particular register was initialized with a constant.
2109 verbose(env, "BUG backtracking idx %d\n", i);
2110 WARN_ONCE(1, "verifier backtracking bug");
2119 func = st->frame[st->curframe];
2120 bitmap_from_u64(mask, reg_mask);
2121 for_each_set_bit(i, mask, 32) {
2122 reg = &func->regs[i];
2123 if (reg->type != SCALAR_VALUE) {
2124 reg_mask &= ~(1u << i);
2129 reg->precise = true;
2132 bitmap_from_u64(mask, stack_mask);
2133 for_each_set_bit(i, mask, 64) {
2134 if (i >= func->allocated_stack / BPF_REG_SIZE) {
2135 /* the sequence of instructions:
2137 * 3: (7b) *(u64 *)(r3 -8) = r0
2138 * 4: (79) r4 = *(u64 *)(r10 -8)
2139 * doesn't contain jmps. It's backtracked
2140 * as a single block.
2141 * During backtracking insn 3 is not recognized as
2142 * stack access, so at the end of backtracking
2143 * stack slot fp-8 is still marked in stack_mask.
2144 * However the parent state may not have accessed
2145 * fp-8 and it's "unallocated" stack space.
2146 * In such case fallback to conservative.
2148 mark_all_scalars_precise(env, st);
2152 if (func->stack[i].slot_type[0] != STACK_SPILL) {
2153 stack_mask &= ~(1ull << i);
2156 reg = &func->stack[i].spilled_ptr;
2157 if (reg->type != SCALAR_VALUE) {
2158 stack_mask &= ~(1ull << i);
2163 reg->precise = true;
2165 if (env->log.level & BPF_LOG_LEVEL) {
2166 print_verifier_state(env, func);
2167 verbose(env, "parent %s regs=%x stack=%llx marks\n",
2168 new_marks ? "didn't have" : "already had",
2169 reg_mask, stack_mask);
2172 if (!reg_mask && !stack_mask)
2177 last_idx = st->last_insn_idx;
2178 first_idx = st->first_insn_idx;
2183 static int mark_chain_precision(struct bpf_verifier_env *env, int regno)
2185 return __mark_chain_precision(env, regno, -1);
2188 static int mark_chain_precision_stack(struct bpf_verifier_env *env, int spi)
2190 return __mark_chain_precision(env, -1, spi);
2193 static bool is_spillable_regtype(enum bpf_reg_type type)
2196 case PTR_TO_MAP_VALUE:
2197 case PTR_TO_MAP_VALUE_OR_NULL:
2201 case PTR_TO_PACKET_META:
2202 case PTR_TO_PACKET_END:
2203 case PTR_TO_FLOW_KEYS:
2204 case CONST_PTR_TO_MAP:
2206 case PTR_TO_SOCKET_OR_NULL:
2207 case PTR_TO_SOCK_COMMON:
2208 case PTR_TO_SOCK_COMMON_OR_NULL:
2209 case PTR_TO_TCP_SOCK:
2210 case PTR_TO_TCP_SOCK_OR_NULL:
2211 case PTR_TO_XDP_SOCK:
2213 case PTR_TO_BTF_ID_OR_NULL:
2214 case PTR_TO_RDONLY_BUF:
2215 case PTR_TO_RDONLY_BUF_OR_NULL:
2216 case PTR_TO_RDWR_BUF:
2217 case PTR_TO_RDWR_BUF_OR_NULL:
2218 case PTR_TO_PERCPU_BTF_ID:
2225 /* Does this register contain a constant zero? */
2226 static bool register_is_null(struct bpf_reg_state *reg)
2228 return reg->type == SCALAR_VALUE && tnum_equals_const(reg->var_off, 0);
2231 static bool register_is_const(struct bpf_reg_state *reg)
2233 return reg->type == SCALAR_VALUE && tnum_is_const(reg->var_off);
2236 static bool __is_scalar_unbounded(struct bpf_reg_state *reg)
2238 return tnum_is_unknown(reg->var_off) &&
2239 reg->smin_value == S64_MIN && reg->smax_value == S64_MAX &&
2240 reg->umin_value == 0 && reg->umax_value == U64_MAX &&
2241 reg->s32_min_value == S32_MIN && reg->s32_max_value == S32_MAX &&
2242 reg->u32_min_value == 0 && reg->u32_max_value == U32_MAX;
2245 static bool register_is_bounded(struct bpf_reg_state *reg)
2247 return reg->type == SCALAR_VALUE && !__is_scalar_unbounded(reg);
2250 static bool __is_pointer_value(bool allow_ptr_leaks,
2251 const struct bpf_reg_state *reg)
2253 if (allow_ptr_leaks)
2256 return reg->type != SCALAR_VALUE;
2259 static void save_register_state(struct bpf_func_state *state,
2260 int spi, struct bpf_reg_state *reg)
2264 state->stack[spi].spilled_ptr = *reg;
2265 state->stack[spi].spilled_ptr.live |= REG_LIVE_WRITTEN;
2267 for (i = 0; i < BPF_REG_SIZE; i++)
2268 state->stack[spi].slot_type[i] = STACK_SPILL;
2271 /* check_stack_read/write functions track spill/fill of registers,
2272 * stack boundary and alignment are checked in check_mem_access()
2274 static int check_stack_write(struct bpf_verifier_env *env,
2275 struct bpf_func_state *state, /* func where register points to */
2276 int off, int size, int value_regno, int insn_idx)
2278 struct bpf_func_state *cur; /* state of the current function */
2279 int i, slot = -off - 1, spi = slot / BPF_REG_SIZE, err;
2280 u32 dst_reg = env->prog->insnsi[insn_idx].dst_reg;
2281 struct bpf_reg_state *reg = NULL;
2283 err = realloc_func_state(state, round_up(slot + 1, BPF_REG_SIZE),
2284 state->acquired_refs, true);
2287 /* caller checked that off % size == 0 and -MAX_BPF_STACK <= off < 0,
2288 * so it's aligned access and [off, off + size) are within stack limits
2290 if (!env->allow_ptr_leaks &&
2291 state->stack[spi].slot_type[0] == STACK_SPILL &&
2292 size != BPF_REG_SIZE) {
2293 verbose(env, "attempt to corrupt spilled pointer on stack\n");
2297 cur = env->cur_state->frame[env->cur_state->curframe];
2298 if (value_regno >= 0)
2299 reg = &cur->regs[value_regno];
2301 if (reg && size == BPF_REG_SIZE && register_is_bounded(reg) &&
2302 !register_is_null(reg) && env->bpf_capable) {
2303 if (dst_reg != BPF_REG_FP) {
2304 /* The backtracking logic can only recognize explicit
2305 * stack slot address like [fp - 8]. Other spill of
2306 * scalar via different register has to be conervative.
2307 * Backtrack from here and mark all registers as precise
2308 * that contributed into 'reg' being a constant.
2310 err = mark_chain_precision(env, value_regno);
2314 save_register_state(state, spi, reg);
2315 } else if (reg && is_spillable_regtype(reg->type)) {
2316 /* register containing pointer is being spilled into stack */
2317 if (size != BPF_REG_SIZE) {
2318 verbose_linfo(env, insn_idx, "; ");
2319 verbose(env, "invalid size of register spill\n");
2323 if (state != cur && reg->type == PTR_TO_STACK) {
2324 verbose(env, "cannot spill pointers to stack into stack frame of the caller\n");
2328 if (!env->bypass_spec_v4) {
2329 bool sanitize = false;
2331 if (state->stack[spi].slot_type[0] == STACK_SPILL &&
2332 register_is_const(&state->stack[spi].spilled_ptr))
2334 for (i = 0; i < BPF_REG_SIZE; i++)
2335 if (state->stack[spi].slot_type[i] == STACK_MISC) {
2340 int *poff = &env->insn_aux_data[insn_idx].sanitize_stack_off;
2341 int soff = (-spi - 1) * BPF_REG_SIZE;
2343 /* detected reuse of integer stack slot with a pointer
2344 * which means either llvm is reusing stack slot or
2345 * an attacker is trying to exploit CVE-2018-3639
2346 * (speculative store bypass)
2347 * Have to sanitize that slot with preemptive
2350 if (*poff && *poff != soff) {
2351 /* disallow programs where single insn stores
2352 * into two different stack slots, since verifier
2353 * cannot sanitize them
2356 "insn %d cannot access two stack slots fp%d and fp%d",
2357 insn_idx, *poff, soff);
2363 save_register_state(state, spi, reg);
2365 u8 type = STACK_MISC;
2367 /* regular write of data into stack destroys any spilled ptr */
2368 state->stack[spi].spilled_ptr.type = NOT_INIT;
2369 /* Mark slots as STACK_MISC if they belonged to spilled ptr. */
2370 if (state->stack[spi].slot_type[0] == STACK_SPILL)
2371 for (i = 0; i < BPF_REG_SIZE; i++)
2372 state->stack[spi].slot_type[i] = STACK_MISC;
2374 /* only mark the slot as written if all 8 bytes were written
2375 * otherwise read propagation may incorrectly stop too soon
2376 * when stack slots are partially written.
2377 * This heuristic means that read propagation will be
2378 * conservative, since it will add reg_live_read marks
2379 * to stack slots all the way to first state when programs
2380 * writes+reads less than 8 bytes
2382 if (size == BPF_REG_SIZE)
2383 state->stack[spi].spilled_ptr.live |= REG_LIVE_WRITTEN;
2385 /* when we zero initialize stack slots mark them as such */
2386 if (reg && register_is_null(reg)) {
2387 /* backtracking doesn't work for STACK_ZERO yet. */
2388 err = mark_chain_precision(env, value_regno);
2394 /* Mark slots affected by this stack write. */
2395 for (i = 0; i < size; i++)
2396 state->stack[spi].slot_type[(slot - i) % BPF_REG_SIZE] =
2402 static int check_stack_read(struct bpf_verifier_env *env,
2403 struct bpf_func_state *reg_state /* func where register points to */,
2404 int off, int size, int value_regno)
2406 struct bpf_verifier_state *vstate = env->cur_state;
2407 struct bpf_func_state *state = vstate->frame[vstate->curframe];
2408 int i, slot = -off - 1, spi = slot / BPF_REG_SIZE;
2409 struct bpf_reg_state *reg;
2412 if (reg_state->allocated_stack <= slot) {
2413 verbose(env, "invalid read from stack off %d+0 size %d\n",
2417 stype = reg_state->stack[spi].slot_type;
2418 reg = ®_state->stack[spi].spilled_ptr;
2420 if (stype[0] == STACK_SPILL) {
2421 if (size != BPF_REG_SIZE) {
2422 if (reg->type != SCALAR_VALUE) {
2423 verbose_linfo(env, env->insn_idx, "; ");
2424 verbose(env, "invalid size of register fill\n");
2427 if (value_regno >= 0) {
2428 mark_reg_unknown(env, state->regs, value_regno);
2429 state->regs[value_regno].live |= REG_LIVE_WRITTEN;
2431 mark_reg_read(env, reg, reg->parent, REG_LIVE_READ64);
2434 for (i = 1; i < BPF_REG_SIZE; i++) {
2435 if (stype[(slot - i) % BPF_REG_SIZE] != STACK_SPILL) {
2436 verbose(env, "corrupted spill memory\n");
2441 if (value_regno >= 0) {
2442 /* restore register state from stack */
2443 state->regs[value_regno] = *reg;
2444 /* mark reg as written since spilled pointer state likely
2445 * has its liveness marks cleared by is_state_visited()
2446 * which resets stack/reg liveness for state transitions
2448 state->regs[value_regno].live |= REG_LIVE_WRITTEN;
2449 } else if (__is_pointer_value(env->allow_ptr_leaks, reg)) {
2450 /* If value_regno==-1, the caller is asking us whether
2451 * it is acceptable to use this value as a SCALAR_VALUE
2453 * We must not allow unprivileged callers to do that
2454 * with spilled pointers.
2456 verbose(env, "leaking pointer from stack off %d\n",
2460 mark_reg_read(env, reg, reg->parent, REG_LIVE_READ64);
2464 for (i = 0; i < size; i++) {
2465 if (stype[(slot - i) % BPF_REG_SIZE] == STACK_MISC)
2467 if (stype[(slot - i) % BPF_REG_SIZE] == STACK_ZERO) {
2471 verbose(env, "invalid read from stack off %d+%d size %d\n",
2475 mark_reg_read(env, reg, reg->parent, REG_LIVE_READ64);
2476 if (value_regno >= 0) {
2477 if (zeros == size) {
2478 /* any size read into register is zero extended,
2479 * so the whole register == const_zero
2481 __mark_reg_const_zero(&state->regs[value_regno]);
2482 /* backtracking doesn't support STACK_ZERO yet,
2483 * so mark it precise here, so that later
2484 * backtracking can stop here.
2485 * Backtracking may not need this if this register
2486 * doesn't participate in pointer adjustment.
2487 * Forward propagation of precise flag is not
2488 * necessary either. This mark is only to stop
2489 * backtracking. Any register that contributed
2490 * to const 0 was marked precise before spill.
2492 state->regs[value_regno].precise = true;
2494 /* have read misc data from the stack */
2495 mark_reg_unknown(env, state->regs, value_regno);
2497 state->regs[value_regno].live |= REG_LIVE_WRITTEN;
2503 static int check_stack_access(struct bpf_verifier_env *env,
2504 const struct bpf_reg_state *reg,
2507 /* Stack accesses must be at a fixed offset, so that we
2508 * can determine what type of data were returned. See
2509 * check_stack_read().
2511 if (!tnum_is_const(reg->var_off)) {
2514 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
2515 verbose(env, "variable stack access var_off=%s off=%d size=%d\n",
2520 if (off >= 0 || off < -MAX_BPF_STACK) {
2521 verbose(env, "invalid stack off=%d size=%d\n", off, size);
2528 static int check_map_access_type(struct bpf_verifier_env *env, u32 regno,
2529 int off, int size, enum bpf_access_type type)
2531 struct bpf_reg_state *regs = cur_regs(env);
2532 struct bpf_map *map = regs[regno].map_ptr;
2533 u32 cap = bpf_map_flags_to_cap(map);
2535 if (type == BPF_WRITE && !(cap & BPF_MAP_CAN_WRITE)) {
2536 verbose(env, "write into map forbidden, value_size=%d off=%d size=%d\n",
2537 map->value_size, off, size);
2541 if (type == BPF_READ && !(cap & BPF_MAP_CAN_READ)) {
2542 verbose(env, "read from map forbidden, value_size=%d off=%d size=%d\n",
2543 map->value_size, off, size);
2550 /* check read/write into memory region (e.g., map value, ringbuf sample, etc) */
2551 static int __check_mem_access(struct bpf_verifier_env *env, int regno,
2552 int off, int size, u32 mem_size,
2553 bool zero_size_allowed)
2555 bool size_ok = size > 0 || (size == 0 && zero_size_allowed);
2556 struct bpf_reg_state *reg;
2558 if (off >= 0 && size_ok && (u64)off + size <= mem_size)
2561 reg = &cur_regs(env)[regno];
2562 switch (reg->type) {
2563 case PTR_TO_MAP_VALUE:
2564 verbose(env, "invalid access to map value, value_size=%d off=%d size=%d\n",
2565 mem_size, off, size);
2568 case PTR_TO_PACKET_META:
2569 case PTR_TO_PACKET_END:
2570 verbose(env, "invalid access to packet, off=%d size=%d, R%d(id=%d,off=%d,r=%d)\n",
2571 off, size, regno, reg->id, off, mem_size);
2575 verbose(env, "invalid access to memory, mem_size=%u off=%d size=%d\n",
2576 mem_size, off, size);
2582 /* check read/write into a memory region with possible variable offset */
2583 static int check_mem_region_access(struct bpf_verifier_env *env, u32 regno,
2584 int off, int size, u32 mem_size,
2585 bool zero_size_allowed)
2587 struct bpf_verifier_state *vstate = env->cur_state;
2588 struct bpf_func_state *state = vstate->frame[vstate->curframe];
2589 struct bpf_reg_state *reg = &state->regs[regno];
2592 /* We may have adjusted the register pointing to memory region, so we
2593 * need to try adding each of min_value and max_value to off
2594 * to make sure our theoretical access will be safe.
2596 if (env->log.level & BPF_LOG_LEVEL)
2597 print_verifier_state(env, state);
2599 /* The minimum value is only important with signed
2600 * comparisons where we can't assume the floor of a
2601 * value is 0. If we are using signed variables for our
2602 * index'es we need to make sure that whatever we use
2603 * will have a set floor within our range.
2605 if (reg->smin_value < 0 &&
2606 (reg->smin_value == S64_MIN ||
2607 (off + reg->smin_value != (s64)(s32)(off + reg->smin_value)) ||
2608 reg->smin_value + off < 0)) {
2609 verbose(env, "R%d min value is negative, either use unsigned index or do a if (index >=0) check.\n",
2613 err = __check_mem_access(env, regno, reg->smin_value + off, size,
2614 mem_size, zero_size_allowed);
2616 verbose(env, "R%d min value is outside of the allowed memory range\n",
2621 /* If we haven't set a max value then we need to bail since we can't be
2622 * sure we won't do bad things.
2623 * If reg->umax_value + off could overflow, treat that as unbounded too.
2625 if (reg->umax_value >= BPF_MAX_VAR_OFF) {
2626 verbose(env, "R%d unbounded memory access, make sure to bounds check any such access\n",
2630 err = __check_mem_access(env, regno, reg->umax_value + off, size,
2631 mem_size, zero_size_allowed);
2633 verbose(env, "R%d max value is outside of the allowed memory range\n",
2641 /* check read/write into a map element with possible variable offset */
2642 static int check_map_access(struct bpf_verifier_env *env, u32 regno,
2643 int off, int size, bool zero_size_allowed)
2645 struct bpf_verifier_state *vstate = env->cur_state;
2646 struct bpf_func_state *state = vstate->frame[vstate->curframe];
2647 struct bpf_reg_state *reg = &state->regs[regno];
2648 struct bpf_map *map = reg->map_ptr;
2651 err = check_mem_region_access(env, regno, off, size, map->value_size,
2656 if (map_value_has_spin_lock(map)) {
2657 u32 lock = map->spin_lock_off;
2659 /* if any part of struct bpf_spin_lock can be touched by
2660 * load/store reject this program.
2661 * To check that [x1, x2) overlaps with [y1, y2)
2662 * it is sufficient to check x1 < y2 && y1 < x2.
2664 if (reg->smin_value + off < lock + sizeof(struct bpf_spin_lock) &&
2665 lock < reg->umax_value + off + size) {
2666 verbose(env, "bpf_spin_lock cannot be accessed directly by load/store\n");
2673 #define MAX_PACKET_OFF 0xffff
2675 static enum bpf_prog_type resolve_prog_type(struct bpf_prog *prog)
2677 return prog->aux->dst_prog ? prog->aux->dst_prog->type : prog->type;
2680 static bool may_access_direct_pkt_data(struct bpf_verifier_env *env,
2681 const struct bpf_call_arg_meta *meta,
2682 enum bpf_access_type t)
2684 enum bpf_prog_type prog_type = resolve_prog_type(env->prog);
2686 switch (prog_type) {
2687 /* Program types only with direct read access go here! */
2688 case BPF_PROG_TYPE_LWT_IN:
2689 case BPF_PROG_TYPE_LWT_OUT:
2690 case BPF_PROG_TYPE_LWT_SEG6LOCAL:
2691 case BPF_PROG_TYPE_SK_REUSEPORT:
2692 case BPF_PROG_TYPE_FLOW_DISSECTOR:
2693 case BPF_PROG_TYPE_CGROUP_SKB:
2698 /* Program types with direct read + write access go here! */
2699 case BPF_PROG_TYPE_SCHED_CLS:
2700 case BPF_PROG_TYPE_SCHED_ACT:
2701 case BPF_PROG_TYPE_XDP:
2702 case BPF_PROG_TYPE_LWT_XMIT:
2703 case BPF_PROG_TYPE_SK_SKB:
2704 case BPF_PROG_TYPE_SK_MSG:
2706 return meta->pkt_access;
2708 env->seen_direct_write = true;
2711 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2713 env->seen_direct_write = true;
2722 static int check_packet_access(struct bpf_verifier_env *env, u32 regno, int off,
2723 int size, bool zero_size_allowed)
2725 struct bpf_reg_state *regs = cur_regs(env);
2726 struct bpf_reg_state *reg = ®s[regno];
2729 /* We may have added a variable offset to the packet pointer; but any
2730 * reg->range we have comes after that. We are only checking the fixed
2734 /* We don't allow negative numbers, because we aren't tracking enough
2735 * detail to prove they're safe.
2737 if (reg->smin_value < 0) {
2738 verbose(env, "R%d min value is negative, either use unsigned index or do a if (index >=0) check.\n",
2742 err = __check_mem_access(env, regno, off, size, reg->range,
2745 verbose(env, "R%d offset is outside of the packet\n", regno);
2749 /* __check_mem_access has made sure "off + size - 1" is within u16.
2750 * reg->umax_value can't be bigger than MAX_PACKET_OFF which is 0xffff,
2751 * otherwise find_good_pkt_pointers would have refused to set range info
2752 * that __check_mem_access would have rejected this pkt access.
2753 * Therefore, "off + reg->umax_value + size - 1" won't overflow u32.
2755 env->prog->aux->max_pkt_offset =
2756 max_t(u32, env->prog->aux->max_pkt_offset,
2757 off + reg->umax_value + size - 1);
2762 /* check access to 'struct bpf_context' fields. Supports fixed offsets only */
2763 static int check_ctx_access(struct bpf_verifier_env *env, int insn_idx, int off, int size,
2764 enum bpf_access_type t, enum bpf_reg_type *reg_type,
2767 struct bpf_insn_access_aux info = {
2768 .reg_type = *reg_type,
2772 if (env->ops->is_valid_access &&
2773 env->ops->is_valid_access(off, size, t, env->prog, &info)) {
2774 /* A non zero info.ctx_field_size indicates that this field is a
2775 * candidate for later verifier transformation to load the whole
2776 * field and then apply a mask when accessed with a narrower
2777 * access than actual ctx access size. A zero info.ctx_field_size
2778 * will only allow for whole field access and rejects any other
2779 * type of narrower access.
2781 *reg_type = info.reg_type;
2783 if (*reg_type == PTR_TO_BTF_ID || *reg_type == PTR_TO_BTF_ID_OR_NULL)
2784 *btf_id = info.btf_id;
2786 env->insn_aux_data[insn_idx].ctx_field_size = info.ctx_field_size;
2787 /* remember the offset of last byte accessed in ctx */
2788 if (env->prog->aux->max_ctx_offset < off + size)
2789 env->prog->aux->max_ctx_offset = off + size;
2793 verbose(env, "invalid bpf_context access off=%d size=%d\n", off, size);
2797 static int check_flow_keys_access(struct bpf_verifier_env *env, int off,
2800 if (size < 0 || off < 0 ||
2801 (u64)off + size > sizeof(struct bpf_flow_keys)) {
2802 verbose(env, "invalid access to flow keys off=%d size=%d\n",
2809 static int check_sock_access(struct bpf_verifier_env *env, int insn_idx,
2810 u32 regno, int off, int size,
2811 enum bpf_access_type t)
2813 struct bpf_reg_state *regs = cur_regs(env);
2814 struct bpf_reg_state *reg = ®s[regno];
2815 struct bpf_insn_access_aux info = {};
2818 if (reg->smin_value < 0) {
2819 verbose(env, "R%d min value is negative, either use unsigned index or do a if (index >=0) check.\n",
2824 switch (reg->type) {
2825 case PTR_TO_SOCK_COMMON:
2826 valid = bpf_sock_common_is_valid_access(off, size, t, &info);
2829 valid = bpf_sock_is_valid_access(off, size, t, &info);
2831 case PTR_TO_TCP_SOCK:
2832 valid = bpf_tcp_sock_is_valid_access(off, size, t, &info);
2834 case PTR_TO_XDP_SOCK:
2835 valid = bpf_xdp_sock_is_valid_access(off, size, t, &info);
2843 env->insn_aux_data[insn_idx].ctx_field_size =
2844 info.ctx_field_size;
2848 verbose(env, "R%d invalid %s access off=%d size=%d\n",
2849 regno, reg_type_str[reg->type], off, size);
2854 static struct bpf_reg_state *reg_state(struct bpf_verifier_env *env, int regno)
2856 return cur_regs(env) + regno;
2859 static bool is_pointer_value(struct bpf_verifier_env *env, int regno)
2861 return __is_pointer_value(env->allow_ptr_leaks, reg_state(env, regno));
2864 static bool is_ctx_reg(struct bpf_verifier_env *env, int regno)
2866 const struct bpf_reg_state *reg = reg_state(env, regno);
2868 return reg->type == PTR_TO_CTX;
2871 static bool is_sk_reg(struct bpf_verifier_env *env, int regno)
2873 const struct bpf_reg_state *reg = reg_state(env, regno);
2875 return type_is_sk_pointer(reg->type);
2878 static bool is_pkt_reg(struct bpf_verifier_env *env, int regno)
2880 const struct bpf_reg_state *reg = reg_state(env, regno);
2882 return type_is_pkt_pointer(reg->type);
2885 static bool is_flow_key_reg(struct bpf_verifier_env *env, int regno)
2887 const struct bpf_reg_state *reg = reg_state(env, regno);
2889 /* Separate to is_ctx_reg() since we still want to allow BPF_ST here. */
2890 return reg->type == PTR_TO_FLOW_KEYS;
2893 static int check_pkt_ptr_alignment(struct bpf_verifier_env *env,
2894 const struct bpf_reg_state *reg,
2895 int off, int size, bool strict)
2897 struct tnum reg_off;
2900 /* Byte size accesses are always allowed. */
2901 if (!strict || size == 1)
2904 /* For platforms that do not have a Kconfig enabling
2905 * CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS the value of
2906 * NET_IP_ALIGN is universally set to '2'. And on platforms
2907 * that do set CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS, we get
2908 * to this code only in strict mode where we want to emulate
2909 * the NET_IP_ALIGN==2 checking. Therefore use an
2910 * unconditional IP align value of '2'.
2914 reg_off = tnum_add(reg->var_off, tnum_const(ip_align + reg->off + off));
2915 if (!tnum_is_aligned(reg_off, size)) {
2918 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
2920 "misaligned packet access off %d+%s+%d+%d size %d\n",
2921 ip_align, tn_buf, reg->off, off, size);
2928 static int check_generic_ptr_alignment(struct bpf_verifier_env *env,
2929 const struct bpf_reg_state *reg,
2930 const char *pointer_desc,
2931 int off, int size, bool strict)
2933 struct tnum reg_off;
2935 /* Byte size accesses are always allowed. */
2936 if (!strict || size == 1)
2939 reg_off = tnum_add(reg->var_off, tnum_const(reg->off + off));
2940 if (!tnum_is_aligned(reg_off, size)) {
2943 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
2944 verbose(env, "misaligned %saccess off %s+%d+%d size %d\n",
2945 pointer_desc, tn_buf, reg->off, off, size);
2952 static int check_ptr_alignment(struct bpf_verifier_env *env,
2953 const struct bpf_reg_state *reg, int off,
2954 int size, bool strict_alignment_once)
2956 bool strict = env->strict_alignment || strict_alignment_once;
2957 const char *pointer_desc = "";
2959 switch (reg->type) {
2961 case PTR_TO_PACKET_META:
2962 /* Special case, because of NET_IP_ALIGN. Given metadata sits
2963 * right in front, treat it the very same way.
2965 return check_pkt_ptr_alignment(env, reg, off, size, strict);
2966 case PTR_TO_FLOW_KEYS:
2967 pointer_desc = "flow keys ";
2969 case PTR_TO_MAP_VALUE:
2970 pointer_desc = "value ";
2973 pointer_desc = "context ";
2976 pointer_desc = "stack ";
2977 /* The stack spill tracking logic in check_stack_write()
2978 * and check_stack_read() relies on stack accesses being
2984 pointer_desc = "sock ";
2986 case PTR_TO_SOCK_COMMON:
2987 pointer_desc = "sock_common ";
2989 case PTR_TO_TCP_SOCK:
2990 pointer_desc = "tcp_sock ";
2992 case PTR_TO_XDP_SOCK:
2993 pointer_desc = "xdp_sock ";
2998 return check_generic_ptr_alignment(env, reg, pointer_desc, off, size,
3002 static int update_stack_depth(struct bpf_verifier_env *env,
3003 const struct bpf_func_state *func,
3006 u16 stack = env->subprog_info[func->subprogno].stack_depth;
3011 /* update known max for given subprogram */
3012 env->subprog_info[func->subprogno].stack_depth = -off;
3016 /* starting from main bpf function walk all instructions of the function
3017 * and recursively walk all callees that given function can call.
3018 * Ignore jump and exit insns.
3019 * Since recursion is prevented by check_cfg() this algorithm
3020 * only needs a local stack of MAX_CALL_FRAMES to remember callsites
3022 static int check_max_stack_depth(struct bpf_verifier_env *env)
3024 int depth = 0, frame = 0, idx = 0, i = 0, subprog_end;
3025 struct bpf_subprog_info *subprog = env->subprog_info;
3026 struct bpf_insn *insn = env->prog->insnsi;
3027 bool tail_call_reachable = false;
3028 int ret_insn[MAX_CALL_FRAMES];
3029 int ret_prog[MAX_CALL_FRAMES];
3033 /* protect against potential stack overflow that might happen when
3034 * bpf2bpf calls get combined with tailcalls. Limit the caller's stack
3035 * depth for such case down to 256 so that the worst case scenario
3036 * would result in 8k stack size (32 which is tailcall limit * 256 =
3039 * To get the idea what might happen, see an example:
3040 * func1 -> sub rsp, 128
3041 * subfunc1 -> sub rsp, 256
3042 * tailcall1 -> add rsp, 256
3043 * func2 -> sub rsp, 192 (total stack size = 128 + 192 = 320)
3044 * subfunc2 -> sub rsp, 64
3045 * subfunc22 -> sub rsp, 128
3046 * tailcall2 -> add rsp, 128
3047 * func3 -> sub rsp, 32 (total stack size 128 + 192 + 64 + 32 = 416)
3049 * tailcall will unwind the current stack frame but it will not get rid
3050 * of caller's stack as shown on the example above.
3052 if (idx && subprog[idx].has_tail_call && depth >= 256) {
3054 "tail_calls are not allowed when call stack of previous frames is %d bytes. Too large\n",
3058 /* round up to 32-bytes, since this is granularity
3059 * of interpreter stack size
3061 depth += round_up(max_t(u32, subprog[idx].stack_depth, 1), 32);
3062 if (depth > MAX_BPF_STACK) {
3063 verbose(env, "combined stack size of %d calls is %d. Too large\n",
3068 subprog_end = subprog[idx + 1].start;
3069 for (; i < subprog_end; i++) {
3070 if (insn[i].code != (BPF_JMP | BPF_CALL))
3072 if (insn[i].src_reg != BPF_PSEUDO_CALL)
3074 /* remember insn and function to return to */
3075 ret_insn[frame] = i + 1;
3076 ret_prog[frame] = idx;
3078 /* find the callee */
3079 i = i + insn[i].imm + 1;
3080 idx = find_subprog(env, i);
3082 WARN_ONCE(1, "verifier bug. No program starts at insn %d\n",
3087 if (subprog[idx].has_tail_call)
3088 tail_call_reachable = true;
3091 if (frame >= MAX_CALL_FRAMES) {
3092 verbose(env, "the call stack of %d frames is too deep !\n",
3098 /* if tail call got detected across bpf2bpf calls then mark each of the
3099 * currently present subprog frames as tail call reachable subprogs;
3100 * this info will be utilized by JIT so that we will be preserving the
3101 * tail call counter throughout bpf2bpf calls combined with tailcalls
3103 if (tail_call_reachable)
3104 for (j = 0; j < frame; j++)
3105 subprog[ret_prog[j]].tail_call_reachable = true;
3107 /* end of for() loop means the last insn of the 'subprog'
3108 * was reached. Doesn't matter whether it was JA or EXIT
3112 depth -= round_up(max_t(u32, subprog[idx].stack_depth, 1), 32);
3114 i = ret_insn[frame];
3115 idx = ret_prog[frame];
3119 #ifndef CONFIG_BPF_JIT_ALWAYS_ON
3120 static int get_callee_stack_depth(struct bpf_verifier_env *env,
3121 const struct bpf_insn *insn, int idx)
3123 int start = idx + insn->imm + 1, subprog;
3125 subprog = find_subprog(env, start);
3127 WARN_ONCE(1, "verifier bug. No program starts at insn %d\n",
3131 return env->subprog_info[subprog].stack_depth;
3135 int check_ctx_reg(struct bpf_verifier_env *env,
3136 const struct bpf_reg_state *reg, int regno)
3138 /* Access to ctx or passing it to a helper is only allowed in
3139 * its original, unmodified form.
3143 verbose(env, "dereference of modified ctx ptr R%d off=%d disallowed\n",
3148 if (!tnum_is_const(reg->var_off) || reg->var_off.value) {
3151 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
3152 verbose(env, "variable ctx access var_off=%s disallowed\n", tn_buf);
3159 static int __check_buffer_access(struct bpf_verifier_env *env,
3160 const char *buf_info,
3161 const struct bpf_reg_state *reg,
3162 int regno, int off, int size)
3166 "R%d invalid %s buffer access: off=%d, size=%d\n",
3167 regno, buf_info, off, size);
3170 if (!tnum_is_const(reg->var_off) || reg->var_off.value) {
3173 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
3175 "R%d invalid variable buffer offset: off=%d, var_off=%s\n",
3176 regno, off, tn_buf);
3183 static int check_tp_buffer_access(struct bpf_verifier_env *env,
3184 const struct bpf_reg_state *reg,
3185 int regno, int off, int size)
3189 err = __check_buffer_access(env, "tracepoint", reg, regno, off, size);
3193 if (off + size > env->prog->aux->max_tp_access)
3194 env->prog->aux->max_tp_access = off + size;
3199 static int check_buffer_access(struct bpf_verifier_env *env,
3200 const struct bpf_reg_state *reg,
3201 int regno, int off, int size,
3202 bool zero_size_allowed,
3203 const char *buf_info,
3208 err = __check_buffer_access(env, buf_info, reg, regno, off, size);
3212 if (off + size > *max_access)
3213 *max_access = off + size;
3218 /* BPF architecture zero extends alu32 ops into 64-bit registesr */
3219 static void zext_32_to_64(struct bpf_reg_state *reg)
3221 reg->var_off = tnum_subreg(reg->var_off);
3222 __reg_assign_32_into_64(reg);
3225 /* truncate register to smaller size (in bytes)
3226 * must be called with size < BPF_REG_SIZE
3228 static void coerce_reg_to_size(struct bpf_reg_state *reg, int size)
3232 /* clear high bits in bit representation */
3233 reg->var_off = tnum_cast(reg->var_off, size);
3235 /* fix arithmetic bounds */
3236 mask = ((u64)1 << (size * 8)) - 1;
3237 if ((reg->umin_value & ~mask) == (reg->umax_value & ~mask)) {
3238 reg->umin_value &= mask;
3239 reg->umax_value &= mask;
3241 reg->umin_value = 0;
3242 reg->umax_value = mask;
3244 reg->smin_value = reg->umin_value;
3245 reg->smax_value = reg->umax_value;
3247 /* If size is smaller than 32bit register the 32bit register
3248 * values are also truncated so we push 64-bit bounds into
3249 * 32-bit bounds. Above were truncated < 32-bits already.
3253 __reg_combine_64_into_32(reg);
3256 static bool bpf_map_is_rdonly(const struct bpf_map *map)
3258 return (map->map_flags & BPF_F_RDONLY_PROG) && map->frozen;
3261 static int bpf_map_direct_read(struct bpf_map *map, int off, int size, u64 *val)
3267 err = map->ops->map_direct_value_addr(map, &addr, off);
3270 ptr = (void *)(long)addr + off;
3274 *val = (u64)*(u8 *)ptr;
3277 *val = (u64)*(u16 *)ptr;
3280 *val = (u64)*(u32 *)ptr;
3291 static int check_ptr_to_btf_access(struct bpf_verifier_env *env,
3292 struct bpf_reg_state *regs,
3293 int regno, int off, int size,
3294 enum bpf_access_type atype,
3297 struct bpf_reg_state *reg = regs + regno;
3298 const struct btf_type *t = btf_type_by_id(btf_vmlinux, reg->btf_id);
3299 const char *tname = btf_name_by_offset(btf_vmlinux, t->name_off);
3305 "R%d is ptr_%s invalid negative access: off=%d\n",
3309 if (!tnum_is_const(reg->var_off) || reg->var_off.value) {
3312 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
3314 "R%d is ptr_%s invalid variable offset: off=%d, var_off=%s\n",
3315 regno, tname, off, tn_buf);
3319 if (env->ops->btf_struct_access) {
3320 ret = env->ops->btf_struct_access(&env->log, t, off, size,
3323 if (atype != BPF_READ) {
3324 verbose(env, "only read is supported\n");
3328 ret = btf_struct_access(&env->log, t, off, size, atype,
3335 if (atype == BPF_READ && value_regno >= 0)
3336 mark_btf_ld_reg(env, regs, value_regno, ret, btf_id);
3341 static int check_ptr_to_map_access(struct bpf_verifier_env *env,
3342 struct bpf_reg_state *regs,
3343 int regno, int off, int size,
3344 enum bpf_access_type atype,
3347 struct bpf_reg_state *reg = regs + regno;
3348 struct bpf_map *map = reg->map_ptr;
3349 const struct btf_type *t;
3355 verbose(env, "map_ptr access not supported without CONFIG_DEBUG_INFO_BTF\n");
3359 if (!map->ops->map_btf_id || !*map->ops->map_btf_id) {
3360 verbose(env, "map_ptr access not supported for map type %d\n",
3365 t = btf_type_by_id(btf_vmlinux, *map->ops->map_btf_id);
3366 tname = btf_name_by_offset(btf_vmlinux, t->name_off);
3368 if (!env->allow_ptr_to_map_access) {
3370 "%s access is allowed only to CAP_PERFMON and CAP_SYS_ADMIN\n",
3376 verbose(env, "R%d is %s invalid negative access: off=%d\n",
3381 if (atype != BPF_READ) {
3382 verbose(env, "only read from %s is supported\n", tname);
3386 ret = btf_struct_access(&env->log, t, off, size, atype, &btf_id);
3390 if (value_regno >= 0)
3391 mark_btf_ld_reg(env, regs, value_regno, ret, btf_id);
3397 /* check whether memory at (regno + off) is accessible for t = (read | write)
3398 * if t==write, value_regno is a register which value is stored into memory
3399 * if t==read, value_regno is a register which will receive the value from memory
3400 * if t==write && value_regno==-1, some unknown value is stored into memory
3401 * if t==read && value_regno==-1, don't care what we read from memory
3403 static int check_mem_access(struct bpf_verifier_env *env, int insn_idx, u32 regno,
3404 int off, int bpf_size, enum bpf_access_type t,
3405 int value_regno, bool strict_alignment_once)
3407 struct bpf_reg_state *regs = cur_regs(env);
3408 struct bpf_reg_state *reg = regs + regno;
3409 struct bpf_func_state *state;
3412 size = bpf_size_to_bytes(bpf_size);
3416 /* alignment checks will add in reg->off themselves */
3417 err = check_ptr_alignment(env, reg, off, size, strict_alignment_once);
3421 /* for access checks, reg->off is just part of off */
3424 if (reg->type == PTR_TO_MAP_VALUE) {
3425 if (t == BPF_WRITE && value_regno >= 0 &&
3426 is_pointer_value(env, value_regno)) {
3427 verbose(env, "R%d leaks addr into map\n", value_regno);
3430 err = check_map_access_type(env, regno, off, size, t);
3433 err = check_map_access(env, regno, off, size, false);
3434 if (!err && t == BPF_READ && value_regno >= 0) {
3435 struct bpf_map *map = reg->map_ptr;
3437 /* if map is read-only, track its contents as scalars */
3438 if (tnum_is_const(reg->var_off) &&
3439 bpf_map_is_rdonly(map) &&
3440 map->ops->map_direct_value_addr) {
3441 int map_off = off + reg->var_off.value;
3444 err = bpf_map_direct_read(map, map_off, size,
3449 regs[value_regno].type = SCALAR_VALUE;
3450 __mark_reg_known(®s[value_regno], val);
3452 mark_reg_unknown(env, regs, value_regno);
3455 } else if (reg->type == PTR_TO_MEM) {
3456 if (t == BPF_WRITE && value_regno >= 0 &&
3457 is_pointer_value(env, value_regno)) {
3458 verbose(env, "R%d leaks addr into mem\n", value_regno);
3461 err = check_mem_region_access(env, regno, off, size,
3462 reg->mem_size, false);
3463 if (!err && t == BPF_READ && value_regno >= 0)
3464 mark_reg_unknown(env, regs, value_regno);
3465 } else if (reg->type == PTR_TO_CTX) {
3466 enum bpf_reg_type reg_type = SCALAR_VALUE;
3469 if (t == BPF_WRITE && value_regno >= 0 &&
3470 is_pointer_value(env, value_regno)) {
3471 verbose(env, "R%d leaks addr into ctx\n", value_regno);
3475 err = check_ctx_reg(env, reg, regno);
3479 err = check_ctx_access(env, insn_idx, off, size, t, ®_type, &btf_id);
3481 verbose_linfo(env, insn_idx, "; ");
3482 if (!err && t == BPF_READ && value_regno >= 0) {
3483 /* ctx access returns either a scalar, or a
3484 * PTR_TO_PACKET[_META,_END]. In the latter
3485 * case, we know the offset is zero.
3487 if (reg_type == SCALAR_VALUE) {
3488 mark_reg_unknown(env, regs, value_regno);
3490 mark_reg_known_zero(env, regs,
3492 if (reg_type_may_be_null(reg_type))
3493 regs[value_regno].id = ++env->id_gen;
3494 /* A load of ctx field could have different
3495 * actual load size with the one encoded in the
3496 * insn. When the dst is PTR, it is for sure not
3499 regs[value_regno].subreg_def = DEF_NOT_SUBREG;
3500 if (reg_type == PTR_TO_BTF_ID ||
3501 reg_type == PTR_TO_BTF_ID_OR_NULL)
3502 regs[value_regno].btf_id = btf_id;
3504 regs[value_regno].type = reg_type;
3507 } else if (reg->type == PTR_TO_STACK) {
3508 off += reg->var_off.value;
3509 err = check_stack_access(env, reg, off, size);
3513 state = func(env, reg);
3514 err = update_stack_depth(env, state, off);
3519 err = check_stack_write(env, state, off, size,
3520 value_regno, insn_idx);
3522 err = check_stack_read(env, state, off, size,
3524 } else if (reg_is_pkt_pointer(reg)) {
3525 if (t == BPF_WRITE && !may_access_direct_pkt_data(env, NULL, t)) {
3526 verbose(env, "cannot write into packet\n");
3529 if (t == BPF_WRITE && value_regno >= 0 &&
3530 is_pointer_value(env, value_regno)) {
3531 verbose(env, "R%d leaks addr into packet\n",
3535 err = check_packet_access(env, regno, off, size, false);
3536 if (!err && t == BPF_READ && value_regno >= 0)
3537 mark_reg_unknown(env, regs, value_regno);
3538 } else if (reg->type == PTR_TO_FLOW_KEYS) {
3539 if (t == BPF_WRITE && value_regno >= 0 &&
3540 is_pointer_value(env, value_regno)) {
3541 verbose(env, "R%d leaks addr into flow keys\n",
3546 err = check_flow_keys_access(env, off, size);
3547 if (!err && t == BPF_READ && value_regno >= 0)
3548 mark_reg_unknown(env, regs, value_regno);
3549 } else if (type_is_sk_pointer(reg->type)) {
3550 if (t == BPF_WRITE) {
3551 verbose(env, "R%d cannot write into %s\n",
3552 regno, reg_type_str[reg->type]);
3555 err = check_sock_access(env, insn_idx, regno, off, size, t);
3556 if (!err && value_regno >= 0)
3557 mark_reg_unknown(env, regs, value_regno);
3558 } else if (reg->type == PTR_TO_TP_BUFFER) {
3559 err = check_tp_buffer_access(env, reg, regno, off, size);
3560 if (!err && t == BPF_READ && value_regno >= 0)
3561 mark_reg_unknown(env, regs, value_regno);
3562 } else if (reg->type == PTR_TO_BTF_ID) {
3563 err = check_ptr_to_btf_access(env, regs, regno, off, size, t,
3565 } else if (reg->type == CONST_PTR_TO_MAP) {
3566 err = check_ptr_to_map_access(env, regs, regno, off, size, t,
3568 } else if (reg->type == PTR_TO_RDONLY_BUF) {
3569 if (t == BPF_WRITE) {
3570 verbose(env, "R%d cannot write into %s\n",
3571 regno, reg_type_str[reg->type]);
3574 err = check_buffer_access(env, reg, regno, off, size, false,
3576 &env->prog->aux->max_rdonly_access);
3577 if (!err && value_regno >= 0)
3578 mark_reg_unknown(env, regs, value_regno);
3579 } else if (reg->type == PTR_TO_RDWR_BUF) {
3580 err = check_buffer_access(env, reg, regno, off, size, false,
3582 &env->prog->aux->max_rdwr_access);
3583 if (!err && t == BPF_READ && value_regno >= 0)
3584 mark_reg_unknown(env, regs, value_regno);
3586 verbose(env, "R%d invalid mem access '%s'\n", regno,
3587 reg_type_str[reg->type]);
3591 if (!err && size < BPF_REG_SIZE && value_regno >= 0 && t == BPF_READ &&
3592 regs[value_regno].type == SCALAR_VALUE) {
3593 /* b/h/w load zero-extends, mark upper bits as known 0 */
3594 coerce_reg_to_size(®s[value_regno], size);
3599 static int check_xadd(struct bpf_verifier_env *env, int insn_idx, struct bpf_insn *insn)
3603 if ((BPF_SIZE(insn->code) != BPF_W && BPF_SIZE(insn->code) != BPF_DW) ||
3605 verbose(env, "BPF_XADD uses reserved fields\n");
3609 /* check src1 operand */
3610 err = check_reg_arg(env, insn->src_reg, SRC_OP);
3614 /* check src2 operand */
3615 err = check_reg_arg(env, insn->dst_reg, SRC_OP);
3619 if (is_pointer_value(env, insn->src_reg)) {
3620 verbose(env, "R%d leaks addr into mem\n", insn->src_reg);
3624 if (is_ctx_reg(env, insn->dst_reg) ||
3625 is_pkt_reg(env, insn->dst_reg) ||
3626 is_flow_key_reg(env, insn->dst_reg) ||
3627 is_sk_reg(env, insn->dst_reg)) {
3628 verbose(env, "BPF_XADD stores into R%d %s is not allowed\n",
3630 reg_type_str[reg_state(env, insn->dst_reg)->type]);
3634 /* check whether atomic_add can read the memory */
3635 err = check_mem_access(env, insn_idx, insn->dst_reg, insn->off,
3636 BPF_SIZE(insn->code), BPF_READ, -1, true);
3640 /* check whether atomic_add can write into the same memory */
3641 return check_mem_access(env, insn_idx, insn->dst_reg, insn->off,
3642 BPF_SIZE(insn->code), BPF_WRITE, -1, true);
3645 static int __check_stack_boundary(struct bpf_verifier_env *env, u32 regno,
3646 int off, int access_size,
3647 bool zero_size_allowed)
3649 struct bpf_reg_state *reg = reg_state(env, regno);
3651 if (off >= 0 || off < -MAX_BPF_STACK || off + access_size > 0 ||
3652 access_size < 0 || (access_size == 0 && !zero_size_allowed)) {
3653 if (tnum_is_const(reg->var_off)) {
3654 verbose(env, "invalid stack type R%d off=%d access_size=%d\n",
3655 regno, off, access_size);
3659 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
3660 verbose(env, "invalid stack type R%d var_off=%s access_size=%d\n",
3661 regno, tn_buf, access_size);
3668 /* when register 'regno' is passed into function that will read 'access_size'
3669 * bytes from that pointer, make sure that it's within stack boundary
3670 * and all elements of stack are initialized.
3671 * Unlike most pointer bounds-checking functions, this one doesn't take an
3672 * 'off' argument, so it has to add in reg->off itself.
3674 static int check_stack_boundary(struct bpf_verifier_env *env, int regno,
3675 int access_size, bool zero_size_allowed,
3676 struct bpf_call_arg_meta *meta)
3678 struct bpf_reg_state *reg = reg_state(env, regno);
3679 struct bpf_func_state *state = func(env, reg);
3680 int err, min_off, max_off, i, j, slot, spi;
3682 if (tnum_is_const(reg->var_off)) {
3683 min_off = max_off = reg->var_off.value + reg->off;
3684 err = __check_stack_boundary(env, regno, min_off, access_size,
3689 /* Variable offset is prohibited for unprivileged mode for
3690 * simplicity since it requires corresponding support in
3691 * Spectre masking for stack ALU.
3692 * See also retrieve_ptr_limit().
3694 if (!env->bypass_spec_v1) {
3697 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
3698 verbose(env, "R%d indirect variable offset stack access prohibited for !root, var_off=%s\n",
3702 /* Only initialized buffer on stack is allowed to be accessed
3703 * with variable offset. With uninitialized buffer it's hard to
3704 * guarantee that whole memory is marked as initialized on
3705 * helper return since specific bounds are unknown what may
3706 * cause uninitialized stack leaking.
3708 if (meta && meta->raw_mode)
3711 if (reg->smax_value >= BPF_MAX_VAR_OFF ||
3712 reg->smax_value <= -BPF_MAX_VAR_OFF) {
3713 verbose(env, "R%d unbounded indirect variable offset stack access\n",
3717 min_off = reg->smin_value + reg->off;
3718 max_off = reg->smax_value + reg->off;
3719 err = __check_stack_boundary(env, regno, min_off, access_size,
3722 verbose(env, "R%d min value is outside of stack bound\n",
3726 err = __check_stack_boundary(env, regno, max_off, access_size,
3729 verbose(env, "R%d max value is outside of stack bound\n",
3735 if (meta && meta->raw_mode) {
3736 meta->access_size = access_size;
3737 meta->regno = regno;
3741 for (i = min_off; i < max_off + access_size; i++) {
3745 spi = slot / BPF_REG_SIZE;
3746 if (state->allocated_stack <= slot)
3748 stype = &state->stack[spi].slot_type[slot % BPF_REG_SIZE];
3749 if (*stype == STACK_MISC)
3751 if (*stype == STACK_ZERO) {
3752 /* helper can write anything into the stack */
3753 *stype = STACK_MISC;
3757 if (state->stack[spi].slot_type[0] == STACK_SPILL &&
3758 state->stack[spi].spilled_ptr.type == PTR_TO_BTF_ID)
3761 if (state->stack[spi].slot_type[0] == STACK_SPILL &&
3762 state->stack[spi].spilled_ptr.type == SCALAR_VALUE) {
3763 __mark_reg_unknown(env, &state->stack[spi].spilled_ptr);
3764 for (j = 0; j < BPF_REG_SIZE; j++)
3765 state->stack[spi].slot_type[j] = STACK_MISC;
3770 if (tnum_is_const(reg->var_off)) {
3771 verbose(env, "invalid indirect read from stack off %d+%d size %d\n",
3772 min_off, i - min_off, access_size);
3776 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
3777 verbose(env, "invalid indirect read from stack var_off %s+%d size %d\n",
3778 tn_buf, i - min_off, access_size);
3782 /* reading any byte out of 8-byte 'spill_slot' will cause
3783 * the whole slot to be marked as 'read'
3785 mark_reg_read(env, &state->stack[spi].spilled_ptr,
3786 state->stack[spi].spilled_ptr.parent,
3789 return update_stack_depth(env, state, min_off);
3792 static int check_helper_mem_access(struct bpf_verifier_env *env, int regno,
3793 int access_size, bool zero_size_allowed,
3794 struct bpf_call_arg_meta *meta)
3796 struct bpf_reg_state *regs = cur_regs(env), *reg = ®s[regno];
3798 switch (reg->type) {
3800 case PTR_TO_PACKET_META:
3801 return check_packet_access(env, regno, reg->off, access_size,
3803 case PTR_TO_MAP_VALUE:
3804 if (check_map_access_type(env, regno, reg->off, access_size,
3805 meta && meta->raw_mode ? BPF_WRITE :
3808 return check_map_access(env, regno, reg->off, access_size,
3811 return check_mem_region_access(env, regno, reg->off,
3812 access_size, reg->mem_size,
3814 case PTR_TO_RDONLY_BUF:
3815 if (meta && meta->raw_mode)
3817 return check_buffer_access(env, reg, regno, reg->off,
3818 access_size, zero_size_allowed,
3820 &env->prog->aux->max_rdonly_access);
3821 case PTR_TO_RDWR_BUF:
3822 return check_buffer_access(env, reg, regno, reg->off,
3823 access_size, zero_size_allowed,
3825 &env->prog->aux->max_rdwr_access);
3827 return check_stack_boundary(env, regno, access_size,
3828 zero_size_allowed, meta);
3829 default: /* scalar_value or invalid ptr */
3830 /* Allow zero-byte read from NULL, regardless of pointer type */
3831 if (zero_size_allowed && access_size == 0 &&
3832 register_is_null(reg))
3835 verbose(env, "R%d type=%s expected=%s\n", regno,
3836 reg_type_str[reg->type],
3837 reg_type_str[PTR_TO_STACK]);
3842 /* Implementation details:
3843 * bpf_map_lookup returns PTR_TO_MAP_VALUE_OR_NULL
3844 * Two bpf_map_lookups (even with the same key) will have different reg->id.
3845 * For traditional PTR_TO_MAP_VALUE the verifier clears reg->id after
3846 * value_or_null->value transition, since the verifier only cares about
3847 * the range of access to valid map value pointer and doesn't care about actual
3848 * address of the map element.
3849 * For maps with 'struct bpf_spin_lock' inside map value the verifier keeps
3850 * reg->id > 0 after value_or_null->value transition. By doing so
3851 * two bpf_map_lookups will be considered two different pointers that
3852 * point to different bpf_spin_locks.
3853 * The verifier allows taking only one bpf_spin_lock at a time to avoid
3855 * Since only one bpf_spin_lock is allowed the checks are simpler than
3856 * reg_is_refcounted() logic. The verifier needs to remember only
3857 * one spin_lock instead of array of acquired_refs.
3858 * cur_state->active_spin_lock remembers which map value element got locked
3859 * and clears it after bpf_spin_unlock.
3861 static int process_spin_lock(struct bpf_verifier_env *env, int regno,
3864 struct bpf_reg_state *regs = cur_regs(env), *reg = ®s[regno];
3865 struct bpf_verifier_state *cur = env->cur_state;
3866 bool is_const = tnum_is_const(reg->var_off);
3867 struct bpf_map *map = reg->map_ptr;
3868 u64 val = reg->var_off.value;
3872 "R%d doesn't have constant offset. bpf_spin_lock has to be at the constant offset\n",
3878 "map '%s' has to have BTF in order to use bpf_spin_lock\n",
3882 if (!map_value_has_spin_lock(map)) {
3883 if (map->spin_lock_off == -E2BIG)
3885 "map '%s' has more than one 'struct bpf_spin_lock'\n",
3887 else if (map->spin_lock_off == -ENOENT)
3889 "map '%s' doesn't have 'struct bpf_spin_lock'\n",
3893 "map '%s' is not a struct type or bpf_spin_lock is mangled\n",
3897 if (map->spin_lock_off != val + reg->off) {
3898 verbose(env, "off %lld doesn't point to 'struct bpf_spin_lock'\n",
3903 if (cur->active_spin_lock) {
3905 "Locking two bpf_spin_locks are not allowed\n");
3908 cur->active_spin_lock = reg->id;
3910 if (!cur->active_spin_lock) {
3911 verbose(env, "bpf_spin_unlock without taking a lock\n");
3914 if (cur->active_spin_lock != reg->id) {
3915 verbose(env, "bpf_spin_unlock of different lock\n");
3918 cur->active_spin_lock = 0;
3923 static bool arg_type_is_mem_ptr(enum bpf_arg_type type)
3925 return type == ARG_PTR_TO_MEM ||
3926 type == ARG_PTR_TO_MEM_OR_NULL ||
3927 type == ARG_PTR_TO_UNINIT_MEM;
3930 static bool arg_type_is_mem_size(enum bpf_arg_type type)
3932 return type == ARG_CONST_SIZE ||
3933 type == ARG_CONST_SIZE_OR_ZERO;
3936 static bool arg_type_is_alloc_size(enum bpf_arg_type type)
3938 return type == ARG_CONST_ALLOC_SIZE_OR_ZERO;
3941 static bool arg_type_is_int_ptr(enum bpf_arg_type type)
3943 return type == ARG_PTR_TO_INT ||
3944 type == ARG_PTR_TO_LONG;
3947 static int int_ptr_type_to_size(enum bpf_arg_type type)
3949 if (type == ARG_PTR_TO_INT)
3951 else if (type == ARG_PTR_TO_LONG)
3957 static int resolve_map_arg_type(struct bpf_verifier_env *env,
3958 const struct bpf_call_arg_meta *meta,
3959 enum bpf_arg_type *arg_type)
3961 if (!meta->map_ptr) {
3962 /* kernel subsystem misconfigured verifier */
3963 verbose(env, "invalid map_ptr to access map->type\n");
3967 switch (meta->map_ptr->map_type) {
3968 case BPF_MAP_TYPE_SOCKMAP:
3969 case BPF_MAP_TYPE_SOCKHASH:
3970 if (*arg_type == ARG_PTR_TO_MAP_VALUE) {
3971 *arg_type = ARG_PTR_TO_BTF_ID_SOCK_COMMON;
3973 verbose(env, "invalid arg_type for sockmap/sockhash\n");
3984 struct bpf_reg_types {
3985 const enum bpf_reg_type types[10];
3989 static const struct bpf_reg_types map_key_value_types = {
3998 static const struct bpf_reg_types sock_types = {
4008 static const struct bpf_reg_types btf_id_sock_common_types = {
4016 .btf_id = &btf_sock_ids[BTF_SOCK_TYPE_SOCK_COMMON],
4020 static const struct bpf_reg_types mem_types = {
4032 static const struct bpf_reg_types int_ptr_types = {
4041 static const struct bpf_reg_types fullsock_types = { .types = { PTR_TO_SOCKET } };
4042 static const struct bpf_reg_types scalar_types = { .types = { SCALAR_VALUE } };
4043 static const struct bpf_reg_types context_types = { .types = { PTR_TO_CTX } };
4044 static const struct bpf_reg_types alloc_mem_types = { .types = { PTR_TO_MEM } };
4045 static const struct bpf_reg_types const_map_ptr_types = { .types = { CONST_PTR_TO_MAP } };
4046 static const struct bpf_reg_types btf_ptr_types = { .types = { PTR_TO_BTF_ID } };
4047 static const struct bpf_reg_types spin_lock_types = { .types = { PTR_TO_MAP_VALUE } };
4048 static const struct bpf_reg_types percpu_btf_ptr_types = { .types = { PTR_TO_PERCPU_BTF_ID } };
4050 static const struct bpf_reg_types *compatible_reg_types[__BPF_ARG_TYPE_MAX] = {
4051 [ARG_PTR_TO_MAP_KEY] = &map_key_value_types,
4052 [ARG_PTR_TO_MAP_VALUE] = &map_key_value_types,
4053 [ARG_PTR_TO_UNINIT_MAP_VALUE] = &map_key_value_types,
4054 [ARG_PTR_TO_MAP_VALUE_OR_NULL] = &map_key_value_types,
4055 [ARG_CONST_SIZE] = &scalar_types,
4056 [ARG_CONST_SIZE_OR_ZERO] = &scalar_types,
4057 [ARG_CONST_ALLOC_SIZE_OR_ZERO] = &scalar_types,
4058 [ARG_CONST_MAP_PTR] = &const_map_ptr_types,
4059 [ARG_PTR_TO_CTX] = &context_types,
4060 [ARG_PTR_TO_CTX_OR_NULL] = &context_types,
4061 [ARG_PTR_TO_SOCK_COMMON] = &sock_types,
4063 [ARG_PTR_TO_BTF_ID_SOCK_COMMON] = &btf_id_sock_common_types,
4065 [ARG_PTR_TO_SOCKET] = &fullsock_types,
4066 [ARG_PTR_TO_SOCKET_OR_NULL] = &fullsock_types,
4067 [ARG_PTR_TO_BTF_ID] = &btf_ptr_types,
4068 [ARG_PTR_TO_SPIN_LOCK] = &spin_lock_types,
4069 [ARG_PTR_TO_MEM] = &mem_types,
4070 [ARG_PTR_TO_MEM_OR_NULL] = &mem_types,
4071 [ARG_PTR_TO_UNINIT_MEM] = &mem_types,
4072 [ARG_PTR_TO_ALLOC_MEM] = &alloc_mem_types,
4073 [ARG_PTR_TO_ALLOC_MEM_OR_NULL] = &alloc_mem_types,
4074 [ARG_PTR_TO_INT] = &int_ptr_types,
4075 [ARG_PTR_TO_LONG] = &int_ptr_types,
4076 [ARG_PTR_TO_PERCPU_BTF_ID] = &percpu_btf_ptr_types,
4079 static int check_reg_type(struct bpf_verifier_env *env, u32 regno,
4080 enum bpf_arg_type arg_type,
4081 const u32 *arg_btf_id)
4083 struct bpf_reg_state *regs = cur_regs(env), *reg = ®s[regno];
4084 enum bpf_reg_type expected, type = reg->type;
4085 const struct bpf_reg_types *compatible;
4088 compatible = compatible_reg_types[arg_type];
4090 verbose(env, "verifier internal error: unsupported arg type %d\n", arg_type);
4094 for (i = 0; i < ARRAY_SIZE(compatible->types); i++) {
4095 expected = compatible->types[i];
4096 if (expected == NOT_INIT)
4099 if (type == expected)
4103 verbose(env, "R%d type=%s expected=", regno, reg_type_str[type]);
4104 for (j = 0; j + 1 < i; j++)
4105 verbose(env, "%s, ", reg_type_str[compatible->types[j]]);
4106 verbose(env, "%s\n", reg_type_str[compatible->types[j]]);
4110 if (type == PTR_TO_BTF_ID) {
4112 if (!compatible->btf_id) {
4113 verbose(env, "verifier internal error: missing arg compatible BTF ID\n");
4116 arg_btf_id = compatible->btf_id;
4119 if (!btf_struct_ids_match(&env->log, reg->off, reg->btf_id,
4121 verbose(env, "R%d is of type %s but %s is expected\n",
4122 regno, kernel_type_name(reg->btf_id),
4123 kernel_type_name(*arg_btf_id));
4127 if (!tnum_is_const(reg->var_off) || reg->var_off.value) {
4128 verbose(env, "R%d is a pointer to in-kernel struct with non-zero offset\n",
4137 static int check_func_arg(struct bpf_verifier_env *env, u32 arg,
4138 struct bpf_call_arg_meta *meta,
4139 const struct bpf_func_proto *fn)
4141 u32 regno = BPF_REG_1 + arg;
4142 struct bpf_reg_state *regs = cur_regs(env), *reg = ®s[regno];
4143 enum bpf_arg_type arg_type = fn->arg_type[arg];
4144 enum bpf_reg_type type = reg->type;
4147 if (arg_type == ARG_DONTCARE)
4150 err = check_reg_arg(env, regno, SRC_OP);
4154 if (arg_type == ARG_ANYTHING) {
4155 if (is_pointer_value(env, regno)) {
4156 verbose(env, "R%d leaks addr into helper function\n",
4163 if (type_is_pkt_pointer(type) &&
4164 !may_access_direct_pkt_data(env, meta, BPF_READ)) {
4165 verbose(env, "helper access to the packet is not allowed\n");
4169 if (arg_type == ARG_PTR_TO_MAP_VALUE ||
4170 arg_type == ARG_PTR_TO_UNINIT_MAP_VALUE ||
4171 arg_type == ARG_PTR_TO_MAP_VALUE_OR_NULL) {
4172 err = resolve_map_arg_type(env, meta, &arg_type);
4177 if (register_is_null(reg) && arg_type_may_be_null(arg_type))
4178 /* A NULL register has a SCALAR_VALUE type, so skip
4181 goto skip_type_check;
4183 err = check_reg_type(env, regno, arg_type, fn->arg_btf_id[arg]);
4187 if (type == PTR_TO_CTX) {
4188 err = check_ctx_reg(env, reg, regno);
4194 if (reg->ref_obj_id) {
4195 if (meta->ref_obj_id) {
4196 verbose(env, "verifier internal error: more than one arg with ref_obj_id R%d %u %u\n",
4197 regno, reg->ref_obj_id,
4201 meta->ref_obj_id = reg->ref_obj_id;
4204 if (arg_type == ARG_CONST_MAP_PTR) {
4205 /* bpf_map_xxx(map_ptr) call: remember that map_ptr */
4206 meta->map_ptr = reg->map_ptr;
4207 } else if (arg_type == ARG_PTR_TO_MAP_KEY) {
4208 /* bpf_map_xxx(..., map_ptr, ..., key) call:
4209 * check that [key, key + map->key_size) are within
4210 * stack limits and initialized
4212 if (!meta->map_ptr) {
4213 /* in function declaration map_ptr must come before
4214 * map_key, so that it's verified and known before
4215 * we have to check map_key here. Otherwise it means
4216 * that kernel subsystem misconfigured verifier
4218 verbose(env, "invalid map_ptr to access map->key\n");
4221 err = check_helper_mem_access(env, regno,
4222 meta->map_ptr->key_size, false,
4224 } else if (arg_type == ARG_PTR_TO_MAP_VALUE ||
4225 (arg_type == ARG_PTR_TO_MAP_VALUE_OR_NULL &&
4226 !register_is_null(reg)) ||
4227 arg_type == ARG_PTR_TO_UNINIT_MAP_VALUE) {
4228 /* bpf_map_xxx(..., map_ptr, ..., value) call:
4229 * check [value, value + map->value_size) validity
4231 if (!meta->map_ptr) {
4232 /* kernel subsystem misconfigured verifier */
4233 verbose(env, "invalid map_ptr to access map->value\n");
4236 meta->raw_mode = (arg_type == ARG_PTR_TO_UNINIT_MAP_VALUE);
4237 err = check_helper_mem_access(env, regno,
4238 meta->map_ptr->value_size, false,
4240 } else if (arg_type == ARG_PTR_TO_PERCPU_BTF_ID) {
4242 verbose(env, "Helper has invalid btf_id in R%d\n", regno);
4245 meta->ret_btf_id = reg->btf_id;
4246 } else if (arg_type == ARG_PTR_TO_SPIN_LOCK) {
4247 if (meta->func_id == BPF_FUNC_spin_lock) {
4248 if (process_spin_lock(env, regno, true))
4250 } else if (meta->func_id == BPF_FUNC_spin_unlock) {
4251 if (process_spin_lock(env, regno, false))
4254 verbose(env, "verifier internal error\n");
4257 } else if (arg_type_is_mem_ptr(arg_type)) {
4258 /* The access to this pointer is only checked when we hit the
4259 * next is_mem_size argument below.
4261 meta->raw_mode = (arg_type == ARG_PTR_TO_UNINIT_MEM);
4262 } else if (arg_type_is_mem_size(arg_type)) {
4263 bool zero_size_allowed = (arg_type == ARG_CONST_SIZE_OR_ZERO);
4265 /* This is used to refine r0 return value bounds for helpers
4266 * that enforce this value as an upper bound on return values.
4267 * See do_refine_retval_range() for helpers that can refine
4268 * the return value. C type of helper is u32 so we pull register
4269 * bound from umax_value however, if negative verifier errors
4270 * out. Only upper bounds can be learned because retval is an
4271 * int type and negative retvals are allowed.
4273 meta->msize_max_value = reg->umax_value;
4275 /* The register is SCALAR_VALUE; the access check
4276 * happens using its boundaries.
4278 if (!tnum_is_const(reg->var_off))
4279 /* For unprivileged variable accesses, disable raw
4280 * mode so that the program is required to
4281 * initialize all the memory that the helper could
4282 * just partially fill up.
4286 if (reg->smin_value < 0) {
4287 verbose(env, "R%d min value is negative, either use unsigned or 'var &= const'\n",
4292 if (reg->umin_value == 0) {
4293 err = check_helper_mem_access(env, regno - 1, 0,
4300 if (reg->umax_value >= BPF_MAX_VAR_SIZ) {
4301 verbose(env, "R%d unbounded memory access, use 'var &= const' or 'if (var < const)'\n",
4305 err = check_helper_mem_access(env, regno - 1,
4307 zero_size_allowed, meta);
4309 err = mark_chain_precision(env, regno);
4310 } else if (arg_type_is_alloc_size(arg_type)) {
4311 if (!tnum_is_const(reg->var_off)) {
4312 verbose(env, "R%d unbounded size, use 'var &= const' or 'if (var < const)'\n",
4316 meta->mem_size = reg->var_off.value;
4317 } else if (arg_type_is_int_ptr(arg_type)) {
4318 int size = int_ptr_type_to_size(arg_type);
4320 err = check_helper_mem_access(env, regno, size, false, meta);
4323 err = check_ptr_alignment(env, reg, 0, size, true);
4329 static bool may_update_sockmap(struct bpf_verifier_env *env, int func_id)
4331 enum bpf_attach_type eatype = env->prog->expected_attach_type;
4332 enum bpf_prog_type type = resolve_prog_type(env->prog);
4334 if (func_id != BPF_FUNC_map_update_elem)
4337 /* It's not possible to get access to a locked struct sock in these
4338 * contexts, so updating is safe.
4341 case BPF_PROG_TYPE_TRACING:
4342 if (eatype == BPF_TRACE_ITER)
4345 case BPF_PROG_TYPE_SOCKET_FILTER:
4346 case BPF_PROG_TYPE_SCHED_CLS:
4347 case BPF_PROG_TYPE_SCHED_ACT:
4348 case BPF_PROG_TYPE_XDP:
4349 case BPF_PROG_TYPE_SK_REUSEPORT:
4350 case BPF_PROG_TYPE_FLOW_DISSECTOR:
4351 case BPF_PROG_TYPE_SK_LOOKUP:
4357 verbose(env, "cannot update sockmap in this context\n");
4361 static bool allow_tail_call_in_subprogs(struct bpf_verifier_env *env)
4363 return env->prog->jit_requested && IS_ENABLED(CONFIG_X86_64);
4366 static int check_map_func_compatibility(struct bpf_verifier_env *env,
4367 struct bpf_map *map, int func_id)
4372 /* We need a two way check, first is from map perspective ... */
4373 switch (map->map_type) {
4374 case BPF_MAP_TYPE_PROG_ARRAY:
4375 if (func_id != BPF_FUNC_tail_call)
4378 case BPF_MAP_TYPE_PERF_EVENT_ARRAY:
4379 if (func_id != BPF_FUNC_perf_event_read &&
4380 func_id != BPF_FUNC_perf_event_output &&
4381 func_id != BPF_FUNC_skb_output &&
4382 func_id != BPF_FUNC_perf_event_read_value &&
4383 func_id != BPF_FUNC_xdp_output)
4386 case BPF_MAP_TYPE_RINGBUF:
4387 if (func_id != BPF_FUNC_ringbuf_output &&
4388 func_id != BPF_FUNC_ringbuf_reserve &&
4389 func_id != BPF_FUNC_ringbuf_submit &&
4390 func_id != BPF_FUNC_ringbuf_discard &&
4391 func_id != BPF_FUNC_ringbuf_query)
4394 case BPF_MAP_TYPE_STACK_TRACE:
4395 if (func_id != BPF_FUNC_get_stackid)
4398 case BPF_MAP_TYPE_CGROUP_ARRAY:
4399 if (func_id != BPF_FUNC_skb_under_cgroup &&
4400 func_id != BPF_FUNC_current_task_under_cgroup)
4403 case BPF_MAP_TYPE_CGROUP_STORAGE:
4404 case BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE:
4405 if (func_id != BPF_FUNC_get_local_storage)
4408 case BPF_MAP_TYPE_DEVMAP:
4409 case BPF_MAP_TYPE_DEVMAP_HASH:
4410 if (func_id != BPF_FUNC_redirect_map &&
4411 func_id != BPF_FUNC_map_lookup_elem)
4414 /* Restrict bpf side of cpumap and xskmap, open when use-cases
4417 case BPF_MAP_TYPE_CPUMAP:
4418 if (func_id != BPF_FUNC_redirect_map)
4421 case BPF_MAP_TYPE_XSKMAP:
4422 if (func_id != BPF_FUNC_redirect_map &&
4423 func_id != BPF_FUNC_map_lookup_elem)
4426 case BPF_MAP_TYPE_ARRAY_OF_MAPS:
4427 case BPF_MAP_TYPE_HASH_OF_MAPS:
4428 if (func_id != BPF_FUNC_map_lookup_elem)
4431 case BPF_MAP_TYPE_SOCKMAP:
4432 if (func_id != BPF_FUNC_sk_redirect_map &&
4433 func_id != BPF_FUNC_sock_map_update &&
4434 func_id != BPF_FUNC_map_delete_elem &&
4435 func_id != BPF_FUNC_msg_redirect_map &&
4436 func_id != BPF_FUNC_sk_select_reuseport &&
4437 func_id != BPF_FUNC_map_lookup_elem &&
4438 !may_update_sockmap(env, func_id))
4441 case BPF_MAP_TYPE_SOCKHASH:
4442 if (func_id != BPF_FUNC_sk_redirect_hash &&
4443 func_id != BPF_FUNC_sock_hash_update &&
4444 func_id != BPF_FUNC_map_delete_elem &&
4445 func_id != BPF_FUNC_msg_redirect_hash &&
4446 func_id != BPF_FUNC_sk_select_reuseport &&
4447 func_id != BPF_FUNC_map_lookup_elem &&
4448 !may_update_sockmap(env, func_id))
4451 case BPF_MAP_TYPE_REUSEPORT_SOCKARRAY:
4452 if (func_id != BPF_FUNC_sk_select_reuseport)
4455 case BPF_MAP_TYPE_QUEUE:
4456 case BPF_MAP_TYPE_STACK:
4457 if (func_id != BPF_FUNC_map_peek_elem &&
4458 func_id != BPF_FUNC_map_pop_elem &&
4459 func_id != BPF_FUNC_map_push_elem)
4462 case BPF_MAP_TYPE_SK_STORAGE:
4463 if (func_id != BPF_FUNC_sk_storage_get &&
4464 func_id != BPF_FUNC_sk_storage_delete)
4467 case BPF_MAP_TYPE_INODE_STORAGE:
4468 if (func_id != BPF_FUNC_inode_storage_get &&
4469 func_id != BPF_FUNC_inode_storage_delete)
4476 /* ... and second from the function itself. */
4478 case BPF_FUNC_tail_call:
4479 if (map->map_type != BPF_MAP_TYPE_PROG_ARRAY)
4481 if (env->subprog_cnt > 1 && !allow_tail_call_in_subprogs(env)) {
4482 verbose(env, "tail_calls are not allowed in non-JITed programs with bpf-to-bpf calls\n");
4486 case BPF_FUNC_perf_event_read:
4487 case BPF_FUNC_perf_event_output:
4488 case BPF_FUNC_perf_event_read_value:
4489 case BPF_FUNC_skb_output:
4490 case BPF_FUNC_xdp_output:
4491 if (map->map_type != BPF_MAP_TYPE_PERF_EVENT_ARRAY)
4494 case BPF_FUNC_get_stackid:
4495 if (map->map_type != BPF_MAP_TYPE_STACK_TRACE)
4498 case BPF_FUNC_current_task_under_cgroup:
4499 case BPF_FUNC_skb_under_cgroup:
4500 if (map->map_type != BPF_MAP_TYPE_CGROUP_ARRAY)
4503 case BPF_FUNC_redirect_map:
4504 if (map->map_type != BPF_MAP_TYPE_DEVMAP &&
4505 map->map_type != BPF_MAP_TYPE_DEVMAP_HASH &&
4506 map->map_type != BPF_MAP_TYPE_CPUMAP &&
4507 map->map_type != BPF_MAP_TYPE_XSKMAP)
4510 case BPF_FUNC_sk_redirect_map:
4511 case BPF_FUNC_msg_redirect_map:
4512 case BPF_FUNC_sock_map_update:
4513 if (map->map_type != BPF_MAP_TYPE_SOCKMAP)
4516 case BPF_FUNC_sk_redirect_hash:
4517 case BPF_FUNC_msg_redirect_hash:
4518 case BPF_FUNC_sock_hash_update:
4519 if (map->map_type != BPF_MAP_TYPE_SOCKHASH)
4522 case BPF_FUNC_get_local_storage:
4523 if (map->map_type != BPF_MAP_TYPE_CGROUP_STORAGE &&
4524 map->map_type != BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
4527 case BPF_FUNC_sk_select_reuseport:
4528 if (map->map_type != BPF_MAP_TYPE_REUSEPORT_SOCKARRAY &&
4529 map->map_type != BPF_MAP_TYPE_SOCKMAP &&
4530 map->map_type != BPF_MAP_TYPE_SOCKHASH)
4533 case BPF_FUNC_map_peek_elem:
4534 case BPF_FUNC_map_pop_elem:
4535 case BPF_FUNC_map_push_elem:
4536 if (map->map_type != BPF_MAP_TYPE_QUEUE &&
4537 map->map_type != BPF_MAP_TYPE_STACK)
4540 case BPF_FUNC_sk_storage_get:
4541 case BPF_FUNC_sk_storage_delete:
4542 if (map->map_type != BPF_MAP_TYPE_SK_STORAGE)
4545 case BPF_FUNC_inode_storage_get:
4546 case BPF_FUNC_inode_storage_delete:
4547 if (map->map_type != BPF_MAP_TYPE_INODE_STORAGE)
4556 verbose(env, "cannot pass map_type %d into func %s#%d\n",
4557 map->map_type, func_id_name(func_id), func_id);
4561 static bool check_raw_mode_ok(const struct bpf_func_proto *fn)
4565 if (fn->arg1_type == ARG_PTR_TO_UNINIT_MEM)
4567 if (fn->arg2_type == ARG_PTR_TO_UNINIT_MEM)
4569 if (fn->arg3_type == ARG_PTR_TO_UNINIT_MEM)
4571 if (fn->arg4_type == ARG_PTR_TO_UNINIT_MEM)
4573 if (fn->arg5_type == ARG_PTR_TO_UNINIT_MEM)
4576 /* We only support one arg being in raw mode at the moment,
4577 * which is sufficient for the helper functions we have
4583 static bool check_args_pair_invalid(enum bpf_arg_type arg_curr,
4584 enum bpf_arg_type arg_next)
4586 return (arg_type_is_mem_ptr(arg_curr) &&
4587 !arg_type_is_mem_size(arg_next)) ||
4588 (!arg_type_is_mem_ptr(arg_curr) &&
4589 arg_type_is_mem_size(arg_next));
4592 static bool check_arg_pair_ok(const struct bpf_func_proto *fn)
4594 /* bpf_xxx(..., buf, len) call will access 'len'
4595 * bytes from memory 'buf'. Both arg types need
4596 * to be paired, so make sure there's no buggy
4597 * helper function specification.
4599 if (arg_type_is_mem_size(fn->arg1_type) ||
4600 arg_type_is_mem_ptr(fn->arg5_type) ||
4601 check_args_pair_invalid(fn->arg1_type, fn->arg2_type) ||
4602 check_args_pair_invalid(fn->arg2_type, fn->arg3_type) ||
4603 check_args_pair_invalid(fn->arg3_type, fn->arg4_type) ||
4604 check_args_pair_invalid(fn->arg4_type, fn->arg5_type))
4610 static bool check_refcount_ok(const struct bpf_func_proto *fn, int func_id)
4614 if (arg_type_may_be_refcounted(fn->arg1_type))
4616 if (arg_type_may_be_refcounted(fn->arg2_type))
4618 if (arg_type_may_be_refcounted(fn->arg3_type))
4620 if (arg_type_may_be_refcounted(fn->arg4_type))
4622 if (arg_type_may_be_refcounted(fn->arg5_type))
4625 /* A reference acquiring function cannot acquire
4626 * another refcounted ptr.
4628 if (may_be_acquire_function(func_id) && count)
4631 /* We only support one arg being unreferenced at the moment,
4632 * which is sufficient for the helper functions we have right now.
4637 static bool check_btf_id_ok(const struct bpf_func_proto *fn)
4641 for (i = 0; i < ARRAY_SIZE(fn->arg_type); i++) {
4642 if (fn->arg_type[i] == ARG_PTR_TO_BTF_ID && !fn->arg_btf_id[i])
4645 if (fn->arg_type[i] != ARG_PTR_TO_BTF_ID && fn->arg_btf_id[i])
4652 static int check_func_proto(const struct bpf_func_proto *fn, int func_id)
4654 return check_raw_mode_ok(fn) &&
4655 check_arg_pair_ok(fn) &&
4656 check_btf_id_ok(fn) &&
4657 check_refcount_ok(fn, func_id) ? 0 : -EINVAL;
4660 /* Packet data might have moved, any old PTR_TO_PACKET[_META,_END]
4661 * are now invalid, so turn them into unknown SCALAR_VALUE.
4663 static void __clear_all_pkt_pointers(struct bpf_verifier_env *env,
4664 struct bpf_func_state *state)
4666 struct bpf_reg_state *regs = state->regs, *reg;
4669 for (i = 0; i < MAX_BPF_REG; i++)
4670 if (reg_is_pkt_pointer_any(®s[i]))
4671 mark_reg_unknown(env, regs, i);
4673 bpf_for_each_spilled_reg(i, state, reg) {
4676 if (reg_is_pkt_pointer_any(reg))
4677 __mark_reg_unknown(env, reg);
4681 static void clear_all_pkt_pointers(struct bpf_verifier_env *env)
4683 struct bpf_verifier_state *vstate = env->cur_state;
4686 for (i = 0; i <= vstate->curframe; i++)
4687 __clear_all_pkt_pointers(env, vstate->frame[i]);
4690 static void release_reg_references(struct bpf_verifier_env *env,
4691 struct bpf_func_state *state,
4694 struct bpf_reg_state *regs = state->regs, *reg;
4697 for (i = 0; i < MAX_BPF_REG; i++)
4698 if (regs[i].ref_obj_id == ref_obj_id)
4699 mark_reg_unknown(env, regs, i);
4701 bpf_for_each_spilled_reg(i, state, reg) {
4704 if (reg->ref_obj_id == ref_obj_id)
4705 __mark_reg_unknown(env, reg);
4709 /* The pointer with the specified id has released its reference to kernel
4710 * resources. Identify all copies of the same pointer and clear the reference.
4712 static int release_reference(struct bpf_verifier_env *env,
4715 struct bpf_verifier_state *vstate = env->cur_state;
4719 err = release_reference_state(cur_func(env), ref_obj_id);
4723 for (i = 0; i <= vstate->curframe; i++)
4724 release_reg_references(env, vstate->frame[i], ref_obj_id);
4729 static void clear_caller_saved_regs(struct bpf_verifier_env *env,
4730 struct bpf_reg_state *regs)
4734 /* after the call registers r0 - r5 were scratched */
4735 for (i = 0; i < CALLER_SAVED_REGS; i++) {
4736 mark_reg_not_init(env, regs, caller_saved[i]);
4737 check_reg_arg(env, caller_saved[i], DST_OP_NO_MARK);
4741 static int check_func_call(struct bpf_verifier_env *env, struct bpf_insn *insn,
4744 struct bpf_verifier_state *state = env->cur_state;
4745 struct bpf_func_info_aux *func_info_aux;
4746 struct bpf_func_state *caller, *callee;
4747 int i, err, subprog, target_insn;
4748 bool is_global = false;
4750 if (state->curframe + 1 >= MAX_CALL_FRAMES) {
4751 verbose(env, "the call stack of %d frames is too deep\n",
4752 state->curframe + 2);
4756 target_insn = *insn_idx + insn->imm;
4757 subprog = find_subprog(env, target_insn + 1);
4759 verbose(env, "verifier bug. No program starts at insn %d\n",
4764 caller = state->frame[state->curframe];
4765 if (state->frame[state->curframe + 1]) {
4766 verbose(env, "verifier bug. Frame %d already allocated\n",
4767 state->curframe + 1);
4771 func_info_aux = env->prog->aux->func_info_aux;
4773 is_global = func_info_aux[subprog].linkage == BTF_FUNC_GLOBAL;
4774 err = btf_check_func_arg_match(env, subprog, caller->regs);
4779 verbose(env, "Caller passes invalid args into func#%d\n",
4783 if (env->log.level & BPF_LOG_LEVEL)
4785 "Func#%d is global and valid. Skipping.\n",
4787 clear_caller_saved_regs(env, caller->regs);
4789 /* All global functions return SCALAR_VALUE */
4790 mark_reg_unknown(env, caller->regs, BPF_REG_0);
4792 /* continue with next insn after call */
4797 callee = kzalloc(sizeof(*callee), GFP_KERNEL);
4800 state->frame[state->curframe + 1] = callee;
4802 /* callee cannot access r0, r6 - r9 for reading and has to write
4803 * into its own stack before reading from it.
4804 * callee can read/write into caller's stack
4806 init_func_state(env, callee,
4807 /* remember the callsite, it will be used by bpf_exit */
4808 *insn_idx /* callsite */,
4809 state->curframe + 1 /* frameno within this callchain */,
4810 subprog /* subprog number within this prog */);
4812 /* Transfer references to the callee */
4813 err = transfer_reference_state(callee, caller);
4817 /* copy r1 - r5 args that callee can access. The copy includes parent
4818 * pointers, which connects us up to the liveness chain
4820 for (i = BPF_REG_1; i <= BPF_REG_5; i++)
4821 callee->regs[i] = caller->regs[i];
4823 clear_caller_saved_regs(env, caller->regs);
4825 /* only increment it after check_reg_arg() finished */
4828 /* and go analyze first insn of the callee */
4829 *insn_idx = target_insn;
4831 if (env->log.level & BPF_LOG_LEVEL) {
4832 verbose(env, "caller:\n");
4833 print_verifier_state(env, caller);
4834 verbose(env, "callee:\n");
4835 print_verifier_state(env, callee);
4840 static int prepare_func_exit(struct bpf_verifier_env *env, int *insn_idx)
4842 struct bpf_verifier_state *state = env->cur_state;
4843 struct bpf_func_state *caller, *callee;
4844 struct bpf_reg_state *r0;
4847 callee = state->frame[state->curframe];
4848 r0 = &callee->regs[BPF_REG_0];
4849 if (r0->type == PTR_TO_STACK) {
4850 /* technically it's ok to return caller's stack pointer
4851 * (or caller's caller's pointer) back to the caller,
4852 * since these pointers are valid. Only current stack
4853 * pointer will be invalid as soon as function exits,
4854 * but let's be conservative
4856 verbose(env, "cannot return stack pointer to the caller\n");
4861 caller = state->frame[state->curframe];
4862 /* return to the caller whatever r0 had in the callee */
4863 caller->regs[BPF_REG_0] = *r0;
4865 /* Transfer references to the caller */
4866 err = transfer_reference_state(caller, callee);
4870 *insn_idx = callee->callsite + 1;
4871 if (env->log.level & BPF_LOG_LEVEL) {
4872 verbose(env, "returning from callee:\n");
4873 print_verifier_state(env, callee);
4874 verbose(env, "to caller at %d:\n", *insn_idx);
4875 print_verifier_state(env, caller);
4877 /* clear everything in the callee */
4878 free_func_state(callee);
4879 state->frame[state->curframe + 1] = NULL;
4883 static void do_refine_retval_range(struct bpf_reg_state *regs, int ret_type,
4885 struct bpf_call_arg_meta *meta)
4887 struct bpf_reg_state *ret_reg = ®s[BPF_REG_0];
4889 if (ret_type != RET_INTEGER ||
4890 (func_id != BPF_FUNC_get_stack &&
4891 func_id != BPF_FUNC_probe_read_str &&
4892 func_id != BPF_FUNC_probe_read_kernel_str &&
4893 func_id != BPF_FUNC_probe_read_user_str))
4896 ret_reg->smax_value = meta->msize_max_value;
4897 ret_reg->s32_max_value = meta->msize_max_value;
4898 __reg_deduce_bounds(ret_reg);
4899 __reg_bound_offset(ret_reg);
4900 __update_reg_bounds(ret_reg);
4904 record_func_map(struct bpf_verifier_env *env, struct bpf_call_arg_meta *meta,
4905 int func_id, int insn_idx)
4907 struct bpf_insn_aux_data *aux = &env->insn_aux_data[insn_idx];
4908 struct bpf_map *map = meta->map_ptr;
4910 if (func_id != BPF_FUNC_tail_call &&
4911 func_id != BPF_FUNC_map_lookup_elem &&
4912 func_id != BPF_FUNC_map_update_elem &&
4913 func_id != BPF_FUNC_map_delete_elem &&
4914 func_id != BPF_FUNC_map_push_elem &&
4915 func_id != BPF_FUNC_map_pop_elem &&
4916 func_id != BPF_FUNC_map_peek_elem)
4920 verbose(env, "kernel subsystem misconfigured verifier\n");
4924 /* In case of read-only, some additional restrictions
4925 * need to be applied in order to prevent altering the
4926 * state of the map from program side.
4928 if ((map->map_flags & BPF_F_RDONLY_PROG) &&
4929 (func_id == BPF_FUNC_map_delete_elem ||
4930 func_id == BPF_FUNC_map_update_elem ||
4931 func_id == BPF_FUNC_map_push_elem ||
4932 func_id == BPF_FUNC_map_pop_elem)) {
4933 verbose(env, "write into map forbidden\n");
4937 if (!BPF_MAP_PTR(aux->map_ptr_state))
4938 bpf_map_ptr_store(aux, meta->map_ptr,
4939 !meta->map_ptr->bypass_spec_v1);
4940 else if (BPF_MAP_PTR(aux->map_ptr_state) != meta->map_ptr)
4941 bpf_map_ptr_store(aux, BPF_MAP_PTR_POISON,
4942 !meta->map_ptr->bypass_spec_v1);
4947 record_func_key(struct bpf_verifier_env *env, struct bpf_call_arg_meta *meta,
4948 int func_id, int insn_idx)
4950 struct bpf_insn_aux_data *aux = &env->insn_aux_data[insn_idx];
4951 struct bpf_reg_state *regs = cur_regs(env), *reg;
4952 struct bpf_map *map = meta->map_ptr;
4957 if (func_id != BPF_FUNC_tail_call)
4959 if (!map || map->map_type != BPF_MAP_TYPE_PROG_ARRAY) {
4960 verbose(env, "kernel subsystem misconfigured verifier\n");
4964 range = tnum_range(0, map->max_entries - 1);
4965 reg = ®s[BPF_REG_3];
4967 if (!register_is_const(reg) || !tnum_in(range, reg->var_off)) {
4968 bpf_map_key_store(aux, BPF_MAP_KEY_POISON);
4972 err = mark_chain_precision(env, BPF_REG_3);
4976 val = reg->var_off.value;
4977 if (bpf_map_key_unseen(aux))
4978 bpf_map_key_store(aux, val);
4979 else if (!bpf_map_key_poisoned(aux) &&
4980 bpf_map_key_immediate(aux) != val)
4981 bpf_map_key_store(aux, BPF_MAP_KEY_POISON);
4985 static int check_reference_leak(struct bpf_verifier_env *env)
4987 struct bpf_func_state *state = cur_func(env);
4990 for (i = 0; i < state->acquired_refs; i++) {
4991 verbose(env, "Unreleased reference id=%d alloc_insn=%d\n",
4992 state->refs[i].id, state->refs[i].insn_idx);
4994 return state->acquired_refs ? -EINVAL : 0;
4997 static int check_helper_call(struct bpf_verifier_env *env, int func_id, int insn_idx)
4999 const struct bpf_func_proto *fn = NULL;
5000 struct bpf_reg_state *regs;
5001 struct bpf_call_arg_meta meta;
5005 /* find function prototype */
5006 if (func_id < 0 || func_id >= __BPF_FUNC_MAX_ID) {
5007 verbose(env, "invalid func %s#%d\n", func_id_name(func_id),
5012 if (env->ops->get_func_proto)
5013 fn = env->ops->get_func_proto(func_id, env->prog);
5015 verbose(env, "unknown func %s#%d\n", func_id_name(func_id),
5020 /* eBPF programs must be GPL compatible to use GPL-ed functions */
5021 if (!env->prog->gpl_compatible && fn->gpl_only) {
5022 verbose(env, "cannot call GPL-restricted function from non-GPL compatible program\n");
5026 if (fn->allowed && !fn->allowed(env->prog)) {
5027 verbose(env, "helper call is not allowed in probe\n");
5031 /* With LD_ABS/IND some JITs save/restore skb from r1. */
5032 changes_data = bpf_helper_changes_pkt_data(fn->func);
5033 if (changes_data && fn->arg1_type != ARG_PTR_TO_CTX) {
5034 verbose(env, "kernel subsystem misconfigured func %s#%d: r1 != ctx\n",
5035 func_id_name(func_id), func_id);
5039 memset(&meta, 0, sizeof(meta));
5040 meta.pkt_access = fn->pkt_access;
5042 err = check_func_proto(fn, func_id);
5044 verbose(env, "kernel subsystem misconfigured func %s#%d\n",
5045 func_id_name(func_id), func_id);
5049 meta.func_id = func_id;
5051 for (i = 0; i < 5; i++) {
5052 err = check_func_arg(env, i, &meta, fn);
5057 err = record_func_map(env, &meta, func_id, insn_idx);
5061 err = record_func_key(env, &meta, func_id, insn_idx);
5065 /* Mark slots with STACK_MISC in case of raw mode, stack offset
5066 * is inferred from register state.
5068 for (i = 0; i < meta.access_size; i++) {
5069 err = check_mem_access(env, insn_idx, meta.regno, i, BPF_B,
5070 BPF_WRITE, -1, false);
5075 if (func_id == BPF_FUNC_tail_call) {
5076 err = check_reference_leak(env);
5078 verbose(env, "tail_call would lead to reference leak\n");
5081 } else if (is_release_function(func_id)) {
5082 err = release_reference(env, meta.ref_obj_id);
5084 verbose(env, "func %s#%d reference has not been acquired before\n",
5085 func_id_name(func_id), func_id);
5090 regs = cur_regs(env);
5092 /* check that flags argument in get_local_storage(map, flags) is 0,
5093 * this is required because get_local_storage() can't return an error.
5095 if (func_id == BPF_FUNC_get_local_storage &&
5096 !register_is_null(®s[BPF_REG_2])) {
5097 verbose(env, "get_local_storage() doesn't support non-zero flags\n");
5101 /* reset caller saved regs */
5102 for (i = 0; i < CALLER_SAVED_REGS; i++) {
5103 mark_reg_not_init(env, regs, caller_saved[i]);
5104 check_reg_arg(env, caller_saved[i], DST_OP_NO_MARK);
5107 /* helper call returns 64-bit value. */
5108 regs[BPF_REG_0].subreg_def = DEF_NOT_SUBREG;
5110 /* update return register (already marked as written above) */
5111 if (fn->ret_type == RET_INTEGER) {
5112 /* sets type to SCALAR_VALUE */
5113 mark_reg_unknown(env, regs, BPF_REG_0);
5114 } else if (fn->ret_type == RET_VOID) {
5115 regs[BPF_REG_0].type = NOT_INIT;
5116 } else if (fn->ret_type == RET_PTR_TO_MAP_VALUE_OR_NULL ||
5117 fn->ret_type == RET_PTR_TO_MAP_VALUE) {
5118 /* There is no offset yet applied, variable or fixed */
5119 mark_reg_known_zero(env, regs, BPF_REG_0);
5120 /* remember map_ptr, so that check_map_access()
5121 * can check 'value_size' boundary of memory access
5122 * to map element returned from bpf_map_lookup_elem()
5124 if (meta.map_ptr == NULL) {
5126 "kernel subsystem misconfigured verifier\n");
5129 regs[BPF_REG_0].map_ptr = meta.map_ptr;
5130 if (fn->ret_type == RET_PTR_TO_MAP_VALUE) {
5131 regs[BPF_REG_0].type = PTR_TO_MAP_VALUE;
5132 if (map_value_has_spin_lock(meta.map_ptr))
5133 regs[BPF_REG_0].id = ++env->id_gen;
5135 regs[BPF_REG_0].type = PTR_TO_MAP_VALUE_OR_NULL;
5136 regs[BPF_REG_0].id = ++env->id_gen;
5138 } else if (fn->ret_type == RET_PTR_TO_SOCKET_OR_NULL) {
5139 mark_reg_known_zero(env, regs, BPF_REG_0);
5140 regs[BPF_REG_0].type = PTR_TO_SOCKET_OR_NULL;
5141 regs[BPF_REG_0].id = ++env->id_gen;
5142 } else if (fn->ret_type == RET_PTR_TO_SOCK_COMMON_OR_NULL) {
5143 mark_reg_known_zero(env, regs, BPF_REG_0);
5144 regs[BPF_REG_0].type = PTR_TO_SOCK_COMMON_OR_NULL;
5145 regs[BPF_REG_0].id = ++env->id_gen;
5146 } else if (fn->ret_type == RET_PTR_TO_TCP_SOCK_OR_NULL) {
5147 mark_reg_known_zero(env, regs, BPF_REG_0);
5148 regs[BPF_REG_0].type = PTR_TO_TCP_SOCK_OR_NULL;
5149 regs[BPF_REG_0].id = ++env->id_gen;
5150 } else if (fn->ret_type == RET_PTR_TO_ALLOC_MEM_OR_NULL) {
5151 mark_reg_known_zero(env, regs, BPF_REG_0);
5152 regs[BPF_REG_0].type = PTR_TO_MEM_OR_NULL;
5153 regs[BPF_REG_0].id = ++env->id_gen;
5154 regs[BPF_REG_0].mem_size = meta.mem_size;
5155 } else if (fn->ret_type == RET_PTR_TO_MEM_OR_BTF_ID_OR_NULL ||
5156 fn->ret_type == RET_PTR_TO_MEM_OR_BTF_ID) {
5157 const struct btf_type *t;
5159 mark_reg_known_zero(env, regs, BPF_REG_0);
5160 t = btf_type_skip_modifiers(btf_vmlinux, meta.ret_btf_id, NULL);
5161 if (!btf_type_is_struct(t)) {
5163 const struct btf_type *ret;
5166 /* resolve the type size of ksym. */
5167 ret = btf_resolve_size(btf_vmlinux, t, &tsize);
5169 tname = btf_name_by_offset(btf_vmlinux, t->name_off);
5170 verbose(env, "unable to resolve the size of type '%s': %ld\n",
5171 tname, PTR_ERR(ret));
5174 regs[BPF_REG_0].type =
5175 fn->ret_type == RET_PTR_TO_MEM_OR_BTF_ID ?
5176 PTR_TO_MEM : PTR_TO_MEM_OR_NULL;
5177 regs[BPF_REG_0].mem_size = tsize;
5179 regs[BPF_REG_0].type =
5180 fn->ret_type == RET_PTR_TO_MEM_OR_BTF_ID ?
5181 PTR_TO_BTF_ID : PTR_TO_BTF_ID_OR_NULL;
5182 regs[BPF_REG_0].btf_id = meta.ret_btf_id;
5184 } else if (fn->ret_type == RET_PTR_TO_BTF_ID_OR_NULL) {
5187 mark_reg_known_zero(env, regs, BPF_REG_0);
5188 regs[BPF_REG_0].type = PTR_TO_BTF_ID_OR_NULL;
5189 ret_btf_id = *fn->ret_btf_id;
5190 if (ret_btf_id == 0) {
5191 verbose(env, "invalid return type %d of func %s#%d\n",
5192 fn->ret_type, func_id_name(func_id), func_id);
5195 regs[BPF_REG_0].btf_id = ret_btf_id;
5197 verbose(env, "unknown return type %d of func %s#%d\n",
5198 fn->ret_type, func_id_name(func_id), func_id);
5202 if (is_ptr_cast_function(func_id)) {
5203 /* For release_reference() */
5204 regs[BPF_REG_0].ref_obj_id = meta.ref_obj_id;
5205 } else if (is_acquire_function(func_id, meta.map_ptr)) {
5206 int id = acquire_reference_state(env, insn_idx);
5210 /* For mark_ptr_or_null_reg() */
5211 regs[BPF_REG_0].id = id;
5212 /* For release_reference() */
5213 regs[BPF_REG_0].ref_obj_id = id;
5216 do_refine_retval_range(regs, fn->ret_type, func_id, &meta);
5218 err = check_map_func_compatibility(env, meta.map_ptr, func_id);
5222 if ((func_id == BPF_FUNC_get_stack ||
5223 func_id == BPF_FUNC_get_task_stack) &&
5224 !env->prog->has_callchain_buf) {
5225 const char *err_str;
5227 #ifdef CONFIG_PERF_EVENTS
5228 err = get_callchain_buffers(sysctl_perf_event_max_stack);
5229 err_str = "cannot get callchain buffer for func %s#%d\n";
5232 err_str = "func %s#%d not supported without CONFIG_PERF_EVENTS\n";
5235 verbose(env, err_str, func_id_name(func_id), func_id);
5239 env->prog->has_callchain_buf = true;
5242 if (func_id == BPF_FUNC_get_stackid || func_id == BPF_FUNC_get_stack)
5243 env->prog->call_get_stack = true;
5246 clear_all_pkt_pointers(env);
5250 static bool signed_add_overflows(s64 a, s64 b)
5252 /* Do the add in u64, where overflow is well-defined */
5253 s64 res = (s64)((u64)a + (u64)b);
5260 static bool signed_add32_overflows(s64 a, s64 b)
5262 /* Do the add in u32, where overflow is well-defined */
5263 s32 res = (s32)((u32)a + (u32)b);
5270 static bool signed_sub_overflows(s32 a, s32 b)
5272 /* Do the sub in u64, where overflow is well-defined */
5273 s64 res = (s64)((u64)a - (u64)b);
5280 static bool signed_sub32_overflows(s32 a, s32 b)
5282 /* Do the sub in u64, where overflow is well-defined */
5283 s32 res = (s32)((u32)a - (u32)b);
5290 static bool check_reg_sane_offset(struct bpf_verifier_env *env,
5291 const struct bpf_reg_state *reg,
5292 enum bpf_reg_type type)
5294 bool known = tnum_is_const(reg->var_off);
5295 s64 val = reg->var_off.value;
5296 s64 smin = reg->smin_value;
5298 if (known && (val >= BPF_MAX_VAR_OFF || val <= -BPF_MAX_VAR_OFF)) {
5299 verbose(env, "math between %s pointer and %lld is not allowed\n",
5300 reg_type_str[type], val);
5304 if (reg->off >= BPF_MAX_VAR_OFF || reg->off <= -BPF_MAX_VAR_OFF) {
5305 verbose(env, "%s pointer offset %d is not allowed\n",
5306 reg_type_str[type], reg->off);
5310 if (smin == S64_MIN) {
5311 verbose(env, "math between %s pointer and register with unbounded min value is not allowed\n",
5312 reg_type_str[type]);
5316 if (smin >= BPF_MAX_VAR_OFF || smin <= -BPF_MAX_VAR_OFF) {
5317 verbose(env, "value %lld makes %s pointer be out of bounds\n",
5318 smin, reg_type_str[type]);
5325 static struct bpf_insn_aux_data *cur_aux(struct bpf_verifier_env *env)
5327 return &env->insn_aux_data[env->insn_idx];
5330 static int retrieve_ptr_limit(const struct bpf_reg_state *ptr_reg,
5331 u32 *ptr_limit, u8 opcode, bool off_is_neg)
5333 bool mask_to_left = (opcode == BPF_ADD && off_is_neg) ||
5334 (opcode == BPF_SUB && !off_is_neg);
5337 switch (ptr_reg->type) {
5339 /* Indirect variable offset stack access is prohibited in
5340 * unprivileged mode so it's not handled here.
5342 off = ptr_reg->off + ptr_reg->var_off.value;
5344 *ptr_limit = MAX_BPF_STACK + off;
5348 case PTR_TO_MAP_VALUE:
5350 *ptr_limit = ptr_reg->umax_value + ptr_reg->off;
5352 off = ptr_reg->smin_value + ptr_reg->off;
5353 *ptr_limit = ptr_reg->map_ptr->value_size - off;
5361 static bool can_skip_alu_sanitation(const struct bpf_verifier_env *env,
5362 const struct bpf_insn *insn)
5364 return env->bypass_spec_v1 || BPF_SRC(insn->code) == BPF_K;
5367 static int update_alu_sanitation_state(struct bpf_insn_aux_data *aux,
5368 u32 alu_state, u32 alu_limit)
5370 /* If we arrived here from different branches with different
5371 * state or limits to sanitize, then this won't work.
5373 if (aux->alu_state &&
5374 (aux->alu_state != alu_state ||
5375 aux->alu_limit != alu_limit))
5378 /* Corresponding fixup done in fixup_bpf_calls(). */
5379 aux->alu_state = alu_state;
5380 aux->alu_limit = alu_limit;
5384 static int sanitize_val_alu(struct bpf_verifier_env *env,
5385 struct bpf_insn *insn)
5387 struct bpf_insn_aux_data *aux = cur_aux(env);
5389 if (can_skip_alu_sanitation(env, insn))
5392 return update_alu_sanitation_state(aux, BPF_ALU_NON_POINTER, 0);
5395 static int sanitize_ptr_alu(struct bpf_verifier_env *env,
5396 struct bpf_insn *insn,
5397 const struct bpf_reg_state *ptr_reg,
5398 struct bpf_reg_state *dst_reg,
5401 struct bpf_verifier_state *vstate = env->cur_state;
5402 struct bpf_insn_aux_data *aux = cur_aux(env);
5403 bool ptr_is_dst_reg = ptr_reg == dst_reg;
5404 u8 opcode = BPF_OP(insn->code);
5405 u32 alu_state, alu_limit;
5406 struct bpf_reg_state tmp;
5409 if (can_skip_alu_sanitation(env, insn))
5412 /* We already marked aux for masking from non-speculative
5413 * paths, thus we got here in the first place. We only care
5414 * to explore bad access from here.
5416 if (vstate->speculative)
5419 alu_state = off_is_neg ? BPF_ALU_NEG_VALUE : 0;
5420 alu_state |= ptr_is_dst_reg ?
5421 BPF_ALU_SANITIZE_SRC : BPF_ALU_SANITIZE_DST;
5423 if (retrieve_ptr_limit(ptr_reg, &alu_limit, opcode, off_is_neg))
5425 if (update_alu_sanitation_state(aux, alu_state, alu_limit))
5428 /* Simulate and find potential out-of-bounds access under
5429 * speculative execution from truncation as a result of
5430 * masking when off was not within expected range. If off
5431 * sits in dst, then we temporarily need to move ptr there
5432 * to simulate dst (== 0) +/-= ptr. Needed, for example,
5433 * for cases where we use K-based arithmetic in one direction
5434 * and truncated reg-based in the other in order to explore
5437 if (!ptr_is_dst_reg) {
5439 *dst_reg = *ptr_reg;
5441 ret = push_stack(env, env->insn_idx + 1, env->insn_idx, true);
5442 if (!ptr_is_dst_reg && ret)
5444 return !ret ? -EFAULT : 0;
5447 /* Handles arithmetic on a pointer and a scalar: computes new min/max and var_off.
5448 * Caller should also handle BPF_MOV case separately.
5449 * If we return -EACCES, caller may want to try again treating pointer as a
5450 * scalar. So we only emit a diagnostic if !env->allow_ptr_leaks.
5452 static int adjust_ptr_min_max_vals(struct bpf_verifier_env *env,
5453 struct bpf_insn *insn,
5454 const struct bpf_reg_state *ptr_reg,
5455 const struct bpf_reg_state *off_reg)
5457 struct bpf_verifier_state *vstate = env->cur_state;
5458 struct bpf_func_state *state = vstate->frame[vstate->curframe];
5459 struct bpf_reg_state *regs = state->regs, *dst_reg;
5460 bool known = tnum_is_const(off_reg->var_off);
5461 s64 smin_val = off_reg->smin_value, smax_val = off_reg->smax_value,
5462 smin_ptr = ptr_reg->smin_value, smax_ptr = ptr_reg->smax_value;
5463 u64 umin_val = off_reg->umin_value, umax_val = off_reg->umax_value,
5464 umin_ptr = ptr_reg->umin_value, umax_ptr = ptr_reg->umax_value;
5465 u32 dst = insn->dst_reg, src = insn->src_reg;
5466 u8 opcode = BPF_OP(insn->code);
5469 dst_reg = ®s[dst];
5471 if ((known && (smin_val != smax_val || umin_val != umax_val)) ||
5472 smin_val > smax_val || umin_val > umax_val) {
5473 /* Taint dst register if offset had invalid bounds derived from
5474 * e.g. dead branches.
5476 __mark_reg_unknown(env, dst_reg);
5480 if (BPF_CLASS(insn->code) != BPF_ALU64) {
5481 /* 32-bit ALU ops on pointers produce (meaningless) scalars */
5482 if (opcode == BPF_SUB && env->allow_ptr_leaks) {
5483 __mark_reg_unknown(env, dst_reg);
5488 "R%d 32-bit pointer arithmetic prohibited\n",
5493 switch (ptr_reg->type) {
5494 case PTR_TO_MAP_VALUE_OR_NULL:
5495 verbose(env, "R%d pointer arithmetic on %s prohibited, null-check it first\n",
5496 dst, reg_type_str[ptr_reg->type]);
5498 case CONST_PTR_TO_MAP:
5499 /* smin_val represents the known value */
5500 if (known && smin_val == 0 && opcode == BPF_ADD)
5503 case PTR_TO_PACKET_END:
5505 case PTR_TO_SOCKET_OR_NULL:
5506 case PTR_TO_SOCK_COMMON:
5507 case PTR_TO_SOCK_COMMON_OR_NULL:
5508 case PTR_TO_TCP_SOCK:
5509 case PTR_TO_TCP_SOCK_OR_NULL:
5510 case PTR_TO_XDP_SOCK:
5511 verbose(env, "R%d pointer arithmetic on %s prohibited\n",
5512 dst, reg_type_str[ptr_reg->type]);
5514 case PTR_TO_MAP_VALUE:
5515 if (!env->allow_ptr_leaks && !known && (smin_val < 0) != (smax_val < 0)) {
5516 verbose(env, "R%d has unknown scalar with mixed signed bounds, pointer arithmetic with it prohibited for !root\n",
5517 off_reg == dst_reg ? dst : src);
5525 /* In case of 'scalar += pointer', dst_reg inherits pointer type and id.
5526 * The id may be overwritten later if we create a new variable offset.
5528 dst_reg->type = ptr_reg->type;
5529 dst_reg->id = ptr_reg->id;
5531 if (!check_reg_sane_offset(env, off_reg, ptr_reg->type) ||
5532 !check_reg_sane_offset(env, ptr_reg, ptr_reg->type))
5535 /* pointer types do not carry 32-bit bounds at the moment. */
5536 __mark_reg32_unbounded(dst_reg);
5540 ret = sanitize_ptr_alu(env, insn, ptr_reg, dst_reg, smin_val < 0);
5542 verbose(env, "R%d tried to add from different maps or paths\n", dst);
5545 /* We can take a fixed offset as long as it doesn't overflow
5546 * the s32 'off' field
5548 if (known && (ptr_reg->off + smin_val ==
5549 (s64)(s32)(ptr_reg->off + smin_val))) {
5550 /* pointer += K. Accumulate it into fixed offset */
5551 dst_reg->smin_value = smin_ptr;
5552 dst_reg->smax_value = smax_ptr;
5553 dst_reg->umin_value = umin_ptr;
5554 dst_reg->umax_value = umax_ptr;
5555 dst_reg->var_off = ptr_reg->var_off;
5556 dst_reg->off = ptr_reg->off + smin_val;
5557 dst_reg->raw = ptr_reg->raw;
5560 /* A new variable offset is created. Note that off_reg->off
5561 * == 0, since it's a scalar.
5562 * dst_reg gets the pointer type and since some positive
5563 * integer value was added to the pointer, give it a new 'id'
5564 * if it's a PTR_TO_PACKET.
5565 * this creates a new 'base' pointer, off_reg (variable) gets
5566 * added into the variable offset, and we copy the fixed offset
5569 if (signed_add_overflows(smin_ptr, smin_val) ||
5570 signed_add_overflows(smax_ptr, smax_val)) {
5571 dst_reg->smin_value = S64_MIN;
5572 dst_reg->smax_value = S64_MAX;
5574 dst_reg->smin_value = smin_ptr + smin_val;
5575 dst_reg->smax_value = smax_ptr + smax_val;
5577 if (umin_ptr + umin_val < umin_ptr ||
5578 umax_ptr + umax_val < umax_ptr) {
5579 dst_reg->umin_value = 0;
5580 dst_reg->umax_value = U64_MAX;
5582 dst_reg->umin_value = umin_ptr + umin_val;
5583 dst_reg->umax_value = umax_ptr + umax_val;
5585 dst_reg->var_off = tnum_add(ptr_reg->var_off, off_reg->var_off);
5586 dst_reg->off = ptr_reg->off;
5587 dst_reg->raw = ptr_reg->raw;
5588 if (reg_is_pkt_pointer(ptr_reg)) {
5589 dst_reg->id = ++env->id_gen;
5590 /* something was added to pkt_ptr, set range to zero */
5595 ret = sanitize_ptr_alu(env, insn, ptr_reg, dst_reg, smin_val < 0);
5597 verbose(env, "R%d tried to sub from different maps or paths\n", dst);
5600 if (dst_reg == off_reg) {
5601 /* scalar -= pointer. Creates an unknown scalar */
5602 verbose(env, "R%d tried to subtract pointer from scalar\n",
5606 /* We don't allow subtraction from FP, because (according to
5607 * test_verifier.c test "invalid fp arithmetic", JITs might not
5608 * be able to deal with it.
5610 if (ptr_reg->type == PTR_TO_STACK) {
5611 verbose(env, "R%d subtraction from stack pointer prohibited\n",
5615 if (known && (ptr_reg->off - smin_val ==
5616 (s64)(s32)(ptr_reg->off - smin_val))) {
5617 /* pointer -= K. Subtract it from fixed offset */
5618 dst_reg->smin_value = smin_ptr;
5619 dst_reg->smax_value = smax_ptr;
5620 dst_reg->umin_value = umin_ptr;
5621 dst_reg->umax_value = umax_ptr;
5622 dst_reg->var_off = ptr_reg->var_off;
5623 dst_reg->id = ptr_reg->id;
5624 dst_reg->off = ptr_reg->off - smin_val;
5625 dst_reg->raw = ptr_reg->raw;
5628 /* A new variable offset is created. If the subtrahend is known
5629 * nonnegative, then any reg->range we had before is still good.
5631 if (signed_sub_overflows(smin_ptr, smax_val) ||
5632 signed_sub_overflows(smax_ptr, smin_val)) {
5633 /* Overflow possible, we know nothing */
5634 dst_reg->smin_value = S64_MIN;
5635 dst_reg->smax_value = S64_MAX;
5637 dst_reg->smin_value = smin_ptr - smax_val;
5638 dst_reg->smax_value = smax_ptr - smin_val;
5640 if (umin_ptr < umax_val) {
5641 /* Overflow possible, we know nothing */
5642 dst_reg->umin_value = 0;
5643 dst_reg->umax_value = U64_MAX;
5645 /* Cannot overflow (as long as bounds are consistent) */
5646 dst_reg->umin_value = umin_ptr - umax_val;
5647 dst_reg->umax_value = umax_ptr - umin_val;
5649 dst_reg->var_off = tnum_sub(ptr_reg->var_off, off_reg->var_off);
5650 dst_reg->off = ptr_reg->off;
5651 dst_reg->raw = ptr_reg->raw;
5652 if (reg_is_pkt_pointer(ptr_reg)) {
5653 dst_reg->id = ++env->id_gen;
5654 /* something was added to pkt_ptr, set range to zero */
5662 /* bitwise ops on pointers are troublesome, prohibit. */
5663 verbose(env, "R%d bitwise operator %s on pointer prohibited\n",
5664 dst, bpf_alu_string[opcode >> 4]);
5667 /* other operators (e.g. MUL,LSH) produce non-pointer results */
5668 verbose(env, "R%d pointer arithmetic with %s operator prohibited\n",
5669 dst, bpf_alu_string[opcode >> 4]);
5673 if (!check_reg_sane_offset(env, dst_reg, ptr_reg->type))
5676 __update_reg_bounds(dst_reg);
5677 __reg_deduce_bounds(dst_reg);
5678 __reg_bound_offset(dst_reg);
5680 /* For unprivileged we require that resulting offset must be in bounds
5681 * in order to be able to sanitize access later on.
5683 if (!env->bypass_spec_v1) {
5684 if (dst_reg->type == PTR_TO_MAP_VALUE &&
5685 check_map_access(env, dst, dst_reg->off, 1, false)) {
5686 verbose(env, "R%d pointer arithmetic of map value goes out of range, "
5687 "prohibited for !root\n", dst);
5689 } else if (dst_reg->type == PTR_TO_STACK &&
5690 check_stack_access(env, dst_reg, dst_reg->off +
5691 dst_reg->var_off.value, 1)) {
5692 verbose(env, "R%d stack pointer arithmetic goes out of range, "
5693 "prohibited for !root\n", dst);
5701 static void scalar32_min_max_add(struct bpf_reg_state *dst_reg,
5702 struct bpf_reg_state *src_reg)
5704 s32 smin_val = src_reg->s32_min_value;
5705 s32 smax_val = src_reg->s32_max_value;
5706 u32 umin_val = src_reg->u32_min_value;
5707 u32 umax_val = src_reg->u32_max_value;
5709 if (signed_add32_overflows(dst_reg->s32_min_value, smin_val) ||
5710 signed_add32_overflows(dst_reg->s32_max_value, smax_val)) {
5711 dst_reg->s32_min_value = S32_MIN;
5712 dst_reg->s32_max_value = S32_MAX;
5714 dst_reg->s32_min_value += smin_val;
5715 dst_reg->s32_max_value += smax_val;
5717 if (dst_reg->u32_min_value + umin_val < umin_val ||
5718 dst_reg->u32_max_value + umax_val < umax_val) {
5719 dst_reg->u32_min_value = 0;
5720 dst_reg->u32_max_value = U32_MAX;
5722 dst_reg->u32_min_value += umin_val;
5723 dst_reg->u32_max_value += umax_val;
5727 static void scalar_min_max_add(struct bpf_reg_state *dst_reg,
5728 struct bpf_reg_state *src_reg)
5730 s64 smin_val = src_reg->smin_value;
5731 s64 smax_val = src_reg->smax_value;
5732 u64 umin_val = src_reg->umin_value;
5733 u64 umax_val = src_reg->umax_value;
5735 if (signed_add_overflows(dst_reg->smin_value, smin_val) ||
5736 signed_add_overflows(dst_reg->smax_value, smax_val)) {
5737 dst_reg->smin_value = S64_MIN;
5738 dst_reg->smax_value = S64_MAX;
5740 dst_reg->smin_value += smin_val;
5741 dst_reg->smax_value += smax_val;
5743 if (dst_reg->umin_value + umin_val < umin_val ||
5744 dst_reg->umax_value + umax_val < umax_val) {
5745 dst_reg->umin_value = 0;
5746 dst_reg->umax_value = U64_MAX;
5748 dst_reg->umin_value += umin_val;
5749 dst_reg->umax_value += umax_val;
5753 static void scalar32_min_max_sub(struct bpf_reg_state *dst_reg,
5754 struct bpf_reg_state *src_reg)
5756 s32 smin_val = src_reg->s32_min_value;
5757 s32 smax_val = src_reg->s32_max_value;
5758 u32 umin_val = src_reg->u32_min_value;
5759 u32 umax_val = src_reg->u32_max_value;
5761 if (signed_sub32_overflows(dst_reg->s32_min_value, smax_val) ||
5762 signed_sub32_overflows(dst_reg->s32_max_value, smin_val)) {
5763 /* Overflow possible, we know nothing */
5764 dst_reg->s32_min_value = S32_MIN;
5765 dst_reg->s32_max_value = S32_MAX;
5767 dst_reg->s32_min_value -= smax_val;
5768 dst_reg->s32_max_value -= smin_val;
5770 if (dst_reg->u32_min_value < umax_val) {
5771 /* Overflow possible, we know nothing */
5772 dst_reg->u32_min_value = 0;
5773 dst_reg->u32_max_value = U32_MAX;
5775 /* Cannot overflow (as long as bounds are consistent) */
5776 dst_reg->u32_min_value -= umax_val;
5777 dst_reg->u32_max_value -= umin_val;
5781 static void scalar_min_max_sub(struct bpf_reg_state *dst_reg,
5782 struct bpf_reg_state *src_reg)
5784 s64 smin_val = src_reg->smin_value;
5785 s64 smax_val = src_reg->smax_value;
5786 u64 umin_val = src_reg->umin_value;
5787 u64 umax_val = src_reg->umax_value;
5789 if (signed_sub_overflows(dst_reg->smin_value, smax_val) ||
5790 signed_sub_overflows(dst_reg->smax_value, smin_val)) {
5791 /* Overflow possible, we know nothing */
5792 dst_reg->smin_value = S64_MIN;
5793 dst_reg->smax_value = S64_MAX;
5795 dst_reg->smin_value -= smax_val;
5796 dst_reg->smax_value -= smin_val;
5798 if (dst_reg->umin_value < umax_val) {
5799 /* Overflow possible, we know nothing */
5800 dst_reg->umin_value = 0;
5801 dst_reg->umax_value = U64_MAX;
5803 /* Cannot overflow (as long as bounds are consistent) */
5804 dst_reg->umin_value -= umax_val;
5805 dst_reg->umax_value -= umin_val;
5809 static void scalar32_min_max_mul(struct bpf_reg_state *dst_reg,
5810 struct bpf_reg_state *src_reg)
5812 s32 smin_val = src_reg->s32_min_value;
5813 u32 umin_val = src_reg->u32_min_value;
5814 u32 umax_val = src_reg->u32_max_value;
5816 if (smin_val < 0 || dst_reg->s32_min_value < 0) {
5817 /* Ain't nobody got time to multiply that sign */
5818 __mark_reg32_unbounded(dst_reg);
5821 /* Both values are positive, so we can work with unsigned and
5822 * copy the result to signed (unless it exceeds S32_MAX).
5824 if (umax_val > U16_MAX || dst_reg->u32_max_value > U16_MAX) {
5825 /* Potential overflow, we know nothing */
5826 __mark_reg32_unbounded(dst_reg);
5829 dst_reg->u32_min_value *= umin_val;
5830 dst_reg->u32_max_value *= umax_val;
5831 if (dst_reg->u32_max_value > S32_MAX) {
5832 /* Overflow possible, we know nothing */
5833 dst_reg->s32_min_value = S32_MIN;
5834 dst_reg->s32_max_value = S32_MAX;
5836 dst_reg->s32_min_value = dst_reg->u32_min_value;
5837 dst_reg->s32_max_value = dst_reg->u32_max_value;
5841 static void scalar_min_max_mul(struct bpf_reg_state *dst_reg,
5842 struct bpf_reg_state *src_reg)
5844 s64 smin_val = src_reg->smin_value;
5845 u64 umin_val = src_reg->umin_value;
5846 u64 umax_val = src_reg->umax_value;
5848 if (smin_val < 0 || dst_reg->smin_value < 0) {
5849 /* Ain't nobody got time to multiply that sign */
5850 __mark_reg64_unbounded(dst_reg);
5853 /* Both values are positive, so we can work with unsigned and
5854 * copy the result to signed (unless it exceeds S64_MAX).
5856 if (umax_val > U32_MAX || dst_reg->umax_value > U32_MAX) {
5857 /* Potential overflow, we know nothing */
5858 __mark_reg64_unbounded(dst_reg);
5861 dst_reg->umin_value *= umin_val;
5862 dst_reg->umax_value *= umax_val;
5863 if (dst_reg->umax_value > S64_MAX) {
5864 /* Overflow possible, we know nothing */
5865 dst_reg->smin_value = S64_MIN;
5866 dst_reg->smax_value = S64_MAX;
5868 dst_reg->smin_value = dst_reg->umin_value;
5869 dst_reg->smax_value = dst_reg->umax_value;
5873 static void scalar32_min_max_and(struct bpf_reg_state *dst_reg,
5874 struct bpf_reg_state *src_reg)
5876 bool src_known = tnum_subreg_is_const(src_reg->var_off);
5877 bool dst_known = tnum_subreg_is_const(dst_reg->var_off);
5878 struct tnum var32_off = tnum_subreg(dst_reg->var_off);
5879 s32 smin_val = src_reg->s32_min_value;
5880 u32 umax_val = src_reg->u32_max_value;
5882 /* Assuming scalar64_min_max_and will be called so its safe
5883 * to skip updating register for known 32-bit case.
5885 if (src_known && dst_known)
5888 /* We get our minimum from the var_off, since that's inherently
5889 * bitwise. Our maximum is the minimum of the operands' maxima.
5891 dst_reg->u32_min_value = var32_off.value;
5892 dst_reg->u32_max_value = min(dst_reg->u32_max_value, umax_val);
5893 if (dst_reg->s32_min_value < 0 || smin_val < 0) {
5894 /* Lose signed bounds when ANDing negative numbers,
5895 * ain't nobody got time for that.
5897 dst_reg->s32_min_value = S32_MIN;
5898 dst_reg->s32_max_value = S32_MAX;
5900 /* ANDing two positives gives a positive, so safe to
5901 * cast result into s64.
5903 dst_reg->s32_min_value = dst_reg->u32_min_value;
5904 dst_reg->s32_max_value = dst_reg->u32_max_value;
5909 static void scalar_min_max_and(struct bpf_reg_state *dst_reg,
5910 struct bpf_reg_state *src_reg)
5912 bool src_known = tnum_is_const(src_reg->var_off);
5913 bool dst_known = tnum_is_const(dst_reg->var_off);
5914 s64 smin_val = src_reg->smin_value;
5915 u64 umax_val = src_reg->umax_value;
5917 if (src_known && dst_known) {
5918 __mark_reg_known(dst_reg, dst_reg->var_off.value);
5922 /* We get our minimum from the var_off, since that's inherently
5923 * bitwise. Our maximum is the minimum of the operands' maxima.
5925 dst_reg->umin_value = dst_reg->var_off.value;
5926 dst_reg->umax_value = min(dst_reg->umax_value, umax_val);
5927 if (dst_reg->smin_value < 0 || smin_val < 0) {
5928 /* Lose signed bounds when ANDing negative numbers,
5929 * ain't nobody got time for that.
5931 dst_reg->smin_value = S64_MIN;
5932 dst_reg->smax_value = S64_MAX;
5934 /* ANDing two positives gives a positive, so safe to
5935 * cast result into s64.
5937 dst_reg->smin_value = dst_reg->umin_value;
5938 dst_reg->smax_value = dst_reg->umax_value;
5940 /* We may learn something more from the var_off */
5941 __update_reg_bounds(dst_reg);
5944 static void scalar32_min_max_or(struct bpf_reg_state *dst_reg,
5945 struct bpf_reg_state *src_reg)
5947 bool src_known = tnum_subreg_is_const(src_reg->var_off);
5948 bool dst_known = tnum_subreg_is_const(dst_reg->var_off);
5949 struct tnum var32_off = tnum_subreg(dst_reg->var_off);
5950 s32 smin_val = src_reg->s32_min_value;
5951 u32 umin_val = src_reg->u32_min_value;
5953 /* Assuming scalar64_min_max_or will be called so it is safe
5954 * to skip updating register for known case.
5956 if (src_known && dst_known)
5959 /* We get our maximum from the var_off, and our minimum is the
5960 * maximum of the operands' minima
5962 dst_reg->u32_min_value = max(dst_reg->u32_min_value, umin_val);
5963 dst_reg->u32_max_value = var32_off.value | var32_off.mask;
5964 if (dst_reg->s32_min_value < 0 || smin_val < 0) {
5965 /* Lose signed bounds when ORing negative numbers,
5966 * ain't nobody got time for that.
5968 dst_reg->s32_min_value = S32_MIN;
5969 dst_reg->s32_max_value = S32_MAX;
5971 /* ORing two positives gives a positive, so safe to
5972 * cast result into s64.
5974 dst_reg->s32_min_value = dst_reg->u32_min_value;
5975 dst_reg->s32_max_value = dst_reg->u32_max_value;
5979 static void scalar_min_max_or(struct bpf_reg_state *dst_reg,
5980 struct bpf_reg_state *src_reg)
5982 bool src_known = tnum_is_const(src_reg->var_off);
5983 bool dst_known = tnum_is_const(dst_reg->var_off);
5984 s64 smin_val = src_reg->smin_value;
5985 u64 umin_val = src_reg->umin_value;
5987 if (src_known && dst_known) {
5988 __mark_reg_known(dst_reg, dst_reg->var_off.value);
5992 /* We get our maximum from the var_off, and our minimum is the
5993 * maximum of the operands' minima
5995 dst_reg->umin_value = max(dst_reg->umin_value, umin_val);
5996 dst_reg->umax_value = dst_reg->var_off.value | dst_reg->var_off.mask;
5997 if (dst_reg->smin_value < 0 || smin_val < 0) {
5998 /* Lose signed bounds when ORing negative numbers,
5999 * ain't nobody got time for that.
6001 dst_reg->smin_value = S64_MIN;
6002 dst_reg->smax_value = S64_MAX;
6004 /* ORing two positives gives a positive, so safe to
6005 * cast result into s64.
6007 dst_reg->smin_value = dst_reg->umin_value;
6008 dst_reg->smax_value = dst_reg->umax_value;
6010 /* We may learn something more from the var_off */
6011 __update_reg_bounds(dst_reg);
6014 static void scalar32_min_max_xor(struct bpf_reg_state *dst_reg,
6015 struct bpf_reg_state *src_reg)
6017 bool src_known = tnum_subreg_is_const(src_reg->var_off);
6018 bool dst_known = tnum_subreg_is_const(dst_reg->var_off);
6019 struct tnum var32_off = tnum_subreg(dst_reg->var_off);
6020 s32 smin_val = src_reg->s32_min_value;
6022 /* Assuming scalar64_min_max_xor will be called so it is safe
6023 * to skip updating register for known case.
6025 if (src_known && dst_known)
6028 /* We get both minimum and maximum from the var32_off. */
6029 dst_reg->u32_min_value = var32_off.value;
6030 dst_reg->u32_max_value = var32_off.value | var32_off.mask;
6032 if (dst_reg->s32_min_value >= 0 && smin_val >= 0) {
6033 /* XORing two positive sign numbers gives a positive,
6034 * so safe to cast u32 result into s32.
6036 dst_reg->s32_min_value = dst_reg->u32_min_value;
6037 dst_reg->s32_max_value = dst_reg->u32_max_value;
6039 dst_reg->s32_min_value = S32_MIN;
6040 dst_reg->s32_max_value = S32_MAX;
6044 static void scalar_min_max_xor(struct bpf_reg_state *dst_reg,
6045 struct bpf_reg_state *src_reg)
6047 bool src_known = tnum_is_const(src_reg->var_off);
6048 bool dst_known = tnum_is_const(dst_reg->var_off);
6049 s64 smin_val = src_reg->smin_value;
6051 if (src_known && dst_known) {
6052 /* dst_reg->var_off.value has been updated earlier */
6053 __mark_reg_known(dst_reg, dst_reg->var_off.value);
6057 /* We get both minimum and maximum from the var_off. */
6058 dst_reg->umin_value = dst_reg->var_off.value;
6059 dst_reg->umax_value = dst_reg->var_off.value | dst_reg->var_off.mask;
6061 if (dst_reg->smin_value >= 0 && smin_val >= 0) {
6062 /* XORing two positive sign numbers gives a positive,
6063 * so safe to cast u64 result into s64.
6065 dst_reg->smin_value = dst_reg->umin_value;
6066 dst_reg->smax_value = dst_reg->umax_value;
6068 dst_reg->smin_value = S64_MIN;
6069 dst_reg->smax_value = S64_MAX;
6072 __update_reg_bounds(dst_reg);
6075 static void __scalar32_min_max_lsh(struct bpf_reg_state *dst_reg,
6076 u64 umin_val, u64 umax_val)
6078 /* We lose all sign bit information (except what we can pick
6081 dst_reg->s32_min_value = S32_MIN;
6082 dst_reg->s32_max_value = S32_MAX;
6083 /* If we might shift our top bit out, then we know nothing */
6084 if (umax_val > 31 || dst_reg->u32_max_value > 1ULL << (31 - umax_val)) {
6085 dst_reg->u32_min_value = 0;
6086 dst_reg->u32_max_value = U32_MAX;
6088 dst_reg->u32_min_value <<= umin_val;
6089 dst_reg->u32_max_value <<= umax_val;
6093 static void scalar32_min_max_lsh(struct bpf_reg_state *dst_reg,
6094 struct bpf_reg_state *src_reg)
6096 u32 umax_val = src_reg->u32_max_value;
6097 u32 umin_val = src_reg->u32_min_value;
6098 /* u32 alu operation will zext upper bits */
6099 struct tnum subreg = tnum_subreg(dst_reg->var_off);
6101 __scalar32_min_max_lsh(dst_reg, umin_val, umax_val);
6102 dst_reg->var_off = tnum_subreg(tnum_lshift(subreg, umin_val));
6103 /* Not required but being careful mark reg64 bounds as unknown so
6104 * that we are forced to pick them up from tnum and zext later and
6105 * if some path skips this step we are still safe.
6107 __mark_reg64_unbounded(dst_reg);
6108 __update_reg32_bounds(dst_reg);
6111 static void __scalar64_min_max_lsh(struct bpf_reg_state *dst_reg,
6112 u64 umin_val, u64 umax_val)
6114 /* Special case <<32 because it is a common compiler pattern to sign
6115 * extend subreg by doing <<32 s>>32. In this case if 32bit bounds are
6116 * positive we know this shift will also be positive so we can track
6117 * bounds correctly. Otherwise we lose all sign bit information except
6118 * what we can pick up from var_off. Perhaps we can generalize this
6119 * later to shifts of any length.
6121 if (umin_val == 32 && umax_val == 32 && dst_reg->s32_max_value >= 0)
6122 dst_reg->smax_value = (s64)dst_reg->s32_max_value << 32;
6124 dst_reg->smax_value = S64_MAX;
6126 if (umin_val == 32 && umax_val == 32 && dst_reg->s32_min_value >= 0)
6127 dst_reg->smin_value = (s64)dst_reg->s32_min_value << 32;
6129 dst_reg->smin_value = S64_MIN;
6131 /* If we might shift our top bit out, then we know nothing */
6132 if (dst_reg->umax_value > 1ULL << (63 - umax_val)) {
6133 dst_reg->umin_value = 0;
6134 dst_reg->umax_value = U64_MAX;
6136 dst_reg->umin_value <<= umin_val;
6137 dst_reg->umax_value <<= umax_val;
6141 static void scalar_min_max_lsh(struct bpf_reg_state *dst_reg,
6142 struct bpf_reg_state *src_reg)
6144 u64 umax_val = src_reg->umax_value;
6145 u64 umin_val = src_reg->umin_value;
6147 /* scalar64 calc uses 32bit unshifted bounds so must be called first */
6148 __scalar64_min_max_lsh(dst_reg, umin_val, umax_val);
6149 __scalar32_min_max_lsh(dst_reg, umin_val, umax_val);
6151 dst_reg->var_off = tnum_lshift(dst_reg->var_off, umin_val);
6152 /* We may learn something more from the var_off */
6153 __update_reg_bounds(dst_reg);
6156 static void scalar32_min_max_rsh(struct bpf_reg_state *dst_reg,
6157 struct bpf_reg_state *src_reg)
6159 struct tnum subreg = tnum_subreg(dst_reg->var_off);
6160 u32 umax_val = src_reg->u32_max_value;
6161 u32 umin_val = src_reg->u32_min_value;
6163 /* BPF_RSH is an unsigned shift. If the value in dst_reg might
6164 * be negative, then either:
6165 * 1) src_reg might be zero, so the sign bit of the result is
6166 * unknown, so we lose our signed bounds
6167 * 2) it's known negative, thus the unsigned bounds capture the
6169 * 3) the signed bounds cross zero, so they tell us nothing
6171 * If the value in dst_reg is known nonnegative, then again the
6172 * unsigned bounts capture the signed bounds.
6173 * Thus, in all cases it suffices to blow away our signed bounds
6174 * and rely on inferring new ones from the unsigned bounds and
6175 * var_off of the result.
6177 dst_reg->s32_min_value = S32_MIN;
6178 dst_reg->s32_max_value = S32_MAX;
6180 dst_reg->var_off = tnum_rshift(subreg, umin_val);
6181 dst_reg->u32_min_value >>= umax_val;
6182 dst_reg->u32_max_value >>= umin_val;
6184 __mark_reg64_unbounded(dst_reg);
6185 __update_reg32_bounds(dst_reg);
6188 static void scalar_min_max_rsh(struct bpf_reg_state *dst_reg,
6189 struct bpf_reg_state *src_reg)
6191 u64 umax_val = src_reg->umax_value;
6192 u64 umin_val = src_reg->umin_value;
6194 /* BPF_RSH is an unsigned shift. If the value in dst_reg might
6195 * be negative, then either:
6196 * 1) src_reg might be zero, so the sign bit of the result is
6197 * unknown, so we lose our signed bounds
6198 * 2) it's known negative, thus the unsigned bounds capture the
6200 * 3) the signed bounds cross zero, so they tell us nothing
6202 * If the value in dst_reg is known nonnegative, then again the
6203 * unsigned bounts capture the signed bounds.
6204 * Thus, in all cases it suffices to blow away our signed bounds
6205 * and rely on inferring new ones from the unsigned bounds and
6206 * var_off of the result.
6208 dst_reg->smin_value = S64_MIN;
6209 dst_reg->smax_value = S64_MAX;
6210 dst_reg->var_off = tnum_rshift(dst_reg->var_off, umin_val);
6211 dst_reg->umin_value >>= umax_val;
6212 dst_reg->umax_value >>= umin_val;
6214 /* Its not easy to operate on alu32 bounds here because it depends
6215 * on bits being shifted in. Take easy way out and mark unbounded
6216 * so we can recalculate later from tnum.
6218 __mark_reg32_unbounded(dst_reg);
6219 __update_reg_bounds(dst_reg);
6222 static void scalar32_min_max_arsh(struct bpf_reg_state *dst_reg,
6223 struct bpf_reg_state *src_reg)
6225 u64 umin_val = src_reg->u32_min_value;
6227 /* Upon reaching here, src_known is true and
6228 * umax_val is equal to umin_val.
6230 dst_reg->s32_min_value = (u32)(((s32)dst_reg->s32_min_value) >> umin_val);
6231 dst_reg->s32_max_value = (u32)(((s32)dst_reg->s32_max_value) >> umin_val);
6233 dst_reg->var_off = tnum_arshift(tnum_subreg(dst_reg->var_off), umin_val, 32);
6235 /* blow away the dst_reg umin_value/umax_value and rely on
6236 * dst_reg var_off to refine the result.
6238 dst_reg->u32_min_value = 0;
6239 dst_reg->u32_max_value = U32_MAX;
6241 __mark_reg64_unbounded(dst_reg);
6242 __update_reg32_bounds(dst_reg);
6245 static void scalar_min_max_arsh(struct bpf_reg_state *dst_reg,
6246 struct bpf_reg_state *src_reg)
6248 u64 umin_val = src_reg->umin_value;
6250 /* Upon reaching here, src_known is true and umax_val is equal
6253 dst_reg->smin_value >>= umin_val;
6254 dst_reg->smax_value >>= umin_val;
6256 dst_reg->var_off = tnum_arshift(dst_reg->var_off, umin_val, 64);
6258 /* blow away the dst_reg umin_value/umax_value and rely on
6259 * dst_reg var_off to refine the result.
6261 dst_reg->umin_value = 0;
6262 dst_reg->umax_value = U64_MAX;
6264 /* Its not easy to operate on alu32 bounds here because it depends
6265 * on bits being shifted in from upper 32-bits. Take easy way out
6266 * and mark unbounded so we can recalculate later from tnum.
6268 __mark_reg32_unbounded(dst_reg);
6269 __update_reg_bounds(dst_reg);
6272 /* WARNING: This function does calculations on 64-bit values, but the actual
6273 * execution may occur on 32-bit values. Therefore, things like bitshifts
6274 * need extra checks in the 32-bit case.
6276 static int adjust_scalar_min_max_vals(struct bpf_verifier_env *env,
6277 struct bpf_insn *insn,
6278 struct bpf_reg_state *dst_reg,
6279 struct bpf_reg_state src_reg)
6281 struct bpf_reg_state *regs = cur_regs(env);
6282 u8 opcode = BPF_OP(insn->code);
6284 s64 smin_val, smax_val;
6285 u64 umin_val, umax_val;
6286 s32 s32_min_val, s32_max_val;
6287 u32 u32_min_val, u32_max_val;
6288 u64 insn_bitness = (BPF_CLASS(insn->code) == BPF_ALU64) ? 64 : 32;
6289 u32 dst = insn->dst_reg;
6291 bool alu32 = (BPF_CLASS(insn->code) != BPF_ALU64);
6293 smin_val = src_reg.smin_value;
6294 smax_val = src_reg.smax_value;
6295 umin_val = src_reg.umin_value;
6296 umax_val = src_reg.umax_value;
6298 s32_min_val = src_reg.s32_min_value;
6299 s32_max_val = src_reg.s32_max_value;
6300 u32_min_val = src_reg.u32_min_value;
6301 u32_max_val = src_reg.u32_max_value;
6304 src_known = tnum_subreg_is_const(src_reg.var_off);
6306 (s32_min_val != s32_max_val || u32_min_val != u32_max_val)) ||
6307 s32_min_val > s32_max_val || u32_min_val > u32_max_val) {
6308 /* Taint dst register if offset had invalid bounds
6309 * derived from e.g. dead branches.
6311 __mark_reg_unknown(env, dst_reg);
6315 src_known = tnum_is_const(src_reg.var_off);
6317 (smin_val != smax_val || umin_val != umax_val)) ||
6318 smin_val > smax_val || umin_val > umax_val) {
6319 /* Taint dst register if offset had invalid bounds
6320 * derived from e.g. dead branches.
6322 __mark_reg_unknown(env, dst_reg);
6328 opcode != BPF_ADD && opcode != BPF_SUB && opcode != BPF_AND) {
6329 __mark_reg_unknown(env, dst_reg);
6333 /* Calculate sign/unsigned bounds and tnum for alu32 and alu64 bit ops.
6334 * There are two classes of instructions: The first class we track both
6335 * alu32 and alu64 sign/unsigned bounds independently this provides the
6336 * greatest amount of precision when alu operations are mixed with jmp32
6337 * operations. These operations are BPF_ADD, BPF_SUB, BPF_MUL, BPF_ADD,
6338 * and BPF_OR. This is possible because these ops have fairly easy to
6339 * understand and calculate behavior in both 32-bit and 64-bit alu ops.
6340 * See alu32 verifier tests for examples. The second class of
6341 * operations, BPF_LSH, BPF_RSH, and BPF_ARSH, however are not so easy
6342 * with regards to tracking sign/unsigned bounds because the bits may
6343 * cross subreg boundaries in the alu64 case. When this happens we mark
6344 * the reg unbounded in the subreg bound space and use the resulting
6345 * tnum to calculate an approximation of the sign/unsigned bounds.
6349 ret = sanitize_val_alu(env, insn);
6351 verbose(env, "R%d tried to add from different pointers or scalars\n", dst);
6354 scalar32_min_max_add(dst_reg, &src_reg);
6355 scalar_min_max_add(dst_reg, &src_reg);
6356 dst_reg->var_off = tnum_add(dst_reg->var_off, src_reg.var_off);
6359 ret = sanitize_val_alu(env, insn);
6361 verbose(env, "R%d tried to sub from different pointers or scalars\n", dst);
6364 scalar32_min_max_sub(dst_reg, &src_reg);
6365 scalar_min_max_sub(dst_reg, &src_reg);
6366 dst_reg->var_off = tnum_sub(dst_reg->var_off, src_reg.var_off);
6369 dst_reg->var_off = tnum_mul(dst_reg->var_off, src_reg.var_off);
6370 scalar32_min_max_mul(dst_reg, &src_reg);
6371 scalar_min_max_mul(dst_reg, &src_reg);
6374 dst_reg->var_off = tnum_and(dst_reg->var_off, src_reg.var_off);
6375 scalar32_min_max_and(dst_reg, &src_reg);
6376 scalar_min_max_and(dst_reg, &src_reg);
6379 dst_reg->var_off = tnum_or(dst_reg->var_off, src_reg.var_off);
6380 scalar32_min_max_or(dst_reg, &src_reg);
6381 scalar_min_max_or(dst_reg, &src_reg);
6384 dst_reg->var_off = tnum_xor(dst_reg->var_off, src_reg.var_off);
6385 scalar32_min_max_xor(dst_reg, &src_reg);
6386 scalar_min_max_xor(dst_reg, &src_reg);
6389 if (umax_val >= insn_bitness) {
6390 /* Shifts greater than 31 or 63 are undefined.
6391 * This includes shifts by a negative number.
6393 mark_reg_unknown(env, regs, insn->dst_reg);
6397 scalar32_min_max_lsh(dst_reg, &src_reg);
6399 scalar_min_max_lsh(dst_reg, &src_reg);
6402 if (umax_val >= insn_bitness) {
6403 /* Shifts greater than 31 or 63 are undefined.
6404 * This includes shifts by a negative number.
6406 mark_reg_unknown(env, regs, insn->dst_reg);
6410 scalar32_min_max_rsh(dst_reg, &src_reg);
6412 scalar_min_max_rsh(dst_reg, &src_reg);
6415 if (umax_val >= insn_bitness) {
6416 /* Shifts greater than 31 or 63 are undefined.
6417 * This includes shifts by a negative number.
6419 mark_reg_unknown(env, regs, insn->dst_reg);
6423 scalar32_min_max_arsh(dst_reg, &src_reg);
6425 scalar_min_max_arsh(dst_reg, &src_reg);
6428 mark_reg_unknown(env, regs, insn->dst_reg);
6432 /* ALU32 ops are zero extended into 64bit register */
6434 zext_32_to_64(dst_reg);
6436 __update_reg_bounds(dst_reg);
6437 __reg_deduce_bounds(dst_reg);
6438 __reg_bound_offset(dst_reg);
6442 /* Handles ALU ops other than BPF_END, BPF_NEG and BPF_MOV: computes new min/max
6445 static int adjust_reg_min_max_vals(struct bpf_verifier_env *env,
6446 struct bpf_insn *insn)
6448 struct bpf_verifier_state *vstate = env->cur_state;
6449 struct bpf_func_state *state = vstate->frame[vstate->curframe];
6450 struct bpf_reg_state *regs = state->regs, *dst_reg, *src_reg;
6451 struct bpf_reg_state *ptr_reg = NULL, off_reg = {0};
6452 u8 opcode = BPF_OP(insn->code);
6455 dst_reg = ®s[insn->dst_reg];
6457 if (dst_reg->type != SCALAR_VALUE)
6460 /* Make sure ID is cleared otherwise dst_reg min/max could be
6461 * incorrectly propagated into other registers by find_equal_scalars()
6464 if (BPF_SRC(insn->code) == BPF_X) {
6465 src_reg = ®s[insn->src_reg];
6466 if (src_reg->type != SCALAR_VALUE) {
6467 if (dst_reg->type != SCALAR_VALUE) {
6468 /* Combining two pointers by any ALU op yields
6469 * an arbitrary scalar. Disallow all math except
6470 * pointer subtraction
6472 if (opcode == BPF_SUB && env->allow_ptr_leaks) {
6473 mark_reg_unknown(env, regs, insn->dst_reg);
6476 verbose(env, "R%d pointer %s pointer prohibited\n",
6478 bpf_alu_string[opcode >> 4]);
6481 /* scalar += pointer
6482 * This is legal, but we have to reverse our
6483 * src/dest handling in computing the range
6485 err = mark_chain_precision(env, insn->dst_reg);
6488 return adjust_ptr_min_max_vals(env, insn,
6491 } else if (ptr_reg) {
6492 /* pointer += scalar */
6493 err = mark_chain_precision(env, insn->src_reg);
6496 return adjust_ptr_min_max_vals(env, insn,
6500 /* Pretend the src is a reg with a known value, since we only
6501 * need to be able to read from this state.
6503 off_reg.type = SCALAR_VALUE;
6504 __mark_reg_known(&off_reg, insn->imm);
6506 if (ptr_reg) /* pointer += K */
6507 return adjust_ptr_min_max_vals(env, insn,
6511 /* Got here implies adding two SCALAR_VALUEs */
6512 if (WARN_ON_ONCE(ptr_reg)) {
6513 print_verifier_state(env, state);
6514 verbose(env, "verifier internal error: unexpected ptr_reg\n");
6517 if (WARN_ON(!src_reg)) {
6518 print_verifier_state(env, state);
6519 verbose(env, "verifier internal error: no src_reg\n");
6522 return adjust_scalar_min_max_vals(env, insn, dst_reg, *src_reg);
6525 /* check validity of 32-bit and 64-bit arithmetic operations */
6526 static int check_alu_op(struct bpf_verifier_env *env, struct bpf_insn *insn)
6528 struct bpf_reg_state *regs = cur_regs(env);
6529 u8 opcode = BPF_OP(insn->code);
6532 if (opcode == BPF_END || opcode == BPF_NEG) {
6533 if (opcode == BPF_NEG) {
6534 if (BPF_SRC(insn->code) != 0 ||
6535 insn->src_reg != BPF_REG_0 ||
6536 insn->off != 0 || insn->imm != 0) {
6537 verbose(env, "BPF_NEG uses reserved fields\n");
6541 if (insn->src_reg != BPF_REG_0 || insn->off != 0 ||
6542 (insn->imm != 16 && insn->imm != 32 && insn->imm != 64) ||
6543 BPF_CLASS(insn->code) == BPF_ALU64) {
6544 verbose(env, "BPF_END uses reserved fields\n");
6549 /* check src operand */
6550 err = check_reg_arg(env, insn->dst_reg, SRC_OP);
6554 if (is_pointer_value(env, insn->dst_reg)) {
6555 verbose(env, "R%d pointer arithmetic prohibited\n",
6560 /* check dest operand */
6561 err = check_reg_arg(env, insn->dst_reg, DST_OP);
6565 } else if (opcode == BPF_MOV) {
6567 if (BPF_SRC(insn->code) == BPF_X) {
6568 if (insn->imm != 0 || insn->off != 0) {
6569 verbose(env, "BPF_MOV uses reserved fields\n");
6573 /* check src operand */
6574 err = check_reg_arg(env, insn->src_reg, SRC_OP);
6578 if (insn->src_reg != BPF_REG_0 || insn->off != 0) {
6579 verbose(env, "BPF_MOV uses reserved fields\n");
6584 /* check dest operand, mark as required later */
6585 err = check_reg_arg(env, insn->dst_reg, DST_OP_NO_MARK);
6589 if (BPF_SRC(insn->code) == BPF_X) {
6590 struct bpf_reg_state *src_reg = regs + insn->src_reg;
6591 struct bpf_reg_state *dst_reg = regs + insn->dst_reg;
6593 if (BPF_CLASS(insn->code) == BPF_ALU64) {
6595 * copy register state to dest reg
6597 if (src_reg->type == SCALAR_VALUE && !src_reg->id)
6598 /* Assign src and dst registers the same ID
6599 * that will be used by find_equal_scalars()
6600 * to propagate min/max range.
6602 src_reg->id = ++env->id_gen;
6603 *dst_reg = *src_reg;
6604 dst_reg->live |= REG_LIVE_WRITTEN;
6605 dst_reg->subreg_def = DEF_NOT_SUBREG;
6608 if (is_pointer_value(env, insn->src_reg)) {
6610 "R%d partial copy of pointer\n",
6613 } else if (src_reg->type == SCALAR_VALUE) {
6614 *dst_reg = *src_reg;
6615 /* Make sure ID is cleared otherwise
6616 * dst_reg min/max could be incorrectly
6617 * propagated into src_reg by find_equal_scalars()
6620 dst_reg->live |= REG_LIVE_WRITTEN;
6621 dst_reg->subreg_def = env->insn_idx + 1;
6623 mark_reg_unknown(env, regs,
6626 zext_32_to_64(dst_reg);
6630 * remember the value we stored into this reg
6632 /* clear any state __mark_reg_known doesn't set */
6633 mark_reg_unknown(env, regs, insn->dst_reg);
6634 regs[insn->dst_reg].type = SCALAR_VALUE;
6635 if (BPF_CLASS(insn->code) == BPF_ALU64) {
6636 __mark_reg_known(regs + insn->dst_reg,
6639 __mark_reg_known(regs + insn->dst_reg,
6644 } else if (opcode > BPF_END) {
6645 verbose(env, "invalid BPF_ALU opcode %x\n", opcode);
6648 } else { /* all other ALU ops: and, sub, xor, add, ... */
6650 if (BPF_SRC(insn->code) == BPF_X) {
6651 if (insn->imm != 0 || insn->off != 0) {
6652 verbose(env, "BPF_ALU uses reserved fields\n");
6655 /* check src1 operand */
6656 err = check_reg_arg(env, insn->src_reg, SRC_OP);
6660 if (insn->src_reg != BPF_REG_0 || insn->off != 0) {
6661 verbose(env, "BPF_ALU uses reserved fields\n");
6666 /* check src2 operand */
6667 err = check_reg_arg(env, insn->dst_reg, SRC_OP);
6671 if ((opcode == BPF_MOD || opcode == BPF_DIV) &&
6672 BPF_SRC(insn->code) == BPF_K && insn->imm == 0) {
6673 verbose(env, "div by zero\n");
6677 if ((opcode == BPF_LSH || opcode == BPF_RSH ||
6678 opcode == BPF_ARSH) && BPF_SRC(insn->code) == BPF_K) {
6679 int size = BPF_CLASS(insn->code) == BPF_ALU64 ? 64 : 32;
6681 if (insn->imm < 0 || insn->imm >= size) {
6682 verbose(env, "invalid shift %d\n", insn->imm);
6687 /* check dest operand */
6688 err = check_reg_arg(env, insn->dst_reg, DST_OP_NO_MARK);
6692 return adjust_reg_min_max_vals(env, insn);
6698 static void __find_good_pkt_pointers(struct bpf_func_state *state,
6699 struct bpf_reg_state *dst_reg,
6700 enum bpf_reg_type type, u16 new_range)
6702 struct bpf_reg_state *reg;
6705 for (i = 0; i < MAX_BPF_REG; i++) {
6706 reg = &state->regs[i];
6707 if (reg->type == type && reg->id == dst_reg->id)
6708 /* keep the maximum range already checked */
6709 reg->range = max(reg->range, new_range);
6712 bpf_for_each_spilled_reg(i, state, reg) {
6715 if (reg->type == type && reg->id == dst_reg->id)
6716 reg->range = max(reg->range, new_range);
6720 static void find_good_pkt_pointers(struct bpf_verifier_state *vstate,
6721 struct bpf_reg_state *dst_reg,
6722 enum bpf_reg_type type,
6723 bool range_right_open)
6728 if (dst_reg->off < 0 ||
6729 (dst_reg->off == 0 && range_right_open))
6730 /* This doesn't give us any range */
6733 if (dst_reg->umax_value > MAX_PACKET_OFF ||
6734 dst_reg->umax_value + dst_reg->off > MAX_PACKET_OFF)
6735 /* Risk of overflow. For instance, ptr + (1<<63) may be less
6736 * than pkt_end, but that's because it's also less than pkt.
6740 new_range = dst_reg->off;
6741 if (range_right_open)
6744 /* Examples for register markings:
6746 * pkt_data in dst register:
6750 * if (r2 > pkt_end) goto <handle exception>
6755 * if (r2 < pkt_end) goto <access okay>
6756 * <handle exception>
6759 * r2 == dst_reg, pkt_end == src_reg
6760 * r2=pkt(id=n,off=8,r=0)
6761 * r3=pkt(id=n,off=0,r=0)
6763 * pkt_data in src register:
6767 * if (pkt_end >= r2) goto <access okay>
6768 * <handle exception>
6772 * if (pkt_end <= r2) goto <handle exception>
6776 * pkt_end == dst_reg, r2 == src_reg
6777 * r2=pkt(id=n,off=8,r=0)
6778 * r3=pkt(id=n,off=0,r=0)
6780 * Find register r3 and mark its range as r3=pkt(id=n,off=0,r=8)
6781 * or r3=pkt(id=n,off=0,r=8-1), so that range of bytes [r3, r3 + 8)
6782 * and [r3, r3 + 8-1) respectively is safe to access depending on
6786 /* If our ids match, then we must have the same max_value. And we
6787 * don't care about the other reg's fixed offset, since if it's too big
6788 * the range won't allow anything.
6789 * dst_reg->off is known < MAX_PACKET_OFF, therefore it fits in a u16.
6791 for (i = 0; i <= vstate->curframe; i++)
6792 __find_good_pkt_pointers(vstate->frame[i], dst_reg, type,
6796 static int is_branch32_taken(struct bpf_reg_state *reg, u32 val, u8 opcode)
6798 struct tnum subreg = tnum_subreg(reg->var_off);
6799 s32 sval = (s32)val;
6803 if (tnum_is_const(subreg))
6804 return !!tnum_equals_const(subreg, val);
6807 if (tnum_is_const(subreg))
6808 return !tnum_equals_const(subreg, val);
6811 if ((~subreg.mask & subreg.value) & val)
6813 if (!((subreg.mask | subreg.value) & val))
6817 if (reg->u32_min_value > val)
6819 else if (reg->u32_max_value <= val)
6823 if (reg->s32_min_value > sval)
6825 else if (reg->s32_max_value < sval)
6829 if (reg->u32_max_value < val)
6831 else if (reg->u32_min_value >= val)
6835 if (reg->s32_max_value < sval)
6837 else if (reg->s32_min_value >= sval)
6841 if (reg->u32_min_value >= val)
6843 else if (reg->u32_max_value < val)
6847 if (reg->s32_min_value >= sval)
6849 else if (reg->s32_max_value < sval)
6853 if (reg->u32_max_value <= val)
6855 else if (reg->u32_min_value > val)
6859 if (reg->s32_max_value <= sval)
6861 else if (reg->s32_min_value > sval)
6870 static int is_branch64_taken(struct bpf_reg_state *reg, u64 val, u8 opcode)
6872 s64 sval = (s64)val;
6876 if (tnum_is_const(reg->var_off))
6877 return !!tnum_equals_const(reg->var_off, val);
6880 if (tnum_is_const(reg->var_off))
6881 return !tnum_equals_const(reg->var_off, val);
6884 if ((~reg->var_off.mask & reg->var_off.value) & val)
6886 if (!((reg->var_off.mask | reg->var_off.value) & val))
6890 if (reg->umin_value > val)
6892 else if (reg->umax_value <= val)
6896 if (reg->smin_value > sval)
6898 else if (reg->smax_value < sval)
6902 if (reg->umax_value < val)
6904 else if (reg->umin_value >= val)
6908 if (reg->smax_value < sval)
6910 else if (reg->smin_value >= sval)
6914 if (reg->umin_value >= val)
6916 else if (reg->umax_value < val)
6920 if (reg->smin_value >= sval)
6922 else if (reg->smax_value < sval)
6926 if (reg->umax_value <= val)
6928 else if (reg->umin_value > val)
6932 if (reg->smax_value <= sval)
6934 else if (reg->smin_value > sval)
6942 /* compute branch direction of the expression "if (reg opcode val) goto target;"
6944 * 1 - branch will be taken and "goto target" will be executed
6945 * 0 - branch will not be taken and fall-through to next insn
6946 * -1 - unknown. Example: "if (reg < 5)" is unknown when register value
6949 static int is_branch_taken(struct bpf_reg_state *reg, u64 val, u8 opcode,
6952 if (__is_pointer_value(false, reg)) {
6953 if (!reg_type_not_null(reg->type))
6956 /* If pointer is valid tests against zero will fail so we can
6957 * use this to direct branch taken.
6973 return is_branch32_taken(reg, val, opcode);
6974 return is_branch64_taken(reg, val, opcode);
6977 /* Adjusts the register min/max values in the case that the dst_reg is the
6978 * variable register that we are working on, and src_reg is a constant or we're
6979 * simply doing a BPF_K check.
6980 * In JEQ/JNE cases we also adjust the var_off values.
6982 static void reg_set_min_max(struct bpf_reg_state *true_reg,
6983 struct bpf_reg_state *false_reg,
6985 u8 opcode, bool is_jmp32)
6987 struct tnum false_32off = tnum_subreg(false_reg->var_off);
6988 struct tnum false_64off = false_reg->var_off;
6989 struct tnum true_32off = tnum_subreg(true_reg->var_off);
6990 struct tnum true_64off = true_reg->var_off;
6991 s64 sval = (s64)val;
6992 s32 sval32 = (s32)val32;
6994 /* If the dst_reg is a pointer, we can't learn anything about its
6995 * variable offset from the compare (unless src_reg were a pointer into
6996 * the same object, but we don't bother with that.
6997 * Since false_reg and true_reg have the same type by construction, we
6998 * only need to check one of them for pointerness.
7000 if (__is_pointer_value(false, false_reg))
7007 struct bpf_reg_state *reg =
7008 opcode == BPF_JEQ ? true_reg : false_reg;
7010 /* JEQ/JNE comparison doesn't change the register equivalence.
7012 * if (r1 == 42) goto label;
7014 * label: // here both r1 and r2 are known to be 42.
7016 * Hence when marking register as known preserve it's ID.
7019 __mark_reg32_known(reg, val32);
7021 ___mark_reg_known(reg, val);
7026 false_32off = tnum_and(false_32off, tnum_const(~val32));
7027 if (is_power_of_2(val32))
7028 true_32off = tnum_or(true_32off,
7031 false_64off = tnum_and(false_64off, tnum_const(~val));
7032 if (is_power_of_2(val))
7033 true_64off = tnum_or(true_64off,
7041 u32 false_umax = opcode == BPF_JGT ? val32 : val32 - 1;
7042 u32 true_umin = opcode == BPF_JGT ? val32 + 1 : val32;
7044 false_reg->u32_max_value = min(false_reg->u32_max_value,
7046 true_reg->u32_min_value = max(true_reg->u32_min_value,
7049 u64 false_umax = opcode == BPF_JGT ? val : val - 1;
7050 u64 true_umin = opcode == BPF_JGT ? val + 1 : val;
7052 false_reg->umax_value = min(false_reg->umax_value, false_umax);
7053 true_reg->umin_value = max(true_reg->umin_value, true_umin);
7061 s32 false_smax = opcode == BPF_JSGT ? sval32 : sval32 - 1;
7062 s32 true_smin = opcode == BPF_JSGT ? sval32 + 1 : sval32;
7064 false_reg->s32_max_value = min(false_reg->s32_max_value, false_smax);
7065 true_reg->s32_min_value = max(true_reg->s32_min_value, true_smin);
7067 s64 false_smax = opcode == BPF_JSGT ? sval : sval - 1;
7068 s64 true_smin = opcode == BPF_JSGT ? sval + 1 : sval;
7070 false_reg->smax_value = min(false_reg->smax_value, false_smax);
7071 true_reg->smin_value = max(true_reg->smin_value, true_smin);
7079 u32 false_umin = opcode == BPF_JLT ? val32 : val32 + 1;
7080 u32 true_umax = opcode == BPF_JLT ? val32 - 1 : val32;
7082 false_reg->u32_min_value = max(false_reg->u32_min_value,
7084 true_reg->u32_max_value = min(true_reg->u32_max_value,
7087 u64 false_umin = opcode == BPF_JLT ? val : val + 1;
7088 u64 true_umax = opcode == BPF_JLT ? val - 1 : val;
7090 false_reg->umin_value = max(false_reg->umin_value, false_umin);
7091 true_reg->umax_value = min(true_reg->umax_value, true_umax);
7099 s32 false_smin = opcode == BPF_JSLT ? sval32 : sval32 + 1;
7100 s32 true_smax = opcode == BPF_JSLT ? sval32 - 1 : sval32;
7102 false_reg->s32_min_value = max(false_reg->s32_min_value, false_smin);
7103 true_reg->s32_max_value = min(true_reg->s32_max_value, true_smax);
7105 s64 false_smin = opcode == BPF_JSLT ? sval : sval + 1;
7106 s64 true_smax = opcode == BPF_JSLT ? sval - 1 : sval;
7108 false_reg->smin_value = max(false_reg->smin_value, false_smin);
7109 true_reg->smax_value = min(true_reg->smax_value, true_smax);
7118 false_reg->var_off = tnum_or(tnum_clear_subreg(false_64off),
7119 tnum_subreg(false_32off));
7120 true_reg->var_off = tnum_or(tnum_clear_subreg(true_64off),
7121 tnum_subreg(true_32off));
7122 __reg_combine_32_into_64(false_reg);
7123 __reg_combine_32_into_64(true_reg);
7125 false_reg->var_off = false_64off;
7126 true_reg->var_off = true_64off;
7127 __reg_combine_64_into_32(false_reg);
7128 __reg_combine_64_into_32(true_reg);
7132 /* Same as above, but for the case that dst_reg holds a constant and src_reg is
7135 static void reg_set_min_max_inv(struct bpf_reg_state *true_reg,
7136 struct bpf_reg_state *false_reg,
7138 u8 opcode, bool is_jmp32)
7140 /* How can we transform "a <op> b" into "b <op> a"? */
7141 static const u8 opcode_flip[16] = {
7142 /* these stay the same */
7143 [BPF_JEQ >> 4] = BPF_JEQ,
7144 [BPF_JNE >> 4] = BPF_JNE,
7145 [BPF_JSET >> 4] = BPF_JSET,
7146 /* these swap "lesser" and "greater" (L and G in the opcodes) */
7147 [BPF_JGE >> 4] = BPF_JLE,
7148 [BPF_JGT >> 4] = BPF_JLT,
7149 [BPF_JLE >> 4] = BPF_JGE,
7150 [BPF_JLT >> 4] = BPF_JGT,
7151 [BPF_JSGE >> 4] = BPF_JSLE,
7152 [BPF_JSGT >> 4] = BPF_JSLT,
7153 [BPF_JSLE >> 4] = BPF_JSGE,
7154 [BPF_JSLT >> 4] = BPF_JSGT
7156 opcode = opcode_flip[opcode >> 4];
7157 /* This uses zero as "not present in table"; luckily the zero opcode,
7158 * BPF_JA, can't get here.
7161 reg_set_min_max(true_reg, false_reg, val, val32, opcode, is_jmp32);
7164 /* Regs are known to be equal, so intersect their min/max/var_off */
7165 static void __reg_combine_min_max(struct bpf_reg_state *src_reg,
7166 struct bpf_reg_state *dst_reg)
7168 src_reg->umin_value = dst_reg->umin_value = max(src_reg->umin_value,
7169 dst_reg->umin_value);
7170 src_reg->umax_value = dst_reg->umax_value = min(src_reg->umax_value,
7171 dst_reg->umax_value);
7172 src_reg->smin_value = dst_reg->smin_value = max(src_reg->smin_value,
7173 dst_reg->smin_value);
7174 src_reg->smax_value = dst_reg->smax_value = min(src_reg->smax_value,
7175 dst_reg->smax_value);
7176 src_reg->var_off = dst_reg->var_off = tnum_intersect(src_reg->var_off,
7178 /* We might have learned new bounds from the var_off. */
7179 __update_reg_bounds(src_reg);
7180 __update_reg_bounds(dst_reg);
7181 /* We might have learned something about the sign bit. */
7182 __reg_deduce_bounds(src_reg);
7183 __reg_deduce_bounds(dst_reg);
7184 /* We might have learned some bits from the bounds. */
7185 __reg_bound_offset(src_reg);
7186 __reg_bound_offset(dst_reg);
7187 /* Intersecting with the old var_off might have improved our bounds
7188 * slightly. e.g. if umax was 0x7f...f and var_off was (0; 0xf...fc),
7189 * then new var_off is (0; 0x7f...fc) which improves our umax.
7191 __update_reg_bounds(src_reg);
7192 __update_reg_bounds(dst_reg);
7195 static void reg_combine_min_max(struct bpf_reg_state *true_src,
7196 struct bpf_reg_state *true_dst,
7197 struct bpf_reg_state *false_src,
7198 struct bpf_reg_state *false_dst,
7203 __reg_combine_min_max(true_src, true_dst);
7206 __reg_combine_min_max(false_src, false_dst);
7211 static void mark_ptr_or_null_reg(struct bpf_func_state *state,
7212 struct bpf_reg_state *reg, u32 id,
7215 if (reg_type_may_be_null(reg->type) && reg->id == id) {
7216 /* Old offset (both fixed and variable parts) should
7217 * have been known-zero, because we don't allow pointer
7218 * arithmetic on pointers that might be NULL.
7220 if (WARN_ON_ONCE(reg->smin_value || reg->smax_value ||
7221 !tnum_equals_const(reg->var_off, 0) ||
7223 __mark_reg_known_zero(reg);
7227 reg->type = SCALAR_VALUE;
7228 } else if (reg->type == PTR_TO_MAP_VALUE_OR_NULL) {
7229 const struct bpf_map *map = reg->map_ptr;
7231 if (map->inner_map_meta) {
7232 reg->type = CONST_PTR_TO_MAP;
7233 reg->map_ptr = map->inner_map_meta;
7234 } else if (map->map_type == BPF_MAP_TYPE_XSKMAP) {
7235 reg->type = PTR_TO_XDP_SOCK;
7236 } else if (map->map_type == BPF_MAP_TYPE_SOCKMAP ||
7237 map->map_type == BPF_MAP_TYPE_SOCKHASH) {
7238 reg->type = PTR_TO_SOCKET;
7240 reg->type = PTR_TO_MAP_VALUE;
7242 } else if (reg->type == PTR_TO_SOCKET_OR_NULL) {
7243 reg->type = PTR_TO_SOCKET;
7244 } else if (reg->type == PTR_TO_SOCK_COMMON_OR_NULL) {
7245 reg->type = PTR_TO_SOCK_COMMON;
7246 } else if (reg->type == PTR_TO_TCP_SOCK_OR_NULL) {
7247 reg->type = PTR_TO_TCP_SOCK;
7248 } else if (reg->type == PTR_TO_BTF_ID_OR_NULL) {
7249 reg->type = PTR_TO_BTF_ID;
7250 } else if (reg->type == PTR_TO_MEM_OR_NULL) {
7251 reg->type = PTR_TO_MEM;
7252 } else if (reg->type == PTR_TO_RDONLY_BUF_OR_NULL) {
7253 reg->type = PTR_TO_RDONLY_BUF;
7254 } else if (reg->type == PTR_TO_RDWR_BUF_OR_NULL) {
7255 reg->type = PTR_TO_RDWR_BUF;
7258 /* We don't need id and ref_obj_id from this point
7259 * onwards anymore, thus we should better reset it,
7260 * so that state pruning has chances to take effect.
7263 reg->ref_obj_id = 0;
7264 } else if (!reg_may_point_to_spin_lock(reg)) {
7265 /* For not-NULL ptr, reg->ref_obj_id will be reset
7266 * in release_reg_references().
7268 * reg->id is still used by spin_lock ptr. Other
7269 * than spin_lock ptr type, reg->id can be reset.
7276 static void __mark_ptr_or_null_regs(struct bpf_func_state *state, u32 id,
7279 struct bpf_reg_state *reg;
7282 for (i = 0; i < MAX_BPF_REG; i++)
7283 mark_ptr_or_null_reg(state, &state->regs[i], id, is_null);
7285 bpf_for_each_spilled_reg(i, state, reg) {
7288 mark_ptr_or_null_reg(state, reg, id, is_null);
7292 /* The logic is similar to find_good_pkt_pointers(), both could eventually
7293 * be folded together at some point.
7295 static void mark_ptr_or_null_regs(struct bpf_verifier_state *vstate, u32 regno,
7298 struct bpf_func_state *state = vstate->frame[vstate->curframe];
7299 struct bpf_reg_state *regs = state->regs;
7300 u32 ref_obj_id = regs[regno].ref_obj_id;
7301 u32 id = regs[regno].id;
7304 if (ref_obj_id && ref_obj_id == id && is_null)
7305 /* regs[regno] is in the " == NULL" branch.
7306 * No one could have freed the reference state before
7307 * doing the NULL check.
7309 WARN_ON_ONCE(release_reference_state(state, id));
7311 for (i = 0; i <= vstate->curframe; i++)
7312 __mark_ptr_or_null_regs(vstate->frame[i], id, is_null);
7315 static bool try_match_pkt_pointers(const struct bpf_insn *insn,
7316 struct bpf_reg_state *dst_reg,
7317 struct bpf_reg_state *src_reg,
7318 struct bpf_verifier_state *this_branch,
7319 struct bpf_verifier_state *other_branch)
7321 if (BPF_SRC(insn->code) != BPF_X)
7324 /* Pointers are always 64-bit. */
7325 if (BPF_CLASS(insn->code) == BPF_JMP32)
7328 switch (BPF_OP(insn->code)) {
7330 if ((dst_reg->type == PTR_TO_PACKET &&
7331 src_reg->type == PTR_TO_PACKET_END) ||
7332 (dst_reg->type == PTR_TO_PACKET_META &&
7333 reg_is_init_pkt_pointer(src_reg, PTR_TO_PACKET))) {
7334 /* pkt_data' > pkt_end, pkt_meta' > pkt_data */
7335 find_good_pkt_pointers(this_branch, dst_reg,
7336 dst_reg->type, false);
7337 } else if ((dst_reg->type == PTR_TO_PACKET_END &&
7338 src_reg->type == PTR_TO_PACKET) ||
7339 (reg_is_init_pkt_pointer(dst_reg, PTR_TO_PACKET) &&
7340 src_reg->type == PTR_TO_PACKET_META)) {
7341 /* pkt_end > pkt_data', pkt_data > pkt_meta' */
7342 find_good_pkt_pointers(other_branch, src_reg,
7343 src_reg->type, true);
7349 if ((dst_reg->type == PTR_TO_PACKET &&
7350 src_reg->type == PTR_TO_PACKET_END) ||
7351 (dst_reg->type == PTR_TO_PACKET_META &&
7352 reg_is_init_pkt_pointer(src_reg, PTR_TO_PACKET))) {
7353 /* pkt_data' < pkt_end, pkt_meta' < pkt_data */
7354 find_good_pkt_pointers(other_branch, dst_reg,
7355 dst_reg->type, true);
7356 } else if ((dst_reg->type == PTR_TO_PACKET_END &&
7357 src_reg->type == PTR_TO_PACKET) ||
7358 (reg_is_init_pkt_pointer(dst_reg, PTR_TO_PACKET) &&
7359 src_reg->type == PTR_TO_PACKET_META)) {
7360 /* pkt_end < pkt_data', pkt_data > pkt_meta' */
7361 find_good_pkt_pointers(this_branch, src_reg,
7362 src_reg->type, false);
7368 if ((dst_reg->type == PTR_TO_PACKET &&
7369 src_reg->type == PTR_TO_PACKET_END) ||
7370 (dst_reg->type == PTR_TO_PACKET_META &&
7371 reg_is_init_pkt_pointer(src_reg, PTR_TO_PACKET))) {
7372 /* pkt_data' >= pkt_end, pkt_meta' >= pkt_data */
7373 find_good_pkt_pointers(this_branch, dst_reg,
7374 dst_reg->type, true);
7375 } else if ((dst_reg->type == PTR_TO_PACKET_END &&
7376 src_reg->type == PTR_TO_PACKET) ||
7377 (reg_is_init_pkt_pointer(dst_reg, PTR_TO_PACKET) &&
7378 src_reg->type == PTR_TO_PACKET_META)) {
7379 /* pkt_end >= pkt_data', pkt_data >= pkt_meta' */
7380 find_good_pkt_pointers(other_branch, src_reg,
7381 src_reg->type, false);
7387 if ((dst_reg->type == PTR_TO_PACKET &&
7388 src_reg->type == PTR_TO_PACKET_END) ||
7389 (dst_reg->type == PTR_TO_PACKET_META &&
7390 reg_is_init_pkt_pointer(src_reg, PTR_TO_PACKET))) {
7391 /* pkt_data' <= pkt_end, pkt_meta' <= pkt_data */
7392 find_good_pkt_pointers(other_branch, dst_reg,
7393 dst_reg->type, false);
7394 } else if ((dst_reg->type == PTR_TO_PACKET_END &&
7395 src_reg->type == PTR_TO_PACKET) ||
7396 (reg_is_init_pkt_pointer(dst_reg, PTR_TO_PACKET) &&
7397 src_reg->type == PTR_TO_PACKET_META)) {
7398 /* pkt_end <= pkt_data', pkt_data <= pkt_meta' */
7399 find_good_pkt_pointers(this_branch, src_reg,
7400 src_reg->type, true);
7412 static void find_equal_scalars(struct bpf_verifier_state *vstate,
7413 struct bpf_reg_state *known_reg)
7415 struct bpf_func_state *state;
7416 struct bpf_reg_state *reg;
7419 for (i = 0; i <= vstate->curframe; i++) {
7420 state = vstate->frame[i];
7421 for (j = 0; j < MAX_BPF_REG; j++) {
7422 reg = &state->regs[j];
7423 if (reg->type == SCALAR_VALUE && reg->id == known_reg->id)
7427 bpf_for_each_spilled_reg(j, state, reg) {
7430 if (reg->type == SCALAR_VALUE && reg->id == known_reg->id)
7436 static int check_cond_jmp_op(struct bpf_verifier_env *env,
7437 struct bpf_insn *insn, int *insn_idx)
7439 struct bpf_verifier_state *this_branch = env->cur_state;
7440 struct bpf_verifier_state *other_branch;
7441 struct bpf_reg_state *regs = this_branch->frame[this_branch->curframe]->regs;
7442 struct bpf_reg_state *dst_reg, *other_branch_regs, *src_reg = NULL;
7443 u8 opcode = BPF_OP(insn->code);
7448 /* Only conditional jumps are expected to reach here. */
7449 if (opcode == BPF_JA || opcode > BPF_JSLE) {
7450 verbose(env, "invalid BPF_JMP/JMP32 opcode %x\n", opcode);
7454 if (BPF_SRC(insn->code) == BPF_X) {
7455 if (insn->imm != 0) {
7456 verbose(env, "BPF_JMP/JMP32 uses reserved fields\n");
7460 /* check src1 operand */
7461 err = check_reg_arg(env, insn->src_reg, SRC_OP);
7465 if (is_pointer_value(env, insn->src_reg)) {
7466 verbose(env, "R%d pointer comparison prohibited\n",
7470 src_reg = ®s[insn->src_reg];
7472 if (insn->src_reg != BPF_REG_0) {
7473 verbose(env, "BPF_JMP/JMP32 uses reserved fields\n");
7478 /* check src2 operand */
7479 err = check_reg_arg(env, insn->dst_reg, SRC_OP);
7483 dst_reg = ®s[insn->dst_reg];
7484 is_jmp32 = BPF_CLASS(insn->code) == BPF_JMP32;
7486 if (BPF_SRC(insn->code) == BPF_K) {
7487 pred = is_branch_taken(dst_reg, insn->imm, opcode, is_jmp32);
7488 } else if (src_reg->type == SCALAR_VALUE &&
7489 is_jmp32 && tnum_is_const(tnum_subreg(src_reg->var_off))) {
7490 pred = is_branch_taken(dst_reg,
7491 tnum_subreg(src_reg->var_off).value,
7494 } else if (src_reg->type == SCALAR_VALUE &&
7495 !is_jmp32 && tnum_is_const(src_reg->var_off)) {
7496 pred = is_branch_taken(dst_reg,
7497 src_reg->var_off.value,
7503 /* If we get here with a dst_reg pointer type it is because
7504 * above is_branch_taken() special cased the 0 comparison.
7506 if (!__is_pointer_value(false, dst_reg))
7507 err = mark_chain_precision(env, insn->dst_reg);
7508 if (BPF_SRC(insn->code) == BPF_X && !err)
7509 err = mark_chain_precision(env, insn->src_reg);
7514 /* only follow the goto, ignore fall-through */
7515 *insn_idx += insn->off;
7517 } else if (pred == 0) {
7518 /* only follow fall-through branch, since
7519 * that's where the program will go
7524 other_branch = push_stack(env, *insn_idx + insn->off + 1, *insn_idx,
7528 other_branch_regs = other_branch->frame[other_branch->curframe]->regs;
7530 /* detect if we are comparing against a constant value so we can adjust
7531 * our min/max values for our dst register.
7532 * this is only legit if both are scalars (or pointers to the same
7533 * object, I suppose, but we don't support that right now), because
7534 * otherwise the different base pointers mean the offsets aren't
7537 if (BPF_SRC(insn->code) == BPF_X) {
7538 struct bpf_reg_state *src_reg = ®s[insn->src_reg];
7540 if (dst_reg->type == SCALAR_VALUE &&
7541 src_reg->type == SCALAR_VALUE) {
7542 if (tnum_is_const(src_reg->var_off) ||
7544 tnum_is_const(tnum_subreg(src_reg->var_off))))
7545 reg_set_min_max(&other_branch_regs[insn->dst_reg],
7547 src_reg->var_off.value,
7548 tnum_subreg(src_reg->var_off).value,
7550 else if (tnum_is_const(dst_reg->var_off) ||
7552 tnum_is_const(tnum_subreg(dst_reg->var_off))))
7553 reg_set_min_max_inv(&other_branch_regs[insn->src_reg],
7555 dst_reg->var_off.value,
7556 tnum_subreg(dst_reg->var_off).value,
7558 else if (!is_jmp32 &&
7559 (opcode == BPF_JEQ || opcode == BPF_JNE))
7560 /* Comparing for equality, we can combine knowledge */
7561 reg_combine_min_max(&other_branch_regs[insn->src_reg],
7562 &other_branch_regs[insn->dst_reg],
7563 src_reg, dst_reg, opcode);
7565 !WARN_ON_ONCE(src_reg->id != other_branch_regs[insn->src_reg].id)) {
7566 find_equal_scalars(this_branch, src_reg);
7567 find_equal_scalars(other_branch, &other_branch_regs[insn->src_reg]);
7571 } else if (dst_reg->type == SCALAR_VALUE) {
7572 reg_set_min_max(&other_branch_regs[insn->dst_reg],
7573 dst_reg, insn->imm, (u32)insn->imm,
7577 if (dst_reg->type == SCALAR_VALUE && dst_reg->id &&
7578 !WARN_ON_ONCE(dst_reg->id != other_branch_regs[insn->dst_reg].id)) {
7579 find_equal_scalars(this_branch, dst_reg);
7580 find_equal_scalars(other_branch, &other_branch_regs[insn->dst_reg]);
7583 /* detect if R == 0 where R is returned from bpf_map_lookup_elem().
7584 * NOTE: these optimizations below are related with pointer comparison
7585 * which will never be JMP32.
7587 if (!is_jmp32 && BPF_SRC(insn->code) == BPF_K &&
7588 insn->imm == 0 && (opcode == BPF_JEQ || opcode == BPF_JNE) &&
7589 reg_type_may_be_null(dst_reg->type)) {
7590 /* Mark all identical registers in each branch as either
7591 * safe or unknown depending R == 0 or R != 0 conditional.
7593 mark_ptr_or_null_regs(this_branch, insn->dst_reg,
7595 mark_ptr_or_null_regs(other_branch, insn->dst_reg,
7597 } else if (!try_match_pkt_pointers(insn, dst_reg, ®s[insn->src_reg],
7598 this_branch, other_branch) &&
7599 is_pointer_value(env, insn->dst_reg)) {
7600 verbose(env, "R%d pointer comparison prohibited\n",
7604 if (env->log.level & BPF_LOG_LEVEL)
7605 print_verifier_state(env, this_branch->frame[this_branch->curframe]);
7609 /* verify BPF_LD_IMM64 instruction */
7610 static int check_ld_imm(struct bpf_verifier_env *env, struct bpf_insn *insn)
7612 struct bpf_insn_aux_data *aux = cur_aux(env);
7613 struct bpf_reg_state *regs = cur_regs(env);
7614 struct bpf_reg_state *dst_reg;
7615 struct bpf_map *map;
7618 if (BPF_SIZE(insn->code) != BPF_DW) {
7619 verbose(env, "invalid BPF_LD_IMM insn\n");
7622 if (insn->off != 0) {
7623 verbose(env, "BPF_LD_IMM64 uses reserved fields\n");
7627 err = check_reg_arg(env, insn->dst_reg, DST_OP);
7631 dst_reg = ®s[insn->dst_reg];
7632 if (insn->src_reg == 0) {
7633 u64 imm = ((u64)(insn + 1)->imm << 32) | (u32)insn->imm;
7635 dst_reg->type = SCALAR_VALUE;
7636 __mark_reg_known(®s[insn->dst_reg], imm);
7640 if (insn->src_reg == BPF_PSEUDO_BTF_ID) {
7641 mark_reg_known_zero(env, regs, insn->dst_reg);
7643 dst_reg->type = aux->btf_var.reg_type;
7644 switch (dst_reg->type) {
7646 dst_reg->mem_size = aux->btf_var.mem_size;
7649 case PTR_TO_PERCPU_BTF_ID:
7650 dst_reg->btf_id = aux->btf_var.btf_id;
7653 verbose(env, "bpf verifier is misconfigured\n");
7659 map = env->used_maps[aux->map_index];
7660 mark_reg_known_zero(env, regs, insn->dst_reg);
7661 dst_reg->map_ptr = map;
7663 if (insn->src_reg == BPF_PSEUDO_MAP_VALUE) {
7664 dst_reg->type = PTR_TO_MAP_VALUE;
7665 dst_reg->off = aux->map_off;
7666 if (map_value_has_spin_lock(map))
7667 dst_reg->id = ++env->id_gen;
7668 } else if (insn->src_reg == BPF_PSEUDO_MAP_FD) {
7669 dst_reg->type = CONST_PTR_TO_MAP;
7671 verbose(env, "bpf verifier is misconfigured\n");
7678 static bool may_access_skb(enum bpf_prog_type type)
7681 case BPF_PROG_TYPE_SOCKET_FILTER:
7682 case BPF_PROG_TYPE_SCHED_CLS:
7683 case BPF_PROG_TYPE_SCHED_ACT:
7690 /* verify safety of LD_ABS|LD_IND instructions:
7691 * - they can only appear in the programs where ctx == skb
7692 * - since they are wrappers of function calls, they scratch R1-R5 registers,
7693 * preserve R6-R9, and store return value into R0
7696 * ctx == skb == R6 == CTX
7699 * SRC == any register
7700 * IMM == 32-bit immediate
7703 * R0 - 8/16/32-bit skb data converted to cpu endianness
7705 static int check_ld_abs(struct bpf_verifier_env *env, struct bpf_insn *insn)
7707 struct bpf_reg_state *regs = cur_regs(env);
7708 static const int ctx_reg = BPF_REG_6;
7709 u8 mode = BPF_MODE(insn->code);
7712 if (!may_access_skb(resolve_prog_type(env->prog))) {
7713 verbose(env, "BPF_LD_[ABS|IND] instructions not allowed for this program type\n");
7717 if (!env->ops->gen_ld_abs) {
7718 verbose(env, "bpf verifier is misconfigured\n");
7722 if (insn->dst_reg != BPF_REG_0 || insn->off != 0 ||
7723 BPF_SIZE(insn->code) == BPF_DW ||
7724 (mode == BPF_ABS && insn->src_reg != BPF_REG_0)) {
7725 verbose(env, "BPF_LD_[ABS|IND] uses reserved fields\n");
7729 /* check whether implicit source operand (register R6) is readable */
7730 err = check_reg_arg(env, ctx_reg, SRC_OP);
7734 /* Disallow usage of BPF_LD_[ABS|IND] with reference tracking, as
7735 * gen_ld_abs() may terminate the program at runtime, leading to
7738 err = check_reference_leak(env);
7740 verbose(env, "BPF_LD_[ABS|IND] cannot be mixed with socket references\n");
7744 if (env->cur_state->active_spin_lock) {
7745 verbose(env, "BPF_LD_[ABS|IND] cannot be used inside bpf_spin_lock-ed region\n");
7749 if (regs[ctx_reg].type != PTR_TO_CTX) {
7751 "at the time of BPF_LD_ABS|IND R6 != pointer to skb\n");
7755 if (mode == BPF_IND) {
7756 /* check explicit source operand */
7757 err = check_reg_arg(env, insn->src_reg, SRC_OP);
7762 err = check_ctx_reg(env, ®s[ctx_reg], ctx_reg);
7766 /* reset caller saved regs to unreadable */
7767 for (i = 0; i < CALLER_SAVED_REGS; i++) {
7768 mark_reg_not_init(env, regs, caller_saved[i]);
7769 check_reg_arg(env, caller_saved[i], DST_OP_NO_MARK);
7772 /* mark destination R0 register as readable, since it contains
7773 * the value fetched from the packet.
7774 * Already marked as written above.
7776 mark_reg_unknown(env, regs, BPF_REG_0);
7777 /* ld_abs load up to 32-bit skb data. */
7778 regs[BPF_REG_0].subreg_def = env->insn_idx + 1;
7782 static int check_return_code(struct bpf_verifier_env *env)
7784 struct tnum enforce_attach_type_range = tnum_unknown;
7785 const struct bpf_prog *prog = env->prog;
7786 struct bpf_reg_state *reg;
7787 struct tnum range = tnum_range(0, 1);
7788 enum bpf_prog_type prog_type = resolve_prog_type(env->prog);
7791 /* LSM and struct_ops func-ptr's return type could be "void" */
7792 if ((prog_type == BPF_PROG_TYPE_STRUCT_OPS ||
7793 prog_type == BPF_PROG_TYPE_LSM) &&
7794 !prog->aux->attach_func_proto->type)
7797 /* eBPF calling convetion is such that R0 is used
7798 * to return the value from eBPF program.
7799 * Make sure that it's readable at this time
7800 * of bpf_exit, which means that program wrote
7801 * something into it earlier
7803 err = check_reg_arg(env, BPF_REG_0, SRC_OP);
7807 if (is_pointer_value(env, BPF_REG_0)) {
7808 verbose(env, "R0 leaks addr as return value\n");
7812 switch (prog_type) {
7813 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
7814 if (env->prog->expected_attach_type == BPF_CGROUP_UDP4_RECVMSG ||
7815 env->prog->expected_attach_type == BPF_CGROUP_UDP6_RECVMSG ||
7816 env->prog->expected_attach_type == BPF_CGROUP_INET4_GETPEERNAME ||
7817 env->prog->expected_attach_type == BPF_CGROUP_INET6_GETPEERNAME ||
7818 env->prog->expected_attach_type == BPF_CGROUP_INET4_GETSOCKNAME ||
7819 env->prog->expected_attach_type == BPF_CGROUP_INET6_GETSOCKNAME)
7820 range = tnum_range(1, 1);
7822 case BPF_PROG_TYPE_CGROUP_SKB:
7823 if (env->prog->expected_attach_type == BPF_CGROUP_INET_EGRESS) {
7824 range = tnum_range(0, 3);
7825 enforce_attach_type_range = tnum_range(2, 3);
7828 case BPF_PROG_TYPE_CGROUP_SOCK:
7829 case BPF_PROG_TYPE_SOCK_OPS:
7830 case BPF_PROG_TYPE_CGROUP_DEVICE:
7831 case BPF_PROG_TYPE_CGROUP_SYSCTL:
7832 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
7834 case BPF_PROG_TYPE_RAW_TRACEPOINT:
7835 if (!env->prog->aux->attach_btf_id)
7837 range = tnum_const(0);
7839 case BPF_PROG_TYPE_TRACING:
7840 switch (env->prog->expected_attach_type) {
7841 case BPF_TRACE_FENTRY:
7842 case BPF_TRACE_FEXIT:
7843 range = tnum_const(0);
7845 case BPF_TRACE_RAW_TP:
7846 case BPF_MODIFY_RETURN:
7848 case BPF_TRACE_ITER:
7854 case BPF_PROG_TYPE_SK_LOOKUP:
7855 range = tnum_range(SK_DROP, SK_PASS);
7857 case BPF_PROG_TYPE_EXT:
7858 /* freplace program can return anything as its return value
7859 * depends on the to-be-replaced kernel func or bpf program.
7865 reg = cur_regs(env) + BPF_REG_0;
7866 if (reg->type != SCALAR_VALUE) {
7867 verbose(env, "At program exit the register R0 is not a known value (%s)\n",
7868 reg_type_str[reg->type]);
7872 if (!tnum_in(range, reg->var_off)) {
7875 verbose(env, "At program exit the register R0 ");
7876 if (!tnum_is_unknown(reg->var_off)) {
7877 tnum_strn(tn_buf, sizeof(tn_buf), reg->var_off);
7878 verbose(env, "has value %s", tn_buf);
7880 verbose(env, "has unknown scalar value");
7882 tnum_strn(tn_buf, sizeof(tn_buf), range);
7883 verbose(env, " should have been in %s\n", tn_buf);
7887 if (!tnum_is_unknown(enforce_attach_type_range) &&
7888 tnum_in(enforce_attach_type_range, reg->var_off))
7889 env->prog->enforce_expected_attach_type = 1;
7893 /* non-recursive DFS pseudo code
7894 * 1 procedure DFS-iterative(G,v):
7895 * 2 label v as discovered
7896 * 3 let S be a stack
7898 * 5 while S is not empty
7900 * 7 if t is what we're looking for:
7902 * 9 for all edges e in G.adjacentEdges(t) do
7903 * 10 if edge e is already labelled
7904 * 11 continue with the next edge
7905 * 12 w <- G.adjacentVertex(t,e)
7906 * 13 if vertex w is not discovered and not explored
7907 * 14 label e as tree-edge
7908 * 15 label w as discovered
7911 * 18 else if vertex w is discovered
7912 * 19 label e as back-edge
7914 * 21 // vertex w is explored
7915 * 22 label e as forward- or cross-edge
7916 * 23 label t as explored
7921 * 0x11 - discovered and fall-through edge labelled
7922 * 0x12 - discovered and fall-through and branch edges labelled
7933 static u32 state_htab_size(struct bpf_verifier_env *env)
7935 return env->prog->len;
7938 static struct bpf_verifier_state_list **explored_state(
7939 struct bpf_verifier_env *env,
7942 struct bpf_verifier_state *cur = env->cur_state;
7943 struct bpf_func_state *state = cur->frame[cur->curframe];
7945 return &env->explored_states[(idx ^ state->callsite) % state_htab_size(env)];
7948 static void init_explored_state(struct bpf_verifier_env *env, int idx)
7950 env->insn_aux_data[idx].prune_point = true;
7953 /* t, w, e - match pseudo-code above:
7954 * t - index of current instruction
7955 * w - next instruction
7958 static int push_insn(int t, int w, int e, struct bpf_verifier_env *env,
7961 int *insn_stack = env->cfg.insn_stack;
7962 int *insn_state = env->cfg.insn_state;
7964 if (e == FALLTHROUGH && insn_state[t] >= (DISCOVERED | FALLTHROUGH))
7967 if (e == BRANCH && insn_state[t] >= (DISCOVERED | BRANCH))
7970 if (w < 0 || w >= env->prog->len) {
7971 verbose_linfo(env, t, "%d: ", t);
7972 verbose(env, "jump out of range from insn %d to %d\n", t, w);
7977 /* mark branch target for state pruning */
7978 init_explored_state(env, w);
7980 if (insn_state[w] == 0) {
7982 insn_state[t] = DISCOVERED | e;
7983 insn_state[w] = DISCOVERED;
7984 if (env->cfg.cur_stack >= env->prog->len)
7986 insn_stack[env->cfg.cur_stack++] = w;
7988 } else if ((insn_state[w] & 0xF0) == DISCOVERED) {
7989 if (loop_ok && env->bpf_capable)
7991 verbose_linfo(env, t, "%d: ", t);
7992 verbose_linfo(env, w, "%d: ", w);
7993 verbose(env, "back-edge from insn %d to %d\n", t, w);
7995 } else if (insn_state[w] == EXPLORED) {
7996 /* forward- or cross-edge */
7997 insn_state[t] = DISCOVERED | e;
7999 verbose(env, "insn state internal bug\n");
8005 /* non-recursive depth-first-search to detect loops in BPF program
8006 * loop == back-edge in directed graph
8008 static int check_cfg(struct bpf_verifier_env *env)
8010 struct bpf_insn *insns = env->prog->insnsi;
8011 int insn_cnt = env->prog->len;
8012 int *insn_stack, *insn_state;
8016 insn_state = env->cfg.insn_state = kvcalloc(insn_cnt, sizeof(int), GFP_KERNEL);
8020 insn_stack = env->cfg.insn_stack = kvcalloc(insn_cnt, sizeof(int), GFP_KERNEL);
8026 insn_state[0] = DISCOVERED; /* mark 1st insn as discovered */
8027 insn_stack[0] = 0; /* 0 is the first instruction */
8028 env->cfg.cur_stack = 1;
8031 if (env->cfg.cur_stack == 0)
8033 t = insn_stack[env->cfg.cur_stack - 1];
8035 if (BPF_CLASS(insns[t].code) == BPF_JMP ||
8036 BPF_CLASS(insns[t].code) == BPF_JMP32) {
8037 u8 opcode = BPF_OP(insns[t].code);
8039 if (opcode == BPF_EXIT) {
8041 } else if (opcode == BPF_CALL) {
8042 ret = push_insn(t, t + 1, FALLTHROUGH, env, false);
8047 if (t + 1 < insn_cnt)
8048 init_explored_state(env, t + 1);
8049 if (insns[t].src_reg == BPF_PSEUDO_CALL) {
8050 init_explored_state(env, t);
8051 ret = push_insn(t, t + insns[t].imm + 1, BRANCH,
8058 } else if (opcode == BPF_JA) {
8059 if (BPF_SRC(insns[t].code) != BPF_K) {
8063 /* unconditional jump with single edge */
8064 ret = push_insn(t, t + insns[t].off + 1,
8065 FALLTHROUGH, env, true);
8070 /* unconditional jmp is not a good pruning point,
8071 * but it's marked, since backtracking needs
8072 * to record jmp history in is_state_visited().
8074 init_explored_state(env, t + insns[t].off + 1);
8075 /* tell verifier to check for equivalent states
8076 * after every call and jump
8078 if (t + 1 < insn_cnt)
8079 init_explored_state(env, t + 1);
8081 /* conditional jump with two edges */
8082 init_explored_state(env, t);
8083 ret = push_insn(t, t + 1, FALLTHROUGH, env, true);
8089 ret = push_insn(t, t + insns[t].off + 1, BRANCH, env, true);
8096 /* all other non-branch instructions with single
8099 ret = push_insn(t, t + 1, FALLTHROUGH, env, false);
8107 insn_state[t] = EXPLORED;
8108 if (env->cfg.cur_stack-- <= 0) {
8109 verbose(env, "pop stack internal bug\n");
8116 for (i = 0; i < insn_cnt; i++) {
8117 if (insn_state[i] != EXPLORED) {
8118 verbose(env, "unreachable insn %d\n", i);
8123 ret = 0; /* cfg looks good */
8128 env->cfg.insn_state = env->cfg.insn_stack = NULL;
8132 static int check_abnormal_return(struct bpf_verifier_env *env)
8136 for (i = 1; i < env->subprog_cnt; i++) {
8137 if (env->subprog_info[i].has_ld_abs) {
8138 verbose(env, "LD_ABS is not allowed in subprogs without BTF\n");
8141 if (env->subprog_info[i].has_tail_call) {
8142 verbose(env, "tail_call is not allowed in subprogs without BTF\n");
8149 /* The minimum supported BTF func info size */
8150 #define MIN_BPF_FUNCINFO_SIZE 8
8151 #define MAX_FUNCINFO_REC_SIZE 252
8153 static int check_btf_func(struct bpf_verifier_env *env,
8154 const union bpf_attr *attr,
8155 union bpf_attr __user *uattr)
8157 const struct btf_type *type, *func_proto, *ret_type;
8158 u32 i, nfuncs, urec_size, min_size;
8159 u32 krec_size = sizeof(struct bpf_func_info);
8160 struct bpf_func_info *krecord;
8161 struct bpf_func_info_aux *info_aux = NULL;
8162 struct bpf_prog *prog;
8163 const struct btf *btf;
8164 void __user *urecord;
8165 u32 prev_offset = 0;
8169 nfuncs = attr->func_info_cnt;
8171 if (check_abnormal_return(env))
8176 if (nfuncs != env->subprog_cnt) {
8177 verbose(env, "number of funcs in func_info doesn't match number of subprogs\n");
8181 urec_size = attr->func_info_rec_size;
8182 if (urec_size < MIN_BPF_FUNCINFO_SIZE ||
8183 urec_size > MAX_FUNCINFO_REC_SIZE ||
8184 urec_size % sizeof(u32)) {
8185 verbose(env, "invalid func info rec size %u\n", urec_size);
8190 btf = prog->aux->btf;
8192 urecord = u64_to_user_ptr(attr->func_info);
8193 min_size = min_t(u32, krec_size, urec_size);
8195 krecord = kvcalloc(nfuncs, krec_size, GFP_KERNEL | __GFP_NOWARN);
8198 info_aux = kcalloc(nfuncs, sizeof(*info_aux), GFP_KERNEL | __GFP_NOWARN);
8202 for (i = 0; i < nfuncs; i++) {
8203 ret = bpf_check_uarg_tail_zero(urecord, krec_size, urec_size);
8205 if (ret == -E2BIG) {
8206 verbose(env, "nonzero tailing record in func info");
8207 /* set the size kernel expects so loader can zero
8208 * out the rest of the record.
8210 if (put_user(min_size, &uattr->func_info_rec_size))
8216 if (copy_from_user(&krecord[i], urecord, min_size)) {
8221 /* check insn_off */
8224 if (krecord[i].insn_off) {
8226 "nonzero insn_off %u for the first func info record",
8227 krecord[i].insn_off);
8230 } else if (krecord[i].insn_off <= prev_offset) {
8232 "same or smaller insn offset (%u) than previous func info record (%u)",
8233 krecord[i].insn_off, prev_offset);
8237 if (env->subprog_info[i].start != krecord[i].insn_off) {
8238 verbose(env, "func_info BTF section doesn't match subprog layout in BPF program\n");
8243 type = btf_type_by_id(btf, krecord[i].type_id);
8244 if (!type || !btf_type_is_func(type)) {
8245 verbose(env, "invalid type id %d in func info",
8246 krecord[i].type_id);
8249 info_aux[i].linkage = BTF_INFO_VLEN(type->info);
8251 func_proto = btf_type_by_id(btf, type->type);
8252 if (unlikely(!func_proto || !btf_type_is_func_proto(func_proto)))
8253 /* btf_func_check() already verified it during BTF load */
8255 ret_type = btf_type_skip_modifiers(btf, func_proto->type, NULL);
8257 btf_type_is_small_int(ret_type) || btf_type_is_enum(ret_type);
8258 if (i && !scalar_return && env->subprog_info[i].has_ld_abs) {
8259 verbose(env, "LD_ABS is only allowed in functions that return 'int'.\n");
8262 if (i && !scalar_return && env->subprog_info[i].has_tail_call) {
8263 verbose(env, "tail_call is only allowed in functions that return 'int'.\n");
8267 prev_offset = krecord[i].insn_off;
8268 urecord += urec_size;
8271 prog->aux->func_info = krecord;
8272 prog->aux->func_info_cnt = nfuncs;
8273 prog->aux->func_info_aux = info_aux;
8282 static void adjust_btf_func(struct bpf_verifier_env *env)
8284 struct bpf_prog_aux *aux = env->prog->aux;
8287 if (!aux->func_info)
8290 for (i = 0; i < env->subprog_cnt; i++)
8291 aux->func_info[i].insn_off = env->subprog_info[i].start;
8294 #define MIN_BPF_LINEINFO_SIZE (offsetof(struct bpf_line_info, line_col) + \
8295 sizeof(((struct bpf_line_info *)(0))->line_col))
8296 #define MAX_LINEINFO_REC_SIZE MAX_FUNCINFO_REC_SIZE
8298 static int check_btf_line(struct bpf_verifier_env *env,
8299 const union bpf_attr *attr,
8300 union bpf_attr __user *uattr)
8302 u32 i, s, nr_linfo, ncopy, expected_size, rec_size, prev_offset = 0;
8303 struct bpf_subprog_info *sub;
8304 struct bpf_line_info *linfo;
8305 struct bpf_prog *prog;
8306 const struct btf *btf;
8307 void __user *ulinfo;
8310 nr_linfo = attr->line_info_cnt;
8314 rec_size = attr->line_info_rec_size;
8315 if (rec_size < MIN_BPF_LINEINFO_SIZE ||
8316 rec_size > MAX_LINEINFO_REC_SIZE ||
8317 rec_size & (sizeof(u32) - 1))
8320 /* Need to zero it in case the userspace may
8321 * pass in a smaller bpf_line_info object.
8323 linfo = kvcalloc(nr_linfo, sizeof(struct bpf_line_info),
8324 GFP_KERNEL | __GFP_NOWARN);
8329 btf = prog->aux->btf;
8332 sub = env->subprog_info;
8333 ulinfo = u64_to_user_ptr(attr->line_info);
8334 expected_size = sizeof(struct bpf_line_info);
8335 ncopy = min_t(u32, expected_size, rec_size);
8336 for (i = 0; i < nr_linfo; i++) {
8337 err = bpf_check_uarg_tail_zero(ulinfo, expected_size, rec_size);
8339 if (err == -E2BIG) {
8340 verbose(env, "nonzero tailing record in line_info");
8341 if (put_user(expected_size,
8342 &uattr->line_info_rec_size))
8348 if (copy_from_user(&linfo[i], ulinfo, ncopy)) {
8354 * Check insn_off to ensure
8355 * 1) strictly increasing AND
8356 * 2) bounded by prog->len
8358 * The linfo[0].insn_off == 0 check logically falls into
8359 * the later "missing bpf_line_info for func..." case
8360 * because the first linfo[0].insn_off must be the
8361 * first sub also and the first sub must have
8362 * subprog_info[0].start == 0.
8364 if ((i && linfo[i].insn_off <= prev_offset) ||
8365 linfo[i].insn_off >= prog->len) {
8366 verbose(env, "Invalid line_info[%u].insn_off:%u (prev_offset:%u prog->len:%u)\n",
8367 i, linfo[i].insn_off, prev_offset,
8373 if (!prog->insnsi[linfo[i].insn_off].code) {
8375 "Invalid insn code at line_info[%u].insn_off\n",
8381 if (!btf_name_by_offset(btf, linfo[i].line_off) ||
8382 !btf_name_by_offset(btf, linfo[i].file_name_off)) {
8383 verbose(env, "Invalid line_info[%u].line_off or .file_name_off\n", i);
8388 if (s != env->subprog_cnt) {
8389 if (linfo[i].insn_off == sub[s].start) {
8390 sub[s].linfo_idx = i;
8392 } else if (sub[s].start < linfo[i].insn_off) {
8393 verbose(env, "missing bpf_line_info for func#%u\n", s);
8399 prev_offset = linfo[i].insn_off;
8403 if (s != env->subprog_cnt) {
8404 verbose(env, "missing bpf_line_info for %u funcs starting from func#%u\n",
8405 env->subprog_cnt - s, s);
8410 prog->aux->linfo = linfo;
8411 prog->aux->nr_linfo = nr_linfo;
8420 static int check_btf_info(struct bpf_verifier_env *env,
8421 const union bpf_attr *attr,
8422 union bpf_attr __user *uattr)
8427 if (!attr->func_info_cnt && !attr->line_info_cnt) {
8428 if (check_abnormal_return(env))
8433 btf = btf_get_by_fd(attr->prog_btf_fd);
8435 return PTR_ERR(btf);
8436 env->prog->aux->btf = btf;
8438 err = check_btf_func(env, attr, uattr);
8442 err = check_btf_line(env, attr, uattr);
8449 /* check %cur's range satisfies %old's */
8450 static bool range_within(struct bpf_reg_state *old,
8451 struct bpf_reg_state *cur)
8453 return old->umin_value <= cur->umin_value &&
8454 old->umax_value >= cur->umax_value &&
8455 old->smin_value <= cur->smin_value &&
8456 old->smax_value >= cur->smax_value;
8459 /* Maximum number of register states that can exist at once */
8460 #define ID_MAP_SIZE (MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE)
8466 /* If in the old state two registers had the same id, then they need to have
8467 * the same id in the new state as well. But that id could be different from
8468 * the old state, so we need to track the mapping from old to new ids.
8469 * Once we have seen that, say, a reg with old id 5 had new id 9, any subsequent
8470 * regs with old id 5 must also have new id 9 for the new state to be safe. But
8471 * regs with a different old id could still have new id 9, we don't care about
8473 * So we look through our idmap to see if this old id has been seen before. If
8474 * so, we require the new id to match; otherwise, we add the id pair to the map.
8476 static bool check_ids(u32 old_id, u32 cur_id, struct idpair *idmap)
8480 for (i = 0; i < ID_MAP_SIZE; i++) {
8481 if (!idmap[i].old) {
8482 /* Reached an empty slot; haven't seen this id before */
8483 idmap[i].old = old_id;
8484 idmap[i].cur = cur_id;
8487 if (idmap[i].old == old_id)
8488 return idmap[i].cur == cur_id;
8490 /* We ran out of idmap slots, which should be impossible */
8495 static void clean_func_state(struct bpf_verifier_env *env,
8496 struct bpf_func_state *st)
8498 enum bpf_reg_liveness live;
8501 for (i = 0; i < BPF_REG_FP; i++) {
8502 live = st->regs[i].live;
8503 /* liveness must not touch this register anymore */
8504 st->regs[i].live |= REG_LIVE_DONE;
8505 if (!(live & REG_LIVE_READ))
8506 /* since the register is unused, clear its state
8507 * to make further comparison simpler
8509 __mark_reg_not_init(env, &st->regs[i]);
8512 for (i = 0; i < st->allocated_stack / BPF_REG_SIZE; i++) {
8513 live = st->stack[i].spilled_ptr.live;
8514 /* liveness must not touch this stack slot anymore */
8515 st->stack[i].spilled_ptr.live |= REG_LIVE_DONE;
8516 if (!(live & REG_LIVE_READ)) {
8517 __mark_reg_not_init(env, &st->stack[i].spilled_ptr);
8518 for (j = 0; j < BPF_REG_SIZE; j++)
8519 st->stack[i].slot_type[j] = STACK_INVALID;
8524 static void clean_verifier_state(struct bpf_verifier_env *env,
8525 struct bpf_verifier_state *st)
8529 if (st->frame[0]->regs[0].live & REG_LIVE_DONE)
8530 /* all regs in this state in all frames were already marked */
8533 for (i = 0; i <= st->curframe; i++)
8534 clean_func_state(env, st->frame[i]);
8537 /* the parentage chains form a tree.
8538 * the verifier states are added to state lists at given insn and
8539 * pushed into state stack for future exploration.
8540 * when the verifier reaches bpf_exit insn some of the verifer states
8541 * stored in the state lists have their final liveness state already,
8542 * but a lot of states will get revised from liveness point of view when
8543 * the verifier explores other branches.
8546 * 2: if r1 == 100 goto pc+1
8549 * when the verifier reaches exit insn the register r0 in the state list of
8550 * insn 2 will be seen as !REG_LIVE_READ. Then the verifier pops the other_branch
8551 * of insn 2 and goes exploring further. At the insn 4 it will walk the
8552 * parentage chain from insn 4 into insn 2 and will mark r0 as REG_LIVE_READ.
8554 * Since the verifier pushes the branch states as it sees them while exploring
8555 * the program the condition of walking the branch instruction for the second
8556 * time means that all states below this branch were already explored and
8557 * their final liveness markes are already propagated.
8558 * Hence when the verifier completes the search of state list in is_state_visited()
8559 * we can call this clean_live_states() function to mark all liveness states
8560 * as REG_LIVE_DONE to indicate that 'parent' pointers of 'struct bpf_reg_state'
8562 * This function also clears the registers and stack for states that !READ
8563 * to simplify state merging.
8565 * Important note here that walking the same branch instruction in the callee
8566 * doesn't meant that the states are DONE. The verifier has to compare
8569 static void clean_live_states(struct bpf_verifier_env *env, int insn,
8570 struct bpf_verifier_state *cur)
8572 struct bpf_verifier_state_list *sl;
8575 sl = *explored_state(env, insn);
8577 if (sl->state.branches)
8579 if (sl->state.insn_idx != insn ||
8580 sl->state.curframe != cur->curframe)
8582 for (i = 0; i <= cur->curframe; i++)
8583 if (sl->state.frame[i]->callsite != cur->frame[i]->callsite)
8585 clean_verifier_state(env, &sl->state);
8591 /* Returns true if (rold safe implies rcur safe) */
8592 static bool regsafe(struct bpf_reg_state *rold, struct bpf_reg_state *rcur,
8593 struct idpair *idmap)
8597 if (!(rold->live & REG_LIVE_READ))
8598 /* explored state didn't use this */
8601 equal = memcmp(rold, rcur, offsetof(struct bpf_reg_state, parent)) == 0;
8603 if (rold->type == PTR_TO_STACK)
8604 /* two stack pointers are equal only if they're pointing to
8605 * the same stack frame, since fp-8 in foo != fp-8 in bar
8607 return equal && rold->frameno == rcur->frameno;
8612 if (rold->type == NOT_INIT)
8613 /* explored state can't have used this */
8615 if (rcur->type == NOT_INIT)
8617 switch (rold->type) {
8619 if (rcur->type == SCALAR_VALUE) {
8620 if (!rold->precise && !rcur->precise)
8622 /* new val must satisfy old val knowledge */
8623 return range_within(rold, rcur) &&
8624 tnum_in(rold->var_off, rcur->var_off);
8626 /* We're trying to use a pointer in place of a scalar.
8627 * Even if the scalar was unbounded, this could lead to
8628 * pointer leaks because scalars are allowed to leak
8629 * while pointers are not. We could make this safe in
8630 * special cases if root is calling us, but it's
8631 * probably not worth the hassle.
8635 case PTR_TO_MAP_VALUE:
8636 /* If the new min/max/var_off satisfy the old ones and
8637 * everything else matches, we are OK.
8638 * 'id' is not compared, since it's only used for maps with
8639 * bpf_spin_lock inside map element and in such cases if
8640 * the rest of the prog is valid for one map element then
8641 * it's valid for all map elements regardless of the key
8642 * used in bpf_map_lookup()
8644 return memcmp(rold, rcur, offsetof(struct bpf_reg_state, id)) == 0 &&
8645 range_within(rold, rcur) &&
8646 tnum_in(rold->var_off, rcur->var_off);
8647 case PTR_TO_MAP_VALUE_OR_NULL:
8648 /* a PTR_TO_MAP_VALUE could be safe to use as a
8649 * PTR_TO_MAP_VALUE_OR_NULL into the same map.
8650 * However, if the old PTR_TO_MAP_VALUE_OR_NULL then got NULL-
8651 * checked, doing so could have affected others with the same
8652 * id, and we can't check for that because we lost the id when
8653 * we converted to a PTR_TO_MAP_VALUE.
8655 if (rcur->type != PTR_TO_MAP_VALUE_OR_NULL)
8657 if (memcmp(rold, rcur, offsetof(struct bpf_reg_state, id)))
8659 /* Check our ids match any regs they're supposed to */
8660 return check_ids(rold->id, rcur->id, idmap);
8661 case PTR_TO_PACKET_META:
8663 if (rcur->type != rold->type)
8665 /* We must have at least as much range as the old ptr
8666 * did, so that any accesses which were safe before are
8667 * still safe. This is true even if old range < old off,
8668 * since someone could have accessed through (ptr - k), or
8669 * even done ptr -= k in a register, to get a safe access.
8671 if (rold->range > rcur->range)
8673 /* If the offsets don't match, we can't trust our alignment;
8674 * nor can we be sure that we won't fall out of range.
8676 if (rold->off != rcur->off)
8678 /* id relations must be preserved */
8679 if (rold->id && !check_ids(rold->id, rcur->id, idmap))
8681 /* new val must satisfy old val knowledge */
8682 return range_within(rold, rcur) &&
8683 tnum_in(rold->var_off, rcur->var_off);
8685 case CONST_PTR_TO_MAP:
8686 case PTR_TO_PACKET_END:
8687 case PTR_TO_FLOW_KEYS:
8689 case PTR_TO_SOCKET_OR_NULL:
8690 case PTR_TO_SOCK_COMMON:
8691 case PTR_TO_SOCK_COMMON_OR_NULL:
8692 case PTR_TO_TCP_SOCK:
8693 case PTR_TO_TCP_SOCK_OR_NULL:
8694 case PTR_TO_XDP_SOCK:
8695 /* Only valid matches are exact, which memcmp() above
8696 * would have accepted
8699 /* Don't know what's going on, just say it's not safe */
8703 /* Shouldn't get here; if we do, say it's not safe */
8708 static bool stacksafe(struct bpf_func_state *old,
8709 struct bpf_func_state *cur,
8710 struct idpair *idmap)
8714 /* walk slots of the explored stack and ignore any additional
8715 * slots in the current stack, since explored(safe) state
8718 for (i = 0; i < old->allocated_stack; i++) {
8719 spi = i / BPF_REG_SIZE;
8721 if (!(old->stack[spi].spilled_ptr.live & REG_LIVE_READ)) {
8722 i += BPF_REG_SIZE - 1;
8723 /* explored state didn't use this */
8727 if (old->stack[spi].slot_type[i % BPF_REG_SIZE] == STACK_INVALID)
8730 /* explored stack has more populated slots than current stack
8731 * and these slots were used
8733 if (i >= cur->allocated_stack)
8736 /* if old state was safe with misc data in the stack
8737 * it will be safe with zero-initialized stack.
8738 * The opposite is not true
8740 if (old->stack[spi].slot_type[i % BPF_REG_SIZE] == STACK_MISC &&
8741 cur->stack[spi].slot_type[i % BPF_REG_SIZE] == STACK_ZERO)
8743 if (old->stack[spi].slot_type[i % BPF_REG_SIZE] !=
8744 cur->stack[spi].slot_type[i % BPF_REG_SIZE])
8745 /* Ex: old explored (safe) state has STACK_SPILL in
8746 * this stack slot, but current has STACK_MISC ->
8747 * this verifier states are not equivalent,
8748 * return false to continue verification of this path
8751 if (i % BPF_REG_SIZE)
8753 if (old->stack[spi].slot_type[0] != STACK_SPILL)
8755 if (!regsafe(&old->stack[spi].spilled_ptr,
8756 &cur->stack[spi].spilled_ptr,
8758 /* when explored and current stack slot are both storing
8759 * spilled registers, check that stored pointers types
8760 * are the same as well.
8761 * Ex: explored safe path could have stored
8762 * (bpf_reg_state) {.type = PTR_TO_STACK, .off = -8}
8763 * but current path has stored:
8764 * (bpf_reg_state) {.type = PTR_TO_STACK, .off = -16}
8765 * such verifier states are not equivalent.
8766 * return false to continue verification of this path
8773 static bool refsafe(struct bpf_func_state *old, struct bpf_func_state *cur)
8775 if (old->acquired_refs != cur->acquired_refs)
8777 return !memcmp(old->refs, cur->refs,
8778 sizeof(*old->refs) * old->acquired_refs);
8781 /* compare two verifier states
8783 * all states stored in state_list are known to be valid, since
8784 * verifier reached 'bpf_exit' instruction through them
8786 * this function is called when verifier exploring different branches of
8787 * execution popped from the state stack. If it sees an old state that has
8788 * more strict register state and more strict stack state then this execution
8789 * branch doesn't need to be explored further, since verifier already
8790 * concluded that more strict state leads to valid finish.
8792 * Therefore two states are equivalent if register state is more conservative
8793 * and explored stack state is more conservative than the current one.
8796 * (slot1=INV slot2=MISC) == (slot1=MISC slot2=MISC)
8797 * (slot1=MISC slot2=MISC) != (slot1=INV slot2=MISC)
8799 * In other words if current stack state (one being explored) has more
8800 * valid slots than old one that already passed validation, it means
8801 * the verifier can stop exploring and conclude that current state is valid too
8803 * Similarly with registers. If explored state has register type as invalid
8804 * whereas register type in current state is meaningful, it means that
8805 * the current state will reach 'bpf_exit' instruction safely
8807 static bool func_states_equal(struct bpf_func_state *old,
8808 struct bpf_func_state *cur)
8810 struct idpair *idmap;
8814 idmap = kcalloc(ID_MAP_SIZE, sizeof(struct idpair), GFP_KERNEL);
8815 /* If we failed to allocate the idmap, just say it's not safe */
8819 for (i = 0; i < MAX_BPF_REG; i++) {
8820 if (!regsafe(&old->regs[i], &cur->regs[i], idmap))
8824 if (!stacksafe(old, cur, idmap))
8827 if (!refsafe(old, cur))
8835 static bool states_equal(struct bpf_verifier_env *env,
8836 struct bpf_verifier_state *old,
8837 struct bpf_verifier_state *cur)
8841 if (old->curframe != cur->curframe)
8844 /* Verification state from speculative execution simulation
8845 * must never prune a non-speculative execution one.
8847 if (old->speculative && !cur->speculative)
8850 if (old->active_spin_lock != cur->active_spin_lock)
8853 /* for states to be equal callsites have to be the same
8854 * and all frame states need to be equivalent
8856 for (i = 0; i <= old->curframe; i++) {
8857 if (old->frame[i]->callsite != cur->frame[i]->callsite)
8859 if (!func_states_equal(old->frame[i], cur->frame[i]))
8865 /* Return 0 if no propagation happened. Return negative error code if error
8866 * happened. Otherwise, return the propagated bit.
8868 static int propagate_liveness_reg(struct bpf_verifier_env *env,
8869 struct bpf_reg_state *reg,
8870 struct bpf_reg_state *parent_reg)
8872 u8 parent_flag = parent_reg->live & REG_LIVE_READ;
8873 u8 flag = reg->live & REG_LIVE_READ;
8876 /* When comes here, read flags of PARENT_REG or REG could be any of
8877 * REG_LIVE_READ64, REG_LIVE_READ32, REG_LIVE_NONE. There is no need
8878 * of propagation if PARENT_REG has strongest REG_LIVE_READ64.
8880 if (parent_flag == REG_LIVE_READ64 ||
8881 /* Or if there is no read flag from REG. */
8883 /* Or if the read flag from REG is the same as PARENT_REG. */
8884 parent_flag == flag)
8887 err = mark_reg_read(env, reg, parent_reg, flag);
8894 /* A write screens off any subsequent reads; but write marks come from the
8895 * straight-line code between a state and its parent. When we arrive at an
8896 * equivalent state (jump target or such) we didn't arrive by the straight-line
8897 * code, so read marks in the state must propagate to the parent regardless
8898 * of the state's write marks. That's what 'parent == state->parent' comparison
8899 * in mark_reg_read() is for.
8901 static int propagate_liveness(struct bpf_verifier_env *env,
8902 const struct bpf_verifier_state *vstate,
8903 struct bpf_verifier_state *vparent)
8905 struct bpf_reg_state *state_reg, *parent_reg;
8906 struct bpf_func_state *state, *parent;
8907 int i, frame, err = 0;
8909 if (vparent->curframe != vstate->curframe) {
8910 WARN(1, "propagate_live: parent frame %d current frame %d\n",
8911 vparent->curframe, vstate->curframe);
8914 /* Propagate read liveness of registers... */
8915 BUILD_BUG_ON(BPF_REG_FP + 1 != MAX_BPF_REG);
8916 for (frame = 0; frame <= vstate->curframe; frame++) {
8917 parent = vparent->frame[frame];
8918 state = vstate->frame[frame];
8919 parent_reg = parent->regs;
8920 state_reg = state->regs;
8921 /* We don't need to worry about FP liveness, it's read-only */
8922 for (i = frame < vstate->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++) {
8923 err = propagate_liveness_reg(env, &state_reg[i],
8927 if (err == REG_LIVE_READ64)
8928 mark_insn_zext(env, &parent_reg[i]);
8931 /* Propagate stack slots. */
8932 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE &&
8933 i < parent->allocated_stack / BPF_REG_SIZE; i++) {
8934 parent_reg = &parent->stack[i].spilled_ptr;
8935 state_reg = &state->stack[i].spilled_ptr;
8936 err = propagate_liveness_reg(env, state_reg,
8945 /* find precise scalars in the previous equivalent state and
8946 * propagate them into the current state
8948 static int propagate_precision(struct bpf_verifier_env *env,
8949 const struct bpf_verifier_state *old)
8951 struct bpf_reg_state *state_reg;
8952 struct bpf_func_state *state;
8955 state = old->frame[old->curframe];
8956 state_reg = state->regs;
8957 for (i = 0; i < BPF_REG_FP; i++, state_reg++) {
8958 if (state_reg->type != SCALAR_VALUE ||
8959 !state_reg->precise)
8961 if (env->log.level & BPF_LOG_LEVEL2)
8962 verbose(env, "propagating r%d\n", i);
8963 err = mark_chain_precision(env, i);
8968 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) {
8969 if (state->stack[i].slot_type[0] != STACK_SPILL)
8971 state_reg = &state->stack[i].spilled_ptr;
8972 if (state_reg->type != SCALAR_VALUE ||
8973 !state_reg->precise)
8975 if (env->log.level & BPF_LOG_LEVEL2)
8976 verbose(env, "propagating fp%d\n",
8977 (-i - 1) * BPF_REG_SIZE);
8978 err = mark_chain_precision_stack(env, i);
8985 static bool states_maybe_looping(struct bpf_verifier_state *old,
8986 struct bpf_verifier_state *cur)
8988 struct bpf_func_state *fold, *fcur;
8989 int i, fr = cur->curframe;
8991 if (old->curframe != fr)
8994 fold = old->frame[fr];
8995 fcur = cur->frame[fr];
8996 for (i = 0; i < MAX_BPF_REG; i++)
8997 if (memcmp(&fold->regs[i], &fcur->regs[i],
8998 offsetof(struct bpf_reg_state, parent)))
9004 static int is_state_visited(struct bpf_verifier_env *env, int insn_idx)
9006 struct bpf_verifier_state_list *new_sl;
9007 struct bpf_verifier_state_list *sl, **pprev;
9008 struct bpf_verifier_state *cur = env->cur_state, *new;
9009 int i, j, err, states_cnt = 0;
9010 bool add_new_state = env->test_state_freq ? true : false;
9012 cur->last_insn_idx = env->prev_insn_idx;
9013 if (!env->insn_aux_data[insn_idx].prune_point)
9014 /* this 'insn_idx' instruction wasn't marked, so we will not
9015 * be doing state search here
9019 /* bpf progs typically have pruning point every 4 instructions
9020 * http://vger.kernel.org/bpfconf2019.html#session-1
9021 * Do not add new state for future pruning if the verifier hasn't seen
9022 * at least 2 jumps and at least 8 instructions.
9023 * This heuristics helps decrease 'total_states' and 'peak_states' metric.
9024 * In tests that amounts to up to 50% reduction into total verifier
9025 * memory consumption and 20% verifier time speedup.
9027 if (env->jmps_processed - env->prev_jmps_processed >= 2 &&
9028 env->insn_processed - env->prev_insn_processed >= 8)
9029 add_new_state = true;
9031 pprev = explored_state(env, insn_idx);
9034 clean_live_states(env, insn_idx, cur);
9038 if (sl->state.insn_idx != insn_idx)
9040 if (sl->state.branches) {
9041 if (states_maybe_looping(&sl->state, cur) &&
9042 states_equal(env, &sl->state, cur)) {
9043 verbose_linfo(env, insn_idx, "; ");
9044 verbose(env, "infinite loop detected at insn %d\n", insn_idx);
9047 /* if the verifier is processing a loop, avoid adding new state
9048 * too often, since different loop iterations have distinct
9049 * states and may not help future pruning.
9050 * This threshold shouldn't be too low to make sure that
9051 * a loop with large bound will be rejected quickly.
9052 * The most abusive loop will be:
9054 * if r1 < 1000000 goto pc-2
9055 * 1M insn_procssed limit / 100 == 10k peak states.
9056 * This threshold shouldn't be too high either, since states
9057 * at the end of the loop are likely to be useful in pruning.
9059 if (env->jmps_processed - env->prev_jmps_processed < 20 &&
9060 env->insn_processed - env->prev_insn_processed < 100)
9061 add_new_state = false;
9064 if (states_equal(env, &sl->state, cur)) {
9066 /* reached equivalent register/stack state,
9068 * Registers read by the continuation are read by us.
9069 * If we have any write marks in env->cur_state, they
9070 * will prevent corresponding reads in the continuation
9071 * from reaching our parent (an explored_state). Our
9072 * own state will get the read marks recorded, but
9073 * they'll be immediately forgotten as we're pruning
9074 * this state and will pop a new one.
9076 err = propagate_liveness(env, &sl->state, cur);
9078 /* if previous state reached the exit with precision and
9079 * current state is equivalent to it (except precsion marks)
9080 * the precision needs to be propagated back in
9081 * the current state.
9083 err = err ? : push_jmp_history(env, cur);
9084 err = err ? : propagate_precision(env, &sl->state);
9090 /* when new state is not going to be added do not increase miss count.
9091 * Otherwise several loop iterations will remove the state
9092 * recorded earlier. The goal of these heuristics is to have
9093 * states from some iterations of the loop (some in the beginning
9094 * and some at the end) to help pruning.
9098 /* heuristic to determine whether this state is beneficial
9099 * to keep checking from state equivalence point of view.
9100 * Higher numbers increase max_states_per_insn and verification time,
9101 * but do not meaningfully decrease insn_processed.
9103 if (sl->miss_cnt > sl->hit_cnt * 3 + 3) {
9104 /* the state is unlikely to be useful. Remove it to
9105 * speed up verification
9108 if (sl->state.frame[0]->regs[0].live & REG_LIVE_DONE) {
9109 u32 br = sl->state.branches;
9112 "BUG live_done but branches_to_explore %d\n",
9114 free_verifier_state(&sl->state, false);
9118 /* cannot free this state, since parentage chain may
9119 * walk it later. Add it for free_list instead to
9120 * be freed at the end of verification
9122 sl->next = env->free_list;
9123 env->free_list = sl;
9133 if (env->max_states_per_insn < states_cnt)
9134 env->max_states_per_insn = states_cnt;
9136 if (!env->bpf_capable && states_cnt > BPF_COMPLEXITY_LIMIT_STATES)
9137 return push_jmp_history(env, cur);
9140 return push_jmp_history(env, cur);
9142 /* There were no equivalent states, remember the current one.
9143 * Technically the current state is not proven to be safe yet,
9144 * but it will either reach outer most bpf_exit (which means it's safe)
9145 * or it will be rejected. When there are no loops the verifier won't be
9146 * seeing this tuple (frame[0].callsite, frame[1].callsite, .. insn_idx)
9147 * again on the way to bpf_exit.
9148 * When looping the sl->state.branches will be > 0 and this state
9149 * will not be considered for equivalence until branches == 0.
9151 new_sl = kzalloc(sizeof(struct bpf_verifier_state_list), GFP_KERNEL);
9154 env->total_states++;
9156 env->prev_jmps_processed = env->jmps_processed;
9157 env->prev_insn_processed = env->insn_processed;
9159 /* add new state to the head of linked list */
9160 new = &new_sl->state;
9161 err = copy_verifier_state(new, cur);
9163 free_verifier_state(new, false);
9167 new->insn_idx = insn_idx;
9168 WARN_ONCE(new->branches != 1,
9169 "BUG is_state_visited:branches_to_explore=%d insn %d\n", new->branches, insn_idx);
9172 cur->first_insn_idx = insn_idx;
9173 clear_jmp_history(cur);
9174 new_sl->next = *explored_state(env, insn_idx);
9175 *explored_state(env, insn_idx) = new_sl;
9176 /* connect new state to parentage chain. Current frame needs all
9177 * registers connected. Only r6 - r9 of the callers are alive (pushed
9178 * to the stack implicitly by JITs) so in callers' frames connect just
9179 * r6 - r9 as an optimization. Callers will have r1 - r5 connected to
9180 * the state of the call instruction (with WRITTEN set), and r0 comes
9181 * from callee with its full parentage chain, anyway.
9183 /* clear write marks in current state: the writes we did are not writes
9184 * our child did, so they don't screen off its reads from us.
9185 * (There are no read marks in current state, because reads always mark
9186 * their parent and current state never has children yet. Only
9187 * explored_states can get read marks.)
9189 for (j = 0; j <= cur->curframe; j++) {
9190 for (i = j < cur->curframe ? BPF_REG_6 : 0; i < BPF_REG_FP; i++)
9191 cur->frame[j]->regs[i].parent = &new->frame[j]->regs[i];
9192 for (i = 0; i < BPF_REG_FP; i++)
9193 cur->frame[j]->regs[i].live = REG_LIVE_NONE;
9196 /* all stack frames are accessible from callee, clear them all */
9197 for (j = 0; j <= cur->curframe; j++) {
9198 struct bpf_func_state *frame = cur->frame[j];
9199 struct bpf_func_state *newframe = new->frame[j];
9201 for (i = 0; i < frame->allocated_stack / BPF_REG_SIZE; i++) {
9202 frame->stack[i].spilled_ptr.live = REG_LIVE_NONE;
9203 frame->stack[i].spilled_ptr.parent =
9204 &newframe->stack[i].spilled_ptr;
9210 /* Return true if it's OK to have the same insn return a different type. */
9211 static bool reg_type_mismatch_ok(enum bpf_reg_type type)
9216 case PTR_TO_SOCKET_OR_NULL:
9217 case PTR_TO_SOCK_COMMON:
9218 case PTR_TO_SOCK_COMMON_OR_NULL:
9219 case PTR_TO_TCP_SOCK:
9220 case PTR_TO_TCP_SOCK_OR_NULL:
9221 case PTR_TO_XDP_SOCK:
9223 case PTR_TO_BTF_ID_OR_NULL:
9230 /* If an instruction was previously used with particular pointer types, then we
9231 * need to be careful to avoid cases such as the below, where it may be ok
9232 * for one branch accessing the pointer, but not ok for the other branch:
9237 * R1 = some_other_valid_ptr;
9240 * R2 = *(u32 *)(R1 + 0);
9242 static bool reg_type_mismatch(enum bpf_reg_type src, enum bpf_reg_type prev)
9244 return src != prev && (!reg_type_mismatch_ok(src) ||
9245 !reg_type_mismatch_ok(prev));
9248 static int do_check(struct bpf_verifier_env *env)
9250 bool pop_log = !(env->log.level & BPF_LOG_LEVEL2);
9251 struct bpf_verifier_state *state = env->cur_state;
9252 struct bpf_insn *insns = env->prog->insnsi;
9253 struct bpf_reg_state *regs;
9254 int insn_cnt = env->prog->len;
9255 bool do_print_state = false;
9256 int prev_insn_idx = -1;
9259 struct bpf_insn *insn;
9263 env->prev_insn_idx = prev_insn_idx;
9264 if (env->insn_idx >= insn_cnt) {
9265 verbose(env, "invalid insn idx %d insn_cnt %d\n",
9266 env->insn_idx, insn_cnt);
9270 insn = &insns[env->insn_idx];
9271 class = BPF_CLASS(insn->code);
9273 if (++env->insn_processed > BPF_COMPLEXITY_LIMIT_INSNS) {
9275 "BPF program is too large. Processed %d insn\n",
9276 env->insn_processed);
9280 err = is_state_visited(env, env->insn_idx);
9284 /* found equivalent state, can prune the search */
9285 if (env->log.level & BPF_LOG_LEVEL) {
9287 verbose(env, "\nfrom %d to %d%s: safe\n",
9288 env->prev_insn_idx, env->insn_idx,
9289 env->cur_state->speculative ?
9290 " (speculative execution)" : "");
9292 verbose(env, "%d: safe\n", env->insn_idx);
9294 goto process_bpf_exit;
9297 if (signal_pending(current))
9303 if (env->log.level & BPF_LOG_LEVEL2 ||
9304 (env->log.level & BPF_LOG_LEVEL && do_print_state)) {
9305 if (env->log.level & BPF_LOG_LEVEL2)
9306 verbose(env, "%d:", env->insn_idx);
9308 verbose(env, "\nfrom %d to %d%s:",
9309 env->prev_insn_idx, env->insn_idx,
9310 env->cur_state->speculative ?
9311 " (speculative execution)" : "");
9312 print_verifier_state(env, state->frame[state->curframe]);
9313 do_print_state = false;
9316 if (env->log.level & BPF_LOG_LEVEL) {
9317 const struct bpf_insn_cbs cbs = {
9318 .cb_print = verbose,
9319 .private_data = env,
9322 verbose_linfo(env, env->insn_idx, "; ");
9323 verbose(env, "%d: ", env->insn_idx);
9324 print_bpf_insn(&cbs, insn, env->allow_ptr_leaks);
9327 if (bpf_prog_is_dev_bound(env->prog->aux)) {
9328 err = bpf_prog_offload_verify_insn(env, env->insn_idx,
9329 env->prev_insn_idx);
9334 regs = cur_regs(env);
9335 env->insn_aux_data[env->insn_idx].seen = env->pass_cnt;
9336 prev_insn_idx = env->insn_idx;
9338 if (class == BPF_ALU || class == BPF_ALU64) {
9339 err = check_alu_op(env, insn);
9343 } else if (class == BPF_LDX) {
9344 enum bpf_reg_type *prev_src_type, src_reg_type;
9346 /* check for reserved fields is already done */
9348 /* check src operand */
9349 err = check_reg_arg(env, insn->src_reg, SRC_OP);
9353 err = check_reg_arg(env, insn->dst_reg, DST_OP_NO_MARK);
9357 src_reg_type = regs[insn->src_reg].type;
9359 /* check that memory (src_reg + off) is readable,
9360 * the state of dst_reg will be updated by this func
9362 err = check_mem_access(env, env->insn_idx, insn->src_reg,
9363 insn->off, BPF_SIZE(insn->code),
9364 BPF_READ, insn->dst_reg, false);
9368 prev_src_type = &env->insn_aux_data[env->insn_idx].ptr_type;
9370 if (*prev_src_type == NOT_INIT) {
9372 * dst_reg = *(u32 *)(src_reg + off)
9373 * save type to validate intersecting paths
9375 *prev_src_type = src_reg_type;
9377 } else if (reg_type_mismatch(src_reg_type, *prev_src_type)) {
9378 /* ABuser program is trying to use the same insn
9379 * dst_reg = *(u32*) (src_reg + off)
9380 * with different pointer types:
9381 * src_reg == ctx in one branch and
9382 * src_reg == stack|map in some other branch.
9385 verbose(env, "same insn cannot be used with different pointers\n");
9389 } else if (class == BPF_STX) {
9390 enum bpf_reg_type *prev_dst_type, dst_reg_type;
9392 if (BPF_MODE(insn->code) == BPF_XADD) {
9393 err = check_xadd(env, env->insn_idx, insn);
9400 /* check src1 operand */
9401 err = check_reg_arg(env, insn->src_reg, SRC_OP);
9404 /* check src2 operand */
9405 err = check_reg_arg(env, insn->dst_reg, SRC_OP);
9409 dst_reg_type = regs[insn->dst_reg].type;
9411 /* check that memory (dst_reg + off) is writeable */
9412 err = check_mem_access(env, env->insn_idx, insn->dst_reg,
9413 insn->off, BPF_SIZE(insn->code),
9414 BPF_WRITE, insn->src_reg, false);
9418 prev_dst_type = &env->insn_aux_data[env->insn_idx].ptr_type;
9420 if (*prev_dst_type == NOT_INIT) {
9421 *prev_dst_type = dst_reg_type;
9422 } else if (reg_type_mismatch(dst_reg_type, *prev_dst_type)) {
9423 verbose(env, "same insn cannot be used with different pointers\n");
9427 } else if (class == BPF_ST) {
9428 if (BPF_MODE(insn->code) != BPF_MEM ||
9429 insn->src_reg != BPF_REG_0) {
9430 verbose(env, "BPF_ST uses reserved fields\n");
9433 /* check src operand */
9434 err = check_reg_arg(env, insn->dst_reg, SRC_OP);
9438 if (is_ctx_reg(env, insn->dst_reg)) {
9439 verbose(env, "BPF_ST stores into R%d %s is not allowed\n",
9441 reg_type_str[reg_state(env, insn->dst_reg)->type]);
9445 /* check that memory (dst_reg + off) is writeable */
9446 err = check_mem_access(env, env->insn_idx, insn->dst_reg,
9447 insn->off, BPF_SIZE(insn->code),
9448 BPF_WRITE, -1, false);
9452 } else if (class == BPF_JMP || class == BPF_JMP32) {
9453 u8 opcode = BPF_OP(insn->code);
9455 env->jmps_processed++;
9456 if (opcode == BPF_CALL) {
9457 if (BPF_SRC(insn->code) != BPF_K ||
9459 (insn->src_reg != BPF_REG_0 &&
9460 insn->src_reg != BPF_PSEUDO_CALL) ||
9461 insn->dst_reg != BPF_REG_0 ||
9462 class == BPF_JMP32) {
9463 verbose(env, "BPF_CALL uses reserved fields\n");
9467 if (env->cur_state->active_spin_lock &&
9468 (insn->src_reg == BPF_PSEUDO_CALL ||
9469 insn->imm != BPF_FUNC_spin_unlock)) {
9470 verbose(env, "function calls are not allowed while holding a lock\n");
9473 if (insn->src_reg == BPF_PSEUDO_CALL)
9474 err = check_func_call(env, insn, &env->insn_idx);
9476 err = check_helper_call(env, insn->imm, env->insn_idx);
9480 } else if (opcode == BPF_JA) {
9481 if (BPF_SRC(insn->code) != BPF_K ||
9483 insn->src_reg != BPF_REG_0 ||
9484 insn->dst_reg != BPF_REG_0 ||
9485 class == BPF_JMP32) {
9486 verbose(env, "BPF_JA uses reserved fields\n");
9490 env->insn_idx += insn->off + 1;
9493 } else if (opcode == BPF_EXIT) {
9494 if (BPF_SRC(insn->code) != BPF_K ||
9496 insn->src_reg != BPF_REG_0 ||
9497 insn->dst_reg != BPF_REG_0 ||
9498 class == BPF_JMP32) {
9499 verbose(env, "BPF_EXIT uses reserved fields\n");
9503 if (env->cur_state->active_spin_lock) {
9504 verbose(env, "bpf_spin_unlock is missing\n");
9508 if (state->curframe) {
9509 /* exit from nested function */
9510 err = prepare_func_exit(env, &env->insn_idx);
9513 do_print_state = true;
9517 err = check_reference_leak(env);
9521 err = check_return_code(env);
9525 update_branch_counts(env, env->cur_state);
9526 err = pop_stack(env, &prev_insn_idx,
9527 &env->insn_idx, pop_log);
9533 do_print_state = true;
9537 err = check_cond_jmp_op(env, insn, &env->insn_idx);
9541 } else if (class == BPF_LD) {
9542 u8 mode = BPF_MODE(insn->code);
9544 if (mode == BPF_ABS || mode == BPF_IND) {
9545 err = check_ld_abs(env, insn);
9549 } else if (mode == BPF_IMM) {
9550 err = check_ld_imm(env, insn);
9555 env->insn_aux_data[env->insn_idx].seen = env->pass_cnt;
9557 verbose(env, "invalid BPF_LD mode\n");
9561 verbose(env, "unknown insn class %d\n", class);
9571 /* replace pseudo btf_id with kernel symbol address */
9572 static int check_pseudo_btf_id(struct bpf_verifier_env *env,
9573 struct bpf_insn *insn,
9574 struct bpf_insn_aux_data *aux)
9576 u32 datasec_id, type, id = insn->imm;
9577 const struct btf_var_secinfo *vsi;
9578 const struct btf_type *datasec;
9579 const struct btf_type *t;
9580 const char *sym_name;
9581 bool percpu = false;
9586 verbose(env, "kernel is missing BTF, make sure CONFIG_DEBUG_INFO_BTF=y is specified in Kconfig.\n");
9590 if (insn[1].imm != 0) {
9591 verbose(env, "reserved field (insn[1].imm) is used in pseudo_btf_id ldimm64 insn.\n");
9595 t = btf_type_by_id(btf_vmlinux, id);
9597 verbose(env, "ldimm64 insn specifies invalid btf_id %d.\n", id);
9601 if (!btf_type_is_var(t)) {
9602 verbose(env, "pseudo btf_id %d in ldimm64 isn't KIND_VAR.\n",
9607 sym_name = btf_name_by_offset(btf_vmlinux, t->name_off);
9608 addr = kallsyms_lookup_name(sym_name);
9610 verbose(env, "ldimm64 failed to find the address for kernel symbol '%s'.\n",
9615 datasec_id = btf_find_by_name_kind(btf_vmlinux, ".data..percpu",
9617 if (datasec_id > 0) {
9618 datasec = btf_type_by_id(btf_vmlinux, datasec_id);
9619 for_each_vsi(i, datasec, vsi) {
9620 if (vsi->type == id) {
9627 insn[0].imm = (u32)addr;
9628 insn[1].imm = addr >> 32;
9631 t = btf_type_skip_modifiers(btf_vmlinux, type, NULL);
9633 aux->btf_var.reg_type = PTR_TO_PERCPU_BTF_ID;
9634 aux->btf_var.btf_id = type;
9635 } else if (!btf_type_is_struct(t)) {
9636 const struct btf_type *ret;
9640 /* resolve the type size of ksym. */
9641 ret = btf_resolve_size(btf_vmlinux, t, &tsize);
9643 tname = btf_name_by_offset(btf_vmlinux, t->name_off);
9644 verbose(env, "ldimm64 unable to resolve the size of type '%s': %ld\n",
9645 tname, PTR_ERR(ret));
9648 aux->btf_var.reg_type = PTR_TO_MEM;
9649 aux->btf_var.mem_size = tsize;
9651 aux->btf_var.reg_type = PTR_TO_BTF_ID;
9652 aux->btf_var.btf_id = type;
9657 static int check_map_prealloc(struct bpf_map *map)
9659 return (map->map_type != BPF_MAP_TYPE_HASH &&
9660 map->map_type != BPF_MAP_TYPE_PERCPU_HASH &&
9661 map->map_type != BPF_MAP_TYPE_HASH_OF_MAPS) ||
9662 !(map->map_flags & BPF_F_NO_PREALLOC);
9665 static bool is_tracing_prog_type(enum bpf_prog_type type)
9668 case BPF_PROG_TYPE_KPROBE:
9669 case BPF_PROG_TYPE_TRACEPOINT:
9670 case BPF_PROG_TYPE_PERF_EVENT:
9671 case BPF_PROG_TYPE_RAW_TRACEPOINT:
9678 static bool is_preallocated_map(struct bpf_map *map)
9680 if (!check_map_prealloc(map))
9682 if (map->inner_map_meta && !check_map_prealloc(map->inner_map_meta))
9687 static int check_map_prog_compatibility(struct bpf_verifier_env *env,
9688 struct bpf_map *map,
9689 struct bpf_prog *prog)
9692 enum bpf_prog_type prog_type = resolve_prog_type(prog);
9694 * Validate that trace type programs use preallocated hash maps.
9696 * For programs attached to PERF events this is mandatory as the
9697 * perf NMI can hit any arbitrary code sequence.
9699 * All other trace types using preallocated hash maps are unsafe as
9700 * well because tracepoint or kprobes can be inside locked regions
9701 * of the memory allocator or at a place where a recursion into the
9702 * memory allocator would see inconsistent state.
9704 * On RT enabled kernels run-time allocation of all trace type
9705 * programs is strictly prohibited due to lock type constraints. On
9706 * !RT kernels it is allowed for backwards compatibility reasons for
9707 * now, but warnings are emitted so developers are made aware of
9708 * the unsafety and can fix their programs before this is enforced.
9710 if (is_tracing_prog_type(prog_type) && !is_preallocated_map(map)) {
9711 if (prog_type == BPF_PROG_TYPE_PERF_EVENT) {
9712 verbose(env, "perf_event programs can only use preallocated hash map\n");
9715 if (IS_ENABLED(CONFIG_PREEMPT_RT)) {
9716 verbose(env, "trace type programs can only use preallocated hash map\n");
9719 WARN_ONCE(1, "trace type BPF program uses run-time allocation\n");
9720 verbose(env, "trace type programs with run-time allocated hash maps are unsafe. Switch to preallocated hash maps.\n");
9723 if ((is_tracing_prog_type(prog_type) ||
9724 prog_type == BPF_PROG_TYPE_SOCKET_FILTER) &&
9725 map_value_has_spin_lock(map)) {
9726 verbose(env, "tracing progs cannot use bpf_spin_lock yet\n");
9730 if ((bpf_prog_is_dev_bound(prog->aux) || bpf_map_is_dev_bound(map)) &&
9731 !bpf_offload_prog_map_match(prog, map)) {
9732 verbose(env, "offload device mismatch between prog and map\n");
9736 if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
9737 verbose(env, "bpf_struct_ops map cannot be used in prog\n");
9741 if (prog->aux->sleepable)
9742 switch (map->map_type) {
9743 case BPF_MAP_TYPE_HASH:
9744 case BPF_MAP_TYPE_LRU_HASH:
9745 case BPF_MAP_TYPE_ARRAY:
9746 if (!is_preallocated_map(map)) {
9748 "Sleepable programs can only use preallocated hash maps\n");
9754 "Sleepable programs can only use array and hash maps\n");
9761 static bool bpf_map_is_cgroup_storage(struct bpf_map *map)
9763 return (map->map_type == BPF_MAP_TYPE_CGROUP_STORAGE ||
9764 map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE);
9767 /* find and rewrite pseudo imm in ld_imm64 instructions:
9769 * 1. if it accesses map FD, replace it with actual map pointer.
9770 * 2. if it accesses btf_id of a VAR, replace it with pointer to the var.
9772 * NOTE: btf_vmlinux is required for converting pseudo btf_id.
9774 static int resolve_pseudo_ldimm64(struct bpf_verifier_env *env)
9776 struct bpf_insn *insn = env->prog->insnsi;
9777 int insn_cnt = env->prog->len;
9780 err = bpf_prog_calc_tag(env->prog);
9784 for (i = 0; i < insn_cnt; i++, insn++) {
9785 if (BPF_CLASS(insn->code) == BPF_LDX &&
9786 (BPF_MODE(insn->code) != BPF_MEM || insn->imm != 0)) {
9787 verbose(env, "BPF_LDX uses reserved fields\n");
9791 if (BPF_CLASS(insn->code) == BPF_STX &&
9792 ((BPF_MODE(insn->code) != BPF_MEM &&
9793 BPF_MODE(insn->code) != BPF_XADD) || insn->imm != 0)) {
9794 verbose(env, "BPF_STX uses reserved fields\n");
9798 if (insn[0].code == (BPF_LD | BPF_IMM | BPF_DW)) {
9799 struct bpf_insn_aux_data *aux;
9800 struct bpf_map *map;
9804 if (i == insn_cnt - 1 || insn[1].code != 0 ||
9805 insn[1].dst_reg != 0 || insn[1].src_reg != 0 ||
9807 verbose(env, "invalid bpf_ld_imm64 insn\n");
9811 if (insn[0].src_reg == 0)
9812 /* valid generic load 64-bit imm */
9815 if (insn[0].src_reg == BPF_PSEUDO_BTF_ID) {
9816 aux = &env->insn_aux_data[i];
9817 err = check_pseudo_btf_id(env, insn, aux);
9823 /* In final convert_pseudo_ld_imm64() step, this is
9824 * converted into regular 64-bit imm load insn.
9826 if ((insn[0].src_reg != BPF_PSEUDO_MAP_FD &&
9827 insn[0].src_reg != BPF_PSEUDO_MAP_VALUE) ||
9828 (insn[0].src_reg == BPF_PSEUDO_MAP_FD &&
9829 insn[1].imm != 0)) {
9831 "unrecognized bpf_ld_imm64 insn\n");
9835 f = fdget(insn[0].imm);
9836 map = __bpf_map_get(f);
9838 verbose(env, "fd %d is not pointing to valid bpf_map\n",
9840 return PTR_ERR(map);
9843 err = check_map_prog_compatibility(env, map, env->prog);
9849 aux = &env->insn_aux_data[i];
9850 if (insn->src_reg == BPF_PSEUDO_MAP_FD) {
9851 addr = (unsigned long)map;
9853 u32 off = insn[1].imm;
9855 if (off >= BPF_MAX_VAR_OFF) {
9856 verbose(env, "direct value offset of %u is not allowed\n", off);
9861 if (!map->ops->map_direct_value_addr) {
9862 verbose(env, "no direct value access support for this map type\n");
9867 err = map->ops->map_direct_value_addr(map, &addr, off);
9869 verbose(env, "invalid access to map value pointer, value_size=%u off=%u\n",
9870 map->value_size, off);
9879 insn[0].imm = (u32)addr;
9880 insn[1].imm = addr >> 32;
9882 /* check whether we recorded this map already */
9883 for (j = 0; j < env->used_map_cnt; j++) {
9884 if (env->used_maps[j] == map) {
9891 if (env->used_map_cnt >= MAX_USED_MAPS) {
9896 /* hold the map. If the program is rejected by verifier,
9897 * the map will be released by release_maps() or it
9898 * will be used by the valid program until it's unloaded
9899 * and all maps are released in free_used_maps()
9903 aux->map_index = env->used_map_cnt;
9904 env->used_maps[env->used_map_cnt++] = map;
9906 if (bpf_map_is_cgroup_storage(map) &&
9907 bpf_cgroup_storage_assign(env->prog->aux, map)) {
9908 verbose(env, "only one cgroup storage of each type is allowed\n");
9920 /* Basic sanity check before we invest more work here. */
9921 if (!bpf_opcode_in_insntable(insn->code)) {
9922 verbose(env, "unknown opcode %02x\n", insn->code);
9927 /* now all pseudo BPF_LD_IMM64 instructions load valid
9928 * 'struct bpf_map *' into a register instead of user map_fd.
9929 * These pointers will be used later by verifier to validate map access.
9934 /* drop refcnt of maps used by the rejected program */
9935 static void release_maps(struct bpf_verifier_env *env)
9937 __bpf_free_used_maps(env->prog->aux, env->used_maps,
9941 /* convert pseudo BPF_LD_IMM64 into generic BPF_LD_IMM64 */
9942 static void convert_pseudo_ld_imm64(struct bpf_verifier_env *env)
9944 struct bpf_insn *insn = env->prog->insnsi;
9945 int insn_cnt = env->prog->len;
9948 for (i = 0; i < insn_cnt; i++, insn++)
9949 if (insn->code == (BPF_LD | BPF_IMM | BPF_DW))
9953 /* single env->prog->insni[off] instruction was replaced with the range
9954 * insni[off, off + cnt). Adjust corresponding insn_aux_data by copying
9955 * [0, off) and [off, end) to new locations, so the patched range stays zero
9957 static int adjust_insn_aux_data(struct bpf_verifier_env *env,
9958 struct bpf_prog *new_prog, u32 off, u32 cnt)
9960 struct bpf_insn_aux_data *new_data, *old_data = env->insn_aux_data;
9961 struct bpf_insn *insn = new_prog->insnsi;
9965 /* aux info at OFF always needs adjustment, no matter fast path
9966 * (cnt == 1) is taken or not. There is no guarantee INSN at OFF is the
9967 * original insn at old prog.
9969 old_data[off].zext_dst = insn_has_def32(env, insn + off + cnt - 1);
9973 prog_len = new_prog->len;
9974 new_data = vzalloc(array_size(prog_len,
9975 sizeof(struct bpf_insn_aux_data)));
9978 memcpy(new_data, old_data, sizeof(struct bpf_insn_aux_data) * off);
9979 memcpy(new_data + off + cnt - 1, old_data + off,
9980 sizeof(struct bpf_insn_aux_data) * (prog_len - off - cnt + 1));
9981 for (i = off; i < off + cnt - 1; i++) {
9982 new_data[i].seen = env->pass_cnt;
9983 new_data[i].zext_dst = insn_has_def32(env, insn + i);
9985 env->insn_aux_data = new_data;
9990 static void adjust_subprog_starts(struct bpf_verifier_env *env, u32 off, u32 len)
9996 /* NOTE: fake 'exit' subprog should be updated as well. */
9997 for (i = 0; i <= env->subprog_cnt; i++) {
9998 if (env->subprog_info[i].start <= off)
10000 env->subprog_info[i].start += len - 1;
10004 static void adjust_poke_descs(struct bpf_prog *prog, u32 len)
10006 struct bpf_jit_poke_descriptor *tab = prog->aux->poke_tab;
10007 int i, sz = prog->aux->size_poke_tab;
10008 struct bpf_jit_poke_descriptor *desc;
10010 for (i = 0; i < sz; i++) {
10012 desc->insn_idx += len - 1;
10016 static struct bpf_prog *bpf_patch_insn_data(struct bpf_verifier_env *env, u32 off,
10017 const struct bpf_insn *patch, u32 len)
10019 struct bpf_prog *new_prog;
10021 new_prog = bpf_patch_insn_single(env->prog, off, patch, len);
10022 if (IS_ERR(new_prog)) {
10023 if (PTR_ERR(new_prog) == -ERANGE)
10025 "insn %d cannot be patched due to 16-bit range\n",
10026 env->insn_aux_data[off].orig_idx);
10029 if (adjust_insn_aux_data(env, new_prog, off, len))
10031 adjust_subprog_starts(env, off, len);
10032 adjust_poke_descs(new_prog, len);
10036 static int adjust_subprog_starts_after_remove(struct bpf_verifier_env *env,
10041 /* find first prog starting at or after off (first to remove) */
10042 for (i = 0; i < env->subprog_cnt; i++)
10043 if (env->subprog_info[i].start >= off)
10045 /* find first prog starting at or after off + cnt (first to stay) */
10046 for (j = i; j < env->subprog_cnt; j++)
10047 if (env->subprog_info[j].start >= off + cnt)
10049 /* if j doesn't start exactly at off + cnt, we are just removing
10050 * the front of previous prog
10052 if (env->subprog_info[j].start != off + cnt)
10056 struct bpf_prog_aux *aux = env->prog->aux;
10059 /* move fake 'exit' subprog as well */
10060 move = env->subprog_cnt + 1 - j;
10062 memmove(env->subprog_info + i,
10063 env->subprog_info + j,
10064 sizeof(*env->subprog_info) * move);
10065 env->subprog_cnt -= j - i;
10067 /* remove func_info */
10068 if (aux->func_info) {
10069 move = aux->func_info_cnt - j;
10071 memmove(aux->func_info + i,
10072 aux->func_info + j,
10073 sizeof(*aux->func_info) * move);
10074 aux->func_info_cnt -= j - i;
10075 /* func_info->insn_off is set after all code rewrites,
10076 * in adjust_btf_func() - no need to adjust
10080 /* convert i from "first prog to remove" to "first to adjust" */
10081 if (env->subprog_info[i].start == off)
10085 /* update fake 'exit' subprog as well */
10086 for (; i <= env->subprog_cnt; i++)
10087 env->subprog_info[i].start -= cnt;
10092 static int bpf_adj_linfo_after_remove(struct bpf_verifier_env *env, u32 off,
10095 struct bpf_prog *prog = env->prog;
10096 u32 i, l_off, l_cnt, nr_linfo;
10097 struct bpf_line_info *linfo;
10099 nr_linfo = prog->aux->nr_linfo;
10103 linfo = prog->aux->linfo;
10105 /* find first line info to remove, count lines to be removed */
10106 for (i = 0; i < nr_linfo; i++)
10107 if (linfo[i].insn_off >= off)
10112 for (; i < nr_linfo; i++)
10113 if (linfo[i].insn_off < off + cnt)
10118 /* First live insn doesn't match first live linfo, it needs to "inherit"
10119 * last removed linfo. prog is already modified, so prog->len == off
10120 * means no live instructions after (tail of the program was removed).
10122 if (prog->len != off && l_cnt &&
10123 (i == nr_linfo || linfo[i].insn_off != off + cnt)) {
10125 linfo[--i].insn_off = off + cnt;
10128 /* remove the line info which refer to the removed instructions */
10130 memmove(linfo + l_off, linfo + i,
10131 sizeof(*linfo) * (nr_linfo - i));
10133 prog->aux->nr_linfo -= l_cnt;
10134 nr_linfo = prog->aux->nr_linfo;
10137 /* pull all linfo[i].insn_off >= off + cnt in by cnt */
10138 for (i = l_off; i < nr_linfo; i++)
10139 linfo[i].insn_off -= cnt;
10141 /* fix up all subprogs (incl. 'exit') which start >= off */
10142 for (i = 0; i <= env->subprog_cnt; i++)
10143 if (env->subprog_info[i].linfo_idx > l_off) {
10144 /* program may have started in the removed region but
10145 * may not be fully removed
10147 if (env->subprog_info[i].linfo_idx >= l_off + l_cnt)
10148 env->subprog_info[i].linfo_idx -= l_cnt;
10150 env->subprog_info[i].linfo_idx = l_off;
10156 static int verifier_remove_insns(struct bpf_verifier_env *env, u32 off, u32 cnt)
10158 struct bpf_insn_aux_data *aux_data = env->insn_aux_data;
10159 unsigned int orig_prog_len = env->prog->len;
10162 if (bpf_prog_is_dev_bound(env->prog->aux))
10163 bpf_prog_offload_remove_insns(env, off, cnt);
10165 err = bpf_remove_insns(env->prog, off, cnt);
10169 err = adjust_subprog_starts_after_remove(env, off, cnt);
10173 err = bpf_adj_linfo_after_remove(env, off, cnt);
10177 memmove(aux_data + off, aux_data + off + cnt,
10178 sizeof(*aux_data) * (orig_prog_len - off - cnt));
10183 /* The verifier does more data flow analysis than llvm and will not
10184 * explore branches that are dead at run time. Malicious programs can
10185 * have dead code too. Therefore replace all dead at-run-time code
10188 * Just nops are not optimal, e.g. if they would sit at the end of the
10189 * program and through another bug we would manage to jump there, then
10190 * we'd execute beyond program memory otherwise. Returning exception
10191 * code also wouldn't work since we can have subprogs where the dead
10192 * code could be located.
10194 static void sanitize_dead_code(struct bpf_verifier_env *env)
10196 struct bpf_insn_aux_data *aux_data = env->insn_aux_data;
10197 struct bpf_insn trap = BPF_JMP_IMM(BPF_JA, 0, 0, -1);
10198 struct bpf_insn *insn = env->prog->insnsi;
10199 const int insn_cnt = env->prog->len;
10202 for (i = 0; i < insn_cnt; i++) {
10203 if (aux_data[i].seen)
10205 memcpy(insn + i, &trap, sizeof(trap));
10209 static bool insn_is_cond_jump(u8 code)
10213 if (BPF_CLASS(code) == BPF_JMP32)
10216 if (BPF_CLASS(code) != BPF_JMP)
10220 return op != BPF_JA && op != BPF_EXIT && op != BPF_CALL;
10223 static void opt_hard_wire_dead_code_branches(struct bpf_verifier_env *env)
10225 struct bpf_insn_aux_data *aux_data = env->insn_aux_data;
10226 struct bpf_insn ja = BPF_JMP_IMM(BPF_JA, 0, 0, 0);
10227 struct bpf_insn *insn = env->prog->insnsi;
10228 const int insn_cnt = env->prog->len;
10231 for (i = 0; i < insn_cnt; i++, insn++) {
10232 if (!insn_is_cond_jump(insn->code))
10235 if (!aux_data[i + 1].seen)
10236 ja.off = insn->off;
10237 else if (!aux_data[i + 1 + insn->off].seen)
10242 if (bpf_prog_is_dev_bound(env->prog->aux))
10243 bpf_prog_offload_replace_insn(env, i, &ja);
10245 memcpy(insn, &ja, sizeof(ja));
10249 static int opt_remove_dead_code(struct bpf_verifier_env *env)
10251 struct bpf_insn_aux_data *aux_data = env->insn_aux_data;
10252 int insn_cnt = env->prog->len;
10255 for (i = 0; i < insn_cnt; i++) {
10259 while (i + j < insn_cnt && !aux_data[i + j].seen)
10264 err = verifier_remove_insns(env, i, j);
10267 insn_cnt = env->prog->len;
10273 static int opt_remove_nops(struct bpf_verifier_env *env)
10275 const struct bpf_insn ja = BPF_JMP_IMM(BPF_JA, 0, 0, 0);
10276 struct bpf_insn *insn = env->prog->insnsi;
10277 int insn_cnt = env->prog->len;
10280 for (i = 0; i < insn_cnt; i++) {
10281 if (memcmp(&insn[i], &ja, sizeof(ja)))
10284 err = verifier_remove_insns(env, i, 1);
10294 static int opt_subreg_zext_lo32_rnd_hi32(struct bpf_verifier_env *env,
10295 const union bpf_attr *attr)
10297 struct bpf_insn *patch, zext_patch[2], rnd_hi32_patch[4];
10298 struct bpf_insn_aux_data *aux = env->insn_aux_data;
10299 int i, patch_len, delta = 0, len = env->prog->len;
10300 struct bpf_insn *insns = env->prog->insnsi;
10301 struct bpf_prog *new_prog;
10304 rnd_hi32 = attr->prog_flags & BPF_F_TEST_RND_HI32;
10305 zext_patch[1] = BPF_ZEXT_REG(0);
10306 rnd_hi32_patch[1] = BPF_ALU64_IMM(BPF_MOV, BPF_REG_AX, 0);
10307 rnd_hi32_patch[2] = BPF_ALU64_IMM(BPF_LSH, BPF_REG_AX, 32);
10308 rnd_hi32_patch[3] = BPF_ALU64_REG(BPF_OR, 0, BPF_REG_AX);
10309 for (i = 0; i < len; i++) {
10310 int adj_idx = i + delta;
10311 struct bpf_insn insn;
10313 insn = insns[adj_idx];
10314 if (!aux[adj_idx].zext_dst) {
10322 class = BPF_CLASS(code);
10323 if (insn_no_def(&insn))
10326 /* NOTE: arg "reg" (the fourth one) is only used for
10327 * BPF_STX which has been ruled out in above
10328 * check, it is safe to pass NULL here.
10330 if (is_reg64(env, &insn, insn.dst_reg, NULL, DST_OP)) {
10331 if (class == BPF_LD &&
10332 BPF_MODE(code) == BPF_IMM)
10337 /* ctx load could be transformed into wider load. */
10338 if (class == BPF_LDX &&
10339 aux[adj_idx].ptr_type == PTR_TO_CTX)
10342 imm_rnd = get_random_int();
10343 rnd_hi32_patch[0] = insn;
10344 rnd_hi32_patch[1].imm = imm_rnd;
10345 rnd_hi32_patch[3].dst_reg = insn.dst_reg;
10346 patch = rnd_hi32_patch;
10348 goto apply_patch_buffer;
10351 if (!bpf_jit_needs_zext())
10354 zext_patch[0] = insn;
10355 zext_patch[1].dst_reg = insn.dst_reg;
10356 zext_patch[1].src_reg = insn.dst_reg;
10357 patch = zext_patch;
10359 apply_patch_buffer:
10360 new_prog = bpf_patch_insn_data(env, adj_idx, patch, patch_len);
10363 env->prog = new_prog;
10364 insns = new_prog->insnsi;
10365 aux = env->insn_aux_data;
10366 delta += patch_len - 1;
10372 /* convert load instructions that access fields of a context type into a
10373 * sequence of instructions that access fields of the underlying structure:
10374 * struct __sk_buff -> struct sk_buff
10375 * struct bpf_sock_ops -> struct sock
10377 static int convert_ctx_accesses(struct bpf_verifier_env *env)
10379 const struct bpf_verifier_ops *ops = env->ops;
10380 int i, cnt, size, ctx_field_size, delta = 0;
10381 const int insn_cnt = env->prog->len;
10382 struct bpf_insn insn_buf[16], *insn;
10383 u32 target_size, size_default, off;
10384 struct bpf_prog *new_prog;
10385 enum bpf_access_type type;
10386 bool is_narrower_load;
10388 if (ops->gen_prologue || env->seen_direct_write) {
10389 if (!ops->gen_prologue) {
10390 verbose(env, "bpf verifier is misconfigured\n");
10393 cnt = ops->gen_prologue(insn_buf, env->seen_direct_write,
10395 if (cnt >= ARRAY_SIZE(insn_buf)) {
10396 verbose(env, "bpf verifier is misconfigured\n");
10399 new_prog = bpf_patch_insn_data(env, 0, insn_buf, cnt);
10403 env->prog = new_prog;
10408 if (bpf_prog_is_dev_bound(env->prog->aux))
10411 insn = env->prog->insnsi + delta;
10413 for (i = 0; i < insn_cnt; i++, insn++) {
10414 bpf_convert_ctx_access_t convert_ctx_access;
10416 if (insn->code == (BPF_LDX | BPF_MEM | BPF_B) ||
10417 insn->code == (BPF_LDX | BPF_MEM | BPF_H) ||
10418 insn->code == (BPF_LDX | BPF_MEM | BPF_W) ||
10419 insn->code == (BPF_LDX | BPF_MEM | BPF_DW))
10421 else if (insn->code == (BPF_STX | BPF_MEM | BPF_B) ||
10422 insn->code == (BPF_STX | BPF_MEM | BPF_H) ||
10423 insn->code == (BPF_STX | BPF_MEM | BPF_W) ||
10424 insn->code == (BPF_STX | BPF_MEM | BPF_DW))
10429 if (type == BPF_WRITE &&
10430 env->insn_aux_data[i + delta].sanitize_stack_off) {
10431 struct bpf_insn patch[] = {
10432 /* Sanitize suspicious stack slot with zero.
10433 * There are no memory dependencies for this store,
10434 * since it's only using frame pointer and immediate
10437 BPF_ST_MEM(BPF_DW, BPF_REG_FP,
10438 env->insn_aux_data[i + delta].sanitize_stack_off,
10440 /* the original STX instruction will immediately
10441 * overwrite the same stack slot with appropriate value
10446 cnt = ARRAY_SIZE(patch);
10447 new_prog = bpf_patch_insn_data(env, i + delta, patch, cnt);
10452 env->prog = new_prog;
10453 insn = new_prog->insnsi + i + delta;
10457 switch (env->insn_aux_data[i + delta].ptr_type) {
10459 if (!ops->convert_ctx_access)
10461 convert_ctx_access = ops->convert_ctx_access;
10463 case PTR_TO_SOCKET:
10464 case PTR_TO_SOCK_COMMON:
10465 convert_ctx_access = bpf_sock_convert_ctx_access;
10467 case PTR_TO_TCP_SOCK:
10468 convert_ctx_access = bpf_tcp_sock_convert_ctx_access;
10470 case PTR_TO_XDP_SOCK:
10471 convert_ctx_access = bpf_xdp_sock_convert_ctx_access;
10473 case PTR_TO_BTF_ID:
10474 if (type == BPF_READ) {
10475 insn->code = BPF_LDX | BPF_PROBE_MEM |
10476 BPF_SIZE((insn)->code);
10477 env->prog->aux->num_exentries++;
10478 } else if (resolve_prog_type(env->prog) != BPF_PROG_TYPE_STRUCT_OPS) {
10479 verbose(env, "Writes through BTF pointers are not allowed\n");
10487 ctx_field_size = env->insn_aux_data[i + delta].ctx_field_size;
10488 size = BPF_LDST_BYTES(insn);
10490 /* If the read access is a narrower load of the field,
10491 * convert to a 4/8-byte load, to minimum program type specific
10492 * convert_ctx_access changes. If conversion is successful,
10493 * we will apply proper mask to the result.
10495 is_narrower_load = size < ctx_field_size;
10496 size_default = bpf_ctx_off_adjust_machine(ctx_field_size);
10498 if (is_narrower_load) {
10501 if (type == BPF_WRITE) {
10502 verbose(env, "bpf verifier narrow ctx access misconfigured\n");
10507 if (ctx_field_size == 4)
10509 else if (ctx_field_size == 8)
10510 size_code = BPF_DW;
10512 insn->off = off & ~(size_default - 1);
10513 insn->code = BPF_LDX | BPF_MEM | size_code;
10517 cnt = convert_ctx_access(type, insn, insn_buf, env->prog,
10519 if (cnt == 0 || cnt >= ARRAY_SIZE(insn_buf) ||
10520 (ctx_field_size && !target_size)) {
10521 verbose(env, "bpf verifier is misconfigured\n");
10525 if (is_narrower_load && size < target_size) {
10526 u8 shift = bpf_ctx_narrow_access_offset(
10527 off, size, size_default) * 8;
10528 if (ctx_field_size <= 4) {
10530 insn_buf[cnt++] = BPF_ALU32_IMM(BPF_RSH,
10533 insn_buf[cnt++] = BPF_ALU32_IMM(BPF_AND, insn->dst_reg,
10534 (1 << size * 8) - 1);
10537 insn_buf[cnt++] = BPF_ALU64_IMM(BPF_RSH,
10540 insn_buf[cnt++] = BPF_ALU64_IMM(BPF_AND, insn->dst_reg,
10541 (1ULL << size * 8) - 1);
10545 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf, cnt);
10551 /* keep walking new program and skip insns we just inserted */
10552 env->prog = new_prog;
10553 insn = new_prog->insnsi + i + delta;
10559 static int jit_subprogs(struct bpf_verifier_env *env)
10561 struct bpf_prog *prog = env->prog, **func, *tmp;
10562 int i, j, subprog_start, subprog_end = 0, len, subprog;
10563 struct bpf_map *map_ptr;
10564 struct bpf_insn *insn;
10565 void *old_bpf_func;
10566 int err, num_exentries;
10568 if (env->subprog_cnt <= 1)
10571 for (i = 0, insn = prog->insnsi; i < prog->len; i++, insn++) {
10572 if (insn->code != (BPF_JMP | BPF_CALL) ||
10573 insn->src_reg != BPF_PSEUDO_CALL)
10575 /* Upon error here we cannot fall back to interpreter but
10576 * need a hard reject of the program. Thus -EFAULT is
10577 * propagated in any case.
10579 subprog = find_subprog(env, i + insn->imm + 1);
10581 WARN_ONCE(1, "verifier bug. No program starts at insn %d\n",
10582 i + insn->imm + 1);
10585 /* temporarily remember subprog id inside insn instead of
10586 * aux_data, since next loop will split up all insns into funcs
10588 insn->off = subprog;
10589 /* remember original imm in case JIT fails and fallback
10590 * to interpreter will be needed
10592 env->insn_aux_data[i].call_imm = insn->imm;
10593 /* point imm to __bpf_call_base+1 from JITs point of view */
10597 err = bpf_prog_alloc_jited_linfo(prog);
10599 goto out_undo_insn;
10602 func = kcalloc(env->subprog_cnt, sizeof(prog), GFP_KERNEL);
10604 goto out_undo_insn;
10606 for (i = 0; i < env->subprog_cnt; i++) {
10607 subprog_start = subprog_end;
10608 subprog_end = env->subprog_info[i + 1].start;
10610 len = subprog_end - subprog_start;
10611 /* BPF_PROG_RUN doesn't call subprogs directly,
10612 * hence main prog stats include the runtime of subprogs.
10613 * subprogs don't have IDs and not reachable via prog_get_next_id
10614 * func[i]->aux->stats will never be accessed and stays NULL
10616 func[i] = bpf_prog_alloc_no_stats(bpf_prog_size(len), GFP_USER);
10619 memcpy(func[i]->insnsi, &prog->insnsi[subprog_start],
10620 len * sizeof(struct bpf_insn));
10621 func[i]->type = prog->type;
10622 func[i]->len = len;
10623 if (bpf_prog_calc_tag(func[i]))
10625 func[i]->is_func = 1;
10626 func[i]->aux->func_idx = i;
10627 /* the btf and func_info will be freed only at prog->aux */
10628 func[i]->aux->btf = prog->aux->btf;
10629 func[i]->aux->func_info = prog->aux->func_info;
10631 for (j = 0; j < prog->aux->size_poke_tab; j++) {
10632 u32 insn_idx = prog->aux->poke_tab[j].insn_idx;
10635 if (!(insn_idx >= subprog_start &&
10636 insn_idx <= subprog_end))
10639 ret = bpf_jit_add_poke_descriptor(func[i],
10640 &prog->aux->poke_tab[j]);
10642 verbose(env, "adding tail call poke descriptor failed\n");
10646 func[i]->insnsi[insn_idx - subprog_start].imm = ret + 1;
10648 map_ptr = func[i]->aux->poke_tab[ret].tail_call.map;
10649 ret = map_ptr->ops->map_poke_track(map_ptr, func[i]->aux);
10651 verbose(env, "tracking tail call prog failed\n");
10656 /* Use bpf_prog_F_tag to indicate functions in stack traces.
10657 * Long term would need debug info to populate names
10659 func[i]->aux->name[0] = 'F';
10660 func[i]->aux->stack_depth = env->subprog_info[i].stack_depth;
10661 func[i]->jit_requested = 1;
10662 func[i]->aux->linfo = prog->aux->linfo;
10663 func[i]->aux->nr_linfo = prog->aux->nr_linfo;
10664 func[i]->aux->jited_linfo = prog->aux->jited_linfo;
10665 func[i]->aux->linfo_idx = env->subprog_info[i].linfo_idx;
10667 insn = func[i]->insnsi;
10668 for (j = 0; j < func[i]->len; j++, insn++) {
10669 if (BPF_CLASS(insn->code) == BPF_LDX &&
10670 BPF_MODE(insn->code) == BPF_PROBE_MEM)
10673 func[i]->aux->num_exentries = num_exentries;
10674 func[i]->aux->tail_call_reachable = env->subprog_info[i].tail_call_reachable;
10675 func[i] = bpf_int_jit_compile(func[i]);
10676 if (!func[i]->jited) {
10683 /* Untrack main program's aux structs so that during map_poke_run()
10684 * we will not stumble upon the unfilled poke descriptors; each
10685 * of the main program's poke descs got distributed across subprogs
10686 * and got tracked onto map, so we are sure that none of them will
10687 * be missed after the operation below
10689 for (i = 0; i < prog->aux->size_poke_tab; i++) {
10690 map_ptr = prog->aux->poke_tab[i].tail_call.map;
10692 map_ptr->ops->map_poke_untrack(map_ptr, prog->aux);
10695 /* at this point all bpf functions were successfully JITed
10696 * now populate all bpf_calls with correct addresses and
10697 * run last pass of JIT
10699 for (i = 0; i < env->subprog_cnt; i++) {
10700 insn = func[i]->insnsi;
10701 for (j = 0; j < func[i]->len; j++, insn++) {
10702 if (insn->code != (BPF_JMP | BPF_CALL) ||
10703 insn->src_reg != BPF_PSEUDO_CALL)
10705 subprog = insn->off;
10706 insn->imm = BPF_CAST_CALL(func[subprog]->bpf_func) -
10710 /* we use the aux data to keep a list of the start addresses
10711 * of the JITed images for each function in the program
10713 * for some architectures, such as powerpc64, the imm field
10714 * might not be large enough to hold the offset of the start
10715 * address of the callee's JITed image from __bpf_call_base
10717 * in such cases, we can lookup the start address of a callee
10718 * by using its subprog id, available from the off field of
10719 * the call instruction, as an index for this list
10721 func[i]->aux->func = func;
10722 func[i]->aux->func_cnt = env->subprog_cnt;
10724 for (i = 0; i < env->subprog_cnt; i++) {
10725 old_bpf_func = func[i]->bpf_func;
10726 tmp = bpf_int_jit_compile(func[i]);
10727 if (tmp != func[i] || func[i]->bpf_func != old_bpf_func) {
10728 verbose(env, "JIT doesn't support bpf-to-bpf calls\n");
10735 /* finally lock prog and jit images for all functions and
10736 * populate kallsysm
10738 for (i = 0; i < env->subprog_cnt; i++) {
10739 bpf_prog_lock_ro(func[i]);
10740 bpf_prog_kallsyms_add(func[i]);
10743 /* Last step: make now unused interpreter insns from main
10744 * prog consistent for later dump requests, so they can
10745 * later look the same as if they were interpreted only.
10747 for (i = 0, insn = prog->insnsi; i < prog->len; i++, insn++) {
10748 if (insn->code != (BPF_JMP | BPF_CALL) ||
10749 insn->src_reg != BPF_PSEUDO_CALL)
10751 insn->off = env->insn_aux_data[i].call_imm;
10752 subprog = find_subprog(env, i + insn->off + 1);
10753 insn->imm = subprog;
10757 prog->bpf_func = func[0]->bpf_func;
10758 prog->aux->func = func;
10759 prog->aux->func_cnt = env->subprog_cnt;
10760 bpf_prog_free_unused_jited_linfo(prog);
10763 for (i = 0; i < env->subprog_cnt; i++) {
10767 for (j = 0; j < func[i]->aux->size_poke_tab; j++) {
10768 map_ptr = func[i]->aux->poke_tab[j].tail_call.map;
10769 map_ptr->ops->map_poke_untrack(map_ptr, func[i]->aux);
10771 bpf_jit_free(func[i]);
10775 /* cleanup main prog to be interpreted */
10776 prog->jit_requested = 0;
10777 for (i = 0, insn = prog->insnsi; i < prog->len; i++, insn++) {
10778 if (insn->code != (BPF_JMP | BPF_CALL) ||
10779 insn->src_reg != BPF_PSEUDO_CALL)
10782 insn->imm = env->insn_aux_data[i].call_imm;
10784 bpf_prog_free_jited_linfo(prog);
10788 static int fixup_call_args(struct bpf_verifier_env *env)
10790 #ifndef CONFIG_BPF_JIT_ALWAYS_ON
10791 struct bpf_prog *prog = env->prog;
10792 struct bpf_insn *insn = prog->insnsi;
10797 if (env->prog->jit_requested &&
10798 !bpf_prog_is_dev_bound(env->prog->aux)) {
10799 err = jit_subprogs(env);
10802 if (err == -EFAULT)
10805 #ifndef CONFIG_BPF_JIT_ALWAYS_ON
10806 if (env->subprog_cnt > 1 && env->prog->aux->tail_call_reachable) {
10807 /* When JIT fails the progs with bpf2bpf calls and tail_calls
10808 * have to be rejected, since interpreter doesn't support them yet.
10810 verbose(env, "tail_calls are not allowed in non-JITed programs with bpf-to-bpf calls\n");
10813 for (i = 0; i < prog->len; i++, insn++) {
10814 if (insn->code != (BPF_JMP | BPF_CALL) ||
10815 insn->src_reg != BPF_PSEUDO_CALL)
10817 depth = get_callee_stack_depth(env, insn, i);
10820 bpf_patch_call_args(insn, depth);
10827 /* fixup insn->imm field of bpf_call instructions
10828 * and inline eligible helpers as explicit sequence of BPF instructions
10830 * this function is called after eBPF program passed verification
10832 static int fixup_bpf_calls(struct bpf_verifier_env *env)
10834 struct bpf_prog *prog = env->prog;
10835 bool expect_blinding = bpf_jit_blinding_enabled(prog);
10836 struct bpf_insn *insn = prog->insnsi;
10837 const struct bpf_func_proto *fn;
10838 const int insn_cnt = prog->len;
10839 const struct bpf_map_ops *ops;
10840 struct bpf_insn_aux_data *aux;
10841 struct bpf_insn insn_buf[16];
10842 struct bpf_prog *new_prog;
10843 struct bpf_map *map_ptr;
10844 int i, ret, cnt, delta = 0;
10846 for (i = 0; i < insn_cnt; i++, insn++) {
10847 if (insn->code == (BPF_ALU64 | BPF_MOD | BPF_X) ||
10848 insn->code == (BPF_ALU64 | BPF_DIV | BPF_X) ||
10849 insn->code == (BPF_ALU | BPF_MOD | BPF_X) ||
10850 insn->code == (BPF_ALU | BPF_DIV | BPF_X)) {
10851 bool is64 = BPF_CLASS(insn->code) == BPF_ALU64;
10852 struct bpf_insn mask_and_div[] = {
10853 BPF_MOV32_REG(insn->src_reg, insn->src_reg),
10854 /* Rx div 0 -> 0 */
10855 BPF_JMP_IMM(BPF_JNE, insn->src_reg, 0, 2),
10856 BPF_ALU32_REG(BPF_XOR, insn->dst_reg, insn->dst_reg),
10857 BPF_JMP_IMM(BPF_JA, 0, 0, 1),
10860 struct bpf_insn mask_and_mod[] = {
10861 BPF_MOV32_REG(insn->src_reg, insn->src_reg),
10862 /* Rx mod 0 -> Rx */
10863 BPF_JMP_IMM(BPF_JEQ, insn->src_reg, 0, 1),
10866 struct bpf_insn *patchlet;
10868 if (insn->code == (BPF_ALU64 | BPF_DIV | BPF_X) ||
10869 insn->code == (BPF_ALU | BPF_DIV | BPF_X)) {
10870 patchlet = mask_and_div + (is64 ? 1 : 0);
10871 cnt = ARRAY_SIZE(mask_and_div) - (is64 ? 1 : 0);
10873 patchlet = mask_and_mod + (is64 ? 1 : 0);
10874 cnt = ARRAY_SIZE(mask_and_mod) - (is64 ? 1 : 0);
10877 new_prog = bpf_patch_insn_data(env, i + delta, patchlet, cnt);
10882 env->prog = prog = new_prog;
10883 insn = new_prog->insnsi + i + delta;
10887 if (BPF_CLASS(insn->code) == BPF_LD &&
10888 (BPF_MODE(insn->code) == BPF_ABS ||
10889 BPF_MODE(insn->code) == BPF_IND)) {
10890 cnt = env->ops->gen_ld_abs(insn, insn_buf);
10891 if (cnt == 0 || cnt >= ARRAY_SIZE(insn_buf)) {
10892 verbose(env, "bpf verifier is misconfigured\n");
10896 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf, cnt);
10901 env->prog = prog = new_prog;
10902 insn = new_prog->insnsi + i + delta;
10906 if (insn->code == (BPF_ALU64 | BPF_ADD | BPF_X) ||
10907 insn->code == (BPF_ALU64 | BPF_SUB | BPF_X)) {
10908 const u8 code_add = BPF_ALU64 | BPF_ADD | BPF_X;
10909 const u8 code_sub = BPF_ALU64 | BPF_SUB | BPF_X;
10910 struct bpf_insn insn_buf[16];
10911 struct bpf_insn *patch = &insn_buf[0];
10915 aux = &env->insn_aux_data[i + delta];
10916 if (!aux->alu_state ||
10917 aux->alu_state == BPF_ALU_NON_POINTER)
10920 isneg = aux->alu_state & BPF_ALU_NEG_VALUE;
10921 issrc = (aux->alu_state & BPF_ALU_SANITIZE) ==
10922 BPF_ALU_SANITIZE_SRC;
10924 off_reg = issrc ? insn->src_reg : insn->dst_reg;
10926 *patch++ = BPF_ALU64_IMM(BPF_MUL, off_reg, -1);
10927 *patch++ = BPF_MOV32_IMM(BPF_REG_AX, aux->alu_limit - 1);
10928 *patch++ = BPF_ALU64_REG(BPF_SUB, BPF_REG_AX, off_reg);
10929 *patch++ = BPF_ALU64_REG(BPF_OR, BPF_REG_AX, off_reg);
10930 *patch++ = BPF_ALU64_IMM(BPF_NEG, BPF_REG_AX, 0);
10931 *patch++ = BPF_ALU64_IMM(BPF_ARSH, BPF_REG_AX, 63);
10933 *patch++ = BPF_ALU64_REG(BPF_AND, BPF_REG_AX,
10935 insn->src_reg = BPF_REG_AX;
10937 *patch++ = BPF_ALU64_REG(BPF_AND, off_reg,
10941 insn->code = insn->code == code_add ?
10942 code_sub : code_add;
10944 if (issrc && isneg)
10945 *patch++ = BPF_ALU64_IMM(BPF_MUL, off_reg, -1);
10946 cnt = patch - insn_buf;
10948 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf, cnt);
10953 env->prog = prog = new_prog;
10954 insn = new_prog->insnsi + i + delta;
10958 if (insn->code != (BPF_JMP | BPF_CALL))
10960 if (insn->src_reg == BPF_PSEUDO_CALL)
10963 if (insn->imm == BPF_FUNC_get_route_realm)
10964 prog->dst_needed = 1;
10965 if (insn->imm == BPF_FUNC_get_prandom_u32)
10966 bpf_user_rnd_init_once();
10967 if (insn->imm == BPF_FUNC_override_return)
10968 prog->kprobe_override = 1;
10969 if (insn->imm == BPF_FUNC_tail_call) {
10970 /* If we tail call into other programs, we
10971 * cannot make any assumptions since they can
10972 * be replaced dynamically during runtime in
10973 * the program array.
10975 prog->cb_access = 1;
10976 if (!allow_tail_call_in_subprogs(env))
10977 prog->aux->stack_depth = MAX_BPF_STACK;
10978 prog->aux->max_pkt_offset = MAX_PACKET_OFF;
10980 /* mark bpf_tail_call as different opcode to avoid
10981 * conditional branch in the interpeter for every normal
10982 * call and to prevent accidental JITing by JIT compiler
10983 * that doesn't support bpf_tail_call yet
10986 insn->code = BPF_JMP | BPF_TAIL_CALL;
10988 aux = &env->insn_aux_data[i + delta];
10989 if (env->bpf_capable && !expect_blinding &&
10990 prog->jit_requested &&
10991 !bpf_map_key_poisoned(aux) &&
10992 !bpf_map_ptr_poisoned(aux) &&
10993 !bpf_map_ptr_unpriv(aux)) {
10994 struct bpf_jit_poke_descriptor desc = {
10995 .reason = BPF_POKE_REASON_TAIL_CALL,
10996 .tail_call.map = BPF_MAP_PTR(aux->map_ptr_state),
10997 .tail_call.key = bpf_map_key_immediate(aux),
10998 .insn_idx = i + delta,
11001 ret = bpf_jit_add_poke_descriptor(prog, &desc);
11003 verbose(env, "adding tail call poke descriptor failed\n");
11007 insn->imm = ret + 1;
11011 if (!bpf_map_ptr_unpriv(aux))
11014 /* instead of changing every JIT dealing with tail_call
11015 * emit two extra insns:
11016 * if (index >= max_entries) goto out;
11017 * index &= array->index_mask;
11018 * to avoid out-of-bounds cpu speculation
11020 if (bpf_map_ptr_poisoned(aux)) {
11021 verbose(env, "tail_call abusing map_ptr\n");
11025 map_ptr = BPF_MAP_PTR(aux->map_ptr_state);
11026 insn_buf[0] = BPF_JMP_IMM(BPF_JGE, BPF_REG_3,
11027 map_ptr->max_entries, 2);
11028 insn_buf[1] = BPF_ALU32_IMM(BPF_AND, BPF_REG_3,
11029 container_of(map_ptr,
11032 insn_buf[2] = *insn;
11034 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf, cnt);
11039 env->prog = prog = new_prog;
11040 insn = new_prog->insnsi + i + delta;
11044 /* BPF_EMIT_CALL() assumptions in some of the map_gen_lookup
11045 * and other inlining handlers are currently limited to 64 bit
11048 if (prog->jit_requested && BITS_PER_LONG == 64 &&
11049 (insn->imm == BPF_FUNC_map_lookup_elem ||
11050 insn->imm == BPF_FUNC_map_update_elem ||
11051 insn->imm == BPF_FUNC_map_delete_elem ||
11052 insn->imm == BPF_FUNC_map_push_elem ||
11053 insn->imm == BPF_FUNC_map_pop_elem ||
11054 insn->imm == BPF_FUNC_map_peek_elem)) {
11055 aux = &env->insn_aux_data[i + delta];
11056 if (bpf_map_ptr_poisoned(aux))
11057 goto patch_call_imm;
11059 map_ptr = BPF_MAP_PTR(aux->map_ptr_state);
11060 ops = map_ptr->ops;
11061 if (insn->imm == BPF_FUNC_map_lookup_elem &&
11062 ops->map_gen_lookup) {
11063 cnt = ops->map_gen_lookup(map_ptr, insn_buf);
11064 if (cnt == -EOPNOTSUPP)
11065 goto patch_map_ops_generic;
11066 if (cnt <= 0 || cnt >= ARRAY_SIZE(insn_buf)) {
11067 verbose(env, "bpf verifier is misconfigured\n");
11071 new_prog = bpf_patch_insn_data(env, i + delta,
11077 env->prog = prog = new_prog;
11078 insn = new_prog->insnsi + i + delta;
11082 BUILD_BUG_ON(!__same_type(ops->map_lookup_elem,
11083 (void *(*)(struct bpf_map *map, void *key))NULL));
11084 BUILD_BUG_ON(!__same_type(ops->map_delete_elem,
11085 (int (*)(struct bpf_map *map, void *key))NULL));
11086 BUILD_BUG_ON(!__same_type(ops->map_update_elem,
11087 (int (*)(struct bpf_map *map, void *key, void *value,
11089 BUILD_BUG_ON(!__same_type(ops->map_push_elem,
11090 (int (*)(struct bpf_map *map, void *value,
11092 BUILD_BUG_ON(!__same_type(ops->map_pop_elem,
11093 (int (*)(struct bpf_map *map, void *value))NULL));
11094 BUILD_BUG_ON(!__same_type(ops->map_peek_elem,
11095 (int (*)(struct bpf_map *map, void *value))NULL));
11096 patch_map_ops_generic:
11097 switch (insn->imm) {
11098 case BPF_FUNC_map_lookup_elem:
11099 insn->imm = BPF_CAST_CALL(ops->map_lookup_elem) -
11102 case BPF_FUNC_map_update_elem:
11103 insn->imm = BPF_CAST_CALL(ops->map_update_elem) -
11106 case BPF_FUNC_map_delete_elem:
11107 insn->imm = BPF_CAST_CALL(ops->map_delete_elem) -
11110 case BPF_FUNC_map_push_elem:
11111 insn->imm = BPF_CAST_CALL(ops->map_push_elem) -
11114 case BPF_FUNC_map_pop_elem:
11115 insn->imm = BPF_CAST_CALL(ops->map_pop_elem) -
11118 case BPF_FUNC_map_peek_elem:
11119 insn->imm = BPF_CAST_CALL(ops->map_peek_elem) -
11124 goto patch_call_imm;
11127 if (prog->jit_requested && BITS_PER_LONG == 64 &&
11128 insn->imm == BPF_FUNC_jiffies64) {
11129 struct bpf_insn ld_jiffies_addr[2] = {
11130 BPF_LD_IMM64(BPF_REG_0,
11131 (unsigned long)&jiffies),
11134 insn_buf[0] = ld_jiffies_addr[0];
11135 insn_buf[1] = ld_jiffies_addr[1];
11136 insn_buf[2] = BPF_LDX_MEM(BPF_DW, BPF_REG_0,
11140 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf,
11146 env->prog = prog = new_prog;
11147 insn = new_prog->insnsi + i + delta;
11152 fn = env->ops->get_func_proto(insn->imm, env->prog);
11153 /* all functions that have prototype and verifier allowed
11154 * programs to call them, must be real in-kernel functions
11158 "kernel subsystem misconfigured func %s#%d\n",
11159 func_id_name(insn->imm), insn->imm);
11162 insn->imm = fn->func - __bpf_call_base;
11165 /* Since poke tab is now finalized, publish aux to tracker. */
11166 for (i = 0; i < prog->aux->size_poke_tab; i++) {
11167 map_ptr = prog->aux->poke_tab[i].tail_call.map;
11168 if (!map_ptr->ops->map_poke_track ||
11169 !map_ptr->ops->map_poke_untrack ||
11170 !map_ptr->ops->map_poke_run) {
11171 verbose(env, "bpf verifier is misconfigured\n");
11175 ret = map_ptr->ops->map_poke_track(map_ptr, prog->aux);
11177 verbose(env, "tracking tail call prog failed\n");
11185 static void free_states(struct bpf_verifier_env *env)
11187 struct bpf_verifier_state_list *sl, *sln;
11190 sl = env->free_list;
11193 free_verifier_state(&sl->state, false);
11197 env->free_list = NULL;
11199 if (!env->explored_states)
11202 for (i = 0; i < state_htab_size(env); i++) {
11203 sl = env->explored_states[i];
11207 free_verifier_state(&sl->state, false);
11211 env->explored_states[i] = NULL;
11215 /* The verifier is using insn_aux_data[] to store temporary data during
11216 * verification and to store information for passes that run after the
11217 * verification like dead code sanitization. do_check_common() for subprogram N
11218 * may analyze many other subprograms. sanitize_insn_aux_data() clears all
11219 * temporary data after do_check_common() finds that subprogram N cannot be
11220 * verified independently. pass_cnt counts the number of times
11221 * do_check_common() was run and insn->aux->seen tells the pass number
11222 * insn_aux_data was touched. These variables are compared to clear temporary
11223 * data from failed pass. For testing and experiments do_check_common() can be
11224 * run multiple times even when prior attempt to verify is unsuccessful.
11226 static void sanitize_insn_aux_data(struct bpf_verifier_env *env)
11228 struct bpf_insn *insn = env->prog->insnsi;
11229 struct bpf_insn_aux_data *aux;
11232 for (i = 0; i < env->prog->len; i++) {
11233 class = BPF_CLASS(insn[i].code);
11234 if (class != BPF_LDX && class != BPF_STX)
11236 aux = &env->insn_aux_data[i];
11237 if (aux->seen != env->pass_cnt)
11239 memset(aux, 0, offsetof(typeof(*aux), orig_idx));
11243 static int do_check_common(struct bpf_verifier_env *env, int subprog)
11245 bool pop_log = !(env->log.level & BPF_LOG_LEVEL2);
11246 struct bpf_verifier_state *state;
11247 struct bpf_reg_state *regs;
11250 env->prev_linfo = NULL;
11253 state = kzalloc(sizeof(struct bpf_verifier_state), GFP_KERNEL);
11256 state->curframe = 0;
11257 state->speculative = false;
11258 state->branches = 1;
11259 state->frame[0] = kzalloc(sizeof(struct bpf_func_state), GFP_KERNEL);
11260 if (!state->frame[0]) {
11264 env->cur_state = state;
11265 init_func_state(env, state->frame[0],
11266 BPF_MAIN_FUNC /* callsite */,
11270 regs = state->frame[state->curframe]->regs;
11271 if (subprog || env->prog->type == BPF_PROG_TYPE_EXT) {
11272 ret = btf_prepare_func_args(env, subprog, regs);
11275 for (i = BPF_REG_1; i <= BPF_REG_5; i++) {
11276 if (regs[i].type == PTR_TO_CTX)
11277 mark_reg_known_zero(env, regs, i);
11278 else if (regs[i].type == SCALAR_VALUE)
11279 mark_reg_unknown(env, regs, i);
11282 /* 1st arg to a function */
11283 regs[BPF_REG_1].type = PTR_TO_CTX;
11284 mark_reg_known_zero(env, regs, BPF_REG_1);
11285 ret = btf_check_func_arg_match(env, subprog, regs);
11286 if (ret == -EFAULT)
11287 /* unlikely verifier bug. abort.
11288 * ret == 0 and ret < 0 are sadly acceptable for
11289 * main() function due to backward compatibility.
11290 * Like socket filter program may be written as:
11291 * int bpf_prog(struct pt_regs *ctx)
11292 * and never dereference that ctx in the program.
11293 * 'struct pt_regs' is a type mismatch for socket
11294 * filter that should be using 'struct __sk_buff'.
11299 ret = do_check(env);
11301 /* check for NULL is necessary, since cur_state can be freed inside
11302 * do_check() under memory pressure.
11304 if (env->cur_state) {
11305 free_verifier_state(env->cur_state, true);
11306 env->cur_state = NULL;
11308 while (!pop_stack(env, NULL, NULL, false));
11309 if (!ret && pop_log)
11310 bpf_vlog_reset(&env->log, 0);
11313 /* clean aux data in case subprog was rejected */
11314 sanitize_insn_aux_data(env);
11318 /* Verify all global functions in a BPF program one by one based on their BTF.
11319 * All global functions must pass verification. Otherwise the whole program is rejected.
11330 * foo() will be verified first for R1=any_scalar_value. During verification it
11331 * will be assumed that bar() already verified successfully and call to bar()
11332 * from foo() will be checked for type match only. Later bar() will be verified
11333 * independently to check that it's safe for R1=any_scalar_value.
11335 static int do_check_subprogs(struct bpf_verifier_env *env)
11337 struct bpf_prog_aux *aux = env->prog->aux;
11340 if (!aux->func_info)
11343 for (i = 1; i < env->subprog_cnt; i++) {
11344 if (aux->func_info_aux[i].linkage != BTF_FUNC_GLOBAL)
11346 env->insn_idx = env->subprog_info[i].start;
11347 WARN_ON_ONCE(env->insn_idx == 0);
11348 ret = do_check_common(env, i);
11351 } else if (env->log.level & BPF_LOG_LEVEL) {
11353 "Func#%d is safe for any args that match its prototype\n",
11360 static int do_check_main(struct bpf_verifier_env *env)
11365 ret = do_check_common(env, 0);
11367 env->prog->aux->stack_depth = env->subprog_info[0].stack_depth;
11372 static void print_verification_stats(struct bpf_verifier_env *env)
11376 if (env->log.level & BPF_LOG_STATS) {
11377 verbose(env, "verification time %lld usec\n",
11378 div_u64(env->verification_time, 1000));
11379 verbose(env, "stack depth ");
11380 for (i = 0; i < env->subprog_cnt; i++) {
11381 u32 depth = env->subprog_info[i].stack_depth;
11383 verbose(env, "%d", depth);
11384 if (i + 1 < env->subprog_cnt)
11387 verbose(env, "\n");
11389 verbose(env, "processed %d insns (limit %d) max_states_per_insn %d "
11390 "total_states %d peak_states %d mark_read %d\n",
11391 env->insn_processed, BPF_COMPLEXITY_LIMIT_INSNS,
11392 env->max_states_per_insn, env->total_states,
11393 env->peak_states, env->longest_mark_read_walk);
11396 static int check_struct_ops_btf_id(struct bpf_verifier_env *env)
11398 const struct btf_type *t, *func_proto;
11399 const struct bpf_struct_ops *st_ops;
11400 const struct btf_member *member;
11401 struct bpf_prog *prog = env->prog;
11402 u32 btf_id, member_idx;
11405 btf_id = prog->aux->attach_btf_id;
11406 st_ops = bpf_struct_ops_find(btf_id);
11408 verbose(env, "attach_btf_id %u is not a supported struct\n",
11414 member_idx = prog->expected_attach_type;
11415 if (member_idx >= btf_type_vlen(t)) {
11416 verbose(env, "attach to invalid member idx %u of struct %s\n",
11417 member_idx, st_ops->name);
11421 member = &btf_type_member(t)[member_idx];
11422 mname = btf_name_by_offset(btf_vmlinux, member->name_off);
11423 func_proto = btf_type_resolve_func_ptr(btf_vmlinux, member->type,
11426 verbose(env, "attach to invalid member %s(@idx %u) of struct %s\n",
11427 mname, member_idx, st_ops->name);
11431 if (st_ops->check_member) {
11432 int err = st_ops->check_member(t, member);
11435 verbose(env, "attach to unsupported member %s of struct %s\n",
11436 mname, st_ops->name);
11441 prog->aux->attach_func_proto = func_proto;
11442 prog->aux->attach_func_name = mname;
11443 env->ops = st_ops->verifier_ops;
11447 #define SECURITY_PREFIX "security_"
11449 static int check_attach_modify_return(unsigned long addr, const char *func_name)
11451 if (within_error_injection_list(addr) ||
11452 !strncmp(SECURITY_PREFIX, func_name, sizeof(SECURITY_PREFIX) - 1))
11458 /* non exhaustive list of sleepable bpf_lsm_*() functions */
11459 BTF_SET_START(btf_sleepable_lsm_hooks)
11460 #ifdef CONFIG_BPF_LSM
11461 BTF_ID(func, bpf_lsm_bprm_committed_creds)
11465 BTF_SET_END(btf_sleepable_lsm_hooks)
11467 static int check_sleepable_lsm_hook(u32 btf_id)
11469 return btf_id_set_contains(&btf_sleepable_lsm_hooks, btf_id);
11472 /* list of non-sleepable functions that are otherwise on
11473 * ALLOW_ERROR_INJECTION list
11475 BTF_SET_START(btf_non_sleepable_error_inject)
11476 /* Three functions below can be called from sleepable and non-sleepable context.
11477 * Assume non-sleepable from bpf safety point of view.
11479 BTF_ID(func, __add_to_page_cache_locked)
11480 BTF_ID(func, should_fail_alloc_page)
11481 BTF_ID(func, should_failslab)
11482 BTF_SET_END(btf_non_sleepable_error_inject)
11484 static int check_non_sleepable_error_inject(u32 btf_id)
11486 return btf_id_set_contains(&btf_non_sleepable_error_inject, btf_id);
11489 int bpf_check_attach_target(struct bpf_verifier_log *log,
11490 const struct bpf_prog *prog,
11491 const struct bpf_prog *tgt_prog,
11493 struct bpf_attach_target_info *tgt_info)
11495 bool prog_extension = prog->type == BPF_PROG_TYPE_EXT;
11496 const char prefix[] = "btf_trace_";
11497 int ret = 0, subprog = -1, i;
11498 const struct btf_type *t;
11499 bool conservative = true;
11505 bpf_log(log, "Tracing programs must provide btf_id\n");
11508 btf = tgt_prog ? tgt_prog->aux->btf : btf_vmlinux;
11511 "FENTRY/FEXIT program can only be attached to another program annotated with BTF\n");
11514 t = btf_type_by_id(btf, btf_id);
11516 bpf_log(log, "attach_btf_id %u is invalid\n", btf_id);
11519 tname = btf_name_by_offset(btf, t->name_off);
11521 bpf_log(log, "attach_btf_id %u doesn't have a name\n", btf_id);
11525 struct bpf_prog_aux *aux = tgt_prog->aux;
11527 for (i = 0; i < aux->func_info_cnt; i++)
11528 if (aux->func_info[i].type_id == btf_id) {
11532 if (subprog == -1) {
11533 bpf_log(log, "Subprog %s doesn't exist\n", tname);
11536 conservative = aux->func_info_aux[subprog].unreliable;
11537 if (prog_extension) {
11538 if (conservative) {
11540 "Cannot replace static functions\n");
11543 if (!prog->jit_requested) {
11545 "Extension programs should be JITed\n");
11549 if (!tgt_prog->jited) {
11550 bpf_log(log, "Can attach to only JITed progs\n");
11553 if (tgt_prog->type == prog->type) {
11554 /* Cannot fentry/fexit another fentry/fexit program.
11555 * Cannot attach program extension to another extension.
11556 * It's ok to attach fentry/fexit to extension program.
11558 bpf_log(log, "Cannot recursively attach\n");
11561 if (tgt_prog->type == BPF_PROG_TYPE_TRACING &&
11563 (tgt_prog->expected_attach_type == BPF_TRACE_FENTRY ||
11564 tgt_prog->expected_attach_type == BPF_TRACE_FEXIT)) {
11565 /* Program extensions can extend all program types
11566 * except fentry/fexit. The reason is the following.
11567 * The fentry/fexit programs are used for performance
11568 * analysis, stats and can be attached to any program
11569 * type except themselves. When extension program is
11570 * replacing XDP function it is necessary to allow
11571 * performance analysis of all functions. Both original
11572 * XDP program and its program extension. Hence
11573 * attaching fentry/fexit to BPF_PROG_TYPE_EXT is
11574 * allowed. If extending of fentry/fexit was allowed it
11575 * would be possible to create long call chain
11576 * fentry->extension->fentry->extension beyond
11577 * reasonable stack size. Hence extending fentry is not
11580 bpf_log(log, "Cannot extend fentry/fexit\n");
11584 if (prog_extension) {
11585 bpf_log(log, "Cannot replace kernel functions\n");
11590 switch (prog->expected_attach_type) {
11591 case BPF_TRACE_RAW_TP:
11594 "Only FENTRY/FEXIT progs are attachable to another BPF prog\n");
11597 if (!btf_type_is_typedef(t)) {
11598 bpf_log(log, "attach_btf_id %u is not a typedef\n",
11602 if (strncmp(prefix, tname, sizeof(prefix) - 1)) {
11603 bpf_log(log, "attach_btf_id %u points to wrong type name %s\n",
11607 tname += sizeof(prefix) - 1;
11608 t = btf_type_by_id(btf, t->type);
11609 if (!btf_type_is_ptr(t))
11610 /* should never happen in valid vmlinux build */
11612 t = btf_type_by_id(btf, t->type);
11613 if (!btf_type_is_func_proto(t))
11614 /* should never happen in valid vmlinux build */
11618 case BPF_TRACE_ITER:
11619 if (!btf_type_is_func(t)) {
11620 bpf_log(log, "attach_btf_id %u is not a function\n",
11624 t = btf_type_by_id(btf, t->type);
11625 if (!btf_type_is_func_proto(t))
11627 ret = btf_distill_func_proto(log, btf, t, tname, &tgt_info->fmodel);
11632 if (!prog_extension)
11635 case BPF_MODIFY_RETURN:
11637 case BPF_TRACE_FENTRY:
11638 case BPF_TRACE_FEXIT:
11639 if (!btf_type_is_func(t)) {
11640 bpf_log(log, "attach_btf_id %u is not a function\n",
11644 if (prog_extension &&
11645 btf_check_type_match(log, prog, btf, t))
11647 t = btf_type_by_id(btf, t->type);
11648 if (!btf_type_is_func_proto(t))
11651 if ((prog->aux->saved_dst_prog_type || prog->aux->saved_dst_attach_type) &&
11652 (!tgt_prog || prog->aux->saved_dst_prog_type != tgt_prog->type ||
11653 prog->aux->saved_dst_attach_type != tgt_prog->expected_attach_type))
11656 if (tgt_prog && conservative)
11659 ret = btf_distill_func_proto(log, btf, t, tname, &tgt_info->fmodel);
11665 addr = (long) tgt_prog->bpf_func;
11667 addr = (long) tgt_prog->aux->func[subprog]->bpf_func;
11669 addr = kallsyms_lookup_name(tname);
11672 "The address of function %s cannot be found\n",
11678 if (prog->aux->sleepable) {
11680 switch (prog->type) {
11681 case BPF_PROG_TYPE_TRACING:
11682 /* fentry/fexit/fmod_ret progs can be sleepable only if they are
11683 * attached to ALLOW_ERROR_INJECTION and are not in denylist.
11685 if (!check_non_sleepable_error_inject(btf_id) &&
11686 within_error_injection_list(addr))
11689 case BPF_PROG_TYPE_LSM:
11690 /* LSM progs check that they are attached to bpf_lsm_*() funcs.
11691 * Only some of them are sleepable.
11693 if (check_sleepable_lsm_hook(btf_id))
11700 bpf_log(log, "%s is not sleepable\n", tname);
11703 } else if (prog->expected_attach_type == BPF_MODIFY_RETURN) {
11705 bpf_log(log, "can't modify return codes of BPF programs\n");
11708 ret = check_attach_modify_return(addr, tname);
11710 bpf_log(log, "%s() is not modifiable\n", tname);
11717 tgt_info->tgt_addr = addr;
11718 tgt_info->tgt_name = tname;
11719 tgt_info->tgt_type = t;
11723 static int check_attach_btf_id(struct bpf_verifier_env *env)
11725 struct bpf_prog *prog = env->prog;
11726 struct bpf_prog *tgt_prog = prog->aux->dst_prog;
11727 struct bpf_attach_target_info tgt_info = {};
11728 u32 btf_id = prog->aux->attach_btf_id;
11729 struct bpf_trampoline *tr;
11733 if (prog->aux->sleepable && prog->type != BPF_PROG_TYPE_TRACING &&
11734 prog->type != BPF_PROG_TYPE_LSM) {
11735 verbose(env, "Only fentry/fexit/fmod_ret and lsm programs can be sleepable\n");
11739 if (prog->type == BPF_PROG_TYPE_STRUCT_OPS)
11740 return check_struct_ops_btf_id(env);
11742 if (prog->type != BPF_PROG_TYPE_TRACING &&
11743 prog->type != BPF_PROG_TYPE_LSM &&
11744 prog->type != BPF_PROG_TYPE_EXT)
11747 ret = bpf_check_attach_target(&env->log, prog, tgt_prog, btf_id, &tgt_info);
11751 if (tgt_prog && prog->type == BPF_PROG_TYPE_EXT) {
11752 /* to make freplace equivalent to their targets, they need to
11753 * inherit env->ops and expected_attach_type for the rest of the
11756 env->ops = bpf_verifier_ops[tgt_prog->type];
11757 prog->expected_attach_type = tgt_prog->expected_attach_type;
11760 /* store info about the attachment target that will be used later */
11761 prog->aux->attach_func_proto = tgt_info.tgt_type;
11762 prog->aux->attach_func_name = tgt_info.tgt_name;
11765 prog->aux->saved_dst_prog_type = tgt_prog->type;
11766 prog->aux->saved_dst_attach_type = tgt_prog->expected_attach_type;
11769 if (prog->expected_attach_type == BPF_TRACE_RAW_TP) {
11770 prog->aux->attach_btf_trace = true;
11772 } else if (prog->expected_attach_type == BPF_TRACE_ITER) {
11773 if (!bpf_iter_prog_supported(prog))
11778 if (prog->type == BPF_PROG_TYPE_LSM) {
11779 ret = bpf_lsm_verify_prog(&env->log, prog);
11784 key = bpf_trampoline_compute_key(tgt_prog, btf_id);
11785 tr = bpf_trampoline_get(key, &tgt_info);
11789 prog->aux->dst_trampoline = tr;
11793 struct btf *bpf_get_btf_vmlinux(void)
11795 if (!btf_vmlinux && IS_ENABLED(CONFIG_DEBUG_INFO_BTF)) {
11796 mutex_lock(&bpf_verifier_lock);
11798 btf_vmlinux = btf_parse_vmlinux();
11799 mutex_unlock(&bpf_verifier_lock);
11801 return btf_vmlinux;
11804 int bpf_check(struct bpf_prog **prog, union bpf_attr *attr,
11805 union bpf_attr __user *uattr)
11807 u64 start_time = ktime_get_ns();
11808 struct bpf_verifier_env *env;
11809 struct bpf_verifier_log *log;
11810 int i, len, ret = -EINVAL;
11813 /* no program is valid */
11814 if (ARRAY_SIZE(bpf_verifier_ops) == 0)
11817 /* 'struct bpf_verifier_env' can be global, but since it's not small,
11818 * allocate/free it every time bpf_check() is called
11820 env = kzalloc(sizeof(struct bpf_verifier_env), GFP_KERNEL);
11825 len = (*prog)->len;
11826 env->insn_aux_data =
11827 vzalloc(array_size(sizeof(struct bpf_insn_aux_data), len));
11829 if (!env->insn_aux_data)
11831 for (i = 0; i < len; i++)
11832 env->insn_aux_data[i].orig_idx = i;
11834 env->ops = bpf_verifier_ops[env->prog->type];
11835 is_priv = bpf_capable();
11837 bpf_get_btf_vmlinux();
11839 /* grab the mutex to protect few globals used by verifier */
11841 mutex_lock(&bpf_verifier_lock);
11843 if (attr->log_level || attr->log_buf || attr->log_size) {
11844 /* user requested verbose verifier output
11845 * and supplied buffer to store the verification trace
11847 log->level = attr->log_level;
11848 log->ubuf = (char __user *) (unsigned long) attr->log_buf;
11849 log->len_total = attr->log_size;
11852 /* log attributes have to be sane */
11853 if (log->len_total < 128 || log->len_total > UINT_MAX >> 2 ||
11854 !log->level || !log->ubuf || log->level & ~BPF_LOG_MASK)
11858 if (IS_ERR(btf_vmlinux)) {
11859 /* Either gcc or pahole or kernel are broken. */
11860 verbose(env, "in-kernel BTF is malformed\n");
11861 ret = PTR_ERR(btf_vmlinux);
11862 goto skip_full_check;
11865 env->strict_alignment = !!(attr->prog_flags & BPF_F_STRICT_ALIGNMENT);
11866 if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS))
11867 env->strict_alignment = true;
11868 if (attr->prog_flags & BPF_F_ANY_ALIGNMENT)
11869 env->strict_alignment = false;
11871 env->allow_ptr_leaks = bpf_allow_ptr_leaks();
11872 env->allow_ptr_to_map_access = bpf_allow_ptr_to_map_access();
11873 env->bypass_spec_v1 = bpf_bypass_spec_v1();
11874 env->bypass_spec_v4 = bpf_bypass_spec_v4();
11875 env->bpf_capable = bpf_capable();
11878 env->test_state_freq = attr->prog_flags & BPF_F_TEST_STATE_FREQ;
11880 if (bpf_prog_is_dev_bound(env->prog->aux)) {
11881 ret = bpf_prog_offload_verifier_prep(env->prog);
11883 goto skip_full_check;
11886 env->explored_states = kvcalloc(state_htab_size(env),
11887 sizeof(struct bpf_verifier_state_list *),
11890 if (!env->explored_states)
11891 goto skip_full_check;
11893 ret = check_subprogs(env);
11895 goto skip_full_check;
11897 ret = check_btf_info(env, attr, uattr);
11899 goto skip_full_check;
11901 ret = check_attach_btf_id(env);
11903 goto skip_full_check;
11905 ret = resolve_pseudo_ldimm64(env);
11907 goto skip_full_check;
11909 ret = check_cfg(env);
11911 goto skip_full_check;
11913 ret = do_check_subprogs(env);
11914 ret = ret ?: do_check_main(env);
11916 if (ret == 0 && bpf_prog_is_dev_bound(env->prog->aux))
11917 ret = bpf_prog_offload_finalize(env);
11920 kvfree(env->explored_states);
11923 ret = check_max_stack_depth(env);
11925 /* instruction rewrites happen after this point */
11928 opt_hard_wire_dead_code_branches(env);
11930 ret = opt_remove_dead_code(env);
11932 ret = opt_remove_nops(env);
11935 sanitize_dead_code(env);
11939 /* program is valid, convert *(u32*)(ctx + off) accesses */
11940 ret = convert_ctx_accesses(env);
11943 ret = fixup_bpf_calls(env);
11945 /* do 32-bit optimization after insn patching has done so those patched
11946 * insns could be handled correctly.
11948 if (ret == 0 && !bpf_prog_is_dev_bound(env->prog->aux)) {
11949 ret = opt_subreg_zext_lo32_rnd_hi32(env, attr);
11950 env->prog->aux->verifier_zext = bpf_jit_needs_zext() ? !ret
11955 ret = fixup_call_args(env);
11957 env->verification_time = ktime_get_ns() - start_time;
11958 print_verification_stats(env);
11960 if (log->level && bpf_verifier_log_full(log))
11962 if (log->level && !log->ubuf) {
11964 goto err_release_maps;
11967 if (ret == 0 && env->used_map_cnt) {
11968 /* if program passed verifier, update used_maps in bpf_prog_info */
11969 env->prog->aux->used_maps = kmalloc_array(env->used_map_cnt,
11970 sizeof(env->used_maps[0]),
11973 if (!env->prog->aux->used_maps) {
11975 goto err_release_maps;
11978 memcpy(env->prog->aux->used_maps, env->used_maps,
11979 sizeof(env->used_maps[0]) * env->used_map_cnt);
11980 env->prog->aux->used_map_cnt = env->used_map_cnt;
11982 /* program is valid. Convert pseudo bpf_ld_imm64 into generic
11983 * bpf_ld_imm64 instructions
11985 convert_pseudo_ld_imm64(env);
11989 adjust_btf_func(env);
11992 if (!env->prog->aux->used_maps)
11993 /* if we didn't copy map pointers into bpf_prog_info, release
11994 * them now. Otherwise free_used_maps() will release them.
11998 /* extension progs temporarily inherit the attach_type of their targets
11999 for verification purposes, so set it back to zero before returning
12001 if (env->prog->type == BPF_PROG_TYPE_EXT)
12002 env->prog->expected_attach_type = 0;
12007 mutex_unlock(&bpf_verifier_lock);
12008 vfree(env->insn_aux_data);