new build system

git-svn-id: svn://tug.org/texlive/trunk@12448 c570f23f-e606-0410-a88d-b1316a301751

10 files changed, 0 insertions, 1268 deletions

diff --git a/Build/source/libs/luamd5/makefile b/Build/source/libs/luamd5/makefile
deleted file mode 100644
index 78ea7b7cb60..00000000000
--- a/Build/source/libs/luamd5/makefile
+++ /dev/null
@@ -1,23 +0,0 @@
-# Location of Lua header files
-LUA_DIR = /usr/local/include/
-
-# Compilation parameters
-CC = gcc
-CWARNS = -Wall -Wmissing-prototypes -Wshadow -pedantic -Wpointer-arith -Wcast-align -Waggregate-return
-CFLAGS = $(CONFIG) $(CWARNS) -ansi -O2 -I$(LUA_DIR)
-
-
-# Files in this distribution
-FILES = makefile \
-	md5.c \
-	md5lib.c \
-	md5.h \
-	md5.lua \
-	md5.html \
-	md5tests.lua
-
-# Rule to create shared library, to be used with `loadlib' (see also
-# file `md5.lua')
-md5 : md5.o md5lib.o
-	ld -o libmd5.so -shared md5.o md5lib.o
-
diff --git a/Build/source/libs/luamd5/md5.c b/Build/source/libs/luamd5/md5.c
deleted file mode 100644
index 7e630bfc46b..00000000000
--- a/Build/source/libs/luamd5/md5.c
+++ /dev/null
@@ -1,209 +0,0 @@
-/**
-*  $Id: md5.c,v 1.1 2000/11/09 19:19:59 roberto Exp $
-*  Hash function MD5
-*  @author  Marcela Ozorio Suarez, Roberto I.
-*/
-
-
-#include <string.h>
-
-#include "md5.h"
-
-
-#define WORD 32
-#define MASK 0xFFFFFFFF
-typedef unsigned long WORD32;
-
-
-/**
-*  md5 hash function.
-*  @param message: aribtary string.
-*  @param len: message length.
-*  @param output: buffer to receive the hash value. Its size must be
-*  (at least) HASHSIZE.
-*/
-void md5 (const char *message, long len, char *output);
-
-
-
-/*
-** Realiza a rotacao no sentido horario dos bits da variavel 'D' do tipo WORD32.
-** Os bits sao deslocados de 'num' posicoes
-*/
-#define rotate(D, num)  (D<<num) | (D>>(WORD-num))
-
-/*Macros que definem operacoes relizadas pelo algoritmo  md5 */
-#define F(x, y, z) (((x) & (y)) | ((~(x)) & (z)))
-#define G(x, y, z) (((x) & (z)) | ((y) & (~(z))))
-#define H(x, y, z) ((x) ^ (y) ^ (z))
-#define I(x, y, z) ((y) ^ ((x) | (~(z))))
-
-
-/*vetor de numeros utilizados pelo algoritmo md5 para embaralhar bits */
-static const WORD32 T[64]={
-                     0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
-                     0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
-                     0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
-                     0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
-                     0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
-                     0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
-                     0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
-                     0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
-                     0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
-                     0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
-                     0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
-                     0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
-                     0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
-                     0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
-                     0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
-                     0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
-};
-
-
-static void word32tobytes (const WORD32 *input, char *output) {
-  int j = 0;
-  while (j<4*4) {
-    WORD32 v = *input++;
-    output[j++] = (char)(v & 0xff); v >>= 8;
-    output[j++] = (char)(v & 0xff); v >>= 8;
-    output[j++] = (char)(v & 0xff); v >>= 8;
-    output[j++] = (char)(v & 0xff);
-  }
-}
-
-
-static void inic_digest(WORD32 *d) {
-  d[0] = 0x67452301;
-  d[1] = 0xEFCDAB89;
-  d[2] = 0x98BADCFE;
-  d[3] = 0x10325476;
-}
-
-
-/*funcao que implemeta os quatro passos principais do algoritmo MD5 */
-static void digest(const WORD32 *m, WORD32 *d) {
-  int j;
-  /*MD5 PASSO1 */
-  for (j=0; j<4*4; j+=4) {
-    d[0] = d[0]+ F(d[1], d[2], d[3])+ m[j] + T[j];       d[0]=rotate(d[0], 7);
-    d[0]+=d[1];
-    d[3] = d[3]+ F(d[0], d[1], d[2])+ m[(j)+1] + T[j+1]; d[3]=rotate(d[3], 12);
-    d[3]+=d[0];
-    d[2] = d[2]+ F(d[3], d[0], d[1])+ m[(j)+2] + T[j+2]; d[2]=rotate(d[2], 17);
-    d[2]+=d[3];
-    d[1] = d[1]+ F(d[2], d[3], d[0])+ m[(j)+3] + T[j+3]; d[1]=rotate(d[1], 22);
-    d[1]+=d[2];
-  }
-  /*MD5 PASSO2 */
-  for (j=0; j<4*4; j+=4) {
-    d[0] = d[0]+ G(d[1], d[2], d[3])+ m[(5*j+1)&0x0f] + T[(j-1)+17];
-    d[0] = rotate(d[0],5);
-    d[0]+=d[1];
-    d[3] = d[3]+ G(d[0], d[1], d[2])+ m[((5*(j+1)+1)&0x0f)] + T[(j+0)+17];
-    d[3] = rotate(d[3], 9);
-    d[3]+=d[0];
-    d[2] = d[2]+ G(d[3], d[0], d[1])+ m[((5*(j+2)+1)&0x0f)] + T[(j+1)+17];
-    d[2] = rotate(d[2], 14);
-    d[2]+=d[3];
-    d[1] = d[1]+ G(d[2], d[3], d[0])+ m[((5*(j+3)+1)&0x0f)] + T[(j+2)+17];
-    d[1] = rotate(d[1], 20);
-    d[1]+=d[2];
-  }
-  /*MD5 PASSO3 */
-  for (j=0; j<4*4; j+=4) {
-    d[0] = d[0]+ H(d[1], d[2], d[3])+ m[(3*j+5)&0x0f] + T[(j-1)+33];
-    d[0] = rotate(d[0], 4);
-    d[0]+=d[1];
-    d[3] = d[3]+ H(d[0], d[1], d[2])+ m[(3*(j+1)+5)&0x0f] + T[(j+0)+33];
-    d[3] = rotate(d[3], 11);
-    d[3]+=d[0];
-    d[2] = d[2]+ H(d[3], d[0], d[1])+ m[(3*(j+2)+5)&0x0f] + T[(j+1)+33];
-    d[2] = rotate(d[2], 16);
-    d[2]+=d[3];
-    d[1] = d[1]+ H(d[2], d[3], d[0])+ m[(3*(j+3)+5)&0x0f] + T[(j+2)+33];
-    d[1] = rotate(d[1], 23);
-    d[1]+=d[2];
-  }
-  /*MD5 PASSO4 */
-  for (j=0; j<4*4; j+=4) {
-    d[0] = d[0]+ I(d[1], d[2], d[3])+ m[(7*j)&0x0f] + T[(j-1)+49];
-    d[0] = rotate(d[0], 6);
-    d[0]+=d[1];
-    d[3] = d[3]+ I(d[0], d[1], d[2])+ m[(7*(j+1))&0x0f] + T[(j+0)+49];
-    d[3] = rotate(d[3], 10);
-    d[3]+=d[0];
-    d[2] = d[2]+ I(d[3], d[0], d[1])+ m[(7*(j+2))&0x0f] + T[(j+1)+49];
-    d[2] = rotate(d[2], 15);
-    d[2]+=d[3];
-    d[1] = d[1]+ I(d[2], d[3], d[0])+ m[(7*(j+3))&0x0f] + T[(j+2)+49];
-    d[1] = rotate(d[1], 21);
-    d[1]+=d[2];
-  }
-}
-
-
-static void bytestoword32 (WORD32 *x, const char *pt) {
-  int i;
-  for (i=0; i<16; i++) {
-    int j=i*4;
-    x[i] = (((WORD32)(unsigned char)pt[j+3] << 8 |
-           (WORD32)(unsigned char)pt[j+2]) << 8 |
-           (WORD32)(unsigned char)pt[j+1]) << 8 |
-           (WORD32)(unsigned char)pt[j];
-  }
-
-}
-
-
-static void put_length(WORD32 *x, long len) {
-  /* in bits! */
-  x[14] = (WORD32)((len<<3) & MASK);
-  x[15] = (WORD32)(len>>(32-3) & 0x7);
-}
-
-
-/*
-** returned status:
-*  0 - normal message (full 64 bytes)
-*  1 - enough room for 0x80, but not for message length (two 4-byte words)
-*  2 - enough room for 0x80 plus message length (at least 9 bytes free)
-*/
-static int converte (WORD32 *x, const char *pt, int num, int old_status) {
-  int new_status = 0;
-  char buff[64];
-  if (num<64) {
-    memcpy(buff, pt, num);  /* to avoid changing original string */
-    memset(buff+num, 0, 64-num);
-    if (old_status == 0)
-      buff[num] = '\200';
-    new_status = 1;
-    pt = buff;
-  }
-  bytestoword32(x, pt);
-  if (num <= (64 - 9))
-    new_status = 2;
-  return new_status;
-}
-
-
-
-void md5 (const char *message, long len, char *output) {
-  WORD32 d[4];
-  int status = 0;
-  long i = 0;
-  inic_digest(d);
-  while (status != 2) {
-    WORD32 d_old[4];
-    WORD32 wbuff[16];
-    int numbytes = (len-i >= 64) ? 64 : len-i;
-    /*salva os valores do vetor digest*/
-    d_old[0]=d[0]; d_old[1]=d[1]; d_old[2]=d[2]; d_old[3]=d[3];
-    status = converte(wbuff, message+i, numbytes, status);
-    if (status == 2) put_length(wbuff, len);
-    digest(wbuff, d);
-    d[0]+=d_old[0]; d[1]+=d_old[1]; d[2]+=d_old[2]; d[3]+=d_old[3];
-    i += numbytes;
-  }
-  word32tobytes(d, output);
-}
-
diff --git a/Build/source/libs/luamd5/md5.h b/Build/source/libs/luamd5/md5.h
deleted file mode 100644
index 80d43f72687..00000000000
--- a/Build/source/libs/luamd5/md5.h
+++ /dev/null
@@ -1,20 +0,0 @@
-/**
-*  $Id: md5.h,v 1.2 2003/04/28 16:25:44 roberto Exp $
-*  Cryptographic module for Lua.
-*  @author  Roberto Ierusalimschy
-*/
-
-
-#ifndef md5_h
-#define md5_h
-
-#include <lua.h>
-
-
-#define HASHSIZE       16
-
-void md5 (const char *message, long len, char *output);
-int luaopen_md5 (lua_State *L);
-
-
-#endif
diff --git a/Build/source/libs/luamd5/md5.html b/Build/source/libs/luamd5/md5.html
deleted file mode 100644
index 1f47c971286..00000000000
--- a/Build/source/libs/luamd5/md5.html
+++ /dev/null
@@ -1,122 +0,0 @@
-<html><body>
-<h1>Cryptographic Library for Lua 5.0</h1>
-
-<p>
-This library offers basic cryptographic facilities for Lua 5.0:
-a hash (digest) function, an a pair crypt/decrypt.
-(<a href=md5.tar.gz>download</a>)
-
-
-<h2>Lua API</h2>
-
-All functions are registered inside a table <code>md5</code>.
-
-<ul>
-
-<li><code>md5.sum (message)</code>
-<p>
-Computes the MD5 message-digest of the string <code>message</code>.
-This function takes as input a message of arbitrary length and content
-and returns as output a 128-bit "fingerprint" (or "message digest")
-of the input.
-The output is formated as a binary string with 16 characters.
-It is conjectured that it is computationally infeasible to produce
-two messages having the same message digest, or to produce any
-message having a given pre-specified target message digest.
-(see <a href="ftp://ftp.isi.edu/in-notes/rfc1321.txt">
-RFC 1321</a>)
-<p>
-
-<li><code>md5.sumhexa (message)</code>
-<p>
-Similar to <code>md5.sum</code>,
-but returns its value as a string of 32 hexadecimal digits.
-
-<li><code>md5.crypt (message, key [,seed])</code>
-<p>
-Encrypts a string, using MD5 in CFB (Cipher-feedback mode).
-<code>message</code> is an arbitrary binary string to be encrypted.
-<code>key</code> is an arbitrary binary string to be used as a key.
-<code>seed</code> is an arbitrary binary string to be used as a seed;
-Returns the cyphertext (as a binary string).
-
-<p>
-If no seed is provided,
-the function uses the result of <code>os.time()</code> as a seed.
-It is recommended that you use different seeds for each message;
-the seed itself is not private, and should contain no private data,
-because it goes plain in the beginning of the encrypted message.
-
-<p>
-The length of the cyphertext is the length of the message plus the
-length of the seed plus one.
-<p>
-
-<li><code>md5.decrypt (message, key)</code>
-<p>
-Decrypts a string.
-The input <code>message</code> must be the result of a previous call
-to <code>crypt</code>.
-For any <code>msg</code>, <code>key</code>,
-and <code>seed</code>, we have that
-<pre>
-  md5.decrypt(md5.crypt(msg, key, seed), key) == msg
-</pre>
-<p>
-
-<li><code>md5.exor (s1, s2)</code>
-<p>
-Does a bit-a-bit exclusive or of strings <code>s1</code> and <code>s2</code>.
-Both strings must have the same length,
-which will be also the length of the resulting string.
-<p>
-
-</ul>
-
-
-<h2>C API</h2>
-
-The following functions are declared in <code>md5.h</code>
-<ul>
-
-<li><code>int luaopen_md5 (lua_State *L);</code>
-<p>
-Opens the library:
-Registers the above Lua functions in the given state.
-<p>
-
-<li><code>void md5 (const char *message, long len, char *output);</code>
-<p>
-Computes the MD5 message-digest of <code>message</code>.
-<code>len</code> is the length of <code>message</code>.
-<code>output</code> is a buffer that receives the result;
-it must have at least 16 bytes (128 bits).
-<p>
-
-</ul>
-
-<h2>INSTALL</h2>
-
-The following instructions assume that your Lua installation has a dynamic
-linking facility (function <code>loadlib</code>):
-
-<ul>
-
-<li>Build a shared library (<code>.so</code>, <code>.dll</code>, etc.)
-with files <code>md5.c</code> and <code>md5lib.c</code>.
-(There is a <code>makefile</code> for Linux and similar systems.)
-
-<li>Put the shared library somewhere,
-and edit file <code>md5.lua</code> to point to it.
-
-<li>Put the file <code>md5.lua</code> in a directory of your
-<code>LUA_PATH</code>.
-
-</ul>
-
-<p><br><small><em>
-$Id: md5.html,v 1.4 2003/04/28 16:40:42 roberto Exp $
-</em></small>
-
-</body></html>
-
diff --git a/Build/source/libs/luamd5/md5.lua b/Build/source/libs/luamd5/md5.lua
deleted file mode 100644
index 0e0c4912dd9..00000000000
--- a/Build/source/libs/luamd5/md5.lua
+++ /dev/null
@@ -1,22 +0,0 @@
--- md5.lua
--- (you should put this file in any directory of your LUA_PATH)
-
-
--- change the next line to point to the md5 dynamic library
-
--- local path = "/usr/local/lua/lib/libmd5.so"
---local path = "./libmd5.so"
-
---assert(loadlib(path, "luaopen_md5"))()
-
-
--- Returns the md5 hash value as a string of hexadecimal digits
-
-function md5.sumhexa (k)
-  k = md5.sum(k)
-  return (string.gsub(k, ".", function (c)
-           return string.format("%02x", string.byte(c))
-         end))
-end
-
-return md5
diff --git a/Build/source/libs/luamd5/md5lib.c b/Build/source/libs/luamd5/md5lib.c
deleted file mode 100644
index 7c72a16fcb6..00000000000
--- a/Build/source/libs/luamd5/md5lib.c
+++ /dev/null
@@ -1,183 +0,0 @@
-/**
-*  $Id: md5lib.c,v 1.2 2003/04/28 16:25:44 roberto Exp $
-*  Cryptographic and Hash functions for Lua
-*  @version  1.0
-*  @author  Roberto Ierusalimschy
-*/
-
-
-#include <stdlib.h>
-#include <string.h>
-#include <time.h>
-
-#include <lua.h>
-#include <lauxlib.h>
-
-#include "md5.h"
-
-
-/**
-*  Hash function. Returns a hash for a given string.
-*  @param message: arbitrary binary string.
-*  @return  A 128-bit hash string.
-*/
-static int lmd5 (lua_State *L) {
-  char buff[16];
-  size_t l;
-  const char *message = luaL_checklstring(L, 1, &l);
-  md5(message, l, buff);
-  lua_pushlstring(L, buff, 16L);
-  return 1;
-}
-
-
-/**
-*  X-Or. Does a bit-a-bit exclusive-or of two strings.
-*  @param s1: arbitrary binary string.
-*  @param s2: arbitrary binary string with same length as s1.
-*  @return  a binary string with same length as s1 and s2,
-*   where each bit is the exclusive-or of the corresponding bits in s1-s2.
-*/
-static int ex_or (lua_State *L) {
-  size_t l1, l2;
-  const char *s1 = luaL_checklstring(L, 1, &l1);
-  const char *s2 = luaL_checklstring(L, 2, &l2);
-  luaL_Buffer b;
-  luaL_argcheck( L, l1 == l2, 2, "lengths must be equal" );
-  luaL_buffinit(L, &b);
-  while (l1--) luaL_putchar(&b, (*s1++)^(*s2++));
-  luaL_pushresult(&b);
-  return 1;
-}
-
-
-static void checkseed (lua_State *L) {
-  if (lua_isnone(L, 3)) {  /* no seed? */
-    time_t tm = time(NULL);  /* for `random' seed */
-    lua_pushlstring(L, (char *)&tm, sizeof(tm));
-  }
-}
-
-
-#define MAXKEY	256
-#define BLOCKSIZE	16
-
-
-
-static int initblock (lua_State *L, const char *seed, int lseed, char *block) {
-  size_t lkey;
-  const char *key = luaL_checklstring(L, 2, &lkey);
-  if (lkey > MAXKEY)
-    luaL_error(L, "key too long (> %d)", MAXKEY);
-  memset(block, 0, BLOCKSIZE);
-  memcpy(block, seed, lseed);
-  memcpy(block+BLOCKSIZE, key, lkey);
-  return (int)lkey+BLOCKSIZE;
-}
-
-
-static void codestream (lua_State *L, const char *msg, size_t lmsg,
-                                      char *block, int lblock) {
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  while (lmsg > 0) {
-    char code[BLOCKSIZE];
-    int i;
-    md5(block, lblock, code);
-    for (i=0; i<BLOCKSIZE && lmsg > 0; i++, lmsg--)
-      code[i] ^= *msg++;
-    luaL_addlstring(&b, code, i); 
-    memcpy(block, code, i); /* update seed */
-  }
-  luaL_pushresult(&b);
-}
-
-
-static void decodestream (lua_State *L, const char *cypher, size_t lcypher,
-                          char *block, int lblock) {
-  luaL_Buffer b;
-  luaL_buffinit(L, &b);
-  while (lcypher > 0) {
-    char code[BLOCKSIZE];
-    int i;
-    md5(block, lblock, code);  /* update seed */
-    for (i=0; i<BLOCKSIZE && lcypher > 0; i++, lcypher--)
-      code[i] ^= *cypher++;
-    luaL_addlstring(&b, code, i); 
-    memcpy(block, cypher-i, i);
-  }
-  luaL_pushresult(&b);
-}
-
-
-/**
-*  Encrypts a string. Uses the hash function md5 in CFB (Cipher-feedback
-*  mode).
-*  @param message: arbitrary binary string to be encrypted.
-*  @param key: arbitrary binary string to be used as a key.
-*  @param [seed]: optional arbitrary binary string to be used as a seed.
-*  if no seed is provided, the function uses the result of
-*  <code>time()</code> as a seed.  
-*  @return  The cyphertext (as a binary string).
-*/
-static int crypt (lua_State *L) {
-  size_t lmsg;
-  const char *msg = luaL_checklstring(L, 1, &lmsg);
-  size_t lseed;
-  const char *seed;
-  int lblock;
-  char block[BLOCKSIZE+MAXKEY];
-  checkseed(L);
-  seed = luaL_checklstring(L, 3, &lseed);
-  if (lseed > BLOCKSIZE)
-    luaL_error(L, "seed too long (> %d)", BLOCKSIZE);
-  /* put seed and seed length at the beginning of result */
-  block[0] = (char)lseed;
-  memcpy(block+1, seed, lseed);
-  lua_pushlstring(L, block, lseed+1);  /* to concat with result */
-  lblock = initblock(L, seed, lseed, block);
-  codestream(L, msg, lmsg, block, lblock);
-  lua_concat(L, 2);
-  return 1;
-}
-
-
-/**
-*  Decrypts a string. For any message, key, and seed, we have that
-*  <code>decrypt(crypt(msg, key, seed), key) == msg</code>.
-*  @param cyphertext: message to be decrypted (this must be the result of
-   a previous call to <code>crypt</code>.
-*  @param key: arbitrary binary string to be used as a key.
-*  @return  The plaintext.
-*/
-static int decrypt (lua_State *L) {
-  size_t lcyphertext;
-  const char *cyphertext = luaL_checklstring(L, 1, &lcyphertext);
-  size_t lseed = cyphertext[0];
-  const char *seed = cyphertext+1;
-  int lblock;
-  char block[BLOCKSIZE+MAXKEY];
-  luaL_argcheck(L, lcyphertext >= lseed+1 && lseed <= BLOCKSIZE, 1,
-                 "invalid cyphered string");
-  cyphertext += lseed+1;
-  lcyphertext -= lseed+1;
-  lblock = initblock(L, seed, lseed, block);
-  decodestream(L, cyphertext, lcyphertext, block, lblock);
-  return 1;
-}
-
-
-static struct luaL_reg md5lib[] = {
-  {"sum", lmd5},
-  {"exor", ex_or},
-  {"crypt", crypt},
-  {"decrypt", decrypt},
-  {NULL, NULL}
-};
-
-
-int luaopen_md5 (lua_State *L) {
-  luaL_openlib(L, "md5", md5lib, 0);
-  return 1;
-}
-
diff --git a/Build/source/libs/luamd5/md5tests.lua b/Build/source/libs/luamd5/md5tests.lua
deleted file mode 100644
index 4a6092bf34c..00000000000
--- a/Build/source/libs/luamd5/md5tests.lua
+++ /dev/null
@@ -1,78 +0,0 @@
-#!/usr/bin/env lua5.0
-
-dofile "md5.lua"
-
-
-assert(md5.exor('', '') == '')
-assert(md5.exor('alo alo', '\0\0\0\0\0\0\0') == 'alo alo')
-
-local function invert (s)
-  return md5.exor(s, string.rep('\255', string.len(s)))
-end
-
-x = string.rep('0123456789', 1000)
-assert(md5.exor(x,x) == string.rep('\0', 10000))
-assert(md5.exor(x,invert(x)) == string.rep('\255', 10000))
-
-assert(invert(invert('alo alo')) == 'alo alo')
-
-assert(invert(invert(invert('alo\0\255alo'))) == invert('alo\0\255alo'))
-
--- test some known sums
-assert(md5.sumhexa("") == "d41d8cd98f00b204e9800998ecf8427e")
-assert(md5.sumhexa("a") == "0cc175b9c0f1b6a831c399e269772661")
-assert(md5.sumhexa("abc") == "900150983cd24fb0d6963f7d28e17f72")
-assert(md5.sumhexa("message digest") == "f96b697d7cb7938d525a2f31aaf161d0")
-assert(md5.sumhexa("abcdefghijklmnopqrstuvwxyz") == "c3fcd3d76192e4007dfb496cca67e13b")
-assert(md5.sumhexa("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789")
- == "d174ab98d277d9f5a5611c2c9f419d9f")
-
-
--- test padding borders
-assert(md5.sumhexa(string.rep('a',53)) == "e9e7e260dce84ffa6e0e7eb5fd9d37fc")
-assert(md5.sumhexa(string.rep('a',54)) == "eced9e0b81ef2bba605cbc5e2e76a1d0")
-assert(md5.sumhexa(string.rep('a',55)) == "ef1772b6dff9a122358552954ad0df65")
-assert(md5.sumhexa(string.rep('a',56)) == "3b0c8ac703f828b04c6c197006d17218")
-assert(md5.sumhexa(string.rep('a',57)) == "652b906d60af96844ebd21b674f35e93")
-assert(md5.sumhexa(string.rep('a',63)) == "b06521f39153d618550606be297466d5")
-assert(md5.sumhexa(string.rep('a',64)) == "014842d480b571495a4a0363793f7367")
-assert(md5.sumhexa(string.rep('a',65)) == "c743a45e0d2e6a95cb859adae0248435")
-assert(md5.sumhexa(string.rep('a',255)) == "46bc249a5a8fc5d622cf12c42c463ae0")
-assert(md5.sumhexa(string.rep('a',256)) == "81109eec5aa1a284fb5327b10e9c16b9")
-
-assert(md5.sumhexa(
-"12345678901234567890123456789012345678901234567890123456789012345678901234567890")
-   == "57edf4a22be3c955ac49da2e2107b67a")
-
-print '+'
-
-
-
-local tolerance = 1.12
-
-local function contchars (s)
-  local a = {}
-  for i=0,255 do a[string.char(i)] = 0 end
-  for c in string.gfind(s, '.') do
-    a[c] = a[c] + 1
-  end
-  local av = string.len(s)/256
-  for i=0,255 do
-    local c = string.char(i)
-    assert(a[c] < av*tolerance and a[c] > av/tolerance, i)
-  end
-end
-
-
-local key = 'xuxu bacana'
-assert(md5.decrypt(md5.crypt('', key), key) == '')
-assert(md5.decrypt(md5.crypt('', key, '\0\0seed\0'), key) == '')
-assert(md5.decrypt(md5.crypt('a', key), key) == 'a')
-local msg = string.rep("1233456789\0\1\2\3\0\255", 10000)
-local code = md5.crypt(msg, key, "seed")
-assert(md5.decrypt(code, key) == msg)
-contchars(code)
-
-assert(md5.crypt('a', 'a') ~= md5.crypt('a', 'b'))
-
-print"OK"
diff --git a/Build/source/libs/md5/md5.c b/Build/source/libs/md5/md5.c
deleted file mode 100644
index c35d96c5ef5..00000000000
--- a/Build/source/libs/md5/md5.c
+++ /dev/null
@@ -1,381 +0,0 @@
-/*
-  Copyright (C) 1999, 2000, 2002 Aladdin Enterprises.  All rights reserved.
-
-  This software is provided 'as-is', without any express or implied
-  warranty.  In no event will the authors be held liable for any damages
-  arising from the use of this software.
-
-  Permission is granted to anyone to use this software for any purpose,
-  including commercial applications, and to alter it and redistribute it
-  freely, subject to the following restrictions:
-
-  1. The origin of this software must not be misrepresented; you must not
-     claim that you wrote the original software. If you use this software
-     in a product, an acknowledgment in the product documentation would be
-     appreciated but is not required.
-  2. Altered source versions must be plainly marked as such, and must not be
-     misrepresented as being the original software.
-  3. This notice may not be removed or altered from any source distribution.
-
-  L. Peter Deutsch
-  ghost@aladdin.com
-
- */
-/* $Id: md5.c,v 1.6 2002/04/13 19:20:28 lpd Exp $ */
-/*
-  Independent implementation of MD5 (RFC 1321).
-
-  This code implements the MD5 Algorithm defined in RFC 1321, whose
-  text is available at
-	http://www.ietf.org/rfc/rfc1321.txt
-  The code is derived from the text of the RFC, including the test suite
-  (section A.5) but excluding the rest of Appendix A.  It does not include
-  any code or documentation that is identified in the RFC as being
-  copyrighted.
-
-  The original and principal author of md5.c is L. Peter Deutsch
-  <ghost@aladdin.com>.  Other authors are noted in the change history
-  that follows (in reverse chronological order):
-
-  2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
-	either statically or dynamically; added missing #include <string.h>
-	in library.
-  2002-03-11 lpd Corrected argument list for main(), and added int return
-	type, in test program and T value program.
-  2002-02-21 lpd Added missing #include <stdio.h> in test program.
-  2000-07-03 lpd Patched to eliminate warnings about "constant is
-	unsigned in ANSI C, signed in traditional"; made test program
-	self-checking.
-  1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
-  1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
-  1999-05-03 lpd Original version.
- */
-
-#include "md5.h"
-#include <string.h>
-
-#undef BYTE_ORDER	/* 1 = big-endian, -1 = little-endian, 0 = unknown */
-#ifdef ARCH_IS_BIG_ENDIAN
-#  define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
-#else
-#  define BYTE_ORDER 0
-#endif
-
-#define T_MASK ((md5_word_t)~0)
-#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
-#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
-#define T3    0x242070db
-#define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
-#define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
-#define T6    0x4787c62a
-#define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
-#define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
-#define T9    0x698098d8
-#define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
-#define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
-#define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
-#define T13    0x6b901122
-#define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
-#define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
-#define T16    0x49b40821
-#define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
-#define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
-#define T19    0x265e5a51
-#define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
-#define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
-#define T22    0x02441453
-#define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
-#define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
-#define T25    0x21e1cde6
-#define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
-#define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
-#define T28    0x455a14ed
-#define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
-#define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
-#define T31    0x676f02d9
-#define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
-#define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
-#define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
-#define T35    0x6d9d6122
-#define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
-#define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
-#define T38    0x4bdecfa9
-#define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
-#define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
-#define T41    0x289b7ec6
-#define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
-#define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
-#define T44    0x04881d05
-#define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
-#define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
-#define T47    0x1fa27cf8
-#define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
-#define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
-#define T50    0x432aff97
-#define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
-#define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
-#define T53    0x655b59c3
-#define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
-#define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
-#define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
-#define T57    0x6fa87e4f
-#define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
-#define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
-#define T60    0x4e0811a1
-#define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
-#define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
-#define T63    0x2ad7d2bb
-#define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
-
-
-static void
-md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
-{
-    md5_word_t
-	a = pms->abcd[0], b = pms->abcd[1],
-	c = pms->abcd[2], d = pms->abcd[3];
-    md5_word_t t;
-#if BYTE_ORDER > 0
-    /* Define storage only for big-endian CPUs. */
-    md5_word_t X[16];
-#else
-    /* Define storage for little-endian or both types of CPUs. */
-    md5_word_t xbuf[16];
-    const md5_word_t *X;
-#endif
-
-    {
-#if BYTE_ORDER == 0
-	/*
-	 * Determine dynamically whether this is a big-endian or
-	 * little-endian machine, since we can use a more efficient
-	 * algorithm on the latter.
-	 */
-	static const int w = 1;
-
-	if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
-#endif
-#if BYTE_ORDER <= 0		/* little-endian */
-	{
-	    /*
-	     * On little-endian machines, we can process properly aligned
-	     * data without copying it.
-	     */
-	    if (!((data - (const md5_byte_t *)0) & 3)) {
-		/* data are properly aligned */
-		X = (const md5_word_t *)data;
-	    } else {
-		/* not aligned */
-		memcpy(xbuf, data, 64);
-		X = xbuf;
-	    }
-	}
-#endif
-#if BYTE_ORDER == 0
-	else			/* dynamic big-endian */
-#endif
-#if BYTE_ORDER >= 0		/* big-endian */
-	{
-	    /*
-	     * On big-endian machines, we must arrange the bytes in the
-	     * right order.
-	     */
-	    const md5_byte_t *xp = data;
-	    int i;
-
-#  if BYTE_ORDER == 0
-	    X = xbuf;		/* (dynamic only) */
-#  else
-#    define xbuf X		/* (static only) */
-#  endif
-	    for (i = 0; i < 16; ++i, xp += 4)
-		xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
-	}
-#endif
-    }
-
-#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
-
-    /* Round 1. */
-    /* Let [abcd k s i] denote the operation
-       a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
-#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + F(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-    /* Do the following 16 operations. */
-    SET(a, b, c, d,  0,  7,  T1);
-    SET(d, a, b, c,  1, 12,  T2);
-    SET(c, d, a, b,  2, 17,  T3);
-    SET(b, c, d, a,  3, 22,  T4);
-    SET(a, b, c, d,  4,  7,  T5);
-    SET(d, a, b, c,  5, 12,  T6);
-    SET(c, d, a, b,  6, 17,  T7);
-    SET(b, c, d, a,  7, 22,  T8);
-    SET(a, b, c, d,  8,  7,  T9);
-    SET(d, a, b, c,  9, 12, T10);
-    SET(c, d, a, b, 10, 17, T11);
-    SET(b, c, d, a, 11, 22, T12);
-    SET(a, b, c, d, 12,  7, T13);
-    SET(d, a, b, c, 13, 12, T14);
-    SET(c, d, a, b, 14, 17, T15);
-    SET(b, c, d, a, 15, 22, T16);
-#undef SET
-
-     /* Round 2. */
-     /* Let [abcd k s i] denote the operation
-          a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
-#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + G(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-     /* Do the following 16 operations. */
-    SET(a, b, c, d,  1,  5, T17);
-    SET(d, a, b, c,  6,  9, T18);
-    SET(c, d, a, b, 11, 14, T19);
-    SET(b, c, d, a,  0, 20, T20);
-    SET(a, b, c, d,  5,  5, T21);
-    SET(d, a, b, c, 10,  9, T22);
-    SET(c, d, a, b, 15, 14, T23);
-    SET(b, c, d, a,  4, 20, T24);
-    SET(a, b, c, d,  9,  5, T25);
-    SET(d, a, b, c, 14,  9, T26);
-    SET(c, d, a, b,  3, 14, T27);
-    SET(b, c, d, a,  8, 20, T28);
-    SET(a, b, c, d, 13,  5, T29);
-    SET(d, a, b, c,  2,  9, T30);
-    SET(c, d, a, b,  7, 14, T31);
-    SET(b, c, d, a, 12, 20, T32);
-#undef SET
-
-     /* Round 3. */
-     /* Let [abcd k s t] denote the operation
-          a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
-#define H(x, y, z) ((x) ^ (y) ^ (z))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + H(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-     /* Do the following 16 operations. */
-    SET(a, b, c, d,  5,  4, T33);
-    SET(d, a, b, c,  8, 11, T34);
-    SET(c, d, a, b, 11, 16, T35);
-    SET(b, c, d, a, 14, 23, T36);
-    SET(a, b, c, d,  1,  4, T37);
-    SET(d, a, b, c,  4, 11, T38);
-    SET(c, d, a, b,  7, 16, T39);
-    SET(b, c, d, a, 10, 23, T40);
-    SET(a, b, c, d, 13,  4, T41);
-    SET(d, a, b, c,  0, 11, T42);
-    SET(c, d, a, b,  3, 16, T43);
-    SET(b, c, d, a,  6, 23, T44);
-    SET(a, b, c, d,  9,  4, T45);
-    SET(d, a, b, c, 12, 11, T46);
-    SET(c, d, a, b, 15, 16, T47);
-    SET(b, c, d, a,  2, 23, T48);
-#undef SET
-
-     /* Round 4. */
-     /* Let [abcd k s t] denote the operation
-          a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
-#define I(x, y, z) ((y) ^ ((x) | ~(z)))
-#define SET(a, b, c, d, k, s, Ti)\
-  t = a + I(b,c,d) + X[k] + Ti;\
-  a = ROTATE_LEFT(t, s) + b
-     /* Do the following 16 operations. */
-    SET(a, b, c, d,  0,  6, T49);
-    SET(d, a, b, c,  7, 10, T50);
-    SET(c, d, a, b, 14, 15, T51);
-    SET(b, c, d, a,  5, 21, T52);
-    SET(a, b, c, d, 12,  6, T53);
-    SET(d, a, b, c,  3, 10, T54);
-    SET(c, d, a, b, 10, 15, T55);
-    SET(b, c, d, a,  1, 21, T56);
-    SET(a, b, c, d,  8,  6, T57);
-    SET(d, a, b, c, 15, 10, T58);
-    SET(c, d, a, b,  6, 15, T59);
-    SET(b, c, d, a, 13, 21, T60);
-    SET(a, b, c, d,  4,  6, T61);
-    SET(d, a, b, c, 11, 10, T62);
-    SET(c, d, a, b,  2, 15, T63);
-    SET(b, c, d, a,  9, 21, T64);
-#undef SET
-
-     /* Then perform the following additions. (That is increment each
-        of the four registers by the value it had before this block
-        was started.) */
-    pms->abcd[0] += a;
-    pms->abcd[1] += b;
-    pms->abcd[2] += c;
-    pms->abcd[3] += d;
-}
-
-void
-md5_init(md5_state_t *pms)
-{
-    pms->count[0] = pms->count[1] = 0;
-    pms->abcd[0] = 0x67452301;
-    pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
-    pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
-    pms->abcd[3] = 0x10325476;
-}
-
-void
-md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
-{
-    const md5_byte_t *p = data;
-    int left = nbytes;
-    int offset = (pms->count[0] >> 3) & 63;
-    md5_word_t nbits = (md5_word_t)(nbytes << 3);
-
-    if (nbytes <= 0)
-	return;
-
-    /* Update the message length. */
-    pms->count[1] += nbytes >> 29;
-    pms->count[0] += nbits;
-    if (pms->count[0] < nbits)
-	pms->count[1]++;
-
-    /* Process an initial partial block. */
-    if (offset) {
-	int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
-
-	memcpy(pms->buf + offset, p, copy);
-	if (offset + copy < 64)
-	    return;
-	p += copy;
-	left -= copy;
-	md5_process(pms, pms->buf);
-    }
-
-    /* Process full blocks. */
-    for (; left >= 64; p += 64, left -= 64)
-	md5_process(pms, p);
-
-    /* Process a final partial block. */
-    if (left)
-	memcpy(pms->buf, p, left);
-}
-
-void
-md5_finish(md5_state_t *pms, md5_byte_t digest[16])
-{
-    static const md5_byte_t pad[64] = {
-	0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-    };
-    md5_byte_t data[8];
-    int i;
-
-    /* Save the length before padding. */
-    for (i = 0; i < 8; ++i)
-	data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
-    /* Pad to 56 bytes mod 64. */
-    md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
-    /* Append the length. */
-    md5_append(pms, data, 8);
-    for (i = 0; i < 16; ++i)
-	digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
-}
diff --git a/Build/source/libs/md5/md5.h b/Build/source/libs/md5/md5.h
deleted file mode 100644
index 698c995d8f4..00000000000
--- a/Build/source/libs/md5/md5.h
+++ /dev/null
@@ -1,91 +0,0 @@
-/*
-  Copyright (C) 1999, 2002 Aladdin Enterprises.  All rights reserved.
-
-  This software is provided 'as-is', without any express or implied
-  warranty.  In no event will the authors be held liable for any damages
-  arising from the use of this software.
-
-  Permission is granted to anyone to use this software for any purpose,
-  including commercial applications, and to alter it and redistribute it
-  freely, subject to the following restrictions:
-
-  1. The origin of this software must not be misrepresented; you must not
-     claim that you wrote the original software. If you use this software
-     in a product, an acknowledgment in the product documentation would be
-     appreciated but is not required.
-  2. Altered source versions must be plainly marked as such, and must not be
-     misrepresented as being the original software.
-  3. This notice may not be removed or altered from any source distribution.
-
-  L. Peter Deutsch
-  ghost@aladdin.com
-
- */
-/* $Id: md5.h,v 1.4 2002/04/13 19:20:28 lpd Exp $ */
-/*
-  Independent implementation of MD5 (RFC 1321).
-
-  This code implements the MD5 Algorithm defined in RFC 1321, whose
-  text is available at
-	http://www.ietf.org/rfc/rfc1321.txt
-  The code is derived from the text of the RFC, including the test suite
-  (section A.5) but excluding the rest of Appendix A.  It does not include
-  any code or documentation that is identified in the RFC as being
-  copyrighted.
-
-  The original and principal author of md5.h is L. Peter Deutsch
-  <ghost@aladdin.com>.  Other authors are noted in the change history
-  that follows (in reverse chronological order):
-
-  2002-04-13 lpd Removed support for non-ANSI compilers; removed
-	references to Ghostscript; clarified derivation from RFC 1321;
-	now handles byte order either statically or dynamically.
-  1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
-  1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5);
-	added conditionalization for C++ compilation from Martin
-	Purschke <purschke@bnl.gov>.
-  1999-05-03 lpd Original version.
- */
-
-#ifndef md5_INCLUDED
-#  define md5_INCLUDED
-
-/*
- * This package supports both compile-time and run-time determination of CPU
- * byte order.  If ARCH_IS_BIG_ENDIAN is defined as 0, the code will be
- * compiled to run only on little-endian CPUs; if ARCH_IS_BIG_ENDIAN is
- * defined as non-zero, the code will be compiled to run only on big-endian
- * CPUs; if ARCH_IS_BIG_ENDIAN is not defined, the code will be compiled to
- * run on either big- or little-endian CPUs, but will run slightly less
- * efficiently on either one than if ARCH_IS_BIG_ENDIAN is defined.
- */
-
-typedef unsigned char md5_byte_t; /* 8-bit byte */
-typedef unsigned int md5_word_t; /* 32-bit word */
-
-/* Define the state of the MD5 Algorithm. */
-typedef struct md5_state_s {
-    md5_word_t count[2];	/* message length in bits, lsw first */
-    md5_word_t abcd[4];		/* digest buffer */
-    md5_byte_t buf[64];		/* accumulate block */
-} md5_state_t;
-
-#ifdef __cplusplus
-extern "C" 
-{
-#endif
-
-/* Initialize the algorithm. */
-void md5_init(md5_state_t *pms);
-
-/* Append a string to the message. */
-void md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes);
-
-/* Finish the message and return the digest. */
-void md5_finish(md5_state_t *pms, md5_byte_t digest[16]);
-
-#ifdef __cplusplus
-}  /* end extern "C" */
-#endif
-
-#endif /* md5_INCLUDED */
diff --git a/Build/source/libs/md5/md5main.c b/Build/source/libs/md5/md5main.c
deleted file mode 100644
index 625a6198e6d..00000000000
--- a/Build/source/libs/md5/md5main.c
+++ /dev/null
@@ -1,139 +0,0 @@
-/*
-  Copyright (C) 2002 Aladdin Enterprises.  All rights reserved.
-
-  This software is provided 'as-is', without any express or implied
-  warranty.  In no event will the authors be held liable for any damages
-  arising from the use of this software.
-
-  Permission is granted to anyone to use this software for any purpose,
-  including commercial applications, and to alter it and redistribute it
-  freely, subject to the following restrictions:
-
-  1. The origin of this software must not be misrepresented; you must not
-     claim that you wrote the original software. If you use this software
-     in a product, an acknowledgment in the product documentation would be
-     appreciated but is not required.
-  2. Altered source versions must be plainly marked as such, and must not be
-     misrepresented as being the original software.
-  3. This notice may not be removed or altered from any source distribution.
-
-  L. Peter Deutsch
-  ghost@aladdin.com
-
- */
-/* $Id: md5main.c,v 1.1 2002/04/13 19:20:28 lpd Exp $ */
-/*
-  Independent implementation of MD5 (RFC 1321).
-
-  This code implements the MD5 Algorithm defined in RFC 1321, whose
-  text is available at
-	http://www.ietf.org/rfc/rfc1321.txt
-  The code is derived from the text of the RFC, including the test suite
-  (section A.5) but excluding the rest of Appendix A.  It does not include
-  any code or documentation that is identified in the RFC as being
-  copyrighted.
-
-  The original and principal author of md5.c is L. Peter Deutsch
-  <ghost@aladdin.com>.  Other authors are noted in the change history
-  that follows (in reverse chronological order):
-
-  2002-04-13 lpd Splits off main program into a separate file, md5main.c.
- */
-
-#include "md5.h"
-#include <math.h>
-#include <stdio.h>
-#include <string.h>
-
-/*
- * This file builds an executable that performs various functions related
- * to the MD5 library.  Typical compilation:
- *	gcc -o md5main -lm md5main.c md5.c
- */
-static const char *const usage = "\
-Usage:\n\
-    md5main --test		# run the self-test (A.5 of RFC 1321)\n\
-    md5main --t-values		# print the T values for the library\n\
-    md5main --version		# print the version of the package\n\
-";
-static const char *const version = "2002-04-13";
-
-/* Run the self-test. */
-static int
-do_test(void)
-{
-    static const char *const test[7*2] = {
-	"", "d41d8cd98f00b204e9800998ecf8427e",
-	"a", "0cc175b9c0f1b6a831c399e269772661",
-	"abc", "900150983cd24fb0d6963f7d28e17f72",
-	"message digest", "f96b697d7cb7938d525a2f31aaf161d0",
-	"abcdefghijklmnopqrstuvwxyz", "c3fcd3d76192e4007dfb496cca67e13b",
-	"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
-				"d174ab98d277d9f5a5611c2c9f419d9f",
-	"12345678901234567890123456789012345678901234567890123456789012345678901234567890", "57edf4a22be3c955ac49da2e2107b67a"
-    };
-    int i;
-    int status = 0;
-
-    for (i = 0; i < 7*2; i += 2) {
-	md5_state_t state;
-	md5_byte_t digest[16];
-	char hex_output[16*2 + 1];
-	int di;
-
-	md5_init(&state);
-	md5_append(&state, (const md5_byte_t *)test[i], strlen(test[i]));
-	md5_finish(&state, digest);
-	for (di = 0; di < 16; ++di)
-	    sprintf(hex_output + di * 2, "%02x", digest[di]);
-	if (strcmp(hex_output, test[i + 1])) {
-	    printf("MD5 (\"%s\") = ", test[i]);
-	    puts(hex_output);
-	    printf("**** ERROR, should be: %s\n", test[i + 1]);
-	    status = 1;
-	}
-    }
-    if (status == 0)
-	puts("md5 self-test completed successfully.");
-    return status;
-}
-
-/* Print the T values. */
-static int
-do_t_values(void)
-{
-    int i;
-    for (i = 1; i <= 64; ++i) {
-	unsigned long v = (unsigned long)(4294967296.0 * fabs(sin((double)i)));
-
-	/*
-	 * The following nonsense is only to avoid compiler warnings about
-	 * "integer constant is unsigned in ANSI C, signed with -traditional".
-	 */
-	if (v >> 31) {
-	    printf("#define T%d /* 0x%08lx */ (T_MASK ^ 0x%08lx)\n", i,
-		   v, (unsigned long)(unsigned int)(~v));
-	} else {
-	    printf("#define T%d    0x%08lx\n", i, v);
-	}
-    }
-    return 0;
-}
-
-/* Main program */
-int
-main(int argc, char *argv[])
-{
-    if (argc == 2) {
-	if (!strcmp(argv[1], "--test"))
-	    return do_test();
-	if (!strcmp(argv[1], "--t-values"))
-	    return do_t_values();
-	if (!strcmp(argv[1], "--version")) {
-	    puts(version);
-	    return 0;
-	}
-    }
-    puts(usage);
-    return 0;
-}