]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
1 | /********************************************************************** |
2 | Copyright(c) 2011-2016 Intel Corporation All rights reserved. | |
3 | ||
4 | Redistribution and use in source and binary forms, with or without | |
1e59de90 | 5 | modification, are permitted provided that the following conditions |
7c673cae FG |
6 | are met: |
7 | * Redistributions of source code must retain the above copyright | |
8 | notice, this list of conditions and the following disclaimer. | |
9 | * Redistributions in binary form must reproduce the above copyright | |
10 | notice, this list of conditions and the following disclaimer in | |
11 | the documentation and/or other materials provided with the | |
12 | distribution. | |
13 | * Neither the name of Intel Corporation nor the names of its | |
14 | contributors may be used to endorse or promote products derived | |
15 | from this software without specific prior written permission. | |
16 | ||
17 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
18 | "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
19 | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
20 | A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
21 | OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
22 | SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
23 | LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
24 | DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
25 | THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
26 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
27 | OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
28 | **********************************************************************/ | |
29 | ||
30 | #include <stdio.h> | |
31 | #include <stdlib.h> | |
32 | #include "sha1_mb.h" | |
33 | ||
34 | #define TEST_LEN (1024*1024) | |
35 | #define TEST_BUFS 100 | |
36 | #ifndef RANDOMS | |
37 | # define RANDOMS 10 | |
38 | #endif | |
39 | #ifndef TEST_SEED | |
40 | # define TEST_SEED 0x1234 | |
41 | #endif | |
42 | ||
43 | static uint32_t digest_ref[TEST_BUFS][SHA1_DIGEST_NWORDS]; | |
44 | ||
45 | // Compare against reference function | |
46 | extern void sha1_ref(uint8_t * input_data, uint32_t * digest, uint32_t len); | |
47 | ||
48 | // Generates pseudo-random data | |
49 | void rand_buffer(unsigned char *buf, const long buffer_size) | |
50 | { | |
51 | long i; | |
52 | for (i = 0; i < buffer_size; i++) | |
53 | buf[i] = rand(); | |
54 | } | |
55 | ||
56 | int main(void) | |
57 | { | |
58 | SHA1_HASH_CTX_MGR *mgr = NULL; | |
59 | SHA1_HASH_CTX ctxpool[TEST_BUFS]; | |
60 | uint32_t i, j, fail = 0; | |
61 | unsigned char *bufs[TEST_BUFS]; | |
62 | uint32_t lens[TEST_BUFS]; | |
63 | unsigned int jobs, t; | |
64 | uint8_t *tmp_buf; | |
1e59de90 | 65 | int ret; |
7c673cae FG |
66 | |
67 | printf("multibinary_sha1 test, %d sets of %dx%d max: ", RANDOMS, TEST_BUFS, TEST_LEN); | |
68 | ||
1e59de90 TL |
69 | ret = posix_memalign((void *)&mgr, 16, sizeof(SHA1_HASH_CTX_MGR)); |
70 | if ((ret != 0) || (mgr == NULL)) { | |
71 | printf("posix_memalign failed test aborted\n"); | |
72 | return 1; | |
73 | } | |
74 | ||
7c673cae FG |
75 | sha1_ctx_mgr_init(mgr); |
76 | ||
77 | srand(TEST_SEED); | |
78 | ||
79 | for (i = 0; i < TEST_BUFS; i++) { | |
80 | // Allocate and fill buffer | |
81 | bufs[i] = (unsigned char *)malloc(TEST_LEN); | |
82 | if (bufs[i] == NULL) { | |
83 | printf("malloc failed test aborted\n"); | |
84 | return 1; | |
85 | } | |
86 | rand_buffer(bufs[i], TEST_LEN); | |
87 | ||
88 | // Init ctx contexts | |
89 | hash_ctx_init(&ctxpool[i]); | |
90 | ctxpool[i].user_data = (void *)((uint64_t) i); | |
91 | ||
92 | // Run reference test | |
93 | sha1_ref(bufs[i], digest_ref[i], TEST_LEN); | |
94 | ||
95 | // Run sb_sha1 test | |
96 | sha1_ctx_mgr_submit(mgr, &ctxpool[i], bufs[i], TEST_LEN, HASH_ENTIRE); | |
97 | } | |
98 | ||
99 | while (sha1_ctx_mgr_flush(mgr)) ; | |
100 | ||
101 | for (i = 0; i < TEST_BUFS; i++) { | |
102 | for (j = 0; j < SHA1_DIGEST_NWORDS; j++) { | |
103 | if (ctxpool[i].job.result_digest[j] != digest_ref[i][j]) { | |
104 | fail++; | |
105 | printf("Test%d fixed size, digest%d " | |
106 | "fail 0x%08X <=> 0x%08X \n", | |
107 | i, j, ctxpool[i].job.result_digest[j], | |
108 | digest_ref[i][j]); | |
109 | } | |
110 | } | |
111 | } | |
112 | ||
113 | if (fail) { | |
114 | printf("Test failed function check %d\n", fail); | |
115 | return fail; | |
116 | } | |
117 | // Run tests with random size and number of jobs | |
118 | for (t = 0; t < RANDOMS; t++) { | |
119 | jobs = rand() % (TEST_BUFS); | |
120 | ||
121 | sha1_ctx_mgr_init(mgr); | |
122 | ||
123 | for (i = 0; i < jobs; i++) { | |
124 | // Use buffer with random len and contents | |
125 | lens[i] = rand() % (TEST_LEN); | |
126 | rand_buffer(bufs[i], lens[i]); | |
127 | ||
128 | // Run reference test | |
129 | sha1_ref(bufs[i], digest_ref[i], lens[i]); | |
130 | ||
131 | // Run sha1_mb test | |
132 | sha1_ctx_mgr_submit(mgr, &ctxpool[i], bufs[i], lens[i], HASH_ENTIRE); | |
133 | } | |
134 | ||
135 | while (sha1_ctx_mgr_flush(mgr)) ; | |
136 | ||
137 | for (i = 0; i < jobs; i++) { | |
138 | for (j = 0; j < SHA1_DIGEST_NWORDS; j++) { | |
139 | if (ctxpool[i].job.result_digest[j] != digest_ref[i][j]) { | |
140 | fail++; | |
141 | printf("Test%d, digest%d fail " | |
142 | "0x%08X <=> 0x%08X\n", | |
143 | i, j, ctxpool[i].job.result_digest[j], | |
144 | digest_ref[i][j]); | |
145 | } | |
146 | } | |
147 | } | |
148 | if (fail) { | |
149 | printf("Test failed function check %d\n", fail); | |
150 | return fail; | |
151 | } | |
152 | ||
153 | putchar('.'); | |
154 | fflush(0); | |
155 | } // random test t | |
156 | ||
157 | // Test at the end of buffer | |
158 | jobs = rand() % TEST_BUFS; | |
159 | tmp_buf = (uint8_t *) malloc(sizeof(uint8_t) * jobs); | |
160 | if (!tmp_buf) { | |
161 | printf("malloc failed, end test aborted.\n"); | |
162 | return 1; | |
163 | } | |
164 | ||
165 | rand_buffer(tmp_buf, jobs); | |
166 | ||
167 | sha1_ctx_mgr_init(mgr); | |
168 | ||
169 | // Extend to the end of allocated buffer to construct jobs | |
170 | for (i = 0; i < jobs; i++) { | |
171 | bufs[i] = (uint8_t *) & tmp_buf[i]; | |
172 | lens[i] = jobs - i; | |
173 | ||
174 | // Reference test | |
175 | sha1_ref(bufs[i], digest_ref[i], lens[i]); | |
176 | ||
177 | // sb_sha1 test | |
178 | sha1_ctx_mgr_submit(mgr, &ctxpool[i], bufs[i], lens[i], HASH_ENTIRE); | |
179 | } | |
180 | ||
181 | while (sha1_ctx_mgr_flush(mgr)) ; | |
182 | ||
183 | for (i = 0; i < jobs; i++) { | |
184 | for (j = 0; j < SHA1_DIGEST_NWORDS; j++) { | |
185 | if (ctxpool[i].job.result_digest[j] != digest_ref[i][j]) { | |
186 | fail++; | |
187 | printf("End test failed at offset %d - result: 0x%08X" | |
188 | ", ref: 0x%08X\n", i, ctxpool[i].job.result_digest[j], | |
189 | digest_ref[i][j]); | |
190 | } | |
191 | } | |
192 | } | |
193 | ||
194 | putchar('.'); | |
195 | ||
196 | if (fail) | |
197 | printf("Test failed function check %d\n", fail); | |
198 | else | |
199 | printf(" multibinary_sha1 rand: Pass\n"); | |
200 | ||
201 | return fail; | |
202 | } |