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