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 */
61 NUMA_HIT, /* allocated in intended node */
62 NUMA_MISS, /* allocated in non intended node */
63 NUMA_FOREIGN, /* was intended here, hit elsewhere */
64 NUMA_INTERLEAVE_HIT, /* interleaver preferred this zone */
65 NUMA_LOCAL, /* allocation from local node */
66 NUMA_OTHER, /* allocation from other node */
68 NR_VM_ZONE_STAT_ITEMS };
70 struct per_cpu_pages {
71 int count; /* number of pages in the list */
72 int high; /* high watermark, emptying needed */
73 int batch; /* chunk size for buddy add/remove */
74 struct list_head list; /* the list of pages */
77 struct per_cpu_pageset {
78 struct per_cpu_pages pcp[2]; /* 0: hot. 1: cold */
81 s8 vm_stat_diff[NR_VM_ZONE_STAT_ITEMS];
83 } ____cacheline_aligned_in_smp;
86 #define zone_pcp(__z, __cpu) ((__z)->pageset[(__cpu)])
88 #define zone_pcp(__z, __cpu) (&(__z)->pageset[(__cpu)])
93 * ZONE_DMA is used when there are devices that are not able
94 * to do DMA to all of addressable memory (ZONE_NORMAL). Then we
95 * carve out the portion of memory that is needed for these devices.
96 * The range is arch specific.
101 * ---------------------------
102 * parisc, ia64, sparc <4G
106 * alpha Unlimited or 0-16MB.
108 * i386, x86_64 and multiple other arches
113 * x86_64 needs two ZONE_DMAs because it supports devices that are
114 * only able to do DMA to the lower 16M but also 32 bit devices that
115 * can only do DMA areas below 4G.
119 * Normal addressable memory is in ZONE_NORMAL. DMA operations can be
120 * performed on pages in ZONE_NORMAL if the DMA devices support
121 * transfers to all addressable memory.
125 * A memory area that is only addressable by the kernel through
126 * mapping portions into its own address space. This is for example
127 * used by i386 to allow the kernel to address the memory beyond
128 * 900MB. The kernel will set up special mappings (page
129 * table entries on i386) for each page that the kernel needs to
137 #define ZONES_SHIFT 2 /* ceil(log2(MAX_NR_ZONES)) */
140 * When a memory allocation must conform to specific limitations (such
141 * as being suitable for DMA) the caller will pass in hints to the
142 * allocator in the gfp_mask, in the zone modifier bits. These bits
143 * are used to select a priority ordered list of memory zones which
144 * match the requested limits. GFP_ZONEMASK defines which bits within
145 * the gfp_mask should be considered as zone modifiers. Each valid
146 * combination of the zone modifier bits has a corresponding list
147 * of zones (in node_zonelists). Thus for two zone modifiers there
148 * will be a maximum of 4 (2 ** 2) zonelists, for 3 modifiers there will
149 * be 8 (2 ** 3) zonelists. GFP_ZONETYPES defines the number of possible
150 * combinations of zone modifiers in "zone modifier space".
152 * As an optimisation any zone modifier bits which are only valid when
153 * no other zone modifier bits are set (loners) should be placed in
154 * the highest order bits of this field. This allows us to reduce the
155 * extent of the zonelists thus saving space. For example in the case
156 * of three zone modifier bits, we could require up to eight zonelists.
157 * If the left most zone modifier is a "loner" then the highest valid
158 * zonelist would be four allowing us to allocate only five zonelists.
159 * Use the first form for GFP_ZONETYPES when the left most bit is not
160 * a "loner", otherwise use the second.
162 * NOTE! Make sure this matches the zones in <linux/gfp.h>
164 #define GFP_ZONEMASK 0x07
165 /* #define GFP_ZONETYPES (GFP_ZONEMASK + 1) */ /* Non-loner */
166 #define GFP_ZONETYPES ((GFP_ZONEMASK + 1) / 2 + 1) /* Loner */
169 /* Fields commonly accessed by the page allocator */
170 unsigned long free_pages;
171 unsigned long pages_min, pages_low, pages_high;
173 * We don't know if the memory that we're going to allocate will be freeable
174 * or/and it will be released eventually, so to avoid totally wasting several
175 * GB of ram we must reserve some of the lower zone memory (otherwise we risk
176 * to run OOM on the lower zones despite there's tons of freeable ram
177 * on the higher zones). This array is recalculated at runtime if the
178 * sysctl_lowmem_reserve_ratio sysctl changes.
180 unsigned long lowmem_reserve[MAX_NR_ZONES];
184 * zone reclaim becomes active if more unmapped pages exist.
186 unsigned long min_unmapped_ratio;
187 struct per_cpu_pageset *pageset[NR_CPUS];
189 struct per_cpu_pageset pageset[NR_CPUS];
192 * free areas of different sizes
195 #ifdef CONFIG_MEMORY_HOTPLUG
196 /* see spanned/present_pages for more description */
197 seqlock_t span_seqlock;
199 struct free_area free_area[MAX_ORDER];
204 /* Fields commonly accessed by the page reclaim scanner */
206 struct list_head active_list;
207 struct list_head inactive_list;
208 unsigned long nr_scan_active;
209 unsigned long nr_scan_inactive;
210 unsigned long nr_active;
211 unsigned long nr_inactive;
212 unsigned long pages_scanned; /* since last reclaim */
213 int all_unreclaimable; /* All pages pinned */
215 /* A count of how many reclaimers are scanning this zone */
216 atomic_t reclaim_in_progress;
218 /* Zone statistics */
219 atomic_long_t vm_stat[NR_VM_ZONE_STAT_ITEMS];
222 * prev_priority holds the scanning priority for this zone. It is
223 * defined as the scanning priority at which we achieved our reclaim
224 * target at the previous try_to_free_pages() or balance_pgdat()
227 * We use prev_priority as a measure of how much stress page reclaim is
228 * under - it drives the swappiness decision: whether to unmap mapped
231 * temp_priority is used to remember the scanning priority at which
232 * this zone was successfully refilled to free_pages == pages_high.
234 * Access to both these fields is quite racy even on uniprocessor. But
235 * it is expected to average out OK.
242 /* Rarely used or read-mostly fields */
245 * wait_table -- the array holding the hash table
246 * wait_table_hash_nr_entries -- the size of the hash table array
247 * wait_table_bits -- wait_table_size == (1 << wait_table_bits)
249 * The purpose of all these is to keep track of the people
250 * waiting for a page to become available and make them
251 * runnable again when possible. The trouble is that this
252 * consumes a lot of space, especially when so few things
253 * wait on pages at a given time. So instead of using
254 * per-page waitqueues, we use a waitqueue hash table.
256 * The bucket discipline is to sleep on the same queue when
257 * colliding and wake all in that wait queue when removing.
258 * When something wakes, it must check to be sure its page is
259 * truly available, a la thundering herd. The cost of a
260 * collision is great, but given the expected load of the
261 * table, they should be so rare as to be outweighed by the
262 * benefits from the saved space.
264 * __wait_on_page_locked() and unlock_page() in mm/filemap.c, are the
265 * primary users of these fields, and in mm/page_alloc.c
266 * free_area_init_core() performs the initialization of them.
268 wait_queue_head_t * wait_table;
269 unsigned long wait_table_hash_nr_entries;
270 unsigned long wait_table_bits;
273 * Discontig memory support fields.
275 struct pglist_data *zone_pgdat;
276 /* zone_start_pfn == zone_start_paddr >> PAGE_SHIFT */
277 unsigned long zone_start_pfn;
280 * zone_start_pfn, spanned_pages and present_pages are all
281 * protected by span_seqlock. It is a seqlock because it has
282 * to be read outside of zone->lock, and it is done in the main
283 * allocator path. But, it is written quite infrequently.
285 * The lock is declared along with zone->lock because it is
286 * frequently read in proximity to zone->lock. It's good to
287 * give them a chance of being in the same cacheline.
289 unsigned long spanned_pages; /* total size, including holes */
290 unsigned long present_pages; /* amount of memory (excluding holes) */
293 * rarely used fields:
296 } ____cacheline_internodealigned_in_smp;
299 * The "priority" of VM scanning is how much of the queues we will scan in one
300 * go. A value of 12 for DEF_PRIORITY implies that we will scan 1/4096th of the
301 * queues ("queue_length >> 12") during an aging round.
303 #define DEF_PRIORITY 12
306 * One allocation request operates on a zonelist. A zonelist
307 * is a list of zones, the first one is the 'goal' of the
308 * allocation, the other zones are fallback zones, in decreasing
311 * Right now a zonelist takes up less than a cacheline. We never
312 * modify it apart from boot-up, and only a few indices are used,
313 * so despite the zonelist table being relatively big, the cache
314 * footprint of this construct is very small.
317 struct zone *zones[MAX_NUMNODES * MAX_NR_ZONES + 1]; // NULL delimited
322 * The pg_data_t structure is used in machines with CONFIG_DISCONTIGMEM
323 * (mostly NUMA machines?) to denote a higher-level memory zone than the
326 * On NUMA machines, each NUMA node would have a pg_data_t to describe
327 * it's memory layout.
329 * Memory statistics and page replacement data structures are maintained on a
333 typedef struct pglist_data {
334 struct zone node_zones[MAX_NR_ZONES];
335 struct zonelist node_zonelists[GFP_ZONETYPES];
337 #ifdef CONFIG_FLAT_NODE_MEM_MAP
338 struct page *node_mem_map;
340 struct bootmem_data *bdata;
341 #ifdef CONFIG_MEMORY_HOTPLUG
343 * Must be held any time you expect node_start_pfn, node_present_pages
344 * or node_spanned_pages stay constant. Holding this will also
345 * guarantee that any pfn_valid() stays that way.
347 * Nests above zone->lock and zone->size_seqlock.
349 spinlock_t node_size_lock;
351 unsigned long node_start_pfn;
352 unsigned long node_present_pages; /* total number of physical pages */
353 unsigned long node_spanned_pages; /* total size of physical page
354 range, including holes */
356 wait_queue_head_t kswapd_wait;
357 struct task_struct *kswapd;
358 int kswapd_max_order;
361 #define node_present_pages(nid) (NODE_DATA(nid)->node_present_pages)
362 #define node_spanned_pages(nid) (NODE_DATA(nid)->node_spanned_pages)
363 #ifdef CONFIG_FLAT_NODE_MEM_MAP
364 #define pgdat_page_nr(pgdat, pagenr) ((pgdat)->node_mem_map + (pagenr))
366 #define pgdat_page_nr(pgdat, pagenr) pfn_to_page((pgdat)->node_start_pfn + (pagenr))
368 #define nid_page_nr(nid, pagenr) pgdat_page_nr(NODE_DATA(nid),(pagenr))
370 #include <linux/memory_hotplug.h>
372 void __get_zone_counts(unsigned long *active, unsigned long *inactive,
373 unsigned long *free, struct pglist_data *pgdat);
374 void get_zone_counts(unsigned long *active, unsigned long *inactive,
375 unsigned long *free);
376 void build_all_zonelists(void);
377 void wakeup_kswapd(struct zone *zone, int order);
378 int zone_watermark_ok(struct zone *z, int order, unsigned long mark,
379 int classzone_idx, int alloc_flags);
381 extern int init_currently_empty_zone(struct zone *zone, unsigned long start_pfn,
384 #ifdef CONFIG_HAVE_MEMORY_PRESENT
385 void memory_present(int nid, unsigned long start, unsigned long end);
387 static inline void memory_present(int nid, unsigned long start, unsigned long end) {}
390 #ifdef CONFIG_NEED_NODE_MEMMAP_SIZE
391 unsigned long __init node_memmap_size_bytes(int, unsigned long, unsigned long);
395 * zone_idx() returns 0 for the ZONE_DMA zone, 1 for the ZONE_NORMAL zone, etc.
397 #define zone_idx(zone) ((zone) - (zone)->zone_pgdat->node_zones)
399 static inline int populated_zone(struct zone *zone)
401 return (!!zone->present_pages);
404 static inline int is_highmem_idx(enum zone_type idx)
406 return (idx == ZONE_HIGHMEM);
409 static inline int is_normal_idx(enum zone_type idx)
411 return (idx == ZONE_NORMAL);
415 * is_highmem - helper function to quickly check if a struct zone is a
416 * highmem zone or not. This is an attempt to keep references
417 * to ZONE_{DMA/NORMAL/HIGHMEM/etc} in general code to a minimum.
418 * @zone - pointer to struct zone variable
420 static inline int is_highmem(struct zone *zone)
422 return zone == zone->zone_pgdat->node_zones + ZONE_HIGHMEM;
425 static inline int is_normal(struct zone *zone)
427 return zone == zone->zone_pgdat->node_zones + ZONE_NORMAL;
430 static inline int is_dma32(struct zone *zone)
432 return zone == zone->zone_pgdat->node_zones + ZONE_DMA32;
435 static inline int is_dma(struct zone *zone)
437 return zone == zone->zone_pgdat->node_zones + ZONE_DMA;
440 /* These two functions are used to setup the per zone pages min values */
443 int min_free_kbytes_sysctl_handler(struct ctl_table *, int, struct file *,
444 void __user *, size_t *, loff_t *);
445 extern int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1];
446 int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *, int, struct file *,
447 void __user *, size_t *, loff_t *);
448 int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *, int, struct file *,
449 void __user *, size_t *, loff_t *);
450 int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *, int,
451 struct file *, void __user *, size_t *, loff_t *);
453 #include <linux/topology.h>
454 /* Returns the number of the current Node. */
456 #define numa_node_id() (cpu_to_node(raw_smp_processor_id()))
459 #ifndef CONFIG_NEED_MULTIPLE_NODES
461 extern struct pglist_data contig_page_data;
462 #define NODE_DATA(nid) (&contig_page_data)
463 #define NODE_MEM_MAP(nid) mem_map
464 #define MAX_NODES_SHIFT 1
466 #else /* CONFIG_NEED_MULTIPLE_NODES */
468 #include <asm/mmzone.h>
470 #endif /* !CONFIG_NEED_MULTIPLE_NODES */
472 extern struct pglist_data *first_online_pgdat(void);
473 extern struct pglist_data *next_online_pgdat(struct pglist_data *pgdat);
474 extern struct zone *next_zone(struct zone *zone);
477 * for_each_pgdat - helper macro to iterate over all nodes
478 * @pgdat - pointer to a pg_data_t variable
480 #define for_each_online_pgdat(pgdat) \
481 for (pgdat = first_online_pgdat(); \
483 pgdat = next_online_pgdat(pgdat))
485 * for_each_zone - helper macro to iterate over all memory zones
486 * @zone - pointer to struct zone variable
488 * The user only needs to declare the zone variable, for_each_zone
491 #define for_each_zone(zone) \
492 for (zone = (first_online_pgdat())->node_zones; \
494 zone = next_zone(zone))
496 #ifdef CONFIG_SPARSEMEM
497 #include <asm/sparsemem.h>
500 #if BITS_PER_LONG == 32
502 * with 32 bit page->flags field, we reserve 9 bits for node/zone info.
503 * there are 4 zones (3 bits) and this leaves 9-3=6 bits for nodes.
505 #define FLAGS_RESERVED 9
507 #elif BITS_PER_LONG == 64
509 * with 64 bit flags field, there's plenty of room.
511 #define FLAGS_RESERVED 32
515 #error BITS_PER_LONG not defined
519 #ifndef CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID
520 #define early_pfn_to_nid(nid) (0UL)
523 #ifdef CONFIG_FLATMEM
524 #define pfn_to_nid(pfn) (0)
527 #define pfn_to_section_nr(pfn) ((pfn) >> PFN_SECTION_SHIFT)
528 #define section_nr_to_pfn(sec) ((sec) << PFN_SECTION_SHIFT)
530 #ifdef CONFIG_SPARSEMEM
533 * SECTION_SHIFT #bits space required to store a section #
535 * PA_SECTION_SHIFT physical address to/from section number
536 * PFN_SECTION_SHIFT pfn to/from section number
538 #define SECTIONS_SHIFT (MAX_PHYSMEM_BITS - SECTION_SIZE_BITS)
540 #define PA_SECTION_SHIFT (SECTION_SIZE_BITS)
541 #define PFN_SECTION_SHIFT (SECTION_SIZE_BITS - PAGE_SHIFT)
543 #define NR_MEM_SECTIONS (1UL << SECTIONS_SHIFT)
545 #define PAGES_PER_SECTION (1UL << PFN_SECTION_SHIFT)
546 #define PAGE_SECTION_MASK (~(PAGES_PER_SECTION-1))
548 #if (MAX_ORDER - 1 + PAGE_SHIFT) > SECTION_SIZE_BITS
549 #error Allocator MAX_ORDER exceeds SECTION_SIZE
555 * This is, logically, a pointer to an array of struct
556 * pages. However, it is stored with some other magic.
557 * (see sparse.c::sparse_init_one_section())
559 * Additionally during early boot we encode node id of
560 * the location of the section here to guide allocation.
561 * (see sparse.c::memory_present())
563 * Making it a UL at least makes someone do a cast
564 * before using it wrong.
566 unsigned long section_mem_map;
569 #ifdef CONFIG_SPARSEMEM_EXTREME
570 #define SECTIONS_PER_ROOT (PAGE_SIZE / sizeof (struct mem_section))
572 #define SECTIONS_PER_ROOT 1
575 #define SECTION_NR_TO_ROOT(sec) ((sec) / SECTIONS_PER_ROOT)
576 #define NR_SECTION_ROOTS (NR_MEM_SECTIONS / SECTIONS_PER_ROOT)
577 #define SECTION_ROOT_MASK (SECTIONS_PER_ROOT - 1)
579 #ifdef CONFIG_SPARSEMEM_EXTREME
580 extern struct mem_section *mem_section[NR_SECTION_ROOTS];
582 extern struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT];
585 static inline struct mem_section *__nr_to_section(unsigned long nr)
587 if (!mem_section[SECTION_NR_TO_ROOT(nr)])
589 return &mem_section[SECTION_NR_TO_ROOT(nr)][nr & SECTION_ROOT_MASK];
591 extern int __section_nr(struct mem_section* ms);
594 * We use the lower bits of the mem_map pointer to store
595 * a little bit of information. There should be at least
596 * 3 bits here due to 32-bit alignment.
598 #define SECTION_MARKED_PRESENT (1UL<<0)
599 #define SECTION_HAS_MEM_MAP (1UL<<1)
600 #define SECTION_MAP_LAST_BIT (1UL<<2)
601 #define SECTION_MAP_MASK (~(SECTION_MAP_LAST_BIT-1))
602 #define SECTION_NID_SHIFT 2
604 static inline struct page *__section_mem_map_addr(struct mem_section *section)
606 unsigned long map = section->section_mem_map;
607 map &= SECTION_MAP_MASK;
608 return (struct page *)map;
611 static inline int valid_section(struct mem_section *section)
613 return (section && (section->section_mem_map & SECTION_MARKED_PRESENT));
616 static inline int section_has_mem_map(struct mem_section *section)
618 return (section && (section->section_mem_map & SECTION_HAS_MEM_MAP));
621 static inline int valid_section_nr(unsigned long nr)
623 return valid_section(__nr_to_section(nr));
626 static inline struct mem_section *__pfn_to_section(unsigned long pfn)
628 return __nr_to_section(pfn_to_section_nr(pfn));
631 static inline int pfn_valid(unsigned long pfn)
633 if (pfn_to_section_nr(pfn) >= NR_MEM_SECTIONS)
635 return valid_section(__nr_to_section(pfn_to_section_nr(pfn)));
639 * These are _only_ used during initialisation, therefore they
640 * can use __initdata ... They could have names to indicate
644 #define pfn_to_nid(pfn) \
646 unsigned long __pfn_to_nid_pfn = (pfn); \
647 page_to_nid(pfn_to_page(__pfn_to_nid_pfn)); \
650 #define pfn_to_nid(pfn) (0)
653 #define early_pfn_valid(pfn) pfn_valid(pfn)
654 void sparse_init(void);
656 #define sparse_init() do {} while (0)
657 #define sparse_index_init(_sec, _nid) do {} while (0)
658 #endif /* CONFIG_SPARSEMEM */
660 #ifndef early_pfn_valid
661 #define early_pfn_valid(pfn) (1)
664 void memory_present(int nid, unsigned long start, unsigned long end);
665 unsigned long __init node_memmap_size_bytes(int, unsigned long, unsigned long);
667 #endif /* !__ASSEMBLY__ */
668 #endif /* __KERNEL__ */
669 #endif /* _LINUX_MMZONE_H */