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
|
/**********************************************************************
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 "sha1_mb.h"
#define TEST_LEN (1024*1024)
#define TEST_BUFS (SHA1_MAX_LANES - 1)
#ifndef TEST_SEED
# define TEST_SEED 0x1234
#endif
static uint32_t digest_ref[TEST_BUFS][SHA1_DIGEST_NWORDS];
// Compare against reference function
extern void sha1_ref(uint8_t * input_data, uint32_t * digest, uint32_t len);
// Generates pseudo-random data
void rand_buffer(unsigned char *buf, const long buffer_size)
{
long i;
for (i = 0; i < buffer_size; i++)
buf[i] = rand();
}
uint8_t lens_print_and_check(SHA1_HASH_CTX_MGR * mgr)
{
static int32_t last_lens[SHA1_MAX_LANES] = { 0 };
int32_t len;
uint8_t num_unchanged = 0;
int i;
for (i = 0; i < SHA1_MAX_LANES; i++) {
len = (int32_t) mgr->mgr.lens[i];
// len[i] in mgr consists of byte_length<<4 | lane_index
len = (len >= 16) ? (len >> 4 << 6) : 0;
printf("\t%d", len);
if (last_lens[i] > 0 && last_lens[i] == len)
num_unchanged += 1;
last_lens[i] = len;
}
printf("\n");
return num_unchanged;
}
int main(void)
{
SHA1_HASH_CTX_MGR *mgr = NULL;
SHA1_HASH_CTX ctxpool[TEST_BUFS];
uint32_t i, j, fail = 0;
unsigned char *bufs[TEST_BUFS];
uint32_t lens[TEST_BUFS];
uint8_t num_ret, num_unchanged = 0;
int ret;
printf("sha1_mb flush test, %d buffers with %d length: \n", TEST_BUFS, TEST_LEN);
ret = posix_memalign((void *)&mgr, 16, sizeof(SHA1_HASH_CTX_MGR));
if ((ret != 0) || (mgr == NULL)) {
printf("posix_memalign failed test aborted\n");
return 1;
}
sha1_ctx_mgr_init(mgr);
srand(TEST_SEED);
for (i = 0; i < TEST_BUFS; i++) {
// Allocate and fill buffer
lens[i] = TEST_LEN / SHA1_MAX_LANES * (i + 1);
bufs[i] = (unsigned char *)malloc(lens[i]);
if (bufs[i] == NULL) {
printf("malloc failed test aborted\n");
return 1;
}
rand_buffer(bufs[i], lens[i]);
}
for (i = 0; i < TEST_BUFS; i++) {
// Init ctx contexts
hash_ctx_init(&ctxpool[i]);
ctxpool[i].user_data = (void *)((uint64_t) i);
// Run reference test
sha1_ref(bufs[i], digest_ref[i], lens[i]);
// Run sb_sha1 test
sha1_ctx_mgr_submit(mgr, &ctxpool[i], bufs[i], lens[i], HASH_ENTIRE);
}
printf("Changes of lens inside mgr:\n");
lens_print_and_check(mgr);
while (sha1_ctx_mgr_flush(mgr)) {
num_ret = lens_print_and_check(mgr);
num_unchanged = num_unchanged > num_ret ? num_unchanged : num_ret;
}
printf("Info of sha1_mb lens prints over\n");
for (i = 0; i < TEST_BUFS; i++) {
for (j = 0; j < SHA1_DIGEST_NWORDS; j++) {
if (ctxpool[i].job.result_digest[j] != digest_ref[i][j]) {
fail++;
printf("Test%d fixed size, digest%d "
"fail 0x%08X <=> 0x%08X \n",
i, j, ctxpool[i].job.result_digest[j],
digest_ref[i][j]);
}
}
}
if (fail)
printf("Test failed function check %d\n", fail);
else if (num_unchanged)
printf("SHA-NI is used when %d or %d jobs are uncompleted\n",
num_unchanged, num_unchanged + 1);
else
printf("SHA-NI is not used, or used for last job\n");
return fail;
}
|
