Commit b75413ad authored by degironc's avatar degironc

adding a few routines needed to calculate md5 checksum of a given file.

They are intended to be used to calculate (and echo on the output) the
md5 checksum of the peudopotential files in order to be able to verify their
identity/integrity when comparing calculations performed at different
times or on different machines

R. Sabatini - S. de Gironcoli


git-svn-id: http://qeforge.qe-forge.org/svn/q-e/trunk/espresso@6962 c92efa57-630b-4861-b058-cf58834340f0
parent 2f657be0
......@@ -10,6 +10,8 @@ cptimer.o \
eval_infix.o \
fft_stick.o \
indici.o \
md5.o \
md5_from_file.o \
memstat.o \
qsort.o
......
This diff is collapsed.
/*
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.1 2010-08-13 10:50:08 degironc 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 */
/*
Copyright (C) 2005-2008 Quantum ESPRESSO group
This file is distributed under the terms of the
GNU General Public License. See the file `License'
in the root directory of the present distribution,
or http://www.gnu.org/copyleft/gpl.txt .
------------------------------------------------------
*/
#include <stdio.h>
#include <stdlib.h>
#include "c_defs.h"
#include "md5.h"
#define MAX_BUF 1024
char *strCopy( char * str )
{
if( !str )
{
return NULL;
}
char *n = ( char * )malloc( strlen( str ) + 1 );
memcpy( n, str, strlen( str ) + 1 );
return n;
}
char *readFile( FILE *fp )
{
if( !fp )
{
return NULL;
}
char *output = NULL;
char buf[ MAX_BUF ];
int bytes, byteCount = 0;
memset( buf, 0, sizeof( buf ) );
while( ( bytes = fread( buf, sizeof( char ), sizeof( buf ) - 1, fp ) ) > 0 )
{
if( !output )
{
/* alloca */
output = ( char * )malloc( bytes + 1 );
memcpy( output, buf, bytes + 1 );
}
else
{
/* rialloca se esiste */
char *oldStr = strCopy( output );
output = ( char * )realloc( output, byteCount + bytes + 1 );
memcpy( output, oldStr, byteCount );
free( oldStr );
memcpy( output + byteCount, buf, bytes + 1 );
}
byteCount += bytes;
memset( buf, 0, sizeof( buf ) );
}
return output;
}
void get_md5(const char *file, char md5[32], int err)
{
FILE *fp;
char *data;
//char THISMD5[31];
md5_state_t state;
md5_byte_t digest[16];
if(file==NULL) {
err = 1;
return;
}
fp=fopen(file,"rb");
if(fp==NULL) {
err = 2;
return;
}
data=readFile(fp);
if(data==NULL) {
err = 3;
return;
}
md5_init(&state);
md5_append(&state,(const md5_byte_t *)data,strlen(data));
md5_finish(&state,digest);
int i=0;
for(i;i<16;i++){
//snprintf(THISMD5+i*2,sizeof(THISMD5),"%02x",digest[i]);
snprintf(md5+i*2,sizeof(md5),"%02x",digest[i]);
}
fclose(fp);
//strcpy(md5, THISMD5);
//md5 = &THISMD5;
err = 0;
return;
}
int F77_FUNC_(file_md5,FILE_MD5)( const int * f_name, const int * f_len, int* out )
{
int i, err = -1 ;
char md5[32];
char *f = ( char * ) malloc( (*f_len) + 1 ) ;
for( i = 0; i < * f_len; i++ ) f[ i ] = (char)f_name[ i ];
f[*f_len] = '\0' ;
get_md5( f , md5, err) ;
for( i = 0; i < 32; i++ ) out[ i ] = md5[ i ];
return err;
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment