Function report |
Source Code:kernel\bpf\verifier.c |
Create Date:2022-07-28 12:56:28 |
Last Modify:2022-05-19 20:02:10 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:push_stack
Proto:static struct bpf_verifier_state *push_stack(struct bpf_verifier_env *env, int insn_idx, int prev_insn_idx, bool speculative)
Type:struct bpf_verifier_state
Parameter:
Type | Parameter | Name |
---|---|---|
struct bpf_verifier_env * | env | |
int | insn_idx | |
int | prev_insn_idx | |
bool | speculative |
862 | cur = current verifier state |
866 | elem = kzalloc - allocate memory. The memory is set to zero.*@size: how many bytes of memory are required.*@flags: the type of memory to allocate (see kmalloc). |
871 | prev_insn_idx = prev_insn_idx |
875 | err = copy_verifier_state( & verifer state is 'st'* before processing instruction 'insn_idx'* and after processing instruction 'prev_insn_idx', cur) |
878 | speculative |= speculative |
879 | If umber of states to be processed > BPF_COMPLEXITY_LIMIT_JMP_SEQ Then |
880 | verbose(env, "The sequence of %d jumps is too complex.\n", umber of states to be processed ) |
882 | Go to err |
884 | If parent Then |
897 | err : |
898 | free_verifier_state(current verifier state , true) |
899 | current verifier state = NULL |
902 | Return NULL |
Name | Describe |
---|---|
sanitize_ptr_alu | |
check_cond_jmp_op |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |