2014-08-15 09:27:04 +00:00
|
|
|
/*
|
2015-05-04 21:56:53 +00:00
|
|
|
xxhsum - Command line interface for xxhash algorithms
|
2016-01-04 07:32:38 +00:00
|
|
|
Copyright (C) Yann Collet 2012-2016
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-04 21:56:53 +00:00
|
|
|
GPL v2 License
|
|
|
|
|
2014-08-15 09:27:04 +00:00
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License along
|
|
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
|
|
|
|
You can contact the author at :
|
2015-05-04 21:56:53 +00:00
|
|
|
- xxHash source repository : https://github.com/Cyan4973/xxHash
|
2014-08-15 09:27:04 +00:00
|
|
|
*/
|
|
|
|
|
2016-01-07 22:54:51 +00:00
|
|
|
/*! xxhsum
|
|
|
|
* Provides hash value of a file content, or a list of files, or stdin
|
|
|
|
* Display convention is Big Endian, for both 32 and 64 bits algorithms
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Compiler Options
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
2014-10-29 01:42:26 +00:00
|
|
|
/* MS Visual */
|
|
|
|
#if defined(_MSC_VER) || defined(_WIN32)
|
|
|
|
# define _CRT_SECURE_NO_WARNINGS /* removes visual warnings */
|
|
|
|
# define BMK_LEGACY_TIMER 1 /* gettimeofday() not supported by MSVC */
|
|
|
|
#endif
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2014-10-29 01:42:26 +00:00
|
|
|
/* Under Linux at least, pull in the *64 commands */
|
2016-01-14 02:01:39 +00:00
|
|
|
#ifndef _LARGEFILE64_SOURCE
|
|
|
|
# define _LARGEFILE64_SOURCE
|
|
|
|
#endif
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Includes
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
2014-12-17 11:15:03 +00:00
|
|
|
#include <stdlib.h> /* malloc */
|
|
|
|
#include <stdio.h> /* fprintf, fopen, ftello64, fread, stdin, stdout; when present : _fileno */
|
|
|
|
#include <string.h> /* strcmp */
|
2016-01-20 14:45:52 +00:00
|
|
|
#include <inttypes.h> /* PRIuMAX */
|
2014-12-17 11:15:03 +00:00
|
|
|
#include <sys/types.h> /* stat64 */
|
|
|
|
#include <sys/stat.h> /* stat64 */
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
#if defined(XXHSUM_INCLUDE_XXHC) /* for tests */
|
|
|
|
# define XXH_PRIVATE_API
|
|
|
|
# include "xxhash.c"
|
|
|
|
#else
|
|
|
|
# include "xxhash.h"
|
|
|
|
#endif
|
2014-10-29 12:55:58 +00:00
|
|
|
|
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* OS-Specific Includes
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
|
|
|
/*!Use ftime() if gettimeofday() is not available on your target */
|
2014-10-29 01:42:26 +00:00
|
|
|
#if defined(BMK_LEGACY_TIMER)
|
2015-05-07 14:27:27 +00:00
|
|
|
# include <sys/timeb.h> /* timeb, ftime */
|
2014-10-29 01:42:26 +00:00
|
|
|
#else
|
2015-05-07 14:27:27 +00:00
|
|
|
# include <sys/time.h> /* gettimeofday */
|
2014-10-29 01:42:26 +00:00
|
|
|
#endif
|
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
#if defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(_WIN32) || defined(__CYGWIN__)
|
2015-05-07 14:27:27 +00:00
|
|
|
# include <fcntl.h> /* _O_BINARY */
|
|
|
|
# include <io.h> /* _setmode, _isatty */
|
2014-10-29 12:55:58 +00:00
|
|
|
# ifdef __MINGW32__
|
2015-05-07 14:27:27 +00:00
|
|
|
int _fileno(FILE *stream); /* MINGW somehow forgets to include this windows declaration into <stdio.h> */
|
2014-10-29 12:55:58 +00:00
|
|
|
# endif
|
|
|
|
# define SET_BINARY_MODE(file) _setmode(_fileno(file), _O_BINARY)
|
|
|
|
# define IS_CONSOLE(stdStream) _isatty(_fileno(stdStream))
|
|
|
|
#else
|
2015-05-07 14:27:27 +00:00
|
|
|
# include <unistd.h> /* isatty, STDIN_FILENO */
|
2014-10-29 12:55:58 +00:00
|
|
|
# define SET_BINARY_MODE(file)
|
|
|
|
# define IS_CONSOLE(stdStream) isatty(STDIN_FILENO)
|
|
|
|
#endif
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
#if !defined(S_ISREG)
|
|
|
|
# define S_ISREG(x) (((x) & S_IFMT) == S_IFREG)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Basic Types
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
|
|
|
#ifndef MEM_MODULE
|
|
|
|
# define MEM_MODULE
|
|
|
|
# if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* C99 */
|
|
|
|
# include <stdint.h>
|
|
|
|
typedef uint8_t BYTE;
|
|
|
|
typedef uint16_t U16;
|
|
|
|
typedef uint32_t U32;
|
|
|
|
typedef int32_t S32;
|
|
|
|
typedef uint64_t U64;
|
|
|
|
# else
|
|
|
|
typedef unsigned char BYTE;
|
|
|
|
typedef unsigned short U16;
|
|
|
|
typedef unsigned int U32;
|
|
|
|
typedef signed int S32;
|
|
|
|
typedef unsigned long long U64;
|
|
|
|
# endif
|
2014-08-15 09:27:04 +00:00
|
|
|
#endif
|
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
static unsigned BMK_isLittleEndian(void)
|
|
|
|
{
|
|
|
|
const union { U32 i; BYTE c[4]; } one = { 1 }; /* don't use static : performance detrimental */
|
|
|
|
return one.c[0];
|
|
|
|
}
|
|
|
|
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* *************************************
|
2015-05-07 14:27:27 +00:00
|
|
|
* Constants
|
2016-01-04 07:32:38 +00:00
|
|
|
***************************************/
|
2014-10-18 11:03:38 +00:00
|
|
|
#define PROGRAM_NAME exename
|
2016-01-03 22:56:13 +00:00
|
|
|
#define LIB_VERSION XXH_VERSION_MAJOR.XXH_VERSION_MINOR.XXH_VERSION_RELEASE
|
|
|
|
#define QUOTE(str) #str
|
|
|
|
#define EXPAND_AND_QUOTE(str) QUOTE(str)
|
|
|
|
#define PROGRAM_VERSION EXPAND_AND_QUOTE(LIB_VERSION)
|
2015-08-19 14:11:24 +00:00
|
|
|
static const int g_nbBits = (int)(sizeof(void*)*8);
|
|
|
|
static const char g_lename[] = "little endian";
|
|
|
|
static const char g_bename[] = "big endian";
|
|
|
|
#define ENDIAN_NAME (BMK_isLittleEndian() ? g_lename : g_bename)
|
2014-08-15 09:27:04 +00:00
|
|
|
#define COMPILED __DATE__
|
2015-05-07 14:27:27 +00:00
|
|
|
static const char author[] = "Yann Collet";
|
2015-08-19 14:11:24 +00:00
|
|
|
#define WELCOME_MESSAGE "%s %s (%i-bits %s), by %s (%s) \n", PROGRAM_NAME, PROGRAM_VERSION, g_nbBits, ENDIAN_NAME, author, COMPILED
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
#define NBLOOPS 3 /* Default number of benchmark iterations */
|
|
|
|
#define TIMELOOP 2500 /* Minimum timing per iteration */
|
2016-01-20 13:18:53 +00:00
|
|
|
#define XXHSUM32_DEFAULT_SEED 0 /* Default seed for algo_xxh32 */
|
|
|
|
#define XXHSUM64_DEFAULT_SEED 0 /* Default seed for algo_xxh64 */
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
#define KB *( 1<<10)
|
|
|
|
#define MB *( 1<<20)
|
2014-08-15 09:27:04 +00:00
|
|
|
#define GB *(1U<<30)
|
|
|
|
|
|
|
|
#define MAX_MEM (2 GB - 64 MB)
|
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
static const char stdinName[] = "-";
|
2016-01-10 16:06:34 +00:00
|
|
|
typedef enum { algo_xxh32, algo_xxh64 } algoType;
|
|
|
|
static const algoType g_defaultAlgo = algo_xxh64; /* required within main() & usage() */
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2016-01-20 14:45:52 +00:00
|
|
|
#if defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(_WIN32) || defined(__CYGWIN__)
|
|
|
|
# if defined(MAX_PATH)
|
|
|
|
# define IMPL_PATH_MAX ((MAX_PATH) + 1)
|
|
|
|
# endif
|
|
|
|
#else
|
|
|
|
# if defined(PATH_MAX)
|
|
|
|
# define IMPL_PATH_MAX ((PATH_MAX) + 1)
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if !defined(IMPL_PATH_MAX)
|
|
|
|
# define IMPL_PATH_MAX (260 + 1)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* <8 or 16 hex char> <SPC> <SPC> <filename> <'\0'> */
|
|
|
|
#define MAX_LINE_LENGTH (sizeof(XXH64_hash_t) * 2 + 2 + (IMPL_PATH_MAX) + 1)
|
|
|
|
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Display macros
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
2014-10-23 20:36:23 +00:00
|
|
|
#define DISPLAY(...) fprintf(stderr, __VA_ARGS__)
|
|
|
|
#define DISPLAYRESULT(...) fprintf(stdout, __VA_ARGS__)
|
2014-10-18 11:03:38 +00:00
|
|
|
#define DISPLAYLEVEL(l, ...) if (g_displayLevel>=l) DISPLAY(__VA_ARGS__);
|
|
|
|
static unsigned g_displayLevel = 1;
|
|
|
|
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Local variables
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
2015-08-12 16:10:16 +00:00
|
|
|
static size_t g_sampleSize = 100 KB;
|
2016-01-10 16:06:34 +00:00
|
|
|
static int g_nbIterations = NBLOOPS;
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Benchmark Functions
|
2016-01-04 07:32:38 +00:00
|
|
|
**************************************/
|
2014-10-29 01:42:26 +00:00
|
|
|
#if defined(BMK_LEGACY_TIMER)
|
|
|
|
|
|
|
|
static int BMK_GetMilliStart(void)
|
|
|
|
{
|
2015-01-01 16:10:04 +00:00
|
|
|
/* Based on Legacy ftime()
|
|
|
|
* Rolls over every ~ 12.1 days (0x100000/24/60/60)
|
|
|
|
* Use GetMilliSpan to correct for rollover */
|
2014-10-29 01:42:26 +00:00
|
|
|
struct timeb tb;
|
|
|
|
int nCount;
|
|
|
|
ftime( &tb );
|
|
|
|
nCount = (int) (tb.millitm + (tb.time & 0xfffff) * 1000);
|
|
|
|
return nCount;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else
|
|
|
|
|
2014-08-15 09:27:04 +00:00
|
|
|
static int BMK_GetMilliStart(void)
|
|
|
|
{
|
2015-01-01 16:10:04 +00:00
|
|
|
/* Based on newer gettimeofday()
|
|
|
|
* Use GetMilliSpan to correct for rollover */
|
2014-10-29 01:42:26 +00:00
|
|
|
struct timeval tv;
|
|
|
|
int nCount;
|
|
|
|
gettimeofday(&tv, NULL);
|
|
|
|
nCount = (int) (tv.tv_usec/1000 + (tv.tv_sec & 0xfffff) * 1000);
|
|
|
|
return nCount;
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
|
2014-10-29 01:42:26 +00:00
|
|
|
#endif
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
static int BMK_GetMilliSpan( int nTimeStart )
|
|
|
|
{
|
|
|
|
int nSpan = BMK_GetMilliStart() - nTimeStart;
|
|
|
|
if ( nSpan < 0 )
|
|
|
|
nSpan += 0x100000 * 1000;
|
|
|
|
return nSpan;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-06-28 11:20:23 +00:00
|
|
|
static size_t BMK_findMaxMem(U64 requiredMem)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
2015-06-28 11:20:23 +00:00
|
|
|
size_t step = 64 MB;
|
2014-08-15 09:27:04 +00:00
|
|
|
BYTE* testmem=NULL;
|
|
|
|
|
2015-06-28 11:20:23 +00:00
|
|
|
requiredMem = (((requiredMem >> 26) + 1) << 26);
|
|
|
|
requiredMem += 2*step;
|
|
|
|
if (requiredMem > MAX_MEM) requiredMem = MAX_MEM;
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
while (!testmem)
|
|
|
|
{
|
2015-06-28 11:20:23 +00:00
|
|
|
if (requiredMem > step) requiredMem -= step;
|
|
|
|
else requiredMem >>= 1;
|
|
|
|
testmem = (BYTE*) malloc ((size_t)requiredMem);
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
free (testmem);
|
|
|
|
|
2015-06-28 11:20:23 +00:00
|
|
|
/* keep some space available */
|
|
|
|
if (requiredMem > step) requiredMem -= step;
|
|
|
|
else requiredMem >>= 1;
|
|
|
|
|
|
|
|
return (size_t)requiredMem;
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-08-07 23:22:56 +00:00
|
|
|
static U64 BMK_GetFileSize(const char* infilename)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
|
|
|
int r;
|
|
|
|
#if defined(_MSC_VER)
|
|
|
|
struct _stat64 statbuf;
|
|
|
|
r = _stat64(infilename, &statbuf);
|
|
|
|
#else
|
|
|
|
struct stat statbuf;
|
|
|
|
r = stat(infilename, &statbuf);
|
|
|
|
#endif
|
2015-01-01 16:10:04 +00:00
|
|
|
if (r || !S_ISREG(statbuf.st_mode)) return 0; /* No good... */
|
2014-08-15 09:27:04 +00:00
|
|
|
return (U64)statbuf.st_size;
|
|
|
|
}
|
|
|
|
|
2015-08-17 14:17:12 +00:00
|
|
|
typedef void (*hashFunction)(const void* buffer, size_t bufferSize);
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-08-17 14:17:12 +00:00
|
|
|
static void localXXH32(const void* buffer, size_t bufferSize) { XXH32(buffer, bufferSize, 0); }
|
|
|
|
|
|
|
|
static void localXXH64(const void* buffer, size_t bufferSize) { XXH64(buffer, bufferSize, 0); }
|
|
|
|
|
|
|
|
static void BMK_benchHash(hashFunction h, const char* hName, const void* buffer, size_t bufferSize)
|
2015-05-07 12:30:27 +00:00
|
|
|
{
|
|
|
|
static const int nbh_perloop = 100;
|
2015-08-17 14:17:12 +00:00
|
|
|
int iterationNb;
|
|
|
|
double fastestH = 100000000.;
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2015-08-17 14:17:12 +00:00
|
|
|
DISPLAY("\r%79s\r", ""); /* Clean display line */
|
|
|
|
if (g_nbIterations<1) g_nbIterations=1;
|
|
|
|
for (iterationNb = 1; iterationNb <= g_nbIterations; iterationNb++)
|
2015-05-07 12:30:27 +00:00
|
|
|
{
|
2015-08-17 14:17:12 +00:00
|
|
|
int nbHashes = 0;
|
|
|
|
int milliTime;
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2015-08-17 14:17:12 +00:00
|
|
|
DISPLAY("%1i-%-17.17s : %10i ->\r", iterationNb, hName, (int)bufferSize);
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2015-08-17 14:17:12 +00:00
|
|
|
/* Timing loop */
|
|
|
|
milliTime = BMK_GetMilliStart();
|
|
|
|
while(BMK_GetMilliStart() == milliTime);
|
|
|
|
milliTime = BMK_GetMilliStart();
|
|
|
|
while(BMK_GetMilliSpan(milliTime) < TIMELOOP)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for (i=0; i<nbh_perloop; i++)
|
2015-05-07 12:30:27 +00:00
|
|
|
{
|
2015-08-17 14:17:12 +00:00
|
|
|
h(buffer, bufferSize);
|
2015-05-07 12:30:27 +00:00
|
|
|
}
|
2015-08-17 14:17:12 +00:00
|
|
|
nbHashes += nbh_perloop;
|
2015-05-07 12:30:27 +00:00
|
|
|
}
|
2015-08-17 14:17:12 +00:00
|
|
|
milliTime = BMK_GetMilliSpan(milliTime);
|
|
|
|
if ((double)milliTime < fastestH*nbHashes) fastestH = (double)milliTime/nbHashes;
|
|
|
|
DISPLAY("%1i-%-17.17s : %10i -> %7.1f MB/s\r", iterationNb, hName, (int)bufferSize, (double)bufferSize / fastestH / 1000.);
|
2015-05-07 12:30:27 +00:00
|
|
|
}
|
2015-08-17 14:17:12 +00:00
|
|
|
DISPLAY("%-19.19s : %10i -> %7.1f MB/s \n", hName, (int)bufferSize, (double)bufferSize / fastestH / 1000.);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Note : buffer is supposed malloc'ed, hence aligned */
|
|
|
|
static void BMK_benchMem(const void* buffer, size_t bufferSize)
|
|
|
|
{
|
|
|
|
/* XXH32 bench */
|
|
|
|
BMK_benchHash(localXXH32, "XXH32", buffer, bufferSize);
|
2015-05-07 12:30:27 +00:00
|
|
|
|
|
|
|
/* Bench XXH32 on Unaligned input */
|
2015-08-12 16:10:16 +00:00
|
|
|
if (bufferSize>1)
|
2015-08-17 14:17:12 +00:00
|
|
|
BMK_benchHash(localXXH32, "XXH32 unaligned", ((const char*)buffer)+1, bufferSize-1);
|
2015-05-07 12:30:27 +00:00
|
|
|
|
|
|
|
/* Bench XXH64 */
|
2015-08-17 14:17:12 +00:00
|
|
|
BMK_benchHash(localXXH64, "XXH64", buffer, bufferSize);
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2015-08-17 14:17:12 +00:00
|
|
|
/* Bench XXH64 on Unaligned input */
|
|
|
|
if (bufferSize>1)
|
|
|
|
BMK_benchHash(localXXH64, "XXH64 unaligned", ((const char*)buffer)+1, bufferSize-1);
|
2015-05-07 12:30:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-08-07 23:22:56 +00:00
|
|
|
static int BMK_benchFiles(const char** fileNamesTable, int nbFiles)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
|
|
|
int fileIdx=0;
|
|
|
|
|
|
|
|
while (fileIdx<nbFiles)
|
|
|
|
{
|
|
|
|
FILE* inFile;
|
2015-08-07 23:22:56 +00:00
|
|
|
const char* inFileName;
|
2014-08-15 09:27:04 +00:00
|
|
|
U64 inFileSize;
|
|
|
|
size_t benchedSize;
|
|
|
|
size_t readSize;
|
|
|
|
char* buffer;
|
|
|
|
char* alignedBuffer;
|
|
|
|
|
2015-01-01 16:10:04 +00:00
|
|
|
/* Check file existence */
|
2014-08-15 09:27:04 +00:00
|
|
|
inFileName = fileNamesTable[fileIdx++];
|
|
|
|
inFile = fopen( inFileName, "rb" );
|
2015-06-28 11:20:23 +00:00
|
|
|
if ((inFile==NULL) || (inFileName==NULL))
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
|
|
|
DISPLAY( "Pb opening %s\n", inFileName);
|
|
|
|
return 11;
|
|
|
|
}
|
|
|
|
|
2015-01-01 16:10:04 +00:00
|
|
|
/* Memory allocation & restrictions */
|
2014-08-15 09:27:04 +00:00
|
|
|
inFileSize = BMK_GetFileSize(inFileName);
|
|
|
|
benchedSize = (size_t) BMK_findMaxMem(inFileSize);
|
|
|
|
if ((U64)benchedSize > inFileSize) benchedSize = (size_t)inFileSize;
|
|
|
|
if (benchedSize < inFileSize)
|
|
|
|
{
|
|
|
|
DISPLAY("Not enough memory for '%s' full size; testing %i MB only...\n", inFileName, (int)(benchedSize>>20));
|
|
|
|
}
|
|
|
|
|
|
|
|
buffer = (char*)malloc((size_t )benchedSize+16);
|
|
|
|
if(!buffer)
|
|
|
|
{
|
|
|
|
DISPLAY("\nError: not enough memory!\n");
|
|
|
|
fclose(inFile);
|
|
|
|
return 12;
|
|
|
|
}
|
2015-01-01 16:10:04 +00:00
|
|
|
alignedBuffer = (buffer+15) - (((size_t)(buffer+15)) & 0xF); /* align on next 16 bytes boundaries */
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-01-01 16:10:04 +00:00
|
|
|
/* Fill input buffer */
|
2014-08-15 09:27:04 +00:00
|
|
|
DISPLAY("\rLoading %s... \n", inFileName);
|
|
|
|
readSize = fread(alignedBuffer, 1, benchedSize, inFile);
|
|
|
|
fclose(inFile);
|
|
|
|
|
|
|
|
if(readSize != benchedSize)
|
|
|
|
{
|
|
|
|
DISPLAY("\nError: problem reading file '%s' !! \n", inFileName);
|
|
|
|
free(buffer);
|
|
|
|
return 13;
|
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* bench */
|
|
|
|
BMK_benchMem(alignedBuffer, benchedSize);
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
free(buffer);
|
|
|
|
}
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
static int BMK_benchInternal(void)
|
|
|
|
{
|
2015-08-12 16:10:16 +00:00
|
|
|
const size_t benchedSize = g_sampleSize;
|
2015-05-07 12:30:27 +00:00
|
|
|
void* buffer;
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
buffer = malloc(benchedSize);
|
|
|
|
if(!buffer)
|
|
|
|
{
|
|
|
|
DISPLAY("\nError: not enough memory!\n");
|
|
|
|
return 12;
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* bench */
|
|
|
|
DISPLAY("\rSample of %u KB... \n", (U32)(benchedSize >> 10));
|
|
|
|
BMK_benchMem(buffer, benchedSize);
|
|
|
|
|
|
|
|
free(buffer);
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void BMK_checkResult(U32 r1, U32 r2)
|
|
|
|
{
|
|
|
|
static int nbTests = 1;
|
|
|
|
|
|
|
|
if (r1==r2) DISPLAY("\rTest%3i : %08X == %08X ok ", nbTests, r1, r2);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
DISPLAY("\rERROR : Test%3i : %08X <> %08X !!!!! \n", nbTests, r1, r2);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
nbTests++;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void BMK_checkResult64(U64 r1, U64 r2)
|
|
|
|
{
|
|
|
|
static int nbTests = 1;
|
|
|
|
|
|
|
|
if (r1!=r2)
|
|
|
|
{
|
|
|
|
DISPLAY("\rERROR : Test%3i : 64-bits values non equals !!!!! \n", nbTests);
|
2015-05-07 14:27:27 +00:00
|
|
|
DISPLAY("\r %08X%08X != %08X%08X \n", (U32)(r1>>32), (U32)r1, (U32)(r2>>32), (U32)r2);
|
2014-08-15 09:27:04 +00:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
nbTests++;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void BMK_testSequence64(void* sentence, int len, U64 seed, U64 Nresult)
|
|
|
|
{
|
2016-01-02 19:18:07 +00:00
|
|
|
XXH64_CREATESTATE_STATIC(state);
|
2014-08-15 09:27:04 +00:00
|
|
|
U64 Dresult;
|
|
|
|
int index;
|
|
|
|
|
|
|
|
Dresult = XXH64(sentence, len, seed);
|
|
|
|
BMK_checkResult64(Dresult, Nresult);
|
|
|
|
|
2016-01-02 19:18:07 +00:00
|
|
|
XXH64_reset(state, seed);
|
|
|
|
XXH64_update(state, sentence, len);
|
|
|
|
Dresult = XXH64_digest(state);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_checkResult64(Dresult, Nresult);
|
|
|
|
|
2016-01-02 19:18:07 +00:00
|
|
|
XXH64_reset(state, seed);
|
|
|
|
for (index=0; index<len; index++) XXH64_update(state, ((char*)sentence)+index, 1);
|
|
|
|
Dresult = XXH64_digest(state);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_checkResult64(Dresult, Nresult);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
static void BMK_testSequence(const void* sequence, size_t len, U32 seed, U32 Nresult)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
2016-01-02 19:18:07 +00:00
|
|
|
XXH32_CREATESTATE_STATIC(state);
|
2014-08-15 09:27:04 +00:00
|
|
|
U32 Dresult;
|
2015-05-07 14:27:27 +00:00
|
|
|
size_t index;
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
Dresult = XXH32(sequence, len, seed);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_checkResult(Dresult, Nresult);
|
|
|
|
|
2016-01-02 19:18:07 +00:00
|
|
|
XXH32_reset(state, seed);
|
|
|
|
XXH32_update(state, sequence, len);
|
|
|
|
Dresult = XXH32_digest(state);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_checkResult(Dresult, Nresult);
|
|
|
|
|
2016-01-02 19:18:07 +00:00
|
|
|
XXH32_reset(state, seed);
|
|
|
|
for (index=0; index<len; index++) XXH32_update(state, ((const char*)sequence)+index, 1);
|
|
|
|
Dresult = XXH32_digest(state);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_checkResult(Dresult, Nresult);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#define SANITY_BUFFER_SIZE 101
|
|
|
|
static void BMK_sanityCheck(void)
|
|
|
|
{
|
|
|
|
BYTE sanityBuffer[SANITY_BUFFER_SIZE];
|
|
|
|
int i;
|
2015-05-07 14:27:27 +00:00
|
|
|
static const U32 prime = 2654435761U;
|
|
|
|
U32 byteGen = prime;
|
|
|
|
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
for (i=0; i<SANITY_BUFFER_SIZE; i++)
|
|
|
|
{
|
2015-05-07 14:27:27 +00:00
|
|
|
sanityBuffer[i] = (BYTE)(byteGen>>24);
|
|
|
|
byteGen *= byteGen;
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
BMK_testSequence(NULL, 0, 0, 0x02CC5D05);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence(NULL, 0, prime, 0x36B78AE7);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_testSequence(sanityBuffer, 1, 0, 0xB85CBEE5);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence(sanityBuffer, 1, prime, 0xD5845D64);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_testSequence(sanityBuffer, 14, 0, 0xE5AA0AB4);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence(sanityBuffer, 14, prime, 0x4481951D);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_testSequence(sanityBuffer, SANITY_BUFFER_SIZE, 0, 0x1F1AA412);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence(sanityBuffer, SANITY_BUFFER_SIZE, prime, 0x498EC8E2);
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
BMK_testSequence64(NULL , 0, 0, 0xEF46DB3751D8E999ULL);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence64(NULL , 0, prime, 0xAC75FDA2929B17EFULL);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_testSequence64(sanityBuffer, 1, 0, 0x4FCE394CC88952D8ULL);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence64(sanityBuffer, 1, prime, 0x739840CB819FA723ULL);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_testSequence64(sanityBuffer, 14, 0, 0xCFFA8DB881BC3A3DULL);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence64(sanityBuffer, 14, prime, 0x5B9611585EFCC9CBULL);
|
2014-08-15 09:27:04 +00:00
|
|
|
BMK_testSequence64(sanityBuffer, SANITY_BUFFER_SIZE, 0, 0x0EAB543384F878ADULL);
|
2015-05-07 14:27:27 +00:00
|
|
|
BMK_testSequence64(sanityBuffer, SANITY_BUFFER_SIZE, prime, 0xCAA65939306F1E21ULL);
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-04 21:56:53 +00:00
|
|
|
DISPLAY("\r%79s\r", ""); /* Clean display line */
|
2014-09-25 20:22:59 +00:00
|
|
|
DISPLAYLEVEL(2, "Sanity check -- all tests ok\n");
|
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2016-01-11 00:31:04 +00:00
|
|
|
/* ********************************************************
|
|
|
|
* File Hashing
|
|
|
|
**********************************************************/
|
|
|
|
|
2016-01-10 16:06:34 +00:00
|
|
|
static void BMK_display_LittleEndian(const void* ptr, size_t length)
|
|
|
|
{
|
|
|
|
const BYTE* p = (const BYTE*)ptr;
|
2016-01-14 02:01:39 +00:00
|
|
|
size_t index;
|
|
|
|
for (index=length-1; index<length; index--) /* intentional underflow to negative to detect end */
|
|
|
|
DISPLAYRESULT("%02x", p[index]);
|
2016-01-10 16:06:34 +00:00
|
|
|
}
|
|
|
|
|
2014-12-09 17:42:33 +00:00
|
|
|
static void BMK_display_BigEndian(const void* ptr, size_t length)
|
|
|
|
{
|
2015-05-05 00:01:10 +00:00
|
|
|
const BYTE* p = (const BYTE*)ptr;
|
2016-01-14 02:01:39 +00:00
|
|
|
size_t index;
|
|
|
|
for (index=0; index<length; index++)
|
|
|
|
DISPLAYRESULT("%02x", p[index]);
|
2014-12-09 17:42:33 +00:00
|
|
|
}
|
2014-09-25 20:22:59 +00:00
|
|
|
|
2016-01-20 14:06:35 +00:00
|
|
|
static void BMK_hashStream(void* xxhHashValue, const algoType hashType, FILE* inFile, void* buffer, size_t blockSize)
|
|
|
|
{
|
|
|
|
XXH64_CREATESTATE_STATIC(state64);
|
|
|
|
XXH32_CREATESTATE_STATIC(state32);
|
|
|
|
size_t readSize;
|
|
|
|
|
|
|
|
/* Init */
|
|
|
|
XXH32_reset(state32, XXHSUM32_DEFAULT_SEED);
|
|
|
|
XXH64_reset(state64, XXHSUM64_DEFAULT_SEED);
|
|
|
|
|
|
|
|
/* Load file & update hash */
|
|
|
|
readSize = 1;
|
|
|
|
while (readSize)
|
|
|
|
{
|
|
|
|
readSize = fread(buffer, 1, blockSize, inFile);
|
|
|
|
switch(hashType)
|
|
|
|
{
|
|
|
|
case algo_xxh32:
|
|
|
|
XXH32_update(state32, buffer, readSize);
|
|
|
|
break;
|
|
|
|
case algo_xxh64:
|
|
|
|
XXH64_update(state64, buffer, readSize);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
switch(hashType)
|
|
|
|
{
|
|
|
|
case algo_xxh32:
|
|
|
|
{
|
|
|
|
U32 h32 = XXH32_digest(state32);
|
|
|
|
memcpy(xxhHashValue, &h32, sizeof(h32));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case algo_xxh64:
|
|
|
|
{
|
|
|
|
U64 h64 = XXH64_digest(state64);
|
|
|
|
memcpy(xxhHashValue, &h64, sizeof(h64));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-01-14 02:01:39 +00:00
|
|
|
|
2016-01-10 16:06:34 +00:00
|
|
|
typedef enum { big_endian, little_endian} endianess;
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2016-01-10 16:06:34 +00:00
|
|
|
static int BMK_hash(const char* fileName,
|
|
|
|
const algoType hashType,
|
|
|
|
const endianess displayEndianess)
|
2014-09-25 20:22:59 +00:00
|
|
|
{
|
|
|
|
FILE* inFile;
|
|
|
|
size_t const blockSize = 64 KB;
|
2015-08-07 23:22:56 +00:00
|
|
|
void* buffer;
|
2016-01-20 14:06:35 +00:00
|
|
|
U32 h32 = 0;
|
|
|
|
U64 h64 = 0;
|
2014-09-25 20:22:59 +00:00
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* Check file existence */
|
2014-10-29 12:55:58 +00:00
|
|
|
if (fileName == stdinName)
|
|
|
|
{
|
|
|
|
inFile = stdin;
|
|
|
|
SET_BINARY_MODE(stdin);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
inFile = fopen( fileName, "rb" );
|
2014-09-25 20:22:59 +00:00
|
|
|
if (inFile==NULL)
|
|
|
|
{
|
|
|
|
DISPLAY( "Pb opening %s\n", fileName);
|
2016-01-10 16:06:34 +00:00
|
|
|
return 1;
|
2014-09-25 20:22:59 +00:00
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* Memory allocation & restrictions */
|
2015-08-07 23:22:56 +00:00
|
|
|
buffer = malloc(blockSize);
|
2014-09-25 20:22:59 +00:00
|
|
|
if(!buffer)
|
|
|
|
{
|
|
|
|
DISPLAY("\nError: not enough memory!\n");
|
|
|
|
fclose(inFile);
|
2016-01-10 16:06:34 +00:00
|
|
|
return 1;
|
2014-09-25 20:22:59 +00:00
|
|
|
}
|
|
|
|
|
2016-01-10 23:30:08 +00:00
|
|
|
/* loading notification */
|
|
|
|
{
|
|
|
|
const size_t fileNameSize = strlen(fileName);
|
|
|
|
const char* const fileNameEnd = fileName + fileNameSize;
|
|
|
|
const size_t maxInfoFilenameSize = fileNameSize > 30 ? 30 : fileNameSize;
|
|
|
|
size_t infoFilenameSize = 1;
|
|
|
|
while ( (infoFilenameSize < maxInfoFilenameSize)
|
|
|
|
&&(fileNameEnd[-infoFilenameSize-1] != '/')
|
|
|
|
&&(fileNameEnd[-infoFilenameSize-1] != '\\') )
|
|
|
|
infoFilenameSize++;
|
|
|
|
DISPLAY("\rLoading %s... \r", fileNameEnd - infoFilenameSize);
|
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* Load file & update hash */
|
2016-01-20 14:06:35 +00:00
|
|
|
switch(hashType)
|
2014-09-25 20:22:59 +00:00
|
|
|
{
|
2016-01-20 14:06:35 +00:00
|
|
|
case algo_xxh32:
|
|
|
|
BMK_hashStream(&h32, hashType, inFile, buffer, blockSize);
|
|
|
|
break;
|
|
|
|
case algo_xxh64:
|
|
|
|
BMK_hashStream(&h64, hashType, inFile, buffer, blockSize);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
2014-09-25 20:22:59 +00:00
|
|
|
}
|
2016-01-20 14:06:35 +00:00
|
|
|
|
2014-09-25 20:22:59 +00:00
|
|
|
fclose(inFile);
|
|
|
|
free(buffer);
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* display Hash */
|
2016-01-10 16:06:34 +00:00
|
|
|
switch(hashType)
|
2014-09-25 20:22:59 +00:00
|
|
|
{
|
2016-01-10 16:06:34 +00:00
|
|
|
case algo_xxh32:
|
2014-09-25 20:22:59 +00:00
|
|
|
{
|
2016-01-14 02:01:39 +00:00
|
|
|
XXH32_canonical_t hcbe32;
|
|
|
|
XXH32_canonicalFromHash(&hcbe32, h32);
|
|
|
|
displayEndianess==big_endian ?
|
|
|
|
BMK_display_BigEndian(&hcbe32, sizeof(hcbe32)) : BMK_display_LittleEndian(&hcbe32, sizeof(hcbe32));
|
2016-01-10 23:30:08 +00:00
|
|
|
DISPLAYRESULT(" %s\n", fileName);
|
2014-09-25 20:22:59 +00:00
|
|
|
break;
|
|
|
|
}
|
2016-01-10 16:06:34 +00:00
|
|
|
case algo_xxh64:
|
2014-09-25 20:22:59 +00:00
|
|
|
{
|
2016-01-14 02:01:39 +00:00
|
|
|
XXH64_canonical_t hcbe64;
|
|
|
|
XXH64_canonicalFromHash(&hcbe64, h64);
|
|
|
|
displayEndianess==big_endian ?
|
|
|
|
BMK_display_BigEndian(&hcbe64, sizeof(hcbe64)) : BMK_display_LittleEndian(&hcbe64, sizeof(hcbe64));
|
2016-01-10 23:30:08 +00:00
|
|
|
DISPLAYRESULT(" %s\n", fileName);
|
2014-09-25 20:22:59 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-01-10 16:06:34 +00:00
|
|
|
static int BMK_hashFiles(const char** fnList, int fnTotal,
|
|
|
|
algoType hashType, endianess displayEndianess)
|
2015-08-07 23:22:56 +00:00
|
|
|
{
|
|
|
|
int fnNb;
|
|
|
|
int result = 0;
|
2016-01-10 16:06:34 +00:00
|
|
|
|
2015-08-07 23:22:56 +00:00
|
|
|
if (fnTotal==0)
|
2016-01-10 16:06:34 +00:00
|
|
|
return BMK_hash(stdinName, hashType, displayEndianess);
|
|
|
|
|
|
|
|
for (fnNb=0; fnNb<fnTotal; fnNb++)
|
|
|
|
result += BMK_hash(fnList[fnNb], hashType, displayEndianess);
|
2016-01-10 23:30:08 +00:00
|
|
|
DISPLAY("\r%70s\r", "");
|
2015-08-07 23:22:56 +00:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-01-20 14:45:52 +00:00
|
|
|
typedef enum {
|
|
|
|
CanonicalFromString_ok,
|
|
|
|
CanonicalFromString_invalidFormat,
|
|
|
|
} CanonicalFromStringResult;
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
ParseLine_ok,
|
|
|
|
ParseLine_invalidFormat,
|
|
|
|
} ParseLineResult;
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
LineStatus_hashOk,
|
|
|
|
LineStatus_hashFailed,
|
|
|
|
LineStatus_failedToOpen,
|
|
|
|
} LineStatus;
|
|
|
|
|
|
|
|
typedef union {
|
|
|
|
XXH32_canonical_t xxh32;
|
|
|
|
XXH64_canonical_t xxh64;
|
|
|
|
} Canonical;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
Canonical canonical;
|
|
|
|
const char* filename;
|
|
|
|
int xxhBits; /* canonical type : 32:xxh32, 64:xxh64 */
|
|
|
|
} ParsedLine;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
size_t nProperlyFormattedLines;
|
|
|
|
size_t nImproperlyFormattedLines;
|
|
|
|
size_t nMismatchedChecksums;
|
|
|
|
size_t nOpenOrReadFailures;
|
|
|
|
size_t nMixedFormatLines;
|
|
|
|
int xxhBits;
|
|
|
|
int quit;
|
|
|
|
} ParseFileReport;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
const char* inFileName;
|
|
|
|
FILE* inFile;
|
|
|
|
size_t lineMax;
|
|
|
|
char* lineBuf;
|
|
|
|
size_t blockSize;
|
|
|
|
char* blockBuf;
|
|
|
|
int strictMode;
|
|
|
|
int statusOnly;
|
|
|
|
int warn;
|
|
|
|
int quiet;
|
|
|
|
ParseFileReport report;
|
|
|
|
} ParseFileArg;
|
|
|
|
|
|
|
|
|
|
|
|
/* fgets() with tail chop.
|
|
|
|
*/
|
|
|
|
static char* getLine(char* buf, size_t n, FILE* fp)
|
|
|
|
{
|
|
|
|
char* const r = fgets(buf, (int) n, fp);
|
|
|
|
if (r)
|
|
|
|
{
|
|
|
|
const size_t l = strlen(r);
|
|
|
|
if (l && r[l-1] == '\n')
|
|
|
|
{
|
|
|
|
r[l-1] = '\0';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Converts one hexadecimal character to integer.
|
|
|
|
* Returns -1, if given character is not hexadecimal.
|
|
|
|
*/
|
|
|
|
static int charToHex(char c)
|
|
|
|
{
|
|
|
|
int result = -1;
|
|
|
|
if (c >= '0' && c <= '9') {
|
|
|
|
result = (int) (c - '0');
|
|
|
|
} else if (c >= 'A' && c <= 'F') {
|
|
|
|
result = (int) (c - 'A') + 0x0a;
|
|
|
|
} else if (c >= 'a' && c <= 'f') {
|
|
|
|
result = (int) (c - 'a') + 0x0a;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Converts XXH32 canonical hexadecimal string hashStr to big endian unsigned char array dst.
|
|
|
|
* Returns CANONICAL_FROM_STRING_INVALID_FORMAT, if hashStr is not well formatted.
|
|
|
|
* Returns CANONICAL_FROM_STRING_OK, if hashStr is parsed successfully.
|
|
|
|
*/
|
|
|
|
static CanonicalFromStringResult canonicalFromString(unsigned char* dst,
|
|
|
|
size_t dstSize,
|
|
|
|
const char* hashStr)
|
|
|
|
{
|
|
|
|
size_t i;
|
|
|
|
for (i = 0; i < dstSize; ++i)
|
|
|
|
{
|
|
|
|
int h0, h1;
|
|
|
|
|
|
|
|
h0 = charToHex(hashStr[i*2 + 0]);
|
|
|
|
if (h0 < 0)
|
|
|
|
{
|
|
|
|
return CanonicalFromString_invalidFormat;
|
|
|
|
}
|
|
|
|
|
|
|
|
h1 = charToHex(hashStr[i*2 + 1]);
|
|
|
|
if (h1 < 0)
|
|
|
|
{
|
|
|
|
return CanonicalFromString_invalidFormat;
|
|
|
|
}
|
|
|
|
|
|
|
|
dst[i] = (unsigned char) ((h0 << 4) | h1);
|
|
|
|
}
|
|
|
|
return CanonicalFromString_ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Parse single line of xxHash checksum file.
|
|
|
|
* Returns PARSE_LINE_ERROR_INVALID_FORMAT, if line is not well formatted.
|
|
|
|
* Returns PARSE_LINE_OK if line is parsed successfully.
|
|
|
|
* And members of parseLine will be filled by parsed values.
|
|
|
|
*
|
|
|
|
* - line must be ended with '\0'.
|
|
|
|
* - Since parsedLine.filename will point within given argument `line`,
|
|
|
|
* users must keep `line`s content during they are using parsedLine.
|
|
|
|
*
|
|
|
|
* Given xxHash checksum line should have the following format:
|
|
|
|
*
|
|
|
|
* <8 or 16 hexadecimal char> <space> <space> <filename...> <'\0'>
|
|
|
|
*/
|
|
|
|
static ParseLineResult parseLine(ParsedLine* parsedLine, const char* line)
|
|
|
|
{
|
|
|
|
const char* const firstSpace = strchr(line, ' ');
|
|
|
|
const char* const secondSpace = firstSpace + 1;
|
|
|
|
|
|
|
|
parsedLine->filename = NULL;
|
|
|
|
parsedLine->xxhBits = 0;
|
|
|
|
|
|
|
|
if (firstSpace == NULL || *secondSpace != ' ')
|
|
|
|
{
|
|
|
|
return ParseLine_invalidFormat;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (firstSpace - line)
|
|
|
|
{
|
|
|
|
case 8:
|
|
|
|
{
|
|
|
|
XXH32_canonical_t* xxh32c = &parsedLine->canonical.xxh32;
|
|
|
|
if (canonicalFromString(xxh32c->digest, sizeof(xxh32c->digest), line)
|
|
|
|
!= CanonicalFromString_ok)
|
|
|
|
{
|
|
|
|
return ParseLine_invalidFormat;
|
|
|
|
}
|
|
|
|
parsedLine->xxhBits = 32;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case 16:
|
|
|
|
{
|
|
|
|
XXH64_canonical_t* xxh64c = &parsedLine->canonical.xxh64;
|
|
|
|
if (canonicalFromString(xxh64c->digest, sizeof(xxh64c->digest), line)
|
|
|
|
!= CanonicalFromString_ok)
|
|
|
|
{
|
|
|
|
return ParseLine_invalidFormat;
|
|
|
|
}
|
|
|
|
parsedLine->xxhBits = 64;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
return ParseLine_invalidFormat;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
parsedLine->filename = secondSpace + 1;
|
|
|
|
return ParseLine_ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Parse xxHash checksum file.
|
|
|
|
*/
|
|
|
|
static void parseFile1(ParseFileArg* parseFileArg)
|
|
|
|
{
|
|
|
|
FILE* const inFile = parseFileArg->inFile;
|
|
|
|
const char* const inFileName = parseFileArg->inFileName;
|
|
|
|
const size_t lineMax = parseFileArg->lineMax;
|
|
|
|
char* const lineBuf = parseFileArg->lineBuf;
|
|
|
|
ParseFileReport* const report = &parseFileArg->report;
|
|
|
|
|
|
|
|
size_t lineNumber = 0;
|
|
|
|
memset(report, 0, sizeof(*report));
|
|
|
|
|
|
|
|
while (!report->quit && getLine(lineBuf, lineMax, inFile))
|
|
|
|
{
|
|
|
|
FILE* fp = NULL;
|
|
|
|
LineStatus lineStatus = LineStatus_hashFailed;
|
|
|
|
ParsedLine parsedLine;
|
|
|
|
memset(&parsedLine, 0, sizeof(parsedLine));
|
|
|
|
|
|
|
|
++lineNumber;
|
|
|
|
if (lineNumber == 0)
|
|
|
|
{
|
|
|
|
/* This is unlikely happen, but md5sum.c has this
|
|
|
|
* error check. */
|
|
|
|
DISPLAY("%s : too many checksum lines\n", inFileName);
|
|
|
|
report->quit = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (parseLine(&parsedLine, lineBuf) != ParseLine_ok)
|
|
|
|
{
|
|
|
|
report->nImproperlyFormattedLines++;
|
|
|
|
if (parseFileArg->warn)
|
|
|
|
{
|
|
|
|
DISPLAY("%s : %" PRIuMAX ": improperly formatted XXHASH checksum line\n"
|
|
|
|
, inFileName, (uintmax_t) lineNumber);
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (report->xxhBits != 0 && report->xxhBits != parsedLine.xxhBits)
|
|
|
|
{
|
|
|
|
/* Don't accept xxh32/xxh64 mixed file */
|
|
|
|
report->nImproperlyFormattedLines++;
|
|
|
|
report->nMixedFormatLines++;
|
|
|
|
if (parseFileArg->warn)
|
|
|
|
{
|
|
|
|
DISPLAY("%s : %" PRIuMAX ": improperly formatted XXHASH checksum line (XXH32/64)\n"
|
|
|
|
, inFileName, (uintmax_t) lineNumber);
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
report->nProperlyFormattedLines++;
|
|
|
|
if (report->xxhBits == 0)
|
|
|
|
{
|
|
|
|
report->xxhBits = parsedLine.xxhBits;
|
|
|
|
}
|
|
|
|
|
|
|
|
fp = fopen(parsedLine.filename, "rb");
|
|
|
|
if (fp == NULL)
|
|
|
|
{
|
|
|
|
lineStatus = LineStatus_failedToOpen;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
lineStatus = LineStatus_hashFailed;
|
|
|
|
switch (parsedLine.xxhBits)
|
|
|
|
{
|
|
|
|
case 32:
|
|
|
|
{
|
|
|
|
XXH32_hash_t xxh;
|
|
|
|
BMK_hashStream(&xxh, algo_xxh32, fp, parseFileArg->blockBuf, parseFileArg->blockSize);
|
|
|
|
if (xxh == XXH32_hashFromCanonical(&parsedLine.canonical.xxh32))
|
|
|
|
{
|
|
|
|
lineStatus = LineStatus_hashOk;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 64:
|
|
|
|
{
|
|
|
|
XXH64_hash_t xxh;
|
|
|
|
BMK_hashStream(&xxh, algo_xxh64, fp, parseFileArg->blockBuf, parseFileArg->blockSize);
|
|
|
|
if (xxh == XXH64_hashFromCanonical(&parsedLine.canonical.xxh64))
|
|
|
|
{
|
|
|
|
lineStatus = LineStatus_hashOk;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
fclose(fp);
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (lineStatus)
|
|
|
|
{
|
|
|
|
default:
|
|
|
|
DISPLAY("%s : unknown error\n", inFileName);
|
|
|
|
report->quit = 1;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LineStatus_failedToOpen:
|
|
|
|
report->nOpenOrReadFailures++;
|
|
|
|
if (!parseFileArg->statusOnly)
|
|
|
|
{
|
|
|
|
DISPLAYRESULT("%s : %" PRIuMAX ": FAILED open or read %s\n"
|
|
|
|
, inFileName, (uintmax_t) lineNumber, parsedLine.filename);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LineStatus_hashOk:
|
|
|
|
case LineStatus_hashFailed:
|
|
|
|
{
|
|
|
|
int b = 1;
|
|
|
|
if (lineStatus == LineStatus_hashOk)
|
|
|
|
{
|
|
|
|
/* If --quiet is specified, don't display "OK" */
|
|
|
|
if (parseFileArg->quiet)
|
|
|
|
{
|
|
|
|
b = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
report->nMismatchedChecksums++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (b && !parseFileArg->statusOnly)
|
|
|
|
{
|
|
|
|
DISPLAYRESULT("%s: %s\n", parsedLine.filename
|
|
|
|
, lineStatus == LineStatus_hashOk ? "OK" : "FAILED");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Parse xxHash checksum file.
|
|
|
|
* Returns 1, if all procedures were succeeded.
|
|
|
|
* Returns 0, if any procedures was failed.
|
|
|
|
*
|
|
|
|
* If strictMode != 0, return error code if any line is invalid.
|
|
|
|
* If statusOnly != 0, don't generate any output.
|
|
|
|
* If warn != 0, print a warning message to stderr.
|
|
|
|
* If quiet != 0, suppress "OK" line.
|
|
|
|
*
|
|
|
|
* "All procedures are succeeded" means:
|
|
|
|
* - Checksum file contains at least one line and less than SIZE_T_MAX lines.
|
|
|
|
* - All files are properly opened and read.
|
|
|
|
* - All hash values match with its content.
|
|
|
|
* - (strict mode) All lines in checksum file are consistent and well formatted.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static int checkFile(const char* inFileName,
|
|
|
|
const endianess displayEndianess,
|
|
|
|
U32 strictMode,
|
|
|
|
U32 statusOnly,
|
|
|
|
U32 warn,
|
|
|
|
U32 quiet)
|
|
|
|
{
|
|
|
|
int result = 0;
|
|
|
|
FILE* inFile = NULL;
|
|
|
|
ParseFileArg parseFileArgBody;
|
|
|
|
ParseFileArg* const parseFileArg = &parseFileArgBody;
|
|
|
|
ParseFileReport* const report = &parseFileArg->report;
|
|
|
|
|
|
|
|
if (displayEndianess != big_endian)
|
|
|
|
{
|
|
|
|
/* Don't accept little endian */
|
|
|
|
DISPLAY( "Check file mode doesn't support little endian" );
|
2016-01-22 04:19:19 +00:00
|
|
|
return 0;
|
2016-01-20 14:45:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (strcmp(inFileName, stdinName) == 0)
|
|
|
|
{
|
|
|
|
inFile = stdin;
|
|
|
|
SET_BINARY_MODE(stdin);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
inFile = fopen( inFileName, "rt" );
|
|
|
|
}
|
|
|
|
|
|
|
|
if (inFile == NULL)
|
|
|
|
{
|
|
|
|
DISPLAY( "Pb opening %s\n", inFileName);
|
2016-01-22 04:19:19 +00:00
|
|
|
return 0;
|
2016-01-20 14:45:52 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
parseFileArg->inFileName = inFileName;
|
|
|
|
parseFileArg->inFile = inFile;
|
|
|
|
parseFileArg->lineMax = MAX_LINE_LENGTH;
|
|
|
|
parseFileArg->lineBuf = (char*) malloc(parseFileArg->lineMax);
|
|
|
|
parseFileArg->blockSize = 64 * 1024;
|
|
|
|
parseFileArg->blockBuf = (char*) malloc(parseFileArg->blockSize);
|
|
|
|
parseFileArg->strictMode = strictMode;
|
|
|
|
parseFileArg->statusOnly = statusOnly;
|
|
|
|
parseFileArg->warn = warn;
|
|
|
|
parseFileArg->quiet = quiet;
|
|
|
|
|
|
|
|
parseFile1(parseFileArg);
|
|
|
|
|
|
|
|
free(parseFileArg->blockBuf);
|
|
|
|
free(parseFileArg->lineBuf);
|
|
|
|
|
|
|
|
if (inFile != stdin)
|
|
|
|
{
|
|
|
|
fclose(inFile);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Show error/warning messages. All messages are copied from md5sum.c
|
|
|
|
*/
|
|
|
|
if (report->nProperlyFormattedLines == 0)
|
|
|
|
{
|
|
|
|
DISPLAY("%s: no properly formatted XXHASH checksum lines found", inFileName);
|
|
|
|
}
|
|
|
|
else if (!statusOnly)
|
|
|
|
{
|
|
|
|
if (report->nImproperlyFormattedLines)
|
|
|
|
{
|
|
|
|
DISPLAYRESULT("%" PRIuMAX " lines are improperly formatted\n"
|
|
|
|
, (uintmax_t) report->nImproperlyFormattedLines);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (report->nOpenOrReadFailures)
|
|
|
|
{
|
|
|
|
DISPLAYRESULT("%" PRIuMAX " listed files could not be read\n"
|
|
|
|
, (uintmax_t) report->nOpenOrReadFailures);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (report->nMismatchedChecksums)
|
|
|
|
{
|
|
|
|
DISPLAYRESULT("%" PRIuMAX " computed checksums did NOT match\n"
|
|
|
|
, (uintmax_t) report->nMismatchedChecksums);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Result (exit) code logic is copied from
|
|
|
|
* gnu coreutils/src/md5sum.c digest_check() */
|
|
|
|
result = report->nProperlyFormattedLines != 0
|
|
|
|
&& report->nMismatchedChecksums == 0
|
|
|
|
&& report->nOpenOrReadFailures == 0
|
|
|
|
&& (!strictMode || report->nImproperlyFormattedLines == 0)
|
|
|
|
&& report->quit == 0;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int checkFiles(const char** fnList, int fnTotal,
|
|
|
|
const endianess displayEndianess,
|
|
|
|
U32 strictMode,
|
|
|
|
U32 statusOnly,
|
|
|
|
U32 warn,
|
|
|
|
U32 quiet)
|
|
|
|
{
|
|
|
|
int fnNb;
|
|
|
|
int ok = 1;
|
|
|
|
for (fnNb=0; fnNb<fnTotal; fnNb++)
|
|
|
|
ok &= checkFile(fnList[fnNb], displayEndianess, strictMode, statusOnly, warn, quiet);
|
|
|
|
return ok ? 0 : 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2016-01-04 07:32:38 +00:00
|
|
|
/* ********************************************************
|
2015-05-04 21:56:53 +00:00
|
|
|
* Main
|
2016-01-04 07:32:38 +00:00
|
|
|
**********************************************************/
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
static int usage(const char* exename)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
2014-10-18 11:03:38 +00:00
|
|
|
DISPLAY( WELCOME_MESSAGE );
|
2014-08-15 09:27:04 +00:00
|
|
|
DISPLAY( "Usage :\n");
|
2016-01-07 22:54:51 +00:00
|
|
|
DISPLAY( " %s [arg] [filenames]\n", exename);
|
2014-10-29 12:55:58 +00:00
|
|
|
DISPLAY( "When no filename provided, or - provided : use stdin as input\n");
|
2014-08-15 09:27:04 +00:00
|
|
|
DISPLAY( "Arguments :\n");
|
2016-01-10 16:06:34 +00:00
|
|
|
DISPLAY( " -H# : hash selection : 0=32bits, 1=64bits (default: %i)\n", (int)g_defaultAlgo);
|
2016-01-14 02:01:39 +00:00
|
|
|
DISPLAY( " -h : help \n");
|
2016-01-10 16:06:34 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int usage_advanced(const char* exename)
|
|
|
|
{
|
|
|
|
usage(exename);
|
|
|
|
DISPLAY( "Advanced :\n");
|
2016-01-14 02:01:39 +00:00
|
|
|
DISPLAY( "--little-endian : hash printed using little endian convention (default: big endian)\n");
|
2014-09-25 20:22:59 +00:00
|
|
|
DISPLAY( " -b : benchmark mode \n");
|
2014-10-18 11:03:38 +00:00
|
|
|
DISPLAY( " -i# : number of iterations (benchmark mode; default %i)\n", g_nbIterations);
|
2014-08-15 09:27:04 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
static int badusage(const char* exename)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
|
|
|
DISPLAY("Wrong parameters\n");
|
|
|
|
usage(exename);
|
2014-09-25 20:22:59 +00:00
|
|
|
return 1;
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-08-07 23:22:56 +00:00
|
|
|
int main(int argc, const char** argv)
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
2014-10-29 12:55:58 +00:00
|
|
|
int i, filenamesStart=0;
|
|
|
|
const char* exename = argv[0];
|
2014-09-25 20:22:59 +00:00
|
|
|
U32 benchmarkMode = 0;
|
2016-01-20 14:45:52 +00:00
|
|
|
U32 fileCheckMode = 0;
|
|
|
|
U32 strictMode = 0;
|
|
|
|
U32 statusOnly = 0;
|
|
|
|
U32 warn = 0;
|
|
|
|
U32 quiet = 0;
|
2016-01-10 16:06:34 +00:00
|
|
|
algoType algo = g_defaultAlgo;
|
|
|
|
endianess displayEndianess = big_endian;
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-08-12 17:24:35 +00:00
|
|
|
/* special case : xxh32sum default to 32 bits checksum */
|
2016-01-10 16:06:34 +00:00
|
|
|
if (strstr(exename, "xxh32sum") != NULL) algo = algo_xxh32;
|
2014-08-15 09:27:04 +00:00
|
|
|
|
|
|
|
for(i=1; i<argc; i++)
|
|
|
|
{
|
2015-08-07 23:22:56 +00:00
|
|
|
const char* argument = argv[i];
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
if(!argument) continue; /* Protection, if argument empty */
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2016-01-10 16:06:34 +00:00
|
|
|
if (!strcmp(argument, "--little-endian")) { displayEndianess = little_endian; continue; }
|
2016-01-20 14:45:52 +00:00
|
|
|
if (!strcmp(argument, "--check")) { fileCheckMode = 1; continue; }
|
|
|
|
if (!strcmp(argument, "--strict")) { strictMode = 1; continue; }
|
|
|
|
if (!strcmp(argument, "--status")) { statusOnly = 1; continue; }
|
|
|
|
if (!strcmp(argument, "--quiet")) { quiet = 1; continue; }
|
|
|
|
if (!strcmp(argument, "--warn")) { warn = 1; continue; }
|
2016-01-10 16:06:34 +00:00
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
if (*argument!='-')
|
2014-08-15 09:27:04 +00:00
|
|
|
{
|
2015-08-07 23:22:56 +00:00
|
|
|
if (filenamesStart==0) filenamesStart=i; /* only supports a continuous list of filenames */
|
2014-10-29 12:55:58 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* command selection */
|
|
|
|
argument++; /* note : *argument=='-' */
|
2014-08-15 09:27:04 +00:00
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
while (*argument!=0)
|
|
|
|
{
|
|
|
|
switch(*argument)
|
2014-09-25 20:22:59 +00:00
|
|
|
{
|
2015-08-19 14:11:24 +00:00
|
|
|
/* Display version */
|
|
|
|
case 'V':
|
|
|
|
DISPLAY(WELCOME_MESSAGE); return 0;
|
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
/* Display help on usage */
|
2014-10-29 12:55:58 +00:00
|
|
|
case 'h':
|
2016-01-10 16:06:34 +00:00
|
|
|
return usage_advanced(exename);
|
2014-10-29 12:55:58 +00:00
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
/* select hash algorithm */
|
2014-10-29 12:55:58 +00:00
|
|
|
case 'H':
|
2016-01-10 16:06:34 +00:00
|
|
|
algo = (algoType)(argument[1] - '0');
|
2014-10-29 12:55:58 +00:00
|
|
|
argument+=2;
|
|
|
|
break;
|
|
|
|
|
2016-01-20 14:45:52 +00:00
|
|
|
/* File check mode */
|
|
|
|
case 'c':
|
|
|
|
fileCheckMode=1;
|
|
|
|
argument++;
|
|
|
|
break;
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* Trigger benchmark mode */
|
2014-10-29 12:55:58 +00:00
|
|
|
case 'b':
|
|
|
|
argument++;
|
|
|
|
benchmarkMode=1;
|
|
|
|
break;
|
|
|
|
|
2015-05-07 14:27:27 +00:00
|
|
|
/* Modify Nb Iterations (benchmark only) */
|
2014-10-29 12:55:58 +00:00
|
|
|
case 'i':
|
|
|
|
g_nbIterations = argument[1] - '0';
|
|
|
|
argument+=2;
|
|
|
|
break;
|
|
|
|
|
2015-08-12 16:10:16 +00:00
|
|
|
/* Modify Block size (benchmark only) */
|
|
|
|
case 'B':
|
|
|
|
argument++;
|
|
|
|
g_sampleSize = 0;
|
|
|
|
while (argument[0]>='0' && argument[0]<='9')
|
|
|
|
g_sampleSize *= 10, g_sampleSize += argument[0]-'0', argument++;
|
|
|
|
break;
|
|
|
|
|
2014-10-29 12:55:58 +00:00
|
|
|
default:
|
|
|
|
return badusage(exename);
|
2014-09-25 20:22:59 +00:00
|
|
|
}
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* Check benchmark mode */
|
2014-10-18 11:10:27 +00:00
|
|
|
if (benchmarkMode)
|
|
|
|
{
|
|
|
|
DISPLAY( WELCOME_MESSAGE );
|
2014-10-29 12:55:58 +00:00
|
|
|
BMK_sanityCheck();
|
2015-05-07 12:30:27 +00:00
|
|
|
if (filenamesStart==0) return BMK_benchInternal();
|
2015-08-07 23:22:56 +00:00
|
|
|
return BMK_benchFiles(argv+filenamesStart, argc-filenamesStart);
|
2014-10-18 11:10:27 +00:00
|
|
|
}
|
2014-09-25 20:22:59 +00:00
|
|
|
|
2015-05-07 12:30:27 +00:00
|
|
|
/* Check if input is defined as console; trigger an error in this case */
|
2015-08-07 23:22:56 +00:00
|
|
|
if ( (filenamesStart==0) && IS_CONSOLE(stdin) ) return badusage(exename);
|
2015-05-07 12:30:27 +00:00
|
|
|
|
2015-08-07 23:22:56 +00:00
|
|
|
if (filenamesStart==0) filenamesStart = argc;
|
2016-01-20 14:45:52 +00:00
|
|
|
if (fileCheckMode)
|
|
|
|
{
|
|
|
|
return checkFiles(argv+filenamesStart, argc-filenamesStart, displayEndianess, strictMode, statusOnly, warn, quiet);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
return BMK_hashFiles(argv+filenamesStart, argc-filenamesStart, algo, displayEndianess);
|
|
|
|
}
|
2014-08-15 09:27:04 +00:00
|
|
|
}
|