/[dtapublic]/projs/trunk/shared_source/c_datd/esrg_md5.c
ViewVC logotype

Contents of /projs/trunk/shared_source/c_datd/esrg_md5.c

Parent Directory Parent Directory | Revision Log Revision Log


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

dashley@gmail.com
ViewVC Help
Powered by ViewVC 1.1.25