Coverage Report

Created: 2018-08-29 13:53

/src/openssl/crypto/md5/md5_dgst.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
3
 *
4
 * Licensed under the OpenSSL license (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 <stdio.h>
11
#include "md5_locl.h"
12
#include <openssl/opensslv.h>
13
14
/*
15
 * Implemented from RFC1321 The MD5 Message-Digest Algorithm
16
 */
17
18
0
#define INIT_DATA_A (unsigned long)0x67452301L
19
0
#define INIT_DATA_B (unsigned long)0xefcdab89L
20
0
#define INIT_DATA_C (unsigned long)0x98badcfeL
21
0
#define INIT_DATA_D (unsigned long)0x10325476L
22
23
int MD5_Init(MD5_CTX *c)
24
0
{
25
0
    memset(c, 0, sizeof(*c));
26
0
    c->A = INIT_DATA_A;
27
0
    c->B = INIT_DATA_B;
28
0
    c->C = INIT_DATA_C;
29
0
    c->D = INIT_DATA_D;
30
0
    return 1;
31
0
}
32
33
#ifndef md5_block_data_order
34
# ifdef X
35
#  undef X
36
# endif
37
void md5_block_data_order(MD5_CTX *c, const void *data_, size_t num)
38
{
39
    const unsigned char *data = data_;
40
    register unsigned MD32_REG_T A, B, C, D, l;
41
# ifndef MD32_XARRAY
42
    /* See comment in crypto/sha/sha_locl.h for details. */
43
    unsigned MD32_REG_T XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
44
        XX8, XX9, XX10, XX11, XX12, XX13, XX14, XX15;
45
#  define X(i)   XX##i
46
# else
47
    MD5_LONG XX[MD5_LBLOCK];
48
#  define X(i)   XX[i]
49
# endif
50
51
    A = c->A;
52
    B = c->B;
53
    C = c->C;
54
    D = c->D;
55
56
    for (; num--;) {
57
        (void)HOST_c2l(data, l);
58
        X(0) = l;
59
        (void)HOST_c2l(data, l);
60
        X(1) = l;
61
        /* Round 0 */
62
        R0(A, B, C, D, X(0), 7, 0xd76aa478L);
63
        (void)HOST_c2l(data, l);
64
        X(2) = l;
65
        R0(D, A, B, C, X(1), 12, 0xe8c7b756L);
66
        (void)HOST_c2l(data, l);
67
        X(3) = l;
68
        R0(C, D, A, B, X(2), 17, 0x242070dbL);
69
        (void)HOST_c2l(data, l);
70
        X(4) = l;
71
        R0(B, C, D, A, X(3), 22, 0xc1bdceeeL);
72
        (void)HOST_c2l(data, l);
73
        X(5) = l;
74
        R0(A, B, C, D, X(4), 7, 0xf57c0fafL);
75
        (void)HOST_c2l(data, l);
76
        X(6) = l;
77
        R0(D, A, B, C, X(5), 12, 0x4787c62aL);
78
        (void)HOST_c2l(data, l);
79
        X(7) = l;
80
        R0(C, D, A, B, X(6), 17, 0xa8304613L);
81
        (void)HOST_c2l(data, l);
82
        X(8) = l;
83
        R0(B, C, D, A, X(7), 22, 0xfd469501L);
84
        (void)HOST_c2l(data, l);
85
        X(9) = l;
86
        R0(A, B, C, D, X(8), 7, 0x698098d8L);
87
        (void)HOST_c2l(data, l);
88
        X(10) = l;
89
        R0(D, A, B, C, X(9), 12, 0x8b44f7afL);
90
        (void)HOST_c2l(data, l);
91
        X(11) = l;
92
        R0(C, D, A, B, X(10), 17, 0xffff5bb1L);
93
        (void)HOST_c2l(data, l);
94
        X(12) = l;
95
        R0(B, C, D, A, X(11), 22, 0x895cd7beL);
96
        (void)HOST_c2l(data, l);
97
        X(13) = l;
98
        R0(A, B, C, D, X(12), 7, 0x6b901122L);
99
        (void)HOST_c2l(data, l);
100
        X(14) = l;
101
        R0(D, A, B, C, X(13), 12, 0xfd987193L);
102
        (void)HOST_c2l(data, l);
103
        X(15) = l;
104
        R0(C, D, A, B, X(14), 17, 0xa679438eL);
105
        R0(B, C, D, A, X(15), 22, 0x49b40821L);
106
        /* Round 1 */
107
        R1(A, B, C, D, X(1), 5, 0xf61e2562L);
108
        R1(D, A, B, C, X(6), 9, 0xc040b340L);
109
        R1(C, D, A, B, X(11), 14, 0x265e5a51L);
110
        R1(B, C, D, A, X(0), 20, 0xe9b6c7aaL);
111
        R1(A, B, C, D, X(5), 5, 0xd62f105dL);
112
        R1(D, A, B, C, X(10), 9, 0x02441453L);
113
        R1(C, D, A, B, X(15), 14, 0xd8a1e681L);
114
        R1(B, C, D, A, X(4), 20, 0xe7d3fbc8L);
115
        R1(A, B, C, D, X(9), 5, 0x21e1cde6L);
116
        R1(D, A, B, C, X(14), 9, 0xc33707d6L);
117
        R1(C, D, A, B, X(3), 14, 0xf4d50d87L);
118
        R1(B, C, D, A, X(8), 20, 0x455a14edL);
119
        R1(A, B, C, D, X(13), 5, 0xa9e3e905L);
120
        R1(D, A, B, C, X(2), 9, 0xfcefa3f8L);
121
        R1(C, D, A, B, X(7), 14, 0x676f02d9L);
122
        R1(B, C, D, A, X(12), 20, 0x8d2a4c8aL);
123
        /* Round 2 */
124
        R2(A, B, C, D, X(5), 4, 0xfffa3942L);
125
        R2(D, A, B, C, X(8), 11, 0x8771f681L);
126
        R2(C, D, A, B, X(11), 16, 0x6d9d6122L);
127
        R2(B, C, D, A, X(14), 23, 0xfde5380cL);
128
        R2(A, B, C, D, X(1), 4, 0xa4beea44L);
129
        R2(D, A, B, C, X(4), 11, 0x4bdecfa9L);
130
        R2(C, D, A, B, X(7), 16, 0xf6bb4b60L);
131
        R2(B, C, D, A, X(10), 23, 0xbebfbc70L);
132
        R2(A, B, C, D, X(13), 4, 0x289b7ec6L);
133
        R2(D, A, B, C, X(0), 11, 0xeaa127faL);
134
        R2(C, D, A, B, X(3), 16, 0xd4ef3085L);
135
        R2(B, C, D, A, X(6), 23, 0x04881d05L);
136
        R2(A, B, C, D, X(9), 4, 0xd9d4d039L);
137
        R2(D, A, B, C, X(12), 11, 0xe6db99e5L);
138
        R2(C, D, A, B, X(15), 16, 0x1fa27cf8L);
139
        R2(B, C, D, A, X(2), 23, 0xc4ac5665L);
140
        /* Round 3 */
141
        R3(A, B, C, D, X(0), 6, 0xf4292244L);
142
        R3(D, A, B, C, X(7), 10, 0x432aff97L);
143
        R3(C, D, A, B, X(14), 15, 0xab9423a7L);
144
        R3(B, C, D, A, X(5), 21, 0xfc93a039L);
145
        R3(A, B, C, D, X(12), 6, 0x655b59c3L);
146
        R3(D, A, B, C, X(3), 10, 0x8f0ccc92L);
147
        R3(C, D, A, B, X(10), 15, 0xffeff47dL);
148
        R3(B, C, D, A, X(1), 21, 0x85845dd1L);
149
        R3(A, B, C, D, X(8), 6, 0x6fa87e4fL);
150
        R3(D, A, B, C, X(15), 10, 0xfe2ce6e0L);
151
        R3(C, D, A, B, X(6), 15, 0xa3014314L);
152
        R3(B, C, D, A, X(13), 21, 0x4e0811a1L);
153
        R3(A, B, C, D, X(4), 6, 0xf7537e82L);
154
        R3(D, A, B, C, X(11), 10, 0xbd3af235L);
155
        R3(C, D, A, B, X(2), 15, 0x2ad7d2bbL);
156
        R3(B, C, D, A, X(9), 21, 0xeb86d391L);
157
158
        A = c->A += A;
159
        B = c->B += B;
160
        C = c->C += C;
161
        D = c->D += D;
162
    }
163
}
164
#endif