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