mirror of
https://github.com/openvswitch/ovs
synced 2025-08-29 05:18:13 +00:00
Userspace datapath needs to traverse through miniflow values many times. In this process, 'count_1bits' operation for 'Flowmap' significantly impact performance. On arm, this function was defined by portable implementation because gcc for arm does not support popcnt feature. But in the aarch64, VCNT neon instruction can accelerate "count_1bits". From Gcc-7, the built-in function is implemented with neon intruction. In this patch, count_1bits function will be impelmented with gcc built-in from gcc-7 on, and with neon intrinsics in gcc-6. Performance test was run in two aarch64 machines. In the NIC2NIC test, one tuple dpcls lookup case achieves around 4% throughput improvement and 10(average) tuples case achieves around 5% improvement. Tested-by: Malvika Gupta <malvika.gupta@arm.com> Signed-off-by: Yanqin Wei <Yanqin.Wei@arm.com> Signed-off-by: Ben Pfaff <blp@ovn.org>
583 lines
17 KiB
C++
583 lines
17 KiB
C++
/*
|
||
* Copyright (c) 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017 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 <sys/types.h>
|
||
#include <netinet/in.h>
|
||
#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"
|
||
#if defined(__aarch64__) && __GNUC__ >= 6
|
||
#include <arm_neon.h>
|
||
#endif
|
||
|
||
extern char *program_name;
|
||
|
||
#define __ARRAY_SIZE_NOCHECK(ARRAY) (sizeof(ARRAY) / sizeof((ARRAY)[0]))
|
||
#if __GNUC__ && !defined(__cplusplus)
|
||
/* 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))
|
||
#elif defined(__cplusplus)
|
||
#define __ARRAY_SIZE(ARRAY) ( \
|
||
0 * sizeof(reinterpret_cast<const ::Bad_arg_to_ARRAY_SIZE *>(ARRAY)) + \
|
||
0 * sizeof(::Bad_arg_to_ARRAY_SIZE::check_type((ARRAY), &(ARRAY))) + \
|
||
sizeof(ARRAY) / sizeof((ARRAY)[0]) )
|
||
|
||
struct Bad_arg_to_ARRAY_SIZE {
|
||
class Is_pointer;
|
||
class Is_array {};
|
||
template <typename T>
|
||
static Is_pointer check_type(const T *, const T * const *);
|
||
static Is_array check_type(const void *, const void *);
|
||
};
|
||
#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));
|
||
|
||
/* Cacheline marking is typically done using zero-sized array.
|
||
* However MSVC doesn't like zero-sized array in struct/union.
|
||
* C4200: https://msdn.microsoft.com/en-us/library/79wf64bc.aspx
|
||
*/
|
||
typedef uint8_t OVS_CACHE_LINE_MARKER[1];
|
||
|
||
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
|
||
|
||
/* Comparisons for ints with modular arithmetic */
|
||
#define INT_MOD_LT(a,b) ((int) ((a)-(b)) < 0)
|
||
#define INT_MOD_LEQ(a,b) ((int) ((a)-(b)) <= 0)
|
||
#define INT_MOD_GT(a,b) ((int) ((a)-(b)) > 0)
|
||
#define INT_MOD_GEQ(a,b) ((int) ((a)-(b)) >= 0)
|
||
|
||
#define INT_MOD_MIN(a, b) ((INT_MOD_LT(a, b)) ? (a) : (b))
|
||
#define INT_MOD_MAX(a, b) ((INT_MOD_GT(a, b)) ? (a) : (b))
|
||
|
||
#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 *);
|
||
|
||
unsigned int get_page_size(void);
|
||
long long int get_boot_time(void);
|
||
|
||
void ctl_timeout_setup(unsigned int secs);
|
||
|
||
void ovs_print_version(uint8_t min_ofp, uint8_t max_ofp);
|
||
|
||
void set_memory_locked(void);
|
||
bool memory_locked(void);
|
||
|
||
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;
|
||
bool nullable_string_is_equal(const char *a, const char *b);
|
||
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);
|
||
|
||
int string_ends_with(const char *str, const char *suffix);
|
||
|
||
/* The C standards say that neither the 'dst' nor 'src' argument to
|
||
* memcpy() may be null, even if 'n' is zero. This wrapper tolerates
|
||
* the null case. */
|
||
static inline void
|
||
nullable_memcpy(void *dst, const void *src, size_t n)
|
||
{
|
||
if (n) {
|
||
memcpy(dst, src, n);
|
||
}
|
||
}
|
||
|
||
/* The C standards say that the 'dst' argument to memset may not be
|
||
* null, even if 'n' is zero. This wrapper tolerates the null case. */
|
||
static inline void
|
||
nullable_memset(void *dst, int c, size_t n)
|
||
{
|
||
if (n) {
|
||
memset(dst, c, n);
|
||
}
|
||
}
|
||
|
||
/* Copy string SRC to DST, but no more bytes than the shorter of DST or SRC.
|
||
* DST and SRC must both be char arrays, not pointers, and with GNU C, this
|
||
* raises a compiler error if either DST or SRC is a pointer instead of an
|
||
* array. */
|
||
#define ovs_strlcpy_arrays(DST, SRC) \
|
||
ovs_strlcpy(DST, SRC, MIN(ARRAY_SIZE(DST), ARRAY_SIZE(SRC)))
|
||
|
||
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_llong_with_tail(const char *, char **, int base, long long *);
|
||
bool str_to_uint(const char *, int base, unsigned int *);
|
||
bool str_to_ullong(const char *, int base, unsigned long long *);
|
||
bool str_to_llong_range(const char *, int base, long long *, long long *);
|
||
|
||
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(unsigned char 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);
|
||
bool is_file_name_absolute(const char *);
|
||
|
||
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__) || (defined(__aarch64__) && __GNUC__ >= 7)
|
||
return __builtin_popcountll(x);
|
||
#elif defined(__aarch64__) && __GNUC__ >= 6
|
||
return vaddv_u8(vcnt_u8(vcreate_u8(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));
|
||
}
|
||
|
||
/* Returns true if the 1-bits in 'super' are a superset of the 1-bits in 'sub',
|
||
* false otherwise. */
|
||
static inline bool
|
||
uint_is_superset(uintmax_t super, uintmax_t sub)
|
||
{
|
||
return (super & sub) == sub;
|
||
}
|
||
|
||
/* Returns true if the 1-bits in 'super' are a superset of the 1-bits in 'sub',
|
||
* false otherwise. */
|
||
static inline bool
|
||
be16_is_superset(ovs_be16 super, ovs_be16 sub)
|
||
{
|
||
return (super & sub) == sub;
|
||
}
|
||
|
||
/* Returns true if the 1-bits in 'super' are a superset of the 1-bits in 'sub',
|
||
* false otherwise. */
|
||
static inline bool
|
||
be32_is_superset(ovs_be32 super, ovs_be32 sub)
|
||
{
|
||
return (super & sub) == sub;
|
||
}
|
||
|
||
/* Returns true if the 1-bits in 'super' are a superset of the 1-bits in 'sub',
|
||
* false otherwise. */
|
||
static inline bool
|
||
be64_is_superset(ovs_be64 super, ovs_be64 sub)
|
||
{
|
||
return (super & sub) == sub;
|
||
}
|
||
|
||
bool is_all_zeros(const void *, size_t);
|
||
bool is_all_ones(const void *, size_t);
|
||
bool is_all_byte(const void *, size_t, uint8_t byte);
|
||
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;
|
||
}
|
||
|
||
static inline bool
|
||
ovs_be128_is_superset(ovs_be128 super, ovs_be128 sub)
|
||
{
|
||
return (be64_is_superset(super.be64.hi, sub.be64.hi) &&
|
||
be64_is_superset(super.be64.lo, sub.be64.lo));
|
||
}
|
||
|
||
static inline bool
|
||
ovs_u128_is_superset(ovs_u128 super, ovs_u128 sub)
|
||
{
|
||
return (uint_is_superset(super.u64.hi, sub.u64.hi) &&
|
||
uint_is_superset(super.u64.lo, sub.u64.lo));
|
||
}
|
||
|
||
void xsleep(unsigned int seconds);
|
||
void xnanosleep(uint64_t nanoseconds);
|
||
|
||
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 */
|