Messages in this thread | | | Date | Fri, 1 Oct 2004 16:04:30 -0300 | From | Marcelo Tosatti <> | Subject | Re: [RFC] memory defragmentation to satisfy high order allocations |
| |
On Fri, Oct 01, 2004 at 01:11:47PM -0700, Andrew Morton wrote: > Marcelo Tosatti <marcelo.tosatti@cyclades.com> wrote: > > > > The following patch implements a "coalesce_memory()" function > > which takes "zone" and "order" as a parameter. > > > > It tries to move enough physically nearby pages to form a free area > > of "order" size. > > > > It does that by checking whether the page can be moved, allocating a new page, > > unmapping the pte's to it, copying data to new page, remapping the ptes, > > and reinserting the page on the radix/LRU. > > Presumably this duplicates some of the memory hot-remove patches.
As far as I have researched, the memory moving/remapping code on the hot remove patches dont work correctly. Please correct me.
And what I've seen (from the Fujitsu guys) was quite ugly IMHO.
> Apparently Dave Hansen has working and sane-looking hot remove code > which is in a close-to-submittable state.
Dave? - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |