blob: 00c314aedab7d8f9487112e9a4d16182185b6332 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef __LINUX_GFP_H
2#define __LINUX_GFP_H
3
4#include <linux/mmzone.h>
5#include <linux/stddef.h>
6#include <linux/linkage.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07007
8struct vm_area_struct;
9
10/*
11 * GFP bitmasks..
Christoph Lametere53ef382006-09-25 23:31:14 -070012 *
13 * Zone modifiers (see linux/mmzone.h - low three bits)
14 *
Christoph Lametere53ef382006-09-25 23:31:14 -070015 * Do not put any conditional on these. If necessary modify the definitions
16 * without the underscores and use the consistently. The definitions here may
17 * be used in bit comparisons.
Linus Torvalds1da177e2005-04-16 15:20:36 -070018 */
Al Viroaf4ca452005-10-21 02:55:38 -040019#define __GFP_DMA ((__force gfp_t)0x01u)
20#define __GFP_HIGHMEM ((__force gfp_t)0x02u)
Christoph Lametere53ef382006-09-25 23:31:14 -070021#define __GFP_DMA32 ((__force gfp_t)0x04u)
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
23/*
24 * Action modifiers - doesn't change the zoning
25 *
26 * __GFP_REPEAT: Try hard to allocate the memory, but the allocation attempt
27 * _might_ fail. This depends upon the particular VM implementation.
28 *
29 * __GFP_NOFAIL: The VM implementation _must_ retry infinitely: the caller
30 * cannot handle allocation failures.
31 *
32 * __GFP_NORETRY: The VM implementation must not retry indefinitely.
33 */
Al Viroaf4ca452005-10-21 02:55:38 -040034#define __GFP_WAIT ((__force gfp_t)0x10u) /* Can wait and reschedule? */
35#define __GFP_HIGH ((__force gfp_t)0x20u) /* Should access emergency pools? */
36#define __GFP_IO ((__force gfp_t)0x40u) /* Can start physical IO? */
37#define __GFP_FS ((__force gfp_t)0x80u) /* Can call down to low-level FS? */
38#define __GFP_COLD ((__force gfp_t)0x100u) /* Cache-cold page required */
39#define __GFP_NOWARN ((__force gfp_t)0x200u) /* Suppress page allocation failure warning */
40#define __GFP_REPEAT ((__force gfp_t)0x400u) /* Retry the allocation. Might fail */
41#define __GFP_NOFAIL ((__force gfp_t)0x800u) /* Retry for ever. Cannot fail */
42#define __GFP_NORETRY ((__force gfp_t)0x1000u)/* Do not retry. Might fail */
43#define __GFP_NO_GROW ((__force gfp_t)0x2000u)/* Slab internal usage */
44#define __GFP_COMP ((__force gfp_t)0x4000u)/* Add compound page metadata */
45#define __GFP_ZERO ((__force gfp_t)0x8000u)/* Return zeroed page on success */
46#define __GFP_NOMEMALLOC ((__force gfp_t)0x10000u) /* Don't use emergency reserves */
Paul Jackson2d6c6662005-11-13 16:06:44 -080047#define __GFP_HARDWALL ((__force gfp_t)0x20000u) /* Enforce hardwall cpuset memory allocs */
Christoph Lameter9b819d22006-09-25 23:31:40 -070048#define __GFP_THISNODE ((__force gfp_t)0x40000u)/* No fallback, no policies */
Linus Torvalds1da177e2005-04-16 15:20:36 -070049
Nick Pigginb84a35b2005-05-01 08:58:36 -070050#define __GFP_BITS_SHIFT 20 /* Room for 20 __GFP_FOO bits */
Al Viroaf4ca452005-10-21 02:55:38 -040051#define __GFP_BITS_MASK ((__force gfp_t)((1 << __GFP_BITS_SHIFT) - 1))
Linus Torvalds1da177e2005-04-16 15:20:36 -070052
53/* if you forget to add the bitmask here kernel will crash, period */
54#define GFP_LEVEL_MASK (__GFP_WAIT|__GFP_HIGH|__GFP_IO|__GFP_FS| \
55 __GFP_COLD|__GFP_NOWARN|__GFP_REPEAT| \
Nick Pigginb84a35b2005-05-01 08:58:36 -070056 __GFP_NOFAIL|__GFP_NORETRY|__GFP_NO_GROW|__GFP_COMP| \
Christoph Lameter9b819d22006-09-25 23:31:40 -070057 __GFP_NOMEMALLOC|__GFP_HARDWALL|__GFP_THISNODE)
Linus Torvalds1da177e2005-04-16 15:20:36 -070058
Jeff Dike7b04d712006-04-10 22:53:27 -070059/* This equals 0, but use constants in case they ever change */
60#define GFP_NOWAIT (GFP_ATOMIC & ~__GFP_HIGH)
Paul Jackson4eac9152006-01-11 12:17:19 -080061/* GFP_ATOMIC means both !wait (__GFP_WAIT not set) and use emergency pool */
Linus Torvalds1da177e2005-04-16 15:20:36 -070062#define GFP_ATOMIC (__GFP_HIGH)
63#define GFP_NOIO (__GFP_WAIT)
64#define GFP_NOFS (__GFP_WAIT | __GFP_IO)
65#define GFP_KERNEL (__GFP_WAIT | __GFP_IO | __GFP_FS)
Paul Jacksonf90b1d22005-09-06 15:18:10 -070066#define GFP_USER (__GFP_WAIT | __GFP_IO | __GFP_FS | __GFP_HARDWALL)
67#define GFP_HIGHUSER (__GFP_WAIT | __GFP_IO | __GFP_FS | __GFP_HARDWALL | \
68 __GFP_HIGHMEM)
Linus Torvalds1da177e2005-04-16 15:20:36 -070069
Christoph Lameter77f700d2006-09-27 01:50:07 -070070#ifdef CONFIG_NUMA
Christoph Lameter980128f2006-09-25 23:31:46 -070071#define GFP_THISNODE (__GFP_THISNODE | __GFP_NOWARN | __GFP_NORETRY)
Christoph Lameter77f700d2006-09-27 01:50:07 -070072#else
73#define GFP_THISNODE 0
74#endif
75
Christoph Lameter980128f2006-09-25 23:31:46 -070076
Linus Torvalds1da177e2005-04-16 15:20:36 -070077/* Flag - indicates that the buffer will be suitable for DMA. Ignored on some
78 platforms, used as appropriate on others */
79
80#define GFP_DMA __GFP_DMA
81
Andi Kleena2f1b422005-11-05 17:25:53 +010082/* 4GB DMA on some platforms */
83#define GFP_DMA32 __GFP_DMA32
84
85
Christoph Lameter19655d32006-09-25 23:31:19 -070086static inline enum zone_type gfp_zone(gfp_t flags)
Christoph Lameter4e4785b2006-09-25 23:31:17 -070087{
88 if (flags & __GFP_DMA)
89 return ZONE_DMA;
90#ifdef CONFIG_ZONE_DMA32
91 if (flags & __GFP_DMA32)
92 return ZONE_DMA32;
93#endif
94#ifdef CONFIG_HIGHMEM
95 if (flags & __GFP_HIGHMEM)
96 return ZONE_HIGHMEM;
97#endif
98 return ZONE_NORMAL;
99}
100
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101/*
102 * There is only one page-allocator function, and two main namespaces to
103 * it. The alloc_page*() variants return 'struct page *' and as such
104 * can allocate highmem pages, the *get*page*() variants return
105 * virtual kernel addresses to the allocated page(s).
106 */
107
108/*
109 * We get the zone list from the current node and the gfp_mask.
110 * This zone list contains a maximum of MAXNODES*MAX_NR_ZONES zones.
111 *
112 * For the normal case of non-DISCONTIGMEM systems the NODE_DATA() gets
113 * optimized to &contig_page_data at compile-time.
114 */
115
116#ifndef HAVE_ARCH_FREE_PAGE
117static inline void arch_free_page(struct page *page, int order) { }
118#endif
Nick Piggincc102502006-12-06 20:32:00 -0800119#ifndef HAVE_ARCH_ALLOC_PAGE
120static inline void arch_alloc_page(struct page *page, int order) { }
121#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122
123extern struct page *
Al Virodd0fc662005-10-07 07:46:04 +0100124FASTCALL(__alloc_pages(gfp_t, unsigned int, struct zonelist *));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700125
Al Virodd0fc662005-10-07 07:46:04 +0100126static inline struct page *alloc_pages_node(int nid, gfp_t gfp_mask,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 unsigned int order)
128{
129 if (unlikely(order >= MAX_ORDER))
130 return NULL;
131
Andi Kleen819a6922006-01-11 22:43:45 +0100132 /* Unknown node is current node */
133 if (nid < 0)
134 nid = numa_node_id();
135
Linus Torvalds1da177e2005-04-16 15:20:36 -0700136 return __alloc_pages(gfp_mask, order,
Al Viroaf4ca452005-10-21 02:55:38 -0400137 NODE_DATA(nid)->node_zonelists + gfp_zone(gfp_mask));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138}
139
140#ifdef CONFIG_NUMA
Al Virodd0fc662005-10-07 07:46:04 +0100141extern struct page *alloc_pages_current(gfp_t gfp_mask, unsigned order);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
143static inline struct page *
Al Virodd0fc662005-10-07 07:46:04 +0100144alloc_pages(gfp_t gfp_mask, unsigned int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145{
146 if (unlikely(order >= MAX_ORDER))
147 return NULL;
148
149 return alloc_pages_current(gfp_mask, order);
150}
Al Virodd0fc662005-10-07 07:46:04 +0100151extern struct page *alloc_page_vma(gfp_t gfp_mask,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 struct vm_area_struct *vma, unsigned long addr);
153#else
154#define alloc_pages(gfp_mask, order) \
155 alloc_pages_node(numa_node_id(), gfp_mask, order)
156#define alloc_page_vma(gfp_mask, vma, addr) alloc_pages(gfp_mask, 0)
157#endif
158#define alloc_page(gfp_mask) alloc_pages(gfp_mask, 0)
159
Al Virodd0fc662005-10-07 07:46:04 +0100160extern unsigned long FASTCALL(__get_free_pages(gfp_t gfp_mask, unsigned int order));
161extern unsigned long FASTCALL(get_zeroed_page(gfp_t gfp_mask));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162
163#define __get_free_page(gfp_mask) \
164 __get_free_pages((gfp_mask),0)
165
166#define __get_dma_pages(gfp_mask, order) \
167 __get_free_pages((gfp_mask) | GFP_DMA,(order))
168
169extern void FASTCALL(__free_pages(struct page *page, unsigned int order));
170extern void FASTCALL(free_pages(unsigned long addr, unsigned int order));
171extern void FASTCALL(free_hot_page(struct page *page));
172extern void FASTCALL(free_cold_page(struct page *page));
173
174#define __free_page(page) __free_pages((page), 0)
175#define free_page(addr) free_pages((addr),0)
176
177void page_alloc_init(void);
Christoph Lameter4ae7c032005-06-21 17:14:57 -0700178#ifdef CONFIG_NUMA
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800179void drain_node_pages(int node);
Christoph Lameter4ae7c032005-06-21 17:14:57 -0700180#else
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800181static inline void drain_node_pages(int node) { };
Christoph Lameter4ae7c032005-06-21 17:14:57 -0700182#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183
184#endif /* __LINUX_GFP_H */