函数逻辑报告 |
Source Code:kernel\bpf\hashtab.c |
Create Date:2022-07-27 14:25:20 |
Last Modify:2022-05-23 09:15:29 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:an be called without bucket lock. it will repeat the loop in* the unlikely event when elements moved from one bucket into another* while link list is being walked
函数原型:static struct htab_elem *lookup_nulls_elem_raw(struct hlist_nulls_head *head, u32 hash, void *key, u32 key_size, u32 n_buckets)
返回类型:struct htab_elem
参数:
类型 | 参数 | 名称 |
---|---|---|
struct hlist_nulls_head * | head | |
u32 | hash | |
void * | key | |
u32 | key_size | |
u32 | n_buckets |
445 | again : |
450 | 如果此条件成立可能性小(为编译器优化)(得到链尾空值 != (hash & (n_buckets - 1)))则转到:again |
453 | 返回:NULL |
名称 | 描述 |
---|---|
__htab_map_lookup_elem | Called from syscall or from eBPF program directly, so* arguments have to match bpf_map_lookup_elem() exactly.* The return value is adjusted by BPF instructions* in htab_map_gen_lookup(). |
htab_map_get_next_key | Called from syscall |
htab_map_update_elem | Called from syscall or from eBPF program |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |