Commit eba38a96 authored by Gary Lin's avatar Gary Lin Committed by David S. Miller

bpf: update the comment about the length of analysis

Commit 07016151 ("bpf, verifier: further improve search
pruning") increased the limit of processed instructions from
32k to 64k, but the comment still mentioned the 32k limit.
This commit updates the comment to reflect the change.

Cc: Alexei Starovoitov <ast@kernel.org>
Cc: Daniel Borkmann <daniel@iogearbox.net>
Signed-off-by: default avatarGary Lin <glin@suse.com>
Acked-by: default avatarAlexei Starovoitov <ast@kernel.org>
Signed-off-by: default avatarDavid S. Miller <davem@davemloft.net>
parent df2c4334
...@@ -33,7 +33,7 @@ ...@@ -33,7 +33,7 @@
* - out of bounds or malformed jumps * - out of bounds or malformed jumps
* The second pass is all possible path descent from the 1st insn. * The second pass is all possible path descent from the 1st insn.
* Since it's analyzing all pathes through the program, the length of the * Since it's analyzing all pathes through the program, the length of the
* analysis is limited to 32k insn, which may be hit even if total number of * analysis is limited to 64k insn, which may be hit even if total number of
* insn is less then 4K, but there are too many branches that change stack/regs. * insn is less then 4K, but there are too many branches that change stack/regs.
* Number of 'branches to be analyzed' is limited to 1k * Number of 'branches to be analyzed' is limited to 1k
* *
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment