internal.h 15 KB

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