Re: [RFC PATCH bpf-next 07/12] bpf/verifier: allow bounded loops with JLT/true back-edge

2018-02-26 Thread Edward Cree
On 23/02/18 22:27, John Fastabend wrote: > On 02/23/2018 09:41 AM, Edward Cree wrote: >> Where the register umin_value is increasing sufficiently fast, the loop >> will terminate after a reasonable number of iterations, so we can allow >> to keep walking it. > Continuing to walk the loop is

Re: [RFC PATCH bpf-next 07/12] bpf/verifier: allow bounded loops with JLT/true back-edge

2018-02-23 Thread John Fastabend
On 02/23/2018 09:41 AM, Edward Cree wrote: > Where the register umin_value is increasing sufficiently fast, the loop > will terminate after a reasonable number of iterations, so we can allow > to keep walking it. Continuing to walk the loop is problematic because we hit the complexity limit.

[RFC PATCH bpf-next 07/12] bpf/verifier: allow bounded loops with JLT/true back-edge

2018-02-23 Thread Edward Cree
Where the register umin_value is increasing sufficiently fast, the loop will terminate after a reasonable number of iterations, so we can allow to keep walking it. The semantics of prev_insn_idx are changed slightly: it now always refers to the last jump insn walked, even when that jump was not