/src/php-src/ext/hash/hash_haval.c
Line | Count | Source |
1 | | /* |
2 | | +----------------------------------------------------------------------+ |
3 | | | Copyright (c) The PHP Group | |
4 | | +----------------------------------------------------------------------+ |
5 | | | This source file is subject to version 3.01 of the PHP license, | |
6 | | | that is bundled with this package in the file LICENSE, and is | |
7 | | | available through the world-wide-web at the following url: | |
8 | | | https://www.php.net/license/3_01.txt | |
9 | | | If you did not receive a copy of the PHP license and are unable to | |
10 | | | obtain it through the world-wide-web, please send a note to | |
11 | | | license@php.net so we can mail you a copy immediately. | |
12 | | +----------------------------------------------------------------------+ |
13 | | | Author: Sara Golemon <pollita@php.net> | |
14 | | +----------------------------------------------------------------------+ |
15 | | */ |
16 | | |
17 | | #include "php_hash.h" |
18 | | #include "php_hash_haval.h" |
19 | | |
20 | | static const unsigned char PADDING[128] ={ |
21 | | 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
22 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
23 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
24 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
25 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
26 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
27 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
28 | | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; |
29 | | |
30 | | static const uint32_t D0[8] = { |
31 | | 0x243F6A88, 0x85A308D3, 0x13198A2E, 0x03707344, 0xA4093822, 0x299F31D0, 0x082EFA98, 0xEC4E6C89 }; |
32 | | |
33 | | static const uint32_t K2[32] = { |
34 | | 0x452821E6, 0x38D01377, 0xBE5466CF, 0x34E90C6C, 0xC0AC29B7, 0xC97C50DD, 0x3F84D5B5, 0xB5470917, |
35 | | 0x9216D5D9, 0x8979FB1B, 0xD1310BA6, 0x98DFB5AC, 0x2FFD72DB, 0xD01ADFB7, 0xB8E1AFED, 0x6A267E96, |
36 | | 0xBA7C9045, 0xF12C7F99, 0x24A19947, 0xB3916CF7, 0x0801F2E2, 0x858EFC16, 0x636920D8, 0x71574E69, |
37 | | 0xA458FEA3, 0xF4933D7E, 0x0D95748F, 0x728EB658, 0x718BCD58, 0x82154AEE, 0x7B54A41D, 0xC25A59B5 }; |
38 | | |
39 | | static const uint32_t K3[32] = { |
40 | | 0x9C30D539, 0x2AF26013, 0xC5D1B023, 0x286085F0, 0xCA417918, 0xB8DB38EF, 0x8E79DCB0, 0x603A180E, |
41 | | 0x6C9E0E8B, 0xB01E8A3E, 0xD71577C1, 0xBD314B27, 0x78AF2FDA, 0x55605C60, 0xE65525F3, 0xAA55AB94, |
42 | | 0x57489862, 0x63E81440, 0x55CA396A, 0x2AAB10B6, 0xB4CC5C34, 0x1141E8CE, 0xA15486AF, 0x7C72E993, |
43 | | 0xB3EE1411, 0x636FBC2A, 0x2BA9C55D, 0x741831F6, 0xCE5C3E16, 0x9B87931E, 0xAFD6BA33, 0x6C24CF5C }; |
44 | | |
45 | | static const uint32_t K4[32] = { |
46 | | 0x7A325381, 0x28958677, 0x3B8F4898, 0x6B4BB9AF, 0xC4BFE81B, 0x66282193, 0x61D809CC, 0xFB21A991, |
47 | | 0x487CAC60, 0x5DEC8032, 0xEF845D5D, 0xE98575B1, 0xDC262302, 0xEB651B88, 0x23893E81, 0xD396ACC5, |
48 | | 0x0F6D6FF3, 0x83F44239, 0x2E0B4482, 0xA4842004, 0x69C8F04A, 0x9E1F9B5E, 0x21C66842, 0xF6E96C9A, |
49 | | 0x670C9C61, 0xABD388F0, 0x6A51A0D2, 0xD8542F68, 0x960FA728, 0xAB5133A3, 0x6EEF0B6C, 0x137A3BE4 }; |
50 | | |
51 | | static const uint32_t K5[32] = { |
52 | | 0xBA3BF050, 0x7EFB2A98, 0xA1F1651D, 0x39AF0176, 0x66CA593E, 0x82430E88, 0x8CEE8619, 0x456F9FB4, |
53 | | 0x7D84A5C3, 0x3B8B5EBE, 0xE06F75D8, 0x85C12073, 0x401A449F, 0x56C16AA6, 0x4ED3AA62, 0x363F7706, |
54 | | 0x1BFEDF72, 0x429B023D, 0x37D0D724, 0xD00A1248, 0xDB0FEAD3, 0x49F1C09B, 0x075372C9, 0x80991B7B, |
55 | | 0x25D479D8, 0xF6E8DEF7, 0xE3FE501A, 0xB6794C3B, 0x976CE0BD, 0x04C006BA, 0xC1A94FB6, 0x409F60C4 }; |
56 | | |
57 | | static const short I2[32] = { 5, 14, 26, 18, 11, 28, 7, 16, 0, 23, 20, 22, 1, 10, 4, 8, |
58 | | 30, 3, 21, 9, 17, 24, 29, 6, 19, 12, 15, 13, 2, 25, 31, 27 }; |
59 | | |
60 | | static const short I3[32] = { 19, 9, 4, 20, 28, 17, 8, 22, 29, 14, 25, 12, 24, 30, 16, 26, |
61 | | 31, 15, 7, 3, 1, 0, 18, 27, 13, 6, 21, 10, 23, 11, 5, 2 }; |
62 | | |
63 | | static const short I4[32] = { 24, 4, 0, 14, 2, 7, 28, 23, 26, 6, 30, 20, 18, 25, 19, 3, |
64 | | 22, 11, 31, 21, 8, 27, 12, 9, 1, 29, 5, 15, 17, 10, 16, 13 }; |
65 | | |
66 | | static const short I5[32] = { 27, 3, 21, 26, 17, 11, 20, 29, 19, 0, 12, 7, 13, 8, 31, 10, |
67 | | 5, 9, 14, 30, 18, 6, 28, 24, 2, 23, 16, 22, 4, 1, 25, 15 }; |
68 | | |
69 | | static const short M0[32] = { 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, |
70 | | 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1 }; |
71 | | |
72 | | static const short M1[32] = { 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, |
73 | | 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2 }; |
74 | | |
75 | | static const short M2[32] = { 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, |
76 | | 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3 }; |
77 | | |
78 | | static const short M3[32] = { 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, |
79 | | 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4 }; |
80 | | |
81 | | static const short M4[32] = { 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, |
82 | | 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5 }; |
83 | | |
84 | | static const short M5[32] = { 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, |
85 | | 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6 }; |
86 | | |
87 | | static const short M6[32] = { 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, |
88 | | 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 7 }; |
89 | | |
90 | | static const short M7[32] = { 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, |
91 | | 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0 }; |
92 | | |
93 | | /* {{{ Encode |
94 | | Encodes input (uint32_t) into output (unsigned char). Assumes len is |
95 | | a multiple of 4. |
96 | | */ |
97 | | static void Encode(unsigned char *output, uint32_t *input, unsigned int len) |
98 | 482 | { |
99 | 482 | unsigned int i, j; |
100 | | |
101 | 2.49k | for (i = 0, j = 0; j < len; i++, j += 4) { |
102 | 2.00k | output[j] = (unsigned char) (input[i] & 0xff); |
103 | 2.00k | output[j + 1] = (unsigned char) ((input[i] >> 8) & 0xff); |
104 | 2.00k | output[j + 2] = (unsigned char) ((input[i] >> 16) & 0xff); |
105 | 2.00k | output[j + 3] = (unsigned char) ((input[i] >> 24) & 0xff); |
106 | 2.00k | } |
107 | 482 | } |
108 | | /* }}} */ |
109 | | |
110 | | /* {{{ Decode |
111 | | Decodes input (unsigned char) into output (uint32_t). Assumes len is |
112 | | a multiple of 4. |
113 | | */ |
114 | | static void Decode(uint32_t *output, const unsigned char *input, unsigned int len) |
115 | 4.31k | { |
116 | 4.31k | unsigned int i, j; |
117 | | |
118 | 142k | for (i = 0, j = 0; j < len; i++, j += 4) { |
119 | 138k | output[i] = ((uint32_t) input[j]) | (((uint32_t) input[j + 1]) << 8) | |
120 | 138k | (((uint32_t) input[j + 2]) << 16) | (((uint32_t) input[j + 3]) << 24); |
121 | 138k | } |
122 | 4.31k | } |
123 | | /* }}} */ |
124 | | |
125 | | #define F1(x6,x5,x4,x3,x2,x1,x0) ( ((x1) & (x4)) ^ ((x2) & (x5)) ^ ((x3) & (x6)) ^ ((x0) & (x1)) ^ (x0) ) |
126 | | #define F2(x6,x5,x4,x3,x2,x1,x0) ( ((x1) & (x2) & (x3)) ^ ((x2) & (x4) & (x5)) ^ ((x1) & (x2)) ^ ((x1) & (x4)) ^ \ |
127 | | ((x2) & (x6)) ^ ((x3) & (x5)) ^ ((x4) & (x5)) ^ ((x0) & (x2)) ^ (x0) ) |
128 | | #define F3(x6,x5,x4,x3,x2,x1,x0) ( ((x1) & (x2) & (x3)) ^ ((x1) & (x4)) ^ ((x2) & (x5)) ^ ((x3) & (x6)) ^ ((x0) & (x3)) ^ (x0) ) |
129 | | #define F4(x6,x5,x4,x3,x2,x1,x0) ( ((x1) & (x2) & (x3)) ^ ((x2) & (x4) & (x5)) ^ ((x3) & (x4) & (x6)) ^ \ |
130 | | ((x1) & (x4)) ^ ((x2) & (x6)) ^ ((x3) & (x4)) ^ ((x3) & (x5)) ^ \ |
131 | | ((x3) & (x6)) ^ ((x4) & (x5)) ^ ((x4) & (x6)) ^ ((x0) & (x4)) ^ (x0) ) |
132 | | #define F5(x6,x5,x4,x3,x2,x1,x0) ( ((x1) & (x4)) ^ ((x2) & (x5)) ^ ((x3) & (x6)) ^ \ |
133 | | ((x0) & (x1) & (x2) & (x3)) ^ ((x0) & (x5)) ^ (x0) ) |
134 | | |
135 | 1.08M | #define ROTR(x,n) (((x) >> (n)) | ((x) << (32 - (n)))) |
136 | | |
137 | | |
138 | | /* {{{ PHP_3HAVALTransform */ |
139 | | static void PHP_3HAVALTransform(uint32_t state[8], const unsigned char block[128]) |
140 | 1.65k | { |
141 | 1.65k | uint32_t E[8]; |
142 | 1.65k | uint32_t x[32]; |
143 | 1.65k | int i; |
144 | | |
145 | 1.65k | Decode(x, block, 128); |
146 | | |
147 | 14.8k | for(i = 0; i < 8; i++) { |
148 | 13.2k | E[i] = state[i]; |
149 | 13.2k | } |
150 | | |
151 | 54.6k | for(i = 0; i < 32; i++) { |
152 | 52.9k | E[7 - (i % 8)] = ROTR(F1(E[M1[i]],E[M0[i]],E[M3[i]],E[M5[i]],E[M6[i]],E[M2[i]],E[M4[i]]),7) + ROTR(E[M7[i]],11) + x[i]; |
153 | 52.9k | } |
154 | 54.6k | for(i = 0; i < 32; i++) { |
155 | 52.9k | E[7 - (i % 8)] = ROTR(F2(E[M4[i]],E[M2[i]],E[M1[i]],E[M0[i]],E[M5[i]],E[M3[i]],E[M6[i]]),7) + ROTR(E[M7[i]],11) + x[I2[i]] + K2[i]; |
156 | 52.9k | } |
157 | 54.6k | for(i = 0; i < 32; i++) { |
158 | 52.9k | E[7 - (i % 8)] = ROTR(F3(E[M6[i]],E[M1[i]],E[M2[i]],E[M3[i]],E[M4[i]],E[M5[i]],E[M0[i]]),7) + ROTR(E[M7[i]],11) + x[I3[i]] + K3[i]; |
159 | 52.9k | } |
160 | | |
161 | | /* Update digest */ |
162 | 14.8k | for(i = 0; i < 8; i++) { |
163 | 13.2k | state[i] += E[i]; |
164 | 13.2k | } |
165 | | |
166 | | /* Zeroize sensitive information. */ |
167 | 1.65k | ZEND_SECURE_ZERO((unsigned char*) x, sizeof(x)); |
168 | 1.65k | } |
169 | | /* }}} */ |
170 | | |
171 | | /* {{{ PHP_4HAVALTransform */ |
172 | | static void PHP_4HAVALTransform(uint32_t state[8], const unsigned char block[128]) |
173 | 1.29k | { |
174 | 1.29k | uint32_t E[8]; |
175 | 1.29k | uint32_t x[32]; |
176 | 1.29k | int i; |
177 | | |
178 | 1.29k | Decode(x, block, 128); |
179 | | |
180 | 11.6k | for(i = 0; i < 8; i++) { |
181 | 10.3k | E[i] = state[i]; |
182 | 10.3k | } |
183 | | |
184 | 42.7k | for(i = 0; i < 32; i++) { |
185 | 41.4k | E[7 - (i % 8)] = ROTR(F1(E[M2[i]],E[M6[i]],E[M1[i]],E[M4[i]],E[M5[i]],E[M3[i]],E[M0[i]]),7) + ROTR(E[M7[i]],11) + x[i]; |
186 | 41.4k | } |
187 | 42.7k | for(i = 0; i < 32; i++) { |
188 | 41.4k | E[7 - (i % 8)] = ROTR(F2(E[M3[i]],E[M5[i]],E[M2[i]],E[M0[i]],E[M1[i]],E[M6[i]],E[M4[i]]),7) + ROTR(E[M7[i]],11) + x[I2[i]] + K2[i]; |
189 | 41.4k | } |
190 | 42.7k | for(i = 0; i < 32; i++) { |
191 | 41.4k | E[7 - (i % 8)] = ROTR(F3(E[M1[i]],E[M4[i]],E[M3[i]],E[M6[i]],E[M0[i]],E[M2[i]],E[M5[i]]),7) + ROTR(E[M7[i]],11) + x[I3[i]] + K3[i]; |
192 | 41.4k | } |
193 | 42.7k | for(i = 0; i < 32; i++) { |
194 | 41.4k | E[7 - (i % 8)] = ROTR(F4(E[M6[i]],E[M4[i]],E[M0[i]],E[M5[i]],E[M2[i]],E[M1[i]],E[M3[i]]),7) + ROTR(E[M7[i]],11) + x[I4[i]] + K4[i]; |
195 | 41.4k | } |
196 | | |
197 | | /* Update digest */ |
198 | 11.6k | for(i = 0; i < 8; i++) { |
199 | 10.3k | state[i] += E[i]; |
200 | 10.3k | } |
201 | | |
202 | | /* Zeroize sensitive information. */ |
203 | 1.29k | ZEND_SECURE_ZERO((unsigned char*) x, sizeof(x)); |
204 | 1.29k | } |
205 | | /* }}} */ |
206 | | |
207 | | /* {{{ PHP_5HAVALTransform */ |
208 | | static void PHP_5HAVALTransform(uint32_t state[8], const unsigned char block[128]) |
209 | 1.36k | { |
210 | 1.36k | uint32_t E[8]; |
211 | 1.36k | uint32_t x[32]; |
212 | 1.36k | int i; |
213 | | |
214 | 1.36k | Decode(x, block, 128); |
215 | | |
216 | 12.2k | for(i = 0; i < 8; i++) { |
217 | 10.9k | E[i] = state[i]; |
218 | 10.9k | } |
219 | 45.0k | for(i = 0; i < 32; i++) { |
220 | 43.6k | E[7 - (i % 8)] = ROTR(F1(E[M3[i]],E[M4[i]],E[M1[i]],E[M0[i]],E[M5[i]],E[M2[i]],E[M6[i]]),7) + ROTR(E[M7[i]],11) + x[i]; |
221 | 43.6k | } |
222 | 45.0k | for(i = 0; i < 32; i++) { |
223 | 43.6k | E[7 - (i % 8)] = ROTR(F2(E[M6[i]],E[M2[i]],E[M1[i]],E[M0[i]],E[M3[i]],E[M4[i]],E[M5[i]]),7) + ROTR(E[M7[i]],11) + x[I2[i]] + K2[i]; |
224 | 43.6k | } |
225 | 45.0k | for(i = 0; i < 32; i++) { |
226 | 43.6k | E[7 - (i % 8)] = ROTR(F3(E[M2[i]],E[M6[i]],E[M0[i]],E[M4[i]],E[M3[i]],E[M1[i]],E[M5[i]]),7) + ROTR(E[M7[i]],11) + x[I3[i]] + K3[i]; |
227 | 43.6k | } |
228 | 45.0k | for(i = 0; i < 32; i++) { |
229 | 43.6k | E[7 - (i % 8)] = ROTR(F4(E[M1[i]],E[M5[i]],E[M3[i]],E[M2[i]],E[M0[i]],E[M4[i]],E[M6[i]]),7) + ROTR(E[M7[i]],11) + x[I4[i]] + K4[i]; |
230 | 43.6k | } |
231 | 45.0k | for(i = 0; i < 32; i++) { |
232 | 43.6k | E[7 - (i % 8)] = ROTR(F5(E[M2[i]],E[M5[i]],E[M0[i]],E[M6[i]],E[M4[i]],E[M3[i]],E[M1[i]]),7) + ROTR(E[M7[i]],11) + x[I5[i]] + K5[i]; |
233 | 43.6k | } |
234 | | |
235 | | /* Update digest */ |
236 | 12.2k | for(i = 0; i < 8; i++) { |
237 | 10.9k | state[i] += E[i]; |
238 | 10.9k | } |
239 | | |
240 | | /* Zeroize sensitive information. */ |
241 | 1.36k | ZEND_SECURE_ZERO((unsigned char*) x, sizeof(x)); |
242 | 1.36k | } |
243 | | /* }}} */ |
244 | | |
245 | | #define PHP_HASH_HAVAL_INIT(p,b) \ |
246 | | const php_hash_ops php_hash_##p##haval##b##_ops = { \ |
247 | | "haval" #b "," #p, \ |
248 | | (php_hash_init_func_t) PHP_##p##HAVAL##b##Init, \ |
249 | | (php_hash_update_func_t) PHP_HAVALUpdate, \ |
250 | | (php_hash_final_func_t) PHP_HAVAL##b##Final, \ |
251 | | php_hash_copy, \ |
252 | | php_hash_serialize, \ |
253 | | php_hash_unserialize, \ |
254 | | PHP_HAVAL_SPEC, \ |
255 | | ((b) / 8), 128, sizeof(PHP_HAVAL_CTX), 1 }; \ |
256 | 241 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ |
257 | 241 | { int i; context->count[0] = context->count[1] = 0; \ |
258 | 2.16k | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ |
259 | 241 | context->passes = p; context->output = b; \ |
260 | 241 | context->Transform = PHP_##p##HAVALTransform; } Line | Count | Source | 256 | 35 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 35 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 315 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 35 | context->passes = p; context->output = b; \ | 260 | 35 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 6 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 6 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 54 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 6 | context->passes = p; context->output = b; \ | 260 | 6 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 17 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 17 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 153 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 17 | context->passes = p; context->output = b; \ | 260 | 17 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 34 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 34 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 306 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 34 | context->passes = p; context->output = b; \ | 260 | 34 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 43 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 43 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 387 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 43 | context->passes = p; context->output = b; \ | 260 | 43 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 21 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 21 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 189 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 21 | context->passes = p; context->output = b; \ | 260 | 21 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 1 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 1 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 9 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 1 | context->passes = p; context->output = b; \ | 260 | 1 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 12 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 12 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 108 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 12 | context->passes = p; context->output = b; \ | 260 | 12 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 1 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 1 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 9 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 1 | context->passes = p; context->output = b; \ | 260 | 1 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 20 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 20 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 180 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 20 | context->passes = p; context->output = b; \ | 260 | 20 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 4 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 4 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 36 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 4 | context->passes = p; context->output = b; \ | 260 | 4 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 9 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 9 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 81 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 9 | context->passes = p; context->output = b; \ | 260 | 9 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 8 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 8 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 72 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 8 | context->passes = p; context->output = b; \ | 260 | 8 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 4 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 4 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 36 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 4 | context->passes = p; context->output = b; \ | 260 | 4 | context->Transform = PHP_##p##HAVALTransform; } |
Line | Count | Source | 256 | 26 | PHP_HASH_API void PHP_##p##HAVAL##b##Init(PHP_HAVAL_CTX *context, ZEND_ATTRIBUTE_UNUSED HashTable *args) \ | 257 | 26 | { int i; context->count[0] = context->count[1] = 0; \ | 258 | 234 | for(i = 0; i < 8; i++) context->state[i] = D0[i]; \ | 259 | 26 | context->passes = p; context->output = b; \ | 260 | 26 | context->Transform = PHP_##p##HAVALTransform; } |
|
261 | | |
262 | | PHP_HASH_HAVAL_INIT(3,128) |
263 | | PHP_HASH_HAVAL_INIT(3,160) |
264 | | PHP_HASH_HAVAL_INIT(3,192) |
265 | | PHP_HASH_HAVAL_INIT(3,224) |
266 | | PHP_HASH_HAVAL_INIT(3,256) |
267 | | |
268 | | PHP_HASH_HAVAL_INIT(4,128) |
269 | | PHP_HASH_HAVAL_INIT(4,160) |
270 | | PHP_HASH_HAVAL_INIT(4,192) |
271 | | PHP_HASH_HAVAL_INIT(4,224) |
272 | | PHP_HASH_HAVAL_INIT(4,256) |
273 | | |
274 | | PHP_HASH_HAVAL_INIT(5,128) |
275 | | PHP_HASH_HAVAL_INIT(5,160) |
276 | | PHP_HASH_HAVAL_INIT(5,192) |
277 | | PHP_HASH_HAVAL_INIT(5,224) |
278 | | PHP_HASH_HAVAL_INIT(5,256) |
279 | | |
280 | | /* {{{ PHP_HAVALUpdate */ |
281 | | PHP_HASH_API void PHP_HAVALUpdate(PHP_HAVAL_CTX *context, const unsigned char *input, size_t inputLen) |
282 | 723 | { |
283 | 723 | unsigned int index, partLen; |
284 | 723 | size_t i; |
285 | | |
286 | | /* Compute number of bytes mod 128 */ |
287 | 723 | index = (unsigned int) ((context->count[0] >> 3) & 0x7F); |
288 | | /* Update number of bits */ |
289 | 723 | if ((context->count[0] += ((uint32_t) inputLen << 3)) < ((uint32_t) inputLen << 3)) { |
290 | 93 | context->count[1]++; |
291 | 93 | } |
292 | 723 | context->count[1] += (uint32_t) (inputLen >> 29); |
293 | | |
294 | 723 | partLen = 128 - index; |
295 | | |
296 | | /* Transform as many times as possible. |
297 | | */ |
298 | 723 | if (inputLen >= partLen) { |
299 | 442 | memcpy((unsigned char*) & context->buffer[index], (unsigned char*) input, partLen); |
300 | 442 | context->Transform(context->state, context->buffer); |
301 | | |
302 | 4.31k | for (i = partLen; i + 127 < inputLen; i += 128) { |
303 | 3.87k | context->Transform(context->state, &input[i]); |
304 | 3.87k | } |
305 | | |
306 | 442 | index = 0; |
307 | 442 | } else { |
308 | 281 | i = 0; |
309 | 281 | } |
310 | | |
311 | | /* Buffer remaining input */ |
312 | 723 | memcpy((unsigned char*) &context->buffer[index], (unsigned char*) &input[i], inputLen - i); |
313 | 723 | } |
314 | | /* }}} */ |
315 | | |
316 | 241 | #define PHP_HASH_HAVAL_VERSION 0x01 |
317 | | |
318 | | /* {{{ PHP_HAVAL128Final */ |
319 | | PHP_HASH_API void PHP_HAVAL128Final(unsigned char *digest, PHP_HAVAL_CTX * context) |
320 | 60 | { |
321 | 60 | unsigned char bits[10]; |
322 | 60 | unsigned int index, padLen; |
323 | | |
324 | | /* Version, Passes, and Digest Length */ |
325 | 60 | bits[0] = (PHP_HASH_HAVAL_VERSION & 0x07) | |
326 | 60 | ((context->passes & 0x07) << 3) | |
327 | 60 | ((context->output & 0x03) << 6); |
328 | 60 | bits[1] = (context->output >> 2); |
329 | | |
330 | | /* Save number of bits */ |
331 | 60 | Encode(bits + 2, context->count, 8); |
332 | | |
333 | | /* Pad out to 118 mod 128. |
334 | | */ |
335 | 60 | index = (unsigned int) ((context->count[0] >> 3) & 0x7f); |
336 | 60 | padLen = (index < 118) ? (118 - index) : (246 - index); |
337 | 60 | PHP_HAVALUpdate(context, PADDING, padLen); |
338 | | |
339 | | /* Append version, passes, digest length, and message length */ |
340 | 60 | PHP_HAVALUpdate(context, bits, 10); |
341 | | |
342 | | /* Store state in digest */ |
343 | 60 | context->state[3] += (context->state[7] & 0xFF000000) | |
344 | 60 | (context->state[6] & 0x00FF0000) | |
345 | 60 | (context->state[5] & 0x0000FF00) | |
346 | 60 | (context->state[4] & 0x000000FF); |
347 | | |
348 | 60 | context->state[2] += (((context->state[7] & 0x00FF0000) | |
349 | 60 | (context->state[6] & 0x0000FF00) | |
350 | 60 | (context->state[5] & 0x000000FF)) << 8) | |
351 | 60 | ((context->state[4] & 0xFF000000) >> 24); |
352 | | |
353 | 60 | context->state[1] += (((context->state[7] & 0x0000FF00) | |
354 | 60 | (context->state[6] & 0x000000FF)) << 16) | |
355 | 60 | (((context->state[5] & 0xFF000000) | |
356 | 60 | (context->state[4] & 0x00FF0000)) >> 16); |
357 | | |
358 | 60 | context->state[0] += ((context->state[7] & 0x000000FF) << 24) | |
359 | 60 | (((context->state[6] & 0xFF000000) | |
360 | 60 | (context->state[5] & 0x00FF0000) | |
361 | 60 | (context->state[4] & 0x0000FF00)) >> 8); |
362 | | |
363 | 60 | Encode(digest, context->state, 16); |
364 | | |
365 | | /* Zeroize sensitive information. |
366 | | */ |
367 | 60 | ZEND_SECURE_ZERO((unsigned char*) context, sizeof(*context)); |
368 | 60 | } |
369 | | /* }}} */ |
370 | | |
371 | | /* {{{ PHP_HAVAL160Final */ |
372 | | PHP_HASH_API void PHP_HAVAL160Final(unsigned char *digest, PHP_HAVAL_CTX * context) |
373 | 16 | { |
374 | 16 | unsigned char bits[10]; |
375 | 16 | unsigned int index, padLen; |
376 | | |
377 | | /* Version, Passes, and Digest Length */ |
378 | 16 | bits[0] = (PHP_HASH_HAVAL_VERSION & 0x07) | |
379 | 16 | ((context->passes & 0x07) << 3) | |
380 | 16 | ((context->output & 0x03) << 6); |
381 | 16 | bits[1] = (context->output >> 2); |
382 | | |
383 | | /* Save number of bits */ |
384 | 16 | Encode(bits + 2, context->count, 8); |
385 | | |
386 | | /* Pad out to 118 mod 128. |
387 | | */ |
388 | 16 | index = (unsigned int) ((context->count[0] >> 3) & 0x7f); |
389 | 16 | padLen = (index < 118) ? (118 - index) : (246 - index); |
390 | 16 | PHP_HAVALUpdate(context, PADDING, padLen); |
391 | | |
392 | | /* Append version, passes, digest length, and message length */ |
393 | 16 | PHP_HAVALUpdate(context, bits, 10); |
394 | | |
395 | | /* Store state in digest */ |
396 | 16 | context->state[4] += ((context->state[7] & 0xFE000000) | |
397 | 16 | (context->state[6] & 0x01F80000) | |
398 | 16 | (context->state[5] & 0x0007F000)) >> 12; |
399 | | |
400 | 16 | context->state[3] += ((context->state[7] & 0x01F80000) | |
401 | 16 | (context->state[6] & 0x0007F000) | |
402 | 16 | (context->state[5] & 0x00000FC0)) >> 6; |
403 | | |
404 | 16 | context->state[2] += (context->state[7] & 0x0007F000) | |
405 | 16 | (context->state[6] & 0x00000FC0) | |
406 | 16 | (context->state[5] & 0x0000003F); |
407 | | |
408 | 16 | context->state[1] += ROTR((context->state[7] & 0x00000FC0) | |
409 | 16 | (context->state[6] & 0x0000003F) | |
410 | 16 | (context->state[5] & 0xFE000000), 25); |
411 | | |
412 | 16 | context->state[0] += ROTR((context->state[7] & 0x0000003F) | |
413 | 16 | (context->state[6] & 0xFE000000) | |
414 | 16 | (context->state[5] & 0x01F80000), 19); |
415 | | |
416 | 16 | Encode(digest, context->state, 20); |
417 | | |
418 | | /* Zeroize sensitive information. |
419 | | */ |
420 | 16 | ZEND_SECURE_ZERO((unsigned char*) context, sizeof(*context)); |
421 | 16 | } |
422 | | /* }}} */ |
423 | | |
424 | | /* {{{ PHP_HAVAL192Final */ |
425 | | PHP_HASH_API void PHP_HAVAL192Final(unsigned char *digest, PHP_HAVAL_CTX * context) |
426 | 37 | { |
427 | 37 | unsigned char bits[10]; |
428 | 37 | unsigned int index, padLen; |
429 | | |
430 | | /* Version, Passes, and Digest Length */ |
431 | 37 | bits[0] = (PHP_HASH_HAVAL_VERSION & 0x07) | |
432 | 37 | ((context->passes & 0x07) << 3) | |
433 | 37 | ((context->output & 0x03) << 6); |
434 | 37 | bits[1] = (context->output >> 2); |
435 | | |
436 | | /* Save number of bits */ |
437 | 37 | Encode(bits + 2, context->count, 8); |
438 | | |
439 | | /* Pad out to 118 mod 128. |
440 | | */ |
441 | 37 | index = (unsigned int) ((context->count[0] >> 3) & 0x7f); |
442 | 37 | padLen = (index < 118) ? (118 - index) : (246 - index); |
443 | 37 | PHP_HAVALUpdate(context, PADDING, padLen); |
444 | | |
445 | | /* Append version, passes, digest length, and message length */ |
446 | 37 | PHP_HAVALUpdate(context, bits, 10); |
447 | | |
448 | | /* Store state in digest */ |
449 | 37 | context->state[5] += ((context->state[7] & 0xFC000000) | (context->state[6] & 0x03E00000)) >> 21; |
450 | 37 | context->state[4] += ((context->state[7] & 0x03E00000) | (context->state[6] & 0x001F0000)) >> 16; |
451 | 37 | context->state[3] += ((context->state[7] & 0x001F0000) | (context->state[6] & 0x0000FC00)) >> 10; |
452 | 37 | context->state[2] += ((context->state[7] & 0x0000FC00) | (context->state[6] & 0x000003E0)) >> 5; |
453 | 37 | context->state[1] += (context->state[7] & 0x000003E0) | (context->state[6] & 0x0000001F); |
454 | 37 | context->state[0] += ROTR((context->state[7] & 0x0000001F) | (context->state[6] & 0xFC000000), 26); |
455 | 37 | Encode(digest, context->state, 24); |
456 | | |
457 | | /* Zeroize sensitive information. |
458 | | */ |
459 | 37 | ZEND_SECURE_ZERO((unsigned char*) context, sizeof(*context)); |
460 | 37 | } |
461 | | /* }}} */ |
462 | | |
463 | | /* {{{ PHP_HAVAL224Final */ |
464 | | PHP_HASH_API void PHP_HAVAL224Final(unsigned char *digest, PHP_HAVAL_CTX * context) |
465 | 39 | { |
466 | 39 | unsigned char bits[10]; |
467 | 39 | unsigned int index, padLen; |
468 | | |
469 | | /* Version, Passes, and Digest Length */ |
470 | 39 | bits[0] = (PHP_HASH_HAVAL_VERSION & 0x07) | |
471 | 39 | ((context->passes & 0x07) << 3) | |
472 | 39 | ((context->output & 0x03) << 6); |
473 | 39 | bits[1] = (context->output >> 2); |
474 | | |
475 | | /* Save number of bits */ |
476 | 39 | Encode(bits + 2, context->count, 8); |
477 | | |
478 | | /* Pad out to 118 mod 128. |
479 | | */ |
480 | 39 | index = (unsigned int) ((context->count[0] >> 3) & 0x7f); |
481 | 39 | padLen = (index < 118) ? (118 - index) : (246 - index); |
482 | 39 | PHP_HAVALUpdate(context, PADDING, padLen); |
483 | | |
484 | | /* Append version, passes, digest length, and message length */ |
485 | 39 | PHP_HAVALUpdate(context, bits, 10); |
486 | | |
487 | | /* Store state in digest */ |
488 | 39 | context->state[6] += context->state[7] & 0x0000000F; |
489 | 39 | context->state[5] += (context->state[7] >> 4) & 0x0000001F; |
490 | 39 | context->state[4] += (context->state[7] >> 9) & 0x0000000F; |
491 | 39 | context->state[3] += (context->state[7] >> 13) & 0x0000001F; |
492 | 39 | context->state[2] += (context->state[7] >> 18) & 0x0000000F; |
493 | 39 | context->state[1] += (context->state[7] >> 22) & 0x0000001F; |
494 | 39 | context->state[0] += (context->state[7] >> 27) & 0x0000001F; |
495 | 39 | Encode(digest, context->state, 28); |
496 | | |
497 | | /* Zeroize sensitive information. |
498 | | */ |
499 | 39 | ZEND_SECURE_ZERO((unsigned char*) context, sizeof(*context)); |
500 | 39 | } |
501 | | /* }}} */ |
502 | | |
503 | | /* {{{ PHP_HAVAL256Final */ |
504 | | PHP_HASH_API void PHP_HAVAL256Final(unsigned char *digest, PHP_HAVAL_CTX * context) |
505 | 89 | { |
506 | 89 | unsigned char bits[10]; |
507 | 89 | unsigned int index, padLen; |
508 | | |
509 | | /* Version, Passes, and Digest Length */ |
510 | 89 | bits[0] = (PHP_HASH_HAVAL_VERSION & 0x07) | |
511 | 89 | ((context->passes & 0x07) << 3) | |
512 | 89 | ((context->output & 0x03) << 6); |
513 | 89 | bits[1] = (context->output >> 2); |
514 | | |
515 | | /* Save number of bits */ |
516 | 89 | Encode(bits + 2, context->count, 8); |
517 | | |
518 | | /* Pad out to 118 mod 128. |
519 | | */ |
520 | 89 | index = (unsigned int) ((context->count[0] >> 3) & 0x7f); |
521 | 89 | padLen = (index < 118) ? (118 - index) : (246 - index); |
522 | 89 | PHP_HAVALUpdate(context, PADDING, padLen); |
523 | | |
524 | | /* Append version, passes, digest length, and message length */ |
525 | 89 | PHP_HAVALUpdate(context, bits, 10); |
526 | | |
527 | | /* Store state in digest */ |
528 | 89 | Encode(digest, context->state, 32); |
529 | | |
530 | | /* Zeroize sensitive information. |
531 | | */ |
532 | 89 | ZEND_SECURE_ZERO((unsigned char*) context, sizeof(*context)); |
533 | 89 | } |
534 | | /* }}} */ |