usb: gadget: f_mtp: Avoid race between mtp_read and mtp_function_disable
[GitHub/exynos8895/android_kernel_samsung_universal8895.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|\
5b3114b2
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);
1cac41cb 182extern void put_page_freelist(struct page *page);
8d22ba1b
WF
183#ifdef CONFIG_MEMORY_FAILURE
184extern bool is_free_buddy_page(struct page *page);
185#endif
42aa83cb 186extern int user_min_free_kbytes;
20a0307c 187
ff9543fd
MN
188#if defined CONFIG_COMPACTION || defined CONFIG_CMA
189
190/*
191 * in mm/compaction.c
192 */
193/*
194 * compact_control is used to track pages being migrated and the free pages
195 * they are being migrated to during memory compaction. The free_pfn starts
196 * at the end of a zone and migrate_pfn begins at the start. Movable pages
197 * are moved to the end of a zone during a compaction run and the run
198 * completes when free_pfn <= migrate_pfn
199 */
200struct compact_control {
201 struct list_head freepages; /* List of free pages to migrate to */
202 struct list_head migratepages; /* List of pages being migrated */
203 unsigned long nr_freepages; /* Number of isolated free pages */
204 unsigned long nr_migratepages; /* Number of pages to migrate */
205 unsigned long free_pfn; /* isolate_freepages search base */
206 unsigned long migrate_pfn; /* isolate_migratepages search base */
1a16718c 207 unsigned long last_migrated_pfn;/* Not yet flushed page being freed */
e0b9daeb 208 enum migrate_mode mode; /* Async or sync migration mode */
bb13ffeb 209 bool ignore_skip_hint; /* Scan blocks even if marked skip */
1cac41cb 210 bool direct_compaction; /* False from kcompactd or /proc/... */
ff9543fd 211 int order; /* order a direct compactor needs */
6d7ce559 212 const gfp_t gfp_mask; /* gfp mask of a direct compactor */
ebff3980
VB
213 const int alloc_flags; /* alloc flags of a direct compactor */
214 const int classzone_idx; /* zone index of a direct compactor */
ff9543fd 215 struct zone *zone;
1f9efdef
VB
216 int contended; /* Signal need_sched() or lock
217 * contention detected during
be976572
VB
218 * compaction
219 */
ff9543fd
MN
220};
221
222unsigned long
bb13ffeb
MG
223isolate_freepages_range(struct compact_control *cc,
224 unsigned long start_pfn, unsigned long end_pfn);
ff9543fd 225unsigned long
edc2ca61
VB
226isolate_migratepages_range(struct compact_control *cc,
227 unsigned long low_pfn, unsigned long end_pfn);
2149cdae
JK
228int find_suitable_fallback(struct free_area *area, unsigned int order,
229 int migratetype, bool only_stealable, bool *can_steal);
ff9543fd
MN
230
231#endif
0f8053a5 232
48f13bf3 233/*
6c14466c
MG
234 * This function returns the order of a free page in the buddy system. In
235 * general, page_zone(page)->lock must be held by the caller to prevent the
236 * page from being allocated in parallel and returning garbage as the order.
237 * If a caller does not hold page_zone(page)->lock, it must guarantee that the
99c0fd5e
VB
238 * page cannot be allocated or merged in parallel. Alternatively, it must
239 * handle invalid values gracefully, and use page_order_unsafe() below.
48f13bf3 240 */
d00181b9 241static inline unsigned int page_order(struct page *page)
48f13bf3 242{
572438f9 243 /* PageBuddy() must be checked by the caller */
48f13bf3
MG
244 return page_private(page);
245}
b5a0e011 246
99c0fd5e
VB
247/*
248 * Like page_order(), but for callers who cannot afford to hold the zone lock.
249 * PageBuddy() should be checked first by the caller to minimize race window,
250 * and invalid values must be handled gracefully.
251 *
4db0c3c2 252 * READ_ONCE is used so that if the caller assigns the result into a local
99c0fd5e
VB
253 * variable and e.g. tests it for valid range before using, the compiler cannot
254 * decide to remove the variable and inline the page_private(page) multiple
255 * times, potentially observing different values in the tests and the actual
256 * use of the result.
257 */
4db0c3c2 258#define page_order_unsafe(page) READ_ONCE(page_private(page))
99c0fd5e 259
4bbd4c77
KS
260static inline bool is_cow_mapping(vm_flags_t flags)
261{
262 return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
263}
264
6038def0
NK
265/* mm/util.c */
266void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
267 struct vm_area_struct *prev, struct rb_node *rb_parent);
268
af8e3354 269#ifdef CONFIG_MMU
fc05f566 270extern long populate_vma_page_range(struct vm_area_struct *vma,
cea10a19 271 unsigned long start, unsigned long end, int *nonblocking);
af8e3354
HD
272extern void munlock_vma_pages_range(struct vm_area_struct *vma,
273 unsigned long start, unsigned long end);
274static inline void munlock_vma_pages_all(struct vm_area_struct *vma)
275{
276 munlock_vma_pages_range(vma, vma->vm_start, vma->vm_end);
277}
278
b291f000 279/*
73848b46 280 * must be called with vma's mmap_sem held for read or write, and page locked.
b291f000
NP
281 */
282extern void mlock_vma_page(struct page *page);
ff6a6da6 283extern unsigned int munlock_vma_page(struct page *page);
b291f000
NP
284
285/*
286 * Clear the page's PageMlocked(). This can be useful in a situation where
287 * we want to unconditionally remove a page from the pagecache -- e.g.,
288 * on truncation or freeing.
289 *
290 * It is legal to call this function for any page, mlocked or not.
291 * If called for a page that is still mapped by mlocked vmas, all we do
292 * is revert to lazy LRU behaviour -- semantics are not broken.
293 */
e6c509f8 294extern void clear_page_mlock(struct page *page);
b291f000
NP
295
296/*
51afb12b
HD
297 * mlock_migrate_page - called only from migrate_misplaced_transhuge_page()
298 * (because that does not go through the full procedure of migration ptes):
299 * to migrate the Mlocked page flag; update statistics.
b291f000
NP
300 */
301static inline void mlock_migrate_page(struct page *newpage, struct page *page)
302{
5344b7e6 303 if (TestClearPageMlocked(page)) {
b32967ff 304 int nr_pages = hpage_nr_pages(page);
5344b7e6 305
51afb12b 306 /* Holding pmd lock, no change in irq context: __mod is safe */
b32967ff 307 __mod_zone_page_state(page_zone(page), NR_MLOCK, -nr_pages);
b291f000 308 SetPageMlocked(newpage);
b32967ff 309 __mod_zone_page_state(page_zone(newpage), NR_MLOCK, nr_pages);
5344b7e6 310 }
b291f000
NP
311}
312
b32967ff
MG
313extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
314
71e3aac0
AA
315#ifdef CONFIG_TRANSPARENT_HUGEPAGE
316extern unsigned long vma_address(struct page *page,
317 struct vm_area_struct *vma);
318#endif
af8e3354 319#else /* !CONFIG_MMU */
b291f000
NP
320static inline void clear_page_mlock(struct page *page) { }
321static inline void mlock_vma_page(struct page *page) { }
322static inline void mlock_migrate_page(struct page *new, struct page *old) { }
323
af8e3354 324#endif /* !CONFIG_MMU */
894bc310 325
69d177c2
AW
326/*
327 * Return the mem_map entry representing the 'offset' subpage within
328 * the maximally aligned gigantic page 'base'. Handle any discontiguity
329 * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
330 */
331static inline struct page *mem_map_offset(struct page *base, int offset)
332{
333 if (unlikely(offset >= MAX_ORDER_NR_PAGES))
bc7f84c0 334 return nth_page(base, offset);
69d177c2
AW
335 return base + offset;
336}
337
338/*
25985edc 339 * Iterator over all subpages within the maximally aligned gigantic
69d177c2
AW
340 * page 'base'. Handle any discontiguity in the mem_map.
341 */
342static inline struct page *mem_map_next(struct page *iter,
343 struct page *base, int offset)
344{
345 if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
346 unsigned long pfn = page_to_pfn(base) + offset;
347 if (!pfn_valid(pfn))
348 return NULL;
349 return pfn_to_page(pfn);
350 }
351 return iter + 1;
352}
353
b5a0e011
AH
354/*
355 * FLATMEM and DISCONTIGMEM configurations use alloc_bootmem_node,
356 * so all functions starting at paging_init should be marked __init
357 * in those cases. SPARSEMEM, however, allows for memory hotplug,
358 * and alloc_bootmem_node is not used.
359 */
360#ifdef CONFIG_SPARSEMEM
361#define __paginginit __meminit
362#else
363#define __paginginit __init
364#endif
365
6b74ab97
MG
366/* Memory initialisation debug and verification */
367enum mminit_level {
368 MMINIT_WARNING,
369 MMINIT_VERIFY,
370 MMINIT_TRACE
371};
372
373#ifdef CONFIG_DEBUG_MEMORY_INIT
374
375extern int mminit_loglevel;
376
377#define mminit_dprintk(level, prefix, fmt, arg...) \
378do { \
379 if (level < mminit_loglevel) { \
fc5199d1
RV
380 if (level <= MMINIT_WARNING) \
381 printk(KERN_WARNING "mminit::" prefix " " fmt, ##arg); \
382 else \
383 printk(KERN_DEBUG "mminit::" prefix " " fmt, ##arg); \
6b74ab97
MG
384 } \
385} while (0)
386
708614e6 387extern void mminit_verify_pageflags_layout(void);
68ad8df4 388extern void mminit_verify_zonelist(void);
6b74ab97
MG
389#else
390
391static inline void mminit_dprintk(enum mminit_level level,
392 const char *prefix, const char *fmt, ...)
393{
394}
395
708614e6
MG
396static inline void mminit_verify_pageflags_layout(void)
397{
398}
399
68ad8df4
MG
400static inline void mminit_verify_zonelist(void)
401{
402}
6b74ab97 403#endif /* CONFIG_DEBUG_MEMORY_INIT */
2dbb51c4
MG
404
405/* mminit_validate_memmodel_limits is independent of CONFIG_DEBUG_MEMORY_INIT */
406#if defined(CONFIG_SPARSEMEM)
407extern void mminit_validate_memmodel_limits(unsigned long *start_pfn,
408 unsigned long *end_pfn);
409#else
410static inline void mminit_validate_memmodel_limits(unsigned long *start_pfn,
411 unsigned long *end_pfn)
412{
413}
414#endif /* CONFIG_SPARSEMEM */
415
fa5e084e
MG
416#define ZONE_RECLAIM_NOSCAN -2
417#define ZONE_RECLAIM_FULL -1
418#define ZONE_RECLAIM_SOME 0
419#define ZONE_RECLAIM_SUCCESS 1
7c116f2b 420
31d3d348
WF
421extern int hwpoison_filter(struct page *p);
422
7c116f2b
WF
423extern u32 hwpoison_filter_dev_major;
424extern u32 hwpoison_filter_dev_minor;
478c5ffc
WF
425extern u64 hwpoison_filter_flags_mask;
426extern u64 hwpoison_filter_flags_value;
4fd466eb 427extern u64 hwpoison_filter_memcg;
1bfe5feb 428extern u32 hwpoison_filter_enable;
eb36c587
AV
429
430extern unsigned long vm_mmap_pgoff(struct file *, unsigned long,
431 unsigned long, unsigned long,
432 unsigned long, unsigned long);
ca57df79
XQ
433
434extern void set_pageblock_order(void);
02c6de8d
MK
435unsigned long reclaim_clean_pages_from_list(struct zone *zone,
436 struct list_head *page_list);
d95ea5d1
BZ
437/* The ALLOC_WMARK bits are used as an index to zone->watermark */
438#define ALLOC_WMARK_MIN WMARK_MIN
439#define ALLOC_WMARK_LOW WMARK_LOW
440#define ALLOC_WMARK_HIGH WMARK_HIGH
441#define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
442
443/* Mask to get the watermark bits */
444#define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
445
446#define ALLOC_HARDER 0x10 /* try to alloc harder */
447#define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
448#define ALLOC_CPUSET 0x40 /* check for correct cpuset */
449#define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
3a025760 450#define ALLOC_FAIR 0x100 /* fair zone allocation */
d95ea5d1 451
72b252ae
MG
452enum ttu_flags;
453struct tlbflush_unmap_batch;
454
455#ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
456void try_to_unmap_flush(void);
d950c947 457void try_to_unmap_flush_dirty(void);
f1181047 458void flush_tlb_batched_pending(struct mm_struct *mm);
72b252ae
MG
459#else
460static inline void try_to_unmap_flush(void)
461{
462}
d950c947
MG
463static inline void try_to_unmap_flush_dirty(void)
464{
465}
f1181047
MG
466static inline void flush_tlb_batched_pending(struct mm_struct *mm)
467{
468}
72b252ae 469#endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
db971418 470#endif /* __MM_INTERNAL_H */