![]() | |||||||||||||
Messages in this thread |
On Sat, 2002-10-26 at 20:22, Manfred Spraul wrote: > kmalloc spends a large part of the total execution time trying to find > the cache for the passed in size. > > What about the attached patch (against 2.5.44-mm5)? > It uses fls jump over the caches that are definitively too small. Out of curiousity how does fls compare with finding the right cache by using a binary tree walk ? A lot of platforms seem to use generic_fls which has a lot of conditions in it and also a lot of references to just computed values that look likely to stall - 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/ | ||||||||||||
| Last update: 2005-03-22 12:30 [W:0.461 / U:0.180 seconds] ©2003-2008 Jasper Spaans | |||||||||||||