Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * linux/mm/page_alloc.c |
| 3 | * |
| 4 | * Manages the free list, the system allocates free pages here. |
| 5 | * Note that kmalloc() lives in slab.c |
| 6 | * |
| 7 | * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds |
| 8 | * Swap reorganised 29.12.95, Stephen Tweedie |
| 9 | * Support of BIGMEM added by Gerhard Wichert, Siemens AG, July 1999 |
| 10 | * Reshaped it to be a zoned allocator, Ingo Molnar, Red Hat, 1999 |
| 11 | * Discontiguous memory support, Kanoj Sarcar, SGI, Nov 1999 |
| 12 | * Zone balancing, Kanoj Sarcar, SGI, Jan 2000 |
| 13 | * Per cpu hot/cold page lists, bulk allocation, Martin J. Bligh, Sept 2002 |
| 14 | * (lots of bits borrowed from Ingo Molnar & Andrew Morton) |
| 15 | */ |
| 16 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 17 | #include <linux/stddef.h> |
| 18 | #include <linux/mm.h> |
| 19 | #include <linux/swap.h> |
| 20 | #include <linux/interrupt.h> |
| 21 | #include <linux/pagemap.h> |
| 22 | #include <linux/bootmem.h> |
| 23 | #include <linux/compiler.h> |
Randy Dunlap | 9f15833 | 2005-09-13 01:25:16 -0700 | [diff] [blame] | 24 | #include <linux/kernel.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 25 | #include <linux/module.h> |
| 26 | #include <linux/suspend.h> |
| 27 | #include <linux/pagevec.h> |
| 28 | #include <linux/blkdev.h> |
| 29 | #include <linux/slab.h> |
| 30 | #include <linux/notifier.h> |
| 31 | #include <linux/topology.h> |
| 32 | #include <linux/sysctl.h> |
| 33 | #include <linux/cpu.h> |
| 34 | #include <linux/cpuset.h> |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 35 | #include <linux/memory_hotplug.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 36 | #include <linux/nodemask.h> |
| 37 | #include <linux/vmalloc.h> |
Christoph Lameter | 4be38e3 | 2006-01-06 00:11:17 -0800 | [diff] [blame] | 38 | #include <linux/mempolicy.h> |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 39 | #include <linux/stop_machine.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 40 | |
| 41 | #include <asm/tlbflush.h> |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 42 | #include <asm/div64.h> |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 43 | #include "internal.h" |
| 44 | |
| 45 | /* |
| 46 | * MCD - HACK: Find somewhere to initialize this EARLY, or make this |
| 47 | * initializer cleaner |
| 48 | */ |
Christoph Lameter | c3d8c14 | 2005-09-06 15:16:33 -0700 | [diff] [blame] | 49 | nodemask_t node_online_map __read_mostly = { { [0] = 1UL } }; |
Dean Nelson | 7223a93 | 2005-03-23 19:00:00 -0700 | [diff] [blame] | 50 | EXPORT_SYMBOL(node_online_map); |
Christoph Lameter | c3d8c14 | 2005-09-06 15:16:33 -0700 | [diff] [blame] | 51 | nodemask_t node_possible_map __read_mostly = NODE_MASK_ALL; |
Dean Nelson | 7223a93 | 2005-03-23 19:00:00 -0700 | [diff] [blame] | 52 | EXPORT_SYMBOL(node_possible_map); |
Ravikiran G Thirumalai | 6c231b7 | 2005-09-06 15:17:45 -0700 | [diff] [blame] | 53 | unsigned long totalram_pages __read_mostly; |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 54 | unsigned long totalreserve_pages __read_mostly; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 55 | long nr_swap_pages; |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 56 | int percpu_pagelist_fraction; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 57 | |
Hugh Dickins | d98c7a0 | 2006-02-14 13:52:59 -0800 | [diff] [blame] | 58 | static void __free_pages_ok(struct page *page, unsigned int order); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 59 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 60 | /* |
| 61 | * results with 256, 32 in the lowmem_reserve sysctl: |
| 62 | * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high) |
| 63 | * 1G machine -> (16M dma, 784M normal, 224M high) |
| 64 | * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA |
| 65 | * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL |
| 66 | * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA |
Andi Kleen | a2f1b42 | 2005-11-05 17:25:53 +0100 | [diff] [blame] | 67 | * |
| 68 | * TBD: should special case ZONE_DMA32 machines here - in those we normally |
| 69 | * don't need any ZONE_NORMAL reservation |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 70 | */ |
Andi Kleen | a2f1b42 | 2005-11-05 17:25:53 +0100 | [diff] [blame] | 71 | int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = { 256, 256, 32 }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 72 | |
| 73 | EXPORT_SYMBOL(totalram_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 74 | |
| 75 | /* |
| 76 | * Used by page_zone() to look up the address of the struct zone whose |
| 77 | * id is encoded in the upper bits of page->flags |
| 78 | */ |
Christoph Lameter | c3d8c14 | 2005-09-06 15:16:33 -0700 | [diff] [blame] | 79 | struct zone *zone_table[1 << ZONETABLE_SHIFT] __read_mostly; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 80 | EXPORT_SYMBOL(zone_table); |
| 81 | |
Andi Kleen | a2f1b42 | 2005-11-05 17:25:53 +0100 | [diff] [blame] | 82 | static char *zone_names[MAX_NR_ZONES] = { "DMA", "DMA32", "Normal", "HighMem" }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 83 | int min_free_kbytes = 1024; |
| 84 | |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 85 | unsigned long __meminitdata nr_kernel_pages; |
| 86 | unsigned long __meminitdata nr_all_pages; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 87 | |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 88 | #ifdef CONFIG_DEBUG_VM |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 89 | static int page_outside_zone_boundaries(struct zone *zone, struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 90 | { |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 91 | int ret = 0; |
| 92 | unsigned seq; |
| 93 | unsigned long pfn = page_to_pfn(page); |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 94 | |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 95 | do { |
| 96 | seq = zone_span_seqbegin(zone); |
| 97 | if (pfn >= zone->zone_start_pfn + zone->spanned_pages) |
| 98 | ret = 1; |
| 99 | else if (pfn < zone->zone_start_pfn) |
| 100 | ret = 1; |
| 101 | } while (zone_span_seqretry(zone, seq)); |
| 102 | |
| 103 | return ret; |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 104 | } |
| 105 | |
| 106 | static int page_is_consistent(struct zone *zone, struct page *page) |
| 107 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 108 | #ifdef CONFIG_HOLES_IN_ZONE |
| 109 | if (!pfn_valid(page_to_pfn(page))) |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 110 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 111 | #endif |
| 112 | if (zone != page_zone(page)) |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 113 | return 0; |
| 114 | |
| 115 | return 1; |
| 116 | } |
| 117 | /* |
| 118 | * Temporary debugging check for pages not lying within a given zone. |
| 119 | */ |
| 120 | static int bad_range(struct zone *zone, struct page *page) |
| 121 | { |
| 122 | if (page_outside_zone_boundaries(zone, page)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 123 | return 1; |
Dave Hansen | c6a57e1 | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 124 | if (!page_is_consistent(zone, page)) |
| 125 | return 1; |
| 126 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 127 | return 0; |
| 128 | } |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 129 | #else |
| 130 | static inline int bad_range(struct zone *zone, struct page *page) |
| 131 | { |
| 132 | return 0; |
| 133 | } |
| 134 | #endif |
| 135 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 136 | static void bad_page(struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 137 | { |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 138 | printk(KERN_EMERG "Bad page state in process '%s'\n" |
Hugh Dickins | 7365f3d1 | 2006-01-11 12:17:18 -0800 | [diff] [blame] | 139 | KERN_EMERG "page:%p flags:0x%0*lx mapping:%p mapcount:%d count:%d\n" |
| 140 | KERN_EMERG "Trying to fix it up, but a reboot is needed\n" |
| 141 | KERN_EMERG "Backtrace:\n", |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 142 | current->comm, page, (int)(2*sizeof(unsigned long)), |
| 143 | (unsigned long)page->flags, page->mapping, |
| 144 | page_mapcount(page), page_count(page)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 145 | dump_stack(); |
Hugh Dickins | 334795e | 2005-06-21 17:15:08 -0700 | [diff] [blame] | 146 | page->flags &= ~(1 << PG_lru | |
| 147 | 1 << PG_private | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 148 | 1 << PG_locked | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 149 | 1 << PG_active | |
| 150 | 1 << PG_dirty | |
Hugh Dickins | 334795e | 2005-06-21 17:15:08 -0700 | [diff] [blame] | 151 | 1 << PG_reclaim | |
| 152 | 1 << PG_slab | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 153 | 1 << PG_swapcache | |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 154 | 1 << PG_writeback | |
| 155 | 1 << PG_buddy ); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 156 | set_page_count(page, 0); |
| 157 | reset_page_mapcount(page); |
| 158 | page->mapping = NULL; |
Randy Dunlap | 9f15833 | 2005-09-13 01:25:16 -0700 | [diff] [blame] | 159 | add_taint(TAINT_BAD_PAGE); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 160 | } |
| 161 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 162 | /* |
| 163 | * Higher-order pages are called "compound pages". They are structured thusly: |
| 164 | * |
| 165 | * The first PAGE_SIZE page is called the "head page". |
| 166 | * |
| 167 | * The remaining PAGE_SIZE pages are called "tail pages". |
| 168 | * |
| 169 | * All pages have PG_compound set. All pages have their ->private pointing at |
| 170 | * the head page (even the head page has this). |
| 171 | * |
Hugh Dickins | 41d78ba | 2006-02-14 13:52:58 -0800 | [diff] [blame] | 172 | * The first tail page's ->lru.next holds the address of the compound page's |
| 173 | * put_page() function. Its ->lru.prev holds the order of allocation. |
| 174 | * This usage means that zero-order pages may not be compound. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 175 | */ |
Hugh Dickins | d98c7a0 | 2006-02-14 13:52:59 -0800 | [diff] [blame] | 176 | |
| 177 | static void free_compound_page(struct page *page) |
| 178 | { |
| 179 | __free_pages_ok(page, (unsigned long)page[1].lru.prev); |
| 180 | } |
| 181 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 182 | static void prep_compound_page(struct page *page, unsigned long order) |
| 183 | { |
| 184 | int i; |
| 185 | int nr_pages = 1 << order; |
| 186 | |
Hugh Dickins | d98c7a0 | 2006-02-14 13:52:59 -0800 | [diff] [blame] | 187 | page[1].lru.next = (void *)free_compound_page; /* set dtor */ |
Hugh Dickins | 41d78ba | 2006-02-14 13:52:58 -0800 | [diff] [blame] | 188 | page[1].lru.prev = (void *)order; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 189 | for (i = 0; i < nr_pages; i++) { |
| 190 | struct page *p = page + i; |
| 191 | |
Nick Piggin | 5e9dace | 2006-03-22 00:08:01 -0800 | [diff] [blame] | 192 | __SetPageCompound(p); |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 193 | set_page_private(p, (unsigned long)page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 194 | } |
| 195 | } |
| 196 | |
| 197 | static void destroy_compound_page(struct page *page, unsigned long order) |
| 198 | { |
| 199 | int i; |
| 200 | int nr_pages = 1 << order; |
| 201 | |
Hugh Dickins | 41d78ba | 2006-02-14 13:52:58 -0800 | [diff] [blame] | 202 | if (unlikely((unsigned long)page[1].lru.prev != order)) |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 203 | bad_page(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 204 | |
| 205 | for (i = 0; i < nr_pages; i++) { |
| 206 | struct page *p = page + i; |
| 207 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 208 | if (unlikely(!PageCompound(p) | |
| 209 | (page_private(p) != (unsigned long)page))) |
| 210 | bad_page(page); |
Nick Piggin | 5e9dace | 2006-03-22 00:08:01 -0800 | [diff] [blame] | 211 | __ClearPageCompound(p); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 212 | } |
| 213 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 214 | |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 215 | static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags) |
| 216 | { |
| 217 | int i; |
| 218 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 219 | VM_BUG_ON((gfp_flags & (__GFP_WAIT | __GFP_HIGHMEM)) == __GFP_HIGHMEM); |
Andrew Morton | 6626c5d | 2006-03-22 00:08:42 -0800 | [diff] [blame] | 220 | /* |
| 221 | * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO |
| 222 | * and __GFP_HIGHMEM from hard or soft interrupt context. |
| 223 | */ |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 224 | VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt()); |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 225 | for (i = 0; i < (1 << order); i++) |
| 226 | clear_highpage(page + i); |
| 227 | } |
| 228 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 229 | /* |
| 230 | * function for dealing with page's order in buddy system. |
| 231 | * zone->lock is already acquired when we use these. |
| 232 | * So, we don't need atomic page->flags operations here. |
| 233 | */ |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 234 | static inline unsigned long page_order(struct page *page) |
| 235 | { |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 236 | return page_private(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 237 | } |
| 238 | |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 239 | static inline void set_page_order(struct page *page, int order) |
| 240 | { |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 241 | set_page_private(page, order); |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 242 | __SetPageBuddy(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 243 | } |
| 244 | |
| 245 | static inline void rmv_page_order(struct page *page) |
| 246 | { |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 247 | __ClearPageBuddy(page); |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 248 | set_page_private(page, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 249 | } |
| 250 | |
| 251 | /* |
| 252 | * Locate the struct page for both the matching buddy in our |
| 253 | * pair (buddy1) and the combined O(n+1) page they form (page). |
| 254 | * |
| 255 | * 1) Any buddy B1 will have an order O twin B2 which satisfies |
| 256 | * the following equation: |
| 257 | * B2 = B1 ^ (1 << O) |
| 258 | * For example, if the starting buddy (buddy2) is #8 its order |
| 259 | * 1 buddy is #10: |
| 260 | * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10 |
| 261 | * |
| 262 | * 2) Any buddy B will have an order O+1 parent P which |
| 263 | * satisfies the following equation: |
| 264 | * P = B & ~(1 << O) |
| 265 | * |
Andreas Mohr | d6e05ed | 2006-06-26 18:35:02 +0200 | [diff] [blame] | 266 | * Assumption: *_mem_map is contiguous at least up to MAX_ORDER |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 267 | */ |
| 268 | static inline struct page * |
| 269 | __page_find_buddy(struct page *page, unsigned long page_idx, unsigned int order) |
| 270 | { |
| 271 | unsigned long buddy_idx = page_idx ^ (1 << order); |
| 272 | |
| 273 | return page + (buddy_idx - page_idx); |
| 274 | } |
| 275 | |
| 276 | static inline unsigned long |
| 277 | __find_combined_index(unsigned long page_idx, unsigned int order) |
| 278 | { |
| 279 | return (page_idx & ~(1 << order)); |
| 280 | } |
| 281 | |
| 282 | /* |
| 283 | * This function checks whether a page is free && is the buddy |
| 284 | * we can do coalesce a page and its buddy if |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 285 | * (a) the buddy is not in a hole && |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 286 | * (b) the buddy is in the buddy system && |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 287 | * (c) a page and its buddy have the same order && |
| 288 | * (d) a page and its buddy are in the same zone. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 289 | * |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 290 | * For recording whether a page is in the buddy system, we use PG_buddy. |
| 291 | * Setting, clearing, and testing PG_buddy is serialized by zone->lock. |
| 292 | * |
| 293 | * For recording page's order, we use page_private(page). |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 294 | */ |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 295 | static inline int page_is_buddy(struct page *page, struct page *buddy, |
| 296 | int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 297 | { |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 298 | #ifdef CONFIG_HOLES_IN_ZONE |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 299 | if (!pfn_valid(page_to_pfn(buddy))) |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 300 | return 0; |
| 301 | #endif |
| 302 | |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 303 | if (page_zone_id(page) != page_zone_id(buddy)) |
| 304 | return 0; |
| 305 | |
| 306 | if (PageBuddy(buddy) && page_order(buddy) == order) { |
| 307 | BUG_ON(page_count(buddy) != 0); |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 308 | return 1; |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 309 | } |
Andrew Morton | 6aa3001b2 | 2006-04-18 22:20:52 -0700 | [diff] [blame] | 310 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 311 | } |
| 312 | |
| 313 | /* |
| 314 | * Freeing function for a buddy system allocator. |
| 315 | * |
| 316 | * The concept of a buddy system is to maintain direct-mapped table |
| 317 | * (containing bit values) for memory blocks of various "orders". |
| 318 | * The bottom level table contains the map for the smallest allocatable |
| 319 | * units of memory (here, pages), and each level above it describes |
| 320 | * pairs of units from the levels below, hence, "buddies". |
| 321 | * At a high level, all that happens here is marking the table entry |
| 322 | * at the bottom level available, and propagating the changes upward |
| 323 | * as necessary, plus some accounting needed to play nicely with other |
| 324 | * parts of the VM system. |
| 325 | * At each level, we keep a list of pages, which are heads of continuous |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 326 | * free pages of length of (1 << order) and marked with PG_buddy. Page's |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 327 | * order is recorded in page_private(page) field. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 328 | * So when we are allocating or freeing one, we can derive the state of the |
| 329 | * other. That is, if we allocate a small block, and both were |
| 330 | * free, the remainder of the region must be split into blocks. |
| 331 | * If a block is freed, and its buddy is also free, then this |
| 332 | * triggers coalescing into a block of larger size. |
| 333 | * |
| 334 | * -- wli |
| 335 | */ |
| 336 | |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 337 | static inline void __free_one_page(struct page *page, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 338 | struct zone *zone, unsigned int order) |
| 339 | { |
| 340 | unsigned long page_idx; |
| 341 | int order_size = 1 << order; |
| 342 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 343 | if (unlikely(PageCompound(page))) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 344 | destroy_compound_page(page, order); |
| 345 | |
| 346 | page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1); |
| 347 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 348 | VM_BUG_ON(page_idx & (order_size - 1)); |
| 349 | VM_BUG_ON(bad_range(zone, page)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 350 | |
| 351 | zone->free_pages += order_size; |
| 352 | while (order < MAX_ORDER-1) { |
| 353 | unsigned long combined_idx; |
| 354 | struct free_area *area; |
| 355 | struct page *buddy; |
| 356 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 357 | buddy = __page_find_buddy(page, page_idx, order); |
Andy Whitcroft | cb2b95e | 2006-06-23 02:03:01 -0700 | [diff] [blame] | 358 | if (!page_is_buddy(page, buddy, order)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 359 | break; /* Move the buddy up one level. */ |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 360 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 361 | list_del(&buddy->lru); |
| 362 | area = zone->free_area + order; |
| 363 | area->nr_free--; |
| 364 | rmv_page_order(buddy); |
Nick Piggin | 13e7444 | 2006-01-06 00:10:58 -0800 | [diff] [blame] | 365 | combined_idx = __find_combined_index(page_idx, order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 366 | page = page + (combined_idx - page_idx); |
| 367 | page_idx = combined_idx; |
| 368 | order++; |
| 369 | } |
| 370 | set_page_order(page, order); |
| 371 | list_add(&page->lru, &zone->free_area[order].free_list); |
| 372 | zone->free_area[order].nr_free++; |
| 373 | } |
| 374 | |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 375 | static inline int free_pages_check(struct page *page) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 376 | { |
Nick Piggin | 92be2e33 | 2006-01-06 00:10:57 -0800 | [diff] [blame] | 377 | if (unlikely(page_mapcount(page) | |
| 378 | (page->mapping != NULL) | |
| 379 | (page_count(page) != 0) | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 380 | (page->flags & ( |
| 381 | 1 << PG_lru | |
| 382 | 1 << PG_private | |
| 383 | 1 << PG_locked | |
| 384 | 1 << PG_active | |
| 385 | 1 << PG_reclaim | |
| 386 | 1 << PG_slab | |
| 387 | 1 << PG_swapcache | |
Nick Piggin | b581003 | 2005-10-29 18:16:12 -0700 | [diff] [blame] | 388 | 1 << PG_writeback | |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 389 | 1 << PG_reserved | |
| 390 | 1 << PG_buddy )))) |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 391 | bad_page(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 392 | if (PageDirty(page)) |
Nick Piggin | 242e546 | 2005-09-03 15:54:50 -0700 | [diff] [blame] | 393 | __ClearPageDirty(page); |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 394 | /* |
| 395 | * For now, we report if PG_reserved was found set, but do not |
| 396 | * clear it, and do not free the page. But we shall soon need |
| 397 | * to do more, for when the ZERO_PAGE count wraps negative. |
| 398 | */ |
| 399 | return PageReserved(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 400 | } |
| 401 | |
| 402 | /* |
| 403 | * Frees a list of pages. |
| 404 | * Assumes all pages on list are in same zone, and of same order. |
Renaud Lienhart | 207f36e | 2005-09-10 00:26:59 -0700 | [diff] [blame] | 405 | * count is the number of pages to free. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 406 | * |
| 407 | * If the zone was previously in an "all pages pinned" state then look to |
| 408 | * see if this freeing clears that state. |
| 409 | * |
| 410 | * And clear the zone's pages_scanned counter, to hold off the "all pages are |
| 411 | * pinned" detection logic. |
| 412 | */ |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 413 | static void free_pages_bulk(struct zone *zone, int count, |
| 414 | struct list_head *list, int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 415 | { |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 416 | spin_lock(&zone->lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 417 | zone->all_unreclaimable = 0; |
| 418 | zone->pages_scanned = 0; |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 419 | while (count--) { |
| 420 | struct page *page; |
| 421 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 422 | VM_BUG_ON(list_empty(list)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 423 | page = list_entry(list->prev, struct page, lru); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 424 | /* have to delete it as __free_one_page list manipulates */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 425 | list_del(&page->lru); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 426 | __free_one_page(page, zone, order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 427 | } |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 428 | spin_unlock(&zone->lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 429 | } |
| 430 | |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 431 | static void free_one_page(struct zone *zone, struct page *page, int order) |
| 432 | { |
| 433 | LIST_HEAD(list); |
| 434 | list_add(&page->lru, &list); |
| 435 | free_pages_bulk(zone, 1, &list, order); |
| 436 | } |
| 437 | |
| 438 | static void __free_pages_ok(struct page *page, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 439 | { |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 440 | unsigned long flags; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 441 | int i; |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 442 | int reserved = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 443 | |
| 444 | arch_free_page(page, order); |
Ingo Molnar | de5097c | 2006-01-09 15:59:21 -0800 | [diff] [blame] | 445 | if (!PageHighMem(page)) |
Ingo Molnar | f9b8404 | 2006-06-27 02:54:49 -0700 | [diff] [blame] | 446 | debug_check_no_locks_freed(page_address(page), |
| 447 | PAGE_SIZE<<order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 448 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 449 | for (i = 0 ; i < (1 << order) ; ++i) |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 450 | reserved += free_pages_check(page + i); |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 451 | if (reserved) |
| 452 | return; |
| 453 | |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 454 | kernel_map_pages(page, 1 << order, 0); |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 455 | local_irq_save(flags); |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 456 | __count_vm_events(PGFREE, 1 << order); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 457 | free_one_page(page_zone(page), page, order); |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 458 | local_irq_restore(flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 459 | } |
| 460 | |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 461 | /* |
| 462 | * permit the bootmem allocator to evade page validation on high-order frees |
| 463 | */ |
| 464 | void fastcall __init __free_pages_bootmem(struct page *page, unsigned int order) |
| 465 | { |
| 466 | if (order == 0) { |
| 467 | __ClearPageReserved(page); |
| 468 | set_page_count(page, 0); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 469 | set_page_refcounted(page); |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 470 | __free_page(page); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 471 | } else { |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 472 | int loop; |
| 473 | |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 474 | prefetchw(page); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 475 | for (loop = 0; loop < BITS_PER_LONG; loop++) { |
| 476 | struct page *p = &page[loop]; |
| 477 | |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 478 | if (loop + 1 < BITS_PER_LONG) |
| 479 | prefetchw(p + 1); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 480 | __ClearPageReserved(p); |
| 481 | set_page_count(p, 0); |
| 482 | } |
| 483 | |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 484 | set_page_refcounted(page); |
Nick Piggin | 545b1ea | 2006-03-22 00:08:07 -0800 | [diff] [blame] | 485 | __free_pages(page, order); |
David Howells | a226f6c | 2006-01-06 00:11:08 -0800 | [diff] [blame] | 486 | } |
| 487 | } |
| 488 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 489 | |
| 490 | /* |
| 491 | * The order of subdivision here is critical for the IO subsystem. |
| 492 | * Please do not alter this order without good reasons and regression |
| 493 | * testing. Specifically, as large blocks of memory are subdivided, |
| 494 | * the order in which smaller blocks are delivered depends on the order |
| 495 | * they're subdivided in this function. This is the primary factor |
| 496 | * influencing the order in which pages are delivered to the IO |
| 497 | * subsystem according to empirical testing, and this is also justified |
| 498 | * by considering the behavior of a buddy system containing a single |
| 499 | * large block of memory acted on by a series of small allocations. |
| 500 | * This behavior is a critical factor in sglist merging's success. |
| 501 | * |
| 502 | * -- wli |
| 503 | */ |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 504 | static inline void expand(struct zone *zone, struct page *page, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 505 | int low, int high, struct free_area *area) |
| 506 | { |
| 507 | unsigned long size = 1 << high; |
| 508 | |
| 509 | while (high > low) { |
| 510 | area--; |
| 511 | high--; |
| 512 | size >>= 1; |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 513 | VM_BUG_ON(bad_range(zone, &page[size])); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 514 | list_add(&page[size].lru, &area->free_list); |
| 515 | area->nr_free++; |
| 516 | set_page_order(&page[size], high); |
| 517 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 518 | } |
| 519 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 520 | /* |
| 521 | * This page is about to be returned from the page allocator |
| 522 | */ |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 523 | static int prep_new_page(struct page *page, int order, gfp_t gfp_flags) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 524 | { |
Nick Piggin | 92be2e33 | 2006-01-06 00:10:57 -0800 | [diff] [blame] | 525 | if (unlikely(page_mapcount(page) | |
| 526 | (page->mapping != NULL) | |
| 527 | (page_count(page) != 0) | |
Hugh Dickins | 334795e | 2005-06-21 17:15:08 -0700 | [diff] [blame] | 528 | (page->flags & ( |
| 529 | 1 << PG_lru | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 530 | 1 << PG_private | |
| 531 | 1 << PG_locked | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 532 | 1 << PG_active | |
| 533 | 1 << PG_dirty | |
| 534 | 1 << PG_reclaim | |
Hugh Dickins | 334795e | 2005-06-21 17:15:08 -0700 | [diff] [blame] | 535 | 1 << PG_slab | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 536 | 1 << PG_swapcache | |
Nick Piggin | b581003 | 2005-10-29 18:16:12 -0700 | [diff] [blame] | 537 | 1 << PG_writeback | |
Nick Piggin | 676165a | 2006-04-10 11:21:48 +1000 | [diff] [blame] | 538 | 1 << PG_reserved | |
| 539 | 1 << PG_buddy )))) |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 540 | bad_page(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 541 | |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 542 | /* |
| 543 | * For now, we report if PG_reserved was found set, but do not |
| 544 | * clear it, and do not allocate the page: as a safety net. |
| 545 | */ |
| 546 | if (PageReserved(page)) |
| 547 | return 1; |
| 548 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 549 | page->flags &= ~(1 << PG_uptodate | 1 << PG_error | |
| 550 | 1 << PG_referenced | 1 << PG_arch_1 | |
| 551 | 1 << PG_checked | 1 << PG_mappedtodisk); |
Hugh Dickins | 4c21e2f | 2005-10-29 18:16:40 -0700 | [diff] [blame] | 552 | set_page_private(page, 0); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 553 | set_page_refcounted(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 554 | kernel_map_pages(page, 1 << order, 1); |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 555 | |
| 556 | if (gfp_flags & __GFP_ZERO) |
| 557 | prep_zero_page(page, order, gfp_flags); |
| 558 | |
| 559 | if (order && (gfp_flags & __GFP_COMP)) |
| 560 | prep_compound_page(page, order); |
| 561 | |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 562 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 563 | } |
| 564 | |
| 565 | /* |
| 566 | * Do the hard work of removing an element from the buddy allocator. |
| 567 | * Call me with the zone->lock already held. |
| 568 | */ |
| 569 | static struct page *__rmqueue(struct zone *zone, unsigned int order) |
| 570 | { |
| 571 | struct free_area * area; |
| 572 | unsigned int current_order; |
| 573 | struct page *page; |
| 574 | |
| 575 | for (current_order = order; current_order < MAX_ORDER; ++current_order) { |
| 576 | area = zone->free_area + current_order; |
| 577 | if (list_empty(&area->free_list)) |
| 578 | continue; |
| 579 | |
| 580 | page = list_entry(area->free_list.next, struct page, lru); |
| 581 | list_del(&page->lru); |
| 582 | rmv_page_order(page); |
| 583 | area->nr_free--; |
| 584 | zone->free_pages -= 1UL << order; |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 585 | expand(zone, page, order, current_order, area); |
| 586 | return page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 587 | } |
| 588 | |
| 589 | return NULL; |
| 590 | } |
| 591 | |
| 592 | /* |
| 593 | * Obtain a specified number of elements from the buddy allocator, all under |
| 594 | * a single hold of the lock, for efficiency. Add them to the supplied list. |
| 595 | * Returns the number of new pages which were placed at *list. |
| 596 | */ |
| 597 | static int rmqueue_bulk(struct zone *zone, unsigned int order, |
| 598 | unsigned long count, struct list_head *list) |
| 599 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 600 | int i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 601 | |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 602 | spin_lock(&zone->lock); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 603 | for (i = 0; i < count; ++i) { |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 604 | struct page *page = __rmqueue(zone, order); |
| 605 | if (unlikely(page == NULL)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 606 | break; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 607 | list_add_tail(&page->lru, list); |
| 608 | } |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 609 | spin_unlock(&zone->lock); |
Nick Piggin | 085cc7d | 2006-01-06 00:11:01 -0800 | [diff] [blame] | 610 | return i; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 611 | } |
| 612 | |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 613 | #ifdef CONFIG_NUMA |
Christoph Lameter | 8fce4d8 | 2006-03-09 17:33:54 -0800 | [diff] [blame] | 614 | /* |
| 615 | * Called from the slab reaper to drain pagesets on a particular node that |
| 616 | * belong to the currently executing processor. |
Christoph Lameter | 879336c | 2006-03-22 00:09:08 -0800 | [diff] [blame] | 617 | * Note that this function must be called with the thread pinned to |
| 618 | * a single processor. |
Christoph Lameter | 8fce4d8 | 2006-03-09 17:33:54 -0800 | [diff] [blame] | 619 | */ |
| 620 | void drain_node_pages(int nodeid) |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 621 | { |
Christoph Lameter | 8fce4d8 | 2006-03-09 17:33:54 -0800 | [diff] [blame] | 622 | int i, z; |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 623 | unsigned long flags; |
| 624 | |
Christoph Lameter | 8fce4d8 | 2006-03-09 17:33:54 -0800 | [diff] [blame] | 625 | for (z = 0; z < MAX_NR_ZONES; z++) { |
| 626 | struct zone *zone = NODE_DATA(nodeid)->node_zones + z; |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 627 | struct per_cpu_pageset *pset; |
| 628 | |
Nick Piggin | 23316bc | 2006-01-08 01:00:41 -0800 | [diff] [blame] | 629 | pset = zone_pcp(zone, smp_processor_id()); |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 630 | for (i = 0; i < ARRAY_SIZE(pset->pcp); i++) { |
| 631 | struct per_cpu_pages *pcp; |
| 632 | |
| 633 | pcp = &pset->pcp[i]; |
Christoph Lameter | 879336c | 2006-03-22 00:09:08 -0800 | [diff] [blame] | 634 | if (pcp->count) { |
| 635 | local_irq_save(flags); |
| 636 | free_pages_bulk(zone, pcp->count, &pcp->list, 0); |
| 637 | pcp->count = 0; |
| 638 | local_irq_restore(flags); |
| 639 | } |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 640 | } |
| 641 | } |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 642 | } |
| 643 | #endif |
| 644 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 645 | #if defined(CONFIG_PM) || defined(CONFIG_HOTPLUG_CPU) |
| 646 | static void __drain_pages(unsigned int cpu) |
| 647 | { |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 648 | unsigned long flags; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 649 | struct zone *zone; |
| 650 | int i; |
| 651 | |
| 652 | for_each_zone(zone) { |
| 653 | struct per_cpu_pageset *pset; |
| 654 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 655 | pset = zone_pcp(zone, cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 656 | for (i = 0; i < ARRAY_SIZE(pset->pcp); i++) { |
| 657 | struct per_cpu_pages *pcp; |
| 658 | |
| 659 | pcp = &pset->pcp[i]; |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 660 | local_irq_save(flags); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 661 | free_pages_bulk(zone, pcp->count, &pcp->list, 0); |
| 662 | pcp->count = 0; |
Nick Piggin | c54ad30 | 2006-01-06 00:10:56 -0800 | [diff] [blame] | 663 | local_irq_restore(flags); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 664 | } |
| 665 | } |
| 666 | } |
| 667 | #endif /* CONFIG_PM || CONFIG_HOTPLUG_CPU */ |
| 668 | |
| 669 | #ifdef CONFIG_PM |
| 670 | |
| 671 | void mark_free_pages(struct zone *zone) |
| 672 | { |
| 673 | unsigned long zone_pfn, flags; |
| 674 | int order; |
| 675 | struct list_head *curr; |
| 676 | |
| 677 | if (!zone->spanned_pages) |
| 678 | return; |
| 679 | |
| 680 | spin_lock_irqsave(&zone->lock, flags); |
| 681 | for (zone_pfn = 0; zone_pfn < zone->spanned_pages; ++zone_pfn) |
| 682 | ClearPageNosaveFree(pfn_to_page(zone_pfn + zone->zone_start_pfn)); |
| 683 | |
| 684 | for (order = MAX_ORDER - 1; order >= 0; --order) |
| 685 | list_for_each(curr, &zone->free_area[order].free_list) { |
| 686 | unsigned long start_pfn, i; |
| 687 | |
| 688 | start_pfn = page_to_pfn(list_entry(curr, struct page, lru)); |
| 689 | |
| 690 | for (i=0; i < (1<<order); i++) |
| 691 | SetPageNosaveFree(pfn_to_page(start_pfn+i)); |
| 692 | } |
| 693 | spin_unlock_irqrestore(&zone->lock, flags); |
| 694 | } |
| 695 | |
| 696 | /* |
| 697 | * Spill all of this CPU's per-cpu pages back into the buddy allocator. |
| 698 | */ |
| 699 | void drain_local_pages(void) |
| 700 | { |
| 701 | unsigned long flags; |
| 702 | |
| 703 | local_irq_save(flags); |
| 704 | __drain_pages(smp_processor_id()); |
| 705 | local_irq_restore(flags); |
| 706 | } |
| 707 | #endif /* CONFIG_PM */ |
| 708 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 709 | /* |
| 710 | * Free a 0-order page |
| 711 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 712 | static void fastcall free_hot_cold_page(struct page *page, int cold) |
| 713 | { |
| 714 | struct zone *zone = page_zone(page); |
| 715 | struct per_cpu_pages *pcp; |
| 716 | unsigned long flags; |
| 717 | |
| 718 | arch_free_page(page, 0); |
| 719 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 720 | if (PageAnon(page)) |
| 721 | page->mapping = NULL; |
Nick Piggin | 224abf9 | 2006-01-06 00:11:11 -0800 | [diff] [blame] | 722 | if (free_pages_check(page)) |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 723 | return; |
| 724 | |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 725 | kernel_map_pages(page, 1, 0); |
| 726 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 727 | pcp = &zone_pcp(zone, get_cpu())->pcp[cold]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 728 | local_irq_save(flags); |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 729 | __count_vm_event(PGFREE); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 730 | list_add(&page->lru, &pcp->list); |
| 731 | pcp->count++; |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 732 | if (pcp->count >= pcp->high) { |
| 733 | free_pages_bulk(zone, pcp->batch, &pcp->list, 0); |
| 734 | pcp->count -= pcp->batch; |
| 735 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 736 | local_irq_restore(flags); |
| 737 | put_cpu(); |
| 738 | } |
| 739 | |
| 740 | void fastcall free_hot_page(struct page *page) |
| 741 | { |
| 742 | free_hot_cold_page(page, 0); |
| 743 | } |
| 744 | |
| 745 | void fastcall free_cold_page(struct page *page) |
| 746 | { |
| 747 | free_hot_cold_page(page, 1); |
| 748 | } |
| 749 | |
Nick Piggin | 8dfcc9b | 2006-03-22 00:08:05 -0800 | [diff] [blame] | 750 | /* |
| 751 | * split_page takes a non-compound higher-order page, and splits it into |
| 752 | * n (1<<order) sub-pages: page[0..n] |
| 753 | * Each sub-page must be freed individually. |
| 754 | * |
| 755 | * Note: this is probably too low level an operation for use in drivers. |
| 756 | * Please consult with lkml before using this in your driver. |
| 757 | */ |
| 758 | void split_page(struct page *page, unsigned int order) |
| 759 | { |
| 760 | int i; |
| 761 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 762 | VM_BUG_ON(PageCompound(page)); |
| 763 | VM_BUG_ON(!page_count(page)); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 764 | for (i = 1; i < (1 << order); i++) |
| 765 | set_page_refcounted(page + i); |
Nick Piggin | 8dfcc9b | 2006-03-22 00:08:05 -0800 | [diff] [blame] | 766 | } |
Nick Piggin | 8dfcc9b | 2006-03-22 00:08:05 -0800 | [diff] [blame] | 767 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 768 | /* |
| 769 | * Really, prep_compound_page() should be called from __rmqueue_bulk(). But |
| 770 | * we cheat by calling it from here, in the order > 0 path. Saves a branch |
| 771 | * or two. |
| 772 | */ |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 773 | static struct page *buffered_rmqueue(struct zonelist *zonelist, |
| 774 | struct zone *zone, int order, gfp_t gfp_flags) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 775 | { |
| 776 | unsigned long flags; |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 777 | struct page *page; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 778 | int cold = !!(gfp_flags & __GFP_COLD); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 779 | int cpu; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 780 | |
Hugh Dickins | 689bceb | 2005-11-21 21:32:20 -0800 | [diff] [blame] | 781 | again: |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 782 | cpu = get_cpu(); |
Nick Piggin | 48db57f | 2006-01-08 01:00:42 -0800 | [diff] [blame] | 783 | if (likely(order == 0)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 784 | struct per_cpu_pages *pcp; |
| 785 | |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 786 | pcp = &zone_pcp(zone, cpu)->pcp[cold]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 787 | local_irq_save(flags); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 788 | if (!pcp->count) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 789 | pcp->count += rmqueue_bulk(zone, 0, |
| 790 | pcp->batch, &pcp->list); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 791 | if (unlikely(!pcp->count)) |
| 792 | goto failed; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 793 | } |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 794 | page = list_entry(pcp->list.next, struct page, lru); |
| 795 | list_del(&page->lru); |
| 796 | pcp->count--; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 797 | } else { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 798 | spin_lock_irqsave(&zone->lock, flags); |
| 799 | page = __rmqueue(zone, order); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 800 | spin_unlock(&zone->lock); |
| 801 | if (!page) |
| 802 | goto failed; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 803 | } |
| 804 | |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 805 | __count_zone_vm_events(PGALLOC, zone, 1 << order); |
Christoph Lameter | ca889e6 | 2006-06-30 01:55:44 -0700 | [diff] [blame] | 806 | zone_statistics(zonelist, zone); |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 807 | local_irq_restore(flags); |
| 808 | put_cpu(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 809 | |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 810 | VM_BUG_ON(bad_range(zone, page)); |
Nick Piggin | 17cf440 | 2006-03-22 00:08:41 -0800 | [diff] [blame] | 811 | if (prep_new_page(page, order, gfp_flags)) |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 812 | goto again; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 813 | return page; |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 814 | |
| 815 | failed: |
| 816 | local_irq_restore(flags); |
| 817 | put_cpu(); |
| 818 | return NULL; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 819 | } |
| 820 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 821 | #define ALLOC_NO_WATERMARKS 0x01 /* don't check watermarks at all */ |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 822 | #define ALLOC_WMARK_MIN 0x02 /* use pages_min watermark */ |
| 823 | #define ALLOC_WMARK_LOW 0x04 /* use pages_low watermark */ |
| 824 | #define ALLOC_WMARK_HIGH 0x08 /* use pages_high watermark */ |
| 825 | #define ALLOC_HARDER 0x10 /* try to alloc harder */ |
| 826 | #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */ |
| 827 | #define ALLOC_CPUSET 0x40 /* check for correct cpuset */ |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 828 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 829 | /* |
| 830 | * Return 1 if free pages are above 'mark'. This takes into account the order |
| 831 | * of the allocation. |
| 832 | */ |
| 833 | int zone_watermark_ok(struct zone *z, int order, unsigned long mark, |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 834 | int classzone_idx, int alloc_flags) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 835 | { |
| 836 | /* free_pages my go negative - that's OK */ |
| 837 | long min = mark, free_pages = z->free_pages - (1 << order) + 1; |
| 838 | int o; |
| 839 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 840 | if (alloc_flags & ALLOC_HIGH) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 841 | min -= min / 2; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 842 | if (alloc_flags & ALLOC_HARDER) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 843 | min -= min / 4; |
| 844 | |
| 845 | if (free_pages <= min + z->lowmem_reserve[classzone_idx]) |
| 846 | return 0; |
| 847 | for (o = 0; o < order; o++) { |
| 848 | /* At the next order, this order's pages become unavailable */ |
| 849 | free_pages -= z->free_area[o].nr_free << o; |
| 850 | |
| 851 | /* Require fewer higher order pages to be free */ |
| 852 | min >>= 1; |
| 853 | |
| 854 | if (free_pages <= min) |
| 855 | return 0; |
| 856 | } |
| 857 | return 1; |
| 858 | } |
| 859 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 860 | /* |
| 861 | * get_page_from_freeliest goes through the zonelist trying to allocate |
| 862 | * a page. |
| 863 | */ |
| 864 | static struct page * |
| 865 | get_page_from_freelist(gfp_t gfp_mask, unsigned int order, |
| 866 | struct zonelist *zonelist, int alloc_flags) |
Martin Hicks | 753ee72 | 2005-06-21 17:14:41 -0700 | [diff] [blame] | 867 | { |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 868 | struct zone **z = zonelist->zones; |
| 869 | struct page *page = NULL; |
| 870 | int classzone_idx = zone_idx(*z); |
| 871 | |
| 872 | /* |
| 873 | * Go through the zonelist once, looking for a zone with enough free. |
| 874 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. |
| 875 | */ |
| 876 | do { |
| 877 | if ((alloc_flags & ALLOC_CPUSET) && |
| 878 | !cpuset_zone_allowed(*z, gfp_mask)) |
| 879 | continue; |
| 880 | |
| 881 | if (!(alloc_flags & ALLOC_NO_WATERMARKS)) { |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 882 | unsigned long mark; |
| 883 | if (alloc_flags & ALLOC_WMARK_MIN) |
| 884 | mark = (*z)->pages_min; |
| 885 | else if (alloc_flags & ALLOC_WMARK_LOW) |
| 886 | mark = (*z)->pages_low; |
| 887 | else |
| 888 | mark = (*z)->pages_high; |
| 889 | if (!zone_watermark_ok(*z, order, mark, |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 890 | classzone_idx, alloc_flags)) |
Christoph Lameter | 9eeff23 | 2006-01-18 17:42:31 -0800 | [diff] [blame] | 891 | if (!zone_reclaim_mode || |
| 892 | !zone_reclaim(*z, gfp_mask, order)) |
| 893 | continue; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 894 | } |
| 895 | |
Nick Piggin | a74609f | 2006-01-06 00:11:20 -0800 | [diff] [blame] | 896 | page = buffered_rmqueue(zonelist, *z, order, gfp_mask); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 897 | if (page) { |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 898 | break; |
| 899 | } |
| 900 | } while (*(++z) != NULL); |
| 901 | return page; |
Martin Hicks | 753ee72 | 2005-06-21 17:14:41 -0700 | [diff] [blame] | 902 | } |
| 903 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 904 | /* |
| 905 | * This is the 'heart' of the zoned buddy allocator. |
| 906 | */ |
| 907 | struct page * fastcall |
Al Viro | dd0fc66 | 2005-10-07 07:46:04 +0100 | [diff] [blame] | 908 | __alloc_pages(gfp_t gfp_mask, unsigned int order, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 909 | struct zonelist *zonelist) |
| 910 | { |
Al Viro | 260b236 | 2005-10-21 03:22:44 -0400 | [diff] [blame] | 911 | const gfp_t wait = gfp_mask & __GFP_WAIT; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 912 | struct zone **z; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 913 | struct page *page; |
| 914 | struct reclaim_state reclaim_state; |
| 915 | struct task_struct *p = current; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 916 | int do_retry; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 917 | int alloc_flags; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 918 | int did_some_progress; |
| 919 | |
| 920 | might_sleep_if(wait); |
| 921 | |
Jens Axboe | 6b1de91 | 2005-11-17 21:35:02 +0100 | [diff] [blame] | 922 | restart: |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 923 | z = zonelist->zones; /* the list of zones suitable for gfp_mask */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 924 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 925 | if (unlikely(*z == NULL)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 926 | /* Should this ever happen?? */ |
| 927 | return NULL; |
| 928 | } |
Jens Axboe | 6b1de91 | 2005-11-17 21:35:02 +0100 | [diff] [blame] | 929 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 930 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, order, |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 931 | zonelist, ALLOC_WMARK_LOW|ALLOC_CPUSET); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 932 | if (page) |
| 933 | goto got_pg; |
| 934 | |
Jens Axboe | 6b1de91 | 2005-11-17 21:35:02 +0100 | [diff] [blame] | 935 | do { |
Chris Wright | 43b0bc0 | 2006-06-25 05:47:55 -0700 | [diff] [blame] | 936 | wakeup_kswapd(*z, order); |
Jens Axboe | 6b1de91 | 2005-11-17 21:35:02 +0100 | [diff] [blame] | 937 | } while (*(++z)); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 938 | |
Paul Jackson | 9bf2229 | 2005-09-06 15:18:12 -0700 | [diff] [blame] | 939 | /* |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 940 | * OK, we're below the kswapd watermark and have kicked background |
| 941 | * reclaim. Now things get more complex, so set up alloc_flags according |
| 942 | * to how we want to proceed. |
| 943 | * |
| 944 | * The caller may dip into page reserves a bit more if the caller |
| 945 | * cannot run direct reclaim, or if the caller has realtime scheduling |
Paul Jackson | 4eac915 | 2006-01-11 12:17:19 -0800 | [diff] [blame] | 946 | * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will |
| 947 | * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH). |
Paul Jackson | 9bf2229 | 2005-09-06 15:18:12 -0700 | [diff] [blame] | 948 | */ |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 949 | alloc_flags = ALLOC_WMARK_MIN; |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 950 | if ((unlikely(rt_task(p)) && !in_interrupt()) || !wait) |
| 951 | alloc_flags |= ALLOC_HARDER; |
| 952 | if (gfp_mask & __GFP_HIGH) |
| 953 | alloc_flags |= ALLOC_HIGH; |
Paul Jackson | bdd804f | 2006-05-20 15:00:09 -0700 | [diff] [blame] | 954 | if (wait) |
| 955 | alloc_flags |= ALLOC_CPUSET; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 956 | |
| 957 | /* |
| 958 | * Go through the zonelist again. Let __GFP_HIGH and allocations |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 959 | * coming from realtime tasks go deeper into reserves. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 960 | * |
| 961 | * This is the last chance, in general, before the goto nopage. |
| 962 | * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc. |
Paul Jackson | 9bf2229 | 2005-09-06 15:18:12 -0700 | [diff] [blame] | 963 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 964 | */ |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 965 | page = get_page_from_freelist(gfp_mask, order, zonelist, alloc_flags); |
| 966 | if (page) |
| 967 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 968 | |
| 969 | /* This allocation should allow future memory freeing. */ |
Nick Piggin | b84a35b | 2005-05-01 08:58:36 -0700 | [diff] [blame] | 970 | |
| 971 | if (((p->flags & PF_MEMALLOC) || unlikely(test_thread_flag(TIF_MEMDIE))) |
| 972 | && !in_interrupt()) { |
| 973 | if (!(gfp_mask & __GFP_NOMEMALLOC)) { |
Kirill Korotaev | 885036d | 2005-11-13 16:06:41 -0800 | [diff] [blame] | 974 | nofail_alloc: |
Nick Piggin | b84a35b | 2005-05-01 08:58:36 -0700 | [diff] [blame] | 975 | /* go through the zonelist yet again, ignoring mins */ |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 976 | page = get_page_from_freelist(gfp_mask, order, |
Paul Jackson | 47f3a86 | 2006-01-06 00:10:32 -0800 | [diff] [blame] | 977 | zonelist, ALLOC_NO_WATERMARKS); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 978 | if (page) |
| 979 | goto got_pg; |
Kirill Korotaev | 885036d | 2005-11-13 16:06:41 -0800 | [diff] [blame] | 980 | if (gfp_mask & __GFP_NOFAIL) { |
| 981 | blk_congestion_wait(WRITE, HZ/50); |
| 982 | goto nofail_alloc; |
| 983 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 984 | } |
| 985 | goto nopage; |
| 986 | } |
| 987 | |
| 988 | /* Atomic allocations - we can't balance anything */ |
| 989 | if (!wait) |
| 990 | goto nopage; |
| 991 | |
| 992 | rebalance: |
| 993 | cond_resched(); |
| 994 | |
| 995 | /* We now go into synchronous reclaim */ |
Paul Jackson | 3e0d98b | 2006-01-08 01:01:49 -0800 | [diff] [blame] | 996 | cpuset_memory_pressure_bump(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 997 | p->flags |= PF_MEMALLOC; |
| 998 | reclaim_state.reclaimed_slab = 0; |
| 999 | p->reclaim_state = &reclaim_state; |
| 1000 | |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1001 | did_some_progress = try_to_free_pages(zonelist->zones, gfp_mask); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1002 | |
| 1003 | p->reclaim_state = NULL; |
| 1004 | p->flags &= ~PF_MEMALLOC; |
| 1005 | |
| 1006 | cond_resched(); |
| 1007 | |
| 1008 | if (likely(did_some_progress)) { |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1009 | page = get_page_from_freelist(gfp_mask, order, |
| 1010 | zonelist, alloc_flags); |
| 1011 | if (page) |
| 1012 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1013 | } else if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) { |
| 1014 | /* |
| 1015 | * Go through the zonelist yet one more time, keep |
| 1016 | * very high watermark here, this is only to catch |
| 1017 | * a parallel oom killing, we must fail if we're still |
| 1018 | * under heavy pressure. |
| 1019 | */ |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1020 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, order, |
Nick Piggin | 3148890 | 2005-11-28 13:44:03 -0800 | [diff] [blame] | 1021 | zonelist, ALLOC_WMARK_HIGH|ALLOC_CPUSET); |
Rohit Seth | 7fb1d9f | 2005-11-13 16:06:43 -0800 | [diff] [blame] | 1022 | if (page) |
| 1023 | goto got_pg; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1024 | |
Christoph Lameter | 9b0f8b0 | 2006-02-20 18:27:52 -0800 | [diff] [blame] | 1025 | out_of_memory(zonelist, gfp_mask, order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1026 | goto restart; |
| 1027 | } |
| 1028 | |
| 1029 | /* |
| 1030 | * Don't let big-order allocations loop unless the caller explicitly |
| 1031 | * requests that. Wait for some write requests to complete then retry. |
| 1032 | * |
| 1033 | * In this implementation, __GFP_REPEAT means __GFP_NOFAIL for order |
| 1034 | * <= 3, but that may not be true in other implementations. |
| 1035 | */ |
| 1036 | do_retry = 0; |
| 1037 | if (!(gfp_mask & __GFP_NORETRY)) { |
| 1038 | if ((order <= 3) || (gfp_mask & __GFP_REPEAT)) |
| 1039 | do_retry = 1; |
| 1040 | if (gfp_mask & __GFP_NOFAIL) |
| 1041 | do_retry = 1; |
| 1042 | } |
| 1043 | if (do_retry) { |
| 1044 | blk_congestion_wait(WRITE, HZ/50); |
| 1045 | goto rebalance; |
| 1046 | } |
| 1047 | |
| 1048 | nopage: |
| 1049 | if (!(gfp_mask & __GFP_NOWARN) && printk_ratelimit()) { |
| 1050 | printk(KERN_WARNING "%s: page allocation failure." |
| 1051 | " order:%d, mode:0x%x\n", |
| 1052 | p->comm, order, gfp_mask); |
| 1053 | dump_stack(); |
Janet Morgan | 578c2fd | 2005-06-21 17:14:56 -0700 | [diff] [blame] | 1054 | show_mem(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1055 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1056 | got_pg: |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1057 | return page; |
| 1058 | } |
| 1059 | |
| 1060 | EXPORT_SYMBOL(__alloc_pages); |
| 1061 | |
| 1062 | /* |
| 1063 | * Common helper functions. |
| 1064 | */ |
Al Viro | dd0fc66 | 2005-10-07 07:46:04 +0100 | [diff] [blame] | 1065 | fastcall unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1066 | { |
| 1067 | struct page * page; |
| 1068 | page = alloc_pages(gfp_mask, order); |
| 1069 | if (!page) |
| 1070 | return 0; |
| 1071 | return (unsigned long) page_address(page); |
| 1072 | } |
| 1073 | |
| 1074 | EXPORT_SYMBOL(__get_free_pages); |
| 1075 | |
Al Viro | dd0fc66 | 2005-10-07 07:46:04 +0100 | [diff] [blame] | 1076 | fastcall unsigned long get_zeroed_page(gfp_t gfp_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1077 | { |
| 1078 | struct page * page; |
| 1079 | |
| 1080 | /* |
| 1081 | * get_zeroed_page() returns a 32-bit address, which cannot represent |
| 1082 | * a highmem page |
| 1083 | */ |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 1084 | VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1085 | |
| 1086 | page = alloc_pages(gfp_mask | __GFP_ZERO, 0); |
| 1087 | if (page) |
| 1088 | return (unsigned long) page_address(page); |
| 1089 | return 0; |
| 1090 | } |
| 1091 | |
| 1092 | EXPORT_SYMBOL(get_zeroed_page); |
| 1093 | |
| 1094 | void __pagevec_free(struct pagevec *pvec) |
| 1095 | { |
| 1096 | int i = pagevec_count(pvec); |
| 1097 | |
| 1098 | while (--i >= 0) |
| 1099 | free_hot_cold_page(pvec->pages[i], pvec->cold); |
| 1100 | } |
| 1101 | |
| 1102 | fastcall void __free_pages(struct page *page, unsigned int order) |
| 1103 | { |
Nick Piggin | b581003 | 2005-10-29 18:16:12 -0700 | [diff] [blame] | 1104 | if (put_page_testzero(page)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1105 | if (order == 0) |
| 1106 | free_hot_page(page); |
| 1107 | else |
| 1108 | __free_pages_ok(page, order); |
| 1109 | } |
| 1110 | } |
| 1111 | |
| 1112 | EXPORT_SYMBOL(__free_pages); |
| 1113 | |
| 1114 | fastcall void free_pages(unsigned long addr, unsigned int order) |
| 1115 | { |
| 1116 | if (addr != 0) { |
Nick Piggin | 725d704 | 2006-09-25 23:30:55 -0700 | [diff] [blame] | 1117 | VM_BUG_ON(!virt_addr_valid((void *)addr)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1118 | __free_pages(virt_to_page((void *)addr), order); |
| 1119 | } |
| 1120 | } |
| 1121 | |
| 1122 | EXPORT_SYMBOL(free_pages); |
| 1123 | |
| 1124 | /* |
| 1125 | * Total amount of free (allocatable) RAM: |
| 1126 | */ |
| 1127 | unsigned int nr_free_pages(void) |
| 1128 | { |
| 1129 | unsigned int sum = 0; |
| 1130 | struct zone *zone; |
| 1131 | |
| 1132 | for_each_zone(zone) |
| 1133 | sum += zone->free_pages; |
| 1134 | |
| 1135 | return sum; |
| 1136 | } |
| 1137 | |
| 1138 | EXPORT_SYMBOL(nr_free_pages); |
| 1139 | |
| 1140 | #ifdef CONFIG_NUMA |
| 1141 | unsigned int nr_free_pages_pgdat(pg_data_t *pgdat) |
| 1142 | { |
| 1143 | unsigned int i, sum = 0; |
| 1144 | |
| 1145 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 1146 | sum += pgdat->node_zones[i].free_pages; |
| 1147 | |
| 1148 | return sum; |
| 1149 | } |
| 1150 | #endif |
| 1151 | |
| 1152 | static unsigned int nr_free_zone_pages(int offset) |
| 1153 | { |
Martin J. Bligh | e310fd4 | 2005-07-29 22:59:18 -0700 | [diff] [blame] | 1154 | /* Just pick one node, since fallback list is circular */ |
| 1155 | pg_data_t *pgdat = NODE_DATA(numa_node_id()); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1156 | unsigned int sum = 0; |
| 1157 | |
Martin J. Bligh | e310fd4 | 2005-07-29 22:59:18 -0700 | [diff] [blame] | 1158 | struct zonelist *zonelist = pgdat->node_zonelists + offset; |
| 1159 | struct zone **zonep = zonelist->zones; |
| 1160 | struct zone *zone; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1161 | |
Martin J. Bligh | e310fd4 | 2005-07-29 22:59:18 -0700 | [diff] [blame] | 1162 | for (zone = *zonep++; zone; zone = *zonep++) { |
| 1163 | unsigned long size = zone->present_pages; |
| 1164 | unsigned long high = zone->pages_high; |
| 1165 | if (size > high) |
| 1166 | sum += size - high; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1167 | } |
| 1168 | |
| 1169 | return sum; |
| 1170 | } |
| 1171 | |
| 1172 | /* |
| 1173 | * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL |
| 1174 | */ |
| 1175 | unsigned int nr_free_buffer_pages(void) |
| 1176 | { |
Al Viro | af4ca45 | 2005-10-21 02:55:38 -0400 | [diff] [blame] | 1177 | return nr_free_zone_pages(gfp_zone(GFP_USER)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1178 | } |
| 1179 | |
| 1180 | /* |
| 1181 | * Amount of free RAM allocatable within all zones |
| 1182 | */ |
| 1183 | unsigned int nr_free_pagecache_pages(void) |
| 1184 | { |
Al Viro | af4ca45 | 2005-10-21 02:55:38 -0400 | [diff] [blame] | 1185 | return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1186 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1187 | #ifdef CONFIG_NUMA |
| 1188 | static void show_node(struct zone *zone) |
| 1189 | { |
| 1190 | printk("Node %d ", zone->zone_pgdat->node_id); |
| 1191 | } |
| 1192 | #else |
| 1193 | #define show_node(zone) do { } while (0) |
| 1194 | #endif |
| 1195 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1196 | void si_meminfo(struct sysinfo *val) |
| 1197 | { |
| 1198 | val->totalram = totalram_pages; |
| 1199 | val->sharedram = 0; |
| 1200 | val->freeram = nr_free_pages(); |
| 1201 | val->bufferram = nr_blockdev_pages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1202 | val->totalhigh = totalhigh_pages; |
| 1203 | val->freehigh = nr_free_highpages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1204 | val->mem_unit = PAGE_SIZE; |
| 1205 | } |
| 1206 | |
| 1207 | EXPORT_SYMBOL(si_meminfo); |
| 1208 | |
| 1209 | #ifdef CONFIG_NUMA |
| 1210 | void si_meminfo_node(struct sysinfo *val, int nid) |
| 1211 | { |
| 1212 | pg_data_t *pgdat = NODE_DATA(nid); |
| 1213 | |
| 1214 | val->totalram = pgdat->node_present_pages; |
| 1215 | val->freeram = nr_free_pages_pgdat(pgdat); |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame^] | 1216 | #ifdef CONFIG_HIGHMEM |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1217 | val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages; |
| 1218 | val->freehigh = pgdat->node_zones[ZONE_HIGHMEM].free_pages; |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame^] | 1219 | #else |
| 1220 | val->totalhigh = 0; |
| 1221 | val->freehigh = 0; |
| 1222 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1223 | val->mem_unit = PAGE_SIZE; |
| 1224 | } |
| 1225 | #endif |
| 1226 | |
| 1227 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
| 1228 | |
| 1229 | /* |
| 1230 | * Show free area list (used inside shift_scroll-lock stuff) |
| 1231 | * We also calculate the percentage fragmentation. We do this by counting the |
| 1232 | * memory on each free list with the exception of the first item on the list. |
| 1233 | */ |
| 1234 | void show_free_areas(void) |
| 1235 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1236 | int cpu, temperature; |
| 1237 | unsigned long active; |
| 1238 | unsigned long inactive; |
| 1239 | unsigned long free; |
| 1240 | struct zone *zone; |
| 1241 | |
| 1242 | for_each_zone(zone) { |
| 1243 | show_node(zone); |
| 1244 | printk("%s per-cpu:", zone->name); |
| 1245 | |
Con Kolivas | f3fe651 | 2006-01-06 00:11:15 -0800 | [diff] [blame] | 1246 | if (!populated_zone(zone)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1247 | printk(" empty\n"); |
| 1248 | continue; |
| 1249 | } else |
| 1250 | printk("\n"); |
| 1251 | |
Dave Jones | 6b482c6 | 2005-11-10 15:45:56 -0500 | [diff] [blame] | 1252 | for_each_online_cpu(cpu) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1253 | struct per_cpu_pageset *pageset; |
| 1254 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1255 | pageset = zone_pcp(zone, cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1256 | |
| 1257 | for (temperature = 0; temperature < 2; temperature++) |
Nick Piggin | 2d92c5c | 2006-01-06 00:10:59 -0800 | [diff] [blame] | 1258 | printk("cpu %d %s: high %d, batch %d used:%d\n", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1259 | cpu, |
| 1260 | temperature ? "cold" : "hot", |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1261 | pageset->pcp[temperature].high, |
Christoph Lameter | 4ae7c03 | 2005-06-21 17:14:57 -0700 | [diff] [blame] | 1262 | pageset->pcp[temperature].batch, |
| 1263 | pageset->pcp[temperature].count); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1264 | } |
| 1265 | } |
| 1266 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1267 | get_zone_counts(&active, &inactive, &free); |
| 1268 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1269 | printk("Active:%lu inactive:%lu dirty:%lu writeback:%lu " |
| 1270 | "unstable:%lu free:%u slab:%lu mapped:%lu pagetables:%lu\n", |
| 1271 | active, |
| 1272 | inactive, |
Christoph Lameter | b1e7a8f | 2006-06-30 01:55:39 -0700 | [diff] [blame] | 1273 | global_page_state(NR_FILE_DIRTY), |
Christoph Lameter | ce866b3 | 2006-06-30 01:55:40 -0700 | [diff] [blame] | 1274 | global_page_state(NR_WRITEBACK), |
Christoph Lameter | fd39fc8 | 2006-06-30 01:55:40 -0700 | [diff] [blame] | 1275 | global_page_state(NR_UNSTABLE_NFS), |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1276 | nr_free_pages(), |
Christoph Lameter | 9a865ff | 2006-06-30 01:55:38 -0700 | [diff] [blame] | 1277 | global_page_state(NR_SLAB), |
Christoph Lameter | 65ba55f | 2006-06-30 01:55:34 -0700 | [diff] [blame] | 1278 | global_page_state(NR_FILE_MAPPED), |
Christoph Lameter | df849a1 | 2006-06-30 01:55:38 -0700 | [diff] [blame] | 1279 | global_page_state(NR_PAGETABLE)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1280 | |
| 1281 | for_each_zone(zone) { |
| 1282 | int i; |
| 1283 | |
| 1284 | show_node(zone); |
| 1285 | printk("%s" |
| 1286 | " free:%lukB" |
| 1287 | " min:%lukB" |
| 1288 | " low:%lukB" |
| 1289 | " high:%lukB" |
| 1290 | " active:%lukB" |
| 1291 | " inactive:%lukB" |
| 1292 | " present:%lukB" |
| 1293 | " pages_scanned:%lu" |
| 1294 | " all_unreclaimable? %s" |
| 1295 | "\n", |
| 1296 | zone->name, |
| 1297 | K(zone->free_pages), |
| 1298 | K(zone->pages_min), |
| 1299 | K(zone->pages_low), |
| 1300 | K(zone->pages_high), |
| 1301 | K(zone->nr_active), |
| 1302 | K(zone->nr_inactive), |
| 1303 | K(zone->present_pages), |
| 1304 | zone->pages_scanned, |
| 1305 | (zone->all_unreclaimable ? "yes" : "no") |
| 1306 | ); |
| 1307 | printk("lowmem_reserve[]:"); |
| 1308 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 1309 | printk(" %lu", zone->lowmem_reserve[i]); |
| 1310 | printk("\n"); |
| 1311 | } |
| 1312 | |
| 1313 | for_each_zone(zone) { |
Kirill Korotaev | 8f9de51 | 2006-06-23 02:03:50 -0700 | [diff] [blame] | 1314 | unsigned long nr[MAX_ORDER], flags, order, total = 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1315 | |
| 1316 | show_node(zone); |
| 1317 | printk("%s: ", zone->name); |
Con Kolivas | f3fe651 | 2006-01-06 00:11:15 -0800 | [diff] [blame] | 1318 | if (!populated_zone(zone)) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1319 | printk("empty\n"); |
| 1320 | continue; |
| 1321 | } |
| 1322 | |
| 1323 | spin_lock_irqsave(&zone->lock, flags); |
| 1324 | for (order = 0; order < MAX_ORDER; order++) { |
Kirill Korotaev | 8f9de51 | 2006-06-23 02:03:50 -0700 | [diff] [blame] | 1325 | nr[order] = zone->free_area[order].nr_free; |
| 1326 | total += nr[order] << order; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1327 | } |
| 1328 | spin_unlock_irqrestore(&zone->lock, flags); |
Kirill Korotaev | 8f9de51 | 2006-06-23 02:03:50 -0700 | [diff] [blame] | 1329 | for (order = 0; order < MAX_ORDER; order++) |
| 1330 | printk("%lu*%lukB ", nr[order], K(1UL) << order); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1331 | printk("= %lukB\n", K(total)); |
| 1332 | } |
| 1333 | |
| 1334 | show_swap_cache_info(); |
| 1335 | } |
| 1336 | |
| 1337 | /* |
| 1338 | * Builds allocation fallback zone lists. |
Christoph Lameter | 1a93205 | 2006-01-06 00:11:16 -0800 | [diff] [blame] | 1339 | * |
| 1340 | * Add all populated zones of a node to the zonelist. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1341 | */ |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 1342 | static int __meminit build_zonelists_node(pg_data_t *pgdat, |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 1343 | struct zonelist *zonelist, int nr_zones, int zone_type) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1344 | { |
Christoph Lameter | 1a93205 | 2006-01-06 00:11:16 -0800 | [diff] [blame] | 1345 | struct zone *zone; |
| 1346 | |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame^] | 1347 | BUG_ON(zone_type >= MAX_NR_ZONES); |
Christoph Lameter | 02a68a5 | 2006-01-06 00:11:18 -0800 | [diff] [blame] | 1348 | |
| 1349 | do { |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 1350 | zone = pgdat->node_zones + zone_type; |
Christoph Lameter | 1a93205 | 2006-01-06 00:11:16 -0800 | [diff] [blame] | 1351 | if (populated_zone(zone)) { |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 1352 | zonelist->zones[nr_zones++] = zone; |
| 1353 | check_highest_zone(zone_type); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1354 | } |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 1355 | zone_type--; |
Christoph Lameter | 02a68a5 | 2006-01-06 00:11:18 -0800 | [diff] [blame] | 1356 | |
Christoph Lameter | 070f803 | 2006-01-06 00:11:19 -0800 | [diff] [blame] | 1357 | } while (zone_type >= 0); |
| 1358 | return nr_zones; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1359 | } |
| 1360 | |
Al Viro | 260b236 | 2005-10-21 03:22:44 -0400 | [diff] [blame] | 1361 | static inline int highest_zone(int zone_bits) |
| 1362 | { |
| 1363 | int res = ZONE_NORMAL; |
| 1364 | if (zone_bits & (__force int)__GFP_HIGHMEM) |
| 1365 | res = ZONE_HIGHMEM; |
Andi Kleen | a2f1b42 | 2005-11-05 17:25:53 +0100 | [diff] [blame] | 1366 | if (zone_bits & (__force int)__GFP_DMA32) |
| 1367 | res = ZONE_DMA32; |
Al Viro | 260b236 | 2005-10-21 03:22:44 -0400 | [diff] [blame] | 1368 | if (zone_bits & (__force int)__GFP_DMA) |
| 1369 | res = ZONE_DMA; |
| 1370 | return res; |
| 1371 | } |
| 1372 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1373 | #ifdef CONFIG_NUMA |
| 1374 | #define MAX_NODE_LOAD (num_online_nodes()) |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 1375 | static int __meminitdata node_load[MAX_NUMNODES]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1376 | /** |
Pavel Pisa | 4dc3b16 | 2005-05-01 08:59:25 -0700 | [diff] [blame] | 1377 | * find_next_best_node - find the next node that should appear in a given node's fallback list |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1378 | * @node: node whose fallback list we're appending |
| 1379 | * @used_node_mask: nodemask_t of already used nodes |
| 1380 | * |
| 1381 | * We use a number of factors to determine which is the next node that should |
| 1382 | * appear on a given node's fallback list. The node should not have appeared |
| 1383 | * already in @node's fallback list, and it should be the next closest node |
| 1384 | * according to the distance array (which contains arbitrary distance values |
| 1385 | * from each node to each node in the system), and should also prefer nodes |
| 1386 | * with no CPUs, since presumably they'll have very little allocation pressure |
| 1387 | * on them otherwise. |
| 1388 | * It returns -1 if no node is found. |
| 1389 | */ |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 1390 | static int __meminit find_next_best_node(int node, nodemask_t *used_node_mask) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1391 | { |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 1392 | int n, val; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1393 | int min_val = INT_MAX; |
| 1394 | int best_node = -1; |
| 1395 | |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 1396 | /* Use the local node if we haven't already */ |
| 1397 | if (!node_isset(node, *used_node_mask)) { |
| 1398 | node_set(node, *used_node_mask); |
| 1399 | return node; |
| 1400 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1401 | |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 1402 | for_each_online_node(n) { |
| 1403 | cpumask_t tmp; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1404 | |
| 1405 | /* Don't want a node to appear more than once */ |
| 1406 | if (node_isset(n, *used_node_mask)) |
| 1407 | continue; |
| 1408 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1409 | /* Use the distance array to find the distance */ |
| 1410 | val = node_distance(node, n); |
| 1411 | |
Linus Torvalds | 4cf808eb | 2006-02-17 20:38:21 +0100 | [diff] [blame] | 1412 | /* Penalize nodes under us ("prefer the next node") */ |
| 1413 | val += (n < node); |
| 1414 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1415 | /* Give preference to headless and unused nodes */ |
| 1416 | tmp = node_to_cpumask(n); |
| 1417 | if (!cpus_empty(tmp)) |
| 1418 | val += PENALTY_FOR_NODE_WITH_CPUS; |
| 1419 | |
| 1420 | /* Slight preference for less loaded node */ |
| 1421 | val *= (MAX_NODE_LOAD*MAX_NUMNODES); |
| 1422 | val += node_load[n]; |
| 1423 | |
| 1424 | if (val < min_val) { |
| 1425 | min_val = val; |
| 1426 | best_node = n; |
| 1427 | } |
| 1428 | } |
| 1429 | |
| 1430 | if (best_node >= 0) |
| 1431 | node_set(best_node, *used_node_mask); |
| 1432 | |
| 1433 | return best_node; |
| 1434 | } |
| 1435 | |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 1436 | static void __meminit build_zonelists(pg_data_t *pgdat) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1437 | { |
| 1438 | int i, j, k, node, local_node; |
| 1439 | int prev_node, load; |
| 1440 | struct zonelist *zonelist; |
| 1441 | nodemask_t used_mask; |
| 1442 | |
| 1443 | /* initialize zonelists */ |
| 1444 | for (i = 0; i < GFP_ZONETYPES; i++) { |
| 1445 | zonelist = pgdat->node_zonelists + i; |
| 1446 | zonelist->zones[0] = NULL; |
| 1447 | } |
| 1448 | |
| 1449 | /* NUMA-aware ordering of nodes */ |
| 1450 | local_node = pgdat->node_id; |
| 1451 | load = num_online_nodes(); |
| 1452 | prev_node = local_node; |
| 1453 | nodes_clear(used_mask); |
| 1454 | while ((node = find_next_best_node(local_node, &used_mask)) >= 0) { |
Christoph Lameter | 9eeff23 | 2006-01-18 17:42:31 -0800 | [diff] [blame] | 1455 | int distance = node_distance(local_node, node); |
| 1456 | |
| 1457 | /* |
| 1458 | * If another node is sufficiently far away then it is better |
| 1459 | * to reclaim pages in a zone before going off node. |
| 1460 | */ |
| 1461 | if (distance > RECLAIM_DISTANCE) |
| 1462 | zone_reclaim_mode = 1; |
| 1463 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1464 | /* |
| 1465 | * We don't want to pressure a particular node. |
| 1466 | * So adding penalty to the first node in same |
| 1467 | * distance group to make it round-robin. |
| 1468 | */ |
Christoph Lameter | 9eeff23 | 2006-01-18 17:42:31 -0800 | [diff] [blame] | 1469 | |
| 1470 | if (distance != node_distance(local_node, prev_node)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1471 | node_load[node] += load; |
| 1472 | prev_node = node; |
| 1473 | load--; |
| 1474 | for (i = 0; i < GFP_ZONETYPES; i++) { |
| 1475 | zonelist = pgdat->node_zonelists + i; |
| 1476 | for (j = 0; zonelist->zones[j] != NULL; j++); |
| 1477 | |
Al Viro | 260b236 | 2005-10-21 03:22:44 -0400 | [diff] [blame] | 1478 | k = highest_zone(i); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1479 | |
| 1480 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, k); |
| 1481 | zonelist->zones[j] = NULL; |
| 1482 | } |
| 1483 | } |
| 1484 | } |
| 1485 | |
| 1486 | #else /* CONFIG_NUMA */ |
| 1487 | |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 1488 | static void __meminit build_zonelists(pg_data_t *pgdat) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1489 | { |
| 1490 | int i, j, k, node, local_node; |
| 1491 | |
| 1492 | local_node = pgdat->node_id; |
| 1493 | for (i = 0; i < GFP_ZONETYPES; i++) { |
| 1494 | struct zonelist *zonelist; |
| 1495 | |
| 1496 | zonelist = pgdat->node_zonelists + i; |
| 1497 | |
| 1498 | j = 0; |
Al Viro | 260b236 | 2005-10-21 03:22:44 -0400 | [diff] [blame] | 1499 | k = highest_zone(i); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1500 | j = build_zonelists_node(pgdat, zonelist, j, k); |
| 1501 | /* |
| 1502 | * Now we build the zonelist so that it contains the zones |
| 1503 | * of all the other nodes. |
| 1504 | * We don't want to pressure a particular node, so when |
| 1505 | * building the zones for node N, we make sure that the |
| 1506 | * zones coming right after the local ones are those from |
| 1507 | * node N+1 (modulo N) |
| 1508 | */ |
| 1509 | for (node = local_node + 1; node < MAX_NUMNODES; node++) { |
| 1510 | if (!node_online(node)) |
| 1511 | continue; |
| 1512 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, k); |
| 1513 | } |
| 1514 | for (node = 0; node < local_node; node++) { |
| 1515 | if (!node_online(node)) |
| 1516 | continue; |
| 1517 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, k); |
| 1518 | } |
| 1519 | |
| 1520 | zonelist->zones[j] = NULL; |
| 1521 | } |
| 1522 | } |
| 1523 | |
| 1524 | #endif /* CONFIG_NUMA */ |
| 1525 | |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 1526 | /* return values int ....just for stop_machine_run() */ |
| 1527 | static int __meminit __build_all_zonelists(void *dummy) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1528 | { |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 1529 | int nid; |
| 1530 | for_each_online_node(nid) |
| 1531 | build_zonelists(NODE_DATA(nid)); |
| 1532 | return 0; |
| 1533 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1534 | |
Yasunori Goto | 6811378 | 2006-06-23 02:03:11 -0700 | [diff] [blame] | 1535 | void __meminit build_all_zonelists(void) |
| 1536 | { |
| 1537 | if (system_state == SYSTEM_BOOTING) { |
| 1538 | __build_all_zonelists(0); |
| 1539 | cpuset_init_current_mems_allowed(); |
| 1540 | } else { |
| 1541 | /* we have to stop all cpus to guaranntee there is no user |
| 1542 | of zonelist */ |
| 1543 | stop_machine_run(__build_all_zonelists, NULL, NR_CPUS); |
| 1544 | /* cpuset refresh routine should be here */ |
| 1545 | } |
Andrew Morton | bd1e22b | 2006-06-23 02:03:47 -0700 | [diff] [blame] | 1546 | vm_total_pages = nr_free_pagecache_pages(); |
| 1547 | printk("Built %i zonelists. Total pages: %ld\n", |
| 1548 | num_online_nodes(), vm_total_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1549 | } |
| 1550 | |
| 1551 | /* |
| 1552 | * Helper functions to size the waitqueue hash table. |
| 1553 | * Essentially these want to choose hash table sizes sufficiently |
| 1554 | * large so that collisions trying to wait on pages are rare. |
| 1555 | * But in fact, the number of active page waitqueues on typical |
| 1556 | * systems is ridiculously low, less than 200. So this is even |
| 1557 | * conservative, even though it seems large. |
| 1558 | * |
| 1559 | * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to |
| 1560 | * waitqueues, i.e. the size of the waitq table given the number of pages. |
| 1561 | */ |
| 1562 | #define PAGES_PER_WAITQUEUE 256 |
| 1563 | |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1564 | #ifndef CONFIG_MEMORY_HOTPLUG |
Yasunori Goto | 02b694d | 2006-06-23 02:03:08 -0700 | [diff] [blame] | 1565 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1566 | { |
| 1567 | unsigned long size = 1; |
| 1568 | |
| 1569 | pages /= PAGES_PER_WAITQUEUE; |
| 1570 | |
| 1571 | while (size < pages) |
| 1572 | size <<= 1; |
| 1573 | |
| 1574 | /* |
| 1575 | * Once we have dozens or even hundreds of threads sleeping |
| 1576 | * on IO we've got bigger problems than wait queue collision. |
| 1577 | * Limit the size of the wait table to a reasonable size. |
| 1578 | */ |
| 1579 | size = min(size, 4096UL); |
| 1580 | |
| 1581 | return max(size, 4UL); |
| 1582 | } |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1583 | #else |
| 1584 | /* |
| 1585 | * A zone's size might be changed by hot-add, so it is not possible to determine |
| 1586 | * a suitable size for its wait_table. So we use the maximum size now. |
| 1587 | * |
| 1588 | * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie: |
| 1589 | * |
| 1590 | * i386 (preemption config) : 4096 x 16 = 64Kbyte. |
| 1591 | * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte. |
| 1592 | * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte. |
| 1593 | * |
| 1594 | * The maximum entries are prepared when a zone's memory is (512K + 256) pages |
| 1595 | * or more by the traditional way. (See above). It equals: |
| 1596 | * |
| 1597 | * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte. |
| 1598 | * ia64(16K page size) : = ( 8G + 4M)byte. |
| 1599 | * powerpc (64K page size) : = (32G +16M)byte. |
| 1600 | */ |
| 1601 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) |
| 1602 | { |
| 1603 | return 4096UL; |
| 1604 | } |
| 1605 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1606 | |
| 1607 | /* |
| 1608 | * This is an integer logarithm so that shifts can be used later |
| 1609 | * to extract the more random high bits from the multiplicative |
| 1610 | * hash function before the remainder is taken. |
| 1611 | */ |
| 1612 | static inline unsigned long wait_table_bits(unsigned long size) |
| 1613 | { |
| 1614 | return ffz(~size); |
| 1615 | } |
| 1616 | |
| 1617 | #define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1)) |
| 1618 | |
| 1619 | static void __init calculate_zone_totalpages(struct pglist_data *pgdat, |
| 1620 | unsigned long *zones_size, unsigned long *zholes_size) |
| 1621 | { |
| 1622 | unsigned long realtotalpages, totalpages = 0; |
| 1623 | int i; |
| 1624 | |
| 1625 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 1626 | totalpages += zones_size[i]; |
| 1627 | pgdat->node_spanned_pages = totalpages; |
| 1628 | |
| 1629 | realtotalpages = totalpages; |
| 1630 | if (zholes_size) |
| 1631 | for (i = 0; i < MAX_NR_ZONES; i++) |
| 1632 | realtotalpages -= zholes_size[i]; |
| 1633 | pgdat->node_present_pages = realtotalpages; |
| 1634 | printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id, realtotalpages); |
| 1635 | } |
| 1636 | |
| 1637 | |
| 1638 | /* |
| 1639 | * Initially all pages are reserved - free ones are freed |
| 1640 | * up by free_all_bootmem() once the early boot process is |
| 1641 | * done. Non-atomic initialization, single-pass. |
| 1642 | */ |
Matt Tolentino | c09b424 | 2006-01-17 07:03:44 +0100 | [diff] [blame] | 1643 | void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1644 | unsigned long start_pfn) |
| 1645 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1646 | struct page *page; |
Andy Whitcroft | 29751f6 | 2005-06-23 00:08:00 -0700 | [diff] [blame] | 1647 | unsigned long end_pfn = start_pfn + size; |
| 1648 | unsigned long pfn; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1649 | |
Greg Ungerer | cbe8dd4 | 2006-01-12 01:05:24 -0800 | [diff] [blame] | 1650 | for (pfn = start_pfn; pfn < end_pfn; pfn++) { |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 1651 | if (!early_pfn_valid(pfn)) |
| 1652 | continue; |
| 1653 | page = pfn_to_page(pfn); |
| 1654 | set_page_links(page, zone, nid, pfn); |
Nick Piggin | 7835e98 | 2006-03-22 00:08:40 -0800 | [diff] [blame] | 1655 | init_page_count(page); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1656 | reset_page_mapcount(page); |
| 1657 | SetPageReserved(page); |
| 1658 | INIT_LIST_HEAD(&page->lru); |
| 1659 | #ifdef WANT_PAGE_VIRTUAL |
| 1660 | /* The shift won't overflow because ZONE_NORMAL is below 4G. */ |
| 1661 | if (!is_highmem_idx(zone)) |
Bob Picco | 3212c6b | 2005-06-27 14:36:28 -0700 | [diff] [blame] | 1662 | set_page_address(page, __va(pfn << PAGE_SHIFT)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1663 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1664 | } |
| 1665 | } |
| 1666 | |
| 1667 | void zone_init_free_lists(struct pglist_data *pgdat, struct zone *zone, |
| 1668 | unsigned long size) |
| 1669 | { |
| 1670 | int order; |
| 1671 | for (order = 0; order < MAX_ORDER ; order++) { |
| 1672 | INIT_LIST_HEAD(&zone->free_area[order].free_list); |
| 1673 | zone->free_area[order].nr_free = 0; |
| 1674 | } |
| 1675 | } |
| 1676 | |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 1677 | #define ZONETABLE_INDEX(x, zone_nr) ((x << ZONES_SHIFT) | zone_nr) |
| 1678 | void zonetable_add(struct zone *zone, int nid, int zid, unsigned long pfn, |
| 1679 | unsigned long size) |
| 1680 | { |
| 1681 | unsigned long snum = pfn_to_section_nr(pfn); |
| 1682 | unsigned long end = pfn_to_section_nr(pfn + size); |
| 1683 | |
| 1684 | if (FLAGS_HAS_NODE) |
| 1685 | zone_table[ZONETABLE_INDEX(nid, zid)] = zone; |
| 1686 | else |
| 1687 | for (; snum <= end; snum++) |
| 1688 | zone_table[ZONETABLE_INDEX(snum, zid)] = zone; |
| 1689 | } |
| 1690 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1691 | #ifndef __HAVE_ARCH_MEMMAP_INIT |
| 1692 | #define memmap_init(size, nid, zone, start_pfn) \ |
| 1693 | memmap_init_zone((size), (nid), (zone), (start_pfn)) |
| 1694 | #endif |
| 1695 | |
Ashok Raj | 6292d9a | 2006-02-01 03:04:44 -0800 | [diff] [blame] | 1696 | static int __cpuinit zone_batchsize(struct zone *zone) |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1697 | { |
| 1698 | int batch; |
| 1699 | |
| 1700 | /* |
| 1701 | * The per-cpu-pages pools are set to around 1000th of the |
Seth, Rohit | ba56e91 | 2005-10-29 18:15:47 -0700 | [diff] [blame] | 1702 | * size of the zone. But no more than 1/2 of a meg. |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1703 | * |
| 1704 | * OK, so we don't know how big the cache is. So guess. |
| 1705 | */ |
| 1706 | batch = zone->present_pages / 1024; |
Seth, Rohit | ba56e91 | 2005-10-29 18:15:47 -0700 | [diff] [blame] | 1707 | if (batch * PAGE_SIZE > 512 * 1024) |
| 1708 | batch = (512 * 1024) / PAGE_SIZE; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1709 | batch /= 4; /* We effectively *= 4 below */ |
| 1710 | if (batch < 1) |
| 1711 | batch = 1; |
| 1712 | |
| 1713 | /* |
Nick Piggin | 0ceaacc | 2005-12-04 13:55:25 +1100 | [diff] [blame] | 1714 | * Clamp the batch to a 2^n - 1 value. Having a power |
| 1715 | * of 2 value was found to be more likely to have |
| 1716 | * suboptimal cache aliasing properties in some cases. |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1717 | * |
Nick Piggin | 0ceaacc | 2005-12-04 13:55:25 +1100 | [diff] [blame] | 1718 | * For example if 2 tasks are alternately allocating |
| 1719 | * batches of pages, one task can end up with a lot |
| 1720 | * of pages of one half of the possible page colors |
| 1721 | * and the other with pages of the other colors. |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1722 | */ |
Nick Piggin | 0ceaacc | 2005-12-04 13:55:25 +1100 | [diff] [blame] | 1723 | batch = (1 << (fls(batch + batch/2)-1)) - 1; |
Seth, Rohit | ba56e91 | 2005-10-29 18:15:47 -0700 | [diff] [blame] | 1724 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1725 | return batch; |
| 1726 | } |
| 1727 | |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1728 | inline void setup_pageset(struct per_cpu_pageset *p, unsigned long batch) |
| 1729 | { |
| 1730 | struct per_cpu_pages *pcp; |
| 1731 | |
Magnus Damm | 1c6fe94 | 2005-10-26 01:58:59 -0700 | [diff] [blame] | 1732 | memset(p, 0, sizeof(*p)); |
| 1733 | |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1734 | pcp = &p->pcp[0]; /* hot */ |
| 1735 | pcp->count = 0; |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1736 | pcp->high = 6 * batch; |
| 1737 | pcp->batch = max(1UL, 1 * batch); |
| 1738 | INIT_LIST_HEAD(&pcp->list); |
| 1739 | |
| 1740 | pcp = &p->pcp[1]; /* cold*/ |
| 1741 | pcp->count = 0; |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1742 | pcp->high = 2 * batch; |
Seth, Rohit | e46a5e2 | 2005-10-29 18:15:48 -0700 | [diff] [blame] | 1743 | pcp->batch = max(1UL, batch/2); |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1744 | INIT_LIST_HEAD(&pcp->list); |
| 1745 | } |
| 1746 | |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 1747 | /* |
| 1748 | * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist |
| 1749 | * to the value high for the pageset p. |
| 1750 | */ |
| 1751 | |
| 1752 | static void setup_pagelist_highmark(struct per_cpu_pageset *p, |
| 1753 | unsigned long high) |
| 1754 | { |
| 1755 | struct per_cpu_pages *pcp; |
| 1756 | |
| 1757 | pcp = &p->pcp[0]; /* hot list */ |
| 1758 | pcp->high = high; |
| 1759 | pcp->batch = max(1UL, high/4); |
| 1760 | if ((high/4) > (PAGE_SHIFT * 8)) |
| 1761 | pcp->batch = PAGE_SHIFT * 8; |
| 1762 | } |
| 1763 | |
| 1764 | |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1765 | #ifdef CONFIG_NUMA |
| 1766 | /* |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1767 | * Boot pageset table. One per cpu which is going to be used for all |
| 1768 | * zones and all nodes. The parameters will be set in such a way |
| 1769 | * that an item put on a list will immediately be handed over to |
| 1770 | * the buddy list. This is safe since pageset manipulation is done |
| 1771 | * with interrupts disabled. |
| 1772 | * |
| 1773 | * Some NUMA counter updates may also be caught by the boot pagesets. |
Christoph Lameter | b7c84c6 | 2005-06-22 20:26:07 -0700 | [diff] [blame] | 1774 | * |
| 1775 | * The boot_pagesets must be kept even after bootup is complete for |
| 1776 | * unused processors and/or zones. They do play a role for bootstrapping |
| 1777 | * hotplugged processors. |
| 1778 | * |
| 1779 | * zoneinfo_show() and maybe other functions do |
| 1780 | * not check if the processor is online before following the pageset pointer. |
| 1781 | * Other parts of the kernel may not check if the zone is available. |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1782 | */ |
Eric Dumazet | 88a2a4ac | 2006-02-04 23:27:36 -0800 | [diff] [blame] | 1783 | static struct per_cpu_pageset boot_pageset[NR_CPUS]; |
Christoph Lameter | 2caaad4 | 2005-06-21 17:15:00 -0700 | [diff] [blame] | 1784 | |
| 1785 | /* |
| 1786 | * Dynamically allocate memory for the |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1787 | * per cpu pageset array in struct zone. |
| 1788 | */ |
Ashok Raj | 6292d9a | 2006-02-01 03:04:44 -0800 | [diff] [blame] | 1789 | static int __cpuinit process_zones(int cpu) |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1790 | { |
| 1791 | struct zone *zone, *dzone; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1792 | |
| 1793 | for_each_zone(zone) { |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1794 | |
Nick Piggin | 23316bc | 2006-01-08 01:00:41 -0800 | [diff] [blame] | 1795 | zone_pcp(zone, cpu) = kmalloc_node(sizeof(struct per_cpu_pageset), |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1796 | GFP_KERNEL, cpu_to_node(cpu)); |
Nick Piggin | 23316bc | 2006-01-08 01:00:41 -0800 | [diff] [blame] | 1797 | if (!zone_pcp(zone, cpu)) |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1798 | goto bad; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1799 | |
Nick Piggin | 23316bc | 2006-01-08 01:00:41 -0800 | [diff] [blame] | 1800 | setup_pageset(zone_pcp(zone, cpu), zone_batchsize(zone)); |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 1801 | |
| 1802 | if (percpu_pagelist_fraction) |
| 1803 | setup_pagelist_highmark(zone_pcp(zone, cpu), |
| 1804 | (zone->present_pages / percpu_pagelist_fraction)); |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1805 | } |
| 1806 | |
| 1807 | return 0; |
| 1808 | bad: |
| 1809 | for_each_zone(dzone) { |
| 1810 | if (dzone == zone) |
| 1811 | break; |
Nick Piggin | 23316bc | 2006-01-08 01:00:41 -0800 | [diff] [blame] | 1812 | kfree(zone_pcp(dzone, cpu)); |
| 1813 | zone_pcp(dzone, cpu) = NULL; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1814 | } |
| 1815 | return -ENOMEM; |
| 1816 | } |
| 1817 | |
| 1818 | static inline void free_zone_pagesets(int cpu) |
| 1819 | { |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1820 | struct zone *zone; |
| 1821 | |
| 1822 | for_each_zone(zone) { |
| 1823 | struct per_cpu_pageset *pset = zone_pcp(zone, cpu); |
| 1824 | |
David Rientjes | f3ef9ea | 2006-09-25 16:24:57 -0700 | [diff] [blame] | 1825 | /* Free per_cpu_pageset if it is slab allocated */ |
| 1826 | if (pset != &boot_pageset[cpu]) |
| 1827 | kfree(pset); |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1828 | zone_pcp(zone, cpu) = NULL; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1829 | } |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1830 | } |
| 1831 | |
Chandra Seetharaman | 9c7b216 | 2006-06-27 02:54:07 -0700 | [diff] [blame] | 1832 | static int __cpuinit pageset_cpuup_callback(struct notifier_block *nfb, |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1833 | unsigned long action, |
| 1834 | void *hcpu) |
| 1835 | { |
| 1836 | int cpu = (long)hcpu; |
| 1837 | int ret = NOTIFY_OK; |
| 1838 | |
| 1839 | switch (action) { |
| 1840 | case CPU_UP_PREPARE: |
| 1841 | if (process_zones(cpu)) |
| 1842 | ret = NOTIFY_BAD; |
| 1843 | break; |
Andi Kleen | b0d4169 | 2005-11-05 17:25:53 +0100 | [diff] [blame] | 1844 | case CPU_UP_CANCELED: |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1845 | case CPU_DEAD: |
| 1846 | free_zone_pagesets(cpu); |
| 1847 | break; |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1848 | default: |
| 1849 | break; |
| 1850 | } |
| 1851 | return ret; |
| 1852 | } |
| 1853 | |
Chandra Seetharaman | 74b85f3 | 2006-06-27 02:54:09 -0700 | [diff] [blame] | 1854 | static struct notifier_block __cpuinitdata pageset_notifier = |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1855 | { &pageset_cpuup_callback, NULL, 0 }; |
| 1856 | |
Al Viro | 78d9955 | 2005-12-15 09:18:25 +0000 | [diff] [blame] | 1857 | void __init setup_per_cpu_pageset(void) |
Christoph Lameter | e7c8d5c | 2005-06-21 17:14:47 -0700 | [diff] [blame] | 1858 | { |
| 1859 | int err; |
| 1860 | |
| 1861 | /* Initialize per_cpu_pageset for cpu 0. |
| 1862 | * A cpuup callback will do this for every cpu |
| 1863 | * as it comes online |
| 1864 | */ |
| 1865 | err = process_zones(smp_processor_id()); |
| 1866 | BUG_ON(err); |
| 1867 | register_cpu_notifier(&pageset_notifier); |
| 1868 | } |
| 1869 | |
| 1870 | #endif |
| 1871 | |
Matt Tolentino | c09b424 | 2006-01-17 07:03:44 +0100 | [diff] [blame] | 1872 | static __meminit |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1873 | int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1874 | { |
| 1875 | int i; |
| 1876 | struct pglist_data *pgdat = zone->zone_pgdat; |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1877 | size_t alloc_size; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1878 | |
| 1879 | /* |
| 1880 | * The per-page waitqueue mechanism uses hashed waitqueues |
| 1881 | * per zone. |
| 1882 | */ |
Yasunori Goto | 02b694d | 2006-06-23 02:03:08 -0700 | [diff] [blame] | 1883 | zone->wait_table_hash_nr_entries = |
| 1884 | wait_table_hash_nr_entries(zone_size_pages); |
| 1885 | zone->wait_table_bits = |
| 1886 | wait_table_bits(zone->wait_table_hash_nr_entries); |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1887 | alloc_size = zone->wait_table_hash_nr_entries |
| 1888 | * sizeof(wait_queue_head_t); |
| 1889 | |
| 1890 | if (system_state == SYSTEM_BOOTING) { |
| 1891 | zone->wait_table = (wait_queue_head_t *) |
| 1892 | alloc_bootmem_node(pgdat, alloc_size); |
| 1893 | } else { |
| 1894 | /* |
| 1895 | * This case means that a zone whose size was 0 gets new memory |
| 1896 | * via memory hot-add. |
| 1897 | * But it may be the case that a new node was hot-added. In |
| 1898 | * this case vmalloc() will not be able to use this new node's |
| 1899 | * memory - this wait_table must be initialized to use this new |
| 1900 | * node itself as well. |
| 1901 | * To use this new node's memory, further consideration will be |
| 1902 | * necessary. |
| 1903 | */ |
| 1904 | zone->wait_table = (wait_queue_head_t *)vmalloc(alloc_size); |
| 1905 | } |
| 1906 | if (!zone->wait_table) |
| 1907 | return -ENOMEM; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1908 | |
Yasunori Goto | 02b694d | 2006-06-23 02:03:08 -0700 | [diff] [blame] | 1909 | for(i = 0; i < zone->wait_table_hash_nr_entries; ++i) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1910 | init_waitqueue_head(zone->wait_table + i); |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1911 | |
| 1912 | return 0; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1913 | } |
| 1914 | |
Matt Tolentino | c09b424 | 2006-01-17 07:03:44 +0100 | [diff] [blame] | 1915 | static __meminit void zone_pcp_init(struct zone *zone) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1916 | { |
| 1917 | int cpu; |
| 1918 | unsigned long batch = zone_batchsize(zone); |
| 1919 | |
| 1920 | for (cpu = 0; cpu < NR_CPUS; cpu++) { |
| 1921 | #ifdef CONFIG_NUMA |
| 1922 | /* Early boot. Slab allocator not functional yet */ |
Nick Piggin | 23316bc | 2006-01-08 01:00:41 -0800 | [diff] [blame] | 1923 | zone_pcp(zone, cpu) = &boot_pageset[cpu]; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1924 | setup_pageset(&boot_pageset[cpu],0); |
| 1925 | #else |
| 1926 | setup_pageset(zone_pcp(zone,cpu), batch); |
| 1927 | #endif |
| 1928 | } |
Anton Blanchard | f5335c0 | 2006-03-25 03:06:49 -0800 | [diff] [blame] | 1929 | if (zone->present_pages) |
| 1930 | printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%lu\n", |
| 1931 | zone->name, zone->present_pages, batch); |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1932 | } |
| 1933 | |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1934 | __meminit int init_currently_empty_zone(struct zone *zone, |
| 1935 | unsigned long zone_start_pfn, |
| 1936 | unsigned long size) |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1937 | { |
| 1938 | struct pglist_data *pgdat = zone->zone_pgdat; |
Yasunori Goto | cca448f | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1939 | int ret; |
| 1940 | ret = zone_wait_table_init(zone, size); |
| 1941 | if (ret) |
| 1942 | return ret; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1943 | pgdat->nr_zones = zone_idx(zone) + 1; |
| 1944 | |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1945 | zone->zone_start_pfn = zone_start_pfn; |
| 1946 | |
| 1947 | memmap_init(size, pgdat->node_id, zone_idx(zone), zone_start_pfn); |
| 1948 | |
| 1949 | zone_init_free_lists(pgdat, zone, zone->spanned_pages); |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1950 | |
| 1951 | return 0; |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1952 | } |
| 1953 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1954 | /* |
| 1955 | * Set up the zone data structures: |
| 1956 | * - mark all pages reserved |
| 1957 | * - mark all memory queues empty |
| 1958 | * - clear the memory bitmaps |
| 1959 | */ |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 1960 | static void __meminit free_area_init_core(struct pglist_data *pgdat, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1961 | unsigned long *zones_size, unsigned long *zholes_size) |
| 1962 | { |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 1963 | unsigned long j; |
| 1964 | int nid = pgdat->node_id; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1965 | unsigned long zone_start_pfn = pgdat->node_start_pfn; |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 1966 | int ret; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1967 | |
Dave Hansen | 208d54e | 2005-10-29 18:16:52 -0700 | [diff] [blame] | 1968 | pgdat_resize_init(pgdat); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1969 | pgdat->nr_zones = 0; |
| 1970 | init_waitqueue_head(&pgdat->kswapd_wait); |
| 1971 | pgdat->kswapd_max_order = 0; |
| 1972 | |
| 1973 | for (j = 0; j < MAX_NR_ZONES; j++) { |
| 1974 | struct zone *zone = pgdat->node_zones + j; |
| 1975 | unsigned long size, realsize; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1976 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1977 | realsize = size = zones_size[j]; |
| 1978 | if (zholes_size) |
| 1979 | realsize -= zholes_size[j]; |
| 1980 | |
Christoph Lameter | 98d2b0e | 2006-09-25 23:31:12 -0700 | [diff] [blame^] | 1981 | if (!is_highmem_idx(j)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1982 | nr_kernel_pages += realsize; |
| 1983 | nr_all_pages += realsize; |
| 1984 | |
| 1985 | zone->spanned_pages = size; |
| 1986 | zone->present_pages = realsize; |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 1987 | #ifdef CONFIG_NUMA |
| 1988 | zone->min_unmapped_ratio = (realsize*sysctl_min_unmapped_ratio) |
| 1989 | / 100; |
| 1990 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1991 | zone->name = zone_names[j]; |
| 1992 | spin_lock_init(&zone->lock); |
| 1993 | spin_lock_init(&zone->lru_lock); |
Dave Hansen | bdc8cb9 | 2005-10-29 18:16:53 -0700 | [diff] [blame] | 1994 | zone_seqlock_init(zone); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1995 | zone->zone_pgdat = pgdat; |
| 1996 | zone->free_pages = 0; |
| 1997 | |
| 1998 | zone->temp_priority = zone->prev_priority = DEF_PRIORITY; |
| 1999 | |
Dave Hansen | ed8ece2 | 2005-10-29 18:16:50 -0700 | [diff] [blame] | 2000 | zone_pcp_init(zone); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2001 | INIT_LIST_HEAD(&zone->active_list); |
| 2002 | INIT_LIST_HEAD(&zone->inactive_list); |
| 2003 | zone->nr_scan_active = 0; |
| 2004 | zone->nr_scan_inactive = 0; |
| 2005 | zone->nr_active = 0; |
| 2006 | zone->nr_inactive = 0; |
Christoph Lameter | 2244b95 | 2006-06-30 01:55:33 -0700 | [diff] [blame] | 2007 | zap_zone_vm_stats(zone); |
Martin Hicks | 53e9a61 | 2005-09-03 15:54:51 -0700 | [diff] [blame] | 2008 | atomic_set(&zone->reclaim_in_progress, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2009 | if (!size) |
| 2010 | continue; |
| 2011 | |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 2012 | zonetable_add(zone, nid, j, zone_start_pfn, size); |
Yasunori Goto | 718127c | 2006-06-23 02:03:10 -0700 | [diff] [blame] | 2013 | ret = init_currently_empty_zone(zone, zone_start_pfn, size); |
| 2014 | BUG_ON(ret); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2015 | zone_start_pfn += size; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2016 | } |
| 2017 | } |
| 2018 | |
| 2019 | static void __init alloc_node_mem_map(struct pglist_data *pgdat) |
| 2020 | { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2021 | /* Skip empty nodes */ |
| 2022 | if (!pgdat->node_spanned_pages) |
| 2023 | return; |
| 2024 | |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 2025 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2026 | /* ia64 gets its own node_mem_map, before this, without bootmem */ |
| 2027 | if (!pgdat->node_mem_map) { |
Bob Picco | e984bb4 | 2006-05-20 15:00:31 -0700 | [diff] [blame] | 2028 | unsigned long size, start, end; |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 2029 | struct page *map; |
| 2030 | |
Bob Picco | e984bb4 | 2006-05-20 15:00:31 -0700 | [diff] [blame] | 2031 | /* |
| 2032 | * The zone's endpoints aren't required to be MAX_ORDER |
| 2033 | * aligned but the node_mem_map endpoints must be in order |
| 2034 | * for the buddy allocator to function correctly. |
| 2035 | */ |
| 2036 | start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1); |
| 2037 | end = pgdat->node_start_pfn + pgdat->node_spanned_pages; |
| 2038 | end = ALIGN(end, MAX_ORDER_NR_PAGES); |
| 2039 | size = (end - start) * sizeof(struct page); |
Dave Hansen | 6f167ec | 2005-06-23 00:07:39 -0700 | [diff] [blame] | 2040 | map = alloc_remap(pgdat->node_id, size); |
| 2041 | if (!map) |
| 2042 | map = alloc_bootmem_node(pgdat, size); |
Bob Picco | e984bb4 | 2006-05-20 15:00:31 -0700 | [diff] [blame] | 2043 | pgdat->node_mem_map = map + (pgdat->node_start_pfn - start); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2044 | } |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 2045 | #ifdef CONFIG_FLATMEM |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2046 | /* |
| 2047 | * With no DISCONTIG, the global mem_map is just set as node 0's |
| 2048 | */ |
| 2049 | if (pgdat == NODE_DATA(0)) |
| 2050 | mem_map = NODE_DATA(0)->node_mem_map; |
| 2051 | #endif |
Andy Whitcroft | d41dee3 | 2005-06-23 00:07:54 -0700 | [diff] [blame] | 2052 | #endif /* CONFIG_FLAT_NODE_MEM_MAP */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2053 | } |
| 2054 | |
Yasunori Goto | 86356ab | 2006-06-23 02:03:09 -0700 | [diff] [blame] | 2055 | void __meminit free_area_init_node(int nid, struct pglist_data *pgdat, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2056 | unsigned long *zones_size, unsigned long node_start_pfn, |
| 2057 | unsigned long *zholes_size) |
| 2058 | { |
| 2059 | pgdat->node_id = nid; |
| 2060 | pgdat->node_start_pfn = node_start_pfn; |
| 2061 | calculate_zone_totalpages(pgdat, zones_size, zholes_size); |
| 2062 | |
| 2063 | alloc_node_mem_map(pgdat); |
| 2064 | |
| 2065 | free_area_init_core(pgdat, zones_size, zholes_size); |
| 2066 | } |
| 2067 | |
Dave Hansen | 93b7504 | 2005-06-23 00:07:47 -0700 | [diff] [blame] | 2068 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2069 | static bootmem_data_t contig_bootmem_data; |
| 2070 | struct pglist_data contig_page_data = { .bdata = &contig_bootmem_data }; |
| 2071 | |
| 2072 | EXPORT_SYMBOL(contig_page_data); |
Dave Hansen | 93b7504 | 2005-06-23 00:07:47 -0700 | [diff] [blame] | 2073 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2074 | |
| 2075 | void __init free_area_init(unsigned long *zones_size) |
| 2076 | { |
Dave Hansen | 93b7504 | 2005-06-23 00:07:47 -0700 | [diff] [blame] | 2077 | free_area_init_node(0, NODE_DATA(0), zones_size, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2078 | __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL); |
| 2079 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2080 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2081 | #ifdef CONFIG_HOTPLUG_CPU |
| 2082 | static int page_alloc_cpu_notify(struct notifier_block *self, |
| 2083 | unsigned long action, void *hcpu) |
| 2084 | { |
| 2085 | int cpu = (unsigned long)hcpu; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2086 | |
| 2087 | if (action == CPU_DEAD) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2088 | local_irq_disable(); |
| 2089 | __drain_pages(cpu); |
Christoph Lameter | f8891e5 | 2006-06-30 01:55:45 -0700 | [diff] [blame] | 2090 | vm_events_fold_cpu(cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2091 | local_irq_enable(); |
Christoph Lameter | 2244b95 | 2006-06-30 01:55:33 -0700 | [diff] [blame] | 2092 | refresh_cpu_vm_stats(cpu); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2093 | } |
| 2094 | return NOTIFY_OK; |
| 2095 | } |
| 2096 | #endif /* CONFIG_HOTPLUG_CPU */ |
| 2097 | |
| 2098 | void __init page_alloc_init(void) |
| 2099 | { |
| 2100 | hotcpu_notifier(page_alloc_cpu_notify, 0); |
| 2101 | } |
| 2102 | |
| 2103 | /* |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 2104 | * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio |
| 2105 | * or min_free_kbytes changes. |
| 2106 | */ |
| 2107 | static void calculate_totalreserve_pages(void) |
| 2108 | { |
| 2109 | struct pglist_data *pgdat; |
| 2110 | unsigned long reserve_pages = 0; |
| 2111 | int i, j; |
| 2112 | |
| 2113 | for_each_online_pgdat(pgdat) { |
| 2114 | for (i = 0; i < MAX_NR_ZONES; i++) { |
| 2115 | struct zone *zone = pgdat->node_zones + i; |
| 2116 | unsigned long max = 0; |
| 2117 | |
| 2118 | /* Find valid and maximum lowmem_reserve in the zone */ |
| 2119 | for (j = i; j < MAX_NR_ZONES; j++) { |
| 2120 | if (zone->lowmem_reserve[j] > max) |
| 2121 | max = zone->lowmem_reserve[j]; |
| 2122 | } |
| 2123 | |
| 2124 | /* we treat pages_high as reserved pages. */ |
| 2125 | max += zone->pages_high; |
| 2126 | |
| 2127 | if (max > zone->present_pages) |
| 2128 | max = zone->present_pages; |
| 2129 | reserve_pages += max; |
| 2130 | } |
| 2131 | } |
| 2132 | totalreserve_pages = reserve_pages; |
| 2133 | } |
| 2134 | |
| 2135 | /* |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2136 | * setup_per_zone_lowmem_reserve - called whenever |
| 2137 | * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone |
| 2138 | * has a correct pages reserved value, so an adequate number of |
| 2139 | * pages are left in the zone after a successful __alloc_pages(). |
| 2140 | */ |
| 2141 | static void setup_per_zone_lowmem_reserve(void) |
| 2142 | { |
| 2143 | struct pglist_data *pgdat; |
| 2144 | int j, idx; |
| 2145 | |
KAMEZAWA Hiroyuki | ec936fc | 2006-03-27 01:15:59 -0800 | [diff] [blame] | 2146 | for_each_online_pgdat(pgdat) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2147 | for (j = 0; j < MAX_NR_ZONES; j++) { |
| 2148 | struct zone *zone = pgdat->node_zones + j; |
| 2149 | unsigned long present_pages = zone->present_pages; |
| 2150 | |
| 2151 | zone->lowmem_reserve[j] = 0; |
| 2152 | |
| 2153 | for (idx = j-1; idx >= 0; idx--) { |
| 2154 | struct zone *lower_zone; |
| 2155 | |
| 2156 | if (sysctl_lowmem_reserve_ratio[idx] < 1) |
| 2157 | sysctl_lowmem_reserve_ratio[idx] = 1; |
| 2158 | |
| 2159 | lower_zone = pgdat->node_zones + idx; |
| 2160 | lower_zone->lowmem_reserve[j] = present_pages / |
| 2161 | sysctl_lowmem_reserve_ratio[idx]; |
| 2162 | present_pages += lower_zone->present_pages; |
| 2163 | } |
| 2164 | } |
| 2165 | } |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 2166 | |
| 2167 | /* update totalreserve_pages */ |
| 2168 | calculate_totalreserve_pages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2169 | } |
| 2170 | |
| 2171 | /* |
| 2172 | * setup_per_zone_pages_min - called when min_free_kbytes changes. Ensures |
| 2173 | * that the pages_{min,low,high} values for each zone are set correctly |
| 2174 | * with respect to min_free_kbytes. |
| 2175 | */ |
Dave Hansen | 3947be1 | 2005-10-29 18:16:54 -0700 | [diff] [blame] | 2176 | void setup_per_zone_pages_min(void) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2177 | { |
| 2178 | unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10); |
| 2179 | unsigned long lowmem_pages = 0; |
| 2180 | struct zone *zone; |
| 2181 | unsigned long flags; |
| 2182 | |
| 2183 | /* Calculate total number of !ZONE_HIGHMEM pages */ |
| 2184 | for_each_zone(zone) { |
| 2185 | if (!is_highmem(zone)) |
| 2186 | lowmem_pages += zone->present_pages; |
| 2187 | } |
| 2188 | |
| 2189 | for_each_zone(zone) { |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 2190 | u64 tmp; |
| 2191 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2192 | spin_lock_irqsave(&zone->lru_lock, flags); |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 2193 | tmp = (u64)pages_min * zone->present_pages; |
| 2194 | do_div(tmp, lowmem_pages); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2195 | if (is_highmem(zone)) { |
| 2196 | /* |
Nick Piggin | 669ed17 | 2005-11-13 16:06:45 -0800 | [diff] [blame] | 2197 | * __GFP_HIGH and PF_MEMALLOC allocations usually don't |
| 2198 | * need highmem pages, so cap pages_min to a small |
| 2199 | * value here. |
| 2200 | * |
| 2201 | * The (pages_high-pages_low) and (pages_low-pages_min) |
| 2202 | * deltas controls asynch page reclaim, and so should |
| 2203 | * not be capped for highmem. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2204 | */ |
| 2205 | int min_pages; |
| 2206 | |
| 2207 | min_pages = zone->present_pages / 1024; |
| 2208 | if (min_pages < SWAP_CLUSTER_MAX) |
| 2209 | min_pages = SWAP_CLUSTER_MAX; |
| 2210 | if (min_pages > 128) |
| 2211 | min_pages = 128; |
| 2212 | zone->pages_min = min_pages; |
| 2213 | } else { |
Nick Piggin | 669ed17 | 2005-11-13 16:06:45 -0800 | [diff] [blame] | 2214 | /* |
| 2215 | * If it's a lowmem zone, reserve a number of pages |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2216 | * proportionate to the zone's size. |
| 2217 | */ |
Nick Piggin | 669ed17 | 2005-11-13 16:06:45 -0800 | [diff] [blame] | 2218 | zone->pages_min = tmp; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2219 | } |
| 2220 | |
Andrew Morton | ac924c6 | 2006-05-15 09:43:59 -0700 | [diff] [blame] | 2221 | zone->pages_low = zone->pages_min + (tmp >> 2); |
| 2222 | zone->pages_high = zone->pages_min + (tmp >> 1); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2223 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
| 2224 | } |
Hideo AOKI | cb45b0e | 2006-04-10 22:52:59 -0700 | [diff] [blame] | 2225 | |
| 2226 | /* update totalreserve_pages */ |
| 2227 | calculate_totalreserve_pages(); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2228 | } |
| 2229 | |
| 2230 | /* |
| 2231 | * Initialise min_free_kbytes. |
| 2232 | * |
| 2233 | * For small machines we want it small (128k min). For large machines |
| 2234 | * we want it large (64MB max). But it is not linear, because network |
| 2235 | * bandwidth does not increase linearly with machine size. We use |
| 2236 | * |
| 2237 | * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy: |
| 2238 | * min_free_kbytes = sqrt(lowmem_kbytes * 16) |
| 2239 | * |
| 2240 | * which yields |
| 2241 | * |
| 2242 | * 16MB: 512k |
| 2243 | * 32MB: 724k |
| 2244 | * 64MB: 1024k |
| 2245 | * 128MB: 1448k |
| 2246 | * 256MB: 2048k |
| 2247 | * 512MB: 2896k |
| 2248 | * 1024MB: 4096k |
| 2249 | * 2048MB: 5792k |
| 2250 | * 4096MB: 8192k |
| 2251 | * 8192MB: 11584k |
| 2252 | * 16384MB: 16384k |
| 2253 | */ |
| 2254 | static int __init init_per_zone_pages_min(void) |
| 2255 | { |
| 2256 | unsigned long lowmem_kbytes; |
| 2257 | |
| 2258 | lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10); |
| 2259 | |
| 2260 | min_free_kbytes = int_sqrt(lowmem_kbytes * 16); |
| 2261 | if (min_free_kbytes < 128) |
| 2262 | min_free_kbytes = 128; |
| 2263 | if (min_free_kbytes > 65536) |
| 2264 | min_free_kbytes = 65536; |
| 2265 | setup_per_zone_pages_min(); |
| 2266 | setup_per_zone_lowmem_reserve(); |
| 2267 | return 0; |
| 2268 | } |
| 2269 | module_init(init_per_zone_pages_min) |
| 2270 | |
| 2271 | /* |
| 2272 | * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so |
| 2273 | * that we can call two helper functions whenever min_free_kbytes |
| 2274 | * changes. |
| 2275 | */ |
| 2276 | int min_free_kbytes_sysctl_handler(ctl_table *table, int write, |
| 2277 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) |
| 2278 | { |
| 2279 | proc_dointvec(table, write, file, buffer, length, ppos); |
| 2280 | setup_per_zone_pages_min(); |
| 2281 | return 0; |
| 2282 | } |
| 2283 | |
Christoph Lameter | 9614634 | 2006-07-03 00:24:13 -0700 | [diff] [blame] | 2284 | #ifdef CONFIG_NUMA |
| 2285 | int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write, |
| 2286 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) |
| 2287 | { |
| 2288 | struct zone *zone; |
| 2289 | int rc; |
| 2290 | |
| 2291 | rc = proc_dointvec_minmax(table, write, file, buffer, length, ppos); |
| 2292 | if (rc) |
| 2293 | return rc; |
| 2294 | |
| 2295 | for_each_zone(zone) |
| 2296 | zone->min_unmapped_ratio = (zone->present_pages * |
| 2297 | sysctl_min_unmapped_ratio) / 100; |
| 2298 | return 0; |
| 2299 | } |
| 2300 | #endif |
| 2301 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2302 | /* |
| 2303 | * lowmem_reserve_ratio_sysctl_handler - just a wrapper around |
| 2304 | * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve() |
| 2305 | * whenever sysctl_lowmem_reserve_ratio changes. |
| 2306 | * |
| 2307 | * The reserve ratio obviously has absolutely no relation with the |
| 2308 | * pages_min watermarks. The lowmem reserve ratio can only make sense |
| 2309 | * if in function of the boot time zone sizes. |
| 2310 | */ |
| 2311 | int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write, |
| 2312 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) |
| 2313 | { |
| 2314 | proc_dointvec_minmax(table, write, file, buffer, length, ppos); |
| 2315 | setup_per_zone_lowmem_reserve(); |
| 2316 | return 0; |
| 2317 | } |
| 2318 | |
Rohit Seth | 8ad4b1f | 2006-01-08 01:00:40 -0800 | [diff] [blame] | 2319 | /* |
| 2320 | * percpu_pagelist_fraction - changes the pcp->high for each zone on each |
| 2321 | * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist |
| 2322 | * can have before it gets flushed back to buddy allocator. |
| 2323 | */ |
| 2324 | |
| 2325 | int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write, |
| 2326 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) |
| 2327 | { |
| 2328 | struct zone *zone; |
| 2329 | unsigned int cpu; |
| 2330 | int ret; |
| 2331 | |
| 2332 | ret = proc_dointvec_minmax(table, write, file, buffer, length, ppos); |
| 2333 | if (!write || (ret == -EINVAL)) |
| 2334 | return ret; |
| 2335 | for_each_zone(zone) { |
| 2336 | for_each_online_cpu(cpu) { |
| 2337 | unsigned long high; |
| 2338 | high = zone->present_pages / percpu_pagelist_fraction; |
| 2339 | setup_pagelist_highmark(zone_pcp(zone, cpu), high); |
| 2340 | } |
| 2341 | } |
| 2342 | return 0; |
| 2343 | } |
| 2344 | |
David S. Miller | f034b5d | 2006-08-24 03:08:07 -0700 | [diff] [blame] | 2345 | int hashdist = HASHDIST_DEFAULT; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2346 | |
| 2347 | #ifdef CONFIG_NUMA |
| 2348 | static int __init set_hashdist(char *str) |
| 2349 | { |
| 2350 | if (!str) |
| 2351 | return 0; |
| 2352 | hashdist = simple_strtoul(str, &str, 0); |
| 2353 | return 1; |
| 2354 | } |
| 2355 | __setup("hashdist=", set_hashdist); |
| 2356 | #endif |
| 2357 | |
| 2358 | /* |
| 2359 | * allocate a large system hash table from bootmem |
| 2360 | * - it is assumed that the hash table must contain an exact power-of-2 |
| 2361 | * quantity of entries |
| 2362 | * - limit is the number of hash buckets, not the total allocation size |
| 2363 | */ |
| 2364 | void *__init alloc_large_system_hash(const char *tablename, |
| 2365 | unsigned long bucketsize, |
| 2366 | unsigned long numentries, |
| 2367 | int scale, |
| 2368 | int flags, |
| 2369 | unsigned int *_hash_shift, |
| 2370 | unsigned int *_hash_mask, |
| 2371 | unsigned long limit) |
| 2372 | { |
| 2373 | unsigned long long max = limit; |
| 2374 | unsigned long log2qty, size; |
| 2375 | void *table = NULL; |
| 2376 | |
| 2377 | /* allow the kernel cmdline to have a say */ |
| 2378 | if (!numentries) { |
| 2379 | /* round applicable memory size up to nearest megabyte */ |
| 2380 | numentries = (flags & HASH_HIGHMEM) ? nr_all_pages : nr_kernel_pages; |
| 2381 | numentries += (1UL << (20 - PAGE_SHIFT)) - 1; |
| 2382 | numentries >>= 20 - PAGE_SHIFT; |
| 2383 | numentries <<= 20 - PAGE_SHIFT; |
| 2384 | |
| 2385 | /* limit to 1 bucket per 2^scale bytes of low memory */ |
| 2386 | if (scale > PAGE_SHIFT) |
| 2387 | numentries >>= (scale - PAGE_SHIFT); |
| 2388 | else |
| 2389 | numentries <<= (PAGE_SHIFT - scale); |
| 2390 | } |
John Hawkes | 6e692ed | 2006-03-25 03:08:02 -0800 | [diff] [blame] | 2391 | numentries = roundup_pow_of_two(numentries); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2392 | |
| 2393 | /* limit allocation size to 1/16 total memory by default */ |
| 2394 | if (max == 0) { |
| 2395 | max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4; |
| 2396 | do_div(max, bucketsize); |
| 2397 | } |
| 2398 | |
| 2399 | if (numentries > max) |
| 2400 | numentries = max; |
| 2401 | |
| 2402 | log2qty = long_log2(numentries); |
| 2403 | |
| 2404 | do { |
| 2405 | size = bucketsize << log2qty; |
| 2406 | if (flags & HASH_EARLY) |
| 2407 | table = alloc_bootmem(size); |
| 2408 | else if (hashdist) |
| 2409 | table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL); |
| 2410 | else { |
| 2411 | unsigned long order; |
| 2412 | for (order = 0; ((1UL << order) << PAGE_SHIFT) < size; order++) |
| 2413 | ; |
| 2414 | table = (void*) __get_free_pages(GFP_ATOMIC, order); |
| 2415 | } |
| 2416 | } while (!table && size > PAGE_SIZE && --log2qty); |
| 2417 | |
| 2418 | if (!table) |
| 2419 | panic("Failed to allocate %s hash table\n", tablename); |
| 2420 | |
| 2421 | printk("%s hash table entries: %d (order: %d, %lu bytes)\n", |
| 2422 | tablename, |
| 2423 | (1U << log2qty), |
| 2424 | long_log2(size) - PAGE_SHIFT, |
| 2425 | size); |
| 2426 | |
| 2427 | if (_hash_shift) |
| 2428 | *_hash_shift = log2qty; |
| 2429 | if (_hash_mask) |
| 2430 | *_hash_mask = (1 << log2qty) - 1; |
| 2431 | |
| 2432 | return table; |
| 2433 | } |
KAMEZAWA Hiroyuki | a117e66 | 2006-03-27 01:15:25 -0800 | [diff] [blame] | 2434 | |
| 2435 | #ifdef CONFIG_OUT_OF_LINE_PFN_TO_PAGE |
KAMEZAWA Hiroyuki | a117e66 | 2006-03-27 01:15:25 -0800 | [diff] [blame] | 2436 | struct page *pfn_to_page(unsigned long pfn) |
| 2437 | { |
Andy Whitcroft | 67de648 | 2006-06-23 02:03:12 -0700 | [diff] [blame] | 2438 | return __pfn_to_page(pfn); |
KAMEZAWA Hiroyuki | a117e66 | 2006-03-27 01:15:25 -0800 | [diff] [blame] | 2439 | } |
| 2440 | unsigned long page_to_pfn(struct page *page) |
| 2441 | { |
Andy Whitcroft | 67de648 | 2006-06-23 02:03:12 -0700 | [diff] [blame] | 2442 | return __page_to_pfn(page); |
KAMEZAWA Hiroyuki | a117e66 | 2006-03-27 01:15:25 -0800 | [diff] [blame] | 2443 | } |
KAMEZAWA Hiroyuki | a117e66 | 2006-03-27 01:15:25 -0800 | [diff] [blame] | 2444 | EXPORT_SYMBOL(pfn_to_page); |
| 2445 | EXPORT_SYMBOL(page_to_pfn); |
| 2446 | #endif /* CONFIG_OUT_OF_LINE_PFN_TO_PAGE */ |