lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Date:	Fri, 19 Feb 2010 14:33:10 +0000
From:	Mel Gorman <mel@....ul.ie>
To:	Minchan Kim <minchan.kim@...il.com>
Cc:	Andrea Arcangeli <aarcange@...hat.com>,
	Christoph Lameter <cl@...ux-foundation.org>,
	Adam Litke <agl@...ibm.com>, Avi Kivity <avi@...hat.com>,
	David Rientjes <rientjes@...gle.com>,
	KOSAKI Motohiro <kosaki.motohiro@...fujitsu.com>,
	linux-kernel@...r.kernel.org, linux-mm@...ck.org
Subject: Re: [PATCH 05/12] Memory compaction core

On Fri, Feb 19, 2010 at 10:21:10AM +0900, Minchan Kim wrote:
> On Fri, Feb 19, 2010 at 2:34 AM, Mel Gorman <mel@....ul.ie> wrote:
> > On Fri, Feb 19, 2010 at 01:58:44AM +0900, Minchan Kim wrote:
> >> On Fri, 2010-02-12 at 12:00 +0000, Mel Gorman wrote:
> >> > +/* Isolate free pages onto a private freelist. Must hold zone->lock */
> >> > +static int isolate_freepages_block(struct zone *zone,
> >>
> >> return type 'int'?
> >> I think we can't return signed value.
> >>
> >
> > I don't understand your query. What's wrong with returning int?
> 
> It's just nitpick. I mean this functions doesn't return minus value.
> Never mind.
> 
> >
> >> > +                           unsigned long blockpfn,
> >> > +                           struct list_head *freelist)
> >> > +{
> >> > +   unsigned long zone_end_pfn, end_pfn;
> >> > +   int total_isolated = 0;
> >> > +
> >> > +   /* Get the last PFN we should scan for free pages at */
> >> > +   zone_end_pfn = zone->zone_start_pfn + zone->spanned_pages;
> >> > +   end_pfn = blockpfn + pageblock_nr_pages;
> >> > +   if (end_pfn > zone_end_pfn)
> >> > +           end_pfn = zone_end_pfn;
> >> > +
> >> > +   /* Isolate free pages. This assumes the block is valid */
> >> > +   for (; blockpfn < end_pfn; blockpfn++) {
> >> > +           struct page *page;
> >> > +           int isolated, i;
> >> > +
> >> > +           if (!pfn_valid_within(blockpfn))
> >> > +                   continue;
> >> > +
> >> > +           page = pfn_to_page(blockpfn);
> >> > +           if (!PageBuddy(page))
> >> > +                   continue;
> >> > +
> >> > +           /* Found a free page, break it into order-0 pages */
> >> > +           isolated = split_free_page(page);
> >> > +           total_isolated += isolated;
> >> > +           for (i = 0; i < isolated; i++) {
> >> > +                   list_add(&page->lru, freelist);
> >> > +                   page++;
> >> > +           }
> >> > +           blockpfn += isolated - 1;
> >
> > Incidentally, this line is wrong but will be fixed in line 3. If
> > split_free_page() fails, it causes an infinite loop.
> >
> >> > +   }
> >> > +
> >> > +   return total_isolated;
> >> > +}
> >> > +
> >> > +/* Returns 1 if the page is within a block suitable for migration to */
> >> > +static int suitable_migration_target(struct page *page)
> >> > +{
> >> > +   /* If the page is a large free page, then allow migration */
> >> > +   if (PageBuddy(page) && page_order(page) >= pageblock_order)
> >> > +           return 1;
> >> > +
> >> > +   /* If the block is MIGRATE_MOVABLE, allow migration */
> >> > +   if (get_pageblock_migratetype(page) == MIGRATE_MOVABLE)
> >> > +           return 1;
> >> > +
> >> > +   /* Otherwise skip the block */
> >> > +   return 0;
> >> > +}
> >> > +
> >> > +/*
> >> > + * Based on information in the current compact_control, find blocks
> >> > + * suitable for isolating free pages from
> >> > + */
> >> > +static void isolate_freepages(struct zone *zone,
> >> > +                           struct compact_control *cc)
> >> > +{
> >> > +   struct page *page;
> >> > +   unsigned long high_pfn, low_pfn, pfn;
> >> > +   unsigned long flags;
> >> > +   int nr_freepages = cc->nr_freepages;
> >> > +   struct list_head *freelist = &cc->freepages;
> >> > +
> >> > +   pfn = cc->free_pfn;
> >> > +   low_pfn = cc->migrate_pfn + pageblock_nr_pages;
> >> > +   high_pfn = low_pfn;
> >> > +
> >> > +   /*
> >> > +    * Isolate free pages until enough are available to migrate the
> >> > +    * pages on cc->migratepages. We stop searching if the migrate
> >> > +    * and free page scanners meet or enough free pages are isolated.
> >> > +    */
> >> > +   spin_lock_irqsave(&zone->lock, flags);
> >> > +   for (; pfn > low_pfn && cc->nr_migratepages > nr_freepages;
> >> > +                                   pfn -= pageblock_nr_pages) {
> >> > +           int isolated;
> >> > +
> >> > +           if (!pfn_valid(pfn))
> >> > +                   continue;
> >> > +
> >> > +           /* Check for overlapping nodes/zones */
> >> > +           page = pfn_to_page(pfn);
> >> > +           if (page_zone(page) != zone)
> >> > +                   continue;
> >>
> >> We are progressing backward by physical page order in a zone.
> >> If we meet crossover between zone, Why are we going backward
> >> continuously? Before it happens, migration and free scanner would meet.
> >> Am I miss something?
> >>
> >
> > I was considering a situation like the following
> >
> >
> > Node-0     Node-1       Node-0
> > DMA        DMA          DMA
> > 0-1023     1024-2047    2048-4096
> >
> > In that case, a PFN scanner can enter a new node and zone but the migrate
> > and free scanners have not necessarily met. This configuration is *extremely*
> > rare but it happens on messed-up LPAR configurations on POWER.
> 
> I don't know such architecture until now.
> Thanks for telling me.
> How about adding the comment about that?
> 

Sure

> >
> >> > +
> >> > +           /* Check the block is suitable for migration */
> >> > +           if (!suitable_migration_target(page))
> >> > +                   continue;
> >>
> >> Dumb question.
> >> suitable_migration_target considers three type's pages
> >>
> >> 1. free page and page's order >= pageblock_order
> >> 2. free pages and pages's order < pageblock_order with movable page
> >> 3. used page with movable
> >>
> >> I can understand 1 and 2 but can't 3. This function is for gathering
> >> free page. How do you handle used page as free one?
> >>
> >> In addition, as I looked into isolate_freepages_block, it doesn't
> >> consider 3 by PageBuddy check.
> >>
> >> I am confusing. Pz, correct me.
> >>
> >
> > I'm afraid I don't understand your question. At the point
> > suitable_migration_target() is called, the only concern is finding a pageblock
> > of pages that should be scanned for free pages by isolate_freepages_block().
> > What do you mean by "used page with movable" ?
> 
> After I looked into code, I understand it.
> Thanks.
> 
> <snip>
> >>> +/* Similar to split_page except the page is already free */
> >> Sometime, this function changes pages's type to MIGRATE_MOVABLE.
> >> I hope adding comment about that.
> >>
> >
> > There is a comment within the function about it. Do you want it moved to
> > here?
> 
> If you don't mind, I hope so. :)
> 

Done.

> That's because you wrote down only "except the page is already free" in
> function description. So I thought it's only difference with split_page at first
> glance. I think information that setting MIGRATE_MOVABLE is important.
> 
> Pz, thinks it as just nitpick.

No, it's a fair point. I can see how it could trip someone up.

Thanks

-- 
Mel Gorman
Part-time Phd Student                          Linux Technology Center
University of Limerick                         IBM Dublin Software Lab
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