]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - mm/internal.h
mm: memory: add orig_pmd to struct vm_fault
[mirror_ubuntu-jammy-kernel.git] / mm / internal.h
CommitLineData
2874c5fd 1/* SPDX-License-Identifier: GPL-2.0-or-later */
1da177e4
LT
2/* internal.h: mm/ internal definitions
3 *
4 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
1da177e4 6 */
0f8053a5
NP
7#ifndef __MM_INTERNAL_H
8#define __MM_INTERNAL_H
9
29f175d1 10#include <linux/fs.h>
0f8053a5 11#include <linux/mm.h>
e9b61f19 12#include <linux/pagemap.h>
edf14cdb 13#include <linux/tracepoint-defs.h>
1da177e4 14
dd56b046
MG
15/*
16 * The set of flags that only affect watermark checking and reclaim
17 * behaviour. This is used by the MM to obey the caller constraints
18 * about IO, FS and watermark checking while ignoring placement
19 * hints such as HIGHMEM usage.
20 */
21#define GFP_RECLAIM_MASK (__GFP_RECLAIM|__GFP_HIGH|__GFP_IO|__GFP_FS|\
dcda9b04 22 __GFP_NOWARN|__GFP_RETRY_MAYFAIL|__GFP_NOFAIL|\
e838a45f
MG
23 __GFP_NORETRY|__GFP_MEMALLOC|__GFP_NOMEMALLOC|\
24 __GFP_ATOMIC)
dd56b046
MG
25
26/* The GFP flags allowed during early boot */
27#define GFP_BOOT_MASK (__GFP_BITS_MASK & ~(__GFP_RECLAIM|__GFP_IO|__GFP_FS))
28
29/* Control allocation cpuset and node placement constraints */
30#define GFP_CONSTRAINT_MASK (__GFP_HARDWALL|__GFP_THISNODE)
31
32/* Do not use these with a slab allocator */
33#define GFP_SLAB_BUG_MASK (__GFP_DMA32|__GFP_HIGHMEM|~__GFP_BITS_MASK)
34
62906027
NP
35void page_writeback_init(void);
36
2b740303 37vm_fault_t do_swap_page(struct vm_fault *vmf);
8a966ed7 38
42b77728
JB
39void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *start_vma,
40 unsigned long floor, unsigned long ceiling);
41
9c276cc6 42static inline bool can_madv_lru_vma(struct vm_area_struct *vma)
23519073
KS
43{
44 return !(vma->vm_flags & (VM_LOCKED|VM_HUGETLB|VM_PFNMAP));
45}
46
aac45363
MH
47void unmap_page_range(struct mmu_gather *tlb,
48 struct vm_area_struct *vma,
49 unsigned long addr, unsigned long end,
50 struct zap_details *details);
51
7b3df3b9
DH
52void do_page_cache_ra(struct readahead_control *, unsigned long nr_to_read,
53 unsigned long lookahead_size);
fcd9ae4f 54void force_page_cache_ra(struct readahead_control *, unsigned long nr);
7b3df3b9
DH
55static inline void force_page_cache_readahead(struct address_space *mapping,
56 struct file *file, pgoff_t index, unsigned long nr_to_read)
57{
fcd9ae4f
MWO
58 DEFINE_READAHEAD(ractl, file, &file->f_ra, mapping, index);
59 force_page_cache_ra(&ractl, nr_to_read);
7b3df3b9 60}
29f175d1 61
5c211ba2
MWO
62unsigned find_lock_entries(struct address_space *mapping, pgoff_t start,
63 pgoff_t end, struct pagevec *pvec, pgoff_t *indices);
64
1eb6234e
YS
65/**
66 * page_evictable - test whether a page is evictable
67 * @page: the page to test
68 *
69 * Test whether page is evictable--i.e., should be placed on active/inactive
70 * lists vs unevictable list.
71 *
72 * Reasons page might not be evictable:
73 * (1) page's mapping marked unevictable
74 * (2) page is part of an mlocked VMA
75 *
76 */
77static inline bool page_evictable(struct page *page)
78{
79 bool ret;
80
81 /* Prevent address_space of inode and swap cache from being freed */
82 rcu_read_lock();
83 ret = !mapping_unevictable(page_mapping(page)) && !PageMlocked(page);
84 rcu_read_unlock();
85 return ret;
86}
87
7835e98b 88/*
0139aa7b 89 * Turn a non-refcounted page (->_refcount == 0) into refcounted with
7835e98b
NP
90 * a count of one.
91 */
92static inline void set_page_refcounted(struct page *page)
93{
309381fe 94 VM_BUG_ON_PAGE(PageTail(page), page);
fe896d18 95 VM_BUG_ON_PAGE(page_ref_count(page), page);
77a8a788 96 set_page_count(page, 1);
77a8a788
NP
97}
98
03f6462a
HD
99extern unsigned long highest_memmap_pfn;
100
c73322d0
JW
101/*
102 * Maximum number of reclaim retries without progress before the OOM
103 * killer is consider the only way forward.
104 */
105#define MAX_RECLAIM_RETRIES 16
106
894bc310
LS
107/*
108 * in mm/vmscan.c:
109 */
62695a84 110extern int isolate_lru_page(struct page *page);
894bc310 111extern void putback_lru_page(struct page *page);
62695a84 112
6219049a
BL
113/*
114 * in mm/rmap.c:
115 */
116extern pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address);
117
494c1dfe
WL
118/*
119 * in mm/memcontrol.c:
120 */
121extern bool cgroup_memory_nokmem;
122
894bc310
LS
123/*
124 * in mm/page_alloc.c
125 */
3c605096 126
1a6d53a1
VB
127/*
128 * Structure for holding the mostly immutable allocation parameters passed
129 * between functions involved in allocations, including the alloc_pages*
130 * family of functions.
131 *
97a225e6 132 * nodemask, migratetype and highest_zoneidx are initialized only once in
84172f4b 133 * __alloc_pages() and then never change.
1a6d53a1 134 *
97a225e6 135 * zonelist, preferred_zone and highest_zoneidx are set first in
84172f4b 136 * __alloc_pages() for the fast path, and might be later changed
68956ccb 137 * in __alloc_pages_slowpath(). All other functions pass the whole structure
1a6d53a1
VB
138 * by a const pointer.
139 */
140struct alloc_context {
141 struct zonelist *zonelist;
142 nodemask_t *nodemask;
c33d6c06 143 struct zoneref *preferred_zoneref;
1a6d53a1 144 int migratetype;
97a225e6
JK
145
146 /*
147 * highest_zoneidx represents highest usable zone index of
148 * the allocation request. Due to the nature of the zone,
149 * memory on lower zone than the highest_zoneidx will be
150 * protected by lowmem_reserve[highest_zoneidx].
151 *
152 * highest_zoneidx is also used by reclaim/compaction to limit
153 * the target zone since higher zone than this index cannot be
154 * usable for this allocation request.
155 */
156 enum zone_type highest_zoneidx;
c9ab0c4f 157 bool spread_dirty_pages;
1a6d53a1
VB
158};
159
3c605096
JK
160/*
161 * Locate the struct page for both the matching buddy in our
162 * pair (buddy1) and the combined O(n+1) page they form (page).
163 *
164 * 1) Any buddy B1 will have an order O twin B2 which satisfies
165 * the following equation:
166 * B2 = B1 ^ (1 << O)
167 * For example, if the starting buddy (buddy2) is #8 its order
168 * 1 buddy is #10:
169 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
170 *
171 * 2) Any buddy B will have an order O+1 parent P which
172 * satisfies the following equation:
173 * P = B & ~(1 << O)
174 *
175 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
176 */
177static inline unsigned long
76741e77 178__find_buddy_pfn(unsigned long page_pfn, unsigned int order)
3c605096 179{
76741e77 180 return page_pfn ^ (1 << order);
3c605096
JK
181}
182
7cf91a98
JK
183extern struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
184 unsigned long end_pfn, struct zone *zone);
185
186static inline struct page *pageblock_pfn_to_page(unsigned long start_pfn,
187 unsigned long end_pfn, struct zone *zone)
188{
189 if (zone->contiguous)
190 return pfn_to_page(start_pfn);
191
192 return __pageblock_pfn_to_page(start_pfn, end_pfn, zone);
193}
194
3c605096 195extern int __isolate_free_page(struct page *page, unsigned int order);
624f58d8
AD
196extern void __putback_isolated_page(struct page *page, unsigned int order,
197 int mt);
7c2ee349 198extern void memblock_free_pages(struct page *page, unsigned long pfn,
d70ddd7a 199 unsigned int order);
a9cd410a 200extern void __free_pages_core(struct page *page, unsigned int order);
d00181b9 201extern void prep_compound_page(struct page *page, unsigned int order);
46f24fd8
JK
202extern void post_alloc_hook(struct page *page, unsigned int order,
203 gfp_t gfp_flags);
42aa83cb 204extern int user_min_free_kbytes;
20a0307c 205
44042b44 206extern void free_unref_page(struct page *page, unsigned int order);
0966aeb4
MWO
207extern void free_unref_page_list(struct list_head *list);
208
04f8cfea 209extern void zone_pcp_update(struct zone *zone, int cpu_online);
68265390 210extern void zone_pcp_reset(struct zone *zone);
ec6e8c7e
VB
211extern void zone_pcp_disable(struct zone *zone);
212extern void zone_pcp_enable(struct zone *zone);
68265390 213
ff9543fd
MN
214#if defined CONFIG_COMPACTION || defined CONFIG_CMA
215
216/*
217 * in mm/compaction.c
218 */
219/*
220 * compact_control is used to track pages being migrated and the free pages
221 * they are being migrated to during memory compaction. The free_pfn starts
222 * at the end of a zone and migrate_pfn begins at the start. Movable pages
223 * are moved to the end of a zone during a compaction run and the run
224 * completes when free_pfn <= migrate_pfn
225 */
226struct compact_control {
227 struct list_head freepages; /* List of free pages to migrate to */
228 struct list_head migratepages; /* List of pages being migrated */
c5fbd937
MG
229 unsigned int nr_freepages; /* Number of isolated free pages */
230 unsigned int nr_migratepages; /* Number of pages to migrate */
ff9543fd 231 unsigned long free_pfn; /* isolate_freepages search base */
c2ad7a1f
OS
232 /*
233 * Acts as an in/out parameter to page isolation for migration.
234 * isolate_migratepages uses it as a search base.
235 * isolate_migratepages_block will update the value to the next pfn
236 * after the last isolated one.
237 */
238 unsigned long migrate_pfn;
70b44595 239 unsigned long fast_start_pfn; /* a pfn to start linear scan from */
c5943b9c
MG
240 struct zone *zone;
241 unsigned long total_migrate_scanned;
242 unsigned long total_free_scanned;
dbe2d4e4
MG
243 unsigned short fast_search_fail;/* failures to use free list searches */
244 short search_order; /* order to start a fast search at */
f25ba6dc
VB
245 const gfp_t gfp_mask; /* gfp mask of a direct compactor */
246 int order; /* order a direct compactor needs */
d39773a0 247 int migratetype; /* migratetype of direct compactor */
f25ba6dc 248 const unsigned int alloc_flags; /* alloc flags of a direct compactor */
97a225e6 249 const int highest_zoneidx; /* zone index of a direct compactor */
e0b9daeb 250 enum migrate_mode mode; /* Async or sync migration mode */
bb13ffeb 251 bool ignore_skip_hint; /* Scan blocks even if marked skip */
2583d671 252 bool no_set_skip_hint; /* Don't mark blocks for skipping */
9f7e3387 253 bool ignore_block_suitable; /* Scan blocks considered unsuitable */
accf6242 254 bool direct_compaction; /* False from kcompactd or /proc/... */
facdaa91 255 bool proactive_compaction; /* kcompactd proactive compaction */
06ed2998 256 bool whole_zone; /* Whole zone should/has been scanned */
c3486f53 257 bool contended; /* Signal lock or sched contention */
804d3121 258 bool rescan; /* Rescanning the same pageblock */
b06eda09 259 bool alloc_contig; /* alloc_contig_range allocation */
ff9543fd
MN
260};
261
5e1f0f09
MG
262/*
263 * Used in direct compaction when a page should be taken from the freelists
264 * immediately when one is created during the free path.
265 */
266struct capture_control {
267 struct compact_control *cc;
268 struct page *page;
269};
270
ff9543fd 271unsigned long
bb13ffeb
MG
272isolate_freepages_range(struct compact_control *cc,
273 unsigned long start_pfn, unsigned long end_pfn);
c2ad7a1f 274int
edc2ca61
VB
275isolate_migratepages_range(struct compact_control *cc,
276 unsigned long low_pfn, unsigned long end_pfn);
2149cdae
JK
277int find_suitable_fallback(struct free_area *area, unsigned int order,
278 int migratetype, bool only_stealable, bool *can_steal);
ff9543fd
MN
279
280#endif
0f8053a5 281
48f13bf3 282/*
6c14466c
MG
283 * This function returns the order of a free page in the buddy system. In
284 * general, page_zone(page)->lock must be held by the caller to prevent the
285 * page from being allocated in parallel and returning garbage as the order.
286 * If a caller does not hold page_zone(page)->lock, it must guarantee that the
99c0fd5e 287 * page cannot be allocated or merged in parallel. Alternatively, it must
ab130f91 288 * handle invalid values gracefully, and use buddy_order_unsafe() below.
48f13bf3 289 */
ab130f91 290static inline unsigned int buddy_order(struct page *page)
48f13bf3 291{
572438f9 292 /* PageBuddy() must be checked by the caller */
48f13bf3
MG
293 return page_private(page);
294}
b5a0e011 295
99c0fd5e 296/*
ab130f91 297 * Like buddy_order(), but for callers who cannot afford to hold the zone lock.
99c0fd5e
VB
298 * PageBuddy() should be checked first by the caller to minimize race window,
299 * and invalid values must be handled gracefully.
300 *
4db0c3c2 301 * READ_ONCE is used so that if the caller assigns the result into a local
99c0fd5e
VB
302 * variable and e.g. tests it for valid range before using, the compiler cannot
303 * decide to remove the variable and inline the page_private(page) multiple
304 * times, potentially observing different values in the tests and the actual
305 * use of the result.
306 */
ab130f91 307#define buddy_order_unsafe(page) READ_ONCE(page_private(page))
99c0fd5e 308
30bdbb78
KK
309/*
310 * These three helpers classifies VMAs for virtual memory accounting.
311 */
312
313/*
314 * Executable code area - executable, not writable, not stack
315 */
d977d56c
KK
316static inline bool is_exec_mapping(vm_flags_t flags)
317{
30bdbb78 318 return (flags & (VM_EXEC | VM_WRITE | VM_STACK)) == VM_EXEC;
d977d56c
KK
319}
320
30bdbb78 321/*
f0953a1b 322 * Stack area - automatically grows in one direction
30bdbb78
KK
323 *
324 * VM_GROWSUP / VM_GROWSDOWN VMAs are always private anonymous:
325 * do_mmap() forbids all other combinations.
326 */
d977d56c
KK
327static inline bool is_stack_mapping(vm_flags_t flags)
328{
30bdbb78 329 return (flags & VM_STACK) == VM_STACK;
d977d56c
KK
330}
331
30bdbb78
KK
332/*
333 * Data area - private, writable, not stack
334 */
d977d56c
KK
335static inline bool is_data_mapping(vm_flags_t flags)
336{
30bdbb78 337 return (flags & (VM_WRITE | VM_SHARED | VM_STACK)) == VM_WRITE;
d977d56c
KK
338}
339
6038def0
NK
340/* mm/util.c */
341void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
aba6dfb7 342 struct vm_area_struct *prev);
1b9fc5b2 343void __vma_unlink_list(struct mm_struct *mm, struct vm_area_struct *vma);
6038def0 344
af8e3354 345#ifdef CONFIG_MMU
fc05f566 346extern long populate_vma_page_range(struct vm_area_struct *vma,
cea10a19 347 unsigned long start, unsigned long end, int *nonblocking);
af8e3354
HD
348extern void munlock_vma_pages_range(struct vm_area_struct *vma,
349 unsigned long start, unsigned long end);
350static inline void munlock_vma_pages_all(struct vm_area_struct *vma)
351{
352 munlock_vma_pages_range(vma, vma->vm_start, vma->vm_end);
353}
354
b291f000 355/*
c1e8d7c6 356 * must be called with vma's mmap_lock held for read or write, and page locked.
b291f000
NP
357 */
358extern void mlock_vma_page(struct page *page);
ff6a6da6 359extern unsigned int munlock_vma_page(struct page *page);
b291f000
NP
360
361/*
362 * Clear the page's PageMlocked(). This can be useful in a situation where
363 * we want to unconditionally remove a page from the pagecache -- e.g.,
364 * on truncation or freeing.
365 *
366 * It is legal to call this function for any page, mlocked or not.
367 * If called for a page that is still mapped by mlocked vmas, all we do
368 * is revert to lazy LRU behaviour -- semantics are not broken.
369 */
e6c509f8 370extern void clear_page_mlock(struct page *page);
b291f000
NP
371
372/*
51afb12b
HD
373 * mlock_migrate_page - called only from migrate_misplaced_transhuge_page()
374 * (because that does not go through the full procedure of migration ptes):
375 * to migrate the Mlocked page flag; update statistics.
b291f000
NP
376 */
377static inline void mlock_migrate_page(struct page *newpage, struct page *page)
378{
5344b7e6 379 if (TestClearPageMlocked(page)) {
6c357848 380 int nr_pages = thp_nr_pages(page);
5344b7e6 381
51afb12b 382 /* Holding pmd lock, no change in irq context: __mod is safe */
b32967ff 383 __mod_zone_page_state(page_zone(page), NR_MLOCK, -nr_pages);
b291f000 384 SetPageMlocked(newpage);
b32967ff 385 __mod_zone_page_state(page_zone(newpage), NR_MLOCK, nr_pages);
5344b7e6 386 }
b291f000
NP
387}
388
f55e1014 389extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
b32967ff 390
e9b61f19 391/*
494334e4
HD
392 * At what user virtual address is page expected in vma?
393 * Returns -EFAULT if all of the page is outside the range of vma.
394 * If page is a compound head, the entire compound page is considered.
e9b61f19
KS
395 */
396static inline unsigned long
494334e4 397vma_address(struct page *page, struct vm_area_struct *vma)
e9b61f19 398{
494334e4
HD
399 pgoff_t pgoff;
400 unsigned long address;
401
402 VM_BUG_ON_PAGE(PageKsm(page), page); /* KSM page->index unusable */
403 pgoff = page_to_pgoff(page);
404 if (pgoff >= vma->vm_pgoff) {
405 address = vma->vm_start +
406 ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
407 /* Check for address beyond vma (or wrapped through 0?) */
408 if (address < vma->vm_start || address >= vma->vm_end)
409 address = -EFAULT;
410 } else if (PageHead(page) &&
411 pgoff + compound_nr(page) - 1 >= vma->vm_pgoff) {
412 /* Test above avoids possibility of wrap to 0 on 32-bit */
413 address = vma->vm_start;
414 } else {
415 address = -EFAULT;
416 }
417 return address;
e9b61f19
KS
418}
419
494334e4
HD
420/*
421 * Then at what user virtual address will none of the page be found in vma?
422 * Assumes that vma_address() already returned a good starting address.
423 * If page is a compound head, the entire compound page is considered.
424 */
e9b61f19 425static inline unsigned long
494334e4 426vma_address_end(struct page *page, struct vm_area_struct *vma)
e9b61f19 427{
494334e4
HD
428 pgoff_t pgoff;
429 unsigned long address;
430
431 VM_BUG_ON_PAGE(PageKsm(page), page); /* KSM page->index unusable */
432 pgoff = page_to_pgoff(page) + compound_nr(page);
433 address = vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
434 /* Check for address beyond vma (or wrapped through 0?) */
435 if (address < vma->vm_start || address > vma->vm_end)
436 address = vma->vm_end;
437 return address;
e9b61f19
KS
438}
439
89b15332
JW
440static inline struct file *maybe_unlock_mmap_for_io(struct vm_fault *vmf,
441 struct file *fpin)
442{
443 int flags = vmf->flags;
444
445 if (fpin)
446 return fpin;
447
448 /*
449 * FAULT_FLAG_RETRY_NOWAIT means we don't want to wait on page locks or
c1e8d7c6 450 * anything, so we only pin the file and drop the mmap_lock if only
4064b982 451 * FAULT_FLAG_ALLOW_RETRY is set, while this is the first attempt.
89b15332 452 */
4064b982
PX
453 if (fault_flag_allow_retry_first(flags) &&
454 !(flags & FAULT_FLAG_RETRY_NOWAIT)) {
89b15332 455 fpin = get_file(vmf->vma->vm_file);
d8ed45c5 456 mmap_read_unlock(vmf->vma->vm_mm);
89b15332
JW
457 }
458 return fpin;
459}
460
af8e3354 461#else /* !CONFIG_MMU */
b291f000
NP
462static inline void clear_page_mlock(struct page *page) { }
463static inline void mlock_vma_page(struct page *page) { }
464static inline void mlock_migrate_page(struct page *new, struct page *old) { }
4ad0ae8c
NP
465static inline void vunmap_range_noflush(unsigned long start, unsigned long end)
466{
467}
af8e3354 468#endif /* !CONFIG_MMU */
894bc310 469
69d177c2
AW
470/*
471 * Return the mem_map entry representing the 'offset' subpage within
472 * the maximally aligned gigantic page 'base'. Handle any discontiguity
473 * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
474 */
475static inline struct page *mem_map_offset(struct page *base, int offset)
476{
477 if (unlikely(offset >= MAX_ORDER_NR_PAGES))
bc7f84c0 478 return nth_page(base, offset);
69d177c2
AW
479 return base + offset;
480}
481
482/*
25985edc 483 * Iterator over all subpages within the maximally aligned gigantic
69d177c2
AW
484 * page 'base'. Handle any discontiguity in the mem_map.
485 */
486static inline struct page *mem_map_next(struct page *iter,
487 struct page *base, int offset)
488{
489 if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
490 unsigned long pfn = page_to_pfn(base) + offset;
491 if (!pfn_valid(pfn))
492 return NULL;
493 return pfn_to_page(pfn);
494 }
495 return iter + 1;
496}
497
6b74ab97
MG
498/* Memory initialisation debug and verification */
499enum mminit_level {
500 MMINIT_WARNING,
501 MMINIT_VERIFY,
502 MMINIT_TRACE
503};
504
505#ifdef CONFIG_DEBUG_MEMORY_INIT
506
507extern int mminit_loglevel;
508
509#define mminit_dprintk(level, prefix, fmt, arg...) \
510do { \
511 if (level < mminit_loglevel) { \
fc5199d1 512 if (level <= MMINIT_WARNING) \
1170532b 513 pr_warn("mminit::" prefix " " fmt, ##arg); \
fc5199d1
RV
514 else \
515 printk(KERN_DEBUG "mminit::" prefix " " fmt, ##arg); \
6b74ab97
MG
516 } \
517} while (0)
518
708614e6 519extern void mminit_verify_pageflags_layout(void);
68ad8df4 520extern void mminit_verify_zonelist(void);
6b74ab97
MG
521#else
522
523static inline void mminit_dprintk(enum mminit_level level,
524 const char *prefix, const char *fmt, ...)
525{
526}
527
708614e6
MG
528static inline void mminit_verify_pageflags_layout(void)
529{
530}
531
68ad8df4
MG
532static inline void mminit_verify_zonelist(void)
533{
534}
6b74ab97 535#endif /* CONFIG_DEBUG_MEMORY_INIT */
2dbb51c4
MG
536
537/* mminit_validate_memmodel_limits is independent of CONFIG_DEBUG_MEMORY_INIT */
538#if defined(CONFIG_SPARSEMEM)
539extern void mminit_validate_memmodel_limits(unsigned long *start_pfn,
540 unsigned long *end_pfn);
541#else
542static inline void mminit_validate_memmodel_limits(unsigned long *start_pfn,
543 unsigned long *end_pfn)
544{
545}
546#endif /* CONFIG_SPARSEMEM */
547
a5f5f91d
MG
548#define NODE_RECLAIM_NOSCAN -2
549#define NODE_RECLAIM_FULL -1
550#define NODE_RECLAIM_SOME 0
551#define NODE_RECLAIM_SUCCESS 1
7c116f2b 552
8b09549c
WY
553#ifdef CONFIG_NUMA
554extern int node_reclaim(struct pglist_data *, gfp_t, unsigned int);
555#else
556static inline int node_reclaim(struct pglist_data *pgdat, gfp_t mask,
557 unsigned int order)
558{
559 return NODE_RECLAIM_NOSCAN;
560}
561#endif
562
31d3d348
WF
563extern int hwpoison_filter(struct page *p);
564
7c116f2b
WF
565extern u32 hwpoison_filter_dev_major;
566extern u32 hwpoison_filter_dev_minor;
478c5ffc
WF
567extern u64 hwpoison_filter_flags_mask;
568extern u64 hwpoison_filter_flags_value;
4fd466eb 569extern u64 hwpoison_filter_memcg;
1bfe5feb 570extern u32 hwpoison_filter_enable;
eb36c587 571
dc0ef0df 572extern unsigned long __must_check vm_mmap_pgoff(struct file *, unsigned long,
eb36c587 573 unsigned long, unsigned long,
9fbeb5ab 574 unsigned long, unsigned long);
ca57df79
XQ
575
576extern void set_pageblock_order(void);
730ec8c0 577unsigned int reclaim_clean_pages_from_list(struct zone *zone,
02c6de8d 578 struct list_head *page_list);
d95ea5d1
BZ
579/* The ALLOC_WMARK bits are used as an index to zone->watermark */
580#define ALLOC_WMARK_MIN WMARK_MIN
581#define ALLOC_WMARK_LOW WMARK_LOW
582#define ALLOC_WMARK_HIGH WMARK_HIGH
583#define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
584
585/* Mask to get the watermark bits */
586#define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
587
cd04ae1e
MH
588/*
589 * Only MMU archs have async oom victim reclaim - aka oom_reaper so we
590 * cannot assume a reduced access to memory reserves is sufficient for
591 * !MMU
592 */
593#ifdef CONFIG_MMU
594#define ALLOC_OOM 0x08
595#else
596#define ALLOC_OOM ALLOC_NO_WATERMARKS
597#endif
598
6bb15450
MG
599#define ALLOC_HARDER 0x10 /* try to alloc harder */
600#define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
601#define ALLOC_CPUSET 0x40 /* check for correct cpuset */
602#define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
603#ifdef CONFIG_ZONE_DMA32
604#define ALLOC_NOFRAGMENT 0x100 /* avoid mixing pageblock types */
605#else
606#define ALLOC_NOFRAGMENT 0x0
607#endif
736838e9 608#define ALLOC_KSWAPD 0x800 /* allow waking of kswapd, __GFP_KSWAPD_RECLAIM set */
d95ea5d1 609
72b252ae
MG
610enum ttu_flags;
611struct tlbflush_unmap_batch;
612
ce612879
MH
613
614/*
615 * only for MM internal work items which do not depend on
616 * any allocations or locks which might depend on allocations
617 */
618extern struct workqueue_struct *mm_percpu_wq;
619
72b252ae
MG
620#ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
621void try_to_unmap_flush(void);
d950c947 622void try_to_unmap_flush_dirty(void);
3ea27719 623void flush_tlb_batched_pending(struct mm_struct *mm);
72b252ae
MG
624#else
625static inline void try_to_unmap_flush(void)
626{
627}
d950c947
MG
628static inline void try_to_unmap_flush_dirty(void)
629{
630}
3ea27719
MG
631static inline void flush_tlb_batched_pending(struct mm_struct *mm)
632{
633}
72b252ae 634#endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
edf14cdb
VB
635
636extern const struct trace_print_flags pageflag_names[];
637extern const struct trace_print_flags vmaflag_names[];
638extern const struct trace_print_flags gfpflag_names[];
639
a6ffdc07
XQ
640static inline bool is_migrate_highatomic(enum migratetype migratetype)
641{
642 return migratetype == MIGRATE_HIGHATOMIC;
643}
644
645static inline bool is_migrate_highatomic_page(struct page *page)
646{
647 return get_pageblock_migratetype(page) == MIGRATE_HIGHATOMIC;
648}
649
72675e13 650void setup_zone_pageset(struct zone *zone);
19fc7bed
JK
651
652struct migration_target_control {
653 int nid; /* preferred node id */
654 nodemask_t *nmask;
655 gfp_t gfp_mask;
656};
657
b67177ec
NP
658/*
659 * mm/vmalloc.c
660 */
4ad0ae8c 661#ifdef CONFIG_MMU
b67177ec
NP
662int vmap_pages_range_noflush(unsigned long addr, unsigned long end,
663 pgprot_t prot, struct page **pages, unsigned int page_shift);
4ad0ae8c
NP
664#else
665static inline
666int vmap_pages_range_noflush(unsigned long addr, unsigned long end,
667 pgprot_t prot, struct page **pages, unsigned int page_shift)
668{
669 return -EINVAL;
670}
671#endif
672
673void vunmap_range_noflush(unsigned long start, unsigned long end);
b67177ec 674
db971418 675#endif /* __MM_INTERNAL_H */