2017-12-21 22:17:20 +00:00
|
|
|
/*-
|
|
|
|
* BSD LICENSE
|
|
|
|
*
|
|
|
|
* Copyright (c) Intel Corporation.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
* * Neither the name of Intel Corporation nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "spdk_cunit.h"
|
|
|
|
|
|
|
|
#include "spdk/histogram_data.h"
|
|
|
|
#include "spdk/util.h"
|
|
|
|
|
|
|
|
uint64_t g_values[] = {
|
|
|
|
1,
|
|
|
|
10,
|
|
|
|
1000,
|
|
|
|
50000,
|
|
|
|
(1ULL << 63),
|
|
|
|
UINT64_MAX
|
|
|
|
};
|
|
|
|
|
|
|
|
uint64_t *g_values_end = &g_values[SPDK_COUNTOF(g_values)];
|
|
|
|
uint64_t g_total;
|
2018-11-09 13:00:46 +00:00
|
|
|
uint64_t g_number_of_merged_histograms;
|
2017-12-21 22:17:20 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
check_values(void *ctx, uint64_t start, uint64_t end, uint64_t count,
|
|
|
|
uint64_t total, uint64_t so_far)
|
|
|
|
{
|
|
|
|
uint64_t **values = ctx;
|
|
|
|
|
|
|
|
if (count == 0) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
CU_ASSERT(so_far == (g_total + count));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The bucket for this iteration does not include end, but
|
|
|
|
* subtract one anyways to account for the last bucket
|
|
|
|
* which will have end = 0x0 (UINT64_MAX + 1).
|
|
|
|
*/
|
|
|
|
end--;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
CU_ASSERT(**values >= start);
|
|
|
|
/*
|
|
|
|
* We subtracted one from end above, so it's OK here for
|
|
|
|
* **values to equal end.
|
|
|
|
*/
|
|
|
|
CU_ASSERT(**values <= end);
|
2018-11-09 13:00:46 +00:00
|
|
|
g_total += g_number_of_merged_histograms;
|
|
|
|
count -= g_number_of_merged_histograms;
|
2017-12-21 22:17:20 +00:00
|
|
|
(*values)++;
|
|
|
|
if (*values == g_values_end || **values > end) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
CU_ASSERT(count == 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
histogram_test(void)
|
|
|
|
{
|
|
|
|
struct spdk_histogram_data *h;
|
|
|
|
uint64_t *values = g_values;
|
|
|
|
uint32_t i;
|
|
|
|
|
|
|
|
h = spdk_histogram_data_alloc();
|
|
|
|
|
|
|
|
for (i = 0; i < SPDK_COUNTOF(g_values); i++) {
|
|
|
|
spdk_histogram_data_tally(h, g_values[i]);
|
|
|
|
}
|
|
|
|
g_total = 0;
|
2018-11-09 13:00:46 +00:00
|
|
|
g_number_of_merged_histograms = 1;
|
2017-12-21 22:17:20 +00:00
|
|
|
spdk_histogram_data_iterate(h, check_values, &values);
|
|
|
|
|
|
|
|
spdk_histogram_data_free(h);
|
|
|
|
}
|
|
|
|
|
2018-11-09 13:00:46 +00:00
|
|
|
static void
|
|
|
|
histogram_merge(void)
|
|
|
|
{
|
|
|
|
struct spdk_histogram_data *h1, *h2;
|
|
|
|
uint64_t *values = g_values;
|
|
|
|
uint32_t i;
|
|
|
|
|
|
|
|
h1 = spdk_histogram_data_alloc();
|
|
|
|
h2 = spdk_histogram_data_alloc();
|
|
|
|
|
|
|
|
for (i = 0; i < SPDK_COUNTOF(g_values); i++) {
|
|
|
|
spdk_histogram_data_tally(h1, g_values[i]);
|
|
|
|
spdk_histogram_data_tally(h2, g_values[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
spdk_histogram_data_merge(h1, h2);
|
|
|
|
|
|
|
|
g_total = 0;
|
|
|
|
g_number_of_merged_histograms = 2;
|
|
|
|
spdk_histogram_data_iterate(h1, check_values, &values);
|
|
|
|
|
|
|
|
spdk_histogram_data_free(h1);
|
|
|
|
spdk_histogram_data_free(h2);
|
|
|
|
}
|
|
|
|
|
2017-12-21 22:17:20 +00:00
|
|
|
int
|
|
|
|
main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
CU_pSuite suite = NULL;
|
|
|
|
unsigned int num_failures;
|
|
|
|
|
|
|
|
if (CU_initialize_registry() != CUE_SUCCESS) {
|
|
|
|
return CU_get_error();
|
|
|
|
}
|
|
|
|
|
|
|
|
suite = CU_add_suite("histogram", NULL, NULL);
|
|
|
|
if (suite == NULL) {
|
|
|
|
CU_cleanup_registry();
|
|
|
|
return CU_get_error();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (
|
2018-11-09 13:00:46 +00:00
|
|
|
CU_add_test(suite, "histogram_test", histogram_test) == NULL ||
|
|
|
|
CU_add_test(suite, "histogram_merge", histogram_merge) == NULL
|
2017-12-21 22:17:20 +00:00
|
|
|
) {
|
|
|
|
CU_cleanup_registry();
|
|
|
|
return CU_get_error();
|
|
|
|
}
|
|
|
|
|
|
|
|
CU_basic_set_mode(CU_BRM_VERBOSE);
|
|
|
|
CU_basic_run_tests();
|
|
|
|
num_failures = CU_get_number_of_failures();
|
|
|
|
CU_cleanup_registry();
|
|
|
|
return num_failures;
|
|
|
|
}
|