函数逻辑报告 |
Source Code:kernel\power\snapshot.c |
Create Date:2022-07-27 11:00:49 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称: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.
函数原型:static bool rtree_next_node(struct memory_bitmap *bm)
返回类型:bool
参数:
类型 | 参数 | 名称 |
---|---|---|
struct memory_bitmap * | bm |
847 | 如果非检查是否为链表尾则 |
850 | node_pfn加等于BM_BITS_PER_BLOCK |
851 | node_bit等于0 |
853 | 返回:true |
857 | 如果非检查是否为链表尾则 |
862 | node_pfn等于0 |
863 | node_bit等于0 |
864 | 返回:true |
868 | 返回:false |
名称 | 描述 |
---|---|
memory_bm_next_pfn | memory_bm_rtree_next_pfn - Find the next set bit in a memory bitmap.*@bm: Memory bitmap.* Starting from the last returned position this function searches for the next* set bit in @bm and returns the PFN represented by it. If no more bits are |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |