Skip to content
/ linux Public

Commit 4c122e8

Browse files
Alexei StarovoitovSasha Levin
authored andcommitted
bpf: Recognize special arithmetic shift in the verifier
[ Upstream commit bffacdb ] cilium bpf_wiregard.bpf.c when compiled with -O1 fails to load with the following verifier log: 192: (79) r2 = *(u64 *)(r10 -304) ; R2=pkt(r=40) R10=fp0 fp-304=pkt(r=40) ... 227: (85) call bpf_skb_store_bytes#9 ; R0=scalar() 228: (bc) w2 = w0 ; R0=scalar() R2=scalar(smin=0,smax=umax=0xffffffff,var_off=(0x0; 0xffffffff)) 229: (c4) w2 s>>= 31 ; R2=scalar(smin=0,smax=umax=0xffffffff,smin32=-1,smax32=0,var_off=(0x0; 0xffffffff)) 230: (54) w2 &= -134 ; R2=scalar(smin=0,smax=umax=umax32=0xffffff7a,smax32=0x7fffff7a,var_off=(0x0; 0xffffff7a)) ... 232: (66) if w2 s> 0xffffffff goto pc+125 ; R2=scalar(smin=umin=umin32=0x80000000,smax=umax=umax32=0xffffff7a,smax32=-134,var_off=(0x80000000; 0x7fffff7a)) ... 238: (79) r4 = *(u64 *)(r10 -304) ; R4=scalar() R10=fp0 fp-304=scalar() 239: (56) if w2 != 0xffffff78 goto pc+210 ; R2=0xffffff78 // -136 ... 258: (71) r1 = *(u8 *)(r4 +0) R4 invalid mem access 'scalar' The error might confuse most bpf authors, since fp-304 slot had 'pkt' pointer at insn 192 and became 'scalar' at 238. That happened because bpf_skb_store_bytes() clears all packet pointers including those in the stack. On the first glance it might look like a bug in the source code, since ctx->data pointer should have been reloaded after the call to bpf_skb_store_bytes(). The relevant part of cilium source code looks like this: // bpf/lib/nodeport.h int dsr_set_ipip6() { if (ctx_adjust_hroom(...)) return DROP_INVALID; // -134 if (ctx_store_bytes(...)) return DROP_WRITE_ERROR; // -141 return 0; } bool dsr_fail_needs_reply(int code) { if (code == DROP_FRAG_NEEDED) // -136 return true; return false; } tail_nodeport_ipv6_dsr() { ret = dsr_set_ipip6(...); if (!IS_ERR(ret)) { ... } else { if (dsr_fail_needs_reply(ret)) return dsr_reply_icmp6(...); } } The code doesn't have arithmetic shift by 31 and it reloads ctx->data every time it needs to access it. So it's not a bug in the source code. The reason is DAGCombiner::foldSelectCCToShiftAnd() LLVM transformation: // If this is a select where the false operand is zero and the compare is a // check of the sign bit, see if we can perform the "gzip trick": // select_cc setlt X, 0, A, 0 -> and (sra X, size(X)-1), A // select_cc setgt X, 0, A, 0 -> and (not (sra X, size(X)-1)), A The conditional branch in dsr_set_ipip6() and its return values are optimized into BPF_ARSH plus BPF_AND: 227: (85) call bpf_skb_store_bytes#9 228: (bc) w2 = w0 229: (c4) w2 s>>= 31 ; R2=scalar(smin=0,smax=umax=0xffffffff,smin32=-1,smax32=0,var_off=(0x0; 0xffffffff)) 230: (54) w2 &= -134 ; R2=scalar(smin=0,smax=umax=umax32=0xffffff7a,smax32=0x7fffff7a,var_off=(0x0; 0xffffff7a)) after insn 230 the register w2 can only be 0 or -134, but the verifier approximates it, since there is no way to represent two scalars in bpf_reg_state. After fallthough at insn 232 the w2 can only be -134, hence the branch at insn 239: (56) if w2 != -136 goto pc+210 should be always taken, and trapping insn 258 should never execute. LLVM generated correct code, but the verifier follows impossible path and rejects valid program. To fix this issue recognize this special LLVM optimization and fork the verifier state. So after insn 229: (c4) w2 s>>= 31 the verifier has two states to explore: one with w2 = 0 and another with w2 = 0xffffffff which makes the verifier accept bpf_wiregard.c A similar pattern exists were OR operation is used in place of the AND operation, the verifier detects that pattern as well by forking the state before the OR operation with a scalar in range [-1,0]. Note there are 20+ such patterns in bpf_wiregard.o compiled with -O1 and -O2, but they're rarely seen in other production bpf programs, so push_stack() approach is not a concern. Reported-by: Hao Sun <sunhao.th@gmail.com> Signed-off-by: Alexei Starovoitov <ast@kernel.org> Co-developed-by: Puranjay Mohan <puranjay@kernel.org> Signed-off-by: Puranjay Mohan <puranjay@kernel.org> Link: https://lore.kernel.org/r/20260112201424.816836-2-puranjay@kernel.org Signed-off-by: Alexei Starovoitov <ast@kernel.org> Signed-off-by: Sasha Levin <sashal@kernel.org>
1 parent c1357b4 commit 4c122e8

