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