]> Git Repo - linux.git/blame - mm/internal.h
mm/page_alloc: fix tracepoint mm_page_alloc_zone_locked()
[linux.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 ([email protected])
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>
2aff7a47 13#include <linux/rmap.h>
edf14cdb 14#include <linux/tracepoint-defs.h>
1da177e4 15
0e499ed3
MWO
16struct folio_batch;
17
dd56b046
MG
18/*
19 * The set of flags that only affect watermark checking and reclaim
20 * behaviour. This is used by the MM to obey the caller constraints
21 * about IO, FS and watermark checking while ignoring placement
22 * hints such as HIGHMEM usage.
23 */
24#define GFP_RECLAIM_MASK (__GFP_RECLAIM|__GFP_HIGH|__GFP_IO|__GFP_FS|\
dcda9b04 25 __GFP_NOWARN|__GFP_RETRY_MAYFAIL|__GFP_NOFAIL|\
e838a45f 26 __GFP_NORETRY|__GFP_MEMALLOC|__GFP_NOMEMALLOC|\
704687de 27 __GFP_ATOMIC|__GFP_NOLOCKDEP)
dd56b046
MG
28
29/* The GFP flags allowed during early boot */
30#define GFP_BOOT_MASK (__GFP_BITS_MASK & ~(__GFP_RECLAIM|__GFP_IO|__GFP_FS))
31
32/* Control allocation cpuset and node placement constraints */
33#define GFP_CONSTRAINT_MASK (__GFP_HARDWALL|__GFP_THISNODE)
34
35/* Do not use these with a slab allocator */
36#define GFP_SLAB_BUG_MASK (__GFP_DMA32|__GFP_HIGHMEM|~__GFP_BITS_MASK)
37
62906027
NP
38void page_writeback_init(void);
39
64601000
MWO
40static inline void *folio_raw_mapping(struct folio *folio)
41{
42 unsigned long mapping = (unsigned long)folio->mapping;
43
44 return (void *)(mapping & ~PAGE_MAPPING_FLAGS);
45}
46
512b7931 47void __acct_reclaim_writeback(pg_data_t *pgdat, struct folio *folio,
8cd7c588 48 int nr_throttled);
512b7931 49static inline void acct_reclaim_writeback(struct folio *folio)
8cd7c588 50{
512b7931 51 pg_data_t *pgdat = folio_pgdat(folio);
8cd7c588
MG
52 int nr_throttled = atomic_read(&pgdat->nr_writeback_throttled);
53
54 if (nr_throttled)
512b7931 55 __acct_reclaim_writeback(pgdat, folio, nr_throttled);
8cd7c588
MG
56}
57
d818fca1
MG
58static inline void wake_throttle_isolated(pg_data_t *pgdat)
59{
60 wait_queue_head_t *wqh;
61
62 wqh = &pgdat->reclaim_wait[VMSCAN_THROTTLE_ISOLATED];
63 if (waitqueue_active(wqh))
64 wake_up(wqh);
65}
66
2b740303 67vm_fault_t do_swap_page(struct vm_fault *vmf);
575ced1c 68void folio_rotate_reclaimable(struct folio *folio);
269ccca3 69bool __folio_end_writeback(struct folio *folio);
261b6840 70void deactivate_file_folio(struct folio *folio);
8a966ed7 71
42b77728
JB
72void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *start_vma,
73 unsigned long floor, unsigned long ceiling);
03c4f204 74void pmd_install(struct mm_struct *mm, pmd_t *pmd, pgtable_t *pte);
42b77728 75
3506659e 76struct zap_details;
aac45363
MH
77void unmap_page_range(struct mmu_gather *tlb,
78 struct vm_area_struct *vma,
79 unsigned long addr, unsigned long end,
80 struct zap_details *details);
81
56a4d67c
MWO
82void page_cache_ra_order(struct readahead_control *, struct file_ra_state *,
83 unsigned int order);
fcd9ae4f 84void force_page_cache_ra(struct readahead_control *, unsigned long nr);
7b3df3b9
DH
85static inline void force_page_cache_readahead(struct address_space *mapping,
86 struct file *file, pgoff_t index, unsigned long nr_to_read)
87{
fcd9ae4f
MWO
88 DEFINE_READAHEAD(ractl, file, &file->f_ra, mapping, index);
89 force_page_cache_ra(&ractl, nr_to_read);
7b3df3b9 90}
29f175d1 91
5c211ba2 92unsigned find_lock_entries(struct address_space *mapping, pgoff_t start,
51dcbdac 93 pgoff_t end, struct folio_batch *fbatch, pgoff_t *indices);
0e499ed3
MWO
94unsigned find_get_entries(struct address_space *mapping, pgoff_t start,
95 pgoff_t end, struct folio_batch *fbatch, pgoff_t *indices);
78f42660 96void filemap_free_folio(struct address_space *mapping, struct folio *folio);
1e84a3d9 97int truncate_inode_folio(struct address_space *mapping, struct folio *folio);
b9a8a419
MWO
98bool truncate_inode_partial_folio(struct folio *folio, loff_t start,
99 loff_t end);
d6c75dc2 100long invalidate_inode_page(struct page *page);
c56109dd
MWO
101unsigned long invalidate_mapping_pagevec(struct address_space *mapping,
102 pgoff_t start, pgoff_t end, unsigned long *nr_pagevec);
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
115static 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
127static 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 */
142static 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
149extern 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
be4893d9
VB
157/*
158 * in mm/early_ioremap.c
159 */
160pgprot_t __init early_memremap_pgprot_adjust(resource_size_t phys_addr,
161 unsigned long size, pgprot_t prot);
162
894bc310
LS
163/*
164 * in mm/vmscan.c:
165 */
d1d8a3b4
MWO
166int isolate_lru_page(struct page *page);
167int folio_isolate_lru(struct folio *folio);
ca6d60f3
MWO
168void putback_lru_page(struct page *page);
169void folio_putback_lru(struct folio *folio);
c3f4a9a2 170extern void reclaim_throttle(pg_data_t *pgdat, enum vmscan_throttle_state reason);
62695a84 171
6219049a
BL
172/*
173 * in mm/rmap.c:
174 */
175extern pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address);
176
894bc310
LS
177/*
178 * in mm/page_alloc.c
179 */
3c605096 180
1a6d53a1
VB
181/*
182 * Structure for holding the mostly immutable allocation parameters passed
183 * between functions involved in allocations, including the alloc_pages*
184 * family of functions.
185 *
97a225e6 186 * nodemask, migratetype and highest_zoneidx are initialized only once in
84172f4b 187 * __alloc_pages() and then never change.
1a6d53a1 188 *
97a225e6 189 * zonelist, preferred_zone and highest_zoneidx are set first in
84172f4b 190 * __alloc_pages() for the fast path, and might be later changed
68956ccb 191 * in __alloc_pages_slowpath(). All other functions pass the whole structure
1a6d53a1
VB
192 * by a const pointer.
193 */
194struct alloc_context {
195 struct zonelist *zonelist;
196 nodemask_t *nodemask;
c33d6c06 197 struct zoneref *preferred_zoneref;
1a6d53a1 198 int migratetype;
97a225e6
JK
199
200 /*
201 * highest_zoneidx represents highest usable zone index of
202 * the allocation request. Due to the nature of the zone,
203 * memory on lower zone than the highest_zoneidx will be
204 * protected by lowmem_reserve[highest_zoneidx].
205 *
206 * highest_zoneidx is also used by reclaim/compaction to limit
207 * the target zone since higher zone than this index cannot be
208 * usable for this allocation request.
209 */
210 enum zone_type highest_zoneidx;
c9ab0c4f 211 bool spread_dirty_pages;
1a6d53a1
VB
212};
213
8170ac47
ZY
214/*
215 * This function returns the order of a free page in the buddy system. In
216 * general, page_zone(page)->lock must be held by the caller to prevent the
217 * page from being allocated in parallel and returning garbage as the order.
218 * If a caller does not hold page_zone(page)->lock, it must guarantee that the
219 * page cannot be allocated or merged in parallel. Alternatively, it must
220 * handle invalid values gracefully, and use buddy_order_unsafe() below.
221 */
222static inline unsigned int buddy_order(struct page *page)
223{
224 /* PageBuddy() must be checked by the caller */
225 return page_private(page);
226}
227
228/*
229 * Like buddy_order(), but for callers who cannot afford to hold the zone lock.
230 * PageBuddy() should be checked first by the caller to minimize race window,
231 * and invalid values must be handled gracefully.
232 *
233 * READ_ONCE is used so that if the caller assigns the result into a local
234 * variable and e.g. tests it for valid range before using, the compiler cannot
235 * decide to remove the variable and inline the page_private(page) multiple
236 * times, potentially observing different values in the tests and the actual
237 * use of the result.
238 */
239#define buddy_order_unsafe(page) READ_ONCE(page_private(page))
240
241/*
242 * This function checks whether a page is free && is the buddy
243 * we can coalesce a page and its buddy if
244 * (a) the buddy is not in a hole (check before calling!) &&
245 * (b) the buddy is in the buddy system &&
246 * (c) a page and its buddy have the same order &&
247 * (d) a page and its buddy are in the same zone.
248 *
249 * For recording whether a page is in the buddy system, we set PageBuddy.
250 * Setting, clearing, and testing PageBuddy is serialized by zone->lock.
251 *
252 * For recording page's order, we use page_private(page).
253 */
254static inline bool page_is_buddy(struct page *page, struct page *buddy,
255 unsigned int order)
256{
257 if (!page_is_guard(buddy) && !PageBuddy(buddy))
258 return false;
259
260 if (buddy_order(buddy) != order)
261 return false;
262
263 /*
264 * zone check is done late to avoid uselessly calculating
265 * zone/node ids for pages that could never merge.
266 */
267 if (page_zone_id(page) != page_zone_id(buddy))
268 return false;
269
270 VM_BUG_ON_PAGE(page_count(buddy) != 0, buddy);
271
272 return true;
273}
274
3c605096
JK
275/*
276 * Locate the struct page for both the matching buddy in our
277 * pair (buddy1) and the combined O(n+1) page they form (page).
278 *
279 * 1) Any buddy B1 will have an order O twin B2 which satisfies
280 * the following equation:
281 * B2 = B1 ^ (1 << O)
282 * For example, if the starting buddy (buddy2) is #8 its order
283 * 1 buddy is #10:
284 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
285 *
286 * 2) Any buddy B will have an order O+1 parent P which
287 * satisfies the following equation:
288 * P = B & ~(1 << O)
289 *
290 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
291 */
292static inline unsigned long
76741e77 293__find_buddy_pfn(unsigned long page_pfn, unsigned int order)
3c605096 294{
76741e77 295 return page_pfn ^ (1 << order);
3c605096
JK
296}
297
8170ac47
ZY
298/*
299 * Find the buddy of @page and validate it.
300 * @page: The input page
301 * @pfn: The pfn of the page, it saves a call to page_to_pfn() when the
302 * function is used in the performance-critical __free_one_page().
303 * @order: The order of the page
304 * @buddy_pfn: The output pointer to the buddy pfn, it also saves a call to
305 * page_to_pfn().
306 *
307 * The found buddy can be a non PageBuddy, out of @page's zone, or its order is
308 * not the same as @page. The validation is necessary before use it.
309 *
310 * Return: the found buddy page or NULL if not found.
311 */
312static inline struct page *find_buddy_page_pfn(struct page *page,
313 unsigned long pfn, unsigned int order, unsigned long *buddy_pfn)
314{
315 unsigned long __buddy_pfn = __find_buddy_pfn(pfn, order);
316 struct page *buddy;
317
318 buddy = page + (__buddy_pfn - pfn);
319 if (buddy_pfn)
320 *buddy_pfn = __buddy_pfn;
321
322 if (page_is_buddy(page, buddy, order))
323 return buddy;
324 return NULL;
325}
326
7cf91a98
JK
327extern struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
328 unsigned long end_pfn, struct zone *zone);
329
330static inline struct page *pageblock_pfn_to_page(unsigned long start_pfn,
331 unsigned long end_pfn, struct zone *zone)
332{
333 if (zone->contiguous)
334 return pfn_to_page(start_pfn);
335
336 return __pageblock_pfn_to_page(start_pfn, end_pfn, zone);
337}
338
3c605096 339extern int __isolate_free_page(struct page *page, unsigned int order);
624f58d8
AD
340extern void __putback_isolated_page(struct page *page, unsigned int order,
341 int mt);
7c2ee349 342extern void memblock_free_pages(struct page *page, unsigned long pfn,
d70ddd7a 343 unsigned int order);
a9cd410a 344extern void __free_pages_core(struct page *page, unsigned int order);
d00181b9 345extern void prep_compound_page(struct page *page, unsigned int order);
46f24fd8
JK
346extern void post_alloc_hook(struct page *page, unsigned int order,
347 gfp_t gfp_flags);
42aa83cb 348extern int user_min_free_kbytes;
20a0307c 349
44042b44 350extern void free_unref_page(struct page *page, unsigned int order);
0966aeb4
MWO
351extern void free_unref_page_list(struct list_head *list);
352
04f8cfea 353extern void zone_pcp_update(struct zone *zone, int cpu_online);
68265390 354extern void zone_pcp_reset(struct zone *zone);
ec6e8c7e
VB
355extern void zone_pcp_disable(struct zone *zone);
356extern void zone_pcp_enable(struct zone *zone);
68265390 357
c803b3c8
MR
358extern void *memmap_alloc(phys_addr_t size, phys_addr_t align,
359 phys_addr_t min_addr,
360 int nid, bool exact_nid);
361
b2c9e2fb
ZY
362void split_free_page(struct page *free_page,
363 int order, unsigned long split_pfn_offset);
364
ff9543fd
MN
365#if defined CONFIG_COMPACTION || defined CONFIG_CMA
366
367/*
368 * in mm/compaction.c
369 */
370/*
371 * compact_control is used to track pages being migrated and the free pages
372 * they are being migrated to during memory compaction. The free_pfn starts
373 * at the end of a zone and migrate_pfn begins at the start. Movable pages
374 * are moved to the end of a zone during a compaction run and the run
375 * completes when free_pfn <= migrate_pfn
376 */
377struct compact_control {
378 struct list_head freepages; /* List of free pages to migrate to */
379 struct list_head migratepages; /* List of pages being migrated */
c5fbd937
MG
380 unsigned int nr_freepages; /* Number of isolated free pages */
381 unsigned int nr_migratepages; /* Number of pages to migrate */
ff9543fd 382 unsigned long free_pfn; /* isolate_freepages search base */
c2ad7a1f
OS
383 /*
384 * Acts as an in/out parameter to page isolation for migration.
385 * isolate_migratepages uses it as a search base.
386 * isolate_migratepages_block will update the value to the next pfn
387 * after the last isolated one.
388 */
389 unsigned long migrate_pfn;
70b44595 390 unsigned long fast_start_pfn; /* a pfn to start linear scan from */
c5943b9c
MG
391 struct zone *zone;
392 unsigned long total_migrate_scanned;
393 unsigned long total_free_scanned;
dbe2d4e4
MG
394 unsigned short fast_search_fail;/* failures to use free list searches */
395 short search_order; /* order to start a fast search at */
f25ba6dc
VB
396 const gfp_t gfp_mask; /* gfp mask of a direct compactor */
397 int order; /* order a direct compactor needs */
d39773a0 398 int migratetype; /* migratetype of direct compactor */
f25ba6dc 399 const unsigned int alloc_flags; /* alloc flags of a direct compactor */
97a225e6 400 const int highest_zoneidx; /* zone index of a direct compactor */
e0b9daeb 401 enum migrate_mode mode; /* Async or sync migration mode */
bb13ffeb 402 bool ignore_skip_hint; /* Scan blocks even if marked skip */
2583d671 403 bool no_set_skip_hint; /* Don't mark blocks for skipping */
9f7e3387 404 bool ignore_block_suitable; /* Scan blocks considered unsuitable */
accf6242 405 bool direct_compaction; /* False from kcompactd or /proc/... */
facdaa91 406 bool proactive_compaction; /* kcompactd proactive compaction */
06ed2998 407 bool whole_zone; /* Whole zone should/has been scanned */
d56c1584 408 bool contended; /* Signal lock contention */
804d3121 409 bool rescan; /* Rescanning the same pageblock */
b06eda09 410 bool alloc_contig; /* alloc_contig_range allocation */
ff9543fd
MN
411};
412
5e1f0f09
MG
413/*
414 * Used in direct compaction when a page should be taken from the freelists
415 * immediately when one is created during the free path.
416 */
417struct capture_control {
418 struct compact_control *cc;
419 struct page *page;
420};
421
ff9543fd 422unsigned long
bb13ffeb
MG
423isolate_freepages_range(struct compact_control *cc,
424 unsigned long start_pfn, unsigned long end_pfn);
c2ad7a1f 425int
edc2ca61
VB
426isolate_migratepages_range(struct compact_control *cc,
427 unsigned long low_pfn, unsigned long end_pfn);
b2c9e2fb
ZY
428
429int __alloc_contig_migrate_range(struct compact_control *cc,
430 unsigned long start, unsigned long end);
ffd8f251 431#endif
2149cdae
JK
432int find_suitable_fallback(struct free_area *area, unsigned int order,
433 int migratetype, bool only_stealable, bool *can_steal);
ff9543fd 434
30bdbb78
KK
435/*
436 * These three helpers classifies VMAs for virtual memory accounting.
437 */
438
439/*
440 * Executable code area - executable, not writable, not stack
441 */
d977d56c
KK
442static inline bool is_exec_mapping(vm_flags_t flags)
443{
30bdbb78 444 return (flags & (VM_EXEC | VM_WRITE | VM_STACK)) == VM_EXEC;
d977d56c
KK
445}
446
30bdbb78 447/*
f0953a1b 448 * Stack area - automatically grows in one direction
30bdbb78
KK
449 *
450 * VM_GROWSUP / VM_GROWSDOWN VMAs are always private anonymous:
451 * do_mmap() forbids all other combinations.
452 */
d977d56c
KK
453static inline bool is_stack_mapping(vm_flags_t flags)
454{
30bdbb78 455 return (flags & VM_STACK) == VM_STACK;
d977d56c
KK
456}
457
30bdbb78
KK
458/*
459 * Data area - private, writable, not stack
460 */
d977d56c
KK
461static inline bool is_data_mapping(vm_flags_t flags)
462{
30bdbb78 463 return (flags & (VM_WRITE | VM_SHARED | VM_STACK)) == VM_WRITE;
d977d56c
KK
464}
465
6038def0
NK
466/* mm/util.c */
467void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
aba6dfb7 468 struct vm_area_struct *prev);
1b9fc5b2 469void __vma_unlink_list(struct mm_struct *mm, struct vm_area_struct *vma);
e05b3453 470struct anon_vma *folio_anon_vma(struct folio *folio);
6038def0 471
af8e3354 472#ifdef CONFIG_MMU
3506659e 473void unmap_mapping_folio(struct folio *folio);
fc05f566 474extern long populate_vma_page_range(struct vm_area_struct *vma,
a78f1ccd 475 unsigned long start, unsigned long end, int *locked);
4ca9b385
DH
476extern long faultin_vma_page_range(struct vm_area_struct *vma,
477 unsigned long start, unsigned long end,
478 bool write, int *locked);
6aeb2542
MR
479extern int mlock_future_check(struct mm_struct *mm, unsigned long flags,
480 unsigned long len);
b291f000 481/*
cea86fe2
HD
482 * mlock_vma_page() and munlock_vma_page():
483 * should be called with vma's mmap_lock held for read or write,
484 * under page table lock for the pte/pmd being added or removed.
b291f000 485 *
cea86fe2
HD
486 * mlock is usually called at the end of page_add_*_rmap(),
487 * munlock at the end of page_remove_rmap(); but new anon
2fbb0c10
HD
488 * pages are managed by lru_cache_add_inactive_or_unevictable()
489 * calling mlock_new_page().
cea86fe2
HD
490 *
491 * @compound is used to include pmd mappings of THPs, but filter out
492 * pte mappings of THPs, which cannot be consistently counted: a pte
493 * mapping of the THP head cannot be distinguished by the page alone.
b291f000 494 */
dcc5d337
MWO
495void mlock_folio(struct folio *folio);
496static inline void mlock_vma_folio(struct folio *folio,
cea86fe2
HD
497 struct vm_area_struct *vma, bool compound)
498{
c8263bd6
HD
499 /*
500 * The VM_SPECIAL check here serves two purposes.
501 * 1) VM_IO check prevents migration from double-counting during mlock.
502 * 2) Although mmap_region() and mlock_fixup() take care that VM_LOCKED
503 * is never left set on a VM_SPECIAL vma, there is an interval while
504 * file->f_op->mmap() is using vm_insert_page(s), when VM_LOCKED may
505 * still be set while VM_SPECIAL bits are added: so ignore it then.
506 */
507 if (unlikely((vma->vm_flags & (VM_LOCKED|VM_SPECIAL)) == VM_LOCKED) &&
dcc5d337
MWO
508 (compound || !folio_test_large(folio)))
509 mlock_folio(folio);
510}
511
512static inline void mlock_vma_page(struct page *page,
513 struct vm_area_struct *vma, bool compound)
514{
515 mlock_vma_folio(page_folio(page), vma, compound);
cea86fe2 516}
dcc5d337 517
cea86fe2
HD
518void munlock_page(struct page *page);
519static inline void munlock_vma_page(struct page *page,
520 struct vm_area_struct *vma, bool compound)
521{
522 if (unlikely(vma->vm_flags & VM_LOCKED) &&
523 (compound || !PageTransCompound(page)))
524 munlock_page(page);
525}
2fbb0c10
HD
526void mlock_new_page(struct page *page);
527bool need_mlock_page_drain(int cpu);
adb11e78
SAS
528void mlock_page_drain_local(void);
529void mlock_page_drain_remote(int cpu);
b291f000 530
f55e1014 531extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
b32967ff 532
e9b61f19 533/*
6a8e0596
MS
534 * Return the start of user virtual address at the specific offset within
535 * a vma.
e9b61f19
KS
536 */
537static inline unsigned long
6a8e0596
MS
538vma_pgoff_address(pgoff_t pgoff, unsigned long nr_pages,
539 struct vm_area_struct *vma)
e9b61f19 540{
494334e4
HD
541 unsigned long address;
542
494334e4
HD
543 if (pgoff >= vma->vm_pgoff) {
544 address = vma->vm_start +
545 ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
546 /* Check for address beyond vma (or wrapped through 0?) */
547 if (address < vma->vm_start || address >= vma->vm_end)
548 address = -EFAULT;
6a8e0596 549 } else if (pgoff + nr_pages - 1 >= vma->vm_pgoff) {
494334e4
HD
550 /* Test above avoids possibility of wrap to 0 on 32-bit */
551 address = vma->vm_start;
552 } else {
553 address = -EFAULT;
554 }
555 return address;
e9b61f19
KS
556}
557
6a8e0596
MS
558/*
559 * Return the start of user virtual address of a page within a vma.
560 * Returns -EFAULT if all of the page is outside the range of vma.
561 * If page is a compound head, the entire compound page is considered.
562 */
563static inline unsigned long
564vma_address(struct page *page, struct vm_area_struct *vma)
565{
566 VM_BUG_ON_PAGE(PageKsm(page), page); /* KSM page->index unusable */
567 return vma_pgoff_address(page_to_pgoff(page), compound_nr(page), vma);
568}
569
494334e4 570/*
2aff7a47 571 * Then at what user virtual address will none of the range be found in vma?
494334e4 572 * Assumes that vma_address() already returned a good starting address.
494334e4 573 */
2aff7a47 574static inline unsigned long vma_address_end(struct page_vma_mapped_walk *pvmw)
e9b61f19 575{
2aff7a47 576 struct vm_area_struct *vma = pvmw->vma;
494334e4
HD
577 pgoff_t pgoff;
578 unsigned long address;
579
2aff7a47
MWO
580 /* Common case, plus ->pgoff is invalid for KSM */
581 if (pvmw->nr_pages == 1)
582 return pvmw->address + PAGE_SIZE;
583
584 pgoff = pvmw->pgoff + pvmw->nr_pages;
494334e4
HD
585 address = vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
586 /* Check for address beyond vma (or wrapped through 0?) */
587 if (address < vma->vm_start || address > vma->vm_end)
588 address = vma->vm_end;
589 return address;
e9b61f19
KS
590}
591
89b15332
JW
592static inline struct file *maybe_unlock_mmap_for_io(struct vm_fault *vmf,
593 struct file *fpin)
594{
595 int flags = vmf->flags;
596
597 if (fpin)
598 return fpin;
599
600 /*
601 * FAULT_FLAG_RETRY_NOWAIT means we don't want to wait on page locks or
c1e8d7c6 602 * anything, so we only pin the file and drop the mmap_lock if only
4064b982 603 * FAULT_FLAG_ALLOW_RETRY is set, while this is the first attempt.
89b15332 604 */
4064b982
PX
605 if (fault_flag_allow_retry_first(flags) &&
606 !(flags & FAULT_FLAG_RETRY_NOWAIT)) {
89b15332 607 fpin = get_file(vmf->vma->vm_file);
d8ed45c5 608 mmap_read_unlock(vmf->vma->vm_mm);
89b15332
JW
609 }
610 return fpin;
611}
af8e3354 612#else /* !CONFIG_MMU */
3506659e 613static inline void unmap_mapping_folio(struct folio *folio) { }
cea86fe2
HD
614static inline void mlock_vma_page(struct page *page,
615 struct vm_area_struct *vma, bool compound) { }
616static inline void munlock_vma_page(struct page *page,
617 struct vm_area_struct *vma, bool compound) { }
2fbb0c10
HD
618static inline void mlock_new_page(struct page *page) { }
619static inline bool need_mlock_page_drain(int cpu) { return false; }
adb11e78
SAS
620static inline void mlock_page_drain_local(void) { }
621static inline void mlock_page_drain_remote(int cpu) { }
4ad0ae8c
NP
622static inline void vunmap_range_noflush(unsigned long start, unsigned long end)
623{
624}
af8e3354 625#endif /* !CONFIG_MMU */
894bc310 626
69d177c2
AW
627/*
628 * Return the mem_map entry representing the 'offset' subpage within
629 * the maximally aligned gigantic page 'base'. Handle any discontiguity
630 * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
631 */
632static inline struct page *mem_map_offset(struct page *base, int offset)
633{
634 if (unlikely(offset >= MAX_ORDER_NR_PAGES))
bc7f84c0 635 return nth_page(base, offset);
69d177c2
AW
636 return base + offset;
637}
638
639/*
25985edc 640 * Iterator over all subpages within the maximally aligned gigantic
69d177c2
AW
641 * page 'base'. Handle any discontiguity in the mem_map.
642 */
643static inline struct page *mem_map_next(struct page *iter,
644 struct page *base, int offset)
645{
646 if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
647 unsigned long pfn = page_to_pfn(base) + offset;
648 if (!pfn_valid(pfn))
649 return NULL;
650 return pfn_to_page(pfn);
651 }
652 return iter + 1;
653}
654
6b74ab97
MG
655/* Memory initialisation debug and verification */
656enum mminit_level {
657 MMINIT_WARNING,
658 MMINIT_VERIFY,
659 MMINIT_TRACE
660};
661
662#ifdef CONFIG_DEBUG_MEMORY_INIT
663
664extern int mminit_loglevel;
665
666#define mminit_dprintk(level, prefix, fmt, arg...) \
667do { \
668 if (level < mminit_loglevel) { \
fc5199d1 669 if (level <= MMINIT_WARNING) \
1170532b 670 pr_warn("mminit::" prefix " " fmt, ##arg); \
fc5199d1
RV
671 else \
672 printk(KERN_DEBUG "mminit::" prefix " " fmt, ##arg); \
6b74ab97
MG
673 } \
674} while (0)
675
708614e6 676extern void mminit_verify_pageflags_layout(void);
68ad8df4 677extern void mminit_verify_zonelist(void);
6b74ab97
MG
678#else
679
680static inline void mminit_dprintk(enum mminit_level level,
681 const char *prefix, const char *fmt, ...)
682{
683}
684
708614e6
MG
685static inline void mminit_verify_pageflags_layout(void)
686{
687}
688
68ad8df4
MG
689static inline void mminit_verify_zonelist(void)
690{
691}
6b74ab97 692#endif /* CONFIG_DEBUG_MEMORY_INIT */
2dbb51c4 693
a5f5f91d
MG
694#define NODE_RECLAIM_NOSCAN -2
695#define NODE_RECLAIM_FULL -1
696#define NODE_RECLAIM_SOME 0
697#define NODE_RECLAIM_SUCCESS 1
7c116f2b 698
8b09549c
WY
699#ifdef CONFIG_NUMA
700extern int node_reclaim(struct pglist_data *, gfp_t, unsigned int);
79c28a41 701extern int find_next_best_node(int node, nodemask_t *used_node_mask);
8b09549c
WY
702#else
703static inline int node_reclaim(struct pglist_data *pgdat, gfp_t mask,
704 unsigned int order)
705{
706 return NODE_RECLAIM_NOSCAN;
707}
79c28a41
DH
708static inline int find_next_best_node(int node, nodemask_t *used_node_mask)
709{
710 return NUMA_NO_NODE;
711}
8b09549c
WY
712#endif
713
60f272f6 714/*
715 * mm/memory-failure.c
716 */
31d3d348
WF
717extern int hwpoison_filter(struct page *p);
718
7c116f2b
WF
719extern u32 hwpoison_filter_dev_major;
720extern u32 hwpoison_filter_dev_minor;
478c5ffc
WF
721extern u64 hwpoison_filter_flags_mask;
722extern u64 hwpoison_filter_flags_value;
4fd466eb 723extern u64 hwpoison_filter_memcg;
1bfe5feb 724extern u32 hwpoison_filter_enable;
eb36c587 725
60f272f6 726#ifdef CONFIG_MEMORY_FAILURE
727void clear_hwpoisoned_pages(struct page *memmap, int nr_pages);
728#else
729static inline void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
730{
731}
732#endif
733
dc0ef0df 734extern unsigned long __must_check vm_mmap_pgoff(struct file *, unsigned long,
eb36c587 735 unsigned long, unsigned long,
9fbeb5ab 736 unsigned long, unsigned long);
ca57df79
XQ
737
738extern void set_pageblock_order(void);
730ec8c0 739unsigned int reclaim_clean_pages_from_list(struct zone *zone,
02c6de8d 740 struct list_head *page_list);
d95ea5d1
BZ
741/* The ALLOC_WMARK bits are used as an index to zone->watermark */
742#define ALLOC_WMARK_MIN WMARK_MIN
743#define ALLOC_WMARK_LOW WMARK_LOW
744#define ALLOC_WMARK_HIGH WMARK_HIGH
745#define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
746
747/* Mask to get the watermark bits */
748#define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
749
cd04ae1e
MH
750/*
751 * Only MMU archs have async oom victim reclaim - aka oom_reaper so we
752 * cannot assume a reduced access to memory reserves is sufficient for
753 * !MMU
754 */
755#ifdef CONFIG_MMU
756#define ALLOC_OOM 0x08
757#else
758#define ALLOC_OOM ALLOC_NO_WATERMARKS
759#endif
760
6bb15450
MG
761#define ALLOC_HARDER 0x10 /* try to alloc harder */
762#define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
763#define ALLOC_CPUSET 0x40 /* check for correct cpuset */
764#define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
765#ifdef CONFIG_ZONE_DMA32
766#define ALLOC_NOFRAGMENT 0x100 /* avoid mixing pageblock types */
767#else
768#define ALLOC_NOFRAGMENT 0x0
769#endif
736838e9 770#define ALLOC_KSWAPD 0x800 /* allow waking of kswapd, __GFP_KSWAPD_RECLAIM set */
d95ea5d1 771
72b252ae
MG
772enum ttu_flags;
773struct tlbflush_unmap_batch;
774
ce612879
MH
775
776/*
777 * only for MM internal work items which do not depend on
778 * any allocations or locks which might depend on allocations
779 */
780extern struct workqueue_struct *mm_percpu_wq;
781
72b252ae
MG
782#ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
783void try_to_unmap_flush(void);
d950c947 784void try_to_unmap_flush_dirty(void);
3ea27719 785void flush_tlb_batched_pending(struct mm_struct *mm);
72b252ae
MG
786#else
787static inline void try_to_unmap_flush(void)
788{
789}
d950c947
MG
790static inline void try_to_unmap_flush_dirty(void)
791{
792}
3ea27719
MG
793static inline void flush_tlb_batched_pending(struct mm_struct *mm)
794{
795}
72b252ae 796#endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
edf14cdb
VB
797
798extern const struct trace_print_flags pageflag_names[];
799extern const struct trace_print_flags vmaflag_names[];
800extern const struct trace_print_flags gfpflag_names[];
801
a6ffdc07
XQ
802static inline bool is_migrate_highatomic(enum migratetype migratetype)
803{
804 return migratetype == MIGRATE_HIGHATOMIC;
805}
806
807static inline bool is_migrate_highatomic_page(struct page *page)
808{
809 return get_pageblock_migratetype(page) == MIGRATE_HIGHATOMIC;
810}
811
72675e13 812void setup_zone_pageset(struct zone *zone);
19fc7bed
JK
813
814struct migration_target_control {
815 int nid; /* preferred node id */
816 nodemask_t *nmask;
817 gfp_t gfp_mask;
818};
819
b67177ec
NP
820/*
821 * mm/vmalloc.c
822 */
4ad0ae8c 823#ifdef CONFIG_MMU
b67177ec
NP
824int vmap_pages_range_noflush(unsigned long addr, unsigned long end,
825 pgprot_t prot, struct page **pages, unsigned int page_shift);
4ad0ae8c
NP
826#else
827static inline
828int vmap_pages_range_noflush(unsigned long addr, unsigned long end,
829 pgprot_t prot, struct page **pages, unsigned int page_shift)
830{
831 return -EINVAL;
832}
833#endif
834
835void vunmap_range_noflush(unsigned long start, unsigned long end);
b67177ec 836
f4c0d836
YS
837int numa_migrate_prep(struct page *page, struct vm_area_struct *vma,
838 unsigned long addr, int page_nid, int *flags);
839
27674ef6
CH
840void free_zone_device_page(struct page *page);
841
ece1ed7b
MWO
842/*
843 * mm/gup.c
844 */
845struct folio *try_grab_folio(struct page *page, int refs, unsigned int flags);
846
09f49dca
MH
847DECLARE_PER_CPU(struct per_cpu_nodestat, boot_nodestats);
848
db971418 849#endif /* __MM_INTERNAL_H */
This page took 1.206549 seconds and 4 git commands to generate.