blob: 1f645f0625b157027894a11251cabdb7f8c1ed6e [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"
Igor Opaniuk136644a2016-09-13 13:40:56 +030043
44/*
45 * TEE client stuff
46 */
47
48static TEEC_Context ctx;
49static TEEC_Session sess;
50static TEEC_SharedMemory in_shm = {
51 .flags = TEEC_MEM_INPUT
52};
53static TEEC_SharedMemory out_shm = {
54 .flags = TEEC_MEM_OUTPUT
55};
56
Etienne Carriere2f18cc42017-04-26 15:01:26 +020057static void errx(const char *msg, TEEC_Result res, uint32_t *orig)
Igor Opaniuk136644a2016-09-13 13:40:56 +030058{
59 fprintf(stderr, "%s: 0x%08x", msg, res);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020060 if (orig)
61 fprintf(stderr, " (orig=%d)", (int)*orig);
62 fprintf(stderr, "\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +030063 exit (1);
64}
65
Etienne Carriere2f18cc42017-04-26 15:01:26 +020066static void check_res(TEEC_Result res, const char *errmsg, uint32_t *orig)
Igor Opaniuk136644a2016-09-13 13:40:56 +030067{
68 if (res != TEEC_SUCCESS)
Etienne Carriere2f18cc42017-04-26 15:01:26 +020069 errx(errmsg, res, orig);
Igor Opaniuk136644a2016-09-13 13:40:56 +030070}
71
72static void open_ta(void)
73{
74 TEEC_Result res;
75 TEEC_UUID uuid = TA_SHA_PERF_UUID;
76 uint32_t err_origin;
77
78 res = TEEC_InitializeContext(NULL, &ctx);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020079 check_res(res,"TEEC_InitializeContext", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +030080
81 res = TEEC_OpenSession(&ctx, &sess, &uuid, TEEC_LOGIN_PUBLIC, NULL,
82 NULL, &err_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +020083 check_res(res,"TEEC_OpenSession", &err_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +030084}
85
86/*
87 * Statistics
88 *
89 * We want to compute min, max, mean and standard deviation of processing time
90 */
91
92struct statistics {
93 int n;
94 double m;
95 double M2;
96 double min;
97 double max;
98 int initialized;
99};
100
101/* Take new sample into account (Knuth/Welford algorithm) */
102static void update_stats(struct statistics *s, uint64_t t)
103{
104 double x = (double)t;
105 double delta = x - s->m;
106
107 s->n++;
108 s->m += delta/s->n;
109 s->M2 += delta*(x - s->m);
110 if (!s->initialized) {
111 s->min = s->max = x;
112 s->initialized = 1;
113 } else {
114 if (s->min > x)
115 s->min = x;
116 if (s->max < x)
117 s->max = x;
118 }
119}
120
121static double stddev(struct statistics *s)
122{
123 if (s->n < 2)
124 return NAN;
125 return sqrt(s->M2/s->n);
126}
127
128static const char *algo_str(uint32_t algo)
129{
130 switch (algo) {
131 case TA_SHA_SHA1:
132 return "SHA1";
133 case TA_SHA_SHA224:
134 return "SHA224";
135 case TA_SHA_SHA256:
136 return "SHA256";
137 case TA_SHA_SHA384:
138 return "SHA384";
139 case TA_SHA_SHA512:
140 return "SHA512";
141 default:
142 return "???";
143 }
144}
145
146static int hash_size(uint32_t algo)
147{
148 switch (algo) {
149 case TA_SHA_SHA1:
150 return 20;
151 case TA_SHA_SHA224:
152 return 28;
153 case TA_SHA_SHA256:
154 return 32;
155 case TA_SHA_SHA384:
156 return 48;
157 case TA_SHA_SHA512:
158 return 64;
159 default:
160 return 0;
161 }
162}
163
164#define _TO_STR(x) #x
165#define TO_STR(x) _TO_STR(x)
166
167
168static void alloc_shm(size_t sz, uint32_t algo, int offset)
169{
170 TEEC_Result res;
171
172 in_shm.buffer = NULL;
173 in_shm.size = sz + offset;
174 res = TEEC_AllocateSharedMemory(&ctx, &in_shm);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200175 check_res(res, "TEEC_AllocateSharedMemory", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300176
177 out_shm.buffer = NULL;
178 out_shm.size = hash_size(algo);
179 res = TEEC_AllocateSharedMemory(&ctx, &out_shm);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200180 check_res(res, "TEEC_AllocateSharedMemory", NULL);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300181}
182
183static void free_shm(void)
184{
185 TEEC_ReleaseSharedMemory(&in_shm);
186 TEEC_ReleaseSharedMemory(&out_shm);
187}
188
189static ssize_t read_random(void *in, size_t rsize)
190{
191 static int rnd;
192 ssize_t s;
193
194 if (!rnd) {
195 rnd = open("/dev/urandom", O_RDONLY);
196 if (rnd < 0) {
197 perror("open");
198 return 1;
199 }
200 }
201 s = read(rnd, in, rsize);
202 if (s < 0) {
203 perror("read");
204 return 1;
205 }
206 if ((size_t)s != rsize) {
207 printf("read: requested %zu bytes, got %zd\n",
208 rsize, s);
209 }
210 return 0;
211}
212
213static long get_current_time(struct timespec *ts)
214{
215 if (clock_gettime(CLOCK_MONOTONIC, ts) < 0) {
216 perror("clock_gettime");
217 exit(1);
218 }
219 return 0;
220}
221
222static uint64_t timespec_diff_ns(struct timespec *start, struct timespec *end)
223{
224 uint64_t ns = 0;
225
226 if (end->tv_nsec < start->tv_nsec) {
227 ns += 1000000000 * (end->tv_sec - start->tv_sec - 1);
228 ns += 1000000000 - start->tv_nsec + end->tv_nsec;
229 } else {
230 ns += 1000000000 * (end->tv_sec - start->tv_sec);
231 ns += end->tv_nsec - start->tv_nsec;
232 }
233 return ns;
234}
235
236static uint64_t run_test_once(void *in, size_t size, int random_in, TEEC_Operation *op)
237{
238 struct timespec t0, t1;
239 TEEC_Result res;
240 uint32_t ret_origin;
241
Etienne Carriered851fc72017-04-26 15:08:02 +0200242 if (random_in == CRYPTO_USE_RANDOM)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300243 read_random(in, size);
Etienne Carriered851fc72017-04-26 15:08:02 +0200244
Igor Opaniuk136644a2016-09-13 13:40:56 +0300245 get_current_time(&t0);
246 res = TEEC_InvokeCommand(&sess, TA_SHA_PERF_CMD_PROCESS, op,
247 &ret_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200248 check_res(res, "TEEC_InvokeCommand", &ret_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300249 get_current_time(&t1);
250
251 return timespec_diff_ns(&t0, &t1);
252}
253
254static void prepare_op(int algo)
255{
256 TEEC_Result res;
257 uint32_t ret_origin;
258 TEEC_Operation op;
259
260 memset(&op, 0, sizeof(op));
261 op.paramTypes = TEEC_PARAM_TYPES(TEEC_VALUE_INPUT, TEEC_NONE,
262 TEEC_NONE, TEEC_NONE);
263 op.params[0].value.a = algo;
264 res = TEEC_InvokeCommand(&sess, TA_SHA_PERF_CMD_PREPARE_OP, &op,
265 &ret_origin);
Etienne Carriere2f18cc42017-04-26 15:01:26 +0200266 check_res(res, "TEEC_InvokeCommand", &ret_origin);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300267}
268
269static void do_warmup(int warmup)
270{
271 struct timespec t0, t;
272 int i;
273
274 get_current_time(&t0);
275 do {
276 for (i = 0; i < 100000; i++)
277 ;
278 get_current_time(&t);
279 } while (timespec_diff_ns(&t0, &t) < (uint64_t)warmup * 1000000000);
280}
281
282static const char *yesno(int v)
283{
284 return (v ? "yes" : "no");
285}
286
287static double mb_per_sec(size_t size, double usec)
288{
289 return (1000000000/usec)*((double)size/(1024*1024));
290}
291
292/* Hash test: buffer of size byte. Run test n times.
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100293 * Entry point for running SHA benchmark
294 * Params:
Igor Opaniuk136644a2016-09-13 13:40:56 +0300295 * algo - Algorithm
296 * size - Buffer size
297 * n - Number of measurements
298 * l - Amount of inner loops
299 * random_in - Get input from /dev/urandom
300 * offset - Buffer offset wrt. alloc-ed address
301 * warmup - Start with a-second busy loop
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100302 * verbosity - Verbosity level
Igor Opaniuk136644a2016-09-13 13:40:56 +0300303 * */
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100304extern void sha_perf_run_test(int algo, size_t size, unsigned int n,
305 unsigned int l, int random_in, int offset,
Igor Opaniuk136644a2016-09-13 13:40:56 +0300306 int warmup, int verbosity)
307{
308 uint64_t t;
309 struct statistics stats;
310 TEEC_Operation op;
311 int n0 = n;
312 struct timespec ts;
Jerome Forissierd99fe972017-02-21 15:30:57 +0100313 double sd;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300314
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100315 vverbose("sha-perf\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +0300316 if (clock_getres(CLOCK_MONOTONIC, &ts) < 0) {
317 perror("clock_getres");
318 return;
319 }
320 vverbose("Clock resolution is %lu ns\n", ts.tv_sec*1000000000 +
321 ts.tv_nsec);
322
323 open_ta();
324 prepare_op(algo);
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100325
Igor Opaniuk136644a2016-09-13 13:40:56 +0300326 alloc_shm(size, algo, offset);
327
Etienne Carriered851fc72017-04-26 15:08:02 +0200328 if (random_in == CRYPTO_USE_ZEROS)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300329 memset((uint8_t *)in_shm.buffer + offset, 0, size);
330
331 memset(&op, 0, sizeof(op));
332 op.paramTypes = TEEC_PARAM_TYPES(TEEC_MEMREF_PARTIAL_INPUT,
333 TEEC_MEMREF_PARTIAL_OUTPUT,
334 TEEC_VALUE_INPUT, TEEC_NONE);
335 op.params[0].memref.parent = &in_shm;
336 op.params[0].memref.offset = 0;
337 op.params[0].memref.size = size + offset;
338 op.params[1].memref.parent = &out_shm;
339 op.params[1].memref.offset = 0;
340 op.params[1].memref.size = hash_size(algo);
341 op.params[2].value.a = l;
342 op.params[2].value.b = offset;
343
344 verbose("Starting test: %s, size=%zu bytes, ",
345 algo_str(algo), size);
Etienne Carriered851fc72017-04-26 15:08:02 +0200346 verbose("random=%s, ", yesno(random_in == CRYPTO_USE_RANDOM));
Igor Opaniuk136644a2016-09-13 13:40:56 +0300347 verbose("unaligned=%s, ", yesno(offset));
348 verbose("inner loops=%u, loops=%u, warm-up=%u s\n", l, n, warmup);
349
350 if (warmup)
351 do_warmup(warmup);
352
353 memset(&stats, 0, sizeof(stats));
354 while (n-- > 0) {
355 t = run_test_once((uint8_t *)in_shm.buffer + offset, size, random_in, &op);
356 update_stats(&stats, t);
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100357 if (n % (n0 / 10) == 0)
Igor Opaniuk136644a2016-09-13 13:40:56 +0300358 vverbose("#");
359 }
360 vverbose("\n");
Jerome Forissierd99fe972017-02-21 15:30:57 +0100361 sd = stddev(&stats);
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100362 printf("min=%gus max=%gus mean=%gus stddev=%gus (cv %g%%) (%gMiB/s)\n",
363 stats.min / 1000, stats.max / 1000, stats.m / 1000,
364 sd / 1000, 100 * sd / stats.m, mb_per_sec(size, stats.m));
365 verbose("2-sigma interval: %g..%gus (%g..%gMiB/s)\n",
366 (stats.m - 2 * sd) / 1000, (stats.m + 2 * sd) / 1000,
367 mb_per_sec(size, stats.m + 2 * sd),
368 mb_per_sec(size, stats.m - 2 * sd));
Igor Opaniuk136644a2016-09-13 13:40:56 +0300369 free_shm();
370}
371
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100372static void usage(const char *progname,
Igor Opaniuk136644a2016-09-13 13:40:56 +0300373 /* Default params */
374 int algo, size_t size, int warmup, int l, int n)
375{
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200376 fprintf(stderr, "Usage: %s [-h]\n", progname);
377 fprintf(stderr, "Usage: %s [-a ALGO] [-l LOOP] [-n LOOP] [-r] [-s SIZE]", progname);
378 fprintf(stderr, " [-v [-v]] [-w SEC]\n");
379 fprintf(stderr, "SHA performance testing tool for OP-TEE\n");
380 fprintf(stderr, "\n");
Igor Opaniuk136644a2016-09-13 13:40:56 +0300381 fprintf(stderr, "Options:\n");
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200382 fprintf(stderr, " -a ALGO Algorithm (SHA1, SHA224, SHA256, SHA384, SHA512) [%s]\n", algo_str(algo));
383 fprintf(stderr, " -h|--help Print this help and exit\n");
384 fprintf(stderr, " -l LOOP Inner loop iterations (TA calls TEE_DigestDoFinal() <x> times) [%u]\n", l);
385 fprintf(stderr, " -n LOOP Outer test loop iterations [%u]\n", n);
386 fprintf(stderr, " -r|--random Get input data from /dev/urandom (default: all-zeros)\n");
387 fprintf(stderr, " -s SIZE Test buffer size in bytes [%zu]\n", size);
388 fprintf(stderr, " -u|--unalign Use unaligned buffer (odd address)\n");
389 fprintf(stderr, " -v Be verbose (use twice for greater effect)\n");
390 fprintf(stderr, " -w|--warmup SEC Warm-up time in seconds: execute a busy loop before\n");
391 fprintf(stderr, " the test to mitigate the effects of cpufreq etc. [%u]\n", warmup);
Igor Opaniuk136644a2016-09-13 13:40:56 +0300392}
393
394#define NEXT_ARG(i) \
395 do { \
396 if (++i == argc) { \
397 fprintf(stderr, "%s: %s: missing argument\n", \
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100398 argv[0], argv[i - 1]); \
Igor Opaniuk136644a2016-09-13 13:40:56 +0300399 return 1; \
400 } \
401 } while (0);
402
403
404
405extern int sha_perf_runner_cmd_parser(int argc, char *argv[])
406{
407 int i;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300408 /* Command line params */
409 size_t size = 1024; /* Buffer size (-s) */
Igor Opaniukf9b7fd22016-09-16 16:22:34 +0300410 unsigned int n = CRYPTO_DEF_COUNT;/* Number of measurements (-n)*/
411 unsigned int l = CRYPTO_DEF_LOOPS; /* Inner loops (-l) */
412 int verbosity = CRYPTO_DEF_VERBOSITY; /* Verbosity (-v) */
Igor Opaniuk136644a2016-09-13 13:40:56 +0300413 int algo = TA_SHA_SHA1; /* Algorithm (-a) */
Igor Opaniukf9b7fd22016-09-16 16:22:34 +0300414 /* Get input data from /dev/urandom (-r) */
Etienne Carriered851fc72017-04-26 15:08:02 +0200415 int random_in = CRYPTO_USE_ZEROS;
Igor Opaniukf9b7fd22016-09-16 16:22:34 +0300416 /* Start with a 2-second busy loop (-w) */
417 int warmup = CRYPTO_DEF_WARMUP;
418 int offset = 0; /* Buffer offset wrt. alloc'ed address (-u) */
Igor Opaniuk136644a2016-09-13 13:40:56 +0300419
Igor Opaniuk136644a2016-09-13 13:40:56 +0300420 /* Parse command line */
421 for (i = 1; i < argc; i++) {
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200422 if (!strcmp(argv[i], "-h") || !strcmp(argv[i], "--help")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300423 usage(argv[0], algo, size, warmup, l, n);
424 return 0;
425 }
426 }
427 for (i = 1; i < argc; i++) {
428 if (!strcmp(argv[i], "-l")) {
429 NEXT_ARG(i);
430 l = atoi(argv[i]);
431 } else if (!strcmp(argv[i], "-a")) {
432 NEXT_ARG(i);
433 if (!strcasecmp(argv[i], "SHA1"))
434 algo = TA_SHA_SHA1;
435 else if (!strcasecmp(argv[i], "SHA224"))
436 algo = TA_SHA_SHA224;
437 else if (!strcasecmp(argv[i], "SHA256"))
438 algo = TA_SHA_SHA256;
439 else if (!strcasecmp(argv[i], "SHA384"))
440 algo = TA_SHA_SHA384;
441 else if (!strcasecmp(argv[i], "SHA512"))
442 algo = TA_SHA_SHA512;
443 else {
444 fprintf(stderr, "%s, invalid algorithm\n",
445 argv[0]);
446 usage(argv[0], algo, size, warmup, l, n);
447 return 1;
448 }
449 } else if (!strcmp(argv[i], "-n")) {
450 NEXT_ARG(i);
451 n = atoi(argv[i]);
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200452 } else if (!strcmp(argv[i], "--random") ||
453 !strcmp(argv[i], "-r")) {
Etienne Carriered851fc72017-04-26 15:08:02 +0200454 random_in = CRYPTO_USE_RANDOM;
Igor Opaniuk136644a2016-09-13 13:40:56 +0300455 } else if (!strcmp(argv[i], "-s")) {
456 NEXT_ARG(i);
457 size = atoi(argv[i]);
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200458 } else if (!strcmp(argv[i], "--unalign") ||
459 !strcmp(argv[i], "-u")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300460 offset = 1;
461 } else if (!strcmp(argv[i], "-v")) {
462 verbosity++;
Etienne Carriered0b3ee22017-05-03 18:20:59 +0200463 } else if (!strcmp(argv[i], "--warmup") ||
464 !strcmp(argv[i], "-w")) {
Igor Opaniuk136644a2016-09-13 13:40:56 +0300465 NEXT_ARG(i);
466 warmup = atoi(argv[i]);
467 } else {
468 fprintf(stderr, "%s: invalid argument: %s\n",
469 argv[0], argv[i]);
470 usage(argv[0], algo, size, warmup, l, n);
471 return 1;
472 }
473 }
Etienne Carrierec92b55f2017-03-24 10:28:09 +0100474
Igor Opaniuk136644a2016-09-13 13:40:56 +0300475 sha_perf_run_test(algo, size, n, l, random_in, offset, warmup, verbosity);
476
477 return 0;
478}