函数逻辑报告 |
Source Code:include\linux\list.h |
Create Date:2022-07-27 06:38:25 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:检查是否为链表尾
函数原型:static inline int list_is_last(const struct list_head *list, const struct list_head *head)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
const struct list_head * | list | |
const struct list_head * | head |
名称 | 描述 |
---|---|
kunit_resource_test_alloc_resource | |
ddebug_iter_next | Advance the iterator to point to the next _ddebug* object from the one the iterator currently points at,* and returns a pointer to the new _ddebug. Returns* NULL if the iterator has seen all the _ddebugs. |
list_test_list_is_last | |
rtree_next_node | ree_next_node - Jump to the next leaf node.* Set the position to the beginning of the next node in the* memory bitmap. This is either the next node in the current* zone's radix tree or the first node in the radix tree of the* next zone. |
gcov_info_next | gcov_info_next - return next profiling data set*@info: profiling data set* Returns next gcov_info following @info or first gcov_info in the chain if*@info is %NULL. |
gcov_info_is_compatible | gcov_info_is_compatible - check if profiling data can be added*@info1: first profiling data set*@info2: second profiling data set* Returns non-zero if profiling data can be added, zero otherwise. |
send_cpu_listeners | Send taskstats data in @skb to listeners registered for @cpu's exit data |
s_show | |
smk_net4addr_insert | smk_net4addr_insert*@new : netlabel to insert* This helper insert netlabel in the smack_net4addrs list* sorted by netmask length (longest to smallest)* locked by &smk_net4addr_lock in smk_write_net4addr |
smk_net6addr_insert | smk_net6addr_insert*@new : entry to insert* This inserts an entry in the smack_net6addrs list* sorted by netmask length (longest to smallest)* locked by &smk_net6addr_lock in smk_write_net6addr |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |