crypto/md5/md5_local.h

   1 /*
   2  * Copyright 1995-2022 The OpenSSL Project Authors. All Rights Reserved.
   3  *
   4  * Licensed under the Apache License 2.0 (the "License").  You may not use
   5  * this file except in compliance with the License.  You can obtain a copy
   6  * in the file LICENSE in the source distribution or at
   7  * https://www.openssl.org/source/license.html
   8  */
   9
  10 #include <stdlib.h>
  11 #include <string.h>
  12 #include <openssl/e_os2.h>
  13 #include <openssl/md5.h>
  14
  15 #ifdef MD5_ASM
  16 # if defined(__i386) || defined(__i386__) || defined(_M_IX86) || \
  17      defined(__x86_64) || defined(__x86_64__) || defined(_M_AMD64) || \
  18      defined(_M_X64) || defined(__aarch64__)
  19 #  define md5_block_data_order ossl_md5_block_asm_data_order
  20 # elif defined(__ia64) || defined(__ia64__) || defined(_M_IA64)
  21 #  define md5_block_data_order ossl_md5_block_asm_data_order
  22 # elif defined(__sparc) || defined(__sparc__)
  23 #  define md5_block_data_order ossl_md5_block_asm_data_order
  24 # endif
  25 #endif
  26
  27 void md5_block_data_order(MD5_CTX *c, const void *p, size_t num);
  28
  29 #define DATA_ORDER_IS_LITTLE_ENDIAN
  30
  31 #define HASH_LONG               MD5_LONG
  32 #define HASH_CTX                MD5_CTX
  33 #define HASH_CBLOCK             MD5_CBLOCK
  34 #define HASH_UPDATE             MD5_Update
  35 #define HASH_TRANSFORM          MD5_Transform
  36 #define HASH_FINAL              MD5_Final
  37 #define HASH_MAKE_STRING(c,s)   do {    \
  38         unsigned long ll;               \
  39         ll=(c)->A; (void)HOST_l2c(ll,(s));      \
  40         ll=(c)->B; (void)HOST_l2c(ll,(s));      \
  41         ll=(c)->C; (void)HOST_l2c(ll,(s));      \
  42         ll=(c)->D; (void)HOST_l2c(ll,(s));      \
  43         } while (0)
  44 #define HASH_BLOCK_DATA_ORDER   md5_block_data_order
  45
  46 #include "crypto/md32_common.h"
  47
  48 /*-
  49 #define F(x,y,z)        (((x) & (y))  |  ((~(x)) & (z)))
  50 #define G(x,y,z)        (((x) & (z))  |  ((y) & (~(z))))
  51 */
  52
  53 /*
  54  * As pointed out by Wei Dai, the above can be simplified to the code
  55  * below.  Wei attributes these optimizations to Peter Gutmann's
  56  * SHS code, and he attributes it to Rich Schroeppel.
  57  */
  58 #define F(b,c,d)        ((((c) ^ (d)) & (b)) ^ (d))
  59 #define G(b,c,d)        ((((b) ^ (c)) & (d)) ^ (c))
  60 #define H(b,c,d)        ((b) ^ (c) ^ (d))
  61 #define I(b,c,d)        (((~(d)) | (b)) ^ (c))
  62
  63 #define R0(a,b,c,d,k,s,t) { \
  64         a+=((k)+(t)+F((b),(c),(d))); \
  65         a=ROTATE(a,s); \
  66         a+=b; };
  67
  68 #define R1(a,b,c,d,k,s,t) { \
  69         a+=((k)+(t)+G((b),(c),(d))); \
  70         a=ROTATE(a,s); \
  71         a+=b; };
  72
  73 #define R2(a,b,c,d,k,s,t) { \
  74         a+=((k)+(t)+H((b),(c),(d))); \
  75         a=ROTATE(a,s); \
  76         a+=b; };
  77
  78 #define R3(a,b,c,d,k,s,t) { \
  79         a+=((k)+(t)+I((b),(c),(d))); \
  80         a=ROTATE(a,s); \
  81         a+=b; };