blob: 95d7300d6ee46c46c96d92db18628910786343d4 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/*
* Copyright (C) 2018-2023 Free Software Foundation, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>. */
#include <stdio.h>
#include <stdlib.h>
#include "bench.h"
int
main (int argc, char *argv[])
{
if (argc != 3)
{
fprintf (stderr, "Usage: %s SIZE REPETITIONS\n", argv[0]);
exit (1);
}
size_t size = atol (argv[1]);
int repeat = atoi (argv[2]);
char *memblock = (char *) malloc (size);
if (!memblock)
{
fprintf (stderr, "%s: memory exhausted\n", argv[0]);
return 1;
}
/* Fill the memory block. */
{
size_t i;
for (i = 0; i < size; i++)
memblock[i] =
(unsigned char) (((i * (i-1) * (i-5)) >> 6) + (i % 499) + (i % 101));
}
struct timings_state ts;
timing_start (&ts);
int count;
for (count = 0; count < repeat; count++)
{
char digest[64];
FUNC (memblock, size, digest);
}
timing_end (&ts);
timing_output (&ts);
return 0;
}
|
