2022-06-03 19:15:11 +00:00
|
|
|
/* SPDX-License-Identifier: BSD-3-Clause
|
2020-02-13 22:13:53 +00:00
|
|
|
* Copyright (c) Intel Corporation.
|
|
|
|
* All rights reserved.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "spdk/stdinc.h"
|
|
|
|
#include "spdk/thread.h"
|
|
|
|
#include "spdk/env.h"
|
|
|
|
#include "spdk/event.h"
|
|
|
|
#include "spdk/log.h"
|
|
|
|
#include "spdk/string.h"
|
|
|
|
#include "spdk/accel_engine.h"
|
2020-04-28 22:23:19 +00:00
|
|
|
#include "spdk/crc32.h"
|
2020-07-13 22:14:57 +00:00
|
|
|
#include "spdk/util.h"
|
2020-02-13 22:13:53 +00:00
|
|
|
|
2020-04-29 22:57:06 +00:00
|
|
|
#define DATA_PATTERN 0x5a
|
2020-04-30 22:09:17 +00:00
|
|
|
#define ALIGN_4K 0x1000
|
2020-04-29 22:57:06 +00:00
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
static uint64_t g_tsc_rate;
|
|
|
|
static uint64_t g_tsc_end;
|
2021-02-08 17:19:29 +00:00
|
|
|
static int g_rc;
|
2020-02-13 22:13:53 +00:00
|
|
|
static int g_xfer_size_bytes = 4096;
|
|
|
|
static int g_queue_depth = 32;
|
2021-06-21 17:38:43 +00:00
|
|
|
/* g_allocate_depth indicates how many tasks we allocate per worker. It will
|
|
|
|
* be at least as much as the queue depth.
|
|
|
|
*/
|
|
|
|
static int g_allocate_depth = 0;
|
2021-02-09 00:00:37 +00:00
|
|
|
static int g_threads_per_core = 1;
|
2020-02-13 22:13:53 +00:00
|
|
|
static int g_time_in_sec = 5;
|
2020-04-28 22:23:19 +00:00
|
|
|
static uint32_t g_crc32c_seed = 0;
|
2020-12-21 12:17:06 +00:00
|
|
|
static uint32_t g_crc32c_chained_count = 1;
|
2020-04-29 22:57:06 +00:00
|
|
|
static int g_fail_percent_goal = 0;
|
2020-05-01 22:04:27 +00:00
|
|
|
static uint8_t g_fill_pattern = 255;
|
2020-02-13 22:13:53 +00:00
|
|
|
static bool g_verify = false;
|
2020-04-07 16:16:13 +00:00
|
|
|
static const char *g_workload_type = NULL;
|
2022-03-15 17:43:07 +00:00
|
|
|
static enum accel_opcode g_workload_selection;
|
2020-02-13 22:13:53 +00:00
|
|
|
static struct worker_thread *g_workers = NULL;
|
|
|
|
static int g_num_workers = 0;
|
|
|
|
static pthread_mutex_t g_workers_lock = PTHREAD_MUTEX_INITIALIZER;
|
2022-06-08 00:11:12 +00:00
|
|
|
static struct spdk_app_opts g_opts = {};
|
2020-12-08 16:32:49 +00:00
|
|
|
|
|
|
|
struct worker_thread;
|
|
|
|
static void accel_done(void *ref, int status);
|
|
|
|
|
2021-02-09 00:00:37 +00:00
|
|
|
struct display_info {
|
|
|
|
int core;
|
|
|
|
int thread;
|
|
|
|
};
|
|
|
|
|
2020-12-08 16:32:49 +00:00
|
|
|
struct ap_task {
|
|
|
|
void *src;
|
2020-12-21 12:17:06 +00:00
|
|
|
struct iovec *iovs;
|
|
|
|
uint32_t iov_cnt;
|
2020-12-08 16:32:49 +00:00
|
|
|
void *dst;
|
|
|
|
void *dst2;
|
2022-04-19 12:35:39 +00:00
|
|
|
union {
|
|
|
|
uint32_t crc_dst;
|
|
|
|
uint32_t output_size;
|
|
|
|
};
|
2020-12-08 16:32:49 +00:00
|
|
|
struct worker_thread *worker;
|
|
|
|
int expected_status; /* used for the compare operation */
|
|
|
|
TAILQ_ENTRY(ap_task) link;
|
|
|
|
};
|
2020-02-13 22:13:53 +00:00
|
|
|
|
|
|
|
struct worker_thread {
|
|
|
|
struct spdk_io_channel *ch;
|
|
|
|
uint64_t xfer_completed;
|
|
|
|
uint64_t xfer_failed;
|
2020-04-29 22:57:06 +00:00
|
|
|
uint64_t injected_miscompares;
|
2020-02-13 22:13:53 +00:00
|
|
|
uint64_t current_queue_depth;
|
2020-12-08 16:59:17 +00:00
|
|
|
TAILQ_HEAD(, ap_task) tasks_pool;
|
2020-02-13 22:13:53 +00:00
|
|
|
struct worker_thread *next;
|
|
|
|
unsigned core;
|
|
|
|
struct spdk_thread *thread;
|
|
|
|
bool is_draining;
|
|
|
|
struct spdk_poller *is_draining_poller;
|
|
|
|
struct spdk_poller *stop_poller;
|
2020-12-08 16:59:17 +00:00
|
|
|
void *task_base;
|
2021-02-09 00:00:37 +00:00
|
|
|
struct display_info display;
|
2022-04-19 12:35:39 +00:00
|
|
|
enum accel_opcode workload;
|
|
|
|
void *rnd_data;
|
2020-02-13 22:13:53 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static void
|
2022-06-08 00:11:12 +00:00
|
|
|
dump_user_config(void)
|
2020-02-13 22:13:53 +00:00
|
|
|
{
|
2022-06-08 00:11:12 +00:00
|
|
|
const char *engine_name = NULL;
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
rc = spdk_accel_get_opc_engine_name(g_workload_selection, &engine_name);
|
|
|
|
if (rc) {
|
|
|
|
printf("error getting engine name (%d)\n", rc);
|
|
|
|
}
|
|
|
|
|
|
|
|
printf("\nSPDK Configuration:\n");
|
|
|
|
printf("Core mask: %s\n\n", g_opts.reactor_mask);
|
2020-02-13 22:13:53 +00:00
|
|
|
printf("Accel Perf Configuration:\n");
|
2020-04-07 16:16:13 +00:00
|
|
|
printf("Workload Type: %s\n", g_workload_type);
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_CRC32C || g_workload_selection == ACCEL_OPC_COPY_CRC32C) {
|
2020-04-29 22:57:06 +00:00
|
|
|
printf("CRC-32C seed: %u\n", g_crc32c_seed);
|
2021-06-07 22:50:43 +00:00
|
|
|
printf("vector count %u\n", g_crc32c_chained_count);
|
2022-03-15 17:43:07 +00:00
|
|
|
} else if (g_workload_selection == ACCEL_OPC_FILL) {
|
2020-05-01 22:04:27 +00:00
|
|
|
printf("Fill pattern: 0x%x\n", g_fill_pattern);
|
2022-03-15 17:43:07 +00:00
|
|
|
} else if ((g_workload_selection == ACCEL_OPC_COMPARE) && g_fail_percent_goal > 0) {
|
2020-05-01 22:04:27 +00:00
|
|
|
printf("Failure inject: %u percent\n", g_fail_percent_goal);
|
2020-04-28 22:23:19 +00:00
|
|
|
}
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_COPY_CRC32C) {
|
2021-06-07 22:50:43 +00:00
|
|
|
printf("Vector size: %u bytes\n", g_xfer_size_bytes);
|
|
|
|
printf("Transfer size: %u bytes\n", g_xfer_size_bytes * g_crc32c_chained_count);
|
|
|
|
} else {
|
|
|
|
printf("Transfer size: %u bytes\n", g_xfer_size_bytes);
|
|
|
|
}
|
2022-06-08 00:11:12 +00:00
|
|
|
printf("Engine: %s\n", engine_name);
|
2020-02-13 22:13:53 +00:00
|
|
|
printf("Queue depth: %u\n", g_queue_depth);
|
2021-06-21 17:38:43 +00:00
|
|
|
printf("Allocate depth: %u\n", g_allocate_depth);
|
2021-02-09 00:00:37 +00:00
|
|
|
printf("# threads/core: %u\n", g_threads_per_core);
|
2020-02-13 22:13:53 +00:00
|
|
|
printf("Run time: %u seconds\n", g_time_in_sec);
|
|
|
|
printf("Verify: %s\n\n", g_verify ? "Yes" : "No");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
usage(void)
|
|
|
|
{
|
|
|
|
printf("accel_perf options:\n");
|
|
|
|
printf("\t[-h help message]\n");
|
2020-12-08 17:12:31 +00:00
|
|
|
printf("\t[-q queue depth per core]\n");
|
2021-06-07 22:50:43 +00:00
|
|
|
printf("\t[-C for crc32c workload, use this value to configure the io vector size to test (default 1)\n");
|
2021-02-09 00:00:37 +00:00
|
|
|
printf("\t[-T number of threads per core\n");
|
2020-12-21 12:17:06 +00:00
|
|
|
printf("\t[-n number of channels]\n");
|
2020-02-13 22:13:53 +00:00
|
|
|
printf("\t[-o transfer size in bytes]\n");
|
|
|
|
printf("\t[-t time in seconds]\n");
|
2022-04-19 12:35:39 +00:00
|
|
|
printf("\t[-w workload type must be one of these: copy, fill, crc32c, copy_crc32c, compare, compress, dualcast\n");
|
2020-04-28 22:23:19 +00:00
|
|
|
printf("\t[-s for crc32c workload, use this seed value (default 0)\n");
|
2020-04-29 22:57:06 +00:00
|
|
|
printf("\t[-P for compare workload, percentage of operations that should miscompare (percent, default 0)\n");
|
2020-05-01 22:04:27 +00:00
|
|
|
printf("\t[-f for fill workload, use this BYTE value (default 255)\n");
|
2020-04-07 16:16:13 +00:00
|
|
|
printf("\t[-y verify result if this switch is on]\n");
|
2021-06-21 17:38:43 +00:00
|
|
|
printf("\t[-a tasks to allocate per core (default: same value as -q)]\n");
|
|
|
|
printf("\t\tCan be used to spread operations across a wider range of memory.\n");
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
parse_args(int argc, char *argv)
|
|
|
|
{
|
2021-06-29 10:14:19 +00:00
|
|
|
int argval = 0;
|
2021-06-23 19:38:21 +00:00
|
|
|
|
|
|
|
switch (argc) {
|
2021-06-21 17:38:43 +00:00
|
|
|
case 'a':
|
2021-06-23 19:38:21 +00:00
|
|
|
case 'C':
|
|
|
|
case 'f':
|
|
|
|
case 'T':
|
|
|
|
case 'o':
|
|
|
|
case 'P':
|
|
|
|
case 'q':
|
|
|
|
case 's':
|
|
|
|
case 't':
|
|
|
|
argval = spdk_strtol(optarg, 10);
|
|
|
|
if (argval < 0) {
|
|
|
|
fprintf(stderr, "-%c option must be non-negative.\n", argc);
|
|
|
|
usage();
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
};
|
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
switch (argc) {
|
2021-06-21 17:38:43 +00:00
|
|
|
case 'a':
|
|
|
|
g_allocate_depth = argval;
|
|
|
|
break;
|
2020-12-21 12:17:06 +00:00
|
|
|
case 'C':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_crc32c_chained_count = argval;
|
2020-12-21 12:17:06 +00:00
|
|
|
break;
|
2020-05-01 22:04:27 +00:00
|
|
|
case 'f':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_fill_pattern = (uint8_t)argval;
|
2020-05-01 22:04:27 +00:00
|
|
|
break;
|
2021-02-09 00:00:37 +00:00
|
|
|
case 'T':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_threads_per_core = argval;
|
2021-02-09 00:00:37 +00:00
|
|
|
break;
|
2020-02-13 22:13:53 +00:00
|
|
|
case 'o':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_xfer_size_bytes = argval;
|
2020-02-13 22:13:53 +00:00
|
|
|
break;
|
2020-04-29 22:57:06 +00:00
|
|
|
case 'P':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_fail_percent_goal = argval;
|
2020-04-29 22:57:06 +00:00
|
|
|
break;
|
2020-02-13 22:13:53 +00:00
|
|
|
case 'q':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_queue_depth = argval;
|
2020-02-13 22:13:53 +00:00
|
|
|
break;
|
2020-04-28 22:23:19 +00:00
|
|
|
case 's':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_crc32c_seed = argval;
|
2020-04-28 22:23:19 +00:00
|
|
|
break;
|
2020-02-13 22:13:53 +00:00
|
|
|
case 't':
|
2021-06-23 19:38:21 +00:00
|
|
|
g_time_in_sec = argval;
|
2020-02-13 22:13:53 +00:00
|
|
|
break;
|
|
|
|
case 'y':
|
|
|
|
g_verify = true;
|
|
|
|
break;
|
2020-04-07 16:16:13 +00:00
|
|
|
case 'w':
|
|
|
|
g_workload_type = optarg;
|
2020-04-24 16:50:46 +00:00
|
|
|
if (!strcmp(g_workload_type, "copy")) {
|
2022-03-15 17:43:07 +00:00
|
|
|
g_workload_selection = ACCEL_OPC_COPY;
|
2020-04-24 16:50:46 +00:00
|
|
|
} else if (!strcmp(g_workload_type, "fill")) {
|
2022-03-15 17:43:07 +00:00
|
|
|
g_workload_selection = ACCEL_OPC_FILL;
|
2020-04-28 22:23:19 +00:00
|
|
|
} else if (!strcmp(g_workload_type, "crc32c")) {
|
2022-03-15 17:43:07 +00:00
|
|
|
g_workload_selection = ACCEL_OPC_CRC32C;
|
2021-06-07 22:50:43 +00:00
|
|
|
} else if (!strcmp(g_workload_type, "copy_crc32c")) {
|
2022-03-15 17:43:07 +00:00
|
|
|
g_workload_selection = ACCEL_OPC_COPY_CRC32C;
|
2020-04-29 22:57:06 +00:00
|
|
|
} else if (!strcmp(g_workload_type, "compare")) {
|
2022-03-15 17:43:07 +00:00
|
|
|
g_workload_selection = ACCEL_OPC_COMPARE;
|
2020-04-30 22:09:17 +00:00
|
|
|
} else if (!strcmp(g_workload_type, "dualcast")) {
|
2022-03-15 17:43:07 +00:00
|
|
|
g_workload_selection = ACCEL_OPC_DUALCAST;
|
2022-04-19 12:35:39 +00:00
|
|
|
} else if (!strcmp(g_workload_type, "compress")) {
|
|
|
|
g_workload_selection = ACCEL_OPC_COMPRESS;
|
2022-06-07 19:25:02 +00:00
|
|
|
} else {
|
|
|
|
usage();
|
|
|
|
return 1;
|
2020-04-24 16:50:46 +00:00
|
|
|
}
|
2020-04-07 16:16:13 +00:00
|
|
|
break;
|
2020-02-13 22:13:53 +00:00
|
|
|
default:
|
|
|
|
usage();
|
|
|
|
return 1;
|
|
|
|
}
|
2020-12-21 12:17:06 +00:00
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2021-02-07 18:46:50 +00:00
|
|
|
static int dump_result(void);
|
2020-02-13 22:13:53 +00:00
|
|
|
static void
|
|
|
|
unregister_worker(void *arg1)
|
|
|
|
{
|
|
|
|
struct worker_thread *worker = arg1;
|
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
free(worker->task_base);
|
2022-04-19 12:35:39 +00:00
|
|
|
free(worker->rnd_data);
|
2020-02-13 22:13:53 +00:00
|
|
|
spdk_put_io_channel(worker->ch);
|
|
|
|
pthread_mutex_lock(&g_workers_lock);
|
|
|
|
assert(g_num_workers >= 1);
|
|
|
|
if (--g_num_workers == 0) {
|
|
|
|
pthread_mutex_unlock(&g_workers_lock);
|
2021-02-08 17:19:29 +00:00
|
|
|
g_rc = dump_result();
|
2020-02-13 22:13:53 +00:00
|
|
|
spdk_app_stop(0);
|
|
|
|
}
|
|
|
|
pthread_mutex_unlock(&g_workers_lock);
|
|
|
|
}
|
|
|
|
|
2020-12-08 19:14:10 +00:00
|
|
|
static int
|
|
|
|
_get_task_data_bufs(struct ap_task *task)
|
|
|
|
{
|
|
|
|
uint32_t align = 0;
|
2020-12-21 12:17:06 +00:00
|
|
|
uint32_t i = 0;
|
2021-06-07 22:50:43 +00:00
|
|
|
int dst_buff_len = g_xfer_size_bytes;
|
2020-12-08 19:14:10 +00:00
|
|
|
|
|
|
|
/* For dualcast, the DSA HW requires 4K alignment on destination addresses but
|
|
|
|
* we do this for all engines to keep it simple.
|
|
|
|
*/
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_DUALCAST) {
|
2020-12-08 19:14:10 +00:00
|
|
|
align = ALIGN_4K;
|
|
|
|
}
|
|
|
|
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_CRC32C || g_workload_selection == ACCEL_OPC_COPY_CRC32C) {
|
2020-12-21 12:17:06 +00:00
|
|
|
assert(g_crc32c_chained_count > 0);
|
|
|
|
task->iov_cnt = g_crc32c_chained_count;
|
|
|
|
task->iovs = calloc(task->iov_cnt, sizeof(struct iovec));
|
|
|
|
if (!task->iovs) {
|
|
|
|
fprintf(stderr, "cannot allocated task->iovs fot task=%p\n", task);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_COPY_CRC32C) {
|
2021-06-07 22:50:43 +00:00
|
|
|
dst_buff_len = g_xfer_size_bytes * g_crc32c_chained_count;
|
|
|
|
}
|
|
|
|
|
2020-12-21 12:17:06 +00:00
|
|
|
for (i = 0; i < task->iov_cnt; i++) {
|
|
|
|
task->iovs[i].iov_base = spdk_dma_zmalloc(g_xfer_size_bytes, 0, NULL);
|
|
|
|
if (task->iovs[i].iov_base == NULL) {
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
memset(task->iovs[i].iov_base, DATA_PATTERN, g_xfer_size_bytes);
|
|
|
|
task->iovs[i].iov_len = g_xfer_size_bytes;
|
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
|
|
|
task->src = spdk_dma_zmalloc(g_xfer_size_bytes, 0, NULL);
|
|
|
|
if (task->src == NULL) {
|
|
|
|
fprintf(stderr, "Unable to alloc src buffer\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* For fill, set the entire src buffer so we can check if verify is enabled. */
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_FILL) {
|
2020-12-21 12:17:06 +00:00
|
|
|
memset(task->src, g_fill_pattern, g_xfer_size_bytes);
|
2022-04-19 12:35:39 +00:00
|
|
|
} else if (g_workload_selection == ACCEL_OPC_COMPRESS) {
|
|
|
|
memcpy(task->src, task->worker->rnd_data, g_xfer_size_bytes);
|
2020-12-21 12:17:06 +00:00
|
|
|
} else {
|
|
|
|
memset(task->src, DATA_PATTERN, g_xfer_size_bytes);
|
|
|
|
}
|
2020-12-08 19:14:10 +00:00
|
|
|
}
|
|
|
|
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection != ACCEL_OPC_CRC32C) {
|
2021-06-07 22:50:43 +00:00
|
|
|
task->dst = spdk_dma_zmalloc(dst_buff_len, align, NULL);
|
|
|
|
if (task->dst == NULL) {
|
|
|
|
fprintf(stderr, "Unable to alloc dst buffer\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2020-12-08 19:14:10 +00:00
|
|
|
|
2021-06-07 22:50:43 +00:00
|
|
|
/* For compare we want the buffers to match, otherwise not. */
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_COMPARE) {
|
2021-06-07 22:50:43 +00:00
|
|
|
memset(task->dst, DATA_PATTERN, dst_buff_len);
|
|
|
|
} else {
|
|
|
|
memset(task->dst, ~DATA_PATTERN, dst_buff_len);
|
|
|
|
}
|
2020-12-08 19:14:10 +00:00
|
|
|
}
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
/* For dualcast 2 buffers are needed for the operation. For compress we use the second buffer to
|
|
|
|
* store the original pre-compressed data so we have a copy of it when we go to decompress.
|
|
|
|
*/
|
|
|
|
if (g_workload_selection == ACCEL_OPC_DUALCAST || g_workload_selection == ACCEL_OPC_COMPRESS) {
|
2020-12-08 19:14:10 +00:00
|
|
|
task->dst2 = spdk_dma_zmalloc(g_xfer_size_bytes, align, NULL);
|
|
|
|
if (task->dst2 == NULL) {
|
|
|
|
fprintf(stderr, "Unable to alloc dst buffer\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
2022-04-19 12:35:39 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_DUALCAST) {
|
|
|
|
memset(task->dst2, ~DATA_PATTERN, g_xfer_size_bytes);
|
|
|
|
} else if (g_workload_selection == ACCEL_OPC_COMPRESS) {
|
|
|
|
/* copy the oriignal data to dst2 so we can compare it to
|
|
|
|
* the results of decompression if -y is used.
|
|
|
|
*/
|
|
|
|
assert(task->src); /* for scan-build */
|
|
|
|
memcpy(task->dst2, task->src, g_xfer_size_bytes);
|
|
|
|
}
|
2020-12-08 19:14:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
inline static struct ap_task *
|
|
|
|
_get_task(struct worker_thread *worker)
|
|
|
|
{
|
|
|
|
struct ap_task *task;
|
|
|
|
|
|
|
|
if (!TAILQ_EMPTY(&worker->tasks_pool)) {
|
|
|
|
task = TAILQ_FIRST(&worker->tasks_pool);
|
|
|
|
TAILQ_REMOVE(&worker->tasks_pool, task, link);
|
|
|
|
} else {
|
|
|
|
fprintf(stderr, "Unable to get ap_task\n");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return task;
|
|
|
|
}
|
|
|
|
|
2020-12-08 17:12:31 +00:00
|
|
|
/* Submit one operation using the same ap task that just completed. */
|
2020-02-13 22:13:53 +00:00
|
|
|
static void
|
2020-12-08 16:59:17 +00:00
|
|
|
_submit_single(struct worker_thread *worker, struct ap_task *task)
|
2020-02-13 22:13:53 +00:00
|
|
|
{
|
2020-04-29 22:57:06 +00:00
|
|
|
int random_num;
|
2020-06-12 17:58:31 +00:00
|
|
|
int rc = 0;
|
2021-08-24 21:08:29 +00:00
|
|
|
int flags = 0;
|
2020-02-13 22:13:53 +00:00
|
|
|
|
|
|
|
assert(worker);
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
switch (worker->workload) {
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_COPY:
|
2020-07-03 14:10:54 +00:00
|
|
|
rc = spdk_accel_submit_copy(worker->ch, task->dst, task->src,
|
2021-08-24 21:08:29 +00:00
|
|
|
g_xfer_size_bytes, flags, accel_done, task);
|
2020-04-28 22:23:19 +00:00
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_FILL:
|
2020-04-07 16:16:13 +00:00
|
|
|
/* For fill use the first byte of the task->dst buffer */
|
2020-07-03 14:08:47 +00:00
|
|
|
rc = spdk_accel_submit_fill(worker->ch, task->dst, *(uint8_t *)task->src,
|
2021-08-24 21:08:29 +00:00
|
|
|
g_xfer_size_bytes, flags, accel_done, task);
|
2020-04-28 22:23:19 +00:00
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_CRC32C:
|
2021-06-09 19:23:13 +00:00
|
|
|
rc = spdk_accel_submit_crc32cv(worker->ch, &task->crc_dst,
|
2020-12-21 12:17:06 +00:00
|
|
|
task->iovs, task->iov_cnt, g_crc32c_seed,
|
2021-01-18 16:07:49 +00:00
|
|
|
accel_done, task);
|
2020-04-28 22:23:19 +00:00
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_COPY_CRC32C:
|
2021-06-07 22:50:43 +00:00
|
|
|
rc = spdk_accel_submit_copy_crc32cv(worker->ch, task->dst, task->iovs, task->iov_cnt,
|
2021-08-24 21:08:29 +00:00
|
|
|
&task->crc_dst, g_crc32c_seed, flags, accel_done, task);
|
2021-06-07 22:50:43 +00:00
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_COMPARE:
|
2020-04-29 22:57:06 +00:00
|
|
|
random_num = rand() % 100;
|
|
|
|
if (random_num < g_fail_percent_goal) {
|
|
|
|
task->expected_status = -EILSEQ;
|
|
|
|
*(uint8_t *)task->dst = ~DATA_PATTERN;
|
|
|
|
} else {
|
|
|
|
task->expected_status = 0;
|
|
|
|
*(uint8_t *)task->dst = DATA_PATTERN;
|
|
|
|
}
|
2020-07-03 14:08:47 +00:00
|
|
|
rc = spdk_accel_submit_compare(worker->ch, task->dst, task->src,
|
2020-07-03 14:10:54 +00:00
|
|
|
g_xfer_size_bytes, accel_done, task);
|
2020-04-29 22:57:06 +00:00
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_DUALCAST:
|
2020-07-03 14:08:47 +00:00
|
|
|
rc = spdk_accel_submit_dualcast(worker->ch, task->dst, task->dst2,
|
2021-08-24 21:08:29 +00:00
|
|
|
task->src, g_xfer_size_bytes, flags, accel_done, task);
|
2020-04-30 22:09:17 +00:00
|
|
|
break;
|
2022-04-19 12:35:39 +00:00
|
|
|
case ACCEL_OPC_COMPRESS:
|
|
|
|
rc = spdk_accel_submit_compress(worker->ch, task->dst, task->src,
|
|
|
|
g_xfer_size_bytes, g_xfer_size_bytes, &task->output_size,
|
|
|
|
flags, accel_done, task);
|
|
|
|
break;
|
2020-04-28 22:23:19 +00:00
|
|
|
default:
|
2020-04-07 16:16:13 +00:00
|
|
|
assert(false);
|
2020-04-28 22:23:19 +00:00
|
|
|
break;
|
|
|
|
|
2020-04-07 16:16:13 +00:00
|
|
|
}
|
2020-06-12 17:58:31 +00:00
|
|
|
|
|
|
|
if (rc) {
|
2020-07-03 14:10:54 +00:00
|
|
|
accel_done(task, rc);
|
2020-06-12 17:58:31 +00:00
|
|
|
}
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
static void
|
2021-01-28 11:40:37 +00:00
|
|
|
_free_task_buffers(struct ap_task *task)
|
2020-12-08 16:59:17 +00:00
|
|
|
{
|
2020-12-21 12:17:06 +00:00
|
|
|
uint32_t i;
|
|
|
|
|
2022-03-15 17:43:07 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_CRC32C || g_workload_selection == ACCEL_OPC_COPY_CRC32C) {
|
2020-12-21 12:17:06 +00:00
|
|
|
if (task->iovs) {
|
|
|
|
for (i = 0; i < task->iov_cnt; i++) {
|
|
|
|
if (task->iovs[i].iov_base) {
|
|
|
|
spdk_dma_free(task->iovs[i].iov_base);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
free(task->iovs);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
spdk_dma_free(task->src);
|
|
|
|
}
|
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
spdk_dma_free(task->dst);
|
2022-04-19 12:35:39 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_DUALCAST || g_workload_selection == ACCEL_OPC_COMPRESS) {
|
2020-12-08 16:59:17 +00:00
|
|
|
spdk_dma_free(task->dst2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-06-07 22:50:43 +00:00
|
|
|
static int
|
|
|
|
_vector_memcmp(void *_dst, struct iovec *src_iovs, uint32_t iovcnt)
|
|
|
|
{
|
|
|
|
uint32_t i;
|
|
|
|
uint32_t ttl_len = 0;
|
|
|
|
uint8_t *dst = (uint8_t *)_dst;
|
|
|
|
|
|
|
|
for (i = 0; i < iovcnt; i++) {
|
|
|
|
if (memcmp(dst, src_iovs[i].iov_base, src_iovs[i].iov_len)) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
dst += src_iovs[i].iov_len;
|
|
|
|
ttl_len += src_iovs[i].iov_len;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ttl_len != iovcnt * g_xfer_size_bytes) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
static int _worker_stop(void *arg);
|
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
static void
|
2021-08-13 06:12:47 +00:00
|
|
|
accel_done(void *arg1, int status)
|
2020-02-13 22:13:53 +00:00
|
|
|
{
|
|
|
|
struct ap_task *task = arg1;
|
|
|
|
struct worker_thread *worker = task->worker;
|
2020-04-28 22:23:19 +00:00
|
|
|
uint32_t sw_crc32c;
|
2022-04-19 12:35:39 +00:00
|
|
|
int rc;
|
2020-02-13 22:13:53 +00:00
|
|
|
|
|
|
|
assert(worker);
|
|
|
|
assert(worker->current_queue_depth > 0);
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
if (!worker->is_draining && status == -EINVAL && worker->workload == ACCEL_OPC_COMPRESS) {
|
|
|
|
printf("Invalid configuration, compress workload needs ISA-L or IAA. Exiting\n");
|
|
|
|
_worker_stop(worker);
|
|
|
|
}
|
|
|
|
|
2021-08-13 06:12:47 +00:00
|
|
|
if (g_verify && status == 0) {
|
2022-04-19 12:35:39 +00:00
|
|
|
switch (worker->workload) {
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_COPY_CRC32C:
|
2021-06-07 22:50:43 +00:00
|
|
|
sw_crc32c = spdk_crc32c_iov_update(task->iovs, task->iov_cnt, ~g_crc32c_seed);
|
|
|
|
if (task->crc_dst != sw_crc32c) {
|
|
|
|
SPDK_NOTICELOG("CRC-32C miscompare\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
if (_vector_memcmp(task->dst, task->iovs, task->iov_cnt)) {
|
|
|
|
SPDK_NOTICELOG("Data miscompare\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_CRC32C:
|
2021-05-28 11:25:59 +00:00
|
|
|
sw_crc32c = spdk_crc32c_iov_update(task->iovs, task->iov_cnt, ~g_crc32c_seed);
|
2021-06-09 19:23:13 +00:00
|
|
|
if (task->crc_dst != sw_crc32c) {
|
2020-04-28 22:23:19 +00:00
|
|
|
SPDK_NOTICELOG("CRC-32C miscompare\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
2020-04-29 22:57:06 +00:00
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_COPY:
|
2020-04-29 22:57:06 +00:00
|
|
|
if (memcmp(task->src, task->dst, g_xfer_size_bytes)) {
|
|
|
|
SPDK_NOTICELOG("Data miscompare\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_DUALCAST:
|
2020-04-30 22:09:17 +00:00
|
|
|
if (memcmp(task->src, task->dst, g_xfer_size_bytes)) {
|
|
|
|
SPDK_NOTICELOG("Data miscompare, first destination\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
if (memcmp(task->src, task->dst2, g_xfer_size_bytes)) {
|
|
|
|
SPDK_NOTICELOG("Data miscompare, second destination\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_FILL:
|
2020-06-18 19:56:01 +00:00
|
|
|
if (memcmp(task->dst, task->src, g_xfer_size_bytes)) {
|
|
|
|
SPDK_NOTICELOG("Data miscompare\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
break;
|
2022-03-15 17:43:07 +00:00
|
|
|
case ACCEL_OPC_COMPARE:
|
2020-06-18 22:46:27 +00:00
|
|
|
break;
|
2022-04-19 12:35:39 +00:00
|
|
|
case ACCEL_OPC_COMPRESS:
|
|
|
|
/* We've completed the compression phase, now need to uncompress the compressed data
|
|
|
|
* and compare that to the original buffer to see if it matches. So we flip flor
|
|
|
|
* src and destination then compare task->src to task->dst which is where we saved
|
|
|
|
* the orgiinal data.
|
|
|
|
*/
|
|
|
|
if (!worker->is_draining) {
|
|
|
|
worker->workload = ACCEL_OPC_DECOMPRESS;
|
|
|
|
worker->xfer_completed++;
|
|
|
|
memset(task->src, 0, g_xfer_size_bytes);
|
|
|
|
rc = spdk_accel_submit_decompress(worker->ch, task->src, task->dst,
|
|
|
|
g_xfer_size_bytes, g_xfer_size_bytes, 0, accel_done, task);
|
|
|
|
if (rc) {
|
|
|
|
SPDK_NOTICELOG("Unable to submit decomrpess for verficiation, tc = %d\n", rc);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ACCEL_OPC_DECOMPRESS:
|
|
|
|
worker->workload = ACCEL_OPC_COMPRESS;
|
|
|
|
if (memcmp(task->dst2, task->src, g_xfer_size_bytes)) {
|
|
|
|
SPDK_NOTICELOG("Data miscompare after decompression\n");
|
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
break;
|
2020-04-29 22:57:06 +00:00
|
|
|
default:
|
|
|
|
assert(false);
|
|
|
|
break;
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
}
|
2020-04-29 22:57:06 +00:00
|
|
|
|
|
|
|
if (task->expected_status == -EILSEQ) {
|
2021-08-13 06:12:47 +00:00
|
|
|
assert(status != 0);
|
2020-04-29 22:57:06 +00:00
|
|
|
worker->injected_miscompares++;
|
2022-04-19 12:35:39 +00:00
|
|
|
status = 0;
|
2021-08-13 06:12:47 +00:00
|
|
|
} else if (status) {
|
2020-12-08 17:12:31 +00:00
|
|
|
/* Expected to pass but the accel engine reported an error (ex: COMPARE operation). */
|
2020-04-29 22:57:06 +00:00
|
|
|
worker->xfer_failed++;
|
|
|
|
}
|
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
worker->xfer_completed++;
|
|
|
|
worker->current_queue_depth--;
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
if (!worker->is_draining && status == 0) {
|
2021-06-21 18:06:28 +00:00
|
|
|
TAILQ_INSERT_TAIL(&worker->tasks_pool, task, link);
|
|
|
|
task = _get_task(worker);
|
2021-10-12 22:05:31 +00:00
|
|
|
_submit_single(worker, task);
|
|
|
|
worker->current_queue_depth++;
|
2021-01-26 20:06:25 +00:00
|
|
|
} else {
|
|
|
|
TAILQ_INSERT_TAIL(&worker->tasks_pool, task, link);
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
dump_result(void)
|
|
|
|
{
|
|
|
|
uint64_t total_completed = 0;
|
|
|
|
uint64_t total_failed = 0;
|
2020-04-29 22:57:06 +00:00
|
|
|
uint64_t total_miscompared = 0;
|
2020-02-13 22:13:53 +00:00
|
|
|
uint64_t total_xfer_per_sec, total_bw_in_MiBps;
|
|
|
|
struct worker_thread *worker = g_workers;
|
|
|
|
|
2021-02-09 00:00:37 +00:00
|
|
|
printf("\nCore,Thread Transfers Bandwidth Failed Miscompares\n");
|
|
|
|
printf("------------------------------------------------------------------------\n");
|
2020-02-13 22:13:53 +00:00
|
|
|
while (worker != NULL) {
|
|
|
|
|
|
|
|
uint64_t xfer_per_sec = worker->xfer_completed / g_time_in_sec;
|
|
|
|
uint64_t bw_in_MiBps = (worker->xfer_completed * g_xfer_size_bytes) /
|
|
|
|
(g_time_in_sec * 1024 * 1024);
|
|
|
|
|
|
|
|
total_completed += worker->xfer_completed;
|
|
|
|
total_failed += worker->xfer_failed;
|
2020-04-29 22:57:06 +00:00
|
|
|
total_miscompared += worker->injected_miscompares;
|
2020-02-13 22:13:53 +00:00
|
|
|
|
|
|
|
if (xfer_per_sec) {
|
2021-02-09 00:00:37 +00:00
|
|
|
printf("%u,%u%17" PRIu64 "/s%9" PRIu64 " MiB/s%7" PRIu64 " %11" PRIu64 "\n",
|
|
|
|
worker->display.core, worker->display.thread, xfer_per_sec,
|
2020-04-29 22:57:06 +00:00
|
|
|
bw_in_MiBps, worker->xfer_failed, worker->injected_miscompares);
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
worker = worker->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
total_xfer_per_sec = total_completed / g_time_in_sec;
|
|
|
|
total_bw_in_MiBps = (total_completed * g_xfer_size_bytes) /
|
|
|
|
(g_time_in_sec * 1024 * 1024);
|
|
|
|
|
2021-02-09 00:00:37 +00:00
|
|
|
printf("=========================================================================\n");
|
|
|
|
printf("Total:%15" PRIu64 "/s%9" PRIu64 " MiB/s%6" PRIu64 " %11" PRIu64"\n\n",
|
2020-04-29 22:57:06 +00:00
|
|
|
total_xfer_per_sec, total_bw_in_MiBps, total_failed, total_miscompared);
|
2020-02-13 22:13:53 +00:00
|
|
|
|
|
|
|
return total_failed ? 1 : 0;
|
|
|
|
}
|
|
|
|
|
2021-01-28 11:40:37 +00:00
|
|
|
static inline void
|
|
|
|
_free_task_buffers_in_pool(struct worker_thread *worker)
|
|
|
|
{
|
|
|
|
struct ap_task *task;
|
|
|
|
|
|
|
|
assert(worker);
|
|
|
|
while ((task = TAILQ_FIRST(&worker->tasks_pool))) {
|
|
|
|
TAILQ_REMOVE(&worker->tasks_pool, task, link);
|
|
|
|
_free_task_buffers(task);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
static int
|
|
|
|
_check_draining(void *arg)
|
|
|
|
{
|
|
|
|
struct worker_thread *worker = arg;
|
|
|
|
|
|
|
|
assert(worker);
|
|
|
|
|
|
|
|
if (worker->current_queue_depth == 0) {
|
2021-01-28 11:40:37 +00:00
|
|
|
_free_task_buffers_in_pool(worker);
|
2020-02-13 22:13:53 +00:00
|
|
|
spdk_poller_unregister(&worker->is_draining_poller);
|
|
|
|
unregister_worker(worker);
|
|
|
|
}
|
|
|
|
|
2021-07-01 18:45:51 +00:00
|
|
|
return SPDK_POLLER_BUSY;
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
_worker_stop(void *arg)
|
|
|
|
{
|
|
|
|
struct worker_thread *worker = arg;
|
|
|
|
|
|
|
|
assert(worker);
|
|
|
|
|
|
|
|
spdk_poller_unregister(&worker->stop_poller);
|
|
|
|
|
|
|
|
/* now let the worker drain and check it's outstanding IO with a poller */
|
|
|
|
worker->is_draining = true;
|
2020-04-14 06:49:46 +00:00
|
|
|
worker->is_draining_poller = SPDK_POLLER_REGISTER(_check_draining, worker, 0);
|
2020-02-13 22:13:53 +00:00
|
|
|
|
2021-07-01 18:45:51 +00:00
|
|
|
return SPDK_POLLER_BUSY;
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
_init_thread(void *arg1)
|
|
|
|
{
|
|
|
|
struct worker_thread *worker;
|
|
|
|
struct ap_task *task;
|
2021-10-12 22:05:31 +00:00
|
|
|
int i, num_tasks = g_allocate_depth;
|
2021-02-09 00:00:37 +00:00
|
|
|
struct display_info *display = arg1;
|
2022-04-19 12:35:39 +00:00
|
|
|
uint8_t *offset;
|
|
|
|
uint64_t j;
|
2020-02-13 22:13:53 +00:00
|
|
|
|
|
|
|
worker = calloc(1, sizeof(*worker));
|
|
|
|
if (worker == NULL) {
|
|
|
|
fprintf(stderr, "Unable to allocate worker\n");
|
2021-02-09 00:00:37 +00:00
|
|
|
free(display);
|
2020-02-13 22:13:53 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
worker->workload = g_workload_selection;
|
2021-02-09 00:00:37 +00:00
|
|
|
worker->display.core = display->core;
|
|
|
|
worker->display.thread = display->thread;
|
|
|
|
free(display);
|
2020-02-13 22:13:53 +00:00
|
|
|
worker->core = spdk_env_get_current_core();
|
|
|
|
worker->thread = spdk_get_thread();
|
2021-02-07 18:46:50 +00:00
|
|
|
pthread_mutex_lock(&g_workers_lock);
|
|
|
|
g_num_workers++;
|
2020-02-13 22:13:53 +00:00
|
|
|
worker->next = g_workers;
|
2021-02-07 18:46:50 +00:00
|
|
|
g_workers = worker;
|
|
|
|
pthread_mutex_unlock(&g_workers_lock);
|
2020-02-13 22:13:53 +00:00
|
|
|
worker->ch = spdk_accel_engine_get_io_channel();
|
2022-04-11 19:45:34 +00:00
|
|
|
if (worker->ch == NULL) {
|
|
|
|
fprintf(stderr, "Unable to get an accel channel\n");
|
|
|
|
goto error;
|
|
|
|
}
|
2020-04-29 22:57:06 +00:00
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
TAILQ_INIT(&worker->tasks_pool);
|
2020-12-08 17:12:31 +00:00
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
worker->task_base = calloc(num_tasks, sizeof(struct ap_task));
|
|
|
|
if (worker->task_base == NULL) {
|
|
|
|
fprintf(stderr, "Could not allocate task base.\n");
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
if (g_workload_selection == ACCEL_OPC_COMPRESS) {
|
|
|
|
worker->rnd_data = calloc(1, g_xfer_size_bytes);
|
|
|
|
if (worker->rnd_data == NULL) {
|
|
|
|
printf("unable to allcoate rnd_data buffer\n");
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
/* only fill half the data buffer with rnd data to make it more
|
|
|
|
* compressible.
|
|
|
|
*/
|
|
|
|
offset = worker->rnd_data;
|
|
|
|
for (j = 0; j < g_xfer_size_bytes / sizeof(uint8_t) / 2; j++) {
|
|
|
|
*offset = rand() % 256;
|
|
|
|
offset++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-12-08 16:59:17 +00:00
|
|
|
task = worker->task_base;
|
2020-07-13 22:14:57 +00:00
|
|
|
for (i = 0; i < num_tasks; i++) {
|
2020-12-08 16:59:17 +00:00
|
|
|
TAILQ_INSERT_TAIL(&worker->tasks_pool, task, link);
|
2021-06-21 17:41:12 +00:00
|
|
|
task->worker = worker;
|
2020-12-08 16:59:17 +00:00
|
|
|
if (_get_task_data_bufs(task)) {
|
|
|
|
fprintf(stderr, "Unable to get data bufs\n");
|
|
|
|
goto error;
|
2020-07-13 22:14:57 +00:00
|
|
|
}
|
2020-12-08 16:59:17 +00:00
|
|
|
task++;
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Register a poller that will stop the worker at time elapsed */
|
2020-04-14 06:49:46 +00:00
|
|
|
worker->stop_poller = SPDK_POLLER_REGISTER(_worker_stop, worker,
|
2020-02-13 22:13:53 +00:00
|
|
|
g_time_in_sec * 1000000ULL);
|
|
|
|
|
2021-10-12 22:05:31 +00:00
|
|
|
/* Load up queue depth worth of operations. */
|
|
|
|
for (i = 0; i < g_queue_depth; i++) {
|
2020-12-08 16:59:17 +00:00
|
|
|
task = _get_task(worker);
|
2021-06-21 17:41:12 +00:00
|
|
|
worker->current_queue_depth++;
|
2020-12-08 16:59:17 +00:00
|
|
|
if (task == NULL) {
|
2020-06-02 18:27:47 +00:00
|
|
|
goto error;
|
2020-04-29 22:57:06 +00:00
|
|
|
}
|
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
_submit_single(worker, task);
|
|
|
|
}
|
2020-06-02 18:27:47 +00:00
|
|
|
return;
|
|
|
|
error:
|
2021-01-28 11:40:37 +00:00
|
|
|
|
2022-04-19 12:35:39 +00:00
|
|
|
free(worker->rnd_data);
|
2021-01-28 11:40:37 +00:00
|
|
|
_free_task_buffers_in_pool(worker);
|
2020-12-08 16:59:17 +00:00
|
|
|
free(worker->task_base);
|
2020-06-02 18:27:47 +00:00
|
|
|
spdk_app_stop(-1);
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
accel_perf_start(void *arg1)
|
|
|
|
{
|
2021-02-07 18:46:50 +00:00
|
|
|
struct spdk_cpuset tmp_cpumask = {};
|
|
|
|
char thread_name[32];
|
|
|
|
uint32_t i;
|
2021-02-09 00:00:37 +00:00
|
|
|
int j;
|
2021-02-07 18:46:50 +00:00
|
|
|
struct spdk_thread *thread;
|
2021-02-09 00:00:37 +00:00
|
|
|
struct display_info *display;
|
2020-04-24 16:50:46 +00:00
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
g_tsc_rate = spdk_get_ticks_hz();
|
|
|
|
g_tsc_end = spdk_get_ticks() + g_time_in_sec * g_tsc_rate;
|
|
|
|
|
2022-06-08 00:11:12 +00:00
|
|
|
dump_user_config();
|
|
|
|
|
2020-02-13 22:13:53 +00:00
|
|
|
printf("Running for %d seconds...\n", g_time_in_sec);
|
|
|
|
fflush(stdout);
|
|
|
|
|
2021-02-07 18:46:50 +00:00
|
|
|
/* Create worker threads for each core that was specified. */
|
|
|
|
SPDK_ENV_FOREACH_CORE(i) {
|
2021-02-09 00:00:37 +00:00
|
|
|
for (j = 0; j < g_threads_per_core; j++) {
|
|
|
|
snprintf(thread_name, sizeof(thread_name), "ap_worker_%u_%u", i, j);
|
|
|
|
spdk_cpuset_zero(&tmp_cpumask);
|
|
|
|
spdk_cpuset_set_cpu(&tmp_cpumask, i, true);
|
|
|
|
thread = spdk_thread_create(thread_name, &tmp_cpumask);
|
|
|
|
display = calloc(1, sizeof(*display));
|
|
|
|
if (display == NULL) {
|
|
|
|
fprintf(stderr, "Unable to allocate memory\n");
|
|
|
|
spdk_app_stop(-1);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
display->core = i;
|
|
|
|
display->thread = j;
|
|
|
|
spdk_thread_send_msg(thread, _init_thread, display);
|
|
|
|
}
|
2021-02-07 18:46:50 +00:00
|
|
|
}
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
struct worker_thread *worker, *tmp;
|
|
|
|
|
|
|
|
pthread_mutex_init(&g_workers_lock, NULL);
|
2022-06-08 00:11:12 +00:00
|
|
|
spdk_app_opts_init(&g_opts, sizeof(g_opts));
|
|
|
|
g_opts.name = "accel_perf";
|
|
|
|
g_opts.reactor_mask = "0x1";
|
|
|
|
if (spdk_app_parse_args(argc, argv, &g_opts, "a:C:o:q:t:yw:P:f:T:", NULL, parse_args,
|
2020-10-22 18:37:39 +00:00
|
|
|
usage) != SPDK_APP_PARSE_ARGS_SUCCESS) {
|
2021-02-08 17:19:29 +00:00
|
|
|
g_rc = -1;
|
2020-02-13 22:13:53 +00:00
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
2022-03-15 17:43:07 +00:00
|
|
|
if ((g_workload_selection != ACCEL_OPC_COPY) &&
|
|
|
|
(g_workload_selection != ACCEL_OPC_FILL) &&
|
|
|
|
(g_workload_selection != ACCEL_OPC_CRC32C) &&
|
|
|
|
(g_workload_selection != ACCEL_OPC_COPY_CRC32C) &&
|
|
|
|
(g_workload_selection != ACCEL_OPC_COMPARE) &&
|
2022-04-19 12:35:39 +00:00
|
|
|
(g_workload_selection != ACCEL_OPC_DUALCAST) &&
|
|
|
|
(g_workload_selection != ACCEL_OPC_COMPRESS)) {
|
2020-04-07 16:16:13 +00:00
|
|
|
usage();
|
2021-02-08 17:19:29 +00:00
|
|
|
g_rc = -1;
|
2020-04-07 16:16:13 +00:00
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
2021-06-21 17:38:43 +00:00
|
|
|
if (g_allocate_depth > 0 && g_queue_depth > g_allocate_depth) {
|
|
|
|
fprintf(stdout, "allocate depth must be at least as big as queue depth\n");
|
|
|
|
usage();
|
|
|
|
g_rc = -1;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (g_allocate_depth == 0) {
|
|
|
|
g_allocate_depth = g_queue_depth;
|
|
|
|
}
|
|
|
|
|
2022-03-15 17:43:07 +00:00
|
|
|
if ((g_workload_selection == ACCEL_OPC_CRC32C || g_workload_selection == ACCEL_OPC_COPY_CRC32C) &&
|
2020-12-21 12:17:06 +00:00
|
|
|
g_crc32c_chained_count == 0) {
|
|
|
|
usage();
|
|
|
|
g_rc = -1;
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
2022-06-08 00:11:12 +00:00
|
|
|
g_rc = spdk_app_start(&g_opts, accel_perf_start, NULL);
|
2021-02-08 17:19:29 +00:00
|
|
|
if (g_rc) {
|
2020-02-13 22:13:53 +00:00
|
|
|
SPDK_ERRLOG("ERROR starting application\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
pthread_mutex_destroy(&g_workers_lock);
|
|
|
|
|
|
|
|
worker = g_workers;
|
|
|
|
while (worker) {
|
|
|
|
tmp = worker->next;
|
|
|
|
free(worker);
|
|
|
|
worker = tmp;
|
|
|
|
}
|
|
|
|
cleanup:
|
|
|
|
spdk_app_fini();
|
2021-02-08 17:19:29 +00:00
|
|
|
return g_rc;
|
2020-02-13 22:13:53 +00:00
|
|
|
}
|