1 /* SPDX-License-Identifier: BSD-3-Clause 2 * Copyright (C) 2018 Intel Corporation. 3 * All rights reserved. 4 * Copyright (c) 2021, 2022 NVIDIA CORPORATION & AFFILIATES. All rights reserved. 5 */ 6 7 #include "spdk_internal/cunit.h" 8 /* We have our own mock for this */ 9 #define UNIT_TEST_NO_VTOPHYS 10 #include "common/lib/test_env.c" 11 #include "spdk_internal/mock.h" 12 #include "thread/thread_internal.h" 13 #include "unit/lib/json_mock.c" 14 15 #include <rte_compressdev.h> 16 17 /* There will be one if the data perfectly matches the chunk size, 18 * or there could be an offset into the data and a remainder after 19 * the data or both for a max of 3. 20 */ 21 #define UT_MBUFS_PER_OP 3 22 /* For testing the crossing of a huge page boundary on address translation, 23 * we'll have an extra one but we only test on the source side. 24 */ 25 #define UT_MBUFS_PER_OP_BOUND_TEST 4 26 27 struct spdk_io_channel *g_io_ch; 28 struct rte_comp_op g_comp_op[2]; 29 struct comp_device_qp g_device_qp; 30 struct compress_dev g_device; 31 struct rte_compressdev_capabilities g_cdev_cap; 32 static struct rte_mbuf *g_src_mbufs[UT_MBUFS_PER_OP_BOUND_TEST]; 33 static struct rte_mbuf *g_dst_mbufs[UT_MBUFS_PER_OP]; 34 static struct rte_mbuf g_expected_src_mbufs[UT_MBUFS_PER_OP_BOUND_TEST]; 35 static struct rte_mbuf g_expected_dst_mbufs[UT_MBUFS_PER_OP]; 36 struct compress_io_channel *g_comp_ch; 37 38 /* Those functions are defined as static inline in DPDK, so we can't 39 * mock them straight away. We use defines to redirect them into 40 * our custom functions. 41 */ 42 43 static int ut_total_rte_pktmbuf_attach_extbuf = 0; 44 static void mock_rte_pktmbuf_attach_extbuf(struct rte_mbuf *m, void *buf_addr, rte_iova_t buf_iova, 45 uint16_t buf_len, struct rte_mbuf_ext_shared_info *shinfo); 46 #define rte_pktmbuf_attach_extbuf mock_rte_pktmbuf_attach_extbuf 47 static void 48 mock_rte_pktmbuf_attach_extbuf(struct rte_mbuf *m, void *buf_addr, rte_iova_t buf_iova, 49 uint16_t buf_len, struct rte_mbuf_ext_shared_info *shinfo) 50 { 51 assert(m != NULL); 52 m->buf_addr = buf_addr; 53 m->buf_iova = buf_iova; 54 m->buf_len = buf_len; 55 m->data_len = m->pkt_len = 0; 56 ut_total_rte_pktmbuf_attach_extbuf++; 57 } 58 59 static char *mock_rte_pktmbuf_append(struct rte_mbuf *m, uint16_t len); 60 #define rte_pktmbuf_append mock_rte_pktmbuf_append 61 static char * 62 mock_rte_pktmbuf_append(struct rte_mbuf *m, uint16_t len) 63 { 64 m->pkt_len = m->pkt_len + len; 65 return NULL; 66 } 67 68 static inline int mock_rte_pktmbuf_chain(struct rte_mbuf *head, struct rte_mbuf *tail); 69 #define rte_pktmbuf_chain mock_rte_pktmbuf_chain 70 static inline int 71 mock_rte_pktmbuf_chain(struct rte_mbuf *head, struct rte_mbuf *tail) 72 { 73 struct rte_mbuf *cur_tail; 74 75 cur_tail = rte_pktmbuf_lastseg(head); 76 cur_tail->next = tail; 77 78 return 0; 79 } 80 81 uint16_t ut_max_nb_queue_pairs = 0; 82 void __rte_experimental mock_rte_compressdev_info_get(uint8_t dev_id, 83 struct rte_compressdev_info *dev_info); 84 #define rte_compressdev_info_get mock_rte_compressdev_info_get 85 void __rte_experimental 86 mock_rte_compressdev_info_get(uint8_t dev_id, struct rte_compressdev_info *dev_info) 87 { 88 dev_info->max_nb_queue_pairs = ut_max_nb_queue_pairs; 89 dev_info->capabilities = &g_cdev_cap; 90 dev_info->driver_name = "compressdev"; 91 } 92 93 int ut_rte_compressdev_configure = 0; 94 int __rte_experimental mock_rte_compressdev_configure(uint8_t dev_id, 95 struct rte_compressdev_config *config); 96 #define rte_compressdev_configure mock_rte_compressdev_configure 97 int __rte_experimental 98 mock_rte_compressdev_configure(uint8_t dev_id, struct rte_compressdev_config *config) 99 { 100 return ut_rte_compressdev_configure; 101 } 102 103 int ut_rte_compressdev_queue_pair_setup = 0; 104 int __rte_experimental mock_rte_compressdev_queue_pair_setup(uint8_t dev_id, uint16_t queue_pair_id, 105 uint32_t max_inflight_ops, int socket_id); 106 #define rte_compressdev_queue_pair_setup mock_rte_compressdev_queue_pair_setup 107 int __rte_experimental 108 mock_rte_compressdev_queue_pair_setup(uint8_t dev_id, uint16_t queue_pair_id, 109 uint32_t max_inflight_ops, int socket_id) 110 { 111 return ut_rte_compressdev_queue_pair_setup; 112 } 113 114 int ut_rte_compressdev_start = 0; 115 int __rte_experimental mock_rte_compressdev_start(uint8_t dev_id); 116 #define rte_compressdev_start mock_rte_compressdev_start 117 int __rte_experimental 118 mock_rte_compressdev_start(uint8_t dev_id) 119 { 120 return ut_rte_compressdev_start; 121 } 122 123 int ut_rte_compressdev_private_xform_create = 0; 124 int __rte_experimental mock_rte_compressdev_private_xform_create(uint8_t dev_id, 125 const struct rte_comp_xform *xform, void **private_xform); 126 #define rte_compressdev_private_xform_create mock_rte_compressdev_private_xform_create 127 int __rte_experimental 128 mock_rte_compressdev_private_xform_create(uint8_t dev_id, 129 const struct rte_comp_xform *xform, void **private_xform) 130 { 131 return ut_rte_compressdev_private_xform_create; 132 } 133 134 uint8_t ut_rte_compressdev_count = 0; 135 uint8_t __rte_experimental mock_rte_compressdev_count(void); 136 #define rte_compressdev_count mock_rte_compressdev_count 137 uint8_t __rte_experimental 138 mock_rte_compressdev_count(void) 139 { 140 return ut_rte_compressdev_count; 141 } 142 143 struct rte_mempool *ut_rte_comp_op_pool_create = NULL; 144 struct rte_mempool *__rte_experimental mock_rte_comp_op_pool_create(const char *name, 145 unsigned int nb_elts, unsigned int cache_size, uint16_t user_size, 146 int socket_id); 147 #define rte_comp_op_pool_create mock_rte_comp_op_pool_create 148 struct rte_mempool *__rte_experimental 149 mock_rte_comp_op_pool_create(const char *name, unsigned int nb_elts, 150 unsigned int cache_size, uint16_t user_size, int socket_id) 151 { 152 return ut_rte_comp_op_pool_create; 153 } 154 155 void mock_rte_pktmbuf_free(struct rte_mbuf *m); 156 #define rte_pktmbuf_free mock_rte_pktmbuf_free 157 void 158 mock_rte_pktmbuf_free(struct rte_mbuf *m) 159 { 160 } 161 162 void mock_rte_pktmbuf_free_bulk(struct rte_mbuf **m, unsigned int cnt); 163 #define rte_pktmbuf_free_bulk mock_rte_pktmbuf_free_bulk 164 void 165 mock_rte_pktmbuf_free_bulk(struct rte_mbuf **m, unsigned int cnt) 166 { 167 } 168 169 static bool ut_boundary_alloc = false; 170 static int ut_rte_pktmbuf_alloc_bulk = 0; 171 int mock_rte_pktmbuf_alloc_bulk(struct rte_mempool *pool, struct rte_mbuf **mbufs, 172 unsigned count); 173 #define rte_pktmbuf_alloc_bulk mock_rte_pktmbuf_alloc_bulk 174 int 175 mock_rte_pktmbuf_alloc_bulk(struct rte_mempool *pool, struct rte_mbuf **mbufs, 176 unsigned count) 177 { 178 int i; 179 180 /* This mocked function only supports the alloc of up to 3 src and 3 dst. */ 181 ut_rte_pktmbuf_alloc_bulk += count; 182 183 if (ut_rte_pktmbuf_alloc_bulk == 1) { 184 /* allocation of an extra mbuf for boundary cross test */ 185 ut_boundary_alloc = true; 186 g_src_mbufs[UT_MBUFS_PER_OP_BOUND_TEST - 1]->next = NULL; 187 *mbufs = g_src_mbufs[UT_MBUFS_PER_OP_BOUND_TEST - 1]; 188 ut_rte_pktmbuf_alloc_bulk = 0; 189 } else if (ut_rte_pktmbuf_alloc_bulk == UT_MBUFS_PER_OP) { 190 /* first test allocation, src mbufs */ 191 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 192 g_src_mbufs[i]->next = NULL; 193 *mbufs++ = g_src_mbufs[i]; 194 } 195 } else if (ut_rte_pktmbuf_alloc_bulk == UT_MBUFS_PER_OP * 2) { 196 /* second test allocation, dst mbufs */ 197 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 198 g_dst_mbufs[i]->next = NULL; 199 *mbufs++ = g_dst_mbufs[i]; 200 } 201 ut_rte_pktmbuf_alloc_bulk = 0; 202 } else { 203 return -1; 204 } 205 return 0; 206 } 207 208 struct rte_mempool * 209 rte_pktmbuf_pool_create(const char *name, unsigned n, unsigned cache_size, 210 uint16_t priv_size, uint16_t data_room_size, int socket_id) 211 { 212 struct spdk_mempool *tmp; 213 214 tmp = spdk_mempool_create("mbuf_mp", 1024, sizeof(struct rte_mbuf), 215 SPDK_MEMPOOL_DEFAULT_CACHE_SIZE, 216 SPDK_ENV_SOCKET_ID_ANY); 217 218 return (struct rte_mempool *)tmp; 219 } 220 221 void 222 rte_mempool_free(struct rte_mempool *mp) 223 { 224 if (mp) { 225 spdk_mempool_free((struct spdk_mempool *)mp); 226 } 227 } 228 229 #include "accel/dpdk_compressdev/accel_dpdk_compressdev.c" 230 231 static void _compress_done(void *arg, int status); 232 static int ut_expected_task_status = 0; 233 void 234 spdk_accel_task_complete(struct spdk_accel_task *accel_task, int status) 235 { 236 CU_ASSERT(status == ut_expected_task_status); 237 accel_task->cb_fn(accel_task, status); 238 } 239 240 /* SPDK stubs */ 241 DEFINE_STUB_V(spdk_accel_module_finish, (void)); 242 DEFINE_STUB_V(spdk_accel_module_list_add, (struct spdk_accel_module_if *accel_module)); 243 244 /* DPDK stubs */ 245 DEFINE_STUB(rte_compressdev_capability_get, const struct rte_compressdev_capabilities *, 246 (uint8_t dev_id, 247 enum rte_comp_algorithm algo), NULL); 248 #define DPDK_DYNFIELD_OFFSET offsetof(struct rte_mbuf, dynfield1[1]) 249 DEFINE_STUB(rte_mbuf_dynfield_register, int, (const struct rte_mbuf_dynfield *params), 250 DPDK_DYNFIELD_OFFSET); 251 DEFINE_STUB(rte_socket_id, unsigned, (void), 0); 252 DEFINE_STUB(rte_vdev_init, int, (const char *name, const char *args), 0); 253 DEFINE_STUB_V(rte_comp_op_free, (struct rte_comp_op *op)); 254 DEFINE_STUB(rte_comp_op_alloc, struct rte_comp_op *, (struct rte_mempool *mempool), NULL); 255 256 int g_small_size_counter = 0; 257 int g_small_size_modify = 0; 258 uint64_t g_small_size = 0; 259 uint64_t 260 spdk_vtophys(const void *buf, uint64_t *size) 261 { 262 g_small_size_counter++; 263 if (g_small_size_counter == g_small_size_modify) { 264 *size = g_small_size; 265 g_small_size_counter = 0; 266 g_small_size_modify = 0; 267 } 268 return (uint64_t)buf; 269 } 270 271 static uint16_t ut_rte_compressdev_dequeue_burst = 0; 272 uint16_t 273 rte_compressdev_dequeue_burst(uint8_t dev_id, uint16_t qp_id, struct rte_comp_op **ops, 274 uint16_t nb_op) 275 { 276 if (ut_rte_compressdev_dequeue_burst == 0) { 277 return 0; 278 } 279 280 ops[0] = &g_comp_op[0]; 281 ops[1] = &g_comp_op[1]; 282 283 return ut_rte_compressdev_dequeue_burst; 284 } 285 286 static uint16_t g_done_count = 1; 287 static void 288 _compress_done(void *arg, int status) 289 { 290 struct spdk_accel_task *task = arg; 291 292 if (status == 0) { 293 CU_ASSERT(*task->output_size == g_comp_op[g_done_count++].produced); 294 } 295 } 296 297 static void 298 _get_mbuf_array(struct rte_mbuf **mbuf_array, struct rte_mbuf *mbuf_head, 299 int mbuf_count, bool null_final) 300 { 301 int i; 302 303 for (i = 0; i < mbuf_count; i++) { 304 mbuf_array[i] = mbuf_head; 305 if (mbuf_head) { 306 mbuf_head = mbuf_head->next; 307 } 308 } 309 if (null_final) { 310 mbuf_array[i - 1] = NULL; 311 } 312 } 313 314 #define FAKE_ENQUEUE_SUCCESS 255 315 #define FAKE_ENQUEUE_ERROR 128 316 #define FAKE_ENQUEUE_BUSY 64 317 static uint16_t ut_enqueue_value = FAKE_ENQUEUE_SUCCESS; 318 static struct rte_comp_op ut_expected_op; 319 uint16_t 320 rte_compressdev_enqueue_burst(uint8_t dev_id, uint16_t qp_id, struct rte_comp_op **ops, 321 uint16_t nb_ops) 322 { 323 struct rte_comp_op *op = *ops; 324 struct rte_mbuf *op_mbuf[UT_MBUFS_PER_OP_BOUND_TEST]; 325 struct rte_mbuf *exp_mbuf[UT_MBUFS_PER_OP_BOUND_TEST]; 326 int i, num_src_mbufs = UT_MBUFS_PER_OP; 327 328 switch (ut_enqueue_value) { 329 case FAKE_ENQUEUE_BUSY: 330 op->status = RTE_COMP_OP_STATUS_NOT_PROCESSED; 331 return 0; 332 case FAKE_ENQUEUE_SUCCESS: 333 op->status = RTE_COMP_OP_STATUS_SUCCESS; 334 return 1; 335 case FAKE_ENQUEUE_ERROR: 336 op->status = RTE_COMP_OP_STATUS_ERROR; 337 return 0; 338 default: 339 break; 340 } 341 342 /* by design the compress module will never send more than 1 op at a time */ 343 CU_ASSERT(op->private_xform == ut_expected_op.private_xform); 344 345 /* setup our local pointers to the chained mbufs, those pointed to in the 346 * operation struct and the expected values. 347 */ 348 _get_mbuf_array(op_mbuf, op->m_src, SPDK_COUNTOF(op_mbuf), true); 349 _get_mbuf_array(exp_mbuf, ut_expected_op.m_src, SPDK_COUNTOF(exp_mbuf), true); 350 351 if (ut_boundary_alloc == true) { 352 /* if we crossed a boundary, we need to check the 4th src mbuf and 353 * reset the global that is used to identify whether we crossed 354 * or not 355 */ 356 num_src_mbufs = UT_MBUFS_PER_OP_BOUND_TEST; 357 exp_mbuf[UT_MBUFS_PER_OP_BOUND_TEST - 1] = ut_expected_op.m_src->next->next->next; 358 op_mbuf[UT_MBUFS_PER_OP_BOUND_TEST - 1] = op->m_src->next->next->next; 359 ut_boundary_alloc = false; 360 } 361 362 for (i = 0; i < num_src_mbufs; i++) { 363 CU_ASSERT(op_mbuf[i]->buf_addr == exp_mbuf[i]->buf_addr); 364 CU_ASSERT(op_mbuf[i]->buf_iova == exp_mbuf[i]->buf_iova); 365 CU_ASSERT(op_mbuf[i]->buf_len == exp_mbuf[i]->buf_len); 366 CU_ASSERT(op_mbuf[i]->pkt_len == exp_mbuf[i]->pkt_len); 367 } 368 369 /* if only 3 mbufs were used in the test, the 4th should be zeroed */ 370 if (num_src_mbufs == UT_MBUFS_PER_OP) { 371 CU_ASSERT(op_mbuf[UT_MBUFS_PER_OP_BOUND_TEST - 1] == NULL); 372 CU_ASSERT(exp_mbuf[UT_MBUFS_PER_OP_BOUND_TEST - 1] == NULL); 373 } 374 CU_ASSERT(*RTE_MBUF_DYNFIELD(op->m_src, g_mbuf_offset, uint64_t *) == 375 *RTE_MBUF_DYNFIELD(ut_expected_op.m_src, g_mbuf_offset, uint64_t *)); 376 CU_ASSERT(op->src.offset == ut_expected_op.src.offset); 377 CU_ASSERT(op->src.length == ut_expected_op.src.length); 378 379 /* check dst mbuf values */ 380 _get_mbuf_array(op_mbuf, op->m_dst, SPDK_COUNTOF(op_mbuf), true); 381 _get_mbuf_array(exp_mbuf, ut_expected_op.m_dst, SPDK_COUNTOF(exp_mbuf), true); 382 383 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 384 CU_ASSERT(op_mbuf[i]->buf_addr == exp_mbuf[i]->buf_addr); 385 CU_ASSERT(op_mbuf[i]->buf_iova == exp_mbuf[i]->buf_iova); 386 CU_ASSERT(op_mbuf[i]->buf_len == exp_mbuf[i]->buf_len); 387 CU_ASSERT(op_mbuf[i]->pkt_len == exp_mbuf[i]->pkt_len); 388 } 389 CU_ASSERT(op->dst.offset == ut_expected_op.dst.offset); 390 391 return ut_enqueue_value; 392 } 393 394 /* Global setup for all tests that share a bunch of preparation... */ 395 static int 396 test_setup(void) 397 { 398 struct spdk_thread *thread; 399 int i; 400 401 spdk_thread_lib_init(NULL, 0); 402 403 thread = spdk_thread_create(NULL, NULL); 404 spdk_set_thread(thread); 405 406 g_comp_xform = (struct rte_comp_xform) { 407 .type = RTE_COMP_COMPRESS, 408 .compress = { 409 .algo = RTE_COMP_ALGO_DEFLATE, 410 .deflate.huffman = RTE_COMP_HUFFMAN_DEFAULT, 411 .level = RTE_COMP_LEVEL_MAX, 412 .window_size = DEFAULT_WINDOW_SIZE, 413 .chksum = RTE_COMP_CHECKSUM_NONE, 414 .hash_algo = RTE_COMP_HASH_ALGO_NONE 415 } 416 }; 417 418 g_decomp_xform = (struct rte_comp_xform) { 419 .type = RTE_COMP_DECOMPRESS, 420 .decompress = { 421 .algo = RTE_COMP_ALGO_DEFLATE, 422 .chksum = RTE_COMP_CHECKSUM_NONE, 423 .window_size = DEFAULT_WINDOW_SIZE, 424 .hash_algo = RTE_COMP_HASH_ALGO_NONE 425 } 426 }; 427 g_device.comp_xform = &g_comp_xform; 428 g_device.decomp_xform = &g_decomp_xform; 429 g_cdev_cap.comp_feature_flags = RTE_COMP_FF_SHAREABLE_PRIV_XFORM; 430 g_device.cdev_info.driver_name = "compressdev"; 431 g_device.cdev_info.capabilities = &g_cdev_cap; 432 for (i = 0; i < UT_MBUFS_PER_OP_BOUND_TEST; i++) { 433 g_src_mbufs[i] = spdk_zmalloc(sizeof(struct rte_mbuf), 0x40, NULL, 434 SPDK_ENV_LCORE_ID_ANY, SPDK_MALLOC_DMA); 435 } 436 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 437 g_dst_mbufs[i] = spdk_zmalloc(sizeof(struct rte_mbuf), 0x40, NULL, 438 SPDK_ENV_LCORE_ID_ANY, SPDK_MALLOC_DMA); 439 } 440 441 g_io_ch = calloc(1, sizeof(struct spdk_io_channel) + sizeof(struct compress_io_channel)); 442 g_io_ch->thread = thread; 443 g_comp_ch = (struct compress_io_channel *)spdk_io_channel_get_ctx(g_io_ch); 444 g_comp_ch->device_qp = &g_device_qp; 445 g_comp_ch->device_qp->device = &g_device; 446 g_device_qp.device->sgl_in = true; 447 g_device_qp.device->sgl_out = true; 448 g_comp_ch->src_mbufs = calloc(UT_MBUFS_PER_OP_BOUND_TEST, sizeof(void *)); 449 g_comp_ch->dst_mbufs = calloc(UT_MBUFS_PER_OP, sizeof(void *)); 450 TAILQ_INIT(&g_comp_ch->queued_tasks); 451 452 for (i = 0; i < UT_MBUFS_PER_OP_BOUND_TEST - 1; i++) { 453 g_expected_src_mbufs[i].next = &g_expected_src_mbufs[i + 1]; 454 } 455 g_expected_src_mbufs[UT_MBUFS_PER_OP_BOUND_TEST - 1].next = NULL; 456 457 /* we only test w/4 mbufs on src side */ 458 for (i = 0; i < UT_MBUFS_PER_OP - 1; i++) { 459 g_expected_dst_mbufs[i].next = &g_expected_dst_mbufs[i + 1]; 460 } 461 g_expected_dst_mbufs[UT_MBUFS_PER_OP - 1].next = NULL; 462 g_mbuf_offset = DPDK_DYNFIELD_OFFSET; 463 464 return 0; 465 } 466 467 /* Global teardown for all tests */ 468 static int 469 test_cleanup(void) 470 { 471 struct spdk_thread *thread; 472 int i; 473 474 for (i = 0; i < UT_MBUFS_PER_OP_BOUND_TEST; i++) { 475 spdk_free(g_src_mbufs[i]); 476 } 477 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 478 spdk_free(g_dst_mbufs[i]); 479 } 480 free(g_comp_ch->src_mbufs); 481 free(g_comp_ch->dst_mbufs); 482 free(g_io_ch); 483 484 thread = spdk_get_thread(); 485 spdk_thread_exit(thread); 486 while (!spdk_thread_is_exited(thread)) { 487 spdk_thread_poll(thread, 0, 0); 488 } 489 spdk_thread_destroy(thread); 490 491 spdk_thread_lib_fini(); 492 493 return 0; 494 } 495 496 static void 497 test_compress_operation(void) 498 { 499 struct iovec src_iovs[3] = {}; 500 int src_iovcnt; 501 struct iovec dst_iovs[3] = {}; 502 int dst_iovcnt; 503 struct spdk_accel_task *task_p, task = {}; 504 int rc, i; 505 struct rte_mbuf *exp_src_mbuf[UT_MBUFS_PER_OP]; 506 struct rte_mbuf *exp_dst_mbuf[UT_MBUFS_PER_OP]; 507 uint32_t output_size; 508 509 src_iovcnt = dst_iovcnt = 3; 510 for (i = 0; i < dst_iovcnt; i++) { 511 src_iovs[i].iov_len = 0x1000; 512 dst_iovs[i].iov_len = 0x1000; 513 src_iovs[i].iov_base = (void *)0x10000000 + 0x1000 * i; 514 dst_iovs[i].iov_base = (void *)0x20000000 + 0x1000 * i; 515 } 516 517 task.cb_fn = _compress_done; 518 task.op_code = SPDK_ACCEL_OPC_COMPRESS; 519 task.output_size = &output_size; 520 task.d.iovs = dst_iovs; 521 task.d.iovcnt = dst_iovcnt; 522 task.s.iovs = src_iovs; 523 task.s.iovcnt = src_iovcnt; 524 task_p = &task; 525 526 /* test rte_comp_op_alloc failure */ 527 MOCK_SET(rte_comp_op_alloc, NULL); 528 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 529 rc = _compress_operation(g_comp_ch, &task); 530 CU_ASSERT(rc == 0); 531 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == false); 532 while (!TAILQ_EMPTY(&g_comp_ch->queued_tasks)) { 533 task_p = TAILQ_FIRST(&g_comp_ch->queued_tasks); 534 TAILQ_REMOVE(&g_comp_ch->queued_tasks, task_p, link); 535 } 536 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 537 538 /* test mempool get failure */ 539 MOCK_SET(rte_comp_op_alloc, &g_comp_op[0]); 540 ut_rte_pktmbuf_alloc_bulk = -1; 541 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 542 rc = _compress_operation(g_comp_ch, &task); 543 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == false); 544 while (!TAILQ_EMPTY(&g_comp_ch->queued_tasks)) { 545 task_p = TAILQ_FIRST(&g_comp_ch->queued_tasks); 546 TAILQ_REMOVE(&g_comp_ch->queued_tasks, task_p, link); 547 } 548 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 549 CU_ASSERT(rc == 0); 550 ut_rte_pktmbuf_alloc_bulk = 0; 551 552 /* test enqueue failure busy */ 553 ut_enqueue_value = FAKE_ENQUEUE_BUSY; 554 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 555 rc = _compress_operation(g_comp_ch, &task); 556 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == false); 557 while (!TAILQ_EMPTY(&g_comp_ch->queued_tasks)) { 558 task_p = TAILQ_FIRST(&g_comp_ch->queued_tasks); 559 TAILQ_REMOVE(&g_comp_ch->queued_tasks, task_p, link); 560 } 561 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 562 CU_ASSERT(rc == 0); 563 ut_enqueue_value = 1; 564 565 /* test enqueue failure error */ 566 ut_enqueue_value = FAKE_ENQUEUE_ERROR; 567 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 568 rc = _compress_operation(g_comp_ch, &task); 569 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 570 CU_ASSERT(rc == -EINVAL); 571 ut_enqueue_value = FAKE_ENQUEUE_SUCCESS; 572 573 /* test success with 3 vector iovec */ 574 ut_expected_op.private_xform = &g_decomp_xform; 575 ut_expected_op.src.offset = 0; 576 ut_expected_op.src.length = src_iovs[0].iov_len + src_iovs[1].iov_len + src_iovs[2].iov_len; 577 578 /* setup the src expected values */ 579 _get_mbuf_array(exp_src_mbuf, &g_expected_src_mbufs[0], SPDK_COUNTOF(exp_src_mbuf), false); 580 ut_expected_op.m_src = exp_src_mbuf[0]; 581 582 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 583 *RTE_MBUF_DYNFIELD(exp_src_mbuf[i], g_mbuf_offset, uint64_t *) = (uint64_t)&task; 584 exp_src_mbuf[i]->buf_addr = src_iovs[i].iov_base; 585 exp_src_mbuf[i]->buf_iova = spdk_vtophys(src_iovs[i].iov_base, &src_iovs[i].iov_len); 586 exp_src_mbuf[i]->buf_len = src_iovs[i].iov_len; 587 exp_src_mbuf[i]->pkt_len = src_iovs[i].iov_len; 588 } 589 590 /* setup the dst expected values */ 591 _get_mbuf_array(exp_dst_mbuf, &g_expected_dst_mbufs[0], SPDK_COUNTOF(exp_dst_mbuf), false); 592 ut_expected_op.dst.offset = 0; 593 ut_expected_op.m_dst = exp_dst_mbuf[0]; 594 595 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 596 exp_dst_mbuf[i]->buf_addr = dst_iovs[i].iov_base; 597 exp_dst_mbuf[i]->buf_iova = spdk_vtophys(dst_iovs[i].iov_base, &dst_iovs[i].iov_len); 598 exp_dst_mbuf[i]->buf_len = dst_iovs[i].iov_len; 599 exp_dst_mbuf[i]->pkt_len = dst_iovs[i].iov_len; 600 } 601 602 rc = _compress_operation(g_comp_ch, &task); 603 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 604 CU_ASSERT(rc == 0); 605 606 /* test sgl out failure */ 607 g_device.sgl_out = false; 608 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 609 rc = _compress_operation(g_comp_ch, &task); 610 CU_ASSERT(rc == -EINVAL); 611 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 612 g_device.sgl_out = true; 613 614 /* test sgl in failure */ 615 g_device.sgl_in = false; 616 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 617 rc = _compress_operation(g_comp_ch, &task); 618 CU_ASSERT(rc == -EINVAL); 619 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 620 g_device.sgl_in = true; 621 } 622 623 static void 624 test_compress_operation_cross_boundary(void) 625 { 626 struct iovec src_iovs[3] = {}; 627 int src_iovcnt; 628 struct iovec dst_iovs[3] = {}; 629 int dst_iovcnt; 630 int rc, i; 631 struct rte_mbuf *exp_src_mbuf[UT_MBUFS_PER_OP_BOUND_TEST]; 632 struct rte_mbuf *exp_dst_mbuf[UT_MBUFS_PER_OP_BOUND_TEST]; 633 struct spdk_accel_task task = {}; 634 uint32_t output_size; 635 636 /* Setup the same basic 3 IOV test as used in the simple success case 637 * but then we'll start testing a vtophy boundary crossing at each 638 * position. 639 */ 640 src_iovcnt = dst_iovcnt = 3; 641 for (i = 0; i < dst_iovcnt; i++) { 642 src_iovs[i].iov_len = 0x1000; 643 dst_iovs[i].iov_len = 0x1000; 644 src_iovs[i].iov_base = (void *)0x10000000 + 0x1000 * i; 645 dst_iovs[i].iov_base = (void *)0x20000000 + 0x1000 * i; 646 } 647 648 ut_expected_op.private_xform = &g_decomp_xform; 649 ut_expected_op.src.offset = 0; 650 ut_expected_op.src.length = src_iovs[0].iov_len + src_iovs[1].iov_len + src_iovs[2].iov_len; 651 652 /* setup the src expected values */ 653 _get_mbuf_array(exp_src_mbuf, &g_expected_src_mbufs[0], SPDK_COUNTOF(exp_src_mbuf), false); 654 ut_expected_op.m_src = exp_src_mbuf[0]; 655 656 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 657 *RTE_MBUF_DYNFIELD(exp_src_mbuf[i], g_mbuf_offset, uint64_t *) = (uint64_t)&task; 658 exp_src_mbuf[i]->buf_addr = src_iovs[i].iov_base; 659 exp_src_mbuf[i]->buf_iova = spdk_vtophys(src_iovs[i].iov_base, &src_iovs[i].iov_len); 660 exp_src_mbuf[i]->buf_len = src_iovs[i].iov_len; 661 exp_src_mbuf[i]->pkt_len = src_iovs[i].iov_len; 662 } 663 664 /* setup the dst expected values, we don't test needing a 4th dst mbuf */ 665 _get_mbuf_array(exp_dst_mbuf, &g_expected_dst_mbufs[0], SPDK_COUNTOF(exp_dst_mbuf), false); 666 ut_expected_op.dst.offset = 0; 667 ut_expected_op.m_dst = exp_dst_mbuf[0]; 668 669 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 670 exp_dst_mbuf[i]->buf_addr = dst_iovs[i].iov_base; 671 exp_dst_mbuf[i]->buf_iova = spdk_vtophys(dst_iovs[i].iov_base, &dst_iovs[i].iov_len); 672 exp_dst_mbuf[i]->buf_len = dst_iovs[i].iov_len; 673 exp_dst_mbuf[i]->pkt_len = dst_iovs[i].iov_len; 674 } 675 676 /* force the 1st IOV to get partial length from spdk_vtophys */ 677 g_small_size_counter = 0; 678 g_small_size_modify = 1; 679 g_small_size = 0x800; 680 *RTE_MBUF_DYNFIELD(exp_src_mbuf[3], g_mbuf_offset, uint64_t *) = (uint64_t)&task; 681 682 /* first only has shorter length */ 683 exp_src_mbuf[0]->pkt_len = exp_src_mbuf[0]->buf_len = 0x800; 684 685 /* 2nd was inserted by the boundary crossing condition and finishes off 686 * the length from the first */ 687 exp_src_mbuf[1]->buf_addr = (void *)0x10000800; 688 exp_src_mbuf[1]->buf_iova = 0x10000800; 689 exp_src_mbuf[1]->pkt_len = exp_src_mbuf[1]->buf_len = 0x800; 690 691 /* 3rd looks like that the 2nd would have */ 692 exp_src_mbuf[2]->buf_addr = (void *)0x10001000; 693 exp_src_mbuf[2]->buf_iova = 0x10001000; 694 exp_src_mbuf[2]->pkt_len = exp_src_mbuf[2]->buf_len = 0x1000; 695 696 /* a new 4th looks like what the 3rd would have */ 697 exp_src_mbuf[3]->buf_addr = (void *)0x10002000; 698 exp_src_mbuf[3]->buf_iova = 0x10002000; 699 exp_src_mbuf[3]->pkt_len = exp_src_mbuf[3]->buf_len = 0x1000; 700 701 task.cb_fn = _compress_done; 702 task.op_code = SPDK_ACCEL_OPC_COMPRESS; 703 task.output_size = &output_size; 704 task.d.iovs = dst_iovs; 705 task.d.iovcnt = dst_iovcnt; 706 task.s.iovs = src_iovs; 707 task.s.iovcnt = src_iovcnt; 708 709 rc = _compress_operation(g_comp_ch, &task); 710 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 711 CU_ASSERT(rc == 0); 712 713 /* Now force the 2nd IOV to get partial length from spdk_vtophys */ 714 g_small_size_counter = 0; 715 g_small_size_modify = 2; 716 g_small_size = 0x800; 717 718 /* first is normal */ 719 exp_src_mbuf[0]->buf_addr = (void *)0x10000000; 720 exp_src_mbuf[0]->buf_iova = 0x10000000; 721 exp_src_mbuf[0]->pkt_len = exp_src_mbuf[0]->buf_len = 0x1000; 722 723 /* second only has shorter length */ 724 exp_src_mbuf[1]->buf_addr = (void *)0x10001000; 725 exp_src_mbuf[1]->buf_iova = 0x10001000; 726 exp_src_mbuf[1]->pkt_len = exp_src_mbuf[1]->buf_len = 0x800; 727 728 /* 3rd was inserted by the boundary crossing condition and finishes off 729 * the length from the first */ 730 exp_src_mbuf[2]->buf_addr = (void *)0x10001800; 731 exp_src_mbuf[2]->buf_iova = 0x10001800; 732 exp_src_mbuf[2]->pkt_len = exp_src_mbuf[2]->buf_len = 0x800; 733 734 /* a new 4th looks like what the 3rd would have */ 735 exp_src_mbuf[3]->buf_addr = (void *)0x10002000; 736 exp_src_mbuf[3]->buf_iova = 0x10002000; 737 exp_src_mbuf[3]->pkt_len = exp_src_mbuf[3]->buf_len = 0x1000; 738 739 rc = _compress_operation(g_comp_ch, &task); 740 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 741 CU_ASSERT(rc == 0); 742 743 /* Finally force the 3rd IOV to get partial length from spdk_vtophys */ 744 g_small_size_counter = 0; 745 g_small_size_modify = 3; 746 g_small_size = 0x800; 747 748 /* first is normal */ 749 exp_src_mbuf[0]->buf_addr = (void *)0x10000000; 750 exp_src_mbuf[0]->buf_iova = 0x10000000; 751 exp_src_mbuf[0]->pkt_len = exp_src_mbuf[0]->buf_len = 0x1000; 752 753 /* second is normal */ 754 exp_src_mbuf[1]->buf_addr = (void *)0x10001000; 755 exp_src_mbuf[1]->buf_iova = 0x10001000; 756 exp_src_mbuf[1]->pkt_len = exp_src_mbuf[1]->buf_len = 0x1000; 757 758 /* 3rd has shorter length */ 759 exp_src_mbuf[2]->buf_addr = (void *)0x10002000; 760 exp_src_mbuf[2]->buf_iova = 0x10002000; 761 exp_src_mbuf[2]->pkt_len = exp_src_mbuf[2]->buf_len = 0x800; 762 763 /* a new 4th handles the remainder from the 3rd */ 764 exp_src_mbuf[3]->buf_addr = (void *)0x10002800; 765 exp_src_mbuf[3]->buf_iova = 0x10002800; 766 exp_src_mbuf[3]->pkt_len = exp_src_mbuf[3]->buf_len = 0x800; 767 768 rc = _compress_operation(g_comp_ch, &task); 769 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 770 CU_ASSERT(rc == 0); 771 772 /* Single input iov is split on page boundary, sgl_in is not supported */ 773 g_device.sgl_in = false; 774 g_small_size_counter = 0; 775 g_small_size_modify = 1; 776 g_small_size = 0x800; 777 rc = _compress_operation(g_comp_ch, &task); 778 CU_ASSERT(rc == -EINVAL); 779 g_device.sgl_in = true; 780 781 /* Single output iov is split on page boundary, sgl_out is not supported */ 782 g_device.sgl_out = false; 783 g_small_size_counter = 0; 784 g_small_size_modify = 2; 785 g_small_size = 0x800; 786 rc = _compress_operation(g_comp_ch, &task); 787 CU_ASSERT(rc == -EINVAL); 788 g_device.sgl_out = true; 789 } 790 791 static void 792 test_setup_compress_mbuf(void) 793 { 794 struct iovec src_iovs = {}; 795 int src_iovcnt = 1; 796 struct spdk_accel_task task = {}; 797 int src_mbuf_added = 0; 798 uint64_t total_length; 799 struct rte_mbuf *exp_src_mbuf[UT_MBUFS_PER_OP_BOUND_TEST]; 800 int rc, i; 801 802 /* setup the src expected values */ 803 _get_mbuf_array(exp_src_mbuf, &g_expected_src_mbufs[0], SPDK_COUNTOF(exp_src_mbuf), false); 804 805 /* no splitting */ 806 total_length = 0; 807 ut_total_rte_pktmbuf_attach_extbuf = 0; 808 src_iovs.iov_len = 0x1000; 809 src_iovs.iov_base = (void *)0x10000000 + 0x1000; 810 rc = _setup_compress_mbuf(exp_src_mbuf, &src_mbuf_added, &total_length, 811 &src_iovs, src_iovcnt, &task); 812 CU_ASSERT(rc == 0); 813 CU_ASSERT(total_length = src_iovs.iov_len); 814 CU_ASSERT(src_mbuf_added == 0); 815 CU_ASSERT(ut_total_rte_pktmbuf_attach_extbuf == 1); 816 817 /* one split, for splitting tests we need the global mbuf array unlinked, 818 * otherwise the functional code will attempt to link them but if they are 819 * already linked, it will just create a chain that links to itself */ 820 for (i = 0; i < UT_MBUFS_PER_OP_BOUND_TEST - 1; i++) { 821 g_expected_src_mbufs[i].next = NULL; 822 } 823 total_length = 0; 824 ut_total_rte_pktmbuf_attach_extbuf = 0; 825 src_iovs.iov_len = 0x1000 + MBUF_SPLIT; 826 exp_src_mbuf[0]->buf_len = src_iovs.iov_len; 827 exp_src_mbuf[0]->pkt_len = src_iovs.iov_len; 828 rc = _setup_compress_mbuf(exp_src_mbuf, &src_mbuf_added, &total_length, 829 &src_iovs, src_iovcnt, &task); 830 CU_ASSERT(rc == 0); 831 CU_ASSERT(total_length = src_iovs.iov_len); 832 CU_ASSERT(src_mbuf_added == 0); 833 CU_ASSERT(ut_total_rte_pktmbuf_attach_extbuf == 2); 834 835 /* two splits */ 836 for (i = 0; i < UT_MBUFS_PER_OP_BOUND_TEST - 1; i++) { 837 g_expected_src_mbufs[i].next = NULL; 838 } 839 total_length = 0; 840 ut_total_rte_pktmbuf_attach_extbuf = 0; 841 src_iovs.iov_len = 0x1000 + 2 * MBUF_SPLIT; 842 exp_src_mbuf[0]->buf_len = src_iovs.iov_len; 843 exp_src_mbuf[0]->pkt_len = src_iovs.iov_len; 844 845 rc = _setup_compress_mbuf(exp_src_mbuf, &src_mbuf_added, &total_length, 846 &src_iovs, src_iovcnt, &task); 847 CU_ASSERT(rc == 0); 848 CU_ASSERT(total_length = src_iovs.iov_len); 849 CU_ASSERT(src_mbuf_added == 0); 850 CU_ASSERT(ut_total_rte_pktmbuf_attach_extbuf == 3); 851 852 /* relink the global mbuf array */ 853 for (i = 0; i < UT_MBUFS_PER_OP_BOUND_TEST - 1; i++) { 854 g_expected_src_mbufs[i].next = &g_expected_src_mbufs[i + 1]; 855 } 856 } 857 858 static void 859 test_poller(void) 860 { 861 int rc; 862 struct compress_io_channel *args; 863 struct rte_mbuf mbuf[4]; /* one src, one dst, 2 ops */ 864 struct iovec src_iovs[3] = {}; 865 struct iovec dst_iovs[3] = {}; 866 uint32_t output_size[2]; 867 struct spdk_accel_task task[2] = {}; 868 struct spdk_accel_task *task_to_resubmit; 869 struct rte_mbuf *exp_src_mbuf[UT_MBUFS_PER_OP]; 870 struct rte_mbuf *exp_dst_mbuf[UT_MBUFS_PER_OP]; 871 int i; 872 873 args = calloc(1, sizeof(*args)); 874 SPDK_CU_ASSERT_FATAL(args != NULL); 875 memset(&g_comp_op[0], 0, sizeof(struct rte_comp_op)); 876 g_comp_op[0].m_src = &mbuf[0]; 877 g_comp_op[1].m_src = &mbuf[1]; 878 g_comp_op[0].m_dst = &mbuf[2]; 879 g_comp_op[1].m_dst = &mbuf[3]; 880 for (i = 0; i < 3; i++) { 881 src_iovs[i].iov_len = 0x1000; 882 dst_iovs[i].iov_len = 0x1000; 883 src_iovs[i].iov_base = (void *)0x10000000 + 0x1000 * i; 884 dst_iovs[i].iov_base = (void *)0x20000000 + 0x1000 * i; 885 } 886 task[0].cb_fn = task[1].cb_fn = _compress_done; 887 task[0].output_size = &output_size[0]; 888 task[1].output_size = &output_size[1]; 889 890 /* Error from dequeue, nothing needing to be resubmitted. 891 */ 892 ut_rte_compressdev_dequeue_burst = 1; 893 ut_expected_task_status = RTE_COMP_OP_STATUS_NOT_PROCESSED; 894 /* setup what we want dequeue to return for the op */ 895 *RTE_MBUF_DYNFIELD(g_comp_op[0].m_src, g_mbuf_offset, uint64_t *) = (uint64_t)&task[0]; 896 g_comp_op[0].produced = 1; 897 g_done_count = 0; 898 g_comp_op[0].status = RTE_COMP_OP_STATUS_NOT_PROCESSED; 899 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 900 rc = comp_dev_poller((void *)g_comp_ch); 901 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 902 CU_ASSERT(rc == SPDK_POLLER_BUSY); 903 ut_expected_task_status = RTE_COMP_OP_STATUS_SUCCESS; 904 905 /* Success from dequeue, 2 ops. nothing needing to be resubmitted. 906 */ 907 ut_rte_compressdev_dequeue_burst = 2; 908 /* setup what we want dequeue to return for the op */ 909 *RTE_MBUF_DYNFIELD(g_comp_op[0].m_src, g_mbuf_offset, uint64_t *) = (uint64_t)&task[0]; 910 g_comp_op[0].produced = 16; 911 g_comp_op[0].status = RTE_COMP_OP_STATUS_SUCCESS; 912 *RTE_MBUF_DYNFIELD(g_comp_op[1].m_src, g_mbuf_offset, uint64_t *) = (uint64_t)&task[1]; 913 g_comp_op[1].produced = 32; 914 g_comp_op[1].status = RTE_COMP_OP_STATUS_SUCCESS; 915 g_done_count = 0; 916 ut_enqueue_value = FAKE_ENQUEUE_SUCCESS; 917 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 918 rc = comp_dev_poller((void *)g_comp_ch); 919 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 920 CU_ASSERT(rc == SPDK_POLLER_BUSY); 921 922 /* One to dequeue, one op to be resubmitted. */ 923 ut_rte_compressdev_dequeue_burst = 1; 924 /* setup what we want dequeue to return for the op */ 925 *RTE_MBUF_DYNFIELD(g_comp_op[0].m_src, g_mbuf_offset, uint64_t *) = (uint64_t)&task[0]; 926 g_comp_op[0].produced = 16; 927 g_comp_op[0].status = 0; 928 g_done_count = 0; 929 task_to_resubmit = calloc(1, sizeof(struct spdk_accel_task)); 930 SPDK_CU_ASSERT_FATAL(task_to_resubmit != NULL); 931 task_to_resubmit->s.iovs = &src_iovs[0]; 932 task_to_resubmit->s.iovcnt = 3; 933 task_to_resubmit->d.iovs = &dst_iovs[0]; 934 task_to_resubmit->d.iovcnt = 3; 935 task_to_resubmit->op_code = SPDK_ACCEL_OPC_COMPRESS; 936 task_to_resubmit->cb_arg = args; 937 ut_enqueue_value = FAKE_ENQUEUE_SUCCESS; 938 ut_expected_op.private_xform = &g_decomp_xform; 939 ut_expected_op.src.offset = 0; 940 ut_expected_op.src.length = src_iovs[0].iov_len + src_iovs[1].iov_len + src_iovs[2].iov_len; 941 942 /* setup the src expected values */ 943 _get_mbuf_array(exp_src_mbuf, &g_expected_src_mbufs[0], SPDK_COUNTOF(exp_src_mbuf), false); 944 ut_expected_op.m_src = exp_src_mbuf[0]; 945 946 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 947 *RTE_MBUF_DYNFIELD(exp_src_mbuf[i], g_mbuf_offset, uint64_t *) = (uint64_t)&task[0]; 948 exp_src_mbuf[i]->buf_addr = src_iovs[i].iov_base; 949 exp_src_mbuf[i]->buf_iova = spdk_vtophys(src_iovs[i].iov_base, &src_iovs[i].iov_len); 950 exp_src_mbuf[i]->buf_len = src_iovs[i].iov_len; 951 exp_src_mbuf[i]->pkt_len = src_iovs[i].iov_len; 952 } 953 954 /* setup the dst expected values */ 955 _get_mbuf_array(exp_dst_mbuf, &g_expected_dst_mbufs[0], SPDK_COUNTOF(exp_dst_mbuf), false); 956 ut_expected_op.dst.offset = 0; 957 ut_expected_op.m_dst = exp_dst_mbuf[0]; 958 959 for (i = 0; i < UT_MBUFS_PER_OP; i++) { 960 exp_dst_mbuf[i]->buf_addr = dst_iovs[i].iov_base; 961 exp_dst_mbuf[i]->buf_iova = spdk_vtophys(dst_iovs[i].iov_base, &dst_iovs[i].iov_len); 962 exp_dst_mbuf[i]->buf_len = dst_iovs[i].iov_len; 963 exp_dst_mbuf[i]->pkt_len = dst_iovs[i].iov_len; 964 } 965 MOCK_SET(rte_comp_op_alloc, &g_comp_op[0]); 966 TAILQ_INSERT_TAIL(&g_comp_ch->queued_tasks, 967 task_to_resubmit, 968 link); 969 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == false); 970 rc = comp_dev_poller((void *)g_comp_ch); 971 CU_ASSERT(TAILQ_EMPTY(&g_comp_ch->queued_tasks) == true); 972 CU_ASSERT(rc == SPDK_POLLER_BUSY); 973 974 free(task_to_resubmit); 975 free(args); 976 } 977 978 static void 979 test_initdrivers(void) 980 { 981 int rc; 982 983 /* compressdev count 0 */ 984 rc = accel_init_compress_drivers(); 985 CU_ASSERT(rc == 0); 986 987 /* bogus count */ 988 ut_rte_compressdev_count = RTE_COMPRESS_MAX_DEVS + 1; 989 rc = accel_init_compress_drivers(); 990 CU_ASSERT(rc == -EINVAL); 991 992 /* failure with rte_mbuf_dynfield_register */ 993 ut_rte_compressdev_count = 1; 994 MOCK_SET(rte_mbuf_dynfield_register, -1); 995 rc = accel_init_compress_drivers(); 996 CU_ASSERT(rc == -EINVAL); 997 MOCK_SET(rte_mbuf_dynfield_register, DPDK_DYNFIELD_OFFSET); 998 999 /* error on create_compress_dev() */ 1000 ut_rte_comp_op_pool_create = (struct rte_mempool *)0xDEADBEEF; 1001 ut_rte_compressdev_count = 1; 1002 ut_rte_compressdev_configure = -1; 1003 rc = accel_init_compress_drivers(); 1004 CU_ASSERT(rc == -1); 1005 1006 /* error on create_compress_dev() but coverage for large num queues */ 1007 ut_max_nb_queue_pairs = 99; 1008 rc = accel_init_compress_drivers(); 1009 CU_ASSERT(rc == -1); 1010 1011 /* qpair setup fails */ 1012 ut_rte_compressdev_configure = 0; 1013 ut_max_nb_queue_pairs = 0; 1014 ut_rte_compressdev_queue_pair_setup = -1; 1015 rc = accel_init_compress_drivers(); 1016 CU_ASSERT(rc == -EINVAL); 1017 1018 /* rte_compressdev_start fails */ 1019 ut_rte_compressdev_queue_pair_setup = 0; 1020 ut_rte_compressdev_start = -1; 1021 rc = accel_init_compress_drivers(); 1022 CU_ASSERT(rc == -1); 1023 1024 /* rte_compressdev_private_xform_create() fails */ 1025 ut_rte_compressdev_start = 0; 1026 ut_rte_compressdev_private_xform_create = -2; 1027 rc = accel_init_compress_drivers(); 1028 CU_ASSERT(rc == -2); 1029 1030 /* success */ 1031 ut_rte_compressdev_private_xform_create = 0; 1032 rc = accel_init_compress_drivers(); 1033 CU_ASSERT(rc == 0); 1034 } 1035 1036 int 1037 main(int argc, char **argv) 1038 { 1039 CU_pSuite suite = NULL; 1040 unsigned int num_failures; 1041 1042 CU_initialize_registry(); 1043 1044 suite = CU_add_suite("compress", test_setup, test_cleanup); 1045 CU_ADD_TEST(suite, test_compress_operation); 1046 CU_ADD_TEST(suite, test_compress_operation_cross_boundary); 1047 CU_ADD_TEST(suite, test_setup_compress_mbuf); 1048 CU_ADD_TEST(suite, test_initdrivers); 1049 CU_ADD_TEST(suite, test_poller); 1050 1051 num_failures = spdk_ut_run_tests(argc, argv, NULL); 1052 CU_cleanup_registry(); 1053 return num_failures; 1054 } 1055