summaryrefslogtreecommitdiff
path: root/mm/page_alloc.c
diff options
context:
space:
mode:
authorMel Gorman <mel@csn.ul.ie>2009-06-16 15:32:06 -0700
committerLinus Torvalds <torvalds@linux-foundation.org>2009-06-16 19:47:34 -0700
commit0ac3a4099b0171ff965836182bc688bb8ca01058 (patch)
treed216b1adff4b9c9ef99cb5187d22b4a91bc7dca7 /mm/page_alloc.c
parent0a15c3e9f649f71464ac39e6378f1fde6f995322 (diff)
downloadlinux-rpi-0ac3a4099b0171ff965836182bc688bb8ca01058.tar.gz
linux-rpi-0ac3a4099b0171ff965836182bc688bb8ca01058.tar.bz2
linux-rpi-0ac3a4099b0171ff965836182bc688bb8ca01058.zip
page allocator: inline __rmqueue_fallback()
__rmqueue_fallback() is in the slow path but has only one call site. Because there is only one call-site, this function can then be inlined without causing text bloat. On an x86-based config, it made no difference as the savings were padded out by NOP instructions. Milage varies but text will either decrease in size or remain static. Signed-off-by: Mel Gorman <mel@csn.ul.ie> Cc: Christoph Lameter <cl@linux-foundation.org> Cc: KOSAKI Motohiro <kosaki.motohiro@jp.fujitsu.com> Cc: Pekka Enberg <penberg@cs.helsinki.fi> Cc: Peter Zijlstra <a.p.zijlstra@chello.nl> Cc: Nick Piggin <nickpiggin@yahoo.com.au> Cc: Dave Hansen <dave@linux.vnet.ibm.com> Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'mm/page_alloc.c')
-rw-r--r--mm/page_alloc.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/mm/page_alloc.c b/mm/page_alloc.c
index c101921e6a64..91e29b3ed2b6 100644
--- a/mm/page_alloc.c
+++ b/mm/page_alloc.c
@@ -771,8 +771,8 @@ static int move_freepages_block(struct zone *zone, struct page *page,
}
/* Remove an element from the buddy allocator from the fallback list */
-static struct page *__rmqueue_fallback(struct zone *zone, int order,
- int start_migratetype)
+static inline struct page *
+__rmqueue_fallback(struct zone *zone, int order, int start_migratetype)
{
struct free_area * area;
int current_order;