On 04/25/2018 06:22 AM, Jakub Kicinski wrote: > Hi! > > This set adds an optimization run to the NFP jit to turn ADD and SUB > instructions with negative immediate into the opposite operation with > a positive immediate. NFP can fit small immediates into the instructions > but it can't ever fit negative immediates. Addition of small negative > immediates is quite common in BPF programs for stack address calculations, > therefore this optimization gives us non-negligible savings in instruction > count (up to 4%).
Applied to bpf-next, thanks Jakub!
