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