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