1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/***
This file is part of systemd
Copyright 2014 Zbigniew Jędrzejewski-Szmek
systemd is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
systemd 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with systemd; If not, see <http://www.gnu.org/licenses/>.
***/
#include "compress.h"
#include "util.h"
#include "macro.h"
typedef int (compress_t)(const void *src, uint64_t src_size, void *dst, uint64_t *dst_size);
typedef int (decompress_t)(const void *src, uint64_t src_size,
void **dst, uint64_t *dst_alloc_size, uint64_t* dst_size, uint64_t dst_max);
#define MAX_SIZE (1024*1024LU)
static char* make_buf(size_t count) {
char *buf;
size_t i;
buf = malloc(count);
assert(buf);
for (i = 0; i < count; i++)
buf[i] = 'a' + i % ('z' - 'a' + 1);
return buf;
}
static void test_compress_decompress(const char* label,
compress_t compress, decompress_t decompress) {
usec_t n, n2 = 0;
float dt;
_cleanup_free_ char *text, *buf;
_cleanup_free_ void *buf2 = NULL;
uint64_t buf2_allocated = 0;
size_t skipped = 0, compressed = 0, total = 0;
text = make_buf(MAX_SIZE);
buf = calloc(MAX_SIZE + 1, 1);
assert(text && buf);
n = now(CLOCK_MONOTONIC);
for (size_t i = 1; i <= MAX_SIZE; i += (i < 2048 ? 1 : 217)) {
uint64_t j = 0, k = 0;
int r;
r = compress(text, i, buf, &j);
/* assume compresion must be succesful except for small inputs */
assert(r == 0 || (i < 2048 && r == -ENOBUFS));
/* check for overwrites */
assert(buf[i] == 0);
if (r != 0) {
skipped += i;
continue;
}
assert(j > 0);
if (j >= i)
log_error("%s \"compressed\" %zu -> %" PRIu64, label, i, j);
r = decompress(buf, j, &buf2, &buf2_allocated, &k, 0);
assert(r == 0);
assert(buf2_allocated >= k);
assert(k == i);
assert(memcmp(text, buf2, i) == 0);
total += i;
compressed += j;
n2 = now(CLOCK_MONOTONIC);
if (n2 - n > 60 * USEC_PER_SEC)
break;
}
dt = (n2-n) / 1e6;
log_info("%s: compressed & decompressed %zu bytes in %.2fs (%.2fMiB/s), "
"mean compresion %.2f%%, skipped %zu bytes",
label, total, dt,
total / 1024. / 1024 / dt,
100 - compressed * 100. / total,
skipped);
}
int main(int argc, char *argv[]) {
log_set_max_level(LOG_DEBUG);
#ifdef HAVE_XZ
test_compress_decompress("XZ", compress_blob_xz, decompress_blob_xz);
#endif
#ifdef HAVE_LZ4
test_compress_decompress("LZ4", compress_blob_lz4, decompress_blob_lz4);
#endif
return 0;
}
|
