2 * linux/mm/page_alloc.c
4 * Manages the free list, the system allocates free pages here.
5 * Note that kmalloc() lives in slab.c
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)
17 #include <linux/stddef.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>
24 #include <linux/kernel.h>
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>
35 #include <linux/memory_hotplug.h>
36 #include <linux/nodemask.h>
37 #include <linux/vmalloc.h>
38 #include <linux/mempolicy.h>
39 #include <linux/stop_machine.h>
40 #include <linux/sort.h>
41 #include <linux/pfn.h>
42 #include <linux/backing-dev.h>
43 #include <linux/fault-inject.h>
45 #include <asm/tlbflush.h>
46 #include <asm/div64.h>
50 * MCD - HACK: Find somewhere to initialize this EARLY, or make this
53 nodemask_t node_online_map __read_mostly
= { { [0] = 1UL } };
54 EXPORT_SYMBOL(node_online_map
);
55 nodemask_t node_possible_map __read_mostly
= NODE_MASK_ALL
;
56 EXPORT_SYMBOL(node_possible_map
);
57 unsigned long totalram_pages __read_mostly
;
58 unsigned long totalreserve_pages __read_mostly
;
60 int percpu_pagelist_fraction
;
62 static void __free_pages_ok(struct page
*page
, unsigned int order
);
65 * results with 256, 32 in the lowmem_reserve sysctl:
66 * 1G machine -> (16M dma, 800M-16M normal, 1G-800M high)
67 * 1G machine -> (16M dma, 784M normal, 224M high)
68 * NORMAL allocation will leave 784M/256 of ram reserved in the ZONE_DMA
69 * HIGHMEM allocation will leave 224M/32 of ram reserved in ZONE_NORMAL
70 * HIGHMEM allocation will (224M+784M)/256 of ram reserved in ZONE_DMA
72 * TBD: should special case ZONE_DMA32 machines here - in those we normally
73 * don't need any ZONE_NORMAL reservation
75 int sysctl_lowmem_reserve_ratio
[MAX_NR_ZONES
-1] = {
77 #ifdef CONFIG_ZONE_DMA32
85 EXPORT_SYMBOL(totalram_pages
);
87 static char * const zone_names
[MAX_NR_ZONES
] = {
89 #ifdef CONFIG_ZONE_DMA32
98 int min_free_kbytes
= 1024;
100 unsigned long __meminitdata nr_kernel_pages
;
101 unsigned long __meminitdata nr_all_pages
;
102 static unsigned long __initdata dma_reserve
;
104 #ifdef CONFIG_ARCH_POPULATES_NODE_MAP
106 * MAX_ACTIVE_REGIONS determines the maxmimum number of distinct
107 * ranges of memory (RAM) that may be registered with add_active_range().
108 * Ranges passed to add_active_range() will be merged if possible
109 * so the number of times add_active_range() can be called is
110 * related to the number of nodes and the number of holes
112 #ifdef CONFIG_MAX_ACTIVE_REGIONS
113 /* Allow an architecture to set MAX_ACTIVE_REGIONS to save memory */
114 #define MAX_ACTIVE_REGIONS CONFIG_MAX_ACTIVE_REGIONS
116 #if MAX_NUMNODES >= 32
117 /* If there can be many nodes, allow up to 50 holes per node */
118 #define MAX_ACTIVE_REGIONS (MAX_NUMNODES*50)
120 /* By default, allow up to 256 distinct regions */
121 #define MAX_ACTIVE_REGIONS 256
125 struct node_active_region __initdata early_node_map
[MAX_ACTIVE_REGIONS
];
126 int __initdata nr_nodemap_entries
;
127 unsigned long __initdata arch_zone_lowest_possible_pfn
[MAX_NR_ZONES
];
128 unsigned long __initdata arch_zone_highest_possible_pfn
[MAX_NR_ZONES
];
129 #ifdef CONFIG_MEMORY_HOTPLUG_RESERVE
130 unsigned long __initdata node_boundary_start_pfn
[MAX_NUMNODES
];
131 unsigned long __initdata node_boundary_end_pfn
[MAX_NUMNODES
];
132 #endif /* CONFIG_MEMORY_HOTPLUG_RESERVE */
133 #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */
135 #ifdef CONFIG_DEBUG_VM
136 static int page_outside_zone_boundaries(struct zone
*zone
, struct page
*page
)
140 unsigned long pfn
= page_to_pfn(page
);
143 seq
= zone_span_seqbegin(zone
);
144 if (pfn
>= zone
->zone_start_pfn
+ zone
->spanned_pages
)
146 else if (pfn
< zone
->zone_start_pfn
)
148 } while (zone_span_seqretry(zone
, seq
));
153 static int page_is_consistent(struct zone
*zone
, struct page
*page
)
155 #ifdef CONFIG_HOLES_IN_ZONE
156 if (!pfn_valid(page_to_pfn(page
)))
159 if (zone
!= page_zone(page
))
165 * Temporary debugging check for pages not lying within a given zone.
167 static int bad_range(struct zone
*zone
, struct page
*page
)
169 if (page_outside_zone_boundaries(zone
, page
))
171 if (!page_is_consistent(zone
, page
))
177 static inline int bad_range(struct zone
*zone
, struct page
*page
)
183 static void bad_page(struct page
*page
)
185 printk(KERN_EMERG
"Bad page state in process '%s'\n"
186 KERN_EMERG
"page:%p flags:0x%0*lx mapping:%p mapcount:%d count:%d\n"
187 KERN_EMERG
"Trying to fix it up, but a reboot is needed\n"
188 KERN_EMERG
"Backtrace:\n",
189 current
->comm
, page
, (int)(2*sizeof(unsigned long)),
190 (unsigned long)page
->flags
, page
->mapping
,
191 page_mapcount(page
), page_count(page
));
193 page
->flags
&= ~(1 << PG_lru
|
203 set_page_count(page
, 0);
204 reset_page_mapcount(page
);
205 page
->mapping
= NULL
;
206 add_taint(TAINT_BAD_PAGE
);
210 * Higher-order pages are called "compound pages". They are structured thusly:
212 * The first PAGE_SIZE page is called the "head page".
214 * The remaining PAGE_SIZE pages are called "tail pages".
216 * All pages have PG_compound set. All pages have their ->private pointing at
217 * the head page (even the head page has this).
219 * The first tail page's ->lru.next holds the address of the compound page's
220 * put_page() function. Its ->lru.prev holds the order of allocation.
221 * This usage means that zero-order pages may not be compound.
224 static void free_compound_page(struct page
*page
)
226 __free_pages_ok(page
, (unsigned long)page
[1].lru
.prev
);
229 static void prep_compound_page(struct page
*page
, unsigned long order
)
232 int nr_pages
= 1 << order
;
234 set_compound_page_dtor(page
, free_compound_page
);
235 page
[1].lru
.prev
= (void *)order
;
236 for (i
= 0; i
< nr_pages
; i
++) {
237 struct page
*p
= page
+ i
;
239 __SetPageCompound(p
);
240 set_page_private(p
, (unsigned long)page
);
244 static void destroy_compound_page(struct page
*page
, unsigned long order
)
247 int nr_pages
= 1 << order
;
249 if (unlikely((unsigned long)page
[1].lru
.prev
!= order
))
252 for (i
= 0; i
< nr_pages
; i
++) {
253 struct page
*p
= page
+ i
;
255 if (unlikely(!PageCompound(p
) |
256 (page_private(p
) != (unsigned long)page
)))
258 __ClearPageCompound(p
);
262 static inline void prep_zero_page(struct page
*page
, int order
, gfp_t gfp_flags
)
266 VM_BUG_ON((gfp_flags
& (__GFP_WAIT
| __GFP_HIGHMEM
)) == __GFP_HIGHMEM
);
268 * clear_highpage() will use KM_USER0, so it's a bug to use __GFP_ZERO
269 * and __GFP_HIGHMEM from hard or soft interrupt context.
271 VM_BUG_ON((gfp_flags
& __GFP_HIGHMEM
) && in_interrupt());
272 for (i
= 0; i
< (1 << order
); i
++)
273 clear_highpage(page
+ i
);
277 * function for dealing with page's order in buddy system.
278 * zone->lock is already acquired when we use these.
279 * So, we don't need atomic page->flags operations here.
281 static inline unsigned long page_order(struct page
*page
)
283 return page_private(page
);
286 static inline void set_page_order(struct page
*page
, int order
)
288 set_page_private(page
, order
);
289 __SetPageBuddy(page
);
292 static inline void rmv_page_order(struct page
*page
)
294 __ClearPageBuddy(page
);
295 set_page_private(page
, 0);
299 * Locate the struct page for both the matching buddy in our
300 * pair (buddy1) and the combined O(n+1) page they form (page).
302 * 1) Any buddy B1 will have an order O twin B2 which satisfies
303 * the following equation:
305 * For example, if the starting buddy (buddy2) is #8 its order
307 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
309 * 2) Any buddy B will have an order O+1 parent P which
310 * satisfies the following equation:
313 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
315 static inline struct page
*
316 __page_find_buddy(struct page
*page
, unsigned long page_idx
, unsigned int order
)
318 unsigned long buddy_idx
= page_idx
^ (1 << order
);
320 return page
+ (buddy_idx
- page_idx
);
323 static inline unsigned long
324 __find_combined_index(unsigned long page_idx
, unsigned int order
)
326 return (page_idx
& ~(1 << order
));
330 * This function checks whether a page is free && is the buddy
331 * we can do coalesce a page and its buddy if
332 * (a) the buddy is not in a hole &&
333 * (b) the buddy is in the buddy system &&
334 * (c) a page and its buddy have the same order &&
335 * (d) a page and its buddy are in the same zone.
337 * For recording whether a page is in the buddy system, we use PG_buddy.
338 * Setting, clearing, and testing PG_buddy is serialized by zone->lock.
340 * For recording page's order, we use page_private(page).
342 static inline int page_is_buddy(struct page
*page
, struct page
*buddy
,
345 #ifdef CONFIG_HOLES_IN_ZONE
346 if (!pfn_valid(page_to_pfn(buddy
)))
350 if (page_zone_id(page
) != page_zone_id(buddy
))
353 if (PageBuddy(buddy
) && page_order(buddy
) == order
) {
354 BUG_ON(page_count(buddy
) != 0);
361 * Freeing function for a buddy system allocator.
363 * The concept of a buddy system is to maintain direct-mapped table
364 * (containing bit values) for memory blocks of various "orders".
365 * The bottom level table contains the map for the smallest allocatable
366 * units of memory (here, pages), and each level above it describes
367 * pairs of units from the levels below, hence, "buddies".
368 * At a high level, all that happens here is marking the table entry
369 * at the bottom level available, and propagating the changes upward
370 * as necessary, plus some accounting needed to play nicely with other
371 * parts of the VM system.
372 * At each level, we keep a list of pages, which are heads of continuous
373 * free pages of length of (1 << order) and marked with PG_buddy. Page's
374 * order is recorded in page_private(page) field.
375 * So when we are allocating or freeing one, we can derive the state of the
376 * other. That is, if we allocate a small block, and both were
377 * free, the remainder of the region must be split into blocks.
378 * If a block is freed, and its buddy is also free, then this
379 * triggers coalescing into a block of larger size.
384 static inline void __free_one_page(struct page
*page
,
385 struct zone
*zone
, unsigned int order
)
387 unsigned long page_idx
;
388 int order_size
= 1 << order
;
390 if (unlikely(PageCompound(page
)))
391 destroy_compound_page(page
, order
);
393 page_idx
= page_to_pfn(page
) & ((1 << MAX_ORDER
) - 1);
395 VM_BUG_ON(page_idx
& (order_size
- 1));
396 VM_BUG_ON(bad_range(zone
, page
));
398 zone
->free_pages
+= order_size
;
399 while (order
< MAX_ORDER
-1) {
400 unsigned long combined_idx
;
401 struct free_area
*area
;
404 buddy
= __page_find_buddy(page
, page_idx
, order
);
405 if (!page_is_buddy(page
, buddy
, order
))
406 break; /* Move the buddy up one level. */
408 list_del(&buddy
->lru
);
409 area
= zone
->free_area
+ order
;
411 rmv_page_order(buddy
);
412 combined_idx
= __find_combined_index(page_idx
, order
);
413 page
= page
+ (combined_idx
- page_idx
);
414 page_idx
= combined_idx
;
417 set_page_order(page
, order
);
418 list_add(&page
->lru
, &zone
->free_area
[order
].free_list
);
419 zone
->free_area
[order
].nr_free
++;
422 static inline int free_pages_check(struct page
*page
)
424 if (unlikely(page_mapcount(page
) |
425 (page
->mapping
!= NULL
) |
426 (page_count(page
) != 0) |
440 __ClearPageDirty(page
);
442 * For now, we report if PG_reserved was found set, but do not
443 * clear it, and do not free the page. But we shall soon need
444 * to do more, for when the ZERO_PAGE count wraps negative.
446 return PageReserved(page
);
450 * Frees a list of pages.
451 * Assumes all pages on list are in same zone, and of same order.
452 * count is the number of pages to free.
454 * If the zone was previously in an "all pages pinned" state then look to
455 * see if this freeing clears that state.
457 * And clear the zone's pages_scanned counter, to hold off the "all pages are
458 * pinned" detection logic.
460 static void free_pages_bulk(struct zone
*zone
, int count
,
461 struct list_head
*list
, int order
)
463 spin_lock(&zone
->lock
);
464 zone
->all_unreclaimable
= 0;
465 zone
->pages_scanned
= 0;
469 VM_BUG_ON(list_empty(list
));
470 page
= list_entry(list
->prev
, struct page
, lru
);
471 /* have to delete it as __free_one_page list manipulates */
472 list_del(&page
->lru
);
473 __free_one_page(page
, zone
, order
);
475 spin_unlock(&zone
->lock
);
478 static void free_one_page(struct zone
*zone
, struct page
*page
, int order
)
480 spin_lock(&zone
->lock
);
481 zone
->all_unreclaimable
= 0;
482 zone
->pages_scanned
= 0;
483 __free_one_page(page
, zone
, order
);
484 spin_unlock(&zone
->lock
);
487 static void __free_pages_ok(struct page
*page
, unsigned int order
)
493 for (i
= 0 ; i
< (1 << order
) ; ++i
)
494 reserved
+= free_pages_check(page
+ i
);
498 if (!PageHighMem(page
))
499 debug_check_no_locks_freed(page_address(page
),PAGE_SIZE
<<order
);
500 arch_free_page(page
, order
);
501 kernel_map_pages(page
, 1 << order
, 0);
503 local_irq_save(flags
);
504 __count_vm_events(PGFREE
, 1 << order
);
505 free_one_page(page_zone(page
), page
, order
);
506 local_irq_restore(flags
);
510 * permit the bootmem allocator to evade page validation on high-order frees
512 void fastcall __init
__free_pages_bootmem(struct page
*page
, unsigned int order
)
515 __ClearPageReserved(page
);
516 set_page_count(page
, 0);
517 set_page_refcounted(page
);
523 for (loop
= 0; loop
< BITS_PER_LONG
; loop
++) {
524 struct page
*p
= &page
[loop
];
526 if (loop
+ 1 < BITS_PER_LONG
)
528 __ClearPageReserved(p
);
529 set_page_count(p
, 0);
532 set_page_refcounted(page
);
533 __free_pages(page
, order
);
539 * The order of subdivision here is critical for the IO subsystem.
540 * Please do not alter this order without good reasons and regression
541 * testing. Specifically, as large blocks of memory are subdivided,
542 * the order in which smaller blocks are delivered depends on the order
543 * they're subdivided in this function. This is the primary factor
544 * influencing the order in which pages are delivered to the IO
545 * subsystem according to empirical testing, and this is also justified
546 * by considering the behavior of a buddy system containing a single
547 * large block of memory acted on by a series of small allocations.
548 * This behavior is a critical factor in sglist merging's success.
552 static inline void expand(struct zone
*zone
, struct page
*page
,
553 int low
, int high
, struct free_area
*area
)
555 unsigned long size
= 1 << high
;
561 VM_BUG_ON(bad_range(zone
, &page
[size
]));
562 list_add(&page
[size
].lru
, &area
->free_list
);
564 set_page_order(&page
[size
], high
);
569 * This page is about to be returned from the page allocator
571 static int prep_new_page(struct page
*page
, int order
, gfp_t gfp_flags
)
573 if (unlikely(page_mapcount(page
) |
574 (page
->mapping
!= NULL
) |
575 (page_count(page
) != 0) |
591 * For now, we report if PG_reserved was found set, but do not
592 * clear it, and do not allocate the page: as a safety net.
594 if (PageReserved(page
))
597 page
->flags
&= ~(1 << PG_uptodate
| 1 << PG_error
|
598 1 << PG_referenced
| 1 << PG_arch_1
|
599 1 << PG_checked
| 1 << PG_mappedtodisk
);
600 set_page_private(page
, 0);
601 set_page_refcounted(page
);
603 arch_alloc_page(page
, order
);
604 kernel_map_pages(page
, 1 << order
, 1);
606 if (gfp_flags
& __GFP_ZERO
)
607 prep_zero_page(page
, order
, gfp_flags
);
609 if (order
&& (gfp_flags
& __GFP_COMP
))
610 prep_compound_page(page
, order
);
616 * Do the hard work of removing an element from the buddy allocator.
617 * Call me with the zone->lock already held.
619 static struct page
*__rmqueue(struct zone
*zone
, unsigned int order
)
621 struct free_area
* area
;
622 unsigned int current_order
;
625 for (current_order
= order
; current_order
< MAX_ORDER
; ++current_order
) {
626 area
= zone
->free_area
+ current_order
;
627 if (list_empty(&area
->free_list
))
630 page
= list_entry(area
->free_list
.next
, struct page
, lru
);
631 list_del(&page
->lru
);
632 rmv_page_order(page
);
634 zone
->free_pages
-= 1UL << order
;
635 expand(zone
, page
, order
, current_order
, area
);
643 * Obtain a specified number of elements from the buddy allocator, all under
644 * a single hold of the lock, for efficiency. Add them to the supplied list.
645 * Returns the number of new pages which were placed at *list.
647 static int rmqueue_bulk(struct zone
*zone
, unsigned int order
,
648 unsigned long count
, struct list_head
*list
)
652 spin_lock(&zone
->lock
);
653 for (i
= 0; i
< count
; ++i
) {
654 struct page
*page
= __rmqueue(zone
, order
);
655 if (unlikely(page
== NULL
))
657 list_add_tail(&page
->lru
, list
);
659 spin_unlock(&zone
->lock
);
665 * Called from the slab reaper to drain pagesets on a particular node that
666 * belongs to the currently executing processor.
667 * Note that this function must be called with the thread pinned to
668 * a single processor.
670 void drain_node_pages(int nodeid
)
676 for (z
= 0; z
< MAX_NR_ZONES
; z
++) {
677 struct zone
*zone
= NODE_DATA(nodeid
)->node_zones
+ z
;
678 struct per_cpu_pageset
*pset
;
680 if (!populated_zone(zone
))
683 pset
= zone_pcp(zone
, smp_processor_id());
684 for (i
= 0; i
< ARRAY_SIZE(pset
->pcp
); i
++) {
685 struct per_cpu_pages
*pcp
;
691 local_irq_save(flags
);
692 if (pcp
->count
>= pcp
->batch
)
693 to_drain
= pcp
->batch
;
695 to_drain
= pcp
->count
;
696 free_pages_bulk(zone
, to_drain
, &pcp
->list
, 0);
697 pcp
->count
-= to_drain
;
698 local_irq_restore(flags
);
705 static void __drain_pages(unsigned int cpu
)
711 for_each_zone(zone
) {
712 struct per_cpu_pageset
*pset
;
714 pset
= zone_pcp(zone
, cpu
);
715 for (i
= 0; i
< ARRAY_SIZE(pset
->pcp
); i
++) {
716 struct per_cpu_pages
*pcp
;
719 local_irq_save(flags
);
720 free_pages_bulk(zone
, pcp
->count
, &pcp
->list
, 0);
722 local_irq_restore(flags
);
729 void mark_free_pages(struct zone
*zone
)
731 unsigned long pfn
, max_zone_pfn
;
734 struct list_head
*curr
;
736 if (!zone
->spanned_pages
)
739 spin_lock_irqsave(&zone
->lock
, flags
);
741 max_zone_pfn
= zone
->zone_start_pfn
+ zone
->spanned_pages
;
742 for (pfn
= zone
->zone_start_pfn
; pfn
< max_zone_pfn
; pfn
++)
743 if (pfn_valid(pfn
)) {
744 struct page
*page
= pfn_to_page(pfn
);
746 if (!PageNosave(page
))
747 ClearPageNosaveFree(page
);
750 for (order
= MAX_ORDER
- 1; order
>= 0; --order
)
751 list_for_each(curr
, &zone
->free_area
[order
].free_list
) {
754 pfn
= page_to_pfn(list_entry(curr
, struct page
, lru
));
755 for (i
= 0; i
< (1UL << order
); i
++)
756 SetPageNosaveFree(pfn_to_page(pfn
+ i
));
759 spin_unlock_irqrestore(&zone
->lock
, flags
);
763 * Spill all of this CPU's per-cpu pages back into the buddy allocator.
765 void drain_local_pages(void)
769 local_irq_save(flags
);
770 __drain_pages(smp_processor_id());
771 local_irq_restore(flags
);
773 #endif /* CONFIG_PM */
776 * Free a 0-order page
778 static void fastcall
free_hot_cold_page(struct page
*page
, int cold
)
780 struct zone
*zone
= page_zone(page
);
781 struct per_cpu_pages
*pcp
;
785 page
->mapping
= NULL
;
786 if (free_pages_check(page
))
789 if (!PageHighMem(page
))
790 debug_check_no_locks_freed(page_address(page
), PAGE_SIZE
);
791 arch_free_page(page
, 0);
792 kernel_map_pages(page
, 1, 0);
794 pcp
= &zone_pcp(zone
, get_cpu())->pcp
[cold
];
795 local_irq_save(flags
);
796 __count_vm_event(PGFREE
);
797 list_add(&page
->lru
, &pcp
->list
);
799 if (pcp
->count
>= pcp
->high
) {
800 free_pages_bulk(zone
, pcp
->batch
, &pcp
->list
, 0);
801 pcp
->count
-= pcp
->batch
;
803 local_irq_restore(flags
);
807 void fastcall
free_hot_page(struct page
*page
)
809 free_hot_cold_page(page
, 0);
812 void fastcall
free_cold_page(struct page
*page
)
814 free_hot_cold_page(page
, 1);
818 * split_page takes a non-compound higher-order page, and splits it into
819 * n (1<<order) sub-pages: page[0..n]
820 * Each sub-page must be freed individually.
822 * Note: this is probably too low level an operation for use in drivers.
823 * Please consult with lkml before using this in your driver.
825 void split_page(struct page
*page
, unsigned int order
)
829 VM_BUG_ON(PageCompound(page
));
830 VM_BUG_ON(!page_count(page
));
831 for (i
= 1; i
< (1 << order
); i
++)
832 set_page_refcounted(page
+ i
);
836 * Really, prep_compound_page() should be called from __rmqueue_bulk(). But
837 * we cheat by calling it from here, in the order > 0 path. Saves a branch
840 static struct page
*buffered_rmqueue(struct zonelist
*zonelist
,
841 struct zone
*zone
, int order
, gfp_t gfp_flags
)
845 int cold
= !!(gfp_flags
& __GFP_COLD
);
850 if (likely(order
== 0)) {
851 struct per_cpu_pages
*pcp
;
853 pcp
= &zone_pcp(zone
, cpu
)->pcp
[cold
];
854 local_irq_save(flags
);
856 pcp
->count
= rmqueue_bulk(zone
, 0,
857 pcp
->batch
, &pcp
->list
);
858 if (unlikely(!pcp
->count
))
861 page
= list_entry(pcp
->list
.next
, struct page
, lru
);
862 list_del(&page
->lru
);
865 spin_lock_irqsave(&zone
->lock
, flags
);
866 page
= __rmqueue(zone
, order
);
867 spin_unlock(&zone
->lock
);
872 __count_zone_vm_events(PGALLOC
, zone
, 1 << order
);
873 zone_statistics(zonelist
, zone
);
874 local_irq_restore(flags
);
877 VM_BUG_ON(bad_range(zone
, page
));
878 if (prep_new_page(page
, order
, gfp_flags
))
883 local_irq_restore(flags
);
888 #define ALLOC_NO_WATERMARKS 0x01 /* don't check watermarks at all */
889 #define ALLOC_WMARK_MIN 0x02 /* use pages_min watermark */
890 #define ALLOC_WMARK_LOW 0x04 /* use pages_low watermark */
891 #define ALLOC_WMARK_HIGH 0x08 /* use pages_high watermark */
892 #define ALLOC_HARDER 0x10 /* try to alloc harder */
893 #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
894 #define ALLOC_CPUSET 0x40 /* check for correct cpuset */
896 #ifdef CONFIG_FAIL_PAGE_ALLOC
898 static struct fail_page_alloc_attr
{
899 struct fault_attr attr
;
901 u32 ignore_gfp_highmem
;
904 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
906 struct dentry
*ignore_gfp_highmem_file
;
907 struct dentry
*ignore_gfp_wait_file
;
909 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
911 } fail_page_alloc
= {
912 .attr
= FAULT_ATTR_INITIALIZER
,
915 static int __init
setup_fail_page_alloc(char *str
)
917 return setup_fault_attr(&fail_page_alloc
.attr
, str
);
919 __setup("fail_page_alloc=", setup_fail_page_alloc
);
921 static int should_fail_alloc_page(gfp_t gfp_mask
, unsigned int order
)
923 if (gfp_mask
& __GFP_NOFAIL
)
925 if (fail_page_alloc
.ignore_gfp_highmem
&& (gfp_mask
& __GFP_HIGHMEM
))
927 if (fail_page_alloc
.ignore_gfp_wait
&& (gfp_mask
& __GFP_WAIT
))
930 return should_fail(&fail_page_alloc
.attr
, 1 << order
);
933 #ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
935 static int __init
fail_page_alloc_debugfs(void)
937 mode_t mode
= S_IFREG
| S_IRUSR
| S_IWUSR
;
941 err
= init_fault_attr_dentries(&fail_page_alloc
.attr
,
945 dir
= fail_page_alloc
.attr
.dentries
.dir
;
947 fail_page_alloc
.ignore_gfp_wait_file
=
948 debugfs_create_bool("ignore-gfp-wait", mode
, dir
,
949 &fail_page_alloc
.ignore_gfp_wait
);
951 fail_page_alloc
.ignore_gfp_highmem_file
=
952 debugfs_create_bool("ignore-gfp-highmem", mode
, dir
,
953 &fail_page_alloc
.ignore_gfp_highmem
);
955 if (!fail_page_alloc
.ignore_gfp_wait_file
||
956 !fail_page_alloc
.ignore_gfp_highmem_file
) {
958 debugfs_remove(fail_page_alloc
.ignore_gfp_wait_file
);
959 debugfs_remove(fail_page_alloc
.ignore_gfp_highmem_file
);
960 cleanup_fault_attr_dentries(&fail_page_alloc
.attr
);
966 late_initcall(fail_page_alloc_debugfs
);
968 #endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
970 #else /* CONFIG_FAIL_PAGE_ALLOC */
972 static inline int should_fail_alloc_page(gfp_t gfp_mask
, unsigned int order
)
977 #endif /* CONFIG_FAIL_PAGE_ALLOC */
980 * Return 1 if free pages are above 'mark'. This takes into account the order
983 int zone_watermark_ok(struct zone
*z
, int order
, unsigned long mark
,
984 int classzone_idx
, int alloc_flags
)
986 /* free_pages my go negative - that's OK */
987 unsigned long min
= mark
;
988 long free_pages
= z
->free_pages
- (1 << order
) + 1;
991 if (alloc_flags
& ALLOC_HIGH
)
993 if (alloc_flags
& ALLOC_HARDER
)
996 if (free_pages
<= min
+ z
->lowmem_reserve
[classzone_idx
])
998 for (o
= 0; o
< order
; o
++) {
999 /* At the next order, this order's pages become unavailable */
1000 free_pages
-= z
->free_area
[o
].nr_free
<< o
;
1002 /* Require fewer higher order pages to be free */
1005 if (free_pages
<= min
)
1013 * zlc_setup - Setup for "zonelist cache". Uses cached zone data to
1014 * skip over zones that are not allowed by the cpuset, or that have
1015 * been recently (in last second) found to be nearly full. See further
1016 * comments in mmzone.h. Reduces cache footprint of zonelist scans
1017 * that have to skip over alot of full or unallowed zones.
1019 * If the zonelist cache is present in the passed in zonelist, then
1020 * returns a pointer to the allowed node mask (either the current
1021 * tasks mems_allowed, or node_online_map.)
1023 * If the zonelist cache is not available for this zonelist, does
1024 * nothing and returns NULL.
1026 * If the fullzones BITMAP in the zonelist cache is stale (more than
1027 * a second since last zap'd) then we zap it out (clear its bits.)
1029 * We hold off even calling zlc_setup, until after we've checked the
1030 * first zone in the zonelist, on the theory that most allocations will
1031 * be satisfied from that first zone, so best to examine that zone as
1032 * quickly as we can.
1034 static nodemask_t
*zlc_setup(struct zonelist
*zonelist
, int alloc_flags
)
1036 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
1037 nodemask_t
*allowednodes
; /* zonelist_cache approximation */
1039 zlc
= zonelist
->zlcache_ptr
;
1043 if (jiffies
- zlc
->last_full_zap
> 1 * HZ
) {
1044 bitmap_zero(zlc
->fullzones
, MAX_ZONES_PER_ZONELIST
);
1045 zlc
->last_full_zap
= jiffies
;
1048 allowednodes
= !in_interrupt() && (alloc_flags
& ALLOC_CPUSET
) ?
1049 &cpuset_current_mems_allowed
:
1051 return allowednodes
;
1055 * Given 'z' scanning a zonelist, run a couple of quick checks to see
1056 * if it is worth looking at further for free memory:
1057 * 1) Check that the zone isn't thought to be full (doesn't have its
1058 * bit set in the zonelist_cache fullzones BITMAP).
1059 * 2) Check that the zones node (obtained from the zonelist_cache
1060 * z_to_n[] mapping) is allowed in the passed in allowednodes mask.
1061 * Return true (non-zero) if zone is worth looking at further, or
1062 * else return false (zero) if it is not.
1064 * This check -ignores- the distinction between various watermarks,
1065 * such as GFP_HIGH, GFP_ATOMIC, PF_MEMALLOC, ... If a zone is
1066 * found to be full for any variation of these watermarks, it will
1067 * be considered full for up to one second by all requests, unless
1068 * we are so low on memory on all allowed nodes that we are forced
1069 * into the second scan of the zonelist.
1071 * In the second scan we ignore this zonelist cache and exactly
1072 * apply the watermarks to all zones, even it is slower to do so.
1073 * We are low on memory in the second scan, and should leave no stone
1074 * unturned looking for a free page.
1076 static int zlc_zone_worth_trying(struct zonelist
*zonelist
, struct zone
**z
,
1077 nodemask_t
*allowednodes
)
1079 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
1080 int i
; /* index of *z in zonelist zones */
1081 int n
; /* node that zone *z is on */
1083 zlc
= zonelist
->zlcache_ptr
;
1087 i
= z
- zonelist
->zones
;
1090 /* This zone is worth trying if it is allowed but not full */
1091 return node_isset(n
, *allowednodes
) && !test_bit(i
, zlc
->fullzones
);
1095 * Given 'z' scanning a zonelist, set the corresponding bit in
1096 * zlc->fullzones, so that subsequent attempts to allocate a page
1097 * from that zone don't waste time re-examining it.
1099 static void zlc_mark_zone_full(struct zonelist
*zonelist
, struct zone
**z
)
1101 struct zonelist_cache
*zlc
; /* cached zonelist speedup info */
1102 int i
; /* index of *z in zonelist zones */
1104 zlc
= zonelist
->zlcache_ptr
;
1108 i
= z
- zonelist
->zones
;
1110 set_bit(i
, zlc
->fullzones
);
1113 #else /* CONFIG_NUMA */
1115 static nodemask_t
*zlc_setup(struct zonelist
*zonelist
, int alloc_flags
)
1120 static int zlc_zone_worth_trying(struct zonelist
*zonelist
, struct zone
**z
,
1121 nodemask_t
*allowednodes
)
1126 static void zlc_mark_zone_full(struct zonelist
*zonelist
, struct zone
**z
)
1129 #endif /* CONFIG_NUMA */
1132 * get_page_from_freelist goes through the zonelist trying to allocate
1135 static struct page
*
1136 get_page_from_freelist(gfp_t gfp_mask
, unsigned int order
,
1137 struct zonelist
*zonelist
, int alloc_flags
)
1140 struct page
*page
= NULL
;
1141 int classzone_idx
= zone_idx(zonelist
->zones
[0]);
1143 nodemask_t
*allowednodes
= NULL
;/* zonelist_cache approximation */
1144 int zlc_active
= 0; /* set if using zonelist_cache */
1145 int did_zlc_setup
= 0; /* just call zlc_setup() one time */
1149 * Scan zonelist, looking for a zone with enough free.
1150 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
1152 z
= zonelist
->zones
;
1155 if (NUMA_BUILD
&& zlc_active
&&
1156 !zlc_zone_worth_trying(zonelist
, z
, allowednodes
))
1159 if (unlikely(NUMA_BUILD
&& (gfp_mask
& __GFP_THISNODE
) &&
1160 zone
->zone_pgdat
!= zonelist
->zones
[0]->zone_pgdat
))
1162 if ((alloc_flags
& ALLOC_CPUSET
) &&
1163 !cpuset_zone_allowed(zone
, gfp_mask
))
1166 if (!(alloc_flags
& ALLOC_NO_WATERMARKS
)) {
1168 if (alloc_flags
& ALLOC_WMARK_MIN
)
1169 mark
= zone
->pages_min
;
1170 else if (alloc_flags
& ALLOC_WMARK_LOW
)
1171 mark
= zone
->pages_low
;
1173 mark
= zone
->pages_high
;
1174 if (!zone_watermark_ok(zone
, order
, mark
,
1175 classzone_idx
, alloc_flags
)) {
1176 if (!zone_reclaim_mode
||
1177 !zone_reclaim(zone
, gfp_mask
, order
))
1178 goto this_zone_full
;
1182 page
= buffered_rmqueue(zonelist
, zone
, order
, gfp_mask
);
1187 zlc_mark_zone_full(zonelist
, z
);
1189 if (NUMA_BUILD
&& !did_zlc_setup
) {
1190 /* we do zlc_setup after the first zone is tried */
1191 allowednodes
= zlc_setup(zonelist
, alloc_flags
);
1195 } while (*(++z
) != NULL
);
1197 if (unlikely(NUMA_BUILD
&& page
== NULL
&& zlc_active
)) {
1198 /* Disable zlc cache for second zonelist scan */
1206 * This is the 'heart' of the zoned buddy allocator.
1208 struct page
* fastcall
1209 __alloc_pages(gfp_t gfp_mask
, unsigned int order
,
1210 struct zonelist
*zonelist
)
1212 const gfp_t wait
= gfp_mask
& __GFP_WAIT
;
1215 struct reclaim_state reclaim_state
;
1216 struct task_struct
*p
= current
;
1219 int did_some_progress
;
1221 might_sleep_if(wait
);
1223 if (should_fail_alloc_page(gfp_mask
, order
))
1227 z
= zonelist
->zones
; /* the list of zones suitable for gfp_mask */
1229 if (unlikely(*z
== NULL
)) {
1230 /* Should this ever happen?? */
1234 page
= get_page_from_freelist(gfp_mask
|__GFP_HARDWALL
, order
,
1235 zonelist
, ALLOC_WMARK_LOW
|ALLOC_CPUSET
);
1240 * GFP_THISNODE (meaning __GFP_THISNODE, __GFP_NORETRY and
1241 * __GFP_NOWARN set) should not cause reclaim since the subsystem
1242 * (f.e. slab) using GFP_THISNODE may choose to trigger reclaim
1243 * using a larger set of nodes after it has established that the
1244 * allowed per node queues are empty and that nodes are
1247 if (NUMA_BUILD
&& (gfp_mask
& GFP_THISNODE
) == GFP_THISNODE
)
1250 for (z
= zonelist
->zones
; *z
; z
++)
1251 wakeup_kswapd(*z
, order
);
1254 * OK, we're below the kswapd watermark and have kicked background
1255 * reclaim. Now things get more complex, so set up alloc_flags according
1256 * to how we want to proceed.
1258 * The caller may dip into page reserves a bit more if the caller
1259 * cannot run direct reclaim, or if the caller has realtime scheduling
1260 * policy or is asking for __GFP_HIGH memory. GFP_ATOMIC requests will
1261 * set both ALLOC_HARDER (!wait) and ALLOC_HIGH (__GFP_HIGH).
1263 alloc_flags
= ALLOC_WMARK_MIN
;
1264 if ((unlikely(rt_task(p
)) && !in_interrupt()) || !wait
)
1265 alloc_flags
|= ALLOC_HARDER
;
1266 if (gfp_mask
& __GFP_HIGH
)
1267 alloc_flags
|= ALLOC_HIGH
;
1269 alloc_flags
|= ALLOC_CPUSET
;
1272 * Go through the zonelist again. Let __GFP_HIGH and allocations
1273 * coming from realtime tasks go deeper into reserves.
1275 * This is the last chance, in general, before the goto nopage.
1276 * Ignore cpuset if GFP_ATOMIC (!wait) rather than fail alloc.
1277 * See also cpuset_zone_allowed() comment in kernel/cpuset.c.
1279 page
= get_page_from_freelist(gfp_mask
, order
, zonelist
, alloc_flags
);
1283 /* This allocation should allow future memory freeing. */
1286 if (((p
->flags
& PF_MEMALLOC
) || unlikely(test_thread_flag(TIF_MEMDIE
)))
1287 && !in_interrupt()) {
1288 if (!(gfp_mask
& __GFP_NOMEMALLOC
)) {
1290 /* go through the zonelist yet again, ignoring mins */
1291 page
= get_page_from_freelist(gfp_mask
, order
,
1292 zonelist
, ALLOC_NO_WATERMARKS
);
1295 if (gfp_mask
& __GFP_NOFAIL
) {
1296 congestion_wait(WRITE
, HZ
/50);
1303 /* Atomic allocations - we can't balance anything */
1309 /* We now go into synchronous reclaim */
1310 cpuset_memory_pressure_bump();
1311 p
->flags
|= PF_MEMALLOC
;
1312 reclaim_state
.reclaimed_slab
= 0;
1313 p
->reclaim_state
= &reclaim_state
;
1315 did_some_progress
= try_to_free_pages(zonelist
->zones
, gfp_mask
);
1317 p
->reclaim_state
= NULL
;
1318 p
->flags
&= ~PF_MEMALLOC
;
1322 if (likely(did_some_progress
)) {
1323 page
= get_page_from_freelist(gfp_mask
, order
,
1324 zonelist
, alloc_flags
);
1327 } else if ((gfp_mask
& __GFP_FS
) && !(gfp_mask
& __GFP_NORETRY
)) {
1329 * Go through the zonelist yet one more time, keep
1330 * very high watermark here, this is only to catch
1331 * a parallel oom killing, we must fail if we're still
1332 * under heavy pressure.
1334 page
= get_page_from_freelist(gfp_mask
|__GFP_HARDWALL
, order
,
1335 zonelist
, ALLOC_WMARK_HIGH
|ALLOC_CPUSET
);
1339 out_of_memory(zonelist
, gfp_mask
, order
);
1344 * Don't let big-order allocations loop unless the caller explicitly
1345 * requests that. Wait for some write requests to complete then retry.
1347 * In this implementation, __GFP_REPEAT means __GFP_NOFAIL for order
1348 * <= 3, but that may not be true in other implementations.
1351 if (!(gfp_mask
& __GFP_NORETRY
)) {
1352 if ((order
<= 3) || (gfp_mask
& __GFP_REPEAT
))
1354 if (gfp_mask
& __GFP_NOFAIL
)
1358 congestion_wait(WRITE
, HZ
/50);
1363 if (!(gfp_mask
& __GFP_NOWARN
) && printk_ratelimit()) {
1364 printk(KERN_WARNING
"%s: page allocation failure."
1365 " order:%d, mode:0x%x\n",
1366 p
->comm
, order
, gfp_mask
);
1374 EXPORT_SYMBOL(__alloc_pages
);
1377 * Common helper functions.
1379 fastcall
unsigned long __get_free_pages(gfp_t gfp_mask
, unsigned int order
)
1382 page
= alloc_pages(gfp_mask
, order
);
1385 return (unsigned long) page_address(page
);
1388 EXPORT_SYMBOL(__get_free_pages
);
1390 fastcall
unsigned long get_zeroed_page(gfp_t gfp_mask
)
1395 * get_zeroed_page() returns a 32-bit address, which cannot represent
1398 VM_BUG_ON((gfp_mask
& __GFP_HIGHMEM
) != 0);
1400 page
= alloc_pages(gfp_mask
| __GFP_ZERO
, 0);
1402 return (unsigned long) page_address(page
);
1406 EXPORT_SYMBOL(get_zeroed_page
);
1408 void __pagevec_free(struct pagevec
*pvec
)
1410 int i
= pagevec_count(pvec
);
1413 free_hot_cold_page(pvec
->pages
[i
], pvec
->cold
);
1416 fastcall
void __free_pages(struct page
*page
, unsigned int order
)
1418 if (put_page_testzero(page
)) {
1420 free_hot_page(page
);
1422 __free_pages_ok(page
, order
);
1426 EXPORT_SYMBOL(__free_pages
);
1428 fastcall
void free_pages(unsigned long addr
, unsigned int order
)
1431 VM_BUG_ON(!virt_addr_valid((void *)addr
));
1432 __free_pages(virt_to_page((void *)addr
), order
);
1436 EXPORT_SYMBOL(free_pages
);
1439 * Total amount of free (allocatable) RAM:
1441 unsigned int nr_free_pages(void)
1443 unsigned int sum
= 0;
1447 sum
+= zone
->free_pages
;
1452 EXPORT_SYMBOL(nr_free_pages
);
1455 unsigned int nr_free_pages_pgdat(pg_data_t
*pgdat
)
1457 unsigned int sum
= 0;
1460 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
1461 sum
+= pgdat
->node_zones
[i
].free_pages
;
1467 static unsigned int nr_free_zone_pages(int offset
)
1469 /* Just pick one node, since fallback list is circular */
1470 pg_data_t
*pgdat
= NODE_DATA(numa_node_id());
1471 unsigned int sum
= 0;
1473 struct zonelist
*zonelist
= pgdat
->node_zonelists
+ offset
;
1474 struct zone
**zonep
= zonelist
->zones
;
1477 for (zone
= *zonep
++; zone
; zone
= *zonep
++) {
1478 unsigned long size
= zone
->present_pages
;
1479 unsigned long high
= zone
->pages_high
;
1488 * Amount of free RAM allocatable within ZONE_DMA and ZONE_NORMAL
1490 unsigned int nr_free_buffer_pages(void)
1492 return nr_free_zone_pages(gfp_zone(GFP_USER
));
1496 * Amount of free RAM allocatable within all zones
1498 unsigned int nr_free_pagecache_pages(void)
1500 return nr_free_zone_pages(gfp_zone(GFP_HIGHUSER
));
1503 static inline void show_node(struct zone
*zone
)
1506 printk("Node %d ", zone_to_nid(zone
));
1509 void si_meminfo(struct sysinfo
*val
)
1511 val
->totalram
= totalram_pages
;
1513 val
->freeram
= nr_free_pages();
1514 val
->bufferram
= nr_blockdev_pages();
1515 val
->totalhigh
= totalhigh_pages
;
1516 val
->freehigh
= nr_free_highpages();
1517 val
->mem_unit
= PAGE_SIZE
;
1520 EXPORT_SYMBOL(si_meminfo
);
1523 void si_meminfo_node(struct sysinfo
*val
, int nid
)
1525 pg_data_t
*pgdat
= NODE_DATA(nid
);
1527 val
->totalram
= pgdat
->node_present_pages
;
1528 val
->freeram
= nr_free_pages_pgdat(pgdat
);
1529 #ifdef CONFIG_HIGHMEM
1530 val
->totalhigh
= pgdat
->node_zones
[ZONE_HIGHMEM
].present_pages
;
1531 val
->freehigh
= pgdat
->node_zones
[ZONE_HIGHMEM
].free_pages
;
1536 val
->mem_unit
= PAGE_SIZE
;
1540 #define K(x) ((x) << (PAGE_SHIFT-10))
1543 * Show free area list (used inside shift_scroll-lock stuff)
1544 * We also calculate the percentage fragmentation. We do this by counting the
1545 * memory on each free list with the exception of the first item on the list.
1547 void show_free_areas(void)
1550 unsigned long active
;
1551 unsigned long inactive
;
1555 for_each_zone(zone
) {
1556 if (!populated_zone(zone
))
1560 printk("%s per-cpu:\n", zone
->name
);
1562 for_each_online_cpu(cpu
) {
1563 struct per_cpu_pageset
*pageset
;
1565 pageset
= zone_pcp(zone
, cpu
);
1567 printk("CPU %4d: Hot: hi:%5d, btch:%4d usd:%4d "
1568 "Cold: hi:%5d, btch:%4d usd:%4d\n",
1569 cpu
, pageset
->pcp
[0].high
,
1570 pageset
->pcp
[0].batch
, pageset
->pcp
[0].count
,
1571 pageset
->pcp
[1].high
, pageset
->pcp
[1].batch
,
1572 pageset
->pcp
[1].count
);
1576 get_zone_counts(&active
, &inactive
, &free
);
1578 printk("Active:%lu inactive:%lu dirty:%lu writeback:%lu "
1579 "unstable:%lu free:%u slab:%lu mapped:%lu pagetables:%lu\n",
1582 global_page_state(NR_FILE_DIRTY
),
1583 global_page_state(NR_WRITEBACK
),
1584 global_page_state(NR_UNSTABLE_NFS
),
1586 global_page_state(NR_SLAB_RECLAIMABLE
) +
1587 global_page_state(NR_SLAB_UNRECLAIMABLE
),
1588 global_page_state(NR_FILE_MAPPED
),
1589 global_page_state(NR_PAGETABLE
));
1591 for_each_zone(zone
) {
1594 if (!populated_zone(zone
))
1606 " pages_scanned:%lu"
1607 " all_unreclaimable? %s"
1610 K(zone
->free_pages
),
1613 K(zone
->pages_high
),
1615 K(zone
->nr_inactive
),
1616 K(zone
->present_pages
),
1617 zone
->pages_scanned
,
1618 (zone
->all_unreclaimable
? "yes" : "no")
1620 printk("lowmem_reserve[]:");
1621 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
1622 printk(" %lu", zone
->lowmem_reserve
[i
]);
1626 for_each_zone(zone
) {
1627 unsigned long nr
[MAX_ORDER
], flags
, order
, total
= 0;
1629 if (!populated_zone(zone
))
1633 printk("%s: ", zone
->name
);
1635 spin_lock_irqsave(&zone
->lock
, flags
);
1636 for (order
= 0; order
< MAX_ORDER
; order
++) {
1637 nr
[order
] = zone
->free_area
[order
].nr_free
;
1638 total
+= nr
[order
] << order
;
1640 spin_unlock_irqrestore(&zone
->lock
, flags
);
1641 for (order
= 0; order
< MAX_ORDER
; order
++)
1642 printk("%lu*%lukB ", nr
[order
], K(1UL) << order
);
1643 printk("= %lukB\n", K(total
));
1646 show_swap_cache_info();
1650 * Builds allocation fallback zone lists.
1652 * Add all populated zones of a node to the zonelist.
1654 static int __meminit
build_zonelists_node(pg_data_t
*pgdat
,
1655 struct zonelist
*zonelist
, int nr_zones
, enum zone_type zone_type
)
1659 BUG_ON(zone_type
>= MAX_NR_ZONES
);
1664 zone
= pgdat
->node_zones
+ zone_type
;
1665 if (populated_zone(zone
)) {
1666 zonelist
->zones
[nr_zones
++] = zone
;
1667 check_highest_zone(zone_type
);
1670 } while (zone_type
);
1675 #define MAX_NODE_LOAD (num_online_nodes())
1676 static int __meminitdata node_load
[MAX_NUMNODES
];
1678 * find_next_best_node - find the next node that should appear in a given node's fallback list
1679 * @node: node whose fallback list we're appending
1680 * @used_node_mask: nodemask_t of already used nodes
1682 * We use a number of factors to determine which is the next node that should
1683 * appear on a given node's fallback list. The node should not have appeared
1684 * already in @node's fallback list, and it should be the next closest node
1685 * according to the distance array (which contains arbitrary distance values
1686 * from each node to each node in the system), and should also prefer nodes
1687 * with no CPUs, since presumably they'll have very little allocation pressure
1688 * on them otherwise.
1689 * It returns -1 if no node is found.
1691 static int __meminit
find_next_best_node(int node
, nodemask_t
*used_node_mask
)
1694 int min_val
= INT_MAX
;
1697 /* Use the local node if we haven't already */
1698 if (!node_isset(node
, *used_node_mask
)) {
1699 node_set(node
, *used_node_mask
);
1703 for_each_online_node(n
) {
1706 /* Don't want a node to appear more than once */
1707 if (node_isset(n
, *used_node_mask
))
1710 /* Use the distance array to find the distance */
1711 val
= node_distance(node
, n
);
1713 /* Penalize nodes under us ("prefer the next node") */
1716 /* Give preference to headless and unused nodes */
1717 tmp
= node_to_cpumask(n
);
1718 if (!cpus_empty(tmp
))
1719 val
+= PENALTY_FOR_NODE_WITH_CPUS
;
1721 /* Slight preference for less loaded node */
1722 val
*= (MAX_NODE_LOAD
*MAX_NUMNODES
);
1723 val
+= node_load
[n
];
1725 if (val
< min_val
) {
1732 node_set(best_node
, *used_node_mask
);
1737 static void __meminit
build_zonelists(pg_data_t
*pgdat
)
1739 int j
, node
, local_node
;
1741 int prev_node
, load
;
1742 struct zonelist
*zonelist
;
1743 nodemask_t used_mask
;
1745 /* initialize zonelists */
1746 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
1747 zonelist
= pgdat
->node_zonelists
+ i
;
1748 zonelist
->zones
[0] = NULL
;
1751 /* NUMA-aware ordering of nodes */
1752 local_node
= pgdat
->node_id
;
1753 load
= num_online_nodes();
1754 prev_node
= local_node
;
1755 nodes_clear(used_mask
);
1756 while ((node
= find_next_best_node(local_node
, &used_mask
)) >= 0) {
1757 int distance
= node_distance(local_node
, node
);
1760 * If another node is sufficiently far away then it is better
1761 * to reclaim pages in a zone before going off node.
1763 if (distance
> RECLAIM_DISTANCE
)
1764 zone_reclaim_mode
= 1;
1767 * We don't want to pressure a particular node.
1768 * So adding penalty to the first node in same
1769 * distance group to make it round-robin.
1772 if (distance
!= node_distance(local_node
, prev_node
))
1773 node_load
[node
] += load
;
1776 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
1777 zonelist
= pgdat
->node_zonelists
+ i
;
1778 for (j
= 0; zonelist
->zones
[j
] != NULL
; j
++);
1780 j
= build_zonelists_node(NODE_DATA(node
), zonelist
, j
, i
);
1781 zonelist
->zones
[j
] = NULL
;
1786 /* Construct the zonelist performance cache - see further mmzone.h */
1787 static void __meminit
build_zonelist_cache(pg_data_t
*pgdat
)
1791 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
1792 struct zonelist
*zonelist
;
1793 struct zonelist_cache
*zlc
;
1796 zonelist
= pgdat
->node_zonelists
+ i
;
1797 zonelist
->zlcache_ptr
= zlc
= &zonelist
->zlcache
;
1798 bitmap_zero(zlc
->fullzones
, MAX_ZONES_PER_ZONELIST
);
1799 for (z
= zonelist
->zones
; *z
; z
++)
1800 zlc
->z_to_n
[z
- zonelist
->zones
] = zone_to_nid(*z
);
1804 #else /* CONFIG_NUMA */
1806 static void __meminit
build_zonelists(pg_data_t
*pgdat
)
1808 int node
, local_node
;
1811 local_node
= pgdat
->node_id
;
1812 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
1813 struct zonelist
*zonelist
;
1815 zonelist
= pgdat
->node_zonelists
+ i
;
1817 j
= build_zonelists_node(pgdat
, zonelist
, 0, i
);
1819 * Now we build the zonelist so that it contains the zones
1820 * of all the other nodes.
1821 * We don't want to pressure a particular node, so when
1822 * building the zones for node N, we make sure that the
1823 * zones coming right after the local ones are those from
1824 * node N+1 (modulo N)
1826 for (node
= local_node
+ 1; node
< MAX_NUMNODES
; node
++) {
1827 if (!node_online(node
))
1829 j
= build_zonelists_node(NODE_DATA(node
), zonelist
, j
, i
);
1831 for (node
= 0; node
< local_node
; node
++) {
1832 if (!node_online(node
))
1834 j
= build_zonelists_node(NODE_DATA(node
), zonelist
, j
, i
);
1837 zonelist
->zones
[j
] = NULL
;
1841 /* non-NUMA variant of zonelist performance cache - just NULL zlcache_ptr */
1842 static void __meminit
build_zonelist_cache(pg_data_t
*pgdat
)
1846 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
1847 pgdat
->node_zonelists
[i
].zlcache_ptr
= NULL
;
1850 #endif /* CONFIG_NUMA */
1852 /* return values int ....just for stop_machine_run() */
1853 static int __meminit
__build_all_zonelists(void *dummy
)
1857 for_each_online_node(nid
) {
1858 build_zonelists(NODE_DATA(nid
));
1859 build_zonelist_cache(NODE_DATA(nid
));
1864 void __meminit
build_all_zonelists(void)
1866 if (system_state
== SYSTEM_BOOTING
) {
1867 __build_all_zonelists(NULL
);
1868 cpuset_init_current_mems_allowed();
1870 /* we have to stop all cpus to guaranntee there is no user
1872 stop_machine_run(__build_all_zonelists
, NULL
, NR_CPUS
);
1873 /* cpuset refresh routine should be here */
1875 vm_total_pages
= nr_free_pagecache_pages();
1876 printk("Built %i zonelists. Total pages: %ld\n",
1877 num_online_nodes(), vm_total_pages
);
1881 * Helper functions to size the waitqueue hash table.
1882 * Essentially these want to choose hash table sizes sufficiently
1883 * large so that collisions trying to wait on pages are rare.
1884 * But in fact, the number of active page waitqueues on typical
1885 * systems is ridiculously low, less than 200. So this is even
1886 * conservative, even though it seems large.
1888 * The constant PAGES_PER_WAITQUEUE specifies the ratio of pages to
1889 * waitqueues, i.e. the size of the waitq table given the number of pages.
1891 #define PAGES_PER_WAITQUEUE 256
1893 #ifndef CONFIG_MEMORY_HOTPLUG
1894 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages
)
1896 unsigned long size
= 1;
1898 pages
/= PAGES_PER_WAITQUEUE
;
1900 while (size
< pages
)
1904 * Once we have dozens or even hundreds of threads sleeping
1905 * on IO we've got bigger problems than wait queue collision.
1906 * Limit the size of the wait table to a reasonable size.
1908 size
= min(size
, 4096UL);
1910 return max(size
, 4UL);
1914 * A zone's size might be changed by hot-add, so it is not possible to determine
1915 * a suitable size for its wait_table. So we use the maximum size now.
1917 * The max wait table size = 4096 x sizeof(wait_queue_head_t). ie:
1919 * i386 (preemption config) : 4096 x 16 = 64Kbyte.
1920 * ia64, x86-64 (no preemption): 4096 x 20 = 80Kbyte.
1921 * ia64, x86-64 (preemption) : 4096 x 24 = 96Kbyte.
1923 * The maximum entries are prepared when a zone's memory is (512K + 256) pages
1924 * or more by the traditional way. (See above). It equals:
1926 * i386, x86-64, powerpc(4K page size) : = ( 2G + 1M)byte.
1927 * ia64(16K page size) : = ( 8G + 4M)byte.
1928 * powerpc (64K page size) : = (32G +16M)byte.
1930 static inline unsigned long wait_table_hash_nr_entries(unsigned long pages
)
1937 * This is an integer logarithm so that shifts can be used later
1938 * to extract the more random high bits from the multiplicative
1939 * hash function before the remainder is taken.
1941 static inline unsigned long wait_table_bits(unsigned long size
)
1946 #define LONG_ALIGN(x) (((x)+(sizeof(long))-1)&~((sizeof(long))-1))
1949 * Initially all pages are reserved - free ones are freed
1950 * up by free_all_bootmem() once the early boot process is
1951 * done. Non-atomic initialization, single-pass.
1953 void __meminit
memmap_init_zone(unsigned long size
, int nid
, unsigned long zone
,
1954 unsigned long start_pfn
)
1957 unsigned long end_pfn
= start_pfn
+ size
;
1960 for (pfn
= start_pfn
; pfn
< end_pfn
; pfn
++) {
1961 if (!early_pfn_valid(pfn
))
1963 if (!early_pfn_in_nid(pfn
, nid
))
1965 page
= pfn_to_page(pfn
);
1966 set_page_links(page
, zone
, nid
, pfn
);
1967 init_page_count(page
);
1968 reset_page_mapcount(page
);
1969 SetPageReserved(page
);
1970 INIT_LIST_HEAD(&page
->lru
);
1971 #ifdef WANT_PAGE_VIRTUAL
1972 /* The shift won't overflow because ZONE_NORMAL is below 4G. */
1973 if (!is_highmem_idx(zone
))
1974 set_page_address(page
, __va(pfn
<< PAGE_SHIFT
));
1979 void zone_init_free_lists(struct pglist_data
*pgdat
, struct zone
*zone
,
1983 for (order
= 0; order
< MAX_ORDER
; order
++) {
1984 INIT_LIST_HEAD(&zone
->free_area
[order
].free_list
);
1985 zone
->free_area
[order
].nr_free
= 0;
1989 #ifndef __HAVE_ARCH_MEMMAP_INIT
1990 #define memmap_init(size, nid, zone, start_pfn) \
1991 memmap_init_zone((size), (nid), (zone), (start_pfn))
1994 static int __cpuinit
zone_batchsize(struct zone
*zone
)
1999 * The per-cpu-pages pools are set to around 1000th of the
2000 * size of the zone. But no more than 1/2 of a meg.
2002 * OK, so we don't know how big the cache is. So guess.
2004 batch
= zone
->present_pages
/ 1024;
2005 if (batch
* PAGE_SIZE
> 512 * 1024)
2006 batch
= (512 * 1024) / PAGE_SIZE
;
2007 batch
/= 4; /* We effectively *= 4 below */
2012 * Clamp the batch to a 2^n - 1 value. Having a power
2013 * of 2 value was found to be more likely to have
2014 * suboptimal cache aliasing properties in some cases.
2016 * For example if 2 tasks are alternately allocating
2017 * batches of pages, one task can end up with a lot
2018 * of pages of one half of the possible page colors
2019 * and the other with pages of the other colors.
2021 batch
= (1 << (fls(batch
+ batch
/2)-1)) - 1;
2026 inline void setup_pageset(struct per_cpu_pageset
*p
, unsigned long batch
)
2028 struct per_cpu_pages
*pcp
;
2030 memset(p
, 0, sizeof(*p
));
2032 pcp
= &p
->pcp
[0]; /* hot */
2034 pcp
->high
= 6 * batch
;
2035 pcp
->batch
= max(1UL, 1 * batch
);
2036 INIT_LIST_HEAD(&pcp
->list
);
2038 pcp
= &p
->pcp
[1]; /* cold*/
2040 pcp
->high
= 2 * batch
;
2041 pcp
->batch
= max(1UL, batch
/2);
2042 INIT_LIST_HEAD(&pcp
->list
);
2046 * setup_pagelist_highmark() sets the high water mark for hot per_cpu_pagelist
2047 * to the value high for the pageset p.
2050 static void setup_pagelist_highmark(struct per_cpu_pageset
*p
,
2053 struct per_cpu_pages
*pcp
;
2055 pcp
= &p
->pcp
[0]; /* hot list */
2057 pcp
->batch
= max(1UL, high
/4);
2058 if ((high
/4) > (PAGE_SHIFT
* 8))
2059 pcp
->batch
= PAGE_SHIFT
* 8;
2065 * Boot pageset table. One per cpu which is going to be used for all
2066 * zones and all nodes. The parameters will be set in such a way
2067 * that an item put on a list will immediately be handed over to
2068 * the buddy list. This is safe since pageset manipulation is done
2069 * with interrupts disabled.
2071 * Some NUMA counter updates may also be caught by the boot pagesets.
2073 * The boot_pagesets must be kept even after bootup is complete for
2074 * unused processors and/or zones. They do play a role for bootstrapping
2075 * hotplugged processors.
2077 * zoneinfo_show() and maybe other functions do
2078 * not check if the processor is online before following the pageset pointer.
2079 * Other parts of the kernel may not check if the zone is available.
2081 static struct per_cpu_pageset boot_pageset
[NR_CPUS
];
2084 * Dynamically allocate memory for the
2085 * per cpu pageset array in struct zone.
2087 static int __cpuinit
process_zones(int cpu
)
2089 struct zone
*zone
, *dzone
;
2091 for_each_zone(zone
) {
2093 if (!populated_zone(zone
))
2096 zone_pcp(zone
, cpu
) = kmalloc_node(sizeof(struct per_cpu_pageset
),
2097 GFP_KERNEL
, cpu_to_node(cpu
));
2098 if (!zone_pcp(zone
, cpu
))
2101 setup_pageset(zone_pcp(zone
, cpu
), zone_batchsize(zone
));
2103 if (percpu_pagelist_fraction
)
2104 setup_pagelist_highmark(zone_pcp(zone
, cpu
),
2105 (zone
->present_pages
/ percpu_pagelist_fraction
));
2110 for_each_zone(dzone
) {
2113 kfree(zone_pcp(dzone
, cpu
));
2114 zone_pcp(dzone
, cpu
) = NULL
;
2119 static inline void free_zone_pagesets(int cpu
)
2123 for_each_zone(zone
) {
2124 struct per_cpu_pageset
*pset
= zone_pcp(zone
, cpu
);
2126 /* Free per_cpu_pageset if it is slab allocated */
2127 if (pset
!= &boot_pageset
[cpu
])
2129 zone_pcp(zone
, cpu
) = NULL
;
2133 static int __cpuinit
pageset_cpuup_callback(struct notifier_block
*nfb
,
2134 unsigned long action
,
2137 int cpu
= (long)hcpu
;
2138 int ret
= NOTIFY_OK
;
2141 case CPU_UP_PREPARE
:
2142 if (process_zones(cpu
))
2145 case CPU_UP_CANCELED
:
2147 free_zone_pagesets(cpu
);
2155 static struct notifier_block __cpuinitdata pageset_notifier
=
2156 { &pageset_cpuup_callback
, NULL
, 0 };
2158 void __init
setup_per_cpu_pageset(void)
2162 /* Initialize per_cpu_pageset for cpu 0.
2163 * A cpuup callback will do this for every cpu
2164 * as it comes online
2166 err
= process_zones(smp_processor_id());
2168 register_cpu_notifier(&pageset_notifier
);
2174 int zone_wait_table_init(struct zone
*zone
, unsigned long zone_size_pages
)
2177 struct pglist_data
*pgdat
= zone
->zone_pgdat
;
2181 * The per-page waitqueue mechanism uses hashed waitqueues
2184 zone
->wait_table_hash_nr_entries
=
2185 wait_table_hash_nr_entries(zone_size_pages
);
2186 zone
->wait_table_bits
=
2187 wait_table_bits(zone
->wait_table_hash_nr_entries
);
2188 alloc_size
= zone
->wait_table_hash_nr_entries
2189 * sizeof(wait_queue_head_t
);
2191 if (system_state
== SYSTEM_BOOTING
) {
2192 zone
->wait_table
= (wait_queue_head_t
*)
2193 alloc_bootmem_node(pgdat
, alloc_size
);
2196 * This case means that a zone whose size was 0 gets new memory
2197 * via memory hot-add.
2198 * But it may be the case that a new node was hot-added. In
2199 * this case vmalloc() will not be able to use this new node's
2200 * memory - this wait_table must be initialized to use this new
2201 * node itself as well.
2202 * To use this new node's memory, further consideration will be
2205 zone
->wait_table
= (wait_queue_head_t
*)vmalloc(alloc_size
);
2207 if (!zone
->wait_table
)
2210 for(i
= 0; i
< zone
->wait_table_hash_nr_entries
; ++i
)
2211 init_waitqueue_head(zone
->wait_table
+ i
);
2216 static __meminit
void zone_pcp_init(struct zone
*zone
)
2219 unsigned long batch
= zone_batchsize(zone
);
2221 for (cpu
= 0; cpu
< NR_CPUS
; cpu
++) {
2223 /* Early boot. Slab allocator not functional yet */
2224 zone_pcp(zone
, cpu
) = &boot_pageset
[cpu
];
2225 setup_pageset(&boot_pageset
[cpu
],0);
2227 setup_pageset(zone_pcp(zone
,cpu
), batch
);
2230 if (zone
->present_pages
)
2231 printk(KERN_DEBUG
" %s zone: %lu pages, LIFO batch:%lu\n",
2232 zone
->name
, zone
->present_pages
, batch
);
2235 __meminit
int init_currently_empty_zone(struct zone
*zone
,
2236 unsigned long zone_start_pfn
,
2239 struct pglist_data
*pgdat
= zone
->zone_pgdat
;
2241 ret
= zone_wait_table_init(zone
, size
);
2244 pgdat
->nr_zones
= zone_idx(zone
) + 1;
2246 zone
->zone_start_pfn
= zone_start_pfn
;
2248 memmap_init(size
, pgdat
->node_id
, zone_idx(zone
), zone_start_pfn
);
2250 zone_init_free_lists(pgdat
, zone
, zone
->spanned_pages
);
2255 #ifdef CONFIG_ARCH_POPULATES_NODE_MAP
2257 * Basic iterator support. Return the first range of PFNs for a node
2258 * Note: nid == MAX_NUMNODES returns first region regardless of node
2260 static int __init
first_active_region_index_in_nid(int nid
)
2264 for (i
= 0; i
< nr_nodemap_entries
; i
++)
2265 if (nid
== MAX_NUMNODES
|| early_node_map
[i
].nid
== nid
)
2272 * Basic iterator support. Return the next active range of PFNs for a node
2273 * Note: nid == MAX_NUMNODES returns next region regardles of node
2275 static int __init
next_active_region_index_in_nid(int index
, int nid
)
2277 for (index
= index
+ 1; index
< nr_nodemap_entries
; index
++)
2278 if (nid
== MAX_NUMNODES
|| early_node_map
[index
].nid
== nid
)
2284 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
2286 * Required by SPARSEMEM. Given a PFN, return what node the PFN is on.
2287 * Architectures may implement their own version but if add_active_range()
2288 * was used and there are no special requirements, this is a convenient
2291 int __init
early_pfn_to_nid(unsigned long pfn
)
2295 for (i
= 0; i
< nr_nodemap_entries
; i
++) {
2296 unsigned long start_pfn
= early_node_map
[i
].start_pfn
;
2297 unsigned long end_pfn
= early_node_map
[i
].end_pfn
;
2299 if (start_pfn
<= pfn
&& pfn
< end_pfn
)
2300 return early_node_map
[i
].nid
;
2305 #endif /* CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID */
2307 /* Basic iterator support to walk early_node_map[] */
2308 #define for_each_active_range_index_in_nid(i, nid) \
2309 for (i = first_active_region_index_in_nid(nid); i != -1; \
2310 i = next_active_region_index_in_nid(i, nid))
2313 * free_bootmem_with_active_regions - Call free_bootmem_node for each active range
2314 * @nid: The node to free memory on. If MAX_NUMNODES, all nodes are freed.
2315 * @max_low_pfn: The highest PFN that will be passed to free_bootmem_node
2317 * If an architecture guarantees that all ranges registered with
2318 * add_active_ranges() contain no holes and may be freed, this
2319 * this function may be used instead of calling free_bootmem() manually.
2321 void __init
free_bootmem_with_active_regions(int nid
,
2322 unsigned long max_low_pfn
)
2326 for_each_active_range_index_in_nid(i
, nid
) {
2327 unsigned long size_pages
= 0;
2328 unsigned long end_pfn
= early_node_map
[i
].end_pfn
;
2330 if (early_node_map
[i
].start_pfn
>= max_low_pfn
)
2333 if (end_pfn
> max_low_pfn
)
2334 end_pfn
= max_low_pfn
;
2336 size_pages
= end_pfn
- early_node_map
[i
].start_pfn
;
2337 free_bootmem_node(NODE_DATA(early_node_map
[i
].nid
),
2338 PFN_PHYS(early_node_map
[i
].start_pfn
),
2339 size_pages
<< PAGE_SHIFT
);
2344 * sparse_memory_present_with_active_regions - Call memory_present for each active range
2345 * @nid: The node to call memory_present for. If MAX_NUMNODES, all nodes will be used.
2347 * If an architecture guarantees that all ranges registered with
2348 * add_active_ranges() contain no holes and may be freed, this
2349 * function may be used instead of calling memory_present() manually.
2351 void __init
sparse_memory_present_with_active_regions(int nid
)
2355 for_each_active_range_index_in_nid(i
, nid
)
2356 memory_present(early_node_map
[i
].nid
,
2357 early_node_map
[i
].start_pfn
,
2358 early_node_map
[i
].end_pfn
);
2362 * push_node_boundaries - Push node boundaries to at least the requested boundary
2363 * @nid: The nid of the node to push the boundary for
2364 * @start_pfn: The start pfn of the node
2365 * @end_pfn: The end pfn of the node
2367 * In reserve-based hot-add, mem_map is allocated that is unused until hotadd
2368 * time. Specifically, on x86_64, SRAT will report ranges that can potentially
2369 * be hotplugged even though no physical memory exists. This function allows
2370 * an arch to push out the node boundaries so mem_map is allocated that can
2373 #ifdef CONFIG_MEMORY_HOTPLUG_RESERVE
2374 void __init
push_node_boundaries(unsigned int nid
,
2375 unsigned long start_pfn
, unsigned long end_pfn
)
2377 printk(KERN_DEBUG
"Entering push_node_boundaries(%u, %lu, %lu)\n",
2378 nid
, start_pfn
, end_pfn
);
2380 /* Initialise the boundary for this node if necessary */
2381 if (node_boundary_end_pfn
[nid
] == 0)
2382 node_boundary_start_pfn
[nid
] = -1UL;
2384 /* Update the boundaries */
2385 if (node_boundary_start_pfn
[nid
] > start_pfn
)
2386 node_boundary_start_pfn
[nid
] = start_pfn
;
2387 if (node_boundary_end_pfn
[nid
] < end_pfn
)
2388 node_boundary_end_pfn
[nid
] = end_pfn
;
2391 /* If necessary, push the node boundary out for reserve hotadd */
2392 static void __init
account_node_boundary(unsigned int nid
,
2393 unsigned long *start_pfn
, unsigned long *end_pfn
)
2395 printk(KERN_DEBUG
"Entering account_node_boundary(%u, %lu, %lu)\n",
2396 nid
, *start_pfn
, *end_pfn
);
2398 /* Return if boundary information has not been provided */
2399 if (node_boundary_end_pfn
[nid
] == 0)
2402 /* Check the boundaries and update if necessary */
2403 if (node_boundary_start_pfn
[nid
] < *start_pfn
)
2404 *start_pfn
= node_boundary_start_pfn
[nid
];
2405 if (node_boundary_end_pfn
[nid
] > *end_pfn
)
2406 *end_pfn
= node_boundary_end_pfn
[nid
];
2409 void __init
push_node_boundaries(unsigned int nid
,
2410 unsigned long start_pfn
, unsigned long end_pfn
) {}
2412 static void __init
account_node_boundary(unsigned int nid
,
2413 unsigned long *start_pfn
, unsigned long *end_pfn
) {}
2418 * get_pfn_range_for_nid - Return the start and end page frames for a node
2419 * @nid: The nid to return the range for. If MAX_NUMNODES, the min and max PFN are returned.
2420 * @start_pfn: Passed by reference. On return, it will have the node start_pfn.
2421 * @end_pfn: Passed by reference. On return, it will have the node end_pfn.
2423 * It returns the start and end page frame of a node based on information
2424 * provided by an arch calling add_active_range(). If called for a node
2425 * with no available memory, a warning is printed and the start and end
2428 void __init
get_pfn_range_for_nid(unsigned int nid
,
2429 unsigned long *start_pfn
, unsigned long *end_pfn
)
2435 for_each_active_range_index_in_nid(i
, nid
) {
2436 *start_pfn
= min(*start_pfn
, early_node_map
[i
].start_pfn
);
2437 *end_pfn
= max(*end_pfn
, early_node_map
[i
].end_pfn
);
2440 if (*start_pfn
== -1UL) {
2441 printk(KERN_WARNING
"Node %u active with no memory\n", nid
);
2445 /* Push the node boundaries out if requested */
2446 account_node_boundary(nid
, start_pfn
, end_pfn
);
2450 * Return the number of pages a zone spans in a node, including holes
2451 * present_pages = zone_spanned_pages_in_node() - zone_absent_pages_in_node()
2453 unsigned long __init
zone_spanned_pages_in_node(int nid
,
2454 unsigned long zone_type
,
2455 unsigned long *ignored
)
2457 unsigned long node_start_pfn
, node_end_pfn
;
2458 unsigned long zone_start_pfn
, zone_end_pfn
;
2460 /* Get the start and end of the node and zone */
2461 get_pfn_range_for_nid(nid
, &node_start_pfn
, &node_end_pfn
);
2462 zone_start_pfn
= arch_zone_lowest_possible_pfn
[zone_type
];
2463 zone_end_pfn
= arch_zone_highest_possible_pfn
[zone_type
];
2465 /* Check that this node has pages within the zone's required range */
2466 if (zone_end_pfn
< node_start_pfn
|| zone_start_pfn
> node_end_pfn
)
2469 /* Move the zone boundaries inside the node if necessary */
2470 zone_end_pfn
= min(zone_end_pfn
, node_end_pfn
);
2471 zone_start_pfn
= max(zone_start_pfn
, node_start_pfn
);
2473 /* Return the spanned pages */
2474 return zone_end_pfn
- zone_start_pfn
;
2478 * Return the number of holes in a range on a node. If nid is MAX_NUMNODES,
2479 * then all holes in the requested range will be accounted for.
2481 unsigned long __init
__absent_pages_in_range(int nid
,
2482 unsigned long range_start_pfn
,
2483 unsigned long range_end_pfn
)
2486 unsigned long prev_end_pfn
= 0, hole_pages
= 0;
2487 unsigned long start_pfn
;
2489 /* Find the end_pfn of the first active range of pfns in the node */
2490 i
= first_active_region_index_in_nid(nid
);
2494 /* Account for ranges before physical memory on this node */
2495 if (early_node_map
[i
].start_pfn
> range_start_pfn
)
2496 hole_pages
= early_node_map
[i
].start_pfn
- range_start_pfn
;
2498 prev_end_pfn
= early_node_map
[i
].start_pfn
;
2500 /* Find all holes for the zone within the node */
2501 for (; i
!= -1; i
= next_active_region_index_in_nid(i
, nid
)) {
2503 /* No need to continue if prev_end_pfn is outside the zone */
2504 if (prev_end_pfn
>= range_end_pfn
)
2507 /* Make sure the end of the zone is not within the hole */
2508 start_pfn
= min(early_node_map
[i
].start_pfn
, range_end_pfn
);
2509 prev_end_pfn
= max(prev_end_pfn
, range_start_pfn
);
2511 /* Update the hole size cound and move on */
2512 if (start_pfn
> range_start_pfn
) {
2513 BUG_ON(prev_end_pfn
> start_pfn
);
2514 hole_pages
+= start_pfn
- prev_end_pfn
;
2516 prev_end_pfn
= early_node_map
[i
].end_pfn
;
2519 /* Account for ranges past physical memory on this node */
2520 if (range_end_pfn
> prev_end_pfn
)
2521 hole_pages
+= range_end_pfn
-
2522 max(range_start_pfn
, prev_end_pfn
);
2528 * absent_pages_in_range - Return number of page frames in holes within a range
2529 * @start_pfn: The start PFN to start searching for holes
2530 * @end_pfn: The end PFN to stop searching for holes
2532 * It returns the number of pages frames in memory holes within a range.
2534 unsigned long __init
absent_pages_in_range(unsigned long start_pfn
,
2535 unsigned long end_pfn
)
2537 return __absent_pages_in_range(MAX_NUMNODES
, start_pfn
, end_pfn
);
2540 /* Return the number of page frames in holes in a zone on a node */
2541 unsigned long __init
zone_absent_pages_in_node(int nid
,
2542 unsigned long zone_type
,
2543 unsigned long *ignored
)
2545 unsigned long node_start_pfn
, node_end_pfn
;
2546 unsigned long zone_start_pfn
, zone_end_pfn
;
2548 get_pfn_range_for_nid(nid
, &node_start_pfn
, &node_end_pfn
);
2549 zone_start_pfn
= max(arch_zone_lowest_possible_pfn
[zone_type
],
2551 zone_end_pfn
= min(arch_zone_highest_possible_pfn
[zone_type
],
2554 return __absent_pages_in_range(nid
, zone_start_pfn
, zone_end_pfn
);
2558 static inline unsigned long zone_spanned_pages_in_node(int nid
,
2559 unsigned long zone_type
,
2560 unsigned long *zones_size
)
2562 return zones_size
[zone_type
];
2565 static inline unsigned long zone_absent_pages_in_node(int nid
,
2566 unsigned long zone_type
,
2567 unsigned long *zholes_size
)
2572 return zholes_size
[zone_type
];
2577 static void __init
calculate_node_totalpages(struct pglist_data
*pgdat
,
2578 unsigned long *zones_size
, unsigned long *zholes_size
)
2580 unsigned long realtotalpages
, totalpages
= 0;
2583 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
2584 totalpages
+= zone_spanned_pages_in_node(pgdat
->node_id
, i
,
2586 pgdat
->node_spanned_pages
= totalpages
;
2588 realtotalpages
= totalpages
;
2589 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
2591 zone_absent_pages_in_node(pgdat
->node_id
, i
,
2593 pgdat
->node_present_pages
= realtotalpages
;
2594 printk(KERN_DEBUG
"On node %d totalpages: %lu\n", pgdat
->node_id
,
2599 * Set up the zone data structures:
2600 * - mark all pages reserved
2601 * - mark all memory queues empty
2602 * - clear the memory bitmaps
2604 static void __meminit
free_area_init_core(struct pglist_data
*pgdat
,
2605 unsigned long *zones_size
, unsigned long *zholes_size
)
2608 int nid
= pgdat
->node_id
;
2609 unsigned long zone_start_pfn
= pgdat
->node_start_pfn
;
2612 pgdat_resize_init(pgdat
);
2613 pgdat
->nr_zones
= 0;
2614 init_waitqueue_head(&pgdat
->kswapd_wait
);
2615 pgdat
->kswapd_max_order
= 0;
2617 for (j
= 0; j
< MAX_NR_ZONES
; j
++) {
2618 struct zone
*zone
= pgdat
->node_zones
+ j
;
2619 unsigned long size
, realsize
, memmap_pages
;
2621 size
= zone_spanned_pages_in_node(nid
, j
, zones_size
);
2622 realsize
= size
- zone_absent_pages_in_node(nid
, j
,
2626 * Adjust realsize so that it accounts for how much memory
2627 * is used by this zone for memmap. This affects the watermark
2628 * and per-cpu initialisations
2630 memmap_pages
= (size
* sizeof(struct page
)) >> PAGE_SHIFT
;
2631 if (realsize
>= memmap_pages
) {
2632 realsize
-= memmap_pages
;
2634 " %s zone: %lu pages used for memmap\n",
2635 zone_names
[j
], memmap_pages
);
2638 " %s zone: %lu pages exceeds realsize %lu\n",
2639 zone_names
[j
], memmap_pages
, realsize
);
2641 /* Account for reserved DMA pages */
2642 if (j
== ZONE_DMA
&& realsize
> dma_reserve
) {
2643 realsize
-= dma_reserve
;
2644 printk(KERN_DEBUG
" DMA zone: %lu pages reserved\n",
2648 if (!is_highmem_idx(j
))
2649 nr_kernel_pages
+= realsize
;
2650 nr_all_pages
+= realsize
;
2652 zone
->spanned_pages
= size
;
2653 zone
->present_pages
= realsize
;
2656 zone
->min_unmapped_pages
= (realsize
*sysctl_min_unmapped_ratio
)
2658 zone
->min_slab_pages
= (realsize
* sysctl_min_slab_ratio
) / 100;
2660 zone
->name
= zone_names
[j
];
2661 spin_lock_init(&zone
->lock
);
2662 spin_lock_init(&zone
->lru_lock
);
2663 zone_seqlock_init(zone
);
2664 zone
->zone_pgdat
= pgdat
;
2665 zone
->free_pages
= 0;
2667 zone
->prev_priority
= DEF_PRIORITY
;
2669 zone_pcp_init(zone
);
2670 INIT_LIST_HEAD(&zone
->active_list
);
2671 INIT_LIST_HEAD(&zone
->inactive_list
);
2672 zone
->nr_scan_active
= 0;
2673 zone
->nr_scan_inactive
= 0;
2674 zone
->nr_active
= 0;
2675 zone
->nr_inactive
= 0;
2676 zap_zone_vm_stats(zone
);
2677 atomic_set(&zone
->reclaim_in_progress
, 0);
2681 ret
= init_currently_empty_zone(zone
, zone_start_pfn
, size
);
2683 zone_start_pfn
+= size
;
2687 static void __init
alloc_node_mem_map(struct pglist_data
*pgdat
)
2689 /* Skip empty nodes */
2690 if (!pgdat
->node_spanned_pages
)
2693 #ifdef CONFIG_FLAT_NODE_MEM_MAP
2694 /* ia64 gets its own node_mem_map, before this, without bootmem */
2695 if (!pgdat
->node_mem_map
) {
2696 unsigned long size
, start
, end
;
2700 * The zone's endpoints aren't required to be MAX_ORDER
2701 * aligned but the node_mem_map endpoints must be in order
2702 * for the buddy allocator to function correctly.
2704 start
= pgdat
->node_start_pfn
& ~(MAX_ORDER_NR_PAGES
- 1);
2705 end
= pgdat
->node_start_pfn
+ pgdat
->node_spanned_pages
;
2706 end
= ALIGN(end
, MAX_ORDER_NR_PAGES
);
2707 size
= (end
- start
) * sizeof(struct page
);
2708 map
= alloc_remap(pgdat
->node_id
, size
);
2710 map
= alloc_bootmem_node(pgdat
, size
);
2711 pgdat
->node_mem_map
= map
+ (pgdat
->node_start_pfn
- start
);
2713 #ifdef CONFIG_FLATMEM
2715 * With no DISCONTIG, the global mem_map is just set as node 0's
2717 if (pgdat
== NODE_DATA(0)) {
2718 mem_map
= NODE_DATA(0)->node_mem_map
;
2719 #ifdef CONFIG_ARCH_POPULATES_NODE_MAP
2720 if (page_to_pfn(mem_map
) != pgdat
->node_start_pfn
)
2721 mem_map
-= pgdat
->node_start_pfn
;
2722 #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */
2725 #endif /* CONFIG_FLAT_NODE_MEM_MAP */
2728 void __meminit
free_area_init_node(int nid
, struct pglist_data
*pgdat
,
2729 unsigned long *zones_size
, unsigned long node_start_pfn
,
2730 unsigned long *zholes_size
)
2732 pgdat
->node_id
= nid
;
2733 pgdat
->node_start_pfn
= node_start_pfn
;
2734 calculate_node_totalpages(pgdat
, zones_size
, zholes_size
);
2736 alloc_node_mem_map(pgdat
);
2738 free_area_init_core(pgdat
, zones_size
, zholes_size
);
2741 #ifdef CONFIG_ARCH_POPULATES_NODE_MAP
2743 * add_active_range - Register a range of PFNs backed by physical memory
2744 * @nid: The node ID the range resides on
2745 * @start_pfn: The start PFN of the available physical memory
2746 * @end_pfn: The end PFN of the available physical memory
2748 * These ranges are stored in an early_node_map[] and later used by
2749 * free_area_init_nodes() to calculate zone sizes and holes. If the
2750 * range spans a memory hole, it is up to the architecture to ensure
2751 * the memory is not freed by the bootmem allocator. If possible
2752 * the range being registered will be merged with existing ranges.
2754 void __init
add_active_range(unsigned int nid
, unsigned long start_pfn
,
2755 unsigned long end_pfn
)
2759 printk(KERN_DEBUG
"Entering add_active_range(%d, %lu, %lu) "
2760 "%d entries of %d used\n",
2761 nid
, start_pfn
, end_pfn
,
2762 nr_nodemap_entries
, MAX_ACTIVE_REGIONS
);
2764 /* Merge with existing active regions if possible */
2765 for (i
= 0; i
< nr_nodemap_entries
; i
++) {
2766 if (early_node_map
[i
].nid
!= nid
)
2769 /* Skip if an existing region covers this new one */
2770 if (start_pfn
>= early_node_map
[i
].start_pfn
&&
2771 end_pfn
<= early_node_map
[i
].end_pfn
)
2774 /* Merge forward if suitable */
2775 if (start_pfn
<= early_node_map
[i
].end_pfn
&&
2776 end_pfn
> early_node_map
[i
].end_pfn
) {
2777 early_node_map
[i
].end_pfn
= end_pfn
;
2781 /* Merge backward if suitable */
2782 if (start_pfn
< early_node_map
[i
].end_pfn
&&
2783 end_pfn
>= early_node_map
[i
].start_pfn
) {
2784 early_node_map
[i
].start_pfn
= start_pfn
;
2789 /* Check that early_node_map is large enough */
2790 if (i
>= MAX_ACTIVE_REGIONS
) {
2791 printk(KERN_CRIT
"More than %d memory regions, truncating\n",
2792 MAX_ACTIVE_REGIONS
);
2796 early_node_map
[i
].nid
= nid
;
2797 early_node_map
[i
].start_pfn
= start_pfn
;
2798 early_node_map
[i
].end_pfn
= end_pfn
;
2799 nr_nodemap_entries
= i
+ 1;
2803 * shrink_active_range - Shrink an existing registered range of PFNs
2804 * @nid: The node id the range is on that should be shrunk
2805 * @old_end_pfn: The old end PFN of the range
2806 * @new_end_pfn: The new PFN of the range
2808 * i386 with NUMA use alloc_remap() to store a node_mem_map on a local node.
2809 * The map is kept at the end physical page range that has already been
2810 * registered with add_active_range(). This function allows an arch to shrink
2811 * an existing registered range.
2813 void __init
shrink_active_range(unsigned int nid
, unsigned long old_end_pfn
,
2814 unsigned long new_end_pfn
)
2818 /* Find the old active region end and shrink */
2819 for_each_active_range_index_in_nid(i
, nid
)
2820 if (early_node_map
[i
].end_pfn
== old_end_pfn
) {
2821 early_node_map
[i
].end_pfn
= new_end_pfn
;
2827 * remove_all_active_ranges - Remove all currently registered regions
2829 * During discovery, it may be found that a table like SRAT is invalid
2830 * and an alternative discovery method must be used. This function removes
2831 * all currently registered regions.
2833 void __init
remove_all_active_ranges(void)
2835 memset(early_node_map
, 0, sizeof(early_node_map
));
2836 nr_nodemap_entries
= 0;
2837 #ifdef CONFIG_MEMORY_HOTPLUG_RESERVE
2838 memset(node_boundary_start_pfn
, 0, sizeof(node_boundary_start_pfn
));
2839 memset(node_boundary_end_pfn
, 0, sizeof(node_boundary_end_pfn
));
2840 #endif /* CONFIG_MEMORY_HOTPLUG_RESERVE */
2843 /* Compare two active node_active_regions */
2844 static int __init
cmp_node_active_region(const void *a
, const void *b
)
2846 struct node_active_region
*arange
= (struct node_active_region
*)a
;
2847 struct node_active_region
*brange
= (struct node_active_region
*)b
;
2849 /* Done this way to avoid overflows */
2850 if (arange
->start_pfn
> brange
->start_pfn
)
2852 if (arange
->start_pfn
< brange
->start_pfn
)
2858 /* sort the node_map by start_pfn */
2859 static void __init
sort_node_map(void)
2861 sort(early_node_map
, (size_t)nr_nodemap_entries
,
2862 sizeof(struct node_active_region
),
2863 cmp_node_active_region
, NULL
);
2866 /* Find the lowest pfn for a node. This depends on a sorted early_node_map */
2867 unsigned long __init
find_min_pfn_for_node(unsigned long nid
)
2871 /* Regions in the early_node_map can be in any order */
2874 /* Assuming a sorted map, the first range found has the starting pfn */
2875 for_each_active_range_index_in_nid(i
, nid
)
2876 return early_node_map
[i
].start_pfn
;
2878 printk(KERN_WARNING
"Could not find start_pfn for node %lu\n", nid
);
2883 * find_min_pfn_with_active_regions - Find the minimum PFN registered
2885 * It returns the minimum PFN based on information provided via
2886 * add_active_range().
2888 unsigned long __init
find_min_pfn_with_active_regions(void)
2890 return find_min_pfn_for_node(MAX_NUMNODES
);
2894 * find_max_pfn_with_active_regions - Find the maximum PFN registered
2896 * It returns the maximum PFN based on information provided via
2897 * add_active_range().
2899 unsigned long __init
find_max_pfn_with_active_regions(void)
2902 unsigned long max_pfn
= 0;
2904 for (i
= 0; i
< nr_nodemap_entries
; i
++)
2905 max_pfn
= max(max_pfn
, early_node_map
[i
].end_pfn
);
2911 * free_area_init_nodes - Initialise all pg_data_t and zone data
2912 * @max_zone_pfn: an array of max PFNs for each zone
2914 * This will call free_area_init_node() for each active node in the system.
2915 * Using the page ranges provided by add_active_range(), the size of each
2916 * zone in each node and their holes is calculated. If the maximum PFN
2917 * between two adjacent zones match, it is assumed that the zone is empty.
2918 * For example, if arch_max_dma_pfn == arch_max_dma32_pfn, it is assumed
2919 * that arch_max_dma32_pfn has no pages. It is also assumed that a zone
2920 * starts where the previous one ended. For example, ZONE_DMA32 starts
2921 * at arch_max_dma_pfn.
2923 void __init
free_area_init_nodes(unsigned long *max_zone_pfn
)
2928 /* Record where the zone boundaries are */
2929 memset(arch_zone_lowest_possible_pfn
, 0,
2930 sizeof(arch_zone_lowest_possible_pfn
));
2931 memset(arch_zone_highest_possible_pfn
, 0,
2932 sizeof(arch_zone_highest_possible_pfn
));
2933 arch_zone_lowest_possible_pfn
[0] = find_min_pfn_with_active_regions();
2934 arch_zone_highest_possible_pfn
[0] = max_zone_pfn
[0];
2935 for (i
= 1; i
< MAX_NR_ZONES
; i
++) {
2936 arch_zone_lowest_possible_pfn
[i
] =
2937 arch_zone_highest_possible_pfn
[i
-1];
2938 arch_zone_highest_possible_pfn
[i
] =
2939 max(max_zone_pfn
[i
], arch_zone_lowest_possible_pfn
[i
]);
2942 /* Print out the zone ranges */
2943 printk("Zone PFN ranges:\n");
2944 for (i
= 0; i
< MAX_NR_ZONES
; i
++)
2945 printk(" %-8s %8lu -> %8lu\n",
2947 arch_zone_lowest_possible_pfn
[i
],
2948 arch_zone_highest_possible_pfn
[i
]);
2950 /* Print out the early_node_map[] */
2951 printk("early_node_map[%d] active PFN ranges\n", nr_nodemap_entries
);
2952 for (i
= 0; i
< nr_nodemap_entries
; i
++)
2953 printk(" %3d: %8lu -> %8lu\n", early_node_map
[i
].nid
,
2954 early_node_map
[i
].start_pfn
,
2955 early_node_map
[i
].end_pfn
);
2957 /* Initialise every node */
2958 for_each_online_node(nid
) {
2959 pg_data_t
*pgdat
= NODE_DATA(nid
);
2960 free_area_init_node(nid
, pgdat
, NULL
,
2961 find_min_pfn_for_node(nid
), NULL
);
2964 #endif /* CONFIG_ARCH_POPULATES_NODE_MAP */
2967 * set_dma_reserve - set the specified number of pages reserved in the first zone
2968 * @new_dma_reserve: The number of pages to mark reserved
2970 * The per-cpu batchsize and zone watermarks are determined by present_pages.
2971 * In the DMA zone, a significant percentage may be consumed by kernel image
2972 * and other unfreeable allocations which can skew the watermarks badly. This
2973 * function may optionally be used to account for unfreeable pages in the
2974 * first zone (e.g., ZONE_DMA). The effect will be lower watermarks and
2975 * smaller per-cpu batchsize.
2977 void __init
set_dma_reserve(unsigned long new_dma_reserve
)
2979 dma_reserve
= new_dma_reserve
;
2982 #ifndef CONFIG_NEED_MULTIPLE_NODES
2983 static bootmem_data_t contig_bootmem_data
;
2984 struct pglist_data contig_page_data
= { .bdata
= &contig_bootmem_data
};
2986 EXPORT_SYMBOL(contig_page_data
);
2989 void __init
free_area_init(unsigned long *zones_size
)
2991 free_area_init_node(0, NODE_DATA(0), zones_size
,
2992 __pa(PAGE_OFFSET
) >> PAGE_SHIFT
, NULL
);
2995 static int page_alloc_cpu_notify(struct notifier_block
*self
,
2996 unsigned long action
, void *hcpu
)
2998 int cpu
= (unsigned long)hcpu
;
3000 if (action
== CPU_DEAD
) {
3001 local_irq_disable();
3003 vm_events_fold_cpu(cpu
);
3005 refresh_cpu_vm_stats(cpu
);
3010 void __init
page_alloc_init(void)
3012 hotcpu_notifier(page_alloc_cpu_notify
, 0);
3016 * calculate_totalreserve_pages - called when sysctl_lower_zone_reserve_ratio
3017 * or min_free_kbytes changes.
3019 static void calculate_totalreserve_pages(void)
3021 struct pglist_data
*pgdat
;
3022 unsigned long reserve_pages
= 0;
3023 enum zone_type i
, j
;
3025 for_each_online_pgdat(pgdat
) {
3026 for (i
= 0; i
< MAX_NR_ZONES
; i
++) {
3027 struct zone
*zone
= pgdat
->node_zones
+ i
;
3028 unsigned long max
= 0;
3030 /* Find valid and maximum lowmem_reserve in the zone */
3031 for (j
= i
; j
< MAX_NR_ZONES
; j
++) {
3032 if (zone
->lowmem_reserve
[j
] > max
)
3033 max
= zone
->lowmem_reserve
[j
];
3036 /* we treat pages_high as reserved pages. */
3037 max
+= zone
->pages_high
;
3039 if (max
> zone
->present_pages
)
3040 max
= zone
->present_pages
;
3041 reserve_pages
+= max
;
3044 totalreserve_pages
= reserve_pages
;
3048 * setup_per_zone_lowmem_reserve - called whenever
3049 * sysctl_lower_zone_reserve_ratio changes. Ensures that each zone
3050 * has a correct pages reserved value, so an adequate number of
3051 * pages are left in the zone after a successful __alloc_pages().
3053 static void setup_per_zone_lowmem_reserve(void)
3055 struct pglist_data
*pgdat
;
3056 enum zone_type j
, idx
;
3058 for_each_online_pgdat(pgdat
) {
3059 for (j
= 0; j
< MAX_NR_ZONES
; j
++) {
3060 struct zone
*zone
= pgdat
->node_zones
+ j
;
3061 unsigned long present_pages
= zone
->present_pages
;
3063 zone
->lowmem_reserve
[j
] = 0;
3067 struct zone
*lower_zone
;
3071 if (sysctl_lowmem_reserve_ratio
[idx
] < 1)
3072 sysctl_lowmem_reserve_ratio
[idx
] = 1;
3074 lower_zone
= pgdat
->node_zones
+ idx
;
3075 lower_zone
->lowmem_reserve
[j
] = present_pages
/
3076 sysctl_lowmem_reserve_ratio
[idx
];
3077 present_pages
+= lower_zone
->present_pages
;
3082 /* update totalreserve_pages */
3083 calculate_totalreserve_pages();
3087 * setup_per_zone_pages_min - called when min_free_kbytes changes.
3089 * Ensures that the pages_{min,low,high} values for each zone are set correctly
3090 * with respect to min_free_kbytes.
3092 void setup_per_zone_pages_min(void)
3094 unsigned long pages_min
= min_free_kbytes
>> (PAGE_SHIFT
- 10);
3095 unsigned long lowmem_pages
= 0;
3097 unsigned long flags
;
3099 /* Calculate total number of !ZONE_HIGHMEM pages */
3100 for_each_zone(zone
) {
3101 if (!is_highmem(zone
))
3102 lowmem_pages
+= zone
->present_pages
;
3105 for_each_zone(zone
) {
3108 spin_lock_irqsave(&zone
->lru_lock
, flags
);
3109 tmp
= (u64
)pages_min
* zone
->present_pages
;
3110 do_div(tmp
, lowmem_pages
);
3111 if (is_highmem(zone
)) {
3113 * __GFP_HIGH and PF_MEMALLOC allocations usually don't
3114 * need highmem pages, so cap pages_min to a small
3117 * The (pages_high-pages_low) and (pages_low-pages_min)
3118 * deltas controls asynch page reclaim, and so should
3119 * not be capped for highmem.
3123 min_pages
= zone
->present_pages
/ 1024;
3124 if (min_pages
< SWAP_CLUSTER_MAX
)
3125 min_pages
= SWAP_CLUSTER_MAX
;
3126 if (min_pages
> 128)
3128 zone
->pages_min
= min_pages
;
3131 * If it's a lowmem zone, reserve a number of pages
3132 * proportionate to the zone's size.
3134 zone
->pages_min
= tmp
;
3137 zone
->pages_low
= zone
->pages_min
+ (tmp
>> 2);
3138 zone
->pages_high
= zone
->pages_min
+ (tmp
>> 1);
3139 spin_unlock_irqrestore(&zone
->lru_lock
, flags
);
3142 /* update totalreserve_pages */
3143 calculate_totalreserve_pages();
3147 * Initialise min_free_kbytes.
3149 * For small machines we want it small (128k min). For large machines
3150 * we want it large (64MB max). But it is not linear, because network
3151 * bandwidth does not increase linearly with machine size. We use
3153 * min_free_kbytes = 4 * sqrt(lowmem_kbytes), for better accuracy:
3154 * min_free_kbytes = sqrt(lowmem_kbytes * 16)
3170 static int __init
init_per_zone_pages_min(void)
3172 unsigned long lowmem_kbytes
;
3174 lowmem_kbytes
= nr_free_buffer_pages() * (PAGE_SIZE
>> 10);
3176 min_free_kbytes
= int_sqrt(lowmem_kbytes
* 16);
3177 if (min_free_kbytes
< 128)
3178 min_free_kbytes
= 128;
3179 if (min_free_kbytes
> 65536)
3180 min_free_kbytes
= 65536;
3181 setup_per_zone_pages_min();
3182 setup_per_zone_lowmem_reserve();
3185 module_init(init_per_zone_pages_min
)
3188 * min_free_kbytes_sysctl_handler - just a wrapper around proc_dointvec() so
3189 * that we can call two helper functions whenever min_free_kbytes
3192 int min_free_kbytes_sysctl_handler(ctl_table
*table
, int write
,
3193 struct file
*file
, void __user
*buffer
, size_t *length
, loff_t
*ppos
)
3195 proc_dointvec(table
, write
, file
, buffer
, length
, ppos
);
3196 setup_per_zone_pages_min();
3201 int sysctl_min_unmapped_ratio_sysctl_handler(ctl_table
*table
, int write
,
3202 struct file
*file
, void __user
*buffer
, size_t *length
, loff_t
*ppos
)
3207 rc
= proc_dointvec_minmax(table
, write
, file
, buffer
, length
, ppos
);
3212 zone
->min_unmapped_pages
= (zone
->present_pages
*
3213 sysctl_min_unmapped_ratio
) / 100;
3217 int sysctl_min_slab_ratio_sysctl_handler(ctl_table
*table
, int write
,
3218 struct file
*file
, void __user
*buffer
, size_t *length
, loff_t
*ppos
)
3223 rc
= proc_dointvec_minmax(table
, write
, file
, buffer
, length
, ppos
);
3228 zone
->min_slab_pages
= (zone
->present_pages
*
3229 sysctl_min_slab_ratio
) / 100;
3235 * lowmem_reserve_ratio_sysctl_handler - just a wrapper around
3236 * proc_dointvec() so that we can call setup_per_zone_lowmem_reserve()
3237 * whenever sysctl_lowmem_reserve_ratio changes.
3239 * The reserve ratio obviously has absolutely no relation with the
3240 * pages_min watermarks. The lowmem reserve ratio can only make sense
3241 * if in function of the boot time zone sizes.
3243 int lowmem_reserve_ratio_sysctl_handler(ctl_table
*table
, int write
,
3244 struct file
*file
, void __user
*buffer
, size_t *length
, loff_t
*ppos
)
3246 proc_dointvec_minmax(table
, write
, file
, buffer
, length
, ppos
);
3247 setup_per_zone_lowmem_reserve();
3252 * percpu_pagelist_fraction - changes the pcp->high for each zone on each
3253 * cpu. It is the fraction of total pages in each zone that a hot per cpu pagelist
3254 * can have before it gets flushed back to buddy allocator.
3257 int percpu_pagelist_fraction_sysctl_handler(ctl_table
*table
, int write
,
3258 struct file
*file
, void __user
*buffer
, size_t *length
, loff_t
*ppos
)
3264 ret
= proc_dointvec_minmax(table
, write
, file
, buffer
, length
, ppos
);
3265 if (!write
|| (ret
== -EINVAL
))
3267 for_each_zone(zone
) {
3268 for_each_online_cpu(cpu
) {
3270 high
= zone
->present_pages
/ percpu_pagelist_fraction
;
3271 setup_pagelist_highmark(zone_pcp(zone
, cpu
), high
);
3277 int hashdist
= HASHDIST_DEFAULT
;
3280 static int __init
set_hashdist(char *str
)
3284 hashdist
= simple_strtoul(str
, &str
, 0);
3287 __setup("hashdist=", set_hashdist
);
3291 * allocate a large system hash table from bootmem
3292 * - it is assumed that the hash table must contain an exact power-of-2
3293 * quantity of entries
3294 * - limit is the number of hash buckets, not the total allocation size
3296 void *__init
alloc_large_system_hash(const char *tablename
,
3297 unsigned long bucketsize
,
3298 unsigned long numentries
,
3301 unsigned int *_hash_shift
,
3302 unsigned int *_hash_mask
,
3303 unsigned long limit
)
3305 unsigned long long max
= limit
;
3306 unsigned long log2qty
, size
;
3309 /* allow the kernel cmdline to have a say */
3311 /* round applicable memory size up to nearest megabyte */
3312 numentries
= nr_kernel_pages
;
3313 numentries
+= (1UL << (20 - PAGE_SHIFT
)) - 1;
3314 numentries
>>= 20 - PAGE_SHIFT
;
3315 numentries
<<= 20 - PAGE_SHIFT
;
3317 /* limit to 1 bucket per 2^scale bytes of low memory */
3318 if (scale
> PAGE_SHIFT
)
3319 numentries
>>= (scale
- PAGE_SHIFT
);
3321 numentries
<<= (PAGE_SHIFT
- scale
);
3323 numentries
= roundup_pow_of_two(numentries
);
3325 /* limit allocation size to 1/16 total memory by default */
3327 max
= ((unsigned long long)nr_all_pages
<< PAGE_SHIFT
) >> 4;
3328 do_div(max
, bucketsize
);
3331 if (numentries
> max
)
3334 log2qty
= ilog2(numentries
);
3337 size
= bucketsize
<< log2qty
;
3338 if (flags
& HASH_EARLY
)
3339 table
= alloc_bootmem(size
);
3341 table
= __vmalloc(size
, GFP_ATOMIC
, PAGE_KERNEL
);
3343 unsigned long order
;
3344 for (order
= 0; ((1UL << order
) << PAGE_SHIFT
) < size
; order
++)
3346 table
= (void*) __get_free_pages(GFP_ATOMIC
, order
);
3348 } while (!table
&& size
> PAGE_SIZE
&& --log2qty
);
3351 panic("Failed to allocate %s hash table\n", tablename
);
3353 printk("%s hash table entries: %d (order: %d, %lu bytes)\n",
3356 ilog2(size
) - PAGE_SHIFT
,
3360 *_hash_shift
= log2qty
;
3362 *_hash_mask
= (1 << log2qty
) - 1;
3367 #ifdef CONFIG_OUT_OF_LINE_PFN_TO_PAGE
3368 struct page
*pfn_to_page(unsigned long pfn
)
3370 return __pfn_to_page(pfn
);
3372 unsigned long page_to_pfn(struct page
*page
)
3374 return __page_to_pfn(page
);
3376 EXPORT_SYMBOL(pfn_to_page
);
3377 EXPORT_SYMBOL(page_to_pfn
);
3378 #endif /* CONFIG_OUT_OF_LINE_PFN_TO_PAGE */
3380 #if MAX_NUMNODES > 1
3382 * Find the highest possible node id.
3384 int highest_possible_node_id(void)
3387 unsigned int highest
= 0;
3389 for_each_node_mask(node
, node_possible_map
)
3393 EXPORT_SYMBOL(highest_possible_node_id
);