]> git.proxmox.com Git - mirror_ubuntu-hirsute-kernel.git/blame - mm/internal.h
mm, compaction: pass classzone_idx and alloc_flags to watermark checking
[mirror_ubuntu-hirsute-kernel.git] / mm / internal.h
CommitLineData
1da177e4
LT
1/* internal.h: mm/ internal definitions
2 *
3 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 */
0f8053a5
NP
11#ifndef __MM_INTERNAL_H
12#define __MM_INTERNAL_H
13
29f175d1 14#include <linux/fs.h>
0f8053a5 15#include <linux/mm.h>
1da177e4 16
42b77728
JB
17void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *start_vma,
18 unsigned long floor, unsigned long ceiling);
19
7835e98b 20static inline void set_page_count(struct page *page, int v)
77a8a788 21{
7835e98b
NP
22 atomic_set(&page->_count, v);
23}
24
29f175d1
FF
25extern int __do_page_cache_readahead(struct address_space *mapping,
26 struct file *filp, pgoff_t offset, unsigned long nr_to_read,
27 unsigned long lookahead_size);
28
29/*
30 * Submit IO for the read-ahead request in file_ra_state.
31 */
32static inline unsigned long ra_submit(struct file_ra_state *ra,
33 struct address_space *mapping, struct file *filp)
34{
35 return __do_page_cache_readahead(mapping, filp,
36 ra->start, ra->size, ra->async_size);
37}
38
7835e98b
NP
39/*
40 * Turn a non-refcounted page (->_count == 0) into refcounted with
41 * a count of one.
42 */
43static inline void set_page_refcounted(struct page *page)
44{
309381fe
SL
45 VM_BUG_ON_PAGE(PageTail(page), page);
46 VM_BUG_ON_PAGE(atomic_read(&page->_count), page);
77a8a788 47 set_page_count(page, 1);
77a8a788
NP
48}
49
70b50f94
AA
50static inline void __get_page_tail_foll(struct page *page,
51 bool get_page_head)
52{
53 /*
54 * If we're getting a tail page, the elevated page->_count is
55 * required only in the head page and we will elevate the head
56 * page->_count and tail page->_mapcount.
57 *
58 * We elevate page_tail->_mapcount for tail pages to force
59 * page_tail->_count to be zero at all times to avoid getting
60 * false positives from get_page_unless_zero() with
61 * speculative page access (like in
62 * page_cache_get_speculative()) on tail pages.
63 */
309381fe 64 VM_BUG_ON_PAGE(atomic_read(&page->first_page->_count) <= 0, page);
70b50f94
AA
65 if (get_page_head)
66 atomic_inc(&page->first_page->_count);
c728852f 67 get_huge_page_tail(page);
70b50f94
AA
68}
69
70/*
71 * This is meant to be called as the FOLL_GET operation of
72 * follow_page() and it must be called while holding the proper PT
73 * lock while the pte (or pmd_trans_huge) is still mapping the page.
74 */
75static inline void get_page_foll(struct page *page)
76{
77 if (unlikely(PageTail(page)))
78 /*
79 * This is safe only because
80 * __split_huge_page_refcount() can't run under
81 * get_page_foll() because we hold the proper PT lock.
82 */
83 __get_page_tail_foll(page, true);
84 else {
85 /*
86 * Getting a normal page or the head of a compound page
87 * requires to already have an elevated page->_count.
88 */
309381fe 89 VM_BUG_ON_PAGE(atomic_read(&page->_count) <= 0, page);
70b50f94
AA
90 atomic_inc(&page->_count);
91 }
92}
93
03f6462a
HD
94extern unsigned long highest_memmap_pfn;
95
894bc310
LS
96/*
97 * in mm/vmscan.c:
98 */
62695a84 99extern int isolate_lru_page(struct page *page);
894bc310 100extern void putback_lru_page(struct page *page);
6e543d57 101extern bool zone_reclaimable(struct zone *zone);
62695a84 102
6219049a
BL
103/*
104 * in mm/rmap.c:
105 */
106extern pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address);
107
894bc310
LS
108/*
109 * in mm/page_alloc.c
110 */
3c605096
JK
111
112/*
113 * Locate the struct page for both the matching buddy in our
114 * pair (buddy1) and the combined O(n+1) page they form (page).
115 *
116 * 1) Any buddy B1 will have an order O twin B2 which satisfies
117 * the following equation:
118 * B2 = B1 ^ (1 << O)
119 * For example, if the starting buddy (buddy2) is #8 its order
120 * 1 buddy is #10:
121 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
122 *
123 * 2) Any buddy B will have an order O+1 parent P which
124 * satisfies the following equation:
125 * P = B & ~(1 << O)
126 *
127 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
128 */
129static inline unsigned long
130__find_buddy_index(unsigned long page_idx, unsigned int order)
131{
132 return page_idx ^ (1 << order);
133}
134
135extern int __isolate_free_page(struct page *page, unsigned int order);
0c0a4a51 136extern void __free_pages_bootmem(struct page *page, unsigned int order);
20a0307c 137extern void prep_compound_page(struct page *page, unsigned long order);
8d22ba1b
WF
138#ifdef CONFIG_MEMORY_FAILURE
139extern bool is_free_buddy_page(struct page *page);
140#endif
42aa83cb 141extern int user_min_free_kbytes;
20a0307c 142
ff9543fd
MN
143#if defined CONFIG_COMPACTION || defined CONFIG_CMA
144
145/*
146 * in mm/compaction.c
147 */
148/*
149 * compact_control is used to track pages being migrated and the free pages
150 * they are being migrated to during memory compaction. The free_pfn starts
151 * at the end of a zone and migrate_pfn begins at the start. Movable pages
152 * are moved to the end of a zone during a compaction run and the run
153 * completes when free_pfn <= migrate_pfn
154 */
155struct compact_control {
156 struct list_head freepages; /* List of free pages to migrate to */
157 struct list_head migratepages; /* List of pages being migrated */
158 unsigned long nr_freepages; /* Number of isolated free pages */
159 unsigned long nr_migratepages; /* Number of pages to migrate */
160 unsigned long free_pfn; /* isolate_freepages search base */
161 unsigned long migrate_pfn; /* isolate_migratepages search base */
e0b9daeb 162 enum migrate_mode mode; /* Async or sync migration mode */
bb13ffeb 163 bool ignore_skip_hint; /* Scan blocks even if marked skip */
c89511ab
MG
164 bool finished_update_free; /* True when the zone cached pfns are
165 * no longer being updated
166 */
167 bool finished_update_migrate;
ff9543fd
MN
168
169 int order; /* order a direct compactor needs */
6d7ce559 170 const gfp_t gfp_mask; /* gfp mask of a direct compactor */
ebff3980
VB
171 const int alloc_flags; /* alloc flags of a direct compactor */
172 const int classzone_idx; /* zone index of a direct compactor */
ff9543fd 173 struct zone *zone;
1f9efdef
VB
174 int contended; /* Signal need_sched() or lock
175 * contention detected during
be976572
VB
176 * compaction
177 */
ff9543fd
MN
178};
179
180unsigned long
bb13ffeb
MG
181isolate_freepages_range(struct compact_control *cc,
182 unsigned long start_pfn, unsigned long end_pfn);
ff9543fd 183unsigned long
edc2ca61
VB
184isolate_migratepages_range(struct compact_control *cc,
185 unsigned long low_pfn, unsigned long end_pfn);
ff9543fd
MN
186
187#endif
0f8053a5 188
48f13bf3 189/*
6c14466c
MG
190 * This function returns the order of a free page in the buddy system. In
191 * general, page_zone(page)->lock must be held by the caller to prevent the
192 * page from being allocated in parallel and returning garbage as the order.
193 * If a caller does not hold page_zone(page)->lock, it must guarantee that the
99c0fd5e
VB
194 * page cannot be allocated or merged in parallel. Alternatively, it must
195 * handle invalid values gracefully, and use page_order_unsafe() below.
48f13bf3
MG
196 */
197static inline unsigned long page_order(struct page *page)
198{
572438f9 199 /* PageBuddy() must be checked by the caller */
48f13bf3
MG
200 return page_private(page);
201}
b5a0e011 202
99c0fd5e
VB
203/*
204 * Like page_order(), but for callers who cannot afford to hold the zone lock.
205 * PageBuddy() should be checked first by the caller to minimize race window,
206 * and invalid values must be handled gracefully.
207 *
208 * ACCESS_ONCE is used so that if the caller assigns the result into a local
209 * variable and e.g. tests it for valid range before using, the compiler cannot
210 * decide to remove the variable and inline the page_private(page) multiple
211 * times, potentially observing different values in the tests and the actual
212 * use of the result.
213 */
214#define page_order_unsafe(page) ACCESS_ONCE(page_private(page))
215
4bbd4c77
KS
216static inline bool is_cow_mapping(vm_flags_t flags)
217{
218 return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
219}
220
6038def0
NK
221/* mm/util.c */
222void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
223 struct vm_area_struct *prev, struct rb_node *rb_parent);
224
af8e3354 225#ifdef CONFIG_MMU
cea10a19
ML
226extern long __mlock_vma_pages_range(struct vm_area_struct *vma,
227 unsigned long start, unsigned long end, int *nonblocking);
af8e3354
HD
228extern void munlock_vma_pages_range(struct vm_area_struct *vma,
229 unsigned long start, unsigned long end);
230static inline void munlock_vma_pages_all(struct vm_area_struct *vma)
231{
232 munlock_vma_pages_range(vma, vma->vm_start, vma->vm_end);
233}
234
b291f000 235/*
73848b46 236 * must be called with vma's mmap_sem held for read or write, and page locked.
b291f000
NP
237 */
238extern void mlock_vma_page(struct page *page);
ff6a6da6 239extern unsigned int munlock_vma_page(struct page *page);
b291f000
NP
240
241/*
242 * Clear the page's PageMlocked(). This can be useful in a situation where
243 * we want to unconditionally remove a page from the pagecache -- e.g.,
244 * on truncation or freeing.
245 *
246 * It is legal to call this function for any page, mlocked or not.
247 * If called for a page that is still mapped by mlocked vmas, all we do
248 * is revert to lazy LRU behaviour -- semantics are not broken.
249 */
e6c509f8 250extern void clear_page_mlock(struct page *page);
b291f000
NP
251
252/*
253 * mlock_migrate_page - called only from migrate_page_copy() to
5344b7e6 254 * migrate the Mlocked page flag; update statistics.
b291f000
NP
255 */
256static inline void mlock_migrate_page(struct page *newpage, struct page *page)
257{
5344b7e6
NP
258 if (TestClearPageMlocked(page)) {
259 unsigned long flags;
b32967ff 260 int nr_pages = hpage_nr_pages(page);
5344b7e6
NP
261
262 local_irq_save(flags);
b32967ff 263 __mod_zone_page_state(page_zone(page), NR_MLOCK, -nr_pages);
b291f000 264 SetPageMlocked(newpage);
b32967ff 265 __mod_zone_page_state(page_zone(newpage), NR_MLOCK, nr_pages);
5344b7e6
NP
266 local_irq_restore(flags);
267 }
b291f000
NP
268}
269
b32967ff
MG
270extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
271
71e3aac0
AA
272#ifdef CONFIG_TRANSPARENT_HUGEPAGE
273extern unsigned long vma_address(struct page *page,
274 struct vm_area_struct *vma);
275#endif
af8e3354 276#else /* !CONFIG_MMU */
b291f000
NP
277static inline void clear_page_mlock(struct page *page) { }
278static inline void mlock_vma_page(struct page *page) { }
279static inline void mlock_migrate_page(struct page *new, struct page *old) { }
280
af8e3354 281#endif /* !CONFIG_MMU */
894bc310 282
69d177c2
AW
283/*
284 * Return the mem_map entry representing the 'offset' subpage within
285 * the maximally aligned gigantic page 'base'. Handle any discontiguity
286 * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
287 */
288static inline struct page *mem_map_offset(struct page *base, int offset)
289{
290 if (unlikely(offset >= MAX_ORDER_NR_PAGES))
bc7f84c0 291 return nth_page(base, offset);
69d177c2
AW
292 return base + offset;
293}
294
295/*
25985edc 296 * Iterator over all subpages within the maximally aligned gigantic
69d177c2
AW
297 * page 'base'. Handle any discontiguity in the mem_map.
298 */
299static inline struct page *mem_map_next(struct page *iter,
300 struct page *base, int offset)
301{
302 if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
303 unsigned long pfn = page_to_pfn(base) + offset;
304 if (!pfn_valid(pfn))
305 return NULL;
306 return pfn_to_page(pfn);
307 }
308 return iter + 1;
309}
310
b5a0e011
AH
311/*
312 * FLATMEM and DISCONTIGMEM configurations use alloc_bootmem_node,
313 * so all functions starting at paging_init should be marked __init
314 * in those cases. SPARSEMEM, however, allows for memory hotplug,
315 * and alloc_bootmem_node is not used.
316 */
317#ifdef CONFIG_SPARSEMEM
318#define __paginginit __meminit
319#else
320#define __paginginit __init
321#endif
322
6b74ab97
MG
323/* Memory initialisation debug and verification */
324enum mminit_level {
325 MMINIT_WARNING,
326 MMINIT_VERIFY,
327 MMINIT_TRACE
328};
329
330#ifdef CONFIG_DEBUG_MEMORY_INIT
331
332extern int mminit_loglevel;
333
334#define mminit_dprintk(level, prefix, fmt, arg...) \
335do { \
336 if (level < mminit_loglevel) { \
337 printk(level <= MMINIT_WARNING ? KERN_WARNING : KERN_DEBUG); \
338 printk(KERN_CONT "mminit::" prefix " " fmt, ##arg); \
339 } \
340} while (0)
341
708614e6
MG
342extern void mminit_verify_pageflags_layout(void);
343extern void mminit_verify_page_links(struct page *page,
344 enum zone_type zone, unsigned long nid, unsigned long pfn);
68ad8df4 345extern void mminit_verify_zonelist(void);
708614e6 346
6b74ab97
MG
347#else
348
349static inline void mminit_dprintk(enum mminit_level level,
350 const char *prefix, const char *fmt, ...)
351{
352}
353
708614e6
MG
354static inline void mminit_verify_pageflags_layout(void)
355{
356}
357
358static inline void mminit_verify_page_links(struct page *page,
359 enum zone_type zone, unsigned long nid, unsigned long pfn)
360{
361}
68ad8df4
MG
362
363static inline void mminit_verify_zonelist(void)
364{
365}
6b74ab97 366#endif /* CONFIG_DEBUG_MEMORY_INIT */
2dbb51c4
MG
367
368/* mminit_validate_memmodel_limits is independent of CONFIG_DEBUG_MEMORY_INIT */
369#if defined(CONFIG_SPARSEMEM)
370extern void mminit_validate_memmodel_limits(unsigned long *start_pfn,
371 unsigned long *end_pfn);
372#else
373static inline void mminit_validate_memmodel_limits(unsigned long *start_pfn,
374 unsigned long *end_pfn)
375{
376}
377#endif /* CONFIG_SPARSEMEM */
378
fa5e084e
MG
379#define ZONE_RECLAIM_NOSCAN -2
380#define ZONE_RECLAIM_FULL -1
381#define ZONE_RECLAIM_SOME 0
382#define ZONE_RECLAIM_SUCCESS 1
7c116f2b 383
31d3d348
WF
384extern int hwpoison_filter(struct page *p);
385
7c116f2b
WF
386extern u32 hwpoison_filter_dev_major;
387extern u32 hwpoison_filter_dev_minor;
478c5ffc
WF
388extern u64 hwpoison_filter_flags_mask;
389extern u64 hwpoison_filter_flags_value;
4fd466eb 390extern u64 hwpoison_filter_memcg;
1bfe5feb 391extern u32 hwpoison_filter_enable;
eb36c587
AV
392
393extern unsigned long vm_mmap_pgoff(struct file *, unsigned long,
394 unsigned long, unsigned long,
395 unsigned long, unsigned long);
ca57df79
XQ
396
397extern void set_pageblock_order(void);
02c6de8d
MK
398unsigned long reclaim_clean_pages_from_list(struct zone *zone,
399 struct list_head *page_list);
d95ea5d1
BZ
400/* The ALLOC_WMARK bits are used as an index to zone->watermark */
401#define ALLOC_WMARK_MIN WMARK_MIN
402#define ALLOC_WMARK_LOW WMARK_LOW
403#define ALLOC_WMARK_HIGH WMARK_HIGH
404#define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
405
406/* Mask to get the watermark bits */
407#define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
408
409#define ALLOC_HARDER 0x10 /* try to alloc harder */
410#define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
411#define ALLOC_CPUSET 0x40 /* check for correct cpuset */
412#define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
3a025760 413#define ALLOC_FAIR 0x100 /* fair zone allocation */
d95ea5d1 414
db971418 415#endif /* __MM_INTERNAL_H */