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