1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
/* $Id: mdblock.C,v 1.5 1999/02/20 07:03:09 dm Exp $ */
/*
*
* Copyright (C) 1998 David Mazieres (dm@uun.org)
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
* USA
*
*/
#include "crypthash.h"
void
mdblock::update (const void *_dp, size_t len)
{
const u_char *data = static_cast<const u_char *> (_dp);
size_t i;
u_int bcount = count % blocksize;
count += len;
if (bcount + len < blocksize) {
memcpy (&buffer[bcount], data, len);
return;
}
/* copy first chunk into context, do the rest (if any) */
/* directly from data array */
if (bcount) {
int j = blocksize - bcount;
memcpy (&buffer[bcount], data, j);
consume (buffer);
i = j;
len -= j;
}
else
i = 0;
while (len >= blocksize) {
consume (&data[i]);
i += blocksize;
len -= blocksize;
}
memcpy (buffer, &data[i], len);
}
/* Add padding */
void
mdblock::finish_le ()
{
u_char *dp;
u_char *end;
u_int bcount = count % blocksize;
if (bcount > blocksize - 9) {
/* need to split padding bit and count */
u_int8_t tmp[blocksize];
bzero (tmp, blocksize - bcount);
/* add padding bit */
tmp[0] = 0x01;
update (tmp, blocksize - bcount);
/* don't count padding in length of string */
count -= blocksize - bcount;
dp = buffer;
}
else {
dp = &buffer[bcount];
*dp++ = 0x01;
}
end = &buffer[blocksize - 8];
while (dp < end)
*dp++ = 0;
count <<= 3; /* make bytecount bitcount */
*dp++ = (count >> 0) & 0xff;
*dp++ = (count >> 8) & 0xff;
*dp++ = (count >> 16) & 0xff;
*dp++ = (count >> 24) & 0xff;
*dp++ = (count >> 32) & 0xff;
*dp++ = (count >> 40) & 0xff;
*dp++ = (count >> 48) & 0xff;
*dp++ = (count >> 56) & 0xff;
/* Wipe variables */
dp = end = 0;
consume (buffer);
}
void
mdblock::finish_be ()
{
u_char *dp;
u_char *end;
u_int bcount = count % blocksize;
if (bcount > blocksize - 9) {
/* need to split padding bit and count */
u_int8_t tmp[blocksize];
bzero (tmp, blocksize - bcount);
/* add padding bit */
tmp[0] = 0x80;
update (tmp, blocksize - bcount);
/* don't count padding in length of string */
count -= blocksize - bcount;
dp = buffer;
}
else {
dp = &buffer[bcount];
*dp++ = 0x80;
}
end = &buffer[blocksize - 8];
while (dp < end)
*dp++ = 0;
count <<= 3; /* make bytecount bitcount */
*dp++ = (count >> 56) & 0xff;
*dp++ = (count >> 48) & 0xff;
*dp++ = (count >> 40) & 0xff;
*dp++ = (count >> 32) & 0xff;
*dp++ = (count >> 24) & 0xff;
*dp++ = (count >> 16) & 0xff;
*dp++ = (count >> 8) & 0xff;
*dp++ = (count >> 0) & 0xff;
/* Wipe variables */
dp = end = 0;
consume (buffer);
}
void
mdblock::updatev (const iovec *iov, u_int cnt)
{
for (const iovec *end = iov + cnt; iov < end; iov++)
update (iov->iov_base, iov->iov_len);
}
|
