2 * Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013 Nicira, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
29 #include "openvswitch/types.h"
33 #define va_copy __va_copy
35 #define va_copy(dst, src) ((dst) = (src))
40 #define BUILD_ASSERT(EXPR) ((void) 0)
41 #define BUILD_ASSERT_DECL(EXPR) extern int (*build_assert(void))[1]
42 #elif !defined(__cplusplus)
43 /* Build-time assertion building block. */
44 #define BUILD_ASSERT__(EXPR) \
45 sizeof(struct { unsigned int build_assert_failed : (EXPR) ? 1 : -1; })
47 /* Build-time assertion for use in a statement context. */
48 #define BUILD_ASSERT(EXPR) (void) BUILD_ASSERT__(EXPR)
50 /* Build-time assertion for use in a declaration context. */
51 #define BUILD_ASSERT_DECL(EXPR) \
52 extern int (*build_assert(void))[BUILD_ASSERT__(EXPR)]
53 #else /* __cplusplus */
54 #include <boost/static_assert.hpp>
55 #define BUILD_ASSERT BOOST_STATIC_ASSERT
56 #define BUILD_ASSERT_DECL BOOST_STATIC_ASSERT
57 #endif /* __cplusplus */
60 #define BUILD_ASSERT_GCCONLY(EXPR) BUILD_ASSERT(EXPR)
61 #define BUILD_ASSERT_DECL_GCCONLY(EXPR) BUILD_ASSERT_DECL(EXPR)
63 #define BUILD_ASSERT_GCCONLY(EXPR) ((void) 0)
64 #define BUILD_ASSERT_DECL_GCCONLY(EXPR) ((void) 0)
67 /* Like the standard assert macro, except:
69 * - Writes the failure message to the log.
71 * - Not affected by NDEBUG. */
72 #define ovs_assert(CONDITION) \
73 if (!OVS_LIKELY(CONDITION)) { \
74 ovs_assert_failure(SOURCE_LOCATOR, __func__, #CONDITION); \
76 void ovs_assert_failure(const char *, const char *, const char *) NO_RETURN;
78 /* Casts 'pointer' to 'type' and issues a compiler warning if the cast changes
79 * anything other than an outermost "const" or "volatile" qualifier.
81 * The cast to int is present only to suppress an "expression using sizeof
82 * bool" warning from "sparse" (see
83 * http://permalink.gmane.org/gmane.comp.parsers.sparse/2967). */
84 #define CONST_CAST(TYPE, POINTER) \
85 ((void) sizeof ((int) ((POINTER) == (TYPE) (POINTER))), \
88 extern const char *program_name;
90 #define __ARRAY_SIZE_NOCHECK(ARRAY) (sizeof(ARRAY) / sizeof((ARRAY)[0]))
92 /* return 0 for array types, 1 otherwise */
93 #define __ARRAY_CHECK(ARRAY) \
94 !__builtin_types_compatible_p(typeof(ARRAY), typeof(&ARRAY[0]))
96 /* compile-time fail if not array */
97 #define __ARRAY_FAIL(ARRAY) (sizeof(char[-2*!__ARRAY_CHECK(ARRAY)]))
98 #define __ARRAY_SIZE(ARRAY) \
99 __builtin_choose_expr(__ARRAY_CHECK(ARRAY), \
100 __ARRAY_SIZE_NOCHECK(ARRAY), __ARRAY_FAIL(ARRAY))
102 #define __ARRAY_SIZE(ARRAY) __ARRAY_SIZE_NOCHECK(ARRAY)
105 /* Returns the number of elements in ARRAY. */
106 #define ARRAY_SIZE(ARRAY) __ARRAY_SIZE(ARRAY)
108 /* Returns X / Y, rounding up. X must be nonnegative to round correctly. */
109 #define DIV_ROUND_UP(X, Y) (((X) + ((Y) - 1)) / (Y))
111 /* Returns X rounded up to the nearest multiple of Y. */
112 #define ROUND_UP(X, Y) (DIV_ROUND_UP(X, Y) * (Y))
114 /* Returns the least number that, when added to X, yields a multiple of Y. */
115 #define PAD_SIZE(X, Y) (ROUND_UP(X, Y) - (X))
117 /* Returns X rounded down to the nearest multiple of Y. */
118 #define ROUND_DOWN(X, Y) ((X) / (Y) * (Y))
120 /* Returns true if X is a power of 2, otherwise false. */
121 #define IS_POW2(X) ((X) && !((X) & ((X) - 1)))
129 /* Returns X rounded up to a power of 2. X must be a constant expression. */
130 #define ROUND_UP_POW2(X) RUP2__(X)
131 #define RUP2__(X) (RUP2_1(X) + 1)
132 #define RUP2_1(X) (RUP2_2(X) | (RUP2_2(X) >> 16))
133 #define RUP2_2(X) (RUP2_3(X) | (RUP2_3(X) >> 8))
134 #define RUP2_3(X) (RUP2_4(X) | (RUP2_4(X) >> 4))
135 #define RUP2_4(X) (RUP2_5(X) | (RUP2_5(X) >> 2))
136 #define RUP2_5(X) (RUP2_6(X) | (RUP2_6(X) >> 1))
137 #define RUP2_6(X) ((X) - 1)
139 /* Returns X rounded down to a power of 2. X must be a constant expression. */
140 #define ROUND_DOWN_POW2(X) RDP2__(X)
141 #define RDP2__(X) (RDP2_1(X) - (RDP2_1(X) >> 1))
142 #define RDP2_1(X) (RDP2_2(X) | (RDP2_2(X) >> 16))
143 #define RDP2_2(X) (RDP2_3(X) | (RDP2_3(X) >> 8))
144 #define RDP2_3(X) (RDP2_4(X) | (RDP2_4(X) >> 4))
145 #define RDP2_4(X) (RDP2_5(X) | (RDP2_5(X) >> 2))
146 #define RDP2_5(X) ( (X) | ( (X) >> 1))
149 #define MIN(X, Y) ((X) < (Y) ? (X) : (Y))
153 #define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
156 #define OVS_NOT_REACHED() abort()
158 /* Expands to a string that looks like "<file>:<line>", e.g. "tmp.c:10".
160 * See http://c-faq.com/ansi/stringize.html for an explanation of STRINGIZE and
162 #define SOURCE_LOCATOR __FILE__ ":" STRINGIZE(__LINE__)
163 #define STRINGIZE(ARG) STRINGIZE2(ARG)
164 #define STRINGIZE2(ARG) #ARG
166 /* Given a pointer-typed lvalue OBJECT, expands to a pointer type that may be
167 * assigned to OBJECT. */
169 #define OVS_TYPEOF(OBJECT) typeof(OBJECT)
171 #define OVS_TYPEOF(OBJECT) void *
174 /* Given OBJECT of type pointer-to-structure, expands to the offset of MEMBER
175 * within an instance of the structure.
177 * The GCC-specific version avoids the technicality of undefined behavior if
178 * OBJECT is null, invalid, or not yet initialized. This makes some static
179 * checkers (like Coverity) happier. But the non-GCC version does not actually
180 * dereference any pointer, so it would be surprising for it to cause any
181 * problems in practice.
184 #define OBJECT_OFFSETOF(OBJECT, MEMBER) offsetof(typeof(*(OBJECT)), MEMBER)
186 #define OBJECT_OFFSETOF(OBJECT, MEMBER) \
187 ((char *) &(OBJECT)->MEMBER - (char *) (OBJECT))
190 /* Given POINTER, the address of the given MEMBER in a STRUCT object, returns
191 the STRUCT object. */
192 #define CONTAINER_OF(POINTER, STRUCT, MEMBER) \
193 ((STRUCT *) (void *) ((char *) (POINTER) - offsetof (STRUCT, MEMBER)))
195 /* Given POINTER, the address of the given MEMBER within an object of the type
196 * that that OBJECT points to, returns OBJECT as an assignment-compatible
197 * pointer type (either the correct pointer type or "void *"). OBJECT must be
200 * This is the same as CONTAINER_OF except that it infers the structure type
201 * from the type of '*OBJECT'. */
202 #define OBJECT_CONTAINING(POINTER, OBJECT, MEMBER) \
203 ((OVS_TYPEOF(OBJECT)) (void *) \
204 ((char *) (POINTER) - OBJECT_OFFSETOF(OBJECT, MEMBER)))
206 /* Given POINTER, the address of the given MEMBER within an object of the type
207 * that that OBJECT points to, assigns the address of the outer object to
208 * OBJECT, which must be an lvalue.
210 * Evaluates to (void) 0 as the result is not to be used. */
211 #define ASSIGN_CONTAINER(OBJECT, POINTER, MEMBER) \
212 ((OBJECT) = OBJECT_CONTAINING(POINTER, OBJECT, MEMBER), (void) 0)
214 /* Given ATTR, and TYPE, cast the ATTR to TYPE by first casting ATTR to
215 * (void *). This is to suppress the alignment warning issued by clang. */
216 #define ALIGNED_CAST(TYPE, ATTR) ((TYPE) (void *) (ATTR))
218 /* Use "%"PRIuSIZE to format size_t with printf(). */
220 #define PRIdSIZE "Id"
221 #define PRIiSIZE "Ii"
222 #define PRIoSIZE "Io"
223 #define PRIuSIZE "Iu"
224 #define PRIxSIZE "Ix"
225 #define PRIXSIZE "IX"
227 #define PRIdSIZE "zd"
228 #define PRIiSIZE "zi"
229 #define PRIoSIZE "zo"
230 #define PRIuSIZE "zu"
231 #define PRIxSIZE "zx"
232 #define PRIXSIZE "zX"
239 void set_program_name__(const char *name, const char *version,
240 const char *date, const char *time);
241 #define set_program_name(name) \
242 set_program_name__(name, VERSION, __DATE__, __TIME__)
244 const char *get_subprogram_name(void);
245 void set_subprogram_name(const char *format, ...) PRINTF_FORMAT(1, 2);
247 const char *get_program_version(void);
248 void ovs_print_version(uint8_t min_ofp, uint8_t max_ofp);
250 void out_of_memory(void) NO_RETURN;
251 void *xmalloc(size_t) MALLOC_LIKE;
252 void *xcalloc(size_t, size_t) MALLOC_LIKE;
253 void *xzalloc(size_t) MALLOC_LIKE;
254 void *xrealloc(void *, size_t);
255 void *xmemdup(const void *, size_t) MALLOC_LIKE;
256 char *xmemdup0(const char *, size_t) MALLOC_LIKE;
257 char *xstrdup(const char *) MALLOC_LIKE;
258 char *xasprintf(const char *format, ...) PRINTF_FORMAT(1, 2) MALLOC_LIKE;
259 char *xvasprintf(const char *format, va_list) PRINTF_FORMAT(1, 0) MALLOC_LIKE;
260 void *x2nrealloc(void *p, size_t *n, size_t s);
262 void ovs_strlcpy(char *dst, const char *src, size_t size);
263 void ovs_strzcpy(char *dst, const char *src, size_t size);
265 void ovs_abort(int err_no, const char *format, ...)
266 PRINTF_FORMAT(2, 3) NO_RETURN;
267 void ovs_abort_valist(int err_no, const char *format, va_list)
268 PRINTF_FORMAT(2, 0) NO_RETURN;
269 void ovs_fatal(int err_no, const char *format, ...)
270 PRINTF_FORMAT(2, 3) NO_RETURN;
271 void ovs_fatal_valist(int err_no, const char *format, va_list)
272 PRINTF_FORMAT(2, 0) NO_RETURN;
273 void ovs_error(int err_no, const char *format, ...) PRINTF_FORMAT(2, 3);
274 void ovs_error_valist(int err_no, const char *format, va_list)
276 const char *ovs_retval_to_string(int);
277 const char *ovs_strerror(int);
278 void ovs_hex_dump(FILE *, const void *, size_t, uintptr_t offset, bool ascii);
280 bool str_to_int(const char *, int base, int *);
281 bool str_to_long(const char *, int base, long *);
282 bool str_to_llong(const char *, int base, long long *);
285 str_to_uint(const char *s, int base, unsigned int *u)
287 return str_to_int(s, base, (int *) u);
291 str_to_ulong(const char *s, int base, unsigned long *ul)
293 return str_to_long(s, base, (long *) ul);
297 str_to_ullong(const char *s, int base, unsigned long long *ull)
299 return str_to_llong(s, base, (long long *) ull);
302 bool ovs_scan(const char *s, const char *format, ...) SCANF_FORMAT(2, 3);
304 bool str_to_double(const char *, double *);
306 int hexit_value(int c);
307 unsigned int hexits_value(const char *s, size_t n, bool *ok);
309 const char *english_list_delimiter(size_t index, size_t total);
312 char *dir_name(const char *file_name);
313 char *base_name(const char *file_name);
314 char *abs_file_name(const char *dir, const char *file_name);
316 char *follow_symlinks(const char *filename);
318 void ignore(bool x OVS_UNUSED);
322 /* Returns the number of trailing 0-bits in 'n'. Undefined if 'n' == 0. */
327 /* With GCC 4.7 on 32-bit x86, if a 32-bit integer is passed as 'n', using
328 * a plain __builtin_ctzll() here always generates an out-of-line function
329 * call. The test below helps it to emit a single 'bsf' instruction. */
330 return (__builtin_constant_p(n <= UINT32_MAX) && n <= UINT32_MAX
332 : __builtin_ctzll(n));
336 raw_clz64(uint64_t n)
338 return __builtin_clzll(n);
341 /* Defined in util.c. */
342 int raw_ctz(uint64_t n);
343 int raw_clz64(uint64_t n);
346 /* Returns the number of trailing 0-bits in 'n', or 32 if 'n' is 0. */
350 return n ? raw_ctz(n) : 32;
353 /* Returns the number of trailing 0-bits in 'n', or 64 if 'n' is 0. */
357 return n ? raw_ctz(n) : 64;
360 /* Returns the number of leading 0-bits in 'n', or 32 if 'n' is 0. */
364 return n ? raw_clz64(n) - 32 : 32;
367 /* Returns the number of leading 0-bits in 'n', or 64 if 'n' is 0. */
371 return n ? raw_clz64(n) : 64;
374 /* Given a word 'n', calculates floor(log_2('n')). This is equivalent
375 * to finding the bit position of the most significant one bit in 'n'. It is
376 * an error to call this function with 'n' == 0. */
378 log_2_floor(uint64_t n)
380 return 63 - raw_clz64(n);
383 /* Given a word 'n', calculates ceil(log_2('n')). It is an error to
384 * call this function with 'n' == 0. */
386 log_2_ceil(uint64_t n)
388 return log_2_floor(n) + !is_pow2(n);
391 /* unsigned int count_1bits(uint64_t x):
393 * Returns the number of 1-bits in 'x', between 0 and 64 inclusive. */
394 #if UINTPTR_MAX == UINT64_MAX
395 static inline unsigned int
396 count_1bits(uint64_t x)
398 #if __GNUC__ >= 4 && __POPCNT__
399 return __builtin_popcountll(x);
401 /* This portable implementation is the fastest one we know of for 64
402 * bits, and about 3x faster than GCC 4.7 __builtin_popcountll(). */
403 const uint64_t h55 = UINT64_C(0x5555555555555555);
404 const uint64_t h33 = UINT64_C(0x3333333333333333);
405 const uint64_t h0F = UINT64_C(0x0F0F0F0F0F0F0F0F);
406 const uint64_t h01 = UINT64_C(0x0101010101010101);
407 x -= (x >> 1) & h55; /* Count of each 2 bits in-place. */
408 x = (x & h33) + ((x >> 2) & h33); /* Count of each 4 bits in-place. */
409 x = (x + (x >> 4)) & h0F; /* Count of each 8 bits in-place. */
410 return (x * h01) >> 56; /* Sum of all bytes. */
413 #else /* Not 64-bit. */
414 #if __GNUC__ >= 4 && __POPCNT__
415 static inline unsigned int
416 count_1bits_32__(uint32_t x)
418 return __builtin_popcount(x);
421 #define NEED_COUNT_1BITS_8 1
422 extern const uint8_t count_1bits_8[256];
423 static inline unsigned int
424 count_1bits_32__(uint32_t x)
426 /* This portable implementation is the fastest one we know of for 32 bits,
427 * and faster than GCC __builtin_popcount(). */
428 return (count_1bits_8[x & 0xff] +
429 count_1bits_8[(x >> 8) & 0xff] +
430 count_1bits_8[(x >> 16) & 0xff] +
431 count_1bits_8[x >> 24]);
434 static inline unsigned int
435 count_1bits(uint64_t x)
437 return count_1bits_32__(x) + count_1bits_32__(x >> 32);
441 /* Returns the rightmost 1-bit in 'x' (e.g. 01011000 => 00001000), or 0 if 'x'
443 static inline uintmax_t
444 rightmost_1bit(uintmax_t x)
449 /* Returns 'x' with its rightmost 1-bit changed to a zero (e.g. 01011000 =>
450 * 01010000), or 0 if 'x' is 0. */
451 static inline uintmax_t
452 zero_rightmost_1bit(uintmax_t x)
457 /* Returns the index of the rightmost 1-bit in 'x' (e.g. 01011000 => 3), or 32
460 * Unlike the other functions for rightmost 1-bits, this function only works
461 * with 32-bit integers. */
462 static inline uint32_t
463 rightmost_1bit_idx(uint32_t x)
468 /* Returns the index of the leftmost 1-bit in 'x' (e.g. 01011000 => 6), or 32
471 * This function only works with 32-bit integers. */
472 static inline uint32_t
473 leftmost_1bit_idx(uint32_t x)
475 return x ? log_2_floor(x) : 32;
478 bool is_all_zeros(const uint8_t *, size_t);
479 bool is_all_ones(const uint8_t *, size_t);
480 void bitwise_copy(const void *src, unsigned int src_len, unsigned int src_ofs,
481 void *dst, unsigned int dst_len, unsigned int dst_ofs,
482 unsigned int n_bits);
483 void bitwise_zero(void *dst_, unsigned int dst_len, unsigned dst_ofs,
484 unsigned int n_bits);
485 void bitwise_one(void *dst_, unsigned int dst_len, unsigned dst_ofs,
486 unsigned int n_bits);
487 bool bitwise_is_all_zeros(const void *, unsigned int len, unsigned int ofs,
488 unsigned int n_bits);
489 void bitwise_put(uint64_t value,
490 void *dst, unsigned int dst_len, unsigned int dst_ofs,
491 unsigned int n_bits);
492 uint64_t bitwise_get(const void *src, unsigned int src_len,
493 unsigned int src_ofs, unsigned int n_bits);
497 char *ovs_format_message(int error);
498 char *ovs_lasterror_to_string(void);
499 int ftruncate(int fd, off_t length);