mirror of
https://github.com/intel/isa-l.git
synced 2024-12-13 09:52:56 +01:00
5d15580467
Change-Id: If628e7f949da6862b99cebe6a0a59c6e6d5443e4 Signed-off-by: Roy Oursler <roy.j.oursler@intel.com>
264 lines
6.9 KiB
C
264 lines
6.9 KiB
C
/**********************************************************************
|
|
Copyright(c) 2011-2016 Intel Corporation All rights reserved.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions
|
|
are met:
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in
|
|
the documentation and/or other materials provided with the
|
|
distribution.
|
|
* Neither the name of Intel Corporation nor the names of its
|
|
contributors may be used to endorse or promote products derived
|
|
from this software without specific prior written permission.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
**********************************************************************/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include <getopt.h>
|
|
#include "igzip_lib.h"
|
|
#include "test.h"
|
|
|
|
#define BUF_SIZE 1024
|
|
#define MIN_TEST_LOOPS 10
|
|
#ifndef RUN_MEM_SIZE
|
|
# define RUN_MEM_SIZE 500000000
|
|
#endif
|
|
|
|
struct isal_zstream stream;
|
|
|
|
int usage(void)
|
|
{
|
|
fprintf(stderr,
|
|
"Usage: igzip_file_perf [options] <infile>\n"
|
|
" -h help\n"
|
|
" -X use compression level X with 0 <= X <= 1\n"
|
|
" -b <size> input buffer size, 0 buffers all the input\n"
|
|
" -i <iter> number of iterations (at least 1)\n"
|
|
" -o <file> output file for compresed data\n");
|
|
exit(0);
|
|
}
|
|
|
|
int get_filesize(FILE * f)
|
|
{
|
|
int curr, end;
|
|
|
|
curr = ftell(f); /* Save current position */
|
|
fseek(f, 0L, SEEK_END);
|
|
end = ftell(f);
|
|
fseek(f, curr, SEEK_SET); /* Restore position */
|
|
return end;
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
FILE *in, *out = NULL;
|
|
unsigned char *inbuf, *outbuf, *level_buf = NULL;
|
|
int i, c, infile_size, iterations = 0, outbuf_size, inbuf_size = 0;
|
|
struct isal_huff_histogram histogram;
|
|
struct isal_hufftables hufftables_custom;
|
|
int level = 0, level_size = 0, avail_in;
|
|
char *in_file_name = NULL, *out_file_name = NULL;
|
|
|
|
while ((c = getopt(argc, argv, "h01i:b:o:")) != -1) {
|
|
switch (c) {
|
|
case 'o':
|
|
out_file_name = optarg;
|
|
break;
|
|
case 'i':
|
|
iterations = atoi(optarg);
|
|
if (iterations < 1)
|
|
usage();
|
|
break;
|
|
case 'b':
|
|
inbuf_size = atoi(optarg);
|
|
break;
|
|
case '1':
|
|
level = 1;
|
|
level_size = ISAL_DEF_LVL1_LARGE;
|
|
break;
|
|
case '0':
|
|
break;
|
|
case 'h':
|
|
default:
|
|
usage();
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (optind < argc) {
|
|
in_file_name = argv[optind];
|
|
in = fopen(in_file_name, "rb");
|
|
} else
|
|
usage();
|
|
|
|
if (!in) {
|
|
fprintf(stderr, "Can't open %s for reading\n", in_file_name);
|
|
exit(0);
|
|
}
|
|
if (out_file_name != NULL) {
|
|
out = fopen(out_file_name, "wb");
|
|
if (!out) {
|
|
fprintf(stderr, "Can't open %s for writing\n", out_file_name);
|
|
exit(0);
|
|
}
|
|
printf("outfile=%s\n", out_file_name);
|
|
}
|
|
|
|
printf("Window Size: %d K\n", IGZIP_HIST_SIZE / 1024);
|
|
printf("igzip_file_perf: \n");
|
|
fflush(0);
|
|
|
|
/* Allocate space for entire input file and output
|
|
* (assuming some possible expansion on output size)
|
|
*/
|
|
infile_size = get_filesize(in);
|
|
|
|
outbuf_size = 2 * infile_size + BUF_SIZE;
|
|
|
|
if (iterations == 0) {
|
|
iterations = infile_size ? RUN_MEM_SIZE / infile_size : MIN_TEST_LOOPS;
|
|
if (iterations < MIN_TEST_LOOPS)
|
|
iterations = MIN_TEST_LOOPS;
|
|
}
|
|
|
|
inbuf = malloc(infile_size);
|
|
if (inbuf == NULL) {
|
|
fprintf(stderr, "Can't allocate input buffer memory\n");
|
|
exit(0);
|
|
}
|
|
outbuf = malloc(outbuf_size);
|
|
if (outbuf == NULL) {
|
|
fprintf(stderr, "Can't allocate output buffer memory\n");
|
|
exit(0);
|
|
}
|
|
|
|
if (level_size != 0) {
|
|
level_buf = malloc(level_size);
|
|
if (level_buf == NULL) {
|
|
fprintf(stderr, "Can't allocate level buffer memory\n");
|
|
exit(0);
|
|
}
|
|
}
|
|
|
|
inbuf_size = inbuf_size ? inbuf_size : infile_size;
|
|
|
|
printf("igzip_file_perf: %s %d iterations\n", in_file_name, iterations);
|
|
/* Read complete input file into buffer */
|
|
stream.avail_in = (uint32_t) fread(inbuf, 1, infile_size, in);
|
|
if (stream.avail_in != infile_size) {
|
|
fprintf(stderr, "Couldn't fit all of input file into buffer\n");
|
|
exit(0);
|
|
}
|
|
|
|
struct perf start, stop;
|
|
perf_start(&start);
|
|
|
|
for (i = 0; i < iterations; i++) {
|
|
isal_deflate_init(&stream);
|
|
stream.end_of_stream = 0;
|
|
stream.flush = NO_FLUSH;
|
|
stream.level = level;
|
|
stream.level_buf = level_buf;
|
|
stream.level_buf_size = level_size;
|
|
stream.next_out = outbuf;
|
|
stream.avail_out = outbuf_size;
|
|
stream.next_in = inbuf;
|
|
avail_in = infile_size;
|
|
|
|
while (avail_in > 0) {
|
|
stream.avail_in = avail_in >= inbuf_size ? inbuf_size : avail_in;
|
|
avail_in -= inbuf_size;
|
|
|
|
if (avail_in <= 0)
|
|
stream.end_of_stream = 1;
|
|
|
|
isal_deflate(&stream);
|
|
|
|
if (stream.avail_in != 0)
|
|
break;
|
|
}
|
|
}
|
|
|
|
perf_stop(&stop);
|
|
|
|
if (stream.avail_in != 0) {
|
|
fprintf(stderr, "Could not compress all of inbuf\n");
|
|
exit(0);
|
|
}
|
|
|
|
printf(" file %s - in_size=%d out_size=%d iter=%d ratio=%3.1f%%",
|
|
in_file_name, infile_size, stream.total_out, i,
|
|
100.0 * stream.total_out / infile_size);
|
|
|
|
if (level == 0) {
|
|
memset(&histogram, 0, sizeof(histogram));
|
|
|
|
isal_update_histogram(inbuf, infile_size, &histogram);
|
|
isal_create_hufftables(&hufftables_custom, &histogram);
|
|
|
|
isal_deflate_init(&stream);
|
|
stream.end_of_stream = 0;
|
|
stream.flush = NO_FLUSH;
|
|
stream.level = level;
|
|
stream.level_buf = level_buf;
|
|
stream.level_buf_size = level_size;
|
|
stream.next_out = outbuf;
|
|
stream.avail_out = outbuf_size;
|
|
stream.next_in = inbuf;
|
|
stream.hufftables = &hufftables_custom;
|
|
avail_in = infile_size;
|
|
|
|
while (avail_in > 0) {
|
|
stream.avail_in = avail_in >= inbuf_size ? inbuf_size : avail_in;
|
|
avail_in -= inbuf_size;
|
|
|
|
if (avail_in <= 0)
|
|
stream.end_of_stream = 1;
|
|
|
|
isal_deflate(&stream);
|
|
|
|
if (stream.avail_in != 0)
|
|
break;
|
|
}
|
|
|
|
printf(" ratio_custom=%3.1f%%", 100.0 * stream.total_out / infile_size);
|
|
}
|
|
printf("\n");
|
|
|
|
if (stream.avail_in != 0) {
|
|
fprintf(stderr, "Could not compress all of inbuf\n");
|
|
exit(0);
|
|
}
|
|
|
|
printf("igzip_file: ");
|
|
perf_print(stop, start, (long long)infile_size * i);
|
|
|
|
if (argc > 2 && out) {
|
|
printf("writing %s\n", out_file_name);
|
|
fwrite(outbuf, 1, stream.total_out, out);
|
|
fclose(out);
|
|
}
|
|
|
|
fclose(in);
|
|
printf("End of igzip_file_perf\n\n");
|
|
fflush(0);
|
|
return 0;
|
|
}
|