diff options
| author | Daniel Borkmann <daniel@iogearbox.net> | 2019-05-24 02:46:26 +0300 |
|---|---|---|
| committer | Daniel Borkmann <daniel@iogearbox.net> | 2019-05-24 02:46:31 +0300 |
| commit | 5762a20b11ef261ae8436868555fab4340cb3ca0 (patch) | |
| tree | e4715aaacbb75b910f1ff7c57f071fa5efec6aa4 /include | |
| parent | 29c677c86a15fadcf85f072f75d88ce37ceac452 (diff) | |
| parent | dc2a4ebc0b44a212fcf72242210e56aa17e7317b (diff) | |
| download | linux-5762a20b11ef261ae8436868555fab4340cb3ca0.tar.xz | |
Merge branch 'bpf-explored-states'
Alexei Starovoitov says:
====================
Convert explored_states array into hash table and use simple hash
to reduce verifier peak memory consumption for programs with bpf2bpf
calls. More details in patch 3.
v1->v2: fixed Jakub's small nit in patch 1
====================
Acked-by: Andrii Nakryiko <andriin@fb.com>
Signed-off-by: Daniel Borkmann <daniel@iogearbox.net>
Diffstat (limited to 'include')
| -rw-r--r-- | include/linux/bpf_verifier.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/include/linux/bpf_verifier.h b/include/linux/bpf_verifier.h index 1305ccbd8fe6..405b502283c5 100644 --- a/include/linux/bpf_verifier.h +++ b/include/linux/bpf_verifier.h @@ -187,6 +187,7 @@ struct bpf_func_state { struct bpf_verifier_state { /* call stack tracking */ struct bpf_func_state *frame[MAX_CALL_FRAMES]; + u32 insn_idx; u32 curframe; u32 active_spin_lock; bool speculative; @@ -233,6 +234,7 @@ struct bpf_insn_aux_data { int sanitize_stack_off; /* stack slot to be cleared */ bool seen; /* this insn was processed by the verifier */ u8 alu_state; /* used in combination with alu_limit */ + bool prune_point; unsigned int orig_idx; /* original instruction index */ }; |