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.
19 #ifndef __KERNCOMPAT_H__
20 #define __KERNCOMPAT_H__
30 #include <linux/types.h>
36 #ifndef BTRFS_DISABLE_BACKTRACE
37 #define BTRFS_DISABLE_BACKTRACE
39 #define __always_inline __inline __attribute__ ((__always_inline__))
42 #ifndef BTRFS_DISABLE_BACKTRACE
46 #define ptr_to_u64(x) ((u64)(uintptr_t)x)
47 #define u64_to_ptr(x) ((void *)(uintptr_t)x)
56 #define get_cpu_var(p) (p)
57 #define __get_cpu_var(p) (p)
58 #define BITS_PER_BYTE 8
59 #define BITS_PER_LONG (__SIZEOF_LONG__ * BITS_PER_BYTE)
60 #define __GFP_BITS_SHIFT 20
61 #define __GFP_BITS_MASK ((int)((1 << __GFP_BITS_SHIFT) - 1))
65 #define ARRAY_SIZE(x) (sizeof(x) / sizeof((x)[0]))
68 #define ULONG_MAX (~0UL)
71 #define __token_glue(a,b,c) ___token_glue(a,b,c)
72 #define ___token_glue(a,b,c) a ## b ## c
73 #ifdef DEBUG_BUILD_CHECKS
74 #define BUILD_ASSERT(x) extern int __token_glue(compile_time_assert_,__LINE__,__COUNTER__)[1-2*!(x)] __attribute__((unused))
76 #define BUILD_ASSERT(x)
79 #ifndef BTRFS_DISABLE_BACKTRACE
80 #define MAX_BACKTRACE 16
81 static inline void print_trace(void)
83 void *array[MAX_BACKTRACE];
86 size = backtrace(array, MAX_BACKTRACE);
87 backtrace_symbols_fd(array, size, 2);
90 static inline void assert_trace(const char *assertion, const char *filename,
91 const char *func, unsigned line, long val)
96 fprintf(stderr, "%s:%d: %s: Assertion `%s` failed, value %ld\n",
97 filename, line, func, assertion, val);
99 fprintf(stderr, "%s:%d: %s: Assertion failed, value %ld.\n",
100 filename, line, func, val);
108 static inline void warning_trace(const char *assertion, const char *filename,
109 const char *func, unsigned line, long val,
116 "%s:%d: %s: Warning: assertion `%s` failed, value %ld\n",
117 filename, line, func, assertion, val);
120 "%s:%d: %s: Warning: assertion failed, value %ld.\n",
121 filename, line, func, val);
122 #ifndef BTRFS_DISABLE_BACKTRACE
130 #define __force __attribute__((force))
131 #define __bitwise__ __attribute__((bitwise))
139 * Since we're using primitive definitions from kernel-space, we need to
140 * define __KERNEL__ so that system header files know which definitions
144 #include <asm/types.h>
153 * Continuing to define __KERNEL__ breaks others parts of the code, so
154 * we can just undefine it now that we have the correct headers...
158 typedef unsigned int u32;
159 typedef unsigned int __u32;
160 typedef unsigned long long u64;
161 typedef unsigned char u8;
162 typedef unsigned short u16;
163 typedef long long s64;
168 struct vma_shared { int prio_tree_node; };
169 struct vm_area_struct {
170 unsigned long vm_pgoff;
171 unsigned long vm_start;
172 unsigned long vm_end;
173 struct vma_shared shared;
184 #define mutex_init(m) \
189 static inline void mutex_lock(struct mutex *m)
194 static inline void mutex_unlock(struct mutex *m)
199 static inline int mutex_is_locked(struct mutex *m)
201 return (m->lock != 1);
204 #define cond_resched() do { } while (0)
205 #define preempt_enable() do { } while (0)
206 #define preempt_disable() do { } while (0)
208 #define BITOP_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
209 #define BITOP_WORD(nr) ((nr) / BITS_PER_LONG)
211 #ifndef __attribute_const__
212 #define __attribute_const__ __attribute__((__const__))
216 * __set_bit - Set a bit in memory
217 * @nr: the bit to set
218 * @addr: the address to start counting from
220 * Unlike set_bit(), this function is non-atomic and may be reordered.
221 * If it's called on the same region of memory simultaneously, the effect
222 * may be that only one operation succeeds.
224 static inline void __set_bit(int nr, volatile unsigned long *addr)
226 unsigned long mask = BITOP_MASK(nr);
227 unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
232 static inline void __clear_bit(int nr, volatile unsigned long *addr)
234 unsigned long mask = BITOP_MASK(nr);
235 unsigned long *p = ((unsigned long *)addr) + BITOP_WORD(nr);
241 * test_bit - Determine whether a bit is set
242 * @nr: bit number to test
243 * @addr: Address to start counting from
245 static inline int test_bit(int nr, const volatile unsigned long *addr)
247 return 1UL & (addr[BITOP_WORD(nr)] >> (nr & (BITS_PER_LONG-1)));
253 #define MAX_ERRNO 4095
254 #define IS_ERR_VALUE(x) ((x) >= (unsigned long)-MAX_ERRNO)
256 static inline void *ERR_PTR(long error)
258 return (void *) error;
261 static inline long PTR_ERR(const void *ptr)
266 static inline long IS_ERR(const void *ptr)
268 return IS_ERR_VALUE((unsigned long)ptr);
272 * This looks more complex than it should be. But we need to
273 * get the type for the ~ right in round_down (it needs to be
274 * as wide as the result!), and we want to evaluate the macro
275 * arguments just once each.
277 #define __round_mask(x, y) ((__typeof__(x))((y)-1))
278 #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1)
279 #define round_down(x, y) ((x) & ~__round_mask(x, y))
284 #define printk(fmt, args...) fprintf(stderr, fmt, ##args)
291 #define kmalloc(x, y) malloc(x)
292 #define kzalloc(x, y) calloc(1, x)
293 #define kstrdup(x, y) strdup(x)
294 #define kfree(x) free(x)
295 #define vmalloc(x) malloc(x)
296 #define vfree(x) free(x)
298 #ifndef BTRFS_DISABLE_BACKTRACE
299 #define BUG_ON(c) assert_trace(#c, __FILE__, __func__, __LINE__, (long)(c))
300 #define WARN_ON(c) warning_trace(#c, __FILE__, __func__, __LINE__, (long)(c), 1)
301 #define ASSERT(c) assert_trace(#c, __FILE__, __func__, __LINE__, (long)!(c))
302 #define BUG() assert_trace(NULL, __FILE__, __func__, __LINE__, 1)
304 #define BUG_ON(c) assert(!(c))
305 #define WARN_ON(c) warning_trace(#c, __FILE__, __func__, __LINE__, (long)(c), 0)
306 #define ASSERT(c) assert(!(c))
307 #define BUG() assert(0)
310 #define container_of(ptr, type, member) ({ \
311 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
312 (type *)( (char *)__mptr - offsetof(type,member) );})
314 #define __bitwise __bitwise__
319 /* Alignment check */
320 #define IS_ALIGNED(x, a) (((x) & ((typeof(x))(a) - 1)) == 0)
322 static inline int is_power_of_2(unsigned long n)
324 return (n != 0 && ((n & (n - 1)) == 0));
327 typedef u16 __bitwise __le16;
328 typedef u16 __bitwise __be16;
329 typedef u32 __bitwise __le32;
330 typedef u32 __bitwise __be32;
331 typedef u64 __bitwise __le64;
332 typedef u64 __bitwise __be64;
334 /* Macros to generate set/get funcs for the struct fields
335 * assume there is a lefoo_to_cpu for every type, so lets make a simple
338 #define le8_to_cpu(v) (v)
339 #define cpu_to_le8(v) (v)
342 #if __BYTE_ORDER == __BIG_ENDIAN
343 #define cpu_to_le64(x) ((__force __le64)(u64)(bswap_64(x)))
344 #define le64_to_cpu(x) ((__force u64)(__le64)(bswap_64(x)))
345 #define cpu_to_le32(x) ((__force __le32)(u32)(bswap_32(x)))
346 #define le32_to_cpu(x) ((__force u32)(__le32)(bswap_32(x)))
347 #define cpu_to_le16(x) ((__force __le16)(u16)(bswap_16(x)))
348 #define le16_to_cpu(x) ((__force u16)(__le16)(bswap_16(x)))
350 #define cpu_to_le64(x) ((__force __le64)(u64)(x))
351 #define le64_to_cpu(x) ((__force u64)(__le64)(x))
352 #define cpu_to_le32(x) ((__force __le32)(u32)(x))
353 #define le32_to_cpu(x) ((__force u32)(__le32)(x))
354 #define cpu_to_le16(x) ((__force __le16)(u16)(x))
355 #define le16_to_cpu(x) ((__force u16)(__le16)(x))
358 struct __una_u16 { __le16 x; } __attribute__((__packed__));
359 struct __una_u32 { __le32 x; } __attribute__((__packed__));
360 struct __una_u64 { __le64 x; } __attribute__((__packed__));
362 #define get_unaligned_le8(p) (*((u8 *)(p)))
363 #define get_unaligned_8(p) (*((u8 *)(p)))
364 #define put_unaligned_le8(val,p) ((*((u8 *)(p))) = (val))
365 #define put_unaligned_8(val,p) ((*((u8 *)(p))) = (val))
366 #define get_unaligned_le16(p) le16_to_cpu(((const struct __una_u16 *)(p))->x)
367 #define get_unaligned_16(p) (((const struct __una_u16 *)(p))->x)
368 #define put_unaligned_le16(val,p) (((struct __una_u16 *)(p))->x = cpu_to_le16(val))
369 #define put_unaligned_16(val,p) (((struct __una_u16 *)(p))->x = (val))
370 #define get_unaligned_le32(p) le32_to_cpu(((const struct __una_u32 *)(p))->x)
371 #define get_unaligned_32(p) (((const struct __una_u32 *)(p))->x)
372 #define put_unaligned_le32(val,p) (((struct __una_u32 *)(p))->x = cpu_to_le32(val))
373 #define put_unaligned_32(val,p) (((struct __una_u32 *)(p))->x = (val))
374 #define get_unaligned_le64(p) le64_to_cpu(((const struct __una_u64 *)(p))->x)
375 #define get_unaligned_64(p) (((const struct __una_u64 *)(p))->x)
376 #define put_unaligned_le64(val,p) (((struct __una_u64 *)(p))->x = cpu_to_le64(val))
377 #define put_unaligned_64(val,p) (((struct __una_u64 *)(p))->x = (val))