crypto/md32_common.h

   1 /* crypto/md32_common.h */
   2 /* ====================================================================
   3  * Copyright (c) 1999-2002 The OpenSSL Project.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  *
   9  * 1. Redistributions of source code must retain the above copyright
  10  *    notice, this list of conditions and the following disclaimer.
  11  *
  12  * 2. Redistributions in binary form must reproduce the above copyright
  13  *    notice, this list of conditions and the following disclaimer in
  14  *    the documentation and/or other materials provided with the
  15  *    distribution.
  16  *
  17  * 3. All advertising materials mentioning features or use of this
  18  *    software must display the following acknowledgment:
  19  *    "This product includes software developed by the OpenSSL Project
  20  *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
  21  *
  22  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  23  *    endorse or promote products derived from this software without
  24  *    prior written permission. For written permission, please contact
  25  *    licensing@OpenSSL.org.
  26  *
  27  * 5. Products derived from this software may not be called "OpenSSL"
  28  *    nor may "OpenSSL" appear in their names without prior written
  29  *    permission of the OpenSSL Project.
  30  *
  31  * 6. Redistributions of any form whatsoever must retain the following
  32  *    acknowledgment:
  33  *    "This product includes software developed by the OpenSSL Project
  34  *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
  35  *
  36  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  37  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  38  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  39  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
  40  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  41  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  42  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  43  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  44  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  45  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  46  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  47  * OF THE POSSIBILITY OF SUCH DAMAGE.
  48  * ====================================================================
  49  *
  50  * This product includes cryptographic software written by Eric Young
  51  * (eay@cryptsoft.com).  This product includes software written by Tim
  52  * Hudson (tjh@cryptsoft.com).
  53  *
  54  */
  55
  56 /*
  57  * This is a generic 32 bit "collector" for message digest algorithms.
  58  * Whenever needed it collects input character stream into chunks of
  59  * 32 bit values and invokes a block function that performs actual hash
  60  * calculations.
  61  *
  62  * Porting guide.
  63  *
  64  * Obligatory macros:
  65  *
  66  * DATA_ORDER_IS_BIG_ENDIAN or DATA_ORDER_IS_LITTLE_ENDIAN
  67  *      this macro defines byte order of input stream.
  68  * HASH_CBLOCK
  69  *      size of a unit chunk HASH_BLOCK operates on.
  70  * HASH_LONG
  71  *      has to be at lest 32 bit wide, if it's wider, then
  72  *      HASH_LONG_LOG2 *has to* be defined along
  73  * HASH_CTX
  74  *      context structure that at least contains following
  75  *      members:
  76  *              typedef struct {
  77  *                      ...
  78  *                      HASH_LONG       Nl,Nh;
  79  *                      HASH_LONG       data[HASH_LBLOCK];
  80  *                      int             num;
  81  *                      ...
  82  *                      } HASH_CTX;
  83  * HASH_UPDATE
  84  *      name of "Update" function, implemented here.
  85  * HASH_TRANSFORM
  86  *      name of "Transform" function, implemented here.
  87  * HASH_FINAL
  88  *      name of "Final" function, implemented here.
  89  * HASH_BLOCK_HOST_ORDER
  90  *      name of "block" function treating *aligned* input message
  91  *      in host byte order, implemented externally.
  92  * HASH_BLOCK_DATA_ORDER
  93  *      name of "block" function treating *unaligned* input message
  94  *      in original (data) byte order, implemented externally (it
  95  *      actually is optional if data and host are of the same
  96  *      "endianess").
  97  * HASH_MAKE_STRING
  98  *      macro convering context variables to an ASCII hash string.
  99  *
 100  * Optional macros:
 101  *
 102  * B_ENDIAN or L_ENDIAN
 103  *      defines host byte-order.
 104  * HASH_LONG_LOG2
 105  *      defaults to 2 if not states otherwise.
 106  * HASH_LBLOCK
 107  *      assumed to be HASH_CBLOCK/4 if not stated otherwise.
 108  * HASH_BLOCK_DATA_ORDER_ALIGNED
 109  *      alternative "block" function capable of treating
 110  *      aligned input message in original (data) order,
 111  *      implemented externally.
 112  *
 113  * MD5 example:
 114  *
 115  *      #define DATA_ORDER_IS_LITTLE_ENDIAN
 116  *
 117  *      #define HASH_LONG               MD5_LONG
 118  *      #define HASH_LONG_LOG2          MD5_LONG_LOG2
 119  *      #define HASH_CTX                MD5_CTX
 120  *      #define HASH_CBLOCK             MD5_CBLOCK
 121  *      #define HASH_LBLOCK             MD5_LBLOCK
 122  *      #define HASH_UPDATE             MD5_Update
 123  *      #define HASH_TRANSFORM          MD5_Transform
 124  *      #define HASH_FINAL              MD5_Final
 125  *      #define HASH_BLOCK_HOST_ORDER   md5_block_host_order
 126  *      #define HASH_BLOCK_DATA_ORDER   md5_block_data_order
 127  *
 128  *                                      <appro@fy.chalmers.se>
 129  */
 130
 131 #if !defined(DATA_ORDER_IS_BIG_ENDIAN) && !defined(DATA_ORDER_IS_LITTLE_ENDIAN)
 132 #error "DATA_ORDER must be defined!"
 133 #endif
 134
 135 #ifndef HASH_CBLOCK
 136 #error "HASH_CBLOCK must be defined!"
 137 #endif
 138 #ifndef HASH_LONG
 139 #error "HASH_LONG must be defined!"
 140 #endif
 141 #ifndef HASH_CTX
 142 #error "HASH_CTX must be defined!"
 143 #endif
 144
 145 #ifndef HASH_UPDATE
 146 #error "HASH_UPDATE must be defined!"
 147 #endif
 148 #ifndef HASH_TRANSFORM
 149 #error "HASH_TRANSFORM must be defined!"
 150 #endif
 151 #ifndef HASH_FINAL
 152 #error "HASH_FINAL must be defined!"
 153 #endif
 154
 155 #ifndef HASH_BLOCK_HOST_ORDER
 156 #error "HASH_BLOCK_HOST_ORDER must be defined!"
 157 #endif
 158
 159 #if 0
 160 /*
 161  * Moved below as it's required only if HASH_BLOCK_DATA_ORDER_ALIGNED
 162  * isn't defined.
 163  */
 164 #ifndef HASH_BLOCK_DATA_ORDER
 165 #error "HASH_BLOCK_DATA_ORDER must be defined!"
 166 #endif
 167 #endif
 168
 169 #ifndef HASH_LBLOCK
 170 #define HASH_LBLOCK     (HASH_CBLOCK/4)
 171 #endif
 172
 173 #ifndef HASH_LONG_LOG2
 174 #define HASH_LONG_LOG2  2
 175 #endif
 176
 177 /*
 178  * Engage compiler specific rotate intrinsic function if available.
 179  */
 180 #undef ROTATE
 181 #ifndef PEDANTIC
 182 # if 0 /* defined(_MSC_VER) */
 183 #  define ROTATE(a,n)   _lrotl(a,n)
 184 # elif defined(__MWERKS__)
 185 #  if defined(__POWERPC__)
 186 #   define ROTATE(a,n)  __rlwinm(a,n,0,31)
 187 #  elif defined(OPENSSL_SYSNAME_NETWARE)
 188 #   define ROTATE(a,n)  _lrotl(a,n)
 189 #  elif defined(__MC68K__)
 190     /* Motorola specific tweak. <appro@fy.chalmers.se> */
 191 #   define ROTATE(a,n)  ( n<24 ? __rol(a,n) : __ror(a,32-n) )
 192 #  else
 193 #   define ROTATE(a,n)  __rol(a,n)
 194 #  endif
 195 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
 196   /*
 197    * Some GNU C inline assembler templates. Note that these are
 198    * rotates by *constant* number of bits! But that's exactly
 199    * what we need here...
 200    *
 201    *                                    <appro@fy.chalmers.se>
 202    */
 203 #  if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
 204 #   define ROTATE(a,n)  ({ register unsigned int ret;   \
 205                                 asm (                   \
 206                                 "roll %1,%0"            \
 207                                 : "=r"(ret)             \
 208                                 : "I"(n), "0"(a)        \
 209                                 : "cc");                \
 210                            ret;                         \
 211                         })
 212 #  elif defined(__powerpc) || defined(__ppc)
 213 #   define ROTATE(a,n)  ({ register unsigned int ret;   \
 214                                 asm (                   \
 215                                 "rlwinm %0,%1,%2,0,31"  \
 216                                 : "=r"(ret)             \
 217                                 : "r"(a), "I"(n));      \
 218                            ret;                         \
 219                         })
 220 #  endif
 221 # endif
 222
 223 /*
 224  * Engage compiler specific "fetch in reverse byte order"
 225  * intrinsic function if available.
 226  */
 227 # if defined(__GNUC__) && __GNUC__>=2 && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM)
 228   /* some GNU C inline assembler templates by <appro@fy.chalmers.se> */
 229 #  if (defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)) && !defined(I386_ONLY)
 230 #   define BE_FETCH32(a)        ({ register unsigned int l=(a);\
 231                                 asm (                   \
 232                                 "bswapl %0"             \
 233                                 : "=r"(l) : "0"(l));    \
 234                           l;                            \
 235                         })
 236 #  elif defined(__powerpc)
 237 #   define LE_FETCH32(a)        ({ register unsigned int l;     \
 238                                 asm (                   \
 239                                 "lwbrx %0,0,%1"         \
 240                                 : "=r"(l)               \
 241                                 : "r"(a));              \
 242                            l;                           \
 243                         })
 244
 245 #  elif defined(__sparc) && defined(OPENSSL_SYS_ULTRASPARC)
 246 #  define LE_FETCH32(a) ({ register unsigned int l;             \
 247                                 asm (                           \
 248                                 "lda [%1]#ASI_PRIMARY_LITTLE,%0"\
 249                                 : "=r"(l)                       \
 250                                 : "r"(a));                      \
 251                            l;                                   \
 252                         })
 253 #  endif
 254 # endif
 255 #endif /* PEDANTIC */
 256
 257 #if HASH_LONG_LOG2==2   /* Engage only if sizeof(HASH_LONG)== 4 */
 258 /* A nice byte order reversal from Wei Dai <weidai@eskimo.com> */
 259 #ifdef ROTATE
 260 /* 5 instructions with rotate instruction, else 9 */
 261 #define REVERSE_FETCH32(a,l)    (                                       \
 262                 l=*(const HASH_LONG *)(a),                              \
 263                 ((ROTATE(l,8)&0x00FF00FF)|(ROTATE((l&0x00FF00FF),24)))  \
 264                                 )
 265 #else
 266 /* 6 instructions with rotate instruction, else 8 */
 267 #define REVERSE_FETCH32(a,l)    (                               \
 268                 l=*(const HASH_LONG *)(a),                      \
 269                 l=(((l>>8)&0x00FF00FF)|((l&0x00FF00FF)<<8)),    \
 270                 ROTATE(l,16)                                    \
 271                                 )
 272 /*
 273  * Originally the middle line started with l=(((l&0xFF00FF00)>>8)|...
 274  * It's rewritten as above for two reasons:
 275  *      - RISCs aren't good at long constants and have to explicitely
 276  *        compose 'em with several (well, usually 2) instructions in a
 277  *        register before performing the actual operation and (as you
 278  *        already realized:-) having same constant should inspire the
 279  *        compiler to permanently allocate the only register for it;
 280  *      - most modern CPUs have two ALUs, but usually only one has
 281  *        circuitry for shifts:-( this minor tweak inspires compiler
 282  *        to schedule shift instructions in a better way...
 283  *
 284  *                              <appro@fy.chalmers.se>
 285  */
 286 #endif
 287 #endif
 288
 289 #ifndef ROTATE
 290 #define ROTATE(a,n)     (((a)<<(n))|(((a)&0xffffffff)>>(32-(n))))
 291 #endif
 292
 293 /*
 294  * Make some obvious choices. E.g., HASH_BLOCK_DATA_ORDER_ALIGNED
 295  * and HASH_BLOCK_HOST_ORDER ought to be the same if input data
 296  * and host are of the same "endianess". It's possible to mask
 297  * this with blank #define HASH_BLOCK_DATA_ORDER though...
 298  *
 299  *                              <appro@fy.chalmers.se>
 300  */
 301 #if defined(B_ENDIAN)
 302 #  if defined(DATA_ORDER_IS_BIG_ENDIAN)
 303 #    if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
 304 #      define HASH_BLOCK_DATA_ORDER_ALIGNED     HASH_BLOCK_HOST_ORDER
 305 #    endif
 306 #  elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
 307 #    ifndef HOST_FETCH32
 308 #      ifdef LE_FETCH32
 309 #        define HOST_FETCH32(p,l)       LE_FETCH32(p)
 310 #      elif defined(REVERSE_FETCH32)
 311 #        define HOST_FETCH32(p,l)       REVERSE_FETCH32(p,l)
 312 #      endif
 313 #    endif
 314 #  endif
 315 #elif defined(L_ENDIAN)
 316 #  if defined(DATA_ORDER_IS_LITTLE_ENDIAN)
 317 #    if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED) && HASH_LONG_LOG2==2
 318 #      define HASH_BLOCK_DATA_ORDER_ALIGNED     HASH_BLOCK_HOST_ORDER
 319 #    endif
 320 #  elif defined(DATA_ORDER_IS_BIG_ENDIAN)
 321 #    ifndef HOST_FETCH32
 322 #      ifdef BE_FETCH32
 323 #        define HOST_FETCH32(p,l)       BE_FETCH32(p)
 324 #      elif defined(REVERSE_FETCH32)
 325 #        define HOST_FETCH32(p,l)       REVERSE_FETCH32(p,l)
 326 #      endif
 327 #    endif
 328 #  endif
 329 #endif
 330
 331 #if !defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
 332 #ifndef HASH_BLOCK_DATA_ORDER
 333 #error "HASH_BLOCK_DATA_ORDER must be defined!"
 334 #endif
 335 #endif
 336
 337 #if defined(DATA_ORDER_IS_BIG_ENDIAN)
 338
 339 #define HOST_c2l(c,l)   (l =(((unsigned long)(*((c)++)))<<24),          \
 340                          l|=(((unsigned long)(*((c)++)))<<16),          \
 341                          l|=(((unsigned long)(*((c)++)))<< 8),          \
 342                          l|=(((unsigned long)(*((c)++)))    ),          \
 343                          l)
 344 #define HOST_p_c2l(c,l,n)       {                                       \
 345                         switch (n) {                                    \
 346                         case 0: l =((unsigned long)(*((c)++)))<<24;     \
 347                         case 1: l|=((unsigned long)(*((c)++)))<<16;     \
 348                         case 2: l|=((unsigned long)(*((c)++)))<< 8;     \
 349                         case 3: l|=((unsigned long)(*((c)++)));         \
 350                                 } }
 351 #define HOST_p_c2l_p(c,l,sc,len) {                                      \
 352                         switch (sc) {                                   \
 353                         case 0: l =((unsigned long)(*((c)++)))<<24;     \
 354                                 if (--len == 0) break;                  \
 355                         case 1: l|=((unsigned long)(*((c)++)))<<16;     \
 356                                 if (--len == 0) break;                  \
 357                         case 2: l|=((unsigned long)(*((c)++)))<< 8;     \
 358                                 } }
 359 /* NOTE the pointer is not incremented at the end of this */
 360 #define HOST_c2l_p(c,l,n)       {                                       \
 361                         l=0; (c)+=n;                                    \
 362                         switch (n) {                                    \
 363                         case 3: l =((unsigned long)(*(--(c))))<< 8;     \
 364                         case 2: l|=((unsigned long)(*(--(c))))<<16;     \
 365                         case 1: l|=((unsigned long)(*(--(c))))<<24;     \
 366                                 } }
 367 #define HOST_l2c(l,c)   (*((c)++)=(unsigned char)(((l)>>24)&0xff),      \
 368                          *((c)++)=(unsigned char)(((l)>>16)&0xff),      \
 369                          *((c)++)=(unsigned char)(((l)>> 8)&0xff),      \
 370                          *((c)++)=(unsigned char)(((l)    )&0xff),      \
 371                          l)
 372
 373 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
 374
 375 #define HOST_c2l(c,l)   (l =(((unsigned long)(*((c)++)))    ),          \
 376                          l|=(((unsigned long)(*((c)++)))<< 8),          \
 377                          l|=(((unsigned long)(*((c)++)))<<16),          \
 378                          l|=(((unsigned long)(*((c)++)))<<24),          \
 379                          l)
 380 #define HOST_p_c2l(c,l,n)       {                                       \
 381                         switch (n) {                                    \
 382                         case 0: l =((unsigned long)(*((c)++)));         \
 383                         case 1: l|=((unsigned long)(*((c)++)))<< 8;     \
 384                         case 2: l|=((unsigned long)(*((c)++)))<<16;     \
 385                         case 3: l|=((unsigned long)(*((c)++)))<<24;     \
 386                                 } }
 387 #define HOST_p_c2l_p(c,l,sc,len) {                                      \
 388                         switch (sc) {                                   \
 389                         case 0: l =((unsigned long)(*((c)++)));         \
 390                                 if (--len == 0) break;                  \
 391                         case 1: l|=((unsigned long)(*((c)++)))<< 8;     \
 392                                 if (--len == 0) break;                  \
 393                         case 2: l|=((unsigned long)(*((c)++)))<<16;     \
 394                                 } }
 395 /* NOTE the pointer is not incremented at the end of this */
 396 #define HOST_c2l_p(c,l,n)       {                                       \
 397                         l=0; (c)+=n;                                    \
 398                         switch (n) {                                    \
 399                         case 3: l =((unsigned long)(*(--(c))))<<16;     \
 400                         case 2: l|=((unsigned long)(*(--(c))))<< 8;     \
 401                         case 1: l|=((unsigned long)(*(--(c))));         \
 402                                 } }
 403 #define HOST_l2c(l,c)   (*((c)++)=(unsigned char)(((l)    )&0xff),      \
 404                          *((c)++)=(unsigned char)(((l)>> 8)&0xff),      \
 405                          *((c)++)=(unsigned char)(((l)>>16)&0xff),      \
 406                          *((c)++)=(unsigned char)(((l)>>24)&0xff),      \
 407                          l)
 408
 409 #endif
 410
 411 /*
 412  * Time for some action:-)
 413  */
 414
 415 int HASH_UPDATE (HASH_CTX *c, const void *data_, unsigned long len)
 416         {
 417         const unsigned char *data=data_;
 418         register HASH_LONG * p;
 419         register unsigned long l;
 420         int sw,sc,ew,ec;
 421
 422         if (len==0) return 1;
 423
 424         l=(c->Nl+(len<<3))&0xffffffffL;
 425         /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
 426          * Wei Dai <weidai@eskimo.com> for pointing it out. */
 427         if (l < c->Nl) /* overflow */
 428                 c->Nh++;
 429         c->Nh+=(len>>29);
 430         c->Nl=l;
 431
 432         if (c->num != 0)
 433                 {
 434                 p=c->data;
 435                 sw=c->num>>2;
 436                 sc=c->num&0x03;
 437
 438                 if ((c->num+len) >= HASH_CBLOCK)
 439                         {
 440                         l=p[sw]; HOST_p_c2l(data,l,sc); p[sw++]=l;
 441                         for (; sw<HASH_LBLOCK; sw++)
 442                                 {
 443                                 HOST_c2l(data,l); p[sw]=l;
 444                                 }
 445                         HASH_BLOCK_HOST_ORDER (c,p,1);
 446                         len-=(HASH_CBLOCK-c->num);
 447                         c->num=0;
 448                         /* drop through and do the rest */
 449                         }
 450                 else
 451                         {
 452                         c->num+=len;
 453                         if ((sc+len) < 4) /* ugly, add char's to a word */
 454                                 {
 455                                 l=p[sw]; HOST_p_c2l_p(data,l,sc,len); p[sw]=l;
 456                                 }
 457                         else
 458                                 {
 459                                 ew=(c->num>>2);
 460                                 ec=(c->num&0x03);
 461                                 if (sc)
 462                                         l=p[sw];
 463                                 HOST_p_c2l(data,l,sc);
 464                                 p[sw++]=l;
 465                                 for (; sw < ew; sw++)
 466                                         {
 467                                         HOST_c2l(data,l); p[sw]=l;
 468                                         }
 469                                 if (ec)
 470                                         {
 471                                         HOST_c2l_p(data,l,ec); p[sw]=l;
 472                                         }
 473                                 }
 474                         return 1;
 475                         }
 476                 }
 477
 478         sw=len/HASH_CBLOCK;
 479         if (sw > 0)
 480                 {
 481 #if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
 482                 /*
 483                  * Note that HASH_BLOCK_DATA_ORDER_ALIGNED gets defined
 484                  * only if sizeof(HASH_LONG)==4.
 485                  */
 486                 if ((((unsigned long)data)%4) == 0)
 487                         {
 488                         /* data is properly aligned so that we can cast it: */
 489                         HASH_BLOCK_DATA_ORDER_ALIGNED (c,(const HASH_LONG *)data,sw);
 490                         sw*=HASH_CBLOCK;
 491                         data+=sw;
 492                         len-=sw;
 493                         }
 494                 else
 495 #if !defined(HASH_BLOCK_DATA_ORDER)
 496                         while (sw--)
 497                                 {
 498                                 memcpy (p=c->data,data,HASH_CBLOCK);
 499                                 HASH_BLOCK_DATA_ORDER_ALIGNED(c,p,1);
 500                                 data+=HASH_CBLOCK;
 501                                 len-=HASH_CBLOCK;
 502                                 }
 503 #endif
 504 #endif
 505 #if defined(HASH_BLOCK_DATA_ORDER)
 506                         {
 507                         HASH_BLOCK_DATA_ORDER(c,data,sw);
 508                         sw*=HASH_CBLOCK;
 509                         data+=sw;
 510                         len-=sw;
 511                         }
 512 #endif
 513                 }
 514
 515         if (len!=0)
 516                 {
 517                 p = c->data;
 518                 c->num = len;
 519                 ew=len>>2;      /* words to copy */
 520                 ec=len&0x03;
 521                 for (; ew; ew--,p++)
 522                         {
 523                         HOST_c2l(data,l); *p=l;
 524                         }
 525                 HOST_c2l_p(data,l,ec);
 526                 *p=l;
 527                 }
 528         return 1;
 529         }
 530
 531
 532 void HASH_TRANSFORM (HASH_CTX *c, const unsigned char *data)
 533         {
 534 #if defined(HASH_BLOCK_DATA_ORDER_ALIGNED)
 535         if ((((unsigned long)data)%4) == 0)
 536                 /* data is properly aligned so that we can cast it: */
 537                 HASH_BLOCK_DATA_ORDER_ALIGNED (c,(const HASH_LONG *)data,1);
 538         else
 539 #if !defined(HASH_BLOCK_DATA_ORDER)
 540                 {
 541                 memcpy (c->data,data,HASH_CBLOCK);
 542                 HASH_BLOCK_DATA_ORDER_ALIGNED (c,c->data,1);
 543                 }
 544 #endif
 545 #endif
 546 #if defined(HASH_BLOCK_DATA_ORDER)
 547         HASH_BLOCK_DATA_ORDER (c,data,1);
 548 #endif
 549         }
 550
 551
 552 int HASH_FINAL (unsigned char *md, HASH_CTX *c)
 553         {
 554         register HASH_LONG *p;
 555         register unsigned long l;
 556         register int i,j;
 557         static const unsigned char end[4]={0x80,0x00,0x00,0x00};
 558         const unsigned char *cp=end;
 559
 560         /* c->num should definitly have room for at least one more byte. */
 561         p=c->data;
 562         i=c->num>>2;
 563         j=c->num&0x03;
 564
 565 #if 0
 566         /* purify often complains about the following line as an
 567          * Uninitialized Memory Read.  While this can be true, the
 568          * following p_c2l macro will reset l when that case is true.
 569          * This is because j&0x03 contains the number of 'valid' bytes
 570          * already in p[i].  If and only if j&0x03 == 0, the UMR will
 571          * occur but this is also the only time p_c2l will do
 572          * l= *(cp++) instead of l|= *(cp++)
 573          * Many thanks to Alex Tang <altitude@cic.net> for pickup this
 574          * 'potential bug' */
 575 #ifdef PURIFY
 576         if (j==0) p[i]=0; /* Yeah, but that's not the way to fix it:-) */
 577 #endif
 578         l=p[i];
 579 #else
 580         l = (j==0) ? 0 : p[i];
 581 #endif
 582         HOST_p_c2l(cp,l,j); p[i++]=l; /* i is the next 'undefined word' */
 583
 584         if (i>(HASH_LBLOCK-2)) /* save room for Nl and Nh */
 585                 {
 586                 if (i<HASH_LBLOCK) p[i]=0;
 587                 HASH_BLOCK_HOST_ORDER (c,p,1);
 588                 i=0;
 589                 }
 590         for (; i<(HASH_LBLOCK-2); i++)
 591                 p[i]=0;
 592
 593 #if   defined(DATA_ORDER_IS_BIG_ENDIAN)
 594         p[HASH_LBLOCK-2]=c->Nh;
 595         p[HASH_LBLOCK-1]=c->Nl;
 596 #elif defined(DATA_ORDER_IS_LITTLE_ENDIAN)
 597         p[HASH_LBLOCK-2]=c->Nl;
 598         p[HASH_LBLOCK-1]=c->Nh;
 599 #endif
 600         HASH_BLOCK_HOST_ORDER (c,p,1);
 601
 602 #ifndef HASH_MAKE_STRING
 603 #error "HASH_MAKE_STRING must be defined!"
 604 #else
 605         HASH_MAKE_STRING(c,md);
 606 #endif
 607
 608         c->num=0;
 609         /* clear stuff, HASH_BLOCK may be leaving some stuff on the stack
 610          * but I'm not worried :-)
 611         OPENSSL_cleanse((void *)c,sizeof(HASH_CTX));
 612          */
 613         return 1;
 614         }
 615
 616 #ifndef MD32_REG_T
 617 #define MD32_REG_T long
 618 /*
 619  * This comment was originaly written for MD5, which is why it
 620  * discusses A-D. But it basically applies to all 32-bit digests,
 621  * which is why it was moved to common header file.
 622  *
 623  * In case you wonder why A-D are declared as long and not
 624  * as MD5_LONG. Doing so results in slight performance
 625  * boost on LP64 architectures. The catch is we don't
 626  * really care if 32 MSBs of a 64-bit register get polluted
 627  * with eventual overflows as we *save* only 32 LSBs in
 628  * *either* case. Now declaring 'em long excuses the compiler
 629  * from keeping 32 MSBs zeroed resulting in 13% performance
 630  * improvement under SPARC Solaris7/64 and 5% under AlphaLinux.
 631  * Well, to be honest it should say that this *prevents*
 632  * performance degradation.
 633  *                              <appro@fy.chalmers.se>
 634  * Apparently there're LP64 compilers that generate better
 635  * code if A-D are declared int. Most notably GCC-x86_64
 636  * generates better code.
 637  *                              <appro@fy.chalmers.se>
 638  */
 639 #endif