LCOV - code coverage report
Current view: top level - lib/Support - MD5.cpp (source / functions) Hit Total Coverage
Test: llvm-toolchain.info Lines: 134 135 99.3 %
Date: 2018-02-23 05:02:05 Functions: 7 7 100.0 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : /*
       2             :  * This code is derived from (original license follows):
       3             :  *
       4             :  * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.
       5             :  * MD5 Message-Digest Algorithm (RFC 1321).
       6             :  *
       7             :  * Homepage:
       8             :  * http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5
       9             :  *
      10             :  * Author:
      11             :  * Alexander Peslyak, better known as Solar Designer <solar at openwall.com>
      12             :  *
      13             :  * This software was written by Alexander Peslyak in 2001.  No copyright is
      14             :  * claimed, and the software is hereby placed in the public domain.
      15             :  * In case this attempt to disclaim copyright and place the software in the
      16             :  * public domain is deemed null and void, then the software is
      17             :  * Copyright (c) 2001 Alexander Peslyak and it is hereby released to the
      18             :  * general public under the following terms:
      19             :  *
      20             :  * Redistribution and use in source and binary forms, with or without
      21             :  * modification, are permitted.
      22             :  *
      23             :  * There's ABSOLUTELY NO WARRANTY, express or implied.
      24             :  *
      25             :  * (This is a heavily cut-down "BSD license".)
      26             :  *
      27             :  * This differs from Colin Plumb's older public domain implementation in that
      28             :  * no exactly 32-bit integer data type is required (any 32-bit or wider
      29             :  * unsigned integer data type will do), there's no compile-time endianness
      30             :  * configuration, and the function prototypes match OpenSSL's.  No code from
      31             :  * Colin Plumb's implementation has been reused; this comment merely compares
      32             :  * the properties of the two independent implementations.
      33             :  *
      34             :  * The primary goals of this implementation are portability and ease of use.
      35             :  * It is meant to be fast, but not as fast as possible.  Some known
      36             :  * optimizations are not included to reduce source code size and avoid
      37             :  * compile-time configuration.
      38             :  */
      39             : 
      40             : #include "llvm/Support/MD5.h"
      41             : #include "llvm/ADT/ArrayRef.h"
      42             : #include "llvm/ADT/StringRef.h"
      43             : #include "llvm/Support/Endian.h"
      44             : #include "llvm/Support/Format.h"
      45             : #include "llvm/Support/raw_ostream.h"
      46             : #include <array>
      47             : #include <cstdint>
      48             : #include <cstring>
      49             : 
      50             : // The basic MD5 functions.
      51             : 
      52             : // F and G are optimized compared to their RFC 1321 definitions for
      53             : // architectures that lack an AND-NOT instruction, just like in Colin Plumb's
      54             : // implementation.
      55             : #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
      56             : #define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
      57             : #define H(x, y, z) ((x) ^ (y) ^ (z))
      58             : #define I(x, y, z) ((y) ^ ((x) | ~(z)))
      59             : 
      60             : // The MD5 transformation for all four rounds.
      61             : #define STEP(f, a, b, c, d, x, t, s)                                           \
      62             :   (a) += f((b), (c), (d)) + (x) + (t);                                         \
      63             :   (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s))));                   \
      64             :   (a) += (b);
      65             : 
      66             : // SET reads 4 input bytes in little-endian byte order and stores them
      67             : // in a properly aligned word in host byte order.
      68             : #define SET(n)                                                                 \
      69             :   (block[(n)] =                                                                \
      70             :        (MD5_u32plus) ptr[(n) * 4] | ((MD5_u32plus) ptr[(n) * 4 + 1] << 8) |    \
      71             :        ((MD5_u32plus) ptr[(n) * 4 + 2] << 16) |                                \
      72             :        ((MD5_u32plus) ptr[(n) * 4 + 3] << 24))
      73             : #define GET(n) (block[(n)])
      74             : 
      75             : using namespace llvm;
      76             : 
      77             : /// \brief This processes one or more 64-byte data blocks, but does NOT update
      78             : ///the bit counters.  There are no alignment requirements.
      79       21786 : const uint8_t *MD5::body(ArrayRef<uint8_t> Data) {
      80             :   const uint8_t *ptr;
      81             :   MD5_u32plus a, b, c, d;
      82             :   MD5_u32plus saved_a, saved_b, saved_c, saved_d;
      83       21786 :   unsigned long Size = Data.size();
      84             : 
      85       21786 :   ptr = Data.data();
      86             : 
      87       21786 :   a = this->a;
      88       21786 :   b = this->b;
      89       21786 :   c = this->c;
      90       21786 :   d = this->d;
      91             : 
      92             :   do {
      93             :     saved_a = a;
      94             :     saved_b = b;
      95             :     saved_c = c;
      96             :     saved_d = d;
      97             : 
      98             :     // Round 1
      99       24120 :     STEP(F, a, b, c, d, SET(0), 0xd76aa478, 7)
     100       24120 :     STEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12)
     101       24120 :     STEP(F, c, d, a, b, SET(2), 0x242070db, 17)
     102       24120 :     STEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22)
     103       24120 :     STEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7)
     104       24120 :     STEP(F, d, a, b, c, SET(5), 0x4787c62a, 12)
     105       24120 :     STEP(F, c, d, a, b, SET(6), 0xa8304613, 17)
     106       24120 :     STEP(F, b, c, d, a, SET(7), 0xfd469501, 22)
     107       24120 :     STEP(F, a, b, c, d, SET(8), 0x698098d8, 7)
     108       24120 :     STEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12)
     109       24120 :     STEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17)
     110       24120 :     STEP(F, b, c, d, a, SET(11), 0x895cd7be, 22)
     111       24120 :     STEP(F, a, b, c, d, SET(12), 0x6b901122, 7)
     112       24120 :     STEP(F, d, a, b, c, SET(13), 0xfd987193, 12)
     113       24120 :     STEP(F, c, d, a, b, SET(14), 0xa679438e, 17)
     114       24120 :     STEP(F, b, c, d, a, SET(15), 0x49b40821, 22)
     115             : 
     116             :     // Round 2
     117       24120 :     STEP(G, a, b, c, d, GET(1), 0xf61e2562, 5)
     118       24120 :     STEP(G, d, a, b, c, GET(6), 0xc040b340, 9)
     119       24120 :     STEP(G, c, d, a, b, GET(11), 0x265e5a51, 14)
     120       24120 :     STEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20)
     121       24120 :     STEP(G, a, b, c, d, GET(5), 0xd62f105d, 5)
     122       24120 :     STEP(G, d, a, b, c, GET(10), 0x02441453, 9)
     123       24120 :     STEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14)
     124       24120 :     STEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20)
     125       24120 :     STEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5)
     126       24120 :     STEP(G, d, a, b, c, GET(14), 0xc33707d6, 9)
     127       24120 :     STEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14)
     128       24120 :     STEP(G, b, c, d, a, GET(8), 0x455a14ed, 20)
     129       24120 :     STEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5)
     130       24120 :     STEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9)
     131       24120 :     STEP(G, c, d, a, b, GET(7), 0x676f02d9, 14)
     132       24120 :     STEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20)
     133             : 
     134             :     // Round 3
     135       24120 :     STEP(H, a, b, c, d, GET(5), 0xfffa3942, 4)
     136       24120 :     STEP(H, d, a, b, c, GET(8), 0x8771f681, 11)
     137       24120 :     STEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16)
     138       24120 :     STEP(H, b, c, d, a, GET(14), 0xfde5380c, 23)
     139       24120 :     STEP(H, a, b, c, d, GET(1), 0xa4beea44, 4)
     140       24120 :     STEP(H, d, a, b, c, GET(4), 0x4bdecfa9, 11)
     141       24120 :     STEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16)
     142       24120 :     STEP(H, b, c, d, a, GET(10), 0xbebfbc70, 23)
     143       24120 :     STEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4)
     144       24120 :     STEP(H, d, a, b, c, GET(0), 0xeaa127fa, 11)
     145       24120 :     STEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16)
     146       24120 :     STEP(H, b, c, d, a, GET(6), 0x04881d05, 23)
     147       24120 :     STEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4)
     148       24120 :     STEP(H, d, a, b, c, GET(12), 0xe6db99e5, 11)
     149       24120 :     STEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16)
     150       24120 :     STEP(H, b, c, d, a, GET(2), 0xc4ac5665, 23)
     151             : 
     152             :     // Round 4
     153       24120 :     STEP(I, a, b, c, d, GET(0), 0xf4292244, 6)
     154       24120 :     STEP(I, d, a, b, c, GET(7), 0x432aff97, 10)
     155       24120 :     STEP(I, c, d, a, b, GET(14), 0xab9423a7, 15)
     156       24120 :     STEP(I, b, c, d, a, GET(5), 0xfc93a039, 21)
     157       24120 :     STEP(I, a, b, c, d, GET(12), 0x655b59c3, 6)
     158       24120 :     STEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10)
     159       24120 :     STEP(I, c, d, a, b, GET(10), 0xffeff47d, 15)
     160       24120 :     STEP(I, b, c, d, a, GET(1), 0x85845dd1, 21)
     161       24120 :     STEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6)
     162       24120 :     STEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10)
     163       24120 :     STEP(I, c, d, a, b, GET(6), 0xa3014314, 15)
     164       24120 :     STEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21)
     165       24120 :     STEP(I, a, b, c, d, GET(4), 0xf7537e82, 6)
     166       24120 :     STEP(I, d, a, b, c, GET(11), 0xbd3af235, 10)
     167       24120 :     STEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15)
     168       24120 :     STEP(I, b, c, d, a, GET(9), 0xeb86d391, 21)
     169             : 
     170       24120 :     a += saved_a;
     171       24120 :     b += saved_b;
     172       24120 :     c += saved_c;
     173       24120 :     d += saved_d;
     174             : 
     175       24120 :     ptr += 64;
     176       24120 :   } while (Size -= 64);
     177             : 
     178       21786 :   this->a = a;
     179       21786 :   this->b = b;
     180       21786 :   this->c = c;
     181       21786 :   this->d = d;
     182             : 
     183       21786 :   return ptr;
     184             : }
     185             : 
     186             : MD5::MD5() = default;
     187             : 
     188             : /// Incrementally add the bytes in \p Data to the hash.
     189       31252 : void MD5::update(ArrayRef<uint8_t> Data) {
     190             :   MD5_u32plus saved_lo;
     191             :   unsigned long used, free;
     192       31252 :   const uint8_t *Ptr = Data.data();
     193       31252 :   unsigned long Size = Data.size();
     194             : 
     195       31252 :   saved_lo = lo;
     196       31252 :   if ((lo = (saved_lo + Size) & 0x1fffffff) < saved_lo)
     197           0 :     hi++;
     198       31252 :   hi += Size >> 29;
     199             : 
     200       31252 :   used = saved_lo & 0x3f;
     201             : 
     202       31252 :   if (used) {
     203       10797 :     free = 64 - used;
     204             : 
     205       10797 :     if (Size < free) {
     206       10732 :       memcpy(&buffer[used], Ptr, Size);
     207       10732 :       return;
     208             :     }
     209             : 
     210          65 :     memcpy(&buffer[used], Ptr, free);
     211          65 :     Ptr = Ptr + free;
     212          65 :     Size -= free;
     213          65 :     body(makeArrayRef(buffer, 64));
     214             :   }
     215             : 
     216       20520 :   if (Size >= 64) {
     217        1177 :     Ptr = body(makeArrayRef(Ptr, Size & ~(unsigned long) 0x3f));
     218        1177 :     Size &= 0x3f;
     219             :   }
     220             : 
     221       20520 :   memcpy(buffer, Ptr, Size);
     222             : }
     223             : 
     224             : /// Add the bytes in the StringRef \p Str to the hash.
     225             : // Note that this isn't a string and so this won't include any trailing NULL
     226             : // bytes.
     227       28495 : void MD5::update(StringRef Str) {
     228             :   ArrayRef<uint8_t> SVal((const uint8_t *)Str.data(), Str.size());
     229       28495 :   update(SVal);
     230       28495 : }
     231             : 
     232             : /// \brief Finish the hash and place the resulting hash into \p result.
     233             : /// \param Result is assumed to be a minimum of 16-bytes in size.
     234       20456 : void MD5::final(MD5Result &Result) {
     235             :   unsigned long used, free;
     236             : 
     237       20456 :   used = lo & 0x3f;
     238             : 
     239       20456 :   buffer[used++] = 0x80;
     240             : 
     241       20456 :   free = 64 - used;
     242             : 
     243       20456 :   if (free < 8) {
     244          88 :     memset(&buffer[used], 0, free);
     245          88 :     body(makeArrayRef(buffer, 64));
     246             :     used = 0;
     247             :     free = 64;
     248             :   }
     249             : 
     250       20456 :   memset(&buffer[used], 0, free - 8);
     251             : 
     252       20456 :   lo <<= 3;
     253             :   support::endian::write32le(&buffer[56], lo);
     254       20456 :   support::endian::write32le(&buffer[60], hi);
     255             : 
     256       20456 :   body(makeArrayRef(buffer, 64));
     257             : 
     258       20456 :   support::endian::write32le(&Result[0], a);
     259       20456 :   support::endian::write32le(&Result[4], b);
     260       20456 :   support::endian::write32le(&Result[8], c);
     261       20456 :   support::endian::write32le(&Result[12], d);
     262       20456 : }
     263             : 
     264         736 : SmallString<32> MD5::MD5Result::digest() const {
     265             :   SmallString<32> Str;
     266         736 :   raw_svector_ostream Res(Str);
     267       24288 :   for (int i = 0; i < 16; ++i)
     268       23552 :     Res << format("%.2x", Bytes[i]);
     269         736 :   return Str;
     270             : }
     271             : 
     272         713 : void MD5::stringifyResult(MD5Result &Result, SmallString<32> &Str) {
     273        1426 :   Str = Result.digest();
     274         713 : }
     275             : 
     276           5 : std::array<uint8_t, 16> MD5::hash(ArrayRef<uint8_t> Data) {
     277           5 :   MD5 Hash;
     278           5 :   Hash.update(Data);
     279             :   MD5::MD5Result Res;
     280           5 :   Hash.final(Res);
     281             : 
     282           5 :   return Res;
     283             : }

Generated by: LCOV version 1.13