-
Notifications
You must be signed in to change notification settings - Fork 57
/
codebooks.c
1743 lines (1421 loc) · 46.8 KB
/
codebooks.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
/*! @file cobebooks.c
* @brief Variable Length Coding tools
*
* @version 1.0.0
*
* (C) Copyright 2017 GoPro Inc (http://gopro.com/).
*
* Licensed under either:
* - Apache License, Version 2.0, http://www.apache.org/licenses/LICENSE-2.0
* - MIT license, http://opensource.org/licenses/MIT
* at your option.
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#ifndef _CODEBOOKS
#define _CODEBOOKS 1
#endif
#include <assert.h>
#include <emmintrin.h>
#include "codebooks.h"
#include "codec.h"
#include "vlc.h"
#include "allocator.h"
#ifndef DEBUG
#define DEBUG (1 && _DEBUG)
#endif
#define TIMING (1 && _TIMING)
#if _CODEBOOKS
#include "table9.inc"
#include "fsm9.inc"
//#include "fsm9x.inc"
static RMCBOOK rmctable9 = { (RLCBOOK *)&table9z, (VLCBOOK *)&table9m };
//static RMCBOOK rmctable9computed = { NULL, NULL };
CODESET cs9 = {
"Codebook set 9 from data by David with tables automatically generated for FSM decoder",
(VLCBOOK *)&table9m,
(RLCBOOK *)&table9z,
(unsigned int *)&table9s,
&rmctable9,
//&rmctable9computed,
NULL,NULL,
(RLVBOOK *)&table9r,
NULL,
NULL,
(FSMTABLE *)&fsm9,
(FSMARRAY *)&fsm9_init,
0
};
#if CODEC_NUM_CODESETS >= 2
#include "table17.inc"
#include "fsm17.inc"
static RMCBOOK rmctable17 = { (RLCBOOK *)&table17z, (VLCBOOK *)&table17m };
//static RMCBOOK rmctable17computed = { NULL, NULL };
CODESET cs17 = {
"Codebook set 17 from data by David with tables automatically generated for FSM decoder",
(VLCBOOK *)&table17m,
(RLCBOOK *)&table17z,
(unsigned int *)&table17s,
&rmctable17,
//&rmctable17computed,
NULL, NULL,
(RLVBOOK *)&table17r,
NULL,
NULL,
(FSMTABLE *)&fsm17,
(FSMARRAY *)&fsm17_init,
// FSMTABLE_FLAGS_COMPANDING_NOT_NEEDED
FSMTABLE_FLAGS_COMPANDING_CUBIC
};
#endif //CODEC_NUM_CODESETS >= 2
#if CODEC_NUM_CODESETS >= 3
#include "table18.inc" // 17 used in linear form
#include "fsm18.inc"
static RMCBOOK rmctable18 = { (RLCBOOK *)&table18z, (VLCBOOK *)&table18m };
//static RMCBOOK rmctable18computed = { NULL, NULL };
CODESET cs18 = {
"Codebook set 18 from data by David with tables automatically generated for FSM decoder",
(VLCBOOK *)&table18m,
(RLCBOOK *)&table18z,
(unsigned int *)&table18s,
&rmctable18,
//&rmctable18computed,
NULL, NULL,
(RLVBOOK *)&table18r,
NULL,
NULL,
(FSMTABLE *)&fsm18,
(FSMARRAY *)&fsm18_init,
FSMTABLE_FLAGS_COMPANDING_NOT_NEEDED
// FSMTABLE_FLAGS_COMPANDING_CUBIC
};
#endif //CODEC_NUM_CODESETS == 3
// Certain markers must use codebook bit patterns that are reserved for markers so
// that the marker is not confused for the encoded run lengths in the bitstream.
// Must change the following codebook of markers when the codeset is changed.
// Replacement for the run length codebook
#ifndef NEW_CODEBOOK_LENGTH
#define NEW_CODEBOOK_LENGTH 3072
//#define NEW_CODEBOOK_LENGTH 1024
//#define NEW_CODEBOOK_LENGTH 512
#endif
//DAN20150731
typedef struct newcodestruct {
int length;
RLC entries[NEW_CODEBOOK_LENGTH];
} newcodes;
/* DAN20150731
static struct {
int length;
RLC entries[NEW_CODEBOOK_LENGTH];
} newcodes[CODEC_NUM_CODESETS];//DAN20041024 = {NEW_CODEBOOK_LENGTH};
*/
// Lookup table for faster decoding
#define LOOKUP_TABLE_SIZE 12
/* DAN20150731
static struct {
int size;
int length;
FLC entries[1 << LOOKUP_TABLE_SIZE];
} fastbook[CODEC_NUM_CODESETS];//DAN20041024 = {LOOKUP_TABLE_SIZE, (1 << LOOKUP_TABLE_SIZE)};
*/
//DAN20150731
typedef struct fastbookstruct {
int size;
int length;
FLC entries[1 << LOOKUP_TABLE_SIZE];
} fastbook;
// Indexable table for signed values
/* DAN20150731
static struct {
int size;
int length;
VLC entries[VALUE_TABLE_LENGTH];
} valuebook[CODEC_NUM_CODESETS];//DAN20041024 = {VALUE_TABLE_SIZE, VALUE_TABLE_LENGTH};
*/
//DAN20150731
typedef struct valuebookstruct {
int size;
int length;
VLC entries[VALUE_TABLE_LENGTH];
} valuebook;
#endif
// Forward reference
void DumpFSM(DECODER *decoder);
// Compute the number of leading zeros
static int NumLeadingZeros(int number, int size)
{
int num_zeros;
if (number < 0) return 0;
for (num_zeros = size; number > 0; num_zeros--) {
if (num_zeros == 0) break;
number = (number >> 1);
}
return num_zeros;
}
// Initialize the codebooks in a codeset
#if _ALLOCATOR
bool InitCodebooks(ALLOCATOR *allocator, CODESET *cs)
#else
bool InitCodebooks(CODESET *cs)
#endif
{
int i=0;
for(i=0; i<CODEC_NUM_CODESETS; i++)
{
// Has the sparse runs codebook been replaced by the indexable codebook?
if (cs[i].codebook_magbook == NULL || cs[i].codebook_runbook == NULL)
{
#if _ALLOCATOR
newcodes *newcodes = (struct newcodestruct *)Alloc(allocator, sizeof(struct newcodestruct));
fastbook *fastbook = (struct fastbookstruct *)Alloc(allocator, sizeof(struct fastbookstruct));
valuebook *valuebook = (struct valuebookstruct *)Alloc(allocator, sizeof(struct valuebookstruct));
#else
newcodes *newcodes = (struct newcodestruct *)MEMORY_ALLOC(sizeof(struct newcodestruct));
fastbook *fastbook = (struct fastbookstruct *)MEMORY_ALLOC(sizeof(struct fastbookstruct));
valuebook *valuebook = (struct valuebookstruct *)MEMORY_ALLOC(sizeof(struct valuebookstruct));
#endif
if (newcodes == NULL || fastbook == NULL || valuebook == NULL)
return false;
{
// Initialize the indexable table of run length codes
RLE *old_codes = (RLE *)(((char *)cs[i].src_codebook->runbook) + sizeof(RLCBOOK));
RLC *new_codes = &newcodes->entries[0];
int old_length = cs[i].src_codebook->runbook->length;
int new_length = newcodes->length = NEW_CODEBOOK_LENGTH; //DAN20041024
// Get the codebook entry for an isolated zero
VLC *code = (VLC *)(((char *)cs[i].magsbook) + sizeof(VLCBOOK));
uint32_t zero = code->bits;
int size = code->size;
// Create a more efficient codebook for encoding runs of zeros
#if _ALLOCATOR
ComputeRunLengthCodeTable(allocator,
old_codes, old_length,
new_codes, new_length,
zero, size);
#else
ComputeRunLengthCodeTable(old_codes, old_length, new_codes, new_length, zero, size);
#endif
// Replace the old codebook in the codeset
cs[i].codebook_magbook = (VLCBOOK *)cs[i].src_codebook->magbook;
cs[i].codebook_runbook = (RLCBOOK *)newcodes;
}
memset((void *)fastbook, 0, sizeof(fastbook)); //DAN20150818
{
int length = cs[i].runsbook->length;
RLV *codebook = (RLV *)(((char *)cs[i].runsbook) + sizeof(RLVBOOK));
//fastbook *fastbook = (struct fastbookstruct *)cs[i]->fastbook;
//DAN20150731 fastbook[i].size = LOOKUP_TABLE_SIZE;//DAN20041024
//DAN20150731 fastbook[i].length = (1 << LOOKUP_TABLE_SIZE);//DAN20041024
fastbook->size = LOOKUP_TABLE_SIZE;
fastbook->length = (1 << LOOKUP_TABLE_SIZE);
// Create the fast lookup table from the codebook
#if _OLD_FAST_LOOKUP
// Use the old fast lookup table algorithms
FillCodeLookupTable(codebook, length, fastbook->entries, LOOKUP_TABLE_SIZE);
#else
// Use the new fast lookup table algorithms
FillScanLookupTable(codebook, length, fastbook->entries, LOOKUP_TABLE_SIZE);
#endif
}
{
//valuebook *valuebook = (struct valuebookstruct *)cs[i]->valuebook;
#if USE_UNPACKED_VLC
VLCBOOK *codebook = cs[i]->magsbook;
VLC *table = (VLC *)(((char *)valuebook) + sizeof(VALBOOK));
int size = valuebook->size = VALUE_TABLE_SIZE;
valuebook->length = VALUE_TABLE_LENGTH;
FillVlcTable(codebook, table, size, cs[i]->flags);
#else
VLCBOOK *codebook = cs[i].magsbook;
VLE *table = (VLE *)(((char *)valuebook) + sizeof(VALBOOK));
int size = valuebook->size = VALUE_TABLE_SIZE;
valuebook->length = VALUE_TABLE_LENGTH;
FillVleTable(codebook, table, size, cs[i].flags);
#endif
}
cs[i].fastbook = (FLCBOOK *)fastbook;
cs[i].valuebook = (VALBOOK *)valuebook;
}
}
// The codebooks have been initialized successfully
return true;
}
// Initialize the codebooks in a codeset
bool InitDecoderFSM(DECODER *decoder, CODESET *cs)
{
// Initialize the finite state machine tables for this codeset
// Note that the finite state machine is reset by the decoder
int i;
for (i = 0; i<CODEC_NUM_CODESETS; i++)
{
if (decoder)
{
if (decoder->fsm[i].table.flags >= 0)
{
// Should be zero states if the table has not been initialized
assert(decoder->fsm[i].table.num_states == 0);
#if _INDIVIDUAL_LUT
if (!FillFSM(decoder, &decoder->fsm[i].table, cs[i].fsm_array)) {
//decoder->error = CODEC_ERROR_INIT_FSM;
// The subroutine has already set the error code
return false;
}
//cs->fsm->next_state = cs->fsm->entries[0];
#else
if (!FillFSM(decoder, &decoder->fsm[i].table, cs[i].fsm_array)) {
//decoder->error = CODEC_ERROR_INIT_FSM;
// The subroutine has already set the error code
return false;
}
//cs->fsm->next_state = cs->fsm->entries;
#endif
decoder->fsm[i].table.flags |= cs[i].flags;
#if _COMPANDING
ScaleFSM(&decoder->fsm[i].table);
#endif
// Indicate that the table was initialized
decoder->fsm[i].table.flags |= FSMTABLE_FLAGS_INITIALIZED;
}
//
{
int pos = cs[i].tagsbook[0]-1;// The last code in the tagsbook in the band_end_code
decoder->band_end_code[i] = (unsigned int)cs[i].tagsbook[pos*2+2];
decoder->band_end_size[i] = (int)cs[i].tagsbook[pos*2+1];
}
// Check that the finite state machine table was initialized
assert(decoder->fsm[i].table.num_states > 0);
}
}
#if 0
if (decoder) {
DumpFSM(decoder);
}
#endif
return true;
}
// Free all data structures allocated for the codebooks
void FreeCodebooks(DECODER *decoder /*, CODESET *cs */)
{
int i;
for (i = 0; i < CODEC_NUM_CODESETS; i++)
{
FSMTABLE *fsm_table = &decoder->fsm[i].table;
//int num_states = fsm_table->num_states;
//int j;
// Check the number of finite state machine states
assert(0 < fsm_table->num_states && fsm_table->num_states <= FSM_NUM_STATES_MAX);
#if _FSM_NO_POINTERS==0
// Free the finite state machine tables
for (j = 0; j < num_states; j++)
{
if (fsm_table->entries[j] != NULL)
{
#if _ALLOCATOR
Free(decoder->allocator, fsm_table->entries[j]);
#else
MEMORY_ALIGNED_FREE(fsm_table->entries[j]);
#endif
fsm_table->entries[j] = NULL;
}
}
#endif
// Indicate that the finite state machine has not been initialized
fsm_table->flags = 0;
}
}
#if _ALLOCATOR
void ComputeRunLengthCodeTable(ALLOCATOR *allocator,
RLE *input_codes, int input_length,
RLC *output_codes, int output_length,
uint32_t zero_code, int zero_size)
#else
void ComputeRunLengthCodeTable(RLE *input_codes, int input_length,
RLC *output_codes, int output_length,
uint32_t zero_code, int zero_size)
#endif
{
// Need enough space for the codebook and the code for a single value
int length = input_length + 1;
size_t size = length * sizeof(RLC);
#if _ALLOCATOR
RLC *codebook = (RLC *)Alloc(allocator, size);
#else
RLC *codebook = (RLC *)MEMORY_ALLOC(size);
#endif
bool onerun = false;
int i;
// Copy the codes into the temporary codebook for sorting
length = input_length;
for (i = 0; i < length; i++) {
int count = input_codes[i].count;
if (count == 1) onerun = true;
codebook[i].size = input_codes[i].size;
codebook[i].bits = input_codes[i].bits;
codebook[i].count = count;
// Check the codebook entry
assert(codebook[i].size > 0);
assert(codebook[i].count > 0);
}
// Need to add a code for a single run?
if (!onerun) {
codebook[length].size = zero_size;
codebook[length].bits = zero_code;
codebook[length].count = 1;
length++;
}
// Sort the codewords into decreasing run length
SortDecreasingRunLength(codebook, length);
// The last code must be for a single run
assert(codebook[length - 1].count == 1);
// Fill the lookup table with codes for runs indexed by the run length
FillRunLengthCodeTable(codebook, length, output_codes, output_length);
// Free the space used for the sorted codewords
#if _ALLOCATOR
Free(allocator, codebook);
#else
MEMORY_FREE(codebook);
#endif
}
// Sort codebook into decreasing length of the run
void SortDecreasingRunLength(RLC *codebook, int length)
{
int i;
int j;
// Perform a simple bubble sort since the codebook may already be sorted
for (i = 0; i < length; i++)
{
for (j = i+1; j < length; j++)
{
// Should not have more than one codebook entry with the same run length
assert(codebook[i].count != codebook[j].count);
// Exchange codebook entries if the current entry is smaller
if (codebook[i].count < codebook[j].count)
{
int size = codebook[i].size;
uint32_t bits = codebook[i].bits;
int count = codebook[i].count;
codebook[i].size = codebook[j].size;
codebook[i].bits = codebook[j].bits;
codebook[i].count = codebook[j].count;
codebook[j].size = size;
codebook[j].bits = bits;
codebook[j].count = count;
}
}
// After two iterations that last two items should be in the proper order
assert(i == 0 || codebook[i-1].count > codebook[i].count);
}
}
// Use a sparse run length code table to create an indexable table for faster encoding
void FillRunLengthCodeTable(RLC *codebook, int codebook_length, RLC *table, int table_length)
{
int i; // Index into the lookup table
int j; // Index into the codebook
// Use all of the bits except the sign bit for the codewords
int max_code_size = BITSTREAM_LONG_SIZE - 1;
// Check that the input codes are sorted into decreasing run length
for (j = 1; j < codebook_length; j++) {
RLC *previous = &codebook[j-1];
RLC *current = &codebook[j];
assert(previous->count > current->count);
if (!(previous->count > current->count)) return;
}
// The last input code should be the code for a single zero
assert(codebook[codebook_length - 1].count == 1);
// Create the shortest codeword for each table entry
for (i = 0; i < table_length; i++)
{
int length = i; // Length of the run for this table entry
uint32_t codeword = 0; // Composite codeword for this run length
int codesize = 0; // Number of bits in the composite codeword
int remaining; // Remaining run length not covered by the codeword
remaining = length;
for (j = 0; j < codebook_length; j++)
{
int repetition; // Number of times the codeword is used
int k;
// Nothing to do if the remaining run length is zero
if (remaining == 0) break;
// The number of times that the codeword is used is the number
// of times that it divides evenly into the remaining run length
repetition = remaining / codebook[j].count;
// Append the codes to the end of the composite codeword
for (k = 0; k < repetition; k++)
{
// Terminate the loop if the codeword will not fit
if (codebook[j].size > (max_code_size - codesize))
{
if(codesize)
// 2/12/02 - DAN - code change so that longer runs aren't filled with single zeros to fill the table bits - slightly inefficent
{
remaining -= (k * codebook[j].count);
goto next;
}
else
{
break;
}
}
// Shift the codeword to make room for the appended codes
codeword <<= codebook[j].size;
// Insert the codeword from the codebook at the end of the composite codeword
codeword |= codebook[j].bits;
// Increment the number of bits in the composite codeword
codesize += codebook[j].size;
}
// Reduce the run length by the amount that was consumed by the repeated codeword
remaining -= (k * codebook[j].count);
}
next:
// Should have covered the entire run if the last codeword would fit
//assert(remaining == 0 || (max_code_size - codesize) < codebook[codebook_length - 1].size);
// Store the composite run length in the lookup table
table[i].bits = codeword;
table[i].size = codesize;
table[i].count = length - remaining;
}
}
// Compute a fast lookup table for decoding the bitstream
void FillCodeLookupTable(RLV *codebook, int length, FLC *table, int size)
{
// Compute the number of entries in the lookup table
int num_entries = 1 << size;
int i, j;
// Initialize the table with the null entry
for (i = 0; i < num_entries; i++) {
table[i].count = 0;
table[i].shift = 0;
table[i].value = 0;
}
// Fill each table entry using the codeword for that index
for (i = 0; i < num_entries; i++)
{
// Find the shortest codeword for each table index
for (j = 0; j < length; j++)
{
uint32_t codeword = codebook[j].bits;
int codesize = codebook[j].size;
uint32_t prefix;
int shift;
// Skip this entry if the codeword length exceeds the table size
if (codesize > size) continue;
// Get the leading bits corresponding to the current index
shift = size - codesize;
assert(shift >= 0);
if (shift > 0) prefix = (i >> shift);
else prefix = i;
// Does the prefix match the codeword?
if (prefix == codeword)
{
// Does this table index correspond to a run of zeros?
if (codeword == 0 &&
codesize == 1 &&
codebook[j].count == 1 &&
codebook[j].value == 0)
{
int num_zeros = NumLeadingZeros(i, size);
table[i].count = num_zeros;
table[i].value = 0;
table[i].shift = num_zeros;
}
else
{
// Fill the lookup table entry using the codebook entry
table[i].count = codebook[j].count;
table[i].value = codebook[j].value;
table[i].shift = codesize;
}
// Finished searching the codebook
break;
}
}
// Advance to the next entry in the lookup table
}
// Fill the unused entries with information for faster decoding
for (i = 0; i < num_entries; i++) {
if (table[i].count == 0)
{
// Table entry should be unfilled before the following loop
assert(table[i].shift == 0 || table[i].shift == size);
// Find the first code that has this code as a prefix
for (j = 0; j < length; j++)
{
uint32_t codeword = codebook[j].bits;
int codesize = codebook[j].size;
uint32_t prefix;
int unseen; // Codeword bits after the look ahead bits
int index = i; // Codeword bits in the lookup table index
// Look for the codeword that was too int32_t for the lookup table
if (codesize <= size) continue;
// Get the leading bits corresponding to the current index
unseen = codesize - size;
assert(unseen > 0);
prefix = (codeword >> unseen);
// First codeword prefix equal to the index?
if (prefix == (uint32_t)index) {
table[i].value = j; // Save the index to this codeword
table[i].shift = size; // Remember the length of the prefix
break;
}
}
// Should have exited loop after filling an unused entry
assert(table[i].shift == size);
}
}
}
// Scan a bit string right justified in the word for a match in the codebook
int MatchBitPattern(uint32_t word, int width, RLV *codebook, int length, FLC *match)
{
uint32_t bits; // Bits that have been scanned
int size = 0; // Number of bits scanned
int i = 0; // Index into the codebook
// A null bit string always fails to match the codebook
if (width == 0) goto failure;
// Remove any excess bits on the left
word &= BITMASK(width);
// Search the codebook for a match to the leading bits in the pattern
while (i < length) {
int codesize = codebook[i].size;
// Not enough bits in the word?
if (codesize > width) goto failure;
// Need to get more bits from the word?
if (size < codesize) {
bits = word >> (width - codesize);
size = codesize;
}
// Examine the run length table entries that have the same bit field length
for (; (i < length) && (size == codebook[i].size); i++) {
if (bits == codebook[i].bits)
{
int value = codebook[i].value;
if (value != 0) {
int sign;
// Something is wrong if the value is already negative
assert(value > 0);
// Check that the sign codes have the same length
assert(VLC_POSITIVE_SIZE == VLC_NEGATIVE_SIZE);
// Compute the size of the matching bit string including the sign
size += VLC_NEGATIVE_SIZE;
// Enough bits left to determine the sign?
if (size > width) goto failure;
// Get the sign
sign = (word >> (width - size)) & BITMASK(VLC_NEGATIVE_SIZE);
// Change the sign if the sign bit was negative
if (sign == VLC_NEGATIVE_CODE)
value = (-value);
}
match->count = codebook[i].count;
match->value = value;
match->shift = size;
goto success;
}
}
}
failure:
// Did not find a matching code in the codebook
match->count = 0;
match->value = 0;
match->shift = 0;
return VLC_ERROR_NOTFOUND;
success:
// Found a matching code and already set the output values
return VLC_ERROR_OKAY;
}
// Compute a fast lookup table for finding signed values in the bitstream
void FillScanLookupTable(RLV *codebook, int length, FLC *table, int size)
{
// Compute the number of entries in the lookup table
int num_entries = 1 << size;
int i, j;
// Initialize the table with the null entry
for (i = 0; i < num_entries; i++) {
table[i].count = 0;
table[i].shift = 0;
table[i].value = 0;
}
// Fill each table entry using the codeword for that index
for (i = 0; i < num_entries; i++)
{
uint32_t codeword = i; // Bit pattern corresponding to this table index
int codesize = size; // Size of the bit pattern
int count = 0; // Number of leading zeros plus the signed value
int shift = 0; // Number of bits including the signed value
int value = 0; // First signed value in the bit pattern
while (value == 0 && codesize > 0)
{
FLC match; // Information on the matching codeword
// Test the bit pattern for a match in the codebook
int result = MatchBitPattern(codeword, codesize, codebook, length, &match);
// Failed to find a match in the codebook?
if (result != VLC_ERROR_OKAY) break;
// Cannot handle runs of nonzero values
assert(match.count == 1 || match.value == 0);
// Reduce the codeword size by the number of bits scanned
codesize -= match.shift;
// Increase the count of the number of bits until a value is found
shift += match.shift;
// Increase the count (run length) of values matched in the bit pattern
count += match.count;
// Remember the value that was matched
value = match.value;
}
// Found a value in the bit pattern?
if (shift > 0) {
table[i].count = count;
table[i].value = value;
table[i].shift = shift;
}
// Advance to the next entry in the lookup table
}
// Fill the unused entries with information for faster decoding
for (i = 0; i < num_entries; i++) {
if (table[i].count == 0)
{
// Table entry should be unfilled before the following loop
assert(table[i].shift == 0);
// Find the first code that has this code as a prefix
for (j = 0; j < length; j++)
{
uint32_t prefix;
int unseen; // Codeword bits after the look ahead bits
int index = i; // Codeword bits in the lookup table index
// Look for the codeword that was too int32_t for the lookup table
// but in the new algorithm must include the sign that follows
//if (codesize <= size) continue;
// Is this codeword for the magnitude of a signed quantity?
if (codebook[j].value == 0)
{
uint32_t codeword = codebook[j].bits;
int codesize = codebook[j].size;
// The codeword for a run of zeros should be too int32_t for the lookup table
if (codesize <= size) continue;
// Get the leading bits corresponding to the current index
unseen = codesize - size;
assert(unseen > 0);
prefix = (codeword >> unseen);
// First codeword prefix equal to the index?
if (prefix == (uint32_t)index) {
table[i].value = j; // Save the index to this codeword
table[i].shift = size; // Remember the length of the prefix
break;
}
}
else
{
// Try the codeword with a positive sign appended
if ((codebook[j].size + VLC_POSITIVE_SIZE) > size)
{
uint32_t codeword = (codebook[j].bits << VLC_POSITIVE_SIZE) | VLC_POSITIVE_CODE;
int codesize = codebook[j].size + VLC_POSITIVE_SIZE;
// The codeword for the signed value should be too int32_t for the lookup table
if (codesize <= size) continue;
// Get the leading bits corresponding to the current index
unseen = codesize - size;
assert(unseen > 0);
prefix = (codeword >> unseen);
// First codeword prefix equal to the index?
if (prefix == (uint32_t)index) {
table[i].value = j; // Save the index to this codeword
table[i].shift = size; // Remember the length of the prefix
break;
}
}
// Try the codeword with a negative sign appended
if ((codebook[j].size + VLC_NEGATIVE_SIZE) > size)
{
uint32_t codeword = (codebook[j].bits << VLC_NEGATIVE_SIZE) | VLC_NEGATIVE_CODE;
int codesize = codebook[j].size + VLC_NEGATIVE_SIZE;
// The codeword for the signed value should be too int32_t for the lookup table
if (codesize <= size) continue;
// Get the leading bits corresponding to the current index
unseen = codesize - size;
assert(unseen > 0);
prefix = (codeword >> unseen);
// First codeword prefix equal to the index?
if (prefix == (uint32_t)index) {
table[i].value = j; // Save the index to this codeword
table[i].shift = size; // Remember the length of the prefix
break;
}
}
}
}
// Should have exited loop after filling an unused entry
assert(table[i].shift == size);
}
}
}
// Fill lookup table indexed by a signed value that is used as an unsigned index
void FillVlcTable(VLCBOOK *codebook, VLC *table, int size, int flags)
{
// Get the length of the codebook and a pointer to the entries
int codebook_length = codebook->length;
int32_t maximum_codebook_value = codebook_length - 1;
VLC *code = (VLC *)((char *)codebook + sizeof(VLCBOOK));
// Convert the index size (in bits) to the number of entries in the lookup table
int table_length = (size > 0) ? (1 << size) : 0;
int sign_mask = (1 << (size - 1));
int twos_complement = -sign_mask;
int magnitude_mask = sign_mask - 1;
int index;
int lastmag = 0;
int cubictable[1025];
if(flags & FSMTABLE_FLAGS_COMPANDING_CUBIC)
{
for(index = 0; index<1025; index++)
cubictable[index] = 0;
for(index = 1; index<256; index++)
{
double cubic = index;
int mag = 0;
//int i;
mag = index;
cubic *= index;
cubic *= index;
cubic *= 768;
cubic /= 256*256*256;
mag += (int)cubic;
if(mag > 1023) mag = 1023;
cubictable[mag] = index;
}
lastmag = 0;
for(index = 0; index<1025; index++)
{
if(cubictable[index])
lastmag = cubictable[index];
else
cubictable[index] = lastmag;
}
}
// Fill each table entry with the codeword for that (signed) value
for (index = 0; index < table_length; index++)
{
// Compute the signed value that corresponds to this index
int value = (index & sign_mask) ? (twos_complement + (index & magnitude_mask)) : index;
int magnitude = abs(value);
uint32_t codeword;
int codesize;
if(flags & FSMTABLE_FLAGS_COMPANDING_CUBIC)
{
magnitude = cubictable[magnitude];
}
else if(flags & FSMTABLE_FLAGS_COMPANDING_NOT_NEEDED)
{
}
else // old style
{
#if _COMPANDING
if (magnitude >= 40)
{
magnitude -= 40;
magnitude += 2; // mid point rounding
magnitude >>= 2;
magnitude += 40;
#if _COMPANDING_MORE
if(magnitude >= _COMPANDING_MORE)
{
magnitude -= _COMPANDING_MORE;
magnitude += 2; // mid point rounding
magnitude >>= 2;