4 * Copyright(c) 2016-2017 Intel Corporation. All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * * Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * * Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in
14 * the documentation and/or other materials provided with the
16 * * Neither the name of Intel Corporation nor the names of its
17 * contributors may be used to endorse or promote products derived
18 * from this software without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
24 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
25 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
26 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
30 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 #include <rte_malloc.h>
34 #include <rte_cycles.h>
35 #include <rte_crypto.h>
36 #include <rte_cryptodev.h>
38 #include "cperf_test_latency.h"
39 #include "cperf_ops.h"
42 struct cperf_op_result {
45 enum rte_crypto_op_status status;
48 struct cperf_latency_ctx {
53 struct rte_mempool *pkt_mbuf_pool_in;
54 struct rte_mempool *pkt_mbuf_pool_out;
55 struct rte_mbuf **mbufs_in;
56 struct rte_mbuf **mbufs_out;
58 struct rte_mempool *crypto_op_pool;
60 struct rte_cryptodev_sym_session *sess;
62 cperf_populate_ops_t populate_ops;
64 const struct cperf_options *options;
65 const struct cperf_test_vector *test_vector;
66 struct cperf_op_result *res;
70 struct cperf_op_result *result;
73 #define max(a, b) (a > b ? (uint64_t)a : (uint64_t)b)
74 #define min(a, b) (a < b ? (uint64_t)a : (uint64_t)b)
77 cperf_latency_test_free(struct cperf_latency_ctx *ctx, uint32_t mbuf_nb)
83 rte_cryptodev_sym_session_free(ctx->dev_id, ctx->sess);
86 for (i = 0; i < mbuf_nb; i++)
87 rte_pktmbuf_free(ctx->mbufs_in[i]);
89 rte_free(ctx->mbufs_in);
93 for (i = 0; i < mbuf_nb; i++) {
94 if (ctx->mbufs_out[i] != NULL)
95 rte_pktmbuf_free(ctx->mbufs_out[i]);
98 rte_free(ctx->mbufs_out);
101 if (ctx->pkt_mbuf_pool_in)
102 rte_mempool_free(ctx->pkt_mbuf_pool_in);
104 if (ctx->pkt_mbuf_pool_out)
105 rte_mempool_free(ctx->pkt_mbuf_pool_out);
107 if (ctx->crypto_op_pool)
108 rte_mempool_free(ctx->crypto_op_pool);
115 static struct rte_mbuf *
116 cperf_mbuf_create(struct rte_mempool *mempool,
117 uint32_t segments_nb,
118 const struct cperf_options *options,
119 const struct cperf_test_vector *test_vector)
121 struct rte_mbuf *mbuf;
122 uint32_t segment_sz = options->max_buffer_size / segments_nb;
123 uint32_t last_sz = options->max_buffer_size % segments_nb;
126 (options->cipher_op == RTE_CRYPTO_CIPHER_OP_ENCRYPT) ?
127 test_vector->plaintext.data :
128 test_vector->ciphertext.data;
130 mbuf = rte_pktmbuf_alloc(mempool);
134 mbuf_data = (uint8_t *)rte_pktmbuf_append(mbuf, segment_sz);
135 if (mbuf_data == NULL)
138 memcpy(mbuf_data, test_data, segment_sz);
139 test_data += segment_sz;
142 while (segments_nb) {
145 m = rte_pktmbuf_alloc(mempool);
149 rte_pktmbuf_chain(mbuf, m);
151 mbuf_data = (uint8_t *)rte_pktmbuf_append(mbuf, segment_sz);
152 if (mbuf_data == NULL)
155 memcpy(mbuf_data, test_data, segment_sz);
156 test_data += segment_sz;
161 mbuf_data = (uint8_t *)rte_pktmbuf_append(mbuf, last_sz);
162 if (mbuf_data == NULL)
165 memcpy(mbuf_data, test_data, last_sz);
168 if (options->op_type != CPERF_CIPHER_ONLY) {
169 mbuf_data = (uint8_t *)rte_pktmbuf_append(mbuf,
170 options->auth_digest_sz);
171 if (mbuf_data == NULL)
175 if (options->op_type == CPERF_AEAD) {
176 uint8_t *aead = (uint8_t *)rte_pktmbuf_prepend(mbuf,
177 RTE_ALIGN_CEIL(options->auth_aad_sz, 16));
182 memcpy(aead, test_vector->aad.data, test_vector->aad.length);
188 rte_pktmbuf_free(mbuf);
194 cperf_latency_test_constructor(uint8_t dev_id, uint16_t qp_id,
195 const struct cperf_options *options,
196 const struct cperf_test_vector *test_vector,
197 const struct cperf_op_fns *op_fns)
199 struct cperf_latency_ctx *ctx = NULL;
200 unsigned int mbuf_idx = 0;
201 char pool_name[32] = "";
203 ctx = rte_malloc(NULL, sizeof(struct cperf_latency_ctx), 0);
207 ctx->dev_id = dev_id;
210 ctx->populate_ops = op_fns->populate_ops;
211 ctx->options = options;
212 ctx->test_vector = test_vector;
214 ctx->sess = op_fns->sess_create(dev_id, options, test_vector);
215 if (ctx->sess == NULL)
218 snprintf(pool_name, sizeof(pool_name), "cperf_pool_in_cdev_%d",
221 ctx->pkt_mbuf_pool_in = rte_pktmbuf_pool_create(pool_name,
222 options->pool_sz * options->segments_nb, 0, 0,
223 RTE_PKTMBUF_HEADROOM +
224 RTE_CACHE_LINE_ROUNDUP(
225 (options->max_buffer_size / options->segments_nb) +
226 (options->max_buffer_size % options->segments_nb) +
227 options->auth_digest_sz),
230 if (ctx->pkt_mbuf_pool_in == NULL)
233 /* Generate mbufs_in with plaintext populated for test */
234 ctx->mbufs_in = rte_malloc(NULL,
235 (sizeof(struct rte_mbuf *) *
236 ctx->options->pool_sz), 0);
238 for (mbuf_idx = 0; mbuf_idx < options->pool_sz; mbuf_idx++) {
239 ctx->mbufs_in[mbuf_idx] = cperf_mbuf_create(
240 ctx->pkt_mbuf_pool_in, options->segments_nb,
241 options, test_vector);
242 if (ctx->mbufs_in[mbuf_idx] == NULL)
246 if (options->out_of_place == 1) {
248 snprintf(pool_name, sizeof(pool_name),
249 "cperf_pool_out_cdev_%d",
252 ctx->pkt_mbuf_pool_out = rte_pktmbuf_pool_create(
253 pool_name, options->pool_sz, 0, 0,
254 RTE_PKTMBUF_HEADROOM +
255 RTE_CACHE_LINE_ROUNDUP(
256 options->max_buffer_size +
257 options->auth_digest_sz),
260 if (ctx->pkt_mbuf_pool_out == NULL)
264 ctx->mbufs_out = rte_malloc(NULL,
265 (sizeof(struct rte_mbuf *) *
266 ctx->options->pool_sz), 0);
268 for (mbuf_idx = 0; mbuf_idx < options->pool_sz; mbuf_idx++) {
269 if (options->out_of_place == 1) {
270 ctx->mbufs_out[mbuf_idx] = cperf_mbuf_create(
271 ctx->pkt_mbuf_pool_out, 1,
272 options, test_vector);
273 if (ctx->mbufs_out[mbuf_idx] == NULL)
276 ctx->mbufs_out[mbuf_idx] = NULL;
280 snprintf(pool_name, sizeof(pool_name), "cperf_op_pool_cdev_%d",
283 uint16_t priv_size = sizeof(struct priv_op_data) + test_vector->iv.length;
284 ctx->crypto_op_pool = rte_crypto_op_pool_create(pool_name,
285 RTE_CRYPTO_OP_TYPE_SYMMETRIC, options->pool_sz,
286 512, priv_size, rte_socket_id());
288 if (ctx->crypto_op_pool == NULL)
291 ctx->res = rte_malloc(NULL, sizeof(struct cperf_op_result) *
292 ctx->options->total_ops, 0);
294 if (ctx->res == NULL)
299 cperf_latency_test_free(ctx, mbuf_idx);
305 store_timestamp(struct rte_crypto_op *op, uint64_t timestamp)
307 struct priv_op_data *priv_data;
309 priv_data = (struct priv_op_data *) (op->sym + 1);
310 priv_data->result->status = op->status;
311 priv_data->result->tsc_end = timestamp;
315 cperf_latency_test_runner(void *arg)
317 struct cperf_latency_ctx *ctx = arg;
318 uint16_t test_burst_size;
319 uint8_t burst_size_idx = 0;
321 static int only_once;
326 struct rte_crypto_op *ops[ctx->options->max_burst_size];
327 struct rte_crypto_op *ops_processed[ctx->options->max_burst_size];
329 struct priv_op_data *priv_data;
331 uint32_t lcore = rte_lcore_id();
333 #ifdef CPERF_LINEARIZATION_ENABLE
334 struct rte_cryptodev_info dev_info;
337 /* Check if source mbufs require coalescing */
338 if (ctx->options->segments_nb > 1) {
339 rte_cryptodev_info_get(ctx->dev_id, &dev_info);
340 if ((dev_info.feature_flags &
341 RTE_CRYPTODEV_FF_MBUF_SCATTER_GATHER) == 0)
344 #endif /* CPERF_LINEARIZATION_ENABLE */
346 ctx->lcore_id = lcore;
348 /* Warm up the host CPU before starting the test */
349 for (i = 0; i < ctx->options->total_ops; i++)
350 rte_cryptodev_enqueue_burst(ctx->dev_id, ctx->qp_id, NULL, 0);
352 /* Get first size from range or list */
353 if (ctx->options->inc_burst_size != 0)
354 test_burst_size = ctx->options->min_burst_size;
356 test_burst_size = ctx->options->burst_size_list[0];
358 uint16_t iv_offset = sizeof(struct rte_crypto_op) +
359 sizeof(struct rte_crypto_sym_op) +
360 sizeof(struct cperf_op_result *);
362 while (test_burst_size <= ctx->options->max_burst_size) {
363 uint64_t ops_enqd = 0, ops_deqd = 0;
364 uint64_t m_idx = 0, b_idx = 0;
366 uint64_t tsc_val, tsc_end, tsc_start;
367 uint64_t tsc_max = 0, tsc_min = ~0UL, tsc_tot = 0, tsc_idx = 0;
368 uint64_t enqd_max = 0, enqd_min = ~0UL, enqd_tot = 0;
369 uint64_t deqd_max = 0, deqd_min = ~0UL, deqd_tot = 0;
371 while (enqd_tot < ctx->options->total_ops) {
373 uint16_t burst_size = ((enqd_tot + test_burst_size)
374 <= ctx->options->total_ops) ?
376 ctx->options->total_ops -
379 /* Allocate crypto ops from pool */
380 if (burst_size != rte_crypto_op_bulk_alloc(
382 RTE_CRYPTO_OP_TYPE_SYMMETRIC,
386 /* Setup crypto op, attach mbuf etc */
387 (ctx->populate_ops)(ops, &ctx->mbufs_in[m_idx],
388 &ctx->mbufs_out[m_idx],
389 burst_size, ctx->sess, ctx->options,
390 ctx->test_vector, iv_offset);
392 tsc_start = rte_rdtsc_precise();
394 #ifdef CPERF_LINEARIZATION_ENABLE
396 /* PMD doesn't support scatter-gather and source buffer
398 * We need to linearize it before enqueuing.
400 for (i = 0; i < burst_size; i++)
401 rte_pktmbuf_linearize(ops[i]->sym->m_src);
403 #endif /* CPERF_LINEARIZATION_ENABLE */
405 /* Enqueue burst of ops on crypto device */
406 ops_enqd = rte_cryptodev_enqueue_burst(ctx->dev_id, ctx->qp_id,
409 /* Dequeue processed burst of ops from crypto device */
410 ops_deqd = rte_cryptodev_dequeue_burst(ctx->dev_id, ctx->qp_id,
411 ops_processed, test_burst_size);
413 tsc_end = rte_rdtsc_precise();
415 /* Free memory for not enqueued operations */
416 if (ops_enqd != burst_size)
417 rte_mempool_put_bulk(ctx->crypto_op_pool,
418 (void **)&ops_processed[ops_enqd],
419 burst_size - ops_enqd);
421 for (i = 0; i < ops_enqd; i++) {
422 ctx->res[tsc_idx].tsc_start = tsc_start;
424 * Private data structure starts after the end of the
425 * rte_crypto_sym_op structure.
427 priv_data = (struct priv_op_data *) (ops[i]->sym + 1);
428 priv_data->result = (void *)&ctx->res[tsc_idx];
432 if (likely(ops_deqd)) {
434 * free crypto ops so they can be reused. We don't free
435 * the mbufs here as we don't want to reuse them as
436 * the crypto operation will change the data and cause
439 for (i = 0; i < ops_deqd; i++)
440 store_timestamp(ops_processed[i], tsc_end);
442 rte_mempool_put_bulk(ctx->crypto_op_pool,
443 (void **)ops_processed, ops_deqd);
445 deqd_tot += ops_deqd;
446 deqd_max = max(ops_deqd, deqd_max);
447 deqd_min = min(ops_deqd, deqd_min);
450 enqd_tot += ops_enqd;
451 enqd_max = max(ops_enqd, enqd_max);
452 enqd_min = min(ops_enqd, enqd_min);
455 m_idx = m_idx + test_burst_size > ctx->options->pool_sz ?
460 /* Dequeue any operations still in the crypto device */
461 while (deqd_tot < ctx->options->total_ops) {
462 /* Sending 0 length burst to flush sw crypto device */
463 rte_cryptodev_enqueue_burst(ctx->dev_id, ctx->qp_id, NULL, 0);
466 ops_deqd = rte_cryptodev_dequeue_burst(ctx->dev_id, ctx->qp_id,
467 ops_processed, test_burst_size);
469 tsc_end = rte_rdtsc_precise();
472 for (i = 0; i < ops_deqd; i++)
473 store_timestamp(ops_processed[i], tsc_end);
475 rte_mempool_put_bulk(ctx->crypto_op_pool,
476 (void **)ops_processed, ops_deqd);
478 deqd_tot += ops_deqd;
479 deqd_max = max(ops_deqd, deqd_max);
480 deqd_min = min(ops_deqd, deqd_min);
484 for (i = 0; i < tsc_idx; i++) {
485 tsc_val = ctx->res[i].tsc_end - ctx->res[i].tsc_start;
486 tsc_max = max(tsc_val, tsc_max);
487 tsc_min = min(tsc_val, tsc_min);
491 double time_tot, time_avg, time_max, time_min;
493 const uint64_t tunit = 1000000; /* us */
494 const uint64_t tsc_hz = rte_get_tsc_hz();
496 uint64_t enqd_avg = enqd_tot / b_idx;
497 uint64_t deqd_avg = deqd_tot / b_idx;
498 uint64_t tsc_avg = tsc_tot / tsc_idx;
500 time_tot = tunit*(double)(tsc_tot) / tsc_hz;
501 time_avg = tunit*(double)(tsc_avg) / tsc_hz;
502 time_max = tunit*(double)(tsc_max) / tsc_hz;
503 time_min = tunit*(double)(tsc_min) / tsc_hz;
505 if (ctx->options->csv) {
507 printf("\n# lcore, Buffer Size, Burst Size, Pakt Seq #, "
508 "Packet Size, cycles, time (us)");
510 for (i = 0; i < ctx->options->total_ops; i++) {
512 printf("\n%u;%u;%u;%"PRIu64";%"PRIu64";%.3f",
513 ctx->lcore_id, ctx->options->test_buffer_size,
514 test_burst_size, i + 1,
515 ctx->res[i].tsc_end - ctx->res[i].tsc_start,
516 tunit * (double) (ctx->res[i].tsc_end
517 - ctx->res[i].tsc_start)
523 printf("\n# Device %d on lcore %u\n", ctx->dev_id,
525 printf("\n# total operations: %u", ctx->options->total_ops);
526 printf("\n# Buffer size: %u", ctx->options->test_buffer_size);
527 printf("\n# Burst size: %u", test_burst_size);
528 printf("\n# Number of bursts: %"PRIu64,
532 printf("\n# \t Total\t Average\t "
533 "Maximum\t Minimum");
534 printf("\n# enqueued\t%12"PRIu64"\t%10"PRIu64"\t"
535 "%10"PRIu64"\t%10"PRIu64, enqd_tot,
536 enqd_avg, enqd_max, enqd_min);
537 printf("\n# dequeued\t%12"PRIu64"\t%10"PRIu64"\t"
538 "%10"PRIu64"\t%10"PRIu64, deqd_tot,
539 deqd_avg, deqd_max, deqd_min);
540 printf("\n# cycles\t%12"PRIu64"\t%10"PRIu64"\t"
541 "%10"PRIu64"\t%10"PRIu64, tsc_tot,
542 tsc_avg, tsc_max, tsc_min);
543 printf("\n# time [us]\t%12.0f\t%10.3f\t%10.3f\t%10.3f",
544 time_tot, time_avg, time_max, time_min);
549 /* Get next size from range or list */
550 if (ctx->options->inc_burst_size != 0)
551 test_burst_size += ctx->options->inc_burst_size;
553 if (++burst_size_idx == ctx->options->burst_size_count)
556 ctx->options->burst_size_list[burst_size_idx];
564 cperf_latency_test_destructor(void *arg)
566 struct cperf_latency_ctx *ctx = arg;
571 cperf_latency_test_free(ctx, ctx->options->pool_sz);