函数逻辑报告 | 
Source Code:kernel\bpf\hashtab.c | 
Create Date:2022-07-27 14:25:38 | 
| Last Modify:2022-05-23 09:15:29 | Copyright©Brick | 
| 首页 | 函数Tree | 
| 注解内核,赢得工具 | 下载SCCT | English | 
函数名称:Called from syscall
函数原型:static int htab_map_get_next_key(struct bpf_map *map, void *key, void *next_key)
返回类型:int
参数:
| 类型 | 参数 | 名称 | 
|---|---|---|
| struct bpf_map * | map | |
| void * | key | |
| void * | next_key | 
| 603 | i等于0 | 
| 605 | WARN_ON_ONCE(!_read_lock_held() - might we be in RCU read-side critical section?* If CONFIG_DEBUG_LOCK_ALLOC is selected, returns nonzero iff in an RCU* read-side critical section) | 
| 609 | 如果非key则转到:find_first_elem | 
| 612 | hash等于htab_map_hash(key, key_size, hashrnd) | 
| 614 | head等于select_bucket(htab, hash) | 
| 617 | l等于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 | 
| 619 | 如果非l则转到:find_first_elem | 
| 623 | next_l等于hlist_nulls_entry_safe(Dependency order vs. p above. (hlist_nulls_next_rcu( & hash_node)), structhtab_elem, hash_node) | 
| 626 | 如果next_l则 | 
| 633 | i等于hash按位与 number of hash buckets 减1 | 
| 634 | i自加 | 
| 636 | find_first_elem : | 
| 638 | 以i小于 number of hash buckets 循环 | 
| 639 | head等于select_bucket(htab, i) | 
| 642 | next_l等于hlist_nulls_entry_safe(Dependency order vs. p above. (hlist_nulls_first_rcu(head)), structhtab_elem, hash_node) | 
| 644 | 如果next_l则 | 
| 652 | 返回:负ENOENT | 
| 源代码转换工具 开放的插件接口  | X | 
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码  |