blob: cf382549dd702ad48d393745c1caa17cbc0eab7f [file] [log] [blame]
David Brazdil0f672f62019-12-10 10:32:29 +00001/* SPDX-License-Identifier: GPL-2.0-or-later */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002/* internal.h: mm/ internal definitions
3 *
4 * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00006 */
7#ifndef __MM_INTERNAL_H
8#define __MM_INTERNAL_H
9
10#include <linux/fs.h>
11#include <linux/mm.h>
12#include <linux/pagemap.h>
13#include <linux/tracepoint-defs.h>
14
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_RETRY_MAYFAIL|__GFP_NOFAIL|\
23 __GFP_NORETRY|__GFP_MEMALLOC|__GFP_NOMEMALLOC|\
24 __GFP_ATOMIC)
25
26/* The GFP flags allowed during early boot */
27#define GFP_BOOT_MASK (__GFP_BITS_MASK & ~(__GFP_RECLAIM|__GFP_IO|__GFP_FS))
28
29/* Control allocation cpuset and node placement constraints */
30#define GFP_CONSTRAINT_MASK (__GFP_HARDWALL|__GFP_THISNODE)
31
32/* Do not use these with a slab allocator */
33#define GFP_SLAB_BUG_MASK (__GFP_DMA32|__GFP_HIGHMEM|~__GFP_BITS_MASK)
34
35void page_writeback_init(void);
36
37vm_fault_t do_swap_page(struct vm_fault *vmf);
38
39void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *start_vma,
40 unsigned long floor, unsigned long ceiling);
41
David Brazdil0f672f62019-12-10 10:32:29 +000042static inline bool can_madv_lru_vma(struct vm_area_struct *vma)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +000043{
44 return !(vma->vm_flags & (VM_LOCKED|VM_HUGETLB|VM_PFNMAP));
45}
46
47void unmap_page_range(struct mmu_gather *tlb,
48 struct vm_area_struct *vma,
49 unsigned long addr, unsigned long end,
50 struct zap_details *details);
51
52extern unsigned int __do_page_cache_readahead(struct address_space *mapping,
53 struct file *filp, pgoff_t offset, unsigned long nr_to_read,
54 unsigned long lookahead_size);
55
56/*
57 * Submit IO for the read-ahead request in file_ra_state.
58 */
59static inline unsigned long ra_submit(struct file_ra_state *ra,
60 struct address_space *mapping, struct file *filp)
61{
62 return __do_page_cache_readahead(mapping, filp,
63 ra->start, ra->size, ra->async_size);
64}
65
66/*
67 * Turn a non-refcounted page (->_refcount == 0) into refcounted with
68 * a count of one.
69 */
70static inline void set_page_refcounted(struct page *page)
71{
72 VM_BUG_ON_PAGE(PageTail(page), page);
73 VM_BUG_ON_PAGE(page_ref_count(page), page);
74 set_page_count(page, 1);
75}
76
77extern unsigned long highest_memmap_pfn;
78
79/*
80 * Maximum number of reclaim retries without progress before the OOM
81 * killer is consider the only way forward.
82 */
83#define MAX_RECLAIM_RETRIES 16
84
85/*
86 * in mm/vmscan.c:
87 */
88extern int isolate_lru_page(struct page *page);
89extern void putback_lru_page(struct page *page);
90
91/*
92 * in mm/rmap.c:
93 */
94extern pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address);
95
96/*
97 * in mm/page_alloc.c
98 */
99
100/*
101 * Structure for holding the mostly immutable allocation parameters passed
102 * between functions involved in allocations, including the alloc_pages*
103 * family of functions.
104 *
105 * nodemask, migratetype and high_zoneidx are initialized only once in
106 * __alloc_pages_nodemask() and then never change.
107 *
108 * zonelist, preferred_zone and classzone_idx are set first in
109 * __alloc_pages_nodemask() for the fast path, and might be later changed
110 * in __alloc_pages_slowpath(). All other functions pass the whole strucure
111 * by a const pointer.
112 */
113struct alloc_context {
114 struct zonelist *zonelist;
115 nodemask_t *nodemask;
116 struct zoneref *preferred_zoneref;
117 int migratetype;
118 enum zone_type high_zoneidx;
119 bool spread_dirty_pages;
120};
121
122#define ac_classzone_idx(ac) zonelist_zone_idx(ac->preferred_zoneref)
123
124/*
125 * Locate the struct page for both the matching buddy in our
126 * pair (buddy1) and the combined O(n+1) page they form (page).
127 *
128 * 1) Any buddy B1 will have an order O twin B2 which satisfies
129 * the following equation:
130 * B2 = B1 ^ (1 << O)
131 * For example, if the starting buddy (buddy2) is #8 its order
132 * 1 buddy is #10:
133 * B2 = 8 ^ (1 << 1) = 8 ^ 2 = 10
134 *
135 * 2) Any buddy B will have an order O+1 parent P which
136 * satisfies the following equation:
137 * P = B & ~(1 << O)
138 *
139 * Assumption: *_mem_map is contiguous at least up to MAX_ORDER
140 */
141static inline unsigned long
142__find_buddy_pfn(unsigned long page_pfn, unsigned int order)
143{
144 return page_pfn ^ (1 << order);
145}
146
147extern struct page *__pageblock_pfn_to_page(unsigned long start_pfn,
148 unsigned long end_pfn, struct zone *zone);
149
150static inline struct page *pageblock_pfn_to_page(unsigned long start_pfn,
151 unsigned long end_pfn, struct zone *zone)
152{
153 if (zone->contiguous)
154 return pfn_to_page(start_pfn);
155
156 return __pageblock_pfn_to_page(start_pfn, end_pfn, zone);
157}
158
159extern int __isolate_free_page(struct page *page, unsigned int order);
David Brazdil0f672f62019-12-10 10:32:29 +0000160extern void memblock_free_pages(struct page *page, unsigned long pfn,
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000161 unsigned int order);
David Brazdil0f672f62019-12-10 10:32:29 +0000162extern void __free_pages_core(struct page *page, unsigned int order);
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000163extern void prep_compound_page(struct page *page, unsigned int order);
164extern void post_alloc_hook(struct page *page, unsigned int order,
165 gfp_t gfp_flags);
166extern int user_min_free_kbytes;
167
168#if defined CONFIG_COMPACTION || defined CONFIG_CMA
169
170/*
171 * in mm/compaction.c
172 */
173/*
174 * compact_control is used to track pages being migrated and the free pages
175 * they are being migrated to during memory compaction. The free_pfn starts
176 * at the end of a zone and migrate_pfn begins at the start. Movable pages
177 * are moved to the end of a zone during a compaction run and the run
178 * completes when free_pfn <= migrate_pfn
179 */
180struct compact_control {
181 struct list_head freepages; /* List of free pages to migrate to */
182 struct list_head migratepages; /* List of pages being migrated */
David Brazdil0f672f62019-12-10 10:32:29 +0000183 unsigned int nr_freepages; /* Number of isolated free pages */
184 unsigned int nr_migratepages; /* Number of pages to migrate */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000185 unsigned long free_pfn; /* isolate_freepages search base */
186 unsigned long migrate_pfn; /* isolate_migratepages search base */
David Brazdil0f672f62019-12-10 10:32:29 +0000187 unsigned long fast_start_pfn; /* a pfn to start linear scan from */
188 struct zone *zone;
189 unsigned long total_migrate_scanned;
190 unsigned long total_free_scanned;
191 unsigned short fast_search_fail;/* failures to use free list searches */
192 short search_order; /* order to start a fast search at */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000193 const gfp_t gfp_mask; /* gfp mask of a direct compactor */
194 int order; /* order a direct compactor needs */
195 int migratetype; /* migratetype of direct compactor */
196 const unsigned int alloc_flags; /* alloc flags of a direct compactor */
197 const int classzone_idx; /* zone index of a direct compactor */
198 enum migrate_mode mode; /* Async or sync migration mode */
199 bool ignore_skip_hint; /* Scan blocks even if marked skip */
200 bool no_set_skip_hint; /* Don't mark blocks for skipping */
201 bool ignore_block_suitable; /* Scan blocks considered unsuitable */
202 bool direct_compaction; /* False from kcompactd or /proc/... */
203 bool whole_zone; /* Whole zone should/has been scanned */
204 bool contended; /* Signal lock or sched contention */
David Brazdil0f672f62019-12-10 10:32:29 +0000205 bool rescan; /* Rescanning the same pageblock */
206};
207
208/*
209 * Used in direct compaction when a page should be taken from the freelists
210 * immediately when one is created during the free path.
211 */
212struct capture_control {
213 struct compact_control *cc;
214 struct page *page;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000215};
216
217unsigned long
218isolate_freepages_range(struct compact_control *cc,
219 unsigned long start_pfn, unsigned long end_pfn);
220unsigned long
221isolate_migratepages_range(struct compact_control *cc,
222 unsigned long low_pfn, unsigned long end_pfn);
223int find_suitable_fallback(struct free_area *area, unsigned int order,
224 int migratetype, bool only_stealable, bool *can_steal);
225
226#endif
227
228/*
229 * This function returns the order of a free page in the buddy system. In
230 * general, page_zone(page)->lock must be held by the caller to prevent the
231 * page from being allocated in parallel and returning garbage as the order.
232 * If a caller does not hold page_zone(page)->lock, it must guarantee that the
233 * page cannot be allocated or merged in parallel. Alternatively, it must
234 * handle invalid values gracefully, and use page_order_unsafe() below.
235 */
236static inline unsigned int page_order(struct page *page)
237{
238 /* PageBuddy() must be checked by the caller */
239 return page_private(page);
240}
241
242/*
243 * Like page_order(), but for callers who cannot afford to hold the zone lock.
244 * PageBuddy() should be checked first by the caller to minimize race window,
245 * and invalid values must be handled gracefully.
246 *
247 * READ_ONCE is used so that if the caller assigns the result into a local
248 * variable and e.g. tests it for valid range before using, the compiler cannot
249 * decide to remove the variable and inline the page_private(page) multiple
250 * times, potentially observing different values in the tests and the actual
251 * use of the result.
252 */
253#define page_order_unsafe(page) READ_ONCE(page_private(page))
254
255static inline bool is_cow_mapping(vm_flags_t flags)
256{
257 return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
258}
259
260/*
261 * These three helpers classifies VMAs for virtual memory accounting.
262 */
263
264/*
265 * Executable code area - executable, not writable, not stack
266 */
267static inline bool is_exec_mapping(vm_flags_t flags)
268{
269 return (flags & (VM_EXEC | VM_WRITE | VM_STACK)) == VM_EXEC;
270}
271
272/*
273 * Stack area - atomatically grows in one direction
274 *
275 * VM_GROWSUP / VM_GROWSDOWN VMAs are always private anonymous:
276 * do_mmap() forbids all other combinations.
277 */
278static inline bool is_stack_mapping(vm_flags_t flags)
279{
280 return (flags & VM_STACK) == VM_STACK;
281}
282
283/*
284 * Data area - private, writable, not stack
285 */
286static inline bool is_data_mapping(vm_flags_t flags)
287{
288 return (flags & (VM_WRITE | VM_SHARED | VM_STACK)) == VM_WRITE;
289}
290
291/* mm/util.c */
292void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma,
293 struct vm_area_struct *prev, struct rb_node *rb_parent);
294
295#ifdef CONFIG_MMU
296extern long populate_vma_page_range(struct vm_area_struct *vma,
297 unsigned long start, unsigned long end, int *nonblocking);
298extern void munlock_vma_pages_range(struct vm_area_struct *vma,
299 unsigned long start, unsigned long end);
300static inline void munlock_vma_pages_all(struct vm_area_struct *vma)
301{
302 munlock_vma_pages_range(vma, vma->vm_start, vma->vm_end);
303}
304
305/*
306 * must be called with vma's mmap_sem held for read or write, and page locked.
307 */
308extern void mlock_vma_page(struct page *page);
309extern unsigned int munlock_vma_page(struct page *page);
310
311/*
312 * Clear the page's PageMlocked(). This can be useful in a situation where
313 * we want to unconditionally remove a page from the pagecache -- e.g.,
314 * on truncation or freeing.
315 *
316 * It is legal to call this function for any page, mlocked or not.
317 * If called for a page that is still mapped by mlocked vmas, all we do
318 * is revert to lazy LRU behaviour -- semantics are not broken.
319 */
320extern void clear_page_mlock(struct page *page);
321
322/*
323 * mlock_migrate_page - called only from migrate_misplaced_transhuge_page()
324 * (because that does not go through the full procedure of migration ptes):
325 * to migrate the Mlocked page flag; update statistics.
326 */
327static inline void mlock_migrate_page(struct page *newpage, struct page *page)
328{
329 if (TestClearPageMlocked(page)) {
330 int nr_pages = hpage_nr_pages(page);
331
332 /* Holding pmd lock, no change in irq context: __mod is safe */
333 __mod_zone_page_state(page_zone(page), NR_MLOCK, -nr_pages);
334 SetPageMlocked(newpage);
335 __mod_zone_page_state(page_zone(newpage), NR_MLOCK, nr_pages);
336 }
337}
338
339extern pmd_t maybe_pmd_mkwrite(pmd_t pmd, struct vm_area_struct *vma);
340
341/*
Olivier Deprez0e641232021-09-23 10:07:05 +0200342 * At what user virtual address is page expected in vma?
343 * Returns -EFAULT if all of the page is outside the range of vma.
344 * If page is a compound head, the entire compound page is considered.
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000345 */
346static inline unsigned long
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000347vma_address(struct page *page, struct vm_area_struct *vma)
348{
Olivier Deprez0e641232021-09-23 10:07:05 +0200349 pgoff_t pgoff;
350 unsigned long address;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000351
Olivier Deprez0e641232021-09-23 10:07:05 +0200352 VM_BUG_ON_PAGE(PageKsm(page), page); /* KSM page->index unusable */
353 pgoff = page_to_pgoff(page);
354 if (pgoff >= vma->vm_pgoff) {
355 address = vma->vm_start +
356 ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
357 /* Check for address beyond vma (or wrapped through 0?) */
358 if (address < vma->vm_start || address >= vma->vm_end)
359 address = -EFAULT;
360 } else if (PageHead(page) &&
361 pgoff + compound_nr(page) - 1 >= vma->vm_pgoff) {
362 /* Test above avoids possibility of wrap to 0 on 32-bit */
363 address = vma->vm_start;
364 } else {
365 address = -EFAULT;
366 }
367 return address;
368}
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000369
Olivier Deprez0e641232021-09-23 10:07:05 +0200370/*
371 * Then at what user virtual address will none of the page be found in vma?
372 * Assumes that vma_address() already returned a good starting address.
373 * If page is a compound head, the entire compound page is considered.
374 */
375static inline unsigned long
376vma_address_end(struct page *page, struct vm_area_struct *vma)
377{
378 pgoff_t pgoff;
379 unsigned long address;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000380
Olivier Deprez0e641232021-09-23 10:07:05 +0200381 VM_BUG_ON_PAGE(PageKsm(page), page); /* KSM page->index unusable */
382 pgoff = page_to_pgoff(page) + compound_nr(page);
383 address = vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
384 /* Check for address beyond vma (or wrapped through 0?) */
385 if (address < vma->vm_start || address > vma->vm_end)
386 address = vma->vm_end;
387 return address;
388}
389
390static inline struct file *maybe_unlock_mmap_for_io(struct vm_fault *vmf,
391 struct file *fpin)
392{
393 int flags = vmf->flags;
394
395 if (fpin)
396 return fpin;
397
398 /*
399 * FAULT_FLAG_RETRY_NOWAIT means we don't want to wait on page locks or
400 * anything, so we only pin the file and drop the mmap_sem if only
401 * FAULT_FLAG_ALLOW_RETRY is set.
402 */
403 if ((flags & (FAULT_FLAG_ALLOW_RETRY | FAULT_FLAG_RETRY_NOWAIT)) ==
404 FAULT_FLAG_ALLOW_RETRY) {
405 fpin = get_file(vmf->vma->vm_file);
406 up_read(&vmf->vma->vm_mm->mmap_sem);
407 }
408 return fpin;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000409}
410
411#else /* !CONFIG_MMU */
412static inline void clear_page_mlock(struct page *page) { }
413static inline void mlock_vma_page(struct page *page) { }
414static inline void mlock_migrate_page(struct page *new, struct page *old) { }
415
416#endif /* !CONFIG_MMU */
417
418/*
419 * Return the mem_map entry representing the 'offset' subpage within
420 * the maximally aligned gigantic page 'base'. Handle any discontiguity
421 * in the mem_map at MAX_ORDER_NR_PAGES boundaries.
422 */
423static inline struct page *mem_map_offset(struct page *base, int offset)
424{
425 if (unlikely(offset >= MAX_ORDER_NR_PAGES))
426 return nth_page(base, offset);
427 return base + offset;
428}
429
430/*
431 * Iterator over all subpages within the maximally aligned gigantic
432 * page 'base'. Handle any discontiguity in the mem_map.
433 */
434static inline struct page *mem_map_next(struct page *iter,
435 struct page *base, int offset)
436{
437 if (unlikely((offset & (MAX_ORDER_NR_PAGES - 1)) == 0)) {
438 unsigned long pfn = page_to_pfn(base) + offset;
439 if (!pfn_valid(pfn))
440 return NULL;
441 return pfn_to_page(pfn);
442 }
443 return iter + 1;
444}
445
446/* Memory initialisation debug and verification */
447enum mminit_level {
448 MMINIT_WARNING,
449 MMINIT_VERIFY,
450 MMINIT_TRACE
451};
452
453#ifdef CONFIG_DEBUG_MEMORY_INIT
454
455extern int mminit_loglevel;
456
457#define mminit_dprintk(level, prefix, fmt, arg...) \
458do { \
459 if (level < mminit_loglevel) { \
460 if (level <= MMINIT_WARNING) \
461 pr_warn("mminit::" prefix " " fmt, ##arg); \
462 else \
463 printk(KERN_DEBUG "mminit::" prefix " " fmt, ##arg); \
464 } \
465} while (0)
466
467extern void mminit_verify_pageflags_layout(void);
468extern void mminit_verify_zonelist(void);
469#else
470
471static inline void mminit_dprintk(enum mminit_level level,
472 const char *prefix, const char *fmt, ...)
473{
474}
475
476static inline void mminit_verify_pageflags_layout(void)
477{
478}
479
480static inline void mminit_verify_zonelist(void)
481{
482}
483#endif /* CONFIG_DEBUG_MEMORY_INIT */
484
485/* mminit_validate_memmodel_limits is independent of CONFIG_DEBUG_MEMORY_INIT */
486#if defined(CONFIG_SPARSEMEM)
487extern void mminit_validate_memmodel_limits(unsigned long *start_pfn,
488 unsigned long *end_pfn);
489#else
490static inline void mminit_validate_memmodel_limits(unsigned long *start_pfn,
491 unsigned long *end_pfn)
492{
493}
494#endif /* CONFIG_SPARSEMEM */
495
496#define NODE_RECLAIM_NOSCAN -2
497#define NODE_RECLAIM_FULL -1
498#define NODE_RECLAIM_SOME 0
499#define NODE_RECLAIM_SUCCESS 1
500
David Brazdil0f672f62019-12-10 10:32:29 +0000501#ifdef CONFIG_NUMA
502extern int node_reclaim(struct pglist_data *, gfp_t, unsigned int);
503#else
504static inline int node_reclaim(struct pglist_data *pgdat, gfp_t mask,
505 unsigned int order)
506{
507 return NODE_RECLAIM_NOSCAN;
508}
509#endif
510
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000511extern int hwpoison_filter(struct page *p);
512
513extern u32 hwpoison_filter_dev_major;
514extern u32 hwpoison_filter_dev_minor;
515extern u64 hwpoison_filter_flags_mask;
516extern u64 hwpoison_filter_flags_value;
517extern u64 hwpoison_filter_memcg;
518extern u32 hwpoison_filter_enable;
519
520extern unsigned long __must_check vm_mmap_pgoff(struct file *, unsigned long,
521 unsigned long, unsigned long,
522 unsigned long, unsigned long);
523
524extern void set_pageblock_order(void);
525unsigned long reclaim_clean_pages_from_list(struct zone *zone,
526 struct list_head *page_list);
527/* The ALLOC_WMARK bits are used as an index to zone->watermark */
528#define ALLOC_WMARK_MIN WMARK_MIN
529#define ALLOC_WMARK_LOW WMARK_LOW
530#define ALLOC_WMARK_HIGH WMARK_HIGH
531#define ALLOC_NO_WATERMARKS 0x04 /* don't check watermarks at all */
532
533/* Mask to get the watermark bits */
534#define ALLOC_WMARK_MASK (ALLOC_NO_WATERMARKS-1)
535
536/*
537 * Only MMU archs have async oom victim reclaim - aka oom_reaper so we
538 * cannot assume a reduced access to memory reserves is sufficient for
539 * !MMU
540 */
541#ifdef CONFIG_MMU
542#define ALLOC_OOM 0x08
543#else
544#define ALLOC_OOM ALLOC_NO_WATERMARKS
545#endif
546
David Brazdil0f672f62019-12-10 10:32:29 +0000547#define ALLOC_HARDER 0x10 /* try to alloc harder */
548#define ALLOC_HIGH 0x20 /* __GFP_HIGH set */
549#define ALLOC_CPUSET 0x40 /* check for correct cpuset */
550#define ALLOC_CMA 0x80 /* allow allocations from CMA areas */
551#ifdef CONFIG_ZONE_DMA32
552#define ALLOC_NOFRAGMENT 0x100 /* avoid mixing pageblock types */
553#else
554#define ALLOC_NOFRAGMENT 0x0
555#endif
556#define ALLOC_KSWAPD 0x200 /* allow waking of kswapd */
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000557
558enum ttu_flags;
559struct tlbflush_unmap_batch;
560
561
562/*
563 * only for MM internal work items which do not depend on
564 * any allocations or locks which might depend on allocations
565 */
566extern struct workqueue_struct *mm_percpu_wq;
567
568#ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
569void try_to_unmap_flush(void);
570void try_to_unmap_flush_dirty(void);
571void flush_tlb_batched_pending(struct mm_struct *mm);
572#else
573static inline void try_to_unmap_flush(void)
574{
575}
576static inline void try_to_unmap_flush_dirty(void)
577{
578}
579static inline void flush_tlb_batched_pending(struct mm_struct *mm)
580{
581}
582#endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
583
584extern const struct trace_print_flags pageflag_names[];
585extern const struct trace_print_flags vmaflag_names[];
586extern const struct trace_print_flags gfpflag_names[];
587
588static inline bool is_migrate_highatomic(enum migratetype migratetype)
589{
590 return migratetype == MIGRATE_HIGHATOMIC;
591}
592
593static inline bool is_migrate_highatomic_page(struct page *page)
594{
595 return get_pageblock_migratetype(page) == MIGRATE_HIGHATOMIC;
596}
597
598void setup_zone_pageset(struct zone *zone);
599extern struct page *alloc_new_node_page(struct page *page, unsigned long node);
600#endif /* __MM_INTERNAL_H */