| 1 |
|
| #include "EXTERN.h" |
| 2 |
|
| #include "perl.h" |
| 3 |
|
| #include "XSUB.h" |
| 4 |
|
| |
| 5 |
|
| #include <time.h> |
| 6 |
|
| #include <stdlib.h> |
| 7 |
|
| #include <stdint.h> |
| 8 |
|
| |
| 9 |
|
| #include "perlmulticore.h" |
| 10 |
|
| |
| 11 |
|
| /* NIST Secure Hash Algorithm */ |
| 12 |
|
| /* heavily modified by Uwe Hollerbach <uh@alumni.caltech edu> */ |
| 13 |
|
| /* from Peter C. Gutmann's implementation as found in */ |
| 14 |
|
| /* Applied Cryptography by Bruce Schneier */ |
| 15 |
|
| /* Further modifications to include the "UNRAVEL" stuff, below */ |
| 16 |
|
| |
| 17 |
|
| /* This code is in the public domain */ |
| 18 |
|
| |
| 19 |
|
| /* pcg: I was tempted to just rip this code off, after all, if you don't |
| 20 |
|
| * demand anything I am inclined not to give anything. *Sigh* something |
| 21 |
|
| * kept me from doing it, so here's the truth: I took this code from the |
| 22 |
|
| * SHA1 perl module, since it looked reasonably well-crafted. I modified |
| 23 |
|
| * it here and there, though. |
| 24 |
|
| */ |
| 25 |
|
| |
| 26 |
|
| /* |
| 27 |
|
| * we have lots of micro-optimizations here, this is just for toying |
| 28 |
|
| * around... |
| 29 |
|
| */ |
| 30 |
|
| |
| 31 |
|
| /* don't expect _too_ much from compilers for now. */ |
| 32 |
|
| #if __GNUC__ > 2 |
| 33 |
|
| # define restrict __restrict__ |
| 34 |
|
| # define inline __inline__ |
| 35 |
|
| # ifdef __i386 |
| 36 |
|
| # define GCCX86ASM 1 |
| 37 |
|
| # endif |
| 38 |
|
| #elif __STDC_VERSION__ < 199900 |
| 39 |
|
| # define restrict |
| 40 |
|
| # define inline |
| 41 |
|
| #endif |
| 42 |
|
| |
| 43 |
|
| #if __GNUC__ < 2 |
| 44 |
|
| # define __attribute__(x) |
| 45 |
|
| #endif |
| 46 |
|
| |
| 47 |
|
| #ifdef __i386 |
| 48 |
|
| # define a_regparm(n) __attribute__((__regparm__(n))) |
| 49 |
|
| #else |
| 50 |
|
| # define a_regparm(n) |
| 51 |
|
| #endif |
| 52 |
|
| |
| 53 |
|
| #define a_const __attribute__((__const__)) |
| 54 |
|
| |
| 55 |
|
| /* Useful defines & typedefs */ |
| 56 |
|
| |
| 57 |
|
| #if defined(U64TYPE) && (defined(USE_64_BIT_INT) || ((BYTEORDER != 0x1234) && (BYTEORDER != 0x4321))) |
| 58 |
|
| typedef U64TYPE XULONG; |
| 59 |
|
| # if BYTEORDER == 0x1234 |
| 60 |
|
| # undef BYTEORDER |
| 61 |
|
| # define BYTEORDER 0x12345678 |
| 62 |
|
| # elif BYTEORDER == 0x4321 |
| 63 |
|
| # undef BYTEORDER |
| 64 |
|
| # define BYTEORDER 0x87654321 |
| 65 |
|
| # endif |
| 66 |
|
| #else |
| 67 |
|
| typedef uint_fast32_t XULONG; /* 32-or-more-bit quantity */ |
| 68 |
|
| #endif |
| 69 |
|
| |
| 70 |
|
| #if GCCX86ASM |
| 71 |
|
| # define zprefix(n) ({ int _r; __asm__ ("bsrl %1, %0" : "=r" (_r) : "r" (n)); 31 - _r ; }) |
| 72 |
|
| #elif __GNUC__ > 2 && __GNUC_MINOR__ > 3 |
| 73 |
|
| # define zprefix(n) (__extension__ ({ uint32_t n__ = (n); n ? __builtin_clz (n) : 32; })) |
| 74 |
|
| #else |
| 75 |
204454 |
| static int a_const zprefix (U32 n) |
| 76 |
|
| { |
| 77 |
|
| static char zp[256] = |
| 78 |
|
| { |
| 79 |
|
| 8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, |
| 80 |
|
| 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, |
| 81 |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 82 |
|
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 83 |
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 84 |
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 85 |
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 86 |
|
| 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, |
| 87 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 88 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 89 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 90 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 91 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 92 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 93 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 94 |
|
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 95 |
|
| }; |
| 96 |
|
| |
| 97 |
|
| return |
| 98 |
203468 |
| n > 0xffffff ? zp[n >> 24] |
| 99 |
205440 |
▶ | : n > 0xffff ? 8 + zp[n >> 16] |
Branch: 1 branch
| Branch | True | False | Total |
| : n > 0xffff ? 8 + zp[n >> 16] |
203468 |
986 |
204454 |
|
| 100 |
999 |
▶ | : n > 0xff ? 16 + zp[n >> 8] |
Branch: 1 branch
| Branch | True | False | Total |
| : n > 0xff ? 16 + zp[n >> 8] |
973 |
13 |
986 |
|
| 101 |
13 |
▶ | : 24 + zp[n]; |
Branch: 1 branch
| Branch | True | False | Total |
| : 24 + zp[n]; |
13 |
0 |
13 |
|
| 102 |
|
| } |
| 103 |
|
| #endif |
| 104 |
|
| |
| 105 |
|
| #define SHA_BLOCKSIZE 64 |
| 106 |
|
| #define SHA_DIGESTSIZE 20 |
| 107 |
|
| |
| 108 |
|
| typedef struct { |
| 109 |
|
| U32 digest[5]; /* message digest */ |
| 110 |
|
| U32 count; /* 32-bit bit count */ |
| 111 |
|
| int local; /* unprocessed amount in data */ |
| 112 |
|
| U8 data[SHA_BLOCKSIZE]; /* SHA data buffer */ |
| 113 |
|
| } SHA_INFO; |
| 114 |
|
| |
| 115 |
|
| |
| 116 |
|
| /* SHA f()-functions */ |
| 117 |
|
| #define f1(x,y,z) ((x & y) | (~x & z)) |
| 118 |
|
| #define f2(x,y,z) (x ^ y ^ z) |
| 119 |
|
| #define f3(x,y,z) ((x & y) | (x & z) | (y & z)) |
| 120 |
|
| #define f4(x,y,z) (x ^ y ^ z) |
| 121 |
|
| |
| 122 |
|
| /* SHA constants */ |
| 123 |
|
| #define CONST1 0x5a827999L |
| 124 |
|
| #define CONST2 0x6ed9eba1L |
| 125 |
|
| #define CONST3 0x8f1bbcdcL |
| 126 |
|
| #define CONST4 0xca62c1d6L |
| 127 |
|
| |
| 128 |
|
| /* truncate to 32 bits -- should be a null op on 32-bit machines */ |
| 129 |
|
| #define T32(x) ((x) & 0xffffffffL) |
| 130 |
|
| |
| 131 |
|
| /* 32-bit rotate */ |
| 132 |
|
| #define R32(x,n) T32(((x << n) | (x >> (32 - n)))) |
| 133 |
|
| |
| 134 |
|
| /* specific cases, for when the overall rotation is unraveled */ |
| 135 |
|
| #define FA(n) \ |
| 136 |
|
| T = T32(R32(A,5) + f##n(B,C,D) + E + *WP++ + CONST##n); B = R32(B,30) |
| 137 |
|
| |
| 138 |
|
| #define FB(n) \ |
| 139 |
|
| E = T32(R32(T,5) + f##n(A,B,C) + D + *WP++ + CONST##n); A = R32(A,30) |
| 140 |
|
| |
| 141 |
|
| #define FC(n) \ |
| 142 |
|
| D = T32(R32(E,5) + f##n(T,A,B) + C + *WP++ + CONST##n); T = R32(T,30) |
| 143 |
|
| |
| 144 |
|
| #define FD(n) \ |
| 145 |
|
| C = T32(R32(D,5) + f##n(E,T,A) + B + *WP++ + CONST##n); E = R32(E,30) |
| 146 |
|
| |
| 147 |
|
| #define FE(n) \ |
| 148 |
|
| B = T32(R32(C,5) + f##n(D,E,T) + A + *WP++ + CONST##n); D = R32(D,30) |
| 149 |
|
| |
| 150 |
|
| #define FT(n) \ |
| 151 |
|
| A = T32(R32(B,5) + f##n(C,D,E) + T + *WP++ + CONST##n); C = R32(C,30) |
| 152 |
|
| |
| 153 |
249984 |
| static void a_regparm(1) sha_transform(SHA_INFO *restrict sha_info) |
| 154 |
|
| { |
| 155 |
|
| int i; |
| 156 |
|
| U8 *restrict dp; |
| 157 |
|
| U32 A, B, C, D, E, W[80], *restrict WP; |
| 158 |
|
| XULONG T; |
| 159 |
|
| |
| 160 |
249984 |
| dp = sha_info->data; |
| 161 |
|
| |
| 162 |
|
| #if BYTEORDER == 0x1234 |
| 163 |
|
| assert(sizeof(XULONG) == 4); |
| 164 |
|
| # ifdef HAS_NTOHL |
| 165 |
|
| for (i = 0; i < 16; ++i) { |
| 166 |
|
| T = *((XULONG *) dp); |
| 167 |
|
| dp += 4; |
| 168 |
|
| W[i] = ntohl (T); |
| 169 |
|
| } |
| 170 |
|
| # else |
| 171 |
|
| for (i = 0; i < 16; ++i) { |
| 172 |
|
| T = *((XULONG *) dp); |
| 173 |
|
| dp += 4; |
| 174 |
|
| W[i] = ((T << 24) & 0xff000000) | ((T << 8) & 0x00ff0000) | |
| 175 |
|
| ((T >> 8) & 0x0000ff00) | ((T >> 24) & 0x000000ff); |
| 176 |
|
| } |
| 177 |
|
| # endif |
| 178 |
|
| #elif BYTEORDER == 0x4321 |
| 179 |
|
| assert(sizeof(XULONG) == 4); |
| 180 |
|
| for (i = 0; i < 16; ++i) { |
| 181 |
|
| T = *((XULONG *) dp); |
| 182 |
|
| dp += 4; |
| 183 |
|
| W[i] = T32(T); |
| 184 |
|
| } |
| 185 |
|
| #elif BYTEORDER == 0x12345678 |
| 186 |
|
| assert(sizeof(XULONG) == 8); |
| 187 |
2249856 |
▶ | for (i = 0; i < 16; i += 2) { |
Branch: 1 branch
| Branch | True | False | Total |
| for (i = 0; i < 16; i += 2) { |
1999872 |
249984 |
2249856 |
|
| 188 |
1999872 |
| T = *((XULONG *) dp); |
| 189 |
1999872 |
| dp += 8; |
| 190 |
1999872 |
| W[i] = ((T << 24) & 0xff000000) | ((T << 8) & 0x00ff0000) | |
| 191 |
1999872 |
| ((T >> 8) & 0x0000ff00) | ((T >> 24) & 0x000000ff); |
| 192 |
1999872 |
| T >>= 32; |
| 193 |
1999872 |
| W[i+1] = ((T << 24) & 0xff000000) | ((T << 8) & 0x00ff0000) | |
| 194 |
1999872 |
| ((T >> 8) & 0x0000ff00) | ((T >> 24) & 0x000000ff); |
| 195 |
|
| } |
| 196 |
|
| #elif BYTEORDER == 0x87654321 |
| 197 |
|
| assert(sizeof(XULONG) == 8); |
| 198 |
|
| for (i = 0; i < 16; i += 2) { |
| 199 |
|
| T = *((XULONG *) dp); |
| 200 |
|
| dp += 8; |
| 201 |
|
| W[i] = T32(T >> 32); |
| 202 |
|
| W[i+1] = T32(T); |
| 203 |
|
| } |
| 204 |
|
| #else |
| 205 |
|
| #error Unknown byte order -- you need to add code here |
| 206 |
|
| #endif |
| 207 |
|
| |
| 208 |
16248960 |
▶ | for (i = 16; i < 80; ++i) |
Branch: 1 branch
| Branch | True | False | Total |
| for (i = 16; i < 80; ++i) |
15998976 |
249984 |
16248960 |
|
| 209 |
|
| { |
| 210 |
15998976 |
| T = W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16]; |
| 211 |
15998976 |
| W[i] = R32(T,1); |
| 212 |
|
| } |
| 213 |
|
| |
| 214 |
249984 |
| A = sha_info->digest[0]; |
| 215 |
249984 |
| B = sha_info->digest[1]; |
| 216 |
249984 |
| C = sha_info->digest[2]; |
| 217 |
249984 |
| D = sha_info->digest[3]; |
| 218 |
249984 |
| E = sha_info->digest[4]; |
| 219 |
|
| |
| 220 |
249984 |
| WP = W; |
| 221 |
249984 |
| FA(1); FB(1); FC(1); FD(1); FE(1); FT(1); FA(1); FB(1); FC(1); FD(1); |
| 222 |
249984 |
| FE(1); FT(1); FA(1); FB(1); FC(1); FD(1); FE(1); FT(1); FA(1); FB(1); |
| 223 |
249984 |
| FC(2); FD(2); FE(2); FT(2); FA(2); FB(2); FC(2); FD(2); FE(2); FT(2); |
| 224 |
249984 |
| FA(2); FB(2); FC(2); FD(2); FE(2); FT(2); FA(2); FB(2); FC(2); FD(2); |
| 225 |
249984 |
| FE(3); FT(3); FA(3); FB(3); FC(3); FD(3); FE(3); FT(3); FA(3); FB(3); |
| 226 |
249984 |
| FC(3); FD(3); FE(3); FT(3); FA(3); FB(3); FC(3); FD(3); FE(3); FT(3); |
| 227 |
249984 |
| FA(4); FB(4); FC(4); FD(4); FE(4); FT(4); FA(4); FB(4); FC(4); FD(4); |
| 228 |
249984 |
| FE(4); FT(4); FA(4); FB(4); FC(4); FD(4); FE(4); FT(4); FA(4); FB(4); |
| 229 |
|
| |
| 230 |
249984 |
| sha_info->digest[0] = T32(sha_info->digest[0] + E); |
| 231 |
249984 |
| sha_info->digest[1] = T32(sha_info->digest[1] + T); |
| 232 |
249984 |
| sha_info->digest[2] = T32(sha_info->digest[2] + A); |
| 233 |
249984 |
| sha_info->digest[3] = T32(sha_info->digest[3] + B); |
| 234 |
249984 |
| sha_info->digest[4] = T32(sha_info->digest[4] + C); |
| 235 |
249984 |
| } |
| 236 |
|
| |
| 237 |
|
| /* initialize the SHA digest */ |
| 238 |
|
| |
| 239 |
1352 |
| static void sha_init(SHA_INFO *restrict sha_info) |
| 240 |
|
| { |
| 241 |
1352 |
| sha_info->digest[0] = 0x67452301L; |
| 242 |
1352 |
| sha_info->digest[1] = 0xefcdab89L; |
| 243 |
1352 |
| sha_info->digest[2] = 0x98badcfeL; |
| 244 |
1352 |
| sha_info->digest[3] = 0x10325476L; |
| 245 |
1352 |
| sha_info->digest[4] = 0xc3d2e1f0L; |
| 246 |
1352 |
| sha_info->count = 0L; |
| 247 |
1352 |
| sha_info->local = 0; |
| 248 |
1352 |
| } |
| 249 |
|
| |
| 250 |
|
| /* update the SHA digest */ |
| 251 |
|
| |
| 252 |
204616 |
| static void sha_update(SHA_INFO *restrict sha_info, U8 *restrict buffer, int count) |
| 253 |
|
| { |
| 254 |
|
| int i; |
| 255 |
|
| |
| 256 |
204616 |
| sha_info->count += count; |
| 257 |
204616 |
▶ | if (sha_info->local) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (sha_info->local) { |
200852 |
3764 |
204616 |
|
| 258 |
200852 |
| i = SHA_BLOCKSIZE - sha_info->local; |
| 259 |
200852 |
▶ | if (i > count) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (i > count) { |
183068 |
17784 |
200852 |
|
| 260 |
183068 |
| i = count; |
| 261 |
|
| } |
| 262 |
200852 |
| memcpy(((U8 *) sha_info->data) + sha_info->local, buffer, i); |
| 263 |
200852 |
| count -= i; |
| 264 |
200852 |
| buffer += i; |
| 265 |
200852 |
| sha_info->local += i; |
| 266 |
200852 |
▶ | if (sha_info->local == SHA_BLOCKSIZE) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (sha_info->local == SHA_BLOCKSIZE) { |
17784 |
183068 |
200852 |
|
| 267 |
17784 |
| sha_transform(sha_info); |
| 268 |
|
| } else { |
| 269 |
183068 |
| return; |
| 270 |
|
| } |
| 271 |
|
| } |
| 272 |
21995 |
▶ | while (count >= SHA_BLOCKSIZE) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (count >= SHA_BLOCKSIZE) { |
447 |
21548 |
21995 |
|
| 273 |
447 |
| memcpy(sha_info->data, buffer, SHA_BLOCKSIZE); |
| 274 |
447 |
| buffer += SHA_BLOCKSIZE; |
| 275 |
447 |
| count -= SHA_BLOCKSIZE; |
| 276 |
447 |
| sha_transform(sha_info); |
| 277 |
|
| } |
| 278 |
21548 |
| memcpy(sha_info->data, buffer, count); |
| 279 |
21548 |
| sha_info->local = count; |
| 280 |
|
| } |
| 281 |
|
| |
| 282 |
|
| /* finish computing the SHA digest */ |
| 283 |
204454 |
| static int sha_final(SHA_INFO *sha_info) |
| 284 |
|
| { |
| 285 |
204454 |
| int count = sha_info->count; |
| 286 |
204454 |
| int local = sha_info->local; |
| 287 |
|
| |
| 288 |
204454 |
| sha_info->data[local] = 0x80; |
| 289 |
|
| |
| 290 |
204454 |
▶ | if (sha_info->local >= SHA_BLOCKSIZE - 8) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (sha_info->local >= SHA_BLOCKSIZE - 8) { |
27299 |
177155 |
204454 |
|
| 291 |
27299 |
| memset(sha_info->data + local + 1, 0, SHA_BLOCKSIZE - 1 - local); |
| 292 |
27299 |
| sha_transform(sha_info); |
| 293 |
27299 |
| memset(sha_info->data, 0, SHA_BLOCKSIZE - 2); |
| 294 |
|
| } else { |
| 295 |
177155 |
| memset(sha_info->data + local + 1, 0, SHA_BLOCKSIZE - 3 - local); |
| 296 |
|
| } |
| 297 |
|
| |
| 298 |
204454 |
| sha_info->data[62] = count >> 5; |
| 299 |
204454 |
| sha_info->data[63] = count << 3; |
| 300 |
|
| |
| 301 |
204454 |
| sha_transform (sha_info); |
| 302 |
|
| |
| 303 |
204454 |
| return sha_info->digest[0] |
| 304 |
204453 |
| ? zprefix (sha_info->digest[0]) |
| 305 |
408907 |
▶ | : zprefix (sha_info->digest[1]) + 32; |
Branch: 1 branch
| Branch | True | False | Total |
| : zprefix (sha_info->digest[1]) + 32; |
204453 |
1 |
204454 |
|
| 306 |
|
| } |
| 307 |
|
| |
| 308 |
|
| #define TRIALCHAR "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789!#$%&()*+,-./;<=>?@[]{}^_|" |
| 309 |
|
| |
| 310 |
|
| static char |
| 311 |
|
| nextenc[256]; |
| 312 |
|
| |
| 313 |
|
| static char |
| 314 |
4456 |
| rand_char () |
| 315 |
|
| { |
| 316 |
4456 |
| return TRIALCHAR[(int)(Drand01 () * sizeof (TRIALCHAR))]; |
| 317 |
|
| } |
| 318 |
|
| |
| 319 |
|
| typedef double (*NVTime)(void); |
| 320 |
|
| |
| 321 |
|
| static double |
| 322 |
0 |
| simple_nvtime (void) |
| 323 |
|
| { |
| 324 |
0 |
| return time (0); |
| 325 |
|
| } |
| 326 |
|
| |
| 327 |
|
| static NVTime |
| 328 |
1 |
| get_nvtime (void) |
| 329 |
|
| { |
| 330 |
1 |
| SV **svp = hv_fetch (PL_modglobal, "Time::NVtime", 12, 0); |
| 331 |
|
| |
| 332 |
1 |
▶ | if (svp && SvIOK(*svp)) |
Branch: 2 branches
| Branch | True | False | Total |
| if (svp && SvIOK(*svp)) |
1 |
0 |
1 |
| if (svp && SvIOK(*svp)) |
1 |
0 |
1 |
|
| 333 |
1 |
| return INT2PTR(NVTime, SvIV(*svp)); |
| 334 |
|
| else |
| 335 |
0 |
| return simple_nvtime; |
| 336 |
|
| |
| 337 |
|
| } |
| 338 |
|
| |
| 339 |
|
| MODULE = Digest::Hashcash PACKAGE = Digest::Hashcash |
| 340 |
|
| |
| 341 |
|
| BOOT: |
| 342 |
|
| { |
| 343 |
|
| int i; |
| 344 |
|
| |
| 345 |
90 |
▶ | for (i = 0; i < sizeof (TRIALCHAR); i++) |
Branch: 1 branch
| Branch | True | False | Total |
| for (i = 0; i < sizeof (TRIALCHAR); i++) |
89 |
1 |
90 |
|
| 346 |
89 |
| nextenc[TRIALCHAR[i]] = TRIALCHAR[(i + 1) % sizeof (TRIALCHAR)]; |
| 347 |
|
| } |
| 348 |
|
| |
| 349 |
|
| PROTOTYPES: ENABLE |
| 350 |
|
| |
| 351 |
|
| # could be improved quite a bit in accuracy |
| 352 |
|
| NV |
| 353 |
|
| _estimate_rounds () |
| 354 |
|
| CODE: |
| 355 |
|
| { |
| 356 |
|
| char data[40]; |
| 357 |
1 |
| NVTime nvtime = get_nvtime (); |
| 358 |
|
| NV t1, t2, t; |
| 359 |
1 |
| int count = 0; |
| 360 |
|
| SHA_INFO ctx; |
| 361 |
|
| |
| 362 |
1 |
| t = nvtime (); |
| 363 |
|
| do { |
| 364 |
1 |
| t1 = nvtime (); |
| 365 |
1 |
▶ | } while (t == t1); |
Branch: 1 branch
| Branch | True | False | Total |
| } while (t == t1); |
0 |
1 |
1 |
|
| 366 |
|
| |
| 367 |
1 |
| t = t2 = nvtime (); |
| 368 |
|
| do { |
| 369 |
|
| volatile int i; |
| 370 |
1024 |
| sha_init (&ctx); |
| 371 |
1024 |
| sha_update (&ctx, data, sizeof (data)); |
| 372 |
1024 |
| i = sha_final (&ctx); |
| 373 |
|
| |
| 374 |
1024 |
▶ | if (!(++count & 1023)) |
Branch: 1 branch
| Branch | True | False | Total |
| if (!(++count & 1023)) |
1 |
1023 |
1024 |
|
| 375 |
1 |
| t2 = nvtime (); |
| 376 |
|
| |
| 377 |
1024 |
▶ | } while (t == t2); |
Branch: 1 branch
| Branch | True | False | Total |
| } while (t == t2); |
1023 |
1 |
1024 |
|
| 378 |
|
| |
| 379 |
1 |
▶ | RETVAL = (NV)count / (t2 - t1); |
Branch: 1 branch
| Branch | True | False | Total |
| RETVAL = (NV)count / (t2 - t1); |
0 |
1 |
1 |
|
| 380 |
|
| } |
| 381 |
|
| OUTPUT: |
| 382 |
|
| RETVAL |
| 383 |
|
| |
| 384 |
|
| SV * |
| 385 |
|
| _gentoken (int size, IV timestamp, char *resource, char *trial = "", int extrarand = 0) |
| 386 |
|
| CODE: |
| 387 |
|
| { |
| 388 |
|
| SHA_INFO ctx1, ctx; |
| 389 |
|
| char *token, *seq, *s; |
| 390 |
|
| int toklen, i; |
| 391 |
162 |
▶ | time_t tstamp = timestamp ? timestamp : time (0); |
Branch: 1 branch
| Branch | True | False | Total |
| time_t tstamp = timestamp ? timestamp : time (0); |
162 |
0 |
162 |
|
| 392 |
162 |
| struct tm *tm = gmtime (&tstamp); |
| 393 |
|
| |
| 394 |
162 |
| New (0, token, |
| 395 |
|
| 1 + 1 // version |
| 396 |
|
| + 12 + 1 // time field sans century |
| 397 |
|
| + strlen (resource) + 1 // ressource |
| 398 |
|
| + strlen (trial) + extrarand + 8 + 1 // trial |
| 399 |
|
| + 1, |
| 400 |
|
| char); |
| 401 |
|
| |
| 402 |
162 |
▶ | if (!token) |
Branch: 1 branch
| Branch | True | False | Total |
| if (!token) |
0 |
162 |
162 |
|
| 403 |
0 |
| croak ("out of memory"); |
| 404 |
|
| |
| 405 |
162 |
▶ | if (size > 64) |
Branch: 1 branch
| Branch | True | False | Total |
| if (size > 64) |
0 |
162 |
162 |
|
| 406 |
0 |
| croak ("size must be <= 64 in this implementation\n"); |
| 407 |
|
| |
| 408 |
162 |
| toklen = sprintf (token, "%d:%02d%02d%02d%02d%02d%02d:%s:%s", |
| 409 |
162 |
| 0, tm->tm_year % 100, tm->tm_mon + 1, tm->tm_mday, |
| 410 |
|
| tm->tm_hour, tm->tm_min, tm->tm_sec, |
| 411 |
|
| resource, trial); |
| 412 |
|
| |
| 413 |
162 |
▶ | if (toklen > 8000) |
Branch: 1 branch
| Branch | True | False | Total |
| if (toklen > 8000) |
0 |
162 |
162 |
|
| 414 |
0 |
| croak ("token length must be <= 8000 in this implementation\n"); |
| 415 |
|
| |
| 416 |
162 |
| perlinterp_release (); |
| 417 |
|
| |
| 418 |
162 |
| i = toklen + extrarand; |
| 419 |
3322 |
▶ | while (toklen < i) |
Branch: 1 branch
| Branch | True | False | Total |
| while (toklen < i) |
3160 |
162 |
3322 |
|
| 420 |
3160 |
| token[toklen++] = rand_char (); |
| 421 |
|
| |
| 422 |
162 |
| sha_init (&ctx1); |
| 423 |
162 |
| sha_update (&ctx1, token, toklen); |
| 424 |
|
| |
| 425 |
162 |
| seq = token + toklen; |
| 426 |
162 |
| i += 8; |
| 427 |
1458 |
▶ | while (toklen < i) |
Branch: 1 branch
| Branch | True | False | Total |
| while (toklen < i) |
1296 |
162 |
1458 |
|
| 428 |
1296 |
| token[toklen++] = rand_char (); |
| 429 |
|
| |
| 430 |
|
| for (;;) |
| 431 |
|
| { |
| 432 |
203264 |
| ctx = ctx1; // this "optimization" can help a lot for longer resource strings |
| 433 |
203264 |
| sha_update (&ctx, seq, 8); |
| 434 |
203264 |
| i = sha_final (&ctx); |
| 435 |
|
| |
| 436 |
203264 |
▶ | if (i >= size) |
Branch: 1 branch
| Branch | True | False | Total |
| if (i >= size) |
162 |
203102 |
203264 |
|
| 437 |
162 |
| break; |
| 438 |
|
| |
| 439 |
203102 |
| s = seq; |
| 440 |
|
| do { |
| 441 |
205416 |
| *s = nextenc [*s]; |
| 442 |
205416 |
▶ | } while (*s++ == 'a'); |
Branch: 1 branch
| Branch | True | False | Total |
| } while (*s++ == 'a'); |
2314 |
203102 |
205416 |
|
| 443 |
|
| } |
| 444 |
|
| |
| 445 |
162 |
| perlinterp_acquire (); |
| 446 |
|
| |
| 447 |
162 |
| RETVAL = newSVpvn (token, toklen); |
| 448 |
|
| } |
| 449 |
|
| OUTPUT: |
| 450 |
|
| RETVAL |
| 451 |
|
| |
| 452 |
|
| int |
| 453 |
|
| _prefixlen (SV *tok) |
| 454 |
|
| CODE: |
| 455 |
|
| { |
| 456 |
|
| STRLEN toklen; |
| 457 |
166 |
| char *token = SvPV (tok, toklen); |
| 458 |
|
| SHA_INFO ctx; |
| 459 |
|
| |
| 460 |
166 |
| sha_init (&ctx); |
| 461 |
166 |
| sha_update (&ctx, token, toklen); |
| 462 |
166 |
| RETVAL = sha_final (&ctx); |
| 463 |
|
| } |
| 464 |
|
| OUTPUT: |
| 465 |
|
| RETVAL |
| 466 |
|
| |
| 467 |
|
| |