On Monday 02 October 2006 03:01, Andi Kleen wrote:
> Vadim Lobanov <[email protected]> writes:
> > The allocation algorithm sizes the fdarray in such a way that its memory
> > usage increases in easy page-sized chunks. Additionally, it tries to
> > account for the optimal usage of the allocators involved: kmalloc() for
> > sizes less than a page, and vmalloc() with page granularity for sizes
> > greater than a page.
>
> Best would be to avoid vmalloc() completely because it can be quite
> costly
It's possible. This switch between kmalloc() and vmalloc() was there in the
original code, and I didn't feel safe ripping it out right now. We can always
explore this approach too, however.
What is the origin and history of this particular code? (It's been there since
at least 2.4.x.) Who put in the switch between the two allocators, and for
what reason? Is that reason still valid?
> -Andi
Thanks for the input.
-- Vadim Lobanov
-
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]
