Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
1da177e4 LT |
2 | #ifndef _LINUX_MMZONE_H |
3 | #define _LINUX_MMZONE_H | |
4 | ||
1da177e4 | 5 | #ifndef __ASSEMBLY__ |
97965478 | 6 | #ifndef __GENERATING_BOUNDS_H |
1da177e4 | 7 | |
1da177e4 LT |
8 | #include <linux/spinlock.h> |
9 | #include <linux/list.h> | |
10 | #include <linux/wait.h> | |
e815af95 | 11 | #include <linux/bitops.h> |
1da177e4 LT |
12 | #include <linux/cache.h> |
13 | #include <linux/threads.h> | |
14 | #include <linux/numa.h> | |
15 | #include <linux/init.h> | |
bdc8cb98 | 16 | #include <linux/seqlock.h> |
8357f869 | 17 | #include <linux/nodemask.h> |
835c134e | 18 | #include <linux/pageblock-flags.h> |
bbeae5b0 | 19 | #include <linux/page-flags-layout.h> |
60063497 | 20 | #include <linux/atomic.h> |
b03641af DW |
21 | #include <linux/mm_types.h> |
22 | #include <linux/page-flags.h> | |
93ff66bf | 23 | #include <asm/page.h> |
1da177e4 LT |
24 | |
25 | /* Free memory management - zoned buddy allocator. */ | |
26 | #ifndef CONFIG_FORCE_MAX_ZONEORDER | |
27 | #define MAX_ORDER 11 | |
28 | #else | |
29 | #define MAX_ORDER CONFIG_FORCE_MAX_ZONEORDER | |
30 | #endif | |
e984bb43 | 31 | #define MAX_ORDER_NR_PAGES (1 << (MAX_ORDER - 1)) |
1da177e4 | 32 | |
5ad333eb AW |
33 | /* |
34 | * PAGE_ALLOC_COSTLY_ORDER is the order at which allocations are deemed | |
35 | * costly to service. That is between allocation orders which should | |
35fca53e | 36 | * coalesce naturally under reasonable reclaim pressure and those which |
5ad333eb AW |
37 | * will not. |
38 | */ | |
39 | #define PAGE_ALLOC_COSTLY_ORDER 3 | |
40 | ||
a6ffdc07 | 41 | enum migratetype { |
47118af0 | 42 | MIGRATE_UNMOVABLE, |
47118af0 | 43 | MIGRATE_MOVABLE, |
016c13da | 44 | MIGRATE_RECLAIMABLE, |
0aaa29a5 MG |
45 | MIGRATE_PCPTYPES, /* the number of types on the pcp lists */ |
46 | MIGRATE_HIGHATOMIC = MIGRATE_PCPTYPES, | |
47118af0 MN |
47 | #ifdef CONFIG_CMA |
48 | /* | |
49 | * MIGRATE_CMA migration type is designed to mimic the way | |
50 | * ZONE_MOVABLE works. Only movable pages can be allocated | |
51 | * from MIGRATE_CMA pageblocks and page allocator never | |
52 | * implicitly change migration type of MIGRATE_CMA pageblock. | |
53 | * | |
54 | * The way to use it is to change migratetype of a range of | |
55 | * pageblocks to MIGRATE_CMA which can be done by | |
56 | * __free_pageblock_cma() function. What is important though | |
57 | * is that a range of pageblocks must be aligned to | |
58 | * MAX_ORDER_NR_PAGES should biggest page be bigger then | |
59 | * a single pageblock. | |
60 | */ | |
61 | MIGRATE_CMA, | |
62 | #endif | |
194159fb | 63 | #ifdef CONFIG_MEMORY_ISOLATION |
47118af0 | 64 | MIGRATE_ISOLATE, /* can't allocate from here */ |
194159fb | 65 | #endif |
47118af0 MN |
66 | MIGRATE_TYPES |
67 | }; | |
68 | ||
60f30350 | 69 | /* In mm/page_alloc.c; keep in sync also with show_migration_types() there */ |
c999fbd3 | 70 | extern const char * const migratetype_names[MIGRATE_TYPES]; |
60f30350 | 71 | |
47118af0 MN |
72 | #ifdef CONFIG_CMA |
73 | # define is_migrate_cma(migratetype) unlikely((migratetype) == MIGRATE_CMA) | |
7c15d9bb | 74 | # define is_migrate_cma_page(_page) (get_pageblock_migratetype(_page) == MIGRATE_CMA) |
47118af0 MN |
75 | #else |
76 | # define is_migrate_cma(migratetype) false | |
7c15d9bb | 77 | # define is_migrate_cma_page(_page) false |
47118af0 | 78 | #endif |
b2a0ac88 | 79 | |
b682debd VB |
80 | static inline bool is_migrate_movable(int mt) |
81 | { | |
82 | return is_migrate_cma(mt) || mt == MIGRATE_MOVABLE; | |
83 | } | |
84 | ||
b2a0ac88 MG |
85 | #define for_each_migratetype_order(order, type) \ |
86 | for (order = 0; order < MAX_ORDER; order++) \ | |
87 | for (type = 0; type < MIGRATE_TYPES; type++) | |
88 | ||
467c996c MG |
89 | extern int page_group_by_mobility_disabled; |
90 | ||
e58469ba MG |
91 | #define NR_MIGRATETYPE_BITS (PB_migrate_end - PB_migrate + 1) |
92 | #define MIGRATETYPE_MASK ((1UL << NR_MIGRATETYPE_BITS) - 1) | |
93 | ||
dc4b0caf MG |
94 | #define get_pageblock_migratetype(page) \ |
95 | get_pfnblock_flags_mask(page, page_to_pfn(page), \ | |
96 | PB_migrate_end, MIGRATETYPE_MASK) | |
97 | ||
1da177e4 | 98 | struct free_area { |
b2a0ac88 | 99 | struct list_head free_list[MIGRATE_TYPES]; |
1da177e4 LT |
100 | unsigned long nr_free; |
101 | }; | |
102 | ||
b03641af DW |
103 | static inline struct page *get_page_from_free_area(struct free_area *area, |
104 | int migratetype) | |
105 | { | |
106 | return list_first_entry_or_null(&area->free_list[migratetype], | |
107 | struct page, lru); | |
108 | } | |
109 | ||
b03641af DW |
110 | static inline bool free_area_empty(struct free_area *area, int migratetype) |
111 | { | |
112 | return list_empty(&area->free_list[migratetype]); | |
113 | } | |
114 | ||
1da177e4 LT |
115 | struct pglist_data; |
116 | ||
117 | /* | |
a52633d8 | 118 | * zone->lock and the zone lru_lock are two of the hottest locks in the kernel. |
1da177e4 LT |
119 | * So add a wild amount of padding here to ensure that they fall into separate |
120 | * cachelines. There are very few zone structures in the machine, so space | |
121 | * consumption is not a concern here. | |
122 | */ | |
123 | #if defined(CONFIG_SMP) | |
124 | struct zone_padding { | |
125 | char x[0]; | |
22fc6ecc | 126 | } ____cacheline_internodealigned_in_smp; |
1da177e4 LT |
127 | #define ZONE_PADDING(name) struct zone_padding name; |
128 | #else | |
129 | #define ZONE_PADDING(name) | |
130 | #endif | |
131 | ||
3a321d2a KW |
132 | #ifdef CONFIG_NUMA |
133 | enum numa_stat_item { | |
134 | NUMA_HIT, /* allocated in intended node */ | |
135 | NUMA_MISS, /* allocated in non intended node */ | |
136 | NUMA_FOREIGN, /* was intended here, hit elsewhere */ | |
137 | NUMA_INTERLEAVE_HIT, /* interleaver preferred this zone */ | |
138 | NUMA_LOCAL, /* allocation from local node */ | |
139 | NUMA_OTHER, /* allocation from other node */ | |
140 | NR_VM_NUMA_STAT_ITEMS | |
141 | }; | |
142 | #else | |
143 | #define NR_VM_NUMA_STAT_ITEMS 0 | |
144 | #endif | |
145 | ||
2244b95a | 146 | enum zone_stat_item { |
51ed4491 | 147 | /* First 128 byte cacheline (assuming 64 bit words) */ |
d23ad423 | 148 | NR_FREE_PAGES, |
71c799f4 MK |
149 | NR_ZONE_LRU_BASE, /* Used only for compaction and reclaim retry */ |
150 | NR_ZONE_INACTIVE_ANON = NR_ZONE_LRU_BASE, | |
151 | NR_ZONE_ACTIVE_ANON, | |
152 | NR_ZONE_INACTIVE_FILE, | |
153 | NR_ZONE_ACTIVE_FILE, | |
154 | NR_ZONE_UNEVICTABLE, | |
5a1c84b4 | 155 | NR_ZONE_WRITE_PENDING, /* Count of dirty, writeback and unstable pages */ |
5344b7e6 | 156 | NR_MLOCK, /* mlock()ed pages found and moved off LRU */ |
51ed4491 | 157 | NR_PAGETABLE, /* used for pagetables */ |
d30dd8be | 158 | NR_KERNEL_STACK_KB, /* measured in KiB */ |
628d06a4 ST |
159 | #if IS_ENABLED(CONFIG_SHADOW_CALL_STACK) |
160 | NR_KERNEL_SCS_KB, /* measured in KiB */ | |
161 | #endif | |
c6a7f572 | 162 | /* Second 128 byte cacheline */ |
d2c5e30c | 163 | NR_BOUNCE, |
91537fee MK |
164 | #if IS_ENABLED(CONFIG_ZSMALLOC) |
165 | NR_ZSPAGES, /* allocated in zsmalloc */ | |
ca889e6c | 166 | #endif |
d1ce749a | 167 | NR_FREE_CMA_PAGES, |
2244b95a CL |
168 | NR_VM_ZONE_STAT_ITEMS }; |
169 | ||
75ef7184 | 170 | enum node_stat_item { |
599d0c95 MG |
171 | NR_LRU_BASE, |
172 | NR_INACTIVE_ANON = NR_LRU_BASE, /* must match order of LRU_[IN]ACTIVE */ | |
173 | NR_ACTIVE_ANON, /* " " " " " */ | |
174 | NR_INACTIVE_FILE, /* " " " " " */ | |
175 | NR_ACTIVE_FILE, /* " " " " " */ | |
176 | NR_UNEVICTABLE, /* " " " " " */ | |
4a87e2a2 RG |
177 | NR_SLAB_RECLAIMABLE, |
178 | NR_SLAB_UNRECLAIMABLE, | |
599d0c95 MG |
179 | NR_ISOLATED_ANON, /* Temporary isolated pages from anon lru */ |
180 | NR_ISOLATED_FILE, /* Temporary isolated pages from file lru */ | |
68d48e6a | 181 | WORKINGSET_NODES, |
1e6b1085 MG |
182 | WORKINGSET_REFAULT, |
183 | WORKINGSET_ACTIVATE, | |
1899ad18 | 184 | WORKINGSET_RESTORE, |
1e6b1085 | 185 | WORKINGSET_NODERECLAIM, |
4b9d0fab | 186 | NR_ANON_MAPPED, /* Mapped anonymous pages */ |
50658e2e MG |
187 | NR_FILE_MAPPED, /* pagecache pages mapped into pagetables. |
188 | only modified from process context */ | |
11fb9989 MG |
189 | NR_FILE_PAGES, |
190 | NR_FILE_DIRTY, | |
191 | NR_WRITEBACK, | |
192 | NR_WRITEBACK_TEMP, /* Writeback using temporary buffers */ | |
193 | NR_SHMEM, /* shmem pages (included tmpfs/GEM pages) */ | |
194 | NR_SHMEM_THPS, | |
195 | NR_SHMEM_PMDMAPPED, | |
60fbf0ab SL |
196 | NR_FILE_THPS, |
197 | NR_FILE_PMDMAPPED, | |
11fb9989 | 198 | NR_ANON_THPS, |
c4a25635 MG |
199 | NR_VMSCAN_WRITE, |
200 | NR_VMSCAN_IMMEDIATE, /* Prioritise for reclaim when writeback ends */ | |
201 | NR_DIRTIED, /* page dirtyings since bootup */ | |
202 | NR_WRITTEN, /* page writings since bootup */ | |
b29940c1 | 203 | NR_KERNEL_MISC_RECLAIMABLE, /* reclaimable non-slab kernel pages */ |
1970dc6f JH |
204 | NR_FOLL_PIN_ACQUIRED, /* via: pin_user_page(), gup flag: FOLL_PIN */ |
205 | NR_FOLL_PIN_RELEASED, /* pages returned via unpin_user_page() */ | |
75ef7184 MG |
206 | NR_VM_NODE_STAT_ITEMS |
207 | }; | |
208 | ||
4f98a2fe RR |
209 | /* |
210 | * We do arithmetic on the LRU lists in various places in the code, | |
211 | * so it is important to keep the active lists LRU_ACTIVE higher in | |
212 | * the array than the corresponding inactive lists, and to keep | |
213 | * the *_FILE lists LRU_FILE higher than the corresponding _ANON lists. | |
214 | * | |
215 | * This has to be kept in sync with the statistics in zone_stat_item | |
216 | * above and the descriptions in vmstat_text in mm/vmstat.c | |
217 | */ | |
218 | #define LRU_BASE 0 | |
219 | #define LRU_ACTIVE 1 | |
220 | #define LRU_FILE 2 | |
221 | ||
b69408e8 | 222 | enum lru_list { |
4f98a2fe RR |
223 | LRU_INACTIVE_ANON = LRU_BASE, |
224 | LRU_ACTIVE_ANON = LRU_BASE + LRU_ACTIVE, | |
225 | LRU_INACTIVE_FILE = LRU_BASE + LRU_FILE, | |
226 | LRU_ACTIVE_FILE = LRU_BASE + LRU_FILE + LRU_ACTIVE, | |
894bc310 | 227 | LRU_UNEVICTABLE, |
894bc310 LS |
228 | NR_LRU_LISTS |
229 | }; | |
b69408e8 | 230 | |
4111304d | 231 | #define for_each_lru(lru) for (lru = 0; lru < NR_LRU_LISTS; lru++) |
b69408e8 | 232 | |
4111304d | 233 | #define for_each_evictable_lru(lru) for (lru = 0; lru <= LRU_ACTIVE_FILE; lru++) |
894bc310 | 234 | |
b91ac374 | 235 | static inline bool is_file_lru(enum lru_list lru) |
4f98a2fe | 236 | { |
4111304d | 237 | return (lru == LRU_INACTIVE_FILE || lru == LRU_ACTIVE_FILE); |
4f98a2fe RR |
238 | } |
239 | ||
b91ac374 | 240 | static inline bool is_active_lru(enum lru_list lru) |
b69408e8 | 241 | { |
4111304d | 242 | return (lru == LRU_ACTIVE_ANON || lru == LRU_ACTIVE_FILE); |
b69408e8 CL |
243 | } |
244 | ||
89abfab1 HD |
245 | struct zone_reclaim_stat { |
246 | /* | |
247 | * The pageout code in vmscan.c keeps track of how many of the | |
59f91e5d | 248 | * mem/swap backed and file backed pages are referenced. |
89abfab1 HD |
249 | * The higher the rotated/scanned ratio, the more valuable |
250 | * that cache is. | |
251 | * | |
252 | * The anon LRU stats live in [0], file LRU stats in [1] | |
253 | */ | |
254 | unsigned long recent_rotated[2]; | |
255 | unsigned long recent_scanned[2]; | |
256 | }; | |
257 | ||
1b05117d JW |
258 | enum lruvec_flags { |
259 | LRUVEC_CONGESTED, /* lruvec has many dirty pages | |
260 | * backed by a congested BDI | |
261 | */ | |
262 | }; | |
263 | ||
6290df54 | 264 | struct lruvec { |
23047a96 JW |
265 | struct list_head lists[NR_LRU_LISTS]; |
266 | struct zone_reclaim_stat reclaim_stat; | |
267 | /* Evictions & activations on the inactive file list */ | |
268 | atomic_long_t inactive_age; | |
2a2e4885 JW |
269 | /* Refaults at the time of last reclaim cycle */ |
270 | unsigned long refaults; | |
1b05117d JW |
271 | /* Various lruvec state flags (enum lruvec_flags) */ |
272 | unsigned long flags; | |
c255a458 | 273 | #ifdef CONFIG_MEMCG |
599d0c95 | 274 | struct pglist_data *pgdat; |
7f5e86c2 | 275 | #endif |
6290df54 JW |
276 | }; |
277 | ||
653e003d | 278 | /* Isolate unmapped pages */ |
f3fd4a61 | 279 | #define ISOLATE_UNMAPPED ((__force isolate_mode_t)0x2) |
c8244935 | 280 | /* Isolate for asynchronous migration */ |
f3fd4a61 | 281 | #define ISOLATE_ASYNC_MIGRATE ((__force isolate_mode_t)0x4) |
e46a2879 MK |
282 | /* Isolate unevictable pages */ |
283 | #define ISOLATE_UNEVICTABLE ((__force isolate_mode_t)0x8) | |
4356f21d MK |
284 | |
285 | /* LRU Isolation modes. */ | |
9efeccac | 286 | typedef unsigned __bitwise isolate_mode_t; |
4356f21d | 287 | |
41858966 MG |
288 | enum zone_watermarks { |
289 | WMARK_MIN, | |
290 | WMARK_LOW, | |
291 | WMARK_HIGH, | |
292 | NR_WMARK | |
293 | }; | |
294 | ||
1c30844d MG |
295 | #define min_wmark_pages(z) (z->_watermark[WMARK_MIN] + z->watermark_boost) |
296 | #define low_wmark_pages(z) (z->_watermark[WMARK_LOW] + z->watermark_boost) | |
297 | #define high_wmark_pages(z) (z->_watermark[WMARK_HIGH] + z->watermark_boost) | |
298 | #define wmark_pages(z, i) (z->_watermark[i] + z->watermark_boost) | |
41858966 | 299 | |
1da177e4 LT |
300 | struct per_cpu_pages { |
301 | int count; /* number of pages in the list */ | |
1da177e4 LT |
302 | int high; /* high watermark, emptying needed */ |
303 | int batch; /* chunk size for buddy add/remove */ | |
5f8dcc21 MG |
304 | |
305 | /* Lists of pages, one per migrate type stored on the pcp-lists */ | |
306 | struct list_head lists[MIGRATE_PCPTYPES]; | |
1da177e4 LT |
307 | }; |
308 | ||
309 | struct per_cpu_pageset { | |
3dfa5721 | 310 | struct per_cpu_pages pcp; |
4037d452 CL |
311 | #ifdef CONFIG_NUMA |
312 | s8 expire; | |
1d90ca89 | 313 | u16 vm_numa_stat_diff[NR_VM_NUMA_STAT_ITEMS]; |
4037d452 | 314 | #endif |
2244b95a | 315 | #ifdef CONFIG_SMP |
df9ecaba | 316 | s8 stat_threshold; |
2244b95a CL |
317 | s8 vm_stat_diff[NR_VM_ZONE_STAT_ITEMS]; |
318 | #endif | |
99dcc3e5 | 319 | }; |
e7c8d5c9 | 320 | |
75ef7184 MG |
321 | struct per_cpu_nodestat { |
322 | s8 stat_threshold; | |
323 | s8 vm_node_stat_diff[NR_VM_NODE_STAT_ITEMS]; | |
324 | }; | |
325 | ||
97965478 CL |
326 | #endif /* !__GENERATING_BOUNDS.H */ |
327 | ||
2f1b6248 CL |
328 | enum zone_type { |
329 | /* | |
734f9246 NSJ |
330 | * ZONE_DMA and ZONE_DMA32 are used when there are peripherals not able |
331 | * to DMA to all of the addressable memory (ZONE_NORMAL). | |
332 | * On architectures where this area covers the whole 32 bit address | |
333 | * space ZONE_DMA32 is used. ZONE_DMA is left for the ones with smaller | |
334 | * DMA addressing constraints. This distinction is important as a 32bit | |
335 | * DMA mask is assumed when ZONE_DMA32 is defined. Some 64-bit | |
336 | * platforms may need both zones as they support peripherals with | |
337 | * different DMA addressing limitations. | |
338 | * | |
339 | * Some examples: | |
340 | * | |
341 | * - i386 and x86_64 have a fixed 16M ZONE_DMA and ZONE_DMA32 for the | |
342 | * rest of the lower 4G. | |
343 | * | |
344 | * - arm only uses ZONE_DMA, the size, up to 4G, may vary depending on | |
345 | * the specific device. | |
346 | * | |
347 | * - arm64 has a fixed 1G ZONE_DMA and ZONE_DMA32 for the rest of the | |
348 | * lower 4G. | |
2f1b6248 | 349 | * |
734f9246 NSJ |
350 | * - powerpc only uses ZONE_DMA, the size, up to 2G, may vary |
351 | * depending on the specific device. | |
2f1b6248 | 352 | * |
734f9246 | 353 | * - s390 uses ZONE_DMA fixed to the lower 2G. |
2f1b6248 | 354 | * |
734f9246 NSJ |
355 | * - ia64 and riscv only use ZONE_DMA32. |
356 | * | |
357 | * - parisc uses neither. | |
2f1b6248 | 358 | */ |
734f9246 | 359 | #ifdef CONFIG_ZONE_DMA |
2f1b6248 | 360 | ZONE_DMA, |
4b51d669 | 361 | #endif |
fb0e7942 | 362 | #ifdef CONFIG_ZONE_DMA32 |
2f1b6248 | 363 | ZONE_DMA32, |
fb0e7942 | 364 | #endif |
2f1b6248 CL |
365 | /* |
366 | * Normal addressable memory is in ZONE_NORMAL. DMA operations can be | |
367 | * performed on pages in ZONE_NORMAL if the DMA devices support | |
368 | * transfers to all addressable memory. | |
369 | */ | |
370 | ZONE_NORMAL, | |
e53ef38d | 371 | #ifdef CONFIG_HIGHMEM |
2f1b6248 CL |
372 | /* |
373 | * A memory area that is only addressable by the kernel through | |
374 | * mapping portions into its own address space. This is for example | |
375 | * used by i386 to allow the kernel to address the memory beyond | |
376 | * 900MB. The kernel will set up special mappings (page | |
377 | * table entries on i386) for each page that the kernel needs to | |
378 | * access. | |
379 | */ | |
380 | ZONE_HIGHMEM, | |
e53ef38d | 381 | #endif |
2a1e274a | 382 | ZONE_MOVABLE, |
033fbae9 DW |
383 | #ifdef CONFIG_ZONE_DEVICE |
384 | ZONE_DEVICE, | |
385 | #endif | |
97965478 | 386 | __MAX_NR_ZONES |
033fbae9 | 387 | |
2f1b6248 | 388 | }; |
1da177e4 | 389 | |
97965478 CL |
390 | #ifndef __GENERATING_BOUNDS_H |
391 | ||
1da177e4 | 392 | struct zone { |
3484b2de | 393 | /* Read-mostly fields */ |
41858966 MG |
394 | |
395 | /* zone watermarks, access with *_wmark_pages(zone) macros */ | |
a9214443 | 396 | unsigned long _watermark[NR_WMARK]; |
1c30844d | 397 | unsigned long watermark_boost; |
41858966 | 398 | |
0aaa29a5 MG |
399 | unsigned long nr_reserved_highatomic; |
400 | ||
1da177e4 | 401 | /* |
89903327 AM |
402 | * We don't know if the memory that we're going to allocate will be |
403 | * freeable or/and it will be released eventually, so to avoid totally | |
404 | * wasting several GB of ram we must reserve some of the lower zone | |
405 | * memory (otherwise we risk to run OOM on the lower zones despite | |
406 | * there being tons of freeable ram on the higher zones). This array is | |
407 | * recalculated at runtime if the sysctl_lowmem_reserve_ratio sysctl | |
408 | * changes. | |
1da177e4 | 409 | */ |
3484b2de | 410 | long lowmem_reserve[MAX_NR_ZONES]; |
ab8fabd4 | 411 | |
e7c8d5c9 | 412 | #ifdef CONFIG_NUMA |
d5f541ed | 413 | int node; |
3484b2de | 414 | #endif |
3484b2de | 415 | struct pglist_data *zone_pgdat; |
43cf38eb | 416 | struct per_cpu_pageset __percpu *pageset; |
3484b2de | 417 | |
835c134e MG |
418 | #ifndef CONFIG_SPARSEMEM |
419 | /* | |
d9c23400 | 420 | * Flags for a pageblock_nr_pages block. See pageblock-flags.h. |
835c134e MG |
421 | * In SPARSEMEM, this map is stored in struct mem_section |
422 | */ | |
423 | unsigned long *pageblock_flags; | |
424 | #endif /* CONFIG_SPARSEMEM */ | |
425 | ||
1da177e4 LT |
426 | /* zone_start_pfn == zone_start_paddr >> PAGE_SHIFT */ |
427 | unsigned long zone_start_pfn; | |
428 | ||
bdc8cb98 | 429 | /* |
9feedc9d JL |
430 | * spanned_pages is the total pages spanned by the zone, including |
431 | * holes, which is calculated as: | |
432 | * spanned_pages = zone_end_pfn - zone_start_pfn; | |
bdc8cb98 | 433 | * |
9feedc9d JL |
434 | * present_pages is physical pages existing within the zone, which |
435 | * is calculated as: | |
8761e31c | 436 | * present_pages = spanned_pages - absent_pages(pages in holes); |
9feedc9d JL |
437 | * |
438 | * managed_pages is present pages managed by the buddy system, which | |
439 | * is calculated as (reserved_pages includes pages allocated by the | |
440 | * bootmem allocator): | |
441 | * managed_pages = present_pages - reserved_pages; | |
442 | * | |
443 | * So present_pages may be used by memory hotplug or memory power | |
444 | * management logic to figure out unmanaged pages by checking | |
445 | * (present_pages - managed_pages). And managed_pages should be used | |
446 | * by page allocator and vm scanner to calculate all kinds of watermarks | |
447 | * and thresholds. | |
448 | * | |
449 | * Locking rules: | |
450 | * | |
451 | * zone_start_pfn and spanned_pages are protected by span_seqlock. | |
452 | * It is a seqlock because it has to be read outside of zone->lock, | |
453 | * and it is done in the main allocator path. But, it is written | |
454 | * quite infrequently. | |
455 | * | |
456 | * The span_seq lock is declared along with zone->lock because it is | |
bdc8cb98 DH |
457 | * frequently read in proximity to zone->lock. It's good to |
458 | * give them a chance of being in the same cacheline. | |
9feedc9d | 459 | * |
c3d5f5f0 | 460 | * Write access to present_pages at runtime should be protected by |
bfc8c901 VD |
461 | * mem_hotplug_begin/end(). Any reader who can't tolerant drift of |
462 | * present_pages should get_online_mems() to get a stable value. | |
bdc8cb98 | 463 | */ |
9705bea5 | 464 | atomic_long_t managed_pages; |
9feedc9d JL |
465 | unsigned long spanned_pages; |
466 | unsigned long present_pages; | |
3484b2de MG |
467 | |
468 | const char *name; | |
1da177e4 | 469 | |
ad53f92e JK |
470 | #ifdef CONFIG_MEMORY_ISOLATION |
471 | /* | |
472 | * Number of isolated pageblock. It is used to solve incorrect | |
473 | * freepage counting problem due to racy retrieving migratetype | |
474 | * of pageblock. Protected by zone->lock. | |
475 | */ | |
476 | unsigned long nr_isolate_pageblock; | |
477 | #endif | |
478 | ||
3484b2de MG |
479 | #ifdef CONFIG_MEMORY_HOTPLUG |
480 | /* see spanned/present_pages for more description */ | |
481 | seqlock_t span_seqlock; | |
482 | #endif | |
483 | ||
9dcb8b68 | 484 | int initialized; |
3484b2de | 485 | |
0f661148 | 486 | /* Write-intensive fields used from the page allocator */ |
3484b2de | 487 | ZONE_PADDING(_pad1_) |
0f661148 | 488 | |
3484b2de MG |
489 | /* free areas of different sizes */ |
490 | struct free_area free_area[MAX_ORDER]; | |
491 | ||
492 | /* zone flags, see below */ | |
493 | unsigned long flags; | |
494 | ||
0f661148 | 495 | /* Primarily protects free_area */ |
a368ab67 MG |
496 | spinlock_t lock; |
497 | ||
0f661148 | 498 | /* Write-intensive fields used by compaction and vmstats. */ |
3484b2de MG |
499 | ZONE_PADDING(_pad2_) |
500 | ||
3484b2de MG |
501 | /* |
502 | * When free pages are below this point, additional steps are taken | |
503 | * when reading the number of free pages to avoid per-cpu counter | |
504 | * drift allowing watermarks to be breached | |
505 | */ | |
506 | unsigned long percpu_drift_mark; | |
507 | ||
508 | #if defined CONFIG_COMPACTION || defined CONFIG_CMA | |
509 | /* pfn where compaction free scanner should start */ | |
510 | unsigned long compact_cached_free_pfn; | |
511 | /* pfn where async and sync compaction migration scanner should start */ | |
512 | unsigned long compact_cached_migrate_pfn[2]; | |
e332f741 MG |
513 | unsigned long compact_init_migrate_pfn; |
514 | unsigned long compact_init_free_pfn; | |
3484b2de MG |
515 | #endif |
516 | ||
517 | #ifdef CONFIG_COMPACTION | |
518 | /* | |
519 | * On compaction failure, 1<<compact_defer_shift compactions | |
520 | * are skipped before trying again. The number attempted since | |
521 | * last failure is tracked with compact_considered. | |
522 | */ | |
523 | unsigned int compact_considered; | |
524 | unsigned int compact_defer_shift; | |
525 | int compact_order_failed; | |
526 | #endif | |
527 | ||
528 | #if defined CONFIG_COMPACTION || defined CONFIG_CMA | |
529 | /* Set to true when the PG_migrate_skip bits should be cleared */ | |
530 | bool compact_blockskip_flush; | |
531 | #endif | |
532 | ||
7cf91a98 JK |
533 | bool contiguous; |
534 | ||
3484b2de MG |
535 | ZONE_PADDING(_pad3_) |
536 | /* Zone statistics */ | |
537 | atomic_long_t vm_stat[NR_VM_ZONE_STAT_ITEMS]; | |
3a321d2a | 538 | atomic_long_t vm_numa_stat[NR_VM_NUMA_STAT_ITEMS]; |
22fc6ecc | 539 | } ____cacheline_internodealigned_in_smp; |
1da177e4 | 540 | |
599d0c95 | 541 | enum pgdat_flags { |
599d0c95 | 542 | PGDAT_DIRTY, /* reclaim scanning has recently found |
d43006d5 MG |
543 | * many dirty file pages at the tail |
544 | * of the LRU. | |
545 | */ | |
599d0c95 | 546 | PGDAT_WRITEBACK, /* reclaim scanning has recently found |
283aba9f MG |
547 | * many pages under writeback |
548 | */ | |
a5f5f91d | 549 | PGDAT_RECLAIM_LOCKED, /* prevents concurrent reclaim */ |
57054651 | 550 | }; |
e815af95 | 551 | |
73444bc4 MG |
552 | enum zone_flags { |
553 | ZONE_BOOSTED_WATERMARK, /* zone recently boosted watermarks. | |
554 | * Cleared when kswapd is woken. | |
555 | */ | |
556 | }; | |
557 | ||
9705bea5 AK |
558 | static inline unsigned long zone_managed_pages(struct zone *zone) |
559 | { | |
560 | return (unsigned long)atomic_long_read(&zone->managed_pages); | |
561 | } | |
562 | ||
f9228b20 | 563 | static inline unsigned long zone_end_pfn(const struct zone *zone) |
108bcc96 CS |
564 | { |
565 | return zone->zone_start_pfn + zone->spanned_pages; | |
566 | } | |
567 | ||
568 | static inline bool zone_spans_pfn(const struct zone *zone, unsigned long pfn) | |
569 | { | |
570 | return zone->zone_start_pfn <= pfn && pfn < zone_end_pfn(zone); | |
571 | } | |
572 | ||
2a6e3ebe CS |
573 | static inline bool zone_is_initialized(struct zone *zone) |
574 | { | |
9dcb8b68 | 575 | return zone->initialized; |
2a6e3ebe CS |
576 | } |
577 | ||
578 | static inline bool zone_is_empty(struct zone *zone) | |
579 | { | |
580 | return zone->spanned_pages == 0; | |
581 | } | |
582 | ||
f1dd2cd1 MH |
583 | /* |
584 | * Return true if [start_pfn, start_pfn + nr_pages) range has a non-empty | |
585 | * intersection with the given zone | |
586 | */ | |
587 | static inline bool zone_intersects(struct zone *zone, | |
588 | unsigned long start_pfn, unsigned long nr_pages) | |
589 | { | |
590 | if (zone_is_empty(zone)) | |
591 | return false; | |
592 | if (start_pfn >= zone_end_pfn(zone) || | |
593 | start_pfn + nr_pages <= zone->zone_start_pfn) | |
594 | return false; | |
595 | ||
596 | return true; | |
597 | } | |
598 | ||
1da177e4 LT |
599 | /* |
600 | * The "priority" of VM scanning is how much of the queues we will scan in one | |
601 | * go. A value of 12 for DEF_PRIORITY implies that we will scan 1/4096th of the | |
602 | * queues ("queue_length >> 12") during an aging round. | |
603 | */ | |
604 | #define DEF_PRIORITY 12 | |
605 | ||
9276b1bc PJ |
606 | /* Maximum number of zones on a zonelist */ |
607 | #define MAX_ZONES_PER_ZONELIST (MAX_NUMNODES * MAX_NR_ZONES) | |
608 | ||
c00eb15a YB |
609 | enum { |
610 | ZONELIST_FALLBACK, /* zonelist with fallback */ | |
9276b1bc | 611 | #ifdef CONFIG_NUMA |
c00eb15a YB |
612 | /* |
613 | * The NUMA zonelists are doubled because we need zonelists that | |
614 | * restrict the allocations to a single node for __GFP_THISNODE. | |
615 | */ | |
616 | ZONELIST_NOFALLBACK, /* zonelist without fallback (__GFP_THISNODE) */ | |
9276b1bc | 617 | #endif |
c00eb15a YB |
618 | MAX_ZONELISTS |
619 | }; | |
9276b1bc | 620 | |
dd1a239f MG |
621 | /* |
622 | * This struct contains information about a zone in a zonelist. It is stored | |
623 | * here to avoid dereferences into large structures and lookups of tables | |
624 | */ | |
625 | struct zoneref { | |
626 | struct zone *zone; /* Pointer to actual zone */ | |
627 | int zone_idx; /* zone_idx(zoneref->zone) */ | |
628 | }; | |
629 | ||
1da177e4 LT |
630 | /* |
631 | * One allocation request operates on a zonelist. A zonelist | |
632 | * is a list of zones, the first one is the 'goal' of the | |
633 | * allocation, the other zones are fallback zones, in decreasing | |
634 | * priority. | |
635 | * | |
dd1a239f MG |
636 | * To speed the reading of the zonelist, the zonerefs contain the zone index |
637 | * of the entry being read. Helper functions to access information given | |
638 | * a struct zoneref are | |
639 | * | |
640 | * zonelist_zone() - Return the struct zone * for an entry in _zonerefs | |
641 | * zonelist_zone_idx() - Return the index of the zone for an entry | |
642 | * zonelist_node_idx() - Return the index of the node for an entry | |
1da177e4 LT |
643 | */ |
644 | struct zonelist { | |
dd1a239f | 645 | struct zoneref _zonerefs[MAX_ZONES_PER_ZONELIST + 1]; |
1da177e4 LT |
646 | }; |
647 | ||
5b99cd0e HC |
648 | #ifndef CONFIG_DISCONTIGMEM |
649 | /* The array of struct pages - for discontigmem use pgdat->lmem_map */ | |
650 | extern struct page *mem_map; | |
651 | #endif | |
652 | ||
364c1eeb YS |
653 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
654 | struct deferred_split { | |
655 | spinlock_t split_queue_lock; | |
656 | struct list_head split_queue; | |
657 | unsigned long split_queue_len; | |
658 | }; | |
659 | #endif | |
660 | ||
1da177e4 | 661 | /* |
1da177e4 | 662 | * On NUMA machines, each NUMA node would have a pg_data_t to describe |
618b8c20 NB |
663 | * it's memory layout. On UMA machines there is a single pglist_data which |
664 | * describes the whole memory. | |
1da177e4 LT |
665 | * |
666 | * Memory statistics and page replacement data structures are maintained on a | |
667 | * per-zone basis. | |
668 | */ | |
1da177e4 LT |
669 | typedef struct pglist_data { |
670 | struct zone node_zones[MAX_NR_ZONES]; | |
523b9458 | 671 | struct zonelist node_zonelists[MAX_ZONELISTS]; |
1da177e4 | 672 | int nr_zones; |
52d4b9ac | 673 | #ifdef CONFIG_FLAT_NODE_MEM_MAP /* means !SPARSEMEM */ |
1da177e4 | 674 | struct page *node_mem_map; |
eefa864b JK |
675 | #ifdef CONFIG_PAGE_EXTENSION |
676 | struct page_ext *node_page_ext; | |
677 | #endif | |
d41dee36 | 678 | #endif |
3a2d7fa8 | 679 | #if defined(CONFIG_MEMORY_HOTPLUG) || defined(CONFIG_DEFERRED_STRUCT_PAGE_INIT) |
208d54e5 | 680 | /* |
fa004ab7 WY |
681 | * Must be held any time you expect node_start_pfn, |
682 | * node_present_pages, node_spanned_pages or nr_zones to stay constant. | |
208d54e5 | 683 | * |
114d4b79 | 684 | * pgdat_resize_lock() and pgdat_resize_unlock() are provided to |
3a2d7fa8 PT |
685 | * manipulate node_size_lock without checking for CONFIG_MEMORY_HOTPLUG |
686 | * or CONFIG_DEFERRED_STRUCT_PAGE_INIT. | |
114d4b79 | 687 | * |
72c3b51b | 688 | * Nests above zone->lock and zone->span_seqlock |
208d54e5 DH |
689 | */ |
690 | spinlock_t node_size_lock; | |
691 | #endif | |
1da177e4 LT |
692 | unsigned long node_start_pfn; |
693 | unsigned long node_present_pages; /* total number of physical pages */ | |
694 | unsigned long node_spanned_pages; /* total size of physical page | |
695 | range, including holes */ | |
696 | int node_id; | |
1da177e4 | 697 | wait_queue_head_t kswapd_wait; |
5515061d | 698 | wait_queue_head_t pfmemalloc_wait; |
bfc8c901 VD |
699 | struct task_struct *kswapd; /* Protected by |
700 | mem_hotplug_begin/end() */ | |
38087d9b | 701 | int kswapd_order; |
97a225e6 | 702 | enum zone_type kswapd_highest_zoneidx; |
38087d9b | 703 | |
c73322d0 JW |
704 | int kswapd_failures; /* Number of 'reclaimed == 0' runs */ |
705 | ||
698b1b30 VB |
706 | #ifdef CONFIG_COMPACTION |
707 | int kcompactd_max_order; | |
97a225e6 | 708 | enum zone_type kcompactd_highest_zoneidx; |
698b1b30 VB |
709 | wait_queue_head_t kcompactd_wait; |
710 | struct task_struct *kcompactd; | |
8177a420 | 711 | #endif |
281e3726 MG |
712 | /* |
713 | * This is a per-node reserve of pages that are not available | |
714 | * to userspace allocations. | |
715 | */ | |
716 | unsigned long totalreserve_pages; | |
717 | ||
a5f5f91d MG |
718 | #ifdef CONFIG_NUMA |
719 | /* | |
0a3c5772 | 720 | * node reclaim becomes active if more unmapped pages exist. |
a5f5f91d MG |
721 | */ |
722 | unsigned long min_unmapped_pages; | |
723 | unsigned long min_slab_pages; | |
724 | #endif /* CONFIG_NUMA */ | |
725 | ||
a52633d8 MG |
726 | /* Write-intensive fields used by page reclaim */ |
727 | ZONE_PADDING(_pad1_) | |
728 | spinlock_t lru_lock; | |
3a80a7fa MG |
729 | |
730 | #ifdef CONFIG_DEFERRED_STRUCT_PAGE_INIT | |
731 | /* | |
732 | * If memory initialisation on large machines is deferred then this | |
733 | * is the first PFN that needs to be initialised. | |
734 | */ | |
735 | unsigned long first_deferred_pfn; | |
736 | #endif /* CONFIG_DEFERRED_STRUCT_PAGE_INIT */ | |
a3d0a918 KS |
737 | |
738 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE | |
364c1eeb | 739 | struct deferred_split deferred_split_queue; |
a3d0a918 | 740 | #endif |
75ef7184 | 741 | |
599d0c95 | 742 | /* Fields commonly accessed by the page reclaim scanner */ |
867e5e1d JW |
743 | |
744 | /* | |
745 | * NOTE: THIS IS UNUSED IF MEMCG IS ENABLED. | |
746 | * | |
747 | * Use mem_cgroup_lruvec() to look up lruvecs. | |
748 | */ | |
749 | struct lruvec __lruvec; | |
599d0c95 | 750 | |
599d0c95 MG |
751 | unsigned long flags; |
752 | ||
753 | ZONE_PADDING(_pad2_) | |
754 | ||
75ef7184 MG |
755 | /* Per-node vmstats */ |
756 | struct per_cpu_nodestat __percpu *per_cpu_nodestats; | |
757 | atomic_long_t vm_stat[NR_VM_NODE_STAT_ITEMS]; | |
1da177e4 LT |
758 | } pg_data_t; |
759 | ||
760 | #define node_present_pages(nid) (NODE_DATA(nid)->node_present_pages) | |
761 | #define node_spanned_pages(nid) (NODE_DATA(nid)->node_spanned_pages) | |
d41dee36 | 762 | #ifdef CONFIG_FLAT_NODE_MEM_MAP |
408fde81 | 763 | #define pgdat_page_nr(pgdat, pagenr) ((pgdat)->node_mem_map + (pagenr)) |
d41dee36 AW |
764 | #else |
765 | #define pgdat_page_nr(pgdat, pagenr) pfn_to_page((pgdat)->node_start_pfn + (pagenr)) | |
766 | #endif | |
408fde81 | 767 | #define nid_page_nr(nid, pagenr) pgdat_page_nr(NODE_DATA(nid),(pagenr)) |
1da177e4 | 768 | |
c6830c22 | 769 | #define node_start_pfn(nid) (NODE_DATA(nid)->node_start_pfn) |
da3649e1 | 770 | #define node_end_pfn(nid) pgdat_end_pfn(NODE_DATA(nid)) |
c6830c22 | 771 | |
da3649e1 CS |
772 | static inline unsigned long pgdat_end_pfn(pg_data_t *pgdat) |
773 | { | |
774 | return pgdat->node_start_pfn + pgdat->node_spanned_pages; | |
775 | } | |
776 | ||
777 | static inline bool pgdat_is_empty(pg_data_t *pgdat) | |
778 | { | |
779 | return !pgdat->node_start_pfn && !pgdat->node_spanned_pages; | |
780 | } | |
c6830c22 | 781 | |
208d54e5 DH |
782 | #include <linux/memory_hotplug.h> |
783 | ||
72675e13 | 784 | void build_all_zonelists(pg_data_t *pgdat); |
5ecd9d40 | 785 | void wakeup_kswapd(struct zone *zone, gfp_t gfp_mask, int order, |
97a225e6 | 786 | enum zone_type highest_zoneidx); |
86a294a8 | 787 | bool __zone_watermark_ok(struct zone *z, unsigned int order, unsigned long mark, |
97a225e6 | 788 | int highest_zoneidx, unsigned int alloc_flags, |
86a294a8 | 789 | long free_pages); |
7aeb09f9 | 790 | bool zone_watermark_ok(struct zone *z, unsigned int order, |
97a225e6 | 791 | unsigned long mark, int highest_zoneidx, |
c603844b | 792 | unsigned int alloc_flags); |
7aeb09f9 | 793 | bool zone_watermark_ok_safe(struct zone *z, unsigned int order, |
97a225e6 | 794 | unsigned long mark, int highest_zoneidx); |
a2f3aa02 DH |
795 | enum memmap_context { |
796 | MEMMAP_EARLY, | |
797 | MEMMAP_HOTPLUG, | |
798 | }; | |
dc0bbf3b | 799 | extern void init_currently_empty_zone(struct zone *zone, unsigned long start_pfn, |
b171e409 | 800 | unsigned long size); |
718127cc | 801 | |
bea8c150 | 802 | extern void lruvec_init(struct lruvec *lruvec); |
7f5e86c2 | 803 | |
599d0c95 | 804 | static inline struct pglist_data *lruvec_pgdat(struct lruvec *lruvec) |
7f5e86c2 | 805 | { |
c255a458 | 806 | #ifdef CONFIG_MEMCG |
599d0c95 | 807 | return lruvec->pgdat; |
7f5e86c2 | 808 | #else |
867e5e1d | 809 | return container_of(lruvec, struct pglist_data, __lruvec); |
7f5e86c2 KK |
810 | #endif |
811 | } | |
812 | ||
fd538803 | 813 | extern unsigned long lruvec_lru_size(struct lruvec *lruvec, enum lru_list lru, int zone_idx); |
23047a96 | 814 | |
1da177e4 LT |
815 | #ifdef CONFIG_HAVE_MEMORY_PRESENT |
816 | void memory_present(int nid, unsigned long start, unsigned long end); | |
817 | #else | |
818 | static inline void memory_present(int nid, unsigned long start, unsigned long end) {} | |
819 | #endif | |
820 | ||
9def36e0 LG |
821 | #if defined(CONFIG_SPARSEMEM) |
822 | void memblocks_present(void); | |
823 | #else | |
824 | static inline void memblocks_present(void) {} | |
825 | #endif | |
826 | ||
7aac7898 LS |
827 | #ifdef CONFIG_HAVE_MEMORYLESS_NODES |
828 | int local_memory_node(int node_id); | |
829 | #else | |
830 | static inline int local_memory_node(int node_id) { return node_id; }; | |
831 | #endif | |
832 | ||
1da177e4 LT |
833 | /* |
834 | * zone_idx() returns 0 for the ZONE_DMA zone, 1 for the ZONE_NORMAL zone, etc. | |
835 | */ | |
836 | #define zone_idx(zone) ((zone) - (zone)->zone_pgdat->node_zones) | |
837 | ||
6aa303de MG |
838 | /* |
839 | * Returns true if a zone has pages managed by the buddy allocator. | |
840 | * All the reclaim decisions have to use this function rather than | |
841 | * populated_zone(). If the whole zone is reserved then we can easily | |
842 | * end up with populated_zone() && !managed_zone(). | |
843 | */ | |
844 | static inline bool managed_zone(struct zone *zone) | |
845 | { | |
9705bea5 | 846 | return zone_managed_pages(zone); |
6aa303de MG |
847 | } |
848 | ||
849 | /* Returns true if a zone has memory */ | |
850 | static inline bool populated_zone(struct zone *zone) | |
f3fe6512 | 851 | { |
6aa303de | 852 | return zone->present_pages; |
f3fe6512 CK |
853 | } |
854 | ||
c1093b74 PT |
855 | #ifdef CONFIG_NUMA |
856 | static inline int zone_to_nid(struct zone *zone) | |
857 | { | |
858 | return zone->node; | |
859 | } | |
860 | ||
861 | static inline void zone_set_nid(struct zone *zone, int nid) | |
862 | { | |
863 | zone->node = nid; | |
864 | } | |
865 | #else | |
866 | static inline int zone_to_nid(struct zone *zone) | |
867 | { | |
868 | return 0; | |
869 | } | |
870 | ||
871 | static inline void zone_set_nid(struct zone *zone, int nid) {} | |
872 | #endif | |
873 | ||
2a1e274a MG |
874 | extern int movable_zone; |
875 | ||
d7e4a2ea | 876 | #ifdef CONFIG_HIGHMEM |
2a1e274a MG |
877 | static inline int zone_movable_is_highmem(void) |
878 | { | |
3f08a302 | 879 | #ifdef CONFIG_NEED_MULTIPLE_NODES |
2a1e274a MG |
880 | return movable_zone == ZONE_HIGHMEM; |
881 | #else | |
d7e4a2ea | 882 | return (ZONE_MOVABLE - 1) == ZONE_HIGHMEM; |
2a1e274a MG |
883 | #endif |
884 | } | |
d7e4a2ea | 885 | #endif |
2a1e274a | 886 | |
2f1b6248 | 887 | static inline int is_highmem_idx(enum zone_type idx) |
1da177e4 | 888 | { |
e53ef38d | 889 | #ifdef CONFIG_HIGHMEM |
2a1e274a MG |
890 | return (idx == ZONE_HIGHMEM || |
891 | (idx == ZONE_MOVABLE && zone_movable_is_highmem())); | |
e53ef38d CL |
892 | #else |
893 | return 0; | |
894 | #endif | |
1da177e4 LT |
895 | } |
896 | ||
1da177e4 | 897 | /** |
b4a991ec | 898 | * is_highmem - helper function to quickly check if a struct zone is a |
1da177e4 LT |
899 | * highmem zone or not. This is an attempt to keep references |
900 | * to ZONE_{DMA/NORMAL/HIGHMEM/etc} in general code to a minimum. | |
901 | * @zone - pointer to struct zone variable | |
902 | */ | |
903 | static inline int is_highmem(struct zone *zone) | |
904 | { | |
e53ef38d | 905 | #ifdef CONFIG_HIGHMEM |
29f9cb53 | 906 | return is_highmem_idx(zone_idx(zone)); |
e53ef38d CL |
907 | #else |
908 | return 0; | |
909 | #endif | |
1da177e4 LT |
910 | } |
911 | ||
1da177e4 LT |
912 | /* These two functions are used to setup the per zone pages min values */ |
913 | struct ctl_table; | |
8d65af78 | 914 | int min_free_kbytes_sysctl_handler(struct ctl_table *, int, |
1da177e4 | 915 | void __user *, size_t *, loff_t *); |
1c30844d MG |
916 | int watermark_boost_factor_sysctl_handler(struct ctl_table *, int, |
917 | void __user *, size_t *, loff_t *); | |
795ae7a0 JW |
918 | int watermark_scale_factor_sysctl_handler(struct ctl_table *, int, |
919 | void __user *, size_t *, loff_t *); | |
d3cda233 | 920 | extern int sysctl_lowmem_reserve_ratio[MAX_NR_ZONES]; |
8d65af78 | 921 | int lowmem_reserve_ratio_sysctl_handler(struct ctl_table *, int, |
1da177e4 | 922 | void __user *, size_t *, loff_t *); |
8d65af78 | 923 | int percpu_pagelist_fraction_sysctl_handler(struct ctl_table *, int, |
8ad4b1fb | 924 | void __user *, size_t *, loff_t *); |
9614634f | 925 | int sysctl_min_unmapped_ratio_sysctl_handler(struct ctl_table *, int, |
8d65af78 | 926 | void __user *, size_t *, loff_t *); |
0ff38490 | 927 | int sysctl_min_slab_ratio_sysctl_handler(struct ctl_table *, int, |
8d65af78 | 928 | void __user *, size_t *, loff_t *); |
1da177e4 | 929 | |
f0c0b2b8 | 930 | extern int numa_zonelist_order_handler(struct ctl_table *, int, |
8d65af78 | 931 | void __user *, size_t *, loff_t *); |
f0c0b2b8 | 932 | extern char numa_zonelist_order[]; |
c9bff3ee | 933 | #define NUMA_ZONELIST_ORDER_LEN 16 |
f0c0b2b8 | 934 | |
93b7504e | 935 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
1da177e4 LT |
936 | |
937 | extern struct pglist_data contig_page_data; | |
938 | #define NODE_DATA(nid) (&contig_page_data) | |
939 | #define NODE_MEM_MAP(nid) mem_map | |
1da177e4 | 940 | |
93b7504e | 941 | #else /* CONFIG_NEED_MULTIPLE_NODES */ |
1da177e4 LT |
942 | |
943 | #include <asm/mmzone.h> | |
944 | ||
93b7504e | 945 | #endif /* !CONFIG_NEED_MULTIPLE_NODES */ |
348f8b6c | 946 | |
95144c78 KH |
947 | extern struct pglist_data *first_online_pgdat(void); |
948 | extern struct pglist_data *next_online_pgdat(struct pglist_data *pgdat); | |
949 | extern struct zone *next_zone(struct zone *zone); | |
8357f869 KH |
950 | |
951 | /** | |
12d15f0d | 952 | * for_each_online_pgdat - helper macro to iterate over all online nodes |
8357f869 KH |
953 | * @pgdat - pointer to a pg_data_t variable |
954 | */ | |
955 | #define for_each_online_pgdat(pgdat) \ | |
956 | for (pgdat = first_online_pgdat(); \ | |
957 | pgdat; \ | |
958 | pgdat = next_online_pgdat(pgdat)) | |
8357f869 KH |
959 | /** |
960 | * for_each_zone - helper macro to iterate over all memory zones | |
961 | * @zone - pointer to struct zone variable | |
962 | * | |
963 | * The user only needs to declare the zone variable, for_each_zone | |
964 | * fills it in. | |
965 | */ | |
966 | #define for_each_zone(zone) \ | |
967 | for (zone = (first_online_pgdat())->node_zones; \ | |
968 | zone; \ | |
969 | zone = next_zone(zone)) | |
970 | ||
ee99c71c KM |
971 | #define for_each_populated_zone(zone) \ |
972 | for (zone = (first_online_pgdat())->node_zones; \ | |
973 | zone; \ | |
974 | zone = next_zone(zone)) \ | |
975 | if (!populated_zone(zone)) \ | |
976 | ; /* do nothing */ \ | |
977 | else | |
978 | ||
dd1a239f MG |
979 | static inline struct zone *zonelist_zone(struct zoneref *zoneref) |
980 | { | |
981 | return zoneref->zone; | |
982 | } | |
983 | ||
984 | static inline int zonelist_zone_idx(struct zoneref *zoneref) | |
985 | { | |
986 | return zoneref->zone_idx; | |
987 | } | |
988 | ||
989 | static inline int zonelist_node_idx(struct zoneref *zoneref) | |
990 | { | |
c1093b74 | 991 | return zone_to_nid(zoneref->zone); |
dd1a239f MG |
992 | } |
993 | ||
682a3385 MG |
994 | struct zoneref *__next_zones_zonelist(struct zoneref *z, |
995 | enum zone_type highest_zoneidx, | |
996 | nodemask_t *nodes); | |
997 | ||
19770b32 MG |
998 | /** |
999 | * 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 | |
1000 | * @z - The cursor used as a starting point for the search | |
1001 | * @highest_zoneidx - The zone index of the highest zone to return | |
1002 | * @nodes - An optional nodemask to filter the zonelist with | |
19770b32 MG |
1003 | * |
1004 | * This function returns the next zone at or below a given zone index that is | |
1005 | * within the allowed nodemask using a cursor as the starting point for the | |
5bead2a0 MG |
1006 | * search. The zoneref returned is a cursor that represents the current zone |
1007 | * being examined. It should be advanced by one before calling | |
1008 | * next_zones_zonelist again. | |
19770b32 | 1009 | */ |
682a3385 | 1010 | static __always_inline struct zoneref *next_zones_zonelist(struct zoneref *z, |
19770b32 | 1011 | enum zone_type highest_zoneidx, |
682a3385 MG |
1012 | nodemask_t *nodes) |
1013 | { | |
1014 | if (likely(!nodes && zonelist_zone_idx(z) <= highest_zoneidx)) | |
1015 | return z; | |
1016 | return __next_zones_zonelist(z, highest_zoneidx, nodes); | |
1017 | } | |
dd1a239f | 1018 | |
19770b32 MG |
1019 | /** |
1020 | * first_zones_zonelist - Returns the first zone at or below highest_zoneidx within the allowed nodemask in a zonelist | |
1021 | * @zonelist - The zonelist to search for a suitable zone | |
1022 | * @highest_zoneidx - The zone index of the highest zone to return | |
1023 | * @nodes - An optional nodemask to filter the zonelist with | |
ea57485a | 1024 | * @return - Zoneref pointer for the first suitable zone found (see below) |
19770b32 MG |
1025 | * |
1026 | * This function returns the first zone at or below a given zone index that is | |
1027 | * within the allowed nodemask. The zoneref returned is a cursor that can be | |
5bead2a0 MG |
1028 | * used to iterate the zonelist with next_zones_zonelist by advancing it by |
1029 | * one before calling. | |
ea57485a VB |
1030 | * |
1031 | * When no eligible zone is found, zoneref->zone is NULL (zoneref itself is | |
1032 | * never NULL). This may happen either genuinely, or due to concurrent nodemask | |
1033 | * update due to cpuset modification. | |
19770b32 | 1034 | */ |
dd1a239f | 1035 | static inline struct zoneref *first_zones_zonelist(struct zonelist *zonelist, |
19770b32 | 1036 | enum zone_type highest_zoneidx, |
c33d6c06 | 1037 | nodemask_t *nodes) |
54a6eb5c | 1038 | { |
c33d6c06 | 1039 | return next_zones_zonelist(zonelist->_zonerefs, |
05891fb0 | 1040 | highest_zoneidx, nodes); |
54a6eb5c MG |
1041 | } |
1042 | ||
19770b32 MG |
1043 | /** |
1044 | * 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 | |
1045 | * @zone - The current zone in the iterator | |
84218b55 | 1046 | * @z - The current pointer within zonelist->_zonerefs being iterated |
19770b32 MG |
1047 | * @zlist - The zonelist being iterated |
1048 | * @highidx - The zone index of the highest zone to return | |
1049 | * @nodemask - Nodemask allowed by the allocator | |
1050 | * | |
1051 | * This iterator iterates though all zones at or below a given zone index and | |
1052 | * within a given nodemask | |
1053 | */ | |
1054 | #define for_each_zone_zonelist_nodemask(zone, z, zlist, highidx, nodemask) \ | |
c33d6c06 | 1055 | for (z = first_zones_zonelist(zlist, highidx, nodemask), zone = zonelist_zone(z); \ |
19770b32 | 1056 | zone; \ |
05891fb0 | 1057 | z = next_zones_zonelist(++z, highidx, nodemask), \ |
c33d6c06 MG |
1058 | zone = zonelist_zone(z)) |
1059 | ||
1060 | #define for_next_zone_zonelist_nodemask(zone, z, zlist, highidx, nodemask) \ | |
1061 | for (zone = z->zone; \ | |
1062 | zone; \ | |
1063 | z = next_zones_zonelist(++z, highidx, nodemask), \ | |
1064 | zone = zonelist_zone(z)) | |
1065 | ||
54a6eb5c MG |
1066 | |
1067 | /** | |
1068 | * for_each_zone_zonelist - helper macro to iterate over valid zones in a zonelist at or below a given zone index | |
1069 | * @zone - The current zone in the iterator | |
1070 | * @z - The current pointer within zonelist->zones being iterated | |
1071 | * @zlist - The zonelist being iterated | |
1072 | * @highidx - The zone index of the highest zone to return | |
1073 | * | |
1074 | * This iterator iterates though all zones at or below a given zone index. | |
1075 | */ | |
1076 | #define for_each_zone_zonelist(zone, z, zlist, highidx) \ | |
19770b32 | 1077 | for_each_zone_zonelist_nodemask(zone, z, zlist, highidx, NULL) |
54a6eb5c | 1078 | |
d41dee36 AW |
1079 | #ifdef CONFIG_SPARSEMEM |
1080 | #include <asm/sparsemem.h> | |
1081 | #endif | |
1082 | ||
2bdaf115 AW |
1083 | #ifdef CONFIG_FLATMEM |
1084 | #define pfn_to_nid(pfn) (0) | |
1085 | #endif | |
1086 | ||
d41dee36 AW |
1087 | #ifdef CONFIG_SPARSEMEM |
1088 | ||
1089 | /* | |
1090 | * SECTION_SHIFT #bits space required to store a section # | |
1091 | * | |
1092 | * PA_SECTION_SHIFT physical address to/from section number | |
1093 | * PFN_SECTION_SHIFT pfn to/from section number | |
1094 | */ | |
d41dee36 AW |
1095 | #define PA_SECTION_SHIFT (SECTION_SIZE_BITS) |
1096 | #define PFN_SECTION_SHIFT (SECTION_SIZE_BITS - PAGE_SHIFT) | |
1097 | ||
1098 | #define NR_MEM_SECTIONS (1UL << SECTIONS_SHIFT) | |
1099 | ||
1100 | #define PAGES_PER_SECTION (1UL << PFN_SECTION_SHIFT) | |
1101 | #define PAGE_SECTION_MASK (~(PAGES_PER_SECTION-1)) | |
1102 | ||
835c134e | 1103 | #define SECTION_BLOCKFLAGS_BITS \ |
d9c23400 | 1104 | ((1UL << (PFN_SECTION_SHIFT - pageblock_order)) * NR_PAGEBLOCK_BITS) |
835c134e | 1105 | |
d41dee36 AW |
1106 | #if (MAX_ORDER - 1 + PAGE_SHIFT) > SECTION_SIZE_BITS |
1107 | #error Allocator MAX_ORDER exceeds SECTION_SIZE | |
1108 | #endif | |
1109 | ||
1dd2bfc8 YI |
1110 | static inline unsigned long pfn_to_section_nr(unsigned long pfn) |
1111 | { | |
1112 | return pfn >> PFN_SECTION_SHIFT; | |
1113 | } | |
1114 | static inline unsigned long section_nr_to_pfn(unsigned long sec) | |
1115 | { | |
1116 | return sec << PFN_SECTION_SHIFT; | |
1117 | } | |
e3c40f37 | 1118 | |
a539f353 DK |
1119 | #define SECTION_ALIGN_UP(pfn) (((pfn) + PAGES_PER_SECTION - 1) & PAGE_SECTION_MASK) |
1120 | #define SECTION_ALIGN_DOWN(pfn) ((pfn) & PAGE_SECTION_MASK) | |
1121 | ||
f1eca35a | 1122 | #define SUBSECTION_SHIFT 21 |
9ffc1d19 | 1123 | #define SUBSECTION_SIZE (1UL << SUBSECTION_SHIFT) |
f1eca35a DW |
1124 | |
1125 | #define PFN_SUBSECTION_SHIFT (SUBSECTION_SHIFT - PAGE_SHIFT) | |
1126 | #define PAGES_PER_SUBSECTION (1UL << PFN_SUBSECTION_SHIFT) | |
1127 | #define PAGE_SUBSECTION_MASK (~(PAGES_PER_SUBSECTION-1)) | |
1128 | ||
1129 | #if SUBSECTION_SHIFT > SECTION_SIZE_BITS | |
1130 | #error Subsection size exceeds section size | |
1131 | #else | |
1132 | #define SUBSECTIONS_PER_SECTION (1UL << (SECTION_SIZE_BITS - SUBSECTION_SHIFT)) | |
1133 | #endif | |
1134 | ||
a3619190 DW |
1135 | #define SUBSECTION_ALIGN_UP(pfn) ALIGN((pfn), PAGES_PER_SUBSECTION) |
1136 | #define SUBSECTION_ALIGN_DOWN(pfn) ((pfn) & PAGE_SUBSECTION_MASK) | |
1137 | ||
f1eca35a | 1138 | struct mem_section_usage { |
0a9f9f62 | 1139 | #ifdef CONFIG_SPARSEMEM_VMEMMAP |
f1eca35a | 1140 | DECLARE_BITMAP(subsection_map, SUBSECTIONS_PER_SECTION); |
0a9f9f62 | 1141 | #endif |
f1eca35a DW |
1142 | /* See declaration of similar field in struct zone */ |
1143 | unsigned long pageblock_flags[0]; | |
1144 | }; | |
1145 | ||
f46edbd1 DW |
1146 | void subsection_map_init(unsigned long pfn, unsigned long nr_pages); |
1147 | ||
d41dee36 | 1148 | struct page; |
eefa864b | 1149 | struct page_ext; |
d41dee36 | 1150 | struct mem_section { |
29751f69 AW |
1151 | /* |
1152 | * This is, logically, a pointer to an array of struct | |
1153 | * pages. However, it is stored with some other magic. | |
1154 | * (see sparse.c::sparse_init_one_section()) | |
1155 | * | |
30c253e6 AW |
1156 | * Additionally during early boot we encode node id of |
1157 | * the location of the section here to guide allocation. | |
1158 | * (see sparse.c::memory_present()) | |
1159 | * | |
29751f69 AW |
1160 | * Making it a UL at least makes someone do a cast |
1161 | * before using it wrong. | |
1162 | */ | |
1163 | unsigned long section_mem_map; | |
5c0e3066 | 1164 | |
f1eca35a | 1165 | struct mem_section_usage *usage; |
eefa864b JK |
1166 | #ifdef CONFIG_PAGE_EXTENSION |
1167 | /* | |
0c9ad804 | 1168 | * If SPARSEMEM, pgdat doesn't have page_ext pointer. We use |
eefa864b JK |
1169 | * section. (see page_ext.h about this.) |
1170 | */ | |
1171 | struct page_ext *page_ext; | |
1172 | unsigned long pad; | |
1173 | #endif | |
55878e88 CS |
1174 | /* |
1175 | * WARNING: mem_section must be a power-of-2 in size for the | |
1176 | * calculation and use of SECTION_ROOT_MASK to make sense. | |
1177 | */ | |
d41dee36 AW |
1178 | }; |
1179 | ||
3e347261 BP |
1180 | #ifdef CONFIG_SPARSEMEM_EXTREME |
1181 | #define SECTIONS_PER_ROOT (PAGE_SIZE / sizeof (struct mem_section)) | |
1182 | #else | |
1183 | #define SECTIONS_PER_ROOT 1 | |
1184 | #endif | |
802f192e | 1185 | |
3e347261 | 1186 | #define SECTION_NR_TO_ROOT(sec) ((sec) / SECTIONS_PER_ROOT) |
0faa5638 | 1187 | #define NR_SECTION_ROOTS DIV_ROUND_UP(NR_MEM_SECTIONS, SECTIONS_PER_ROOT) |
3e347261 | 1188 | #define SECTION_ROOT_MASK (SECTIONS_PER_ROOT - 1) |
802f192e | 1189 | |
3e347261 | 1190 | #ifdef CONFIG_SPARSEMEM_EXTREME |
83e3c487 | 1191 | extern struct mem_section **mem_section; |
802f192e | 1192 | #else |
3e347261 BP |
1193 | extern struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]; |
1194 | #endif | |
d41dee36 | 1195 | |
f1eca35a DW |
1196 | static inline unsigned long *section_to_usemap(struct mem_section *ms) |
1197 | { | |
1198 | return ms->usage->pageblock_flags; | |
1199 | } | |
1200 | ||
29751f69 AW |
1201 | static inline struct mem_section *__nr_to_section(unsigned long nr) |
1202 | { | |
83e3c487 KS |
1203 | #ifdef CONFIG_SPARSEMEM_EXTREME |
1204 | if (!mem_section) | |
1205 | return NULL; | |
1206 | #endif | |
3e347261 BP |
1207 | if (!mem_section[SECTION_NR_TO_ROOT(nr)]) |
1208 | return NULL; | |
1209 | return &mem_section[SECTION_NR_TO_ROOT(nr)][nr & SECTION_ROOT_MASK]; | |
29751f69 | 1210 | } |
2491f0a2 | 1211 | extern unsigned long __section_nr(struct mem_section *ms); |
f1eca35a | 1212 | extern size_t mem_section_usage_size(void); |
29751f69 AW |
1213 | |
1214 | /* | |
1215 | * We use the lower bits of the mem_map pointer to store | |
def9b71e PT |
1216 | * a little bit of information. The pointer is calculated |
1217 | * as mem_map - section_nr_to_pfn(pnum). The result is | |
1218 | * aligned to the minimum alignment of the two values: | |
1219 | * 1. All mem_map arrays are page-aligned. | |
1220 | * 2. section_nr_to_pfn() always clears PFN_SECTION_SHIFT | |
1221 | * lowest bits. PFN_SECTION_SHIFT is arch-specific | |
1222 | * (equal SECTION_SIZE_BITS - PAGE_SHIFT), and the | |
1223 | * worst combination is powerpc with 256k pages, | |
1224 | * which results in PFN_SECTION_SHIFT equal 6. | |
1225 | * To sum it up, at least 6 bits are available. | |
29751f69 AW |
1226 | */ |
1227 | #define SECTION_MARKED_PRESENT (1UL<<0) | |
1228 | #define SECTION_HAS_MEM_MAP (1UL<<1) | |
2d070eab | 1229 | #define SECTION_IS_ONLINE (1UL<<2) |
326e1b8f DW |
1230 | #define SECTION_IS_EARLY (1UL<<3) |
1231 | #define SECTION_MAP_LAST_BIT (1UL<<4) | |
29751f69 | 1232 | #define SECTION_MAP_MASK (~(SECTION_MAP_LAST_BIT-1)) |
2d070eab | 1233 | #define SECTION_NID_SHIFT 3 |
29751f69 AW |
1234 | |
1235 | static inline struct page *__section_mem_map_addr(struct mem_section *section) | |
1236 | { | |
1237 | unsigned long map = section->section_mem_map; | |
1238 | map &= SECTION_MAP_MASK; | |
1239 | return (struct page *)map; | |
1240 | } | |
1241 | ||
540557b9 | 1242 | static inline int present_section(struct mem_section *section) |
29751f69 | 1243 | { |
802f192e | 1244 | return (section && (section->section_mem_map & SECTION_MARKED_PRESENT)); |
29751f69 AW |
1245 | } |
1246 | ||
540557b9 AW |
1247 | static inline int present_section_nr(unsigned long nr) |
1248 | { | |
1249 | return present_section(__nr_to_section(nr)); | |
1250 | } | |
1251 | ||
1252 | static inline int valid_section(struct mem_section *section) | |
29751f69 | 1253 | { |
802f192e | 1254 | return (section && (section->section_mem_map & SECTION_HAS_MEM_MAP)); |
29751f69 AW |
1255 | } |
1256 | ||
326e1b8f DW |
1257 | static inline int early_section(struct mem_section *section) |
1258 | { | |
1259 | return (section && (section->section_mem_map & SECTION_IS_EARLY)); | |
1260 | } | |
1261 | ||
29751f69 AW |
1262 | static inline int valid_section_nr(unsigned long nr) |
1263 | { | |
1264 | return valid_section(__nr_to_section(nr)); | |
1265 | } | |
1266 | ||
2d070eab MH |
1267 | static inline int online_section(struct mem_section *section) |
1268 | { | |
1269 | return (section && (section->section_mem_map & SECTION_IS_ONLINE)); | |
1270 | } | |
1271 | ||
1272 | static inline int online_section_nr(unsigned long nr) | |
1273 | { | |
1274 | return online_section(__nr_to_section(nr)); | |
1275 | } | |
1276 | ||
1277 | #ifdef CONFIG_MEMORY_HOTPLUG | |
1278 | void online_mem_sections(unsigned long start_pfn, unsigned long end_pfn); | |
1279 | #ifdef CONFIG_MEMORY_HOTREMOVE | |
1280 | void offline_mem_sections(unsigned long start_pfn, unsigned long end_pfn); | |
1281 | #endif | |
1282 | #endif | |
1283 | ||
d41dee36 AW |
1284 | static inline struct mem_section *__pfn_to_section(unsigned long pfn) |
1285 | { | |
29751f69 | 1286 | return __nr_to_section(pfn_to_section_nr(pfn)); |
d41dee36 AW |
1287 | } |
1288 | ||
2491f0a2 | 1289 | extern unsigned long __highest_present_section_nr; |
c4e1be9e | 1290 | |
f46edbd1 DW |
1291 | static inline int subsection_map_index(unsigned long pfn) |
1292 | { | |
1293 | return (pfn & ~(PAGE_SECTION_MASK)) / PAGES_PER_SUBSECTION; | |
1294 | } | |
1295 | ||
1296 | #ifdef CONFIG_SPARSEMEM_VMEMMAP | |
1297 | static inline int pfn_section_valid(struct mem_section *ms, unsigned long pfn) | |
1298 | { | |
1299 | int idx = subsection_map_index(pfn); | |
1300 | ||
1301 | return test_bit(idx, ms->usage->subsection_map); | |
1302 | } | |
1303 | #else | |
1304 | static inline int pfn_section_valid(struct mem_section *ms, unsigned long pfn) | |
1305 | { | |
1306 | return 1; | |
1307 | } | |
1308 | #endif | |
1309 | ||
7b7bf499 | 1310 | #ifndef CONFIG_HAVE_ARCH_PFN_VALID |
d41dee36 AW |
1311 | static inline int pfn_valid(unsigned long pfn) |
1312 | { | |
f46edbd1 DW |
1313 | struct mem_section *ms; |
1314 | ||
d41dee36 AW |
1315 | if (pfn_to_section_nr(pfn) >= NR_MEM_SECTIONS) |
1316 | return 0; | |
f46edbd1 DW |
1317 | ms = __nr_to_section(pfn_to_section_nr(pfn)); |
1318 | if (!valid_section(ms)) | |
1319 | return 0; | |
1320 | /* | |
1321 | * Traditionally early sections always returned pfn_valid() for | |
1322 | * the entire section-sized span. | |
1323 | */ | |
1324 | return early_section(ms) || pfn_section_valid(ms, pfn); | |
d41dee36 | 1325 | } |
7b7bf499 | 1326 | #endif |
d41dee36 | 1327 | |
e03d1f78 | 1328 | static inline int pfn_in_present_section(unsigned long pfn) |
540557b9 AW |
1329 | { |
1330 | if (pfn_to_section_nr(pfn) >= NR_MEM_SECTIONS) | |
1331 | return 0; | |
1332 | return present_section(__nr_to_section(pfn_to_section_nr(pfn))); | |
1333 | } | |
1334 | ||
4c605881 DH |
1335 | static inline unsigned long next_present_section_nr(unsigned long section_nr) |
1336 | { | |
1337 | while (++section_nr <= __highest_present_section_nr) { | |
1338 | if (present_section_nr(section_nr)) | |
1339 | return section_nr; | |
1340 | } | |
1341 | ||
1342 | return -1; | |
1343 | } | |
1344 | ||
d41dee36 AW |
1345 | /* |
1346 | * These are _only_ used during initialisation, therefore they | |
1347 | * can use __initdata ... They could have names to indicate | |
1348 | * this restriction. | |
1349 | */ | |
1350 | #ifdef CONFIG_NUMA | |
161599ff AW |
1351 | #define pfn_to_nid(pfn) \ |
1352 | ({ \ | |
1353 | unsigned long __pfn_to_nid_pfn = (pfn); \ | |
1354 | page_to_nid(pfn_to_page(__pfn_to_nid_pfn)); \ | |
1355 | }) | |
2bdaf115 AW |
1356 | #else |
1357 | #define pfn_to_nid(pfn) (0) | |
d41dee36 AW |
1358 | #endif |
1359 | ||
d41dee36 AW |
1360 | #define early_pfn_valid(pfn) pfn_valid(pfn) |
1361 | void sparse_init(void); | |
1362 | #else | |
1363 | #define sparse_init() do {} while (0) | |
28ae55c9 | 1364 | #define sparse_index_init(_sec, _nid) do {} while (0) |
e03d1f78 | 1365 | #define pfn_in_present_section pfn_valid |
f46edbd1 | 1366 | #define subsection_map_init(_pfn, _nr_pages) do {} while (0) |
d41dee36 AW |
1367 | #endif /* CONFIG_SPARSEMEM */ |
1368 | ||
8a942fde MG |
1369 | /* |
1370 | * During memory init memblocks map pfns to nids. The search is expensive and | |
1371 | * this caches recent lookups. The implementation of __early_pfn_to_nid | |
1372 | * may treat start/end as pfns or sections. | |
1373 | */ | |
1374 | struct mminit_pfnnid_cache { | |
1375 | unsigned long last_start; | |
1376 | unsigned long last_end; | |
1377 | int last_nid; | |
1378 | }; | |
1379 | ||
d41dee36 AW |
1380 | #ifndef early_pfn_valid |
1381 | #define early_pfn_valid(pfn) (1) | |
1382 | #endif | |
1383 | ||
1384 | void memory_present(int nid, unsigned long start, unsigned long end); | |
d41dee36 | 1385 | |
14e07298 AW |
1386 | /* |
1387 | * If it is possible to have holes within a MAX_ORDER_NR_PAGES, then we | |
8bb4e7a2 | 1388 | * need to check pfn validity within that MAX_ORDER_NR_PAGES block. |
14e07298 AW |
1389 | * pfn_valid_within() should be used in this case; we optimise this away |
1390 | * when we have no holes within a MAX_ORDER_NR_PAGES block. | |
1391 | */ | |
1392 | #ifdef CONFIG_HOLES_IN_ZONE | |
1393 | #define pfn_valid_within(pfn) pfn_valid(pfn) | |
1394 | #else | |
1395 | #define pfn_valid_within(pfn) (1) | |
1396 | #endif | |
1397 | ||
eb33575c MG |
1398 | #ifdef CONFIG_ARCH_HAS_HOLES_MEMORYMODEL |
1399 | /* | |
1400 | * pfn_valid() is meant to be able to tell if a given PFN has valid memmap | |
2d070eab MH |
1401 | * associated with it or not. This means that a struct page exists for this |
1402 | * pfn. The caller cannot assume the page is fully initialized in general. | |
1403 | * Hotplugable pages might not have been onlined yet. pfn_to_online_page() | |
1404 | * will ensure the struct page is fully online and initialized. Special pages | |
1405 | * (e.g. ZONE_DEVICE) are never onlined and should be treated accordingly. | |
1406 | * | |
1407 | * In FLATMEM, it is expected that holes always have valid memmap as long as | |
1408 | * there is valid PFNs either side of the hole. In SPARSEMEM, it is assumed | |
1409 | * that a valid section has a memmap for the entire section. | |
eb33575c MG |
1410 | * |
1411 | * However, an ARM, and maybe other embedded architectures in the future | |
1412 | * free memmap backing holes to save memory on the assumption the memmap is | |
1413 | * never used. The page_zone linkages are then broken even though pfn_valid() | |
1414 | * returns true. A walker of the full memmap must then do this additional | |
1415 | * check to ensure the memmap they are looking at is sane by making sure | |
1416 | * the zone and PFN linkages are still valid. This is expensive, but walkers | |
1417 | * of the full memmap are extremely rare. | |
1418 | */ | |
5b80287a | 1419 | bool memmap_valid_within(unsigned long pfn, |
eb33575c MG |
1420 | struct page *page, struct zone *zone); |
1421 | #else | |
5b80287a | 1422 | static inline bool memmap_valid_within(unsigned long pfn, |
eb33575c MG |
1423 | struct page *page, struct zone *zone) |
1424 | { | |
5b80287a | 1425 | return true; |
eb33575c MG |
1426 | } |
1427 | #endif /* CONFIG_ARCH_HAS_HOLES_MEMORYMODEL */ | |
1428 | ||
97965478 | 1429 | #endif /* !__GENERATING_BOUNDS.H */ |
1da177e4 | 1430 | #endif /* !__ASSEMBLY__ */ |
1da177e4 | 1431 | #endif /* _LINUX_MMZONE_H */ |