internal.h 15 KB

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