Eneboo - Documentación para desarrolladores
src/libdigidoc/openssl/crypto/sha/sha_locl.h
Ir a la documentación de este archivo.
00001 /* crypto/sha/sha_locl.h */
00002 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
00003  * All rights reserved.
00004  *
00005  * This package is an SSL implementation written
00006  * by Eric Young (eay@cryptsoft.com).
00007  * The implementation was written so as to conform with Netscapes SSL.
00008  * 
00009  * This library is free for commercial and non-commercial use as long as
00010  * the following conditions are aheared to.  The following conditions
00011  * apply to all code found in this distribution, be it the RC4, RSA,
00012  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
00013  * included with this distribution is covered by the same copyright terms
00014  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
00015  * 
00016  * Copyright remains Eric Young's, and as such any Copyright notices in
00017  * the code are not to be removed.
00018  * If this package is used in a product, Eric Young should be given attribution
00019  * as the author of the parts of the library used.
00020  * This can be in the form of a textual message at program startup or
00021  * in documentation (online or textual) provided with the package.
00022  * 
00023  * Redistribution and use in source and binary forms, with or without
00024  * modification, are permitted provided that the following conditions
00025  * are met:
00026  * 1. Redistributions of source code must retain the copyright
00027  *    notice, this list of conditions and the following disclaimer.
00028  * 2. Redistributions in binary form must reproduce the above copyright
00029  *    notice, this list of conditions and the following disclaimer in the
00030  *    documentation and/or other materials provided with the distribution.
00031  * 3. All advertising materials mentioning features or use of this software
00032  *    must display the following acknowledgement:
00033  *    "This product includes cryptographic software written by
00034  *     Eric Young (eay@cryptsoft.com)"
00035  *    The word 'cryptographic' can be left out if the rouines from the library
00036  *    being used are not cryptographic related :-).
00037  * 4. If you include any Windows specific code (or a derivative thereof) from 
00038  *    the apps directory (application code) you must include an acknowledgement:
00039  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
00040  * 
00041  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
00042  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00043  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00044  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
00045  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00046  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
00047  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00048  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00049  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
00050  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
00051  * SUCH DAMAGE.
00052  * 
00053  * The licence and distribution terms for any publically available version or
00054  * derivative of this code cannot be changed.  i.e. this code cannot simply be
00055  * copied and put under another distribution licence
00056  * [including the GNU Public Licence.]
00057  */
00058 
00059 #include <stdlib.h>
00060 #include <string.h>
00061 
00062 #include <openssl/opensslconf.h>
00063 #include <openssl/sha.h>
00064 
00065 #define DATA_ORDER_IS_BIG_ENDIAN
00066 
00067 #define HASH_LONG               SHA_LONG
00068 #define HASH_CTX                SHA_CTX
00069 #define HASH_CBLOCK             SHA_CBLOCK
00070 #define HASH_MAKE_STRING(c,s)   do {    \
00071         unsigned long ll;               \
00072         ll=(c)->h0; HOST_l2c(ll,(s));   \
00073         ll=(c)->h1; HOST_l2c(ll,(s));   \
00074         ll=(c)->h2; HOST_l2c(ll,(s));   \
00075         ll=(c)->h3; HOST_l2c(ll,(s));   \
00076         ll=(c)->h4; HOST_l2c(ll,(s));   \
00077         } while (0)
00078 
00079 #if defined(SHA_0)
00080 
00081 # define HASH_UPDATE                    SHA_Update
00082 # define HASH_TRANSFORM                 SHA_Transform
00083 # define HASH_FINAL                     SHA_Final
00084 # define HASH_INIT                      SHA_Init
00085 # define HASH_BLOCK_DATA_ORDER          sha_block_data_order
00086 # define Xupdate(a,ix,ia,ib,ic,id)      (ix=(a)=(ia^ib^ic^id))
00087 
00088 static void sha_block_data_order (SHA_CTX *c, const void *p,size_t num);
00089 
00090 #elif defined(SHA_1)
00091 
00092 # define HASH_UPDATE                    SHA1_Update
00093 # define HASH_TRANSFORM                 SHA1_Transform
00094 # define HASH_FINAL                     SHA1_Final
00095 # define HASH_INIT                      SHA1_Init
00096 # define HASH_BLOCK_DATA_ORDER          sha1_block_data_order
00097 # if defined(__MWERKS__) && defined(__MC68K__)
00098    /* Metrowerks for Motorola fails otherwise:-( <appro@fy.chalmers.se> */
00099 #  define Xupdate(a,ix,ia,ib,ic,id)     do { (a)=(ia^ib^ic^id);         \
00100                                              ix=(a)=ROTATE((a),1);      \
00101                                         } while (0)
00102 # else
00103 #  define Xupdate(a,ix,ia,ib,ic,id)     ( (a)=(ia^ib^ic^id),    \
00104                                           ix=(a)=ROTATE((a),1)  \
00105                                         )
00106 # endif
00107 
00108 #ifndef SHA1_ASM
00109 static
00110 #endif
00111 void sha1_block_data_order (SHA_CTX *c, const void *p,size_t num);
00112 
00113 #else
00114 # error "Either SHA_0 or SHA_1 must be defined."
00115 #endif
00116 
00117 #include "md32_common.h"
00118 
00119 #define INIT_DATA_h0 0x67452301UL
00120 #define INIT_DATA_h1 0xefcdab89UL
00121 #define INIT_DATA_h2 0x98badcfeUL
00122 #define INIT_DATA_h3 0x10325476UL
00123 #define INIT_DATA_h4 0xc3d2e1f0UL
00124 
00125 #if defined(SHA_0) && defined(OPENSSL_FIPS)
00126 FIPS_NON_FIPS_MD_Init(SHA)
00127 #else
00128 int HASH_INIT (SHA_CTX *c)
00129 #endif
00130         {
00131 #if defined(SHA_1) && defined(OPENSSL_FIPS)
00132         FIPS_selftest_check();
00133 #endif
00134         c->h0=INIT_DATA_h0;
00135         c->h1=INIT_DATA_h1;
00136         c->h2=INIT_DATA_h2;
00137         c->h3=INIT_DATA_h3;
00138         c->h4=INIT_DATA_h4;
00139         c->Nl=0;
00140         c->Nh=0;
00141         c->num=0;
00142         return 1;
00143         }
00144 
00145 #define K_00_19 0x5a827999UL
00146 #define K_20_39 0x6ed9eba1UL
00147 #define K_40_59 0x8f1bbcdcUL
00148 #define K_60_79 0xca62c1d6UL
00149 
00150 /* As  pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
00151  * simplified to the code in F_00_19.  Wei attributes these optimisations
00152  * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
00153  * #define F(x,y,z) (((x) & (y))  |  ((~(x)) & (z)))
00154  * I've just become aware of another tweak to be made, again from Wei Dai,
00155  * in F_40_59, (x&a)|(y&a) -> (x|y)&a
00156  */
00157 #define F_00_19(b,c,d)  ((((c) ^ (d)) & (b)) ^ (d)) 
00158 #define F_20_39(b,c,d)  ((b) ^ (c) ^ (d))
00159 #define F_40_59(b,c,d)  (((b) & (c)) | (((b)|(c)) & (d))) 
00160 #define F_60_79(b,c,d)  F_20_39(b,c,d)
00161 
00162 #ifndef OPENSSL_SMALL_FOOTPRINT
00163 
00164 #define BODY_00_15(i,a,b,c,d,e,f,xi) \
00165         (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
00166         (b)=ROTATE((b),30);
00167 
00168 #define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
00169         Xupdate(f,xi,xa,xb,xc,xd); \
00170         (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
00171         (b)=ROTATE((b),30);
00172 
00173 #define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
00174         Xupdate(f,xi,xa,xb,xc,xd); \
00175         (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
00176         (b)=ROTATE((b),30);
00177 
00178 #define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
00179         Xupdate(f,xa,xa,xb,xc,xd); \
00180         (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
00181         (b)=ROTATE((b),30);
00182 
00183 #define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
00184         Xupdate(f,xa,xa,xb,xc,xd); \
00185         (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
00186         (b)=ROTATE((b),30);
00187 
00188 #define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
00189         Xupdate(f,xa,xa,xb,xc,xd); \
00190         (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
00191         (b)=ROTATE((b),30);
00192 
00193 #ifdef X
00194 #undef X
00195 #endif
00196 #ifndef MD32_XARRAY
00197   /*
00198    * Originally X was an array. As it's automatic it's natural
00199    * to expect RISC compiler to accomodate at least part of it in
00200    * the register bank, isn't it? Unfortunately not all compilers
00201    * "find" this expectation reasonable:-( On order to make such
00202    * compilers generate better code I replace X[] with a bunch of
00203    * X0, X1, etc. See the function body below...
00204    *                                    <appro@fy.chalmers.se>
00205    */
00206 # define X(i)   XX##i
00207 #else
00208   /*
00209    * However! Some compilers (most notably HP C) get overwhelmed by
00210    * that many local variables so that we have to have the way to
00211    * fall down to the original behavior.
00212    */
00213 # define X(i)   XX[i]
00214 #endif
00215 
00216 #if !defined(SHA_1) || !defined(SHA1_ASM)
00217 static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
00218         {
00219         const unsigned char *data=p;
00220         register unsigned MD32_REG_T A,B,C,D,E,T,l;
00221 #ifndef MD32_XARRAY
00222         unsigned MD32_REG_T     XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
00223                                 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
00224 #else
00225         SHA_LONG        XX[16];
00226 #endif
00227 
00228         A=c->h0;
00229         B=c->h1;
00230         C=c->h2;
00231         D=c->h3;
00232         E=c->h4;
00233 
00234         for (;;)
00235                         {
00236         const union { long one; char little; } is_endian = {1};
00237 
00238         if (!is_endian.little && sizeof(SHA_LONG)==4 && ((size_t)p%4)==0)
00239                 {
00240                 const SHA_LONG *W=(const SHA_LONG *)data;
00241 
00242                 X( 0) = W[0];                           X( 1) = W[ 1];
00243                 BODY_00_15( 0,A,B,C,D,E,T,X( 0));       X( 2) = W[ 2];
00244                 BODY_00_15( 1,T,A,B,C,D,E,X( 1));       X( 3) = W[ 3];
00245                 BODY_00_15( 2,E,T,A,B,C,D,X( 2));       X( 4) = W[ 4];
00246                 BODY_00_15( 3,D,E,T,A,B,C,X( 3));       X( 5) = W[ 5];
00247                 BODY_00_15( 4,C,D,E,T,A,B,X( 4));       X( 6) = W[ 6];
00248                 BODY_00_15( 5,B,C,D,E,T,A,X( 5));       X( 7) = W[ 7];
00249                 BODY_00_15( 6,A,B,C,D,E,T,X( 6));       X( 8) = W[ 8];
00250                 BODY_00_15( 7,T,A,B,C,D,E,X( 7));       X( 9) = W[ 9];
00251                 BODY_00_15( 8,E,T,A,B,C,D,X( 8));       X(10) = W[10];
00252                 BODY_00_15( 9,D,E,T,A,B,C,X( 9));       X(11) = W[11];
00253                 BODY_00_15(10,C,D,E,T,A,B,X(10));       X(12) = W[12];
00254                 BODY_00_15(11,B,C,D,E,T,A,X(11));       X(13) = W[13];
00255                 BODY_00_15(12,A,B,C,D,E,T,X(12));       X(14) = W[14];
00256                 BODY_00_15(13,T,A,B,C,D,E,X(13));       X(15) = W[15];
00257                 BODY_00_15(14,E,T,A,B,C,D,X(14));
00258                 BODY_00_15(15,D,E,T,A,B,C,X(15));
00259 
00260                 data += SHA_CBLOCK;
00261                 }
00262         else
00263                 {
00264                 HOST_c2l(data,l); X( 0)=l;              HOST_c2l(data,l); X( 1)=l;
00265                 BODY_00_15( 0,A,B,C,D,E,T,X( 0));       HOST_c2l(data,l); X( 2)=l;
00266                 BODY_00_15( 1,T,A,B,C,D,E,X( 1));       HOST_c2l(data,l); X( 3)=l;
00267                 BODY_00_15( 2,E,T,A,B,C,D,X( 2));       HOST_c2l(data,l); X( 4)=l;
00268                 BODY_00_15( 3,D,E,T,A,B,C,X( 3));       HOST_c2l(data,l); X( 5)=l;
00269                 BODY_00_15( 4,C,D,E,T,A,B,X( 4));       HOST_c2l(data,l); X( 6)=l;
00270                 BODY_00_15( 5,B,C,D,E,T,A,X( 5));       HOST_c2l(data,l); X( 7)=l;
00271                 BODY_00_15( 6,A,B,C,D,E,T,X( 6));       HOST_c2l(data,l); X( 8)=l;
00272                 BODY_00_15( 7,T,A,B,C,D,E,X( 7));       HOST_c2l(data,l); X( 9)=l;
00273                 BODY_00_15( 8,E,T,A,B,C,D,X( 8));       HOST_c2l(data,l); X(10)=l;
00274                 BODY_00_15( 9,D,E,T,A,B,C,X( 9));       HOST_c2l(data,l); X(11)=l;
00275                 BODY_00_15(10,C,D,E,T,A,B,X(10));       HOST_c2l(data,l); X(12)=l;
00276                 BODY_00_15(11,B,C,D,E,T,A,X(11));       HOST_c2l(data,l); X(13)=l;
00277                 BODY_00_15(12,A,B,C,D,E,T,X(12));       HOST_c2l(data,l); X(14)=l;
00278                 BODY_00_15(13,T,A,B,C,D,E,X(13));       HOST_c2l(data,l); X(15)=l;
00279                 BODY_00_15(14,E,T,A,B,C,D,X(14));
00280                 BODY_00_15(15,D,E,T,A,B,C,X(15));
00281                 }
00282 
00283         BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
00284         BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
00285         BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
00286         BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
00287 
00288         BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
00289         BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
00290         BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
00291         BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
00292         BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
00293         BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
00294         BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
00295         BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
00296         BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
00297         BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
00298         BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
00299         BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
00300 
00301         BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
00302         BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
00303         BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
00304         BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
00305         BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
00306         BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
00307         BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
00308         BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
00309 
00310         BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
00311         BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
00312         BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
00313         BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
00314         BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
00315         BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
00316         BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
00317         BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
00318         BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
00319         BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
00320         BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
00321         BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
00322         BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
00323         BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
00324         BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
00325         BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
00326         BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
00327         BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
00328         BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
00329         BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
00330 
00331         BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
00332         BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
00333         BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
00334         BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
00335         BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
00336         BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
00337         BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
00338         BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
00339         BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
00340         BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
00341         BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
00342         BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
00343         BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
00344         BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
00345         BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
00346         BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
00347         BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
00348         BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
00349         BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
00350         BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
00351         
00352         c->h0=(c->h0+E)&0xffffffffL; 
00353         c->h1=(c->h1+T)&0xffffffffL;
00354         c->h2=(c->h2+A)&0xffffffffL;
00355         c->h3=(c->h3+B)&0xffffffffL;
00356         c->h4=(c->h4+C)&0xffffffffL;
00357 
00358         if (--num == 0) break;
00359 
00360         A=c->h0;
00361         B=c->h1;
00362         C=c->h2;
00363         D=c->h3;
00364         E=c->h4;
00365 
00366                         }
00367         }
00368 #endif
00369 
00370 #else   /* OPENSSL_SMALL_FOOTPRINT */
00371 
00372 #define BODY_00_15(xi)           do {   \
00373         T=E+K_00_19+F_00_19(B,C,D);     \
00374         E=D, D=C, C=ROTATE(B,30), B=A;  \
00375         A=ROTATE(A,5)+T+xi;         } while(0)
00376 
00377 #define BODY_16_19(xa,xb,xc,xd)  do {   \
00378         Xupdate(T,xa,xa,xb,xc,xd);      \
00379         T+=E+K_00_19+F_00_19(B,C,D);    \
00380         E=D, D=C, C=ROTATE(B,30), B=A;  \
00381         A=ROTATE(A,5)+T;            } while(0)
00382 
00383 #define BODY_20_39(xa,xb,xc,xd)  do {   \
00384         Xupdate(T,xa,xa,xb,xc,xd);      \
00385         T+=E+K_20_39+F_20_39(B,C,D);    \
00386         E=D, D=C, C=ROTATE(B,30), B=A;  \
00387         A=ROTATE(A,5)+T;            } while(0)
00388 
00389 #define BODY_40_59(xa,xb,xc,xd)  do {   \
00390         Xupdate(T,xa,xa,xb,xc,xd);      \
00391         T+=E+K_40_59+F_40_59(B,C,D);    \
00392         E=D, D=C, C=ROTATE(B,30), B=A;  \
00393         A=ROTATE(A,5)+T;            } while(0)
00394 
00395 #define BODY_60_79(xa,xb,xc,xd)  do {   \
00396         Xupdate(T,xa,xa,xb,xc,xd);      \
00397         T=E+K_60_79+F_60_79(B,C,D);     \
00398         E=D, D=C, C=ROTATE(B,30), B=A;  \
00399         A=ROTATE(A,5)+T+xa;         } while(0)
00400 
00401 #if !defined(SHA_1) || !defined(SHA1_ASM)
00402 static void HASH_BLOCK_DATA_ORDER (SHA_CTX *c, const void *p, size_t num)
00403         {
00404         const unsigned char *data=p;
00405         register unsigned MD32_REG_T A,B,C,D,E,T,l;
00406         int i;
00407         SHA_LONG        X[16];
00408 
00409         A=c->h0;
00410         B=c->h1;
00411         C=c->h2;
00412         D=c->h3;
00413         E=c->h4;
00414 
00415         for (;;)
00416                 {
00417         for (i=0;i<16;i++)
00418         { HOST_c2l(data,l); X[i]=l; BODY_00_15(X[i]); }
00419         for (i=0;i<4;i++)
00420         { BODY_16_19(X[i],       X[i+2],      X[i+8],     X[(i+13)&15]); }
00421         for (;i<24;i++)
00422         { BODY_20_39(X[i&15],    X[(i+2)&15], X[(i+8)&15],X[(i+13)&15]); }
00423         for (i=0;i<20;i++)
00424         { BODY_40_59(X[(i+8)&15],X[(i+10)&15],X[i&15],    X[(i+5)&15]);  }
00425         for (i=4;i<24;i++)
00426         { BODY_60_79(X[(i+8)&15],X[(i+10)&15],X[i&15],    X[(i+5)&15]);  }
00427 
00428         c->h0=(c->h0+A)&0xffffffffL; 
00429         c->h1=(c->h1+B)&0xffffffffL;
00430         c->h2=(c->h2+C)&0xffffffffL;
00431         c->h3=(c->h3+D)&0xffffffffL;
00432         c->h4=(c->h4+E)&0xffffffffL;
00433 
00434         if (--num == 0) break;
00435 
00436         A=c->h0;
00437         B=c->h1;
00438         C=c->h2;
00439         D=c->h3;
00440         E=c->h4;
00441 
00442                 }
00443         }
00444 #endif
00445 
00446 #endif
 Todo Clases Namespaces Archivos Funciones Variables 'typedefs' Enumeraciones Valores de enumeraciones Propiedades Amigas 'defines'