os/ossrv/ssl/libcrypto/src/crypto/md5/md5_dgst.c
author sl
Tue, 10 Jun 2014 14:32:02 +0200
changeset 1 260cb5ec6c19
permissions -rw-r--r--
Update contrib.
     1 /* crypto/md5/md5_dgst.c */
     2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
     3  * All rights reserved.
     4  *
     5  * This package is an SSL implementation written
     6  * by Eric Young (eay@cryptsoft.com).
     7  * The implementation was written so as to conform with Netscapes SSL.
     8  * 
     9  * This library is free for commercial and non-commercial use as long as
    10  * the following conditions are aheared to.  The following conditions
    11  * apply to all code found in this distribution, be it the RC4, RSA,
    12  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
    13  * included with this distribution is covered by the same copyright terms
    14  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
    15  * 
    16  * Copyright remains Eric Young's, and as such any Copyright notices in
    17  * the code are not to be removed.
    18  * If this package is used in a product, Eric Young should be given attribution
    19  * as the author of the parts of the library used.
    20  * This can be in the form of a textual message at program startup or
    21  * in documentation (online or textual) provided with the package.
    22  * 
    23  * Redistribution and use in source and binary forms, with or without
    24  * modification, are permitted provided that the following conditions
    25  * are met:
    26  * 1. Redistributions of source code must retain the copyright
    27  *    notice, this list of conditions and the following disclaimer.
    28  * 2. Redistributions in binary form must reproduce the above copyright
    29  *    notice, this list of conditions and the following disclaimer in the
    30  *    documentation and/or other materials provided with the distribution.
    31  * 3. All advertising materials mentioning features or use of this software
    32  *    must display the following acknowledgement:
    33  *    "This product includes cryptographic software written by
    34  *     Eric Young (eay@cryptsoft.com)"
    35  *    The word 'cryptographic' can be left out if the rouines from the library
    36  *    being used are not cryptographic related :-).
    37  * 4. If you include any Windows specific code (or a derivative thereof) from 
    38  *    the apps directory (application code) you must include an acknowledgement:
    39  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
    40  * 
    41  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
    42  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    43  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    44  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
    45  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
    46  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
    47  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
    48  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
    49  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
    50  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
    51  * SUCH DAMAGE.
    52  * 
    53  * The licence and distribution terms for any publically available version or
    54  * derivative of this code cannot be changed.  i.e. this code cannot simply be
    55  * copied and put under another distribution licence
    56  * [including the GNU Public Licence.]
    57  */
    58 
    59 #include <stdio.h>
    60 #include "md5_locl.h"
    61 #include <openssl/opensslv.h>
    62 
    63 const char MD5_version[]="MD5" OPENSSL_VERSION_PTEXT;
    64 
    65 /* Implemented from RFC1321 The MD5 Message-Digest Algorithm
    66  */
    67 
    68 #define INIT_DATA_A (unsigned long)0x67452301L
    69 #define INIT_DATA_B (unsigned long)0xefcdab89L
    70 #define INIT_DATA_C (unsigned long)0x98badcfeL
    71 #define INIT_DATA_D (unsigned long)0x10325476L
    72 
    73 EXPORT_C int MD5_Init(MD5_CTX *c)
    74 	{
    75 	c->A=INIT_DATA_A;
    76 	c->B=INIT_DATA_B;
    77 	c->C=INIT_DATA_C;
    78 	c->D=INIT_DATA_D;
    79 	c->Nl=0;
    80 	c->Nh=0;
    81 	c->num=0;
    82 	return 1;
    83 	}
    84 
    85 #ifndef md5_block_host_order
    86 void md5_block_host_order (MD5_CTX *c, const void *data, size_t num)
    87 	{
    88 	const MD5_LONG *X=data;
    89 	register unsigned MD32_REG_T A,B,C,D;
    90 
    91 	A=c->A;
    92 	B=c->B;
    93 	C=c->C;
    94 	D=c->D;
    95 
    96 	for (;num--;X+=HASH_LBLOCK)
    97 		{
    98 	/* Round 0 */
    99 	R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
   100 	R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
   101 	R0(C,D,A,B,X[ 2],17,0x242070dbL);
   102 	R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
   103 	R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
   104 	R0(D,A,B,C,X[ 5],12,0x4787c62aL);
   105 	R0(C,D,A,B,X[ 6],17,0xa8304613L);
   106 	R0(B,C,D,A,X[ 7],22,0xfd469501L);
   107 	R0(A,B,C,D,X[ 8], 7,0x698098d8L);
   108 	R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
   109 	R0(C,D,A,B,X[10],17,0xffff5bb1L);
   110 	R0(B,C,D,A,X[11],22,0x895cd7beL);
   111 	R0(A,B,C,D,X[12], 7,0x6b901122L);
   112 	R0(D,A,B,C,X[13],12,0xfd987193L);
   113 	R0(C,D,A,B,X[14],17,0xa679438eL);
   114 	R0(B,C,D,A,X[15],22,0x49b40821L);
   115 	/* Round 1 */
   116 	R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
   117 	R1(D,A,B,C,X[ 6], 9,0xc040b340L);
   118 	R1(C,D,A,B,X[11],14,0x265e5a51L);
   119 	R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
   120 	R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
   121 	R1(D,A,B,C,X[10], 9,0x02441453L);
   122 	R1(C,D,A,B,X[15],14,0xd8a1e681L);
   123 	R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
   124 	R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
   125 	R1(D,A,B,C,X[14], 9,0xc33707d6L);
   126 	R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
   127 	R1(B,C,D,A,X[ 8],20,0x455a14edL);
   128 	R1(A,B,C,D,X[13], 5,0xa9e3e905L);
   129 	R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
   130 	R1(C,D,A,B,X[ 7],14,0x676f02d9L);
   131 	R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
   132 	/* Round 2 */
   133 	R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
   134 	R2(D,A,B,C,X[ 8],11,0x8771f681L);
   135 	R2(C,D,A,B,X[11],16,0x6d9d6122L);
   136 	R2(B,C,D,A,X[14],23,0xfde5380cL);
   137 	R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
   138 	R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
   139 	R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
   140 	R2(B,C,D,A,X[10],23,0xbebfbc70L);
   141 	R2(A,B,C,D,X[13], 4,0x289b7ec6L);
   142 	R2(D,A,B,C,X[ 0],11,0xeaa127faL);
   143 	R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
   144 	R2(B,C,D,A,X[ 6],23,0x04881d05L);
   145 	R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
   146 	R2(D,A,B,C,X[12],11,0xe6db99e5L);
   147 	R2(C,D,A,B,X[15],16,0x1fa27cf8L);
   148 	R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
   149 	/* Round 3 */
   150 	R3(A,B,C,D,X[ 0], 6,0xf4292244L);
   151 	R3(D,A,B,C,X[ 7],10,0x432aff97L);
   152 	R3(C,D,A,B,X[14],15,0xab9423a7L);
   153 	R3(B,C,D,A,X[ 5],21,0xfc93a039L);
   154 	R3(A,B,C,D,X[12], 6,0x655b59c3L);
   155 	R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
   156 	R3(C,D,A,B,X[10],15,0xffeff47dL);
   157 	R3(B,C,D,A,X[ 1],21,0x85845dd1L);
   158 	R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
   159 	R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
   160 	R3(C,D,A,B,X[ 6],15,0xa3014314L);
   161 	R3(B,C,D,A,X[13],21,0x4e0811a1L);
   162 	R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
   163 	R3(D,A,B,C,X[11],10,0xbd3af235L);
   164 	R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
   165 	R3(B,C,D,A,X[ 9],21,0xeb86d391L);
   166 
   167 	A = c->A += A;
   168 	B = c->B += B;
   169 	C = c->C += C;
   170 	D = c->D += D;
   171 		}
   172 	}
   173 #endif
   174 
   175 #ifndef md5_block_data_order
   176 #ifdef X
   177 #undef X
   178 #endif
   179 void md5_block_data_order (MD5_CTX *c, const void *data_, size_t num)
   180 	{
   181 	const unsigned char *data=data_;
   182 	register unsigned MD32_REG_T A,B,C,D,l;
   183 #ifndef MD32_XARRAY
   184 	/* See comment in crypto/sha/sha_locl.h for details. */
   185 	unsigned MD32_REG_T	XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
   186 				XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
   187 # define X(i)	XX##i
   188 #else
   189 	MD5_LONG XX[MD5_LBLOCK];
   190 # define X(i)	XX[i]
   191 #endif
   192 
   193 	A=c->A;
   194 	B=c->B;
   195 	C=c->C;
   196 	D=c->D;
   197 
   198 	for (;num--;)
   199 		{
   200 	HOST_c2l(data,l); X( 0)=l;		HOST_c2l(data,l); X( 1)=l;
   201 	/* Round 0 */
   202 	R0(A,B,C,D,X( 0), 7,0xd76aa478L);	HOST_c2l(data,l); X( 2)=l;
   203 	R0(D,A,B,C,X( 1),12,0xe8c7b756L);	HOST_c2l(data,l); X( 3)=l;
   204 	R0(C,D,A,B,X( 2),17,0x242070dbL);	HOST_c2l(data,l); X( 4)=l;
   205 	R0(B,C,D,A,X( 3),22,0xc1bdceeeL);	HOST_c2l(data,l); X( 5)=l;
   206 	R0(A,B,C,D,X( 4), 7,0xf57c0fafL);	HOST_c2l(data,l); X( 6)=l;
   207 	R0(D,A,B,C,X( 5),12,0x4787c62aL);	HOST_c2l(data,l); X( 7)=l;
   208 	R0(C,D,A,B,X( 6),17,0xa8304613L);	HOST_c2l(data,l); X( 8)=l;
   209 	R0(B,C,D,A,X( 7),22,0xfd469501L);	HOST_c2l(data,l); X( 9)=l;
   210 	R0(A,B,C,D,X( 8), 7,0x698098d8L);	HOST_c2l(data,l); X(10)=l;
   211 	R0(D,A,B,C,X( 9),12,0x8b44f7afL);	HOST_c2l(data,l); X(11)=l;
   212 	R0(C,D,A,B,X(10),17,0xffff5bb1L);	HOST_c2l(data,l); X(12)=l;
   213 	R0(B,C,D,A,X(11),22,0x895cd7beL);	HOST_c2l(data,l); X(13)=l;
   214 	R0(A,B,C,D,X(12), 7,0x6b901122L);	HOST_c2l(data,l); X(14)=l;
   215 	R0(D,A,B,C,X(13),12,0xfd987193L);	HOST_c2l(data,l); X(15)=l;
   216 	R0(C,D,A,B,X(14),17,0xa679438eL);
   217 	R0(B,C,D,A,X(15),22,0x49b40821L);
   218 	/* Round 1 */
   219 	R1(A,B,C,D,X( 1), 5,0xf61e2562L);
   220 	R1(D,A,B,C,X( 6), 9,0xc040b340L);
   221 	R1(C,D,A,B,X(11),14,0x265e5a51L);
   222 	R1(B,C,D,A,X( 0),20,0xe9b6c7aaL);
   223 	R1(A,B,C,D,X( 5), 5,0xd62f105dL);
   224 	R1(D,A,B,C,X(10), 9,0x02441453L);
   225 	R1(C,D,A,B,X(15),14,0xd8a1e681L);
   226 	R1(B,C,D,A,X( 4),20,0xe7d3fbc8L);
   227 	R1(A,B,C,D,X( 9), 5,0x21e1cde6L);
   228 	R1(D,A,B,C,X(14), 9,0xc33707d6L);
   229 	R1(C,D,A,B,X( 3),14,0xf4d50d87L);
   230 	R1(B,C,D,A,X( 8),20,0x455a14edL);
   231 	R1(A,B,C,D,X(13), 5,0xa9e3e905L);
   232 	R1(D,A,B,C,X( 2), 9,0xfcefa3f8L);
   233 	R1(C,D,A,B,X( 7),14,0x676f02d9L);
   234 	R1(B,C,D,A,X(12),20,0x8d2a4c8aL);
   235 	/* Round 2 */
   236 	R2(A,B,C,D,X( 5), 4,0xfffa3942L);
   237 	R2(D,A,B,C,X( 8),11,0x8771f681L);
   238 	R2(C,D,A,B,X(11),16,0x6d9d6122L);
   239 	R2(B,C,D,A,X(14),23,0xfde5380cL);
   240 	R2(A,B,C,D,X( 1), 4,0xa4beea44L);
   241 	R2(D,A,B,C,X( 4),11,0x4bdecfa9L);
   242 	R2(C,D,A,B,X( 7),16,0xf6bb4b60L);
   243 	R2(B,C,D,A,X(10),23,0xbebfbc70L);
   244 	R2(A,B,C,D,X(13), 4,0x289b7ec6L);
   245 	R2(D,A,B,C,X( 0),11,0xeaa127faL);
   246 	R2(C,D,A,B,X( 3),16,0xd4ef3085L);
   247 	R2(B,C,D,A,X( 6),23,0x04881d05L);
   248 	R2(A,B,C,D,X( 9), 4,0xd9d4d039L);
   249 	R2(D,A,B,C,X(12),11,0xe6db99e5L);
   250 	R2(C,D,A,B,X(15),16,0x1fa27cf8L);
   251 	R2(B,C,D,A,X( 2),23,0xc4ac5665L);
   252 	/* Round 3 */
   253 	R3(A,B,C,D,X( 0), 6,0xf4292244L);
   254 	R3(D,A,B,C,X( 7),10,0x432aff97L);
   255 	R3(C,D,A,B,X(14),15,0xab9423a7L);
   256 	R3(B,C,D,A,X( 5),21,0xfc93a039L);
   257 	R3(A,B,C,D,X(12), 6,0x655b59c3L);
   258 	R3(D,A,B,C,X( 3),10,0x8f0ccc92L);
   259 	R3(C,D,A,B,X(10),15,0xffeff47dL);
   260 	R3(B,C,D,A,X( 1),21,0x85845dd1L);
   261 	R3(A,B,C,D,X( 8), 6,0x6fa87e4fL);
   262 	R3(D,A,B,C,X(15),10,0xfe2ce6e0L);
   263 	R3(C,D,A,B,X( 6),15,0xa3014314L);
   264 	R3(B,C,D,A,X(13),21,0x4e0811a1L);
   265 	R3(A,B,C,D,X( 4), 6,0xf7537e82L);
   266 	R3(D,A,B,C,X(11),10,0xbd3af235L);
   267 	R3(C,D,A,B,X( 2),15,0x2ad7d2bbL);
   268 	R3(B,C,D,A,X( 9),21,0xeb86d391L);
   269 
   270 	A = c->A += A;
   271 	B = c->B += B;
   272 	C = c->C += C;
   273 	D = c->D += D;
   274 		}
   275 	}
   276 #endif
   277 
   278 #ifdef undef
   279 int printit(unsigned long *l)
   280 	{
   281 	int i,ii;
   282 
   283 	for (i=0; i<2; i++)
   284 		{
   285 		for (ii=0; ii<8; ii++)
   286 			{
   287 			fprintf(stderr,"%08lx ",l[i*8+ii]);
   288 			}
   289 		fprintf(stderr,"\n");
   290 		}
   291 	}
   292 #endif