kernel/bpf/verifier.c

18253

if (e == FALLTHROUGH && insn_state[t] >= (DISCOVERED | FALLTHROUGH))

kernel/bpf/verifier.c

18256

if (e == BRANCH && insn_state[t] >= (DISCOVERED | BRANCH))

kernel/bpf/verifier.c

18273

insn_state[t] = DISCOVERED | e;

kernel/bpf/verifier.c

18274

insn_state[w] = DISCOVERED;

kernel/bpf/verifier.c

18279

} else if ((insn_state[w] & 0xF0) == DISCOVERED) {

kernel/bpf/verifier.c

18288

insn_state[t] = DISCOVERED | e;

kernel/bpf/verifier.c

18798

insn_state[w] |= DISCOVERED;

kernel/bpf/verifier.c

18975

insn_state[0] = DISCOVERED; /* mark 1st insn as discovered */

kernel/bpf/verifier.c

19007

insn_state[ex_insn_beg] = DISCOVERED;

kernel/bpf/verifier.c

19068

state[top] |= DISCOVERED;

kernel/bpf/verifier.c

19078

state[succ->items[s]] |= DISCOVERED;