fullbench.c 33 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897
  1. /*
  2. bench.c - Demo program to benchmark open-source compression algorithm
  3. Copyright (C) Yann Collet 2012-2020
  4. GPL v2 License
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License along
  14. with this program; if not, write to the Free Software Foundation, Inc.,
  15. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  16. You can contact the author at :
  17. - LZ4 source repository : https://github.com/lz4/lz4
  18. - LZ4 public forum : https://groups.google.com/forum/#!forum/lz4c
  19. */
  20. #if defined(_MSC_VER) || defined(_WIN32)
  21. /* S_ISREG & gettimeofday() are not supported by MSVC */
  22. # define BMK_LEGACY_TIMER 1
  23. #endif
  24. /**************************************
  25. * Includes
  26. **************************************/
  27. #include "platform.h" /* _CRT_SECURE_NO_WARNINGS, Large Files support */
  28. #include "util.h" /* U32, UTIL_getFileSize */
  29. #include <stdlib.h> /* malloc, free */
  30. #include <stdio.h> /* fprintf, fopen, ftello */
  31. #include <sys/types.h> /* stat64 */
  32. #include <sys/stat.h> /* stat64 */
  33. #include <string.h> /* strcmp */
  34. #include <time.h> /* clock_t, clock(), CLOCKS_PER_SEC */
  35. #define LZ4_DISABLE_DEPRECATE_WARNINGS /* LZ4_decompress_fast */
  36. #include "lz4.h"
  37. #include "lz4hc.h"
  38. #include "lz4frame.h"
  39. #include "xxhash.h"
  40. /**************************************
  41. * Constants
  42. **************************************/
  43. #define PROGRAM_DESCRIPTION "LZ4 speed analyzer"
  44. #define AUTHOR "Yann Collet"
  45. #define WELCOME_MESSAGE "*** %s v%s %i-bits, by %s ***\n", PROGRAM_DESCRIPTION, LZ4_VERSION_STRING, (int)(sizeof(void*)*8), AUTHOR
  46. #define NBLOOPS 6
  47. #define TIMELOOP (CLOCKS_PER_SEC * 25 / 10)
  48. #define KB *(1 <<10)
  49. #define MB *(1 <<20)
  50. #define GB *(1U<<30)
  51. #define KNUTH 2654435761U
  52. #define MAX_MEM (1920 MB)
  53. #define DEFAULT_CHUNKSIZE (4 MB)
  54. #define ALL_COMPRESSORS 0
  55. #define ALL_DECOMPRESSORS 0
  56. /**************************************
  57. * Local structures
  58. **************************************/
  59. struct chunkParameters
  60. {
  61. U32 id;
  62. char* origBuffer;
  63. char* compressedBuffer;
  64. int origSize;
  65. int compressedSize;
  66. };
  67. /**************************************
  68. * Macros
  69. **************************************/
  70. #define DISPLAY(...) fprintf(stderr, __VA_ARGS__)
  71. #define PROGRESS(...) g_noPrompt ? 0 : DISPLAY(__VA_ARGS__)
  72. /**************************************
  73. * Benchmark Parameters
  74. **************************************/
  75. static int g_chunkSize = DEFAULT_CHUNKSIZE;
  76. static int g_nbIterations = NBLOOPS;
  77. static int g_pause = 0;
  78. static int g_compressionTest = 1;
  79. static int g_compressionAlgo = ALL_COMPRESSORS;
  80. static int g_decompressionTest = 1;
  81. static int g_decompressionAlgo = ALL_DECOMPRESSORS;
  82. static int g_noPrompt = 0;
  83. static void BMK_setBlocksize(int bsize)
  84. {
  85. g_chunkSize = bsize;
  86. DISPLAY("-Using Block Size of %i KB-\n", g_chunkSize>>10);
  87. }
  88. static void BMK_setNbIterations(int nbLoops)
  89. {
  90. g_nbIterations = nbLoops;
  91. DISPLAY("- %i iterations -\n", g_nbIterations);
  92. }
  93. static void BMK_setPause(void)
  94. {
  95. g_pause = 1;
  96. }
  97. /*********************************************************
  98. * Private functions
  99. *********************************************************/
  100. static clock_t BMK_GetClockSpan( clock_t clockStart )
  101. {
  102. return clock() - clockStart; /* works even if overflow; max span ~30 mn */
  103. }
  104. static size_t BMK_findMaxMem(U64 requiredMem)
  105. {
  106. size_t step = 64 MB;
  107. BYTE* testmem = NULL;
  108. requiredMem = (((requiredMem >> 26) + 1) << 26);
  109. requiredMem += 2*step;
  110. if (requiredMem > MAX_MEM) requiredMem = MAX_MEM;
  111. while (!testmem) {
  112. if (requiredMem > step) requiredMem -= step;
  113. else requiredMem >>= 1;
  114. testmem = (BYTE*) malloc ((size_t)requiredMem);
  115. }
  116. free (testmem);
  117. /* keep some space available */
  118. if (requiredMem > step) requiredMem -= step;
  119. else requiredMem >>= 1;
  120. return (size_t)requiredMem;
  121. }
  122. /*********************************************************
  123. * Memory management, to test LZ4_USER_MEMORY_FUNCTIONS
  124. *********************************************************/
  125. void* LZ4_malloc(size_t s) { return malloc(s); }
  126. void* LZ4_calloc(size_t n, size_t s) { return calloc(n,s); }
  127. void LZ4_free(void* p) { free(p); }
  128. /*********************************************************
  129. * Benchmark function
  130. *********************************************************/
  131. static LZ4_stream_t LZ4_stream;
  132. static void local_LZ4_resetDictT(void)
  133. {
  134. void* const r = LZ4_initStream(&LZ4_stream, sizeof(LZ4_stream));
  135. assert(r != NULL); (void)r;
  136. }
  137. static void local_LZ4_createStream(void)
  138. {
  139. void* const r = LZ4_initStream(&LZ4_stream, sizeof(LZ4_stream));
  140. assert(r != NULL); (void)r;
  141. }
  142. static int local_LZ4_saveDict(const char* in, char* out, int inSize)
  143. {
  144. (void)in;
  145. return LZ4_saveDict(&LZ4_stream, out, inSize);
  146. }
  147. static int local_LZ4_compress_default_large(const char* in, char* out, int inSize)
  148. {
  149. return LZ4_compress_default(in, out, inSize, LZ4_compressBound(inSize));
  150. }
  151. static int local_LZ4_compress_default_small(const char* in, char* out, int inSize)
  152. {
  153. return LZ4_compress_default(in, out, inSize, LZ4_compressBound(inSize)-1);
  154. }
  155. static int local_LZ4_compress_destSize(const char* in, char* out, int inSize)
  156. {
  157. return LZ4_compress_destSize(in, out, &inSize, LZ4_compressBound(inSize)-1);
  158. }
  159. static int local_LZ4_compress_fast0(const char* in, char* out, int inSize)
  160. {
  161. return LZ4_compress_fast(in, out, inSize, LZ4_compressBound(inSize), 0);
  162. }
  163. static int local_LZ4_compress_fast1(const char* in, char* out, int inSize)
  164. {
  165. return LZ4_compress_fast(in, out, inSize, LZ4_compressBound(inSize), 1);
  166. }
  167. static int local_LZ4_compress_fast2(const char* in, char* out, int inSize)
  168. {
  169. return LZ4_compress_fast(in, out, inSize, LZ4_compressBound(inSize), 2);
  170. }
  171. static int local_LZ4_compress_fast17(const char* in, char* out, int inSize)
  172. {
  173. return LZ4_compress_fast(in, out, inSize, LZ4_compressBound(inSize), 17);
  174. }
  175. static int local_LZ4_compress_fast_extState0(const char* in, char* out, int inSize)
  176. {
  177. return LZ4_compress_fast_extState(&LZ4_stream, in, out, inSize, LZ4_compressBound(inSize), 0);
  178. }
  179. static int local_LZ4_compress_fast_continue0(const char* in, char* out, int inSize)
  180. {
  181. return LZ4_compress_fast_continue(&LZ4_stream, in, out, inSize, LZ4_compressBound(inSize), 0);
  182. }
  183. #ifndef LZ4_DLL_IMPORT
  184. #if defined (__cplusplus)
  185. extern "C" {
  186. #endif
  187. /* declare hidden function */
  188. extern int LZ4_compress_forceExtDict (LZ4_stream_t* LZ4_stream, const char* source, char* dest, int inputSize);
  189. #if defined (__cplusplus)
  190. }
  191. #endif
  192. static int local_LZ4_compress_forceDict(const char* in, char* out, int inSize)
  193. {
  194. return LZ4_compress_forceExtDict(&LZ4_stream, in, out, inSize);
  195. }
  196. #endif
  197. /* HC compression functions */
  198. LZ4_streamHC_t LZ4_streamHC;
  199. static void local_LZ4_resetStreamHC(void)
  200. {
  201. LZ4_initStreamHC(&LZ4_streamHC, sizeof(LZ4_streamHC));
  202. }
  203. static int local_LZ4_saveDictHC(const char* in, char* out, int inSize)
  204. {
  205. (void)in;
  206. return LZ4_saveDictHC(&LZ4_streamHC, out, inSize);
  207. }
  208. static int local_LZ4_compress_HC(const char* in, char* out, int inSize)
  209. {
  210. return LZ4_compress_HC(in, out, inSize, LZ4_compressBound(inSize), 9);
  211. }
  212. static int local_LZ4_compress_HC_extStateHC(const char* in, char* out, int inSize)
  213. {
  214. return LZ4_compress_HC_extStateHC(&LZ4_streamHC, in, out, inSize, LZ4_compressBound(inSize), 9);
  215. }
  216. static int local_LZ4_compress_HC_continue(const char* in, char* out, int inSize)
  217. {
  218. return LZ4_compress_HC_continue(&LZ4_streamHC, in, out, inSize, LZ4_compressBound(inSize));
  219. }
  220. /* decompression functions */
  221. static int local_LZ4_decompress_fast(const char* in, char* out, int inSize, int outSize)
  222. {
  223. (void)inSize;
  224. LZ4_decompress_fast(in, out, outSize);
  225. return outSize;
  226. }
  227. static int local_LZ4_decompress_fast_usingDict_prefix(const char* in, char* out, int inSize, int outSize)
  228. {
  229. (void)inSize;
  230. LZ4_decompress_fast_usingDict(in, out, outSize, out - 65536, 65536);
  231. return outSize;
  232. }
  233. static int local_LZ4_decompress_fast_usingExtDict(const char* in, char* out, int inSize, int outSize)
  234. {
  235. (void)inSize;
  236. LZ4_decompress_fast_usingDict(in, out, outSize, out - 65536, 65535);
  237. return outSize;
  238. }
  239. static int local_LZ4_decompress_safe_withPrefix64k(const char* in, char* out, int inSize, int outSize)
  240. {
  241. LZ4_decompress_safe_withPrefix64k(in, out, inSize, outSize);
  242. return outSize;
  243. }
  244. static int local_LZ4_decompress_safe_usingDict(const char* in, char* out, int inSize, int outSize)
  245. {
  246. LZ4_decompress_safe_usingDict(in, out, inSize, outSize, out - 65536, 65536);
  247. return outSize;
  248. }
  249. static int local_LZ4_decompress_safe_partial_usingDict(const char* in, char* out, int inSize, int outSize)
  250. {
  251. int result = LZ4_decompress_safe_partial_usingDict(in, out, inSize, outSize - 5, outSize, out - 65536, 65536);
  252. if (result < 0) return result;
  253. return outSize;
  254. }
  255. #ifndef LZ4_DLL_IMPORT
  256. #if defined (__cplusplus)
  257. extern "C" {
  258. #endif
  259. extern int LZ4_decompress_safe_forceExtDict(const char* in, char* out, int inSize, int outSize, const void* dict, size_t dictSize);
  260. #if defined (__cplusplus)
  261. }
  262. #endif
  263. static int local_LZ4_decompress_safe_forceExtDict(const char* in, char* out, int inSize, int outSize)
  264. {
  265. LZ4_decompress_safe_forceExtDict(in, out, inSize, outSize, out - 65536, 65536);
  266. return outSize;
  267. }
  268. #endif
  269. #ifndef LZ4_DLL_IMPORT
  270. #if defined (__cplusplus)
  271. extern "C" {
  272. #endif
  273. extern int LZ4_decompress_safe_partial_forceExtDict(const char* in, char* out, int inSize, int targetOutputSize, int dstCapacity, const void* dict, size_t dictSize);
  274. #if defined (__cplusplus)
  275. }
  276. #endif
  277. static int local_LZ4_decompress_safe_partial_forceExtDict(const char* in, char* out, int inSize, int outSize)
  278. {
  279. int result = LZ4_decompress_safe_partial_forceExtDict(in, out, inSize, outSize - 5, outSize, out - 65536, 65536);
  280. if (result < 0) return result;
  281. return outSize;
  282. }
  283. #endif
  284. static int local_LZ4_decompress_safe_partial(const char* in, char* out, int inSize, int outSize)
  285. {
  286. int result = LZ4_decompress_safe_partial(in, out, inSize, outSize - 5, outSize);
  287. if (result < 0) return result;
  288. return outSize;
  289. }
  290. /* frame functions */
  291. static int local_LZ4F_compressFrame(const char* in, char* out, int inSize)
  292. {
  293. assert(inSize >= 0);
  294. return (int)LZ4F_compressFrame(out, LZ4F_compressFrameBound((size_t)inSize, NULL), in, (size_t)inSize, NULL);
  295. }
  296. static LZ4F_decompressionContext_t g_dCtx;
  297. static int local_LZ4F_decompress(const char* in, char* out, int inSize, int outSize)
  298. {
  299. size_t srcSize = (size_t)inSize;
  300. size_t dstSize = (size_t)outSize;
  301. size_t result;
  302. assert(inSize >= 0);
  303. assert(outSize >= 0);
  304. result = LZ4F_decompress(g_dCtx, out, &dstSize, in, &srcSize, NULL);
  305. if (result!=0) { DISPLAY("Error decompressing frame : unfinished frame \n"); exit(8); }
  306. if (srcSize != (size_t)inSize) { DISPLAY("Error decompressing frame : read size incorrect \n"); exit(9); }
  307. return (int)dstSize;
  308. }
  309. static int local_LZ4F_decompress_followHint(const char* src, char* dst, int srcSize, int dstSize)
  310. {
  311. size_t totalInSize = (size_t)srcSize;
  312. size_t maxOutSize = (size_t)dstSize;
  313. size_t inPos = 0;
  314. size_t inSize = 0;
  315. size_t outPos = 0;
  316. size_t outRemaining = maxOutSize - outPos;
  317. for (;;) {
  318. size_t const sizeHint =
  319. LZ4F_decompress(g_dCtx, dst+outPos, &outRemaining, src+inPos, &inSize, NULL);
  320. assert(!LZ4F_isError(sizeHint));
  321. inPos += inSize;
  322. inSize = sizeHint;
  323. outPos += outRemaining;
  324. outRemaining = maxOutSize - outPos;
  325. if (!sizeHint) break;
  326. }
  327. /* frame completed */
  328. if (inPos != totalInSize) {
  329. DISPLAY("Error decompressing frame : must read (%u) full frame (%u) \n",
  330. (unsigned)inPos, (unsigned)totalInSize);
  331. exit(10);
  332. }
  333. return (int)outPos;
  334. }
  335. /* always provide input by block of 64 KB */
  336. static int local_LZ4F_decompress_noHint(const char* src, char* dst, int srcSize, int dstSize)
  337. {
  338. size_t totalInSize = (size_t)srcSize;
  339. size_t maxOutSize = (size_t)dstSize;
  340. size_t inPos = 0;
  341. size_t inSize = 64 KB;
  342. size_t outPos = 0;
  343. size_t outRemaining = maxOutSize - outPos;
  344. for (;;) {
  345. size_t const sizeHint = LZ4F_decompress(g_dCtx, dst+outPos, &outRemaining, src+inPos, &inSize, NULL);
  346. assert(!LZ4F_isError(sizeHint));
  347. inPos += inSize;
  348. inSize = (inPos + 64 KB <= totalInSize) ? 64 KB : totalInSize - inPos;
  349. outPos += outRemaining;
  350. outRemaining = maxOutSize - outPos;
  351. if (!sizeHint) break;
  352. }
  353. /* frame completed */
  354. if (inPos != totalInSize) {
  355. DISPLAY("Error decompressing frame : must read (%u) full frame (%u) \n",
  356. (unsigned)inPos, (unsigned)totalInSize);
  357. exit(10);
  358. }
  359. return (int)outPos;
  360. }
  361. #define NB_COMPRESSION_ALGORITHMS 100
  362. #define NB_DECOMPRESSION_ALGORITHMS 100
  363. int fullSpeedBench(const char** fileNamesTable, int nbFiles)
  364. {
  365. int fileIdx=0;
  366. /* Init */
  367. { size_t const errorCode = LZ4F_createDecompressionContext(&g_dCtx, LZ4F_VERSION);
  368. if (LZ4F_isError(errorCode)) { DISPLAY("dctx allocation issue \n"); return 10; } }
  369. /* Loop for each fileName */
  370. while (fileIdx<nbFiles) {
  371. char* orig_buff = NULL;
  372. struct chunkParameters* chunkP = NULL;
  373. char* compressed_buff=NULL;
  374. const char* const inFileName = fileNamesTable[fileIdx++];
  375. FILE* const inFile = fopen( inFileName, "rb" );
  376. U64 const inFileSize = UTIL_getFileSize(inFileName);
  377. size_t benchedSize = BMK_findMaxMem(inFileSize*2) / 2; /* because 2 buffers */
  378. int nbChunks;
  379. int maxCompressedChunkSize;
  380. size_t readSize;
  381. int compressedBuffSize;
  382. U32 crcOriginal;
  383. /* Check infile pre-requisites */
  384. if (inFile==NULL) { DISPLAY("Pb opening %s \n", inFileName); return 11; }
  385. if (inFileSize==0) { DISPLAY("file is empty \n"); fclose(inFile); return 11; }
  386. if (benchedSize==0) { DISPLAY("not enough memory \n"); fclose(inFile); return 11; }
  387. /* Memory size adjustments */
  388. if ((U64)benchedSize > inFileSize) benchedSize = (size_t)inFileSize;
  389. if (benchedSize < inFileSize) {
  390. DISPLAY("Not enough memory for '%s' full size; testing %i MB only... \n",
  391. inFileName, (int)(benchedSize>>20));
  392. }
  393. /* Allocation */
  394. chunkP = (struct chunkParameters*) malloc(((benchedSize / (size_t)g_chunkSize)+1) * sizeof(struct chunkParameters));
  395. orig_buff = (char*) malloc(benchedSize);
  396. nbChunks = (int) ((benchedSize + (size_t)g_chunkSize - 1) / (size_t)g_chunkSize);
  397. maxCompressedChunkSize = LZ4_compressBound(g_chunkSize);
  398. compressedBuffSize = nbChunks * maxCompressedChunkSize;
  399. compressed_buff = (char*)malloc((size_t)compressedBuffSize);
  400. if(!chunkP || !orig_buff || !compressed_buff) {
  401. DISPLAY("\nError: not enough memory! \n");
  402. fclose(inFile);
  403. free(orig_buff);
  404. free(compressed_buff);
  405. free(chunkP);
  406. return(12);
  407. }
  408. /* Fill in src buffer */
  409. DISPLAY("Loading %s... \r", inFileName);
  410. readSize = fread(orig_buff, 1, benchedSize, inFile);
  411. fclose(inFile);
  412. if (readSize != benchedSize) {
  413. DISPLAY("\nError: problem reading file '%s' !! \n", inFileName);
  414. free(orig_buff);
  415. free(compressed_buff);
  416. free(chunkP);
  417. return 13;
  418. }
  419. /* Calculating input Checksum */
  420. crcOriginal = XXH32(orig_buff, benchedSize,0);
  421. /* Bench */
  422. { int loopNb, nb_loops, chunkNb, cAlgNb, dAlgNb;
  423. size_t cSize=0;
  424. double ratio=0.;
  425. DISPLAY("\r%79s\r", "");
  426. DISPLAY(" %s : \n", inFileName);
  427. /* Bench Compression Algorithms */
  428. for (cAlgNb=0; (cAlgNb <= NB_COMPRESSION_ALGORITHMS) && (g_compressionTest); cAlgNb++) {
  429. const char* compressorName;
  430. int (*compressionFunction)(const char*, char*, int);
  431. void (*initFunction)(void) = NULL;
  432. double bestTime = 100000000.;
  433. /* filter compressionAlgo only */
  434. if ((g_compressionAlgo != ALL_COMPRESSORS) && (g_compressionAlgo != cAlgNb)) continue;
  435. /* Init data chunks */
  436. { int i;
  437. size_t remaining = benchedSize;
  438. char* in = orig_buff;
  439. char* out = compressed_buff;
  440. assert(nbChunks >= 1);
  441. for (i=0; i<nbChunks; i++) {
  442. chunkP[i].id = (U32)i;
  443. chunkP[i].origBuffer = in; in += g_chunkSize;
  444. assert(g_chunkSize > 0);
  445. if (remaining > (size_t)g_chunkSize) {
  446. chunkP[i].origSize = g_chunkSize;
  447. remaining -= (size_t)g_chunkSize;
  448. } else {
  449. chunkP[i].origSize = (int)remaining;
  450. remaining = 0;
  451. }
  452. chunkP[i].compressedBuffer = out; out += maxCompressedChunkSize;
  453. chunkP[i].compressedSize = 0;
  454. }
  455. }
  456. switch(cAlgNb)
  457. {
  458. case 0 : DISPLAY("Compression functions : \n"); continue;
  459. case 1 : compressionFunction = local_LZ4_compress_default_large; compressorName = "LZ4_compress_default"; break;
  460. case 2 : compressionFunction = local_LZ4_compress_default_small; compressorName = "LZ4_compress_default(small dst)"; break;
  461. case 3 : compressionFunction = local_LZ4_compress_destSize; compressorName = "LZ4_compress_destSize"; break;
  462. case 4 : compressionFunction = local_LZ4_compress_fast0; compressorName = "LZ4_compress_fast(0)"; break;
  463. case 5 : compressionFunction = local_LZ4_compress_fast1; compressorName = "LZ4_compress_fast(1)"; break;
  464. case 6 : compressionFunction = local_LZ4_compress_fast2; compressorName = "LZ4_compress_fast(2)"; break;
  465. case 7 : compressionFunction = local_LZ4_compress_fast17; compressorName = "LZ4_compress_fast(17)"; break;
  466. case 8 : compressionFunction = local_LZ4_compress_fast_extState0; compressorName = "LZ4_compress_fast_extState(0)"; break;
  467. case 9 : compressionFunction = local_LZ4_compress_fast_continue0; initFunction = local_LZ4_createStream; compressorName = "LZ4_compress_fast_continue(0)"; break;
  468. case 10: compressionFunction = local_LZ4_compress_HC; compressorName = "LZ4_compress_HC"; break;
  469. case 12: compressionFunction = local_LZ4_compress_HC_extStateHC; compressorName = "LZ4_compress_HC_extStateHC"; break;
  470. case 14: compressionFunction = local_LZ4_compress_HC_continue; initFunction = local_LZ4_resetStreamHC; compressorName = "LZ4_compress_HC_continue"; break;
  471. #ifndef LZ4_DLL_IMPORT
  472. case 20: compressionFunction = local_LZ4_compress_forceDict; initFunction = local_LZ4_resetDictT; compressorName = "LZ4_compress_forceDict"; break;
  473. #endif
  474. case 30: compressionFunction = local_LZ4F_compressFrame; compressorName = "LZ4F_compressFrame";
  475. chunkP[0].origSize = (int)benchedSize; nbChunks=1;
  476. break;
  477. case 40: compressionFunction = local_LZ4_saveDict; compressorName = "LZ4_saveDict";
  478. if (chunkP[0].origSize < 8) { DISPLAY(" cannot bench %s with less then 8 bytes \n", compressorName); continue; }
  479. LZ4_loadDict(&LZ4_stream, chunkP[0].origBuffer, chunkP[0].origSize);
  480. break;
  481. case 41: compressionFunction = local_LZ4_saveDictHC; compressorName = "LZ4_saveDictHC";
  482. if (chunkP[0].origSize < 8) { DISPLAY(" cannot bench %s with less then 8 bytes \n", compressorName); continue; }
  483. LZ4_loadDictHC(&LZ4_streamHC, chunkP[0].origBuffer, chunkP[0].origSize);
  484. break;
  485. default :
  486. continue; /* unknown ID : just skip */
  487. }
  488. for (loopNb = 1; loopNb <= g_nbIterations; loopNb++) {
  489. double averageTime;
  490. clock_t clockTime;
  491. PROGRESS("%2i-%-34.34s :%10i ->\r", loopNb, compressorName, (int)benchedSize);
  492. { size_t i; for (i=0; i<benchedSize; i++) compressed_buff[i]=(char)i; } /* warming up memory */
  493. nb_loops = 0;
  494. clockTime = clock();
  495. while(clock() == clockTime);
  496. clockTime = clock();
  497. while(BMK_GetClockSpan(clockTime) < TIMELOOP) {
  498. if (initFunction!=NULL) initFunction();
  499. for (chunkNb=0; chunkNb<nbChunks; chunkNb++) {
  500. chunkP[chunkNb].compressedSize = compressionFunction(chunkP[chunkNb].origBuffer, chunkP[chunkNb].compressedBuffer, chunkP[chunkNb].origSize);
  501. if (chunkP[chunkNb].compressedSize==0) {
  502. DISPLAY("ERROR ! %s() = 0 !! \n", compressorName);
  503. exit(1);
  504. } }
  505. nb_loops++;
  506. }
  507. clockTime = BMK_GetClockSpan(clockTime);
  508. nb_loops += !nb_loops; /* avoid division by zero */
  509. averageTime = ((double)clockTime) / nb_loops / CLOCKS_PER_SEC;
  510. if (averageTime < bestTime) bestTime = averageTime;
  511. cSize=0; for (chunkNb=0; chunkNb<nbChunks; chunkNb++) cSize += (size_t)chunkP[chunkNb].compressedSize;
  512. ratio = (double)cSize/(double)benchedSize*100.;
  513. PROGRESS("%2i-%-34.34s :%10i ->%9i (%5.2f%%),%7.1f MB/s\r", loopNb, compressorName, (int)benchedSize, (int)cSize, ratio, (double)benchedSize / bestTime / 1000000);
  514. }
  515. if (ratio<100.)
  516. DISPLAY("%2i-%-34.34s :%10i ->%9i (%5.2f%%),%7.1f MB/s\n", cAlgNb, compressorName, (int)benchedSize, (int)cSize, ratio, (double)benchedSize / bestTime / 1000000);
  517. else
  518. DISPLAY("%2i-%-34.34s :%10i ->%9i (%5.1f%%),%7.1f MB/s\n", cAlgNb, compressorName, (int)benchedSize, (int)cSize, ratio, (double)benchedSize / bestTime / 100000);
  519. }
  520. /* Prepare layout for decompression */
  521. /* Init data chunks */
  522. { int i;
  523. size_t remaining = benchedSize;
  524. char* in = orig_buff;
  525. char* out = compressed_buff;
  526. nbChunks = (int) (((int)benchedSize + (g_chunkSize-1))/ g_chunkSize);
  527. for (i=0; i<nbChunks; i++) {
  528. chunkP[i].id = (U32)i;
  529. chunkP[i].origBuffer = in; in += g_chunkSize;
  530. if ((int)remaining > g_chunkSize) {
  531. chunkP[i].origSize = g_chunkSize;
  532. remaining -= (size_t)g_chunkSize;
  533. } else {
  534. chunkP[i].origSize = (int)remaining;
  535. remaining = 0;
  536. }
  537. chunkP[i].compressedBuffer = out; out += maxCompressedChunkSize;
  538. chunkP[i].compressedSize = 0;
  539. }
  540. }
  541. for (chunkNb=0; chunkNb<nbChunks; chunkNb++) {
  542. chunkP[chunkNb].compressedSize = LZ4_compress_default(chunkP[chunkNb].origBuffer, chunkP[chunkNb].compressedBuffer, chunkP[chunkNb].origSize, maxCompressedChunkSize);
  543. if (chunkP[chunkNb].compressedSize==0) {
  544. DISPLAY("ERROR ! %s() = 0 !! \n", "LZ4_compress");
  545. exit(1);
  546. } }
  547. /* Decompression Algorithms */
  548. for (dAlgNb=0; (dAlgNb <= NB_DECOMPRESSION_ALGORITHMS) && g_decompressionTest; dAlgNb++) {
  549. const char* dName = NULL;
  550. int (*decompressionFunction)(const char*, char*, int, int) = NULL;
  551. double bestTime = 100000000.;
  552. int checkResult = 1;
  553. if ((g_decompressionAlgo != ALL_DECOMPRESSORS) && (g_decompressionAlgo != dAlgNb)) continue;
  554. switch(dAlgNb)
  555. {
  556. case 0: DISPLAY("Decompression functions : \n"); continue;
  557. case 1: decompressionFunction = local_LZ4_decompress_fast; dName = "LZ4_decompress_fast"; break;
  558. case 2: decompressionFunction = local_LZ4_decompress_fast_usingDict_prefix; dName = "LZ4_decompress_fast_usingDict(prefix)"; break;
  559. case 3: decompressionFunction = local_LZ4_decompress_fast_usingExtDict; dName = "LZ4_decompress_fast_using(Ext)Dict"; break;
  560. case 4: decompressionFunction = LZ4_decompress_safe; dName = "LZ4_decompress_safe"; break;
  561. case 5: decompressionFunction = local_LZ4_decompress_safe_withPrefix64k; dName = "LZ4_decompress_safe_withPrefix64k"; break;
  562. case 6: decompressionFunction = local_LZ4_decompress_safe_usingDict; dName = "LZ4_decompress_safe_usingDict"; break;
  563. case 7: decompressionFunction = local_LZ4_decompress_safe_partial; dName = "LZ4_decompress_safe_partial"; checkResult = 0; break;
  564. case 8: decompressionFunction = local_LZ4_decompress_safe_partial_usingDict; dName = "LZ4_decompress_safe_partial_usingDict"; checkResult = 0; break;
  565. #ifndef LZ4_DLL_IMPORT
  566. case 9: decompressionFunction = local_LZ4_decompress_safe_partial_forceExtDict; dName = "LZ4_decompress_safe_partial_forceExtDict"; checkResult = 0; break;
  567. case 10: decompressionFunction = local_LZ4_decompress_safe_forceExtDict; dName = "LZ4_decompress_safe_forceExtDict"; break;
  568. #endif
  569. case 11:
  570. case 12:
  571. case 13:
  572. if (dAlgNb == 11) { decompressionFunction = local_LZ4F_decompress; dName = "LZ4F_decompress"; } /* can be skipped */
  573. if (dAlgNb == 12) { decompressionFunction = local_LZ4F_decompress_followHint; dName = "LZ4F_decompress_followHint"; } /* can be skipped */
  574. if (dAlgNb == 13) { decompressionFunction = local_LZ4F_decompress_noHint; dName = "LZ4F_decompress_noHint"; } /* can be skipped */
  575. /* prepare compressed data using frame format */
  576. { size_t const fcsize = LZ4F_compressFrame(compressed_buff, (size_t)compressedBuffSize, orig_buff, benchedSize, NULL);
  577. assert(!LZ4F_isError(fcsize));
  578. chunkP[0].origSize = (int)benchedSize;
  579. chunkP[0].compressedSize = (int)fcsize;
  580. nbChunks = 1;
  581. break;
  582. }
  583. default :
  584. continue; /* skip if unknown ID */
  585. }
  586. assert(decompressionFunction != NULL);
  587. assert(dName != NULL);
  588. { size_t i; for (i=0; i<benchedSize; i++) orig_buff[i]=0; } /* zeroing source area, for CRC checking */
  589. for (loopNb = 1; loopNb <= g_nbIterations; loopNb++) {
  590. double averageTime;
  591. clock_t clockTime;
  592. U32 crcDecoded;
  593. PROGRESS("%2i-%-34.34s :%10i ->\r", loopNb, dName, (int)benchedSize);
  594. nb_loops = 0;
  595. clockTime = clock();
  596. while(clock() == clockTime);
  597. clockTime = clock();
  598. while(BMK_GetClockSpan(clockTime) < TIMELOOP) {
  599. for (chunkNb=0; chunkNb<nbChunks; chunkNb++) {
  600. int const decodedSize = decompressionFunction(chunkP[chunkNb].compressedBuffer, chunkP[chunkNb].origBuffer,
  601. chunkP[chunkNb].compressedSize, chunkP[chunkNb].origSize);
  602. if (chunkP[chunkNb].origSize != decodedSize) {
  603. DISPLAY("ERROR ! %s() == %i != %i !! \n",
  604. dName, decodedSize, chunkP[chunkNb].origSize);
  605. exit(1);
  606. } }
  607. nb_loops++;
  608. }
  609. clockTime = BMK_GetClockSpan(clockTime);
  610. nb_loops += !nb_loops; /* Avoid division by zero */
  611. averageTime = (double)clockTime / nb_loops / CLOCKS_PER_SEC;
  612. if (averageTime < bestTime) bestTime = averageTime;
  613. PROGRESS("%2i-%-34.34s :%10i -> %7.1f MB/s\r", loopNb, dName, (int)benchedSize, (double)benchedSize / bestTime / 1000000);
  614. /* CRC Checking */
  615. crcDecoded = XXH32(orig_buff, benchedSize, 0);
  616. if (checkResult && (crcOriginal!=crcDecoded)) {
  617. DISPLAY("\n!!! WARNING !!! %14s : Invalid Checksum : %x != %x\n",
  618. inFileName, (unsigned)crcOriginal, (unsigned)crcDecoded);
  619. exit(1);
  620. } }
  621. DISPLAY("%2i-%-34.34s :%10i -> %7.1f MB/s\n", dAlgNb, dName, (int)benchedSize, (double)benchedSize / bestTime / 1000000);
  622. }
  623. }
  624. free(orig_buff);
  625. free(compressed_buff);
  626. free(chunkP);
  627. }
  628. LZ4F_freeDecompressionContext(g_dCtx);
  629. if (g_pause) { printf("press enter...\n"); (void)getchar(); }
  630. return 0;
  631. }
  632. static int usage(const char* exename)
  633. {
  634. DISPLAY( "Usage :\n");
  635. DISPLAY( " %s [arg] file1 file2 ... fileX\n", exename);
  636. DISPLAY( "Arguments :\n");
  637. DISPLAY( " -c : compression tests only\n");
  638. DISPLAY( " -d : decompression tests only\n");
  639. DISPLAY( " -H/-h : Help (this text + advanced options)\n");
  640. return 0;
  641. }
  642. static int usage_advanced(void)
  643. {
  644. DISPLAY( "\nAdvanced options :\n");
  645. DISPLAY( " -c# : test only compression function # [1-%i]\n", NB_COMPRESSION_ALGORITHMS);
  646. DISPLAY( " -d# : test only decompression function # [1-%i]\n", NB_DECOMPRESSION_ALGORITHMS);
  647. DISPLAY( " -i# : iteration loops [1-9](default : %i)\n", NBLOOPS);
  648. DISPLAY( " -B# : Block size [4-7](default : 7)\n");
  649. return 0;
  650. }
  651. static int badusage(const char* exename)
  652. {
  653. DISPLAY("Wrong parameters\n");
  654. usage(exename);
  655. return 0;
  656. }
  657. int main(int argc, const char** argv)
  658. {
  659. int i,
  660. filenamesStart=2;
  661. const char* exename = argv[0];
  662. const char* input_filename=0;
  663. // Welcome message
  664. DISPLAY(WELCOME_MESSAGE);
  665. if (argc<2) { badusage(exename); return 1; }
  666. for(i=1; i<argc; i++) {
  667. const char* argument = argv[i];
  668. if(!argument) continue; // Protection if argument empty
  669. if (!strcmp(argument, "--no-prompt")) {
  670. g_noPrompt = 1;
  671. continue;
  672. }
  673. // Decode command (note : aggregated commands are allowed)
  674. if (argument[0]=='-') {
  675. while (argument[1]!=0) {
  676. argument ++;
  677. switch(argument[0])
  678. {
  679. // Select compression algorithm only
  680. case 'c':
  681. g_decompressionTest = 0;
  682. while ((argument[1]>= '0') && (argument[1]<= '9')) {
  683. g_compressionAlgo *= 10;
  684. g_compressionAlgo += argument[1] - '0';
  685. argument++;
  686. }
  687. break;
  688. // Select decompression algorithm only
  689. case 'd':
  690. g_compressionTest = 0;
  691. while ((argument[1]>= '0') && (argument[1]<= '9')) {
  692. g_decompressionAlgo *= 10;
  693. g_decompressionAlgo += argument[1] - '0';
  694. argument++;
  695. }
  696. break;
  697. // Display help on usage
  698. case 'h' :
  699. case 'H': usage(exename); usage_advanced(); return 0;
  700. // Modify Block Properties
  701. case 'B':
  702. while (argument[1]!=0)
  703. switch(argument[1])
  704. {
  705. case '4':
  706. case '5':
  707. case '6':
  708. case '7':
  709. { int B = argument[1] - '0';
  710. int S = 1 << (8 + 2*B);
  711. BMK_setBlocksize(S);
  712. argument++;
  713. break;
  714. }
  715. case 'D': argument++; break;
  716. default : goto _exit_blockProperties;
  717. }
  718. _exit_blockProperties:
  719. break;
  720. // Modify Nb Iterations
  721. case 'i':
  722. if ((argument[1] >='0') && (argument[1] <='9')) {
  723. int iters = argument[1] - '0';
  724. BMK_setNbIterations(iters);
  725. argument++;
  726. }
  727. break;
  728. // Pause at the end (hidden option)
  729. case 'p': BMK_setPause(); break;
  730. // Unknown command
  731. default : badusage(exename); return 1;
  732. }
  733. }
  734. continue;
  735. }
  736. // first provided filename is input
  737. if (!input_filename) { input_filename=argument; filenamesStart=i; continue; }
  738. }
  739. // No input filename ==> Error
  740. if(!input_filename) { badusage(exename); return 1; }
  741. return fullSpeedBench(argv+filenamesStart, argc-filenamesStart);
  742. }