On Thu, 13 Sep 2007, Mel Gorman wrote:
> Surely, we'll be able to detect the situation where the memory is really
> contiguous as a fast path and have a slower path where fragmentation was
> a problem.
Yes I have a draft here now of a virtual compound page solution that I am
testing with SLUB. Page allocator first tries to allocate a contiguous
page. If that is not possible then we string together a contiguous page
through order 0 allocs and vmalloc.
> The only implementation question about these patches that hasn't been addressed
> is the mmap() support. What's wrong with it in it's current form. Can it be
> fixed or if it's fundamentally screwed etc. That has fallen by the
> wayside.
Yes I have not heard about those. Got some more ideas how to clean it up
even more in the meantime. No feedback usually means no objections.....
> I am *very* wary of using reserve pools for anything other than
> emergency situations. If nothing else pools == wasted memory + a sizing
> problem. But hey, it is one option.
Well we need the page pools anyways for large page sizes > MAX_ORDER. But
> Are we going to agree on some sort of plan or are we just going to
> handwave ourselves to death?
Ill try to do the virtual mapped compound pages. Hopefully that will
allow fallback for compound pages in a generic way.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
