netdev - Re: [PATCH net] test_bpf: reduce MAX

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:   Wed, 28 Feb 2018 17:51:14 +0100
From:   Daniel Borkmann <daniel@...earbox.net>
To:     Eric Dumazet <eric.dumazet@...il.com>,
        Alexei Starovoitov <ast@...nel.org>
Cc:     netdev <netdev@...r.kernel.org>
Subject: Re: [PATCH net] test_bpf: reduce MAX_TESTRUNS

On 02/28/2018 05:39 PM, Eric Dumazet wrote:
> From: Eric Dumazet <edumazet@...gle.com>
> 
> For tests that are using the maximal number of BPF instruction, each
> run takes 20 usec. Looping 10,000 times on them totals 200 ms, which
> is bad when the loop is not preemptible.
> 
> test_bpf: #264 BPF_MAXINSNS: Call heavy transformations jited:1 19248
> 18548 PASS
> test_bpf: #269 BPF_MAXINSNS: ld_abs+get_processor_id jited:1 20896 PASS
> 
> Lets divide by ten the number of iterations, so that max latency is
> 20ms. We could use need_resched() to break the loop earlier if we
> believe 20 ms is too much.
> 
> Signed-off-by: Eric Dumazet <edumazet@...gle.com>

Applied to bpf tree, thanks Eric!