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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
/**********************************************************************
Copyright(c) 2011-2017 Intel Corporation All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Intel Corporation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
**********************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include "sha512_mb.h"
#include "endian_helper.h"
#include <openssl/sha.h>
#define TEST_LEN (1024*1024ull) //1M
#define TEST_BUFS SHA512_MIN_LANES
#define ROTATION_TIMES 10000 //total length processing = TEST_LEN * ROTATION_TIMES
#define UPDATE_SIZE (13*SHA512_BLOCK_SIZE)
#define LEN_TOTAL (TEST_LEN * ROTATION_TIMES)
/* Reference digest global to reduce stack usage */
static uint8_t digest_ref_upd[8 * SHA512_DIGEST_NWORDS];
struct user_data {
int idx;
uint64_t processed;
};
int main(void)
{
SHA512_CTX o_ctx; //openSSL
SHA512_HASH_CTX_MGR *mgr = NULL;
SHA512_HASH_CTX ctxpool[TEST_BUFS], *ctx = NULL;
uint32_t i, j, k, fail = 0;
unsigned char *bufs[TEST_BUFS];
struct user_data udata[TEST_BUFS];
int ret;
ret = posix_memalign((void *)&mgr, 16, sizeof(SHA512_HASH_CTX_MGR));
if ((ret != 0) || (mgr == NULL)) {
printf("posix_memalign failed test aborted\n");
return 1;
}
sha512_ctx_mgr_init(mgr);
printf("sha512_large_test\n");
// Init ctx contents
for (i = 0; i < TEST_BUFS; i++) {
bufs[i] = (unsigned char *)calloc((size_t)TEST_LEN, 1);
if (bufs[i] == NULL) {
printf("malloc failed test aborted\n");
return 1;
}
hash_ctx_init(&ctxpool[i]);
ctxpool[i].user_data = (void *)&udata[i];
}
//Openssl SHA512 update test
SHA512_Init(&o_ctx);
for (k = 0; k < ROTATION_TIMES; k++) {
SHA512_Update(&o_ctx, bufs[k % TEST_BUFS], TEST_LEN);
}
SHA512_Final(digest_ref_upd, &o_ctx);
// Initialize pool
for (i = 0; i < TEST_BUFS; i++) {
struct user_data *u = (struct user_data *)ctxpool[i].user_data;
u->idx = i;
u->processed = 0;
}
printf("Starting updates\n");
int highest_pool_idx = 0;
ctx = &ctxpool[highest_pool_idx++];
while (ctx) {
int len = UPDATE_SIZE;
int update_type = HASH_UPDATE;
struct user_data *u = (struct user_data *)ctx->user_data;
int idx = u->idx;
if (u->processed == 0)
update_type = HASH_FIRST;
else if (hash_ctx_complete(ctx)) {
if (highest_pool_idx < TEST_BUFS)
ctx = &ctxpool[highest_pool_idx++];
else
ctx = sha512_ctx_mgr_flush(mgr);
continue;
} else if (u->processed >= (LEN_TOTAL - UPDATE_SIZE)) {
len = (LEN_TOTAL - u->processed);
update_type = HASH_LAST;
}
u->processed += len;
ctx = sha512_ctx_mgr_submit(mgr, ctx, bufs[idx], len, update_type);
if (NULL == ctx) {
if (highest_pool_idx < TEST_BUFS)
ctx = &ctxpool[highest_pool_idx++];
else
ctx = sha512_ctx_mgr_flush(mgr);
}
}
printf("multibuffer sha512 digest: \n");
for (i = 0; i < TEST_BUFS; i++) {
printf("Total processing size of buf[%d] is %ld \n", i,
ctxpool[i].total_length);
for (j = 0; j < SHA512_DIGEST_NWORDS; j++) {
printf("digest%d : %016lX\n", j, ctxpool[i].job.result_digest[j]);
}
}
printf("\n");
printf("openssl sha512 update digest: \n");
for (i = 0; i < SHA512_DIGEST_NWORDS; i++)
printf("%016lX - ", to_be64(((uint64_t *) digest_ref_upd)[i]));
printf("\n");
for (i = 0; i < TEST_BUFS; i++) {
for (j = 0; j < SHA512_DIGEST_NWORDS; j++) {
if (ctxpool[i].job.result_digest[j] !=
to_be64(((uint64_t *) digest_ref_upd)[j])) {
fail++;
}
}
}
if (fail)
printf("Test failed sha512 hash large file check %d\n", fail);
else
printf(" sha512_hash_large_test: Pass\n");
return fail;
}
|
