xref: /freebsd/sys/compat/linuxkpi/common/include/linux/kernel.h (revision 8d59ecb214f7e078e57d35b865f33efc5d7cdf4d)
1*8d59ecb2SHans Petter Selasky /*-
2*8d59ecb2SHans Petter Selasky  * Copyright (c) 2010 Isilon Systems, Inc.
3*8d59ecb2SHans Petter Selasky  * Copyright (c) 2010 iX Systems, Inc.
4*8d59ecb2SHans Petter Selasky  * Copyright (c) 2010 Panasas, Inc.
5*8d59ecb2SHans Petter Selasky  * Copyright (c) 2013-2015 Mellanox Technologies, Ltd.
6*8d59ecb2SHans Petter Selasky  * Copyright (c) 2014-2015 François Tigeot
7*8d59ecb2SHans Petter Selasky  * All rights reserved.
8*8d59ecb2SHans Petter Selasky  *
9*8d59ecb2SHans Petter Selasky  * Redistribution and use in source and binary forms, with or without
10*8d59ecb2SHans Petter Selasky  * modification, are permitted provided that the following conditions
11*8d59ecb2SHans Petter Selasky  * are met:
12*8d59ecb2SHans Petter Selasky  * 1. Redistributions of source code must retain the above copyright
13*8d59ecb2SHans Petter Selasky  *    notice unmodified, this list of conditions, and the following
14*8d59ecb2SHans Petter Selasky  *    disclaimer.
15*8d59ecb2SHans Petter Selasky  * 2. Redistributions in binary form must reproduce the above copyright
16*8d59ecb2SHans Petter Selasky  *    notice, this list of conditions and the following disclaimer in the
17*8d59ecb2SHans Petter Selasky  *    documentation and/or other materials provided with the distribution.
18*8d59ecb2SHans Petter Selasky  *
19*8d59ecb2SHans Petter Selasky  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20*8d59ecb2SHans Petter Selasky  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21*8d59ecb2SHans Petter Selasky  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22*8d59ecb2SHans Petter Selasky  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23*8d59ecb2SHans Petter Selasky  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24*8d59ecb2SHans Petter Selasky  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25*8d59ecb2SHans Petter Selasky  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26*8d59ecb2SHans Petter Selasky  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27*8d59ecb2SHans Petter Selasky  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28*8d59ecb2SHans Petter Selasky  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29*8d59ecb2SHans Petter Selasky  *
30*8d59ecb2SHans Petter Selasky  * $FreeBSD$
31*8d59ecb2SHans Petter Selasky  */
32*8d59ecb2SHans Petter Selasky #ifndef	_LINUX_KERNEL_H_
33*8d59ecb2SHans Petter Selasky #define	_LINUX_KERNEL_H_
34*8d59ecb2SHans Petter Selasky 
35*8d59ecb2SHans Petter Selasky #include <sys/cdefs.h>
36*8d59ecb2SHans Petter Selasky #include <sys/types.h>
37*8d59ecb2SHans Petter Selasky #include <sys/systm.h>
38*8d59ecb2SHans Petter Selasky #include <sys/param.h>
39*8d59ecb2SHans Petter Selasky #include <sys/libkern.h>
40*8d59ecb2SHans Petter Selasky #include <sys/stat.h>
41*8d59ecb2SHans Petter Selasky #include <sys/smp.h>
42*8d59ecb2SHans Petter Selasky #include <sys/stddef.h>
43*8d59ecb2SHans Petter Selasky #include <sys/syslog.h>
44*8d59ecb2SHans Petter Selasky 
45*8d59ecb2SHans Petter Selasky #include <linux/bitops.h>
46*8d59ecb2SHans Petter Selasky #include <linux/compiler.h>
47*8d59ecb2SHans Petter Selasky #include <linux/errno.h>
48*8d59ecb2SHans Petter Selasky #include <linux/kthread.h>
49*8d59ecb2SHans Petter Selasky #include <linux/types.h>
50*8d59ecb2SHans Petter Selasky #include <linux/jiffies.h>
51*8d59ecb2SHans Petter Selasky #include <linux/wait.h>
52*8d59ecb2SHans Petter Selasky #include <linux/log2.h>
53*8d59ecb2SHans Petter Selasky #include <asm/byteorder.h>
54*8d59ecb2SHans Petter Selasky 
55*8d59ecb2SHans Petter Selasky #define KERN_CONT       ""
56*8d59ecb2SHans Petter Selasky #define	KERN_EMERG	"<0>"
57*8d59ecb2SHans Petter Selasky #define	KERN_ALERT	"<1>"
58*8d59ecb2SHans Petter Selasky #define	KERN_CRIT	"<2>"
59*8d59ecb2SHans Petter Selasky #define	KERN_ERR	"<3>"
60*8d59ecb2SHans Petter Selasky #define	KERN_WARNING	"<4>"
61*8d59ecb2SHans Petter Selasky #define	KERN_NOTICE	"<5>"
62*8d59ecb2SHans Petter Selasky #define	KERN_INFO	"<6>"
63*8d59ecb2SHans Petter Selasky #define	KERN_DEBUG	"<7>"
64*8d59ecb2SHans Petter Selasky 
65*8d59ecb2SHans Petter Selasky #define	BUILD_BUG_ON(x)		CTASSERT(!(x))
66*8d59ecb2SHans Petter Selasky 
67*8d59ecb2SHans Petter Selasky #define BUG()			panic("BUG")
68*8d59ecb2SHans Petter Selasky #define BUG_ON(condition)	do { if (condition) BUG(); } while(0)
69*8d59ecb2SHans Petter Selasky #define	WARN_ON			BUG_ON
70*8d59ecb2SHans Petter Selasky 
71*8d59ecb2SHans Petter Selasky #undef	ALIGN
72*8d59ecb2SHans Petter Selasky #define	ALIGN(x, y)		roundup2((x), (y))
73*8d59ecb2SHans Petter Selasky #undef PTR_ALIGN
74*8d59ecb2SHans Petter Selasky #define	PTR_ALIGN(p, a)		((__typeof(p))ALIGN((uintptr_t)(p), (a)))
75*8d59ecb2SHans Petter Selasky #define	DIV_ROUND_UP(x, n)	howmany(x, n)
76*8d59ecb2SHans Petter Selasky #define	DIV_ROUND_UP_ULL(x, n)	DIV_ROUND_UP((unsigned long long)(x), (n))
77*8d59ecb2SHans Petter Selasky #define	FIELD_SIZEOF(t, f)	sizeof(((t *)0)->f)
78*8d59ecb2SHans Petter Selasky 
79*8d59ecb2SHans Petter Selasky #define	printk(X...)		printf(X)
80*8d59ecb2SHans Petter Selasky 
81*8d59ecb2SHans Petter Selasky /*
82*8d59ecb2SHans Petter Selasky  * The "pr_debug()" and "pr_devel()" macros should produce zero code
83*8d59ecb2SHans Petter Selasky  * unless DEBUG is defined:
84*8d59ecb2SHans Petter Selasky  */
85*8d59ecb2SHans Petter Selasky #ifdef DEBUG
86*8d59ecb2SHans Petter Selasky #define pr_debug(fmt, ...) \
87*8d59ecb2SHans Petter Selasky         log(LOG_DEBUG, fmt, ##__VA_ARGS__)
88*8d59ecb2SHans Petter Selasky #define pr_devel(fmt, ...) \
89*8d59ecb2SHans Petter Selasky 	log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__)
90*8d59ecb2SHans Petter Selasky #else
91*8d59ecb2SHans Petter Selasky #define pr_debug(fmt, ...) \
92*8d59ecb2SHans Petter Selasky         ({ if (0) log(LOG_DEBUG, fmt, ##__VA_ARGS__); 0; })
93*8d59ecb2SHans Petter Selasky #define pr_devel(fmt, ...) \
94*8d59ecb2SHans Petter Selasky 	({ if (0) log(LOG_DEBUG, pr_fmt(fmt), ##__VA_ARGS__); 0; })
95*8d59ecb2SHans Petter Selasky #endif
96*8d59ecb2SHans Petter Selasky 
97*8d59ecb2SHans Petter Selasky #ifndef pr_fmt
98*8d59ecb2SHans Petter Selasky #define pr_fmt(fmt) fmt
99*8d59ecb2SHans Petter Selasky #endif
100*8d59ecb2SHans Petter Selasky 
101*8d59ecb2SHans Petter Selasky /*
102*8d59ecb2SHans Petter Selasky  * Print a one-time message (analogous to WARN_ONCE() et al):
103*8d59ecb2SHans Petter Selasky  */
104*8d59ecb2SHans Petter Selasky #define printk_once(...) do {			\
105*8d59ecb2SHans Petter Selasky 	static bool __print_once;		\
106*8d59ecb2SHans Petter Selasky 						\
107*8d59ecb2SHans Petter Selasky 	if (!__print_once) {			\
108*8d59ecb2SHans Petter Selasky 		__print_once = true;		\
109*8d59ecb2SHans Petter Selasky 		printk(__VA_ARGS__);		\
110*8d59ecb2SHans Petter Selasky 	}					\
111*8d59ecb2SHans Petter Selasky } while (0)
112*8d59ecb2SHans Petter Selasky 
113*8d59ecb2SHans Petter Selasky /*
114*8d59ecb2SHans Petter Selasky  * Log a one-time message (analogous to WARN_ONCE() et al):
115*8d59ecb2SHans Petter Selasky  */
116*8d59ecb2SHans Petter Selasky #define log_once(level,...) do {		\
117*8d59ecb2SHans Petter Selasky 	static bool __log_once;			\
118*8d59ecb2SHans Petter Selasky 						\
119*8d59ecb2SHans Petter Selasky 	if (!__log_once) {			\
120*8d59ecb2SHans Petter Selasky 		__log_once = true;		\
121*8d59ecb2SHans Petter Selasky 		log(level, __VA_ARGS__);	\
122*8d59ecb2SHans Petter Selasky 	}					\
123*8d59ecb2SHans Petter Selasky } while (0)
124*8d59ecb2SHans Petter Selasky 
125*8d59ecb2SHans Petter Selasky #define pr_emerg(fmt, ...) \
126*8d59ecb2SHans Petter Selasky 	log(LOG_EMERG, pr_fmt(fmt), ##__VA_ARGS__)
127*8d59ecb2SHans Petter Selasky #define pr_alert(fmt, ...) \
128*8d59ecb2SHans Petter Selasky 	log(LOG_ALERT, pr_fmt(fmt), ##__VA_ARGS__)
129*8d59ecb2SHans Petter Selasky #define pr_crit(fmt, ...) \
130*8d59ecb2SHans Petter Selasky 	log(LOG_CRIT, pr_fmt(fmt), ##__VA_ARGS__)
131*8d59ecb2SHans Petter Selasky #define pr_err(fmt, ...) \
132*8d59ecb2SHans Petter Selasky 	log(LOG_ERR, pr_fmt(fmt), ##__VA_ARGS__)
133*8d59ecb2SHans Petter Selasky #define pr_warning(fmt, ...) \
134*8d59ecb2SHans Petter Selasky 	log(LOG_WARNING, pr_fmt(fmt), ##__VA_ARGS__)
135*8d59ecb2SHans Petter Selasky #define pr_warn pr_warning
136*8d59ecb2SHans Petter Selasky #define pr_notice(fmt, ...) \
137*8d59ecb2SHans Petter Selasky 	log(LOG_NOTICE, pr_fmt(fmt), ##__VA_ARGS__)
138*8d59ecb2SHans Petter Selasky #define pr_info(fmt, ...) \
139*8d59ecb2SHans Petter Selasky 	log(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__)
140*8d59ecb2SHans Petter Selasky #define pr_info_once(fmt, ...) \
141*8d59ecb2SHans Petter Selasky 	log_once(LOG_INFO, pr_fmt(fmt), ##__VA_ARGS__)
142*8d59ecb2SHans Petter Selasky #define pr_cont(fmt, ...) \
143*8d59ecb2SHans Petter Selasky 	printk(KERN_CONT fmt, ##__VA_ARGS__)
144*8d59ecb2SHans Petter Selasky 
145*8d59ecb2SHans Petter Selasky #ifndef WARN
146*8d59ecb2SHans Petter Selasky #define WARN(condition, format...) ({                                   \
147*8d59ecb2SHans Petter Selasky         int __ret_warn_on = !!(condition);                              \
148*8d59ecb2SHans Petter Selasky         if (unlikely(__ret_warn_on))                                    \
149*8d59ecb2SHans Petter Selasky                 pr_warning(format);                                     \
150*8d59ecb2SHans Petter Selasky         unlikely(__ret_warn_on);                                        \
151*8d59ecb2SHans Petter Selasky })
152*8d59ecb2SHans Petter Selasky #endif
153*8d59ecb2SHans Petter Selasky 
154*8d59ecb2SHans Petter Selasky #define container_of(ptr, type, member)				\
155*8d59ecb2SHans Petter Selasky ({								\
156*8d59ecb2SHans Petter Selasky 	__typeof(((type *)0)->member) *_p = (ptr);		\
157*8d59ecb2SHans Petter Selasky 	(type *)((char *)_p - offsetof(type, member));		\
158*8d59ecb2SHans Petter Selasky })
159*8d59ecb2SHans Petter Selasky 
160*8d59ecb2SHans Petter Selasky #define	ARRAY_SIZE(x)	(sizeof(x) / sizeof((x)[0]))
161*8d59ecb2SHans Petter Selasky 
162*8d59ecb2SHans Petter Selasky #define	simple_strtoul	strtoul
163*8d59ecb2SHans Petter Selasky #define	simple_strtol	strtol
164*8d59ecb2SHans Petter Selasky #define kstrtol(a,b,c) ({*(c) = strtol(a,0,b);})
165*8d59ecb2SHans Petter Selasky 
166*8d59ecb2SHans Petter Selasky #define min(x, y)	((x) < (y) ? (x) : (y))
167*8d59ecb2SHans Petter Selasky #define max(x, y)	((x) > (y) ? (x) : (y))
168*8d59ecb2SHans Petter Selasky 
169*8d59ecb2SHans Petter Selasky #define min3(a, b, c)	min(a, min(b,c))
170*8d59ecb2SHans Petter Selasky #define max3(a, b, c)	max(a, max(b,c))
171*8d59ecb2SHans Petter Selasky 
172*8d59ecb2SHans Petter Selasky #define min_t(type, _x, _y)	((type)(_x) < (type)(_y) ? (type)(_x) : (type)(_y))
173*8d59ecb2SHans Petter Selasky #define max_t(type, _x, _y)	((type)(_x) > (type)(_y) ? (type)(_x) : (type)(_y))
174*8d59ecb2SHans Petter Selasky 
175*8d59ecb2SHans Petter Selasky #define clamp_t(type, _x, min, max)	min_t(type, max_t(type, _x, min), max)
176*8d59ecb2SHans Petter Selasky #define clamp(x, lo, hi)		min( max(x,lo), hi)
177*8d59ecb2SHans Petter Selasky 
178*8d59ecb2SHans Petter Selasky /*
179*8d59ecb2SHans Petter Selasky  * This looks more complex than it should be. But we need to
180*8d59ecb2SHans Petter Selasky  * get the type for the ~ right in round_down (it needs to be
181*8d59ecb2SHans Petter Selasky  * as wide as the result!), and we want to evaluate the macro
182*8d59ecb2SHans Petter Selasky  * arguments just once each.
183*8d59ecb2SHans Petter Selasky  */
184*8d59ecb2SHans Petter Selasky #define __round_mask(x, y) ((__typeof__(x))((y)-1))
185*8d59ecb2SHans Petter Selasky #define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1)
186*8d59ecb2SHans Petter Selasky #define round_down(x, y) ((x) & ~__round_mask(x, y))
187*8d59ecb2SHans Petter Selasky 
188*8d59ecb2SHans Petter Selasky #define	num_possible_cpus()	mp_ncpus
189*8d59ecb2SHans Petter Selasky #define	num_online_cpus()	mp_ncpus
190*8d59ecb2SHans Petter Selasky 
191*8d59ecb2SHans Petter Selasky typedef struct pm_message {
192*8d59ecb2SHans Petter Selasky         int event;
193*8d59ecb2SHans Petter Selasky } pm_message_t;
194*8d59ecb2SHans Petter Selasky 
195*8d59ecb2SHans Petter Selasky /* Swap values of a and b */
196*8d59ecb2SHans Petter Selasky #define swap(a, b) do {			\
197*8d59ecb2SHans Petter Selasky 	typeof(a) _swap_tmp = a;	\
198*8d59ecb2SHans Petter Selasky 	a = b;				\
199*8d59ecb2SHans Petter Selasky 	b = _swap_tmp;			\
200*8d59ecb2SHans Petter Selasky } while (0)
201*8d59ecb2SHans Petter Selasky 
202*8d59ecb2SHans Petter Selasky #define	DIV_ROUND_CLOSEST(x, divisor)	(((x) + ((divisor) / 2)) / (divisor))
203*8d59ecb2SHans Petter Selasky 
204*8d59ecb2SHans Petter Selasky static inline uintmax_t
205*8d59ecb2SHans Petter Selasky mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor)
206*8d59ecb2SHans Petter Selasky {
207*8d59ecb2SHans Petter Selasky 	uintmax_t q = (x / divisor);
208*8d59ecb2SHans Petter Selasky 	uintmax_t r = (x % divisor);
209*8d59ecb2SHans Petter Selasky 
210*8d59ecb2SHans Petter Selasky 	return ((q * multiplier) + ((r * multiplier) / divisor));
211*8d59ecb2SHans Petter Selasky }
212*8d59ecb2SHans Petter Selasky 
213*8d59ecb2SHans Petter Selasky static inline int64_t
214*8d59ecb2SHans Petter Selasky abs64(int64_t x)
215*8d59ecb2SHans Petter Selasky {
216*8d59ecb2SHans Petter Selasky 	return (x < 0 ? -x : x);
217*8d59ecb2SHans Petter Selasky }
218*8d59ecb2SHans Petter Selasky 
219*8d59ecb2SHans Petter Selasky #endif	/* _LINUX_KERNEL_H_ */
220