forked from powturbo/TurboPFor-Integer-Compression
-
Notifications
You must be signed in to change notification settings - Fork 0
/
icapp.c
1909 lines (1726 loc) · 112 KB
/
icapp.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
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
Copyright (C) powturbo 2015-2019
GPL v2 License
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.
- email : powturbo [AT] gmail.com
- github : https://github.com/powturbo
- homepage : https://sites.google.com/site/powturbo/
- twitter : https://twitter.com/powturbo
**/
// TurboPFor - "IcApp: Benchmark application"
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#ifdef __APPLE__
#include <sys/malloc.h>
#else
#include <malloc.h>
#endif
#ifdef _MSC_VER
#include "vs/getopt.h"
#else
#include <getopt.h>
#endif
#if defined(_WIN32)
#include <windows.h>
#define srand48(x) srand(x)
#define drand48() ((double)(rand()) / RAND_MAX)
#define __off64_t _off64_t
#endif
#include <math.h> // pow,fabs
#include <float.h>
#include "conf.h"
#include "time_.h"
#define BITUTIL_IN
#include "bitutil.h"
#if defined(__i386__) || defined(__x86_64__)
#define SSE
#define AVX2
#elif defined(__ARM_NEON) || defined(__powerpc64__)
#define SSE
#endif
#ifndef min
#define min(x,y) (((x)<(y)) ? (x) : (y))
#define max(x,y) (((x)>(y)) ? (x) : (y))
#endif
int verbose = 1,isa;
//------------------------------ bits statistics --------------------------------------------------
static unsigned xbits[65],tbits[65],zbits[65];
unsigned histl8( uint8_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) xbits[i]=0; for(i = 0; i < n; i++) xbits[l=bsr8( in[i])]++,s+=l; return (s+7)/8; }
unsigned histl16(uint16_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) xbits[i]=0; for(i = 0; i < n; i++) xbits[l=bsr16(in[i])]++,s+=l; return (s+7)/8; }
unsigned histl32(uint32_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) xbits[i]=0; for(i = 0; i < n; i++) xbits[l=bsr32(in[i])]++,s+=l; return (s+7)/8; }
unsigned histl64(uint64_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) xbits[i]=0; for(i = 0; i < n; i++) xbits[l=bsr64(in[i])]++,s+=l; return (s+7)/8; }
unsigned histz8( uint8_t *in, unsigned n) { unsigned i,l; uint64_t s=0; uint8_t x = 0; for(i = 0; i < 65; i++) zbits[i]=0; for(i = 0; i < n; i++) zbits[l=bsr8( zigzagenc8( in[i]-x))]++,s+=l,x=in[i]; return (s+7)/8; }
unsigned histz16(uint16_t *in, unsigned n) { unsigned i,l; uint64_t s=0; uint16_t x = 0; for(i = 0; i < 65; i++) zbits[i]=0; for(i = 0; i < n; i++) zbits[l=bsr16(zigzagenc16(in[i]-x))]++,s+=l,x=in[i]; return (s+7)/8; }
unsigned histz32(uint32_t *in, unsigned n) { unsigned i,l; uint64_t s=0; uint32_t x = 0; for(i = 0; i < 65; i++) zbits[i]=0; for(i = 0; i < n; i++) zbits[l=bsr32(zigzagenc32(in[i]-x))]++,s+=l,x=in[i]; return (s+7)/8; }
unsigned histz64(uint64_t *in, unsigned n) { unsigned i,l; uint64_t s=0; uint64_t x = 0; for(i = 0; i < 65; i++) zbits[i]=0; for(i = 0; i < n; i++) zbits[l=bsr64(zigzagenc64(in[i]-x))]++,s+=l,x=in[i]; return (s+7)/8; }
unsigned histt8( uint8_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) tbits[i]=0; for(i = 0; i < n; i++) l=tbits[in[i]?ctz8( in[i]): 8]++,s+=l; return (s+7)/8; }
unsigned histt16(uint16_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) tbits[i]=0; for(i = 0; i < n; i++) l=tbits[in[i]?ctz16(in[i]):16]++,s+=l; return (s+7)/8; }
unsigned histt32(uint32_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) tbits[i]=0; for(i = 0; i < n; i++) l=tbits[in[i]?ctz32(in[i]):32]++,s+=l; return (s+7)/8; }
unsigned histt64(uint64_t *in, unsigned n) { unsigned i,l; uint64_t s=0; for(i = 0; i < 65; i++) tbits[i]=0; for(i = 0; i < n; i++) l=tbits[in[i]?ctz64(in[i]):64]++,s+=l; return (s+7)/8; }
//----------------------------- Convert iso-8601 and similar formats to timestamp -------------------------
// Date separator : '.'. '/' or '-'
// Hour separator : ':'
// Fraction sep.: '.' or ','
// examples: "2020" "20211203" "20211022 11:09:45.1234",
uint64_t strtots(char *p, char **pq, int type) { // string to timestamp
struct tm tm;
uint64_t u;
char *s=p;
int frac = 0,c;
memset(&tm, 0, sizeof(tm)); tm.tm_mday = 1;
while(!isdigit(*p)) p++;
u = strtoull(p, &p, 10); // first number
if( u <= 99) u += 2000; // year "yy": 00-99 -> 2000-2099
else if(u >= 19710101 && u < 20381212) { // date: "yyyymmdd"
tm.tm_year = u/10000;
tm.tm_mon = (u%10000)/100; if(!tm.tm_mon || tm.tm_mon > 12) goto a; tm.tm_mon--;
tm.tm_mday = u%10; if(!tm.tm_mday || tm.tm_mday > 31) goto a;
goto h;
} else if(u < 1971 || u > 2099) goto a; // invalid
tm.tm_year = u; // year "yyyy"
c = *p; // month,day: "mm.dd", "mm-dd", "mm/dd"
if(c != '.' && c != '-' && c != '/') goto b; tm.tm_mon = strtoul(p+1, &p, 10); if(!tm.tm_mon || tm.tm_mon > 12) goto a; tm.tm_mon--;
if(c != '.' && c != '-' && c != '/') goto b; tm.tm_mday = strtoul(p+1, &p, 10); if(!tm.tm_mday || tm.tm_mday > 31) goto a;
if(c != '.' && c != '-' && c != '/') goto b; h:tm.tm_hour = strtoul(p+1, &p, 10);
if(tm.tm_hour <= 24 && *p == ':') { // time ":hh:mm:ss.frac", ":hh:mm:ss,frac"
tm.tm_min = strtoul(p+1, &p, 10); if(tm.tm_min > 60) tm.tm_hour = tm.tm_min = 0;
tm.tm_sec = strtoul(p+1, &p, 10); if(tm.tm_sec > 60) tm.tm_hour = tm.tm_min = tm.tm_sec = 0;
if(type > 0 && (*p == '.' || *p == ',')) { frac = strtoul(p+1, &p, 10); if((c=p-(p+1)) > 6) frac /= 1000000;else if(c > 3) frac /= 1000; }
} else tm.tm_hour = 0;
b:u = mktime(&tm);
u = u * 1000 + frac; // milliseconds
a:*pq = p; //if(verbose >= 9) printf("[%d-%d-%d %.2d:%.2d:%.2d.%d]\n", tm.tm_year, tm.tm_mon+1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec, frac, u);exit(0);
return u;
}
//----------------------------- Zipfian + Timestamps generator --------------------------------------------------------
static double a = 1.5;
void stprint(char *s, unsigned *xbits) {
int i;
uint64_t t = 0;
for(i = 0; i <= 64; i++)
t += xbits[i];
printf("%s bits histogram:",s);
if(!t) { printf("ALL zero\n"); return; }
printf("\n");
for(i = 0; i <= 64; i++)
if(xbits[i]) {
double f = (double)xbits[i]*100/(double)t;
unsigned u = round(f);
printf("%.2d:", i); for(int j=0; j < u; j++) printf("#");
if (f > 10) printf(" %.0f%% ", f);
else if(f > 0.1) printf(" %.1f%% ", f);
else if(f > 0.01) printf(" %.2f%% ", f);
else if(f > 0.001) printf(" %.3f%% ", f);
else if(f > 0.0001) printf(" %.4f%% ", f);
else if(f > 0.00001) printf(" %.5f%% ", f);
else printf(" %.6f%% ", f);
printf("\n");
}
}
int dcmp(double *a, double *b) {
if(*a < *b) return -1;
if(*a > *b) return 1;
return 0;
}
void zipu8(uint8_t *a, unsigned n, double alpha, unsigned x1, unsigned x2) {
int i;
double prob, cum, *zmap;
x2 = x2>0xffu?0xffu:x2; if(x1 > x2) x1 = x2;
unsigned m = x2 - x1 + 1;
if(!(zmap = malloc(m*sizeof(zmap[0])))) die("mallo error %d\n", m);
// generate initial sample (slow)
srand48(1);
if(alpha > 0) {
for(cum = 0.0,i = 0; i < m; i++)
cum += 1.0 / pow(i+1, alpha);
cum = 1.0 / cum;
for(zmap[0] = prob = cum,i = 1; i < m; i++) zmap[i] = (prob += (cum / pow(i+1, alpha)));
} else for(i = 0; i < m; i++) zmap[i] = 1.0 / m;
// use binary search to speed up zipfgen
qsort(zmap, m, sizeof(zmap[0]), (int(*)(const void*,const void*))dcmp);
for(i = 0; i < n; i++) {
double r = drand48();
int l = 0, h = m-1;
while(l < h) {
int k = (l + h) >> 1;
if(r >= zmap[k]) l = k + 1;
else h = k;
}
a[i] = x1 + l; if(a[i]>x2) a[i]=x2;
}
free(zmap);
}
void zipu16(uint16_t *a, unsigned n, double alpha, unsigned x1, unsigned x2) {
int i;
double prob, cum, *zmap;
x2 = x2>0xffffu?0xffffu:x2; if(x1 > x2) x1 = x2;
unsigned m = x2 - x1 + 1;
if(!(zmap = malloc(m*sizeof(zmap[0])))) die("mallo error %d\n", m);
// generate initial sample (slow)
srand48(1);
if(alpha > 0) {
for(cum = 0.0,i = 0; i < m; i++)
cum += 1.0 / pow(i+1, alpha);
cum = 1.0 / cum;
for(zmap[0] = prob = cum,i = 1; i < m; i++) zmap[i] = (prob += (cum / pow(i+1, alpha)));
} else for(i = 0; i < m; i++) zmap[i] = 1.0 / m;
// use binary search to speed up zipfgen
qsort(zmap, m, sizeof(zmap[0]), (int(*)(const void*,const void*))dcmp);
for(i = 0; i < n; i++) {
double r = drand48();
int l = 0, h = m-1;
while(l < h) {
int k = (l + h) >> 1;
if(r >= zmap[k]) l = k + 1;
else h = k;
}
a[i] = x1 + l;
}
free(zmap);
}
void zipu32(unsigned *a, unsigned n, double alpha, unsigned x1, unsigned x2) {
int i;
double prob, cum, *zmap;
if(x1 > x2) x1 = x2;
unsigned m = x2 - x1 + 1;
if(!(zmap = malloc(m*sizeof(zmap[0])))) die("mallo error %d\n", m);
// generate initial sample (slow)
srand48(1);
if(alpha > 0) {
for(cum = 0.0,i = 0; i < m; i++)
cum += 1.0 / pow(i+1, alpha);
cum = 1.0 / cum;
for(zmap[0] = prob = cum,i = 1; i < m; i++) zmap[i] = (prob += (cum / pow(i+1, alpha)));
} else for(i = 0; i < m; i++) zmap[i] = 1.0 / m;
// use binary search to speed up zipfgen
qsort(zmap, m, sizeof(zmap[0]), (int(*)(const void*,const void*))dcmp);
for(i = 0; i < n; i++) {
double r = drand48();
int l = 0, h = m-1;
while(l < h) {
int k = (l + h) >> 1;
if(r >= zmap[k]) l = k + 1;
else h = k;
}
a[i] = x1 + l;
}
free(zmap);
}
void zipf32(float *a, unsigned n, double alpha, unsigned x1, unsigned x2) {
int i;
double prob, cum, *zmap;
if(x1 > x2) x1 = x2;
unsigned m = x2 - x1 + 1;
if(!(zmap = malloc(m*sizeof(zmap[0])))) die("mallo error %d\n", m);
// generate initial sample (slow)
srand48(1);
if(alpha > 0) {
for(cum = 0.0,i = 0; i < m; i++)
cum += 1.0 / pow(i+1, alpha);
cum = 1.0 / cum;
for(zmap[0] = prob = cum,i = 1; i < m; i++) zmap[i] = (prob += (cum / pow(i+1, alpha)));
} else for(i = 0; i < m; i++) zmap[i] = 1.0 / m;
// use binary search to speed up zipfgen
qsort(zmap, m, sizeof(zmap[0]), (int(*)(const void*,const void*))dcmp);
for(i = 0; i < n; i++) {
double r = drand48();
int l = 0, h = m-1;
while(l < h) {
int k = (l + h) >> 1;
if(r >= zmap[k]) l = k + 1;
else h = k;
}
a[i] = x1 + l;
}
free(zmap);
}
void zipu64(uint64_t *a, unsigned n, double alpha, uint64_t x1, uint64_t x2) {
int i;
double prob, cum, *zmap;
if(x1 > x2) x1 = x2;
unsigned m = x2 - x1 + 1;
if(!(zmap = malloc(m*sizeof(zmap[0])))) die("mallo error %d\n", m);
// generate initial sample (slow)
srand48(1);
if(alpha > 0) {
for(cum = 0.0,i = 0; i < m; i++)
cum += 1.0 / pow(i+1, alpha);
cum = 1.0 / cum;
for(zmap[0] = prob = cum,i = 1; i < m; i++) zmap[i] = (prob += (cum / pow(i+1, alpha)));
} else for(i = 0; i < m; i++) zmap[i] = 1.0 / m;
// use binary search to speed up zipfgen
qsort(zmap, m, sizeof(zmap[0]), (int(*)(const void*,const void*))dcmp);
for(i = 0; i < n; i++) {
double r = drand48();
int l = 0, h = m-1;
while(l < h) {
int k = (l + h) >> 1;
if(r >= zmap[k]) l = k + 1;
else h = k;
}
a[i] = x1 + l;
}
free(zmap);
}
void zipf64(double *a, unsigned n, double alpha, unsigned x1, unsigned x2) {
int i;
unsigned m = x2 - x1 + 1;
double prob, cum, *zmap;
if(!(zmap = malloc(m*sizeof(zmap[0])))) die("mallo error %d\n", m);
// generate initial sample (slow)
srand48(1);
if(alpha > 0) {
for(cum = 0.0,i = 0; i < m; i++)
cum += 1.0 / pow(i+1, alpha);
cum = 1.0 / cum;
for(zmap[0] = prob = cum,i = 1; i < m; i++) zmap[i] = (prob += (cum / pow(i+1, alpha)));
} else for(i = 0; i < m; i++) zmap[i] = 1.0 / m;
// use binary search to speed up zipfgen
qsort(zmap, m, sizeof(zmap[0]), (int(*)(const void*,const void*))dcmp);
for(i = 0; i < n; i++) {
double r = drand48();
int l = 0, h = m-1;
while(l < h) {
int k = (l + h) >> 1;
if(r >= zmap[k]) l = k + 1;
else h = k;
}
a[i] = x1 + l;
}
free(zmap);
}
void tms64(uint64_t *a, unsigned n, unsigned x1, unsigned x2, double z) { // generator for timestamps
srand48(1);
double freq = drand48()*0.5 + 0.1, amp = (drand48()*z + 0.5);
int i;
for(i = 0; i < n; i++) {
double x = x1 + sin(i * freq) * amp;
a[i] = x>x2?x2:x;
}
}
#define OVD (10*MB)
static unsigned rm = 0, rx = 255;
unsigned datagen(unsigned char *in, unsigned n, int isize, double be_mindelta) {
unsigned char *ip; printf("zipf alpha=%.2f range[%u..%u].n=%u\n ", a, rm, rx, n);
int mindelta = be_mindelta,i; //in = malloc(n*isize+OVD); if(!in) die("malloc err=%u", n*isize);
switch(isize) {
case 1: zipu8((uint8_t *)in, n, a, rm, rx); //{ int i; for(i = 0; i < n; i++) in[i] = i; } //
for(i = 1; i <= n; i++) xbits[bsr32(ctou8(in+i))]++;
if(mindelta == 0 || mindelta == 1) {
uint8_t *ip = (uint8_t *)in, v; stprint("delta", xbits);
for(ip[0]=0,v = 1; v < n; v++) {
ip[v] += ip[v-1] + mindelta; if(ip[v]>=(1u<<8)) die("overflow generating sorted array %d\n", ip[v]);
}
} else stprint("",xbits);
break;
case 2: zipu16((unsigned short *)in, n, a, rm, rx); //{ int i; for(i = 0; i < n; i++) in[i] = i; } //
for(i = 1; i <= n; i++) xbits[bsr32(ctou16(in+i*2))]++;
if(mindelta == 0 || mindelta == 1) {
unsigned short *ip = (unsigned short *)in, v; stprint("delta", xbits);
for(ip[0]=0,v = 1; v < n; v++) {
ip[v] += ip[v-1] + mindelta; if(ip[v]>=(1u<<16)) die("overflow generating sorted array %d\n", ip[v]);
}
} else stprint("",xbits);
break;
case 4: zipu32((unsigned *)in, n, a, rm, rx); //{ int i; for(i = 0; i < n; i++) in[i] = i; } //
for(i = 1; i <= n; i++) xbits[bsr32(ctou32(in+i*4))]++;
if(mindelta == 0 || mindelta == 1) {
unsigned *ip = (unsigned *)in, v; stprint(mindelta?"delta=1":"delta=0", xbits);
for(ip[0]=0,v = 1; v < n; v++) {
ip[v] += ip[v-1] + mindelta; if(ip[v]>=(1u<<31)) die("overflow generating sorted array %d\n", ip[v]);
}
} else stprint("",xbits);
break;
case 8: zipu64((uint64_t *)in, n, a, rm, rx); //{ int i; for(i = 0; i < n; i++) in[i] = i; } //
for(i = 1; i <= n; i++) xbits[bsr64(ctou64(in+i*8))]++;
if(mindelta == 0 || mindelta == 1) {
uint64_t *ip = (uint64_t *)in, v; stprint("delta", xbits);
for(ip[0]=0,v = 1; v < n; v++) {
ip[v] += ip[v-1] + mindelta; if(ip[v]>=(1u<<31)) die("overflow generating sorted array %lld\n", ip[v]);
}
} else stprint("",xbits);
break;
case -4: zipf32((float *)in, n, a, rm, rx);
stprint("", xbits);
break;
case -8: zipf64((double *)in, n, a, rm, rx);
stprint("", xbits);
break;
}
return n*abs(isize);
}
// 0 1 2 3 4 5 6 7, 8 9 10 11 12 13 14
enum { T_0, T_UINT8, T_UINT16, T_UINT24, T_UINT32, T_UINT40, T_UINT48, T_UINT56, T_UINT64, T_FLOAT, T_DOUBLE, T_CHAR, T_TXT, T_TIM32, T_TIM64, T_TST };
#define IPUSH(in,n,isize, nmax,u) { \
if(n >= nmax) { nmax = nmax?(nmax << 1):(1<<20);\
in = realloc(in, nmax*isize+OVD); if(!in) die("malloc err=%u", nmax); }\
ctou64(in+n*isize) = u; n++;\
}
int mdelta;
char *keysep;
unsigned befgen(unsigned char **_in, unsigned n, int fmt, int isize, FILE *fi, int kid, int skiph, int decs, int divs, int mdelta) {
unsigned char *in = *_in,*ip;
unsigned nmax = 0, ovf=0;
#define LSIZE (1024*16)
char s[LSIZE+1];
double pre;
n = 0;
while(skiph-- > 0) {
fgets(s, LSIZE, fi); if(verbose>=5 && n < 100 ||verbose>5) printf("skip first line\n");
}
if(decs) {
pre = decs?pow(10.0f,(float)decs):1;
pre /= divs;
} else pre = 1;
switch(fmt) {
case T_TXT:
case T_TIM32:
case T_TIM64: if(verbose>1) printf("reading text lines. pre=%.2f, col=%d, sep=%s\n", pre, kid, keysep?keysep:"");
while(fgets(s, LSIZE, fi)) {
unsigned char *p = s,*q;
int k = 0, keyid = 1, c;
s[strlen(s) - 1] = 0;
q = p;
if(kid > 1)
do {
p = q;
if(keysep && strchr(keysep,*q)) keyid++;
q++;
} while(*q && keyid != kid);
if(fmt == T_TIM32 || fmt == T_TIM64) {
while(!isdigit(*p)) p++;
uint64_t u = strtots(p, &q, fmt == T_TIM64?1:0);
if(fmt == T_TIM32) u /= 1000;
a: IPUSH(in,n,isize,nmax,u); c=*q; *q=0; if(verbose>=5 && n < 100 || verbose>=9) printf("\'%s\'->%llu ", p, u); *q = c;
} else if(isize > 0) {
while(!isdigit(*p) && *p != '-' && *p != '+') p++;
uint64_t u = strtoll(p, &q, 10)*pre - mdelta;
if(*q == '.')
u = pre>1.0?round(strtod(p, &q)*pre):strtod(p, &q) - mdelta;
switch(isize) {
case 1: if(u > 0xffu) ovf++; break;
case 2: if(u > 0xffffu) ovf++; break;
case 4: if(u > 0xffffffffu) ovf++; break;
}
IPUSH(in,n,isize,nmax,u); c=*q; *q=0; if(verbose>=5 && n < 100 || verbose>=9) printf("\'%s\'->%lld ", p, u); *q = c;
} else {
while(*p && !isdigit(*p) && *p != '-' && *p != '.' && *p != '+') { if(keysep && strchr(keysep,*p)) keyid++; p++; }
double d = strtod(p, &q) - mdelta;
uint64_t u;
memcpy(&u,&d,sizeof(u));
IPUSH(in,n,-isize,nmax,u); if(verbose>=5 && n < 100 || verbose>=9) { c=*q; *q=0; double d; memcpy(&d,&u,sizeof(d)); printf("\'%s\'->%f ", p, d); *q = c; }
}
}
break;
case T_CHAR: if(verbose>1) printf("reading char file. pre=%.2f\n", pre);
for(;;) {
char *p = s,*q;
int c;
if(isize > 0) {
int64_t u;
while((c = getc(fi)) >= '0' && c <= '9' || c == '-' || c == '+')
if(p - s < LSIZE) *p++ = c;
if(c == '.') {
*p++ = c;
while((c = getc(fi)) >= '0' && c <= '9' || c == '-' || c == '+' || c == 'e' || c == 'E')
if(p - s < LSIZE) *p++ = c;
*p = 0;
u = pre>1.0?round(strtod(s, &q)*pre):strtod(s, &q) - mdelta;
} else {
*p = 0;
u = strtoll(s, &p, 10) - mdelta;
}
IPUSH(in,n,isize,nmax,u); if(verbose>=5 && n < 100 || verbose>=9) printf("%s->%lld ", s, (int64_t)u);
} else {
while((c = getc(fi)) >= '0' && c <= '9' || c == '-')
if(p - s < LSIZE) *p++ = c;
if((*p++ = c) == '.')
while((c = getc(fi)) >= '0' && c <= '9')
if(p - s < LSIZE) *p++ = c;
*p = 0;
double d = strtod(s, &p) - mdelta;
uint64_t u;
memcpy(&u,&d,sizeof(u)); if(verbose>=5 && n < 100 || verbose>=9) { double d; memcpy(&d,&u,sizeof(u)); printf("\'%s\'->%e ", s, d); }
IPUSH(in,n,-isize,nmax,u);
}
if(c == EOF) break;
}
break;
default: die("unknown data format %d\n", fmt);
}
if(verbose>=5) printf("\n");
*_in = in;
if(ovf) printf("number of items truncated=%d\n", ovf);
return n*abs(isize);
}
//-------------------------------------------- memcheck : buffer compare for equality ---------------------------------------------------------------
static int mcpy=1, cmp=2;
#define CBUF(_n_) (((size_t)(_n_))*5/3+1024/*1024*/)
int memcheck(unsigned char *in, unsigned n, unsigned char *cpy) {
int i;
if(cmp <= 1) return 0;
for(i = 0; i < n; i++)
if(in[i] != cpy[i]) {
if(cmp > 3) abort(); // crash (AFL) fuzzing
printf("ERROR at %d:in=%x,%x,%x,%x dec=%x,%x,%x,%x cmp=%d\n", i, in[i], in[i+1], in[i+2], in[i+3], cpy[i],cpy[i+1],cpy[i+2],cpy[i+3], cmp);
if(cmp > 2) exit(EXIT_FAILURE);
return i+1;
}
return 0;
}
int memcheck32(unsigned *in, unsigned n, unsigned *cpy) {
int i;
if(cmp <= 1) return 0;
for(i = 0; i < n; i++)
if(in[i] != cpy[i]) {
if(cmp > 3) abort(); // crash (AFL) fuzzing
printf("ERROR at %d:in=%x,%x,%x,%x dec=%x,%x,%x,%x cmp=%d\n", i, in[i], in[i+1], in[i+2], in[i+3], cpy[i],cpy[i+1],cpy[i+2],cpy[i+3], cmp);
if(cmp > 2) exit(EXIT_FAILURE);
return i+1;
}
return 0;
}
void libmemcpy(unsigned char *dst, unsigned char *src, int len) {
void *(*memcpy_ptr)(void *, const void *, size_t) = memcpy;
if (time(NULL) == 1)
memcpy_ptr = NULL;
memcpy_ptr(dst, src, len);
}
//---------------------------------------- IcApp: Benchmark --------------------------------------------------------------------------
#include "bitpack.h"
#include "vp4.h"
#include "vint.h"
#include "fp.h"
#include "eliasfano.h"
#include "vsimple.h"
#include "transpose.h"
#include "trle.h"
//#include "bic.h"
#ifdef STREAMVBYTE
#include "streamvbyte/include/streamvbyte.h"
#include "streamvbyte/include/streamvbytedelta.h"
static size_t streamvbyte_zzag_encode(const uint32_t *in, uint32_t length, uint8_t *out, uint32_t prev, uint8_t *tmp) {
zigzag_delta_encode(in, tmp, length, prev);
return streamvbyte_encode(tmp, length, out);
}
static size_t streamvbyte_zzag_decode(const uint8_t *in, uint32_t *out, uint32_t length, uint32_t prev, uint8_t *tmp) {
streamvbyte_decode(in, tmp, length);
zigzag_delta_decode(tmp, out, length, prev);
return length;
}
#endif
#ifdef MASKEDVBYTE
#undef VARINTDECODE_H_
#include "ext/fastpfor.h"
#include "MaskedVByte/include/varintencode.h"
#undef VARINTDECODE_H_
#include "MaskedVByte/include/varintdecode.h"
#endif
#ifdef BITSHUFFLE
#include "bitshuffle/src/bitshuffle.h"
#ifndef LZ4
#include "bitshuffle/lz4/lz4.h"
#endif
#endif
#ifdef BLOSC
#include "c-blosc2/blosc/shuffle.h"
#include "c-blosc2/blosc/blosc2.h"
#endif
#ifdef VBZ
#define bool int
#include "vbz_compression/vbz/vbz.h"
#endif
#ifdef VTENC
#include "VTEnc/vtenc.h"
#endif
void pr(unsigned l, unsigned n) {
double r = (double)l*100.0/n;
if(r>0.1) printf("%10u %6.2f%% ", l, r);
else if(r>0.01) printf("%10u %7.3f%% ", l, r);
else printf("%10u %8.4f%% ", l, r); fflush(stdout); }
#define CPYR(in,n,esize,out) memcpy(out+((n)&(~(esize-1))),in+((n)&(~(esize-1))),(n)&(esize-1)) //, out+((n)&(8*esize-1))
/*unsigned char *p4menc32(uint32_t *in, unsigned n, unsigned char *out, uint32_t start, unsigned char *tmp) {
uint32_t x, mdelta,*pa = (unsigned *)tmp;
bitfm32(in, n, &x); // determine minimum value
mdelta = bitdi32(in, n, x); if(mdelta>(1<<27)) mdelta=1<<27; // determine minimum delta
bitdienc32(in, n, pa, x, mdelta); // delta transform
mdelta = mdelta<<5|(x&31); x>>=5; vbxput32(out, x); vbput32(out, mdelta);
return p4nenc32(pa, n, out);
}*/
#if 0 //def __AVX2__
void ictste32(uint32_t *in, size_t _n, uint32_t *out) { uint32_t *ip,*op,n=_n/4;
for(ip = in,op=out; ip != in+(n&~(8-1)); ip += 8, op += 8) {
__m256i vi = _mm256_loadu_si256((__m256i *)ip);
vi = mm256_zzage_epi32(vi);
_mm256_storeu_si256((__m256i *)op, vi);
}
}
void ictstd32(uint32_t *in, size_t _n, uint32_t *out) { uint32_t *ip,*op,n=_n/4;
for(ip = in,op=out; ip != in+(n&~(8-1)); ip += 8, op += 8) {
__m256i vi = _mm256_loadu_si256((__m256i *)ip);
vi = mm256_zzagd_epi32(vi);
_mm256_storeu_si256((__m256i *)op,vi);
}
}
#endif
//------------------ TurboVSsimple zigzag------------------------------------------
unsigned char *vszenc8( uint8_t *in, unsigned n, unsigned char *out, unsigned char *tmp) { bitzenc8( in, n, tmp, 0, 0); return vsenc8( tmp, n, out); }
unsigned char *vszenc16(uint16_t *in, unsigned n, unsigned char *out, unsigned char *tmp) { bitzenc16(in, n, tmp, 0, 0); return vsenc16(tmp, n, out); }
unsigned char *vszenc32(uint32_t *in, unsigned n, unsigned char *out, unsigned char *tmp) { bitzenc32(in, n, tmp, 0, 0); return vsenc32(tmp, n, out); }
unsigned char *vszenc64(uint64_t *in, unsigned n, unsigned char *out, unsigned char *tmp) { bitzenc64(in, n, tmp, 0, 0); return vsenc64(tmp, n, out); }
unsigned char *vszdec8( unsigned char *in, unsigned n, unsigned char *out) { unsigned char *p = vsdec8( in,n,out); bitzdec8( out, n, 0); return p; }
unsigned char *vszdec16(unsigned char *in, unsigned n, unsigned char *out) { unsigned char *p = vsdec16(in,n,out); bitzdec16(out, n, 0); return p; }
unsigned char *vszdec32(unsigned char *in, unsigned n, unsigned char *out) { unsigned char *p = vsdec32(in,n,out); bitzdec32(out, n, 0); return p; }
unsigned char *vszdec64(unsigned char *in, unsigned n, unsigned char *out) { unsigned char *p = vsdec64(in,n,out); bitzdec64(out, n, 0); return p; }
//------------------ TurboRLE (Run Length Encoding) + zigzag/xor -------------------------
#define RLE8 0xdau
#define RLE16 0xdadau
#define RLE32 0xdadadadau
#define RLE64 0xdadadadadadadadaull
unsigned trlezc( uint8_t *in, unsigned n, unsigned char *out, unsigned char *tmp) { bitzenc8(in, n, tmp, 0, 0); unsigned rc = trlec(tmp, n, out); if(rc >=n) { rc = n; memcpy(out,in,n); } return rc; }
unsigned trlezd(unsigned char *in, unsigned inlen, uint8_t *out, unsigned n) { if(inlen >= n) { memcpy(out,in,n); return inlen; } trled(in, inlen, out, n); bitzdec8(out, n, 0); return n; }
unsigned trlexc( uint8_t *in, unsigned n, unsigned char *out, unsigned char *tmp) { bitxenc8(in, n, tmp, 0); unsigned rc = trlec(tmp, n, out); if(rc >=n) { rc = n; memcpy(out,in,n); } return rc; }
unsigned trlexd(unsigned char *in, unsigned inlen, uint8_t *out, unsigned n) { if(inlen >= n) { memcpy(out,in,n); return inlen; } trled(in, inlen, out, n); bitxdec8(out, n, 0); return n; }
unsigned srlezc8( uint8_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint8_t e) { bitzenc8( in, n/( 8/8), tmp, 0, 0); return srlec8( tmp, n, out, e); }
unsigned srlezc16(uint16_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint16_t e) { bitzenc16(in, n/(16/8), tmp, 0, 0); return srlec16(tmp, n, out, e); }
unsigned srlezc32(uint32_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint32_t e) { bitzenc32(in, n/(32/8), tmp, 0, 0); return srlec32(tmp, n, out, e); }
unsigned srlezc64(uint64_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint64_t e) { bitzenc64(in, n/(64/8), tmp, 0, 0); return srlec64(tmp, n, out, e); }
unsigned srlezd8( unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint8_t e) { srled8(in,inlen,out, n, e); bitzdec8( out, n/(8/8), 0); return n; }
unsigned srlezd16(unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint16_t e) { srled16(in,inlen,out, n, e); bitzdec16(out, n/(16/8), 0); return n; }
unsigned srlezd32(unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint32_t e) { srled32(in,inlen,out, n, e); bitzdec32(out, n/(32/8), 0); return n; }
unsigned srlezd64(unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint64_t e) { srled64(in,inlen,out, n, e); bitzdec64(out, n/(64/8), 0); return n; }
unsigned srlexc8( uint8_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint8_t e) { bitxenc8( in, n/( 8/8), tmp, 0); return srlec8( tmp, n, out, e); }
unsigned srlexc16(uint16_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint16_t e) { bitxenc16(in, n/(16/8), tmp, 0); return srlec16(tmp, n, out, e); }
unsigned srlexc32(uint32_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint32_t e) { bitxenc32(in, n/(32/8), tmp, 0); return srlec32(tmp, n, out, e); }
unsigned srlexc64(uint64_t *in, unsigned n, unsigned char *out, unsigned char *tmp, uint64_t e) { bitxenc64(in, n/(64/8), tmp, 0); return srlec64(tmp, n, out, e); }
unsigned srlexd8( unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint8_t e) { srled8(in,inlen,out, n, e); bitxdec8( out, n/(8/8), 0); return n; }
unsigned srlexd16(unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint16_t e) { srled16(in,inlen,out, n, e); bitxdec16(out, n/(16/8), 0); return n; }
unsigned srlexd32(unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint32_t e) { srled32(in,inlen,out, n, e); bitxdec32(out, n/(32/8), 0); return n; }
unsigned srlexd64(unsigned char *in, unsigned inlen, unsigned char *out, unsigned n, uint64_t e) { srled64(in,inlen,out, n, e); bitxdec64(out, n/(64/8), 0); return n; }
void bitxenc(unsigned char *in, unsigned n, unsigned char *out, unsigned esize) {
switch(esize) {
case 1 : bitxenc8( in, n/1, out, 0); break;
case 2 : bitxenc16(in, n/2, out, 0); break;
case 4 : bitxenc32(in, n/4, out, 0); break;
case 8 : bitxenc64(in, n/8, out, 0); break;
}
}
void bitxdec(unsigned char *in, unsigned n, unsigned esize) {
switch(esize) {
case 1: bitxdec8( in, n/1, 0);break;
case 2: bitxdec16(in, n/2, 0);break;
case 4: bitxdec32(in, n/4, 0);break;
case 8: bitxdec64(in, n/8, 0);break;
}
}
void bitzenc(unsigned char *in, unsigned n, unsigned char *out, unsigned esize) {
switch(esize) {
case 1 : bitzenc8( in, n/1, out, 0, 0); break;
case 2 : bitzenc16(in, n/2, out, 0, 0); break;
case 4 : bitzenc32(in, n/4, out, 0, 0); break;
case 8 : bitzenc64(in, n/8, out, 0, 0); break;
}
}
void bitzdec(unsigned char *in, unsigned n, unsigned esize) {
switch(esize) {
case 1: bitzdec8( in, n/1, 0);break;
case 2: bitzdec16(in, n/2, 0);break;
case 4: bitzdec32(in, n/4, 0);break;
case 8: bitzdec64(in, n/8, 0);break;
}
}
#if 0
void bitzzenc(unsigned char *in, unsigned n, unsigned char *out, unsigned esize) {
switch(esize) {
case 1 : bitzzenc8( in, n/1, out, 0, 0); break;
case 2 : bitzzenc16(in, n/2, out, 0, 0); break;
case 4 : bitzzenc32(in, n/4, out, 0, 0); break;
case 8 : bitzzenc64(in, n/8, out, 0, 0); break;
}
}
void bitzzdec(unsigned char *in, unsigned n, unsigned esize) {
switch(esize) {
case 1: bitzzdec8( in, n/1, 0);break;
case 2: bitzzdec16(in, n/2, 0);break;
case 4: bitzzdec32(in, n/4, 0);break;
case 8: bitzzdec64(in, n/8, 0);break;
}
}
#endif
#ifdef BITSHUFFLE //--------------------------bit transpose ----------------------------------------------------------------------
static void bitshuffle(uint8_t *in, unsigned n, uint8_t *out, unsigned esize) {
bshuf_bitshuffle( in, out, n/esize, esize, 0); memcpy((char *)out+(n&(~(8*esize-1))), (char *)in+(n&(~(8*esize-1))), n&(8*esize-1));
}
static void bitunshuffle(uint8_t *in, unsigned n, uint8_t *out, unsigned esize) {
bshuf_bitunshuffle(in, out, n/esize, esize, 0); memcpy((char *)out+(n&(~(8*esize-1))), (char *)in+(n&(~(8*esize-1))), n&(8*esize-1));
}
#endif
//----------------------- lz --------------------------------------------------------------------------------------
unsigned codid = 0, codlev = 1, dsize = 0;
unsigned char codprm[256];
#include "lz.c"
//---------------------SPDP (https://userweb.cs.txstate.edu/~burtscher/research/SPDPcompressor/) -----------------------
#ifdef SPDP
#define NMAIN
#include "ext/SPDP_10.c"
#define SPDPSIZE (1<<23)
char ibuf[SPDPSIZE*2];
unsigned spdpenc(unsigned char *in, size_t n, unsigned char *out, unsigned bsize, int codlev) {
unsigned char *op = out,*ip;
for(ip = in, in += n; ip < in;) {
unsigned iplen = in - ip,l;
if(iplen > bsize) iplen = bsize;
memcpy(ibuf,ip,iplen); // SPDP is overwriting the input, copy to a tmp buffer
l = spdp_compress(codlev, iplen, ibuf, op+4); ctou32(op)=l; op+=4+l; //AC(l <= bsize,"Compress Fatal=%d>%d\n", l, bsize);
ip += iplen;
}
return op - out;
}
size_t spdpdec(unsigned char *in, size_t n, unsigned char *out, unsigned bsize, int codlev) {\
unsigned char *ip = in,*op;
for(op = out,out+=n; op < out;) { unsigned oplen = out - op,l;
if(oplen > bsize) oplen = bsize;
l = ctou32(ip);
ip += 4;
memcpy(ibuf,ip,l);
spdp_decompress(codlev, l, ibuf, op); ip += l;
op += oplen;
}
return ip - in;
}
#endif
//------------------------------------- Benchmark -------------------------------------------------------------------
#define ID_MEMCPY 120
unsigned char *bestr(unsigned id, unsigned b, unsigned char *s, char *prms, int prmi) {
static char *fmt[] = {
"%3d:000 ",
"%3d:p4nenc%d TurboPFor ", //1
"%3d:p4nenc128v%d TurboPForV ",
"%3d:p4nenc256v%d TurboPFor256 ",
"%3d:p4ndenc%d TurboPFor delta ",
"%3d:p4ndenc128v%d TurboPForV delta ",
"%3d:p4ndenc256v%d TurboPFor256 delta ",
"%3d:p4nd1enc%d TurboPFor delta1 ",
"%3d:p4nd1enc128v%d TurboPForV delta1 ",
"%3d:p4nd1enc256v%d TurboPFor256 delta1 ",
"%3d:p4nzenc%d TurboPFor zigzag ", //10
"%3d:p4nzenc128v%d TurboPForV zigzag ",
"%3d:p4nzenc256v%d TurboPFor256 zigzag ",
"%3d:p4nzzenc128v%d TurboPFor zzag/delta",
"%3d:bics32 Interpolative Cod. S",
"%3d:bic32 Interpolative Cod. L",
"%3d:bicm32 Interpolative Cod. M",
"%3d:17 ",
"%3d:18 ",
"%3d:19 ",
"%3d:bitnpack%d TurboPack ", //20
"%3d:bitnpack128v%d TurboPackV ",
"%3d:bitnpack256v%d TurboPack256 ",
"%3d:bitndpack%d TurboPack delta ",
"%3d:bitndpack128v%d TurboPackV delta ",
"%3d:bitndpack256v%d TurboPack256 delta ",
"%3d:bitnd1pack%d TurboPack delta1 ",
"%3d:bitnd1pack128v%d TurboPackV delta1 ",
"%3d:bitnd1pack256v%d TurboPack256 delta1 ",
"%3d:bitnzpack%d TurboPack zigzag ",
"%3d:bitnzpack128v%d TurboPackV zigzag ", //30
"%3d:bitnzpack256v%d TurboPack256 zigzag ",
"%3d:bitnfpack%d TurboPack FOR ",
"%3d:bitnfpack128v%d TurboPackV FOR ",
"%3d:bitnfpack256v%d TurboPack256 FOR ",
"%3d:bitns1pack128v32 TurboPack256 delt4_1",
"%3d:36 ",
"%3d:37 ",
"%3d:vsenc%d TurboVSimple ",
"%3d:vszenc%d TurboVSimple zigzag ",
"%3d:vbenc%d TurboVByte scalar ", //40
"%3d:vbzenc%d TurboVByte zigzag ",
"%3d:vbdenc%d TurboVByte delta ",
"%3d:vbd1enc%d TurboVByte delta1 ",
"%3d:vbddenc%d TurboVByte zzag delt",
"%3d:v8enc%d TurboByte SIMD ",
"%3d:v8denc%d TurboByte delta ",
"%3d:v8d1enc%d TurboByte delta1 ",
"%3d:v8xenc%d TurboByte xor ",
"%3d:v8zenc%d TurboByte zigzag ",
"%3d:v8nenc128v%d TurboByte+TbPackV ", //50 //TurboByte Hybrid
"%3d:v8nzenc128v%d TByte+TPackV zigzag ",
"%3d:v8ndenc128v%d TByte+TPackV delta ",
"%3d:v8nd1enc128v%d TByte+TPackV delta1 ",
"%3d:54 ",
"%3d:v8nenc256v%d TurboByte+TbPackV ",
"%3d:v8nzenc256v%d TByte+TPackV zigzag ",
"%3d:v8ndenc256v%d TByte+TPackV delta ",
"%3d:v8nd1enc256v%d TByte+TPackV delta1 ",
"%3d:59 ",
"%3d:bvzzenc%d bitio zigzag/delta ", //60
"%3d:bvzenc%d bitio zigzag ",
"%3d:fpgenc%d bitio TurboGorilla ",
"%3d:63 ",
"%3d:64 ", //"fphenc%d slope predictor",
"%3d:fpxenc%d TurboFloat XOR ", //bvzaenc%d moving average pred.",
"%3d:fpfcmenc%d TurboFloat FCM ",
"%3d:fpdfcmenc%d TurboFloat DFCM ",
"%3d:fp2dfcmenc%d TurboFloat DFCM 2D ",
"%3d:69 ",
"%3d:trle TurboRLE ", //70
"%3d:trlex TurboRLE xor ",
"%3d:trlez TurboRLE zigzag ",
"%3d:srle%d TurboRLE ESC ",
"%3d:srlex%d TurboRLE ESC xor ",
"%3d:srlez%d TurboRLE ESC zigzag ",
"%3d:76 ",
"%3d:77 ",
"%3d:78 ",
"%3d:79 ",
"%3d:Lz %s,%d ", //80
"%3d:Lztp Byte Transpose+%s,%d ",
"%3d:Lztpx Byte Transpose+xor+%s,%d ",
"%3d:Lztpz Byte Transpose+zzag+%s,%d ",
"%3d:Lztp4 Nibble Transpose+%s,%d ",
"%3d:Lztp4x Nibble Transpose+xor+%s,%d ",
"%3d:Lztp4z Nibble Transpose+zigzag+%s,%d ",
"%3d:Lztp1 Bit Bitshuffle+%s,%d ",
"%3d:Lztp1x Bit Bitshuffle+xor+%s,%d ",
"%3d:Lztp1z Bit Bitshuffle+zigzag+%s,%d",
"%3d:lztprle Transpose+rle+%s,%d ", //90
"%3d:lztprlex Transpose+xor+rle+%s,%d",
"%3d:lztprlez Transpose+zzg+rle+%s,%d",
"%3d:lzv8enc TurboByte+%s,%d ",
"%3d:lzv8xenc TurboByte+xor+%s,%d ",
"%3d:lzv8zenc TurboByte+zzag+%s,%d ",
"%3d:96 ",
"%3d:97 ",
"%3d:98 ",
"%3d:99 ",
"%3d:LztpD2byte 2D Transpose+%s,%d ", //100
"%3d:LztpxD2byte 2D Transpose+xor+%s,%d ",
"%3d:LztpzD2byte 2D Transpose+zzag+%s,%d",
"%3d:LztpD3byte 3D Transpose+%s,%d ",
"%3d:LztpxD3byte 3D Transpose+xor+%s,%d ",
"%3d:LztpzD3byte 3D Transpose+zzag+%s,%d",
"%3d:LztpD4byte 4D Transpose+%s,%d ",
"%3d:LztpxD4byte 4D Transpose+xor+%s,%d ",
"%3d:LztpzD4byte 4D Transpose+zzag+%s,%d",
"%3d:SPDP SPDP Floating Point ",
"%3d:streamvbyte StreamVByte SIMD ", //110
"%3d:streamvbyte delt StreamVByte delta ",
"%3d:streamvbyte zzag StreamVByte zigzag ",
"%3d:maskeydvbyte MasedVByte SIMD ",
"%3d:FastPFor FastPFor ",
"%3d:SimdFastPFor FastPFor SIMD ",
"%3d:SimdOptPFor FastPFor SIMD ",
"%3d:tpenc Byte transpose ",
"%3d:tp4enc Nibble transpose ",
"%3d:bitshuffle Bit transpose ",
"%3d:memcpy memcpy ", //120
"%3d:vtenc VTEnc lib ",
"%3d:vbz vbz (nanopore) "
};
#define CID_BEG 76
#define CID_END 108
if(id >= CID_BEG && id <= CID_END)
sprintf(s,fmt[id], id, prms, prmi);
else
sprintf(s,fmt[id], id, b, prms, prmi);
return s;
}
//------------------------ Floating point statistics ------------------------------------------------------------------
//#define BR(b) (double)(((double)(b)*100.0)/(double)(n*abs(s)*8))
#define BR(b) (((b)/8)*100.0/(double)(n*esize))
void fpstat(unsigned char *in, size_t n, unsigned char *out, int s) {
double imin = DBL_MAX, imax = DBL_MIN, isum = 0, //original data (input) : minimum,maximum,sum
eamin = DBL_MAX, eamax = DBL_MIN, easum = 0, easumsqr = 0, //absolute error : abs(input-output)
ermin = DBL_MAX, ermax = DBL_MIN, ersum = 0, ersumsqr = 0, //relative error : abs(input-output)/abs(input)
osum = 0; //transformed lossy data (output) : sum
unsigned long long xtb = 0, xlb = 0, tb = 0, lb = 0, elb=0, mtb=0;
size_t idn = 0;
unsigned char *ip, *op;
unsigned esize = s<0?-s:s,t;
long long mant = 0,m;
int expo = 0,e;
for(ip = in, op = out; ip < in+n*esize; ip += esize, op += esize)
switch(s) {
case -4: isum += ctof32(ip); osum += ctof32(op); break;
case -8: isum += ctof64(ip); osum += ctof64(op); break;
case 1: isum += ctou8( ip); osum += ctou8( op); break;
case 2: isum += ctou16(ip); osum += ctou16(op); break;
case 4: isum += ctou32(ip); osum += ctou32(op); break;
case 8: isum += ctou64(ip); osum += ctou64(op); break;
}
double iavg = isum/n, oavg = osum/n, isumpavg = 0, osumpavg = 0, iosumpavg = 0; uint64_t start = 0;
#define EXPO32(u) ((u>>23 & 0xff) - 0x7e )
#define EXPO64(u) ((u>>52 & 0x7ff) - 0x3fe)
#define MANT32(u) (u & 0x807fffffu)
#define MANT64(u) (u & 0x800fffffffffffffull)
#define U(s) TEMPLATE3(uint, s, _t) u = TEMPLATE2(ctou,s)(op);\
t = TEMPLATE2(ctz,s)(u); tb += t; if(u) lb += TEMPLATE2(clz,s)(u); AC(t<=s,"Fatal t=%d ", t); \
start ^= u; t = TEMPLATE2(ctz,s)(start); xtb += t; if(start) xlb += TEMPLATE2(clz,s)(start); start = u
for(ip = in, op = out; ip < in+n*esize; ip += esize, op += esize) {
double id, od;
switch(s) {
case -4: { id = ctof32(ip); od = ctof32(op); U(32); e = EXPO32(u); expo = clz32(zigzagenc32(e-expo))/*-(32-(32-MANTF32-1))*/; elb+=expo; expo = e;
m = MANT32(u); mant = ctz32( m^mant) ; mtb+=mant; mant = m;//ctz32(zigzagenc32(m-mant))
} break;
case -8: { id = ctof64(ip); od = ctof64(op); U(64); e = EXPO64(u); expo = clz32(zigzagenc32(e-expo))/*-(32-(64-MANTF64-1))*/; elb+=expo; expo = e;
m = MANT64(u); mant = ctz64( m^mant) ; mtb+=mant; mant = m;//ctz64(zigzagenc64(m-mant))
} break;
case 1: { id = ctou8( ip); od = ctou8( op); U( 8);} break;
case 2: { id = ctou16(ip); od = ctou16(op); U(16);} break;
case 4: { id = ctou32(ip); od = ctou32(op); U(32);} break;
case 8: { id = ctou64(ip); od = ctou64(op); U(64);} break;
}
imax = max(id, imax);
imin = min(id, imin);
double ea = fabs(id - od); eamax = max(eamax,ea); eamin = min(eamin,ea); easum += ea; easumsqr += ea*ea; // absolute error
if(id) { idn++;
double er = ea/fabs(id); ermax = max(ermax,er); ermin = min(ermin,er); ersum += er; ersumsqr += er*er; // relative error
}
isumpavg += (id - iavg)*(id - iavg);
osumpavg += (od - oavg)*(od - oavg);
iosumpavg += (id - iavg)*(od - oavg); //bits += ctz64(ctou64(&od)) - ctz64(ctou64(&id));
}
double fb = 0;
if(s == -4) fb = (double)elb*100/((double)n*8);
else if(s == -8) fb = (double)elb*100/((double)n*11);
double mse = easumsqr/n, irange = imax - imin;
//printf("Leading/Trailing bits [%.2f%%,%.2f%%=%.2f%%]. XOR[%.2f%%,%.2f%%=%.2f%%] Zigzag[%.2f%%,%.2f%%=%.2f%%]\n", BR(lb), BR(tb), BR(lb+tb), BR(xlb), BR(xtb), BR(xlb+xtb), BR(elb), BR(mtb), BR(elb+mtb) );