2011-07-22 10:20:52 -07:00
|
|
|
|
/*
|
2013-06-25 09:22:11 -07:00
|
|
|
|
* Copyright (c) 2011, 2012, 2013 Nicira, Inc.
|
2011-07-22 10:20:52 -07:00
|
|
|
|
*
|
|
|
|
|
* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
|
2013-01-16 16:03:03 -08:00
|
|
|
|
#include <getopt.h>
|
2011-07-22 10:20:52 -07:00
|
|
|
|
#include <inttypes.h>
|
2011-08-17 10:55:15 -07:00
|
|
|
|
#include <limits.h>
|
2011-07-22 10:20:52 -07:00
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
2012-01-17 16:38:23 -08:00
|
|
|
|
#include "byte-order.h"
|
2012-07-30 09:35:32 -07:00
|
|
|
|
#include "command-line.h"
|
2011-07-22 10:20:52 -07:00
|
|
|
|
#include "random.h"
|
|
|
|
|
#include "util.h"
|
2013-01-16 16:03:03 -08:00
|
|
|
|
#include "vlog.h"
|
2011-07-22 10:20:52 -07:00
|
|
|
|
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
#undef NDEBUG
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
2011-07-22 10:20:52 -07:00
|
|
|
|
static void
|
2011-08-17 10:55:15 -07:00
|
|
|
|
check_log_2_floor(uint32_t x, int n)
|
2011-07-22 10:20:52 -07:00
|
|
|
|
{
|
|
|
|
|
if (log_2_floor(x) != n) {
|
|
|
|
|
fprintf(stderr, "log_2_floor(%"PRIu32") is %d but should be %d\n",
|
|
|
|
|
x, log_2_floor(x), n);
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-30 09:35:32 -07:00
|
|
|
|
static void
|
|
|
|
|
test_log_2_floor(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
int n;
|
|
|
|
|
|
|
|
|
|
for (n = 0; n < 32; n++) {
|
|
|
|
|
/* Check minimum x such that f(x) == n. */
|
|
|
|
|
check_log_2_floor(1 << n, n);
|
|
|
|
|
|
|
|
|
|
/* Check maximum x such that f(x) == n. */
|
|
|
|
|
check_log_2_floor((1 << n) | ((1 << n) - 1), n);
|
|
|
|
|
|
|
|
|
|
/* Check a random value in the middle. */
|
|
|
|
|
check_log_2_floor((random_uint32() & ((1 << n) - 1)) | (1 << n), n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* log_2_floor(0) is undefined, so don't check it. */
|
|
|
|
|
}
|
|
|
|
|
|
2011-08-17 10:55:15 -07:00
|
|
|
|
static void
|
2013-12-03 13:41:41 -08:00
|
|
|
|
check_ctz32(uint32_t x, int n)
|
2011-08-17 10:55:15 -07:00
|
|
|
|
{
|
2013-12-03 13:41:41 -08:00
|
|
|
|
if (ctz32(x) != n) {
|
|
|
|
|
fprintf(stderr, "ctz32(%"PRIu32") is %d but should be %d\n",
|
|
|
|
|
x, ctz32(x), n);
|
2011-08-17 10:55:15 -07:00
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2013-11-18 09:28:44 -08:00
|
|
|
|
static void
|
|
|
|
|
check_ctz64(uint64_t x, int n)
|
|
|
|
|
{
|
|
|
|
|
if (ctz64(x) != n) {
|
|
|
|
|
fprintf(stderr, "ctz64(%"PRIu64") is %d but should be %d\n",
|
|
|
|
|
x, ctz64(x), n);
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-30 09:35:32 -07:00
|
|
|
|
static void
|
|
|
|
|
test_ctz(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
int n;
|
|
|
|
|
|
|
|
|
|
for (n = 0; n < 32; n++) {
|
|
|
|
|
/* Check minimum x such that f(x) == n. */
|
2013-12-03 13:41:41 -08:00
|
|
|
|
check_ctz32(1 << n, n);
|
2012-07-30 09:35:32 -07:00
|
|
|
|
|
|
|
|
|
/* Check maximum x such that f(x) == n. */
|
2013-12-03 13:41:41 -08:00
|
|
|
|
check_ctz32(UINT32_MAX << n, n);
|
2012-07-30 09:35:32 -07:00
|
|
|
|
|
|
|
|
|
/* Check a random value in the middle. */
|
2013-12-03 13:41:41 -08:00
|
|
|
|
check_ctz32((random_uint32() | 1) << n, n);
|
2012-07-30 09:35:32 -07:00
|
|
|
|
}
|
|
|
|
|
|
2013-11-18 09:28:44 -08:00
|
|
|
|
|
|
|
|
|
for (n = 0; n < 64; n++) {
|
|
|
|
|
/* Check minimum x such that f(x) == n. */
|
|
|
|
|
check_ctz64(UINT64_C(1) << n, n);
|
|
|
|
|
|
|
|
|
|
/* Check maximum x such that f(x) == n. */
|
|
|
|
|
check_ctz64(UINT64_MAX << n, n);
|
|
|
|
|
|
|
|
|
|
/* Check a random value in the middle. */
|
|
|
|
|
check_ctz64((random_uint64() | UINT64_C(1)) << n, n);
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-30 09:35:32 -07:00
|
|
|
|
/* Check ctz(0). */
|
2013-12-03 13:41:41 -08:00
|
|
|
|
check_ctz32(0, 32);
|
2013-11-18 09:28:44 -08:00
|
|
|
|
check_ctz64(0, 64);
|
2012-07-30 09:35:32 -07:00
|
|
|
|
}
|
|
|
|
|
|
2013-12-03 13:41:41 -08:00
|
|
|
|
static void
|
|
|
|
|
check_clz32(uint32_t x, int n)
|
|
|
|
|
{
|
|
|
|
|
if (clz32(x) != n) {
|
|
|
|
|
fprintf(stderr, "clz32(%"PRIu32") is %d but should be %d\n",
|
|
|
|
|
x, clz32(x), n);
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
check_clz64(uint64_t x, int n)
|
|
|
|
|
{
|
|
|
|
|
if (clz64(x) != n) {
|
|
|
|
|
fprintf(stderr, "clz64(%"PRIu64") is %d but should be %d\n",
|
|
|
|
|
x, clz64(x), n);
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_clz(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
int n;
|
|
|
|
|
|
|
|
|
|
for (n = 0; n < 32; n++) {
|
|
|
|
|
/* Check minimum x such that f(x) == n. */
|
|
|
|
|
check_clz32((1u << 31) >> n, n);
|
|
|
|
|
|
|
|
|
|
/* Check maximum x such that f(x) == n. */
|
|
|
|
|
check_clz32(UINT32_MAX >> n, n);
|
|
|
|
|
|
|
|
|
|
/* Check a random value in the middle. */
|
|
|
|
|
check_clz32((random_uint32() | 1u << 31) >> n, n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (n = 0; n < 64; n++) {
|
|
|
|
|
/* Check minimum x such that f(x) == n. */
|
|
|
|
|
check_clz64((UINT64_C(1) << 63) >> n, n);
|
|
|
|
|
|
|
|
|
|
/* Check maximum x such that f(x) == n. */
|
|
|
|
|
check_clz64(UINT64_MAX >> n, n);
|
|
|
|
|
|
|
|
|
|
/* Check a random value in the middle. */
|
|
|
|
|
check_clz64((random_uint64() | UINT64_C(1) << 63) >> n, n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Check clz(0). */
|
|
|
|
|
check_clz32(0, 32);
|
|
|
|
|
check_clz64(0, 64);
|
|
|
|
|
}
|
|
|
|
|
|
2013-04-25 11:18:10 -07:00
|
|
|
|
/* Returns a random number in the range 'min'...'max' inclusive. */
|
|
|
|
|
static uint32_t
|
|
|
|
|
random_in_range(uint32_t min, uint32_t max)
|
|
|
|
|
{
|
|
|
|
|
return min == max ? min : min + random_range(max - min + 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
check_rup2(uint32_t x, int n)
|
|
|
|
|
{
|
|
|
|
|
uint32_t rup2 = ROUND_UP_POW2(x);
|
|
|
|
|
if (rup2 != n) {
|
|
|
|
|
fprintf(stderr, "ROUND_UP_POW2(%#"PRIx32") is %#"PRIx32" "
|
|
|
|
|
"but should be %#"PRIx32"\n", x, rup2, n);
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_round_up_pow2(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
int n;
|
|
|
|
|
|
|
|
|
|
for (n = 0; n < 32; n++) {
|
|
|
|
|
/* Min, max value for which ROUND_UP_POW2 should yield (1 << n). */
|
|
|
|
|
uint32_t min = ((1u << n) >> 1) + 1;
|
|
|
|
|
uint32_t max = 1u << n;
|
|
|
|
|
|
|
|
|
|
check_rup2(min, 1u << n);
|
|
|
|
|
check_rup2(max, 1u << n);
|
|
|
|
|
check_rup2(random_in_range(min, max), 1u << n);
|
|
|
|
|
}
|
|
|
|
|
check_rup2(0, 0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
check_rdp2(uint32_t x, int n)
|
|
|
|
|
{
|
|
|
|
|
uint32_t rdp2 = ROUND_DOWN_POW2(x);
|
|
|
|
|
if (rdp2 != n) {
|
|
|
|
|
fprintf(stderr, "ROUND_DOWN_POW2(%#"PRIx32") is %#"PRIx32" "
|
|
|
|
|
"but should be %#"PRIx32"\n", x, rdp2, n);
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_round_down_pow2(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
int n;
|
|
|
|
|
|
|
|
|
|
for (n = 0; n < 32; n++) {
|
|
|
|
|
/* Min, max value for which ROUND_DOWN_POW2 should yield (1 << n). */
|
|
|
|
|
uint32_t min = 1u << n;
|
|
|
|
|
uint32_t max = ((1u << n) << 1) - 1;
|
|
|
|
|
|
|
|
|
|
check_rdp2(min, 1u << n);
|
|
|
|
|
check_rdp2(max, 1u << n);
|
|
|
|
|
check_rdp2(random_in_range(min, max), 1u << n);
|
|
|
|
|
}
|
|
|
|
|
check_rdp2(0, 0);
|
|
|
|
|
}
|
|
|
|
|
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
static void
|
2013-11-18 09:28:44 -08:00
|
|
|
|
shuffle(uint64_t *p, size_t n)
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
{
|
|
|
|
|
for (; n > 1; n--, p++) {
|
2013-11-18 09:28:44 -08:00
|
|
|
|
uint64_t *q = &p[random_range(n)];
|
|
|
|
|
uint64_t tmp = *p;
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
*p = *q;
|
|
|
|
|
*q = tmp;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2013-11-19 10:59:10 -08:00
|
|
|
|
check_count_1bits(uint64_t x, int n)
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
{
|
2013-11-19 10:59:10 -08:00
|
|
|
|
if (count_1bits(x) != n) {
|
|
|
|
|
fprintf(stderr, "count_1bits(%#"PRIx64") is %d but should be %d\n",
|
|
|
|
|
x, count_1bits(x), n);
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2013-11-19 10:59:10 -08:00
|
|
|
|
test_count_1bits(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
{
|
2013-11-18 09:28:44 -08:00
|
|
|
|
uint64_t bits[64];
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < ARRAY_SIZE(bits); i++) {
|
2013-11-18 09:28:44 -08:00
|
|
|
|
bits[i] = UINT64_C(1) << i;
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
}
|
|
|
|
|
|
2013-11-19 10:59:10 -08:00
|
|
|
|
check_count_1bits(0, 0);
|
2013-11-18 09:28:44 -08:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < 1000; i++) {
|
|
|
|
|
uint64_t x = 0;
|
|
|
|
|
int j;
|
|
|
|
|
|
|
|
|
|
shuffle(bits, ARRAY_SIZE(bits));
|
|
|
|
|
for (j = 0; j < 64; j++) {
|
|
|
|
|
x |= bits[j];
|
2013-11-19 10:59:10 -08:00
|
|
|
|
check_count_1bits(x, j + 1);
|
2013-11-18 09:28:44 -08:00
|
|
|
|
}
|
|
|
|
|
assert(x == UINT64_MAX);
|
|
|
|
|
|
|
|
|
|
shuffle(bits, ARRAY_SIZE(bits));
|
|
|
|
|
for (j = 63; j >= 0; j--) {
|
|
|
|
|
x &= ~bits[j];
|
2013-11-19 10:59:10 -08:00
|
|
|
|
check_count_1bits(x, j);
|
2013-11-18 09:28:44 -08:00
|
|
|
|
}
|
|
|
|
|
assert(x == 0);
|
|
|
|
|
}
|
util: New function popcount().
This is the fastest portable implementation among the ones below, as
measured with GCC 4.4 on a Xeon X3430. The measeured times were, in
seconds:
popcount1 25.6
popcount2 6.9 (but is not portable)
popcount3 31.4
popcount4 25.6
popcount5 61.6 (and is buggy)
popcount6 64.6
popcount7 32.3
popcount8 11.2
int
popcount1(unsigned int x)
{
return __builtin_popcount(x);
}
int
popcount2(unsigned int x)
{
unsigned int y;
asm("popcnt %1, %0" : "=r" (y) : "g" (x));
return y;
}
int
popcount3(unsigned int x)
{
unsigned int n;
n = (x >> 1) & 033333333333;
x -= n;
n = (n >> 1) & 033333333333;
x -= n;
x = (x + (x >> 3)) & 030707070707;
return x % 63;
}
int
popcount4(unsigned int x)
{
x -= (x >> 1) & 0x55555555;
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0f0f0f0f;
x += x >> 8;
x += x >> 16;
return x & 0x3f;
}
int
popcount5(unsigned int x)
{
int n;
n = 0;
while (x) {
if (x & 0xf) {
n += ((0xe9949440 >> (x & 0xf)) & 3) + 1;
}
x >>= 4;
}
return n;
}
int
popcount6(unsigned int x)
{
int n;
n = 0;
while (x) {
n += (0xe994 >> (x & 7)) & 3;
x >>= 3;
}
return n;
}
int
popcount7(unsigned int x)
{
static const int table[16] = {
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4
};
return (table[x & 0xf]
+ table[(x >> 4) & 0xf]
+ table[(x >> 8) & 0xf]
+ table[(x >> 12) & 0xf]
+ table[(x >> 16) & 0xf]
+ table[(x >> 20) & 0xf]
+ table[(x >> 24) & 0xf]
+ table[x >> 28]);
}
static int
popcount8(unsigned int x)
{
((((X) & (1 << 0)) != 0) + \
(((X) & (1 << 1)) != 0) + \
(((X) & (1 << 2)) != 0) + \
(((X) & (1 << 3)) != 0) + \
(((X) & (1 << 4)) != 0) + \
(((X) & (1 << 5)) != 0) + \
(((X) & (1 << 6)) != 0) + \
(((X) & (1 << 7)) != 0))
static const uint8_t popcount8[256] = {
INIT64(0), INIT64(64), INIT64(128), INIT64(192)
};
return (popcount8[x & 0xff] +
popcount8[(x >> 8) & 0xff] +
popcount8[(x >> 16) & 0xff] +
popcount8[x >> 24]);
}
int
main(void)
{
unsigned long long int x;
int n;
n = 0;
for (x = 0; x <= UINT32_MAX; x++) {
n += popcount8(x);
}
printf("%d\n", n);
return 0;
}
Signed-off-by: Ben Pfaff <blp@nicira.com>
2012-07-20 12:38:59 -07:00
|
|
|
|
}
|
|
|
|
|
|
2012-01-17 16:38:23 -08:00
|
|
|
|
/* Returns the sum of the squares of the first 'n' positive integers. */
|
|
|
|
|
static unsigned int
|
|
|
|
|
sum_of_squares(int n)
|
|
|
|
|
{
|
|
|
|
|
return n * (n + 1) * (2 * n + 1) / 6;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2012-07-30 09:35:32 -07:00
|
|
|
|
test_bitwise_copy(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
2012-01-17 16:38:23 -08:00
|
|
|
|
{
|
|
|
|
|
unsigned int n_loops;
|
|
|
|
|
int src_ofs;
|
|
|
|
|
int dst_ofs;
|
|
|
|
|
int n_bits;
|
|
|
|
|
|
|
|
|
|
n_loops = 0;
|
|
|
|
|
for (n_bits = 0; n_bits <= 64; n_bits++) {
|
|
|
|
|
for (src_ofs = 0; src_ofs < 64 - n_bits; src_ofs++) {
|
|
|
|
|
for (dst_ofs = 0; dst_ofs < 64 - n_bits; dst_ofs++) {
|
|
|
|
|
ovs_be64 src = htonll(random_uint64());
|
|
|
|
|
ovs_be64 dst = htonll(random_uint64());
|
|
|
|
|
ovs_be64 orig_dst = dst;
|
|
|
|
|
ovs_be64 expect;
|
|
|
|
|
|
|
|
|
|
if (n_bits == 64) {
|
|
|
|
|
expect = dst;
|
|
|
|
|
} else {
|
|
|
|
|
uint64_t mask = (UINT64_C(1) << n_bits) - 1;
|
|
|
|
|
expect = orig_dst & ~htonll(mask << dst_ofs);
|
|
|
|
|
expect |= htonll(((ntohll(src) >> src_ofs) & mask)
|
|
|
|
|
<< dst_ofs);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bitwise_copy(&src, sizeof src, src_ofs,
|
|
|
|
|
&dst, sizeof dst, dst_ofs,
|
|
|
|
|
n_bits);
|
|
|
|
|
if (expect != dst) {
|
|
|
|
|
fprintf(stderr,"copy_bits(0x%016"PRIx64",8,%d, "
|
|
|
|
|
"0x%016"PRIx64",8,%d, %d) yielded 0x%016"PRIx64" "
|
|
|
|
|
"instead of the expected 0x%016"PRIx64"\n",
|
|
|
|
|
ntohll(src), src_ofs,
|
|
|
|
|
ntohll(orig_dst), dst_ofs,
|
|
|
|
|
n_bits,
|
|
|
|
|
ntohll(dst), ntohll(expect));
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
n_loops++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (n_loops != sum_of_squares(64)) {
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-01-17 16:53:29 -08:00
|
|
|
|
static void
|
2012-07-30 09:35:32 -07:00
|
|
|
|
test_bitwise_zero(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
2012-01-17 16:53:29 -08:00
|
|
|
|
{
|
|
|
|
|
unsigned int n_loops;
|
|
|
|
|
int dst_ofs;
|
|
|
|
|
int n_bits;
|
|
|
|
|
|
|
|
|
|
n_loops = 0;
|
|
|
|
|
for (n_bits = 0; n_bits <= 64; n_bits++) {
|
|
|
|
|
for (dst_ofs = 0; dst_ofs < 64 - n_bits; dst_ofs++) {
|
|
|
|
|
ovs_be64 dst = htonll(random_uint64());
|
|
|
|
|
ovs_be64 orig_dst = dst;
|
|
|
|
|
ovs_be64 expect;
|
|
|
|
|
|
|
|
|
|
if (n_bits == 64) {
|
|
|
|
|
expect = htonll(0);
|
|
|
|
|
} else {
|
|
|
|
|
uint64_t mask = (UINT64_C(1) << n_bits) - 1;
|
|
|
|
|
expect = orig_dst & ~htonll(mask << dst_ofs);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bitwise_zero(&dst, sizeof dst, dst_ofs, n_bits);
|
|
|
|
|
if (expect != dst) {
|
|
|
|
|
fprintf(stderr,"bitwise_zero(0x%016"PRIx64",8,%d, %d) "
|
|
|
|
|
"yielded 0x%016"PRIx64" "
|
|
|
|
|
"instead of the expected 0x%016"PRIx64"\n",
|
|
|
|
|
ntohll(orig_dst), dst_ofs,
|
|
|
|
|
n_bits,
|
|
|
|
|
ntohll(dst), ntohll(expect));
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
n_loops++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (n_loops != 64 * (64 + 1) / 2) {
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-04-11 12:07:51 -07:00
|
|
|
|
static void
|
2012-07-30 09:35:32 -07:00
|
|
|
|
test_bitwise_one(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
2012-04-11 12:07:51 -07:00
|
|
|
|
{
|
|
|
|
|
unsigned int n_loops;
|
|
|
|
|
int dst_ofs;
|
|
|
|
|
int n_bits;
|
|
|
|
|
|
|
|
|
|
n_loops = 0;
|
|
|
|
|
for (n_bits = 0; n_bits <= 64; n_bits++) {
|
|
|
|
|
for (dst_ofs = 0; dst_ofs < 64 - n_bits; dst_ofs++) {
|
|
|
|
|
ovs_be64 dst = htonll(random_uint64());
|
|
|
|
|
ovs_be64 orig_dst = dst;
|
|
|
|
|
ovs_be64 expect;
|
|
|
|
|
|
|
|
|
|
if (n_bits == 64) {
|
2013-06-27 15:27:15 -07:00
|
|
|
|
expect = OVS_BE64_MAX;
|
2012-04-11 12:07:51 -07:00
|
|
|
|
} else {
|
|
|
|
|
uint64_t mask = (UINT64_C(1) << n_bits) - 1;
|
|
|
|
|
expect = orig_dst | htonll(mask << dst_ofs);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bitwise_one(&dst, sizeof dst, dst_ofs, n_bits);
|
|
|
|
|
if (expect != dst) {
|
|
|
|
|
fprintf(stderr,"bitwise_one(0x%016"PRIx64",8,%d, %d) "
|
|
|
|
|
"yielded 0x%016"PRIx64" "
|
|
|
|
|
"instead of the expected 0x%016"PRIx64"\n",
|
|
|
|
|
ntohll(orig_dst), dst_ofs,
|
|
|
|
|
n_bits,
|
|
|
|
|
ntohll(dst), ntohll(expect));
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
n_loops++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (n_loops != 64 * (64 + 1) / 2) {
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-04-13 21:12:37 -07:00
|
|
|
|
static void
|
2012-07-30 09:35:32 -07:00
|
|
|
|
test_bitwise_is_all_zeros(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
2012-04-13 21:12:37 -07:00
|
|
|
|
{
|
|
|
|
|
int n_loops;
|
|
|
|
|
|
|
|
|
|
for (n_loops = 0; n_loops < 100; n_loops++) {
|
|
|
|
|
ovs_be64 x = htonll(0);
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < 64; i++) {
|
|
|
|
|
ovs_be64 bit;
|
|
|
|
|
int ofs, n;
|
|
|
|
|
|
|
|
|
|
/* Change a random 0-bit into a 1-bit. */
|
|
|
|
|
do {
|
2013-06-25 09:22:11 -07:00
|
|
|
|
bit = htonll(UINT64_C(1) << (random_range(64)));
|
2012-04-13 21:12:37 -07:00
|
|
|
|
} while (x & bit);
|
|
|
|
|
x |= bit;
|
|
|
|
|
|
|
|
|
|
for (ofs = 0; ofs < 64; ofs++) {
|
|
|
|
|
for (n = 0; n <= 64 - ofs; n++) {
|
|
|
|
|
bool expect;
|
|
|
|
|
bool answer;
|
|
|
|
|
|
|
|
|
|
expect = (n == 64
|
|
|
|
|
? x == 0
|
|
|
|
|
: !(x & htonll(((UINT64_C(1) << n) - 1)
|
|
|
|
|
<< ofs)));
|
|
|
|
|
answer = bitwise_is_all_zeros(&x, sizeof x, ofs, n);
|
|
|
|
|
if (expect != answer) {
|
|
|
|
|
fprintf(stderr,
|
|
|
|
|
"bitwise_is_all_zeros(0x%016"PRIx64",8,%d,%d "
|
|
|
|
|
"returned %s instead of %s\n",
|
|
|
|
|
ntohll(x), ofs, n,
|
|
|
|
|
answer ? "true" : "false",
|
|
|
|
|
expect ? "true" : "false");
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2012-07-30 11:36:06 -07:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_follow_symlinks(int argc, char *argv[])
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 1; i < argc; i++) {
|
|
|
|
|
char *target = follow_symlinks(argv[i]);
|
|
|
|
|
puts(target);
|
|
|
|
|
free(target);
|
|
|
|
|
}
|
|
|
|
|
}
|
2013-01-16 16:03:03 -08:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_assert(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
ovs_assert(false);
|
|
|
|
|
}
|
2013-11-15 08:54:56 -08:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_ovs_scan(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
char str[16], str2[16], str3[16];
|
|
|
|
|
long double ld, ld2;
|
|
|
|
|
long long ll, ll2;
|
|
|
|
|
signed char c, c2;
|
|
|
|
|
ptrdiff_t pd, pd2;
|
|
|
|
|
intmax_t im, im2;
|
|
|
|
|
size_t sz, sz2;
|
|
|
|
|
int n, n2, n3;
|
|
|
|
|
double d, d2;
|
|
|
|
|
short s, s2;
|
|
|
|
|
float f, f2;
|
|
|
|
|
long l, l2;
|
|
|
|
|
int i, i2;
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("", ""));
|
|
|
|
|
ovs_assert(ovs_scan("", " "));
|
|
|
|
|
ovs_assert(ovs_scan(" ", " "));
|
|
|
|
|
ovs_assert(ovs_scan(" ", " "));
|
|
|
|
|
ovs_assert(ovs_scan(" \t ", " "));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("xyzzy", "xyzzy"));
|
|
|
|
|
ovs_assert(ovs_scan("xy%zzy", "xy%%zzy"));
|
|
|
|
|
ovs_assert(!ovs_scan(" xy%zzy", "xy%%zzy"));
|
|
|
|
|
ovs_assert(ovs_scan(" xy%\tzzy", " xy%% zzy"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%d", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%d", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%d%d", &i, &i2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%d", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%d", &i));
|
|
|
|
|
ovs_assert(i == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%d", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%d", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%d", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2d %d", &i, &i2));
|
|
|
|
|
ovs_assert(i == 12);
|
|
|
|
|
ovs_assert(i2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2d %d", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2d %d", &i, &i2));
|
|
|
|
|
ovs_assert(i == -1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2d %d", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%*2d %d", &i));
|
|
|
|
|
ovs_assert(i == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2d %*d", &i));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%*2d %*d"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%u", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%u", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%u%u", &i, &i2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%u", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%u", &i));
|
|
|
|
|
ovs_assert(i == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%u", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%u", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%u", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2u %u", &i, &i2));
|
|
|
|
|
ovs_assert(i == 12);
|
|
|
|
|
ovs_assert(i2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2u %u", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2u %u", &i, &i2));
|
|
|
|
|
ovs_assert(i == -1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2u %u", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%*2u %u", &i));
|
|
|
|
|
ovs_assert(i == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2u %*u", &i));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%*2u %*u"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%i", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%i", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%i%i", &i, &i2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%i", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%i", &i));
|
|
|
|
|
ovs_assert(i == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%i", &i));
|
|
|
|
|
ovs_assert(i == 0123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%i", &i));
|
|
|
|
|
ovs_assert(i == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%i", &i));
|
|
|
|
|
ovs_assert(i == 0x123);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2i %i", &i, &i2));
|
|
|
|
|
ovs_assert(i == 12);
|
|
|
|
|
ovs_assert(i2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2i %i", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2i %i", &i, &i2));
|
|
|
|
|
ovs_assert(i == -1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2i %i", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%*2i %i", &i));
|
|
|
|
|
ovs_assert(i == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2i %*i", &i));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%*2i %*i"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%o", &i));
|
|
|
|
|
ovs_assert(i == 0123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%o", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%o%o", &i, &i2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%o", &i));
|
|
|
|
|
ovs_assert(i == 0123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%o", &i));
|
|
|
|
|
ovs_assert(i == -0123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%o", &i));
|
|
|
|
|
ovs_assert(i == 0123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%o", &i));
|
|
|
|
|
ovs_assert(i == 0123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%o", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2o %o", &i, &i2));
|
|
|
|
|
ovs_assert(i == 012);
|
|
|
|
|
ovs_assert(i2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2o %o", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 023);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2o %o", &i, &i2));
|
|
|
|
|
ovs_assert(i == -1);
|
|
|
|
|
ovs_assert(i2 == 023);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2o %o", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 023);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%*2o %o", &i));
|
|
|
|
|
ovs_assert(i == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2o %*o", &i));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 023);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%*2o %*o"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%x", &i));
|
|
|
|
|
ovs_assert(i == 0x123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%x", &i));
|
|
|
|
|
ovs_assert(i == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%x%x", &i, &i2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%x", &i));
|
|
|
|
|
ovs_assert(i == 0x123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%x", &i));
|
|
|
|
|
ovs_assert(i == -0x123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%x", &i));
|
|
|
|
|
ovs_assert(i == 0x123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%x", &i));
|
|
|
|
|
ovs_assert(i == 0x123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%x", &i));
|
|
|
|
|
ovs_assert(i == 0x123);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2x %x", &i, &i2));
|
|
|
|
|
ovs_assert(i == 0x12);
|
|
|
|
|
ovs_assert(i2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2x %x", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 0x23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2x %x", &i, &i2));
|
|
|
|
|
ovs_assert(i == -1);
|
|
|
|
|
ovs_assert(i2 == 0x23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2x %x", &i, &i2));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 0x23);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%*2x %x", &i));
|
|
|
|
|
ovs_assert(i == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2x %*x", &i));
|
|
|
|
|
ovs_assert(i == 1);
|
|
|
|
|
ovs_assert(i2 == 0x23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%*2x %*x"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%hd", &s));
|
|
|
|
|
ovs_assert(s == 123);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%hd%hd", &s, &s2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%hd", &s));
|
|
|
|
|
ovs_assert(s == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%hd", &s));
|
|
|
|
|
ovs_assert(s == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%hd", &s));
|
|
|
|
|
ovs_assert(s == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%hd", &s));
|
|
|
|
|
ovs_assert(s == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%hd", &s));
|
|
|
|
|
ovs_assert(s == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2hd %hd", &s, &s2));
|
|
|
|
|
ovs_assert(s == 12);
|
|
|
|
|
ovs_assert(s2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2hd %hd", &s, &s2));
|
|
|
|
|
ovs_assert(s == 1);
|
|
|
|
|
ovs_assert(s2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2hd %hd", &s, &s2));
|
|
|
|
|
ovs_assert(s == -1);
|
|
|
|
|
ovs_assert(s2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2hd %hd", &s, &s2));
|
|
|
|
|
ovs_assert(s == 1);
|
|
|
|
|
ovs_assert(s2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%hhd%hhd", &c, &c2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%hhd", &c));
|
|
|
|
|
ovs_assert(c == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2hhd %hhd", &c, &c2));
|
|
|
|
|
ovs_assert(c == 12);
|
|
|
|
|
ovs_assert(c2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2hhd %hhd", &c, &c2));
|
|
|
|
|
ovs_assert(c == 1);
|
|
|
|
|
ovs_assert(c2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2hhd %hhd", &c, &c2));
|
|
|
|
|
ovs_assert(c == -1);
|
|
|
|
|
ovs_assert(c2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2hhd %hhd", &c, &c2));
|
|
|
|
|
ovs_assert(c == 1);
|
|
|
|
|
ovs_assert(c2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%ld", &l));
|
|
|
|
|
ovs_assert(l == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%ld", &l));
|
|
|
|
|
ovs_assert(l == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%ld%ld", &l, &l2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%ld", &l));
|
|
|
|
|
ovs_assert(l == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%ld", &l));
|
|
|
|
|
ovs_assert(l == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%ld", &l));
|
|
|
|
|
ovs_assert(l == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%ld", &l));
|
|
|
|
|
ovs_assert(l == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%ld", &l));
|
|
|
|
|
ovs_assert(l == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2ld %ld", &l, &l2));
|
|
|
|
|
ovs_assert(l == 12);
|
|
|
|
|
ovs_assert(l2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2ld %ld", &l, &l2));
|
|
|
|
|
ovs_assert(l == 1);
|
|
|
|
|
ovs_assert(l2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2ld %ld", &l, &l2));
|
|
|
|
|
ovs_assert(l == -1);
|
|
|
|
|
ovs_assert(l2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2ld %ld", &l, &l2));
|
|
|
|
|
ovs_assert(l == 1);
|
|
|
|
|
ovs_assert(l2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%lld%lld", &ll, &ll2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%lld", &ll));
|
|
|
|
|
ovs_assert(ll == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2lld %lld", &ll, &ll2));
|
|
|
|
|
ovs_assert(ll == 12);
|
|
|
|
|
ovs_assert(ll2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2lld %lld", &ll, &ll2));
|
|
|
|
|
ovs_assert(ll == 1);
|
|
|
|
|
ovs_assert(ll2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2lld %lld", &ll, &ll2));
|
|
|
|
|
ovs_assert(ll == -1);
|
|
|
|
|
ovs_assert(ll2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2lld %lld", &ll, &ll2));
|
|
|
|
|
ovs_assert(ll == 1);
|
|
|
|
|
ovs_assert(ll2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%jd", &im));
|
|
|
|
|
ovs_assert(im == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%jd", &im));
|
|
|
|
|
ovs_assert(im == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%jd%jd", &im, &im2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%jd", &im));
|
|
|
|
|
ovs_assert(im == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%jd", &im));
|
|
|
|
|
ovs_assert(im == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%jd", &im));
|
|
|
|
|
ovs_assert(im == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%jd", &im));
|
|
|
|
|
ovs_assert(im == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%jd", &im));
|
|
|
|
|
ovs_assert(im == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2jd %jd", &im, &im2));
|
|
|
|
|
ovs_assert(im == 12);
|
|
|
|
|
ovs_assert(im2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2jd %jd", &im, &im2));
|
|
|
|
|
ovs_assert(im == 1);
|
|
|
|
|
ovs_assert(im2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2jd %jd", &im, &im2));
|
|
|
|
|
ovs_assert(im == -1);
|
|
|
|
|
ovs_assert(im2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2jd %jd", &im, &im2));
|
|
|
|
|
ovs_assert(im == 1);
|
|
|
|
|
ovs_assert(im2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%td%td", &pd, &pd2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%td", &pd));
|
|
|
|
|
ovs_assert(pd == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2td %td", &pd, &pd2));
|
|
|
|
|
ovs_assert(pd == 12);
|
|
|
|
|
ovs_assert(pd2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2td %td", &pd, &pd2));
|
|
|
|
|
ovs_assert(pd == 1);
|
|
|
|
|
ovs_assert(pd2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2td %td", &pd, &pd2));
|
|
|
|
|
ovs_assert(pd == -1);
|
|
|
|
|
ovs_assert(pd2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2td %td", &pd, &pd2));
|
|
|
|
|
ovs_assert(pd == 1);
|
|
|
|
|
ovs_assert(pd2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("123", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == 0);
|
|
|
|
|
ovs_assert(!ovs_scan("123", "%zd%zd", &sz, &sz2));
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == 123);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == -123);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == 123);
|
|
|
|
|
ovs_assert(ovs_scan(" 123", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == 123);
|
|
|
|
|
ovs_assert(ovs_scan("0x123", "%zd", &sz));
|
|
|
|
|
ovs_assert(sz == 0);
|
|
|
|
|
ovs_assert(ovs_scan("123", "%2zd %zd", &sz, &sz2));
|
|
|
|
|
ovs_assert(sz == 12);
|
|
|
|
|
ovs_assert(sz2 == 3);
|
|
|
|
|
ovs_assert(ovs_scan("+123", "%2zd %zd", &sz, &sz2));
|
|
|
|
|
ovs_assert(sz == 1);
|
|
|
|
|
ovs_assert(sz2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("-123", "%2zd %zd", &sz, &sz2));
|
|
|
|
|
ovs_assert(sz == -1);
|
|
|
|
|
ovs_assert(sz2 == 23);
|
|
|
|
|
ovs_assert(ovs_scan("0123", "%2zd %zd", &sz, &sz2));
|
|
|
|
|
ovs_assert(sz == 1);
|
|
|
|
|
ovs_assert(sz2 == 23);
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("0.25", "%f", &f));
|
|
|
|
|
ovs_assert(f == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("1.0", "%f", &f));
|
|
|
|
|
ovs_assert(f == 1.0);
|
|
|
|
|
ovs_assert(ovs_scan("-5", "%f", &f));
|
|
|
|
|
ovs_assert(f == -5.0);
|
|
|
|
|
ovs_assert(ovs_scan("+6", "%f", &f));
|
|
|
|
|
ovs_assert(f == 6.0);
|
|
|
|
|
ovs_assert(ovs_scan("-1e5", "%f", &f));
|
|
|
|
|
ovs_assert(f == -1e5);
|
|
|
|
|
ovs_assert(ovs_scan("-.25", "%f", &f));
|
|
|
|
|
ovs_assert(f == -.25);
|
|
|
|
|
ovs_assert(ovs_scan("+123.e1", "%f", &f));
|
|
|
|
|
ovs_assert(f == 1230.0);
|
|
|
|
|
ovs_assert(ovs_scan("25e-2", "%f", &f));
|
|
|
|
|
ovs_assert(f == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("0.25", "%1f %f", &f, &f2));
|
|
|
|
|
ovs_assert(f == 0);
|
|
|
|
|
ovs_assert(f2 == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("1.0", "%2f %f", &f, &f2));
|
|
|
|
|
ovs_assert(f == 1.0);
|
|
|
|
|
ovs_assert(f2 == 0.0);
|
|
|
|
|
ovs_assert(!ovs_scan("-5", "%1f", &f));
|
|
|
|
|
ovs_assert(!ovs_scan("+6", "%1f", &f));
|
|
|
|
|
ovs_assert(!ovs_scan("-1e5", "%2f %*f", &f));
|
|
|
|
|
ovs_assert(f == -1);
|
|
|
|
|
ovs_assert(!ovs_scan("-.25", "%2f", &f));
|
|
|
|
|
ovs_assert(!ovs_scan("+123.e1", "%6f", &f));
|
|
|
|
|
ovs_assert(!ovs_scan("25e-2", "%4f", &f));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("0.25", "%lf", &d));
|
|
|
|
|
ovs_assert(d == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("1.0", "%lf", &d));
|
|
|
|
|
ovs_assert(d == 1.0);
|
|
|
|
|
ovs_assert(ovs_scan("-5", "%lf", &d));
|
|
|
|
|
ovs_assert(d == -5.0);
|
|
|
|
|
ovs_assert(ovs_scan("+6", "%lf", &d));
|
|
|
|
|
ovs_assert(d == 6.0);
|
|
|
|
|
ovs_assert(ovs_scan("-1e5", "%lf", &d));
|
|
|
|
|
ovs_assert(d == -1e5);
|
|
|
|
|
ovs_assert(ovs_scan("-.25", "%lf", &d));
|
|
|
|
|
ovs_assert(d == -.25);
|
|
|
|
|
ovs_assert(ovs_scan("+123.e1", "%lf", &d));
|
|
|
|
|
ovs_assert(d == 1230.0);
|
|
|
|
|
ovs_assert(ovs_scan("25e-2", "%lf", &d));
|
|
|
|
|
ovs_assert(d == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("0.25", "%1lf %lf", &d, &d2));
|
|
|
|
|
ovs_assert(d == 0);
|
|
|
|
|
ovs_assert(d2 == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("1.0", "%2lf %lf", &d, &d2));
|
|
|
|
|
ovs_assert(d == 1.0);
|
|
|
|
|
ovs_assert(d2 == 0.0);
|
|
|
|
|
ovs_assert(!ovs_scan("-5", "%1lf", &d));
|
|
|
|
|
ovs_assert(!ovs_scan("+6", "%1lf", &d));
|
|
|
|
|
ovs_assert(!ovs_scan("-1e5", "%2lf %*f", &d));
|
|
|
|
|
ovs_assert(d == -1);
|
|
|
|
|
ovs_assert(!ovs_scan("-.25", "%2lf", &d));
|
|
|
|
|
ovs_assert(!ovs_scan("+123.e1", "%6lf", &d));
|
|
|
|
|
ovs_assert(!ovs_scan("25e-2", "%4lf", &d));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("0.25", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("1.0", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == 1.0);
|
|
|
|
|
ovs_assert(ovs_scan("-5", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == -5.0);
|
|
|
|
|
ovs_assert(ovs_scan("+6", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == 6.0);
|
|
|
|
|
ovs_assert(ovs_scan("-1e5", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == -1e5);
|
|
|
|
|
ovs_assert(ovs_scan("-.25", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == -.25);
|
|
|
|
|
ovs_assert(ovs_scan("+123.e1", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == 1230.0);
|
|
|
|
|
ovs_assert(ovs_scan("25e-2", "%Lf", &ld));
|
|
|
|
|
ovs_assert(ld == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("0.25", "%1Lf %Lf", &ld, &ld2));
|
|
|
|
|
ovs_assert(ld == 0);
|
|
|
|
|
ovs_assert(ld2 == 0.25);
|
|
|
|
|
ovs_assert(ovs_scan("1.0", "%2Lf %Lf", &ld, &ld2));
|
|
|
|
|
ovs_assert(ld == 1.0);
|
|
|
|
|
ovs_assert(ld2 == 0.0);
|
|
|
|
|
ovs_assert(!ovs_scan("-5", "%1Lf", &ld));
|
|
|
|
|
ovs_assert(!ovs_scan("+6", "%1Lf", &ld));
|
|
|
|
|
ovs_assert(!ovs_scan("-1e5", "%2Lf %*f", &ld));
|
|
|
|
|
ovs_assert(ld == -1);
|
|
|
|
|
ovs_assert(!ovs_scan("-.25", "%2Lf", &ld));
|
|
|
|
|
ovs_assert(!ovs_scan("+123.e1", "%6Lf", &ld));
|
|
|
|
|
ovs_assert(!ovs_scan("25e-2", "%4Lf", &ld));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan(" Hello,\tworld ", "%*s%n%*s%n", &n, &n2));
|
|
|
|
|
ovs_assert(n == 7);
|
|
|
|
|
ovs_assert(n2 == 13);
|
|
|
|
|
ovs_assert(!ovs_scan(" Hello,\tworld ", "%*s%*s%*s"));
|
|
|
|
|
ovs_assert(ovs_scan(" Hello,\tworld ", "%6s%n%5s%n", str, &n, str2, &n2));
|
|
|
|
|
ovs_assert(!strcmp(str, "Hello,"));
|
|
|
|
|
ovs_assert(n == 7);
|
|
|
|
|
ovs_assert(!strcmp(str2, "world"));
|
|
|
|
|
ovs_assert(n2 == 13);
|
|
|
|
|
ovs_assert(ovs_scan(" Hello,\tworld ", "%5s%5s%5s", str, str2, str3));
|
|
|
|
|
ovs_assert(!strcmp(str, "Hello"));
|
|
|
|
|
ovs_assert(!strcmp(str2, ","));
|
|
|
|
|
ovs_assert(!strcmp(str3, "world"));
|
|
|
|
|
ovs_assert(!ovs_scan(" ", "%*s"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan(" Hello,\tworld ", "%*c%n%*c%n%c%n",
|
|
|
|
|
&n, &n2, &c, &n3));
|
|
|
|
|
ovs_assert(n == 1);
|
|
|
|
|
ovs_assert(n2 == 2);
|
|
|
|
|
ovs_assert(c == 'e');
|
|
|
|
|
ovs_assert(n3 == 3);
|
|
|
|
|
ovs_assert(ovs_scan(" Hello,\tworld ", "%*5c%5c", str));
|
|
|
|
|
ovs_assert(!memcmp(str, "o,\two", 5));
|
|
|
|
|
ovs_assert(!ovs_scan(" Hello,\tworld ", "%*15c"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(ovs_scan("0x1234xyzzy", "%9[x0-9a-fA-F]%n", str, &n));
|
|
|
|
|
ovs_assert(!strcmp(str, "0x1234x"));
|
|
|
|
|
ovs_assert(n == 7);
|
|
|
|
|
ovs_assert(ovs_scan("foo:bar=baz", "%5[^:=]%n:%5[^:=]%n=%5[^:=]%n",
|
|
|
|
|
str, &n, str2, &n2, str3, &n3));
|
|
|
|
|
ovs_assert(!strcmp(str, "foo"));
|
|
|
|
|
ovs_assert(n == 3);
|
|
|
|
|
ovs_assert(!strcmp(str2, "bar"));
|
|
|
|
|
ovs_assert(n2 == 7);
|
|
|
|
|
ovs_assert(!strcmp(str3, "baz"));
|
|
|
|
|
ovs_assert(n3 == 11);
|
|
|
|
|
ovs_assert(!ovs_scan(" ", "%*[0-9]"));
|
|
|
|
|
ovs_assert(ovs_scan("0x123a]4xyzzy-", "%[]x0-9a-fA-F]", str));
|
|
|
|
|
ovs_assert(!strcmp(str, "0x123a]4x"));
|
|
|
|
|
ovs_assert(ovs_scan("abc]xyz","%[^]xyz]", str));
|
|
|
|
|
ovs_assert(!strcmp(str, "abc"));
|
|
|
|
|
ovs_assert(!ovs_scan("0x123a]4xyzzy-", "%[x0-9]a-fA-F]", str));
|
|
|
|
|
ovs_assert(ovs_scan("0x12-3]xyz", "%[x0-9a-f-]", str));
|
|
|
|
|
ovs_assert(!strcmp(str, "0x12-3"));
|
|
|
|
|
ovs_assert(ovs_scan("0x12-3]xyz", "%[^a-f-]", str));
|
|
|
|
|
ovs_assert(!strcmp(str, "0x12"));
|
|
|
|
|
ovs_assert(sscanf("0x12-3]xyz", "%[^-a-f]", str));
|
|
|
|
|
ovs_assert(!strcmp(str, "0x12"));
|
|
|
|
|
}
|
2013-12-24 09:18:42 -08:00
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
test_snprintf(int argc OVS_UNUSED, char *argv[] OVS_UNUSED)
|
|
|
|
|
{
|
|
|
|
|
char s[16];
|
|
|
|
|
|
|
|
|
|
ovs_assert(snprintf(s, 4, "abcde") == 5);
|
|
|
|
|
ovs_assert(!strcmp(s, "abc"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(snprintf(s, 5, "abcde") == 5);
|
|
|
|
|
ovs_assert(!strcmp(s, "abcd"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(snprintf(s, 6, "abcde") == 5);
|
|
|
|
|
ovs_assert(!strcmp(s, "abcde"));
|
|
|
|
|
|
|
|
|
|
ovs_assert(snprintf(NULL, 0, "abcde") == 5);
|
|
|
|
|
}
|
2012-07-30 09:35:32 -07:00
|
|
|
|
|
|
|
|
|
static const struct command commands[] = {
|
|
|
|
|
{"ctz", 0, 0, test_ctz},
|
2013-12-03 13:41:41 -08:00
|
|
|
|
{"clz", 0, 0, test_clz},
|
2013-04-25 11:18:10 -07:00
|
|
|
|
{"round_up_pow2", 0, 0, test_round_up_pow2},
|
|
|
|
|
{"round_down_pow2", 0, 0, test_round_down_pow2},
|
2013-11-19 10:59:10 -08:00
|
|
|
|
{"count_1bits", 0, 0, test_count_1bits},
|
2012-07-30 09:35:32 -07:00
|
|
|
|
{"log_2_floor", 0, 0, test_log_2_floor},
|
|
|
|
|
{"bitwise_copy", 0, 0, test_bitwise_copy},
|
|
|
|
|
{"bitwise_zero", 0, 0, test_bitwise_zero},
|
|
|
|
|
{"bitwise_one", 0, 0, test_bitwise_one},
|
|
|
|
|
{"bitwise_is_all_zeros", 0, 0, test_bitwise_is_all_zeros},
|
2012-07-30 11:36:06 -07:00
|
|
|
|
{"follow-symlinks", 1, INT_MAX, test_follow_symlinks},
|
2013-01-16 16:03:03 -08:00
|
|
|
|
{"assert", 0, 0, test_assert},
|
2013-11-15 08:54:56 -08:00
|
|
|
|
{"ovs_scan", 0, 0, test_ovs_scan},
|
2013-12-24 09:18:42 -08:00
|
|
|
|
{"snprintf", 0, 0, test_snprintf},
|
2012-07-30 09:35:32 -07:00
|
|
|
|
{NULL, 0, 0, NULL},
|
|
|
|
|
};
|
2012-04-13 21:12:37 -07:00
|
|
|
|
|
2013-01-16 16:03:03 -08:00
|
|
|
|
static void
|
|
|
|
|
parse_options(int argc, char *argv[])
|
|
|
|
|
{
|
|
|
|
|
enum {
|
|
|
|
|
VLOG_OPTION_ENUMS
|
|
|
|
|
};
|
2013-04-23 16:40:56 -07:00
|
|
|
|
static const struct option long_options[] = {
|
2013-01-16 16:03:03 -08:00
|
|
|
|
VLOG_LONG_OPTIONS,
|
|
|
|
|
{NULL, 0, NULL, 0},
|
|
|
|
|
};
|
|
|
|
|
char *short_options = long_options_to_short_options(long_options);
|
|
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
|
int c = getopt_long(argc, argv, short_options, long_options, NULL);
|
|
|
|
|
if (c == -1) {
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (c) {
|
|
|
|
|
VLOG_OPTION_HANDLERS
|
|
|
|
|
|
|
|
|
|
case '?':
|
|
|
|
|
exit(EXIT_FAILURE);
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
free(short_options);
|
|
|
|
|
}
|
|
|
|
|
|
2011-07-22 10:20:52 -07:00
|
|
|
|
int
|
2012-07-30 09:35:32 -07:00
|
|
|
|
main(int argc, char *argv[])
|
2011-07-22 10:20:52 -07:00
|
|
|
|
{
|
2012-07-30 09:35:32 -07:00
|
|
|
|
set_program_name(argv[0]);
|
2013-01-16 16:03:03 -08:00
|
|
|
|
parse_options(argc, argv);
|
|
|
|
|
run_command(argc - optind, argv + optind, commands);
|
2011-07-22 10:20:52 -07:00
|
|
|
|
return 0;
|
|
|
|
|
}
|