Rev 3243 | Rev 3391 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
1408 | serge | 1 | #ifndef _LINUX_KERNEL_H |
2 | #define _LINUX_KERNEL_H |
||
3 | |||
4 | /* |
||
5 | * 'kernel.h' contains some often-used function prototypes etc |
||
6 | */ |
||
7 | |||
8 | #ifdef __KERNEL__ |
||
9 | |||
10 | #include |
||
11 | #include |
||
12 | #include |
||
13 | #include |
||
1970 | serge | 14 | #include |
1408 | serge | 15 | |
2967 | Serge | 16 | #include |
17 | |||
18 | #define __init |
||
19 | |||
1964 | serge | 20 | #define USHRT_MAX ((u16)(~0U)) |
21 | #define SHRT_MAX ((s16)(USHRT_MAX>>1)) |
||
22 | #define SHRT_MIN ((s16)(-SHRT_MAX - 1)) |
||
1408 | serge | 23 | #define INT_MAX ((int)(~0U>>1)) |
24 | #define INT_MIN (-INT_MAX - 1) |
||
25 | #define UINT_MAX (~0U) |
||
26 | #define LONG_MAX ((long)(~0UL>>1)) |
||
27 | #define LONG_MIN (-LONG_MAX - 1) |
||
28 | #define ULONG_MAX (~0UL) |
||
29 | #define LLONG_MAX ((long long)(~0ULL>>1)) |
||
30 | #define LLONG_MIN (-LLONG_MAX - 1) |
||
31 | #define ULLONG_MAX (~0ULL) |
||
3031 | serge | 32 | #define SIZE_MAX (~(size_t)0) |
1408 | serge | 33 | |
34 | #define ALIGN(x,a) __ALIGN_MASK(x,(typeof(x))(a)-1) |
||
35 | #define __ALIGN_MASK(x,mask) (((x)+(mask))&~(mask)) |
||
36 | #define PTR_ALIGN(p, a) ((typeof(p))ALIGN((unsigned long)(p), (a))) |
||
37 | #define IS_ALIGNED(x, a) (((x) & ((typeof(x))(a) - 1)) == 0) |
||
38 | |||
3039 | serge | 39 | /* The `const' in roundup() prevents gcc-3.3 from calling __divdi3 */ |
40 | #define roundup(x, y) ( \ |
||
41 | { \ |
||
42 | const typeof(y) __y = y; \ |
||
43 | (((x) + (__y - 1)) / __y) * __y; \ |
||
44 | } \ |
||
45 | ) |
||
2967 | Serge | 46 | |
47 | #define DIV_ROUND_UP(n,d) (((n) + (d) - 1) / (d)) |
||
48 | #define DIV_ROUND_CLOSEST(x, divisor)( \ |
||
49 | { \ |
||
50 | typeof(divisor) __divisor = divisor; \ |
||
51 | (((x) + ((__divisor) / 2)) / (__divisor)); \ |
||
52 | } \ |
||
53 | ) |
||
54 | |||
1408 | serge | 55 | /** |
56 | * upper_32_bits - return bits 32-63 of a number |
||
57 | * @n: the number we're accessing |
||
58 | * |
||
59 | * A basic shift-right of a 64- or 32-bit quantity. Use this to suppress |
||
60 | * the "right shift count >= width of type" warning when that quantity is |
||
61 | * 32-bits. |
||
62 | */ |
||
63 | #define upper_32_bits(n) ((u32)(((n) >> 16) >> 16)) |
||
64 | |||
65 | /** |
||
66 | * lower_32_bits - return bits 0-31 of a number |
||
67 | * @n: the number we're accessing |
||
68 | */ |
||
69 | #define lower_32_bits(n) ((u32)(n)) |
||
70 | |||
71 | #define KERN_EMERG "<0>" /* system is unusable */ |
||
72 | #define KERN_ALERT "<1>" /* action must be taken immediately */ |
||
73 | #define KERN_CRIT "<2>" /* critical conditions */ |
||
74 | #define KERN_ERR "<3>" /* error conditions */ |
||
75 | #define KERN_WARNING "<4>" /* warning conditions */ |
||
76 | #define KERN_NOTICE "<5>" /* normal but significant condition */ |
||
77 | #define KERN_INFO "<6>" /* informational */ |
||
78 | #define KERN_DEBUG "<7>" /* debug-level messages */ |
||
1970 | serge | 79 | extern const char hex_asc[]; |
80 | #define hex_asc_lo(x) hex_asc[((x) & 0x0f)] |
||
81 | #define hex_asc_hi(x) hex_asc[((x) & 0xf0) >> 4] |
||
1408 | serge | 82 | |
1970 | serge | 83 | static inline char *pack_hex_byte(char *buf, u8 byte) |
84 | { |
||
85 | *buf++ = hex_asc_hi(byte); |
||
86 | *buf++ = hex_asc_lo(byte); |
||
87 | return buf; |
||
88 | } |
||
89 | |||
90 | extern int hex_to_bin(char ch); |
||
91 | extern void hex2bin(u8 *dst, const char *src, size_t count); |
||
92 | |||
93 | |||
1408 | serge | 94 | //int printk(const char *fmt, ...); |
95 | |||
96 | #define printk(fmt, arg...) dbgprintf(fmt , ##arg) |
||
97 | |||
98 | |||
99 | /* |
||
100 | * min()/max()/clamp() macros that also do |
||
101 | * strict type-checking.. See the |
||
102 | * "unnecessary" pointer comparison. |
||
103 | */ |
||
104 | #define min(x, y) ({ \ |
||
105 | typeof(x) _min1 = (x); \ |
||
106 | typeof(y) _min2 = (y); \ |
||
107 | (void) (&_min1 == &_min2); \ |
||
108 | _min1 < _min2 ? _min1 : _min2; }) |
||
109 | |||
110 | #define max(x, y) ({ \ |
||
111 | typeof(x) _max1 = (x); \ |
||
112 | typeof(y) _max2 = (y); \ |
||
113 | (void) (&_max1 == &_max2); \ |
||
114 | _max1 > _max2 ? _max1 : _max2; }) |
||
115 | |||
1970 | serge | 116 | #define min3(x, y, z) ({ \ |
117 | typeof(x) _min1 = (x); \ |
||
118 | typeof(y) _min2 = (y); \ |
||
119 | typeof(z) _min3 = (z); \ |
||
120 | (void) (&_min1 == &_min2); \ |
||
121 | (void) (&_min1 == &_min3); \ |
||
122 | _min1 < _min2 ? (_min1 < _min3 ? _min1 : _min3) : \ |
||
123 | (_min2 < _min3 ? _min2 : _min3); }) |
||
124 | |||
125 | #define max3(x, y, z) ({ \ |
||
126 | typeof(x) _max1 = (x); \ |
||
127 | typeof(y) _max2 = (y); \ |
||
128 | typeof(z) _max3 = (z); \ |
||
129 | (void) (&_max1 == &_max2); \ |
||
130 | (void) (&_max1 == &_max3); \ |
||
131 | _max1 > _max2 ? (_max1 > _max3 ? _max1 : _max3) : \ |
||
132 | (_max2 > _max3 ? _max2 : _max3); }) |
||
133 | |||
134 | /** |
||
135 | * min_not_zero - return the minimum that is _not_ zero, unless both are zero |
||
136 | * @x: value1 |
||
137 | * @y: value2 |
||
138 | */ |
||
139 | #define min_not_zero(x, y) ({ \ |
||
140 | typeof(x) __x = (x); \ |
||
141 | typeof(y) __y = (y); \ |
||
142 | __x == 0 ? __y : ((__y == 0) ? __x : min(__x, __y)); }) |
||
143 | |||
144 | /** |
||
145 | * clamp - return a value clamped to a given range with strict typechecking |
||
146 | * @val: current value |
||
147 | * @min: minimum allowable value |
||
148 | * @max: maximum allowable value |
||
149 | * |
||
150 | * This macro does strict typechecking of min/max to make sure they are of the |
||
151 | * same type as val. See the unnecessary pointer comparisons. |
||
152 | */ |
||
153 | #define clamp(val, min, max) ({ \ |
||
154 | typeof(val) __val = (val); \ |
||
155 | typeof(min) __min = (min); \ |
||
156 | typeof(max) __max = (max); \ |
||
157 | (void) (&__val == &__min); \ |
||
158 | (void) (&__val == &__max); \ |
||
159 | __val = __val < __min ? __min: __val; \ |
||
160 | __val > __max ? __max: __val; }) |
||
161 | |||
1408 | serge | 162 | /* |
163 | * ..and if you can't take the strict |
||
164 | * types, you can specify one yourself. |
||
165 | * |
||
166 | * Or not use min/max/clamp at all, of course. |
||
167 | */ |
||
168 | #define min_t(type, x, y) ({ \ |
||
169 | type __min1 = (x); \ |
||
170 | type __min2 = (y); \ |
||
171 | __min1 < __min2 ? __min1: __min2; }) |
||
172 | |||
173 | #define max_t(type, x, y) ({ \ |
||
174 | type __max1 = (x); \ |
||
175 | type __max2 = (y); \ |
||
176 | __max1 > __max2 ? __max1: __max2; }) |
||
177 | |||
178 | /** |
||
179 | * container_of - cast a member of a structure out to the containing structure |
||
180 | * @ptr: the pointer to the member. |
||
181 | * @type: the type of the container struct this is embedded in. |
||
182 | * @member: the name of the member within the struct. |
||
183 | * |
||
184 | */ |
||
185 | #define container_of(ptr, type, member) ({ \ |
||
186 | const typeof( ((type *)0)->member ) *__mptr = (ptr); \ |
||
187 | (type *)( (char *)__mptr - offsetof(type,member) );}) |
||
188 | |||
189 | |||
190 | static inline void *kcalloc(size_t n, size_t size, uint32_t flags) |
||
191 | { |
||
192 | if (n != 0 && size > ULONG_MAX / n) |
||
193 | return NULL; |
||
194 | return kzalloc(n * size, 0); |
||
195 | } |
||
196 | |||
1968 | serge | 197 | |
1412 | serge | 198 | void free (void *ptr); |
199 | |||
1408 | serge | 200 | #endif /* __KERNEL__ */ |
201 | |||
202 | typedef unsigned long pgprotval_t; |
||
203 | |||
204 | typedef struct pgprot { pgprotval_t pgprot; } pgprot_t; |
||
205 | |||
3262 | Serge | 206 | struct file |
207 | { |
||
208 | struct page **pages; /* physical memory backend */ |
||
209 | unsigned int count; |
||
210 | unsigned int allocated; |
||
211 | void *vma; |
||
212 | }; |
||
213 | |||
1408 | serge | 214 | struct vm_area_struct {}; |
215 | struct address_space {}; |
||
216 | |||
1430 | serge | 217 | struct device |
218 | { |
||
219 | struct device *parent; |
||
220 | void *driver_data; |
||
221 | }; |
||
222 | |||
223 | static inline void dev_set_drvdata(struct device *dev, void *data) |
||
224 | { |
||
225 | dev->driver_data = data; |
||
226 | } |
||
227 | |||
228 | static inline void *dev_get_drvdata(struct device *dev) |
||
229 | { |
||
230 | return dev->driver_data; |
||
231 | } |
||
232 | |||
1408 | serge | 233 | #define preempt_disable() do { } while (0) |
234 | #define preempt_enable_no_resched() do { } while (0) |
||
235 | #define preempt_enable() do { } while (0) |
||
236 | #define preempt_check_resched() do { } while (0) |
||
237 | |||
238 | #define preempt_disable_notrace() do { } while (0) |
||
239 | #define preempt_enable_no_resched_notrace() do { } while (0) |
||
240 | #define preempt_enable_notrace() do { } while (0) |
||
241 | |||
1964 | serge | 242 | #define in_dbg_master() (0) |
1408 | serge | 243 | |
2005 | serge | 244 | #define HZ 100 |
245 | |||
246 | #define time_after(a,b) \ |
||
247 | (typecheck(unsigned long, a) && \ |
||
248 | typecheck(unsigned long, b) && \ |