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