Repository navigation
Expand file tree
/
Copy patharithmetic.h
More file actions
99 lines (90 loc) · 2.96 KB
/
Copy patharithmetic.h
File metadata and controls
99 lines (90 loc) · 2.96 KB
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
/*
* Copyright (c) 2011 - 2012, Simon Fraser University
* 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 the Simon Fraser University 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.
*/
/*
* Author : Ibrahim Numanagic
* Email : inumanag AT sfu DOT ca
* Last Update : 25. vii 2012.
*/
#ifndef ARITHMETIC_H__
#define ARITHMETIC_H__
#include "buffio.h"
#define AC_DEPTH 80
extern uint64_t ac_freq3[2][AC_DEPTH * AC_DEPTH], // 16K
ac_freq4[2][AC_DEPTH * AC_DEPTH * AC_DEPTH]; // 760k
void a_init_decoder(buffered_file *f);
void a_read(buffered_file *f, uint8_t *arr, int sz);
struct ac_stat {
uint64_t *acfq3, *acfq4;
uint32_t hi_fq[AC_DEPTH * AC_DEPTH][AC_DEPTH];
uint32_t lo_fq[AC_DEPTH * AC_DEPTH][AC_DEPTH];
ac_stat(){};
ac_stat(uint64_t *, uint64_t *);
};
class ac_coder {
private:
ac_stat *as;
uint32_t lo, hi, underflow, code;
uint32_t prev[3]; /* TODO once ...*/
uint8_t *ou, *os;
int buf_pos;
public:
ac_coder(uint8_t *, ac_stat *);
void O(int t);
void init();
void write(uint8_t *arr, int sz);
void flush();
void reset();
uint8_t *output() { return ou; }
};
class ac_decoder {
private:
ac_stat *as;
uint32_t lo, hi, code;
uint32_t prev[3];
uint8_t *in, *is;
int buf_pos;
public:
ac_decoder(ac_stat *, uint8_t *);
uint8_t I();
uint8_t read_single();
void read(uint8_t *, int);
void reset();
};
void ac_write(buffered_file *fo, uint8_t *data, int size);
void ac_read(buffered_file *fi, uint8_t *data, int size);
void set_ac_stat(uint64_t *a3, uint64_t *a4);
void ac_init();
void ac_finish();
#endif // ARITHMETIC_H__