source: svn/trunk/newcon3bcm2_21bu/toolchain/mips-linux-uclibc/include/linux/gfp.h @ 2

Last change on this file since 2 was 2, checked in by phkim, 11 years ago

1.phkim

  1. revision copy newcon3sk r27
  • Property svn:executable set to *
File size: 4.6 KB
Line 
1#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>
7
8struct vm_area_struct;
9
10/*
11 * GFP bitmasks..
12 */
13/* Zone modifiers in GFP_ZONEMASK (see linux/mmzone.h - low two bits) */
14#define __GFP_DMA       0x01
15#define __GFP_HIGHMEM   0x02
16
17/*
18 * Action modifiers - doesn't change the zoning
19 *
20 * __GFP_REPEAT: Try hard to allocate the memory, but the allocation attempt
21 * _might_ fail.  This depends upon the particular VM implementation.
22 *
23 * __GFP_NOFAIL: The VM implementation _must_ retry infinitely: the caller
24 * cannot handle allocation failures.
25 *
26 * __GFP_NORETRY: The VM implementation must not retry indefinitely.
27 */
28#define __GFP_WAIT      0x10u   /* Can wait and reschedule? */
29#define __GFP_HIGH      0x20u   /* Should access emergency pools? */
30#define __GFP_IO        0x40u   /* Can start physical IO? */
31#define __GFP_FS        0x80u   /* Can call down to low-level FS? */
32#define __GFP_COLD      0x100u  /* Cache-cold page required */
33#define __GFP_NOWARN    0x200u  /* Suppress page allocation failure warning */
34#define __GFP_REPEAT    0x400u  /* Retry the allocation.  Might fail */
35#define __GFP_NOFAIL    0x800u  /* Retry for ever.  Cannot fail */
36#define __GFP_NORETRY   0x1000u /* Do not retry.  Might fail */
37#define __GFP_NO_GROW   0x2000u /* Slab internal usage */
38#define __GFP_COMP      0x4000u /* Add compound page metadata */
39#define __GFP_ZERO      0x8000u /* Return zeroed page on success */
40#define __GFP_NOMEMALLOC 0x10000u /* Don't use emergency reserves */
41
42#define __GFP_BITS_SHIFT 20     /* Room for 20 __GFP_FOO bits */
43#define __GFP_BITS_MASK ((1 << __GFP_BITS_SHIFT) - 1)
44
45/* if you forget to add the bitmask here kernel will crash, period */
46#define GFP_LEVEL_MASK (__GFP_WAIT|__GFP_HIGH|__GFP_IO|__GFP_FS| \
47                        __GFP_COLD|__GFP_NOWARN|__GFP_REPEAT| \
48                        __GFP_NOFAIL|__GFP_NORETRY|__GFP_NO_GROW|__GFP_COMP| \
49                        __GFP_NOMEMALLOC)
50
51#define GFP_ATOMIC      (__GFP_HIGH)
52#define GFP_NOIO        (__GFP_WAIT)
53#define GFP_NOFS        (__GFP_WAIT | __GFP_IO)
54#define GFP_KERNEL      (__GFP_WAIT | __GFP_IO | __GFP_FS)
55#define GFP_USER        (__GFP_WAIT | __GFP_IO | __GFP_FS)
56#define GFP_HIGHUSER    (__GFP_WAIT | __GFP_IO | __GFP_FS | __GFP_HIGHMEM)
57
58/* Flag - indicates that the buffer will be suitable for DMA.  Ignored on some
59   platforms, used as appropriate on others */
60
61#define GFP_DMA         __GFP_DMA
62
63
64/*
65 * There is only one page-allocator function, and two main namespaces to
66 * it. The alloc_page*() variants return 'struct page *' and as such
67 * can allocate highmem pages, the *get*page*() variants return
68 * virtual kernel addresses to the allocated page(s).
69 */
70
71/*
72 * We get the zone list from the current node and the gfp_mask.
73 * This zone list contains a maximum of MAXNODES*MAX_NR_ZONES zones.
74 *
75 * For the normal case of non-DISCONTIGMEM systems the NODE_DATA() gets
76 * optimized to &contig_page_data at compile-time.
77 */
78
79#ifndef HAVE_ARCH_FREE_PAGE
80static inline void arch_free_page(struct page *page, int order) { }
81#endif
82
83extern struct page *
84FASTCALL(__alloc_pages(unsigned int, unsigned int, struct zonelist *));
85
86static inline struct page *alloc_pages_node(int nid, unsigned int gfp_mask,
87                                                unsigned int order)
88{
89        if (unlikely(order >= MAX_ORDER))
90                return NULL;
91
92        return __alloc_pages(gfp_mask, order,
93                NODE_DATA(nid)->node_zonelists + (gfp_mask & GFP_ZONEMASK));
94}
95
96#ifdef CONFIG_NUMA
97extern struct page *alloc_pages_current(unsigned int gfp_mask, unsigned order);
98
99static inline struct page *
100alloc_pages(unsigned int gfp_mask, unsigned int order)
101{
102        if (unlikely(order >= MAX_ORDER))
103                return NULL;
104
105        return alloc_pages_current(gfp_mask, order);
106}
107extern struct page *alloc_page_vma(unsigned gfp_mask,
108                        struct vm_area_struct *vma, unsigned long addr);
109#else
110#define alloc_pages(gfp_mask, order) \
111                alloc_pages_node(numa_node_id(), gfp_mask, order)
112#define alloc_page_vma(gfp_mask, vma, addr) alloc_pages(gfp_mask, 0)
113#endif
114#define alloc_page(gfp_mask) alloc_pages(gfp_mask, 0)
115
116extern unsigned long FASTCALL(__get_free_pages(unsigned int gfp_mask, unsigned int order));
117extern unsigned long FASTCALL(get_zeroed_page(unsigned int gfp_mask));
118
119#define __get_free_page(gfp_mask) \
120                __get_free_pages((gfp_mask),0)
121
122#define __get_dma_pages(gfp_mask, order) \
123                __get_free_pages((gfp_mask) | GFP_DMA,(order))
124
125extern void FASTCALL(__free_pages(struct page *page, unsigned int order));
126extern void FASTCALL(free_pages(unsigned long addr, unsigned int order));
127extern void FASTCALL(free_hot_page(struct page *page));
128extern void FASTCALL(free_cold_page(struct page *page));
129
130#define __free_page(page) __free_pages((page), 0)
131#define free_page(addr) free_pages((addr),0)
132
133void page_alloc_init(void);
134
135#endif /* __LINUX_GFP_H */
Note: See TracBrowser for help on using the repository browser.