annotate fft/fftw/fftw-3.3.4/kernel/md5.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 /*
Chris@19 22 independent implementation of Ron Rivest's MD5 message-digest
Chris@19 23 algorithm, based on rfc 1321.
Chris@19 24
Chris@19 25 Optimized for small code size, not speed. Works as long as
Chris@19 26 sizeof(md5uint) >= 4.
Chris@19 27 */
Chris@19 28
Chris@19 29 #include "ifftw.h"
Chris@19 30
Chris@19 31 /* sintab[i] = 4294967296.0 * abs(sin((double)(i + 1))) */
Chris@19 32 static const md5uint sintab[64] = {
Chris@19 33 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
Chris@19 34 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
Chris@19 35 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
Chris@19 36 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
Chris@19 37 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
Chris@19 38 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
Chris@19 39 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
Chris@19 40 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
Chris@19 41 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
Chris@19 42 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
Chris@19 43 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
Chris@19 44 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
Chris@19 45 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
Chris@19 46 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
Chris@19 47 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
Chris@19 48 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
Chris@19 49 };
Chris@19 50
Chris@19 51 /* see rfc 1321 section 3.4 */
Chris@19 52 static const struct roundtab {
Chris@19 53 char k;
Chris@19 54 char s;
Chris@19 55 } roundtab[64] = {
Chris@19 56 { 0, 7}, { 1, 12}, { 2, 17}, { 3, 22},
Chris@19 57 { 4, 7}, { 5, 12}, { 6, 17}, { 7, 22},
Chris@19 58 { 8, 7}, { 9, 12}, { 10, 17}, { 11, 22},
Chris@19 59 { 12, 7}, { 13, 12}, { 14, 17}, { 15, 22},
Chris@19 60 { 1, 5}, { 6, 9}, { 11, 14}, { 0, 20},
Chris@19 61 { 5, 5}, { 10, 9}, { 15, 14}, { 4, 20},
Chris@19 62 { 9, 5}, { 14, 9}, { 3, 14}, { 8, 20},
Chris@19 63 { 13, 5}, { 2, 9}, { 7, 14}, { 12, 20},
Chris@19 64 { 5, 4}, { 8, 11}, { 11, 16}, { 14, 23},
Chris@19 65 { 1, 4}, { 4, 11}, { 7, 16}, { 10, 23},
Chris@19 66 { 13, 4}, { 0, 11}, { 3, 16}, { 6, 23},
Chris@19 67 { 9, 4}, { 12, 11}, { 15, 16}, { 2, 23},
Chris@19 68 { 0, 6}, { 7, 10}, { 14, 15}, { 5, 21},
Chris@19 69 { 12, 6}, { 3, 10}, { 10, 15}, { 1, 21},
Chris@19 70 { 8, 6}, { 15, 10}, { 6, 15}, { 13, 21},
Chris@19 71 { 4, 6}, { 11, 10}, { 2, 15}, { 9, 21}
Chris@19 72 };
Chris@19 73
Chris@19 74 #define rol(a, s) ((a << (int)(s)) | (a >> (32 - (int)(s))))
Chris@19 75
Chris@19 76 static void doblock(md5sig state, const unsigned char *data)
Chris@19 77 {
Chris@19 78 md5uint a, b, c, d, t, x[16];
Chris@19 79 const md5uint msk = (md5uint)0xffffffffUL;
Chris@19 80 int i;
Chris@19 81
Chris@19 82 /* encode input bytes into md5uint */
Chris@19 83 for (i = 0; i < 16; ++i) {
Chris@19 84 const unsigned char *p = data + 4 * i;
Chris@19 85 x[i] = p[0] | (p[1] << 8) | (p[2] << 16) | (p[3] << 24);
Chris@19 86 }
Chris@19 87
Chris@19 88 a = state[0]; b = state[1]; c = state[2]; d = state[3];
Chris@19 89 for (i = 0; i < 64; ++i) {
Chris@19 90 const struct roundtab *p = roundtab + i;
Chris@19 91 switch (i >> 4) {
Chris@19 92 case 0: a += (b & c) | (~b & d); break;
Chris@19 93 case 1: a += (b & d) | (c & ~d); break;
Chris@19 94 case 2: a += b ^ c ^ d; break;
Chris@19 95 case 3: a += c ^ (b | ~d); break;
Chris@19 96 }
Chris@19 97 a += sintab[i];
Chris@19 98 a += x[(int)(p->k)];
Chris@19 99 a &= msk;
Chris@19 100 t = b + rol(a, p->s);
Chris@19 101 a = d; d = c; c = b; b = t;
Chris@19 102 }
Chris@19 103 state[0] = (state[0] + a) & msk;
Chris@19 104 state[1] = (state[1] + b) & msk;
Chris@19 105 state[2] = (state[2] + c) & msk;
Chris@19 106 state[3] = (state[3] + d) & msk;
Chris@19 107 }
Chris@19 108
Chris@19 109
Chris@19 110 void X(md5begin)(md5 *p)
Chris@19 111 {
Chris@19 112 p->s[0] = 0x67452301;
Chris@19 113 p->s[1] = 0xefcdab89;
Chris@19 114 p->s[2] = 0x98badcfe;
Chris@19 115 p->s[3] = 0x10325476;
Chris@19 116 p->l = 0;
Chris@19 117 }
Chris@19 118
Chris@19 119 void X(md5putc)(md5 *p, unsigned char c)
Chris@19 120 {
Chris@19 121 p->c[p->l % 64] = c;
Chris@19 122 if (((++p->l) % 64) == 0) doblock(p->s, p->c);
Chris@19 123 }
Chris@19 124
Chris@19 125 void X(md5end)(md5 *p)
Chris@19 126 {
Chris@19 127 unsigned l, i;
Chris@19 128
Chris@19 129 l = 8 * p->l; /* length before padding, in bits */
Chris@19 130
Chris@19 131 /* rfc 1321 section 3.1: padding */
Chris@19 132 X(md5putc)(p, 0x80);
Chris@19 133 while ((p->l % 64) != 56) X(md5putc)(p, 0x00);
Chris@19 134
Chris@19 135 /* rfc 1321 section 3.2: length (little endian) */
Chris@19 136 for (i = 0; i < 8; ++i) {
Chris@19 137 X(md5putc)(p, l & 0xFF);
Chris@19 138 l = l >> 8;
Chris@19 139 }
Chris@19 140
Chris@19 141 /* Now p->l % 64 == 0 and signature is in p->s */
Chris@19 142 }