[PATCH 25/27] mm: page_alloc: Cache the last node whose dirty limit is reached

If a page is about to be dirtied then the page allocator attempts to limit the total number of dirty pages that exists in any given zone. The call to node_dirty_ok is expensive so this patch records if the last pgdat examined hit the dirty limits. In some cases, this reduces the number of calls to

Re: [PATCH 25/27] mm: page_alloc: Cache the last node whose dirty limit is reached

On 06/09/2016 08:04 PM, Mel Gorman wrote: If a page is about to be dirtied then the page allocator attempts to limit the total number of dirty pages that exists in any given zone. The call to node_dirty_ok is expensive so this patch records if the last pgdat examined hit the dirty limits. In some

[PATCH 25/27] mm: page_alloc: Cache the last node whose dirty limit is reached

If a page is about to be dirtied then the page allocator attempts to limit the total number of dirty pages that exists in any given zone. The call to node_dirty_ok is expensive so this patch records if the last pgdat examined hit the dirty limits. In some cases, this reduces the number of calls to

[PATCH 25/27] mm: page_alloc: Cache the last node whose dirty limit is reached

If a page is about to be dirtied then the page allocator attempts to limit the total number of dirty pages that exists in any given zone. The call to node_dirty_ok is expensive so this patch records if the last pgdat examined hit the dirty limits. In some cases, this reduces the number of calls to

[PATCH 25/27] mm: page_alloc: Cache the last node whose dirty limit is reached

If a page is about to be dirtied then the page allocator attempts to limit the total number of dirty pages that exists in any given zone. The call to node_dirty_ok is expensive so this patch records if the last pgdat examined hit the dirty limits. In some cases, this reduces the number of calls to