1 #ifndef _LINUX_MMZONE_H
2 #define _LINUX_MMZONE_H
7 #include <linux/spinlock.h>
8 #include <linux/list.h>
9 #include <linux/wait.h>
10 #include <linux/cache.h>
11 #include <linux/threads.h>
12 #include <linux/numa.h>
13 #include <linux/init.h>
14 #include <linux/seqlock.h>
15 #include <linux/nodemask.h>
16 #include <asm/atomic.h>
19 /* Free memory management - zoned buddy allocator. */
20 #ifndef CONFIG_FORCE_MAX_ZONEORDER
23 #define MAX_ORDER CONFIG_FORCE_MAX_ZONEORDER
25 #define MAX_ORDER_NR_PAGES (1 << (MAX_ORDER - 1))
28 struct list_head free_list;
29 unsigned long nr_free;
35 * zone->lock and zone->lru_lock are two of the hottest locks in the kernel.
36 * So add a wild amount of padding here to ensure that they fall into separate
37 * cachelines. There are very few zone structures in the machine, so space
38 * consumption is not a concern here.
40 #if defined(CONFIG_SMP)
43 } ____cacheline_internodealigned_in_smp;
44 #define ZONE_PADDING(name) struct zone_padding name;
46 #define ZONE_PADDING(name)
50 NR_ANON_PAGES, /* Mapped anonymous pages */
51 NR_FILE_MAPPED, /* pagecache pages mapped into pagetables.
52 only modified from process context */
54 NR_SLAB, /* Pages used by slab allocator */
55 NR_PAGETABLE, /* used for pagetables */
58 NR_UNSTABLE_NFS, /* NFS unstable pages */
60 NR_VM_ZONE_STAT_ITEMS };
62 struct per_cpu_pages {
63 int count; /* number of pages in the list */
64 int high; /* high watermark, emptying needed */
65 int batch; /* chunk size for buddy add/remove */
66 struct list_head list; /* the list of pages */
69 struct per_cpu_pageset {
70 struct per_cpu_pages pcp[2]; /* 0: hot. 1: cold */
72 s8 vm_stat_diff[NR_VM_ZONE_STAT_ITEMS];
76 unsigned long numa_hit; /* allocated in intended node */
77 unsigned long numa_miss; /* allocated in non intended node */
78 unsigned long numa_foreign; /* was intended here, hit elsewhere */
79 unsigned long interleave_hit; /* interleaver prefered this zone */
80 unsigned long local_node; /* allocation from local node */
81 unsigned long other_node; /* allocation from other node */
83 } ____cacheline_aligned_in_smp;
86 #define zone_pcp(__z, __cpu) ((__z)->pageset[(__cpu)])
88 #define zone_pcp(__z, __cpu) (&(__z)->pageset[(__cpu)])
94 #define ZONE_HIGHMEM 3
96 #define MAX_NR_ZONES 4 /* Sync this with ZONES_SHIFT */
97 #define ZONES_SHIFT 2 /* ceil(log2(MAX_NR_ZONES)) */
101 * When a memory allocation must conform to specific limitations (such
102 * as being suitable for DMA) the caller will pass in hints to the
103 * allocator in the gfp_mask, in the zone modifier bits. These bits
104 * are used to select a priority ordered list of memory zones which
105 * match the requested limits. GFP_ZONEMASK defines which bits within
106 * the gfp_mask should be considered as zone modifiers. Each valid
107 * combination of the zone modifier bits has a corresponding list
108 * of zones (in node_zonelists). Thus for two zone modifiers there
109 * will be a maximum of 4 (2 ** 2) zonelists, for 3 modifiers there will
110 * be 8 (2 ** 3) zonelists. GFP_ZONETYPES defines the number of possible
111 * combinations of zone modifiers in "zone modifier space".
113 * As an optimisation any zone modifier bits which are only valid when
114 * no other zone modifier bits are set (loners) should be placed in
115 * the highest order bits of this field. This allows us to reduce the
116 * extent of the zonelists thus saving space. For example in the case
117 * of three zone modifier bits, we could require up to eight zonelists.
118 * If the left most zone modifier is a "loner" then the highest valid
119 * zonelist would be four allowing us to allocate only five zonelists.
120 * Use the first form for GFP_ZONETYPES when the left most bit is not
121 * a "loner", otherwise use the second.
123 * NOTE! Make sure this matches the zones in <linux/gfp.h>
125 #define GFP_ZONEMASK 0x07
126 /* #define GFP_ZONETYPES (GFP_ZONEMASK + 1) */ /* Non-loner */
127 #define GFP_ZONETYPES ((GFP_ZONEMASK + 1) / 2 + 1) /* Loner */
130 * On machines where it is needed (eg PCs) we divide physical memory
131 * into multiple physical zones. On a 32bit PC we have 4 zones:
133 * ZONE_DMA < 16 MB ISA DMA capable memory
134 * ZONE_DMA32 0 MB Empty
135 * ZONE_NORMAL 16-896 MB direct mapped by the kernel
136 * ZONE_HIGHMEM > 896 MB only page cache and user processes
140 /* Fields commonly accessed by the page allocator */
141 unsigned long free_pages;
142 unsigned long pages_min, pages_low, pages_high;
144 * We don't know if the memory that we're going to allocate will be freeable
145 * or/and it will be released eventually, so to avoid totally wasting several
146 * GB of ram we must reserve some of the lower zone memory (otherwise we risk
147 * to run OOM on the lower zones despite there's tons of freeable ram
148 * on the higher zones). This array is recalculated at runtime if the
149 * sysctl_lowmem_reserve_ratio sysctl changes.
151 unsigned long lowmem_reserve[MAX_NR_ZONES];
154 struct per_cpu_pageset *pageset[NR_CPUS];
156 struct per_cpu_pageset pageset[NR_CPUS];
159 * free areas of different sizes
162 #ifdef CONFIG_MEMORY_HOTPLUG
163 /* see spanned/present_pages for more description */
164 seqlock_t span_seqlock;
166 struct free_area free_area[MAX_ORDER];
171 /* Fields commonly accessed by the page reclaim scanner */
173 struct list_head active_list;
174 struct list_head inactive_list;
175 unsigned long nr_scan_active;
176 unsigned long nr_scan_inactive;
177 unsigned long nr_active;
178 unsigned long nr_inactive;
179 unsigned long pages_scanned; /* since last reclaim */
180 int all_unreclaimable; /* All pages pinned */
182 /* A count of how many reclaimers are scanning this zone */
183 atomic_t reclaim_in_progress;
185 /* Zone statistics */
186 atomic_long_t vm_stat[NR_VM_ZONE_STAT_ITEMS];
189 * prev_priority holds the scanning priority for this zone. It is
190 * defined as the scanning priority at which we achieved our reclaim
191 * target at the previous try_to_free_pages() or balance_pgdat()
194 * We use prev_priority as a measure of how much stress page reclaim is
195 * under - it drives the swappiness decision: whether to unmap mapped
198 * temp_priority is used to remember the scanning priority at which
199 * this zone was successfully refilled to free_pages == pages_high.
201 * Access to both these fields is quite racy even on uniprocessor. But
202 * it is expected to average out OK.
209 /* Rarely used or read-mostly fields */
212 * wait_table -- the array holding the hash table
213 * wait_table_hash_nr_entries -- the size of the hash table array
214 * wait_table_bits -- wait_table_size == (1 << wait_table_bits)
216 * The purpose of all these is to keep track of the people
217 * waiting for a page to become available and make them
218 * runnable again when possible. The trouble is that this
219 * consumes a lot of space, especially when so few things
220 * wait on pages at a given time. So instead of using
221 * per-page waitqueues, we use a waitqueue hash table.
223 * The bucket discipline is to sleep on the same queue when
224 * colliding and wake all in that wait queue when removing.
225 * When something wakes, it must check to be sure its page is
226 * truly available, a la thundering herd. The cost of a
227 * collision is great, but given the expected load of the
228 * table, they should be so rare as to be outweighed by the
229 * benefits from the saved space.
231 * __wait_on_page_locked() and unlock_page() in mm/filemap.c, are the
232 * primary users of these fields, and in mm/page_alloc.c
233 * free_area_init_core() performs the initialization of them.
235 wait_queue_head_t * wait_table;
236 unsigned long wait_table_hash_nr_entries;
237 unsigned long wait_table_bits;
240 * Discontig memory support fields.
242 struct pglist_data *zone_pgdat;
243 /* zone_start_pfn == zone_start_paddr >> PAGE_SHIFT */
244 unsigned long zone_start_pfn;
247 * zone_start_pfn, spanned_pages and present_pages are all
248 * protected by span_seqlock. It is a seqlock because it has
249 * to be read outside of zone->lock, and it is done in the main
250 * allocator path. But, it is written quite infrequently.
252 * The lock is declared along with zone->lock because it is
253 * frequently read in proximity to zone->lock. It's good to
254 * give them a chance of being in the same cacheline.
256 unsigned long spanned_pages; /* total size, including holes */
257 unsigned long present_pages; /* amount of memory (excluding holes) */
260 * rarely used fields:
263 } ____cacheline_internodealigned_in_smp;
267 * The "priority" of VM scanning is how much of the queues we will scan in one
268 * go. A value of 12 for DEF_PRIORITY implies that we will scan 1/4096th of the
269 * queues ("queue_length >> 12") during an aging round.
271 #define DEF_PRIORITY 12
274 * One allocation request operates on a zonelist. A zonelist
275 * is a list of zones, the first one is the 'goal' of the
276 * allocation, the other zones are fallback zones, in decreasing
279 * Right now a zonelist takes up less than a cacheline. We never
280 * modify it apart from boot-up, and only a few indices are used,
281 * so despite the zonelist table being relatively big, the cache
282 * footprint of this construct is very small.
285 struct zone *zones[MAX_NUMNODES * MAX_NR_ZONES + 1]; // NULL delimited
290 * The pg_data_t structure is used in machines with CONFIG_DISCONTIGMEM
291 * (mostly NUMA machines?) to denote a higher-level memory zone than the
294 * On NUMA machines, each NUMA node would have a pg_data_t to describe
295 * it's memory layout.
297 * Memory statistics and page replacement data structures are maintained on a
301 typedef struct pglist_data {
302 struct zone node_zones[MAX_NR_ZONES];
303 struct zonelist node_zonelists[GFP_ZONETYPES];
305 #ifdef CONFIG_FLAT_NODE_MEM_MAP
306 struct page *node_mem_map;
308 struct bootmem_data *bdata;
309 #ifdef CONFIG_MEMORY_HOTPLUG
311 * Must be held any time you expect node_start_pfn, node_present_pages
312 * or node_spanned_pages stay constant. Holding this will also
313 * guarantee that any pfn_valid() stays that way.
315 * Nests above zone->lock and zone->size_seqlock.
317 spinlock_t node_size_lock;
319 unsigned long node_start_pfn;
320 unsigned long node_present_pages; /* total number of physical pages */
321 unsigned long node_spanned_pages; /* total size of physical page
322 range, including holes */
324 wait_queue_head_t kswapd_wait;
325 struct task_struct *kswapd;
326 int kswapd_max_order;
329 #define node_present_pages(nid) (NODE_DATA(nid)->node_present_pages)
330 #define node_spanned_pages(nid) (NODE_DATA(nid)->node_spanned_pages)
331 #ifdef CONFIG_FLAT_NODE_MEM_MAP
332 #define pgdat_page_nr(pgdat, pagenr) ((pgdat)->node_mem_map + (pagenr))
334 #define pgdat_page_nr(pgdat, pagenr) pfn_to_page((pgdat)->node_start_pfn + (pagenr))
336 #define nid_page_nr(nid, pagenr) pgdat_page_nr(NODE_DATA(nid),(pagenr))
338 #include <linux/memory_hotplug.h>
340 void __get_zone_counts(unsigned long *active, unsigned long *inactive,
341 unsigned long *free, struct pglist_data *pgdat);
342 void get_zone_counts(unsigned long *active, unsigned long *inactive,
343 unsigned long *free);
344 void build_all_zonelists(void);
345 void wakeup_kswapd(struct zone *zone, int order);
346 int zone_watermark_ok(struct zone *z, int order, unsigned long mark,
347 int classzone_idx, int alloc_flags);
349 extern int init_currently_empty_zone(struct zone *zone, unsigned long start_pfn,
352 #ifdef CONFIG_HAVE_MEMORY_PRESENT
353 void memory_present(int nid, unsigned long start, unsigned long end);
355 static inline void memory_present(int nid, unsigned long start, unsigned long end) {}
358 #ifdef CONFIG_NEED_NODE_MEMMAP_SIZE
359 unsigned long __init node_memmap_size_bytes(int, unsigned long, unsigned long);
363 * zone_idx() returns 0 for the ZONE_DMA zone, 1 for the ZONE_NORMAL zone, etc.
365 #define zone_idx(zone) ((zone) - (zone)->zone_pgdat->node_zones)
367 static inline int populated_zone(struct zone *zone)
369 return (!!zone->present_pages);
372 static inline int is_highmem_idx(int idx)
374 return (idx == ZONE_HIGHMEM);
377 static inline int is_normal_idx(int idx)
379 return (idx == ZONE_NORMAL);
383 * is_highmem - helper function to quickly check if a struct zone is a
384 * highmem zone or not. This is an attempt to keep references
385 * to ZONE_{DMA/NORMAL/HIGHMEM/etc} in general code to a minimum.
386 * @zone - pointer to struct zone variable
388 static inline int is_highmem(struct zone *zone)
390 return zone == zone->zone_pgdat->node_zones + ZONE_HIGHMEM;
393 static inline int is_normal(struct zone *zone)
395 return zone == zone->zone_pgdat->node_zones + ZONE_NORMAL;
398 static inline int is_dma32(struct zone *zone)
400 return zone == zone->zone_pgdat->node_zones + ZONE_DMA32;
403 static inline int is_dma(struct zone *zone)
405 return zone == zone->zone_pgdat->node_zones + ZONE_DMA;
408 /* These two functions are used to setup the per zone pages min values */
411 int min_free_kbytes_sysctl_handler(struct ctl_table *, int, struct file *,
412 void __user *, size_t *, loff_t *);
413 extern int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1];
414 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *, int, struct file *,
415 void __user *, size_t *, loff_t *);
416 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *, int, struct file *,
417 void __user *, size_t *, loff_t *);
419 #include <linux/topology.h>
420 /* Returns the number of the current Node. */
422 #define numa_node_id() (cpu_to_node(raw_smp_processor_id()))
425 #ifndef CONFIG_NEED_MULTIPLE_NODES
427 extern struct pglist_data contig_page_data;
428 #define NODE_DATA(nid) (&contig_page_data)
429 #define NODE_MEM_MAP(nid) mem_map
430 #define MAX_NODES_SHIFT 1
432 #else /* CONFIG_NEED_MULTIPLE_NODES */
434 #include <asm/mmzone.h>
436 #endif /* !CONFIG_NEED_MULTIPLE_NODES */
438 extern struct pglist_data *first_online_pgdat(void);
439 extern struct pglist_data *next_online_pgdat(struct pglist_data *pgdat);
440 extern struct zone *next_zone(struct zone *zone);
443 * for_each_pgdat - helper macro to iterate over all nodes
444 * @pgdat - pointer to a pg_data_t variable
446 #define for_each_online_pgdat(pgdat) \
447 for (pgdat = first_online_pgdat(); \
449 pgdat = next_online_pgdat(pgdat))
451 * for_each_zone - helper macro to iterate over all memory zones
452 * @zone - pointer to struct zone variable
454 * The user only needs to declare the zone variable, for_each_zone
457 #define for_each_zone(zone) \
458 for (zone = (first_online_pgdat())->node_zones; \
460 zone = next_zone(zone))
462 #ifdef CONFIG_SPARSEMEM
463 #include <asm/sparsemem.h>
466 #if BITS_PER_LONG == 32
468 * with 32 bit page->flags field, we reserve 9 bits for node/zone info.
469 * there are 4 zones (3 bits) and this leaves 9-3=6 bits for nodes.
471 #define FLAGS_RESERVED 9
473 #elif BITS_PER_LONG == 64
475 * with 64 bit flags field, there's plenty of room.
477 #define FLAGS_RESERVED 32
481 #error BITS_PER_LONG not defined
485 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
486 #define early_pfn_to_nid(nid) (0UL)
489 #ifdef CONFIG_FLATMEM
490 #define pfn_to_nid(pfn) (0)
493 #define pfn_to_section_nr(pfn) ((pfn) >> PFN_SECTION_SHIFT)
494 #define section_nr_to_pfn(sec) ((sec) << PFN_SECTION_SHIFT)
496 #ifdef CONFIG_SPARSEMEM
499 * SECTION_SHIFT #bits space required to store a section #
501 * PA_SECTION_SHIFT physical address to/from section number
502 * PFN_SECTION_SHIFT pfn to/from section number
504 #define SECTIONS_SHIFT (MAX_PHYSMEM_BITS - SECTION_SIZE_BITS)
506 #define PA_SECTION_SHIFT (SECTION_SIZE_BITS)
507 #define PFN_SECTION_SHIFT (SECTION_SIZE_BITS - PAGE_SHIFT)
509 #define NR_MEM_SECTIONS (1UL << SECTIONS_SHIFT)
511 #define PAGES_PER_SECTION (1UL << PFN_SECTION_SHIFT)
512 #define PAGE_SECTION_MASK (~(PAGES_PER_SECTION-1))
514 #if (MAX_ORDER - 1 + PAGE_SHIFT) > SECTION_SIZE_BITS
515 #error Allocator MAX_ORDER exceeds SECTION_SIZE
521 * This is, logically, a pointer to an array of struct
522 * pages. However, it is stored with some other magic.
523 * (see sparse.c::sparse_init_one_section())
525 * Additionally during early boot we encode node id of
526 * the location of the section here to guide allocation.
527 * (see sparse.c::memory_present())
529 * Making it a UL at least makes someone do a cast
530 * before using it wrong.
532 unsigned long section_mem_map;
535 #ifdef CONFIG_SPARSEMEM_EXTREME
536 #define SECTIONS_PER_ROOT (PAGE_SIZE / sizeof (struct mem_section))
538 #define SECTIONS_PER_ROOT 1
541 #define SECTION_NR_TO_ROOT(sec) ((sec) / SECTIONS_PER_ROOT)
542 #define NR_SECTION_ROOTS (NR_MEM_SECTIONS / SECTIONS_PER_ROOT)
543 #define SECTION_ROOT_MASK (SECTIONS_PER_ROOT - 1)
545 #ifdef CONFIG_SPARSEMEM_EXTREME
546 extern struct mem_section *mem_section[NR_SECTION_ROOTS];
548 extern struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT];
551 static inline struct mem_section *__nr_to_section(unsigned long nr)
553 if (!mem_section[SECTION_NR_TO_ROOT(nr)])
555 return &mem_section[SECTION_NR_TO_ROOT(nr)][nr & SECTION_ROOT_MASK];
557 extern int __section_nr(struct mem_section* ms);
560 * We use the lower bits of the mem_map pointer to store
561 * a little bit of information. There should be at least
562 * 3 bits here due to 32-bit alignment.
564 #define SECTION_MARKED_PRESENT (1UL<<0)
565 #define SECTION_HAS_MEM_MAP (1UL<<1)
566 #define SECTION_MAP_LAST_BIT (1UL<<2)
567 #define SECTION_MAP_MASK (~(SECTION_MAP_LAST_BIT-1))
568 #define SECTION_NID_SHIFT 2
570 static inline struct page *__section_mem_map_addr(struct mem_section *section)
572 unsigned long map = section->section_mem_map;
573 map &= SECTION_MAP_MASK;
574 return (struct page *)map;
577 static inline int valid_section(struct mem_section *section)
579 return (section && (section->section_mem_map & SECTION_MARKED_PRESENT));
582 static inline int section_has_mem_map(struct mem_section *section)
584 return (section && (section->section_mem_map & SECTION_HAS_MEM_MAP));
587 static inline int valid_section_nr(unsigned long nr)
589 return valid_section(__nr_to_section(nr));
592 static inline struct mem_section *__pfn_to_section(unsigned long pfn)
594 return __nr_to_section(pfn_to_section_nr(pfn));
597 static inline int pfn_valid(unsigned long pfn)
599 if (pfn_to_section_nr(pfn) >= NR_MEM_SECTIONS)
601 return valid_section(__nr_to_section(pfn_to_section_nr(pfn)));
605 * These are _only_ used during initialisation, therefore they
606 * can use __initdata ... They could have names to indicate
610 #define pfn_to_nid(pfn) \
612 unsigned long __pfn_to_nid_pfn = (pfn); \
613 page_to_nid(pfn_to_page(__pfn_to_nid_pfn)); \
616 #define pfn_to_nid(pfn) (0)
619 #define early_pfn_valid(pfn) pfn_valid(pfn)
620 void sparse_init(void);
622 #define sparse_init() do {} while (0)
623 #define sparse_index_init(_sec, _nid) do {} while (0)
624 #endif /* CONFIG_SPARSEMEM */
626 #ifndef early_pfn_valid
627 #define early_pfn_valid(pfn) (1)
630 void memory_present(int nid, unsigned long start, unsigned long end);
631 unsigned long __init node_memmap_size_bytes(int, unsigned long, unsigned long);
633 #endif /* !__ASSEMBLY__ */
634 #endif /* __KERNEL__ */
635 #endif /* _LINUX_MMZONE_H */