diff options
author | Akinobu Mita <akinobu.mita@gmail.com> | 2007-05-06 17:50:19 -0400 |
---|---|---|
committer | Linus Torvalds <torvalds@woody.linux-foundation.org> | 2007-05-07 15:12:57 -0400 |
commit | 4ab688c51226188f2d4ad4f789032c107944ef89 (patch) | |
tree | f0793bf529ada8da81a764766996db90073a020f /mm/slob.c | |
parent | 5bc98594d59672303c4c9c07262ecc373dc374da (diff) |
slob: fix page order calculation on not 4KB page
SLOB doesn't calculate correct page order when page size is not 4KB. This
patch fixes it with using get_order() instead of find_order() which is SLOB
version of get_order().
Signed-off-by: Akinobu Mita <akinobu.mita@gmail.com>
Acked-by: Matt Mackall <mpm@selenic.com>
Cc: <stable@kernel.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'mm/slob.c')
-rw-r--r-- | mm/slob.c | 15 |
1 files changed, 3 insertions, 12 deletions
@@ -150,15 +150,6 @@ static void slob_free(void *block, int size) | |||
150 | spin_unlock_irqrestore(&slob_lock, flags); | 150 | spin_unlock_irqrestore(&slob_lock, flags); |
151 | } | 151 | } |
152 | 152 | ||
153 | static int FASTCALL(find_order(int size)); | ||
154 | static int fastcall find_order(int size) | ||
155 | { | ||
156 | int order = 0; | ||
157 | for ( ; size > 4096 ; size >>=1) | ||
158 | order++; | ||
159 | return order; | ||
160 | } | ||
161 | |||
162 | void *__kmalloc(size_t size, gfp_t gfp) | 153 | void *__kmalloc(size_t size, gfp_t gfp) |
163 | { | 154 | { |
164 | slob_t *m; | 155 | slob_t *m; |
@@ -174,7 +165,7 @@ void *__kmalloc(size_t size, gfp_t gfp) | |||
174 | if (!bb) | 165 | if (!bb) |
175 | return 0; | 166 | return 0; |
176 | 167 | ||
177 | bb->order = find_order(size); | 168 | bb->order = get_order(size); |
178 | bb->pages = (void *)__get_free_pages(gfp, bb->order); | 169 | bb->pages = (void *)__get_free_pages(gfp, bb->order); |
179 | 170 | ||
180 | if (bb->pages) { | 171 | if (bb->pages) { |
@@ -318,7 +309,7 @@ void *kmem_cache_alloc(struct kmem_cache *c, gfp_t flags) | |||
318 | if (c->size < PAGE_SIZE) | 309 | if (c->size < PAGE_SIZE) |
319 | b = slob_alloc(c->size, flags, c->align); | 310 | b = slob_alloc(c->size, flags, c->align); |
320 | else | 311 | else |
321 | b = (void *)__get_free_pages(flags, find_order(c->size)); | 312 | b = (void *)__get_free_pages(flags, get_order(c->size)); |
322 | 313 | ||
323 | if (c->ctor) | 314 | if (c->ctor) |
324 | c->ctor(b, c, SLAB_CTOR_CONSTRUCTOR); | 315 | c->ctor(b, c, SLAB_CTOR_CONSTRUCTOR); |
@@ -345,7 +336,7 @@ void kmem_cache_free(struct kmem_cache *c, void *b) | |||
345 | if (c->size < PAGE_SIZE) | 336 | if (c->size < PAGE_SIZE) |
346 | slob_free(b, c->size); | 337 | slob_free(b, c->size); |
347 | else | 338 | else |
348 | free_pages((unsigned long)b, find_order(c->size)); | 339 | free_pages((unsigned long)b, get_order(c->size)); |
349 | } | 340 | } |
350 | EXPORT_SYMBOL(kmem_cache_free); | 341 | EXPORT_SYMBOL(kmem_cache_free); |
351 | 342 | ||