函数逻辑报告 |
Source Code:kernel\bpf\verifier.c |
Create Date:2022-07-27 14:11:26 |
| Last Modify:2022-05-19 20:02:10 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:heck read/write into a map element with possible variable offset
函数原型:static int check_map_access(struct bpf_verifier_env *env, u32 regno, int off, int size, bool zero_size_allowed)
返回类型:int
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct bpf_verifier_env * | env | |
| u32 | regno | |
| int | off | |
| int | size | |
| bool | zero_size_allowed |
| 2237 | vstate等于current verifier state |
| 2238 | state等于 call stack tracking [curframe] |
| 2246 | 如果level按位与BPF_LOG_LEVEL则print_verifier_state(env, state) |
| 2255 | 如果 minimum possible (s64)value 小于0且 minimum possible (s64)value 恒等于S64_MIN或off加 minimum possible (s64)value 不等于off加 minimum possible (s64)value 或 minimum possible (s64)value 加off小于0的值则 |
| 2259 | verbose(env, "R%d min value is negative, either use unsigned index or do a if (index >=0) check.\n", regno) |
| 2261 | 返回:负EACCES |
| 2265 | 如果err则 |
| 2276 | verbose(env, "R%d unbounded memory access, make sure to bounds check any array access into a map\n", regno) |
| 2278 | 返回:负EACCES |
| 2287 | lock等于 >=0 valid offset, <0 error |
| 2294 | 如果 minimum possible (s64)value 加off小于lock加sizeof(structbpf_spin_lock)且lock小于 maximum possible (u64)value 加off加size则 |
| 2300 | 返回:err |
| 名称 | 描述 |
|---|---|
| check_mem_access | heck whether memory at (regno + off) is accessible for t = (read | write)* if t==write, value_regno is a register which value is stored into memory* if t==read, value_regno is a register which will receive the value from memory* if t==write && |
| check_helper_mem_access | |
| adjust_ptr_min_max_vals | Handles arithmetic on a pointer and a scalar: computes new min/max and var_off.* Caller should also handle BPF_MOV case separately.* If we return -EACCES, caller may want to try again treating pointer as a* scalar |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |