Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1420192
| From | "Hillf Danton" <hillf.zj@alibaba-inc.com> |
|---|---|
| Newsgroups | linux.kernel |
| Subject | Re: [PATCH 04/27] mm, vmscan: Begin reclaiming pages on a per-node basis |
| Date | 2016-06-12 09:40 +0200 |
| Message-ID | <rJ89X-5KR-1@gated-at.bofh.it> (permalink) |
| References | <rJ89X-5KR-3@gated-at.bofh.it> |
| Organization | linux.* mail to news gateway |
> @@ -3207,15 +3228,14 @@ static int balance_pgdat(pg_data_t *pgdat, int order, int classzone_idx)
> sc.may_writepage = 1;
>
> /*
> - * Now scan the zone in the dma->highmem direction, stopping
> - * at the last zone which needs scanning.
> - *
> - * We do this because the page allocator works in the opposite
> - * direction. This prevents the page allocator from allocating
> - * pages behind kswapd's direction of progress, which would
> - * cause too much scanning of the lower zones.
> + * Continue scanning in the highmem->dma direction stopping at
> + * the last zone which needs scanning. This may reclaim lowmem
> + * pages that are not necessary for zone balancing but it
> + * preserves LRU ordering. It is assumed that the bulk of
> + * allocation requests can use arbitrary zones with the
> + * possible exception of big highmem:lowmem configurations.
> */
> - for (i = 0; i <= end_zone; i++) {
> + for (i = end_zone; i >= end_zone; i--) {
s/i >= end_zone;/i >= 0;/ ?
> struct zone *zone = pgdat->node_zones + i;
>
> if (!populated_zone(zone))
Back to linux.kernel | Previous | Next — Next in thread | Find similar | Unroll thread
Re: [PATCH 04/27] mm, vmscan: Begin reclaiming pages on a per-node basis "Hillf Danton" <hillf.zj@alibaba-inc.com> - 2016-06-12 09:40 +0200 Re: [PATCH 04/27] mm, vmscan: Begin reclaiming pages on a per-node basis Mel Gorman <mgorman@techsingularity.net> - 2016-06-14 16:50 +0200
csiph-web