internal.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434
  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. void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *start_vma,
  16. unsigned long floor, unsigned long ceiling);
  17. static inline void set_page_count(struct page *page, int v)
  18. {
  19. atomic_set(&page->_count, v);
  20. }
  21. extern int __do_page_cache_readahead(struct address_space *mapping,
  22. struct file *filp, pgoff_t offset, unsigned long nr_to_read,
  23. unsigned long lookahead_size);
  24. /*
  25. * Submit IO for the read-ahead request in file_ra_state.
  26. */
  27. static inline unsigned long ra_submit(struct file_ra_state *ra,
  28. struct address_space *mapping, struct file *filp)
  29. {
  30. return __do_page_cache_readahead(mapping, filp,
  31. ra->start, ra->size, ra->async_size);
  32. }
  33. /*
  34. * Turn a non-refcounted page (->_count == 0) into refcounted with
  35. * a count of one.
  36. */
  37. static inline void set_page_refcounted(struct page *page)
  38. {
  39. VM_BUG_ON_PAGE(PageTail(page), page);
  40. VM_BUG_ON_PAGE(atomic_read(&page->_count), page);
  41. set_page_count(page, 1);
  42. }
  43. static inline void __get_page_tail_foll(struct page *page,
  44. bool get_page_head)
  45. {
  46. /*
  47. * If we're getting a tail page, the elevated page->_count is
  48. * required only in the head page and we will elevate the head
  49. * page->_count and tail page->_mapcount.
  50. *
  51. * We elevate page_tail->_mapcount for tail pages to force
  52. * page_tail->_count to be zero at all times to avoid getting
  53. * false positives from get_page_unless_zero() with
  54. * speculative page access (like in
  55. * page_cache_get_speculative()) on tail pages.
  56. */
  57. VM_BUG_ON_PAGE(atomic_read(&page->first_page->_count) <= 0, page);
  58. if (get_page_head)
  59. atomic_inc(&page->first_page->_count);
  60. get_huge_page_tail(page);
  61. }
  62. /*
  63. * This is meant to be called as the FOLL_GET operation of
  64. * follow_page() and it must be called while holding the proper PT
  65. * lock while the pte (or pmd_trans_huge) is still mapping the page.
  66. */
  67. static inline void get_page_foll(struct page *page)
  68. {
  69. if (unlikely(PageTail(page)))
  70. /*
  71. * This is safe only because
  72. * __split_huge_page_refcount() can't run under
  73. * get_page_foll() because we hold the proper PT lock.
  74. */
  75. __get_page_tail_foll(page, true);
  76. else {
  77. /*
  78. * Getting a normal page or the head of a compound page
  79. * requires to already have an elevated page->_count.
  80. */
  81. VM_BUG_ON_PAGE(atomic_read(&page->_count) <= 0, page);
  82. atomic_inc(&page->_count);
  83. }
  84. }
  85. extern unsigned long highest_memmap_pfn;
  86. /*
  87. * in mm/vmscan.c:
  88. */
  89. extern int isolate_lru_page(struct page *page);
  90. extern void putback_lru_page(struct page *page);
  91. extern bool zone_reclaimable(struct zone *zone);
  92. /*
  93. * in mm/rmap.c:
  94. */
  95. extern pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address);
  96. /*
  97. * in mm/page_alloc.c
  98. */
  99. /*
  100. * Structure for holding the mostly immutable allocation parameters passed
  101. * between functions involved in allocations, including the alloc_pages*
  102. * family of functions.
  103. *
  104. * nodemask, migratetype and high_zoneidx are initialized only once in
  105. * __alloc_pages_nodemask() and then never change.
  106. *
  107. * zonelist, preferred_zone and classzone_idx are set first in
  108. * __alloc_pages_nodemask() for the fast path, and might be later changed
  109. * in __alloc_pages_slowpath(). All other functions pass the whole strucure
  110. * by a const pointer.
  111. */
  112. struct alloc_context {
  113. struct zonelist *zonelist;
  114. nodemask_t *nodemask;
  115. struct zone *preferred_zone;
  116. int classzone_idx;
  117. int migratetype;
  118. enum zone_type high_zoneidx;
  119. };
  120. /*
  121. * Locate the struct page for both the matching buddy in our
  122. * pair (buddy1) and the combined O(n+1) page they form (page).
  123. *
  124. * 1) Any buddy B1 will have an order O twin B2 which satisfies
  125. * the following equation:
  126. * B2 = B1 ^ (1 << O)
  127. * For example, if the starting buddy (buddy2) is #8 its order
  128. * 1 buddy is #10:
  129. * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
  130. *
  131. * 2) Any buddy B will have an order O+1 parent P which
  132. * satisfies the following equation:
  133. * P = B & ~(1 << O)
  134. *
  135. * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
  136. */
  137. static inline unsigned long
  138. __find_buddy_index(unsigned long page_idx, unsigned int order)
  139. {
  140. return page_idx ^ (1 << order);
  141. }
  142. extern int __isolate_free_page(struct page *page, unsigned int order);
  143. extern void __free_pages_bootmem(struct page *page, unsigned int order);
  144. extern void prep_compound_page(struct page *page, unsigned long order);
  145. #ifdef CONFIG_MEMORY_FAILURE
  146. extern bool is_free_buddy_page(struct page *page);
  147. #endif
  148. extern int user_min_free_kbytes;
  149. #if defined CONFIG_COMPACTION || defined CONFIG_CMA
  150. /*
  151. * in mm/compaction.c
  152. */
  153. /*
  154. * compact_control is used to track pages being migrated and the free pages
  155. * they are being migrated to during memory compaction. The free_pfn starts
  156. * at the end of a zone and migrate_pfn begins at the start. Movable pages
  157. * are moved to the end of a zone during a compaction run and the run
  158. * completes when free_pfn <= migrate_pfn
  159. */
  160. struct compact_control {
  161. struct list_head freepages; /* List of free pages to migrate to */
  162. struct list_head migratepages; /* List of pages being migrated */
  163. unsigned long nr_freepages; /* Number of isolated free pages */
  164. unsigned long nr_migratepages; /* Number of pages to migrate */
  165. unsigned long free_pfn; /* isolate_freepages search base */
  166. unsigned long migrate_pfn; /* isolate_migratepages search base */
  167. enum migrate_mode mode; /* Async or sync migration mode */
  168. bool ignore_skip_hint; /* Scan blocks even if marked skip */
  169. int order; /* order a direct compactor needs */
  170. const gfp_t gfp_mask; /* gfp mask of a direct compactor */
  171. const int alloc_flags; /* alloc flags of a direct compactor */
  172. const int classzone_idx; /* zone index of a direct compactor */
  173. struct zone *zone;
  174. int contended; /* Signal need_sched() or lock
  175. * contention detected during
  176. * compaction
  177. */
  178. };
  179. unsigned long
  180. isolate_freepages_range(struct compact_control *cc,
  181. unsigned long start_pfn, unsigned long end_pfn);
  182. unsigned long
  183. isolate_migratepages_range(struct compact_control *cc,
  184. unsigned long low_pfn, unsigned long end_pfn);
  185. #endif
  186. /*
  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
  191. * page cannot be allocated or merged in parallel. Alternatively, it must
  192. * handle invalid values gracefully, and use page_order_unsafe() below.
  193. */
  194. static inline unsigned long page_order(struct page *page)
  195. {
  196. /* PageBuddy() must be checked by the caller */
  197. return page_private(page);
  198. }
  199. /*
  200. * Like page_order(), but for callers who cannot afford to hold the zone lock.
  201. * PageBuddy() should be checked first by the caller to minimize race window,
  202. * and invalid values must be handled gracefully.
  203. *
  204. * ACCESS_ONCE is used so that if the caller assigns the result into a local
  205. * variable and e.g. tests it for valid range before using, the compiler cannot
  206. * decide to remove the variable and inline the page_private(page) multiple
  207. * times, potentially observing different values in the tests and the actual
  208. * use of the result.
  209. */
  210. #define page_order_unsafe(page) ACCESS_ONCE(page_private(page))
  211. static inline bool is_cow_mapping(vm_flags_t flags)
  212. {
  213. return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
  214. }
  215. /* mm/util.c */
  216. void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
  217. struct vm_area_struct *prev, struct rb_node *rb_parent);
  218. #ifdef CONFIG_MMU
  219. extern long __mlock_vma_pages_range(struct vm_area_struct *vma,
  220. unsigned long start, unsigned long end, int *nonblocking);
  221. extern void munlock_vma_pages_range(struct vm_area_struct *vma,
  222. unsigned long start, unsigned long end);
  223. static inline void munlock_vma_pages_all(struct vm_area_struct *vma)
  224. {
  225. munlock_vma_pages_range(vma, vma->vm_start, vma->vm_end);
  226. }
  227. /*
  228. * must be called with vma's mmap_sem held for read or write, and page locked.
  229. */
  230. extern void mlock_vma_page(struct page *page);
  231. extern unsigned int munlock_vma_page(struct page *page);
  232. /*
  233. * Clear the page's PageMlocked(). This can be useful in a situation where
  234. * we want to unconditionally remove a page from the pagecache -- e.g.,
  235. * on truncation or freeing.
  236. *
  237. * It is legal to call this function for any page, mlocked or not.
  238. * If called for a page that is still mapped by mlocked vmas, all we do
  239. * is revert to lazy LRU behaviour -- semantics are not broken.
  240. */
  241. extern void clear_page_mlock(struct page *page);
  242. /*
  243. * mlock_migrate_page - called only from migrate_page_copy() to
  244. * migrate the Mlocked page flag; update statistics.
  245. */
  246. static inline void mlock_migrate_page(struct page *newpage, struct page *page)
  247. {
  248. if (TestClearPageMlocked(page)) {
  249. unsigned long flags;
  250. int nr_pages = hpage_nr_pages(page);
  251. local_irq_save(flags);
  252. __mod_zone_page_state(page_zone(page), NR_MLOCK, -nr_pages);
  253. SetPageMlocked(newpage);
  254. __mod_zone_page_state(page_zone(newpage), NR_MLOCK, nr_pages);
  255. local_irq_restore(flags);
  256. }
  257. }
  258. extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
  259. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  260. extern unsigned long vma_address(struct page *page,
  261. struct vm_area_struct *vma);
  262. #endif
  263. #else /* !CONFIG_MMU */
  264. static inline void clear_page_mlock(struct page *page) { }
  265. static inline void mlock_vma_page(struct page *page) { }
  266. static inline void mlock_migrate_page(struct page *new, struct page *old) { }
  267. #endif /* !CONFIG_MMU */
  268. /*
  269. * Return the mem_map entry representing the 'offset' subpage within
  270. * the maximally aligned gigantic page 'base'. Handle any discontiguity
  271. * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
  272. */
  273. static inline struct page *mem_map_offset(struct page *base, int offset)
  274. {
  275. if (unlikely(offset >= MAX_ORDER_NR_PAGES))
  276. return nth_page(base, offset);
  277. return base + offset;
  278. }
  279. /*
  280. * Iterator over all subpages within the maximally aligned gigantic
  281. * page 'base'. Handle any discontiguity in the mem_map.
  282. */
  283. static inline struct page *mem_map_next(struct page *iter,
  284. struct page *base, int offset)
  285. {
  286. if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
  287. unsigned long pfn = page_to_pfn(base) + offset;
  288. if (!pfn_valid(pfn))
  289. return NULL;
  290. return pfn_to_page(pfn);
  291. }
  292. return iter + 1;
  293. }
  294. /*
  295. * FLATMEM and DISCONTIGMEM configurations use alloc_bootmem_node,
  296. * so all functions starting at paging_init should be marked __init
  297. * in those cases. SPARSEMEM, however, allows for memory hotplug,
  298. * and alloc_bootmem_node is not used.
  299. */
  300. #ifdef CONFIG_SPARSEMEM
  301. #define __paginginit __meminit
  302. #else
  303. #define __paginginit __init
  304. #endif
  305. /* Memory initialisation debug and verification */
  306. enum mminit_level {
  307. MMINIT_WARNING,
  308. MMINIT_VERIFY,
  309. MMINIT_TRACE
  310. };
  311. #ifdef CONFIG_DEBUG_MEMORY_INIT
  312. extern int mminit_loglevel;
  313. #define mminit_dprintk(level, prefix, fmt, arg...) \
  314. do { \
  315. if (level < mminit_loglevel) { \
  316. if (level <= MMINIT_WARNING) \
  317. printk(KERN_WARNING "mminit::" prefix " " fmt, ##arg); \
  318. else \
  319. printk(KERN_DEBUG "mminit::" prefix " " fmt, ##arg); \
  320. } \
  321. } while (0)
  322. extern void mminit_verify_pageflags_layout(void);
  323. extern void mminit_verify_page_links(struct page *page,
  324. enum zone_type zone, unsigned long nid, unsigned long pfn);
  325. extern void mminit_verify_zonelist(void);
  326. #else
  327. static inline void mminit_dprintk(enum mminit_level level,
  328. const char *prefix, const char *fmt, ...)
  329. {
  330. }
  331. static inline void mminit_verify_pageflags_layout(void)
  332. {
  333. }
  334. static inline void mminit_verify_page_links(struct page *page,
  335. enum zone_type zone, unsigned long nid, unsigned long pfn)
  336. {
  337. }
  338. static inline void mminit_verify_zonelist(void)
  339. {
  340. }
  341. #endif /* CONFIG_DEBUG_MEMORY_INIT */
  342. /* mminit_validate_memmodel_limits is independent of CONFIG_DEBUG_MEMORY_INIT */
  343. #if defined(CONFIG_SPARSEMEM)
  344. extern void mminit_validate_memmodel_limits(unsigned long *start_pfn,
  345. unsigned long *end_pfn);
  346. #else
  347. static inline void mminit_validate_memmodel_limits(unsigned long *start_pfn,
  348. unsigned long *end_pfn)
  349. {
  350. }
  351. #endif /* CONFIG_SPARSEMEM */
  352. #define ZONE_RECLAIM_NOSCAN -2
  353. #define ZONE_RECLAIM_FULL -1
  354. #define ZONE_RECLAIM_SOME 0
  355. #define ZONE_RECLAIM_SUCCESS 1
  356. extern int hwpoison_filter(struct page *p);
  357. extern u32 hwpoison_filter_dev_major;
  358. extern u32 hwpoison_filter_dev_minor;
  359. extern u64 hwpoison_filter_flags_mask;
  360. extern u64 hwpoison_filter_flags_value;
  361. extern u64 hwpoison_filter_memcg;
  362. extern u32 hwpoison_filter_enable;
  363. extern unsigned long vm_mmap_pgoff(struct file *, unsigned long,
  364. unsigned long, unsigned long,
  365. unsigned long, unsigned long);
  366. extern void set_pageblock_order(void);
  367. unsigned long reclaim_clean_pages_from_list(struct zone *zone,
  368. struct list_head *page_list);
  369. /* The ALLOC_WMARK bits are used as an index to zone->watermark */
  370. #define ALLOC_WMARK_MIN WMARK_MIN
  371. #define ALLOC_WMARK_LOW WMARK_LOW
  372. #define ALLOC_WMARK_HIGH WMARK_HIGH
  373. #define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
  374. /* Mask to get the watermark bits */
  375. #define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
  376. #define ALLOC_HARDER 0x10 /* try to alloc harder */
  377. #define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
  378. #define ALLOC_CPUSET 0x40 /* check for correct cpuset */
  379. #define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
  380. #define ALLOC_FAIR 0x100 /* fair zone allocation */
  381. #endif /* __MM_INTERNAL_H */