1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2016-2017 Intel Corporation
5 #include <rte_malloc.h>
6 #include <rte_cycles.h>
7 #include <rte_crypto.h>
8 #include <rte_cryptodev.h>
10 #include "cperf_test_throughput.h"
11 #include "cperf_ops.h"
12 #include "cperf_test_common.h"
14 struct cperf_throughput_ctx
{
19 struct rte_mempool
*pool
;
21 struct rte_cryptodev_sym_session
*sess
;
23 cperf_populate_ops_t populate_ops
;
25 uint32_t src_buf_offset
;
26 uint32_t dst_buf_offset
;
28 const struct cperf_options
*options
;
29 const struct cperf_test_vector
*test_vector
;
33 cperf_throughput_test_free(struct cperf_throughput_ctx
*ctx
)
37 rte_cryptodev_sym_session_clear(ctx
->dev_id
, ctx
->sess
);
38 rte_cryptodev_sym_session_free(ctx
->sess
);
42 rte_mempool_free(ctx
->pool
);
49 cperf_throughput_test_constructor(struct rte_mempool
*sess_mp
,
50 struct rte_mempool
*sess_priv_mp
,
51 uint8_t dev_id
, uint16_t qp_id
,
52 const struct cperf_options
*options
,
53 const struct cperf_test_vector
*test_vector
,
54 const struct cperf_op_fns
*op_fns
)
56 struct cperf_throughput_ctx
*ctx
= NULL
;
58 ctx
= rte_malloc(NULL
, sizeof(struct cperf_throughput_ctx
), 0);
65 ctx
->populate_ops
= op_fns
->populate_ops
;
66 ctx
->options
= options
;
67 ctx
->test_vector
= test_vector
;
69 /* IV goes at the end of the crypto operation */
70 uint16_t iv_offset
= sizeof(struct rte_crypto_op
) +
71 sizeof(struct rte_crypto_sym_op
);
73 ctx
->sess
= op_fns
->sess_create(sess_mp
, sess_priv_mp
, dev_id
, options
,
74 test_vector
, iv_offset
);
75 if (ctx
->sess
== NULL
)
78 if (cperf_alloc_common_memory(options
, test_vector
, dev_id
, qp_id
, 0,
79 &ctx
->src_buf_offset
, &ctx
->dst_buf_offset
,
85 cperf_throughput_test_free(ctx
);
91 cperf_throughput_test_runner(void *test_ctx
)
93 struct cperf_throughput_ctx
*ctx
= test_ctx
;
94 uint16_t test_burst_size
;
95 uint8_t burst_size_idx
= 0;
96 uint32_t imix_idx
= 0;
100 struct rte_crypto_op
*ops
[ctx
->options
->max_burst_size
];
101 struct rte_crypto_op
*ops_processed
[ctx
->options
->max_burst_size
];
104 uint32_t lcore
= rte_lcore_id();
106 #ifdef CPERF_LINEARIZATION_ENABLE
107 struct rte_cryptodev_info dev_info
;
110 /* Check if source mbufs require coalescing */
111 if (ctx
->options
->segment_sz
< ctx
->options
->max_buffer_size
) {
112 rte_cryptodev_info_get(ctx
->dev_id
, &dev_info
);
113 if ((dev_info
.feature_flags
&
114 RTE_CRYPTODEV_FF_MBUF_SCATTER_GATHER
) == 0)
117 #endif /* CPERF_LINEARIZATION_ENABLE */
119 ctx
->lcore_id
= lcore
;
121 /* Warm up the host CPU before starting the test */
122 for (i
= 0; i
< ctx
->options
->total_ops
; i
++)
123 rte_cryptodev_enqueue_burst(ctx
->dev_id
, ctx
->qp_id
, NULL
, 0);
125 /* Get first size from range or list */
126 if (ctx
->options
->inc_burst_size
!= 0)
127 test_burst_size
= ctx
->options
->min_burst_size
;
129 test_burst_size
= ctx
->options
->burst_size_list
[0];
131 uint16_t iv_offset
= sizeof(struct rte_crypto_op
) +
132 sizeof(struct rte_crypto_sym_op
);
134 while (test_burst_size
<= ctx
->options
->max_burst_size
) {
135 uint64_t ops_enqd
= 0, ops_enqd_total
= 0, ops_enqd_failed
= 0;
136 uint64_t ops_deqd
= 0, ops_deqd_total
= 0, ops_deqd_failed
= 0;
138 uint64_t tsc_start
, tsc_end
, tsc_duration
;
140 uint16_t ops_unused
= 0;
142 tsc_start
= rte_rdtsc_precise();
144 while (ops_enqd_total
< ctx
->options
->total_ops
) {
146 uint16_t burst_size
= ((ops_enqd_total
+ test_burst_size
)
147 <= ctx
->options
->total_ops
) ?
149 ctx
->options
->total_ops
-
152 uint16_t ops_needed
= burst_size
- ops_unused
;
154 /* Allocate objects containing crypto operations and mbufs */
155 if (rte_mempool_get_bulk(ctx
->pool
, (void **)ops
,
158 "Failed to allocate more crypto operations "
159 "from the crypto operation pool.\n"
160 "Consider increasing the pool size "
165 /* Setup crypto op, attach mbuf etc */
166 (ctx
->populate_ops
)(ops
, ctx
->src_buf_offset
,
168 ops_needed
, ctx
->sess
,
169 ctx
->options
, ctx
->test_vector
,
170 iv_offset
, &imix_idx
);
173 * When ops_needed is smaller than ops_enqd, the
174 * unused ops need to be moved to the front for
177 if (unlikely(ops_enqd
> ops_needed
)) {
178 size_t nb_b_to_mov
= ops_unused
* sizeof(
179 struct rte_crypto_op
*);
181 memmove(&ops
[ops_needed
], &ops
[ops_enqd
],
185 #ifdef CPERF_LINEARIZATION_ENABLE
187 /* PMD doesn't support scatter-gather and source buffer
189 * We need to linearize it before enqueuing.
191 for (i
= 0; i
< burst_size
; i
++)
192 rte_pktmbuf_linearize(ops
[i
]->sym
->m_src
);
194 #endif /* CPERF_LINEARIZATION_ENABLE */
196 /* Enqueue burst of ops on crypto device */
197 ops_enqd
= rte_cryptodev_enqueue_burst(ctx
->dev_id
, ctx
->qp_id
,
199 if (ops_enqd
< burst_size
)
203 * Calculate number of ops not enqueued (mainly for hw
204 * accelerators whose ingress queue can fill up).
206 ops_unused
= burst_size
- ops_enqd
;
207 ops_enqd_total
+= ops_enqd
;
210 /* Dequeue processed burst of ops from crypto device */
211 ops_deqd
= rte_cryptodev_dequeue_burst(ctx
->dev_id
, ctx
->qp_id
,
212 ops_processed
, test_burst_size
);
214 if (likely(ops_deqd
)) {
215 /* Free crypto ops so they can be reused. */
216 rte_mempool_put_bulk(ctx
->pool
,
217 (void **)ops_processed
, ops_deqd
);
219 ops_deqd_total
+= ops_deqd
;
222 * Count dequeue polls which didn't return any
223 * processed operations. This statistic is mainly
224 * relevant to hw accelerators.
231 /* Dequeue any operations still in the crypto device */
233 while (ops_deqd_total
< ctx
->options
->total_ops
) {
234 /* Sending 0 length burst to flush sw crypto device */
235 rte_cryptodev_enqueue_burst(ctx
->dev_id
, ctx
->qp_id
, NULL
, 0);
238 ops_deqd
= rte_cryptodev_dequeue_burst(ctx
->dev_id
, ctx
->qp_id
,
239 ops_processed
, test_burst_size
);
243 rte_mempool_put_bulk(ctx
->pool
,
244 (void **)ops_processed
, ops_deqd
);
245 ops_deqd_total
+= ops_deqd
;
249 tsc_end
= rte_rdtsc_precise();
250 tsc_duration
= (tsc_end
- tsc_start
);
252 /* Calculate average operations processed per second */
253 double ops_per_second
= ((double)ctx
->options
->total_ops
/
254 tsc_duration
) * rte_get_tsc_hz();
256 /* Calculate average throughput (Gbps) in bits per second */
257 double throughput_gbps
= ((ops_per_second
*
258 ctx
->options
->test_buffer_size
* 8) / 1000000000);
260 /* Calculate average cycles per packet */
261 double cycles_per_packet
= ((double)tsc_duration
/
262 ctx
->options
->total_ops
);
264 if (!ctx
->options
->csv
) {
266 printf("%12s%12s%12s%12s%12s%12s%12s%12s%12s%12s\n\n",
267 "lcore id", "Buf Size", "Burst Size",
268 "Enqueued", "Dequeued", "Failed Enq",
269 "Failed Deq", "MOps", "Gbps",
273 printf("%12u%12u%12u%12"PRIu64
"%12"PRIu64
"%12"PRIu64
274 "%12"PRIu64
"%12.4f%12.4f%12.2f\n",
276 ctx
->options
->test_buffer_size
,
282 ops_per_second
/1000000,
287 printf("#lcore id,Buffer Size(B),"
288 "Burst Size,Enqueued,Dequeued,Failed Enq,"
289 "Failed Deq,Ops(Millions),Throughput(Gbps),"
293 printf("%u;%u;%u;%"PRIu64
";%"PRIu64
";%"PRIu64
";%"PRIu64
";"
296 ctx
->options
->test_buffer_size
,
302 ops_per_second
/1000000,
307 /* Get next size from range or list */
308 if (ctx
->options
->inc_burst_size
!= 0)
309 test_burst_size
+= ctx
->options
->inc_burst_size
;
311 if (++burst_size_idx
== ctx
->options
->burst_size_count
)
313 test_burst_size
= ctx
->options
->burst_size_list
[burst_size_idx
];
323 cperf_throughput_test_destructor(void *arg
)
325 struct cperf_throughput_ctx
*ctx
= arg
;
330 cperf_throughput_test_free(ctx
);