Lines Matching defs:new

755  * this new pointer reference.

986          * a new state for a sequence of branches and all such current

1225     /* We might have learned new bounds from the var_off. */

1233      * then new var_off is (0; 0x7f...fc) which improves our umax.

1282      * then new var_off is (0; 0x7f...fc) which improves our umax.

1312      * then new var_off is (0; 0x7f...fc) which improves our umax.

5937 /* Handles arithmetic on a pointer and a scalar: computes new min/max and var_off.

6008      * The id may be overwritten later if we create a new variable offset.

6043             /* A new variable offset is created.  Note that off_reg->off

6046              * integer value was added to the pointer, give it a new 'id'

6048              * this creates a new 'base' pointer, off_reg (variable) gets

6101             /* A new variable offset is created.  If the subtrahend is known

6613      * and rely on inferring new ones from the unsigned bounds and

6643      * and rely on inferring new ones from the unsigned bounds and

6871 /* Handles ALU ops other than BPF_END, BPF_NEG and BPF_MOV: computes new min/max

7611     /* We might have learned new bounds from the var_off. */

8853  * the same id in the new state as well.  But that id could be different from

8854  * the old state, so we need to track the mapping from old to new ids.

8855  * Once we have seen that, say, a reg with old id 5 had new id 9, any subsequent

8856  * regs with old id 5 must also have new id 9 for the new state to be safe.  But

8857  * regs with a different old id could still have new id 9, we don't care about

8860  * so, we require the new id to match; otherwise, we add the id pair to the map.

9021                 /* new val must satisfy old val knowledge */

9052             /* If the new min/max/var_off satisfy the old ones and

9086             /* new val must satisfy old val knowledge */

9411     struct bpf_verifier_state *cur = env->cur_state, *new;

9425      * Do not add new state for future pruning if the verifier hasn't seen

9451             /* if the verifier is processing a loop, avoid adding new state

9479              * this state and will pop a new one.

9496         /* when new state is not going to be added do not increase miss count.

9568     /* add new state to the head of linked list */

9569     new = &new_sl->state;

9570     err = copy_verifier_state(new, cur);

9572         free_verifier_state(new, false);

9576     new->insn_idx = insn_idx;

9577     WARN_ONCE(new->branches != 1, "BUG is_state_visited:branches_to_explore=%d insn %d\n", new->branches, insn_idx);

9579     cur->parent = new;

9584     /* connect new state to parentage chain. Current frame needs all

9599             cur->frame[j]->regs[i].parent = &new->frame[j]->regs[i];

9609         struct bpf_func_state *newframe = new->frame[j];

10329  * [0, off) and [off, end) to new locations, so the patched range stays zero

10956         /* keep walking new program and skip insns we just inserted */