File tree

1 file changed

+39
-0
lines changed

1 file changed

+39
-0
lines changed

kernel/bpf/verifier.c

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15418,6 +15418,35 @@ static bool is_safe_to_compute_dst_reg_range(struct bpf_insn *insn,
1541815418
}
1541915419
}
1542015420

15421+
static int maybe_fork_scalars(struct bpf_verifier_env *env, struct bpf_insn *insn,
15422+
struct bpf_reg_state *dst_reg)
15423+
{
15424+
struct bpf_verifier_state *branch;
15425+
struct bpf_reg_state *regs;
15426+
bool alu32;
15427+
15428+
if (dst_reg->smin_value == -1 && dst_reg->smax_value == 0)
15429+
alu32 = false;
15430+
else if (dst_reg->s32_min_value == -1 && dst_reg->s32_max_value == 0)
15431+
alu32 = true;
15432+
else
15433+
return 0;
15434+
15435+
branch = push_stack(env, env->insn_idx + 1, env->insn_idx, false);
15436+
if (IS_ERR(branch))
15437+
return PTR_ERR(branch);
15438+
15439+
regs = branch->frame[branch->curframe]->regs;
15440+
if (alu32) {
15441+
__mark_reg32_known(&regs[insn->dst_reg], 0);
15442+
__mark_reg32_known(dst_reg, -1ull);
15443+
} else {
15444+
__mark_reg_known(&regs[insn->dst_reg], 0);
15445+
__mark_reg_known(dst_reg, -1ull);
15446+
}
15447+
return 0;
15448+
}
15449+
1542115450
/* WARNING: This function does calculations on 64-bit values, but the actual
1542215451
* execution may occur on 32-bit values. Therefore, things like bitshifts
1542315452
* need extra checks in the 32-bit case.
@@ -15480,11 +15509,21 @@ static int adjust_scalar_min_max_vals(struct bpf_verifier_env *env,
1548015509
scalar_min_max_mul(dst_reg, &src_reg);
1548115510
break;
1548215511
case BPF_AND:
15512+
if (tnum_is_const(src_reg.var_off)) {
15513+
ret = maybe_fork_scalars(env, insn, dst_reg);
15514+
if (ret)
15515+
return ret;
15516+
}
1548315517
dst_reg->var_off = tnum_and(dst_reg->var_off, src_reg.var_off);
1548415518
scalar32_min_max_and(dst_reg, &src_reg);
1548515519
scalar_min_max_and(dst_reg, &src_reg);
1548615520
break;
1548715521
case BPF_OR:
15522+
if (tnum_is_const(src_reg.var_off)) {
15523+
ret = maybe_fork_scalars(env, insn, dst_reg);
15524+
if (ret)
15525+
return ret;
15526+
}
1548815527
dst_reg->var_off = tnum_or(dst_reg->var_off, src_reg.var_off);
1548915528
scalar32_min_max_or(dst_reg, &src_reg);
1549015529
scalar_min_max_or(dst_reg, &src_reg);

0 commit comments

Comments
 (0)