Function report |
Source Code:mm\vmscan.c |
Create Date:2022-07-28 14:19:04 |
Last Modify:2022-05-23 13:41:30 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name: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
Proto:static inline bool should_continue_reclaim(struct pglist_data *pgdat, unsigned long nr_reclaimed, struct scan_control *sc)
Type:bool
Parameter:
Type | Parameter | Name |
---|---|---|
struct pglist_data * | pgdat | |
unsigned long | nr_reclaimed | |
struct scan_control * | sc |
2599 | If Not Use reclaim/compaction for costly allocs or under memory pressure Then Return false |
2612 | If Not nr_reclaimed Then Return false |
2616 | When z <= The highest zone to isolate pages for reclaim from cycle |
2617 | zone = node_zones[z] |
2622 | Case compaction_suitable(zone, Allocation order , 0, The highest zone to isolate pages for reclaim from ) == COMPACT_SUCCESS |
2624 | Return false |
2625 | Default |
2637 | If get_nr_swap_pages() > 0 Then inactive_lru_pages += node_page_state(pgdat, NR_INACTIVE_ANON) |
2640 | Return inactive_lru_pages > pages_for_compaction |
Name | Describe |
---|---|
shrink_node |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |