1 /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
2 * Copyright (c) 2016 Facebook
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of version 2 of the GNU General Public
6 * License as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 #include <linux/kernel.h>
14 #include <linux/types.h>
15 #include <linux/slab.h>
16 #include <linux/bpf.h>
17 #include <linux/bpf_verifier.h>
18 #include <linux/filter.h>
19 #include <net/netlink.h>
20 #include <linux/file.h>
21 #include <linux/vmalloc.h>
22 #include <linux/stringify.h>
24 /* bpf_check() is a static code analyzer that walks eBPF program
25 * instruction by instruction and updates register/stack state.
26 * All paths of conditional branches are analyzed until 'bpf_exit' insn.
28 * The first pass is depth-first-search to check that the program is a DAG.
29 * It rejects the following programs:
30 * - larger than BPF_MAXINSNS insns
31 * - if loop is present (detected via back-edge)
32 * - unreachable insns exist (shouldn't be a forest. program = one function)
33 * - out of bounds or malformed jumps
34 * The second pass is all possible path descent from the 1st insn.
35 * Since it's analyzing all pathes through the program, the length of the
36 * analysis is limited to 64k insn, which may be hit even if total number of
37 * insn is less then 4K, but there are too many branches that change stack/regs.
38 * Number of 'branches to be analyzed' is limited to 1k
40 * On entry to each instruction, each register has a type, and the instruction
41 * changes the types of the registers depending on instruction semantics.
42 * If instruction is BPF_MOV64_REG(BPF_REG_1, BPF_REG_5), then type of R5 is
45 * All registers are 64-bit.
46 * R0 - return register
47 * R1-R5 argument passing registers
48 * R6-R9 callee saved registers
49 * R10 - frame pointer read-only
51 * At the start of BPF program the register R1 contains a pointer to bpf_context
52 * and has type PTR_TO_CTX.
54 * Verifier tracks arithmetic operations on pointers in case:
55 * BPF_MOV64_REG(BPF_REG_1, BPF_REG_10),
56 * BPF_ALU64_IMM(BPF_ADD, BPF_REG_1, -20),
57 * 1st insn copies R10 (which has FRAME_PTR) type into R1
58 * and 2nd arithmetic instruction is pattern matched to recognize
59 * that it wants to construct a pointer to some element within stack.
60 * So after 2nd insn, the register R1 has type PTR_TO_STACK
61 * (and -20 constant is saved for further stack bounds checking).
62 * Meaning that this reg is a pointer to stack plus known immediate constant.
64 * Most of the time the registers have UNKNOWN_VALUE type, which
65 * means the register has some value, but it's not a valid pointer.
66 * (like pointer plus pointer becomes UNKNOWN_VALUE type)
68 * When verifier sees load or store instructions the type of base register
69 * can be: PTR_TO_MAP_VALUE, PTR_TO_CTX, FRAME_PTR. These are three pointer
70 * types recognized by check_mem_access() function.
72 * PTR_TO_MAP_VALUE means that this register is pointing to 'map element value'
73 * and the range of [ptr, ptr + map's value_size) is accessible.
75 * registers used to pass values to function calls are checked against
76 * function argument constraints.
78 * ARG_PTR_TO_MAP_KEY is one of such argument constraints.
79 * It means that the register type passed to this function must be
80 * PTR_TO_STACK and it will be used inside the function as
81 * 'pointer to map element key'
83 * For example the argument constraints for bpf_map_lookup_elem():
84 * .ret_type = RET_PTR_TO_MAP_VALUE_OR_NULL,
85 * .arg1_type = ARG_CONST_MAP_PTR,
86 * .arg2_type = ARG_PTR_TO_MAP_KEY,
88 * ret_type says that this function returns 'pointer to map elem value or null'
89 * function expects 1st argument to be a const pointer to 'struct bpf_map' and
90 * 2nd argument should be a pointer to stack, which will be used inside
91 * the helper function as a pointer to map element key.
93 * On the kernel side the helper function looks like:
94 * u64 bpf_map_lookup_elem(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5)
96 * struct bpf_map *map = (struct bpf_map *) (unsigned long) r1;
97 * void *key = (void *) (unsigned long) r2;
100 * here kernel can access 'key' and 'map' pointers safely, knowing that
101 * [key, key + map->key_size) bytes are valid and were initialized on
102 * the stack of eBPF program.
105 * Corresponding eBPF program may look like:
106 * BPF_MOV64_REG(BPF_REG_2, BPF_REG_10), // after this insn R2 type is FRAME_PTR
107 * BPF_ALU64_IMM(BPF_ADD, BPF_REG_2, -4), // after this insn R2 type is PTR_TO_STACK
108 * BPF_LD_MAP_FD(BPF_REG_1, map_fd), // after this insn R1 type is CONST_PTR_TO_MAP
109 * BPF_RAW_INSN(BPF_JMP | BPF_CALL, 0, 0, 0, BPF_FUNC_map_lookup_elem),
110 * here verifier looks at prototype of map_lookup_elem() and sees:
111 * .arg1_type == ARG_CONST_MAP_PTR and R1->type == CONST_PTR_TO_MAP, which is ok,
112 * Now verifier knows that this map has key of R1->map_ptr->key_size bytes
114 * Then .arg2_type == ARG_PTR_TO_MAP_KEY and R2->type == PTR_TO_STACK, ok so far,
115 * Now verifier checks that [R2, R2 + map's key_size) are within stack limits
116 * and were initialized prior to this call.
117 * If it's ok, then verifier allows this BPF_CALL insn and looks at
118 * .ret_type which is RET_PTR_TO_MAP_VALUE_OR_NULL, so it sets
119 * R0->type = PTR_TO_MAP_VALUE_OR_NULL which means bpf_map_lookup_elem() function
120 * returns ether pointer to map value or NULL.
122 * When type PTR_TO_MAP_VALUE_OR_NULL passes through 'if (reg != 0) goto +off'
123 * insn, the register holding that pointer in the true branch changes state to
124 * PTR_TO_MAP_VALUE and the same register changes state to CONST_IMM in the false
125 * branch. See check_cond_jmp_op().
127 * After the call R0 is set to return type of the function and registers R1-R5
128 * are set to NOT_INIT to indicate that they are no longer readable.
131 /* verifier_state + insn_idx are pushed to stack when branch is encountered */
132 struct bpf_verifier_stack_elem {
133 /* verifer state is 'st'
134 * before processing instruction 'insn_idx'
135 * and after processing instruction 'prev_insn_idx'
137 struct bpf_verifier_state st;
140 struct bpf_verifier_stack_elem *next;
143 #define BPF_COMPLEXITY_LIMIT_INSNS 65536
144 #define BPF_COMPLEXITY_LIMIT_STACK 1024
146 #define BPF_MAP_PTR_POISON ((void *)0xeB9F + POISON_POINTER_DELTA)
148 struct bpf_call_arg_meta {
149 struct bpf_map *map_ptr;
156 /* verbose verifier prints what it's seeing
157 * bpf_check() is called under lock, so no race to access these global vars
159 static u32 log_level, log_size, log_len;
160 static char *log_buf;
162 static DEFINE_MUTEX(bpf_verifier_lock);
164 /* log_level controls verbosity level of eBPF verifier.
165 * verbose() is used to dump the verification trace to the log, so the user
166 * can figure out what's wrong with the program
168 static __printf(1, 2) void verbose(const char *fmt, ...)
172 if (log_level == 0 || log_len >= log_size - 1)
176 log_len += vscnprintf(log_buf + log_len, log_size - log_len, fmt, args);
180 /* string representation of 'enum bpf_reg_type' */
181 static const char * const reg_type_str[] = {
183 [UNKNOWN_VALUE] = "inv",
184 [PTR_TO_CTX] = "ctx",
185 [CONST_PTR_TO_MAP] = "map_ptr",
186 [PTR_TO_MAP_VALUE] = "map_value",
187 [PTR_TO_MAP_VALUE_OR_NULL] = "map_value_or_null",
188 [PTR_TO_MAP_VALUE_ADJ] = "map_value_adj",
190 [PTR_TO_STACK] = "fp",
192 [PTR_TO_PACKET] = "pkt",
193 [PTR_TO_PACKET_END] = "pkt_end",
196 #define __BPF_FUNC_STR_FN(x) [BPF_FUNC_ ## x] = __stringify(bpf_ ## x)
197 static const char * const func_id_str[] = {
198 __BPF_FUNC_MAPPER(__BPF_FUNC_STR_FN)
200 #undef __BPF_FUNC_STR_FN
202 static const char *func_id_name(int id)
204 BUILD_BUG_ON(ARRAY_SIZE(func_id_str) != __BPF_FUNC_MAX_ID);
206 if (id >= 0 && id < __BPF_FUNC_MAX_ID && func_id_str[id])
207 return func_id_str[id];
212 static void print_verifier_state(struct bpf_verifier_state *state)
214 struct bpf_reg_state *reg;
218 for (i = 0; i < MAX_BPF_REG; i++) {
219 reg = &state->regs[i];
223 verbose(" R%d=%s", i, reg_type_str[t]);
224 if (t == CONST_IMM || t == PTR_TO_STACK)
225 verbose("%lld", reg->imm);
226 else if (t == PTR_TO_PACKET)
227 verbose("(id=%d,off=%d,r=%d)",
228 reg->id, reg->off, reg->range);
229 else if (t == UNKNOWN_VALUE && reg->imm)
230 verbose("%lld", reg->imm);
231 else if (t == CONST_PTR_TO_MAP || t == PTR_TO_MAP_VALUE ||
232 t == PTR_TO_MAP_VALUE_OR_NULL ||
233 t == PTR_TO_MAP_VALUE_ADJ)
234 verbose("(ks=%d,vs=%d,id=%u)",
235 reg->map_ptr->key_size,
236 reg->map_ptr->value_size,
238 if (reg->min_value != BPF_REGISTER_MIN_RANGE)
239 verbose(",min_value=%lld",
240 (long long)reg->min_value);
241 if (reg->max_value != BPF_REGISTER_MAX_RANGE)
242 verbose(",max_value=%llu",
243 (unsigned long long)reg->max_value);
245 verbose(",min_align=%u", reg->min_align);
247 verbose(",aux_off=%u", reg->aux_off);
248 if (reg->aux_off_align)
249 verbose(",aux_off_align=%u", reg->aux_off_align);
251 for (i = 0; i < MAX_BPF_STACK; i += BPF_REG_SIZE) {
252 if (state->stack_slot_type[i] == STACK_SPILL)
253 verbose(" fp%d=%s", -MAX_BPF_STACK + i,
254 reg_type_str[state->spilled_regs[i / BPF_REG_SIZE].type]);
259 static const char *const bpf_class_string[] = {
267 [BPF_ALU64] = "alu64",
270 static const char *const bpf_alu_string[16] = {
271 [BPF_ADD >> 4] = "+=",
272 [BPF_SUB >> 4] = "-=",
273 [BPF_MUL >> 4] = "*=",
274 [BPF_DIV >> 4] = "/=",
275 [BPF_OR >> 4] = "|=",
276 [BPF_AND >> 4] = "&=",
277 [BPF_LSH >> 4] = "<<=",
278 [BPF_RSH >> 4] = ">>=",
279 [BPF_NEG >> 4] = "neg",
280 [BPF_MOD >> 4] = "%=",
281 [BPF_XOR >> 4] = "^=",
282 [BPF_MOV >> 4] = "=",
283 [BPF_ARSH >> 4] = "s>>=",
284 [BPF_END >> 4] = "endian",
287 static const char *const bpf_ldst_string[] = {
288 [BPF_W >> 3] = "u32",
289 [BPF_H >> 3] = "u16",
291 [BPF_DW >> 3] = "u64",
294 static const char *const bpf_jmp_string[16] = {
295 [BPF_JA >> 4] = "jmp",
296 [BPF_JEQ >> 4] = "==",
297 [BPF_JGT >> 4] = ">",
298 [BPF_JGE >> 4] = ">=",
299 [BPF_JSET >> 4] = "&",
300 [BPF_JNE >> 4] = "!=",
301 [BPF_JSGT >> 4] = "s>",
302 [BPF_JSGE >> 4] = "s>=",
303 [BPF_CALL >> 4] = "call",
304 [BPF_EXIT >> 4] = "exit",
307 static void print_bpf_insn(const struct bpf_verifier_env *env,
308 const struct bpf_insn *insn)
310 u8 class = BPF_CLASS(insn->code);
312 if (class == BPF_ALU || class == BPF_ALU64) {
313 if (BPF_SRC(insn->code) == BPF_X)
314 verbose("(%02x) %sr%d %s %sr%d\n",
315 insn->code, class == BPF_ALU ? "(u32) " : "",
317 bpf_alu_string[BPF_OP(insn->code) >> 4],
318 class == BPF_ALU ? "(u32) " : "",
321 verbose("(%02x) %sr%d %s %s%d\n",
322 insn->code, class == BPF_ALU ? "(u32) " : "",
324 bpf_alu_string[BPF_OP(insn->code) >> 4],
325 class == BPF_ALU ? "(u32) " : "",
327 } else if (class == BPF_STX) {
328 if (BPF_MODE(insn->code) == BPF_MEM)
329 verbose("(%02x) *(%s *)(r%d %+d) = r%d\n",
331 bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
333 insn->off, insn->src_reg);
334 else if (BPF_MODE(insn->code) == BPF_XADD)
335 verbose("(%02x) lock *(%s *)(r%d %+d) += r%d\n",
337 bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
338 insn->dst_reg, insn->off,
341 verbose("BUG_%02x\n", insn->code);
342 } else if (class == BPF_ST) {
343 if (BPF_MODE(insn->code) != BPF_MEM) {
344 verbose("BUG_st_%02x\n", insn->code);
347 verbose("(%02x) *(%s *)(r%d %+d) = %d\n",
349 bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
351 insn->off, insn->imm);
352 } else if (class == BPF_LDX) {
353 if (BPF_MODE(insn->code) != BPF_MEM) {
354 verbose("BUG_ldx_%02x\n", insn->code);
357 verbose("(%02x) r%d = *(%s *)(r%d %+d)\n",
358 insn->code, insn->dst_reg,
359 bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
360 insn->src_reg, insn->off);
361 } else if (class == BPF_LD) {
362 if (BPF_MODE(insn->code) == BPF_ABS) {
363 verbose("(%02x) r0 = *(%s *)skb[%d]\n",
365 bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
367 } else if (BPF_MODE(insn->code) == BPF_IND) {
368 verbose("(%02x) r0 = *(%s *)skb[r%d + %d]\n",
370 bpf_ldst_string[BPF_SIZE(insn->code) >> 3],
371 insn->src_reg, insn->imm);
372 } else if (BPF_MODE(insn->code) == BPF_IMM &&
373 BPF_SIZE(insn->code) == BPF_DW) {
374 /* At this point, we already made sure that the second
375 * part of the ldimm64 insn is accessible.
377 u64 imm = ((u64)(insn + 1)->imm << 32) | (u32)insn->imm;
378 bool map_ptr = insn->src_reg == BPF_PSEUDO_MAP_FD;
380 if (map_ptr && !env->allow_ptr_leaks)
383 verbose("(%02x) r%d = 0x%llx\n", insn->code,
384 insn->dst_reg, (unsigned long long)imm);
386 verbose("BUG_ld_%02x\n", insn->code);
389 } else if (class == BPF_JMP) {
390 u8 opcode = BPF_OP(insn->code);
392 if (opcode == BPF_CALL) {
393 verbose("(%02x) call %s#%d\n", insn->code,
394 func_id_name(insn->imm), insn->imm);
395 } else if (insn->code == (BPF_JMP | BPF_JA)) {
396 verbose("(%02x) goto pc%+d\n",
397 insn->code, insn->off);
398 } else if (insn->code == (BPF_JMP | BPF_EXIT)) {
399 verbose("(%02x) exit\n", insn->code);
400 } else if (BPF_SRC(insn->code) == BPF_X) {
401 verbose("(%02x) if r%d %s r%d goto pc%+d\n",
402 insn->code, insn->dst_reg,
403 bpf_jmp_string[BPF_OP(insn->code) >> 4],
404 insn->src_reg, insn->off);
406 verbose("(%02x) if r%d %s 0x%x goto pc%+d\n",
407 insn->code, insn->dst_reg,
408 bpf_jmp_string[BPF_OP(insn->code) >> 4],
409 insn->imm, insn->off);
412 verbose("(%02x) %s\n", insn->code, bpf_class_string[class]);
416 static int pop_stack(struct bpf_verifier_env *env, int *prev_insn_idx)
418 struct bpf_verifier_stack_elem *elem;
421 if (env->head == NULL)
424 memcpy(&env->cur_state, &env->head->st, sizeof(env->cur_state));
425 insn_idx = env->head->insn_idx;
427 *prev_insn_idx = env->head->prev_insn_idx;
428 elem = env->head->next;
435 static struct bpf_verifier_state *push_stack(struct bpf_verifier_env *env,
436 int insn_idx, int prev_insn_idx)
438 struct bpf_verifier_stack_elem *elem;
440 elem = kmalloc(sizeof(struct bpf_verifier_stack_elem), GFP_KERNEL);
444 memcpy(&elem->st, &env->cur_state, sizeof(env->cur_state));
445 elem->insn_idx = insn_idx;
446 elem->prev_insn_idx = prev_insn_idx;
447 elem->next = env->head;
450 if (env->stack_size > BPF_COMPLEXITY_LIMIT_STACK) {
451 verbose("BPF program is too complex\n");
456 /* pop all elements and return */
457 while (pop_stack(env, NULL) >= 0);
461 #define CALLER_SAVED_REGS 6
462 static const int caller_saved[CALLER_SAVED_REGS] = {
463 BPF_REG_0, BPF_REG_1, BPF_REG_2, BPF_REG_3, BPF_REG_4, BPF_REG_5
466 static void init_reg_state(struct bpf_reg_state *regs)
470 for (i = 0; i < MAX_BPF_REG; i++) {
471 regs[i].type = NOT_INIT;
473 regs[i].min_value = BPF_REGISTER_MIN_RANGE;
474 regs[i].max_value = BPF_REGISTER_MAX_RANGE;
475 regs[i].min_align = 0;
477 regs[i].aux_off_align = 0;
481 regs[BPF_REG_FP].type = FRAME_PTR;
483 /* 1st arg to a function */
484 regs[BPF_REG_1].type = PTR_TO_CTX;
487 static void __mark_reg_unknown_value(struct bpf_reg_state *regs, u32 regno)
489 regs[regno].type = UNKNOWN_VALUE;
494 static void mark_reg_unknown_value(struct bpf_reg_state *regs, u32 regno)
496 BUG_ON(regno >= MAX_BPF_REG);
497 __mark_reg_unknown_value(regs, regno);
500 static void reset_reg_range_values(struct bpf_reg_state *regs, u32 regno)
502 regs[regno].min_value = BPF_REGISTER_MIN_RANGE;
503 regs[regno].max_value = BPF_REGISTER_MAX_RANGE;
504 regs[regno].min_align = 0;
507 static void mark_reg_unknown_value_and_range(struct bpf_reg_state *regs,
510 mark_reg_unknown_value(regs, regno);
511 reset_reg_range_values(regs, regno);
515 SRC_OP, /* register is used as source operand */
516 DST_OP, /* register is used as destination operand */
517 DST_OP_NO_MARK /* same as above, check only, don't mark */
520 static int check_reg_arg(struct bpf_reg_state *regs, u32 regno,
523 if (regno >= MAX_BPF_REG) {
524 verbose("R%d is invalid\n", regno);
529 /* check whether register used as source operand can be read */
530 if (regs[regno].type == NOT_INIT) {
531 verbose("R%d !read_ok\n", regno);
535 /* check whether register used as dest operand can be written to */
536 if (regno == BPF_REG_FP) {
537 verbose("frame pointer is read only\n");
541 mark_reg_unknown_value(regs, regno);
546 static int bpf_size_to_bytes(int bpf_size)
548 if (bpf_size == BPF_W)
550 else if (bpf_size == BPF_H)
552 else if (bpf_size == BPF_B)
554 else if (bpf_size == BPF_DW)
560 static bool is_spillable_regtype(enum bpf_reg_type type)
563 case PTR_TO_MAP_VALUE:
564 case PTR_TO_MAP_VALUE_OR_NULL:
565 case PTR_TO_MAP_VALUE_ADJ:
569 case PTR_TO_PACKET_END:
571 case CONST_PTR_TO_MAP:
578 /* check_stack_read/write functions track spill/fill of registers,
579 * stack boundary and alignment are checked in check_mem_access()
581 static int check_stack_write(struct bpf_verifier_state *state, int off,
582 int size, int value_regno)
585 /* caller checked that off % size == 0 and -MAX_BPF_STACK <= off < 0,
586 * so it's aligned access and [off, off + size) are within stack limits
589 if (value_regno >= 0 &&
590 is_spillable_regtype(state->regs[value_regno].type)) {
592 /* register containing pointer is being spilled into stack */
593 if (size != BPF_REG_SIZE) {
594 verbose("invalid size of register spill\n");
598 /* save register state */
599 state->spilled_regs[(MAX_BPF_STACK + off) / BPF_REG_SIZE] =
600 state->regs[value_regno];
602 for (i = 0; i < BPF_REG_SIZE; i++)
603 state->stack_slot_type[MAX_BPF_STACK + off + i] = STACK_SPILL;
605 /* regular write of data into stack */
606 state->spilled_regs[(MAX_BPF_STACK + off) / BPF_REG_SIZE] =
607 (struct bpf_reg_state) {};
609 for (i = 0; i < size; i++)
610 state->stack_slot_type[MAX_BPF_STACK + off + i] = STACK_MISC;
615 static int check_stack_read(struct bpf_verifier_state *state, int off, int size,
621 slot_type = &state->stack_slot_type[MAX_BPF_STACK + off];
623 if (slot_type[0] == STACK_SPILL) {
624 if (size != BPF_REG_SIZE) {
625 verbose("invalid size of register spill\n");
628 for (i = 1; i < BPF_REG_SIZE; i++) {
629 if (slot_type[i] != STACK_SPILL) {
630 verbose("corrupted spill memory\n");
635 if (value_regno >= 0)
636 /* restore register state from stack */
637 state->regs[value_regno] =
638 state->spilled_regs[(MAX_BPF_STACK + off) / BPF_REG_SIZE];
641 for (i = 0; i < size; i++) {
642 if (slot_type[i] != STACK_MISC) {
643 verbose("invalid read from stack off %d+%d size %d\n",
648 if (value_regno >= 0)
649 /* have read misc data from the stack */
650 mark_reg_unknown_value_and_range(state->regs,
656 /* check read/write into map element returned by bpf_map_lookup_elem() */
657 static int check_map_access(struct bpf_verifier_env *env, u32 regno, int off,
660 struct bpf_map *map = env->cur_state.regs[regno].map_ptr;
662 if (off < 0 || size <= 0 || off + size > map->value_size) {
663 verbose("invalid access to map value, value_size=%d off=%d size=%d\n",
664 map->value_size, off, size);
670 /* check read/write into an adjusted map element */
671 static int check_map_access_adj(struct bpf_verifier_env *env, u32 regno,
674 struct bpf_verifier_state *state = &env->cur_state;
675 struct bpf_reg_state *reg = &state->regs[regno];
678 /* We adjusted the register to this map value, so we
679 * need to change off and size to min_value and max_value
680 * respectively to make sure our theoretical access will be
684 print_verifier_state(state);
685 env->varlen_map_value_access = true;
686 /* The minimum value is only important with signed
687 * comparisons where we can't assume the floor of a
688 * value is 0. If we are using signed variables for our
689 * index'es we need to make sure that whatever we use
690 * will have a set floor within our range.
692 if (reg->min_value < 0) {
693 verbose("R%d min value is negative, either use unsigned index or do a if (index >=0) check.\n",
697 err = check_map_access(env, regno, reg->min_value + off, size);
699 verbose("R%d min value is outside of the array range\n",
704 /* If we haven't set a max value then we need to bail
705 * since we can't be sure we won't do bad things.
707 if (reg->max_value == BPF_REGISTER_MAX_RANGE) {
708 verbose("R%d unbounded memory access, make sure to bounds check any array access into a map\n",
712 return check_map_access(env, regno, reg->max_value + off, size);
715 #define MAX_PACKET_OFF 0xffff
717 static bool may_access_direct_pkt_data(struct bpf_verifier_env *env,
718 const struct bpf_call_arg_meta *meta,
719 enum bpf_access_type t)
721 switch (env->prog->type) {
722 case BPF_PROG_TYPE_LWT_IN:
723 case BPF_PROG_TYPE_LWT_OUT:
724 /* dst_input() and dst_output() can't write for now */
728 case BPF_PROG_TYPE_SCHED_CLS:
729 case BPF_PROG_TYPE_SCHED_ACT:
730 case BPF_PROG_TYPE_XDP:
731 case BPF_PROG_TYPE_LWT_XMIT:
733 return meta->pkt_access;
735 env->seen_direct_write = true;
742 static int check_packet_access(struct bpf_verifier_env *env, u32 regno, int off,
745 struct bpf_reg_state *regs = env->cur_state.regs;
746 struct bpf_reg_state *reg = ®s[regno];
749 if (off < 0 || size <= 0 || off + size > reg->range) {
750 verbose("invalid access to packet, off=%d size=%d, R%d(id=%d,off=%d,r=%d)\n",
751 off, size, regno, reg->id, reg->off, reg->range);
757 /* check access to 'struct bpf_context' fields */
758 static int check_ctx_access(struct bpf_verifier_env *env, int off, int size,
759 enum bpf_access_type t, enum bpf_reg_type *reg_type)
761 /* for analyzer ctx accesses are already validated and converted */
762 if (env->analyzer_ops)
765 if (env->prog->aux->ops->is_valid_access &&
766 env->prog->aux->ops->is_valid_access(off, size, t, reg_type)) {
767 /* remember the offset of last byte accessed in ctx */
768 if (env->prog->aux->max_ctx_offset < off + size)
769 env->prog->aux->max_ctx_offset = off + size;
773 verbose("invalid bpf_context access off=%d size=%d\n", off, size);
777 static bool is_pointer_value(struct bpf_verifier_env *env, int regno)
779 if (env->allow_ptr_leaks)
782 switch (env->cur_state.regs[regno].type) {
791 static int check_pkt_ptr_alignment(const struct bpf_reg_state *reg,
792 int off, int size, bool strict)
796 /* Byte size accesses are always allowed. */
797 if (!strict || size == 1)
802 if (reg->aux_off_align % size) {
803 verbose("Packet access is only %u byte aligned, %d byte access not allowed\n",
804 reg->aux_off_align, size);
807 reg_off += reg->aux_off;
810 /* skb->data is NET_IP_ALIGN-ed */
811 if ((NET_IP_ALIGN + reg_off + off) % size != 0) {
812 verbose("misaligned packet access off %d+%d+%d size %d\n",
813 NET_IP_ALIGN, reg_off, off, size);
820 static int check_val_ptr_alignment(const struct bpf_reg_state *reg,
821 int size, bool strict)
823 if (strict && size != 1) {
824 verbose("Unknown alignment. Only byte-sized access allowed in value access.\n");
831 static int check_ptr_alignment(const struct bpf_reg_state *reg,
836 if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS))
841 return check_pkt_ptr_alignment(reg, off, size, strict);
842 case PTR_TO_MAP_VALUE_ADJ:
843 return check_val_ptr_alignment(reg, size, strict);
845 if (off % size != 0) {
846 verbose("misaligned access off %d size %d\n",
855 /* check whether memory at (regno + off) is accessible for t = (read | write)
856 * if t==write, value_regno is a register which value is stored into memory
857 * if t==read, value_regno is a register which will receive the value from memory
858 * if t==write && value_regno==-1, some unknown value is stored into memory
859 * if t==read && value_regno==-1, don't care what we read from memory
861 static int check_mem_access(struct bpf_verifier_env *env, u32 regno, int off,
862 int bpf_size, enum bpf_access_type t,
865 struct bpf_verifier_state *state = &env->cur_state;
866 struct bpf_reg_state *reg = &state->regs[regno];
869 if (reg->type == PTR_TO_STACK)
872 size = bpf_size_to_bytes(bpf_size);
876 err = check_ptr_alignment(reg, off, size);
880 if (reg->type == PTR_TO_MAP_VALUE ||
881 reg->type == PTR_TO_MAP_VALUE_ADJ) {
882 if (t == BPF_WRITE && value_regno >= 0 &&
883 is_pointer_value(env, value_regno)) {
884 verbose("R%d leaks addr into map\n", value_regno);
888 if (reg->type == PTR_TO_MAP_VALUE_ADJ)
889 err = check_map_access_adj(env, regno, off, size);
891 err = check_map_access(env, regno, off, size);
892 if (!err && t == BPF_READ && value_regno >= 0)
893 mark_reg_unknown_value_and_range(state->regs,
896 } else if (reg->type == PTR_TO_CTX) {
897 enum bpf_reg_type reg_type = UNKNOWN_VALUE;
899 if (t == BPF_WRITE && value_regno >= 0 &&
900 is_pointer_value(env, value_regno)) {
901 verbose("R%d leaks addr into ctx\n", value_regno);
904 err = check_ctx_access(env, off, size, t, ®_type);
905 if (!err && t == BPF_READ && value_regno >= 0) {
906 mark_reg_unknown_value_and_range(state->regs,
908 /* note that reg.[id|off|range] == 0 */
909 state->regs[value_regno].type = reg_type;
910 state->regs[value_regno].aux_off = 0;
911 state->regs[value_regno].aux_off_align = 0;
914 } else if (reg->type == FRAME_PTR || reg->type == PTR_TO_STACK) {
915 if (off >= 0 || off < -MAX_BPF_STACK) {
916 verbose("invalid stack off=%d size=%d\n", off, size);
919 if (t == BPF_WRITE) {
920 if (!env->allow_ptr_leaks &&
921 state->stack_slot_type[MAX_BPF_STACK + off] == STACK_SPILL &&
922 size != BPF_REG_SIZE) {
923 verbose("attempt to corrupt spilled pointer on stack\n");
926 err = check_stack_write(state, off, size, value_regno);
928 err = check_stack_read(state, off, size, value_regno);
930 } else if (state->regs[regno].type == PTR_TO_PACKET) {
931 if (t == BPF_WRITE && !may_access_direct_pkt_data(env, NULL, t)) {
932 verbose("cannot write into packet\n");
935 if (t == BPF_WRITE && value_regno >= 0 &&
936 is_pointer_value(env, value_regno)) {
937 verbose("R%d leaks addr into packet\n", value_regno);
940 err = check_packet_access(env, regno, off, size);
941 if (!err && t == BPF_READ && value_regno >= 0)
942 mark_reg_unknown_value_and_range(state->regs,
945 verbose("R%d invalid mem access '%s'\n",
946 regno, reg_type_str[reg->type]);
950 if (!err && size <= 2 && value_regno >= 0 && env->allow_ptr_leaks &&
951 state->regs[value_regno].type == UNKNOWN_VALUE) {
952 /* 1 or 2 byte load zero-extends, determine the number of
953 * zero upper bits. Not doing it fo 4 byte load, since
954 * such values cannot be added to ptr_to_packet anyway.
956 state->regs[value_regno].imm = 64 - size * 8;
961 static int check_xadd(struct bpf_verifier_env *env, struct bpf_insn *insn)
963 struct bpf_reg_state *regs = env->cur_state.regs;
966 if ((BPF_SIZE(insn->code) != BPF_W && BPF_SIZE(insn->code) != BPF_DW) ||
968 verbose("BPF_XADD uses reserved fields\n");
972 /* check src1 operand */
973 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
977 /* check src2 operand */
978 err = check_reg_arg(regs, insn->dst_reg, SRC_OP);
982 /* check whether atomic_add can read the memory */
983 err = check_mem_access(env, insn->dst_reg, insn->off,
984 BPF_SIZE(insn->code), BPF_READ, -1);
988 /* check whether atomic_add can write into the same memory */
989 return check_mem_access(env, insn->dst_reg, insn->off,
990 BPF_SIZE(insn->code), BPF_WRITE, -1);
993 /* when register 'regno' is passed into function that will read 'access_size'
994 * bytes from that pointer, make sure that it's within stack boundary
995 * and all elements of stack are initialized
997 static int check_stack_boundary(struct bpf_verifier_env *env, int regno,
998 int access_size, bool zero_size_allowed,
999 struct bpf_call_arg_meta *meta)
1001 struct bpf_verifier_state *state = &env->cur_state;
1002 struct bpf_reg_state *regs = state->regs;
1005 if (regs[regno].type != PTR_TO_STACK) {
1006 if (zero_size_allowed && access_size == 0 &&
1007 regs[regno].type == CONST_IMM &&
1008 regs[regno].imm == 0)
1011 verbose("R%d type=%s expected=%s\n", regno,
1012 reg_type_str[regs[regno].type],
1013 reg_type_str[PTR_TO_STACK]);
1017 off = regs[regno].imm;
1018 if (off >= 0 || off < -MAX_BPF_STACK || off + access_size > 0 ||
1020 verbose("invalid stack type R%d off=%d access_size=%d\n",
1021 regno, off, access_size);
1025 if (meta && meta->raw_mode) {
1026 meta->access_size = access_size;
1027 meta->regno = regno;
1031 for (i = 0; i < access_size; i++) {
1032 if (state->stack_slot_type[MAX_BPF_STACK + off + i] != STACK_MISC) {
1033 verbose("invalid indirect read from stack off %d+%d size %d\n",
1034 off, i, access_size);
1041 static int check_helper_mem_access(struct bpf_verifier_env *env, int regno,
1042 int access_size, bool zero_size_allowed,
1043 struct bpf_call_arg_meta *meta)
1045 struct bpf_reg_state *regs = env->cur_state.regs;
1047 switch (regs[regno].type) {
1049 return check_packet_access(env, regno, 0, access_size);
1050 case PTR_TO_MAP_VALUE:
1051 return check_map_access(env, regno, 0, access_size);
1052 case PTR_TO_MAP_VALUE_ADJ:
1053 return check_map_access_adj(env, regno, 0, access_size);
1054 default: /* const_imm|ptr_to_stack or invalid ptr */
1055 return check_stack_boundary(env, regno, access_size,
1056 zero_size_allowed, meta);
1060 static int check_func_arg(struct bpf_verifier_env *env, u32 regno,
1061 enum bpf_arg_type arg_type,
1062 struct bpf_call_arg_meta *meta)
1064 struct bpf_reg_state *regs = env->cur_state.regs, *reg = ®s[regno];
1065 enum bpf_reg_type expected_type, type = reg->type;
1068 if (arg_type == ARG_DONTCARE)
1071 if (type == NOT_INIT) {
1072 verbose("R%d !read_ok\n", regno);
1076 if (arg_type == ARG_ANYTHING) {
1077 if (is_pointer_value(env, regno)) {
1078 verbose("R%d leaks addr into helper function\n", regno);
1084 if (type == PTR_TO_PACKET &&
1085 !may_access_direct_pkt_data(env, meta, BPF_READ)) {
1086 verbose("helper access to the packet is not allowed\n");
1090 if (arg_type == ARG_PTR_TO_MAP_KEY ||
1091 arg_type == ARG_PTR_TO_MAP_VALUE) {
1092 expected_type = PTR_TO_STACK;
1093 if (type != PTR_TO_PACKET && type != expected_type)
1095 } else if (arg_type == ARG_CONST_SIZE ||
1096 arg_type == ARG_CONST_SIZE_OR_ZERO) {
1097 expected_type = CONST_IMM;
1098 /* One exception. Allow UNKNOWN_VALUE registers when the
1099 * boundaries are known and don't cause unsafe memory accesses
1101 if (type != UNKNOWN_VALUE && type != expected_type)
1103 } else if (arg_type == ARG_CONST_MAP_PTR) {
1104 expected_type = CONST_PTR_TO_MAP;
1105 if (type != expected_type)
1107 } else if (arg_type == ARG_PTR_TO_CTX) {
1108 expected_type = PTR_TO_CTX;
1109 if (type != expected_type)
1111 } else if (arg_type == ARG_PTR_TO_MEM ||
1112 arg_type == ARG_PTR_TO_UNINIT_MEM) {
1113 expected_type = PTR_TO_STACK;
1114 /* One exception here. In case function allows for NULL to be
1115 * passed in as argument, it's a CONST_IMM type. Final test
1116 * happens during stack boundary checking.
1118 if (type == CONST_IMM && reg->imm == 0)
1119 /* final test in check_stack_boundary() */;
1120 else if (type != PTR_TO_PACKET && type != PTR_TO_MAP_VALUE &&
1121 type != PTR_TO_MAP_VALUE_ADJ && type != expected_type)
1123 meta->raw_mode = arg_type == ARG_PTR_TO_UNINIT_MEM;
1125 verbose("unsupported arg_type %d\n", arg_type);
1129 if (arg_type == ARG_CONST_MAP_PTR) {
1130 /* bpf_map_xxx(map_ptr) call: remember that map_ptr */
1131 meta->map_ptr = reg->map_ptr;
1132 } else if (arg_type == ARG_PTR_TO_MAP_KEY) {
1133 /* bpf_map_xxx(..., map_ptr, ..., key) call:
1134 * check that [key, key + map->key_size) are within
1135 * stack limits and initialized
1137 if (!meta->map_ptr) {
1138 /* in function declaration map_ptr must come before
1139 * map_key, so that it's verified and known before
1140 * we have to check map_key here. Otherwise it means
1141 * that kernel subsystem misconfigured verifier
1143 verbose("invalid map_ptr to access map->key\n");
1146 if (type == PTR_TO_PACKET)
1147 err = check_packet_access(env, regno, 0,
1148 meta->map_ptr->key_size);
1150 err = check_stack_boundary(env, regno,
1151 meta->map_ptr->key_size,
1153 } else if (arg_type == ARG_PTR_TO_MAP_VALUE) {
1154 /* bpf_map_xxx(..., map_ptr, ..., value) call:
1155 * check [value, value + map->value_size) validity
1157 if (!meta->map_ptr) {
1158 /* kernel subsystem misconfigured verifier */
1159 verbose("invalid map_ptr to access map->value\n");
1162 if (type == PTR_TO_PACKET)
1163 err = check_packet_access(env, regno, 0,
1164 meta->map_ptr->value_size);
1166 err = check_stack_boundary(env, regno,
1167 meta->map_ptr->value_size,
1169 } else if (arg_type == ARG_CONST_SIZE ||
1170 arg_type == ARG_CONST_SIZE_OR_ZERO) {
1171 bool zero_size_allowed = (arg_type == ARG_CONST_SIZE_OR_ZERO);
1173 /* bpf_xxx(..., buf, len) call will access 'len' bytes
1174 * from stack pointer 'buf'. Check it
1175 * note: regno == len, regno - 1 == buf
1178 /* kernel subsystem misconfigured verifier */
1179 verbose("ARG_CONST_SIZE cannot be first argument\n");
1183 /* If the register is UNKNOWN_VALUE, the access check happens
1184 * using its boundaries. Otherwise, just use its imm
1186 if (type == UNKNOWN_VALUE) {
1187 /* For unprivileged variable accesses, disable raw
1188 * mode so that the program is required to
1189 * initialize all the memory that the helper could
1190 * just partially fill up.
1194 if (reg->min_value < 0) {
1195 verbose("R%d min value is negative, either use unsigned or 'var &= const'\n",
1200 if (reg->min_value == 0) {
1201 err = check_helper_mem_access(env, regno - 1, 0,
1208 if (reg->max_value == BPF_REGISTER_MAX_RANGE) {
1209 verbose("R%d unbounded memory access, use 'var &= const' or 'if (var < const)'\n",
1213 err = check_helper_mem_access(env, regno - 1,
1215 zero_size_allowed, meta);
1219 /* register is CONST_IMM */
1220 err = check_helper_mem_access(env, regno - 1, reg->imm,
1221 zero_size_allowed, meta);
1227 verbose("R%d type=%s expected=%s\n", regno,
1228 reg_type_str[type], reg_type_str[expected_type]);
1232 static int check_map_func_compatibility(struct bpf_map *map, int func_id)
1237 /* We need a two way check, first is from map perspective ... */
1238 switch (map->map_type) {
1239 case BPF_MAP_TYPE_PROG_ARRAY:
1240 if (func_id != BPF_FUNC_tail_call)
1243 case BPF_MAP_TYPE_PERF_EVENT_ARRAY:
1244 if (func_id != BPF_FUNC_perf_event_read &&
1245 func_id != BPF_FUNC_perf_event_output)
1248 case BPF_MAP_TYPE_STACK_TRACE:
1249 if (func_id != BPF_FUNC_get_stackid)
1252 case BPF_MAP_TYPE_CGROUP_ARRAY:
1253 if (func_id != BPF_FUNC_skb_under_cgroup &&
1254 func_id != BPF_FUNC_current_task_under_cgroup)
1257 case BPF_MAP_TYPE_ARRAY_OF_MAPS:
1258 case BPF_MAP_TYPE_HASH_OF_MAPS:
1259 if (func_id != BPF_FUNC_map_lookup_elem)
1265 /* ... and second from the function itself. */
1267 case BPF_FUNC_tail_call:
1268 if (map->map_type != BPF_MAP_TYPE_PROG_ARRAY)
1271 case BPF_FUNC_perf_event_read:
1272 case BPF_FUNC_perf_event_output:
1273 if (map->map_type != BPF_MAP_TYPE_PERF_EVENT_ARRAY)
1276 case BPF_FUNC_get_stackid:
1277 if (map->map_type != BPF_MAP_TYPE_STACK_TRACE)
1280 case BPF_FUNC_current_task_under_cgroup:
1281 case BPF_FUNC_skb_under_cgroup:
1282 if (map->map_type != BPF_MAP_TYPE_CGROUP_ARRAY)
1291 verbose("cannot pass map_type %d into func %s#%d\n",
1292 map->map_type, func_id_name(func_id), func_id);
1296 static int check_raw_mode(const struct bpf_func_proto *fn)
1300 if (fn->arg1_type == ARG_PTR_TO_UNINIT_MEM)
1302 if (fn->arg2_type == ARG_PTR_TO_UNINIT_MEM)
1304 if (fn->arg3_type == ARG_PTR_TO_UNINIT_MEM)
1306 if (fn->arg4_type == ARG_PTR_TO_UNINIT_MEM)
1308 if (fn->arg5_type == ARG_PTR_TO_UNINIT_MEM)
1311 return count > 1 ? -EINVAL : 0;
1314 static void clear_all_pkt_pointers(struct bpf_verifier_env *env)
1316 struct bpf_verifier_state *state = &env->cur_state;
1317 struct bpf_reg_state *regs = state->regs, *reg;
1320 for (i = 0; i < MAX_BPF_REG; i++)
1321 if (regs[i].type == PTR_TO_PACKET ||
1322 regs[i].type == PTR_TO_PACKET_END)
1323 mark_reg_unknown_value(regs, i);
1325 for (i = 0; i < MAX_BPF_STACK; i += BPF_REG_SIZE) {
1326 if (state->stack_slot_type[i] != STACK_SPILL)
1328 reg = &state->spilled_regs[i / BPF_REG_SIZE];
1329 if (reg->type != PTR_TO_PACKET &&
1330 reg->type != PTR_TO_PACKET_END)
1332 reg->type = UNKNOWN_VALUE;
1337 static int check_call(struct bpf_verifier_env *env, int func_id, int insn_idx)
1339 struct bpf_verifier_state *state = &env->cur_state;
1340 const struct bpf_func_proto *fn = NULL;
1341 struct bpf_reg_state *regs = state->regs;
1342 struct bpf_reg_state *reg;
1343 struct bpf_call_arg_meta meta;
1347 /* find function prototype */
1348 if (func_id < 0 || func_id >= __BPF_FUNC_MAX_ID) {
1349 verbose("invalid func %s#%d\n", func_id_name(func_id), func_id);
1353 if (env->prog->aux->ops->get_func_proto)
1354 fn = env->prog->aux->ops->get_func_proto(func_id);
1357 verbose("unknown func %s#%d\n", func_id_name(func_id), func_id);
1361 /* eBPF programs must be GPL compatible to use GPL-ed functions */
1362 if (!env->prog->gpl_compatible && fn->gpl_only) {
1363 verbose("cannot call GPL only function from proprietary program\n");
1367 changes_data = bpf_helper_changes_pkt_data(fn->func);
1369 memset(&meta, 0, sizeof(meta));
1370 meta.pkt_access = fn->pkt_access;
1372 /* We only support one arg being in raw mode at the moment, which
1373 * is sufficient for the helper functions we have right now.
1375 err = check_raw_mode(fn);
1377 verbose("kernel subsystem misconfigured func %s#%d\n",
1378 func_id_name(func_id), func_id);
1383 err = check_func_arg(env, BPF_REG_1, fn->arg1_type, &meta);
1386 err = check_func_arg(env, BPF_REG_2, fn->arg2_type, &meta);
1389 err = check_func_arg(env, BPF_REG_3, fn->arg3_type, &meta);
1392 err = check_func_arg(env, BPF_REG_4, fn->arg4_type, &meta);
1395 err = check_func_arg(env, BPF_REG_5, fn->arg5_type, &meta);
1399 /* Mark slots with STACK_MISC in case of raw mode, stack offset
1400 * is inferred from register state.
1402 for (i = 0; i < meta.access_size; i++) {
1403 err = check_mem_access(env, meta.regno, i, BPF_B, BPF_WRITE, -1);
1408 /* reset caller saved regs */
1409 for (i = 0; i < CALLER_SAVED_REGS; i++) {
1410 reg = regs + caller_saved[i];
1411 reg->type = NOT_INIT;
1415 /* update return register */
1416 if (fn->ret_type == RET_INTEGER) {
1417 regs[BPF_REG_0].type = UNKNOWN_VALUE;
1418 } else if (fn->ret_type == RET_VOID) {
1419 regs[BPF_REG_0].type = NOT_INIT;
1420 } else if (fn->ret_type == RET_PTR_TO_MAP_VALUE_OR_NULL) {
1421 struct bpf_insn_aux_data *insn_aux;
1423 regs[BPF_REG_0].type = PTR_TO_MAP_VALUE_OR_NULL;
1424 regs[BPF_REG_0].max_value = regs[BPF_REG_0].min_value = 0;
1425 /* remember map_ptr, so that check_map_access()
1426 * can check 'value_size' boundary of memory access
1427 * to map element returned from bpf_map_lookup_elem()
1429 if (meta.map_ptr == NULL) {
1430 verbose("kernel subsystem misconfigured verifier\n");
1433 regs[BPF_REG_0].map_ptr = meta.map_ptr;
1434 regs[BPF_REG_0].id = ++env->id_gen;
1435 insn_aux = &env->insn_aux_data[insn_idx];
1436 if (!insn_aux->map_ptr)
1437 insn_aux->map_ptr = meta.map_ptr;
1438 else if (insn_aux->map_ptr != meta.map_ptr)
1439 insn_aux->map_ptr = BPF_MAP_PTR_POISON;
1441 verbose("unknown return type %d of func %s#%d\n",
1442 fn->ret_type, func_id_name(func_id), func_id);
1446 err = check_map_func_compatibility(meta.map_ptr, func_id);
1451 clear_all_pkt_pointers(env);
1455 static int check_packet_ptr_add(struct bpf_verifier_env *env,
1456 struct bpf_insn *insn)
1458 struct bpf_reg_state *regs = env->cur_state.regs;
1459 struct bpf_reg_state *dst_reg = ®s[insn->dst_reg];
1460 struct bpf_reg_state *src_reg = ®s[insn->src_reg];
1461 struct bpf_reg_state tmp_reg;
1464 if (BPF_SRC(insn->code) == BPF_K) {
1465 /* pkt_ptr += imm */
1470 verbose("addition of negative constant to packet pointer is not allowed\n");
1473 if (imm >= MAX_PACKET_OFF ||
1474 imm + dst_reg->off >= MAX_PACKET_OFF) {
1475 verbose("constant %d is too large to add to packet pointer\n",
1479 /* a constant was added to pkt_ptr.
1480 * Remember it while keeping the same 'id'
1482 dst_reg->off += imm;
1486 if (src_reg->type == PTR_TO_PACKET) {
1487 /* R6=pkt(id=0,off=0,r=62) R7=imm22; r7 += r6 */
1488 tmp_reg = *dst_reg; /* save r7 state */
1489 *dst_reg = *src_reg; /* copy pkt_ptr state r6 into r7 */
1490 src_reg = &tmp_reg; /* pretend it's src_reg state */
1491 /* if the checks below reject it, the copy won't matter,
1492 * since we're rejecting the whole program. If all ok,
1493 * then imm22 state will be added to r7
1494 * and r7 will be pkt(id=0,off=22,r=62) while
1495 * r6 will stay as pkt(id=0,off=0,r=62)
1499 if (src_reg->type == CONST_IMM) {
1500 /* pkt_ptr += reg where reg is known constant */
1504 /* disallow pkt_ptr += reg
1505 * if reg is not uknown_value with guaranteed zero upper bits
1506 * otherwise pkt_ptr may overflow and addition will become
1507 * subtraction which is not allowed
1509 if (src_reg->type != UNKNOWN_VALUE) {
1510 verbose("cannot add '%s' to ptr_to_packet\n",
1511 reg_type_str[src_reg->type]);
1514 if (src_reg->imm < 48) {
1515 verbose("cannot add integer value with %lld upper zero bits to ptr_to_packet\n",
1520 had_id = (dst_reg->id != 0);
1522 /* dst_reg stays as pkt_ptr type and since some positive
1523 * integer value was added to the pointer, increment its 'id'
1525 dst_reg->id = ++env->id_gen;
1527 /* something was added to pkt_ptr, set range to zero */
1528 dst_reg->aux_off = dst_reg->off;
1532 dst_reg->aux_off_align = min(dst_reg->aux_off_align,
1533 src_reg->min_align);
1535 dst_reg->aux_off_align = src_reg->min_align;
1540 static int evaluate_reg_alu(struct bpf_verifier_env *env, struct bpf_insn *insn)
1542 struct bpf_reg_state *regs = env->cur_state.regs;
1543 struct bpf_reg_state *dst_reg = ®s[insn->dst_reg];
1544 u8 opcode = BPF_OP(insn->code);
1547 /* for type == UNKNOWN_VALUE:
1548 * imm > 0 -> number of zero upper bits
1549 * imm == 0 -> don't track which is the same as all bits can be non-zero
1552 if (BPF_SRC(insn->code) == BPF_X) {
1553 struct bpf_reg_state *src_reg = ®s[insn->src_reg];
1555 if (src_reg->type == UNKNOWN_VALUE && src_reg->imm > 0 &&
1556 dst_reg->imm && opcode == BPF_ADD) {
1558 * where both have zero upper bits. Adding them
1559 * can only result making one more bit non-zero
1560 * in the larger value.
1561 * Ex. 0xffff (imm=48) + 1 (imm=63) = 0x10000 (imm=47)
1562 * 0xffff (imm=48) + 0xffff = 0x1fffe (imm=47)
1564 dst_reg->imm = min(dst_reg->imm, src_reg->imm);
1568 if (src_reg->type == CONST_IMM && src_reg->imm > 0 &&
1569 dst_reg->imm && opcode == BPF_ADD) {
1571 * where dreg has zero upper bits and sreg is const.
1572 * Adding them can only result making one more bit
1573 * non-zero in the larger value.
1575 imm_log2 = __ilog2_u64((long long)src_reg->imm);
1576 dst_reg->imm = min(dst_reg->imm, 63 - imm_log2);
1580 /* all other cases non supported yet, just mark dst_reg */
1585 /* sign extend 32-bit imm into 64-bit to make sure that
1586 * negative values occupy bit 63. Note ilog2() would have
1587 * been incorrect, since sizeof(insn->imm) == 4
1589 imm_log2 = __ilog2_u64((long long)insn->imm);
1591 if (dst_reg->imm && opcode == BPF_LSH) {
1593 * if reg was a result of 2 byte load, then its imm == 48
1594 * which means that upper 48 bits are zero and shifting this reg
1595 * left by 4 would mean that upper 44 bits are still zero
1597 dst_reg->imm -= insn->imm;
1598 } else if (dst_reg->imm && opcode == BPF_MUL) {
1600 * if multiplying by 14 subtract 4
1601 * This is conservative calculation of upper zero bits.
1602 * It's not trying to special case insn->imm == 1 or 0 cases
1604 dst_reg->imm -= imm_log2 + 1;
1605 } else if (opcode == BPF_AND) {
1607 dst_reg->imm = 63 - imm_log2;
1608 } else if (dst_reg->imm && opcode == BPF_ADD) {
1610 dst_reg->imm = min(dst_reg->imm, 63 - imm_log2);
1612 } else if (opcode == BPF_RSH) {
1614 * which means that after right shift, upper bits will be zero
1615 * note that verifier already checked that
1616 * 0 <= imm < 64 for shift insn
1618 dst_reg->imm += insn->imm;
1619 if (unlikely(dst_reg->imm > 64))
1620 /* some dumb code did:
1623 * and all bits are zero now */
1626 /* all other alu ops, means that we don't know what will
1627 * happen to the value, mark it with unknown number of zero bits
1632 if (dst_reg->imm < 0) {
1633 /* all 64 bits of the register can contain non-zero bits
1634 * and such value cannot be added to ptr_to_packet, since it
1635 * may overflow, mark it as unknown to avoid further eval
1642 static int evaluate_reg_imm_alu(struct bpf_verifier_env *env,
1643 struct bpf_insn *insn)
1645 struct bpf_reg_state *regs = env->cur_state.regs;
1646 struct bpf_reg_state *dst_reg = ®s[insn->dst_reg];
1647 struct bpf_reg_state *src_reg = ®s[insn->src_reg];
1648 u8 opcode = BPF_OP(insn->code);
1649 u64 dst_imm = dst_reg->imm;
1651 /* dst_reg->type == CONST_IMM here. Simulate execution of insns
1652 * containing ALU ops. Don't care about overflow or negative
1653 * values, just add/sub/... them; registers are in u64.
1655 if (opcode == BPF_ADD && BPF_SRC(insn->code) == BPF_K) {
1656 dst_imm += insn->imm;
1657 } else if (opcode == BPF_ADD && BPF_SRC(insn->code) == BPF_X &&
1658 src_reg->type == CONST_IMM) {
1659 dst_imm += src_reg->imm;
1660 } else if (opcode == BPF_SUB && BPF_SRC(insn->code) == BPF_K) {
1661 dst_imm -= insn->imm;
1662 } else if (opcode == BPF_SUB && BPF_SRC(insn->code) == BPF_X &&
1663 src_reg->type == CONST_IMM) {
1664 dst_imm -= src_reg->imm;
1665 } else if (opcode == BPF_MUL && BPF_SRC(insn->code) == BPF_K) {
1666 dst_imm *= insn->imm;
1667 } else if (opcode == BPF_MUL && BPF_SRC(insn->code) == BPF_X &&
1668 src_reg->type == CONST_IMM) {
1669 dst_imm *= src_reg->imm;
1670 } else if (opcode == BPF_OR && BPF_SRC(insn->code) == BPF_K) {
1671 dst_imm |= insn->imm;
1672 } else if (opcode == BPF_OR && BPF_SRC(insn->code) == BPF_X &&
1673 src_reg->type == CONST_IMM) {
1674 dst_imm |= src_reg->imm;
1675 } else if (opcode == BPF_AND && BPF_SRC(insn->code) == BPF_K) {
1676 dst_imm &= insn->imm;
1677 } else if (opcode == BPF_AND && BPF_SRC(insn->code) == BPF_X &&
1678 src_reg->type == CONST_IMM) {
1679 dst_imm &= src_reg->imm;
1680 } else if (opcode == BPF_RSH && BPF_SRC(insn->code) == BPF_K) {
1681 dst_imm >>= insn->imm;
1682 } else if (opcode == BPF_RSH && BPF_SRC(insn->code) == BPF_X &&
1683 src_reg->type == CONST_IMM) {
1684 dst_imm >>= src_reg->imm;
1685 } else if (opcode == BPF_LSH && BPF_SRC(insn->code) == BPF_K) {
1686 dst_imm <<= insn->imm;
1687 } else if (opcode == BPF_LSH && BPF_SRC(insn->code) == BPF_X &&
1688 src_reg->type == CONST_IMM) {
1689 dst_imm <<= src_reg->imm;
1691 mark_reg_unknown_value(regs, insn->dst_reg);
1695 dst_reg->imm = dst_imm;
1700 static void check_reg_overflow(struct bpf_reg_state *reg)
1702 if (reg->max_value > BPF_REGISTER_MAX_RANGE)
1703 reg->max_value = BPF_REGISTER_MAX_RANGE;
1704 if (reg->min_value < BPF_REGISTER_MIN_RANGE ||
1705 reg->min_value > BPF_REGISTER_MAX_RANGE)
1706 reg->min_value = BPF_REGISTER_MIN_RANGE;
1709 static u32 calc_align(u32 imm)
1713 return imm - ((imm - 1) & imm);
1716 static void adjust_reg_min_max_vals(struct bpf_verifier_env *env,
1717 struct bpf_insn *insn)
1719 struct bpf_reg_state *regs = env->cur_state.regs, *dst_reg;
1720 s64 min_val = BPF_REGISTER_MIN_RANGE;
1721 u64 max_val = BPF_REGISTER_MAX_RANGE;
1722 u8 opcode = BPF_OP(insn->code);
1723 u32 dst_align, src_align;
1725 dst_reg = ®s[insn->dst_reg];
1727 if (BPF_SRC(insn->code) == BPF_X) {
1728 check_reg_overflow(®s[insn->src_reg]);
1729 min_val = regs[insn->src_reg].min_value;
1730 max_val = regs[insn->src_reg].max_value;
1732 /* If the source register is a random pointer then the
1733 * min_value/max_value values represent the range of the known
1734 * accesses into that value, not the actual min/max value of the
1735 * register itself. In this case we have to reset the reg range
1736 * values so we know it is not safe to look at.
1738 if (regs[insn->src_reg].type != CONST_IMM &&
1739 regs[insn->src_reg].type != UNKNOWN_VALUE) {
1740 min_val = BPF_REGISTER_MIN_RANGE;
1741 max_val = BPF_REGISTER_MAX_RANGE;
1744 src_align = regs[insn->src_reg].min_align;
1746 } else if (insn->imm < BPF_REGISTER_MAX_RANGE &&
1747 (s64)insn->imm > BPF_REGISTER_MIN_RANGE) {
1748 min_val = max_val = insn->imm;
1749 src_align = calc_align(insn->imm);
1752 dst_align = dst_reg->min_align;
1754 /* We don't know anything about what was done to this register, mark it
1757 if (min_val == BPF_REGISTER_MIN_RANGE &&
1758 max_val == BPF_REGISTER_MAX_RANGE) {
1759 reset_reg_range_values(regs, insn->dst_reg);
1763 /* If one of our values was at the end of our ranges then we can't just
1764 * do our normal operations to the register, we need to set the values
1765 * to the min/max since they are undefined.
1767 if (min_val == BPF_REGISTER_MIN_RANGE)
1768 dst_reg->min_value = BPF_REGISTER_MIN_RANGE;
1769 if (max_val == BPF_REGISTER_MAX_RANGE)
1770 dst_reg->max_value = BPF_REGISTER_MAX_RANGE;
1774 if (dst_reg->min_value != BPF_REGISTER_MIN_RANGE)
1775 dst_reg->min_value += min_val;
1776 if (dst_reg->max_value != BPF_REGISTER_MAX_RANGE)
1777 dst_reg->max_value += max_val;
1778 dst_reg->min_align = min(src_align, dst_align);
1781 if (dst_reg->min_value != BPF_REGISTER_MIN_RANGE)
1782 dst_reg->min_value -= min_val;
1783 if (dst_reg->max_value != BPF_REGISTER_MAX_RANGE)
1784 dst_reg->max_value -= max_val;
1785 dst_reg->min_align = min(src_align, dst_align);
1788 if (dst_reg->min_value != BPF_REGISTER_MIN_RANGE)
1789 dst_reg->min_value *= min_val;
1790 if (dst_reg->max_value != BPF_REGISTER_MAX_RANGE)
1791 dst_reg->max_value *= max_val;
1792 dst_reg->min_align = max(src_align, dst_align);
1795 /* Disallow AND'ing of negative numbers, ain't nobody got time
1796 * for that. Otherwise the minimum is 0 and the max is the max
1797 * value we could AND against.
1800 dst_reg->min_value = BPF_REGISTER_MIN_RANGE;
1802 dst_reg->min_value = 0;
1803 dst_reg->max_value = max_val;
1804 dst_reg->min_align = max(src_align, dst_align);
1807 /* Gotta have special overflow logic here, if we're shifting
1808 * more than MAX_RANGE then just assume we have an invalid
1811 if (min_val > ilog2(BPF_REGISTER_MAX_RANGE)) {
1812 dst_reg->min_value = BPF_REGISTER_MIN_RANGE;
1813 dst_reg->min_align = 1;
1815 if (dst_reg->min_value != BPF_REGISTER_MIN_RANGE)
1816 dst_reg->min_value <<= min_val;
1817 if (!dst_reg->min_align)
1818 dst_reg->min_align = 1;
1819 dst_reg->min_align <<= min_val;
1821 if (max_val > ilog2(BPF_REGISTER_MAX_RANGE))
1822 dst_reg->max_value = BPF_REGISTER_MAX_RANGE;
1823 else if (dst_reg->max_value != BPF_REGISTER_MAX_RANGE)
1824 dst_reg->max_value <<= max_val;
1827 /* RSH by a negative number is undefined, and the BPF_RSH is an
1828 * unsigned shift, so make the appropriate casts.
1830 if (min_val < 0 || dst_reg->min_value < 0) {
1831 dst_reg->min_value = BPF_REGISTER_MIN_RANGE;
1833 dst_reg->min_value =
1834 (u64)(dst_reg->min_value) >> min_val;
1837 dst_reg->min_align = 1;
1839 dst_reg->min_align >>= (u64) min_val;
1840 if (!dst_reg->min_align)
1841 dst_reg->min_align = 1;
1843 if (dst_reg->max_value != BPF_REGISTER_MAX_RANGE)
1844 dst_reg->max_value >>= max_val;
1847 reset_reg_range_values(regs, insn->dst_reg);
1851 check_reg_overflow(dst_reg);
1854 /* check validity of 32-bit and 64-bit arithmetic operations */
1855 static int check_alu_op(struct bpf_verifier_env *env, struct bpf_insn *insn)
1857 struct bpf_reg_state *regs = env->cur_state.regs, *dst_reg;
1858 u8 opcode = BPF_OP(insn->code);
1861 if (opcode == BPF_END || opcode == BPF_NEG) {
1862 if (opcode == BPF_NEG) {
1863 if (BPF_SRC(insn->code) != 0 ||
1864 insn->src_reg != BPF_REG_0 ||
1865 insn->off != 0 || insn->imm != 0) {
1866 verbose("BPF_NEG uses reserved fields\n");
1870 if (insn->src_reg != BPF_REG_0 || insn->off != 0 ||
1871 (insn->imm != 16 && insn->imm != 32 && insn->imm != 64)) {
1872 verbose("BPF_END uses reserved fields\n");
1877 /* check src operand */
1878 err = check_reg_arg(regs, insn->dst_reg, SRC_OP);
1882 if (is_pointer_value(env, insn->dst_reg)) {
1883 verbose("R%d pointer arithmetic prohibited\n",
1888 /* check dest operand */
1889 err = check_reg_arg(regs, insn->dst_reg, DST_OP);
1893 } else if (opcode == BPF_MOV) {
1895 if (BPF_SRC(insn->code) == BPF_X) {
1896 if (insn->imm != 0 || insn->off != 0) {
1897 verbose("BPF_MOV uses reserved fields\n");
1901 /* check src operand */
1902 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
1906 if (insn->src_reg != BPF_REG_0 || insn->off != 0) {
1907 verbose("BPF_MOV uses reserved fields\n");
1912 /* check dest operand */
1913 err = check_reg_arg(regs, insn->dst_reg, DST_OP);
1917 /* we are setting our register to something new, we need to
1918 * reset its range values.
1920 reset_reg_range_values(regs, insn->dst_reg);
1922 if (BPF_SRC(insn->code) == BPF_X) {
1923 if (BPF_CLASS(insn->code) == BPF_ALU64) {
1925 * copy register state to dest reg
1927 regs[insn->dst_reg] = regs[insn->src_reg];
1929 if (is_pointer_value(env, insn->src_reg)) {
1930 verbose("R%d partial copy of pointer\n",
1934 mark_reg_unknown_value(regs, insn->dst_reg);
1938 * remember the value we stored into this reg
1940 regs[insn->dst_reg].type = CONST_IMM;
1941 regs[insn->dst_reg].imm = insn->imm;
1942 regs[insn->dst_reg].max_value = insn->imm;
1943 regs[insn->dst_reg].min_value = insn->imm;
1944 regs[insn->dst_reg].min_align = calc_align(insn->imm);
1947 } else if (opcode > BPF_END) {
1948 verbose("invalid BPF_ALU opcode %x\n", opcode);
1951 } else { /* all other ALU ops: and, sub, xor, add, ... */
1953 if (BPF_SRC(insn->code) == BPF_X) {
1954 if (insn->imm != 0 || insn->off != 0) {
1955 verbose("BPF_ALU uses reserved fields\n");
1958 /* check src1 operand */
1959 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
1963 if (insn->src_reg != BPF_REG_0 || insn->off != 0) {
1964 verbose("BPF_ALU uses reserved fields\n");
1969 /* check src2 operand */
1970 err = check_reg_arg(regs, insn->dst_reg, SRC_OP);
1974 if ((opcode == BPF_MOD || opcode == BPF_DIV) &&
1975 BPF_SRC(insn->code) == BPF_K && insn->imm == 0) {
1976 verbose("div by zero\n");
1980 if ((opcode == BPF_LSH || opcode == BPF_RSH ||
1981 opcode == BPF_ARSH) && BPF_SRC(insn->code) == BPF_K) {
1982 int size = BPF_CLASS(insn->code) == BPF_ALU64 ? 64 : 32;
1984 if (insn->imm < 0 || insn->imm >= size) {
1985 verbose("invalid shift %d\n", insn->imm);
1990 /* check dest operand */
1991 err = check_reg_arg(regs, insn->dst_reg, DST_OP_NO_MARK);
1995 dst_reg = ®s[insn->dst_reg];
1997 /* first we want to adjust our ranges. */
1998 adjust_reg_min_max_vals(env, insn);
2000 /* pattern match 'bpf_add Rx, imm' instruction */
2001 if (opcode == BPF_ADD && BPF_CLASS(insn->code) == BPF_ALU64 &&
2002 dst_reg->type == FRAME_PTR && BPF_SRC(insn->code) == BPF_K) {
2003 dst_reg->type = PTR_TO_STACK;
2004 dst_reg->imm = insn->imm;
2006 } else if (opcode == BPF_ADD &&
2007 BPF_CLASS(insn->code) == BPF_ALU64 &&
2008 dst_reg->type == PTR_TO_STACK &&
2009 ((BPF_SRC(insn->code) == BPF_X &&
2010 regs[insn->src_reg].type == CONST_IMM) ||
2011 BPF_SRC(insn->code) == BPF_K)) {
2012 if (BPF_SRC(insn->code) == BPF_X)
2013 dst_reg->imm += regs[insn->src_reg].imm;
2015 dst_reg->imm += insn->imm;
2017 } else if (opcode == BPF_ADD &&
2018 BPF_CLASS(insn->code) == BPF_ALU64 &&
2019 (dst_reg->type == PTR_TO_PACKET ||
2020 (BPF_SRC(insn->code) == BPF_X &&
2021 regs[insn->src_reg].type == PTR_TO_PACKET))) {
2022 /* ptr_to_packet += K|X */
2023 return check_packet_ptr_add(env, insn);
2024 } else if (BPF_CLASS(insn->code) == BPF_ALU64 &&
2025 dst_reg->type == UNKNOWN_VALUE &&
2026 env->allow_ptr_leaks) {
2027 /* unknown += K|X */
2028 return evaluate_reg_alu(env, insn);
2029 } else if (BPF_CLASS(insn->code) == BPF_ALU64 &&
2030 dst_reg->type == CONST_IMM &&
2031 env->allow_ptr_leaks) {
2032 /* reg_imm += K|X */
2033 return evaluate_reg_imm_alu(env, insn);
2034 } else if (is_pointer_value(env, insn->dst_reg)) {
2035 verbose("R%d pointer arithmetic prohibited\n",
2038 } else if (BPF_SRC(insn->code) == BPF_X &&
2039 is_pointer_value(env, insn->src_reg)) {
2040 verbose("R%d pointer arithmetic prohibited\n",
2045 /* If we did pointer math on a map value then just set it to our
2046 * PTR_TO_MAP_VALUE_ADJ type so we can deal with any stores or
2047 * loads to this register appropriately, otherwise just mark the
2048 * register as unknown.
2050 if (env->allow_ptr_leaks &&
2051 BPF_CLASS(insn->code) == BPF_ALU64 && opcode == BPF_ADD &&
2052 (dst_reg->type == PTR_TO_MAP_VALUE ||
2053 dst_reg->type == PTR_TO_MAP_VALUE_ADJ))
2054 dst_reg->type = PTR_TO_MAP_VALUE_ADJ;
2056 mark_reg_unknown_value(regs, insn->dst_reg);
2062 static void find_good_pkt_pointers(struct bpf_verifier_state *state,
2063 struct bpf_reg_state *dst_reg)
2065 struct bpf_reg_state *regs = state->regs, *reg;
2068 /* LLVM can generate two kind of checks:
2074 * if (r2 > pkt_end) goto <handle exception>
2078 * r2 == dst_reg, pkt_end == src_reg
2079 * r2=pkt(id=n,off=8,r=0)
2080 * r3=pkt(id=n,off=0,r=0)
2086 * if (pkt_end >= r2) goto <access okay>
2087 * <handle exception>
2090 * pkt_end == dst_reg, r2 == src_reg
2091 * r2=pkt(id=n,off=8,r=0)
2092 * r3=pkt(id=n,off=0,r=0)
2094 * Find register r3 and mark its range as r3=pkt(id=n,off=0,r=8)
2095 * so that range of bytes [r3, r3 + 8) is safe to access.
2098 for (i = 0; i < MAX_BPF_REG; i++)
2099 if (regs[i].type == PTR_TO_PACKET && regs[i].id == dst_reg->id)
2100 /* keep the maximum range already checked */
2101 regs[i].range = max(regs[i].range, dst_reg->off);
2103 for (i = 0; i < MAX_BPF_STACK; i += BPF_REG_SIZE) {
2104 if (state->stack_slot_type[i] != STACK_SPILL)
2106 reg = &state->spilled_regs[i / BPF_REG_SIZE];
2107 if (reg->type == PTR_TO_PACKET && reg->id == dst_reg->id)
2108 reg->range = max(reg->range, dst_reg->off);
2112 /* Adjusts the register min/max values in the case that the dst_reg is the
2113 * variable register that we are working on, and src_reg is a constant or we're
2114 * simply doing a BPF_K check.
2116 static void reg_set_min_max(struct bpf_reg_state *true_reg,
2117 struct bpf_reg_state *false_reg, u64 val,
2122 /* If this is false then we know nothing Jon Snow, but if it is
2123 * true then we know for sure.
2125 true_reg->max_value = true_reg->min_value = val;
2128 /* If this is true we know nothing Jon Snow, but if it is false
2129 * we know the value for sure;
2131 false_reg->max_value = false_reg->min_value = val;
2134 /* Unsigned comparison, the minimum value is 0. */
2135 false_reg->min_value = 0;
2138 /* If this is false then we know the maximum val is val,
2139 * otherwise we know the min val is val+1.
2141 false_reg->max_value = val;
2142 true_reg->min_value = val + 1;
2145 /* Unsigned comparison, the minimum value is 0. */
2146 false_reg->min_value = 0;
2149 /* If this is false then we know the maximum value is val - 1,
2150 * otherwise we know the mimimum value is val.
2152 false_reg->max_value = val - 1;
2153 true_reg->min_value = val;
2159 check_reg_overflow(false_reg);
2160 check_reg_overflow(true_reg);
2163 /* Same as above, but for the case that dst_reg is a CONST_IMM reg and src_reg
2164 * is the variable reg.
2166 static void reg_set_min_max_inv(struct bpf_reg_state *true_reg,
2167 struct bpf_reg_state *false_reg, u64 val,
2172 /* If this is false then we know nothing Jon Snow, but if it is
2173 * true then we know for sure.
2175 true_reg->max_value = true_reg->min_value = val;
2178 /* If this is true we know nothing Jon Snow, but if it is false
2179 * we know the value for sure;
2181 false_reg->max_value = false_reg->min_value = val;
2184 /* Unsigned comparison, the minimum value is 0. */
2185 true_reg->min_value = 0;
2189 * If this is false, then the val is <= the register, if it is
2190 * true the register <= to the val.
2192 false_reg->min_value = val;
2193 true_reg->max_value = val - 1;
2196 /* Unsigned comparison, the minimum value is 0. */
2197 true_reg->min_value = 0;
2200 /* If this is false then constant < register, if it is true then
2201 * the register < constant.
2203 false_reg->min_value = val + 1;
2204 true_reg->max_value = val;
2210 check_reg_overflow(false_reg);
2211 check_reg_overflow(true_reg);
2214 static void mark_map_reg(struct bpf_reg_state *regs, u32 regno, u32 id,
2215 enum bpf_reg_type type)
2217 struct bpf_reg_state *reg = ®s[regno];
2219 if (reg->type == PTR_TO_MAP_VALUE_OR_NULL && reg->id == id) {
2220 if (type == UNKNOWN_VALUE) {
2221 __mark_reg_unknown_value(regs, regno);
2222 } else if (reg->map_ptr->inner_map_meta) {
2223 reg->type = CONST_PTR_TO_MAP;
2224 reg->map_ptr = reg->map_ptr->inner_map_meta;
2228 /* We don't need id from this point onwards anymore, thus we
2229 * should better reset it, so that state pruning has chances
2236 /* The logic is similar to find_good_pkt_pointers(), both could eventually
2237 * be folded together at some point.
2239 static void mark_map_regs(struct bpf_verifier_state *state, u32 regno,
2240 enum bpf_reg_type type)
2242 struct bpf_reg_state *regs = state->regs;
2243 u32 id = regs[regno].id;
2246 for (i = 0; i < MAX_BPF_REG; i++)
2247 mark_map_reg(regs, i, id, type);
2249 for (i = 0; i < MAX_BPF_STACK; i += BPF_REG_SIZE) {
2250 if (state->stack_slot_type[i] != STACK_SPILL)
2252 mark_map_reg(state->spilled_regs, i / BPF_REG_SIZE, id, type);
2256 static int check_cond_jmp_op(struct bpf_verifier_env *env,
2257 struct bpf_insn *insn, int *insn_idx)
2259 struct bpf_verifier_state *other_branch, *this_branch = &env->cur_state;
2260 struct bpf_reg_state *regs = this_branch->regs, *dst_reg;
2261 u8 opcode = BPF_OP(insn->code);
2264 if (opcode > BPF_EXIT) {
2265 verbose("invalid BPF_JMP opcode %x\n", opcode);
2269 if (BPF_SRC(insn->code) == BPF_X) {
2270 if (insn->imm != 0) {
2271 verbose("BPF_JMP uses reserved fields\n");
2275 /* check src1 operand */
2276 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
2280 if (is_pointer_value(env, insn->src_reg)) {
2281 verbose("R%d pointer comparison prohibited\n",
2286 if (insn->src_reg != BPF_REG_0) {
2287 verbose("BPF_JMP uses reserved fields\n");
2292 /* check src2 operand */
2293 err = check_reg_arg(regs, insn->dst_reg, SRC_OP);
2297 dst_reg = ®s[insn->dst_reg];
2299 /* detect if R == 0 where R was initialized to zero earlier */
2300 if (BPF_SRC(insn->code) == BPF_K &&
2301 (opcode == BPF_JEQ || opcode == BPF_JNE) &&
2302 dst_reg->type == CONST_IMM && dst_reg->imm == insn->imm) {
2303 if (opcode == BPF_JEQ) {
2304 /* if (imm == imm) goto pc+off;
2305 * only follow the goto, ignore fall-through
2307 *insn_idx += insn->off;
2310 /* if (imm != imm) goto pc+off;
2311 * only follow fall-through branch, since
2312 * that's where the program will go
2318 other_branch = push_stack(env, *insn_idx + insn->off + 1, *insn_idx);
2322 /* detect if we are comparing against a constant value so we can adjust
2323 * our min/max values for our dst register.
2325 if (BPF_SRC(insn->code) == BPF_X) {
2326 if (regs[insn->src_reg].type == CONST_IMM)
2327 reg_set_min_max(&other_branch->regs[insn->dst_reg],
2328 dst_reg, regs[insn->src_reg].imm,
2330 else if (dst_reg->type == CONST_IMM)
2331 reg_set_min_max_inv(&other_branch->regs[insn->src_reg],
2332 ®s[insn->src_reg], dst_reg->imm,
2335 reg_set_min_max(&other_branch->regs[insn->dst_reg],
2336 dst_reg, insn->imm, opcode);
2339 /* detect if R == 0 where R is returned from bpf_map_lookup_elem() */
2340 if (BPF_SRC(insn->code) == BPF_K &&
2341 insn->imm == 0 && (opcode == BPF_JEQ || opcode == BPF_JNE) &&
2342 dst_reg->type == PTR_TO_MAP_VALUE_OR_NULL) {
2343 /* Mark all identical map registers in each branch as either
2344 * safe or unknown depending R == 0 or R != 0 conditional.
2346 mark_map_regs(this_branch, insn->dst_reg,
2347 opcode == BPF_JEQ ? PTR_TO_MAP_VALUE : UNKNOWN_VALUE);
2348 mark_map_regs(other_branch, insn->dst_reg,
2349 opcode == BPF_JEQ ? UNKNOWN_VALUE : PTR_TO_MAP_VALUE);
2350 } else if (BPF_SRC(insn->code) == BPF_X && opcode == BPF_JGT &&
2351 dst_reg->type == PTR_TO_PACKET &&
2352 regs[insn->src_reg].type == PTR_TO_PACKET_END) {
2353 find_good_pkt_pointers(this_branch, dst_reg);
2354 } else if (BPF_SRC(insn->code) == BPF_X && opcode == BPF_JGE &&
2355 dst_reg->type == PTR_TO_PACKET_END &&
2356 regs[insn->src_reg].type == PTR_TO_PACKET) {
2357 find_good_pkt_pointers(other_branch, ®s[insn->src_reg]);
2358 } else if (is_pointer_value(env, insn->dst_reg)) {
2359 verbose("R%d pointer comparison prohibited\n", insn->dst_reg);
2363 print_verifier_state(this_branch);
2367 /* return the map pointer stored inside BPF_LD_IMM64 instruction */
2368 static struct bpf_map *ld_imm64_to_map_ptr(struct bpf_insn *insn)
2370 u64 imm64 = ((u64) (u32) insn[0].imm) | ((u64) (u32) insn[1].imm) << 32;
2372 return (struct bpf_map *) (unsigned long) imm64;
2375 /* verify BPF_LD_IMM64 instruction */
2376 static int check_ld_imm(struct bpf_verifier_env *env, struct bpf_insn *insn)
2378 struct bpf_reg_state *regs = env->cur_state.regs;
2381 if (BPF_SIZE(insn->code) != BPF_DW) {
2382 verbose("invalid BPF_LD_IMM insn\n");
2385 if (insn->off != 0) {
2386 verbose("BPF_LD_IMM64 uses reserved fields\n");
2390 err = check_reg_arg(regs, insn->dst_reg, DST_OP);
2394 if (insn->src_reg == 0) {
2395 u64 imm = ((u64)(insn + 1)->imm << 32) | (u32)insn->imm;
2397 regs[insn->dst_reg].type = CONST_IMM;
2398 regs[insn->dst_reg].imm = imm;
2402 /* replace_map_fd_with_map_ptr() should have caught bad ld_imm64 */
2403 BUG_ON(insn->src_reg != BPF_PSEUDO_MAP_FD);
2405 regs[insn->dst_reg].type = CONST_PTR_TO_MAP;
2406 regs[insn->dst_reg].map_ptr = ld_imm64_to_map_ptr(insn);
2410 static bool may_access_skb(enum bpf_prog_type type)
2413 case BPF_PROG_TYPE_SOCKET_FILTER:
2414 case BPF_PROG_TYPE_SCHED_CLS:
2415 case BPF_PROG_TYPE_SCHED_ACT:
2422 /* verify safety of LD_ABS|LD_IND instructions:
2423 * - they can only appear in the programs where ctx == skb
2424 * - since they are wrappers of function calls, they scratch R1-R5 registers,
2425 * preserve R6-R9, and store return value into R0
2428 * ctx == skb == R6 == CTX
2431 * SRC == any register
2432 * IMM == 32-bit immediate
2435 * R0 - 8/16/32-bit skb data converted to cpu endianness
2437 static int check_ld_abs(struct bpf_verifier_env *env, struct bpf_insn *insn)
2439 struct bpf_reg_state *regs = env->cur_state.regs;
2440 u8 mode = BPF_MODE(insn->code);
2441 struct bpf_reg_state *reg;
2444 if (!may_access_skb(env->prog->type)) {
2445 verbose("BPF_LD_[ABS|IND] instructions not allowed for this program type\n");
2449 if (insn->dst_reg != BPF_REG_0 || insn->off != 0 ||
2450 BPF_SIZE(insn->code) == BPF_DW ||
2451 (mode == BPF_ABS && insn->src_reg != BPF_REG_0)) {
2452 verbose("BPF_LD_[ABS|IND] uses reserved fields\n");
2456 /* check whether implicit source operand (register R6) is readable */
2457 err = check_reg_arg(regs, BPF_REG_6, SRC_OP);
2461 if (regs[BPF_REG_6].type != PTR_TO_CTX) {
2462 verbose("at the time of BPF_LD_ABS|IND R6 != pointer to skb\n");
2466 if (mode == BPF_IND) {
2467 /* check explicit source operand */
2468 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
2473 /* reset caller saved regs to unreadable */
2474 for (i = 0; i < CALLER_SAVED_REGS; i++) {
2475 reg = regs + caller_saved[i];
2476 reg->type = NOT_INIT;
2480 /* mark destination R0 register as readable, since it contains
2481 * the value fetched from the packet
2483 regs[BPF_REG_0].type = UNKNOWN_VALUE;
2487 /* non-recursive DFS pseudo code
2488 * 1 procedure DFS-iterative(G,v):
2489 * 2 label v as discovered
2490 * 3 let S be a stack
2492 * 5 while S is not empty
2494 * 7 if t is what we're looking for:
2496 * 9 for all edges e in G.adjacentEdges(t) do
2497 * 10 if edge e is already labelled
2498 * 11 continue with the next edge
2499 * 12 w <- G.adjacentVertex(t,e)
2500 * 13 if vertex w is not discovered and not explored
2501 * 14 label e as tree-edge
2502 * 15 label w as discovered
2505 * 18 else if vertex w is discovered
2506 * 19 label e as back-edge
2508 * 21 // vertex w is explored
2509 * 22 label e as forward- or cross-edge
2510 * 23 label t as explored
2515 * 0x11 - discovered and fall-through edge labelled
2516 * 0x12 - discovered and fall-through and branch edges labelled
2527 #define STATE_LIST_MARK ((struct bpf_verifier_state_list *) -1L)
2529 static int *insn_stack; /* stack of insns to process */
2530 static int cur_stack; /* current stack index */
2531 static int *insn_state;
2533 /* t, w, e - match pseudo-code above:
2534 * t - index of current instruction
2535 * w - next instruction
2538 static int push_insn(int t, int w, int e, struct bpf_verifier_env *env)
2540 if (e == FALLTHROUGH && insn_state[t] >= (DISCOVERED | FALLTHROUGH))
2543 if (e == BRANCH && insn_state[t] >= (DISCOVERED | BRANCH))
2546 if (w < 0 || w >= env->prog->len) {
2547 verbose("jump out of range from insn %d to %d\n", t, w);
2552 /* mark branch target for state pruning */
2553 env->explored_states[w] = STATE_LIST_MARK;
2555 if (insn_state[w] == 0) {
2557 insn_state[t] = DISCOVERED | e;
2558 insn_state[w] = DISCOVERED;
2559 if (cur_stack >= env->prog->len)
2561 insn_stack[cur_stack++] = w;
2563 } else if ((insn_state[w] & 0xF0) == DISCOVERED) {
2564 verbose("back-edge from insn %d to %d\n", t, w);
2566 } else if (insn_state[w] == EXPLORED) {
2567 /* forward- or cross-edge */
2568 insn_state[t] = DISCOVERED | e;
2570 verbose("insn state internal bug\n");
2576 /* non-recursive depth-first-search to detect loops in BPF program
2577 * loop == back-edge in directed graph
2579 static int check_cfg(struct bpf_verifier_env *env)
2581 struct bpf_insn *insns = env->prog->insnsi;
2582 int insn_cnt = env->prog->len;
2586 insn_state = kcalloc(insn_cnt, sizeof(int), GFP_KERNEL);
2590 insn_stack = kcalloc(insn_cnt, sizeof(int), GFP_KERNEL);
2596 insn_state[0] = DISCOVERED; /* mark 1st insn as discovered */
2597 insn_stack[0] = 0; /* 0 is the first instruction */
2603 t = insn_stack[cur_stack - 1];
2605 if (BPF_CLASS(insns[t].code) == BPF_JMP) {
2606 u8 opcode = BPF_OP(insns[t].code);
2608 if (opcode == BPF_EXIT) {
2610 } else if (opcode == BPF_CALL) {
2611 ret = push_insn(t, t + 1, FALLTHROUGH, env);
2616 if (t + 1 < insn_cnt)
2617 env->explored_states[t + 1] = STATE_LIST_MARK;
2618 } else if (opcode == BPF_JA) {
2619 if (BPF_SRC(insns[t].code) != BPF_K) {
2623 /* unconditional jump with single edge */
2624 ret = push_insn(t, t + insns[t].off + 1,
2630 /* tell verifier to check for equivalent states
2631 * after every call and jump
2633 if (t + 1 < insn_cnt)
2634 env->explored_states[t + 1] = STATE_LIST_MARK;
2636 /* conditional jump with two edges */
2637 ret = push_insn(t, t + 1, FALLTHROUGH, env);
2643 ret = push_insn(t, t + insns[t].off + 1, BRANCH, env);
2650 /* all other non-branch instructions with single
2653 ret = push_insn(t, t + 1, FALLTHROUGH, env);
2661 insn_state[t] = EXPLORED;
2662 if (cur_stack-- <= 0) {
2663 verbose("pop stack internal bug\n");
2670 for (i = 0; i < insn_cnt; i++) {
2671 if (insn_state[i] != EXPLORED) {
2672 verbose("unreachable insn %d\n", i);
2677 ret = 0; /* cfg looks good */
2685 /* the following conditions reduce the number of explored insns
2686 * from ~140k to ~80k for ultra large programs that use a lot of ptr_to_packet
2688 static bool compare_ptrs_to_packet(struct bpf_reg_state *old,
2689 struct bpf_reg_state *cur)
2691 if (old->id != cur->id)
2694 /* old ptr_to_packet is more conservative, since it allows smaller
2696 * old(off=0,r=10) is equal to cur(off=0,r=20), because
2697 * old(off=0,r=10) means that with range=10 the verifier proceeded
2698 * further and found no issues with the program. Now we're in the same
2699 * spot with cur(off=0,r=20), so we're safe too, since anything further
2700 * will only be looking at most 10 bytes after this pointer.
2702 if (old->off == cur->off && old->range < cur->range)
2705 /* old(off=20,r=10) is equal to cur(off=22,re=22 or 5 or 0)
2706 * since both cannot be used for packet access and safe(old)
2707 * pointer has smaller off that could be used for further
2708 * 'if (ptr > data_end)' check
2710 * old(off=20,r=10) and cur(off=22,r=22) and cur(off=22,r=0) mean
2711 * that we cannot access the packet.
2712 * The safe range is:
2713 * [ptr, ptr + range - off)
2714 * so whenever off >=range, it means no safe bytes from this pointer.
2715 * When comparing old->off <= cur->off, it means that older code
2716 * went with smaller offset and that offset was later
2717 * used to figure out the safe range after 'if (ptr > data_end)' check
2718 * Say, 'old' state was explored like:
2719 * ... R3(off=0, r=0)
2721 * ... now R4(off=20,r=0) <-- here
2722 * if (R4 > data_end)
2723 * ... R4(off=20,r=20), R3(off=0,r=20) and R3 can be used to access.
2724 * ... the code further went all the way to bpf_exit.
2725 * Now the 'cur' state at the mark 'here' has R4(off=30,r=0).
2726 * old_R4(off=20,r=0) equal to cur_R4(off=30,r=0), since if the verifier
2727 * goes further, such cur_R4 will give larger safe packet range after
2728 * 'if (R4 > data_end)' and all further insn were already good with r=20,
2729 * so they will be good with r=30 and we can prune the search.
2731 if (old->off <= cur->off &&
2732 old->off >= old->range && cur->off >= cur->range)
2738 /* compare two verifier states
2740 * all states stored in state_list are known to be valid, since
2741 * verifier reached 'bpf_exit' instruction through them
2743 * this function is called when verifier exploring different branches of
2744 * execution popped from the state stack. If it sees an old state that has
2745 * more strict register state and more strict stack state then this execution
2746 * branch doesn't need to be explored further, since verifier already
2747 * concluded that more strict state leads to valid finish.
2749 * Therefore two states are equivalent if register state is more conservative
2750 * and explored stack state is more conservative than the current one.
2753 * (slot1=INV slot2=MISC) == (slot1=MISC slot2=MISC)
2754 * (slot1=MISC slot2=MISC) != (slot1=INV slot2=MISC)
2756 * In other words if current stack state (one being explored) has more
2757 * valid slots than old one that already passed validation, it means
2758 * the verifier can stop exploring and conclude that current state is valid too
2760 * Similarly with registers. If explored state has register type as invalid
2761 * whereas register type in current state is meaningful, it means that
2762 * the current state will reach 'bpf_exit' instruction safely
2764 static bool states_equal(struct bpf_verifier_env *env,
2765 struct bpf_verifier_state *old,
2766 struct bpf_verifier_state *cur)
2768 bool varlen_map_access = env->varlen_map_value_access;
2769 struct bpf_reg_state *rold, *rcur;
2772 for (i = 0; i < MAX_BPF_REG; i++) {
2773 rold = &old->regs[i];
2774 rcur = &cur->regs[i];
2776 if (memcmp(rold, rcur, sizeof(*rold)) == 0)
2779 /* If the ranges were not the same, but everything else was and
2780 * we didn't do a variable access into a map then we are a-ok.
2782 if (!varlen_map_access &&
2783 memcmp(rold, rcur, offsetofend(struct bpf_reg_state, id)) == 0)
2786 /* If we didn't map access then again we don't care about the
2787 * mismatched range values and it's ok if our old type was
2788 * UNKNOWN and we didn't go to a NOT_INIT'ed reg.
2790 if (rold->type == NOT_INIT ||
2791 (!varlen_map_access && rold->type == UNKNOWN_VALUE &&
2792 rcur->type != NOT_INIT))
2795 if (rold->type == PTR_TO_PACKET && rcur->type == PTR_TO_PACKET &&
2796 compare_ptrs_to_packet(rold, rcur))
2802 for (i = 0; i < MAX_BPF_STACK; i++) {
2803 if (old->stack_slot_type[i] == STACK_INVALID)
2805 if (old->stack_slot_type[i] != cur->stack_slot_type[i])
2806 /* Ex: old explored (safe) state has STACK_SPILL in
2807 * this stack slot, but current has has STACK_MISC ->
2808 * this verifier states are not equivalent,
2809 * return false to continue verification of this path
2812 if (i % BPF_REG_SIZE)
2814 if (memcmp(&old->spilled_regs[i / BPF_REG_SIZE],
2815 &cur->spilled_regs[i / BPF_REG_SIZE],
2816 sizeof(old->spilled_regs[0])))
2817 /* when explored and current stack slot types are
2818 * the same, check that stored pointers types
2819 * are the same as well.
2820 * Ex: explored safe path could have stored
2821 * (bpf_reg_state) {.type = PTR_TO_STACK, .imm = -8}
2822 * but current path has stored:
2823 * (bpf_reg_state) {.type = PTR_TO_STACK, .imm = -16}
2824 * such verifier states are not equivalent.
2825 * return false to continue verification of this path
2834 static int is_state_visited(struct bpf_verifier_env *env, int insn_idx)
2836 struct bpf_verifier_state_list *new_sl;
2837 struct bpf_verifier_state_list *sl;
2839 sl = env->explored_states[insn_idx];
2841 /* this 'insn_idx' instruction wasn't marked, so we will not
2842 * be doing state search here
2846 while (sl != STATE_LIST_MARK) {
2847 if (states_equal(env, &sl->state, &env->cur_state))
2848 /* reached equivalent register/stack state,
2855 /* there were no equivalent states, remember current one.
2856 * technically the current state is not proven to be safe yet,
2857 * but it will either reach bpf_exit (which means it's safe) or
2858 * it will be rejected. Since there are no loops, we won't be
2859 * seeing this 'insn_idx' instruction again on the way to bpf_exit
2861 new_sl = kmalloc(sizeof(struct bpf_verifier_state_list), GFP_USER);
2865 /* add new state to the head of linked list */
2866 memcpy(&new_sl->state, &env->cur_state, sizeof(env->cur_state));
2867 new_sl->next = env->explored_states[insn_idx];
2868 env->explored_states[insn_idx] = new_sl;
2872 static int ext_analyzer_insn_hook(struct bpf_verifier_env *env,
2873 int insn_idx, int prev_insn_idx)
2875 if (!env->analyzer_ops || !env->analyzer_ops->insn_hook)
2878 return env->analyzer_ops->insn_hook(env, insn_idx, prev_insn_idx);
2881 static int do_check(struct bpf_verifier_env *env)
2883 struct bpf_verifier_state *state = &env->cur_state;
2884 struct bpf_insn *insns = env->prog->insnsi;
2885 struct bpf_reg_state *regs = state->regs;
2886 int insn_cnt = env->prog->len;
2887 int insn_idx, prev_insn_idx = 0;
2888 int insn_processed = 0;
2889 bool do_print_state = false;
2891 init_reg_state(regs);
2893 env->varlen_map_value_access = false;
2895 struct bpf_insn *insn;
2899 if (insn_idx >= insn_cnt) {
2900 verbose("invalid insn idx %d insn_cnt %d\n",
2901 insn_idx, insn_cnt);
2905 insn = &insns[insn_idx];
2906 class = BPF_CLASS(insn->code);
2908 if (++insn_processed > BPF_COMPLEXITY_LIMIT_INSNS) {
2909 verbose("BPF program is too large. Processed %d insn\n",
2914 err = is_state_visited(env, insn_idx);
2918 /* found equivalent state, can prune the search */
2921 verbose("\nfrom %d to %d: safe\n",
2922 prev_insn_idx, insn_idx);
2924 verbose("%d: safe\n", insn_idx);
2926 goto process_bpf_exit;
2929 if (log_level && do_print_state) {
2930 verbose("\nfrom %d to %d:", prev_insn_idx, insn_idx);
2931 print_verifier_state(&env->cur_state);
2932 do_print_state = false;
2936 verbose("%d: ", insn_idx);
2937 print_bpf_insn(env, insn);
2940 err = ext_analyzer_insn_hook(env, insn_idx, prev_insn_idx);
2944 if (class == BPF_ALU || class == BPF_ALU64) {
2945 err = check_alu_op(env, insn);
2949 } else if (class == BPF_LDX) {
2950 enum bpf_reg_type *prev_src_type, src_reg_type;
2952 /* check for reserved fields is already done */
2954 /* check src operand */
2955 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
2959 err = check_reg_arg(regs, insn->dst_reg, DST_OP_NO_MARK);
2963 src_reg_type = regs[insn->src_reg].type;
2965 /* check that memory (src_reg + off) is readable,
2966 * the state of dst_reg will be updated by this func
2968 err = check_mem_access(env, insn->src_reg, insn->off,
2969 BPF_SIZE(insn->code), BPF_READ,
2974 if (BPF_SIZE(insn->code) != BPF_W &&
2975 BPF_SIZE(insn->code) != BPF_DW) {
2980 prev_src_type = &env->insn_aux_data[insn_idx].ptr_type;
2982 if (*prev_src_type == NOT_INIT) {
2984 * dst_reg = *(u32 *)(src_reg + off)
2985 * save type to validate intersecting paths
2987 *prev_src_type = src_reg_type;
2989 } else if (src_reg_type != *prev_src_type &&
2990 (src_reg_type == PTR_TO_CTX ||
2991 *prev_src_type == PTR_TO_CTX)) {
2992 /* ABuser program is trying to use the same insn
2993 * dst_reg = *(u32*) (src_reg + off)
2994 * with different pointer types:
2995 * src_reg == ctx in one branch and
2996 * src_reg == stack|map in some other branch.
2999 verbose("same insn cannot be used with different pointers\n");
3003 } else if (class == BPF_STX) {
3004 enum bpf_reg_type *prev_dst_type, dst_reg_type;
3006 if (BPF_MODE(insn->code) == BPF_XADD) {
3007 err = check_xadd(env, insn);
3014 /* check src1 operand */
3015 err = check_reg_arg(regs, insn->src_reg, SRC_OP);
3018 /* check src2 operand */
3019 err = check_reg_arg(regs, insn->dst_reg, SRC_OP);
3023 dst_reg_type = regs[insn->dst_reg].type;
3025 /* check that memory (dst_reg + off) is writeable */
3026 err = check_mem_access(env, insn->dst_reg, insn->off,
3027 BPF_SIZE(insn->code), BPF_WRITE,
3032 prev_dst_type = &env->insn_aux_data[insn_idx].ptr_type;
3034 if (*prev_dst_type == NOT_INIT) {
3035 *prev_dst_type = dst_reg_type;
3036 } else if (dst_reg_type != *prev_dst_type &&
3037 (dst_reg_type == PTR_TO_CTX ||
3038 *prev_dst_type == PTR_TO_CTX)) {
3039 verbose("same insn cannot be used with different pointers\n");
3043 } else if (class == BPF_ST) {
3044 if (BPF_MODE(insn->code) != BPF_MEM ||
3045 insn->src_reg != BPF_REG_0) {
3046 verbose("BPF_ST uses reserved fields\n");
3049 /* check src operand */
3050 err = check_reg_arg(regs, insn->dst_reg, SRC_OP);
3054 /* check that memory (dst_reg + off) is writeable */
3055 err = check_mem_access(env, insn->dst_reg, insn->off,
3056 BPF_SIZE(insn->code), BPF_WRITE,
3061 } else if (class == BPF_JMP) {
3062 u8 opcode = BPF_OP(insn->code);
3064 if (opcode == BPF_CALL) {
3065 if (BPF_SRC(insn->code) != BPF_K ||
3067 insn->src_reg != BPF_REG_0 ||
3068 insn->dst_reg != BPF_REG_0) {
3069 verbose("BPF_CALL uses reserved fields\n");
3073 err = check_call(env, insn->imm, insn_idx);
3077 } else if (opcode == BPF_JA) {
3078 if (BPF_SRC(insn->code) != BPF_K ||
3080 insn->src_reg != BPF_REG_0 ||
3081 insn->dst_reg != BPF_REG_0) {
3082 verbose("BPF_JA uses reserved fields\n");
3086 insn_idx += insn->off + 1;
3089 } else if (opcode == BPF_EXIT) {
3090 if (BPF_SRC(insn->code) != BPF_K ||
3092 insn->src_reg != BPF_REG_0 ||
3093 insn->dst_reg != BPF_REG_0) {
3094 verbose("BPF_EXIT uses reserved fields\n");
3098 /* eBPF calling convetion is such that R0 is used
3099 * to return the value from eBPF program.
3100 * Make sure that it's readable at this time
3101 * of bpf_exit, which means that program wrote
3102 * something into it earlier
3104 err = check_reg_arg(regs, BPF_REG_0, SRC_OP);
3108 if (is_pointer_value(env, BPF_REG_0)) {
3109 verbose("R0 leaks addr as return value\n");
3114 insn_idx = pop_stack(env, &prev_insn_idx);
3118 do_print_state = true;
3122 err = check_cond_jmp_op(env, insn, &insn_idx);
3126 } else if (class == BPF_LD) {
3127 u8 mode = BPF_MODE(insn->code);
3129 if (mode == BPF_ABS || mode == BPF_IND) {
3130 err = check_ld_abs(env, insn);
3134 } else if (mode == BPF_IMM) {
3135 err = check_ld_imm(env, insn);
3141 verbose("invalid BPF_LD mode\n");
3144 reset_reg_range_values(regs, insn->dst_reg);
3146 verbose("unknown insn class %d\n", class);
3153 verbose("processed %d insns\n", insn_processed);
3157 static int check_map_prealloc(struct bpf_map *map)
3159 return (map->map_type != BPF_MAP_TYPE_HASH &&
3160 map->map_type != BPF_MAP_TYPE_PERCPU_HASH &&
3161 map->map_type != BPF_MAP_TYPE_HASH_OF_MAPS) ||
3162 !(map->map_flags & BPF_F_NO_PREALLOC);
3165 static int check_map_prog_compatibility(struct bpf_map *map,
3166 struct bpf_prog *prog)
3169 /* Make sure that BPF_PROG_TYPE_PERF_EVENT programs only use
3170 * preallocated hash maps, since doing memory allocation
3171 * in overflow_handler can crash depending on where nmi got
3174 if (prog->type == BPF_PROG_TYPE_PERF_EVENT) {
3175 if (!check_map_prealloc(map)) {
3176 verbose("perf_event programs can only use preallocated hash map\n");
3179 if (map->inner_map_meta &&
3180 !check_map_prealloc(map->inner_map_meta)) {
3181 verbose("perf_event programs can only use preallocated inner hash map\n");
3188 /* look for pseudo eBPF instructions that access map FDs and
3189 * replace them with actual map pointers
3191 static int replace_map_fd_with_map_ptr(struct bpf_verifier_env *env)
3193 struct bpf_insn *insn = env->prog->insnsi;
3194 int insn_cnt = env->prog->len;
3197 err = bpf_prog_calc_tag(env->prog);
3201 for (i = 0; i < insn_cnt; i++, insn++) {
3202 if (BPF_CLASS(insn->code) == BPF_LDX &&
3203 (BPF_MODE(insn->code) != BPF_MEM || insn->imm != 0)) {
3204 verbose("BPF_LDX uses reserved fields\n");
3208 if (BPF_CLASS(insn->code) == BPF_STX &&
3209 ((BPF_MODE(insn->code) != BPF_MEM &&
3210 BPF_MODE(insn->code) != BPF_XADD) || insn->imm != 0)) {
3211 verbose("BPF_STX uses reserved fields\n");
3215 if (insn[0].code == (BPF_LD | BPF_IMM | BPF_DW)) {
3216 struct bpf_map *map;
3219 if (i == insn_cnt - 1 || insn[1].code != 0 ||
3220 insn[1].dst_reg != 0 || insn[1].src_reg != 0 ||
3222 verbose("invalid bpf_ld_imm64 insn\n");
3226 if (insn->src_reg == 0)
3227 /* valid generic load 64-bit imm */
3230 if (insn->src_reg != BPF_PSEUDO_MAP_FD) {
3231 verbose("unrecognized bpf_ld_imm64 insn\n");
3235 f = fdget(insn->imm);
3236 map = __bpf_map_get(f);
3238 verbose("fd %d is not pointing to valid bpf_map\n",
3240 return PTR_ERR(map);
3243 err = check_map_prog_compatibility(map, env->prog);
3249 /* store map pointer inside BPF_LD_IMM64 instruction */
3250 insn[0].imm = (u32) (unsigned long) map;
3251 insn[1].imm = ((u64) (unsigned long) map) >> 32;
3253 /* check whether we recorded this map already */
3254 for (j = 0; j < env->used_map_cnt; j++)
3255 if (env->used_maps[j] == map) {
3260 if (env->used_map_cnt >= MAX_USED_MAPS) {
3265 /* hold the map. If the program is rejected by verifier,
3266 * the map will be released by release_maps() or it
3267 * will be used by the valid program until it's unloaded
3268 * and all maps are released in free_bpf_prog_info()
3270 map = bpf_map_inc(map, false);
3273 return PTR_ERR(map);
3275 env->used_maps[env->used_map_cnt++] = map;
3284 /* now all pseudo BPF_LD_IMM64 instructions load valid
3285 * 'struct bpf_map *' into a register instead of user map_fd.
3286 * These pointers will be used later by verifier to validate map access.
3291 /* drop refcnt of maps used by the rejected program */
3292 static void release_maps(struct bpf_verifier_env *env)
3296 for (i = 0; i < env->used_map_cnt; i++)
3297 bpf_map_put(env->used_maps[i]);
3300 /* convert pseudo BPF_LD_IMM64 into generic BPF_LD_IMM64 */
3301 static void convert_pseudo_ld_imm64(struct bpf_verifier_env *env)
3303 struct bpf_insn *insn = env->prog->insnsi;
3304 int insn_cnt = env->prog->len;
3307 for (i = 0; i < insn_cnt; i++, insn++)
3308 if (insn->code == (BPF_LD | BPF_IMM | BPF_DW))
3312 /* single env->prog->insni[off] instruction was replaced with the range
3313 * insni[off, off + cnt). Adjust corresponding insn_aux_data by copying
3314 * [0, off) and [off, end) to new locations, so the patched range stays zero
3316 static int adjust_insn_aux_data(struct bpf_verifier_env *env, u32 prog_len,
3319 struct bpf_insn_aux_data *new_data, *old_data = env->insn_aux_data;
3323 new_data = vzalloc(sizeof(struct bpf_insn_aux_data) * prog_len);
3326 memcpy(new_data, old_data, sizeof(struct bpf_insn_aux_data) * off);
3327 memcpy(new_data + off + cnt - 1, old_data + off,
3328 sizeof(struct bpf_insn_aux_data) * (prog_len - off - cnt + 1));
3329 env->insn_aux_data = new_data;
3334 static struct bpf_prog *bpf_patch_insn_data(struct bpf_verifier_env *env, u32 off,
3335 const struct bpf_insn *patch, u32 len)
3337 struct bpf_prog *new_prog;
3339 new_prog = bpf_patch_insn_single(env->prog, off, patch, len);
3342 if (adjust_insn_aux_data(env, new_prog->len, off, len))
3347 /* convert load instructions that access fields of 'struct __sk_buff'
3348 * into sequence of instructions that access fields of 'struct sk_buff'
3350 static int convert_ctx_accesses(struct bpf_verifier_env *env)
3352 const struct bpf_verifier_ops *ops = env->prog->aux->ops;
3353 const int insn_cnt = env->prog->len;
3354 struct bpf_insn insn_buf[16], *insn;
3355 struct bpf_prog *new_prog;
3356 enum bpf_access_type type;
3357 int i, cnt, delta = 0;
3359 if (ops->gen_prologue) {
3360 cnt = ops->gen_prologue(insn_buf, env->seen_direct_write,
3362 if (cnt >= ARRAY_SIZE(insn_buf)) {
3363 verbose("bpf verifier is misconfigured\n");
3366 new_prog = bpf_patch_insn_data(env, 0, insn_buf, cnt);
3370 env->prog = new_prog;
3375 if (!ops->convert_ctx_access)
3378 insn = env->prog->insnsi + delta;
3380 for (i = 0; i < insn_cnt; i++, insn++) {
3381 if (insn->code == (BPF_LDX | BPF_MEM | BPF_B) ||
3382 insn->code == (BPF_LDX | BPF_MEM | BPF_H) ||
3383 insn->code == (BPF_LDX | BPF_MEM | BPF_W) ||
3384 insn->code == (BPF_LDX | BPF_MEM | BPF_DW))
3386 else if (insn->code == (BPF_STX | BPF_MEM | BPF_B) ||
3387 insn->code == (BPF_STX | BPF_MEM | BPF_H) ||
3388 insn->code == (BPF_STX | BPF_MEM | BPF_W) ||
3389 insn->code == (BPF_STX | BPF_MEM | BPF_DW))
3394 if (env->insn_aux_data[i + delta].ptr_type != PTR_TO_CTX)
3397 cnt = ops->convert_ctx_access(type, insn, insn_buf, env->prog);
3398 if (cnt == 0 || cnt >= ARRAY_SIZE(insn_buf)) {
3399 verbose("bpf verifier is misconfigured\n");
3403 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf, cnt);
3409 /* keep walking new program and skip insns we just inserted */
3410 env->prog = new_prog;
3411 insn = new_prog->insnsi + i + delta;
3417 /* fixup insn->imm field of bpf_call instructions
3418 * and inline eligible helpers as explicit sequence of BPF instructions
3420 * this function is called after eBPF program passed verification
3422 static int fixup_bpf_calls(struct bpf_verifier_env *env)
3424 struct bpf_prog *prog = env->prog;
3425 struct bpf_insn *insn = prog->insnsi;
3426 const struct bpf_func_proto *fn;
3427 const int insn_cnt = prog->len;
3428 struct bpf_insn insn_buf[16];
3429 struct bpf_prog *new_prog;
3430 struct bpf_map *map_ptr;
3431 int i, cnt, delta = 0;
3433 for (i = 0; i < insn_cnt; i++, insn++) {
3434 if (insn->code != (BPF_JMP | BPF_CALL))
3437 if (insn->imm == BPF_FUNC_get_route_realm)
3438 prog->dst_needed = 1;
3439 if (insn->imm == BPF_FUNC_get_prandom_u32)
3440 bpf_user_rnd_init_once();
3441 if (insn->imm == BPF_FUNC_tail_call) {
3442 /* If we tail call into other programs, we
3443 * cannot make any assumptions since they can
3444 * be replaced dynamically during runtime in
3445 * the program array.
3447 prog->cb_access = 1;
3449 /* mark bpf_tail_call as different opcode to avoid
3450 * conditional branch in the interpeter for every normal
3451 * call and to prevent accidental JITing by JIT compiler
3452 * that doesn't support bpf_tail_call yet
3455 insn->code |= BPF_X;
3459 if (ebpf_jit_enabled() && insn->imm == BPF_FUNC_map_lookup_elem) {
3460 map_ptr = env->insn_aux_data[i + delta].map_ptr;
3461 if (map_ptr == BPF_MAP_PTR_POISON ||
3462 !map_ptr->ops->map_gen_lookup)
3463 goto patch_call_imm;
3465 cnt = map_ptr->ops->map_gen_lookup(map_ptr, insn_buf);
3466 if (cnt == 0 || cnt >= ARRAY_SIZE(insn_buf)) {
3467 verbose("bpf verifier is misconfigured\n");
3471 new_prog = bpf_patch_insn_data(env, i + delta, insn_buf,
3478 /* keep walking new program and skip insns we just inserted */
3479 env->prog = prog = new_prog;
3480 insn = new_prog->insnsi + i + delta;
3485 fn = prog->aux->ops->get_func_proto(insn->imm);
3486 /* all functions that have prototype and verifier allowed
3487 * programs to call them, must be real in-kernel functions
3490 verbose("kernel subsystem misconfigured func %s#%d\n",
3491 func_id_name(insn->imm), insn->imm);
3494 insn->imm = fn->func - __bpf_call_base;
3500 static void free_states(struct bpf_verifier_env *env)
3502 struct bpf_verifier_state_list *sl, *sln;
3505 if (!env->explored_states)
3508 for (i = 0; i < env->prog->len; i++) {
3509 sl = env->explored_states[i];
3512 while (sl != STATE_LIST_MARK) {
3519 kfree(env->explored_states);
3522 int bpf_check(struct bpf_prog **prog, union bpf_attr *attr)
3524 char __user *log_ubuf = NULL;
3525 struct bpf_verifier_env *env;
3528 /* 'struct bpf_verifier_env' can be global, but since it's not small,
3529 * allocate/free it every time bpf_check() is called
3531 env = kzalloc(sizeof(struct bpf_verifier_env), GFP_KERNEL);
3535 env->insn_aux_data = vzalloc(sizeof(struct bpf_insn_aux_data) *
3538 if (!env->insn_aux_data)
3542 /* grab the mutex to protect few globals used by verifier */
3543 mutex_lock(&bpf_verifier_lock);
3545 if (attr->log_level || attr->log_buf || attr->log_size) {
3546 /* user requested verbose verifier output
3547 * and supplied buffer to store the verification trace
3549 log_level = attr->log_level;
3550 log_ubuf = (char __user *) (unsigned long) attr->log_buf;
3551 log_size = attr->log_size;
3555 /* log_* values have to be sane */
3556 if (log_size < 128 || log_size > UINT_MAX >> 8 ||
3557 log_level == 0 || log_ubuf == NULL)
3561 log_buf = vmalloc(log_size);
3568 ret = replace_map_fd_with_map_ptr(env);
3570 goto skip_full_check;
3572 env->explored_states = kcalloc(env->prog->len,
3573 sizeof(struct bpf_verifier_state_list *),
3576 if (!env->explored_states)
3577 goto skip_full_check;
3579 ret = check_cfg(env);
3581 goto skip_full_check;
3583 env->allow_ptr_leaks = capable(CAP_SYS_ADMIN);
3585 ret = do_check(env);
3588 while (pop_stack(env, NULL) >= 0);
3592 /* program is valid, convert *(u32*)(ctx + off) accesses */
3593 ret = convert_ctx_accesses(env);
3596 ret = fixup_bpf_calls(env);
3598 if (log_level && log_len >= log_size - 1) {
3599 BUG_ON(log_len >= log_size);
3600 /* verifier log exceeded user supplied buffer */
3602 /* fall through to return what was recorded */
3605 /* copy verifier log back to user space including trailing zero */
3606 if (log_level && copy_to_user(log_ubuf, log_buf, log_len + 1) != 0) {
3611 if (ret == 0 && env->used_map_cnt) {
3612 /* if program passed verifier, update used_maps in bpf_prog_info */
3613 env->prog->aux->used_maps = kmalloc_array(env->used_map_cnt,
3614 sizeof(env->used_maps[0]),
3617 if (!env->prog->aux->used_maps) {
3622 memcpy(env->prog->aux->used_maps, env->used_maps,
3623 sizeof(env->used_maps[0]) * env->used_map_cnt);
3624 env->prog->aux->used_map_cnt = env->used_map_cnt;
3626 /* program is valid. Convert pseudo bpf_ld_imm64 into generic
3627 * bpf_ld_imm64 instructions
3629 convert_pseudo_ld_imm64(env);
3635 if (!env->prog->aux->used_maps)
3636 /* if we didn't copy map pointers into bpf_prog_info, release
3637 * them now. Otherwise free_bpf_prog_info() will release them.
3642 mutex_unlock(&bpf_verifier_lock);
3643 vfree(env->insn_aux_data);
3649 int bpf_analyzer(struct bpf_prog *prog, const struct bpf_ext_analyzer_ops *ops,
3652 struct bpf_verifier_env *env;
3655 env = kzalloc(sizeof(struct bpf_verifier_env), GFP_KERNEL);
3659 env->insn_aux_data = vzalloc(sizeof(struct bpf_insn_aux_data) *
3662 if (!env->insn_aux_data)
3665 env->analyzer_ops = ops;
3666 env->analyzer_priv = priv;
3668 /* grab the mutex to protect few globals used by verifier */
3669 mutex_lock(&bpf_verifier_lock);
3673 env->explored_states = kcalloc(env->prog->len,
3674 sizeof(struct bpf_verifier_state_list *),
3677 if (!env->explored_states)
3678 goto skip_full_check;
3680 ret = check_cfg(env);
3682 goto skip_full_check;
3684 env->allow_ptr_leaks = capable(CAP_SYS_ADMIN);
3686 ret = do_check(env);
3689 while (pop_stack(env, NULL) >= 0);
3692 mutex_unlock(&bpf_verifier_lock);
3693 vfree(env->insn_aux_data);
3698 EXPORT_SYMBOL_GPL(bpf_analyzer);