OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kBitModelTotal
(Results
1 - 12
of
12
) sorted by null
/external/lzma/CPP/7zip/Compress/
RangeCoderBit.h
13
const UInt32
kBitModelTotal
= (1 << kNumBitModelTotalBits);
20
extern UInt32 ProbPrices[
kBitModelTotal
>> kNumMoveReducingBits];
34
Prob += (
kBitModelTotal
- Prob) >> numMoveBits;
39
void Init() { Prob =
kBitModelTotal
/ 2; }
56
this->Prob += (
kBitModelTotal
- this->Prob) >> numMoveBits;
72
return ProbPrices[(this->Prob ^ ((-(int)symbol)) & (
kBitModelTotal
- 1)) >> kNumMoveReducingBits];
75
UInt32 GetPrice1() const { return ProbPrices[(this->Prob ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]; }
89
this->Prob += (
kBitModelTotal
- this->Prob) >> numMoveBits;
/external/lzma/CS/7zip/Compress/RangeCoder/
RangeCoderBit.cs
8
public const uint
kBitModelTotal
= (1 << kNumBitModelTotalBits);
15
public void Init() { Prob =
kBitModelTotal
>> 1; }
20
Prob += (
kBitModelTotal
- Prob) >> kNumMoveBits;
33
Prob += (
kBitModelTotal
- Prob) >> kNumMoveBits;
48
private static UInt32[] ProbPrices = new UInt32[
kBitModelTotal
>> kNumMoveReducingBits];
65
return ProbPrices[(((Prob - symbol) ^ ((-(int)symbol))) & (
kBitModelTotal
- 1)) >> kNumMoveReducingBits];
68
public uint GetPrice1() { return ProbPrices[(
kBitModelTotal
- Prob) >> kNumMoveReducingBits]; }
74
public const uint
kBitModelTotal
= (1 << kNumBitModelTotalBits);
82
Prob += (
kBitModelTotal
- Prob) >> numMoveBits;
87
public void Init() { Prob =
kBitModelTotal
>> 1; }
[
all
...]
/external/lzma/Java/SevenZip/Compression/RangeCoder/
Encoder.java
9
static final int
kBitModelTotal
= (1 << kNumBitModelTotalBits);
99
probs[i] = (
kBitModelTotal
>>> 1);
109
probs[index] = (short)(prob + ((
kBitModelTotal
- prob) >>> kNumMoveBits));
124
private static int[] ProbPrices = new int[
kBitModelTotal
>>> kNumMoveReducingBits];
141
return ProbPrices[(((Prob - symbol) ^ ((-symbol))) & (
kBitModelTotal
- 1)) >>> kNumMoveReducingBits];
149
return ProbPrices[(
kBitModelTotal
- Prob) >>> kNumMoveReducingBits];
Decoder.java
9
static final int
kBitModelTotal
= (1 << kNumBitModelTotalBits);
61
probs[index] = (short)(prob + ((
kBitModelTotal
- prob) >>> kNumMoveBits));
86
probs[i] = (
kBitModelTotal
>>> 1);
/external/chromium_org/third_party/lzma_sdk/
Bcj2.c
19
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
30
#define UPDATE_0(p) range = bound; *(p) = (CProb)(ttt + ((
kBitModelTotal
- ttt) >> kNumMoveBits)); NORMALIZE;
49
p[i] =
kBitModelTotal
>> 1;
LzmaEnc.c
37
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
39
#define kProbInitValue (
kBitModelTotal
>> 1)
285
UInt32 ProbPrices[
kBitModelTotal
>> kNumMoveReducingBits];
559
ttt += (
kBitModelTotal
- ttt) >> kNumMoveBits;
603
for (i = (1 << kNumMoveReducingBits) / 2; i <
kBitModelTotal
; i += (1 << kNumMoveReducingBits))
625
p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (
kBitModelTotal
- 1))) >> kNumMoveReducingBits];
628
ProbPrices[((prob) ^ ((-((int)(symbol))) & (
kBitModelTotal
- 1))) >> kNumMoveReducingBits];
631
#define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]
634
#define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]
[
all
...]
LzmaDec.c
12
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
20
#define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((
kBitModelTotal
- ttt) >> kNumMoveBits));
713
probs[i] =
kBitModelTotal
>> 1;
/external/lzma/C/
Bcj2.c
19
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
30
#define UPDATE_0(p) range = bound; *(p) = (CProb)(ttt + ((
kBitModelTotal
- ttt) >> kNumMoveBits)); NORMALIZE;
49
p[i] =
kBitModelTotal
>> 1;
LzmaEnc.c
37
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
39
#define kProbInitValue (
kBitModelTotal
>> 1)
285
UInt32 ProbPrices[
kBitModelTotal
>> kNumMoveReducingBits];
559
ttt += (
kBitModelTotal
- ttt) >> kNumMoveBits;
603
for (i = (1 << kNumMoveReducingBits) / 2; i <
kBitModelTotal
; i += (1 << kNumMoveReducingBits))
625
p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (
kBitModelTotal
- 1))) >> kNumMoveReducingBits];
628
ProbPrices[((prob) ^ ((-((int)(symbol))) & (
kBitModelTotal
- 1))) >> kNumMoveReducingBits];
631
#define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]
634
#define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]
[
all
...]
LzmaDec.c
12
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
20
#define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((
kBitModelTotal
- ttt) >> kNumMoveBits));
713
probs[i] =
kBitModelTotal
>> 1;
/external/chromium_org/third_party/ots/third_party/lzma_sdk/
LzmaEnc.c
38
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
40
#define kProbInitValue (
kBitModelTotal
>> 1)
286
UInt32 ProbPrices[
kBitModelTotal
>> kNumMoveReducingBits];
560
ttt += (
kBitModelTotal
- ttt) >> kNumMoveBits;
604
for (i = (1 << kNumMoveReducingBits) / 2; i <
kBitModelTotal
; i += (1 << kNumMoveReducingBits))
626
p->ProbPrices[((prob) ^ (((-(int)(symbol))) & (
kBitModelTotal
- 1))) >> kNumMoveReducingBits];
629
ProbPrices[((prob) ^ ((-((int)(symbol))) & (
kBitModelTotal
- 1))) >> kNumMoveReducingBits];
632
#define GET_PRICE_1(prob) p->ProbPrices[((prob) ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]
635
#define GET_PRICE_1a(prob) ProbPrices[((prob) ^ (
kBitModelTotal
- 1)) >> kNumMoveReducingBits]
[
all
...]
LzmaDec.c
13
#define
kBitModelTotal
(1 << kNumBitModelTotalBits)
21
#define UPDATE_0(p) range = bound; *(p) = (CLzmaProb)(ttt + ((
kBitModelTotal
- ttt) >> kNumMoveBits));
714
probs[i] =
kBitModelTotal
>> 1;
Completed in 86 milliseconds