Commit | Line | Data |
---|---|---|
1da177e4 LT |
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 | ||
1da177e4 LT |
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> | |
9f158333 | 24 | #include <linux/kernel.h> |
1da177e4 LT |
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> | |
bdc8cb98 | 35 | #include <linux/memory_hotplug.h> |
1da177e4 LT |
36 | #include <linux/nodemask.h> |
37 | #include <linux/vmalloc.h> | |
4be38e35 | 38 | #include <linux/mempolicy.h> |
6811378e | 39 | #include <linux/stop_machine.h> |
c713216d MG |
40 | #include <linux/sort.h> |
41 | #include <linux/pfn.h> | |
3fcfab16 | 42 | #include <linux/backing-dev.h> |
1da177e4 LT |
43 | |
44 | #include <asm/tlbflush.h> | |
ac924c60 | 45 | #include <asm/div64.h> |
1da177e4 LT |
46 | #include "internal.h" |
47 | ||
48 | /* | |
49 | * MCD - HACK: Find somewhere to initialize this EARLY, or make this | |
50 | * initializer cleaner | |
51 | */ | |
c3d8c141 | 52 | nodemask_t node_online_map __read_mostly = { { [0] = 1UL } }; |
7223a93a | 53 | EXPORT_SYMBOL(node_online_map); |
c3d8c141 | 54 | nodemask_t node_possible_map __read_mostly = NODE_MASK_ALL; |
7223a93a | 55 | EXPORT_SYMBOL(node_possible_map); |
6c231b7b | 56 | unsigned long totalram_pages __read_mostly; |
cb45b0e9 | 57 | unsigned long totalreserve_pages __read_mostly; |
1da177e4 | 58 | long nr_swap_pages; |
8ad4b1fb | 59 | int percpu_pagelist_fraction; |
1da177e4 | 60 | |
d98c7a09 | 61 | static void __free_pages_ok(struct page *page, unsigned int order); |
a226f6c8 | 62 | |
1da177e4 LT |
63 | /* |
64 | * results with 256, 32 in the lowmem_reserve sysctl: | |
65 | * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high) | |
66 | * 1G machine -> (16M dma, 784M normal, 224M high) | |
67 | * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA | |
68 | * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL | |
69 | * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA | |
a2f1b424 AK |
70 | * |
71 | * TBD: should special case ZONE_DMA32 machines here - in those we normally | |
72 | * don't need any ZONE_NORMAL reservation | |
1da177e4 | 73 | */ |
2f1b6248 CL |
74 | int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1] = { |
75 | 256, | |
fb0e7942 | 76 | #ifdef CONFIG_ZONE_DMA32 |
2f1b6248 | 77 | 256, |
fb0e7942 | 78 | #endif |
e53ef38d | 79 | #ifdef CONFIG_HIGHMEM |
2f1b6248 | 80 | 32 |
e53ef38d | 81 | #endif |
2f1b6248 | 82 | }; |
1da177e4 LT |
83 | |
84 | EXPORT_SYMBOL(totalram_pages); | |
1da177e4 | 85 | |
2f1b6248 CL |
86 | static char *zone_names[MAX_NR_ZONES] = { |
87 | "DMA", | |
fb0e7942 | 88 | #ifdef CONFIG_ZONE_DMA32 |
2f1b6248 | 89 | "DMA32", |
fb0e7942 | 90 | #endif |
2f1b6248 | 91 | "Normal", |
e53ef38d | 92 | #ifdef CONFIG_HIGHMEM |
2f1b6248 | 93 | "HighMem" |
e53ef38d | 94 | #endif |
2f1b6248 CL |
95 | }; |
96 | ||
1da177e4 LT |
97 | int min_free_kbytes = 1024; |
98 | ||
86356ab1 YG |
99 | unsigned long __meminitdata nr_kernel_pages; |
100 | unsigned long __meminitdata nr_all_pages; | |
0e0b864e | 101 | static unsigned long __initdata dma_reserve; |
1da177e4 | 102 | |
c713216d MG |
103 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
104 | /* | |
105 | * MAX_ACTIVE_REGIONS determines the maxmimum number of distinct | |
106 | * ranges of memory (RAM) that may be registered with add_active_range(). | |
107 | * Ranges passed to add_active_range() will be merged if possible | |
108 | * so the number of times add_active_range() can be called is | |
109 | * related to the number of nodes and the number of holes | |
110 | */ | |
111 | #ifdef CONFIG_MAX_ACTIVE_REGIONS | |
112 | /* Allow an architecture to set MAX_ACTIVE_REGIONS to save memory */ | |
113 | #define MAX_ACTIVE_REGIONS CONFIG_MAX_ACTIVE_REGIONS | |
114 | #else | |
115 | #if MAX_NUMNODES >= 32 | |
116 | /* If there can be many nodes, allow up to 50 holes per node */ | |
117 | #define MAX_ACTIVE_REGIONS (MAX_NUMNODES*50) | |
118 | #else | |
119 | /* By default, allow up to 256 distinct regions */ | |
120 | #define MAX_ACTIVE_REGIONS 256 | |
121 | #endif | |
122 | #endif | |
123 | ||
124 | struct node_active_region __initdata early_node_map[MAX_ACTIVE_REGIONS]; | |
125 | int __initdata nr_nodemap_entries; | |
126 | unsigned long __initdata arch_zone_lowest_possible_pfn[MAX_NR_ZONES]; | |
127 | unsigned long __initdata arch_zone_highest_possible_pfn[MAX_NR_ZONES]; | |
fb01439c MG |
128 | #ifdef CONFIG_MEMORY_HOTPLUG_RESERVE |
129 | unsigned long __initdata node_boundary_start_pfn[MAX_NUMNODES]; | |
130 | unsigned long __initdata node_boundary_end_pfn[MAX_NUMNODES]; | |
131 | #endif /* CONFIG_MEMORY_HOTPLUG_RESERVE */ | |
c713216d MG |
132 | #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */ |
133 | ||
13e7444b | 134 | #ifdef CONFIG_DEBUG_VM |
c6a57e19 | 135 | static int page_outside_zone_boundaries(struct zone *zone, struct page *page) |
1da177e4 | 136 | { |
bdc8cb98 DH |
137 | int ret = 0; |
138 | unsigned seq; | |
139 | unsigned long pfn = page_to_pfn(page); | |
c6a57e19 | 140 | |
bdc8cb98 DH |
141 | do { |
142 | seq = zone_span_seqbegin(zone); | |
143 | if (pfn >= zone->zone_start_pfn + zone->spanned_pages) | |
144 | ret = 1; | |
145 | else if (pfn < zone->zone_start_pfn) | |
146 | ret = 1; | |
147 | } while (zone_span_seqretry(zone, seq)); | |
148 | ||
149 | return ret; | |
c6a57e19 DH |
150 | } |
151 | ||
152 | static int page_is_consistent(struct zone *zone, struct page *page) | |
153 | { | |
1da177e4 LT |
154 | #ifdef CONFIG_HOLES_IN_ZONE |
155 | if (!pfn_valid(page_to_pfn(page))) | |
c6a57e19 | 156 | return 0; |
1da177e4 LT |
157 | #endif |
158 | if (zone != page_zone(page)) | |
c6a57e19 DH |
159 | return 0; |
160 | ||
161 | return 1; | |
162 | } | |
163 | /* | |
164 | * Temporary debugging check for pages not lying within a given zone. | |
165 | */ | |
166 | static int bad_range(struct zone *zone, struct page *page) | |
167 | { | |
168 | if (page_outside_zone_boundaries(zone, page)) | |
1da177e4 | 169 | return 1; |
c6a57e19 DH |
170 | if (!page_is_consistent(zone, page)) |
171 | return 1; | |
172 | ||
1da177e4 LT |
173 | return 0; |
174 | } | |
13e7444b NP |
175 | #else |
176 | static inline int bad_range(struct zone *zone, struct page *page) | |
177 | { | |
178 | return 0; | |
179 | } | |
180 | #endif | |
181 | ||
224abf92 | 182 | static void bad_page(struct page *page) |
1da177e4 | 183 | { |
224abf92 | 184 | printk(KERN_EMERG "Bad page state in process '%s'\n" |
7365f3d1 HD |
185 | KERN_EMERG "page:%p flags:0x%0*lx mapping:%p mapcount:%d count:%d\n" |
186 | KERN_EMERG "Trying to fix it up, but a reboot is needed\n" | |
187 | KERN_EMERG "Backtrace:\n", | |
224abf92 NP |
188 | current->comm, page, (int)(2*sizeof(unsigned long)), |
189 | (unsigned long)page->flags, page->mapping, | |
190 | page_mapcount(page), page_count(page)); | |
1da177e4 | 191 | dump_stack(); |
334795ec HD |
192 | page->flags &= ~(1 << PG_lru | |
193 | 1 << PG_private | | |
1da177e4 | 194 | 1 << PG_locked | |
1da177e4 LT |
195 | 1 << PG_active | |
196 | 1 << PG_dirty | | |
334795ec HD |
197 | 1 << PG_reclaim | |
198 | 1 << PG_slab | | |
1da177e4 | 199 | 1 << PG_swapcache | |
676165a8 NP |
200 | 1 << PG_writeback | |
201 | 1 << PG_buddy ); | |
1da177e4 LT |
202 | set_page_count(page, 0); |
203 | reset_page_mapcount(page); | |
204 | page->mapping = NULL; | |
9f158333 | 205 | add_taint(TAINT_BAD_PAGE); |
1da177e4 LT |
206 | } |
207 | ||
1da177e4 LT |
208 | /* |
209 | * Higher-order pages are called "compound pages". They are structured thusly: | |
210 | * | |
211 | * The first PAGE_SIZE page is called the "head page". | |
212 | * | |
213 | * The remaining PAGE_SIZE pages are called "tail pages". | |
214 | * | |
215 | * All pages have PG_compound set. All pages have their ->private pointing at | |
216 | * the head page (even the head page has this). | |
217 | * | |
41d78ba5 HD |
218 | * The first tail page's ->lru.next holds the address of the compound page's |
219 | * put_page() function. Its ->lru.prev holds the order of allocation. | |
220 | * This usage means that zero-order pages may not be compound. | |
1da177e4 | 221 | */ |
d98c7a09 HD |
222 | |
223 | static void free_compound_page(struct page *page) | |
224 | { | |
225 | __free_pages_ok(page, (unsigned long)page[1].lru.prev); | |
226 | } | |
227 | ||
1da177e4 LT |
228 | static void prep_compound_page(struct page *page, unsigned long order) |
229 | { | |
230 | int i; | |
231 | int nr_pages = 1 << order; | |
232 | ||
d98c7a09 | 233 | page[1].lru.next = (void *)free_compound_page; /* set dtor */ |
41d78ba5 | 234 | page[1].lru.prev = (void *)order; |
1da177e4 LT |
235 | for (i = 0; i < nr_pages; i++) { |
236 | struct page *p = page + i; | |
237 | ||
5e9dace8 | 238 | __SetPageCompound(p); |
4c21e2f2 | 239 | set_page_private(p, (unsigned long)page); |
1da177e4 LT |
240 | } |
241 | } | |
242 | ||
243 | static void destroy_compound_page(struct page *page, unsigned long order) | |
244 | { | |
245 | int i; | |
246 | int nr_pages = 1 << order; | |
247 | ||
41d78ba5 | 248 | if (unlikely((unsigned long)page[1].lru.prev != order)) |
224abf92 | 249 | bad_page(page); |
1da177e4 LT |
250 | |
251 | for (i = 0; i < nr_pages; i++) { | |
252 | struct page *p = page + i; | |
253 | ||
224abf92 NP |
254 | if (unlikely(!PageCompound(p) | |
255 | (page_private(p) != (unsigned long)page))) | |
256 | bad_page(page); | |
5e9dace8 | 257 | __ClearPageCompound(p); |
1da177e4 LT |
258 | } |
259 | } | |
1da177e4 | 260 | |
17cf4406 NP |
261 | static inline void prep_zero_page(struct page *page, int order, gfp_t gfp_flags) |
262 | { | |
263 | int i; | |
264 | ||
725d704e | 265 | VM_BUG_ON((gfp_flags & (__GFP_WAIT | __GFP_HIGHMEM)) == __GFP_HIGHMEM); |
6626c5d5 AM |
266 | /* |
267 | * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO | |
268 | * and __GFP_HIGHMEM from hard or soft interrupt context. | |
269 | */ | |
725d704e | 270 | VM_BUG_ON((gfp_flags & __GFP_HIGHMEM) && in_interrupt()); |
17cf4406 NP |
271 | for (i = 0; i < (1 << order); i++) |
272 | clear_highpage(page + i); | |
273 | } | |
274 | ||
1da177e4 LT |
275 | /* |
276 | * function for dealing with page's order in buddy system. | |
277 | * zone->lock is already acquired when we use these. | |
278 | * So, we don't need atomic page->flags operations here. | |
279 | */ | |
6aa3001b AM |
280 | static inline unsigned long page_order(struct page *page) |
281 | { | |
4c21e2f2 | 282 | return page_private(page); |
1da177e4 LT |
283 | } |
284 | ||
6aa3001b AM |
285 | static inline void set_page_order(struct page *page, int order) |
286 | { | |
4c21e2f2 | 287 | set_page_private(page, order); |
676165a8 | 288 | __SetPageBuddy(page); |
1da177e4 LT |
289 | } |
290 | ||
291 | static inline void rmv_page_order(struct page *page) | |
292 | { | |
676165a8 | 293 | __ClearPageBuddy(page); |
4c21e2f2 | 294 | set_page_private(page, 0); |
1da177e4 LT |
295 | } |
296 | ||
297 | /* | |
298 | * Locate the struct page for both the matching buddy in our | |
299 | * pair (buddy1) and the combined O(n+1) page they form (page). | |
300 | * | |
301 | * 1) Any buddy B1 will have an order O twin B2 which satisfies | |
302 | * the following equation: | |
303 | * B2 = B1 ^ (1 << O) | |
304 | * For example, if the starting buddy (buddy2) is #8 its order | |
305 | * 1 buddy is #10: | |
306 | * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10 | |
307 | * | |
308 | * 2) Any buddy B will have an order O+1 parent P which | |
309 | * satisfies the following equation: | |
310 | * P = B & ~(1 << O) | |
311 | * | |
d6e05edc | 312 | * Assumption: *_mem_map is contiguous at least up to MAX_ORDER |
1da177e4 LT |
313 | */ |
314 | static inline struct page * | |
315 | __page_find_buddy(struct page *page, unsigned long page_idx, unsigned int order) | |
316 | { | |
317 | unsigned long buddy_idx = page_idx ^ (1 << order); | |
318 | ||
319 | return page + (buddy_idx - page_idx); | |
320 | } | |
321 | ||
322 | static inline unsigned long | |
323 | __find_combined_index(unsigned long page_idx, unsigned int order) | |
324 | { | |
325 | return (page_idx & ~(1 << order)); | |
326 | } | |
327 | ||
328 | /* | |
329 | * This function checks whether a page is free && is the buddy | |
330 | * we can do coalesce a page and its buddy if | |
13e7444b | 331 | * (a) the buddy is not in a hole && |
676165a8 | 332 | * (b) the buddy is in the buddy system && |
cb2b95e1 AW |
333 | * (c) a page and its buddy have the same order && |
334 | * (d) a page and its buddy are in the same zone. | |
676165a8 NP |
335 | * |
336 | * For recording whether a page is in the buddy system, we use PG_buddy. | |
337 | * Setting, clearing, and testing PG_buddy is serialized by zone->lock. | |
1da177e4 | 338 | * |
676165a8 | 339 | * For recording page's order, we use page_private(page). |
1da177e4 | 340 | */ |
cb2b95e1 AW |
341 | static inline int page_is_buddy(struct page *page, struct page *buddy, |
342 | int order) | |
1da177e4 | 343 | { |
13e7444b | 344 | #ifdef CONFIG_HOLES_IN_ZONE |
cb2b95e1 | 345 | if (!pfn_valid(page_to_pfn(buddy))) |
13e7444b NP |
346 | return 0; |
347 | #endif | |
348 | ||
cb2b95e1 AW |
349 | if (page_zone_id(page) != page_zone_id(buddy)) |
350 | return 0; | |
351 | ||
352 | if (PageBuddy(buddy) && page_order(buddy) == order) { | |
353 | BUG_ON(page_count(buddy) != 0); | |
6aa3001b | 354 | return 1; |
676165a8 | 355 | } |
6aa3001b | 356 | return 0; |
1da177e4 LT |
357 | } |
358 | ||
359 | /* | |
360 | * Freeing function for a buddy system allocator. | |
361 | * | |
362 | * The concept of a buddy system is to maintain direct-mapped table | |
363 | * (containing bit values) for memory blocks of various "orders". | |
364 | * The bottom level table contains the map for the smallest allocatable | |
365 | * units of memory (here, pages), and each level above it describes | |
366 | * pairs of units from the levels below, hence, "buddies". | |
367 | * At a high level, all that happens here is marking the table entry | |
368 | * at the bottom level available, and propagating the changes upward | |
369 | * as necessary, plus some accounting needed to play nicely with other | |
370 | * parts of the VM system. | |
371 | * At each level, we keep a list of pages, which are heads of continuous | |
676165a8 | 372 | * free pages of length of (1 << order) and marked with PG_buddy. Page's |
4c21e2f2 | 373 | * order is recorded in page_private(page) field. |
1da177e4 LT |
374 | * So when we are allocating or freeing one, we can derive the state of the |
375 | * other. That is, if we allocate a small block, and both were | |
376 | * free, the remainder of the region must be split into blocks. | |
377 | * If a block is freed, and its buddy is also free, then this | |
378 | * triggers coalescing into a block of larger size. | |
379 | * | |
380 | * -- wli | |
381 | */ | |
382 | ||
48db57f8 | 383 | static inline void __free_one_page(struct page *page, |
1da177e4 LT |
384 | struct zone *zone, unsigned int order) |
385 | { | |
386 | unsigned long page_idx; | |
387 | int order_size = 1 << order; | |
388 | ||
224abf92 | 389 | if (unlikely(PageCompound(page))) |
1da177e4 LT |
390 | destroy_compound_page(page, order); |
391 | ||
392 | page_idx = page_to_pfn(page) & ((1 << MAX_ORDER) - 1); | |
393 | ||
725d704e NP |
394 | VM_BUG_ON(page_idx & (order_size - 1)); |
395 | VM_BUG_ON(bad_range(zone, page)); | |
1da177e4 LT |
396 | |
397 | zone->free_pages += order_size; | |
398 | while (order < MAX_ORDER-1) { | |
399 | unsigned long combined_idx; | |
400 | struct free_area *area; | |
401 | struct page *buddy; | |
402 | ||
1da177e4 | 403 | buddy = __page_find_buddy(page, page_idx, order); |
cb2b95e1 | 404 | if (!page_is_buddy(page, buddy, order)) |
1da177e4 | 405 | break; /* Move the buddy up one level. */ |
13e7444b | 406 | |
1da177e4 LT |
407 | list_del(&buddy->lru); |
408 | area = zone->free_area + order; | |
409 | area->nr_free--; | |
410 | rmv_page_order(buddy); | |
13e7444b | 411 | combined_idx = __find_combined_index(page_idx, order); |
1da177e4 LT |
412 | page = page + (combined_idx - page_idx); |
413 | page_idx = combined_idx; | |
414 | order++; | |
415 | } | |
416 | set_page_order(page, order); | |
417 | list_add(&page->lru, &zone->free_area[order].free_list); | |
418 | zone->free_area[order].nr_free++; | |
419 | } | |
420 | ||
224abf92 | 421 | static inline int free_pages_check(struct page *page) |
1da177e4 | 422 | { |
92be2e33 NP |
423 | if (unlikely(page_mapcount(page) | |
424 | (page->mapping != NULL) | | |
425 | (page_count(page) != 0) | | |
1da177e4 LT |
426 | (page->flags & ( |
427 | 1 << PG_lru | | |
428 | 1 << PG_private | | |
429 | 1 << PG_locked | | |
430 | 1 << PG_active | | |
431 | 1 << PG_reclaim | | |
432 | 1 << PG_slab | | |
433 | 1 << PG_swapcache | | |
b5810039 | 434 | 1 << PG_writeback | |
676165a8 NP |
435 | 1 << PG_reserved | |
436 | 1 << PG_buddy )))) | |
224abf92 | 437 | bad_page(page); |
1da177e4 | 438 | if (PageDirty(page)) |
242e5468 | 439 | __ClearPageDirty(page); |
689bcebf HD |
440 | /* |
441 | * For now, we report if PG_reserved was found set, but do not | |
442 | * clear it, and do not free the page. But we shall soon need | |
443 | * to do more, for when the ZERO_PAGE count wraps negative. | |
444 | */ | |
445 | return PageReserved(page); | |
1da177e4 LT |
446 | } |
447 | ||
448 | /* | |
449 | * Frees a list of pages. | |
450 | * Assumes all pages on list are in same zone, and of same order. | |
207f36ee | 451 | * count is the number of pages to free. |
1da177e4 LT |
452 | * |
453 | * If the zone was previously in an "all pages pinned" state then look to | |
454 | * see if this freeing clears that state. | |
455 | * | |
456 | * And clear the zone's pages_scanned counter, to hold off the "all pages are | |
457 | * pinned" detection logic. | |
458 | */ | |
48db57f8 NP |
459 | static void free_pages_bulk(struct zone *zone, int count, |
460 | struct list_head *list, int order) | |
1da177e4 | 461 | { |
c54ad30c | 462 | spin_lock(&zone->lock); |
1da177e4 LT |
463 | zone->all_unreclaimable = 0; |
464 | zone->pages_scanned = 0; | |
48db57f8 NP |
465 | while (count--) { |
466 | struct page *page; | |
467 | ||
725d704e | 468 | VM_BUG_ON(list_empty(list)); |
1da177e4 | 469 | page = list_entry(list->prev, struct page, lru); |
48db57f8 | 470 | /* have to delete it as __free_one_page list manipulates */ |
1da177e4 | 471 | list_del(&page->lru); |
48db57f8 | 472 | __free_one_page(page, zone, order); |
1da177e4 | 473 | } |
c54ad30c | 474 | spin_unlock(&zone->lock); |
1da177e4 LT |
475 | } |
476 | ||
48db57f8 | 477 | static void free_one_page(struct zone *zone, struct page *page, int order) |
1da177e4 | 478 | { |
006d22d9 CL |
479 | spin_lock(&zone->lock); |
480 | zone->all_unreclaimable = 0; | |
481 | zone->pages_scanned = 0; | |
0798e519 | 482 | __free_one_page(page, zone, order); |
006d22d9 | 483 | spin_unlock(&zone->lock); |
48db57f8 NP |
484 | } |
485 | ||
486 | static void __free_pages_ok(struct page *page, unsigned int order) | |
487 | { | |
488 | unsigned long flags; | |
1da177e4 | 489 | int i; |
689bcebf | 490 | int reserved = 0; |
1da177e4 | 491 | |
1da177e4 | 492 | for (i = 0 ; i < (1 << order) ; ++i) |
224abf92 | 493 | reserved += free_pages_check(page + i); |
689bcebf HD |
494 | if (reserved) |
495 | return; | |
496 | ||
9858db50 NP |
497 | if (!PageHighMem(page)) |
498 | debug_check_no_locks_freed(page_address(page),PAGE_SIZE<<order); | |
dafb1367 | 499 | arch_free_page(page, order); |
48db57f8 | 500 | kernel_map_pages(page, 1 << order, 0); |
dafb1367 | 501 | |
c54ad30c | 502 | local_irq_save(flags); |
f8891e5e | 503 | __count_vm_events(PGFREE, 1 << order); |
48db57f8 | 504 | free_one_page(page_zone(page), page, order); |
c54ad30c | 505 | local_irq_restore(flags); |
1da177e4 LT |
506 | } |
507 | ||
a226f6c8 DH |
508 | /* |
509 | * permit the bootmem allocator to evade page validation on high-order frees | |
510 | */ | |
511 | void fastcall __init __free_pages_bootmem(struct page *page, unsigned int order) | |
512 | { | |
513 | if (order == 0) { | |
514 | __ClearPageReserved(page); | |
515 | set_page_count(page, 0); | |
7835e98b | 516 | set_page_refcounted(page); |
545b1ea9 | 517 | __free_page(page); |
a226f6c8 | 518 | } else { |
a226f6c8 DH |
519 | int loop; |
520 | ||
545b1ea9 | 521 | prefetchw(page); |
a226f6c8 DH |
522 | for (loop = 0; loop < BITS_PER_LONG; loop++) { |
523 | struct page *p = &page[loop]; | |
524 | ||
545b1ea9 NP |
525 | if (loop + 1 < BITS_PER_LONG) |
526 | prefetchw(p + 1); | |
a226f6c8 DH |
527 | __ClearPageReserved(p); |
528 | set_page_count(p, 0); | |
529 | } | |
530 | ||
7835e98b | 531 | set_page_refcounted(page); |
545b1ea9 | 532 | __free_pages(page, order); |
a226f6c8 DH |
533 | } |
534 | } | |
535 | ||
1da177e4 LT |
536 | |
537 | /* | |
538 | * The order of subdivision here is critical for the IO subsystem. | |
539 | * Please do not alter this order without good reasons and regression | |
540 | * testing. Specifically, as large blocks of memory are subdivided, | |
541 | * the order in which smaller blocks are delivered depends on the order | |
542 | * they're subdivided in this function. This is the primary factor | |
543 | * influencing the order in which pages are delivered to the IO | |
544 | * subsystem according to empirical testing, and this is also justified | |
545 | * by considering the behavior of a buddy system containing a single | |
546 | * large block of memory acted on by a series of small allocations. | |
547 | * This behavior is a critical factor in sglist merging's success. | |
548 | * | |
549 | * -- wli | |
550 | */ | |
085cc7d5 | 551 | static inline void expand(struct zone *zone, struct page *page, |
1da177e4 LT |
552 | int low, int high, struct free_area *area) |
553 | { | |
554 | unsigned long size = 1 << high; | |
555 | ||
556 | while (high > low) { | |
557 | area--; | |
558 | high--; | |
559 | size >>= 1; | |
725d704e | 560 | VM_BUG_ON(bad_range(zone, &page[size])); |
1da177e4 LT |
561 | list_add(&page[size].lru, &area->free_list); |
562 | area->nr_free++; | |
563 | set_page_order(&page[size], high); | |
564 | } | |
1da177e4 LT |
565 | } |
566 | ||
1da177e4 LT |
567 | /* |
568 | * This page is about to be returned from the page allocator | |
569 | */ | |
17cf4406 | 570 | static int prep_new_page(struct page *page, int order, gfp_t gfp_flags) |
1da177e4 | 571 | { |
92be2e33 NP |
572 | if (unlikely(page_mapcount(page) | |
573 | (page->mapping != NULL) | | |
574 | (page_count(page) != 0) | | |
334795ec HD |
575 | (page->flags & ( |
576 | 1 << PG_lru | | |
1da177e4 LT |
577 | 1 << PG_private | |
578 | 1 << PG_locked | | |
1da177e4 LT |
579 | 1 << PG_active | |
580 | 1 << PG_dirty | | |
581 | 1 << PG_reclaim | | |
334795ec | 582 | 1 << PG_slab | |
1da177e4 | 583 | 1 << PG_swapcache | |
b5810039 | 584 | 1 << PG_writeback | |
676165a8 NP |
585 | 1 << PG_reserved | |
586 | 1 << PG_buddy )))) | |
224abf92 | 587 | bad_page(page); |
1da177e4 | 588 | |
689bcebf HD |
589 | /* |
590 | * For now, we report if PG_reserved was found set, but do not | |
591 | * clear it, and do not allocate the page: as a safety net. | |
592 | */ | |
593 | if (PageReserved(page)) | |
594 | return 1; | |
595 | ||
1da177e4 LT |
596 | page->flags &= ~(1 << PG_uptodate | 1 << PG_error | |
597 | 1 << PG_referenced | 1 << PG_arch_1 | | |
598 | 1 << PG_checked | 1 << PG_mappedtodisk); | |
4c21e2f2 | 599 | set_page_private(page, 0); |
7835e98b | 600 | set_page_refcounted(page); |
cc102509 NP |
601 | |
602 | arch_alloc_page(page, order); | |
1da177e4 | 603 | kernel_map_pages(page, 1 << order, 1); |
17cf4406 NP |
604 | |
605 | if (gfp_flags & __GFP_ZERO) | |
606 | prep_zero_page(page, order, gfp_flags); | |
607 | ||
608 | if (order && (gfp_flags & __GFP_COMP)) | |
609 | prep_compound_page(page, order); | |
610 | ||
689bcebf | 611 | return 0; |
1da177e4 LT |
612 | } |
613 | ||
614 | /* | |
615 | * Do the hard work of removing an element from the buddy allocator. | |
616 | * Call me with the zone->lock already held. | |
617 | */ | |
618 | static struct page *__rmqueue(struct zone *zone, unsigned int order) | |
619 | { | |
620 | struct free_area * area; | |
621 | unsigned int current_order; | |
622 | struct page *page; | |
623 | ||
624 | for (current_order = order; current_order < MAX_ORDER; ++current_order) { | |
625 | area = zone->free_area + current_order; | |
626 | if (list_empty(&area->free_list)) | |
627 | continue; | |
628 | ||
629 | page = list_entry(area->free_list.next, struct page, lru); | |
630 | list_del(&page->lru); | |
631 | rmv_page_order(page); | |
632 | area->nr_free--; | |
633 | zone->free_pages -= 1UL << order; | |
085cc7d5 NP |
634 | expand(zone, page, order, current_order, area); |
635 | return page; | |
1da177e4 LT |
636 | } |
637 | ||
638 | return NULL; | |
639 | } | |
640 | ||
641 | /* | |
642 | * Obtain a specified number of elements from the buddy allocator, all under | |
643 | * a single hold of the lock, for efficiency. Add them to the supplied list. | |
644 | * Returns the number of new pages which were placed at *list. | |
645 | */ | |
646 | static int rmqueue_bulk(struct zone *zone, unsigned int order, | |
647 | unsigned long count, struct list_head *list) | |
648 | { | |
1da177e4 | 649 | int i; |
1da177e4 | 650 | |
c54ad30c | 651 | spin_lock(&zone->lock); |
1da177e4 | 652 | for (i = 0; i < count; ++i) { |
085cc7d5 NP |
653 | struct page *page = __rmqueue(zone, order); |
654 | if (unlikely(page == NULL)) | |
1da177e4 | 655 | break; |
1da177e4 LT |
656 | list_add_tail(&page->lru, list); |
657 | } | |
c54ad30c | 658 | spin_unlock(&zone->lock); |
085cc7d5 | 659 | return i; |
1da177e4 LT |
660 | } |
661 | ||
4ae7c039 | 662 | #ifdef CONFIG_NUMA |
8fce4d8e CL |
663 | /* |
664 | * Called from the slab reaper to drain pagesets on a particular node that | |
39bbcb8f | 665 | * belongs to the currently executing processor. |
879336c3 CL |
666 | * Note that this function must be called with the thread pinned to |
667 | * a single processor. | |
8fce4d8e CL |
668 | */ |
669 | void drain_node_pages(int nodeid) | |
4ae7c039 | 670 | { |
2f6726e5 CL |
671 | int i; |
672 | enum zone_type z; | |
4ae7c039 CL |
673 | unsigned long flags; |
674 | ||
8fce4d8e CL |
675 | for (z = 0; z < MAX_NR_ZONES; z++) { |
676 | struct zone *zone = NODE_DATA(nodeid)->node_zones + z; | |
4ae7c039 CL |
677 | struct per_cpu_pageset *pset; |
678 | ||
39bbcb8f CL |
679 | if (!populated_zone(zone)) |
680 | continue; | |
681 | ||
23316bc8 | 682 | pset = zone_pcp(zone, smp_processor_id()); |
4ae7c039 CL |
683 | for (i = 0; i < ARRAY_SIZE(pset->pcp); i++) { |
684 | struct per_cpu_pages *pcp; | |
685 | ||
686 | pcp = &pset->pcp[i]; | |
879336c3 | 687 | if (pcp->count) { |
bc4ba393 CL |
688 | int to_drain; |
689 | ||
879336c3 | 690 | local_irq_save(flags); |
bc4ba393 CL |
691 | if (pcp->count >= pcp->batch) |
692 | to_drain = pcp->batch; | |
693 | else | |
694 | to_drain = pcp->count; | |
695 | free_pages_bulk(zone, to_drain, &pcp->list, 0); | |
696 | pcp->count -= to_drain; | |
879336c3 CL |
697 | local_irq_restore(flags); |
698 | } | |
4ae7c039 CL |
699 | } |
700 | } | |
4ae7c039 CL |
701 | } |
702 | #endif | |
703 | ||
1da177e4 LT |
704 | #if defined(CONFIG_PM) || defined(CONFIG_HOTPLUG_CPU) |
705 | static void __drain_pages(unsigned int cpu) | |
706 | { | |
c54ad30c | 707 | unsigned long flags; |
1da177e4 LT |
708 | struct zone *zone; |
709 | int i; | |
710 | ||
711 | for_each_zone(zone) { | |
712 | struct per_cpu_pageset *pset; | |
713 | ||
e7c8d5c9 | 714 | pset = zone_pcp(zone, cpu); |
1da177e4 LT |
715 | for (i = 0; i < ARRAY_SIZE(pset->pcp); i++) { |
716 | struct per_cpu_pages *pcp; | |
717 | ||
718 | pcp = &pset->pcp[i]; | |
c54ad30c | 719 | local_irq_save(flags); |
48db57f8 NP |
720 | free_pages_bulk(zone, pcp->count, &pcp->list, 0); |
721 | pcp->count = 0; | |
c54ad30c | 722 | local_irq_restore(flags); |
1da177e4 LT |
723 | } |
724 | } | |
725 | } | |
726 | #endif /* CONFIG_PM || CONFIG_HOTPLUG_CPU */ | |
727 | ||
728 | #ifdef CONFIG_PM | |
729 | ||
730 | void mark_free_pages(struct zone *zone) | |
731 | { | |
f623f0db RW |
732 | unsigned long pfn, max_zone_pfn; |
733 | unsigned long flags; | |
1da177e4 LT |
734 | int order; |
735 | struct list_head *curr; | |
736 | ||
737 | if (!zone->spanned_pages) | |
738 | return; | |
739 | ||
740 | spin_lock_irqsave(&zone->lock, flags); | |
f623f0db RW |
741 | |
742 | max_zone_pfn = zone->zone_start_pfn + zone->spanned_pages; | |
743 | for (pfn = zone->zone_start_pfn; pfn < max_zone_pfn; pfn++) | |
744 | if (pfn_valid(pfn)) { | |
745 | struct page *page = pfn_to_page(pfn); | |
746 | ||
747 | if (!PageNosave(page)) | |
748 | ClearPageNosaveFree(page); | |
749 | } | |
1da177e4 LT |
750 | |
751 | for (order = MAX_ORDER - 1; order >= 0; --order) | |
752 | list_for_each(curr, &zone->free_area[order].free_list) { | |
f623f0db | 753 | unsigned long i; |
1da177e4 | 754 | |
f623f0db RW |
755 | pfn = page_to_pfn(list_entry(curr, struct page, lru)); |
756 | for (i = 0; i < (1UL << order); i++) | |
757 | SetPageNosaveFree(pfn_to_page(pfn + i)); | |
758 | } | |
1da177e4 | 759 | |
1da177e4 LT |
760 | spin_unlock_irqrestore(&zone->lock, flags); |
761 | } | |
762 | ||
763 | /* | |
764 | * Spill all of this CPU's per-cpu pages back into the buddy allocator. | |
765 | */ | |
766 | void drain_local_pages(void) | |
767 | { | |
768 | unsigned long flags; | |
769 | ||
770 | local_irq_save(flags); | |
771 | __drain_pages(smp_processor_id()); | |
772 | local_irq_restore(flags); | |
773 | } | |
774 | #endif /* CONFIG_PM */ | |
775 | ||
1da177e4 LT |
776 | /* |
777 | * Free a 0-order page | |
778 | */ | |
1da177e4 LT |
779 | static void fastcall free_hot_cold_page(struct page *page, int cold) |
780 | { | |
781 | struct zone *zone = page_zone(page); | |
782 | struct per_cpu_pages *pcp; | |
783 | unsigned long flags; | |
784 | ||
1da177e4 LT |
785 | if (PageAnon(page)) |
786 | page->mapping = NULL; | |
224abf92 | 787 | if (free_pages_check(page)) |
689bcebf HD |
788 | return; |
789 | ||
9858db50 NP |
790 | if (!PageHighMem(page)) |
791 | debug_check_no_locks_freed(page_address(page), PAGE_SIZE); | |
dafb1367 | 792 | arch_free_page(page, 0); |
689bcebf HD |
793 | kernel_map_pages(page, 1, 0); |
794 | ||
e7c8d5c9 | 795 | pcp = &zone_pcp(zone, get_cpu())->pcp[cold]; |
1da177e4 | 796 | local_irq_save(flags); |
f8891e5e | 797 | __count_vm_event(PGFREE); |
1da177e4 LT |
798 | list_add(&page->lru, &pcp->list); |
799 | pcp->count++; | |
48db57f8 NP |
800 | if (pcp->count >= pcp->high) { |
801 | free_pages_bulk(zone, pcp->batch, &pcp->list, 0); | |
802 | pcp->count -= pcp->batch; | |
803 | } | |
1da177e4 LT |
804 | local_irq_restore(flags); |
805 | put_cpu(); | |
806 | } | |
807 | ||
808 | void fastcall free_hot_page(struct page *page) | |
809 | { | |
810 | free_hot_cold_page(page, 0); | |
811 | } | |
812 | ||
813 | void fastcall free_cold_page(struct page *page) | |
814 | { | |
815 | free_hot_cold_page(page, 1); | |
816 | } | |
817 | ||
8dfcc9ba NP |
818 | /* |
819 | * split_page takes a non-compound higher-order page, and splits it into | |
820 | * n (1<<order) sub-pages: page[0..n] | |
821 | * Each sub-page must be freed individually. | |
822 | * | |
823 | * Note: this is probably too low level an operation for use in drivers. | |
824 | * Please consult with lkml before using this in your driver. | |
825 | */ | |
826 | void split_page(struct page *page, unsigned int order) | |
827 | { | |
828 | int i; | |
829 | ||
725d704e NP |
830 | VM_BUG_ON(PageCompound(page)); |
831 | VM_BUG_ON(!page_count(page)); | |
7835e98b NP |
832 | for (i = 1; i < (1 << order); i++) |
833 | set_page_refcounted(page + i); | |
8dfcc9ba | 834 | } |
8dfcc9ba | 835 | |
1da177e4 LT |
836 | /* |
837 | * Really, prep_compound_page() should be called from __rmqueue_bulk(). But | |
838 | * we cheat by calling it from here, in the order > 0 path. Saves a branch | |
839 | * or two. | |
840 | */ | |
a74609fa NP |
841 | static struct page *buffered_rmqueue(struct zonelist *zonelist, |
842 | struct zone *zone, int order, gfp_t gfp_flags) | |
1da177e4 LT |
843 | { |
844 | unsigned long flags; | |
689bcebf | 845 | struct page *page; |
1da177e4 | 846 | int cold = !!(gfp_flags & __GFP_COLD); |
a74609fa | 847 | int cpu; |
1da177e4 | 848 | |
689bcebf | 849 | again: |
a74609fa | 850 | cpu = get_cpu(); |
48db57f8 | 851 | if (likely(order == 0)) { |
1da177e4 LT |
852 | struct per_cpu_pages *pcp; |
853 | ||
a74609fa | 854 | pcp = &zone_pcp(zone, cpu)->pcp[cold]; |
1da177e4 | 855 | local_irq_save(flags); |
a74609fa | 856 | if (!pcp->count) { |
941c7105 | 857 | pcp->count = rmqueue_bulk(zone, 0, |
1da177e4 | 858 | pcp->batch, &pcp->list); |
a74609fa NP |
859 | if (unlikely(!pcp->count)) |
860 | goto failed; | |
1da177e4 | 861 | } |
a74609fa NP |
862 | page = list_entry(pcp->list.next, struct page, lru); |
863 | list_del(&page->lru); | |
864 | pcp->count--; | |
7fb1d9fc | 865 | } else { |
1da177e4 LT |
866 | spin_lock_irqsave(&zone->lock, flags); |
867 | page = __rmqueue(zone, order); | |
a74609fa NP |
868 | spin_unlock(&zone->lock); |
869 | if (!page) | |
870 | goto failed; | |
1da177e4 LT |
871 | } |
872 | ||
f8891e5e | 873 | __count_zone_vm_events(PGALLOC, zone, 1 << order); |
ca889e6c | 874 | zone_statistics(zonelist, zone); |
a74609fa NP |
875 | local_irq_restore(flags); |
876 | put_cpu(); | |
1da177e4 | 877 | |
725d704e | 878 | VM_BUG_ON(bad_range(zone, page)); |
17cf4406 | 879 | if (prep_new_page(page, order, gfp_flags)) |
a74609fa | 880 | goto again; |
1da177e4 | 881 | return page; |
a74609fa NP |
882 | |
883 | failed: | |
884 | local_irq_restore(flags); | |
885 | put_cpu(); | |
886 | return NULL; | |
1da177e4 LT |
887 | } |
888 | ||
7fb1d9fc | 889 | #define ALLOC_NO_WATERMARKS 0x01 /* don't check watermarks at all */ |
3148890b NP |
890 | #define ALLOC_WMARK_MIN 0x02 /* use pages_min watermark */ |
891 | #define ALLOC_WMARK_LOW 0x04 /* use pages_low watermark */ | |
892 | #define ALLOC_WMARK_HIGH 0x08 /* use pages_high watermark */ | |
893 | #define ALLOC_HARDER 0x10 /* try to alloc harder */ | |
894 | #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */ | |
895 | #define ALLOC_CPUSET 0x40 /* check for correct cpuset */ | |
7fb1d9fc | 896 | |
1da177e4 LT |
897 | /* |
898 | * Return 1 if free pages are above 'mark'. This takes into account the order | |
899 | * of the allocation. | |
900 | */ | |
901 | int zone_watermark_ok(struct zone *z, int order, unsigned long mark, | |
7fb1d9fc | 902 | int classzone_idx, int alloc_flags) |
1da177e4 LT |
903 | { |
904 | /* free_pages my go negative - that's OK */ | |
e80ee884 NP |
905 | unsigned long min = mark; |
906 | long free_pages = z->free_pages - (1 << order) + 1; | |
1da177e4 LT |
907 | int o; |
908 | ||
7fb1d9fc | 909 | if (alloc_flags & ALLOC_HIGH) |
1da177e4 | 910 | min -= min / 2; |
7fb1d9fc | 911 | if (alloc_flags & ALLOC_HARDER) |
1da177e4 LT |
912 | min -= min / 4; |
913 | ||
914 | if (free_pages <= min + z->lowmem_reserve[classzone_idx]) | |
915 | return 0; | |
916 | for (o = 0; o < order; o++) { | |
917 | /* At the next order, this order's pages become unavailable */ | |
918 | free_pages -= z->free_area[o].nr_free << o; | |
919 | ||
920 | /* Require fewer higher order pages to be free */ | |
921 | min >>= 1; | |
922 | ||
923 | if (free_pages <= min) | |
924 | return 0; | |
925 | } | |
926 | return 1; | |
927 | } | |
928 | ||
9276b1bc PJ |
929 | #ifdef CONFIG_NUMA |
930 | /* | |
931 | * zlc_setup - Setup for "zonelist cache". Uses cached zone data to | |
932 | * skip over zones that are not allowed by the cpuset, or that have | |
933 | * been recently (in last second) found to be nearly full. See further | |
934 | * comments in mmzone.h. Reduces cache footprint of zonelist scans | |
935 | * that have to skip over alot of full or unallowed zones. | |
936 | * | |
937 | * If the zonelist cache is present in the passed in zonelist, then | |
938 | * returns a pointer to the allowed node mask (either the current | |
939 | * tasks mems_allowed, or node_online_map.) | |
940 | * | |
941 | * If the zonelist cache is not available for this zonelist, does | |
942 | * nothing and returns NULL. | |
943 | * | |
944 | * If the fullzones BITMAP in the zonelist cache is stale (more than | |
945 | * a second since last zap'd) then we zap it out (clear its bits.) | |
946 | * | |
947 | * We hold off even calling zlc_setup, until after we've checked the | |
948 | * first zone in the zonelist, on the theory that most allocations will | |
949 | * be satisfied from that first zone, so best to examine that zone as | |
950 | * quickly as we can. | |
951 | */ | |
952 | static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags) | |
953 | { | |
954 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
955 | nodemask_t *allowednodes; /* zonelist_cache approximation */ | |
956 | ||
957 | zlc = zonelist->zlcache_ptr; | |
958 | if (!zlc) | |
959 | return NULL; | |
960 | ||
961 | if (jiffies - zlc->last_full_zap > 1 * HZ) { | |
962 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); | |
963 | zlc->last_full_zap = jiffies; | |
964 | } | |
965 | ||
966 | allowednodes = !in_interrupt() && (alloc_flags & ALLOC_CPUSET) ? | |
967 | &cpuset_current_mems_allowed : | |
968 | &node_online_map; | |
969 | return allowednodes; | |
970 | } | |
971 | ||
972 | /* | |
973 | * Given 'z' scanning a zonelist, run a couple of quick checks to see | |
974 | * if it is worth looking at further for free memory: | |
975 | * 1) Check that the zone isn't thought to be full (doesn't have its | |
976 | * bit set in the zonelist_cache fullzones BITMAP). | |
977 | * 2) Check that the zones node (obtained from the zonelist_cache | |
978 | * z_to_n[] mapping) is allowed in the passed in allowednodes mask. | |
979 | * Return true (non-zero) if zone is worth looking at further, or | |
980 | * else return false (zero) if it is not. | |
981 | * | |
982 | * This check -ignores- the distinction between various watermarks, | |
983 | * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is | |
984 | * found to be full for any variation of these watermarks, it will | |
985 | * be considered full for up to one second by all requests, unless | |
986 | * we are so low on memory on all allowed nodes that we are forced | |
987 | * into the second scan of the zonelist. | |
988 | * | |
989 | * In the second scan we ignore this zonelist cache and exactly | |
990 | * apply the watermarks to all zones, even it is slower to do so. | |
991 | * We are low on memory in the second scan, and should leave no stone | |
992 | * unturned looking for a free page. | |
993 | */ | |
994 | static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zone **z, | |
995 | nodemask_t *allowednodes) | |
996 | { | |
997 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
998 | int i; /* index of *z in zonelist zones */ | |
999 | int n; /* node that zone *z is on */ | |
1000 | ||
1001 | zlc = zonelist->zlcache_ptr; | |
1002 | if (!zlc) | |
1003 | return 1; | |
1004 | ||
1005 | i = z - zonelist->zones; | |
1006 | n = zlc->z_to_n[i]; | |
1007 | ||
1008 | /* This zone is worth trying if it is allowed but not full */ | |
1009 | return node_isset(n, *allowednodes) && !test_bit(i, zlc->fullzones); | |
1010 | } | |
1011 | ||
1012 | /* | |
1013 | * Given 'z' scanning a zonelist, set the corresponding bit in | |
1014 | * zlc->fullzones, so that subsequent attempts to allocate a page | |
1015 | * from that zone don't waste time re-examining it. | |
1016 | */ | |
1017 | static void zlc_mark_zone_full(struct zonelist *zonelist, struct zone **z) | |
1018 | { | |
1019 | struct zonelist_cache *zlc; /* cached zonelist speedup info */ | |
1020 | int i; /* index of *z in zonelist zones */ | |
1021 | ||
1022 | zlc = zonelist->zlcache_ptr; | |
1023 | if (!zlc) | |
1024 | return; | |
1025 | ||
1026 | i = z - zonelist->zones; | |
1027 | ||
1028 | set_bit(i, zlc->fullzones); | |
1029 | } | |
1030 | ||
1031 | #else /* CONFIG_NUMA */ | |
1032 | ||
1033 | static nodemask_t *zlc_setup(struct zonelist *zonelist, int alloc_flags) | |
1034 | { | |
1035 | return NULL; | |
1036 | } | |
1037 | ||
1038 | static int zlc_zone_worth_trying(struct zonelist *zonelist, struct zone **z, | |
1039 | nodemask_t *allowednodes) | |
1040 | { | |
1041 | return 1; | |
1042 | } | |
1043 | ||
1044 | static void zlc_mark_zone_full(struct zonelist *zonelist, struct zone **z) | |
1045 | { | |
1046 | } | |
1047 | #endif /* CONFIG_NUMA */ | |
1048 | ||
7fb1d9fc | 1049 | /* |
0798e519 | 1050 | * get_page_from_freelist goes through the zonelist trying to allocate |
7fb1d9fc RS |
1051 | * a page. |
1052 | */ | |
1053 | static struct page * | |
1054 | get_page_from_freelist(gfp_t gfp_mask, unsigned int order, | |
1055 | struct zonelist *zonelist, int alloc_flags) | |
753ee728 | 1056 | { |
9276b1bc | 1057 | struct zone **z; |
7fb1d9fc | 1058 | struct page *page = NULL; |
9276b1bc | 1059 | int classzone_idx = zone_idx(zonelist->zones[0]); |
1192d526 | 1060 | struct zone *zone; |
9276b1bc PJ |
1061 | nodemask_t *allowednodes = NULL;/* zonelist_cache approximation */ |
1062 | int zlc_active = 0; /* set if using zonelist_cache */ | |
1063 | int did_zlc_setup = 0; /* just call zlc_setup() one time */ | |
7fb1d9fc | 1064 | |
9276b1bc | 1065 | zonelist_scan: |
7fb1d9fc | 1066 | /* |
9276b1bc | 1067 | * Scan zonelist, looking for a zone with enough free. |
7fb1d9fc RS |
1068 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. |
1069 | */ | |
9276b1bc PJ |
1070 | z = zonelist->zones; |
1071 | ||
7fb1d9fc | 1072 | do { |
9276b1bc PJ |
1073 | if (NUMA_BUILD && zlc_active && |
1074 | !zlc_zone_worth_trying(zonelist, z, allowednodes)) | |
1075 | continue; | |
1192d526 | 1076 | zone = *z; |
08e0f6a9 | 1077 | if (unlikely(NUMA_BUILD && (gfp_mask & __GFP_THISNODE) && |
1192d526 | 1078 | zone->zone_pgdat != zonelist->zones[0]->zone_pgdat)) |
9b819d20 | 1079 | break; |
7fb1d9fc | 1080 | if ((alloc_flags & ALLOC_CPUSET) && |
0798e519 | 1081 | !cpuset_zone_allowed(zone, gfp_mask)) |
9276b1bc | 1082 | goto try_next_zone; |
7fb1d9fc RS |
1083 | |
1084 | if (!(alloc_flags & ALLOC_NO_WATERMARKS)) { | |
3148890b NP |
1085 | unsigned long mark; |
1086 | if (alloc_flags & ALLOC_WMARK_MIN) | |
1192d526 | 1087 | mark = zone->pages_min; |
3148890b | 1088 | else if (alloc_flags & ALLOC_WMARK_LOW) |
1192d526 | 1089 | mark = zone->pages_low; |
3148890b | 1090 | else |
1192d526 | 1091 | mark = zone->pages_high; |
0798e519 PJ |
1092 | if (!zone_watermark_ok(zone, order, mark, |
1093 | classzone_idx, alloc_flags)) { | |
9eeff239 | 1094 | if (!zone_reclaim_mode || |
1192d526 | 1095 | !zone_reclaim(zone, gfp_mask, order)) |
9276b1bc | 1096 | goto this_zone_full; |
0798e519 | 1097 | } |
7fb1d9fc RS |
1098 | } |
1099 | ||
1192d526 | 1100 | page = buffered_rmqueue(zonelist, zone, order, gfp_mask); |
0798e519 | 1101 | if (page) |
7fb1d9fc | 1102 | break; |
9276b1bc PJ |
1103 | this_zone_full: |
1104 | if (NUMA_BUILD) | |
1105 | zlc_mark_zone_full(zonelist, z); | |
1106 | try_next_zone: | |
1107 | if (NUMA_BUILD && !did_zlc_setup) { | |
1108 | /* we do zlc_setup after the first zone is tried */ | |
1109 | allowednodes = zlc_setup(zonelist, alloc_flags); | |
1110 | zlc_active = 1; | |
1111 | did_zlc_setup = 1; | |
1112 | } | |
7fb1d9fc | 1113 | } while (*(++z) != NULL); |
9276b1bc PJ |
1114 | |
1115 | if (unlikely(NUMA_BUILD && page == NULL && zlc_active)) { | |
1116 | /* Disable zlc cache for second zonelist scan */ | |
1117 | zlc_active = 0; | |
1118 | goto zonelist_scan; | |
1119 | } | |
7fb1d9fc | 1120 | return page; |
753ee728 MH |
1121 | } |
1122 | ||
1da177e4 LT |
1123 | /* |
1124 | * This is the 'heart' of the zoned buddy allocator. | |
1125 | */ | |
1126 | struct page * fastcall | |
dd0fc66f | 1127 | __alloc_pages(gfp_t gfp_mask, unsigned int order, |
1da177e4 LT |
1128 | struct zonelist *zonelist) |
1129 | { | |
260b2367 | 1130 | const gfp_t wait = gfp_mask & __GFP_WAIT; |
7fb1d9fc | 1131 | struct zone **z; |
1da177e4 LT |
1132 | struct page *page; |
1133 | struct reclaim_state reclaim_state; | |
1134 | struct task_struct *p = current; | |
1da177e4 | 1135 | int do_retry; |
7fb1d9fc | 1136 | int alloc_flags; |
1da177e4 LT |
1137 | int did_some_progress; |
1138 | ||
1139 | might_sleep_if(wait); | |
1140 | ||
6b1de916 | 1141 | restart: |
7fb1d9fc | 1142 | z = zonelist->zones; /* the list of zones suitable for gfp_mask */ |
1da177e4 | 1143 | |
7fb1d9fc | 1144 | if (unlikely(*z == NULL)) { |
1da177e4 LT |
1145 | /* Should this ever happen?? */ |
1146 | return NULL; | |
1147 | } | |
6b1de916 | 1148 | |
7fb1d9fc | 1149 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, order, |
3148890b | 1150 | zonelist, ALLOC_WMARK_LOW|ALLOC_CPUSET); |
7fb1d9fc RS |
1151 | if (page) |
1152 | goto got_pg; | |
1da177e4 | 1153 | |
0798e519 | 1154 | for (z = zonelist->zones; *z; z++) |
43b0bc00 | 1155 | wakeup_kswapd(*z, order); |
1da177e4 | 1156 | |
9bf2229f | 1157 | /* |
7fb1d9fc RS |
1158 | * OK, we're below the kswapd watermark and have kicked background |
1159 | * reclaim. Now things get more complex, so set up alloc_flags according | |
1160 | * to how we want to proceed. | |
1161 | * | |
1162 | * The caller may dip into page reserves a bit more if the caller | |
1163 | * cannot run direct reclaim, or if the caller has realtime scheduling | |
4eac915d PJ |
1164 | * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will |
1165 | * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH). | |
9bf2229f | 1166 | */ |
3148890b | 1167 | alloc_flags = ALLOC_WMARK_MIN; |
7fb1d9fc RS |
1168 | if ((unlikely(rt_task(p)) && !in_interrupt()) || !wait) |
1169 | alloc_flags |= ALLOC_HARDER; | |
1170 | if (gfp_mask & __GFP_HIGH) | |
1171 | alloc_flags |= ALLOC_HIGH; | |
bdd804f4 PJ |
1172 | if (wait) |
1173 | alloc_flags |= ALLOC_CPUSET; | |
1da177e4 LT |
1174 | |
1175 | /* | |
1176 | * Go through the zonelist again. Let __GFP_HIGH and allocations | |
7fb1d9fc | 1177 | * coming from realtime tasks go deeper into reserves. |
1da177e4 LT |
1178 | * |
1179 | * This is the last chance, in general, before the goto nopage. | |
1180 | * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc. | |
9bf2229f | 1181 | * See also cpuset_zone_allowed() comment in kernel/cpuset.c. |
1da177e4 | 1182 | */ |
7fb1d9fc RS |
1183 | page = get_page_from_freelist(gfp_mask, order, zonelist, alloc_flags); |
1184 | if (page) | |
1185 | goto got_pg; | |
1da177e4 LT |
1186 | |
1187 | /* This allocation should allow future memory freeing. */ | |
b84a35be | 1188 | |
b43a57bb | 1189 | rebalance: |
b84a35be NP |
1190 | if (((p->flags & PF_MEMALLOC) || unlikely(test_thread_flag(TIF_MEMDIE))) |
1191 | && !in_interrupt()) { | |
1192 | if (!(gfp_mask & __GFP_NOMEMALLOC)) { | |
885036d3 | 1193 | nofail_alloc: |
b84a35be | 1194 | /* go through the zonelist yet again, ignoring mins */ |
7fb1d9fc | 1195 | page = get_page_from_freelist(gfp_mask, order, |
47f3a867 | 1196 | zonelist, ALLOC_NO_WATERMARKS); |
7fb1d9fc RS |
1197 | if (page) |
1198 | goto got_pg; | |
885036d3 | 1199 | if (gfp_mask & __GFP_NOFAIL) { |
3fcfab16 | 1200 | congestion_wait(WRITE, HZ/50); |
885036d3 KK |
1201 | goto nofail_alloc; |
1202 | } | |
1da177e4 LT |
1203 | } |
1204 | goto nopage; | |
1205 | } | |
1206 | ||
1207 | /* Atomic allocations - we can't balance anything */ | |
1208 | if (!wait) | |
1209 | goto nopage; | |
1210 | ||
1da177e4 LT |
1211 | cond_resched(); |
1212 | ||
1213 | /* We now go into synchronous reclaim */ | |
3e0d98b9 | 1214 | cpuset_memory_pressure_bump(); |
1da177e4 LT |
1215 | p->flags |= PF_MEMALLOC; |
1216 | reclaim_state.reclaimed_slab = 0; | |
1217 | p->reclaim_state = &reclaim_state; | |
1218 | ||
7fb1d9fc | 1219 | did_some_progress = try_to_free_pages(zonelist->zones, gfp_mask); |
1da177e4 LT |
1220 | |
1221 | p->reclaim_state = NULL; | |
1222 | p->flags &= ~PF_MEMALLOC; | |
1223 | ||
1224 | cond_resched(); | |
1225 | ||
1226 | if (likely(did_some_progress)) { | |
7fb1d9fc RS |
1227 | page = get_page_from_freelist(gfp_mask, order, |
1228 | zonelist, alloc_flags); | |
1229 | if (page) | |
1230 | goto got_pg; | |
1da177e4 LT |
1231 | } else if ((gfp_mask & __GFP_FS) && !(gfp_mask & __GFP_NORETRY)) { |
1232 | /* | |
1233 | * Go through the zonelist yet one more time, keep | |
1234 | * very high watermark here, this is only to catch | |
1235 | * a parallel oom killing, we must fail if we're still | |
1236 | * under heavy pressure. | |
1237 | */ | |
7fb1d9fc | 1238 | page = get_page_from_freelist(gfp_mask|__GFP_HARDWALL, order, |
3148890b | 1239 | zonelist, ALLOC_WMARK_HIGH|ALLOC_CPUSET); |
7fb1d9fc RS |
1240 | if (page) |
1241 | goto got_pg; | |
1da177e4 | 1242 | |
9b0f8b04 | 1243 | out_of_memory(zonelist, gfp_mask, order); |
1da177e4 LT |
1244 | goto restart; |
1245 | } | |
1246 | ||
1247 | /* | |
1248 | * Don't let big-order allocations loop unless the caller explicitly | |
1249 | * requests that. Wait for some write requests to complete then retry. | |
1250 | * | |
1251 | * In this implementation, __GFP_REPEAT means __GFP_NOFAIL for order | |
1252 | * <= 3, but that may not be true in other implementations. | |
1253 | */ | |
1254 | do_retry = 0; | |
1255 | if (!(gfp_mask & __GFP_NORETRY)) { | |
1256 | if ((order <= 3) || (gfp_mask & __GFP_REPEAT)) | |
1257 | do_retry = 1; | |
1258 | if (gfp_mask & __GFP_NOFAIL) | |
1259 | do_retry = 1; | |
1260 | } | |
1261 | if (do_retry) { | |
3fcfab16 | 1262 | congestion_wait(WRITE, HZ/50); |
1da177e4 LT |
1263 | goto rebalance; |
1264 | } | |
1265 | ||
1266 | nopage: | |
1267 | if (!(gfp_mask & __GFP_NOWARN) && printk_ratelimit()) { | |
1268 | printk(KERN_WARNING "%s: page allocation failure." | |
1269 | " order:%d, mode:0x%x\n", | |
1270 | p->comm, order, gfp_mask); | |
1271 | dump_stack(); | |
578c2fd6 | 1272 | show_mem(); |
1da177e4 | 1273 | } |
1da177e4 | 1274 | got_pg: |
1da177e4 LT |
1275 | return page; |
1276 | } | |
1277 | ||
1278 | EXPORT_SYMBOL(__alloc_pages); | |
1279 | ||
1280 | /* | |
1281 | * Common helper functions. | |
1282 | */ | |
dd0fc66f | 1283 | fastcall unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order) |
1da177e4 LT |
1284 | { |
1285 | struct page * page; | |
1286 | page = alloc_pages(gfp_mask, order); | |
1287 | if (!page) | |
1288 | return 0; | |
1289 | return (unsigned long) page_address(page); | |
1290 | } | |
1291 | ||
1292 | EXPORT_SYMBOL(__get_free_pages); | |
1293 | ||
dd0fc66f | 1294 | fastcall unsigned long get_zeroed_page(gfp_t gfp_mask) |
1da177e4 LT |
1295 | { |
1296 | struct page * page; | |
1297 | ||
1298 | /* | |
1299 | * get_zeroed_page() returns a 32-bit address, which cannot represent | |
1300 | * a highmem page | |
1301 | */ | |
725d704e | 1302 | VM_BUG_ON((gfp_mask & __GFP_HIGHMEM) != 0); |
1da177e4 LT |
1303 | |
1304 | page = alloc_pages(gfp_mask | __GFP_ZERO, 0); | |
1305 | if (page) | |
1306 | return (unsigned long) page_address(page); | |
1307 | return 0; | |
1308 | } | |
1309 | ||
1310 | EXPORT_SYMBOL(get_zeroed_page); | |
1311 | ||
1312 | void __pagevec_free(struct pagevec *pvec) | |
1313 | { | |
1314 | int i = pagevec_count(pvec); | |
1315 | ||
1316 | while (--i >= 0) | |
1317 | free_hot_cold_page(pvec->pages[i], pvec->cold); | |
1318 | } | |
1319 | ||
1320 | fastcall void __free_pages(struct page *page, unsigned int order) | |
1321 | { | |
b5810039 | 1322 | if (put_page_testzero(page)) { |
1da177e4 LT |
1323 | if (order == 0) |
1324 | free_hot_page(page); | |
1325 | else | |
1326 | __free_pages_ok(page, order); | |
1327 | } | |
1328 | } | |
1329 | ||
1330 | EXPORT_SYMBOL(__free_pages); | |
1331 | ||
1332 | fastcall void free_pages(unsigned long addr, unsigned int order) | |
1333 | { | |
1334 | if (addr != 0) { | |
725d704e | 1335 | VM_BUG_ON(!virt_addr_valid((void *)addr)); |
1da177e4 LT |
1336 | __free_pages(virt_to_page((void *)addr), order); |
1337 | } | |
1338 | } | |
1339 | ||
1340 | EXPORT_SYMBOL(free_pages); | |
1341 | ||
1342 | /* | |
1343 | * Total amount of free (allocatable) RAM: | |
1344 | */ | |
1345 | unsigned int nr_free_pages(void) | |
1346 | { | |
1347 | unsigned int sum = 0; | |
1348 | struct zone *zone; | |
1349 | ||
1350 | for_each_zone(zone) | |
1351 | sum += zone->free_pages; | |
1352 | ||
1353 | return sum; | |
1354 | } | |
1355 | ||
1356 | EXPORT_SYMBOL(nr_free_pages); | |
1357 | ||
1358 | #ifdef CONFIG_NUMA | |
1359 | unsigned int nr_free_pages_pgdat(pg_data_t *pgdat) | |
1360 | { | |
2f6726e5 CL |
1361 | unsigned int sum = 0; |
1362 | enum zone_type i; | |
1da177e4 LT |
1363 | |
1364 | for (i = 0; i < MAX_NR_ZONES; i++) | |
1365 | sum += pgdat->node_zones[i].free_pages; | |
1366 | ||
1367 | return sum; | |
1368 | } | |
1369 | #endif | |
1370 | ||
1371 | static unsigned int nr_free_zone_pages(int offset) | |
1372 | { | |
e310fd43 MB |
1373 | /* Just pick one node, since fallback list is circular */ |
1374 | pg_data_t *pgdat = NODE_DATA(numa_node_id()); | |
1da177e4 LT |
1375 | unsigned int sum = 0; |
1376 | ||
e310fd43 MB |
1377 | struct zonelist *zonelist = pgdat->node_zonelists + offset; |
1378 | struct zone **zonep = zonelist->zones; | |
1379 | struct zone *zone; | |
1da177e4 | 1380 | |
e310fd43 MB |
1381 | for (zone = *zonep++; zone; zone = *zonep++) { |
1382 | unsigned long size = zone->present_pages; | |
1383 | unsigned long high = zone->pages_high; | |
1384 | if (size > high) | |
1385 | sum += size - high; | |
1da177e4 LT |
1386 | } |
1387 | ||
1388 | return sum; | |
1389 | } | |
1390 | ||
1391 | /* | |
1392 | * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL | |
1393 | */ | |
1394 | unsigned int nr_free_buffer_pages(void) | |
1395 | { | |
af4ca457 | 1396 | return nr_free_zone_pages(gfp_zone(GFP_USER)); |
1da177e4 LT |
1397 | } |
1398 | ||
1399 | /* | |
1400 | * Amount of free RAM allocatable within all zones | |
1401 | */ | |
1402 | unsigned int nr_free_pagecache_pages(void) | |
1403 | { | |
af4ca457 | 1404 | return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER)); |
1da177e4 | 1405 | } |
08e0f6a9 CL |
1406 | |
1407 | static inline void show_node(struct zone *zone) | |
1da177e4 | 1408 | { |
08e0f6a9 CL |
1409 | if (NUMA_BUILD) |
1410 | printk("Node %ld ", zone_to_nid(zone)); | |
1da177e4 | 1411 | } |
1da177e4 | 1412 | |
1da177e4 LT |
1413 | void si_meminfo(struct sysinfo *val) |
1414 | { | |
1415 | val->totalram = totalram_pages; | |
1416 | val->sharedram = 0; | |
1417 | val->freeram = nr_free_pages(); | |
1418 | val->bufferram = nr_blockdev_pages(); | |
1da177e4 LT |
1419 | val->totalhigh = totalhigh_pages; |
1420 | val->freehigh = nr_free_highpages(); | |
1da177e4 LT |
1421 | val->mem_unit = PAGE_SIZE; |
1422 | } | |
1423 | ||
1424 | EXPORT_SYMBOL(si_meminfo); | |
1425 | ||
1426 | #ifdef CONFIG_NUMA | |
1427 | void si_meminfo_node(struct sysinfo *val, int nid) | |
1428 | { | |
1429 | pg_data_t *pgdat = NODE_DATA(nid); | |
1430 | ||
1431 | val->totalram = pgdat->node_present_pages; | |
1432 | val->freeram = nr_free_pages_pgdat(pgdat); | |
98d2b0eb | 1433 | #ifdef CONFIG_HIGHMEM |
1da177e4 LT |
1434 | val->totalhigh = pgdat->node_zones[ZONE_HIGHMEM].present_pages; |
1435 | val->freehigh = pgdat->node_zones[ZONE_HIGHMEM].free_pages; | |
98d2b0eb CL |
1436 | #else |
1437 | val->totalhigh = 0; | |
1438 | val->freehigh = 0; | |
1439 | #endif | |
1da177e4 LT |
1440 | val->mem_unit = PAGE_SIZE; |
1441 | } | |
1442 | #endif | |
1443 | ||
1444 | #define K(x) ((x) << (PAGE_SHIFT-10)) | |
1445 | ||
1446 | /* | |
1447 | * Show free area list (used inside shift_scroll-lock stuff) | |
1448 | * We also calculate the percentage fragmentation. We do this by counting the | |
1449 | * memory on each free list with the exception of the first item on the list. | |
1450 | */ | |
1451 | void show_free_areas(void) | |
1452 | { | |
c7241913 | 1453 | int cpu; |
1da177e4 LT |
1454 | unsigned long active; |
1455 | unsigned long inactive; | |
1456 | unsigned long free; | |
1457 | struct zone *zone; | |
1458 | ||
1459 | for_each_zone(zone) { | |
c7241913 | 1460 | if (!populated_zone(zone)) |
1da177e4 | 1461 | continue; |
c7241913 JS |
1462 | |
1463 | show_node(zone); | |
1464 | printk("%s per-cpu:\n", zone->name); | |
1da177e4 | 1465 | |
6b482c67 | 1466 | for_each_online_cpu(cpu) { |
1da177e4 LT |
1467 | struct per_cpu_pageset *pageset; |
1468 | ||
e7c8d5c9 | 1469 | pageset = zone_pcp(zone, cpu); |
1da177e4 | 1470 | |
c7241913 JS |
1471 | printk("CPU %4d: Hot: hi:%5d, btch:%4d usd:%4d " |
1472 | "Cold: hi:%5d, btch:%4d usd:%4d\n", | |
1473 | cpu, pageset->pcp[0].high, | |
1474 | pageset->pcp[0].batch, pageset->pcp[0].count, | |
1475 | pageset->pcp[1].high, pageset->pcp[1].batch, | |
1476 | pageset->pcp[1].count); | |
1da177e4 LT |
1477 | } |
1478 | } | |
1479 | ||
1da177e4 LT |
1480 | get_zone_counts(&active, &inactive, &free); |
1481 | ||
1da177e4 LT |
1482 | printk("Active:%lu inactive:%lu dirty:%lu writeback:%lu " |
1483 | "unstable:%lu free:%u slab:%lu mapped:%lu pagetables:%lu\n", | |
1484 | active, | |
1485 | inactive, | |
b1e7a8fd | 1486 | global_page_state(NR_FILE_DIRTY), |
ce866b34 | 1487 | global_page_state(NR_WRITEBACK), |
fd39fc85 | 1488 | global_page_state(NR_UNSTABLE_NFS), |
1da177e4 | 1489 | nr_free_pages(), |
972d1a7b CL |
1490 | global_page_state(NR_SLAB_RECLAIMABLE) + |
1491 | global_page_state(NR_SLAB_UNRECLAIMABLE), | |
65ba55f5 | 1492 | global_page_state(NR_FILE_MAPPED), |
df849a15 | 1493 | global_page_state(NR_PAGETABLE)); |
1da177e4 LT |
1494 | |
1495 | for_each_zone(zone) { | |
1496 | int i; | |
1497 | ||
c7241913 JS |
1498 | if (!populated_zone(zone)) |
1499 | continue; | |
1500 | ||
1da177e4 LT |
1501 | show_node(zone); |
1502 | printk("%s" | |
1503 | " free:%lukB" | |
1504 | " min:%lukB" | |
1505 | " low:%lukB" | |
1506 | " high:%lukB" | |
1507 | " active:%lukB" | |
1508 | " inactive:%lukB" | |
1509 | " present:%lukB" | |
1510 | " pages_scanned:%lu" | |
1511 | " all_unreclaimable? %s" | |
1512 | "\n", | |
1513 | zone->name, | |
1514 | K(zone->free_pages), | |
1515 | K(zone->pages_min), | |
1516 | K(zone->pages_low), | |
1517 | K(zone->pages_high), | |
1518 | K(zone->nr_active), | |
1519 | K(zone->nr_inactive), | |
1520 | K(zone->present_pages), | |
1521 | zone->pages_scanned, | |
1522 | (zone->all_unreclaimable ? "yes" : "no") | |
1523 | ); | |
1524 | printk("lowmem_reserve[]:"); | |
1525 | for (i = 0; i < MAX_NR_ZONES; i++) | |
1526 | printk(" %lu", zone->lowmem_reserve[i]); | |
1527 | printk("\n"); | |
1528 | } | |
1529 | ||
1530 | for_each_zone(zone) { | |
8f9de51a | 1531 | unsigned long nr[MAX_ORDER], flags, order, total = 0; |
1da177e4 | 1532 | |
c7241913 JS |
1533 | if (!populated_zone(zone)) |
1534 | continue; | |
1535 | ||
1da177e4 LT |
1536 | show_node(zone); |
1537 | printk("%s: ", zone->name); | |
1da177e4 LT |
1538 | |
1539 | spin_lock_irqsave(&zone->lock, flags); | |
1540 | for (order = 0; order < MAX_ORDER; order++) { | |
8f9de51a KK |
1541 | nr[order] = zone->free_area[order].nr_free; |
1542 | total += nr[order] << order; | |
1da177e4 LT |
1543 | } |
1544 | spin_unlock_irqrestore(&zone->lock, flags); | |
8f9de51a KK |
1545 | for (order = 0; order < MAX_ORDER; order++) |
1546 | printk("%lu*%lukB ", nr[order], K(1UL) << order); | |
1da177e4 LT |
1547 | printk("= %lukB\n", K(total)); |
1548 | } | |
1549 | ||
1550 | show_swap_cache_info(); | |
1551 | } | |
1552 | ||
1553 | /* | |
1554 | * Builds allocation fallback zone lists. | |
1a93205b CL |
1555 | * |
1556 | * Add all populated zones of a node to the zonelist. | |
1da177e4 | 1557 | */ |
86356ab1 | 1558 | static int __meminit build_zonelists_node(pg_data_t *pgdat, |
2f6726e5 | 1559 | struct zonelist *zonelist, int nr_zones, enum zone_type zone_type) |
1da177e4 | 1560 | { |
1a93205b CL |
1561 | struct zone *zone; |
1562 | ||
98d2b0eb | 1563 | BUG_ON(zone_type >= MAX_NR_ZONES); |
2f6726e5 | 1564 | zone_type++; |
02a68a5e CL |
1565 | |
1566 | do { | |
2f6726e5 | 1567 | zone_type--; |
070f8032 | 1568 | zone = pgdat->node_zones + zone_type; |
1a93205b | 1569 | if (populated_zone(zone)) { |
070f8032 CL |
1570 | zonelist->zones[nr_zones++] = zone; |
1571 | check_highest_zone(zone_type); | |
1da177e4 | 1572 | } |
02a68a5e | 1573 | |
2f6726e5 | 1574 | } while (zone_type); |
070f8032 | 1575 | return nr_zones; |
1da177e4 LT |
1576 | } |
1577 | ||
1578 | #ifdef CONFIG_NUMA | |
1579 | #define MAX_NODE_LOAD (num_online_nodes()) | |
86356ab1 | 1580 | static int __meminitdata node_load[MAX_NUMNODES]; |
1da177e4 | 1581 | /** |
4dc3b16b | 1582 | * find_next_best_node - find the next node that should appear in a given node's fallback list |
1da177e4 LT |
1583 | * @node: node whose fallback list we're appending |
1584 | * @used_node_mask: nodemask_t of already used nodes | |
1585 | * | |
1586 | * We use a number of factors to determine which is the next node that should | |
1587 | * appear on a given node's fallback list. The node should not have appeared | |
1588 | * already in @node's fallback list, and it should be the next closest node | |
1589 | * according to the distance array (which contains arbitrary distance values | |
1590 | * from each node to each node in the system), and should also prefer nodes | |
1591 | * with no CPUs, since presumably they'll have very little allocation pressure | |
1592 | * on them otherwise. | |
1593 | * It returns -1 if no node is found. | |
1594 | */ | |
86356ab1 | 1595 | static int __meminit find_next_best_node(int node, nodemask_t *used_node_mask) |
1da177e4 | 1596 | { |
4cf808eb | 1597 | int n, val; |
1da177e4 LT |
1598 | int min_val = INT_MAX; |
1599 | int best_node = -1; | |
1600 | ||
4cf808eb LT |
1601 | /* Use the local node if we haven't already */ |
1602 | if (!node_isset(node, *used_node_mask)) { | |
1603 | node_set(node, *used_node_mask); | |
1604 | return node; | |
1605 | } | |
1da177e4 | 1606 | |
4cf808eb LT |
1607 | for_each_online_node(n) { |
1608 | cpumask_t tmp; | |
1da177e4 LT |
1609 | |
1610 | /* Don't want a node to appear more than once */ | |
1611 | if (node_isset(n, *used_node_mask)) | |
1612 | continue; | |
1613 | ||
1da177e4 LT |
1614 | /* Use the distance array to find the distance */ |
1615 | val = node_distance(node, n); | |
1616 | ||
4cf808eb LT |
1617 | /* Penalize nodes under us ("prefer the next node") */ |
1618 | val += (n < node); | |
1619 | ||
1da177e4 LT |
1620 | /* Give preference to headless and unused nodes */ |
1621 | tmp = node_to_cpumask(n); | |
1622 | if (!cpus_empty(tmp)) | |
1623 | val += PENALTY_FOR_NODE_WITH_CPUS; | |
1624 | ||
1625 | /* Slight preference for less loaded node */ | |
1626 | val *= (MAX_NODE_LOAD*MAX_NUMNODES); | |
1627 | val += node_load[n]; | |
1628 | ||
1629 | if (val < min_val) { | |
1630 | min_val = val; | |
1631 | best_node = n; | |
1632 | } | |
1633 | } | |
1634 | ||
1635 | if (best_node >= 0) | |
1636 | node_set(best_node, *used_node_mask); | |
1637 | ||
1638 | return best_node; | |
1639 | } | |
1640 | ||
86356ab1 | 1641 | static void __meminit build_zonelists(pg_data_t *pgdat) |
1da177e4 | 1642 | { |
19655d34 CL |
1643 | int j, node, local_node; |
1644 | enum zone_type i; | |
1da177e4 LT |
1645 | int prev_node, load; |
1646 | struct zonelist *zonelist; | |
1647 | nodemask_t used_mask; | |
1648 | ||
1649 | /* initialize zonelists */ | |
19655d34 | 1650 | for (i = 0; i < MAX_NR_ZONES; i++) { |
1da177e4 LT |
1651 | zonelist = pgdat->node_zonelists + i; |
1652 | zonelist->zones[0] = NULL; | |
1653 | } | |
1654 | ||
1655 | /* NUMA-aware ordering of nodes */ | |
1656 | local_node = pgdat->node_id; | |
1657 | load = num_online_nodes(); | |
1658 | prev_node = local_node; | |
1659 | nodes_clear(used_mask); | |
1660 | while ((node = find_next_best_node(local_node, &used_mask)) >= 0) { | |
9eeff239 CL |
1661 | int distance = node_distance(local_node, node); |
1662 | ||
1663 | /* | |
1664 | * If another node is sufficiently far away then it is better | |
1665 | * to reclaim pages in a zone before going off node. | |
1666 | */ | |
1667 | if (distance > RECLAIM_DISTANCE) | |
1668 | zone_reclaim_mode = 1; | |
1669 | ||
1da177e4 LT |
1670 | /* |
1671 | * We don't want to pressure a particular node. | |
1672 | * So adding penalty to the first node in same | |
1673 | * distance group to make it round-robin. | |
1674 | */ | |
9eeff239 CL |
1675 | |
1676 | if (distance != node_distance(local_node, prev_node)) | |
1da177e4 LT |
1677 | node_load[node] += load; |
1678 | prev_node = node; | |
1679 | load--; | |
19655d34 | 1680 | for (i = 0; i < MAX_NR_ZONES; i++) { |
1da177e4 LT |
1681 | zonelist = pgdat->node_zonelists + i; |
1682 | for (j = 0; zonelist->zones[j] != NULL; j++); | |
1683 | ||
19655d34 | 1684 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, i); |
1da177e4 LT |
1685 | zonelist->zones[j] = NULL; |
1686 | } | |
1687 | } | |
1688 | } | |
1689 | ||
9276b1bc PJ |
1690 | /* Construct the zonelist performance cache - see further mmzone.h */ |
1691 | static void __meminit build_zonelist_cache(pg_data_t *pgdat) | |
1692 | { | |
1693 | int i; | |
1694 | ||
1695 | for (i = 0; i < MAX_NR_ZONES; i++) { | |
1696 | struct zonelist *zonelist; | |
1697 | struct zonelist_cache *zlc; | |
1698 | struct zone **z; | |
1699 | ||
1700 | zonelist = pgdat->node_zonelists + i; | |
1701 | zonelist->zlcache_ptr = zlc = &zonelist->zlcache; | |
1702 | bitmap_zero(zlc->fullzones, MAX_ZONES_PER_ZONELIST); | |
1703 | for (z = zonelist->zones; *z; z++) | |
1704 | zlc->z_to_n[z - zonelist->zones] = zone_to_nid(*z); | |
1705 | } | |
1706 | } | |
1707 | ||
1da177e4 LT |
1708 | #else /* CONFIG_NUMA */ |
1709 | ||
86356ab1 | 1710 | static void __meminit build_zonelists(pg_data_t *pgdat) |
1da177e4 | 1711 | { |
19655d34 CL |
1712 | int node, local_node; |
1713 | enum zone_type i,j; | |
1da177e4 LT |
1714 | |
1715 | local_node = pgdat->node_id; | |
19655d34 | 1716 | for (i = 0; i < MAX_NR_ZONES; i++) { |
1da177e4 LT |
1717 | struct zonelist *zonelist; |
1718 | ||
1719 | zonelist = pgdat->node_zonelists + i; | |
1720 | ||
19655d34 | 1721 | j = build_zonelists_node(pgdat, zonelist, 0, i); |
1da177e4 LT |
1722 | /* |
1723 | * Now we build the zonelist so that it contains the zones | |
1724 | * of all the other nodes. | |
1725 | * We don't want to pressure a particular node, so when | |
1726 | * building the zones for node N, we make sure that the | |
1727 | * zones coming right after the local ones are those from | |
1728 | * node N+1 (modulo N) | |
1729 | */ | |
1730 | for (node = local_node + 1; node < MAX_NUMNODES; node++) { | |
1731 | if (!node_online(node)) | |
1732 | continue; | |
19655d34 | 1733 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, i); |
1da177e4 LT |
1734 | } |
1735 | for (node = 0; node < local_node; node++) { | |
1736 | if (!node_online(node)) | |
1737 | continue; | |
19655d34 | 1738 | j = build_zonelists_node(NODE_DATA(node), zonelist, j, i); |
1da177e4 LT |
1739 | } |
1740 | ||
1741 | zonelist->zones[j] = NULL; | |
1742 | } | |
1743 | } | |
1744 | ||
9276b1bc PJ |
1745 | /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */ |
1746 | static void __meminit build_zonelist_cache(pg_data_t *pgdat) | |
1747 | { | |
1748 | int i; | |
1749 | ||
1750 | for (i = 0; i < MAX_NR_ZONES; i++) | |
1751 | pgdat->node_zonelists[i].zlcache_ptr = NULL; | |
1752 | } | |
1753 | ||
1da177e4 LT |
1754 | #endif /* CONFIG_NUMA */ |
1755 | ||
6811378e YG |
1756 | /* return values int ....just for stop_machine_run() */ |
1757 | static int __meminit __build_all_zonelists(void *dummy) | |
1da177e4 | 1758 | { |
6811378e | 1759 | int nid; |
9276b1bc PJ |
1760 | |
1761 | for_each_online_node(nid) { | |
6811378e | 1762 | build_zonelists(NODE_DATA(nid)); |
9276b1bc PJ |
1763 | build_zonelist_cache(NODE_DATA(nid)); |
1764 | } | |
6811378e YG |
1765 | return 0; |
1766 | } | |
1767 | ||
1768 | void __meminit build_all_zonelists(void) | |
1769 | { | |
1770 | if (system_state == SYSTEM_BOOTING) { | |
423b41d7 | 1771 | __build_all_zonelists(NULL); |
6811378e YG |
1772 | cpuset_init_current_mems_allowed(); |
1773 | } else { | |
1774 | /* we have to stop all cpus to guaranntee there is no user | |
1775 | of zonelist */ | |
1776 | stop_machine_run(__build_all_zonelists, NULL, NR_CPUS); | |
1777 | /* cpuset refresh routine should be here */ | |
1778 | } | |
bd1e22b8 AM |
1779 | vm_total_pages = nr_free_pagecache_pages(); |
1780 | printk("Built %i zonelists. Total pages: %ld\n", | |
1781 | num_online_nodes(), vm_total_pages); | |
1da177e4 LT |
1782 | } |
1783 | ||
1784 | /* | |
1785 | * Helper functions to size the waitqueue hash table. | |
1786 | * Essentially these want to choose hash table sizes sufficiently | |
1787 | * large so that collisions trying to wait on pages are rare. | |
1788 | * But in fact, the number of active page waitqueues on typical | |
1789 | * systems is ridiculously low, less than 200. So this is even | |
1790 | * conservative, even though it seems large. | |
1791 | * | |
1792 | * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to | |
1793 | * waitqueues, i.e. the size of the waitq table given the number of pages. | |
1794 | */ | |
1795 | #define PAGES_PER_WAITQUEUE 256 | |
1796 | ||
cca448fe | 1797 | #ifndef CONFIG_MEMORY_HOTPLUG |
02b694de | 1798 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) |
1da177e4 LT |
1799 | { |
1800 | unsigned long size = 1; | |
1801 | ||
1802 | pages /= PAGES_PER_WAITQUEUE; | |
1803 | ||
1804 | while (size < pages) | |
1805 | size <<= 1; | |
1806 | ||
1807 | /* | |
1808 | * Once we have dozens or even hundreds of threads sleeping | |
1809 | * on IO we've got bigger problems than wait queue collision. | |
1810 | * Limit the size of the wait table to a reasonable size. | |
1811 | */ | |
1812 | size = min(size, 4096UL); | |
1813 | ||
1814 | return max(size, 4UL); | |
1815 | } | |
cca448fe YG |
1816 | #else |
1817 | /* | |
1818 | * A zone's size might be changed by hot-add, so it is not possible to determine | |
1819 | * a suitable size for its wait_table. So we use the maximum size now. | |
1820 | * | |
1821 | * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie: | |
1822 | * | |
1823 | * i386 (preemption config) : 4096 x 16 = 64Kbyte. | |
1824 | * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte. | |
1825 | * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte. | |
1826 | * | |
1827 | * The maximum entries are prepared when a zone's memory is (512K + 256) pages | |
1828 | * or more by the traditional way. (See above). It equals: | |
1829 | * | |
1830 | * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte. | |
1831 | * ia64(16K page size) : = ( 8G + 4M)byte. | |
1832 | * powerpc (64K page size) : = (32G +16M)byte. | |
1833 | */ | |
1834 | static inline unsigned long wait_table_hash_nr_entries(unsigned long pages) | |
1835 | { | |
1836 | return 4096UL; | |
1837 | } | |
1838 | #endif | |
1da177e4 LT |
1839 | |
1840 | /* | |
1841 | * This is an integer logarithm so that shifts can be used later | |
1842 | * to extract the more random high bits from the multiplicative | |
1843 | * hash function before the remainder is taken. | |
1844 | */ | |
1845 | static inline unsigned long wait_table_bits(unsigned long size) | |
1846 | { | |
1847 | return ffz(~size); | |
1848 | } | |
1849 | ||
1850 | #define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1)) | |
1851 | ||
1da177e4 LT |
1852 | /* |
1853 | * Initially all pages are reserved - free ones are freed | |
1854 | * up by free_all_bootmem() once the early boot process is | |
1855 | * done. Non-atomic initialization, single-pass. | |
1856 | */ | |
c09b4240 | 1857 | void __meminit memmap_init_zone(unsigned long size, int nid, unsigned long zone, |
1da177e4 LT |
1858 | unsigned long start_pfn) |
1859 | { | |
1da177e4 | 1860 | struct page *page; |
29751f69 AW |
1861 | unsigned long end_pfn = start_pfn + size; |
1862 | unsigned long pfn; | |
1da177e4 | 1863 | |
cbe8dd4a | 1864 | for (pfn = start_pfn; pfn < end_pfn; pfn++) { |
d41dee36 AW |
1865 | if (!early_pfn_valid(pfn)) |
1866 | continue; | |
75167957 AW |
1867 | if (!early_pfn_in_nid(pfn, nid)) |
1868 | continue; | |
d41dee36 AW |
1869 | page = pfn_to_page(pfn); |
1870 | set_page_links(page, zone, nid, pfn); | |
7835e98b | 1871 | init_page_count(page); |
1da177e4 LT |
1872 | reset_page_mapcount(page); |
1873 | SetPageReserved(page); | |
1874 | INIT_LIST_HEAD(&page->lru); | |
1875 | #ifdef WANT_PAGE_VIRTUAL | |
1876 | /* The shift won't overflow because ZONE_NORMAL is below 4G. */ | |
1877 | if (!is_highmem_idx(zone)) | |
3212c6be | 1878 | set_page_address(page, __va(pfn << PAGE_SHIFT)); |
1da177e4 | 1879 | #endif |
1da177e4 LT |
1880 | } |
1881 | } | |
1882 | ||
1883 | void zone_init_free_lists(struct pglist_data *pgdat, struct zone *zone, | |
1884 | unsigned long size) | |
1885 | { | |
1886 | int order; | |
1887 | for (order = 0; order < MAX_ORDER ; order++) { | |
1888 | INIT_LIST_HEAD(&zone->free_area[order].free_list); | |
1889 | zone->free_area[order].nr_free = 0; | |
1890 | } | |
1891 | } | |
1892 | ||
1893 | #ifndef __HAVE_ARCH_MEMMAP_INIT | |
1894 | #define memmap_init(size, nid, zone, start_pfn) \ | |
1895 | memmap_init_zone((size), (nid), (zone), (start_pfn)) | |
1896 | #endif | |
1897 | ||
6292d9aa | 1898 | static int __cpuinit zone_batchsize(struct zone *zone) |
e7c8d5c9 CL |
1899 | { |
1900 | int batch; | |
1901 | ||
1902 | /* | |
1903 | * The per-cpu-pages pools are set to around 1000th of the | |
ba56e91c | 1904 | * size of the zone. But no more than 1/2 of a meg. |
e7c8d5c9 CL |
1905 | * |
1906 | * OK, so we don't know how big the cache is. So guess. | |
1907 | */ | |
1908 | batch = zone->present_pages / 1024; | |
ba56e91c SR |
1909 | if (batch * PAGE_SIZE > 512 * 1024) |
1910 | batch = (512 * 1024) / PAGE_SIZE; | |
e7c8d5c9 CL |
1911 | batch /= 4; /* We effectively *= 4 below */ |
1912 | if (batch < 1) | |
1913 | batch = 1; | |
1914 | ||
1915 | /* | |
0ceaacc9 NP |
1916 | * Clamp the batch to a 2^n - 1 value. Having a power |
1917 | * of 2 value was found to be more likely to have | |
1918 | * suboptimal cache aliasing properties in some cases. | |
e7c8d5c9 | 1919 | * |
0ceaacc9 NP |
1920 | * For example if 2 tasks are alternately allocating |
1921 | * batches of pages, one task can end up with a lot | |
1922 | * of pages of one half of the possible page colors | |
1923 | * and the other with pages of the other colors. | |
e7c8d5c9 | 1924 | */ |
0ceaacc9 | 1925 | batch = (1 << (fls(batch + batch/2)-1)) - 1; |
ba56e91c | 1926 | |
e7c8d5c9 CL |
1927 | return batch; |
1928 | } | |
1929 | ||
2caaad41 CL |
1930 | inline void setup_pageset(struct per_cpu_pageset *p, unsigned long batch) |
1931 | { | |
1932 | struct per_cpu_pages *pcp; | |
1933 | ||
1c6fe946 MD |
1934 | memset(p, 0, sizeof(*p)); |
1935 | ||
2caaad41 CL |
1936 | pcp = &p->pcp[0]; /* hot */ |
1937 | pcp->count = 0; | |
2caaad41 CL |
1938 | pcp->high = 6 * batch; |
1939 | pcp->batch = max(1UL, 1 * batch); | |
1940 | INIT_LIST_HEAD(&pcp->list); | |
1941 | ||
1942 | pcp = &p->pcp[1]; /* cold*/ | |
1943 | pcp->count = 0; | |
2caaad41 | 1944 | pcp->high = 2 * batch; |
e46a5e28 | 1945 | pcp->batch = max(1UL, batch/2); |
2caaad41 CL |
1946 | INIT_LIST_HEAD(&pcp->list); |
1947 | } | |
1948 | ||
8ad4b1fb RS |
1949 | /* |
1950 | * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist | |
1951 | * to the value high for the pageset p. | |
1952 | */ | |
1953 | ||
1954 | static void setup_pagelist_highmark(struct per_cpu_pageset *p, | |
1955 | unsigned long high) | |
1956 | { | |
1957 | struct per_cpu_pages *pcp; | |
1958 | ||
1959 | pcp = &p->pcp[0]; /* hot list */ | |
1960 | pcp->high = high; | |
1961 | pcp->batch = max(1UL, high/4); | |
1962 | if ((high/4) > (PAGE_SHIFT * 8)) | |
1963 | pcp->batch = PAGE_SHIFT * 8; | |
1964 | } | |
1965 | ||
1966 | ||
e7c8d5c9 CL |
1967 | #ifdef CONFIG_NUMA |
1968 | /* | |
2caaad41 CL |
1969 | * Boot pageset table. One per cpu which is going to be used for all |
1970 | * zones and all nodes. The parameters will be set in such a way | |
1971 | * that an item put on a list will immediately be handed over to | |
1972 | * the buddy list. This is safe since pageset manipulation is done | |
1973 | * with interrupts disabled. | |
1974 | * | |
1975 | * Some NUMA counter updates may also be caught by the boot pagesets. | |
b7c84c6a CL |
1976 | * |
1977 | * The boot_pagesets must be kept even after bootup is complete for | |
1978 | * unused processors and/or zones. They do play a role for bootstrapping | |
1979 | * hotplugged processors. | |
1980 | * | |
1981 | * zoneinfo_show() and maybe other functions do | |
1982 | * not check if the processor is online before following the pageset pointer. | |
1983 | * Other parts of the kernel may not check if the zone is available. | |
2caaad41 | 1984 | */ |
88a2a4ac | 1985 | static struct per_cpu_pageset boot_pageset[NR_CPUS]; |
2caaad41 CL |
1986 | |
1987 | /* | |
1988 | * Dynamically allocate memory for the | |
e7c8d5c9 CL |
1989 | * per cpu pageset array in struct zone. |
1990 | */ | |
6292d9aa | 1991 | static int __cpuinit process_zones(int cpu) |
e7c8d5c9 CL |
1992 | { |
1993 | struct zone *zone, *dzone; | |
e7c8d5c9 CL |
1994 | |
1995 | for_each_zone(zone) { | |
e7c8d5c9 | 1996 | |
66a55030 CL |
1997 | if (!populated_zone(zone)) |
1998 | continue; | |
1999 | ||
23316bc8 | 2000 | zone_pcp(zone, cpu) = kmalloc_node(sizeof(struct per_cpu_pageset), |
e7c8d5c9 | 2001 | GFP_KERNEL, cpu_to_node(cpu)); |
23316bc8 | 2002 | if (!zone_pcp(zone, cpu)) |
e7c8d5c9 | 2003 | goto bad; |
e7c8d5c9 | 2004 | |
23316bc8 | 2005 | setup_pageset(zone_pcp(zone, cpu), zone_batchsize(zone)); |
8ad4b1fb RS |
2006 | |
2007 | if (percpu_pagelist_fraction) | |
2008 | setup_pagelist_highmark(zone_pcp(zone, cpu), | |
2009 | (zone->present_pages / percpu_pagelist_fraction)); | |
e7c8d5c9 CL |
2010 | } |
2011 | ||
2012 | return 0; | |
2013 | bad: | |
2014 | for_each_zone(dzone) { | |
2015 | if (dzone == zone) | |
2016 | break; | |
23316bc8 NP |
2017 | kfree(zone_pcp(dzone, cpu)); |
2018 | zone_pcp(dzone, cpu) = NULL; | |
e7c8d5c9 CL |
2019 | } |
2020 | return -ENOMEM; | |
2021 | } | |
2022 | ||
2023 | static inline void free_zone_pagesets(int cpu) | |
2024 | { | |
e7c8d5c9 CL |
2025 | struct zone *zone; |
2026 | ||
2027 | for_each_zone(zone) { | |
2028 | struct per_cpu_pageset *pset = zone_pcp(zone, cpu); | |
2029 | ||
f3ef9ead DR |
2030 | /* Free per_cpu_pageset if it is slab allocated */ |
2031 | if (pset != &boot_pageset[cpu]) | |
2032 | kfree(pset); | |
e7c8d5c9 | 2033 | zone_pcp(zone, cpu) = NULL; |
e7c8d5c9 | 2034 | } |
e7c8d5c9 CL |
2035 | } |
2036 | ||
9c7b216d | 2037 | static int __cpuinit pageset_cpuup_callback(struct notifier_block *nfb, |
e7c8d5c9 CL |
2038 | unsigned long action, |
2039 | void *hcpu) | |
2040 | { | |
2041 | int cpu = (long)hcpu; | |
2042 | int ret = NOTIFY_OK; | |
2043 | ||
2044 | switch (action) { | |
2045 | case CPU_UP_PREPARE: | |
2046 | if (process_zones(cpu)) | |
2047 | ret = NOTIFY_BAD; | |
2048 | break; | |
b0d41693 | 2049 | case CPU_UP_CANCELED: |
e7c8d5c9 CL |
2050 | case CPU_DEAD: |
2051 | free_zone_pagesets(cpu); | |
2052 | break; | |
e7c8d5c9 CL |
2053 | default: |
2054 | break; | |
2055 | } | |
2056 | return ret; | |
2057 | } | |
2058 | ||
74b85f37 | 2059 | static struct notifier_block __cpuinitdata pageset_notifier = |
e7c8d5c9 CL |
2060 | { &pageset_cpuup_callback, NULL, 0 }; |
2061 | ||
78d9955b | 2062 | void __init setup_per_cpu_pageset(void) |
e7c8d5c9 CL |
2063 | { |
2064 | int err; | |
2065 | ||
2066 | /* Initialize per_cpu_pageset for cpu 0. | |
2067 | * A cpuup callback will do this for every cpu | |
2068 | * as it comes online | |
2069 | */ | |
2070 | err = process_zones(smp_processor_id()); | |
2071 | BUG_ON(err); | |
2072 | register_cpu_notifier(&pageset_notifier); | |
2073 | } | |
2074 | ||
2075 | #endif | |
2076 | ||
c09b4240 | 2077 | static __meminit |
cca448fe | 2078 | int zone_wait_table_init(struct zone *zone, unsigned long zone_size_pages) |
ed8ece2e DH |
2079 | { |
2080 | int i; | |
2081 | struct pglist_data *pgdat = zone->zone_pgdat; | |
cca448fe | 2082 | size_t alloc_size; |
ed8ece2e DH |
2083 | |
2084 | /* | |
2085 | * The per-page waitqueue mechanism uses hashed waitqueues | |
2086 | * per zone. | |
2087 | */ | |
02b694de YG |
2088 | zone->wait_table_hash_nr_entries = |
2089 | wait_table_hash_nr_entries(zone_size_pages); | |
2090 | zone->wait_table_bits = | |
2091 | wait_table_bits(zone->wait_table_hash_nr_entries); | |
cca448fe YG |
2092 | alloc_size = zone->wait_table_hash_nr_entries |
2093 | * sizeof(wait_queue_head_t); | |
2094 | ||
2095 | if (system_state == SYSTEM_BOOTING) { | |
2096 | zone->wait_table = (wait_queue_head_t *) | |
2097 | alloc_bootmem_node(pgdat, alloc_size); | |
2098 | } else { | |
2099 | /* | |
2100 | * This case means that a zone whose size was 0 gets new memory | |
2101 | * via memory hot-add. | |
2102 | * But it may be the case that a new node was hot-added. In | |
2103 | * this case vmalloc() will not be able to use this new node's | |
2104 | * memory - this wait_table must be initialized to use this new | |
2105 | * node itself as well. | |
2106 | * To use this new node's memory, further consideration will be | |
2107 | * necessary. | |
2108 | */ | |
2109 | zone->wait_table = (wait_queue_head_t *)vmalloc(alloc_size); | |
2110 | } | |
2111 | if (!zone->wait_table) | |
2112 | return -ENOMEM; | |
ed8ece2e | 2113 | |
02b694de | 2114 | for(i = 0; i < zone->wait_table_hash_nr_entries; ++i) |
ed8ece2e | 2115 | init_waitqueue_head(zone->wait_table + i); |
cca448fe YG |
2116 | |
2117 | return 0; | |
ed8ece2e DH |
2118 | } |
2119 | ||
c09b4240 | 2120 | static __meminit void zone_pcp_init(struct zone *zone) |
ed8ece2e DH |
2121 | { |
2122 | int cpu; | |
2123 | unsigned long batch = zone_batchsize(zone); | |
2124 | ||
2125 | for (cpu = 0; cpu < NR_CPUS; cpu++) { | |
2126 | #ifdef CONFIG_NUMA | |
2127 | /* Early boot. Slab allocator not functional yet */ | |
23316bc8 | 2128 | zone_pcp(zone, cpu) = &boot_pageset[cpu]; |
ed8ece2e DH |
2129 | setup_pageset(&boot_pageset[cpu],0); |
2130 | #else | |
2131 | setup_pageset(zone_pcp(zone,cpu), batch); | |
2132 | #endif | |
2133 | } | |
f5335c0f AB |
2134 | if (zone->present_pages) |
2135 | printk(KERN_DEBUG " %s zone: %lu pages, LIFO batch:%lu\n", | |
2136 | zone->name, zone->present_pages, batch); | |
ed8ece2e DH |
2137 | } |
2138 | ||
718127cc YG |
2139 | __meminit int init_currently_empty_zone(struct zone *zone, |
2140 | unsigned long zone_start_pfn, | |
2141 | unsigned long size) | |
ed8ece2e DH |
2142 | { |
2143 | struct pglist_data *pgdat = zone->zone_pgdat; | |
cca448fe YG |
2144 | int ret; |
2145 | ret = zone_wait_table_init(zone, size); | |
2146 | if (ret) | |
2147 | return ret; | |
ed8ece2e DH |
2148 | pgdat->nr_zones = zone_idx(zone) + 1; |
2149 | ||
ed8ece2e DH |
2150 | zone->zone_start_pfn = zone_start_pfn; |
2151 | ||
2152 | memmap_init(size, pgdat->node_id, zone_idx(zone), zone_start_pfn); | |
2153 | ||
2154 | zone_init_free_lists(pgdat, zone, zone->spanned_pages); | |
718127cc YG |
2155 | |
2156 | return 0; | |
ed8ece2e DH |
2157 | } |
2158 | ||
c713216d MG |
2159 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
2160 | /* | |
2161 | * Basic iterator support. Return the first range of PFNs for a node | |
2162 | * Note: nid == MAX_NUMNODES returns first region regardless of node | |
2163 | */ | |
2164 | static int __init first_active_region_index_in_nid(int nid) | |
2165 | { | |
2166 | int i; | |
2167 | ||
2168 | for (i = 0; i < nr_nodemap_entries; i++) | |
2169 | if (nid == MAX_NUMNODES || early_node_map[i].nid == nid) | |
2170 | return i; | |
2171 | ||
2172 | return -1; | |
2173 | } | |
2174 | ||
2175 | /* | |
2176 | * Basic iterator support. Return the next active range of PFNs for a node | |
2177 | * Note: nid == MAX_NUMNODES returns next region regardles of node | |
2178 | */ | |
2179 | static int __init next_active_region_index_in_nid(int index, int nid) | |
2180 | { | |
2181 | for (index = index + 1; index < nr_nodemap_entries; index++) | |
2182 | if (nid == MAX_NUMNODES || early_node_map[index].nid == nid) | |
2183 | return index; | |
2184 | ||
2185 | return -1; | |
2186 | } | |
2187 | ||
2188 | #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID | |
2189 | /* | |
2190 | * Required by SPARSEMEM. Given a PFN, return what node the PFN is on. | |
2191 | * Architectures may implement their own version but if add_active_range() | |
2192 | * was used and there are no special requirements, this is a convenient | |
2193 | * alternative | |
2194 | */ | |
2195 | int __init early_pfn_to_nid(unsigned long pfn) | |
2196 | { | |
2197 | int i; | |
2198 | ||
2199 | for (i = 0; i < nr_nodemap_entries; i++) { | |
2200 | unsigned long start_pfn = early_node_map[i].start_pfn; | |
2201 | unsigned long end_pfn = early_node_map[i].end_pfn; | |
2202 | ||
2203 | if (start_pfn <= pfn && pfn < end_pfn) | |
2204 | return early_node_map[i].nid; | |
2205 | } | |
2206 | ||
2207 | return 0; | |
2208 | } | |
2209 | #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */ | |
2210 | ||
2211 | /* Basic iterator support to walk early_node_map[] */ | |
2212 | #define for_each_active_range_index_in_nid(i, nid) \ | |
2213 | for (i = first_active_region_index_in_nid(nid); i != -1; \ | |
2214 | i = next_active_region_index_in_nid(i, nid)) | |
2215 | ||
2216 | /** | |
2217 | * free_bootmem_with_active_regions - Call free_bootmem_node for each active range | |
88ca3b94 RD |
2218 | * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed. |
2219 | * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node | |
c713216d MG |
2220 | * |
2221 | * If an architecture guarantees that all ranges registered with | |
2222 | * add_active_ranges() contain no holes and may be freed, this | |
2223 | * this function may be used instead of calling free_bootmem() manually. | |
2224 | */ | |
2225 | void __init free_bootmem_with_active_regions(int nid, | |
2226 | unsigned long max_low_pfn) | |
2227 | { | |
2228 | int i; | |
2229 | ||
2230 | for_each_active_range_index_in_nid(i, nid) { | |
2231 | unsigned long size_pages = 0; | |
2232 | unsigned long end_pfn = early_node_map[i].end_pfn; | |
2233 | ||
2234 | if (early_node_map[i].start_pfn >= max_low_pfn) | |
2235 | continue; | |
2236 | ||
2237 | if (end_pfn > max_low_pfn) | |
2238 | end_pfn = max_low_pfn; | |
2239 | ||
2240 | size_pages = end_pfn - early_node_map[i].start_pfn; | |
2241 | free_bootmem_node(NODE_DATA(early_node_map[i].nid), | |
2242 | PFN_PHYS(early_node_map[i].start_pfn), | |
2243 | size_pages << PAGE_SHIFT); | |
2244 | } | |
2245 | } | |
2246 | ||
2247 | /** | |
2248 | * sparse_memory_present_with_active_regions - Call memory_present for each active range | |
88ca3b94 | 2249 | * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used. |
c713216d MG |
2250 | * |
2251 | * If an architecture guarantees that all ranges registered with | |
2252 | * add_active_ranges() contain no holes and may be freed, this | |
88ca3b94 | 2253 | * function may be used instead of calling memory_present() manually. |
c713216d MG |
2254 | */ |
2255 | void __init sparse_memory_present_with_active_regions(int nid) | |
2256 | { | |
2257 | int i; | |
2258 | ||
2259 | for_each_active_range_index_in_nid(i, nid) | |
2260 | memory_present(early_node_map[i].nid, | |
2261 | early_node_map[i].start_pfn, | |
2262 | early_node_map[i].end_pfn); | |
2263 | } | |
2264 | ||
fb01439c MG |
2265 | /** |
2266 | * push_node_boundaries - Push node boundaries to at least the requested boundary | |
2267 | * @nid: The nid of the node to push the boundary for | |
2268 | * @start_pfn: The start pfn of the node | |
2269 | * @end_pfn: The end pfn of the node | |
2270 | * | |
2271 | * In reserve-based hot-add, mem_map is allocated that is unused until hotadd | |
2272 | * time. Specifically, on x86_64, SRAT will report ranges that can potentially | |
2273 | * be hotplugged even though no physical memory exists. This function allows | |
2274 | * an arch to push out the node boundaries so mem_map is allocated that can | |
2275 | * be used later. | |
2276 | */ | |
2277 | #ifdef CONFIG_MEMORY_HOTPLUG_RESERVE | |
2278 | void __init push_node_boundaries(unsigned int nid, | |
2279 | unsigned long start_pfn, unsigned long end_pfn) | |
2280 | { | |
2281 | printk(KERN_DEBUG "Entering push_node_boundaries(%u, %lu, %lu)\n", | |
2282 | nid, start_pfn, end_pfn); | |
2283 | ||
2284 | /* Initialise the boundary for this node if necessary */ | |
2285 | if (node_boundary_end_pfn[nid] == 0) | |
2286 | node_boundary_start_pfn[nid] = -1UL; | |
2287 | ||
2288 | /* Update the boundaries */ | |
2289 | if (node_boundary_start_pfn[nid] > start_pfn) | |
2290 | node_boundary_start_pfn[nid] = start_pfn; | |
2291 | if (node_boundary_end_pfn[nid] < end_pfn) | |
2292 | node_boundary_end_pfn[nid] = end_pfn; | |
2293 | } | |
2294 | ||
2295 | /* If necessary, push the node boundary out for reserve hotadd */ | |
2296 | static void __init account_node_boundary(unsigned int nid, | |
2297 | unsigned long *start_pfn, unsigned long *end_pfn) | |
2298 | { | |
2299 | printk(KERN_DEBUG "Entering account_node_boundary(%u, %lu, %lu)\n", | |
2300 | nid, *start_pfn, *end_pfn); | |
2301 | ||
2302 | /* Return if boundary information has not been provided */ | |
2303 | if (node_boundary_end_pfn[nid] == 0) | |
2304 | return; | |
2305 | ||
2306 | /* Check the boundaries and update if necessary */ | |
2307 | if (node_boundary_start_pfn[nid] < *start_pfn) | |
2308 | *start_pfn = node_boundary_start_pfn[nid]; | |
2309 | if (node_boundary_end_pfn[nid] > *end_pfn) | |
2310 | *end_pfn = node_boundary_end_pfn[nid]; | |
2311 | } | |
2312 | #else | |
2313 | void __init push_node_boundaries(unsigned int nid, | |
2314 | unsigned long start_pfn, unsigned long end_pfn) {} | |
2315 | ||
2316 | static void __init account_node_boundary(unsigned int nid, | |
2317 | unsigned long *start_pfn, unsigned long *end_pfn) {} | |
2318 | #endif | |
2319 | ||
2320 | ||
c713216d MG |
2321 | /** |
2322 | * get_pfn_range_for_nid - Return the start and end page frames for a node | |
88ca3b94 RD |
2323 | * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned. |
2324 | * @start_pfn: Passed by reference. On return, it will have the node start_pfn. | |
2325 | * @end_pfn: Passed by reference. On return, it will have the node end_pfn. | |
c713216d MG |
2326 | * |
2327 | * It returns the start and end page frame of a node based on information | |
2328 | * provided by an arch calling add_active_range(). If called for a node | |
2329 | * with no available memory, a warning is printed and the start and end | |
88ca3b94 | 2330 | * PFNs will be 0. |
c713216d MG |
2331 | */ |
2332 | void __init get_pfn_range_for_nid(unsigned int nid, | |
2333 | unsigned long *start_pfn, unsigned long *end_pfn) | |
2334 | { | |
2335 | int i; | |
2336 | *start_pfn = -1UL; | |
2337 | *end_pfn = 0; | |
2338 | ||
2339 | for_each_active_range_index_in_nid(i, nid) { | |
2340 | *start_pfn = min(*start_pfn, early_node_map[i].start_pfn); | |
2341 | *end_pfn = max(*end_pfn, early_node_map[i].end_pfn); | |
2342 | } | |
2343 | ||
2344 | if (*start_pfn == -1UL) { | |
2345 | printk(KERN_WARNING "Node %u active with no memory\n", nid); | |
2346 | *start_pfn = 0; | |
2347 | } | |
fb01439c MG |
2348 | |
2349 | /* Push the node boundaries out if requested */ | |
2350 | account_node_boundary(nid, start_pfn, end_pfn); | |
c713216d MG |
2351 | } |
2352 | ||
2353 | /* | |
2354 | * Return the number of pages a zone spans in a node, including holes | |
2355 | * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node() | |
2356 | */ | |
2357 | unsigned long __init zone_spanned_pages_in_node(int nid, | |
2358 | unsigned long zone_type, | |
2359 | unsigned long *ignored) | |
2360 | { | |
2361 | unsigned long node_start_pfn, node_end_pfn; | |
2362 | unsigned long zone_start_pfn, zone_end_pfn; | |
2363 | ||
2364 | /* Get the start and end of the node and zone */ | |
2365 | get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn); | |
2366 | zone_start_pfn = arch_zone_lowest_possible_pfn[zone_type]; | |
2367 | zone_end_pfn = arch_zone_highest_possible_pfn[zone_type]; | |
2368 | ||
2369 | /* Check that this node has pages within the zone's required range */ | |
2370 | if (zone_end_pfn < node_start_pfn || zone_start_pfn > node_end_pfn) | |
2371 | return 0; | |
2372 | ||
2373 | /* Move the zone boundaries inside the node if necessary */ | |
2374 | zone_end_pfn = min(zone_end_pfn, node_end_pfn); | |
2375 | zone_start_pfn = max(zone_start_pfn, node_start_pfn); | |
2376 | ||
2377 | /* Return the spanned pages */ | |
2378 | return zone_end_pfn - zone_start_pfn; | |
2379 | } | |
2380 | ||
2381 | /* | |
2382 | * Return the number of holes in a range on a node. If nid is MAX_NUMNODES, | |
88ca3b94 | 2383 | * then all holes in the requested range will be accounted for. |
c713216d MG |
2384 | */ |
2385 | unsigned long __init __absent_pages_in_range(int nid, | |
2386 | unsigned long range_start_pfn, | |
2387 | unsigned long range_end_pfn) | |
2388 | { | |
2389 | int i = 0; | |
2390 | unsigned long prev_end_pfn = 0, hole_pages = 0; | |
2391 | unsigned long start_pfn; | |
2392 | ||
2393 | /* Find the end_pfn of the first active range of pfns in the node */ | |
2394 | i = first_active_region_index_in_nid(nid); | |
2395 | if (i == -1) | |
2396 | return 0; | |
2397 | ||
9c7cd687 MG |
2398 | /* Account for ranges before physical memory on this node */ |
2399 | if (early_node_map[i].start_pfn > range_start_pfn) | |
2400 | hole_pages = early_node_map[i].start_pfn - range_start_pfn; | |
2401 | ||
c713216d MG |
2402 | prev_end_pfn = early_node_map[i].start_pfn; |
2403 | ||
2404 | /* Find all holes for the zone within the node */ | |
2405 | for (; i != -1; i = next_active_region_index_in_nid(i, nid)) { | |
2406 | ||
2407 | /* No need to continue if prev_end_pfn is outside the zone */ | |
2408 | if (prev_end_pfn >= range_end_pfn) | |
2409 | break; | |
2410 | ||
2411 | /* Make sure the end of the zone is not within the hole */ | |
2412 | start_pfn = min(early_node_map[i].start_pfn, range_end_pfn); | |
2413 | prev_end_pfn = max(prev_end_pfn, range_start_pfn); | |
2414 | ||
2415 | /* Update the hole size cound and move on */ | |
2416 | if (start_pfn > range_start_pfn) { | |
2417 | BUG_ON(prev_end_pfn > start_pfn); | |
2418 | hole_pages += start_pfn - prev_end_pfn; | |
2419 | } | |
2420 | prev_end_pfn = early_node_map[i].end_pfn; | |
2421 | } | |
2422 | ||
9c7cd687 MG |
2423 | /* Account for ranges past physical memory on this node */ |
2424 | if (range_end_pfn > prev_end_pfn) | |
0c6cb974 | 2425 | hole_pages += range_end_pfn - |
9c7cd687 MG |
2426 | max(range_start_pfn, prev_end_pfn); |
2427 | ||
c713216d MG |
2428 | return hole_pages; |
2429 | } | |
2430 | ||
2431 | /** | |
2432 | * absent_pages_in_range - Return number of page frames in holes within a range | |
2433 | * @start_pfn: The start PFN to start searching for holes | |
2434 | * @end_pfn: The end PFN to stop searching for holes | |
2435 | * | |
88ca3b94 | 2436 | * It returns the number of pages frames in memory holes within a range. |
c713216d MG |
2437 | */ |
2438 | unsigned long __init absent_pages_in_range(unsigned long start_pfn, | |
2439 | unsigned long end_pfn) | |
2440 | { | |
2441 | return __absent_pages_in_range(MAX_NUMNODES, start_pfn, end_pfn); | |
2442 | } | |
2443 | ||
2444 | /* Return the number of page frames in holes in a zone on a node */ | |
2445 | unsigned long __init zone_absent_pages_in_node(int nid, | |
2446 | unsigned long zone_type, | |
2447 | unsigned long *ignored) | |
2448 | { | |
9c7cd687 MG |
2449 | unsigned long node_start_pfn, node_end_pfn; |
2450 | unsigned long zone_start_pfn, zone_end_pfn; | |
2451 | ||
2452 | get_pfn_range_for_nid(nid, &node_start_pfn, &node_end_pfn); | |
2453 | zone_start_pfn = max(arch_zone_lowest_possible_pfn[zone_type], | |
2454 | node_start_pfn); | |
2455 | zone_end_pfn = min(arch_zone_highest_possible_pfn[zone_type], | |
2456 | node_end_pfn); | |
2457 | ||
2458 | return __absent_pages_in_range(nid, zone_start_pfn, zone_end_pfn); | |
c713216d | 2459 | } |
0e0b864e | 2460 | |
c713216d MG |
2461 | #else |
2462 | static inline unsigned long zone_spanned_pages_in_node(int nid, | |
2463 | unsigned long zone_type, | |
2464 | unsigned long *zones_size) | |
2465 | { | |
2466 | return zones_size[zone_type]; | |
2467 | } | |
2468 | ||
2469 | static inline unsigned long zone_absent_pages_in_node(int nid, | |
2470 | unsigned long zone_type, | |
2471 | unsigned long *zholes_size) | |
2472 | { | |
2473 | if (!zholes_size) | |
2474 | return 0; | |
2475 | ||
2476 | return zholes_size[zone_type]; | |
2477 | } | |
0e0b864e | 2478 | |
c713216d MG |
2479 | #endif |
2480 | ||
2481 | static void __init calculate_node_totalpages(struct pglist_data *pgdat, | |
2482 | unsigned long *zones_size, unsigned long *zholes_size) | |
2483 | { | |
2484 | unsigned long realtotalpages, totalpages = 0; | |
2485 | enum zone_type i; | |
2486 | ||
2487 | for (i = 0; i < MAX_NR_ZONES; i++) | |
2488 | totalpages += zone_spanned_pages_in_node(pgdat->node_id, i, | |
2489 | zones_size); | |
2490 | pgdat->node_spanned_pages = totalpages; | |
2491 | ||
2492 | realtotalpages = totalpages; | |
2493 | for (i = 0; i < MAX_NR_ZONES; i++) | |
2494 | realtotalpages -= | |
2495 | zone_absent_pages_in_node(pgdat->node_id, i, | |
2496 | zholes_size); | |
2497 | pgdat->node_present_pages = realtotalpages; | |
2498 | printk(KERN_DEBUG "On node %d totalpages: %lu\n", pgdat->node_id, | |
2499 | realtotalpages); | |
2500 | } | |
2501 | ||
1da177e4 LT |
2502 | /* |
2503 | * Set up the zone data structures: | |
2504 | * - mark all pages reserved | |
2505 | * - mark all memory queues empty | |
2506 | * - clear the memory bitmaps | |
2507 | */ | |
86356ab1 | 2508 | static void __meminit free_area_init_core(struct pglist_data *pgdat, |
1da177e4 LT |
2509 | unsigned long *zones_size, unsigned long *zholes_size) |
2510 | { | |
2f1b6248 | 2511 | enum zone_type j; |
ed8ece2e | 2512 | int nid = pgdat->node_id; |
1da177e4 | 2513 | unsigned long zone_start_pfn = pgdat->node_start_pfn; |
718127cc | 2514 | int ret; |
1da177e4 | 2515 | |
208d54e5 | 2516 | pgdat_resize_init(pgdat); |
1da177e4 LT |
2517 | pgdat->nr_zones = 0; |
2518 | init_waitqueue_head(&pgdat->kswapd_wait); | |
2519 | pgdat->kswapd_max_order = 0; | |
2520 | ||
2521 | for (j = 0; j < MAX_NR_ZONES; j++) { | |
2522 | struct zone *zone = pgdat->node_zones + j; | |
0e0b864e | 2523 | unsigned long size, realsize, memmap_pages; |
1da177e4 | 2524 | |
c713216d MG |
2525 | size = zone_spanned_pages_in_node(nid, j, zones_size); |
2526 | realsize = size - zone_absent_pages_in_node(nid, j, | |
2527 | zholes_size); | |
1da177e4 | 2528 | |
0e0b864e MG |
2529 | /* |
2530 | * Adjust realsize so that it accounts for how much memory | |
2531 | * is used by this zone for memmap. This affects the watermark | |
2532 | * and per-cpu initialisations | |
2533 | */ | |
2534 | memmap_pages = (size * sizeof(struct page)) >> PAGE_SHIFT; | |
2535 | if (realsize >= memmap_pages) { | |
2536 | realsize -= memmap_pages; | |
2537 | printk(KERN_DEBUG | |
2538 | " %s zone: %lu pages used for memmap\n", | |
2539 | zone_names[j], memmap_pages); | |
2540 | } else | |
2541 | printk(KERN_WARNING | |
2542 | " %s zone: %lu pages exceeds realsize %lu\n", | |
2543 | zone_names[j], memmap_pages, realsize); | |
2544 | ||
2545 | /* Account for reserved DMA pages */ | |
2546 | if (j == ZONE_DMA && realsize > dma_reserve) { | |
2547 | realsize -= dma_reserve; | |
2548 | printk(KERN_DEBUG " DMA zone: %lu pages reserved\n", | |
2549 | dma_reserve); | |
2550 | } | |
2551 | ||
98d2b0eb | 2552 | if (!is_highmem_idx(j)) |
1da177e4 LT |
2553 | nr_kernel_pages += realsize; |
2554 | nr_all_pages += realsize; | |
2555 | ||
2556 | zone->spanned_pages = size; | |
2557 | zone->present_pages = realsize; | |
9614634f | 2558 | #ifdef CONFIG_NUMA |
d5f541ed | 2559 | zone->node = nid; |
8417bba4 | 2560 | zone->min_unmapped_pages = (realsize*sysctl_min_unmapped_ratio) |
9614634f | 2561 | / 100; |
0ff38490 | 2562 | zone->min_slab_pages = (realsize * sysctl_min_slab_ratio) / 100; |
9614634f | 2563 | #endif |
1da177e4 LT |
2564 | zone->name = zone_names[j]; |
2565 | spin_lock_init(&zone->lock); | |
2566 | spin_lock_init(&zone->lru_lock); | |
bdc8cb98 | 2567 | zone_seqlock_init(zone); |
1da177e4 LT |
2568 | zone->zone_pgdat = pgdat; |
2569 | zone->free_pages = 0; | |
2570 | ||
3bb1a852 | 2571 | zone->prev_priority = DEF_PRIORITY; |
1da177e4 | 2572 | |
ed8ece2e | 2573 | zone_pcp_init(zone); |
1da177e4 LT |
2574 | INIT_LIST_HEAD(&zone->active_list); |
2575 | INIT_LIST_HEAD(&zone->inactive_list); | |
2576 | zone->nr_scan_active = 0; | |
2577 | zone->nr_scan_inactive = 0; | |
2578 | zone->nr_active = 0; | |
2579 | zone->nr_inactive = 0; | |
2244b95a | 2580 | zap_zone_vm_stats(zone); |
53e9a615 | 2581 | atomic_set(&zone->reclaim_in_progress, 0); |
1da177e4 LT |
2582 | if (!size) |
2583 | continue; | |
2584 | ||
718127cc YG |
2585 | ret = init_currently_empty_zone(zone, zone_start_pfn, size); |
2586 | BUG_ON(ret); | |
1da177e4 | 2587 | zone_start_pfn += size; |
1da177e4 LT |
2588 | } |
2589 | } | |
2590 | ||
2591 | static void __init alloc_node_mem_map(struct pglist_data *pgdat) | |
2592 | { | |
1da177e4 LT |
2593 | /* Skip empty nodes */ |
2594 | if (!pgdat->node_spanned_pages) | |
2595 | return; | |
2596 | ||
d41dee36 | 2597 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
1da177e4 LT |
2598 | /* ia64 gets its own node_mem_map, before this, without bootmem */ |
2599 | if (!pgdat->node_mem_map) { | |
e984bb43 | 2600 | unsigned long size, start, end; |
d41dee36 AW |
2601 | struct page *map; |
2602 | ||
e984bb43 BP |
2603 | /* |
2604 | * The zone's endpoints aren't required to be MAX_ORDER | |
2605 | * aligned but the node_mem_map endpoints must be in order | |
2606 | * for the buddy allocator to function correctly. | |
2607 | */ | |
2608 | start = pgdat->node_start_pfn & ~(MAX_ORDER_NR_PAGES - 1); | |
2609 | end = pgdat->node_start_pfn + pgdat->node_spanned_pages; | |
2610 | end = ALIGN(end, MAX_ORDER_NR_PAGES); | |
2611 | size = (end - start) * sizeof(struct page); | |
6f167ec7 DH |
2612 | map = alloc_remap(pgdat->node_id, size); |
2613 | if (!map) | |
2614 | map = alloc_bootmem_node(pgdat, size); | |
e984bb43 | 2615 | pgdat->node_mem_map = map + (pgdat->node_start_pfn - start); |
1da177e4 | 2616 | } |
d41dee36 | 2617 | #ifdef CONFIG_FLATMEM |
1da177e4 LT |
2618 | /* |
2619 | * With no DISCONTIG, the global mem_map is just set as node 0's | |
2620 | */ | |
c713216d | 2621 | if (pgdat == NODE_DATA(0)) { |
1da177e4 | 2622 | mem_map = NODE_DATA(0)->node_mem_map; |
c713216d MG |
2623 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
2624 | if (page_to_pfn(mem_map) != pgdat->node_start_pfn) | |
2625 | mem_map -= pgdat->node_start_pfn; | |
2626 | #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */ | |
2627 | } | |
1da177e4 | 2628 | #endif |
d41dee36 | 2629 | #endif /* CONFIG_FLAT_NODE_MEM_MAP */ |
1da177e4 LT |
2630 | } |
2631 | ||
86356ab1 | 2632 | void __meminit free_area_init_node(int nid, struct pglist_data *pgdat, |
1da177e4 LT |
2633 | unsigned long *zones_size, unsigned long node_start_pfn, |
2634 | unsigned long *zholes_size) | |
2635 | { | |
2636 | pgdat->node_id = nid; | |
2637 | pgdat->node_start_pfn = node_start_pfn; | |
c713216d | 2638 | calculate_node_totalpages(pgdat, zones_size, zholes_size); |
1da177e4 LT |
2639 | |
2640 | alloc_node_mem_map(pgdat); | |
2641 | ||
2642 | free_area_init_core(pgdat, zones_size, zholes_size); | |
2643 | } | |
2644 | ||
c713216d MG |
2645 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
2646 | /** | |
2647 | * add_active_range - Register a range of PFNs backed by physical memory | |
2648 | * @nid: The node ID the range resides on | |
2649 | * @start_pfn: The start PFN of the available physical memory | |
2650 | * @end_pfn: The end PFN of the available physical memory | |
2651 | * | |
2652 | * These ranges are stored in an early_node_map[] and later used by | |
2653 | * free_area_init_nodes() to calculate zone sizes and holes. If the | |
2654 | * range spans a memory hole, it is up to the architecture to ensure | |
2655 | * the memory is not freed by the bootmem allocator. If possible | |
2656 | * the range being registered will be merged with existing ranges. | |
2657 | */ | |
2658 | void __init add_active_range(unsigned int nid, unsigned long start_pfn, | |
2659 | unsigned long end_pfn) | |
2660 | { | |
2661 | int i; | |
2662 | ||
2663 | printk(KERN_DEBUG "Entering add_active_range(%d, %lu, %lu) " | |
2664 | "%d entries of %d used\n", | |
2665 | nid, start_pfn, end_pfn, | |
2666 | nr_nodemap_entries, MAX_ACTIVE_REGIONS); | |
2667 | ||
2668 | /* Merge with existing active regions if possible */ | |
2669 | for (i = 0; i < nr_nodemap_entries; i++) { | |
2670 | if (early_node_map[i].nid != nid) | |
2671 | continue; | |
2672 | ||
2673 | /* Skip if an existing region covers this new one */ | |
2674 | if (start_pfn >= early_node_map[i].start_pfn && | |
2675 | end_pfn <= early_node_map[i].end_pfn) | |
2676 | return; | |
2677 | ||
2678 | /* Merge forward if suitable */ | |
2679 | if (start_pfn <= early_node_map[i].end_pfn && | |
2680 | end_pfn > early_node_map[i].end_pfn) { | |
2681 | early_node_map[i].end_pfn = end_pfn; | |
2682 | return; | |
2683 | } | |
2684 | ||
2685 | /* Merge backward if suitable */ | |
2686 | if (start_pfn < early_node_map[i].end_pfn && | |
2687 | end_pfn >= early_node_map[i].start_pfn) { | |
2688 | early_node_map[i].start_pfn = start_pfn; | |
2689 | return; | |
2690 | } | |
2691 | } | |
2692 | ||
2693 | /* Check that early_node_map is large enough */ | |
2694 | if (i >= MAX_ACTIVE_REGIONS) { | |
2695 | printk(KERN_CRIT "More than %d memory regions, truncating\n", | |
2696 | MAX_ACTIVE_REGIONS); | |
2697 | return; | |
2698 | } | |
2699 | ||
2700 | early_node_map[i].nid = nid; | |
2701 | early_node_map[i].start_pfn = start_pfn; | |
2702 | early_node_map[i].end_pfn = end_pfn; | |
2703 | nr_nodemap_entries = i + 1; | |
2704 | } | |
2705 | ||
2706 | /** | |
2707 | * shrink_active_range - Shrink an existing registered range of PFNs | |
2708 | * @nid: The node id the range is on that should be shrunk | |
2709 | * @old_end_pfn: The old end PFN of the range | |
2710 | * @new_end_pfn: The new PFN of the range | |
2711 | * | |
2712 | * i386 with NUMA use alloc_remap() to store a node_mem_map on a local node. | |
2713 | * The map is kept at the end physical page range that has already been | |
2714 | * registered with add_active_range(). This function allows an arch to shrink | |
2715 | * an existing registered range. | |
2716 | */ | |
2717 | void __init shrink_active_range(unsigned int nid, unsigned long old_end_pfn, | |
2718 | unsigned long new_end_pfn) | |
2719 | { | |
2720 | int i; | |
2721 | ||
2722 | /* Find the old active region end and shrink */ | |
2723 | for_each_active_range_index_in_nid(i, nid) | |
2724 | if (early_node_map[i].end_pfn == old_end_pfn) { | |
2725 | early_node_map[i].end_pfn = new_end_pfn; | |
2726 | break; | |
2727 | } | |
2728 | } | |
2729 | ||
2730 | /** | |
2731 | * remove_all_active_ranges - Remove all currently registered regions | |
88ca3b94 | 2732 | * |
c713216d MG |
2733 | * During discovery, it may be found that a table like SRAT is invalid |
2734 | * and an alternative discovery method must be used. This function removes | |
2735 | * all currently registered regions. | |
2736 | */ | |
88ca3b94 | 2737 | void __init remove_all_active_ranges(void) |
c713216d MG |
2738 | { |
2739 | memset(early_node_map, 0, sizeof(early_node_map)); | |
2740 | nr_nodemap_entries = 0; | |
fb01439c MG |
2741 | #ifdef CONFIG_MEMORY_HOTPLUG_RESERVE |
2742 | memset(node_boundary_start_pfn, 0, sizeof(node_boundary_start_pfn)); | |
2743 | memset(node_boundary_end_pfn, 0, sizeof(node_boundary_end_pfn)); | |
2744 | #endif /* CONFIG_MEMORY_HOTPLUG_RESERVE */ | |
c713216d MG |
2745 | } |
2746 | ||
2747 | /* Compare two active node_active_regions */ | |
2748 | static int __init cmp_node_active_region(const void *a, const void *b) | |
2749 | { | |
2750 | struct node_active_region *arange = (struct node_active_region *)a; | |
2751 | struct node_active_region *brange = (struct node_active_region *)b; | |
2752 | ||
2753 | /* Done this way to avoid overflows */ | |
2754 | if (arange->start_pfn > brange->start_pfn) | |
2755 | return 1; | |
2756 | if (arange->start_pfn < brange->start_pfn) | |
2757 | return -1; | |
2758 | ||
2759 | return 0; | |
2760 | } | |
2761 | ||
2762 | /* sort the node_map by start_pfn */ | |
2763 | static void __init sort_node_map(void) | |
2764 | { | |
2765 | sort(early_node_map, (size_t)nr_nodemap_entries, | |
2766 | sizeof(struct node_active_region), | |
2767 | cmp_node_active_region, NULL); | |
2768 | } | |
2769 | ||
2770 | /* Find the lowest pfn for a node. This depends on a sorted early_node_map */ | |
2771 | unsigned long __init find_min_pfn_for_node(unsigned long nid) | |
2772 | { | |
2773 | int i; | |
2774 | ||
1abbfb41 MG |
2775 | /* Regions in the early_node_map can be in any order */ |
2776 | sort_node_map(); | |
2777 | ||
c713216d MG |
2778 | /* Assuming a sorted map, the first range found has the starting pfn */ |
2779 | for_each_active_range_index_in_nid(i, nid) | |
2780 | return early_node_map[i].start_pfn; | |
2781 | ||
2782 | printk(KERN_WARNING "Could not find start_pfn for node %lu\n", nid); | |
2783 | return 0; | |
2784 | } | |
2785 | ||
2786 | /** | |
2787 | * find_min_pfn_with_active_regions - Find the minimum PFN registered | |
2788 | * | |
2789 | * It returns the minimum PFN based on information provided via | |
88ca3b94 | 2790 | * add_active_range(). |
c713216d MG |
2791 | */ |
2792 | unsigned long __init find_min_pfn_with_active_regions(void) | |
2793 | { | |
2794 | return find_min_pfn_for_node(MAX_NUMNODES); | |
2795 | } | |
2796 | ||
2797 | /** | |
2798 | * find_max_pfn_with_active_regions - Find the maximum PFN registered | |
2799 | * | |
2800 | * It returns the maximum PFN based on information provided via | |
88ca3b94 | 2801 | * add_active_range(). |
c713216d MG |
2802 | */ |
2803 | unsigned long __init find_max_pfn_with_active_regions(void) | |
2804 | { | |
2805 | int i; | |
2806 | unsigned long max_pfn = 0; | |
2807 | ||
2808 | for (i = 0; i < nr_nodemap_entries; i++) | |
2809 | max_pfn = max(max_pfn, early_node_map[i].end_pfn); | |
2810 | ||
2811 | return max_pfn; | |
2812 | } | |
2813 | ||
2814 | /** | |
2815 | * free_area_init_nodes - Initialise all pg_data_t and zone data | |
88ca3b94 | 2816 | * @max_zone_pfn: an array of max PFNs for each zone |
c713216d MG |
2817 | * |
2818 | * This will call free_area_init_node() for each active node in the system. | |
2819 | * Using the page ranges provided by add_active_range(), the size of each | |
2820 | * zone in each node and their holes is calculated. If the maximum PFN | |
2821 | * between two adjacent zones match, it is assumed that the zone is empty. | |
2822 | * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed | |
2823 | * that arch_max_dma32_pfn has no pages. It is also assumed that a zone | |
2824 | * starts where the previous one ended. For example, ZONE_DMA32 starts | |
2825 | * at arch_max_dma_pfn. | |
2826 | */ | |
2827 | void __init free_area_init_nodes(unsigned long *max_zone_pfn) | |
2828 | { | |
2829 | unsigned long nid; | |
2830 | enum zone_type i; | |
2831 | ||
2832 | /* Record where the zone boundaries are */ | |
2833 | memset(arch_zone_lowest_possible_pfn, 0, | |
2834 | sizeof(arch_zone_lowest_possible_pfn)); | |
2835 | memset(arch_zone_highest_possible_pfn, 0, | |
2836 | sizeof(arch_zone_highest_possible_pfn)); | |
2837 | arch_zone_lowest_possible_pfn[0] = find_min_pfn_with_active_regions(); | |
2838 | arch_zone_highest_possible_pfn[0] = max_zone_pfn[0]; | |
2839 | for (i = 1; i < MAX_NR_ZONES; i++) { | |
2840 | arch_zone_lowest_possible_pfn[i] = | |
2841 | arch_zone_highest_possible_pfn[i-1]; | |
2842 | arch_zone_highest_possible_pfn[i] = | |
2843 | max(max_zone_pfn[i], arch_zone_lowest_possible_pfn[i]); | |
2844 | } | |
2845 | ||
c713216d MG |
2846 | /* Print out the zone ranges */ |
2847 | printk("Zone PFN ranges:\n"); | |
2848 | for (i = 0; i < MAX_NR_ZONES; i++) | |
2849 | printk(" %-8s %8lu -> %8lu\n", | |
2850 | zone_names[i], | |
2851 | arch_zone_lowest_possible_pfn[i], | |
2852 | arch_zone_highest_possible_pfn[i]); | |
2853 | ||
2854 | /* Print out the early_node_map[] */ | |
2855 | printk("early_node_map[%d] active PFN ranges\n", nr_nodemap_entries); | |
2856 | for (i = 0; i < nr_nodemap_entries; i++) | |
2857 | printk(" %3d: %8lu -> %8lu\n", early_node_map[i].nid, | |
2858 | early_node_map[i].start_pfn, | |
2859 | early_node_map[i].end_pfn); | |
2860 | ||
2861 | /* Initialise every node */ | |
2862 | for_each_online_node(nid) { | |
2863 | pg_data_t *pgdat = NODE_DATA(nid); | |
2864 | free_area_init_node(nid, pgdat, NULL, | |
2865 | find_min_pfn_for_node(nid), NULL); | |
2866 | } | |
2867 | } | |
2868 | #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */ | |
2869 | ||
0e0b864e | 2870 | /** |
88ca3b94 RD |
2871 | * set_dma_reserve - set the specified number of pages reserved in the first zone |
2872 | * @new_dma_reserve: The number of pages to mark reserved | |
0e0b864e MG |
2873 | * |
2874 | * The per-cpu batchsize and zone watermarks are determined by present_pages. | |
2875 | * In the DMA zone, a significant percentage may be consumed by kernel image | |
2876 | * and other unfreeable allocations which can skew the watermarks badly. This | |
88ca3b94 RD |
2877 | * function may optionally be used to account for unfreeable pages in the |
2878 | * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and | |
2879 | * smaller per-cpu batchsize. | |
0e0b864e MG |
2880 | */ |
2881 | void __init set_dma_reserve(unsigned long new_dma_reserve) | |
2882 | { | |
2883 | dma_reserve = new_dma_reserve; | |
2884 | } | |
2885 | ||
93b7504e | 2886 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
1da177e4 LT |
2887 | static bootmem_data_t contig_bootmem_data; |
2888 | struct pglist_data contig_page_data = { .bdata = &contig_bootmem_data }; | |
2889 | ||
2890 | EXPORT_SYMBOL(contig_page_data); | |
93b7504e | 2891 | #endif |
1da177e4 LT |
2892 | |
2893 | void __init free_area_init(unsigned long *zones_size) | |
2894 | { | |
93b7504e | 2895 | free_area_init_node(0, NODE_DATA(0), zones_size, |
1da177e4 LT |
2896 | __pa(PAGE_OFFSET) >> PAGE_SHIFT, NULL); |
2897 | } | |
1da177e4 | 2898 | |
1da177e4 LT |
2899 | #ifdef CONFIG_HOTPLUG_CPU |
2900 | static int page_alloc_cpu_notify(struct notifier_block *self, | |
2901 | unsigned long action, void *hcpu) | |
2902 | { | |
2903 | int cpu = (unsigned long)hcpu; | |
1da177e4 LT |
2904 | |
2905 | if (action == CPU_DEAD) { | |
1da177e4 LT |
2906 | local_irq_disable(); |
2907 | __drain_pages(cpu); | |
f8891e5e | 2908 | vm_events_fold_cpu(cpu); |
1da177e4 | 2909 | local_irq_enable(); |
2244b95a | 2910 | refresh_cpu_vm_stats(cpu); |
1da177e4 LT |
2911 | } |
2912 | return NOTIFY_OK; | |
2913 | } | |
2914 | #endif /* CONFIG_HOTPLUG_CPU */ | |
2915 | ||
2916 | void __init page_alloc_init(void) | |
2917 | { | |
2918 | hotcpu_notifier(page_alloc_cpu_notify, 0); | |
2919 | } | |
2920 | ||
cb45b0e9 HA |
2921 | /* |
2922 | * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio | |
2923 | * or min_free_kbytes changes. | |
2924 | */ | |
2925 | static void calculate_totalreserve_pages(void) | |
2926 | { | |
2927 | struct pglist_data *pgdat; | |
2928 | unsigned long reserve_pages = 0; | |
2f6726e5 | 2929 | enum zone_type i, j; |
cb45b0e9 HA |
2930 | |
2931 | for_each_online_pgdat(pgdat) { | |
2932 | for (i = 0; i < MAX_NR_ZONES; i++) { | |
2933 | struct zone *zone = pgdat->node_zones + i; | |
2934 | unsigned long max = 0; | |
2935 | ||
2936 | /* Find valid and maximum lowmem_reserve in the zone */ | |
2937 | for (j = i; j < MAX_NR_ZONES; j++) { | |
2938 | if (zone->lowmem_reserve[j] > max) | |
2939 | max = zone->lowmem_reserve[j]; | |
2940 | } | |
2941 | ||
2942 | /* we treat pages_high as reserved pages. */ | |
2943 | max += zone->pages_high; | |
2944 | ||
2945 | if (max > zone->present_pages) | |
2946 | max = zone->present_pages; | |
2947 | reserve_pages += max; | |
2948 | } | |
2949 | } | |
2950 | totalreserve_pages = reserve_pages; | |
2951 | } | |
2952 | ||
1da177e4 LT |
2953 | /* |
2954 | * setup_per_zone_lowmem_reserve - called whenever | |
2955 | * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone | |
2956 | * has a correct pages reserved value, so an adequate number of | |
2957 | * pages are left in the zone after a successful __alloc_pages(). | |
2958 | */ | |
2959 | static void setup_per_zone_lowmem_reserve(void) | |
2960 | { | |
2961 | struct pglist_data *pgdat; | |
2f6726e5 | 2962 | enum zone_type j, idx; |
1da177e4 | 2963 | |
ec936fc5 | 2964 | for_each_online_pgdat(pgdat) { |
1da177e4 LT |
2965 | for (j = 0; j < MAX_NR_ZONES; j++) { |
2966 | struct zone *zone = pgdat->node_zones + j; | |
2967 | unsigned long present_pages = zone->present_pages; | |
2968 | ||
2969 | zone->lowmem_reserve[j] = 0; | |
2970 | ||
2f6726e5 CL |
2971 | idx = j; |
2972 | while (idx) { | |
1da177e4 LT |
2973 | struct zone *lower_zone; |
2974 | ||
2f6726e5 CL |
2975 | idx--; |
2976 | ||
1da177e4 LT |
2977 | if (sysctl_lowmem_reserve_ratio[idx] < 1) |
2978 | sysctl_lowmem_reserve_ratio[idx] = 1; | |
2979 | ||
2980 | lower_zone = pgdat->node_zones + idx; | |
2981 | lower_zone->lowmem_reserve[j] = present_pages / | |
2982 | sysctl_lowmem_reserve_ratio[idx]; | |
2983 | present_pages += lower_zone->present_pages; | |
2984 | } | |
2985 | } | |
2986 | } | |
cb45b0e9 HA |
2987 | |
2988 | /* update totalreserve_pages */ | |
2989 | calculate_totalreserve_pages(); | |
1da177e4 LT |
2990 | } |
2991 | ||
88ca3b94 RD |
2992 | /** |
2993 | * setup_per_zone_pages_min - called when min_free_kbytes changes. | |
2994 | * | |
2995 | * Ensures that the pages_{min,low,high} values for each zone are set correctly | |
2996 | * with respect to min_free_kbytes. | |
1da177e4 | 2997 | */ |
3947be19 | 2998 | void setup_per_zone_pages_min(void) |
1da177e4 LT |
2999 | { |
3000 | unsigned long pages_min = min_free_kbytes >> (PAGE_SHIFT - 10); | |
3001 | unsigned long lowmem_pages = 0; | |
3002 | struct zone *zone; | |
3003 | unsigned long flags; | |
3004 | ||
3005 | /* Calculate total number of !ZONE_HIGHMEM pages */ | |
3006 | for_each_zone(zone) { | |
3007 | if (!is_highmem(zone)) | |
3008 | lowmem_pages += zone->present_pages; | |
3009 | } | |
3010 | ||
3011 | for_each_zone(zone) { | |
ac924c60 AM |
3012 | u64 tmp; |
3013 | ||
1da177e4 | 3014 | spin_lock_irqsave(&zone->lru_lock, flags); |
ac924c60 AM |
3015 | tmp = (u64)pages_min * zone->present_pages; |
3016 | do_div(tmp, lowmem_pages); | |
1da177e4 LT |
3017 | if (is_highmem(zone)) { |
3018 | /* | |
669ed175 NP |
3019 | * __GFP_HIGH and PF_MEMALLOC allocations usually don't |
3020 | * need highmem pages, so cap pages_min to a small | |
3021 | * value here. | |
3022 | * | |
3023 | * The (pages_high-pages_low) and (pages_low-pages_min) | |
3024 | * deltas controls asynch page reclaim, and so should | |
3025 | * not be capped for highmem. | |
1da177e4 LT |
3026 | */ |
3027 | int min_pages; | |
3028 | ||
3029 | min_pages = zone->present_pages / 1024; | |
3030 | if (min_pages < SWAP_CLUSTER_MAX) | |
3031 | min_pages = SWAP_CLUSTER_MAX; | |
3032 | if (min_pages > 128) | |
3033 | min_pages = 128; | |
3034 | zone->pages_min = min_pages; | |
3035 | } else { | |
669ed175 NP |
3036 | /* |
3037 | * If it's a lowmem zone, reserve a number of pages | |
1da177e4 LT |
3038 | * proportionate to the zone's size. |
3039 | */ | |
669ed175 | 3040 | zone->pages_min = tmp; |
1da177e4 LT |
3041 | } |
3042 | ||
ac924c60 AM |
3043 | zone->pages_low = zone->pages_min + (tmp >> 2); |
3044 | zone->pages_high = zone->pages_min + (tmp >> 1); | |
1da177e4 LT |
3045 | spin_unlock_irqrestore(&zone->lru_lock, flags); |
3046 | } | |
cb45b0e9 HA |
3047 | |
3048 | /* update totalreserve_pages */ | |
3049 | calculate_totalreserve_pages(); | |
1da177e4 LT |
3050 | } |
3051 | ||
3052 | /* | |
3053 | * Initialise min_free_kbytes. | |
3054 | * | |
3055 | * For small machines we want it small (128k min). For large machines | |
3056 | * we want it large (64MB max). But it is not linear, because network | |
3057 | * bandwidth does not increase linearly with machine size. We use | |
3058 | * | |
3059 | * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy: | |
3060 | * min_free_kbytes = sqrt(lowmem_kbytes * 16) | |
3061 | * | |
3062 | * which yields | |
3063 | * | |
3064 | * 16MB: 512k | |
3065 | * 32MB: 724k | |
3066 | * 64MB: 1024k | |
3067 | * 128MB: 1448k | |
3068 | * 256MB: 2048k | |
3069 | * 512MB: 2896k | |
3070 | * 1024MB: 4096k | |
3071 | * 2048MB: 5792k | |
3072 | * 4096MB: 8192k | |
3073 | * 8192MB: 11584k | |
3074 | * 16384MB: 16384k | |
3075 | */ | |
3076 | static int __init init_per_zone_pages_min(void) | |
3077 | { | |
3078 | unsigned long lowmem_kbytes; | |
3079 | ||
3080 | lowmem_kbytes = nr_free_buffer_pages() * (PAGE_SIZE >> 10); | |
3081 | ||
3082 | min_free_kbytes = int_sqrt(lowmem_kbytes * 16); | |
3083 | if (min_free_kbytes < 128) | |
3084 | min_free_kbytes = 128; | |
3085 | if (min_free_kbytes > 65536) | |
3086 | min_free_kbytes = 65536; | |
3087 | setup_per_zone_pages_min(); | |
3088 | setup_per_zone_lowmem_reserve(); | |
3089 | return 0; | |
3090 | } | |
3091 | module_init(init_per_zone_pages_min) | |
3092 | ||
3093 | /* | |
3094 | * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so | |
3095 | * that we can call two helper functions whenever min_free_kbytes | |
3096 | * changes. | |
3097 | */ | |
3098 | int min_free_kbytes_sysctl_handler(ctl_table *table, int write, | |
3099 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) | |
3100 | { | |
3101 | proc_dointvec(table, write, file, buffer, length, ppos); | |
3102 | setup_per_zone_pages_min(); | |
3103 | return 0; | |
3104 | } | |
3105 | ||
9614634f CL |
3106 | #ifdef CONFIG_NUMA |
3107 | int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table *table, int write, | |
3108 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) | |
3109 | { | |
3110 | struct zone *zone; | |
3111 | int rc; | |
3112 | ||
3113 | rc = proc_dointvec_minmax(table, write, file, buffer, length, ppos); | |
3114 | if (rc) | |
3115 | return rc; | |
3116 | ||
3117 | for_each_zone(zone) | |
8417bba4 | 3118 | zone->min_unmapped_pages = (zone->present_pages * |
9614634f CL |
3119 | sysctl_min_unmapped_ratio) / 100; |
3120 | return 0; | |
3121 | } | |
0ff38490 CL |
3122 | |
3123 | int sysctl_min_slab_ratio_sysctl_handler(ctl_table *table, int write, | |
3124 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) | |
3125 | { | |
3126 | struct zone *zone; | |
3127 | int rc; | |
3128 | ||
3129 | rc = proc_dointvec_minmax(table, write, file, buffer, length, ppos); | |
3130 | if (rc) | |
3131 | return rc; | |
3132 | ||
3133 | for_each_zone(zone) | |
3134 | zone->min_slab_pages = (zone->present_pages * | |
3135 | sysctl_min_slab_ratio) / 100; | |
3136 | return 0; | |
3137 | } | |
9614634f CL |
3138 | #endif |
3139 | ||
1da177e4 LT |
3140 | /* |
3141 | * lowmem_reserve_ratio_sysctl_handler - just a wrapper around | |
3142 | * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve() | |
3143 | * whenever sysctl_lowmem_reserve_ratio changes. | |
3144 | * | |
3145 | * The reserve ratio obviously has absolutely no relation with the | |
3146 | * pages_min watermarks. The lowmem reserve ratio can only make sense | |
3147 | * if in function of the boot time zone sizes. | |
3148 | */ | |
3149 | int lowmem_reserve_ratio_sysctl_handler(ctl_table *table, int write, | |
3150 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) | |
3151 | { | |
3152 | proc_dointvec_minmax(table, write, file, buffer, length, ppos); | |
3153 | setup_per_zone_lowmem_reserve(); | |
3154 | return 0; | |
3155 | } | |
3156 | ||
8ad4b1fb RS |
3157 | /* |
3158 | * percpu_pagelist_fraction - changes the pcp->high for each zone on each | |
3159 | * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist | |
3160 | * can have before it gets flushed back to buddy allocator. | |
3161 | */ | |
3162 | ||
3163 | int percpu_pagelist_fraction_sysctl_handler(ctl_table *table, int write, | |
3164 | struct file *file, void __user *buffer, size_t *length, loff_t *ppos) | |
3165 | { | |
3166 | struct zone *zone; | |
3167 | unsigned int cpu; | |
3168 | int ret; | |
3169 | ||
3170 | ret = proc_dointvec_minmax(table, write, file, buffer, length, ppos); | |
3171 | if (!write || (ret == -EINVAL)) | |
3172 | return ret; | |
3173 | for_each_zone(zone) { | |
3174 | for_each_online_cpu(cpu) { | |
3175 | unsigned long high; | |
3176 | high = zone->present_pages / percpu_pagelist_fraction; | |
3177 | setup_pagelist_highmark(zone_pcp(zone, cpu), high); | |
3178 | } | |
3179 | } | |
3180 | return 0; | |
3181 | } | |
3182 | ||
f034b5d4 | 3183 | int hashdist = HASHDIST_DEFAULT; |
1da177e4 LT |
3184 | |
3185 | #ifdef CONFIG_NUMA | |
3186 | static int __init set_hashdist(char *str) | |
3187 | { | |
3188 | if (!str) | |
3189 | return 0; | |
3190 | hashdist = simple_strtoul(str, &str, 0); | |
3191 | return 1; | |
3192 | } | |
3193 | __setup("hashdist=", set_hashdist); | |
3194 | #endif | |
3195 | ||
3196 | /* | |
3197 | * allocate a large system hash table from bootmem | |
3198 | * - it is assumed that the hash table must contain an exact power-of-2 | |
3199 | * quantity of entries | |
3200 | * - limit is the number of hash buckets, not the total allocation size | |
3201 | */ | |
3202 | void *__init alloc_large_system_hash(const char *tablename, | |
3203 | unsigned long bucketsize, | |
3204 | unsigned long numentries, | |
3205 | int scale, | |
3206 | int flags, | |
3207 | unsigned int *_hash_shift, | |
3208 | unsigned int *_hash_mask, | |
3209 | unsigned long limit) | |
3210 | { | |
3211 | unsigned long long max = limit; | |
3212 | unsigned long log2qty, size; | |
3213 | void *table = NULL; | |
3214 | ||
3215 | /* allow the kernel cmdline to have a say */ | |
3216 | if (!numentries) { | |
3217 | /* round applicable memory size up to nearest megabyte */ | |
3218 | numentries = (flags & HASH_HIGHMEM) ? nr_all_pages : nr_kernel_pages; | |
3219 | numentries += (1UL << (20 - PAGE_SHIFT)) - 1; | |
3220 | numentries >>= 20 - PAGE_SHIFT; | |
3221 | numentries <<= 20 - PAGE_SHIFT; | |
3222 | ||
3223 | /* limit to 1 bucket per 2^scale bytes of low memory */ | |
3224 | if (scale > PAGE_SHIFT) | |
3225 | numentries >>= (scale - PAGE_SHIFT); | |
3226 | else | |
3227 | numentries <<= (PAGE_SHIFT - scale); | |
3228 | } | |
6e692ed3 | 3229 | numentries = roundup_pow_of_two(numentries); |
1da177e4 LT |
3230 | |
3231 | /* limit allocation size to 1/16 total memory by default */ | |
3232 | if (max == 0) { | |
3233 | max = ((unsigned long long)nr_all_pages << PAGE_SHIFT) >> 4; | |
3234 | do_div(max, bucketsize); | |
3235 | } | |
3236 | ||
3237 | if (numentries > max) | |
3238 | numentries = max; | |
3239 | ||
3240 | log2qty = long_log2(numentries); | |
3241 | ||
3242 | do { | |
3243 | size = bucketsize << log2qty; | |
3244 | if (flags & HASH_EARLY) | |
3245 | table = alloc_bootmem(size); | |
3246 | else if (hashdist) | |
3247 | table = __vmalloc(size, GFP_ATOMIC, PAGE_KERNEL); | |
3248 | else { | |
3249 | unsigned long order; | |
3250 | for (order = 0; ((1UL << order) << PAGE_SHIFT) < size; order++) | |
3251 | ; | |
3252 | table = (void*) __get_free_pages(GFP_ATOMIC, order); | |
3253 | } | |
3254 | } while (!table && size > PAGE_SIZE && --log2qty); | |
3255 | ||
3256 | if (!table) | |
3257 | panic("Failed to allocate %s hash table\n", tablename); | |
3258 | ||
3259 | printk("%s hash table entries: %d (order: %d, %lu bytes)\n", | |
3260 | tablename, | |
3261 | (1U << log2qty), | |
3262 | long_log2(size) - PAGE_SHIFT, | |
3263 | size); | |
3264 | ||
3265 | if (_hash_shift) | |
3266 | *_hash_shift = log2qty; | |
3267 | if (_hash_mask) | |
3268 | *_hash_mask = (1 << log2qty) - 1; | |
3269 | ||
3270 | return table; | |
3271 | } | |
a117e66e KH |
3272 | |
3273 | #ifdef CONFIG_OUT_OF_LINE_PFN_TO_PAGE | |
a117e66e KH |
3274 | struct page *pfn_to_page(unsigned long pfn) |
3275 | { | |
67de6482 | 3276 | return __pfn_to_page(pfn); |
a117e66e KH |
3277 | } |
3278 | unsigned long page_to_pfn(struct page *page) | |
3279 | { | |
67de6482 | 3280 | return __page_to_pfn(page); |
a117e66e | 3281 | } |
a117e66e KH |
3282 | EXPORT_SYMBOL(pfn_to_page); |
3283 | EXPORT_SYMBOL(page_to_pfn); | |
3284 | #endif /* CONFIG_OUT_OF_LINE_PFN_TO_PAGE */ | |
6220ec78 AM |
3285 | |
3286 | #if MAX_NUMNODES > 1 | |
3287 | /* | |
3288 | * Find the highest possible node id. | |
3289 | */ | |
3290 | int highest_possible_node_id(void) | |
3291 | { | |
3292 | unsigned int node; | |
3293 | unsigned int highest = 0; | |
3294 | ||
3295 | for_each_node_mask(node, node_possible_map) | |
3296 | highest = node; | |
3297 | return highest; | |
3298 | } | |
3299 | EXPORT_SYMBOL(highest_possible_node_id); | |
3300 | #endif |