Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | #ifndef _LINUX_MMZONE_H |
2 | #define _LINUX_MMZONE_H | |
3 | ||
1da177e4 | 4 | #ifndef __ASSEMBLY__ |
97965478 | 5 | #ifndef __GENERATING_BOUNDS_H |
1da177e4 | 6 | |
1da177e4 LT |
7 | #include <linux/spinlock.h> |
8 | #include <linux/list.h> | |
9 | #include <linux/wait.h> | |
e815af95 | 10 | #include <linux/bitops.h> |
1da177e4 LT |
11 | #include <linux/cache.h> |
12 | #include <linux/threads.h> | |
13 | #include <linux/numa.h> | |
14 | #include <linux/init.h> | |
bdc8cb98 | 15 | #include <linux/seqlock.h> |
8357f869 | 16 | #include <linux/nodemask.h> |
835c134e | 17 | #include <linux/pageblock-flags.h> |
01fc0ac1 | 18 | #include <generated/bounds.h> |
60063497 | 19 | #include <linux/atomic.h> |
93ff66bf | 20 | #include <asm/page.h> |
1da177e4 LT |
21 | |
22 | /* Free memory management - zoned buddy allocator. */ | |
23 | #ifndef CONFIG_FORCE_MAX_ZONEORDER | |
24 | #define MAX_ORDER 11 | |
25 | #else | |
26 | #define MAX_ORDER CONFIG_FORCE_MAX_ZONEORDER | |
27 | #endif | |
e984bb43 | 28 | #define MAX_ORDER_NR_PAGES (1 << (MAX_ORDER - 1)) |
1da177e4 | 29 | |
5ad333eb AW |
30 | /* |
31 | * PAGE_ALLOC_COSTLY_ORDER is the order at which allocations are deemed | |
32 | * costly to service. That is between allocation orders which should | |
33 | * coelesce naturally under reasonable reclaim pressure and those which | |
34 | * will not. | |
35 | */ | |
36 | #define PAGE_ALLOC_COSTLY_ORDER 3 | |
37 | ||
b2a0ac88 | 38 | #define MIGRATE_UNMOVABLE 0 |
e12ba74d MG |
39 | #define MIGRATE_RECLAIMABLE 1 |
40 | #define MIGRATE_MOVABLE 2 | |
5f8dcc21 | 41 | #define MIGRATE_PCPTYPES 3 /* the number of types on the pcp lists */ |
64c5e135 | 42 | #define MIGRATE_RESERVE 3 |
a5d76b54 KH |
43 | #define MIGRATE_ISOLATE 4 /* can't allocate from here */ |
44 | #define MIGRATE_TYPES 5 | |
b2a0ac88 MG |
45 | |
46 | #define for_each_migratetype_order(order, type) \ | |
47 | for (order = 0; order < MAX_ORDER; order++) \ | |
48 | for (type = 0; type < MIGRATE_TYPES; type++) | |
49 | ||
467c996c MG |
50 | extern int page_group_by_mobility_disabled; |
51 | ||
52 | static inline int get_pageblock_migratetype(struct page *page) | |
53 | { | |
467c996c MG |
54 | return get_pageblock_flags_group(page, PB_migrate, PB_migrate_end); |
55 | } | |
56 | ||
1da177e4 | 57 | struct free_area { |
b2a0ac88 | 58 | struct list_head free_list[MIGRATE_TYPES]; |
1da177e4 LT |
59 | unsigned long nr_free; |
60 | }; | |
61 | ||
62 | struct pglist_data; | |
63 | ||
64 | /* | |
65 | * zone->lock and zone->lru_lock are two of the hottest locks in the kernel. | |
66 | * So add a wild amount of padding here to ensure that they fall into separate | |
67 | * cachelines. There are very few zone structures in the machine, so space | |
68 | * consumption is not a concern here. | |
69 | */ | |
70 | #if defined(CONFIG_SMP) | |
71 | struct zone_padding { | |
72 | char x[0]; | |
22fc6ecc | 73 | } ____cacheline_internodealigned_in_smp; |
1da177e4 LT |
74 | #define ZONE_PADDING(name) struct zone_padding name; |
75 | #else | |
76 | #define ZONE_PADDING(name) | |
77 | #endif | |
78 | ||
2244b95a | 79 | enum zone_stat_item { |
51ed4491 | 80 | /* First 128 byte cacheline (assuming 64 bit words) */ |
d23ad423 | 81 | NR_FREE_PAGES, |
b69408e8 | 82 | NR_LRU_BASE, |
4f98a2fe RR |
83 | NR_INACTIVE_ANON = NR_LRU_BASE, /* must match order of LRU_[IN]ACTIVE */ |
84 | NR_ACTIVE_ANON, /* " " " " " */ | |
85 | NR_INACTIVE_FILE, /* " " " " " */ | |
86 | NR_ACTIVE_FILE, /* " " " " " */ | |
894bc310 | 87 | NR_UNEVICTABLE, /* " " " " " */ |
5344b7e6 | 88 | NR_MLOCK, /* mlock()ed pages found and moved off LRU */ |
f3dbd344 CL |
89 | NR_ANON_PAGES, /* Mapped anonymous pages */ |
90 | NR_FILE_MAPPED, /* pagecache pages mapped into pagetables. | |
65ba55f5 | 91 | only modified from process context */ |
347ce434 | 92 | NR_FILE_PAGES, |
b1e7a8fd | 93 | NR_FILE_DIRTY, |
ce866b34 | 94 | NR_WRITEBACK, |
51ed4491 CL |
95 | NR_SLAB_RECLAIMABLE, |
96 | NR_SLAB_UNRECLAIMABLE, | |
97 | NR_PAGETABLE, /* used for pagetables */ | |
c6a7f572 KM |
98 | NR_KERNEL_STACK, |
99 | /* Second 128 byte cacheline */ | |
fd39fc85 | 100 | NR_UNSTABLE_NFS, /* NFS unstable pages */ |
d2c5e30c | 101 | NR_BOUNCE, |
e129b5c2 | 102 | NR_VMSCAN_WRITE, |
49ea7eb6 | 103 | NR_VMSCAN_IMMEDIATE, /* Prioritise for reclaim when writeback ends */ |
fc3ba692 | 104 | NR_WRITEBACK_TEMP, /* Writeback using temporary buffers */ |
a731286d KM |
105 | NR_ISOLATED_ANON, /* Temporary isolated pages from anon lru */ |
106 | NR_ISOLATED_FILE, /* Temporary isolated pages from file lru */ | |
4b02108a | 107 | NR_SHMEM, /* shmem pages (included tmpfs/GEM pages) */ |
ea941f0e MR |
108 | NR_DIRTIED, /* page dirtyings since bootup */ |
109 | NR_WRITTEN, /* page writings since bootup */ | |
ca889e6c CL |
110 | #ifdef CONFIG_NUMA |
111 | NUMA_HIT, /* allocated in intended node */ | |
112 | NUMA_MISS, /* allocated in non intended node */ | |
113 | NUMA_FOREIGN, /* was intended here, hit elsewhere */ | |
114 | NUMA_INTERLEAVE_HIT, /* interleaver preferred this zone */ | |
115 | NUMA_LOCAL, /* allocation from local node */ | |
116 | NUMA_OTHER, /* allocation from other node */ | |
117 | #endif | |
79134171 | 118 | NR_ANON_TRANSPARENT_HUGEPAGES, |
2244b95a CL |
119 | NR_VM_ZONE_STAT_ITEMS }; |
120 | ||
4f98a2fe RR |
121 | /* |
122 | * We do arithmetic on the LRU lists in various places in the code, | |
123 | * so it is important to keep the active lists LRU_ACTIVE higher in | |
124 | * the array than the corresponding inactive lists, and to keep | |
125 | * the *_FILE lists LRU_FILE higher than the corresponding _ANON lists. | |
126 | * | |
127 | * This has to be kept in sync with the statistics in zone_stat_item | |
128 | * above and the descriptions in vmstat_text in mm/vmstat.c | |
129 | */ | |
130 | #define LRU_BASE 0 | |
131 | #define LRU_ACTIVE 1 | |
132 | #define LRU_FILE 2 | |
133 | ||
b69408e8 | 134 | enum lru_list { |
4f98a2fe RR |
135 | LRU_INACTIVE_ANON = LRU_BASE, |
136 | LRU_ACTIVE_ANON = LRU_BASE + LRU_ACTIVE, | |
137 | LRU_INACTIVE_FILE = LRU_BASE + LRU_FILE, | |
138 | LRU_ACTIVE_FILE = LRU_BASE + LRU_FILE + LRU_ACTIVE, | |
894bc310 | 139 | LRU_UNEVICTABLE, |
894bc310 LS |
140 | NR_LRU_LISTS |
141 | }; | |
b69408e8 | 142 | |
4111304d | 143 | #define for_each_lru(lru) for (lru = 0; lru < NR_LRU_LISTS; lru++) |
b69408e8 | 144 | |
4111304d | 145 | #define for_each_evictable_lru(lru) for (lru = 0; lru <= LRU_ACTIVE_FILE; lru++) |
894bc310 | 146 | |
4111304d | 147 | static inline int is_file_lru(enum lru_list lru) |
4f98a2fe | 148 | { |
4111304d | 149 | return (lru == LRU_INACTIVE_FILE || lru == LRU_ACTIVE_FILE); |
4f98a2fe RR |
150 | } |
151 | ||
4111304d | 152 | static inline int is_active_lru(enum lru_list lru) |
b69408e8 | 153 | { |
4111304d | 154 | return (lru == LRU_ACTIVE_ANON || lru == LRU_ACTIVE_FILE); |
b69408e8 CL |
155 | } |
156 | ||
4111304d | 157 | static inline int is_unevictable_lru(enum lru_list lru) |
894bc310 | 158 | { |
4111304d | 159 | return (lru == LRU_UNEVICTABLE); |
894bc310 LS |
160 | } |
161 | ||
6290df54 JW |
162 | struct lruvec { |
163 | struct list_head lists[NR_LRU_LISTS]; | |
164 | }; | |
165 | ||
bb2a0de9 KH |
166 | /* Mask used at gathering information at once (see memcontrol.c) */ |
167 | #define LRU_ALL_FILE (BIT(LRU_INACTIVE_FILE) | BIT(LRU_ACTIVE_FILE)) | |
168 | #define LRU_ALL_ANON (BIT(LRU_INACTIVE_ANON) | BIT(LRU_ACTIVE_ANON)) | |
169 | #define LRU_ALL_EVICTABLE (LRU_ALL_FILE | LRU_ALL_ANON) | |
170 | #define LRU_ALL ((1 << NR_LRU_LISTS) - 1) | |
171 | ||
4356f21d MK |
172 | /* Isolate inactive pages */ |
173 | #define ISOLATE_INACTIVE ((__force isolate_mode_t)0x1) | |
174 | /* Isolate active pages */ | |
175 | #define ISOLATE_ACTIVE ((__force isolate_mode_t)0x2) | |
39deaf85 MK |
176 | /* Isolate clean file */ |
177 | #define ISOLATE_CLEAN ((__force isolate_mode_t)0x4) | |
f80c0673 MK |
178 | /* Isolate unmapped file */ |
179 | #define ISOLATE_UNMAPPED ((__force isolate_mode_t)0x8) | |
c8244935 MG |
180 | /* Isolate for asynchronous migration */ |
181 | #define ISOLATE_ASYNC_MIGRATE ((__force isolate_mode_t)0x10) | |
4356f21d MK |
182 | |
183 | /* LRU Isolation modes. */ | |
184 | typedef unsigned __bitwise__ isolate_mode_t; | |
185 | ||
41858966 MG |
186 | enum zone_watermarks { |
187 | WMARK_MIN, | |
188 | WMARK_LOW, | |
189 | WMARK_HIGH, | |
190 | NR_WMARK | |
191 | }; | |
192 | ||
193 | #define min_wmark_pages(z) (z->watermark[WMARK_MIN]) | |
194 | #define low_wmark_pages(z) (z->watermark[WMARK_LOW]) | |
195 | #define high_wmark_pages(z) (z->watermark[WMARK_HIGH]) | |
196 | ||
1da177e4 LT |
197 | struct per_cpu_pages { |
198 | int count; /* number of pages in the list */ | |
1da177e4 LT |
199 | int high; /* high watermark, emptying needed */ |
200 | int batch; /* chunk size for buddy add/remove */ | |
5f8dcc21 MG |
201 | |
202 | /* Lists of pages, one per migrate type stored on the pcp-lists */ | |
203 | struct list_head lists[MIGRATE_PCPTYPES]; | |
1da177e4 LT |
204 | }; |
205 | ||
206 | struct per_cpu_pageset { | |
3dfa5721 | 207 | struct per_cpu_pages pcp; |
4037d452 CL |
208 | #ifdef CONFIG_NUMA |
209 | s8 expire; | |
210 | #endif | |
2244b95a | 211 | #ifdef CONFIG_SMP |
df9ecaba | 212 | s8 stat_threshold; |
2244b95a CL |
213 | s8 vm_stat_diff[NR_VM_ZONE_STAT_ITEMS]; |
214 | #endif | |
99dcc3e5 | 215 | }; |
e7c8d5c9 | 216 | |
97965478 CL |
217 | #endif /* !__GENERATING_BOUNDS.H */ |
218 | ||
2f1b6248 | 219 | enum zone_type { |
4b51d669 | 220 | #ifdef CONFIG_ZONE_DMA |
2f1b6248 CL |
221 | /* |
222 | * ZONE_DMA is used when there are devices that are not able | |
223 | * to do DMA to all of addressable memory (ZONE_NORMAL). Then we | |
224 | * carve out the portion of memory that is needed for these devices. | |
225 | * The range is arch specific. | |
226 | * | |
227 | * Some examples | |
228 | * | |
229 | * Architecture Limit | |
230 | * --------------------------- | |
231 | * parisc, ia64, sparc <4G | |
232 | * s390 <2G | |
2f1b6248 CL |
233 | * arm Various |
234 | * alpha Unlimited or 0-16MB. | |
235 | * | |
236 | * i386, x86_64 and multiple other arches | |
237 | * <16M. | |
238 | */ | |
239 | ZONE_DMA, | |
4b51d669 | 240 | #endif |
fb0e7942 | 241 | #ifdef CONFIG_ZONE_DMA32 |
2f1b6248 CL |
242 | /* |
243 | * x86_64 needs two ZONE_DMAs because it supports devices that are | |
244 | * only able to do DMA to the lower 16M but also 32 bit devices that | |
245 | * can only do DMA areas below 4G. | |
246 | */ | |
247 | ZONE_DMA32, | |
fb0e7942 | 248 | #endif |
2f1b6248 CL |
249 | /* |
250 | * Normal addressable memory is in ZONE_NORMAL. DMA operations can be | |
251 | * performed on pages in ZONE_NORMAL if the DMA devices support | |
252 | * transfers to all addressable memory. | |
253 | */ | |
254 | ZONE_NORMAL, | |
e53ef38d | 255 | #ifdef CONFIG_HIGHMEM |
2f1b6248 CL |
256 | /* |
257 | * A memory area that is only addressable by the kernel through | |
258 | * mapping portions into its own address space. This is for example | |
259 | * used by i386 to allow the kernel to address the memory beyond | |
260 | * 900MB. The kernel will set up special mappings (page | |
261 | * table entries on i386) for each page that the kernel needs to | |
262 | * access. | |
263 | */ | |
264 | ZONE_HIGHMEM, | |
e53ef38d | 265 | #endif |
2a1e274a | 266 | ZONE_MOVABLE, |
97965478 | 267 | __MAX_NR_ZONES |
2f1b6248 | 268 | }; |
1da177e4 | 269 | |
97965478 CL |
270 | #ifndef __GENERATING_BOUNDS_H |
271 | ||
1da177e4 LT |
272 | /* |
273 | * When a memory allocation must conform to specific limitations (such | |
274 | * as being suitable for DMA) the caller will pass in hints to the | |
275 | * allocator in the gfp_mask, in the zone modifier bits. These bits | |
276 | * are used to select a priority ordered list of memory zones which | |
19655d34 | 277 | * match the requested limits. See gfp_zone() in include/linux/gfp.h |
1da177e4 | 278 | */ |
fb0e7942 | 279 | |
97965478 | 280 | #if MAX_NR_ZONES < 2 |
4b51d669 | 281 | #define ZONES_SHIFT 0 |
97965478 | 282 | #elif MAX_NR_ZONES <= 2 |
19655d34 | 283 | #define ZONES_SHIFT 1 |
97965478 | 284 | #elif MAX_NR_ZONES <= 4 |
19655d34 | 285 | #define ZONES_SHIFT 2 |
4b51d669 CL |
286 | #else |
287 | #error ZONES_SHIFT -- too many zones configured adjust calculation | |
fb0e7942 | 288 | #endif |
1da177e4 | 289 | |
6e901571 KM |
290 | struct zone_reclaim_stat { |
291 | /* | |
292 | * The pageout code in vmscan.c keeps track of how many of the | |
293 | * mem/swap backed and file backed pages are refeferenced. | |
294 | * The higher the rotated/scanned ratio, the more valuable | |
295 | * that cache is. | |
296 | * | |
297 | * The anon LRU stats live in [0], file LRU stats in [1] | |
298 | */ | |
299 | unsigned long recent_rotated[2]; | |
300 | unsigned long recent_scanned[2]; | |
301 | }; | |
302 | ||
1da177e4 LT |
303 | struct zone { |
304 | /* Fields commonly accessed by the page allocator */ | |
41858966 MG |
305 | |
306 | /* zone watermarks, access with *_wmark_pages(zone) macros */ | |
307 | unsigned long watermark[NR_WMARK]; | |
308 | ||
aa454840 CL |
309 | /* |
310 | * When free pages are below this point, additional steps are taken | |
311 | * when reading the number of free pages to avoid per-cpu counter | |
312 | * drift allowing watermarks to be breached | |
313 | */ | |
314 | unsigned long percpu_drift_mark; | |
315 | ||
1da177e4 LT |
316 | /* |
317 | * We don't know if the memory that we're going to allocate will be freeable | |
318 | * or/and it will be released eventually, so to avoid totally wasting several | |
319 | * GB of ram we must reserve some of the lower zone memory (otherwise we risk | |
320 | * to run OOM on the lower zones despite there's tons of freeable ram | |
321 | * on the higher zones). This array is recalculated at runtime if the | |
322 | * sysctl_lowmem_reserve_ratio sysctl changes. | |
323 | */ | |
324 | unsigned long lowmem_reserve[MAX_NR_ZONES]; | |
325 | ||
ab8fabd4 JW |
326 | /* |
327 | * This is a per-zone reserve of pages that should not be | |
328 | * considered dirtyable memory. | |
329 | */ | |
330 | unsigned long dirty_balance_reserve; | |
331 | ||
e7c8d5c9 | 332 | #ifdef CONFIG_NUMA |
d5f541ed | 333 | int node; |
9614634f CL |
334 | /* |
335 | * zone reclaim becomes active if more unmapped pages exist. | |
336 | */ | |
8417bba4 | 337 | unsigned long min_unmapped_pages; |
0ff38490 | 338 | unsigned long min_slab_pages; |
e7c8d5c9 | 339 | #endif |
43cf38eb | 340 | struct per_cpu_pageset __percpu *pageset; |
1da177e4 LT |
341 | /* |
342 | * free areas of different sizes | |
343 | */ | |
344 | spinlock_t lock; | |
93e4a89a | 345 | int all_unreclaimable; /* All pages pinned */ |
bdc8cb98 DH |
346 | #ifdef CONFIG_MEMORY_HOTPLUG |
347 | /* see spanned/present_pages for more description */ | |
348 | seqlock_t span_seqlock; | |
349 | #endif | |
1da177e4 LT |
350 | struct free_area free_area[MAX_ORDER]; |
351 | ||
835c134e MG |
352 | #ifndef CONFIG_SPARSEMEM |
353 | /* | |
d9c23400 | 354 | * Flags for a pageblock_nr_pages block. See pageblock-flags.h. |
835c134e MG |
355 | * In SPARSEMEM, this map is stored in struct mem_section |
356 | */ | |
357 | unsigned long *pageblock_flags; | |
358 | #endif /* CONFIG_SPARSEMEM */ | |
359 | ||
4f92e258 MG |
360 | #ifdef CONFIG_COMPACTION |
361 | /* | |
362 | * On compaction failure, 1<<compact_defer_shift compactions | |
363 | * are skipped before trying again. The number attempted since | |
364 | * last failure is tracked with compact_considered. | |
365 | */ | |
366 | unsigned int compact_considered; | |
367 | unsigned int compact_defer_shift; | |
aff62249 | 368 | int compact_order_failed; |
4f92e258 | 369 | #endif |
1da177e4 LT |
370 | |
371 | ZONE_PADDING(_pad1_) | |
372 | ||
373 | /* Fields commonly accessed by the page reclaim scanner */ | |
6290df54 JW |
374 | spinlock_t lru_lock; |
375 | struct lruvec lruvec; | |
4f98a2fe | 376 | |
6e901571 | 377 | struct zone_reclaim_stat reclaim_stat; |
4f98a2fe | 378 | |
1da177e4 | 379 | unsigned long pages_scanned; /* since last reclaim */ |
e815af95 | 380 | unsigned long flags; /* zone flags, see below */ |
753ee728 | 381 | |
2244b95a CL |
382 | /* Zone statistics */ |
383 | atomic_long_t vm_stat[NR_VM_ZONE_STAT_ITEMS]; | |
9eeff239 | 384 | |
556adecb RR |
385 | /* |
386 | * The target ratio of ACTIVE_ANON to INACTIVE_ANON pages on | |
387 | * this zone's LRU. Maintained by the pageout code. | |
388 | */ | |
389 | unsigned int inactive_ratio; | |
390 | ||
1da177e4 LT |
391 | |
392 | ZONE_PADDING(_pad2_) | |
393 | /* Rarely used or read-mostly fields */ | |
394 | ||
395 | /* | |
396 | * wait_table -- the array holding the hash table | |
02b694de | 397 | * wait_table_hash_nr_entries -- the size of the hash table array |
1da177e4 LT |
398 | * wait_table_bits -- wait_table_size == (1 << wait_table_bits) |
399 | * | |
400 | * The purpose of all these is to keep track of the people | |
401 | * waiting for a page to become available and make them | |
402 | * runnable again when possible. The trouble is that this | |
403 | * consumes a lot of space, especially when so few things | |
404 | * wait on pages at a given time. So instead of using | |
405 | * per-page waitqueues, we use a waitqueue hash table. | |
406 | * | |
407 | * The bucket discipline is to sleep on the same queue when | |
408 | * colliding and wake all in that wait queue when removing. | |
409 | * When something wakes, it must check to be sure its page is | |
410 | * truly available, a la thundering herd. The cost of a | |
411 | * collision is great, but given the expected load of the | |
412 | * table, they should be so rare as to be outweighed by the | |
413 | * benefits from the saved space. | |
414 | * | |
415 | * __wait_on_page_locked() and unlock_page() in mm/filemap.c, are the | |
416 | * primary users of these fields, and in mm/page_alloc.c | |
417 | * free_area_init_core() performs the initialization of them. | |
418 | */ | |
419 | wait_queue_head_t * wait_table; | |
02b694de | 420 | unsigned long wait_table_hash_nr_entries; |
1da177e4 LT |
421 | unsigned long wait_table_bits; |
422 | ||
423 | /* | |
424 | * Discontig memory support fields. | |
425 | */ | |
426 | struct pglist_data *zone_pgdat; | |
1da177e4 LT |
427 | /* zone_start_pfn == zone_start_paddr >> PAGE_SHIFT */ |
428 | unsigned long zone_start_pfn; | |
429 | ||
bdc8cb98 DH |
430 | /* |
431 | * zone_start_pfn, spanned_pages and present_pages are all | |
432 | * protected by span_seqlock. It is a seqlock because it has | |
433 | * to be read outside of zone->lock, and it is done in the main | |
434 | * allocator path. But, it is written quite infrequently. | |
435 | * | |
436 | * The lock is declared along with zone->lock because it is | |
437 | * frequently read in proximity to zone->lock. It's good to | |
438 | * give them a chance of being in the same cacheline. | |
439 | */ | |
1da177e4 LT |
440 | unsigned long spanned_pages; /* total size, including holes */ |
441 | unsigned long present_pages; /* amount of memory (excluding holes) */ | |
442 | ||
443 | /* | |
444 | * rarely used fields: | |
445 | */ | |
15ad7cdc | 446 | const char *name; |
22fc6ecc | 447 | } ____cacheline_internodealigned_in_smp; |
1da177e4 | 448 | |
e815af95 | 449 | typedef enum { |
e815af95 | 450 | ZONE_RECLAIM_LOCKED, /* prevents concurrent reclaim */ |
098d7f12 | 451 | ZONE_OOM_LOCKED, /* zone is in OOM killer zonelist */ |
0e093d99 MG |
452 | ZONE_CONGESTED, /* zone has many dirty pages backed by |
453 | * a congested BDI | |
454 | */ | |
e815af95 DR |
455 | } zone_flags_t; |
456 | ||
457 | static inline void zone_set_flag(struct zone *zone, zone_flags_t flag) | |
458 | { | |
459 | set_bit(flag, &zone->flags); | |
460 | } | |
d773ed6b DR |
461 | |
462 | static inline int zone_test_and_set_flag(struct zone *zone, zone_flags_t flag) | |
463 | { | |
464 | return test_and_set_bit(flag, &zone->flags); | |
465 | } | |
466 | ||
e815af95 DR |
467 | static inline void zone_clear_flag(struct zone *zone, zone_flags_t flag) |
468 | { | |
469 | clear_bit(flag, &zone->flags); | |
470 | } | |
471 | ||
0e093d99 MG |
472 | static inline int zone_is_reclaim_congested(const struct zone *zone) |
473 | { | |
474 | return test_bit(ZONE_CONGESTED, &zone->flags); | |
475 | } | |
476 | ||
e815af95 DR |
477 | static inline int zone_is_reclaim_locked(const struct zone *zone) |
478 | { | |
479 | return test_bit(ZONE_RECLAIM_LOCKED, &zone->flags); | |
480 | } | |
d773ed6b | 481 | |
098d7f12 DR |
482 | static inline int zone_is_oom_locked(const struct zone *zone) |
483 | { | |
484 | return test_bit(ZONE_OOM_LOCKED, &zone->flags); | |
485 | } | |
e815af95 | 486 | |
1da177e4 LT |
487 | /* |
488 | * The "priority" of VM scanning is how much of the queues we will scan in one | |
489 | * go. A value of 12 for DEF_PRIORITY implies that we will scan 1/4096th of the | |
490 | * queues ("queue_length >> 12") during an aging round. | |
491 | */ | |
492 | #define DEF_PRIORITY 12 | |
493 | ||
9276b1bc PJ |
494 | /* Maximum number of zones on a zonelist */ |
495 | #define MAX_ZONES_PER_ZONELIST (MAX_NUMNODES * MAX_NR_ZONES) | |
496 | ||
497 | #ifdef CONFIG_NUMA | |
523b9458 CL |
498 | |
499 | /* | |
25a64ec1 | 500 | * The NUMA zonelists are doubled because we need zonelists that restrict the |
523b9458 CL |
501 | * allocations to a single node for GFP_THISNODE. |
502 | * | |
54a6eb5c MG |
503 | * [0] : Zonelist with fallback |
504 | * [1] : No fallback (GFP_THISNODE) | |
523b9458 | 505 | */ |
54a6eb5c | 506 | #define MAX_ZONELISTS 2 |
523b9458 CL |
507 | |
508 | ||
9276b1bc PJ |
509 | /* |
510 | * We cache key information from each zonelist for smaller cache | |
511 | * footprint when scanning for free pages in get_page_from_freelist(). | |
512 | * | |
513 | * 1) The BITMAP fullzones tracks which zones in a zonelist have come | |
514 | * up short of free memory since the last time (last_fullzone_zap) | |
515 | * we zero'd fullzones. | |
516 | * 2) The array z_to_n[] maps each zone in the zonelist to its node | |
517 | * id, so that we can efficiently evaluate whether that node is | |
518 | * set in the current tasks mems_allowed. | |
519 | * | |
520 | * Both fullzones and z_to_n[] are one-to-one with the zonelist, | |
521 | * indexed by a zones offset in the zonelist zones[] array. | |
522 | * | |
523 | * The get_page_from_freelist() routine does two scans. During the | |
524 | * first scan, we skip zones whose corresponding bit in 'fullzones' | |
525 | * is set or whose corresponding node in current->mems_allowed (which | |
526 | * comes from cpusets) is not set. During the second scan, we bypass | |
527 | * this zonelist_cache, to ensure we look methodically at each zone. | |
528 | * | |
529 | * Once per second, we zero out (zap) fullzones, forcing us to | |
530 | * reconsider nodes that might have regained more free memory. | |
531 | * The field last_full_zap is the time we last zapped fullzones. | |
532 | * | |
533 | * This mechanism reduces the amount of time we waste repeatedly | |
534 | * reexaming zones for free memory when they just came up low on | |
535 | * memory momentarilly ago. | |
536 | * | |
537 | * The zonelist_cache struct members logically belong in struct | |
538 | * zonelist. However, the mempolicy zonelists constructed for | |
539 | * MPOL_BIND are intentionally variable length (and usually much | |
540 | * shorter). A general purpose mechanism for handling structs with | |
541 | * multiple variable length members is more mechanism than we want | |
542 | * here. We resort to some special case hackery instead. | |
543 | * | |
544 | * The MPOL_BIND zonelists don't need this zonelist_cache (in good | |
545 | * part because they are shorter), so we put the fixed length stuff | |
546 | * at the front of the zonelist struct, ending in a variable length | |
547 | * zones[], as is needed by MPOL_BIND. | |
548 | * | |
549 | * Then we put the optional zonelist cache on the end of the zonelist | |
550 | * struct. This optional stuff is found by a 'zlcache_ptr' pointer in | |
551 | * the fixed length portion at the front of the struct. This pointer | |
552 | * both enables us to find the zonelist cache, and in the case of | |
553 | * MPOL_BIND zonelists, (which will just set the zlcache_ptr to NULL) | |
554 | * to know that the zonelist cache is not there. | |
555 | * | |
556 | * The end result is that struct zonelists come in two flavors: | |
557 | * 1) The full, fixed length version, shown below, and | |
558 | * 2) The custom zonelists for MPOL_BIND. | |
559 | * The custom MPOL_BIND zonelists have a NULL zlcache_ptr and no zlcache. | |
560 | * | |
561 | * Even though there may be multiple CPU cores on a node modifying | |
562 | * fullzones or last_full_zap in the same zonelist_cache at the same | |
563 | * time, we don't lock it. This is just hint data - if it is wrong now | |
564 | * and then, the allocator will still function, perhaps a bit slower. | |
565 | */ | |
566 | ||
567 | ||
568 | struct zonelist_cache { | |
9276b1bc | 569 | unsigned short z_to_n[MAX_ZONES_PER_ZONELIST]; /* zone->nid */ |
7253f4ef | 570 | DECLARE_BITMAP(fullzones, MAX_ZONES_PER_ZONELIST); /* zone full? */ |
9276b1bc PJ |
571 | unsigned long last_full_zap; /* when last zap'd (jiffies) */ |
572 | }; | |
573 | #else | |
54a6eb5c | 574 | #define MAX_ZONELISTS 1 |
9276b1bc PJ |
575 | struct zonelist_cache; |
576 | #endif | |
577 | ||
dd1a239f MG |
578 | /* |
579 | * This struct contains information about a zone in a zonelist. It is stored | |
580 | * here to avoid dereferences into large structures and lookups of tables | |
581 | */ | |
582 | struct zoneref { | |
583 | struct zone *zone; /* Pointer to actual zone */ | |
584 | int zone_idx; /* zone_idx(zoneref->zone) */ | |
585 | }; | |
586 | ||
1da177e4 LT |
587 | /* |
588 | * One allocation request operates on a zonelist. A zonelist | |
589 | * is a list of zones, the first one is the 'goal' of the | |
590 | * allocation, the other zones are fallback zones, in decreasing | |
591 | * priority. | |
592 | * | |
9276b1bc PJ |
593 | * If zlcache_ptr is not NULL, then it is just the address of zlcache, |
594 | * as explained above. If zlcache_ptr is NULL, there is no zlcache. | |
dd1a239f MG |
595 | * * |
596 | * To speed the reading of the zonelist, the zonerefs contain the zone index | |
597 | * of the entry being read. Helper functions to access information given | |
598 | * a struct zoneref are | |
599 | * | |
600 | * zonelist_zone() - Return the struct zone * for an entry in _zonerefs | |
601 | * zonelist_zone_idx() - Return the index of the zone for an entry | |
602 | * zonelist_node_idx() - Return the index of the node for an entry | |
1da177e4 LT |
603 | */ |
604 | struct zonelist { | |
9276b1bc | 605 | struct zonelist_cache *zlcache_ptr; // NULL or &zlcache |
dd1a239f | 606 | struct zoneref _zonerefs[MAX_ZONES_PER_ZONELIST + 1]; |
9276b1bc PJ |
607 | #ifdef CONFIG_NUMA |
608 | struct zonelist_cache zlcache; // optional ... | |
609 | #endif | |
1da177e4 LT |
610 | }; |
611 | ||
0ee332c1 | 612 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
c713216d MG |
613 | struct node_active_region { |
614 | unsigned long start_pfn; | |
615 | unsigned long end_pfn; | |
616 | int nid; | |
617 | }; | |
0ee332c1 | 618 | #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ |
1da177e4 | 619 | |
5b99cd0e HC |
620 | #ifndef CONFIG_DISCONTIGMEM |
621 | /* The array of struct pages - for discontigmem use pgdat->lmem_map */ | |
622 | extern struct page *mem_map; | |
623 | #endif | |
624 | ||
1da177e4 LT |
625 | /* |
626 | * The pg_data_t structure is used in machines with CONFIG_DISCONTIGMEM | |
627 | * (mostly NUMA machines?) to denote a higher-level memory zone than the | |
628 | * zone denotes. | |
629 | * | |
630 | * On NUMA machines, each NUMA node would have a pg_data_t to describe | |
631 | * it's memory layout. | |
632 | * | |
633 | * Memory statistics and page replacement data structures are maintained on a | |
634 | * per-zone basis. | |
635 | */ | |
636 | struct bootmem_data; | |
637 | typedef struct pglist_data { | |
638 | struct zone node_zones[MAX_NR_ZONES]; | |
523b9458 | 639 | struct zonelist node_zonelists[MAX_ZONELISTS]; |
1da177e4 | 640 | int nr_zones; |
52d4b9ac | 641 | #ifdef CONFIG_FLAT_NODE_MEM_MAP /* means !SPARSEMEM */ |
1da177e4 | 642 | struct page *node_mem_map; |
52d4b9ac KH |
643 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR |
644 | struct page_cgroup *node_page_cgroup; | |
645 | #endif | |
d41dee36 | 646 | #endif |
08677214 | 647 | #ifndef CONFIG_NO_BOOTMEM |
1da177e4 | 648 | struct bootmem_data *bdata; |
08677214 | 649 | #endif |
208d54e5 DH |
650 | #ifdef CONFIG_MEMORY_HOTPLUG |
651 | /* | |
652 | * Must be held any time you expect node_start_pfn, node_present_pages | |
653 | * or node_spanned_pages stay constant. Holding this will also | |
654 | * guarantee that any pfn_valid() stays that way. | |
655 | * | |
656 | * Nests above zone->lock and zone->size_seqlock. | |
657 | */ | |
658 | spinlock_t node_size_lock; | |
659 | #endif | |
1da177e4 LT |
660 | unsigned long node_start_pfn; |
661 | unsigned long node_present_pages; /* total number of physical pages */ | |
662 | unsigned long node_spanned_pages; /* total size of physical page | |
663 | range, including holes */ | |
664 | int node_id; | |
1da177e4 LT |
665 | wait_queue_head_t kswapd_wait; |
666 | struct task_struct *kswapd; | |
667 | int kswapd_max_order; | |
99504748 | 668 | enum zone_type classzone_idx; |
1da177e4 LT |
669 | } pg_data_t; |
670 | ||
671 | #define node_present_pages(nid) (NODE_DATA(nid)->node_present_pages) | |
672 | #define node_spanned_pages(nid) (NODE_DATA(nid)->node_spanned_pages) | |
d41dee36 | 673 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
408fde81 | 674 | #define pgdat_page_nr(pgdat, pagenr) ((pgdat)->node_mem_map + (pagenr)) |
d41dee36 AW |
675 | #else |
676 | #define pgdat_page_nr(pgdat, pagenr) pfn_to_page((pgdat)->node_start_pfn + (pagenr)) | |
677 | #endif | |
408fde81 | 678 | #define nid_page_nr(nid, pagenr) pgdat_page_nr(NODE_DATA(nid),(pagenr)) |
1da177e4 | 679 | |
c6830c22 KH |
680 | #define node_start_pfn(nid) (NODE_DATA(nid)->node_start_pfn) |
681 | ||
682 | #define node_end_pfn(nid) ({\ | |
683 | pg_data_t *__pgdat = NODE_DATA(nid);\ | |
684 | __pgdat->node_start_pfn + __pgdat->node_spanned_pages;\ | |
685 | }) | |
686 | ||
208d54e5 DH |
687 | #include <linux/memory_hotplug.h> |
688 | ||
4eaf3f64 | 689 | extern struct mutex zonelists_mutex; |
1f522509 | 690 | void build_all_zonelists(void *data); |
99504748 | 691 | void wakeup_kswapd(struct zone *zone, int order, enum zone_type classzone_idx); |
88f5acf8 MG |
692 | bool zone_watermark_ok(struct zone *z, int order, unsigned long mark, |
693 | int classzone_idx, int alloc_flags); | |
694 | bool zone_watermark_ok_safe(struct zone *z, int order, unsigned long mark, | |
7fb1d9fc | 695 | int classzone_idx, int alloc_flags); |
a2f3aa02 DH |
696 | enum memmap_context { |
697 | MEMMAP_EARLY, | |
698 | MEMMAP_HOTPLUG, | |
699 | }; | |
718127cc | 700 | extern int init_currently_empty_zone(struct zone *zone, unsigned long start_pfn, |
a2f3aa02 DH |
701 | unsigned long size, |
702 | enum memmap_context context); | |
718127cc | 703 | |
1da177e4 LT |
704 | #ifdef CONFIG_HAVE_MEMORY_PRESENT |
705 | void memory_present(int nid, unsigned long start, unsigned long end); | |
706 | #else | |
707 | static inline void memory_present(int nid, unsigned long start, unsigned long end) {} | |
708 | #endif | |
709 | ||
7aac7898 LS |
710 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
711 | int local_memory_node(int node_id); | |
712 | #else | |
713 | static inline int local_memory_node(int node_id) { return node_id; }; | |
714 | #endif | |
715 | ||
1da177e4 LT |
716 | #ifdef CONFIG_NEED_NODE_MEMMAP_SIZE |
717 | unsigned long __init node_memmap_size_bytes(int, unsigned long, unsigned long); | |
718 | #endif | |
719 | ||
720 | /* | |
721 | * zone_idx() returns 0 for the ZONE_DMA zone, 1 for the ZONE_NORMAL zone, etc. | |
722 | */ | |
723 | #define zone_idx(zone) ((zone) - (zone)->zone_pgdat->node_zones) | |
724 | ||
f3fe6512 CK |
725 | static inline int populated_zone(struct zone *zone) |
726 | { | |
727 | return (!!zone->present_pages); | |
728 | } | |
729 | ||
2a1e274a MG |
730 | extern int movable_zone; |
731 | ||
732 | static inline int zone_movable_is_highmem(void) | |
733 | { | |
0ee332c1 | 734 | #if defined(CONFIG_HIGHMEM) && defined(CONFIG_HAVE_MEMBLOCK_NODE) |
2a1e274a MG |
735 | return movable_zone == ZONE_HIGHMEM; |
736 | #else | |
737 | return 0; | |
738 | #endif | |
739 | } | |
740 | ||
2f1b6248 | 741 | static inline int is_highmem_idx(enum zone_type idx) |
1da177e4 | 742 | { |
e53ef38d | 743 | #ifdef CONFIG_HIGHMEM |
2a1e274a MG |
744 | return (idx == ZONE_HIGHMEM || |
745 | (idx == ZONE_MOVABLE && zone_movable_is_highmem())); | |
e53ef38d CL |
746 | #else |
747 | return 0; | |
748 | #endif | |
1da177e4 LT |
749 | } |
750 | ||
2f1b6248 | 751 | static inline int is_normal_idx(enum zone_type idx) |
1da177e4 LT |
752 | { |
753 | return (idx == ZONE_NORMAL); | |
754 | } | |
9328b8fa | 755 | |
1da177e4 LT |
756 | /** |
757 | * is_highmem - helper function to quickly check if a struct zone is a | |
758 | * highmem zone or not. This is an attempt to keep references | |
759 | * to ZONE_{DMA/NORMAL/HIGHMEM/etc} in general code to a minimum. | |
760 | * @zone - pointer to struct zone variable | |
761 | */ | |
762 | static inline int is_highmem(struct zone *zone) | |
763 | { | |
e53ef38d | 764 | #ifdef CONFIG_HIGHMEM |
ddc81ed2 HH |
765 | int zone_off = (char *)zone - (char *)zone->zone_pgdat->node_zones; |
766 | return zone_off == ZONE_HIGHMEM * sizeof(*zone) || | |
767 | (zone_off == ZONE_MOVABLE * sizeof(*zone) && | |
768 | zone_movable_is_highmem()); | |
e53ef38d CL |
769 | #else |
770 | return 0; | |
771 | #endif | |
1da177e4 LT |
772 | } |
773 | ||
774 | static inline int is_normal(struct zone *zone) | |
775 | { | |
776 | return zone == zone->zone_pgdat->node_zones + ZONE_NORMAL; | |
777 | } | |
778 | ||
9328b8fa NP |
779 | static inline int is_dma32(struct zone *zone) |
780 | { | |
fb0e7942 | 781 | #ifdef CONFIG_ZONE_DMA32 |
9328b8fa | 782 | return zone == zone->zone_pgdat->node_zones + ZONE_DMA32; |
fb0e7942 CL |
783 | #else |
784 | return 0; | |
785 | #endif | |
9328b8fa NP |
786 | } |
787 | ||
788 | static inline int is_dma(struct zone *zone) | |
789 | { | |
4b51d669 | 790 | #ifdef CONFIG_ZONE_DMA |
9328b8fa | 791 | return zone == zone->zone_pgdat->node_zones + ZONE_DMA; |
4b51d669 CL |
792 | #else |
793 | return 0; | |
794 | #endif | |
9328b8fa NP |
795 | } |
796 | ||
1da177e4 LT |
797 | /* These two functions are used to setup the per zone pages min values */ |
798 | struct ctl_table; | |
8d65af78 | 799 | int min_free_kbytes_sysctl_handler(struct ctl_table *, int, |
1da177e4 LT |
800 | void __user *, size_t *, loff_t *); |
801 | extern int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES-1]; | |
8d65af78 | 802 | int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *, int, |
1da177e4 | 803 | void __user *, size_t *, loff_t *); |
8d65af78 | 804 | int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *, int, |
8ad4b1fb | 805 | void __user *, size_t *, loff_t *); |
9614634f | 806 | int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *, int, |
8d65af78 | 807 | void __user *, size_t *, loff_t *); |
0ff38490 | 808 | int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *, int, |
8d65af78 | 809 | void __user *, size_t *, loff_t *); |
1da177e4 | 810 | |
f0c0b2b8 | 811 | extern int numa_zonelist_order_handler(struct ctl_table *, int, |
8d65af78 | 812 | void __user *, size_t *, loff_t *); |
f0c0b2b8 KH |
813 | extern char numa_zonelist_order[]; |
814 | #define NUMA_ZONELIST_ORDER_LEN 16 /* string buffer size */ | |
815 | ||
93b7504e | 816 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
1da177e4 LT |
817 | |
818 | extern struct pglist_data contig_page_data; | |
819 | #define NODE_DATA(nid) (&contig_page_data) | |
820 | #define NODE_MEM_MAP(nid) mem_map | |
1da177e4 | 821 | |
93b7504e | 822 | #else /* CONFIG_NEED_MULTIPLE_NODES */ |
1da177e4 LT |
823 | |
824 | #include <asm/mmzone.h> | |
825 | ||
93b7504e | 826 | #endif /* !CONFIG_NEED_MULTIPLE_NODES */ |
348f8b6c | 827 | |
95144c78 KH |
828 | extern struct pglist_data *first_online_pgdat(void); |
829 | extern struct pglist_data *next_online_pgdat(struct pglist_data *pgdat); | |
830 | extern struct zone *next_zone(struct zone *zone); | |
8357f869 KH |
831 | |
832 | /** | |
12d15f0d | 833 | * for_each_online_pgdat - helper macro to iterate over all online nodes |
8357f869 KH |
834 | * @pgdat - pointer to a pg_data_t variable |
835 | */ | |
836 | #define for_each_online_pgdat(pgdat) \ | |
837 | for (pgdat = first_online_pgdat(); \ | |
838 | pgdat; \ | |
839 | pgdat = next_online_pgdat(pgdat)) | |
8357f869 KH |
840 | /** |
841 | * for_each_zone - helper macro to iterate over all memory zones | |
842 | * @zone - pointer to struct zone variable | |
843 | * | |
844 | * The user only needs to declare the zone variable, for_each_zone | |
845 | * fills it in. | |
846 | */ | |
847 | #define for_each_zone(zone) \ | |
848 | for (zone = (first_online_pgdat())->node_zones; \ | |
849 | zone; \ | |
850 | zone = next_zone(zone)) | |
851 | ||
ee99c71c KM |
852 | #define for_each_populated_zone(zone) \ |
853 | for (zone = (first_online_pgdat())->node_zones; \ | |
854 | zone; \ | |
855 | zone = next_zone(zone)) \ | |
856 | if (!populated_zone(zone)) \ | |
857 | ; /* do nothing */ \ | |
858 | else | |
859 | ||
dd1a239f MG |
860 | static inline struct zone *zonelist_zone(struct zoneref *zoneref) |
861 | { | |
862 | return zoneref->zone; | |
863 | } | |
864 | ||
865 | static inline int zonelist_zone_idx(struct zoneref *zoneref) | |
866 | { | |
867 | return zoneref->zone_idx; | |
868 | } | |
869 | ||
870 | static inline int zonelist_node_idx(struct zoneref *zoneref) | |
871 | { | |
872 | #ifdef CONFIG_NUMA | |
873 | /* zone_to_nid not available in this context */ | |
874 | return zoneref->zone->node; | |
875 | #else | |
876 | return 0; | |
877 | #endif /* CONFIG_NUMA */ | |
878 | } | |
879 | ||
19770b32 MG |
880 | /** |
881 | * next_zones_zonelist - Returns the next zone at or below highest_zoneidx within the allowed nodemask using a cursor within a zonelist as a starting point | |
882 | * @z - The cursor used as a starting point for the search | |
883 | * @highest_zoneidx - The zone index of the highest zone to return | |
884 | * @nodes - An optional nodemask to filter the zonelist with | |
885 | * @zone - The first suitable zone found is returned via this parameter | |
886 | * | |
887 | * This function returns the next zone at or below a given zone index that is | |
888 | * within the allowed nodemask using a cursor as the starting point for the | |
5bead2a0 MG |
889 | * search. The zoneref returned is a cursor that represents the current zone |
890 | * being examined. It should be advanced by one before calling | |
891 | * next_zones_zonelist again. | |
19770b32 MG |
892 | */ |
893 | struct zoneref *next_zones_zonelist(struct zoneref *z, | |
894 | enum zone_type highest_zoneidx, | |
895 | nodemask_t *nodes, | |
896 | struct zone **zone); | |
dd1a239f | 897 | |
19770b32 MG |
898 | /** |
899 | * first_zones_zonelist - Returns the first zone at or below highest_zoneidx within the allowed nodemask in a zonelist | |
900 | * @zonelist - The zonelist to search for a suitable zone | |
901 | * @highest_zoneidx - The zone index of the highest zone to return | |
902 | * @nodes - An optional nodemask to filter the zonelist with | |
903 | * @zone - The first suitable zone found is returned via this parameter | |
904 | * | |
905 | * This function returns the first zone at or below a given zone index that is | |
906 | * within the allowed nodemask. The zoneref returned is a cursor that can be | |
5bead2a0 MG |
907 | * used to iterate the zonelist with next_zones_zonelist by advancing it by |
908 | * one before calling. | |
19770b32 | 909 | */ |
dd1a239f | 910 | static inline struct zoneref *first_zones_zonelist(struct zonelist *zonelist, |
19770b32 MG |
911 | enum zone_type highest_zoneidx, |
912 | nodemask_t *nodes, | |
913 | struct zone **zone) | |
54a6eb5c | 914 | { |
19770b32 MG |
915 | return next_zones_zonelist(zonelist->_zonerefs, highest_zoneidx, nodes, |
916 | zone); | |
54a6eb5c MG |
917 | } |
918 | ||
19770b32 MG |
919 | /** |
920 | * for_each_zone_zonelist_nodemask - helper macro to iterate over valid zones in a zonelist at or below a given zone index and within a nodemask | |
921 | * @zone - The current zone in the iterator | |
922 | * @z - The current pointer within zonelist->zones being iterated | |
923 | * @zlist - The zonelist being iterated | |
924 | * @highidx - The zone index of the highest zone to return | |
925 | * @nodemask - Nodemask allowed by the allocator | |
926 | * | |
927 | * This iterator iterates though all zones at or below a given zone index and | |
928 | * within a given nodemask | |
929 | */ | |
930 | #define for_each_zone_zonelist_nodemask(zone, z, zlist, highidx, nodemask) \ | |
931 | for (z = first_zones_zonelist(zlist, highidx, nodemask, &zone); \ | |
932 | zone; \ | |
5bead2a0 | 933 | z = next_zones_zonelist(++z, highidx, nodemask, &zone)) \ |
54a6eb5c MG |
934 | |
935 | /** | |
936 | * for_each_zone_zonelist - helper macro to iterate over valid zones in a zonelist at or below a given zone index | |
937 | * @zone - The current zone in the iterator | |
938 | * @z - The current pointer within zonelist->zones being iterated | |
939 | * @zlist - The zonelist being iterated | |
940 | * @highidx - The zone index of the highest zone to return | |
941 | * | |
942 | * This iterator iterates though all zones at or below a given zone index. | |
943 | */ | |
944 | #define for_each_zone_zonelist(zone, z, zlist, highidx) \ | |
19770b32 | 945 | for_each_zone_zonelist_nodemask(zone, z, zlist, highidx, NULL) |
54a6eb5c | 946 | |
d41dee36 AW |
947 | #ifdef CONFIG_SPARSEMEM |
948 | #include <asm/sparsemem.h> | |
949 | #endif | |
950 | ||
c713216d | 951 | #if !defined(CONFIG_HAVE_ARCH_EARLY_PFN_TO_NID) && \ |
0ee332c1 | 952 | !defined(CONFIG_HAVE_MEMBLOCK_NODE_MAP) |
b4544568 AM |
953 | static inline unsigned long early_pfn_to_nid(unsigned long pfn) |
954 | { | |
955 | return 0; | |
956 | } | |
b159d43f AW |
957 | #endif |
958 | ||
2bdaf115 AW |
959 | #ifdef CONFIG_FLATMEM |
960 | #define pfn_to_nid(pfn) (0) | |
961 | #endif | |
962 | ||
d41dee36 AW |
963 | #ifdef CONFIG_SPARSEMEM |
964 | ||
965 | /* | |
966 | * SECTION_SHIFT #bits space required to store a section # | |
967 | * | |
968 | * PA_SECTION_SHIFT physical address to/from section number | |
969 | * PFN_SECTION_SHIFT pfn to/from section number | |
970 | */ | |
971 | #define SECTIONS_SHIFT (MAX_PHYSMEM_BITS - SECTION_SIZE_BITS) | |
972 | ||
973 | #define PA_SECTION_SHIFT (SECTION_SIZE_BITS) | |
974 | #define PFN_SECTION_SHIFT (SECTION_SIZE_BITS - PAGE_SHIFT) | |
975 | ||
976 | #define NR_MEM_SECTIONS (1UL << SECTIONS_SHIFT) | |
977 | ||
978 | #define PAGES_PER_SECTION (1UL << PFN_SECTION_SHIFT) | |
979 | #define PAGE_SECTION_MASK (~(PAGES_PER_SECTION-1)) | |
980 | ||
835c134e | 981 | #define SECTION_BLOCKFLAGS_BITS \ |
d9c23400 | 982 | ((1UL << (PFN_SECTION_SHIFT - pageblock_order)) * NR_PAGEBLOCK_BITS) |
835c134e | 983 | |
d41dee36 AW |
984 | #if (MAX_ORDER - 1 + PAGE_SHIFT) > SECTION_SIZE_BITS |
985 | #error Allocator MAX_ORDER exceeds SECTION_SIZE | |
986 | #endif | |
987 | ||
e3c40f37 DK |
988 | #define pfn_to_section_nr(pfn) ((pfn) >> PFN_SECTION_SHIFT) |
989 | #define section_nr_to_pfn(sec) ((sec) << PFN_SECTION_SHIFT) | |
990 | ||
a539f353 DK |
991 | #define SECTION_ALIGN_UP(pfn) (((pfn) + PAGES_PER_SECTION - 1) & PAGE_SECTION_MASK) |
992 | #define SECTION_ALIGN_DOWN(pfn) ((pfn) & PAGE_SECTION_MASK) | |
993 | ||
d41dee36 | 994 | struct page; |
52d4b9ac | 995 | struct page_cgroup; |
d41dee36 | 996 | struct mem_section { |
29751f69 AW |
997 | /* |
998 | * This is, logically, a pointer to an array of struct | |
999 | * pages. However, it is stored with some other magic. | |
1000 | * (see sparse.c::sparse_init_one_section()) | |
1001 | * | |
30c253e6 AW |
1002 | * Additionally during early boot we encode node id of |
1003 | * the location of the section here to guide allocation. | |
1004 | * (see sparse.c::memory_present()) | |
1005 | * | |
29751f69 AW |
1006 | * Making it a UL at least makes someone do a cast |
1007 | * before using it wrong. | |
1008 | */ | |
1009 | unsigned long section_mem_map; | |
5c0e3066 MG |
1010 | |
1011 | /* See declaration of similar field in struct zone */ | |
1012 | unsigned long *pageblock_flags; | |
52d4b9ac KH |
1013 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR |
1014 | /* | |
1015 | * If !SPARSEMEM, pgdat doesn't have page_cgroup pointer. We use | |
1016 | * section. (see memcontrol.h/page_cgroup.h about this.) | |
1017 | */ | |
1018 | struct page_cgroup *page_cgroup; | |
1019 | unsigned long pad; | |
1020 | #endif | |
d41dee36 AW |
1021 | }; |
1022 | ||
3e347261 BP |
1023 | #ifdef CONFIG_SPARSEMEM_EXTREME |
1024 | #define SECTIONS_PER_ROOT (PAGE_SIZE / sizeof (struct mem_section)) | |
1025 | #else | |
1026 | #define SECTIONS_PER_ROOT 1 | |
1027 | #endif | |
802f192e | 1028 | |
3e347261 | 1029 | #define SECTION_NR_TO_ROOT(sec) ((sec) / SECTIONS_PER_ROOT) |
0faa5638 | 1030 | #define NR_SECTION_ROOTS DIV_ROUND_UP(NR_MEM_SECTIONS, SECTIONS_PER_ROOT) |
3e347261 | 1031 | #define SECTION_ROOT_MASK (SECTIONS_PER_ROOT - 1) |
802f192e | 1032 | |
3e347261 BP |
1033 | #ifdef CONFIG_SPARSEMEM_EXTREME |
1034 | extern struct mem_section *mem_section[NR_SECTION_ROOTS]; | |
802f192e | 1035 | #else |
3e347261 BP |
1036 | extern struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]; |
1037 | #endif | |
d41dee36 | 1038 | |
29751f69 AW |
1039 | static inline struct mem_section *__nr_to_section(unsigned long nr) |
1040 | { | |
3e347261 BP |
1041 | if (!mem_section[SECTION_NR_TO_ROOT(nr)]) |
1042 | return NULL; | |
1043 | return &mem_section[SECTION_NR_TO_ROOT(nr)][nr & SECTION_ROOT_MASK]; | |
29751f69 | 1044 | } |
4ca644d9 | 1045 | extern int __section_nr(struct mem_section* ms); |
04753278 | 1046 | extern unsigned long usemap_size(void); |
29751f69 AW |
1047 | |
1048 | /* | |
1049 | * We use the lower bits of the mem_map pointer to store | |
1050 | * a little bit of information. There should be at least | |
1051 | * 3 bits here due to 32-bit alignment. | |
1052 | */ | |
1053 | #define SECTION_MARKED_PRESENT (1UL<<0) | |
1054 | #define SECTION_HAS_MEM_MAP (1UL<<1) | |
1055 | #define SECTION_MAP_LAST_BIT (1UL<<2) | |
1056 | #define SECTION_MAP_MASK (~(SECTION_MAP_LAST_BIT-1)) | |
30c253e6 | 1057 | #define SECTION_NID_SHIFT 2 |
29751f69 AW |
1058 | |
1059 | static inline struct page *__section_mem_map_addr(struct mem_section *section) | |
1060 | { | |
1061 | unsigned long map = section->section_mem_map; | |
1062 | map &= SECTION_MAP_MASK; | |
1063 | return (struct page *)map; | |
1064 | } | |
1065 | ||
540557b9 | 1066 | static inline int present_section(struct mem_section *section) |
29751f69 | 1067 | { |
802f192e | 1068 | return (section && (section->section_mem_map & SECTION_MARKED_PRESENT)); |
29751f69 AW |
1069 | } |
1070 | ||
540557b9 AW |
1071 | static inline int present_section_nr(unsigned long nr) |
1072 | { | |
1073 | return present_section(__nr_to_section(nr)); | |
1074 | } | |
1075 | ||
1076 | static inline int valid_section(struct mem_section *section) | |
29751f69 | 1077 | { |
802f192e | 1078 | return (section && (section->section_mem_map & SECTION_HAS_MEM_MAP)); |
29751f69 AW |
1079 | } |
1080 | ||
1081 | static inline int valid_section_nr(unsigned long nr) | |
1082 | { | |
1083 | return valid_section(__nr_to_section(nr)); | |
1084 | } | |
1085 | ||
d41dee36 AW |
1086 | static inline struct mem_section *__pfn_to_section(unsigned long pfn) |
1087 | { | |
29751f69 | 1088 | return __nr_to_section(pfn_to_section_nr(pfn)); |
d41dee36 AW |
1089 | } |
1090 | ||
7b7bf499 | 1091 | #ifndef CONFIG_HAVE_ARCH_PFN_VALID |
d41dee36 AW |
1092 | static inline int pfn_valid(unsigned long pfn) |
1093 | { | |
1094 | if (pfn_to_section_nr(pfn) >= NR_MEM_SECTIONS) | |
1095 | return 0; | |
29751f69 | 1096 | return valid_section(__nr_to_section(pfn_to_section_nr(pfn))); |
d41dee36 | 1097 | } |
7b7bf499 | 1098 | #endif |
d41dee36 | 1099 | |
540557b9 AW |
1100 | static inline int pfn_present(unsigned long pfn) |
1101 | { | |
1102 | if (pfn_to_section_nr(pfn) >= NR_MEM_SECTIONS) | |
1103 | return 0; | |
1104 | return present_section(__nr_to_section(pfn_to_section_nr(pfn))); | |
1105 | } | |
1106 | ||
d41dee36 AW |
1107 | /* |
1108 | * These are _only_ used during initialisation, therefore they | |
1109 | * can use __initdata ... They could have names to indicate | |
1110 | * this restriction. | |
1111 | */ | |
1112 | #ifdef CONFIG_NUMA | |
161599ff AW |
1113 | #define pfn_to_nid(pfn) \ |
1114 | ({ \ | |
1115 | unsigned long __pfn_to_nid_pfn = (pfn); \ | |
1116 | page_to_nid(pfn_to_page(__pfn_to_nid_pfn)); \ | |
1117 | }) | |
2bdaf115 AW |
1118 | #else |
1119 | #define pfn_to_nid(pfn) (0) | |
d41dee36 AW |
1120 | #endif |
1121 | ||
d41dee36 AW |
1122 | #define early_pfn_valid(pfn) pfn_valid(pfn) |
1123 | void sparse_init(void); | |
1124 | #else | |
1125 | #define sparse_init() do {} while (0) | |
28ae55c9 | 1126 | #define sparse_index_init(_sec, _nid) do {} while (0) |
d41dee36 AW |
1127 | #endif /* CONFIG_SPARSEMEM */ |
1128 | ||
75167957 | 1129 | #ifdef CONFIG_NODES_SPAN_OTHER_NODES |
cc2559bc | 1130 | bool early_pfn_in_nid(unsigned long pfn, int nid); |
75167957 AW |
1131 | #else |
1132 | #define early_pfn_in_nid(pfn, nid) (1) | |
1133 | #endif | |
1134 | ||
d41dee36 AW |
1135 | #ifndef early_pfn_valid |
1136 | #define early_pfn_valid(pfn) (1) | |
1137 | #endif | |
1138 | ||
1139 | void memory_present(int nid, unsigned long start, unsigned long end); | |
1140 | unsigned long __init node_memmap_size_bytes(int, unsigned long, unsigned long); | |
1141 | ||
14e07298 AW |
1142 | /* |
1143 | * If it is possible to have holes within a MAX_ORDER_NR_PAGES, then we | |
1144 | * need to check pfn validility within that MAX_ORDER_NR_PAGES block. | |
1145 | * pfn_valid_within() should be used in this case; we optimise this away | |
1146 | * when we have no holes within a MAX_ORDER_NR_PAGES block. | |
1147 | */ | |
1148 | #ifdef CONFIG_HOLES_IN_ZONE | |
1149 | #define pfn_valid_within(pfn) pfn_valid(pfn) | |
1150 | #else | |
1151 | #define pfn_valid_within(pfn) (1) | |
1152 | #endif | |
1153 | ||
eb33575c MG |
1154 | #ifdef CONFIG_ARCH_HAS_HOLES_MEMORYMODEL |
1155 | /* | |
1156 | * pfn_valid() is meant to be able to tell if a given PFN has valid memmap | |
1157 | * associated with it or not. In FLATMEM, it is expected that holes always | |
1158 | * have valid memmap as long as there is valid PFNs either side of the hole. | |
1159 | * In SPARSEMEM, it is assumed that a valid section has a memmap for the | |
1160 | * entire section. | |
1161 | * | |
1162 | * However, an ARM, and maybe other embedded architectures in the future | |
1163 | * free memmap backing holes to save memory on the assumption the memmap is | |
1164 | * never used. The page_zone linkages are then broken even though pfn_valid() | |
1165 | * returns true. A walker of the full memmap must then do this additional | |
1166 | * check to ensure the memmap they are looking at is sane by making sure | |
1167 | * the zone and PFN linkages are still valid. This is expensive, but walkers | |
1168 | * of the full memmap are extremely rare. | |
1169 | */ | |
1170 | int memmap_valid_within(unsigned long pfn, | |
1171 | struct page *page, struct zone *zone); | |
1172 | #else | |
1173 | static inline int memmap_valid_within(unsigned long pfn, | |
1174 | struct page *page, struct zone *zone) | |
1175 | { | |
1176 | return 1; | |
1177 | } | |
1178 | #endif /* CONFIG_ARCH_HAS_HOLES_MEMORYMODEL */ | |
1179 | ||
97965478 | 1180 | #endif /* !__GENERATING_BOUNDS.H */ |
1da177e4 | 1181 | #endif /* !__ASSEMBLY__ */ |
1da177e4 | 1182 | #endif /* _LINUX_MMZONE_H */ |