函数逻辑报告 |
Source Code:include\linux\rbtree_latch.h |
Create Date:2022-07-27 06:49:17 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:__lt_find
函数原型:static __always_inline struct latch_tree_node *__lt_find(void *key, struct latch_tree_root *ltr, int idx, int (*comp)(void *key, struct latch_tree_node *node))
返回类型:struct latch_tree_node
参数:
类型 | 参数 | 名称 |
---|---|---|
void * | key | |
struct latch_tree_root * | ltr | |
int | idx | |
int (* | comp |
114 | ltn等于__lt_from_rb(node, idx) |
117 | 如果c小于0则node等于Dependency order vs. p above. (rb_left) |
119 | 否则如果c大于0则node等于Dependency order vs. p above. (rb_right) |
121 | 否则返回:ltn |
125 | 返回:NULL |
名称 | 描述 |
---|---|
latch_tree_find | latch_tree_find() - find the node matching @key in the trees @root*@key: search key*@root: trees to search for @key*@ops: operators defining the node order* Does a lockless lookup in the trees @root for the node matching @key |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |