2 * This program is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 2 of the License, or
5 * (at your option) any later version.
7 * This program is distributed in the hope that it will be useful,
8 * but WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10 * GNU General Public License for more details.
12 * You should have received a copy of the GNU General Public License along
13 * with this program; if not, write to the Free Software Foundation, Inc.,
14 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
17 #ifndef __SHARED_COMPILER_H
18 #define __SHARED_COMPILER_H
20 #define __noreturn __attribute__((noreturn))
21 #define __inline __attribute__((always_inline))
22 #define __hot __attribute__((hot))
23 #define __cold __attribute__((cold))
24 #define __force __attribute__((force))
25 #define __in_section(s) __attribute__((section("." # s)))
26 #define __visible __attribute__((externally_visible))
28 #define BUILD_BUG_ON(condition) ((void)sizeof(char[1 - 2*!!(condition)]))
29 #define BUILD_BUG_ON_ZERO(e) (sizeof(char[1 - 2 * !!(e)]) - 1)
31 #define ALIGN(x, a) __ALIGN_MASK(x, (typeof(x))(a) - 1)
32 #define __ALIGN_MASK(x, mask) (((x) + (mask)) & ~(mask))
34 #define __roundup(x, y) ((((x) + ((y) - 1)) / (y)) * (y))
36 #define __must_be_array(a) \
37 BUILD_BUG_ON_ZERO(__builtin_types_compatible_p(typeof(a), typeof(&a[0])))
38 #define ARRAY_SIZE(arr) (sizeof((arr)) / sizeof((arr)[0]) + __must_be_array(arr))
40 #define BIT(b) (1 << (b))
41 #define MASK(w) (BIT(w) - 1)
44 #ifdef __compiler_offsetof
45 # define offsetof(TYPE, MEMBER) __compiler_offsetof(TYPE, MEMBER)
47 # define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
50 #define likely(x) __builtin_expect(!!(x), 1)
51 #define unlikely(x) __builtin_expect(!!(x), 0)
53 #define min(x, y) ({ \
54 typeof(x) _min1 = (x); \
55 typeof(y) _min2 = (y); \
56 (void) (&_min1 == &_min2); \
57 _min1 < _min2 ? _min1 : _min2; })
59 #define max(x, y) ({ \
60 typeof(x) _max1 = (x); \
61 typeof(y) _max2 = (y); \
62 (void) (&_max1 == &_max2); \
63 _max1 > _max2 ? _max1 : _max2; })
65 #define min_t(type, x, y) ({ \
68 __min1 < __min2 ? __min1 : __min2; })
70 #define max_t(type, x, y) ({ \
73 __max1 > __max2 ? __max1 : __max2; })
76 #define container_of(ptr, type, member) ({ \
77 const typeof(((type *)0)->member) * __mptr = (ptr); \
78 (type *)(((unsigned long)__mptr - offsetof(type, member))); })
80 #define MAX_ERRNO 4095
82 #define IS_ERR_VALUE(x) unlikely((x) >= (unsigned long)-MAX_ERRNO)
84 static inline void *ERR_PTR(long errornr)
86 return (void *) errornr;
89 static inline long PTR_ERR(const void *ptr)
94 static inline long IS_ERR(const void *ptr)
96 return IS_ERR_VALUE((unsigned long)ptr);
99 static inline long IS_ERR_OR_NULL(const void *ptr)
101 return !ptr || IS_ERR_VALUE((unsigned long)ptr);
104 #endif /* __SHARED_COMPILER_H */