internal.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469
  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. */
  11. #ifndef __MM_INTERNAL_H
  12. #define __MM_INTERNAL_H
  13. #include <linux/fs.h>
  14. #include <linux/mm.h>
  15. #include <linux/pagemap.h>
  16. /*
  17. * The set of flags that only affect watermark checking and reclaim
  18. * behaviour. This is used by the MM to obey the caller constraints
  19. * about IO, FS and watermark checking while ignoring placement
  20. * hints such as HIGHMEM usage.
  21. */
  22. #define GFP_RECLAIM_MASK (__GFP_RECLAIM|__GFP_HIGH|__GFP_IO|__GFP_FS|\
  23. __GFP_NOWARN|__GFP_REPEAT|__GFP_NOFAIL|\
  24. __GFP_NORETRY|__GFP_MEMALLOC|__GFP_NOMEMALLOC)
  25. /* The GFP flags allowed during early boot */
  26. #define GFP_BOOT_MASK (__GFP_BITS_MASK & ~(__GFP_RECLAIM|__GFP_IO|__GFP_FS))
  27. /* Control allocation cpuset and node placement constraints */
  28. #define GFP_CONSTRAINT_MASK (__GFP_HARDWALL|__GFP_THISNODE)
  29. /* Do not use these with a slab allocator */
  30. #define GFP_SLAB_BUG_MASK (__GFP_DMA32|__GFP_HIGHMEM|~__GFP_BITS_MASK)
  31. void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *start_vma,
  32. unsigned long floor, unsigned long ceiling);
  33. static inline void set_page_count(struct page *page, int v)
  34. {
  35. atomic_set(&page->_count, v);
  36. }
  37. extern int __do_page_cache_readahead(struct address_space *mapping,
  38. struct file *filp, pgoff_t offset, unsigned long nr_to_read,
  39. unsigned long lookahead_size);
  40. /*
  41. * Submit IO for the read-ahead request in file_ra_state.
  42. */
  43. static inline unsigned long ra_submit(struct file_ra_state *ra,
  44. struct address_space *mapping, struct file *filp)
  45. {
  46. return __do_page_cache_readahead(mapping, filp,
  47. ra->start, ra->size, ra->async_size);
  48. }
  49. /*
  50. * Turn a non-refcounted page (->_count == 0) into refcounted with
  51. * a count of one.
  52. */
  53. static inline void set_page_refcounted(struct page *page)
  54. {
  55. VM_BUG_ON_PAGE(PageTail(page), page);
  56. VM_BUG_ON_PAGE(atomic_read(&page->_count), page);
  57. set_page_count(page, 1);
  58. }
  59. extern unsigned long highest_memmap_pfn;
  60. /*
  61. * in mm/vmscan.c:
  62. */
  63. extern int isolate_lru_page(struct page *page);
  64. extern void putback_lru_page(struct page *page);
  65. extern bool zone_reclaimable(struct zone *zone);
  66. /*
  67. * in mm/rmap.c:
  68. */
  69. extern pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address);
  70. /*
  71. * in mm/page_alloc.c
  72. */
  73. /*
  74. * Structure for holding the mostly immutable allocation parameters passed
  75. * between functions involved in allocations, including the alloc_pages*
  76. * family of functions.
  77. *
  78. * nodemask, migratetype and high_zoneidx are initialized only once in
  79. * __alloc_pages_nodemask() and then never change.
  80. *
  81. * zonelist, preferred_zone and classzone_idx are set first in
  82. * __alloc_pages_nodemask() for the fast path, and might be later changed
  83. * in __alloc_pages_slowpath(). All other functions pass the whole strucure
  84. * by a const pointer.
  85. */
  86. struct alloc_context {
  87. struct zonelist *zonelist;
  88. nodemask_t *nodemask;
  89. struct zone *preferred_zone;
  90. int classzone_idx;
  91. int migratetype;
  92. enum zone_type high_zoneidx;
  93. bool spread_dirty_pages;
  94. };
  95. /*
  96. * Locate the struct page for both the matching buddy in our
  97. * pair (buddy1) and the combined O(n+1) page they form (page).
  98. *
  99. * 1) Any buddy B1 will have an order O twin B2 which satisfies
  100. * the following equation:
  101. * B2 = B1 ^ (1 << O)
  102. * For example, if the starting buddy (buddy2) is #8 its order
  103. * 1 buddy is #10:
  104. * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
  105. *
  106. * 2) Any buddy B will have an order O+1 parent P which
  107. * satisfies the following equation:
  108. * P = B & ~(1 << O)
  109. *
  110. * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
  111. */
  112. static inline unsigned long
  113. __find_buddy_index(unsigned long page_idx, unsigned int order)
  114. {
  115. return page_idx ^ (1 << order);
  116. }
  117. extern int __isolate_free_page(struct page *page, unsigned int order);
  118. extern void __free_pages_bootmem(struct page *page, unsigned long pfn,
  119. unsigned int order);
  120. extern void prep_compound_page(struct page *page, unsigned int order);
  121. #ifdef CONFIG_MEMORY_FAILURE
  122. extern bool is_free_buddy_page(struct page *page);
  123. #endif
  124. extern int user_min_free_kbytes;
  125. #if defined CONFIG_COMPACTION || defined CONFIG_CMA
  126. /*
  127. * in mm/compaction.c
  128. */
  129. /*
  130. * compact_control is used to track pages being migrated and the free pages
  131. * they are being migrated to during memory compaction. The free_pfn starts
  132. * at the end of a zone and migrate_pfn begins at the start. Movable pages
  133. * are moved to the end of a zone during a compaction run and the run
  134. * completes when free_pfn <= migrate_pfn
  135. */
  136. struct compact_control {
  137. struct list_head freepages; /* List of free pages to migrate to */
  138. struct list_head migratepages; /* List of pages being migrated */
  139. unsigned long nr_freepages; /* Number of isolated free pages */
  140. unsigned long nr_migratepages; /* Number of pages to migrate */
  141. unsigned long free_pfn; /* isolate_freepages search base */
  142. unsigned long migrate_pfn; /* isolate_migratepages search base */
  143. unsigned long last_migrated_pfn;/* Not yet flushed page being freed */
  144. enum migrate_mode mode; /* Async or sync migration mode */
  145. bool ignore_skip_hint; /* Scan blocks even if marked skip */
  146. int order; /* order a direct compactor needs */
  147. const gfp_t gfp_mask; /* gfp mask of a direct compactor */
  148. const int alloc_flags; /* alloc flags of a direct compactor */
  149. const int classzone_idx; /* zone index of a direct compactor */
  150. struct zone *zone;
  151. int contended; /* Signal need_sched() or lock
  152. * contention detected during
  153. * compaction
  154. */
  155. };
  156. unsigned long
  157. isolate_freepages_range(struct compact_control *cc,
  158. unsigned long start_pfn, unsigned long end_pfn);
  159. unsigned long
  160. isolate_migratepages_range(struct compact_control *cc,
  161. unsigned long low_pfn, unsigned long end_pfn);
  162. int find_suitable_fallback(struct free_area *area, unsigned int order,
  163. int migratetype, bool only_stealable, bool *can_steal);
  164. #endif
  165. /*
  166. * This function returns the order of a free page in the buddy system. In
  167. * general, page_zone(page)->lock must be held by the caller to prevent the
  168. * page from being allocated in parallel and returning garbage as the order.
  169. * If a caller does not hold page_zone(page)->lock, it must guarantee that the
  170. * page cannot be allocated or merged in parallel. Alternatively, it must
  171. * handle invalid values gracefully, and use page_order_unsafe() below.
  172. */
  173. static inline unsigned int page_order(struct page *page)
  174. {
  175. /* PageBuddy() must be checked by the caller */
  176. return page_private(page);
  177. }
  178. /*
  179. * Like page_order(), but for callers who cannot afford to hold the zone lock.
  180. * PageBuddy() should be checked first by the caller to minimize race window,
  181. * and invalid values must be handled gracefully.
  182. *
  183. * READ_ONCE is used so that if the caller assigns the result into a local
  184. * variable and e.g. tests it for valid range before using, the compiler cannot
  185. * decide to remove the variable and inline the page_private(page) multiple
  186. * times, potentially observing different values in the tests and the actual
  187. * use of the result.
  188. */
  189. #define page_order_unsafe(page) READ_ONCE(page_private(page))
  190. static inline bool is_cow_mapping(vm_flags_t flags)
  191. {
  192. return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
  193. }
  194. /*
  195. * These three helpers classifies VMAs for virtual memory accounting.
  196. */
  197. /*
  198. * Executable code area - executable, not writable, not stack
  199. */
  200. static inline bool is_exec_mapping(vm_flags_t flags)
  201. {
  202. return (flags & (VM_EXEC | VM_WRITE | VM_STACK)) == VM_EXEC;
  203. }
  204. /*
  205. * Stack area - atomatically grows in one direction
  206. *
  207. * VM_GROWSUP / VM_GROWSDOWN VMAs are always private anonymous:
  208. * do_mmap() forbids all other combinations.
  209. */
  210. static inline bool is_stack_mapping(vm_flags_t flags)
  211. {
  212. return (flags & VM_STACK) == VM_STACK;
  213. }
  214. /*
  215. * Data area - private, writable, not stack
  216. */
  217. static inline bool is_data_mapping(vm_flags_t flags)
  218. {
  219. return (flags & (VM_WRITE | VM_SHARED | VM_STACK)) == VM_WRITE;
  220. }
  221. /* mm/util.c */
  222. void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
  223. struct vm_area_struct *prev, struct rb_node *rb_parent);
  224. #ifdef CONFIG_MMU
  225. extern long populate_vma_page_range(struct vm_area_struct *vma,
  226. unsigned long start, unsigned long end, int *nonblocking);
  227. extern void munlock_vma_pages_range(struct vm_area_struct *vma,
  228. unsigned long start, unsigned long end);
  229. static inline void munlock_vma_pages_all(struct vm_area_struct *vma)
  230. {
  231. munlock_vma_pages_range(vma, vma->vm_start, vma->vm_end);
  232. }
  233. /*
  234. * must be called with vma's mmap_sem held for read or write, and page locked.
  235. */
  236. extern void mlock_vma_page(struct page *page);
  237. extern unsigned int munlock_vma_page(struct page *page);
  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. */
  247. extern void clear_page_mlock(struct page *page);
  248. /*
  249. * mlock_migrate_page - called only from migrate_misplaced_transhuge_page()
  250. * (because that does not go through the full procedure of migration ptes):
  251. * to migrate the Mlocked page flag; update statistics.
  252. */
  253. static inline void mlock_migrate_page(struct page *newpage, struct page *page)
  254. {
  255. if (TestClearPageMlocked(page)) {
  256. int nr_pages = hpage_nr_pages(page);
  257. /* Holding pmd lock, no change in irq context: __mod is safe */
  258. __mod_zone_page_state(page_zone(page), NR_MLOCK, -nr_pages);
  259. SetPageMlocked(newpage);
  260. __mod_zone_page_state(page_zone(newpage), NR_MLOCK, nr_pages);
  261. }
  262. }
  263. extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
  264. /*
  265. * At what user virtual address is page expected in @vma?
  266. */
  267. static inline unsigned long
  268. __vma_address(struct page *page, struct vm_area_struct *vma)
  269. {
  270. pgoff_t pgoff = page_to_pgoff(page);
  271. return vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
  272. }
  273. static inline unsigned long
  274. vma_address(struct page *page, struct vm_area_struct *vma)
  275. {
  276. unsigned long address = __vma_address(page, vma);
  277. /* page should be within @vma mapping range */
  278. VM_BUG_ON_VMA(address < vma->vm_start || address >= vma->vm_end, vma);
  279. return address;
  280. }
  281. #else /* !CONFIG_MMU */
  282. static inline void clear_page_mlock(struct page *page) { }
  283. static inline void mlock_vma_page(struct page *page) { }
  284. static inline void mlock_migrate_page(struct page *new, struct page *old) { }
  285. #endif /* !CONFIG_MMU */
  286. /*
  287. * Return the mem_map entry representing the 'offset' subpage within
  288. * the maximally aligned gigantic page 'base'. Handle any discontiguity
  289. * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
  290. */
  291. static inline struct page *mem_map_offset(struct page *base, int offset)
  292. {
  293. if (unlikely(offset >= MAX_ORDER_NR_PAGES))
  294. return nth_page(base, offset);
  295. return base + offset;
  296. }
  297. /*
  298. * Iterator over all subpages within the maximally aligned gigantic
  299. * page 'base'. Handle any discontiguity in the mem_map.
  300. */
  301. static inline struct page *mem_map_next(struct page *iter,
  302. struct page *base, int offset)
  303. {
  304. if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
  305. unsigned long pfn = page_to_pfn(base) + offset;
  306. if (!pfn_valid(pfn))
  307. return NULL;
  308. return pfn_to_page(pfn);
  309. }
  310. return iter + 1;
  311. }
  312. /*
  313. * FLATMEM and DISCONTIGMEM configurations use alloc_bootmem_node,
  314. * so all functions starting at paging_init should be marked __init
  315. * in those cases. SPARSEMEM, however, allows for memory hotplug,
  316. * and alloc_bootmem_node is not used.
  317. */
  318. #ifdef CONFIG_SPARSEMEM
  319. #define __paginginit __meminit
  320. #else
  321. #define __paginginit __init
  322. #endif
  323. /* Memory initialisation debug and verification */
  324. enum mminit_level {
  325. MMINIT_WARNING,
  326. MMINIT_VERIFY,
  327. MMINIT_TRACE
  328. };
  329. #ifdef CONFIG_DEBUG_MEMORY_INIT
  330. extern int mminit_loglevel;
  331. #define mminit_dprintk(level, prefix, fmt, arg...) \
  332. do { \
  333. if (level < mminit_loglevel) { \
  334. if (level <= MMINIT_WARNING) \
  335. printk(KERN_WARNING "mminit::" prefix " " fmt, ##arg); \
  336. else \
  337. printk(KERN_DEBUG "mminit::" prefix " " fmt, ##arg); \
  338. } \
  339. } while (0)
  340. extern void mminit_verify_pageflags_layout(void);
  341. extern void mminit_verify_zonelist(void);
  342. #else
  343. static inline void mminit_dprintk(enum mminit_level level,
  344. const char *prefix, const char *fmt, ...)
  345. {
  346. }
  347. static inline void mminit_verify_pageflags_layout(void)
  348. {
  349. }
  350. static inline void mminit_verify_zonelist(void)
  351. {
  352. }
  353. #endif /* CONFIG_DEBUG_MEMORY_INIT */
  354. /* mminit_validate_memmodel_limits is independent of CONFIG_DEBUG_MEMORY_INIT */
  355. #if defined(CONFIG_SPARSEMEM)
  356. extern void mminit_validate_memmodel_limits(unsigned long *start_pfn,
  357. unsigned long *end_pfn);
  358. #else
  359. static inline void mminit_validate_memmodel_limits(unsigned long *start_pfn,
  360. unsigned long *end_pfn)
  361. {
  362. }
  363. #endif /* CONFIG_SPARSEMEM */
  364. #define ZONE_RECLAIM_NOSCAN -2
  365. #define ZONE_RECLAIM_FULL -1
  366. #define ZONE_RECLAIM_SOME 0
  367. #define ZONE_RECLAIM_SUCCESS 1
  368. extern int hwpoison_filter(struct page *p);
  369. extern u32 hwpoison_filter_dev_major;
  370. extern u32 hwpoison_filter_dev_minor;
  371. extern u64 hwpoison_filter_flags_mask;
  372. extern u64 hwpoison_filter_flags_value;
  373. extern u64 hwpoison_filter_memcg;
  374. extern u32 hwpoison_filter_enable;
  375. extern unsigned long vm_mmap_pgoff(struct file *, unsigned long,
  376. unsigned long, unsigned long,
  377. unsigned long, unsigned long);
  378. extern void set_pageblock_order(void);
  379. unsigned long reclaim_clean_pages_from_list(struct zone *zone,
  380. struct list_head *page_list);
  381. /* The ALLOC_WMARK bits are used as an index to zone->watermark */
  382. #define ALLOC_WMARK_MIN WMARK_MIN
  383. #define ALLOC_WMARK_LOW WMARK_LOW
  384. #define ALLOC_WMARK_HIGH WMARK_HIGH
  385. #define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
  386. /* Mask to get the watermark bits */
  387. #define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
  388. #define ALLOC_HARDER 0x10 /* try to alloc harder */
  389. #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
  390. #define ALLOC_CPUSET 0x40 /* check for correct cpuset */
  391. #define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
  392. #define ALLOC_FAIR 0x100 /* fair zone allocation */
  393. enum ttu_flags;
  394. struct tlbflush_unmap_batch;
  395. #ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
  396. void try_to_unmap_flush(void);
  397. void try_to_unmap_flush_dirty(void);
  398. #else
  399. static inline void try_to_unmap_flush(void)
  400. {
  401. }
  402. static inline void try_to_unmap_flush_dirty(void)
  403. {
  404. }
  405. #endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
  406. #endif /* __MM_INTERNAL_H */