mirror of
https://github.com/openvswitch/ovs
synced 2025-08-22 09:58:01 +00:00
To easily allow both in- and out-of-tree building of the Python wrapper for the OVS JSON parser (e.g. w/ pip), move json.h to include/openvswitch. This also requires moving lib/{hmap,shash}.h. Both hmap.h and shash.h were #include-ing "util.h" even though the headers themselves did not use anything from there, but rather from include/openvswitch/util.h. Fixing that required including util.h in several C files mostly due to OVS_NOT_REACHED and things like xmalloc. Signed-off-by: Terry Wilson <twilson@redhat.com> Signed-off-by: Ben Pfaff <blp@ovn.org>
457 lines
13 KiB
C
457 lines
13 KiB
C
/*
|
||
* Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 Nicira, Inc.
|
||
*
|
||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||
* you may not use this file except in compliance with the License.
|
||
* You may obtain a copy of the License at:
|
||
*
|
||
* http://www.apache.org/licenses/LICENSE-2.0
|
||
*
|
||
* Unless required by applicable law or agreed to in writing, software
|
||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
* See the License for the specific language governing permissions and
|
||
* limitations under the License.
|
||
*/
|
||
|
||
#ifndef UTIL_H
|
||
#define UTIL_H 1
|
||
|
||
#include <arpa/inet.h>
|
||
#include <inttypes.h>
|
||
#include <limits.h>
|
||
#include <stdarg.h>
|
||
#include <stdio.h>
|
||
#include <stdlib.h>
|
||
#include <string.h>
|
||
#include "compiler.h"
|
||
#include "util.h"
|
||
#include "openvswitch/util.h"
|
||
|
||
extern char *program_name;
|
||
|
||
#define __ARRAY_SIZE_NOCHECK(ARRAY) (sizeof(ARRAY) / sizeof((ARRAY)[0]))
|
||
#ifdef __GNUC__
|
||
/* return 0 for array types, 1 otherwise */
|
||
#define __ARRAY_CHECK(ARRAY) \
|
||
!__builtin_types_compatible_p(typeof(ARRAY), typeof(&ARRAY[0]))
|
||
|
||
/* compile-time fail if not array */
|
||
#define __ARRAY_FAIL(ARRAY) (sizeof(char[-2*!__ARRAY_CHECK(ARRAY)]))
|
||
#define __ARRAY_SIZE(ARRAY) \
|
||
__builtin_choose_expr(__ARRAY_CHECK(ARRAY), \
|
||
__ARRAY_SIZE_NOCHECK(ARRAY), __ARRAY_FAIL(ARRAY))
|
||
#else
|
||
#define __ARRAY_SIZE(ARRAY) __ARRAY_SIZE_NOCHECK(ARRAY)
|
||
#endif
|
||
|
||
|
||
/* This system's cache line size, in bytes.
|
||
* Being wrong hurts performance but not correctness. */
|
||
#define CACHE_LINE_SIZE 64
|
||
BUILD_ASSERT_DECL(IS_POW2(CACHE_LINE_SIZE));
|
||
|
||
static inline void
|
||
ovs_prefetch_range(const void *start, size_t size)
|
||
{
|
||
const char *addr = (const char *)start;
|
||
size_t ofs;
|
||
|
||
for (ofs = 0; ofs < size; ofs += CACHE_LINE_SIZE) {
|
||
OVS_PREFETCH(addr + ofs);
|
||
}
|
||
}
|
||
|
||
#ifndef MIN
|
||
#define MIN(X, Y) ((X) < (Y) ? (X) : (Y))
|
||
#endif
|
||
|
||
#ifndef MAX
|
||
#define MAX(X, Y) ((X) > (Y) ? (X) : (Y))
|
||
#endif
|
||
|
||
#define OVS_NOT_REACHED() abort()
|
||
|
||
/* Use "%"PRIuSIZE to format size_t with printf(). */
|
||
#ifdef _WIN32
|
||
#define PRIdSIZE "Id"
|
||
#define PRIiSIZE "Ii"
|
||
#define PRIoSIZE "Io"
|
||
#define PRIuSIZE "Iu"
|
||
#define PRIxSIZE "Ix"
|
||
#define PRIXSIZE "IX"
|
||
#else
|
||
#define PRIdSIZE "zd"
|
||
#define PRIiSIZE "zi"
|
||
#define PRIoSIZE "zo"
|
||
#define PRIuSIZE "zu"
|
||
#define PRIxSIZE "zx"
|
||
#define PRIXSIZE "zX"
|
||
#endif
|
||
|
||
#ifndef _WIN32
|
||
typedef uint32_t HANDLE;
|
||
#endif
|
||
|
||
#ifdef __cplusplus
|
||
extern "C" {
|
||
#endif
|
||
|
||
#define set_program_name(name) \
|
||
ovs_set_program_name(name, OVS_PACKAGE_VERSION)
|
||
|
||
const char *get_subprogram_name(void);
|
||
void set_subprogram_name(const char *);
|
||
|
||
void ovs_print_version(uint8_t min_ofp, uint8_t max_ofp);
|
||
|
||
OVS_NO_RETURN void out_of_memory(void);
|
||
void *xmalloc(size_t) MALLOC_LIKE;
|
||
void *xcalloc(size_t, size_t) MALLOC_LIKE;
|
||
void *xzalloc(size_t) MALLOC_LIKE;
|
||
void *xrealloc(void *, size_t);
|
||
void *xmemdup(const void *, size_t) MALLOC_LIKE;
|
||
char *xmemdup0(const char *, size_t) MALLOC_LIKE;
|
||
char *xstrdup(const char *) MALLOC_LIKE;
|
||
char *nullable_xstrdup(const char *) MALLOC_LIKE;
|
||
char *xasprintf(const char *format, ...) OVS_PRINTF_FORMAT(1, 2) MALLOC_LIKE;
|
||
char *xvasprintf(const char *format, va_list) OVS_PRINTF_FORMAT(1, 0) MALLOC_LIKE;
|
||
void *x2nrealloc(void *p, size_t *n, size_t s);
|
||
|
||
void *xmalloc_cacheline(size_t) MALLOC_LIKE;
|
||
void *xzalloc_cacheline(size_t) MALLOC_LIKE;
|
||
void free_cacheline(void *);
|
||
|
||
void ovs_strlcpy(char *dst, const char *src, size_t size);
|
||
void ovs_strzcpy(char *dst, const char *src, size_t size);
|
||
|
||
OVS_NO_RETURN void ovs_abort(int err_no, const char *format, ...)
|
||
OVS_PRINTF_FORMAT(2, 3);
|
||
OVS_NO_RETURN void ovs_abort_valist(int err_no, const char *format, va_list)
|
||
OVS_PRINTF_FORMAT(2, 0);
|
||
OVS_NO_RETURN void ovs_fatal(int err_no, const char *format, ...)
|
||
OVS_PRINTF_FORMAT(2, 3);
|
||
OVS_NO_RETURN void ovs_fatal_valist(int err_no, const char *format, va_list)
|
||
OVS_PRINTF_FORMAT(2, 0);
|
||
void ovs_error(int err_no, const char *format, ...) OVS_PRINTF_FORMAT(2, 3);
|
||
void ovs_error_valist(int err_no, const char *format, va_list)
|
||
OVS_PRINTF_FORMAT(2, 0);
|
||
const char *ovs_retval_to_string(int);
|
||
const char *ovs_strerror(int);
|
||
void ovs_hex_dump(FILE *, const void *, size_t, uintptr_t offset, bool ascii);
|
||
|
||
bool str_to_int(const char *, int base, int *);
|
||
bool str_to_long(const char *, int base, long *);
|
||
bool str_to_llong(const char *, int base, long long *);
|
||
bool str_to_uint(const char *, int base, unsigned int *);
|
||
|
||
bool ovs_scan(const char *s, const char *format, ...) OVS_SCANF_FORMAT(2, 3);
|
||
bool ovs_scan_len(const char *s, int *n, const char *format, ...);
|
||
|
||
bool str_to_double(const char *, double *);
|
||
|
||
int hexit_value(int c);
|
||
uintmax_t hexits_value(const char *s, size_t n, bool *ok);
|
||
|
||
int parse_int_string(const char *s, uint8_t *valuep, int field_width,
|
||
char **tail);
|
||
|
||
const char *english_list_delimiter(size_t index, size_t total);
|
||
|
||
char *get_cwd(void);
|
||
#ifndef _WIN32
|
||
char *dir_name(const char *file_name);
|
||
char *base_name(const char *file_name);
|
||
#endif
|
||
char *abs_file_name(const char *dir, const char *file_name);
|
||
|
||
char *follow_symlinks(const char *filename);
|
||
|
||
void ignore(bool x OVS_UNUSED);
|
||
|
||
/* Bitwise tests. */
|
||
|
||
/* Returns the number of trailing 0-bits in 'n'. Undefined if 'n' == 0. */
|
||
#if __GNUC__ >= 4
|
||
static inline int
|
||
raw_ctz(uint64_t n)
|
||
{
|
||
/* With GCC 4.7 on 32-bit x86, if a 32-bit integer is passed as 'n', using
|
||
* a plain __builtin_ctzll() here always generates an out-of-line function
|
||
* call. The test below helps it to emit a single 'bsf' instruction. */
|
||
return (__builtin_constant_p(n <= UINT32_MAX) && n <= UINT32_MAX
|
||
? __builtin_ctz(n)
|
||
: __builtin_ctzll(n));
|
||
}
|
||
|
||
static inline int
|
||
raw_clz64(uint64_t n)
|
||
{
|
||
return __builtin_clzll(n);
|
||
}
|
||
#elif _MSC_VER
|
||
static inline int
|
||
raw_ctz(uint64_t n)
|
||
{
|
||
#ifdef _WIN64
|
||
unsigned long r = 0;
|
||
_BitScanForward64(&r, n);
|
||
return r;
|
||
#else
|
||
unsigned long low = n, high, r = 0;
|
||
if (_BitScanForward(&r, low)) {
|
||
return r;
|
||
}
|
||
high = n >> 32;
|
||
_BitScanForward(&r, high);
|
||
return r + 32;
|
||
#endif
|
||
}
|
||
|
||
static inline int
|
||
raw_clz64(uint64_t n)
|
||
{
|
||
#ifdef _WIN64
|
||
unsigned long r = 0;
|
||
_BitScanReverse64(&r, n);
|
||
return 63 - r;
|
||
#else
|
||
unsigned long low, high = n >> 32, r = 0;
|
||
if (_BitScanReverse(&r, high)) {
|
||
return 31 - r;
|
||
}
|
||
low = n;
|
||
_BitScanReverse(&r, low);
|
||
return 63 - r;
|
||
#endif
|
||
}
|
||
#else
|
||
/* Defined in util.c. */
|
||
int raw_ctz(uint64_t n);
|
||
int raw_clz64(uint64_t n);
|
||
#endif
|
||
|
||
/* Returns the number of trailing 0-bits in 'n', or 32 if 'n' is 0. */
|
||
static inline int
|
||
ctz32(uint32_t n)
|
||
{
|
||
return n ? raw_ctz(n) : 32;
|
||
}
|
||
|
||
/* Returns the number of trailing 0-bits in 'n', or 64 if 'n' is 0. */
|
||
static inline int
|
||
ctz64(uint64_t n)
|
||
{
|
||
return n ? raw_ctz(n) : 64;
|
||
}
|
||
|
||
/* Returns the number of leading 0-bits in 'n', or 32 if 'n' is 0. */
|
||
static inline int
|
||
clz32(uint32_t n)
|
||
{
|
||
return n ? raw_clz64(n) - 32 : 32;
|
||
}
|
||
|
||
/* Returns the number of leading 0-bits in 'n', or 64 if 'n' is 0. */
|
||
static inline int
|
||
clz64(uint64_t n)
|
||
{
|
||
return n ? raw_clz64(n) : 64;
|
||
}
|
||
|
||
/* Given a word 'n', calculates floor(log_2('n')). This is equivalent
|
||
* to finding the bit position of the most significant one bit in 'n'. It is
|
||
* an error to call this function with 'n' == 0. */
|
||
static inline int
|
||
log_2_floor(uint64_t n)
|
||
{
|
||
return 63 - raw_clz64(n);
|
||
}
|
||
|
||
/* Given a word 'n', calculates ceil(log_2('n')). It is an error to
|
||
* call this function with 'n' == 0. */
|
||
static inline int
|
||
log_2_ceil(uint64_t n)
|
||
{
|
||
return log_2_floor(n) + !is_pow2(n);
|
||
}
|
||
|
||
/* unsigned int count_1bits(uint64_t x):
|
||
*
|
||
* Returns the number of 1-bits in 'x', between 0 and 64 inclusive. */
|
||
#if UINTPTR_MAX == UINT64_MAX
|
||
static inline unsigned int
|
||
count_1bits(uint64_t x)
|
||
{
|
||
#if __GNUC__ >= 4 && __POPCNT__
|
||
return __builtin_popcountll(x);
|
||
#else
|
||
/* This portable implementation is the fastest one we know of for 64
|
||
* bits, and about 3x faster than GCC 4.7 __builtin_popcountll(). */
|
||
const uint64_t h55 = UINT64_C(0x5555555555555555);
|
||
const uint64_t h33 = UINT64_C(0x3333333333333333);
|
||
const uint64_t h0F = UINT64_C(0x0F0F0F0F0F0F0F0F);
|
||
const uint64_t h01 = UINT64_C(0x0101010101010101);
|
||
x -= (x >> 1) & h55; /* Count of each 2 bits in-place. */
|
||
x = (x & h33) + ((x >> 2) & h33); /* Count of each 4 bits in-place. */
|
||
x = (x + (x >> 4)) & h0F; /* Count of each 8 bits in-place. */
|
||
return (x * h01) >> 56; /* Sum of all bytes. */
|
||
#endif
|
||
}
|
||
#else /* Not 64-bit. */
|
||
#if __GNUC__ >= 4 && __POPCNT__
|
||
static inline unsigned int
|
||
count_1bits_32__(uint32_t x)
|
||
{
|
||
return __builtin_popcount(x);
|
||
}
|
||
#else
|
||
#define NEED_COUNT_1BITS_8 1
|
||
extern const uint8_t count_1bits_8[256];
|
||
static inline unsigned int
|
||
count_1bits_32__(uint32_t x)
|
||
{
|
||
/* This portable implementation is the fastest one we know of for 32 bits,
|
||
* and faster than GCC __builtin_popcount(). */
|
||
return (count_1bits_8[x & 0xff] +
|
||
count_1bits_8[(x >> 8) & 0xff] +
|
||
count_1bits_8[(x >> 16) & 0xff] +
|
||
count_1bits_8[x >> 24]);
|
||
}
|
||
#endif
|
||
static inline unsigned int
|
||
count_1bits(uint64_t x)
|
||
{
|
||
return count_1bits_32__(x) + count_1bits_32__(x >> 32);
|
||
}
|
||
#endif
|
||
|
||
/* Returns the rightmost 1-bit in 'x' (e.g. 01011000 => 00001000), or 0 if 'x'
|
||
* is 0. */
|
||
static inline uintmax_t
|
||
rightmost_1bit(uintmax_t x)
|
||
{
|
||
return x & -x;
|
||
}
|
||
|
||
/* Returns 'x' with its rightmost 1-bit changed to a zero (e.g. 01011000 =>
|
||
* 01010000), or 0 if 'x' is 0. */
|
||
static inline uintmax_t
|
||
zero_rightmost_1bit(uintmax_t x)
|
||
{
|
||
return x & (x - 1);
|
||
}
|
||
|
||
/* Returns the index of the rightmost 1-bit in 'x' (e.g. 01011000 => 3), or an
|
||
* undefined value if 'x' is 0. */
|
||
static inline int
|
||
rightmost_1bit_idx(uint64_t x)
|
||
{
|
||
return ctz64(x);
|
||
}
|
||
|
||
/* Returns the index of the leftmost 1-bit in 'x' (e.g. 01011000 => 6), or an
|
||
* undefined value if 'x' is 0. */
|
||
static inline uint32_t
|
||
leftmost_1bit_idx(uint64_t x)
|
||
{
|
||
return log_2_floor(x);
|
||
}
|
||
|
||
/* Return a ovs_be32 prefix in network byte order with 'plen' highest bits set.
|
||
* Shift with 32 is undefined behavior, but we rather use 64-bit shift than
|
||
* compare. */
|
||
static inline ovs_be32 be32_prefix_mask(int plen)
|
||
{
|
||
return htonl((uint64_t)UINT32_MAX << (32 - plen));
|
||
}
|
||
|
||
bool is_all_zeros(const void *, size_t);
|
||
bool is_all_ones(const void *, size_t);
|
||
void bitwise_copy(const void *src, unsigned int src_len, unsigned int src_ofs,
|
||
void *dst, unsigned int dst_len, unsigned int dst_ofs,
|
||
unsigned int n_bits);
|
||
void bitwise_zero(void *dst_, unsigned int dst_len, unsigned dst_ofs,
|
||
unsigned int n_bits);
|
||
void bitwise_one(void *dst_, unsigned int dst_len, unsigned dst_ofs,
|
||
unsigned int n_bits);
|
||
bool bitwise_is_all_zeros(const void *, unsigned int len, unsigned int ofs,
|
||
unsigned int n_bits);
|
||
unsigned int bitwise_scan(const void *, unsigned int len,
|
||
bool target, unsigned int start, unsigned int end);
|
||
int bitwise_rscan(const void *, unsigned int len, bool target,
|
||
int start, int end);
|
||
void bitwise_put(uint64_t value,
|
||
void *dst, unsigned int dst_len, unsigned int dst_ofs,
|
||
unsigned int n_bits);
|
||
uint64_t bitwise_get(const void *src, unsigned int src_len,
|
||
unsigned int src_ofs, unsigned int n_bits);
|
||
bool bitwise_get_bit(const void *src, unsigned int len, unsigned int ofs);
|
||
void bitwise_put0(void *dst, unsigned int len, unsigned int ofs);
|
||
void bitwise_put1(void *dst, unsigned int len, unsigned int ofs);
|
||
void bitwise_put_bit(void *dst, unsigned int len, unsigned int ofs, bool);
|
||
void bitwise_toggle_bit(void *dst, unsigned int len, unsigned int ofs);
|
||
|
||
/* Returns non-zero if the parameters have equal value. */
|
||
static inline int
|
||
ovs_u128_equals(const ovs_u128 a, const ovs_u128 b)
|
||
{
|
||
return (a.u64.hi == b.u64.hi) && (a.u64.lo == b.u64.lo);
|
||
}
|
||
|
||
/* Returns true if 'val' is 0. */
|
||
static inline bool
|
||
ovs_u128_is_zero(const ovs_u128 val)
|
||
{
|
||
return !(val.u64.hi || val.u64.lo);
|
||
}
|
||
|
||
/* Returns true if 'val' is all ones. */
|
||
static inline bool
|
||
ovs_u128_is_ones(const ovs_u128 val)
|
||
{
|
||
return ovs_u128_equals(val, OVS_U128_MAX);
|
||
}
|
||
|
||
/* Returns non-zero if the parameters have equal value. */
|
||
static inline int
|
||
ovs_be128_equals(const ovs_be128 a, const ovs_be128 b)
|
||
{
|
||
return (a.be64.hi == b.be64.hi) && (a.be64.lo == b.be64.lo);
|
||
}
|
||
|
||
/* Returns true if 'val' is 0. */
|
||
static inline bool
|
||
ovs_be128_is_zero(const ovs_be128 val)
|
||
{
|
||
return !(val.be64.hi || val.be64.lo);
|
||
}
|
||
|
||
static inline ovs_u128
|
||
ovs_u128_and(const ovs_u128 a, const ovs_u128 b)
|
||
{
|
||
ovs_u128 dst;
|
||
|
||
dst.u64.hi = a.u64.hi & b.u64.hi;
|
||
dst.u64.lo = a.u64.lo & b.u64.lo;
|
||
|
||
return dst;
|
||
}
|
||
|
||
void xsleep(unsigned int seconds);
|
||
|
||
bool is_stdout_a_tty(void);
|
||
|
||
#ifdef _WIN32
|
||
|
||
char *ovs_format_message(int error);
|
||
char *ovs_lasterror_to_string(void);
|
||
int ftruncate(int fd, off_t length);
|
||
#endif
|
||
|
||
#ifdef __cplusplus
|
||
}
|
||
#endif
|
||
|
||
#endif /* util.h */
|