blob: 5e7219dc0fae44968c452d9e8e6b642435cf74b6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef __LINUX_GFP_H
2#define __LINUX_GFP_H
3
Sasha Levin309381fea2014-01-23 15:52:54 -08004#include <linux/mmdebug.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07005#include <linux/mmzone.h>
6#include <linux/stddef.h>
7#include <linux/linkage.h>
Rusty Russell082edb72009-03-13 23:43:37 +10308#include <linux/topology.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07009
10struct vm_area_struct;
11
Namhyung Kim16b56cf2010-10-26 14:22:04 -070012/* Plain integer GFP bitmasks. Do not use this directly. */
13#define ___GFP_DMA 0x01u
14#define ___GFP_HIGHMEM 0x02u
15#define ___GFP_DMA32 0x04u
16#define ___GFP_MOVABLE 0x08u
17#define ___GFP_WAIT 0x10u
18#define ___GFP_HIGH 0x20u
19#define ___GFP_IO 0x40u
20#define ___GFP_FS 0x80u
21#define ___GFP_COLD 0x100u
22#define ___GFP_NOWARN 0x200u
23#define ___GFP_REPEAT 0x400u
24#define ___GFP_NOFAIL 0x800u
25#define ___GFP_NORETRY 0x1000u
Mel Gormanb37f1dd2012-07-31 16:44:03 -070026#define ___GFP_MEMALLOC 0x2000u
Namhyung Kim16b56cf2010-10-26 14:22:04 -070027#define ___GFP_COMP 0x4000u
28#define ___GFP_ZERO 0x8000u
29#define ___GFP_NOMEMALLOC 0x10000u
30#define ___GFP_HARDWALL 0x20000u
31#define ___GFP_THISNODE 0x40000u
32#define ___GFP_RECLAIMABLE 0x80000u
Linus Torvaldscaf49192012-12-10 10:51:16 -080033#define ___GFP_NOTRACK 0x200000u
34#define ___GFP_NO_KSWAPD 0x400000u
35#define ___GFP_OTHER_NODE 0x800000u
36#define ___GFP_WRITE 0x1000000u
Andrew Morton05b0afd2012-12-12 13:51:56 -080037/* If the above are modified, __GFP_BITS_SHIFT may need updating */
Namhyung Kim16b56cf2010-10-26 14:22:04 -070038
Linus Torvalds1da177e2005-04-16 15:20:36 -070039/*
40 * GFP bitmasks..
Christoph Lametere53ef382006-09-25 23:31:14 -070041 *
42 * Zone modifiers (see linux/mmzone.h - low three bits)
43 *
Christoph Lametere53ef382006-09-25 23:31:14 -070044 * Do not put any conditional on these. If necessary modify the definitions
matt mooney263ff5d2010-05-24 14:32:44 -070045 * without the underscores and use them consistently. The definitions here may
Christoph Lametere53ef382006-09-25 23:31:14 -070046 * be used in bit comparisons.
Linus Torvalds1da177e2005-04-16 15:20:36 -070047 */
Namhyung Kim16b56cf2010-10-26 14:22:04 -070048#define __GFP_DMA ((__force gfp_t)___GFP_DMA)
49#define __GFP_HIGHMEM ((__force gfp_t)___GFP_HIGHMEM)
50#define __GFP_DMA32 ((__force gfp_t)___GFP_DMA32)
51#define __GFP_MOVABLE ((__force gfp_t)___GFP_MOVABLE) /* Page is movable */
Christoph Lameterb70d94e2009-06-16 15:32:46 -070052#define GFP_ZONEMASK (__GFP_DMA|__GFP_HIGHMEM|__GFP_DMA32|__GFP_MOVABLE)
Linus Torvalds1da177e2005-04-16 15:20:36 -070053/*
54 * Action modifiers - doesn't change the zoning
55 *
56 * __GFP_REPEAT: Try hard to allocate the memory, but the allocation attempt
57 * _might_ fail. This depends upon the particular VM implementation.
58 *
59 * __GFP_NOFAIL: The VM implementation _must_ retry infinitely: the caller
David Rientjes478352e2010-03-05 13:42:23 -080060 * cannot handle allocation failures. This modifier is deprecated and no new
61 * users should be added.
Linus Torvalds1da177e2005-04-16 15:20:36 -070062 *
63 * __GFP_NORETRY: The VM implementation must not retry indefinitely.
Mel Gorman769848c2007-07-17 04:03:05 -070064 *
65 * __GFP_MOVABLE: Flag that this page will be movable by the page migration
66 * mechanism or reclaimed
Linus Torvalds1da177e2005-04-16 15:20:36 -070067 */
Namhyung Kim16b56cf2010-10-26 14:22:04 -070068#define __GFP_WAIT ((__force gfp_t)___GFP_WAIT) /* Can wait and reschedule? */
69#define __GFP_HIGH ((__force gfp_t)___GFP_HIGH) /* Should access emergency pools? */
70#define __GFP_IO ((__force gfp_t)___GFP_IO) /* Can start physical IO? */
71#define __GFP_FS ((__force gfp_t)___GFP_FS) /* Can call down to low-level FS? */
72#define __GFP_COLD ((__force gfp_t)___GFP_COLD) /* Cache-cold page required */
73#define __GFP_NOWARN ((__force gfp_t)___GFP_NOWARN) /* Suppress page allocation failure warning */
74#define __GFP_REPEAT ((__force gfp_t)___GFP_REPEAT) /* See above */
75#define __GFP_NOFAIL ((__force gfp_t)___GFP_NOFAIL) /* See above */
76#define __GFP_NORETRY ((__force gfp_t)___GFP_NORETRY) /* See above */
Mel Gormanb37f1dd2012-07-31 16:44:03 -070077#define __GFP_MEMALLOC ((__force gfp_t)___GFP_MEMALLOC)/* Allow access to emergency reserves */
Namhyung Kim16b56cf2010-10-26 14:22:04 -070078#define __GFP_COMP ((__force gfp_t)___GFP_COMP) /* Add compound page metadata */
79#define __GFP_ZERO ((__force gfp_t)___GFP_ZERO) /* Return zeroed page on success */
Mel Gormanb37f1dd2012-07-31 16:44:03 -070080#define __GFP_NOMEMALLOC ((__force gfp_t)___GFP_NOMEMALLOC) /* Don't use emergency reserves.
81 * This takes precedence over the
82 * __GFP_MEMALLOC flag if both are
83 * set
84 */
Namhyung Kim16b56cf2010-10-26 14:22:04 -070085#define __GFP_HARDWALL ((__force gfp_t)___GFP_HARDWALL) /* Enforce hardwall cpuset memory allocs */
86#define __GFP_THISNODE ((__force gfp_t)___GFP_THISNODE)/* No fallback, no policies */
87#define __GFP_RECLAIMABLE ((__force gfp_t)___GFP_RECLAIMABLE) /* Page is reclaimable */
88#define __GFP_NOTRACK ((__force gfp_t)___GFP_NOTRACK) /* Don't track with kmemcheck */
Linus Torvalds1da177e2005-04-16 15:20:36 -070089
Linus Torvaldscaf49192012-12-10 10:51:16 -080090#define __GFP_NO_KSWAPD ((__force gfp_t)___GFP_NO_KSWAPD)
Andi Kleen78afd562011-03-22 16:33:12 -070091#define __GFP_OTHER_NODE ((__force gfp_t)___GFP_OTHER_NODE) /* On behalf of other node */
Johannes Weinera756cf52012-01-10 15:07:49 -080092#define __GFP_WRITE ((__force gfp_t)___GFP_WRITE) /* Allocator intends to dirty page */
Andrea Arcangeli32dba982011-01-13 15:46:49 -080093
Vegard Nossum2dff4402008-05-31 15:56:17 +020094/*
95 * This may seem redundant, but it's a way of annotating false positives vs.
96 * allocations that simply cannot be supported (e.g. page tables).
97 */
98#define __GFP_NOTRACK_FALSE_POSITIVE (__GFP_NOTRACK)
99
Linus Torvaldscaf49192012-12-10 10:51:16 -0800100#define __GFP_BITS_SHIFT 25 /* Room for N __GFP_FOO bits */
Al Viroaf4ca452005-10-21 02:55:38 -0400101#define __GFP_BITS_MASK ((__force gfp_t)((1 << __GFP_BITS_SHIFT) - 1))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102
Jeff Dike7b04d712006-04-10 22:53:27 -0700103/* This equals 0, but use constants in case they ever change */
104#define GFP_NOWAIT (GFP_ATOMIC & ~__GFP_HIGH)
Paul Jackson4eac9152006-01-11 12:17:19 -0800105/* GFP_ATOMIC means both !wait (__GFP_WAIT not set) and use emergency pool */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700106#define GFP_ATOMIC (__GFP_HIGH)
107#define GFP_NOIO (__GFP_WAIT)
108#define GFP_NOFS (__GFP_WAIT | __GFP_IO)
109#define GFP_KERNEL (__GFP_WAIT | __GFP_IO | __GFP_FS)
Mel Gormane12ba742007-10-16 01:25:52 -0700110#define GFP_TEMPORARY (__GFP_WAIT | __GFP_IO | __GFP_FS | \
111 __GFP_RECLAIMABLE)
Paul Jacksonf90b1d22005-09-06 15:18:10 -0700112#define GFP_USER (__GFP_WAIT | __GFP_IO | __GFP_FS | __GFP_HARDWALL)
113#define GFP_HIGHUSER (__GFP_WAIT | __GFP_IO | __GFP_FS | __GFP_HARDWALL | \
114 __GFP_HIGHMEM)
Mel Gorman769848c2007-07-17 04:03:05 -0700115#define GFP_HIGHUSER_MOVABLE (__GFP_WAIT | __GFP_IO | __GFP_FS | \
116 __GFP_HARDWALL | __GFP_HIGHMEM | \
117 __GFP_MOVABLE)
Rafael J. Wysocki452aa692010-03-05 13:42:13 -0800118#define GFP_IOFS (__GFP_IO | __GFP_FS)
Andrea Arcangeli71e3aac2011-01-13 15:46:52 -0800119#define GFP_TRANSHUGE (GFP_HIGHUSER_MOVABLE | __GFP_COMP | \
Linus Torvaldscaf49192012-12-10 10:51:16 -0800120 __GFP_NOMEMALLOC | __GFP_NORETRY | __GFP_NOWARN | \
121 __GFP_NO_KSWAPD)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122
Johannes Weinere97ca8e2014-03-10 15:49:43 -0700123/*
124 * GFP_THISNODE does not perform any reclaim, you most likely want to
125 * use __GFP_THISNODE to allocate from a given node without fallback!
126 */
Christoph Lameter77f700d2006-09-27 01:50:07 -0700127#ifdef CONFIG_NUMA
Christoph Lameter980128f2006-09-25 23:31:46 -0700128#define GFP_THISNODE (__GFP_THISNODE | __GFP_NOWARN | __GFP_NORETRY)
Christoph Lameter77f700d2006-09-27 01:50:07 -0700129#else
Al Virof2e97df2007-02-09 16:38:55 +0000130#define GFP_THISNODE ((__force gfp_t)0)
Christoph Lameter77f700d2006-09-27 01:50:07 -0700131#endif
132
Christoph Lameter6cb06222007-10-16 01:25:41 -0700133/* This mask makes up all the page movable related flags */
Mel Gormane12ba742007-10-16 01:25:52 -0700134#define GFP_MOVABLE_MASK (__GFP_RECLAIMABLE|__GFP_MOVABLE)
Christoph Lameter6cb06222007-10-16 01:25:41 -0700135
136/* Control page allocator reclaim behavior */
137#define GFP_RECLAIM_MASK (__GFP_WAIT|__GFP_HIGH|__GFP_IO|__GFP_FS|\
138 __GFP_NOWARN|__GFP_REPEAT|__GFP_NOFAIL|\
Mel Gormanb37f1dd2012-07-31 16:44:03 -0700139 __GFP_NORETRY|__GFP_MEMALLOC|__GFP_NOMEMALLOC)
Christoph Lameter6cb06222007-10-16 01:25:41 -0700140
Pekka Enberg7e85ee02009-06-12 14:03:06 +0300141/* Control slab gfp mask during early boot */
matt mooneyfd238552010-05-24 14:32:45 -0700142#define GFP_BOOT_MASK (__GFP_BITS_MASK & ~(__GFP_WAIT|__GFP_IO|__GFP_FS))
Pekka Enberg7e85ee02009-06-12 14:03:06 +0300143
Christoph Lameter6cb06222007-10-16 01:25:41 -0700144/* Control allocation constraints */
145#define GFP_CONSTRAINT_MASK (__GFP_HARDWALL|__GFP_THISNODE)
146
147/* Do not use these with a slab allocator */
148#define GFP_SLAB_BUG_MASK (__GFP_DMA32|__GFP_HIGHMEM|~__GFP_BITS_MASK)
Christoph Lameter980128f2006-09-25 23:31:46 -0700149
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150/* Flag - indicates that the buffer will be suitable for DMA. Ignored on some
151 platforms, used as appropriate on others */
152
153#define GFP_DMA __GFP_DMA
154
Andi Kleena2f1b422005-11-05 17:25:53 +0100155/* 4GB DMA on some platforms */
156#define GFP_DMA32 __GFP_DMA32
157
Mel Gorman467c9962007-10-16 01:26:02 -0700158/* Convert GFP flags to their corresponding migrate type */
159static inline int allocflags_to_migratetype(gfp_t gfp_flags)
160{
161 WARN_ON((gfp_flags & GFP_MOVABLE_MASK) == GFP_MOVABLE_MASK);
162
163 if (unlikely(page_group_by_mobility_disabled))
164 return MIGRATE_UNMOVABLE;
165
166 /* Group based on mobility */
167 return (((gfp_flags & __GFP_MOVABLE) != 0) << 1) |
168 ((gfp_flags & __GFP_RECLAIMABLE) != 0);
169}
Andi Kleena2f1b422005-11-05 17:25:53 +0100170
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700171#ifdef CONFIG_HIGHMEM
172#define OPT_ZONE_HIGHMEM ZONE_HIGHMEM
173#else
174#define OPT_ZONE_HIGHMEM ZONE_NORMAL
175#endif
176
177#ifdef CONFIG_ZONE_DMA
178#define OPT_ZONE_DMA ZONE_DMA
179#else
180#define OPT_ZONE_DMA ZONE_NORMAL
181#endif
182
183#ifdef CONFIG_ZONE_DMA32
184#define OPT_ZONE_DMA32 ZONE_DMA32
185#else
186#define OPT_ZONE_DMA32 ZONE_NORMAL
187#endif
188
189/*
190 * GFP_ZONE_TABLE is a word size bitstring that is used for looking up the
191 * zone to use given the lowest 4 bits of gfp_t. Entries are ZONE_SHIFT long
192 * and there are 16 of them to cover all possible combinations of
matt mooney263ff5d2010-05-24 14:32:44 -0700193 * __GFP_DMA, __GFP_DMA32, __GFP_MOVABLE and __GFP_HIGHMEM.
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700194 *
195 * The zone fallback order is MOVABLE=>HIGHMEM=>NORMAL=>DMA32=>DMA.
196 * But GFP_MOVABLE is not only a zone specifier but also an allocation
197 * policy. Therefore __GFP_MOVABLE plus another zone selector is valid.
matt mooney263ff5d2010-05-24 14:32:44 -0700198 * Only 1 bit of the lowest 3 bits (DMA,DMA32,HIGHMEM) can be set to "1".
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700199 *
200 * bit result
201 * =================
202 * 0x0 => NORMAL
203 * 0x1 => DMA or NORMAL
204 * 0x2 => HIGHMEM or NORMAL
205 * 0x3 => BAD (DMA+HIGHMEM)
206 * 0x4 => DMA32 or DMA or NORMAL
207 * 0x5 => BAD (DMA+DMA32)
208 * 0x6 => BAD (HIGHMEM+DMA32)
209 * 0x7 => BAD (HIGHMEM+DMA32+DMA)
210 * 0x8 => NORMAL (MOVABLE+0)
211 * 0x9 => DMA or NORMAL (MOVABLE+DMA)
212 * 0xa => MOVABLE (Movable is valid only if HIGHMEM is set too)
213 * 0xb => BAD (MOVABLE+HIGHMEM+DMA)
Zhang Yanfei537926c2013-07-08 16:00:02 -0700214 * 0xc => DMA32 (MOVABLE+DMA32)
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700215 * 0xd => BAD (MOVABLE+DMA32+DMA)
216 * 0xe => BAD (MOVABLE+DMA32+HIGHMEM)
217 * 0xf => BAD (MOVABLE+DMA32+HIGHMEM+DMA)
218 *
219 * ZONES_SHIFT must be <= 2 on 32 bit platforms.
220 */
221
222#if 16 * ZONES_SHIFT > BITS_PER_LONG
223#error ZONES_SHIFT too large to create GFP_ZONE_TABLE integer
224#endif
225
226#define GFP_ZONE_TABLE ( \
Namhyung Kim16b56cf2010-10-26 14:22:04 -0700227 (ZONE_NORMAL << 0 * ZONES_SHIFT) \
228 | (OPT_ZONE_DMA << ___GFP_DMA * ZONES_SHIFT) \
229 | (OPT_ZONE_HIGHMEM << ___GFP_HIGHMEM * ZONES_SHIFT) \
230 | (OPT_ZONE_DMA32 << ___GFP_DMA32 * ZONES_SHIFT) \
231 | (ZONE_NORMAL << ___GFP_MOVABLE * ZONES_SHIFT) \
232 | (OPT_ZONE_DMA << (___GFP_MOVABLE | ___GFP_DMA) * ZONES_SHIFT) \
233 | (ZONE_MOVABLE << (___GFP_MOVABLE | ___GFP_HIGHMEM) * ZONES_SHIFT) \
234 | (OPT_ZONE_DMA32 << (___GFP_MOVABLE | ___GFP_DMA32) * ZONES_SHIFT) \
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700235)
236
237/*
matt mooney263ff5d2010-05-24 14:32:44 -0700238 * GFP_ZONE_BAD is a bitmap for all combinations of __GFP_DMA, __GFP_DMA32
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700239 * __GFP_HIGHMEM and __GFP_MOVABLE that are not permitted. One flag per
240 * entry starting with bit 0. Bit is set if the combination is not
241 * allowed.
242 */
243#define GFP_ZONE_BAD ( \
Namhyung Kim16b56cf2010-10-26 14:22:04 -0700244 1 << (___GFP_DMA | ___GFP_HIGHMEM) \
245 | 1 << (___GFP_DMA | ___GFP_DMA32) \
246 | 1 << (___GFP_DMA32 | ___GFP_HIGHMEM) \
247 | 1 << (___GFP_DMA | ___GFP_DMA32 | ___GFP_HIGHMEM) \
248 | 1 << (___GFP_MOVABLE | ___GFP_HIGHMEM | ___GFP_DMA) \
249 | 1 << (___GFP_MOVABLE | ___GFP_DMA32 | ___GFP_DMA) \
250 | 1 << (___GFP_MOVABLE | ___GFP_DMA32 | ___GFP_HIGHMEM) \
251 | 1 << (___GFP_MOVABLE | ___GFP_DMA32 | ___GFP_DMA | ___GFP_HIGHMEM) \
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700252)
253
Christoph Lameter19655d32006-09-25 23:31:19 -0700254static inline enum zone_type gfp_zone(gfp_t flags)
Christoph Lameter4e4785b2006-09-25 23:31:17 -0700255{
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700256 enum zone_type z;
Namhyung Kim16b56cf2010-10-26 14:22:04 -0700257 int bit = (__force int) (flags & GFP_ZONEMASK);
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700258
259 z = (GFP_ZONE_TABLE >> (bit * ZONES_SHIFT)) &
260 ((1 << ZONES_SHIFT) - 1);
Dave Hansen82d4b572011-05-24 17:11:42 -0700261 VM_BUG_ON((GFP_ZONE_BAD >> bit) & 1);
Christoph Lameterb70d94e2009-06-16 15:32:46 -0700262 return z;
Christoph Lameter4e4785b2006-09-25 23:31:17 -0700263}
264
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265/*
266 * There is only one page-allocator function, and two main namespaces to
267 * it. The alloc_page*() variants return 'struct page *' and as such
268 * can allocate highmem pages, the *get*page*() variants return
269 * virtual kernel addresses to the allocated page(s).
270 */
271
Mel Gorman54a6eb52008-04-28 02:12:16 -0700272static inline int gfp_zonelist(gfp_t flags)
273{
Kirill A. Shutemove5adfff2012-12-11 16:00:29 -0800274 if (IS_ENABLED(CONFIG_NUMA) && unlikely(flags & __GFP_THISNODE))
Mel Gorman54a6eb52008-04-28 02:12:16 -0700275 return 1;
276
277 return 0;
278}
279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280/*
281 * We get the zone list from the current node and the gfp_mask.
282 * This zone list contains a maximum of MAXNODES*MAX_NR_ZONES zones.
Mel Gorman54a6eb52008-04-28 02:12:16 -0700283 * There are two zonelists per node, one for all zones with memory and
284 * one containing just zones from the node the zonelist belongs to.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 *
286 * For the normal case of non-DISCONTIGMEM systems the NODE_DATA() gets
287 * optimized to &contig_page_data at compile-time.
288 */
Mel Gorman0e884602008-04-28 02:12:14 -0700289static inline struct zonelist *node_zonelist(int nid, gfp_t flags)
290{
Mel Gorman54a6eb52008-04-28 02:12:16 -0700291 return NODE_DATA(nid)->node_zonelists + gfp_zonelist(flags);
Mel Gorman0e884602008-04-28 02:12:14 -0700292}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700293
294#ifndef HAVE_ARCH_FREE_PAGE
295static inline void arch_free_page(struct page *page, int order) { }
296#endif
Nick Piggincc1025092006-12-06 20:32:00 -0800297#ifndef HAVE_ARCH_ALLOC_PAGE
298static inline void arch_alloc_page(struct page *page, int order) { }
299#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300
KOSAKI Motohiroe4048e52008-07-23 21:27:01 -0700301struct page *
Mel Gormand2391712009-06-16 15:31:52 -0700302__alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order,
KOSAKI Motohiroe4048e52008-07-23 21:27:01 -0700303 struct zonelist *zonelist, nodemask_t *nodemask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304
KOSAKI Motohiroe4048e52008-07-23 21:27:01 -0700305static inline struct page *
306__alloc_pages(gfp_t gfp_mask, unsigned int order,
307 struct zonelist *zonelist)
308{
Mel Gormand2391712009-06-16 15:31:52 -0700309 return __alloc_pages_nodemask(gfp_mask, order, zonelist, NULL);
KOSAKI Motohiroe4048e52008-07-23 21:27:01 -0700310}
311
Al Virodd0fc662005-10-07 07:46:04 +0100312static inline struct page *alloc_pages_node(int nid, gfp_t gfp_mask,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313 unsigned int order)
314{
Andi Kleen819a6922006-01-11 22:43:45 +0100315 /* Unknown node is current node */
316 if (nid < 0)
317 nid = numa_node_id();
318
Mel Gorman0e884602008-04-28 02:12:14 -0700319 return __alloc_pages(gfp_mask, order, node_zonelist(nid, gfp_mask));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320}
321
Mel Gorman6484eb32009-06-16 15:31:54 -0700322static inline struct page *alloc_pages_exact_node(int nid, gfp_t gfp_mask,
323 unsigned int order)
324{
David Rientjesf6d7e0c2012-01-10 15:07:38 -0800325 VM_BUG_ON(nid < 0 || nid >= MAX_NUMNODES || !node_online(nid));
Mel Gorman6484eb32009-06-16 15:31:54 -0700326
327 return __alloc_pages(gfp_mask, order, node_zonelist(nid, gfp_mask));
328}
329
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330#ifdef CONFIG_NUMA
Al Virodd0fc662005-10-07 07:46:04 +0100331extern struct page *alloc_pages_current(gfp_t gfp_mask, unsigned order);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332
333static inline struct page *
Al Virodd0fc662005-10-07 07:46:04 +0100334alloc_pages(gfp_t gfp_mask, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700336 return alloc_pages_current(gfp_mask, order);
337}
Andrea Arcangeli0bbbc0b2011-01-13 15:47:05 -0800338extern struct page *alloc_pages_vma(gfp_t gfp_mask, int order,
Andi Kleen2f5f9482011-03-04 17:36:29 -0800339 struct vm_area_struct *vma, unsigned long addr,
340 int node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700341#else
342#define alloc_pages(gfp_mask, order) \
343 alloc_pages_node(numa_node_id(), gfp_mask, order)
Andi Kleen2f5f9482011-03-04 17:36:29 -0800344#define alloc_pages_vma(gfp_mask, order, vma, addr, node) \
Andrea Arcangeli0bbbc0b2011-01-13 15:47:05 -0800345 alloc_pages(gfp_mask, order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346#endif
347#define alloc_page(gfp_mask) alloc_pages(gfp_mask, 0)
Andi Kleen2f5f9482011-03-04 17:36:29 -0800348#define alloc_page_vma(gfp_mask, vma, addr) \
349 alloc_pages_vma(gfp_mask, 0, vma, addr, numa_node_id())
Andi Kleen236344d2011-03-04 17:36:30 -0800350#define alloc_page_vma_node(gfp_mask, vma, addr, node) \
351 alloc_pages_vma(gfp_mask, 0, vma, addr, node)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700352
Vladimir Davydov52383432014-06-04 16:06:39 -0700353extern struct page *alloc_kmem_pages(gfp_t gfp_mask, unsigned int order);
354extern struct page *alloc_kmem_pages_node(int nid, gfp_t gfp_mask,
355 unsigned int order);
356
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800357extern unsigned long __get_free_pages(gfp_t gfp_mask, unsigned int order);
358extern unsigned long get_zeroed_page(gfp_t gfp_mask);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700359
Timur Tabi2be0ffe2008-07-23 21:28:11 -0700360void *alloc_pages_exact(size_t size, gfp_t gfp_mask);
361void free_pages_exact(void *virt, size_t size);
Andi Kleenee85c2e2011-05-11 15:13:34 -0700362/* This is different from alloc_pages_exact_node !!! */
Fabian Fredericke1931812014-08-06 16:04:59 -0700363void * __meminit alloc_pages_exact_nid(int nid, size_t size, gfp_t gfp_mask);
Timur Tabi2be0ffe2008-07-23 21:28:11 -0700364
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365#define __get_free_page(gfp_mask) \
matt mooneyfd238552010-05-24 14:32:45 -0700366 __get_free_pages((gfp_mask), 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700367
368#define __get_dma_pages(gfp_mask, order) \
matt mooneyfd238552010-05-24 14:32:45 -0700369 __get_free_pages((gfp_mask) | GFP_DMA, (order))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800371extern void __free_pages(struct page *page, unsigned int order);
372extern void free_pages(unsigned long addr, unsigned int order);
Mel Gormanb745bc82014-06-04 16:10:22 -0700373extern void free_hot_cold_page(struct page *page, bool cold);
374extern void free_hot_cold_page_list(struct list_head *list, bool cold);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700375
Vladimir Davydov52383432014-06-04 16:06:39 -0700376extern void __free_kmem_pages(struct page *page, unsigned int order);
377extern void free_kmem_pages(unsigned long addr, unsigned int order);
Glauber Costa6a1a0d32012-12-18 14:22:00 -0800378
Linus Torvalds1da177e2005-04-16 15:20:36 -0700379#define __free_page(page) __free_pages((page), 0)
matt mooneyfd238552010-05-24 14:32:45 -0700380#define free_page(addr) free_pages((addr), 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381
382void page_alloc_init(void);
Christoph Lameter4037d452007-05-09 02:35:14 -0700383void drain_zone_pages(struct zone *zone, struct per_cpu_pages *pcp);
Christoph Lameter9f8f2172008-02-04 22:29:11 -0800384void drain_all_pages(void);
385void drain_local_pages(void *dummy);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700386
Mel Gormanf90ac392012-01-10 15:07:15 -0800387/*
388 * gfp_allowed_mask is set to GFP_BOOT_MASK during early boot to restrict what
389 * GFP flags are used before interrupts are enabled. Once interrupts are
390 * enabled, it is set to __GFP_BITS_MASK while the system is running. During
391 * hibernation, it is used by PM to avoid I/O during memory allocation while
392 * devices are suspended.
393 */
Benjamin Herrenschmidtdcce2842009-06-18 13:24:12 +1000394extern gfp_t gfp_allowed_mask;
395
Mel Gormanc93bdd02012-07-31 16:44:19 -0700396/* Returns true if the gfp_mask allows use of ALLOC_NO_WATERMARK */
397bool gfp_pfmemalloc_allowed(gfp_t gfp_mask);
398
Rafael J. Wysockic9e664f2010-12-03 22:57:45 +0100399extern void pm_restrict_gfp_mask(void);
400extern void pm_restore_gfp_mask(void);
Benjamin Herrenschmidtdcce2842009-06-18 13:24:12 +1000401
Mel Gormanf90ac392012-01-10 15:07:15 -0800402#ifdef CONFIG_PM_SLEEP
403extern bool pm_suspended_storage(void);
404#else
405static inline bool pm_suspended_storage(void)
406{
407 return false;
408}
409#endif /* CONFIG_PM_SLEEP */
410
Michal Nazarewicz041d3a82011-12-29 13:09:50 +0100411#ifdef CONFIG_CMA
412
413/* The below functions must be run on a range from a single zone. */
Michal Nazarewicz0815f3d2012-04-03 15:06:15 +0200414extern int alloc_contig_range(unsigned long start, unsigned long end,
415 unsigned migratetype);
Michal Nazarewicz041d3a82011-12-29 13:09:50 +0100416extern void free_contig_range(unsigned long pfn, unsigned nr_pages);
417
Michal Nazarewicz47118af2011-12-29 13:09:50 +0100418/* CMA stuff */
419extern void init_cma_reserved_pageblock(struct page *page);
420
Michal Nazarewicz041d3a82011-12-29 13:09:50 +0100421#endif
422
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423#endif /* __LINUX_GFP_H */