-
-
Notifications
You must be signed in to change notification settings - Fork 82
/
test_ndcell.c
256 lines (213 loc) · 6.94 KB
/
test_ndcell.c
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
/*********************************************************************
Blosc - Blocked Shuffling and Compression Library
Copyright (c) 2021 Blosc Development Team <blosc@blosc.org>
https://blosc.org
License: BSD 3-Clause (see LICENSE.txt)
See LICENSE.txt for details about copyright and rights to use.
Test program demonstrating use of the Blosc filter from C code.
To compile this program:
$ gcc -O test_ndcell.c -o test_ndcell -lblosc2
To run:
$ ./test_ndcell
Successful roundtrip!
Compression: 41472 -> 4937 (8.4x)
rand: 36535 obtained
Successful roundtrip!
Compression: 1792 -> 1005 (1.8x)
same_cells: 787 obtained
Successful roundtrip!
Compression: 16128 -> 1599 (10.1x)
some_matches: 14529 obtained
**********************************************************************/
#include "ndcell.h"
#include "blosc2/filters-registry.h"
#include "b2nd.h"
#include <inttypes.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
static int test_ndcell(blosc2_schunk *schunk) {
int64_t nchunks = schunk->nchunks;
int32_t chunksize = (int32_t) (schunk->chunksize);
// int isize = (int) array->extchunknitems * typesize;
uint8_t *data_in = malloc(chunksize);
int decompressed;
int64_t csize;
int64_t dsize;
int64_t csize_f = 0;
uint8_t *data_out = malloc(chunksize + BLOSC2_MAX_OVERHEAD);
uint8_t *data_dest = malloc(chunksize);
/* Create a context for compression */
blosc2_cparams cparams = BLOSC2_CPARAMS_DEFAULTS;
cparams.splitmode = BLOSC_ALWAYS_SPLIT;
cparams.typesize = schunk->typesize;
cparams.compcode = BLOSC_LZ4;
cparams.filters[4] = BLOSC_FILTER_NDCELL;
cparams.filters_meta[4] = 4;
cparams.filters[BLOSC2_MAX_FILTERS - 1] = BLOSC_SHUFFLE;
cparams.clevel = 9;
cparams.nthreads = 1;
cparams.blocksize = schunk->blocksize;
cparams.schunk = schunk;
blosc2_context *cctx;
cctx = blosc2_create_cctx(cparams);
blosc2_dparams dparams = BLOSC2_DPARAMS_DEFAULTS;
dparams.nthreads = 1;
dparams.schunk = schunk;
blosc2_context *dctx;
dctx = blosc2_create_dctx(dparams);
for (int ci = 0; ci < nchunks; ci++) {
decompressed = blosc2_schunk_decompress_chunk(schunk, ci, data_in, chunksize);
if (decompressed < 0) {
printf("Error decompressing chunk \n");
return -1;
}
/* Compress with clevel=5 and shuffle active */
csize = blosc2_compress_ctx(cctx, data_in, chunksize, data_out, chunksize + BLOSC2_MAX_OVERHEAD);
if (csize == 0) {
printf("Buffer is incompressible. Giving up.\n");
return -1;
} else if (csize < 0) {
printf("Compression error. Error code: %" PRId64 "\n", csize);
return (int) csize;
}
csize_f += csize;
/* Decompress */
dsize = blosc2_decompress_ctx(dctx, data_out, chunksize + BLOSC2_MAX_OVERHEAD, data_dest, chunksize);
if (dsize <= 0) {
printf("Decompression error. Error code: %" PRId64 "\n", dsize);
return (int) dsize;
}
for (int i = 0; i < chunksize; i++) {
if (data_in[i] != data_dest[i]) {
printf("i: %d, data %u, dest %u", i, data_in[i], data_dest[i]);
printf("\n Decompressed data differs from original!\n");
return -1;
}
}
}
csize_f = csize_f / nchunks;
free(data_in);
free(data_out);
free(data_dest);
blosc2_free_ctx(cctx);
blosc2_free_ctx(dctx);
printf("Successful roundtrip!\n");
printf("Compression: %d -> %" PRId64 " (%.1fx)\n", chunksize, csize_f, (1. * chunksize) / (double) csize_f);
return (int) (chunksize - csize_f);
}
int rand_() {
int ndim = 3;
int typesize = 4;
int64_t shape[] = {32, 18, 32};
int32_t chunkshape[] = {17, 16, 24};
int32_t blockshape[] = {8, 9, 8};
int64_t nelem = 1;
for (int i = 0; i < ndim; ++i) {
nelem *= (int) (shape[i]);
}
int64_t size = typesize * nelem;
float *data = malloc(size);
for (int64_t i = 0; i < nelem; i++) {
data[i] = (float) (rand() % 220);
}
blosc2_cparams cparams = BLOSC2_CPARAMS_DEFAULTS;
cparams.typesize = typesize;
blosc2_storage b2_storage = {.cparams=&cparams};
b2_storage.contiguous = true;
b2nd_context_t *ctx = b2nd_create_ctx(&b2_storage, ndim, shape, chunkshape, blockshape, NULL, 0,
NULL, 0);
b2nd_array_t *arr;
BLOSC_ERROR(b2nd_from_cbuffer(ctx, &arr, data, size));
blosc2_schunk *schunk = arr->sc;
/* Run the test. */
int result = test_ndcell(schunk);
BLOSC_ERROR(b2nd_free_ctx(ctx));
BLOSC_ERROR(b2nd_free(arr));
free(data);
return result;
}
int same_cells() {
int ndim = 2;
int typesize = 8;
int64_t shape[] = {128, 111};
int32_t chunkshape[] = {32, 11};
int32_t blockshape[] = {16, 7};
int64_t nelem = 1;
for (int i = 0; i < ndim; ++i) {
nelem *= (int) (shape[i]);
}
int64_t size = typesize * nelem;
double *data = malloc(size);
for (int64_t i = 0; i < (nelem / 4); i++) {
data[i * 4] = (double) 11111111;
data[i * 4 + 1] = (double) 99999999;
}
blosc2_cparams cparams = BLOSC2_CPARAMS_DEFAULTS;
cparams.typesize = typesize;
blosc2_storage b2_storage = {.cparams=&cparams};
b2_storage.contiguous = true;
b2nd_context_t *ctx = b2nd_create_ctx(&b2_storage, ndim, shape, chunkshape, blockshape, NULL, 0,
NULL, 0);
b2nd_array_t *arr;
BLOSC_ERROR(b2nd_from_cbuffer(ctx, &arr, data, size));
blosc2_schunk *schunk = arr->sc;
/* Run the test. */
int result = test_ndcell(schunk);
BLOSC_ERROR(b2nd_free_ctx(ctx));
BLOSC_ERROR(b2nd_free(arr));
free(data);
return result;
}
int some_matches() {
int ndim = 2;
int typesize = 8;
int64_t shape[] = {128, 111};
int32_t chunkshape[] = {48, 32};
int32_t blockshape[] = {14, 18};
int64_t nelem = 1;
for (int i = 0; i < ndim; ++i) {
nelem *= (int) (shape[i]);
}
int64_t size = typesize * nelem;
double *data = malloc(size);
for (int64_t i = 0; i < (nelem / 2); i++) {
data[i] = (double) i;
}
for (int64_t i = (nelem / 2); i < nelem; i++) {
data[i] = (double) 1;
}
blosc2_cparams cparams = BLOSC2_CPARAMS_DEFAULTS;
cparams.typesize = typesize;
blosc2_storage b2_storage = {.cparams=&cparams};
b2_storage.contiguous = true;
b2nd_context_t *ctx = b2nd_create_ctx(&b2_storage, ndim, shape, chunkshape, blockshape, NULL, 0,
NULL, 0);
b2nd_array_t *arr;
BLOSC_ERROR(b2nd_from_cbuffer(ctx, &arr, data, size));
blosc2_schunk *schunk = arr->sc;
/* Run the test. */
int result = test_ndcell(schunk);
BLOSC_ERROR(b2nd_free_ctx(ctx));
BLOSC_ERROR(b2nd_free(arr));
free(data);
return result;
}
int main(void) {
int result;
blosc2_init();
result = rand_();
printf("rand: %d obtained \n \n", result);
if (result < 0)
return result;
result = same_cells();
printf("same_cells: %d obtained \n \n", result);
if (result < 0)
return result;
result = some_matches();
printf("some_matches: %d obtained \n \n", result);
if (result < 0)
return result;
blosc2_destroy();
return BLOSC2_ERROR_SUCCESS;
}