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
|
// Copyright 2014 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "JBig2_ArithDecoder.h"
#include "JBig2_BitStream.h"
#include "core/include/fxcrt/fx_basic.h"
namespace {
struct JBig2ArithQe {
unsigned int Qe;
unsigned int NMPS;
unsigned int NLPS;
unsigned int nSwitch;
};
const JBig2ArithQe kQeTable[] = {
// Stupid hack to keep clang-format from reformatting this badly.
{0x5601, 1, 1, 1},
{0x3401, 2, 6, 0},
{0x1801, 3, 9, 0},
{0x0AC1, 4, 12, 0},
{0x0521, 5, 29, 0},
{0x0221, 38, 33, 0},
{0x5601, 7, 6, 1},
{0x5401, 8, 14, 0},
{0x4801, 9, 14, 0},
{0x3801, 10, 14, 0},
{0x3001, 11, 17, 0},
{0x2401, 12, 18, 0},
{0x1C01, 13, 20, 0},
{0x1601, 29, 21, 0},
{0x5601, 15, 14, 1},
{0x5401, 16, 14, 0},
{0x5101, 17, 15, 0},
{0x4801, 18, 16, 0},
{0x3801, 19, 17, 0},
{0x3401, 20, 18, 0},
{0x3001, 21, 19, 0},
{0x2801, 22, 19, 0},
{0x2401, 23, 20, 0},
{0x2201, 24, 21, 0},
{0x1C01, 25, 22, 0},
{0x1801, 26, 23, 0},
{0x1601, 27, 24, 0},
{0x1401, 28, 25, 0},
{0x1201, 29, 26, 0},
{0x1101, 30, 27, 0},
{0x0AC1, 31, 28, 0},
{0x09C1, 32, 29, 0},
{0x08A1, 33, 30, 0},
{0x0521, 34, 31, 0},
{0x0441, 35, 32, 0},
{0x02A1, 36, 33, 0},
{0x0221, 37, 34, 0},
{0x0141, 38, 35, 0},
{0x0111, 39, 36, 0},
{0x0085, 40, 37, 0},
{0x0049, 41, 38, 0},
{0x0025, 42, 39, 0},
{0x0015, 43, 40, 0},
{0x0009, 44, 41, 0},
{0x0005, 45, 42, 0},
{0x0001, 45, 43, 0},
{0x5601, 46, 46, 0}};
const unsigned int kDefaultAValue = 0x8000;
int DecodeNMPS(JBig2ArithCtx* pCX, const JBig2ArithQe& qe) {
pCX->I = qe.NMPS;
return pCX->MPS;
}
int DecodeNLPS(JBig2ArithCtx* pCX, const JBig2ArithQe& qe) {
// TODO(thestig): |D|, |MPS| and friends probably should be booleans.
int D = 1 - pCX->MPS;
if (qe.nSwitch == 1)
pCX->MPS = 1 - pCX->MPS;
pCX->I = qe.NLPS;
return D;
}
} // namespace
CJBig2_ArithDecoder::CJBig2_ArithDecoder(CJBig2_BitStream* pStream)
: m_pStream(pStream) {
m_B = m_pStream->getCurByte_arith();
m_C = (m_B ^ 0xff) << 16;
BYTEIN();
m_C = m_C << 7;
m_CT = m_CT - 7;
m_A = kDefaultAValue;
}
CJBig2_ArithDecoder::~CJBig2_ArithDecoder() {
}
int CJBig2_ArithDecoder::DECODE(JBig2ArithCtx* pCX) {
if (!pCX || pCX->I >= FX_ArraySize(kQeTable))
return 0;
const JBig2ArithQe& qe = kQeTable[pCX->I];
m_A -= qe.Qe;
if ((m_C >> 16) < m_A) {
if (m_A & kDefaultAValue)
return pCX->MPS;
const int D = m_A < qe.Qe ? DecodeNLPS(pCX, qe) : DecodeNMPS(pCX, qe);
ReadValueA();
return D;
}
m_C -= m_A << 16;
const int D = m_A < qe.Qe ? DecodeNMPS(pCX, qe) : DecodeNLPS(pCX, qe);
m_A = qe.Qe;
ReadValueA();
return D;
}
void CJBig2_ArithDecoder::BYTEIN() {
unsigned char B1;
if (m_B == 0xff) {
B1 = m_pStream->getNextByte_arith();
if (B1 > 0x8f) {
m_CT = 8;
} else {
m_pStream->incByteIdx();
m_B = B1;
m_C = m_C + 0xfe00 - (m_B << 9);
m_CT = 7;
}
} else {
m_pStream->incByteIdx();
m_B = m_pStream->getCurByte_arith();
m_C = m_C + 0xff00 - (m_B << 8);
m_CT = 8;
}
}
void CJBig2_ArithDecoder::ReadValueA() {
do {
if (m_CT == 0)
BYTEIN();
m_A <<= 1;
m_C <<= 1;
--m_CT;
} while ((m_A & kDefaultAValue) == 0);
}
|
