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