2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
36 #define get_cpu_var(p) (p)
37 #define __get_cpu_var(p) (p)
38 #define BITS_PER_LONG (sizeof(long) * 8)
39 #define __GFP_BITS_SHIFT 20
40 #define __GFP_BITS_MASK ((int)((1 << __GFP_BITS_SHIFT) - 1))
44 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
45 #define ULONG_MAX (~0UL)
48 #define __force __attribute__((force))
49 #define __bitwise__ __attribute__((bitwise))
56 #include <asm/types.h>
62 typedef unsigned int u32;
63 typedef unsigned int __u32;
64 typedef unsigned long long u64;
65 typedef unsigned char u8;
66 typedef unsigned short u16;
70 struct vma_shared { int prio_tree_node; };
71 struct vm_area_struct {
72 unsigned long vm_pgoff;
73 unsigned long vm_start;
75 struct vma_shared shared;
86 #define mutex_init(m) \
91 static inline void mutex_lock(struct mutex *m)
96 static inline void mutex_unlock(struct mutex *m)
101 static inline int mutex_is_locked(struct mutex *m)
103 return (m->lock != 1);
106 #define cond_resched() do { } while (0)
107 #define preempt_enable() do { } while (0)
108 #define preempt_disable() do { } while (0)
110 #define BITOP_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
111 #define BITOP_WORD(nr) ((nr) / BITS_PER_LONG)
114 * __set_bit - Set a bit in memory
115 * @nr: the bit to set
116 * @addr: the address to start counting from
118 * Unlike set_bit(), this function is non-atomic and may be reordered.
119 * If it's called on the same region of memory simultaneously, the effect
120 * may be that only one operation succeeds.
122 static inline void __set_bit(int nr, volatile unsigned long *addr)
124 unsigned long mask = BITOP_MASK(nr);
125 unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
130 static inline void __clear_bit(int nr, volatile unsigned long *addr)
132 unsigned long mask = BITOP_MASK(nr);
133 unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
139 * test_bit - Determine whether a bit is set
140 * @nr: bit number to test
141 * @addr: Address to start counting from
143 static inline int test_bit(int nr, const volatile unsigned long *addr)
145 return 1UL & (addr[BITOP_WORD(nr)] >> (nr & (BITS_PER_LONG-1)));
151 #define MAX_ERRNO 4095
152 #define IS_ERR_VALUE(x) ((x) >= (unsigned long)-MAX_ERRNO)
154 static inline void *ERR_PTR(long error)
156 return (void *) error;
159 static inline long PTR_ERR(const void *ptr)
164 static inline long IS_ERR(const void *ptr)
166 return IS_ERR_VALUE((unsigned long)ptr);
172 #define min(x,y) ({ \
173 typeof(x) _x = (x); \
174 typeof(y) _y = (y); \
175 (void) (&_x == &_y); \
176 _x < _y ? _x : _y; })
178 #define max(x,y) ({ \
179 typeof(x) _x = (x); \
180 typeof(y) _y = (y); \
181 (void) (&_x == &_y); \
182 _x > _y ? _x : _y; })
184 #define min_t(type,x,y) \
185 ({ type __x = (x); type __y = (y); __x < __y ? __x: __y; })
186 #define max_t(type,x,y) \
187 ({ type __x = (x); type __y = (y); __x > __y ? __x: __y; })
192 #define printk(fmt, args...) fprintf(stderr, fmt, ##args)
198 #define kmalloc(x, y) malloc(x)
199 #define kzalloc(x, y) calloc(1, x)
200 #define kstrdup(x, y) strdup(x)
201 #define kfree(x) free(x)
203 #define BUG_ON(c) assert(!(c))
204 #define WARN_ON(c) assert(!(c))
207 #ifdef __compiler_offsetof
208 #define offsetof(TYPE,MEMBER) __compiler_offsetof(TYPE,MEMBER)
210 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
213 #define container_of(ptr, type, member) ({ \
214 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
215 (type *)( (char *)__mptr - offsetof(type,member) );})
217 #define __CHECK_ENDIAN__
218 #define __bitwise __bitwise__
223 typedef u16 __bitwise __le16;
224 typedef u16 __bitwise __be16;
225 typedef u32 __bitwise __le32;
226 typedef u32 __bitwise __be32;
227 typedef u64 __bitwise __le64;
228 typedef u64 __bitwise __be64;
230 /* Macros to generate set/get funcs for the struct fields
231 * assume there is a lefoo_to_cpu for every type, so lets make a simple
234 #define le8_to_cpu(v) (v)
235 #define cpu_to_le8(v) (v)
238 #if __BYTE_ORDER == __BIG_ENDIAN
239 #define cpu_to_le64(x) ((__force __le64)(u64)(bswap_64(x)))
240 #define le64_to_cpu(x) ((__force u64)(__le64)(bswap_64(x)))
241 #define cpu_to_le32(x) ((__force __le32)(u32)(bswap_32(x)))
242 #define le32_to_cpu(x) ((__force u32)(__le32)(bswap_32(x)))
243 #define cpu_to_le16(x) ((__force __le16)(u16)(bswap_16(x)))
244 #define le16_to_cpu(x) ((__force u16)(__le16)(bswap_16(x)))
246 #define cpu_to_le64(x) ((__force __le64)(u64)(x))
247 #define le64_to_cpu(x) ((__force u64)(__le64)(x))
248 #define cpu_to_le32(x) ((__force __le32)(u32)(x))
249 #define le32_to_cpu(x) ((__force u32)(__le32)(x))
250 #define cpu_to_le16(x) ((__force __le16)(u16)(x))
251 #define le16_to_cpu(x) ((__force u16)(__le16)(x))