1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
|
/*
* 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. */
#if defined(__ppc64__) || defined(__powerpc64__) || \
defined(__PPC64__) || defined(_ARCH_PPC64)
/* http://lists.llvm.org/pipermail/llvm-dev/2017-March/110982.html */
#define CACHE_LINE_SIZE 128
#else
#define CACHE_LINE_SIZE 64
#endif
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()
/* Joins two token expanding the arguments if they are macros.
*
* For token concatenation the circumlocution is needed for the
* expansion. */
#define OVS_JOIN2(X, Y) X##Y
#define OVS_JOIN(X, Y) OVS_JOIN2(X, Y)
/* 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_all_memory_locked(void);
bool memory_all_locked(void);
OVS_NO_RETURN void out_of_memory(void);
/* Allocation wrappers that abort if memory is exhausted. */
OVS_RETURNS_NONNULL void *xmalloc(size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *xcalloc(size_t, size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *xzalloc(size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *xrealloc(void *, size_t);
OVS_RETURNS_NONNULL void *xmemdup(const void *, size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL char *xmemdup0(const char *, size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL char *xstrdup(const char *) MALLOC_LIKE;
char *nullable_xstrdup(const char *) MALLOC_LIKE;
bool nullable_string_is_equal(const char *a, const char *b);
OVS_RETURNS_NONNULL char *xasprintf(const char *format, ...)
OVS_PRINTF_FORMAT(1, 2) MALLOC_LIKE;
OVS_RETURNS_NONNULL char *xvasprintf(const char *format, va_list)
OVS_PRINTF_FORMAT(1, 0) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *x2nrealloc(void *p, size_t *n, size_t s);
/* Allocation wrappers for specialized situations where coverage counters
* cannot be used. */
OVS_RETURNS_NONNULL void *xmalloc__(size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *xcalloc__(size_t, size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *xzalloc__(size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL void *xrealloc__(void *, size_t);
OVS_RETURNS_NONNULL void *xmalloc_cacheline(size_t) MALLOC_LIKE;
OVS_RETURNS_NONNULL 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);
OVS_RETURNS_NONNULL void *xmalloc_pagealign(size_t) MALLOC_LIKE;
void free_pagealign(void *);
OVS_RETURNS_NONNULL void *xmalloc_size_align(size_t, size_t) MALLOC_LIKE;
void free_size_align(void *);
/* 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 or_bytes(void *dst, const void *src, size_t n);
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);
void xnanosleep_no_quiesce(uint64_t nanoseconds);
void set_timer_resolution(unsigned long 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
#ifdef __linux__
bool ovs_kernel_is_version_or_newer(int target_major, int target_minor);
#endif
#endif /* util.h */
|