函数逻辑报告 |
Source Code:include\asm-generic\pgtable.h |
Create Date:2022-07-27 06:58:57 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：Some architectures may be able to avoid expensive synchronization* primitives when modifications are made to PTE's which are already* not present, or in the process of an address space destruction.
函数原型：static inline void pte_clear_not_present_full(struct mm_struct *mm, unsigned long address, pte_t *ptep, int full)
返回类型：void
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| struct mm_struct * | mm | |
| unsigned long | address | |
| pte_t * | ptep | |
| int | full |
| 名称 | 描述 |
|---|---|
| zap_pte_range | |
| madvise_free_pte_range |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |