blob: 309007f2a621e87ba09dbcfd264d3a5bfb34053d [file] [log] [blame]
Igor Opaniuk136644a2016-09-13 13:40:56 +03001/*
2 * Copyright (c) 2015, Linaro Limited
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice,
9 * this list of conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice,
12 * this list of conditions and the following disclaimer in the documentation
13 * and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25 * POSSIBILITY OF SUCH DAMAGE.
26 */
27
Etienne Carriered0b3ee22017-05-03 18:20:59 +020028#include <adbg.h>
Igor Opaniuk136644a2016-09-13 13:40:56 +030029#include <fcntl.h>
30#include <math.h>
31#include <stdint.h>
32#include <stdio.h>
33#include <stdlib.h>
34#include <string.h>
35#include <strings.h>
Etienne Carriered0b3ee22017-05-03 18:20:59 +020036#include <sys/types.h>
37#include <sys/stat.h>
38#include <tee_client_api.h>
Igor Opaniuk136644a2016-09-13 13:40:56 +030039#include <time.h>
40#include <unistd.h>
41
Igor Opaniukf9b7fd22016-09-16 16:22:34 +030042#include "crypto_common.h"
Etienne Carrieree4ec9e42019-03-28 13:30:21 +010043#include "xtest_helpers.h"
Igor Opaniuk136644a2016-09-13 13:40:56 +030044
45/*
46 * TEE client stuff
47 */
48
49static TEEC_Context ctx;
50static TEEC_Session sess;
51static TEEC_SharedMemory in_shm = {
52 .flags = TEEC_MEM_INPUT
53};
54static TEEC_SharedMemory out_shm = {
55 .flags = TEEC_MEM_OUTPUT
56};
57
Etienne Carriere2f18cc42017-04-26 15:01:26 +020058static void errx(const char *msg, TEEC_Result res, uint32_t *orig)
Igor Opaniuk136644a2016-09-13 13:40:56 +030059{
60 fprintf(stderr, "%s: 0x%08x", msg, res);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020061 if (orig)
62 fprintf(stderr, " (orig=%d)", (int)*orig);
63 fprintf(stderr, "\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +030064 exit (1);
65}
66
Etienne Carriere2f18cc42017-04-26 15:01:26 +020067static void check_res(TEEC_Result res, const char *errmsg, uint32_t *orig)
Igor Opaniuk136644a2016-09-13 13:40:56 +030068{
69 if (res != TEEC_SUCCESS)
Etienne Carriere2f18cc42017-04-26 15:01:26 +020070 errx(errmsg, res, orig);
Igor Opaniuk136644a2016-09-13 13:40:56 +030071}
72
73static void open_ta(void)
74{
Etienne Carrieree4ec9e42019-03-28 13:30:21 +010075 TEEC_Result res = TEEC_ERROR_GENERIC;
Igor Opaniuk136644a2016-09-13 13:40:56 +030076 TEEC_UUID uuid = TA_SHA_PERF_UUID;
Etienne Carrieree4ec9e42019-03-28 13:30:21 +010077 uint32_t err_origin = 0;
Igor Opaniuk136644a2016-09-13 13:40:56 +030078
79 res = TEEC_InitializeContext(NULL, &ctx);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020080 check_res(res,"TEEC_InitializeContext", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +030081
82 res = TEEC_OpenSession(&ctx, &sess, &uuid, TEEC_LOGIN_PUBLIC, NULL,
83 NULL, &err_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020084 check_res(res,"TEEC_OpenSession", &err_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +030085}
86
87/*
88 * Statistics
89 *
90 * We want to compute min, max, mean and standard deviation of processing time
91 */
92
93struct statistics {
94 int n;
95 double m;
96 double M2;
97 double min;
98 double max;
99 int initialized;
100};
101
102/* Take new sample into account (Knuth/Welford algorithm) */
103static void update_stats(struct statistics *s, uint64_t t)
104{
105 double x = (double)t;
106 double delta = x - s->m;
107
108 s->n++;
109 s->m += delta/s->n;
110 s->M2 += delta*(x - s->m);
111 if (!s->initialized) {
112 s->min = s->max = x;
113 s->initialized = 1;
114 } else {
115 if (s->min > x)
116 s->min = x;
117 if (s->max < x)
118 s->max = x;
119 }
120}
121
122static double stddev(struct statistics *s)
123{
124 if (s->n < 2)
125 return NAN;
126 return sqrt(s->M2/s->n);
127}
128
129static const char *algo_str(uint32_t algo)
130{
131 switch (algo) {
132 case TA_SHA_SHA1:
133 return "SHA1";
134 case TA_SHA_SHA224:
135 return "SHA224";
136 case TA_SHA_SHA256:
137 return "SHA256";
138 case TA_SHA_SHA384:
139 return "SHA384";
140 case TA_SHA_SHA512:
141 return "SHA512";
142 default:
143 return "???";
144 }
145}
146
147static int hash_size(uint32_t algo)
148{
149 switch (algo) {
150 case TA_SHA_SHA1:
151 return 20;
152 case TA_SHA_SHA224:
153 return 28;
154 case TA_SHA_SHA256:
155 return 32;
156 case TA_SHA_SHA384:
157 return 48;
158 case TA_SHA_SHA512:
159 return 64;
160 default:
161 return 0;
162 }
163}
164
165#define _TO_STR(x) #x
166#define TO_STR(x) _TO_STR(x)
167
168
169static 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
Etienne Carrieree4ec9e42019-03-28 13:30:21 +0100237static uint64_t run_test_once(void *in, size_t size, int random_in,
238 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);
249 res = TEEC_InvokeCommand(&sess, TA_SHA_PERF_CMD_PROCESS, op,
250 &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;
266 res = TEEC_InvokeCommand(&sess, TA_SHA_PERF_CMD_PREPARE_OP, &op,
267 &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 * */
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100307extern void sha_perf_run_test(int algo, size_t size, unsigned int n,
308 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
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100318 vverbose("sha-perf\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +0300319 if (clock_getres(CLOCK_MONOTONIC, &ts) < 0) {
320 perror("clock_getres");
321 return;
322 }
323 vverbose("Clock resolution is %lu ns\n", ts.tv_sec*1000000000 +
324 ts.tv_nsec);
325
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");
381 fprintf(stderr, "SHA performance testing tool for OP-TEE\n");
382 fprintf(stderr, "\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +0300383 fprintf(stderr, "Options:\n");
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200384 fprintf(stderr, " -a ALGO Algorithm (SHA1, SHA224, SHA256, SHA384, SHA512) [%s]\n", algo_str(algo));
385 fprintf(stderr, " -h|--help Print this help and exit\n");
386 fprintf(stderr, " -l LOOP Inner loop iterations (TA calls TEE_DigestDoFinal() <x> times) [%u]\n", l);
387 fprintf(stderr, " -n LOOP Outer test loop iterations [%u]\n", n);
388 fprintf(stderr, " -r|--random Get input data from /dev/urandom (default: all-zeros)\n");
389 fprintf(stderr, " -s SIZE Test buffer size in bytes [%zu]\n", size);
390 fprintf(stderr, " -u|--unalign Use unaligned buffer (odd address)\n");
391 fprintf(stderr, " -v Be verbose (use twice for greater effect)\n");
392 fprintf(stderr, " -w|--warmup SEC Warm-up time in seconds: execute a busy loop before\n");
393 fprintf(stderr, " the test to mitigate the effects of cpufreq etc. [%u]\n", warmup);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300394}
395
396#define NEXT_ARG(i) \
397 do { \
398 if (++i == argc) { \
399 fprintf(stderr, "%s: %s: missing argument\n", \
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100400 argv[0], argv[i - 1]); \
Igor Opaniuk136644a2016-09-13 13:40:56 +0300401 return 1; \
402 } \
403 } while (0);
404
405
406
407extern int sha_perf_runner_cmd_parser(int argc, char *argv[])
408{
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;
445 else {
446 fprintf(stderr, "%s, invalid algorithm\n",
447 argv[0]);
448 usage(argv[0], algo, size, warmup, l, n);
449 return 1;
450 }
451 } else if (!strcmp(argv[i], "-n")) {
452 NEXT_ARG(i);
453 n = atoi(argv[i]);
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200454 } else if (!strcmp(argv[i], "--random") ||
455 !strcmp(argv[i], "-r")) {
Etienne Carriered851fc72017-04-26 15:08:02 +0200456 random_in = CRYPTO_USE_RANDOM;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300457 } else if (!strcmp(argv[i], "-s")) {
458 NEXT_ARG(i);
459 size = atoi(argv[i]);
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200460 } else if (!strcmp(argv[i], "--unalign") ||
461 !strcmp(argv[i], "-u")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300462 offset = 1;
463 } else if (!strcmp(argv[i], "-v")) {
464 verbosity++;
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200465 } else if (!strcmp(argv[i], "--warmup") ||
466 !strcmp(argv[i], "-w")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300467 NEXT_ARG(i);
468 warmup = atoi(argv[i]);
469 } else {
470 fprintf(stderr, "%s: invalid argument: %s\n",
471 argv[0], argv[i]);
472 usage(argv[0], algo, size, warmup, l, n);
473 return 1;
474 }
475 }
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100476
Igor Opaniuk136644a2016-09-13 13:40:56 +0300477 sha_perf_run_test(algo, size, n, l, random_in, offset, warmup, verbosity);
478
479 return 0;
480}