1 |
dashley |
15 |
/* $Header: /home/dashley/cvsrep/e3ft_gpl01/e3ft_gpl01/lib_c++_c_asm_non_uc/src_os_unix_win/c___app_common/md5/md5.c,v 1.5 2007/01/27 03:34:17 dashley Exp $
|
2 |
|
|
//-------------------------------------------------------------------------------------------------
|
3 |
|
|
//This source code and any program in which it is compiled/used is provided under the GNU GENERAL
|
4 |
|
|
//PUBLIC LICENSE, Version 3, full license text below.
|
5 |
|
|
//-------------------------------------------------------------------------------------------------
|
6 |
|
|
// GNU GENERAL PUBLIC LICENSE
|
7 |
|
|
// Version 3, 29 June 2007
|
8 |
|
|
//
|
9 |
|
|
// Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
10 |
|
|
// Everyone is permitted to copy and distribute verbatim copies
|
11 |
|
|
// of this license document, but changing it is not allowed.
|
12 |
|
|
//
|
13 |
|
|
// Preamble
|
14 |
|
|
//
|
15 |
|
|
// The GNU General Public License is a free, copyleft license for
|
16 |
|
|
//software and other kinds of works.
|
17 |
|
|
//
|
18 |
|
|
// The licenses for most software and other practical works are designed
|
19 |
|
|
//to take away your freedom to share and change the works. By contrast,
|
20 |
|
|
//the GNU General Public License is intended to guarantee your freedom to
|
21 |
|
|
//share and change all versions of a program--to make sure it remains free
|
22 |
|
|
//software for all its users. We, the Free Software Foundation, use the
|
23 |
|
|
//GNU General Public License for most of our software; it applies also to
|
24 |
|
|
//any other work released this way by its authors. You can apply it to
|
25 |
|
|
//your programs, too.
|
26 |
|
|
//
|
27 |
|
|
// When we speak of free software, we are referring to freedom, not
|
28 |
|
|
//price. Our General Public Licenses are designed to make sure that you
|
29 |
|
|
//have the freedom to distribute copies of free software (and charge for
|
30 |
|
|
//them if you wish), that you receive source code or can get it if you
|
31 |
|
|
//want it, that you can change the software or use pieces of it in new
|
32 |
|
|
//free programs, and that you know you can do these things.
|
33 |
|
|
//
|
34 |
|
|
// To protect your rights, we need to prevent others from denying you
|
35 |
|
|
//these rights or asking you to surrender the rights. Therefore, you have
|
36 |
|
|
//certain responsibilities if you distribute copies of the software, or if
|
37 |
|
|
//you modify it: responsibilities to respect the freedom of others.
|
38 |
|
|
//
|
39 |
|
|
// For example, if you distribute copies of such a program, whether
|
40 |
|
|
//gratis or for a fee, you must pass on to the recipients the same
|
41 |
|
|
//freedoms that you received. You must make sure that they, too, receive
|
42 |
|
|
//or can get the source code. And you must show them these terms so they
|
43 |
|
|
//know their rights.
|
44 |
|
|
//
|
45 |
|
|
// Developers that use the GNU GPL protect your rights with two steps:
|
46 |
|
|
//(1) assert copyright on the software, and (2) offer you this License
|
47 |
|
|
//giving you legal permission to copy, distribute and/or modify it.
|
48 |
|
|
//
|
49 |
|
|
// For the developers' and authors' protection, the GPL clearly explains
|
50 |
|
|
//that there is no warranty for this free software. For both users' and
|
51 |
|
|
//authors' sake, the GPL requires that modified versions be marked as
|
52 |
|
|
//changed, so that their problems will not be attributed erroneously to
|
53 |
|
|
//authors of previous versions.
|
54 |
|
|
//
|
55 |
|
|
// Some devices are designed to deny users access to install or run
|
56 |
|
|
//modified versions of the software inside them, although the manufacturer
|
57 |
|
|
//can do so. This is fundamentally incompatible with the aim of
|
58 |
|
|
//protecting users' freedom to change the software. The systematic
|
59 |
|
|
//pattern of such abuse occurs in the area of products for individuals to
|
60 |
|
|
//use, which is precisely where it is most unacceptable. Therefore, we
|
61 |
|
|
//have designed this version of the GPL to prohibit the practice for those
|
62 |
|
|
//products. If such problems arise substantially in other domains, we
|
63 |
|
|
//stand ready to extend this provision to those domains in future versions
|
64 |
|
|
//of the GPL, as needed to protect the freedom of users.
|
65 |
|
|
//
|
66 |
|
|
// Finally, every program is threatened constantly by software patents.
|
67 |
|
|
//States should not allow patents to restrict development and use of
|
68 |
|
|
//software on general-purpose computers, but in those that do, we wish to
|
69 |
|
|
//avoid the special danger that patents applied to a free program could
|
70 |
|
|
//make it effectively proprietary. To prevent this, the GPL assures that
|
71 |
|
|
//patents cannot be used to render the program non-free.
|
72 |
|
|
//
|
73 |
|
|
// The precise terms and conditions for copying, distribution and
|
74 |
|
|
//modification follow.
|
75 |
|
|
//
|
76 |
|
|
// TERMS AND CONDITIONS
|
77 |
|
|
//
|
78 |
|
|
// 0. Definitions.
|
79 |
|
|
//
|
80 |
|
|
// "This License" refers to version 3 of the GNU General Public License.
|
81 |
|
|
//
|
82 |
|
|
// "Copyright" also means copyright-like laws that apply to other kinds of
|
83 |
|
|
//works, such as semiconductor masks.
|
84 |
|
|
//
|
85 |
|
|
// "The Program" refers to any copyrightable work licensed under this
|
86 |
|
|
//License. Each licensee is addressed as "you". "Licensees" and
|
87 |
|
|
//"recipients" may be individuals or organizations.
|
88 |
|
|
//
|
89 |
|
|
// To "modify" a work means to copy from or adapt all or part of the work
|
90 |
|
|
//in a fashion requiring copyright permission, other than the making of an
|
91 |
|
|
//exact copy. The resulting work is called a "modified version" of the
|
92 |
|
|
//earlier work or a work "based on" the earlier work.
|
93 |
|
|
//
|
94 |
|
|
// A "covered work" means either the unmodified Program or a work based
|
95 |
|
|
//on the Program.
|
96 |
|
|
//
|
97 |
|
|
// To "propagate" a work means to do anything with it that, without
|
98 |
|
|
//permission, would make you directly or secondarily liable for
|
99 |
|
|
//infringement under applicable copyright law, except executing it on a
|
100 |
|
|
//computer or modifying a private copy. Propagation includes copying,
|
101 |
|
|
//distribution (with or without modification), making available to the
|
102 |
|
|
//public, and in some countries other activities as well.
|
103 |
|
|
//
|
104 |
|
|
// To "convey" a work means any kind of propagation that enables other
|
105 |
|
|
//parties to make or receive copies. Mere interaction with a user through
|
106 |
|
|
//a computer network, with no transfer of a copy, is not conveying.
|
107 |
|
|
//
|
108 |
|
|
// An interactive user interface displays "Appropriate Legal Notices"
|
109 |
|
|
//to the extent that it includes a convenient and prominently visible
|
110 |
|
|
//feature that (1) displays an appropriate copyright notice, and (2)
|
111 |
|
|
//tells the user that there is no warranty for the work (except to the
|
112 |
|
|
//extent that warranties are provided), that licensees may convey the
|
113 |
|
|
//work under this License, and how to view a copy of this License. If
|
114 |
|
|
//the interface presents a list of user commands or options, such as a
|
115 |
|
|
//menu, a prominent item in the list meets this criterion.
|
116 |
|
|
//
|
117 |
|
|
// 1. Source Code.
|
118 |
|
|
//
|
119 |
|
|
// The "source code" for a work means the preferred form of the work
|
120 |
|
|
//for making modifications to it. "Object code" means any non-source
|
121 |
|
|
//form of a work.
|
122 |
|
|
//
|
123 |
|
|
// A "Standard Interface" means an interface that either is an official
|
124 |
|
|
//standard defined by a recognized standards body, or, in the case of
|
125 |
|
|
//interfaces specified for a particular programming language, one that
|
126 |
|
|
//is widely used among developers working in that language.
|
127 |
|
|
//
|
128 |
|
|
// The "System Libraries" of an executable work include anything, other
|
129 |
|
|
//than the work as a whole, that (a) is included in the normal form of
|
130 |
|
|
//packaging a Major Component, but which is not part of that Major
|
131 |
|
|
//Component, and (b) serves only to enable use of the work with that
|
132 |
|
|
//Major Component, or to implement a Standard Interface for which an
|
133 |
|
|
//implementation is available to the public in source code form. A
|
134 |
|
|
//"Major Component", in this context, means a major essential component
|
135 |
|
|
//(kernel, window system, and so on) of the specific operating system
|
136 |
|
|
//(if any) on which the executable work runs, or a compiler used to
|
137 |
|
|
//produce the work, or an object code interpreter used to run it.
|
138 |
|
|
//
|
139 |
|
|
// The "Corresponding Source" for a work in object code form means all
|
140 |
|
|
//the source code needed to generate, install, and (for an executable
|
141 |
|
|
//work) run the object code and to modify the work, including scripts to
|
142 |
|
|
//control those activities. However, it does not include the work's
|
143 |
|
|
//System Libraries, or general-purpose tools or generally available free
|
144 |
|
|
//programs which are used unmodified in performing those activities but
|
145 |
|
|
//which are not part of the work. For example, Corresponding Source
|
146 |
|
|
//includes interface definition files associated with source files for
|
147 |
|
|
//the work, and the source code for shared libraries and dynamically
|
148 |
|
|
//linked subprograms that the work is specifically designed to require,
|
149 |
|
|
//such as by intimate data communication or control flow between those
|
150 |
|
|
//subprograms and other parts of the work.
|
151 |
|
|
//
|
152 |
|
|
// The Corresponding Source need not include anything that users
|
153 |
|
|
//can regenerate automatically from other parts of the Corresponding
|
154 |
|
|
//Source.
|
155 |
|
|
//
|
156 |
|
|
// The Corresponding Source for a work in source code form is that
|
157 |
|
|
//same work.
|
158 |
|
|
//
|
159 |
|
|
// 2. Basic Permissions.
|
160 |
|
|
//
|
161 |
|
|
// All rights granted under this License are granted for the term of
|
162 |
|
|
//copyright on the Program, and are irrevocable provided the stated
|
163 |
|
|
//conditions are met. This License explicitly affirms your unlimited
|
164 |
|
|
//permission to run the unmodified Program. The output from running a
|
165 |
|
|
//covered work is covered by this License only if the output, given its
|
166 |
|
|
//content, constitutes a covered work. This License acknowledges your
|
167 |
|
|
//rights of fair use or other equivalent, as provided by copyright law.
|
168 |
|
|
//
|
169 |
|
|
// You may make, run and propagate covered works that you do not
|
170 |
|
|
//convey, without conditions so long as your license otherwise remains
|
171 |
|
|
//in force. You may convey covered works to others for the sole purpose
|
172 |
|
|
//of having them make modifications exclusively for you, or provide you
|
173 |
|
|
//with facilities for running those works, provided that you comply with
|
174 |
|
|
//the terms of this License in conveying all material for which you do
|
175 |
|
|
//not control copyright. Those thus making or running the covered works
|
176 |
|
|
//for you must do so exclusively on your behalf, under your direction
|
177 |
|
|
//and control, on terms that prohibit them from making any copies of
|
178 |
|
|
//your copyrighted material outside their relationship with you.
|
179 |
|
|
//
|
180 |
|
|
// Conveying under any other circumstances is permitted solely under
|
181 |
|
|
//the conditions stated below. Sublicensing is not allowed; section 10
|
182 |
|
|
//makes it unnecessary.
|
183 |
|
|
//
|
184 |
|
|
// 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
185 |
|
|
//
|
186 |
|
|
// No covered work shall be deemed part of an effective technological
|
187 |
|
|
//measure under any applicable law fulfilling obligations under article
|
188 |
|
|
//11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
189 |
|
|
//similar laws prohibiting or restricting circumvention of such
|
190 |
|
|
//measures.
|
191 |
|
|
//
|
192 |
|
|
// When you convey a covered work, you waive any legal power to forbid
|
193 |
|
|
//circumvention of technological measures to the extent such circumvention
|
194 |
|
|
//is effected by exercising rights under this License with respect to
|
195 |
|
|
//the covered work, and you disclaim any intention to limit operation or
|
196 |
|
|
//modification of the work as a means of enforcing, against the work's
|
197 |
|
|
//users, your or third parties' legal rights to forbid circumvention of
|
198 |
|
|
//technological measures.
|
199 |
|
|
//
|
200 |
|
|
// 4. Conveying Verbatim Copies.
|
201 |
|
|
//
|
202 |
|
|
// You may convey verbatim copies of the Program's source code as you
|
203 |
|
|
//receive it, in any medium, provided that you conspicuously and
|
204 |
|
|
//appropriately publish on each copy an appropriate copyright notice;
|
205 |
|
|
//keep intact all notices stating that this License and any
|
206 |
|
|
//non-permissive terms added in accord with section 7 apply to the code;
|
207 |
|
|
//keep intact all notices of the absence of any warranty; and give all
|
208 |
|
|
//recipients a copy of this License along with the Program.
|
209 |
|
|
//
|
210 |
|
|
// You may charge any price or no price for each copy that you convey,
|
211 |
|
|
//and you may offer support or warranty protection for a fee.
|
212 |
|
|
//
|
213 |
|
|
// 5. Conveying Modified Source Versions.
|
214 |
|
|
//
|
215 |
|
|
// You may convey a work based on the Program, or the modifications to
|
216 |
|
|
//produce it from the Program, in the form of source code under the
|
217 |
|
|
//terms of section 4, provided that you also meet all of these conditions:
|
218 |
|
|
//
|
219 |
|
|
// a) The work must carry prominent notices stating that you modified
|
220 |
|
|
// it, and giving a relevant date.
|
221 |
|
|
//
|
222 |
|
|
// b) The work must carry prominent notices stating that it is
|
223 |
|
|
// released under this License and any conditions added under section
|
224 |
|
|
// 7. This requirement modifies the requirement in section 4 to
|
225 |
|
|
// "keep intact all notices".
|
226 |
|
|
//
|
227 |
|
|
// c) You must license the entire work, as a whole, under this
|
228 |
|
|
// License to anyone who comes into possession of a copy. This
|
229 |
|
|
// License will therefore apply, along with any applicable section 7
|
230 |
|
|
// additional terms, to the whole of the work, and all its parts,
|
231 |
|
|
// regardless of how they are packaged. This License gives no
|
232 |
|
|
// permission to license the work in any other way, but it does not
|
233 |
|
|
// invalidate such permission if you have separately received it.
|
234 |
|
|
//
|
235 |
|
|
// d) If the work has interactive user interfaces, each must display
|
236 |
|
|
// Appropriate Legal Notices; however, if the Program has interactive
|
237 |
|
|
// interfaces that do not display Appropriate Legal Notices, your
|
238 |
|
|
// work need not make them do so.
|
239 |
|
|
//
|
240 |
|
|
// A compilation of a covered work with other separate and independent
|
241 |
|
|
//works, which are not by their nature extensions of the covered work,
|
242 |
|
|
//and which are not combined with it such as to form a larger program,
|
243 |
|
|
//in or on a volume of a storage or distribution medium, is called an
|
244 |
|
|
//"aggregate" if the compilation and its resulting copyright are not
|
245 |
|
|
//used to limit the access or legal rights of the compilation's users
|
246 |
|
|
//beyond what the individual works permit. Inclusion of a covered work
|
247 |
|
|
//in an aggregate does not cause this License to apply to the other
|
248 |
|
|
//parts of the aggregate.
|
249 |
|
|
//
|
250 |
|
|
// 6. Conveying Non-Source Forms.
|
251 |
|
|
//
|
252 |
|
|
// You may convey a covered work in object code form under the terms
|
253 |
|
|
//of sections 4 and 5, provided that you also convey the
|
254 |
|
|
//machine-readable Corresponding Source under the terms of this License,
|
255 |
|
|
//in one of these ways:
|
256 |
|
|
//
|
257 |
|
|
// a) Convey the object code in, or embodied in, a physical product
|
258 |
|
|
// (including a physical distribution medium), accompanied by the
|
259 |
|
|
// Corresponding Source fixed on a durable physical medium
|
260 |
|
|
// customarily used for software interchange.
|
261 |
|
|
//
|
262 |
|
|
// b) Convey the object code in, or embodied in, a physical product
|
263 |
|
|
// (including a physical distribution medium), accompanied by a
|
264 |
|
|
// written offer, valid for at least three years and valid for as
|
265 |
|
|
// long as you offer spare parts or customer support for that product
|
266 |
|
|
// model, to give anyone who possesses the object code either (1) a
|
267 |
|
|
// copy of the Corresponding Source for all the software in the
|
268 |
|
|
// product that is covered by this License, on a durable physical
|
269 |
|
|
// medium customarily used for software interchange, for a price no
|
270 |
|
|
// more than your reasonable cost of physically performing this
|
271 |
|
|
// conveying of source, or (2) access to copy the
|
272 |
|
|
// Corresponding Source from a network server at no charge.
|
273 |
|
|
//
|
274 |
|
|
// c) Convey individual copies of the object code with a copy of the
|
275 |
|
|
// written offer to provide the Corresponding Source. This
|
276 |
|
|
// alternative is allowed only occasionally and noncommercially, and
|
277 |
|
|
// only if you received the object code with such an offer, in accord
|
278 |
|
|
// with subsection 6b.
|
279 |
|
|
//
|
280 |
|
|
// d) Convey the object code by offering access from a designated
|
281 |
|
|
// place (gratis or for a charge), and offer equivalent access to the
|
282 |
|
|
// Corresponding Source in the same way through the same place at no
|
283 |
|
|
// further charge. You need not require recipients to copy the
|
284 |
|
|
// Corresponding Source along with the object code. If the place to
|
285 |
|
|
// copy the object code is a network server, the Corresponding Source
|
286 |
|
|
// may be on a different server (operated by you or a third party)
|
287 |
|
|
// that supports equivalent copying facilities, provided you maintain
|
288 |
|
|
// clear directions next to the object code saying where to find the
|
289 |
|
|
// Corresponding Source. Regardless of what server hosts the
|
290 |
|
|
// Corresponding Source, you remain obligated to ensure that it is
|
291 |
|
|
// available for as long as needed to satisfy these requirements.
|
292 |
|
|
//
|
293 |
|
|
// e) Convey the object code using peer-to-peer transmission, provided
|
294 |
|
|
// you inform other peers where the object code and Corresponding
|
295 |
|
|
// Source of the work are being offered to the general public at no
|
296 |
|
|
// charge under subsection 6d.
|
297 |
|
|
//
|
298 |
|
|
// A separable portion of the object code, whose source code is excluded
|
299 |
|
|
//from the Corresponding Source as a System Library, need not be
|
300 |
|
|
//included in conveying the object code work.
|
301 |
|
|
//
|
302 |
|
|
// A "User Product" is either (1) a "consumer product", which means any
|
303 |
|
|
//tangible personal property which is normally used for personal, family,
|
304 |
|
|
//or household purposes, or (2) anything designed or sold for incorporation
|
305 |
|
|
//into a dwelling. In determining whether a product is a consumer product,
|
306 |
|
|
//doubtful cases shall be resolved in favor of coverage. For a particular
|
307 |
|
|
//product received by a particular user, "normally used" refers to a
|
308 |
|
|
//typical or common use of that class of product, regardless of the status
|
309 |
|
|
//of the particular user or of the way in which the particular user
|
310 |
|
|
//actually uses, or expects or is expected to use, the product. A product
|
311 |
|
|
//is a consumer product regardless of whether the product has substantial
|
312 |
|
|
//commercial, industrial or non-consumer uses, unless such uses represent
|
313 |
|
|
//the only significant mode of use of the product.
|
314 |
|
|
//
|
315 |
|
|
// "Installation Information" for a User Product means any methods,
|
316 |
|
|
//procedures, authorization keys, or other information required to install
|
317 |
|
|
//and execute modified versions of a covered work in that User Product from
|
318 |
|
|
//a modified version of its Corresponding Source. The information must
|
319 |
|
|
//suffice to ensure that the continued functioning of the modified object
|
320 |
|
|
//code is in no case prevented or interfered with solely because
|
321 |
|
|
//modification has been made.
|
322 |
|
|
//
|
323 |
|
|
// If you convey an object code work under this section in, or with, or
|
324 |
|
|
//specifically for use in, a User Product, and the conveying occurs as
|
325 |
|
|
//part of a transaction in which the right of possession and use of the
|
326 |
|
|
//User Product is transferred to the recipient in perpetuity or for a
|
327 |
|
|
//fixed term (regardless of how the transaction is characterized), the
|
328 |
|
|
//Corresponding Source conveyed under this section must be accompanied
|
329 |
|
|
//by the Installation Information. But this requirement does not apply
|
330 |
|
|
//if neither you nor any third party retains the ability to install
|
331 |
|
|
//modified object code on the User Product (for example, the work has
|
332 |
|
|
//been installed in ROM).
|
333 |
|
|
//
|
334 |
|
|
// The requirement to provide Installation Information does not include a
|
335 |
|
|
//requirement to continue to provide support service, warranty, or updates
|
336 |
|
|
//for a work that has been modified or installed by the recipient, or for
|
337 |
|
|
//the User Product in which it has been modified or installed. Access to a
|
338 |
|
|
//network may be denied when the modification itself materially and
|
339 |
|
|
//adversely affects the operation of the network or violates the rules and
|
340 |
|
|
//protocols for communication across the network.
|
341 |
|
|
//
|
342 |
|
|
// Corresponding Source conveyed, and Installation Information provided,
|
343 |
|
|
//in accord with this section must be in a format that is publicly
|
344 |
|
|
//documented (and with an implementation available to the public in
|
345 |
|
|
//source code form), and must require no special password or key for
|
346 |
|
|
//unpacking, reading or copying.
|
347 |
|
|
//
|
348 |
|
|
// 7. Additional Terms.
|
349 |
|
|
//
|
350 |
|
|
// "Additional permissions" are terms that supplement the terms of this
|
351 |
|
|
//License by making exceptions from one or more of its conditions.
|
352 |
|
|
//Additional permissions that are applicable to the entire Program shall
|
353 |
|
|
//be treated as though they were included in this License, to the extent
|
354 |
|
|
//that they are valid under applicable law. If additional permissions
|
355 |
|
|
//apply only to part of the Program, that part may be used separately
|
356 |
|
|
//under those permissions, but the entire Program remains governed by
|
357 |
|
|
//this License without regard to the additional permissions.
|
358 |
|
|
//
|
359 |
|
|
// When you convey a copy of a covered work, you may at your option
|
360 |
|
|
//remove any additional permissions from that copy, or from any part of
|
361 |
|
|
//it. (Additional permissions may be written to require their own
|
362 |
|
|
//removal in certain cases when you modify the work.) You may place
|
363 |
|
|
//additional permissions on material, added by you to a covered work,
|
364 |
|
|
//for which you have or can give appropriate copyright permission.
|
365 |
|
|
//
|
366 |
|
|
// Notwithstanding any other provision of this License, for material you
|
367 |
|
|
//add to a covered work, you may (if authorized by the copyright holders of
|
368 |
|
|
//that material) supplement the terms of this License with terms:
|
369 |
|
|
//
|
370 |
|
|
// a) Disclaiming warranty or limiting liability differently from the
|
371 |
|
|
// terms of sections 15 and 16 of this License; or
|
372 |
|
|
//
|
373 |
|
|
// b) Requiring preservation of specified reasonable legal notices or
|
374 |
|
|
// author attributions in that material or in the Appropriate Legal
|
375 |
|
|
// Notices displayed by works containing it; or
|
376 |
|
|
//
|
377 |
|
|
// c) Prohibiting misrepresentation of the origin of that material, or
|
378 |
|
|
// requiring that modified versions of such material be marked in
|
379 |
|
|
// reasonable ways as different from the original version; or
|
380 |
|
|
//
|
381 |
|
|
// d) Limiting the use for publicity purposes of names of licensors or
|
382 |
|
|
// authors of the material; or
|
383 |
|
|
//
|
384 |
|
|
// e) Declining to grant rights under trademark law for use of some
|
385 |
|
|
// trade names, trademarks, or service marks; or
|
386 |
|
|
//
|
387 |
|
|
// f) Requiring indemnification of licensors and authors of that
|
388 |
|
|
// material by anyone who conveys the material (or modified versions of
|
389 |
|
|
// it) with contractual assumptions of liability to the recipient, for
|
390 |
|
|
// any liability that these contractual assumptions directly impose on
|
391 |
|
|
// those licensors and authors.
|
392 |
|
|
//
|
393 |
|
|
// All other non-permissive additional terms are considered "further
|
394 |
|
|
//restrictions" within the meaning of section 10. If the Program as you
|
395 |
|
|
//received it, or any part of it, contains a notice stating that it is
|
396 |
|
|
//governed by this License along with a term that is a further
|
397 |
|
|
//restriction, you may remove that term. If a license document contains
|
398 |
|
|
//a further restriction but permits relicensing or conveying under this
|
399 |
|
|
//License, you may add to a covered work material governed by the terms
|
400 |
|
|
//of that license document, provided that the further restriction does
|
401 |
|
|
//not survive such relicensing or conveying.
|
402 |
|
|
//
|
403 |
|
|
// If you add terms to a covered work in accord with this section, you
|
404 |
|
|
//must place, in the relevant source files, a statement of the
|
405 |
|
|
//additional terms that apply to those files, or a notice indicating
|
406 |
|
|
//where to find the applicable terms.
|
407 |
|
|
//
|
408 |
|
|
// Additional terms, permissive or non-permissive, may be stated in the
|
409 |
|
|
//form of a separately written license, or stated as exceptions;
|
410 |
|
|
//the above requirements apply either way.
|
411 |
|
|
//
|
412 |
|
|
// 8. Termination.
|
413 |
|
|
//
|
414 |
|
|
// You may not propagate or modify a covered work except as expressly
|
415 |
|
|
//provided under this License. Any attempt otherwise to propagate or
|
416 |
|
|
//modify it is void, and will automatically terminate your rights under
|
417 |
|
|
//this License (including any patent licenses granted under the third
|
418 |
|
|
//paragraph of section 11).
|
419 |
|
|
//
|
420 |
|
|
// However, if you cease all violation of this License, then your
|
421 |
|
|
//license from a particular copyright holder is reinstated (a)
|
422 |
|
|
//provisionally, unless and until the copyright holder explicitly and
|
423 |
|
|
//finally terminates your license, and (b) permanently, if the copyright
|
424 |
|
|
//holder fails to notify you of the violation by some reasonable means
|
425 |
|
|
//prior to 60 days after the cessation.
|
426 |
|
|
//
|
427 |
|
|
// Moreover, your license from a particular copyright holder is
|
428 |
|
|
//reinstated permanently if the copyright holder notifies you of the
|
429 |
|
|
//violation by some reasonable means, this is the first time you have
|
430 |
|
|
//received notice of violation of this License (for any work) from that
|
431 |
|
|
//copyright holder, and you cure the violation prior to 30 days after
|
432 |
|
|
//your receipt of the notice.
|
433 |
|
|
//
|
434 |
|
|
// Termination of your rights under this section does not terminate the
|
435 |
|
|
//licenses of parties who have received copies or rights from you under
|
436 |
|
|
//this License. If your rights have been terminated and not permanently
|
437 |
|
|
//reinstated, you do not qualify to receive new licenses for the same
|
438 |
|
|
//material under section 10.
|
439 |
|
|
//
|
440 |
|
|
// 9. Acceptance Not Required for Having Copies.
|
441 |
|
|
//
|
442 |
|
|
// You are not required to accept this License in order to receive or
|
443 |
|
|
//run a copy of the Program. Ancillary propagation of a covered work
|
444 |
|
|
//occurring solely as a consequence of using peer-to-peer transmission
|
445 |
|
|
//to receive a copy likewise does not require acceptance. However,
|
446 |
|
|
//nothing other than this License grants you permission to propagate or
|
447 |
|
|
//modify any covered work. These actions infringe copyright if you do
|
448 |
|
|
//not accept this License. Therefore, by modifying or propagating a
|
449 |
|
|
//covered work, you indicate your acceptance of this License to do so.
|
450 |
|
|
//
|
451 |
|
|
// 10. Automatic Licensing of Downstream Recipients.
|
452 |
|
|
//
|
453 |
|
|
// Each time you convey a covered work, the recipient automatically
|
454 |
|
|
//receives a license from the original licensors, to run, modify and
|
455 |
|
|
//propagate that work, subject to this License. You are not responsible
|
456 |
|
|
//for enforcing compliance by third parties with this License.
|
457 |
|
|
//
|
458 |
|
|
// An "entity transaction" is a transaction transferring control of an
|
459 |
|
|
//organization, or substantially all assets of one, or subdividing an
|
460 |
|
|
//organization, or merging organizations. If propagation of a covered
|
461 |
|
|
//work results from an entity transaction, each party to that
|
462 |
|
|
//transaction who receives a copy of the work also receives whatever
|
463 |
|
|
//licenses to the work the party's predecessor in interest had or could
|
464 |
|
|
//give under the previous paragraph, plus a right to possession of the
|
465 |
|
|
//Corresponding Source of the work from the predecessor in interest, if
|
466 |
|
|
//the predecessor has it or can get it with reasonable efforts.
|
467 |
|
|
//
|
468 |
|
|
// You may not impose any further restrictions on the exercise of the
|
469 |
|
|
//rights granted or affirmed under this License. For example, you may
|
470 |
|
|
//not impose a license fee, royalty, or other charge for exercise of
|
471 |
|
|
//rights granted under this License, and you may not initiate litigation
|
472 |
|
|
//(including a cross-claim or counterclaim in a lawsuit) alleging that
|
473 |
|
|
//any patent claim is infringed by making, using, selling, offering for
|
474 |
|
|
//sale, or importing the Program or any portion of it.
|
475 |
|
|
//
|
476 |
|
|
// 11. Patents.
|
477 |
|
|
//
|
478 |
|
|
// A "contributor" is a copyright holder who authorizes use under this
|
479 |
|
|
//License of the Program or a work on which the Program is based. The
|
480 |
|
|
//work thus licensed is called the contributor's "contributor version".
|
481 |
|
|
//
|
482 |
|
|
// A contributor's "essential patent claims" are all patent claims
|
483 |
|
|
//owned or controlled by the contributor, whether already acquired or
|
484 |
|
|
//hereafter acquired, that would be infringed by some manner, permitted
|
485 |
|
|
//by this License, of making, using, or selling its contributor version,
|
486 |
|
|
//but do not include claims that would be infringed only as a
|
487 |
|
|
//consequence of further modification of the contributor version. For
|
488 |
|
|
//purposes of this definition, "control" includes the right to grant
|
489 |
|
|
//patent sublicenses in a manner consistent with the requirements of
|
490 |
|
|
//this License.
|
491 |
|
|
//
|
492 |
|
|
// Each contributor grants you a non-exclusive, worldwide, royalty-free
|
493 |
|
|
//patent license under the contributor's essential patent claims, to
|
494 |
|
|
//make, use, sell, offer for sale, import and otherwise run, modify and
|
495 |
|
|
//propagate the contents of its contributor version.
|
496 |
|
|
//
|
497 |
|
|
// In the following three paragraphs, a "patent license" is any express
|
498 |
|
|
//agreement or commitment, however denominated, not to enforce a patent
|
499 |
|
|
//(such as an express permission to practice a patent or covenant not to
|
500 |
|
|
//sue for patent infringement). To "grant" such a patent license to a
|
501 |
|
|
//party means to make such an agreement or commitment not to enforce a
|
502 |
|
|
//patent against the party.
|
503 |
|
|
//
|
504 |
|
|
// If you convey a covered work, knowingly relying on a patent license,
|
505 |
|
|
//and the Corresponding Source of the work is not available for anyone
|
506 |
|
|
//to copy, free of charge and under the terms of this License, through a
|
507 |
|
|
//publicly available network server or other readily accessible means,
|
508 |
|
|
//then you must either (1) cause the Corresponding Source to be so
|
509 |
|
|
//available, or (2) arrange to deprive yourself of the benefit of the
|
510 |
|
|
//patent license for this particular work, or (3) arrange, in a manner
|
511 |
|
|
//consistent with the requirements of this License, to extend the patent
|
512 |
|
|
//license to downstream recipients. "Knowingly relying" means you have
|
513 |
|
|
//actual knowledge that, but for the patent license, your conveying the
|
514 |
|
|
//covered work in a country, or your recipient's use of the covered work
|
515 |
|
|
//in a country, would infringe one or more identifiable patents in that
|
516 |
|
|
//country that you have reason to believe are valid.
|
517 |
|
|
//
|
518 |
|
|
// If, pursuant to or in connection with a single transaction or
|
519 |
|
|
//arrangement, you convey, or propagate by procuring conveyance of, a
|
520 |
|
|
//covered work, and grant a patent license to some of the parties
|
521 |
|
|
//receiving the covered work authorizing them to use, propagate, modify
|
522 |
|
|
//or convey a specific copy of the covered work, then the patent license
|
523 |
|
|
//you grant is automatically extended to all recipients of the covered
|
524 |
|
|
//work and works based on it.
|
525 |
|
|
//
|
526 |
|
|
// A patent license is "discriminatory" if it does not include within
|
527 |
|
|
//the scope of its coverage, prohibits the exercise of, or is
|
528 |
|
|
//conditioned on the non-exercise of one or more of the rights that are
|
529 |
|
|
//specifically granted under this License. You may not convey a covered
|
530 |
|
|
//work if you are a party to an arrangement with a third party that is
|
531 |
|
|
//in the business of distributing software, under which you make payment
|
532 |
|
|
//to the third party based on the extent of your activity of conveying
|
533 |
|
|
//the work, and under which the third party grants, to any of the
|
534 |
|
|
//parties who would receive the covered work from you, a discriminatory
|
535 |
|
|
//patent license (a) in connection with copies of the covered work
|
536 |
|
|
//conveyed by you (or copies made from those copies), or (b) primarily
|
537 |
|
|
//for and in connection with specific products or compilations that
|
538 |
|
|
//contain the covered work, unless you entered into that arrangement,
|
539 |
|
|
//or that patent license was granted, prior to 28 March 2007.
|
540 |
|
|
//
|
541 |
|
|
// Nothing in this License shall be construed as excluding or limiting
|
542 |
|
|
//any implied license or other defenses to infringement that may
|
543 |
|
|
//otherwise be available to you under applicable patent law.
|
544 |
|
|
//
|
545 |
|
|
// 12. No Surrender of Others' Freedom.
|
546 |
|
|
//
|
547 |
|
|
// If conditions are imposed on you (whether by court order, agreement or
|
548 |
|
|
//otherwise) that contradict the conditions of this License, they do not
|
549 |
|
|
//excuse you from the conditions of this License. If you cannot convey a
|
550 |
|
|
//covered work so as to satisfy simultaneously your obligations under this
|
551 |
|
|
//License and any other pertinent obligations, then as a consequence you may
|
552 |
|
|
//not convey it at all. For example, if you agree to terms that obligate you
|
553 |
|
|
//to collect a royalty for further conveying from those to whom you convey
|
554 |
|
|
//the Program, the only way you could satisfy both those terms and this
|
555 |
|
|
//License would be to refrain entirely from conveying the Program.
|
556 |
|
|
//
|
557 |
|
|
// 13. Use with the GNU Affero General Public License.
|
558 |
|
|
//
|
559 |
|
|
// Notwithstanding any other provision of this License, you have
|
560 |
|
|
//permission to link or combine any covered work with a work licensed
|
561 |
|
|
//under version 3 of the GNU Affero General Public License into a single
|
562 |
|
|
//combined work, and to convey the resulting work. The terms of this
|
563 |
|
|
//License will continue to apply to the part which is the covered work,
|
564 |
|
|
//but the special requirements of the GNU Affero General Public License,
|
565 |
|
|
//section 13, concerning interaction through a network will apply to the
|
566 |
|
|
//combination as such.
|
567 |
|
|
//
|
568 |
|
|
// 14. Revised Versions of this License.
|
569 |
|
|
//
|
570 |
|
|
// The Free Software Foundation may publish revised and/or new versions of
|
571 |
|
|
//the GNU General Public License from time to time. Such new versions will
|
572 |
|
|
//be similar in spirit to the present version, but may differ in detail to
|
573 |
|
|
//address new problems or concerns.
|
574 |
|
|
//
|
575 |
|
|
// Each version is given a distinguishing version number. If the
|
576 |
|
|
//Program specifies that a certain numbered version of the GNU General
|
577 |
|
|
//Public License "or any later version" applies to it, you have the
|
578 |
|
|
//option of following the terms and conditions either of that numbered
|
579 |
|
|
//version or of any later version published by the Free Software
|
580 |
|
|
//Foundation. If the Program does not specify a version number of the
|
581 |
|
|
//GNU General Public License, you may choose any version ever published
|
582 |
|
|
//by the Free Software Foundation.
|
583 |
|
|
//
|
584 |
|
|
// If the Program specifies that a proxy can decide which future
|
585 |
|
|
//versions of the GNU General Public License can be used, that proxy's
|
586 |
|
|
//public statement of acceptance of a version permanently authorizes you
|
587 |
|
|
//to choose that version for the Program.
|
588 |
|
|
//
|
589 |
|
|
// Later license versions may give you additional or different
|
590 |
|
|
//permissions. However, no additional obligations are imposed on any
|
591 |
|
|
//author or copyright holder as a result of your choosing to follow a
|
592 |
|
|
//later version.
|
593 |
|
|
//
|
594 |
|
|
// 15. Disclaimer of Warranty.
|
595 |
|
|
//
|
596 |
|
|
// THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
597 |
|
|
//APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
598 |
|
|
//HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
599 |
|
|
//OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
600 |
|
|
//THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
601 |
|
|
//PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
602 |
|
|
//IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
603 |
|
|
//ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
604 |
|
|
//
|
605 |
|
|
// 16. Limitation of Liability.
|
606 |
|
|
//
|
607 |
|
|
// IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
608 |
|
|
//WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
609 |
|
|
//THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
610 |
|
|
//GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
611 |
|
|
//USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
612 |
|
|
//DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
613 |
|
|
//PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
614 |
|
|
//EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
615 |
|
|
//SUCH DAMAGES.
|
616 |
|
|
//
|
617 |
|
|
// 17. Interpretation of Sections 15 and 16.
|
618 |
|
|
//
|
619 |
|
|
// If the disclaimer of warranty and limitation of liability provided
|
620 |
|
|
//above cannot be given local legal effect according to their terms,
|
621 |
|
|
//reviewing courts shall apply local law that most closely approximates
|
622 |
|
|
//an absolute waiver of all civil liability in connection with the
|
623 |
|
|
//Program, unless a warranty or assumption of liability accompanies a
|
624 |
|
|
//copy of the Program in return for a fee.
|
625 |
|
|
//
|
626 |
|
|
// END OF TERMS AND CONDITIONS
|
627 |
|
|
//
|
628 |
|
|
// How to Apply These Terms to Your New Programs
|
629 |
|
|
//
|
630 |
|
|
// If you develop a new program, and you want it to be of the greatest
|
631 |
|
|
//possible use to the public, the best way to achieve this is to make it
|
632 |
|
|
//free software which everyone can redistribute and change under these terms.
|
633 |
|
|
//
|
634 |
|
|
// To do so, attach the following notices to the program. It is safest
|
635 |
|
|
//to attach them to the start of each source file to most effectively
|
636 |
|
|
//state the exclusion of warranty; and each file should have at least
|
637 |
|
|
//the "copyright" line and a pointer to where the full notice is found.
|
638 |
|
|
//
|
639 |
|
|
// <one line to give the program's name and a brief idea of what it does.>
|
640 |
|
|
// Copyright (C) <year> <name of author>
|
641 |
|
|
//
|
642 |
|
|
// This program is free software: you can redistribute it and/or modify
|
643 |
|
|
// it under the terms of the GNU General Public License as published by
|
644 |
|
|
// the Free Software Foundation, either version 3 of the License, or
|
645 |
|
|
// (at your option) any later version.
|
646 |
|
|
//
|
647 |
|
|
// This program is distributed in the hope that it will be useful,
|
648 |
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
649 |
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
650 |
|
|
// GNU General Public License for more details.
|
651 |
|
|
//
|
652 |
|
|
// You should have received a copy of the GNU General Public License
|
653 |
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
654 |
|
|
//
|
655 |
|
|
//Also add information on how to contact you by electronic and paper mail.
|
656 |
|
|
//
|
657 |
|
|
// If the program does terminal interaction, make it output a short
|
658 |
|
|
//notice like this when it starts in an interactive mode:
|
659 |
|
|
//
|
660 |
|
|
// <program> Copyright (C) <year> <name of author>
|
661 |
|
|
// This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
662 |
|
|
// This is free software, and you are welcome to redistribute it
|
663 |
|
|
// under certain conditions; type `show c' for details.
|
664 |
|
|
//
|
665 |
|
|
//The hypothetical commands `show w' and `show c' should show the appropriate
|
666 |
|
|
//parts of the General Public License. Of course, your program's commands
|
667 |
|
|
//might be different; for a GUI interface, you would use an "about box".
|
668 |
|
|
//
|
669 |
|
|
// You should also get your employer (if you work as a programmer) or school,
|
670 |
|
|
//if any, to sign a "copyright disclaimer" for the program, if necessary.
|
671 |
|
|
//For more information on this, and how to apply and follow the GNU GPL, see
|
672 |
|
|
//<http://www.gnu.org/licenses/>.
|
673 |
|
|
//
|
674 |
|
|
// The GNU General Public License does not permit incorporating your program
|
675 |
|
|
//into proprietary programs. If your program is a subroutine library, you
|
676 |
|
|
//may consider it more useful to permit linking proprietary applications with
|
677 |
|
|
//the library. If this is what you want to do, use the GNU Lesser General
|
678 |
|
|
//Public License instead of this License. But first, please read
|
679 |
|
|
//<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
680 |
|
|
//-------------------------------------------------------------------------------------------------
|
681 |
|
|
** --------------------------------------------------------------------------------
|
682 |
|
|
** MD5 Message Digest C Calculation Module
|
683 |
|
|
** Copyright (C)2007 David T. Ashley
|
684 |
|
|
**
|
685 |
|
|
** This program is free software; you can redistribute it and/or
|
686 |
|
|
** modify it under the terms of the GNU General Public License
|
687 |
|
|
** as published by the Free Software Foundation; either version 2
|
688 |
|
|
** of the License, or (at your option) any later version.
|
689 |
|
|
**
|
690 |
|
|
** This program is distributed in the hope that it will be useful,
|
691 |
|
|
** but WITHOUT ANY WARRANTY; without even the implied warranty of
|
692 |
|
|
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
693 |
|
|
** GNU General Public License for more details.
|
694 |
|
|
**
|
695 |
|
|
** You should have received a copy of the GNU General Public License
|
696 |
|
|
** along with this program; if not, write to the Free Software
|
697 |
|
|
** Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA,
|
698 |
|
|
** 02110-1301, USA.
|
699 |
|
|
** --------------------------------------------------------------------------------
|
700 |
|
|
** A description of the functionality of this module and the public interface
|
701 |
|
|
** definition is contained in the associated .H file.
|
702 |
|
|
*/
|
703 |
|
|
|
704 |
|
|
#define MODULE_MD5
|
705 |
|
|
|
706 |
|
|
#include <assert.h>
|
707 |
|
|
#include <stddef.h>
|
708 |
|
|
#include <string.h>
|
709 |
|
|
|
710 |
|
|
#include "../charfunc/charfunc.h"
|
711 |
|
|
#include "md5.h"
|
712 |
|
|
|
713 |
|
|
|
714 |
|
|
//These are macros which are defined for efficiency. These
|
715 |
|
|
//functions come from RFC 1321.
|
716 |
|
|
#define MD5_FUNC_F(x,y,z) (((x) & (y)) | ((~x) & (z)))
|
717 |
|
|
#define MD5_FUNC_G(x,y,z) (((x) & (z)) | ( (y) & (~z)))
|
718 |
|
|
#define MD5_FUNC_H(x,y,z) ((x) ^ (y) ^ (z))
|
719 |
|
|
#define MD5_FUNC_I(x,y,z) ((y) ^ ((x) | (~z)))
|
720 |
|
|
|
721 |
|
|
//This is a left rotation macro, again for efficiency. This
|
722 |
|
|
//macro rotates a 32-bit quantity x left (cyclically) by
|
723 |
|
|
//n bits.
|
724 |
|
|
#define MD5_FUNC_ROT_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
|
725 |
|
|
|
726 |
|
|
//These macros do one operation as described in the RFC. These allow
|
727 |
|
|
//the inlining of code for far more speed.
|
728 |
|
|
#define MD5_FUNC_FF(a,b,c,d,x,s,ac) { \
|
729 |
|
|
(a) += MD5_FUNC_F((b),(c),(d)) + (x) + (unsigned)(ac); \
|
730 |
|
|
(a) = MD5_FUNC_ROT_LEFT((a),(s)); \
|
731 |
|
|
(a) += (b); \
|
732 |
|
|
}
|
733 |
|
|
#define MD5_FUNC_GG(a,b,c,d,x,s,ac) { \
|
734 |
|
|
(a) += MD5_FUNC_G((b),(c),(d)) + (x) + (unsigned)(ac); \
|
735 |
|
|
(a) = MD5_FUNC_ROT_LEFT((a),(s)); \
|
736 |
|
|
(a) += (b); \
|
737 |
|
|
}
|
738 |
|
|
#define MD5_FUNC_HH(a,b,c,d,x,s,ac) { \
|
739 |
|
|
(a) += MD5_FUNC_H((b),(c),(d)) + (x) + (unsigned)(ac); \
|
740 |
|
|
(a) = MD5_FUNC_ROT_LEFT((a),(s)); \
|
741 |
|
|
(a) += (b); \
|
742 |
|
|
}
|
743 |
|
|
#define MD5_FUNC_II(a,b,c,d,x,s,ac) { \
|
744 |
|
|
(a) += MD5_FUNC_I((b),(c),(d)) + (x) + (unsigned)(ac); \
|
745 |
|
|
(a) = MD5_FUNC_ROT_LEFT((a),(s)); \
|
746 |
|
|
(a) += (b); \
|
747 |
|
|
}
|
748 |
|
|
|
749 |
|
|
|
750 |
|
|
//This is the padding table to append. It is done with
|
751 |
|
|
//an array for quickness.
|
752 |
|
|
static unsigned char MD5_pad_table[] =
|
753 |
|
|
{
|
754 |
|
|
0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
755 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
756 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
757 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
758 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
759 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
760 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
761 |
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
|
762 |
|
|
};
|
763 |
|
|
|
764 |
|
|
|
765 |
|
|
void MD5_Md5StateStructOpen(struct MD5_Md5StateStruct *arg)
|
766 |
|
|
{
|
767 |
|
|
assert(arg != NULL);
|
768 |
|
|
|
769 |
|
|
memset(arg, 0, sizeof(struct MD5_Md5StateStruct));
|
770 |
|
|
//Everything to zero, processed bitcount automatically set to zero.
|
771 |
|
|
|
772 |
|
|
arg->A = 0x67452301; //These assignments directly from RFC.
|
773 |
|
|
arg->B = 0xEFCDAB89;
|
774 |
|
|
arg->C = 0x98BADCFE;
|
775 |
|
|
arg->D = 0x10325476;
|
776 |
|
|
}
|
777 |
|
|
|
778 |
|
|
|
779 |
|
|
//Copies the byte buffer to the word buffer within the state block.
|
780 |
|
|
//This is done in a way which hides big-endian/little-endian concerns.
|
781 |
|
|
|
782 |
|
|
static void MD5_CopyBytesToWords(struct MD5_Md5StateStruct *arg)
|
783 |
|
|
{
|
784 |
|
|
int i;
|
785 |
|
|
|
786 |
|
|
assert(arg != NULL);
|
787 |
|
|
|
788 |
|
|
//Copy the buffer contents into the words. We need to be careful
|
789 |
|
|
//to do this right, because of big-endian/little-endian concerns.
|
790 |
|
|
for (i=0; i<16; i++)
|
791 |
|
|
{
|
792 |
|
|
assert((i * 4 + 3) < 64);
|
793 |
|
|
arg->X[i] = (((unsigned int)(arg->buf[i*4+3])) << 24)
|
794 |
|
|
+
|
795 |
|
|
(((unsigned int)(arg->buf[i*4+2])) << 16)
|
796 |
|
|
+
|
797 |
|
|
(((unsigned int)(arg->buf[i*4+1])) << 8)
|
798 |
|
|
+
|
799 |
|
|
(((unsigned int)(arg->buf[i*4])) );
|
800 |
|
|
}
|
801 |
|
|
}
|
802 |
|
|
|
803 |
|
|
|
804 |
|
|
//Does the MD-5 rounds as specified by RFC 1321.
|
805 |
|
|
|
806 |
|
|
static void MD5_DoMd5Rounds(struct MD5_Md5StateStruct *arg)
|
807 |
|
|
{
|
808 |
|
|
unsigned AA, BB, CC, DD;
|
809 |
|
|
//Directly from RFC 1321.
|
810 |
|
|
unsigned A, B, C, D;
|
811 |
|
|
//We also want to buffer out the state variables, to eliminate
|
812 |
|
|
//the risk of repeated pointer dereferences.
|
813 |
|
|
unsigned X[16];
|
814 |
|
|
//Buffer to avoid repeated dereferences.
|
815 |
|
|
|
816 |
|
|
assert(arg != NULL);
|
817 |
|
|
|
818 |
|
|
//Copy bytes into words.
|
819 |
|
|
MD5_CopyBytesToWords(arg);
|
820 |
|
|
|
821 |
|
|
//Copy out the buffer for speed.
|
822 |
|
|
X[ 0] = arg->X[ 0];
|
823 |
|
|
X[ 1] = arg->X[ 1];
|
824 |
|
|
X[ 2] = arg->X[ 2];
|
825 |
|
|
X[ 3] = arg->X[ 3];
|
826 |
|
|
X[ 4] = arg->X[ 4];
|
827 |
|
|
X[ 5] = arg->X[ 5];
|
828 |
|
|
X[ 6] = arg->X[ 6];
|
829 |
|
|
X[ 7] = arg->X[ 7];
|
830 |
|
|
X[ 8] = arg->X[ 8];
|
831 |
|
|
X[ 9] = arg->X[ 9];
|
832 |
|
|
X[10] = arg->X[10];
|
833 |
|
|
X[11] = arg->X[11];
|
834 |
|
|
X[12] = arg->X[12];
|
835 |
|
|
X[13] = arg->X[13];
|
836 |
|
|
X[14] = arg->X[14];
|
837 |
|
|
X[15] = arg->X[15];
|
838 |
|
|
|
839 |
|
|
//Buffer out the state for speed.
|
840 |
|
|
A = arg->A;
|
841 |
|
|
B = arg->B;
|
842 |
|
|
C = arg->C;
|
843 |
|
|
D = arg->D;
|
844 |
|
|
|
845 |
|
|
//Make the assignments to temporary variables as described by the RFC.
|
846 |
|
|
AA = A;
|
847 |
|
|
BB = B;
|
848 |
|
|
CC = C;
|
849 |
|
|
DD = D;
|
850 |
|
|
|
851 |
|
|
//We can now do the MD-5 rounds directly as described in the RFC. The
|
852 |
|
|
//most effective way to do this is with macros. I tried using a tabulated
|
853 |
|
|
//approach, but the speed hit was unbelievably bad. This approach is
|
854 |
|
|
//about the best known.
|
855 |
|
|
//
|
856 |
|
|
//Round 1
|
857 |
|
|
//
|
858 |
|
|
MD5_FUNC_FF(A,B,C,D,X[ 0], 7,0xd76aa478); /* 1 */
|
859 |
|
|
MD5_FUNC_FF(D,A,B,C,X[ 1],12,0xe8c7b756); /* 2 */
|
860 |
|
|
MD5_FUNC_FF(C,D,A,B,X[ 2],17,0x242070db); /* 3 */
|
861 |
|
|
MD5_FUNC_FF(B,C,D,A,X[ 3],22,0xc1bdceee); /* 4 */
|
862 |
|
|
MD5_FUNC_FF(A,B,C,D,X[ 4], 7,0xf57c0faf); /* 5 */
|
863 |
|
|
MD5_FUNC_FF(D,A,B,C,X[ 5],12,0x4787c62a); /* 6 */
|
864 |
|
|
MD5_FUNC_FF(C,D,A,B,X[ 6],17,0xa8304613); /* 7 */
|
865 |
|
|
MD5_FUNC_FF(B,C,D,A,X[ 7],22,0xfd469501); /* 8 */
|
866 |
|
|
MD5_FUNC_FF(A,B,C,D,X[ 8], 7,0x698098d8); /* 9 */
|
867 |
|
|
MD5_FUNC_FF(D,A,B,C,X[ 9],12,0x8b44f7af); /* 10 */
|
868 |
|
|
MD5_FUNC_FF(C,D,A,B,X[10],17,0xffff5bb1); /* 11 */
|
869 |
|
|
MD5_FUNC_FF(B,C,D,A,X[11],22,0x895cd7be); /* 12 */
|
870 |
|
|
MD5_FUNC_FF(A,B,C,D,X[12], 7,0x6b901122); /* 13 */
|
871 |
|
|
MD5_FUNC_FF(D,A,B,C,X[13],12,0xfd987193); /* 14 */
|
872 |
|
|
MD5_FUNC_FF(C,D,A,B,X[14],17,0xa679438e); /* 15 */
|
873 |
|
|
MD5_FUNC_FF(B,C,D,A,X[15],22,0x49b40821); /* 16 */
|
874 |
|
|
//
|
875 |
|
|
//Round 2
|
876 |
|
|
//
|
877 |
|
|
MD5_FUNC_GG(A,B,C,D,X[ 1], 5,0xf61e2562); /* 17 */
|
878 |
|
|
MD5_FUNC_GG(D,A,B,C,X[ 6], 9,0xc040b340); /* 18 */
|
879 |
|
|
MD5_FUNC_GG(C,D,A,B,X[11],14,0x265e5a51); /* 19 */
|
880 |
|
|
MD5_FUNC_GG(B,C,D,A,X[ 0],20,0xe9b6c7aa); /* 20 */
|
881 |
|
|
MD5_FUNC_GG(A,B,C,D,X[ 5], 5,0xd62f105d); /* 21 */
|
882 |
|
|
MD5_FUNC_GG(D,A,B,C,X[10], 9,0x02441453); /* 22 */
|
883 |
|
|
MD5_FUNC_GG(C,D,A,B,X[15],14,0xd8a1e681); /* 23 */
|
884 |
|
|
MD5_FUNC_GG(B,C,D,A,X[ 4],20,0xe7d3fbc8); /* 24 */
|
885 |
|
|
MD5_FUNC_GG(A,B,C,D,X[ 9], 5,0x21e1cde6); /* 25 */
|
886 |
|
|
MD5_FUNC_GG(D,A,B,C,X[14], 9,0xc33707d6); /* 26 */
|
887 |
|
|
MD5_FUNC_GG(C,D,A,B,X[ 3],14,0xf4d50d87); /* 27 */
|
888 |
|
|
MD5_FUNC_GG(B,C,D,A,X[ 8],20,0x455a14ed); /* 28 */
|
889 |
|
|
MD5_FUNC_GG(A,B,C,D,X[13], 5,0xa9e3e905); /* 29 */
|
890 |
|
|
MD5_FUNC_GG(D,A,B,C,X[ 2], 9,0xfcefa3f8); /* 30 */
|
891 |
|
|
MD5_FUNC_GG(C,D,A,B,X[ 7],14,0x676f02d9); /* 31 */
|
892 |
|
|
MD5_FUNC_GG(B,C,D,A,X[12],20,0x8d2a4c8a); /* 32 */
|
893 |
|
|
//
|
894 |
|
|
//Round 3
|
895 |
|
|
//
|
896 |
|
|
MD5_FUNC_HH(A,B,C,D,X[ 5], 4,0xfffa3942); /* 33 */
|
897 |
|
|
MD5_FUNC_HH(D,A,B,C,X[ 8],11,0x8771f681); /* 34 */
|
898 |
|
|
MD5_FUNC_HH(C,D,A,B,X[11],16,0x6d9d6122); /* 35 */
|
899 |
|
|
MD5_FUNC_HH(B,C,D,A,X[14],23,0xfde5380c); /* 36 */
|
900 |
|
|
MD5_FUNC_HH(A,B,C,D,X[ 1], 4,0xa4beea44); /* 37 */
|
901 |
|
|
MD5_FUNC_HH(D,A,B,C,X[ 4],11,0x4bdecfa9); /* 38 */
|
902 |
|
|
MD5_FUNC_HH(C,D,A,B,X[ 7],16,0xf6bb4b60); /* 39 */
|
903 |
|
|
MD5_FUNC_HH(B,C,D,A,X[10],23,0xbebfbc70); /* 40 */
|
904 |
|
|
MD5_FUNC_HH(A,B,C,D,X[13], 4,0x289b7ec6); /* 41 */
|
905 |
|
|
MD5_FUNC_HH(D,A,B,C,X[ 0],11,0xeaa127fa); /* 42 */
|
906 |
|
|
MD5_FUNC_HH(C,D,A,B,X[ 3],16,0xd4ef3085); /* 43 */
|
907 |
|
|
MD5_FUNC_HH(B,C,D,A,X[ 6],23,0x04881d05); /* 44 */
|
908 |
|
|
MD5_FUNC_HH(A,B,C,D,X[ 9], 4,0xd9d4d039); /* 45 */
|
909 |
|
|
MD5_FUNC_HH(D,A,B,C,X[12],11,0xe6db99e5); /* 46 */
|
910 |
|
|
MD5_FUNC_HH(C,D,A,B,X[15],16,0x1fa27cf8); /* 47 */
|
911 |
|
|
MD5_FUNC_HH(B,C,D,A,X[ 2],23,0xc4ac5665); /* 48 */
|
912 |
|
|
//
|
913 |
|
|
//Round 4
|
914 |
|
|
//
|
915 |
|
|
MD5_FUNC_II(A,B,C,D,X[ 0], 6,0xf4292244); /* 49 */
|
916 |
|
|
MD5_FUNC_II(D,A,B,C,X[ 7],10,0x432aff97); /* 50 */
|
917 |
|
|
MD5_FUNC_II(C,D,A,B,X[14],15,0xab9423a7); /* 51 */
|
918 |
|
|
MD5_FUNC_II(B,C,D,A,X[ 5],21,0xfc93a039); /* 52 */
|
919 |
|
|
MD5_FUNC_II(A,B,C,D,X[12], 6,0x655b59c3); /* 53 */
|
920 |
|
|
MD5_FUNC_II(D,A,B,C,X[ 3],10,0x8f0ccc92); /* 54 */
|
921 |
|
|
MD5_FUNC_II(C,D,A,B,X[10],15,0xffeff47d); /* 55 */
|
922 |
|
|
MD5_FUNC_II(B,C,D,A,X[ 1],21,0x85845dd1); /* 56 */
|
923 |
|
|
MD5_FUNC_II(A,B,C,D,X[ 8], 6,0x6fa87e4f); /* 57 */
|
924 |
|
|
MD5_FUNC_II(D,A,B,C,X[15],10,0xfe2ce6e0); /* 58 */
|
925 |
|
|
MD5_FUNC_II(C,D,A,B,X[ 6],15,0xa3014314); /* 59 */
|
926 |
|
|
MD5_FUNC_II(B,C,D,A,X[13],21,0x4e0811a1); /* 60 */
|
927 |
|
|
MD5_FUNC_II(A,B,C,D,X[ 4], 6,0xf7537e82); /* 61 */
|
928 |
|
|
MD5_FUNC_II(D,A,B,C,X[11],10,0xbd3af235); /* 62 */
|
929 |
|
|
MD5_FUNC_II(C,D,A,B,X[ 2],15,0x2ad7d2bb); /* 63 */
|
930 |
|
|
MD5_FUNC_II(B,C,D,A,X[ 9],21,0xeb86d391); /* 64 */
|
931 |
|
|
//End of Round 4.
|
932 |
|
|
|
933 |
|
|
//Perform the four additions as mandated by the RFC.
|
934 |
|
|
A += AA;
|
935 |
|
|
B += BB;
|
936 |
|
|
C += CC;
|
937 |
|
|
D += DD;
|
938 |
|
|
|
939 |
|
|
//Buffer the state vector back.
|
940 |
|
|
arg->A = A;
|
941 |
|
|
arg->B = B;
|
942 |
|
|
arg->C = C;
|
943 |
|
|
arg->D = D;
|
944 |
|
|
}
|
945 |
|
|
|
946 |
|
|
|
947 |
|
|
void MD5_Md5StateStructAddData(struct MD5_Md5StateStruct *arg,
|
948 |
|
|
void *pointer_in,
|
949 |
|
|
size_t len)
|
950 |
|
|
{
|
951 |
|
|
unsigned int low_32;
|
952 |
|
|
unsigned int byte_offset;
|
953 |
|
|
unsigned char *data;
|
954 |
|
|
|
955 |
|
|
assert(arg != NULL);
|
956 |
|
|
assert(pointer_in != NULL);
|
957 |
|
|
|
958 |
|
|
data = (unsigned char *)pointer_in;
|
959 |
|
|
//It is easier to do it this way, rather than cast all the time.
|
960 |
|
|
|
961 |
|
|
low_32 = (unsigned int)arg->bit_count;
|
962 |
|
|
//Copy off the least significant bits. Easier to do once.
|
963 |
|
|
|
964 |
|
|
byte_offset = low_32 >> 3;
|
965 |
|
|
//This gives our byte offset, up to 500+Mb or so.
|
966 |
|
|
//This wraps modulo 64 (i.e. even if the data item overflows, we should be OK.
|
967 |
|
|
|
968 |
|
|
while(len--)
|
969 |
|
|
{
|
970 |
|
|
//We process rounds AFTER a byte is added to the buffer. So
|
971 |
|
|
//it is always safe to add a byte first.
|
972 |
|
|
arg->buf[byte_offset & 0x3F] = *data;
|
973 |
|
|
|
974 |
|
|
//Nothing to do unless this was the final byte of the buffer.
|
975 |
|
|
if ((byte_offset & 0x3F) == 63)
|
976 |
|
|
{
|
977 |
|
|
MD5_DoMd5Rounds(arg);
|
978 |
|
|
}
|
979 |
|
|
|
980 |
|
|
//Increment.
|
981 |
|
|
data++;
|
982 |
|
|
byte_offset++;
|
983 |
|
|
arg->bit_count += 8;
|
984 |
|
|
}
|
985 |
|
|
}
|
986 |
|
|
|
987 |
|
|
|
988 |
|
|
void MD5_Md5StateStructClose(struct MD5_Md5StateStruct *state,
|
989 |
|
|
struct MD5_Md5ResultStruct *result)
|
990 |
|
|
{
|
991 |
|
|
unsigned int low_32, high_32, high_32_copy, low_32_copy;
|
992 |
|
|
unsigned int byte_offset;
|
993 |
|
|
unsigned int buffer_offset;
|
994 |
|
|
unsigned char length_buf[8];
|
995 |
|
|
//int i;
|
996 |
|
|
|
997 |
|
|
assert(state != NULL);
|
998 |
|
|
assert(result != NULL);
|
999 |
|
|
|
1000 |
|
|
//Obtain easier-to-use indices. These provide a snapshot of the
|
1001 |
|
|
//length before padding is done.
|
1002 |
|
|
low_32 = (unsigned int)state->bit_count;
|
1003 |
|
|
high_32 = (unsigned int)(state->bit_count >> 32);
|
1004 |
|
|
byte_offset = low_32 >> 3;
|
1005 |
|
|
buffer_offset = byte_offset & 0x3F;
|
1006 |
|
|
|
1007 |
|
|
//We need to pad the buffer out to 8 bytes short of a multiple,
|
1008 |
|
|
//per RFC 1321.
|
1009 |
|
|
MD5_Md5StateStructAddData(state,
|
1010 |
|
|
MD5_pad_table,
|
1011 |
|
|
(buffer_offset==56) ? (64) : ((56 - buffer_offset) & 0x3F));
|
1012 |
|
|
|
1013 |
|
|
//At this point we are fully prepped to stuff in the length in bits.
|
1014 |
|
|
//Prepare the length in a buffer.
|
1015 |
|
|
high_32_copy = high_32;
|
1016 |
|
|
low_32_copy = low_32;
|
1017 |
|
|
length_buf[0] = (unsigned char)(low_32_copy);
|
1018 |
|
|
length_buf[1] = (unsigned char)(low_32_copy >> 8);
|
1019 |
|
|
length_buf[2] = (unsigned char)(low_32_copy >> 16);
|
1020 |
|
|
length_buf[3] = (unsigned char)(low_32_copy >> 24);
|
1021 |
|
|
length_buf[4] = (unsigned char)(high_32_copy);
|
1022 |
|
|
length_buf[5] = (unsigned char)(high_32_copy >> 8);
|
1023 |
|
|
length_buf[6] = (unsigned char)(high_32_copy >> 16);
|
1024 |
|
|
length_buf[7] = (unsigned char)(high_32_copy >> 24);
|
1025 |
|
|
|
1026 |
|
|
//Tack on the length. This is guaranteed to generate end up with
|
1027 |
|
|
//the last thing being done the compute plus the index being zero.
|
1028 |
|
|
//
|
1029 |
|
|
MD5_Md5StateStructAddData(state,
|
1030 |
|
|
length_buf,
|
1031 |
|
|
8);
|
1032 |
|
|
|
1033 |
|
|
//Be absolutely sure we are rolled over to zero.
|
1034 |
|
|
assert((((int)state->bit_count) & 0x1FF) == 0);
|
1035 |
|
|
|
1036 |
|
|
//Zero out the return state, just to be sure.
|
1037 |
|
|
memset(result, 0, sizeof(struct MD5_Md5ResultStruct));
|
1038 |
|
|
|
1039 |
|
|
//Give caller the binary version.
|
1040 |
|
|
result->md5_words[0] = state->A;
|
1041 |
|
|
result->md5_words[1] = state->B;
|
1042 |
|
|
result->md5_words[2] = state->C;
|
1043 |
|
|
result->md5_words[3] = state->D;
|
1044 |
|
|
|
1045 |
|
|
//Convert to string for caller.
|
1046 |
|
|
CHARFUNC_int_to_lc_hex_rev(state->A, result->md5_chars + 0);
|
1047 |
|
|
CHARFUNC_int_to_lc_hex_rev(state->B, result->md5_chars + 8);
|
1048 |
|
|
CHARFUNC_int_to_lc_hex_rev(state->C, result->md5_chars + 16);
|
1049 |
|
|
CHARFUNC_int_to_lc_hex_rev(state->D, result->md5_chars + 24);
|
1050 |
|
|
|
1051 |
|
|
//Because of the way the CHARFUNC_int_to_lc_hex_rev() function
|
1052 |
|
|
//works, it produces the mirror image of the sequence of nibbles.
|
1053 |
|
|
//This is not quite what we want. What we want (least significant
|
1054 |
|
|
//byte first, but within each byte most significant nibble first)
|
1055 |
|
|
//from each integer is this:
|
1056 |
|
|
//
|
1057 |
|
|
// n1 n0 n3 n2 n5 n4 n7 n6
|
1058 |
|
|
//
|
1059 |
|
|
//but what we get from that function is this:
|
1060 |
|
|
//
|
1061 |
|
|
// n0 n1 n2 n3 n4 n5 n6 n6,
|
1062 |
|
|
//
|
1063 |
|
|
//so we have to swap nibbles in each byte.
|
1064 |
|
|
//
|
1065 |
|
|
{
|
1066 |
|
|
int i;
|
1067 |
|
|
char temp;
|
1068 |
|
|
|
1069 |
|
|
for (i=0; i<16; i++)
|
1070 |
|
|
{
|
1071 |
|
|
temp = result->md5_chars[i*2];
|
1072 |
|
|
result->md5_chars[i*2] = result->md5_chars[i*2+1];
|
1073 |
|
|
result->md5_chars[i*2+1] = temp;
|
1074 |
|
|
}
|
1075 |
|
|
}
|
1076 |
|
|
|
1077 |
|
|
result->md5_chars[32] = 0; //Terminator.
|
1078 |
|
|
|
1079 |
|
|
//Destroy the state, which may contain sensitive information.
|
1080 |
|
|
//This idea came from Rivest's sample code.
|
1081 |
|
|
memset(state, 0, sizeof(struct MD5_Md5StateStruct));
|
1082 |
|
|
}
|
1083 |
|
|
|
1084 |
|
|
|
1085 |
|
|
//Returns version control string for file.
|
1086 |
|
|
//
|
1087 |
|
|
const char *MD5_cvcinfo(void)
|
1088 |
|
|
{
|
1089 |
|
|
return ("$Header: /home/dashley/cvsrep/e3ft_gpl01/e3ft_gpl01/lib_c++_c_asm_non_uc/src_os_unix_win/c___app_common/md5/md5.c,v 1.5 2007/01/27 03:34:17 dashley Exp $");
|
1090 |
|
|
}
|
1091 |
|
|
|
1092 |
|
|
|
1093 |
|
|
//Returns version control string for associated .H file.
|
1094 |
|
|
//
|
1095 |
|
|
const char *MD5_hvcinfo(void)
|
1096 |
|
|
{
|
1097 |
|
|
return (MD5_H_VERSION);
|
1098 |
|
|
}
|
1099 |
|
|
|
1100 |
|
|
|
1101 |
|
|
//*****************************************************************************
|
1102 |
|
|
// $Log: md5.c,v $
|
1103 |
|
|
// Revision 1.5 2007/01/27 03:34:17 dashley
|
1104 |
|
|
// a)Block data operation changed to take length argument of type size_t.
|
1105 |
|
|
// b)Unit-testing has been completed.
|
1106 |
|
|
//
|
1107 |
|
|
// Revision 1.4 2007/01/27 03:16:44 dashley
|
1108 |
|
|
// Edits.
|
1109 |
|
|
//
|
1110 |
|
|
// Revision 1.3 2007/01/27 01:40:51 dashley
|
1111 |
|
|
// GPL license statements added and enhanced.
|
1112 |
|
|
//
|
1113 |
|
|
// Revision 1.2 2007/01/13 06:16:27 dashley
|
1114 |
|
|
// Edits for compilation under Linux.
|
1115 |
|
|
//
|
1116 |
|
|
// Revision 1.1 2007/01/13 04:45:42 dashley
|
1117 |
|
|
// Initial checkin.
|
1118 |
|
|
//*****************************************************************************
|
1119 |
|
|
// End of $RCSfile: md5.c,v $.
|