blob: ab9673652d198f213012003f1d424e7784460e49 [file] [log] [blame]
Etienne Carriere9b7b70d2020-05-16 10:27:23 +02001// SPDX-License-Identifier: BSD-2-Clause
Igor Opaniuk136644a2016-09-13 13:40:56 +03002/*
3 * Copyright (c) 2015, Linaro Limited
4 * All rights reserved.
Igor Opaniuk136644a2016-09-13 13:40:56 +03005 */
6
Etienne Carriered0b3ee22017-05-03 18:20:59 +02007#include <adbg.h>
Igor Opaniuk136644a2016-09-13 13:40:56 +03008#include <fcntl.h>
9#include <math.h>
10#include <stdint.h>
11#include <stdio.h>
12#include <stdlib.h>
13#include <string.h>
14#include <strings.h>
Etienne Carriered0b3ee22017-05-03 18:20:59 +020015#include <sys/types.h>
16#include <sys/stat.h>
17#include <tee_client_api.h>
Igor Opaniuk136644a2016-09-13 13:40:56 +030018#include <time.h>
19#include <unistd.h>
20
Igor Opaniukf9b7fd22016-09-16 16:22:34 +030021#include "crypto_common.h"
Etienne Carrieree4ec9e42019-03-28 13:30:21 +010022#include "xtest_helpers.h"
Igor Opaniuk136644a2016-09-13 13:40:56 +030023
24/*
25 * TEE client stuff
26 */
27
28static TEEC_Context ctx;
29static TEEC_Session sess;
30static TEEC_SharedMemory in_shm = {
31 .flags = TEEC_MEM_INPUT
32};
33static TEEC_SharedMemory out_shm = {
34 .flags = TEEC_MEM_OUTPUT
35};
36
Etienne Carriere2f18cc42017-04-26 15:01:26 +020037static void errx(const char *msg, TEEC_Result res, uint32_t *orig)
Igor Opaniuk136644a2016-09-13 13:40:56 +030038{
39 fprintf(stderr, "%s: 0x%08x", msg, res);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020040 if (orig)
41 fprintf(stderr, " (orig=%d)", (int)*orig);
42 fprintf(stderr, "\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +030043 exit (1);
44}
45
Etienne Carriere2f18cc42017-04-26 15:01:26 +020046static void check_res(TEEC_Result res, const char *errmsg, uint32_t *orig)
Igor Opaniuk136644a2016-09-13 13:40:56 +030047{
48 if (res != TEEC_SUCCESS)
Etienne Carriere2f18cc42017-04-26 15:01:26 +020049 errx(errmsg, res, orig);
Igor Opaniuk136644a2016-09-13 13:40:56 +030050}
51
52static void open_ta(void)
53{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +010054 TEEC_Result res = TEEC_ERROR_GENERIC;
yuzexi4c9b16a2022-11-24 15:42:34 +080055 TEEC_UUID uuid = TA_HASH_PERF_UUID;
Etienne Carrieree4ec9e42019-03-28 13:30:21 +010056 uint32_t err_origin = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +030057
58 res = TEEC_InitializeContext(NULL, &ctx);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020059 check_res(res,"TEEC_InitializeContext", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +030060
61 res = TEEC_OpenSession(&ctx, &sess, &uuid, TEEC_LOGIN_PUBLIC, NULL,
62 NULL, &err_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020063 check_res(res,"TEEC_OpenSession", &err_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +030064}
65
66/*
67 * Statistics
68 *
69 * We want to compute min, max, mean and standard deviation of processing time
70 */
71
72struct statistics {
73 int n;
74 double m;
75 double M2;
76 double min;
77 double max;
78 int initialized;
79};
80
81/* Take new sample into account (Knuth/Welford algorithm) */
82static void update_stats(struct statistics *s, uint64_t t)
83{
84 double x = (double)t;
85 double delta = x - s->m;
86
87 s->n++;
88 s->m += delta/s->n;
89 s->M2 += delta*(x - s->m);
90 if (!s->initialized) {
91 s->min = s->max = x;
92 s->initialized = 1;
93 } else {
94 if (s->min > x)
95 s->min = x;
96 if (s->max < x)
97 s->max = x;
98 }
99}
100
101static double stddev(struct statistics *s)
102{
103 if (s->n < 2)
104 return NAN;
105 return sqrt(s->M2/s->n);
106}
107
108static const char *algo_str(uint32_t algo)
109{
110 switch (algo) {
111 case TA_SHA_SHA1:
112 return "SHA1";
113 case TA_SHA_SHA224:
114 return "SHA224";
115 case TA_SHA_SHA256:
116 return "SHA256";
117 case TA_SHA_SHA384:
118 return "SHA384";
119 case TA_SHA_SHA512:
120 return "SHA512";
yuzexi4c9b16a2022-11-24 15:42:34 +0800121 case TA_SM3:
122 return "SM3";
yuzexi99741332022-12-01 11:23:28 +0800123 case TA_HMAC_SHA1:
124 return "HMAC_SHA1";
125 case TA_HMAC_SHA224:
126 return "HMAC_SHA224";
127 case TA_HMAC_SHA256:
128 return "HMAC_SHA256";
129 case TA_HMAC_SHA384:
130 return "HMAC_SHA384";
131 case TA_HMAC_SHA512:
132 return "HMAC_SHA512";
133 case TA_HMAC_SM3:
134 return "HMAC_SM3";
Igor Opaniuk136644a2016-09-13 13:40:56 +0300135 default:
136 return "???";
137 }
138}
139
140static int hash_size(uint32_t algo)
141{
142 switch (algo) {
143 case TA_SHA_SHA1:
yuzexi99741332022-12-01 11:23:28 +0800144 case TA_HMAC_SHA1:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300145 return 20;
146 case TA_SHA_SHA224:
yuzexi99741332022-12-01 11:23:28 +0800147 case TA_HMAC_SHA224:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300148 return 28;
149 case TA_SHA_SHA256:
yuzexi99741332022-12-01 11:23:28 +0800150 case TA_HMAC_SHA256:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300151 return 32;
152 case TA_SHA_SHA384:
yuzexi99741332022-12-01 11:23:28 +0800153 case TA_HMAC_SHA384:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300154 return 48;
155 case TA_SHA_SHA512:
yuzexi99741332022-12-01 11:23:28 +0800156 case TA_HMAC_SHA512:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300157 return 64;
yuzexi4c9b16a2022-11-24 15:42:34 +0800158 case TA_SM3:
yuzexi99741332022-12-01 11:23:28 +0800159 case TA_HMAC_SM3:
yuzexi4c9b16a2022-11-24 15:42:34 +0800160 return 32;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300161 default:
162 return 0;
163 }
164}
165
166#define _TO_STR(x) #x
167#define TO_STR(x) _TO_STR(x)
168
Igor Opaniuk136644a2016-09-13 13:40:56 +0300169static void alloc_shm(size_t sz, uint32_t algo, int offset)
170{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100171 TEEC_Result res = TEEC_ERROR_GENERIC;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300172
173 in_shm.buffer = NULL;
174 in_shm.size = sz + offset;
175 res = TEEC_AllocateSharedMemory(&ctx, &in_shm);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200176 check_res(res, "TEEC_AllocateSharedMemory", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300177
178 out_shm.buffer = NULL;
179 out_shm.size = hash_size(algo);
180 res = TEEC_AllocateSharedMemory(&ctx, &out_shm);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200181 check_res(res, "TEEC_AllocateSharedMemory", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300182}
183
184static void free_shm(void)
185{
186 TEEC_ReleaseSharedMemory(&in_shm);
187 TEEC_ReleaseSharedMemory(&out_shm);
188}
189
190static ssize_t read_random(void *in, size_t rsize)
191{
192 static int rnd;
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100193 ssize_t s = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300194
195 if (!rnd) {
196 rnd = open("/dev/urandom", O_RDONLY);
197 if (rnd < 0) {
198 perror("open");
199 return 1;
200 }
201 }
202 s = read(rnd, in, rsize);
203 if (s < 0) {
204 perror("read");
205 return 1;
206 }
207 if ((size_t)s != rsize) {
208 printf("read: requested %zu bytes, got %zd\n",
209 rsize, s);
210 }
211 return 0;
212}
213
214static long get_current_time(struct timespec *ts)
215{
216 if (clock_gettime(CLOCK_MONOTONIC, ts) < 0) {
217 perror("clock_gettime");
218 exit(1);
219 }
220 return 0;
221}
222
223static uint64_t timespec_diff_ns(struct timespec *start, struct timespec *end)
224{
225 uint64_t ns = 0;
226
227 if (end->tv_nsec < start->tv_nsec) {
228 ns += 1000000000 * (end->tv_sec - start->tv_sec - 1);
229 ns += 1000000000 - start->tv_nsec + end->tv_nsec;
230 } else {
231 ns += 1000000000 * (end->tv_sec - start->tv_sec);
232 ns += end->tv_nsec - start->tv_nsec;
233 }
234 return ns;
235}
236
yuzexi4c9b16a2022-11-24 15:42:34 +0800237static uint64_t run_test_once(void *in, size_t size, int random_in,
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100238 TEEC_Operation *op)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300239{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100240 struct timespec t0 = { };
241 struct timespec t1 = { };
242 TEEC_Result res = TEEC_ERROR_GENERIC;
243 uint32_t ret_origin = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300244
Etienne Carriered851fc72017-04-26 15:08:02 +0200245 if (random_in == CRYPTO_USE_RANDOM)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300246 read_random(in, size);
Etienne Carriered851fc72017-04-26 15:08:02 +0200247
Igor Opaniuk136644a2016-09-13 13:40:56 +0300248 get_current_time(&t0);
yuzexi4c9b16a2022-11-24 15:42:34 +0800249 res = TEEC_InvokeCommand(&sess, TA_HASH_PERF_CMD_PROCESS, op,
Igor Opaniuk136644a2016-09-13 13:40:56 +0300250 &ret_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200251 check_res(res, "TEEC_InvokeCommand", &ret_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300252 get_current_time(&t1);
253
254 return timespec_diff_ns(&t0, &t1);
255}
256
257static void prepare_op(int algo)
258{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100259 TEEC_Result res = TEEC_ERROR_GENERIC;
260 uint32_t ret_origin = 0;
261 TEEC_Operation op = TEEC_OPERATION_INITIALIZER;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300262
Igor Opaniuk136644a2016-09-13 13:40:56 +0300263 op.paramTypes = TEEC_PARAM_TYPES(TEEC_VALUE_INPUT, TEEC_NONE,
264 TEEC_NONE, TEEC_NONE);
265 op.params[0].value.a = algo;
yuzexi4c9b16a2022-11-24 15:42:34 +0800266 res = TEEC_InvokeCommand(&sess, TA_HASH_PERF_CMD_PREPARE_OP, &op,
Igor Opaniuk136644a2016-09-13 13:40:56 +0300267 &ret_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200268 check_res(res, "TEEC_InvokeCommand", &ret_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300269}
270
271static void do_warmup(int warmup)
272{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100273 struct timespec t0 = { };
274 struct timespec t = { };
275 int i = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300276
277 get_current_time(&t0);
278 do {
279 for (i = 0; i < 100000; i++)
280 ;
281 get_current_time(&t);
282 } while (timespec_diff_ns(&t0, &t) < (uint64_t)warmup * 1000000000);
283}
284
285static const char *yesno(int v)
286{
287 return (v ? "yes" : "no");
288}
289
290static double mb_per_sec(size_t size, double usec)
291{
292 return (1000000000/usec)*((double)size/(1024*1024));
293}
294
295/* Hash test: buffer of size byte. Run test n times.
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100296 * Entry point for running SHA benchmark
297 * Params:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300298 * algo - Algorithm
299 * size - Buffer size
300 * n - Number of measurements
301 * l - Amount of inner loops
302 * random_in - Get input from /dev/urandom
303 * offset - Buffer offset wrt. alloc-ed address
304 * warmup - Start with a-second busy loop
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100305 * verbosity - Verbosity level
Igor Opaniuk136644a2016-09-13 13:40:56 +0300306 * */
yuzexi4c9b16a2022-11-24 15:42:34 +0800307extern void hash_perf_run_test(int algo, size_t size, unsigned int n,
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100308 unsigned int l, int random_in, int offset,
Igor Opaniuk136644a2016-09-13 13:40:56 +0300309 int warmup, int verbosity)
310{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100311 uint64_t t = 0;
312 struct statistics stats = { };
313 TEEC_Operation op = TEEC_OPERATION_INITIALIZER;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300314 int n0 = n;
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100315 struct timespec ts = { };
316 double sd = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300317
yuzexi4c9b16a2022-11-24 15:42:34 +0800318 vverbose("hash-perf\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +0300319 if (clock_getres(CLOCK_MONOTONIC, &ts) < 0) {
320 perror("clock_getres");
321 return;
322 }
André Draszik30481e32020-01-11 07:11:15 +0000323 vverbose("Clock resolution is %jd ns\n",
324 (intmax_t)ts.tv_sec * 1000000000 + ts.tv_nsec);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300325
326 open_ta();
327 prepare_op(algo);
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100328
Igor Opaniuk136644a2016-09-13 13:40:56 +0300329 alloc_shm(size, algo, offset);
330
Etienne Carriered851fc72017-04-26 15:08:02 +0200331 if (random_in == CRYPTO_USE_ZEROS)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300332 memset((uint8_t *)in_shm.buffer + offset, 0, size);
333
Igor Opaniuk136644a2016-09-13 13:40:56 +0300334 op.paramTypes = TEEC_PARAM_TYPES(TEEC_MEMREF_PARTIAL_INPUT,
335 TEEC_MEMREF_PARTIAL_OUTPUT,
336 TEEC_VALUE_INPUT, TEEC_NONE);
337 op.params[0].memref.parent = &in_shm;
338 op.params[0].memref.offset = 0;
339 op.params[0].memref.size = size + offset;
340 op.params[1].memref.parent = &out_shm;
341 op.params[1].memref.offset = 0;
342 op.params[1].memref.size = hash_size(algo);
343 op.params[2].value.a = l;
344 op.params[2].value.b = offset;
345
346 verbose("Starting test: %s, size=%zu bytes, ",
347 algo_str(algo), size);
Etienne Carriered851fc72017-04-26 15:08:02 +0200348 verbose("random=%s, ", yesno(random_in == CRYPTO_USE_RANDOM));
Igor Opaniuk136644a2016-09-13 13:40:56 +0300349 verbose("unaligned=%s, ", yesno(offset));
350 verbose("inner loops=%u, loops=%u, warm-up=%u s\n", l, n, warmup);
351
352 if (warmup)
353 do_warmup(warmup);
354
Igor Opaniuk136644a2016-09-13 13:40:56 +0300355 while (n-- > 0) {
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100356 t = run_test_once((uint8_t *)in_shm.buffer + offset, size,
357 random_in, &op);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300358 update_stats(&stats, t);
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100359 if (n % (n0 / 10) == 0)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300360 vverbose("#");
361 }
362 vverbose("\n");
Jerome Forissierd99fe972017-02-21 15:30:57 +0100363 sd = stddev(&stats);
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100364 printf("min=%gus max=%gus mean=%gus stddev=%gus (cv %g%%) (%gMiB/s)\n",
365 stats.min / 1000, stats.max / 1000, stats.m / 1000,
366 sd / 1000, 100 * sd / stats.m, mb_per_sec(size, stats.m));
367 verbose("2-sigma interval: %g..%gus (%g..%gMiB/s)\n",
368 (stats.m - 2 * sd) / 1000, (stats.m + 2 * sd) / 1000,
369 mb_per_sec(size, stats.m + 2 * sd),
370 mb_per_sec(size, stats.m - 2 * sd));
Igor Opaniuk136644a2016-09-13 13:40:56 +0300371 free_shm();
372}
373
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100374static void usage(const char *progname,
Igor Opaniuk136644a2016-09-13 13:40:56 +0300375 /* Default params */
376 int algo, size_t size, int warmup, int l, int n)
377{
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200378 fprintf(stderr, "Usage: %s [-h]\n", progname);
379 fprintf(stderr, "Usage: %s [-a ALGO] [-l LOOP] [-n LOOP] [-r] [-s SIZE]", progname);
380 fprintf(stderr, " [-v [-v]] [-w SEC]\n");
yuzexi4c9b16a2022-11-24 15:42:34 +0800381 fprintf(stderr, "Hash performance testing tool for OP-TEE\n");
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200382 fprintf(stderr, "\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +0300383 fprintf(stderr, "Options:\n");
yuzexi99741332022-12-01 11:23:28 +0800384 fprintf(stderr, " -a ALGO Algorithm (SHA1, SHA224, SHA256, SHA384, SHA512, SM3,"
385 " HMAC_SHA1, HMAC_SHA224, HMAC_SHA256,"
386 " HMAC_SHA384, HMAC_SHA512, HMAC_SM3) [%s]\n", algo_str(algo));
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200387 fprintf(stderr, " -h|--help Print this help and exit\n");
388 fprintf(stderr, " -l LOOP Inner loop iterations (TA calls TEE_DigestDoFinal() <x> times) [%u]\n", l);
389 fprintf(stderr, " -n LOOP Outer test loop iterations [%u]\n", n);
390 fprintf(stderr, " -r|--random Get input data from /dev/urandom (default: all-zeros)\n");
391 fprintf(stderr, " -s SIZE Test buffer size in bytes [%zu]\n", size);
392 fprintf(stderr, " -u|--unalign Use unaligned buffer (odd address)\n");
393 fprintf(stderr, " -v Be verbose (use twice for greater effect)\n");
394 fprintf(stderr, " -w|--warmup SEC Warm-up time in seconds: execute a busy loop before\n");
395 fprintf(stderr, " the test to mitigate the effects of cpufreq etc. [%u]\n", warmup);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300396}
397
398#define NEXT_ARG(i) \
399 do { \
400 if (++i == argc) { \
401 fprintf(stderr, "%s: %s: missing argument\n", \
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100402 argv[0], argv[i - 1]); \
Igor Opaniuk136644a2016-09-13 13:40:56 +0300403 return 1; \
404 } \
405 } while (0);
406
yuzexi4c9b16a2022-11-24 15:42:34 +0800407extern int hash_perf_runner_cmd_parser(int argc, char *argv[])
Igor Opaniuk136644a2016-09-13 13:40:56 +0300408{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100409 int i = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300410 /* Command line params */
411 size_t size = 1024; /* Buffer size (-s) */
Igor Opaniukf9b7fd22016-09-16 16:22:34 +0300412 unsigned int n = CRYPTO_DEF_COUNT;/* Number of measurements (-n)*/
413 unsigned int l = CRYPTO_DEF_LOOPS; /* Inner loops (-l) */
414 int verbosity = CRYPTO_DEF_VERBOSITY; /* Verbosity (-v) */
Igor Opaniuk136644a2016-09-13 13:40:56 +0300415 int algo = TA_SHA_SHA1; /* Algorithm (-a) */
Igor Opaniukf9b7fd22016-09-16 16:22:34 +0300416 /* Get input data from /dev/urandom (-r) */
Etienne Carriered851fc72017-04-26 15:08:02 +0200417 int random_in = CRYPTO_USE_ZEROS;
Igor Opaniukf9b7fd22016-09-16 16:22:34 +0300418 /* Start with a 2-second busy loop (-w) */
419 int warmup = CRYPTO_DEF_WARMUP;
420 int offset = 0; /* Buffer offset wrt. alloc'ed address (-u) */
Igor Opaniuk136644a2016-09-13 13:40:56 +0300421
Igor Opaniuk136644a2016-09-13 13:40:56 +0300422 /* Parse command line */
423 for (i = 1; i < argc; i++) {
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200424 if (!strcmp(argv[i], "-h") || !strcmp(argv[i], "--help")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300425 usage(argv[0], algo, size, warmup, l, n);
426 return 0;
427 }
428 }
429 for (i = 1; i < argc; i++) {
430 if (!strcmp(argv[i], "-l")) {
431 NEXT_ARG(i);
432 l = atoi(argv[i]);
433 } else if (!strcmp(argv[i], "-a")) {
434 NEXT_ARG(i);
435 if (!strcasecmp(argv[i], "SHA1"))
436 algo = TA_SHA_SHA1;
437 else if (!strcasecmp(argv[i], "SHA224"))
438 algo = TA_SHA_SHA224;
439 else if (!strcasecmp(argv[i], "SHA256"))
440 algo = TA_SHA_SHA256;
441 else if (!strcasecmp(argv[i], "SHA384"))
442 algo = TA_SHA_SHA384;
443 else if (!strcasecmp(argv[i], "SHA512"))
444 algo = TA_SHA_SHA512;
yuzexi4c9b16a2022-11-24 15:42:34 +0800445 else if (!strcasecmp(argv[i], "SM3"))
446 algo = TA_SM3;
yuzexi99741332022-12-01 11:23:28 +0800447 else if (!strcasecmp(argv[i], "HMAC_SHA1"))
448 algo = TA_HMAC_SHA1;
449 else if (!strcasecmp(argv[i], "HMAC_SHA224"))
450 algo = TA_HMAC_SHA224;
451 else if (!strcasecmp(argv[i], "HMAC_SHA256"))
452 algo = TA_HMAC_SHA256;
453 else if (!strcasecmp(argv[i], "HMAC_SHA384"))
454 algo = TA_HMAC_SHA384;
455 else if (!strcasecmp(argv[i], "HMAC_SHA512"))
456 algo = TA_HMAC_SHA512;
457 else if (!strcasecmp(argv[i], "HMAC_SM3"))
458 algo = TA_HMAC_SM3;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300459 else {
460 fprintf(stderr, "%s, invalid algorithm\n",
461 argv[0]);
462 usage(argv[0], algo, size, warmup, l, n);
463 return 1;
464 }
465 } else if (!strcmp(argv[i], "-n")) {
466 NEXT_ARG(i);
467 n = atoi(argv[i]);
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200468 } else if (!strcmp(argv[i], "--random") ||
469 !strcmp(argv[i], "-r")) {
Etienne Carriered851fc72017-04-26 15:08:02 +0200470 random_in = CRYPTO_USE_RANDOM;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300471 } else if (!strcmp(argv[i], "-s")) {
472 NEXT_ARG(i);
473 size = atoi(argv[i]);
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200474 } else if (!strcmp(argv[i], "--unalign") ||
475 !strcmp(argv[i], "-u")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300476 offset = 1;
477 } else if (!strcmp(argv[i], "-v")) {
478 verbosity++;
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200479 } else if (!strcmp(argv[i], "--warmup") ||
480 !strcmp(argv[i], "-w")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300481 NEXT_ARG(i);
482 warmup = atoi(argv[i]);
483 } else {
484 fprintf(stderr, "%s: invalid argument: %s\n",
485 argv[0], argv[i]);
486 usage(argv[0], algo, size, warmup, l, n);
487 return 1;
488 }
489 }
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100490
yuzexi4c9b16a2022-11-24 15:42:34 +0800491 hash_perf_run_test(algo, size, n, l, random_in, offset, warmup, verbosity);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300492
493 return 0;
494}