函数逻辑报告 |
Source Code:mm\vmstat.c |
Create Date:2022-07-27 15:47:07 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：Determine the per node value of a stat item.
函数原型：unsigned long node_page_state(struct pglist_data *pgdat, enum node_stat_item item)
返回类型：unsigned long
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| struct pglist_data * | pgdat | |
| enum node_stat_item | item |
| 995 | x等于atomic_long_read( & vm_stat[item]) |
| 1000 | 返回:x |
| 名称 | 描述 |
|---|---|
| node_dirtyable_memory | de_dirtyable_memory - number of dirtyable pages in a node*@pgdat: the node* Return: the node's number of pages potentially available for dirty* page cache. This is the base value for the per-node dirty limits. |
| node_dirty_ok | de_dirty_ok - tells whether a node is within its dirty limits*@pgdat: the node to check* Return: %true when the dirty pages in @pgdat are within the node's* dirty limit, %false if the limit is exceeded. |
| too_many_isolated | A direct reclaimer may isolate SWAP_CLUSTER_MAX pages from the LRU list and* then get rescheduled |
| should_continue_reclaim | Reclaim/compaction is used for high-order allocation requests. It reclaims* order-0 pages before compacting the zone. should_continue_reclaim() returns* true if more pages should be reclaimed such that when the page allocator |
| shrink_node | |
| node_unmapped_file_pages | |
| node_pagecache_reclaimable | Work out how many page cache pages we can reclaim in this reclaim_mode |
| node_reclaim | |
| zoneinfo_show_print | |
| too_many_isolated | Similar to reclaim, but different enough that they don't share logic |
| si_meminfo_node | |
| show_free_areas | Show free area list (used inside shift_scroll-lock stuff)* We also calculate the percentage fragmentation |
| lruvec_page_state | |
| lruvec_page_state_local |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |