函数逻辑报告 |
Source Code:mm\internal.h |
Create Date:2022-07-27 07:09:07 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：Locate the struct page for both the matching buddy in our* pair (buddy1) and the combined O(n+1) page they form (page)
函数原型：static inline unsigned long __find_buddy_pfn(unsigned long page_pfn, unsigned int order)
返回类型：unsigned long
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| unsigned long | page_pfn | |
| unsigned int | order |
| 名称 | 描述 |
|---|---|
| __free_one_page | Freeing function for a buddy system allocator |
| prefetch_buddy | |
| unset_migratetype_isolate |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |