HomeSort by relevance Sort by last modified time
    Searched refs:kNumBitModelTotalBits (Results 1 - 12 of 12) sorted by null

  /external/lzma/CPP/7zip/Compress/
RangeCoderBit.h 12 const int kNumBitModelTotalBits = 11;
13 const UInt32 kBitModelTotal = (1 << kNumBitModelTotalBits);
31 Prob += (1 - symbol) << (kNumBitModelTotalBits - numMoveBits);
49 encoder->EncodeBit(this->Prob, kNumBitModelTotalBits, symbol);
52 UInt32 newBound = (encoder->Range >> kNumBitModelTotalBits) * this->Prob;
85 UInt32 newBound = (decoder->Range >> kNumBitModelTotalBits) * this->Prob;
  /external/lzma/CS/7zip/Compress/RangeCoder/
RangeCoderBit.cs 7 public const int kNumBitModelTotalBits = 11;
8 public const uint kBitModelTotal = (1 << kNumBitModelTotalBits);
27 // encoder.EncodeBit(Prob, kNumBitModelTotalBits, symbol);
29 uint newBound = (encoder.Range >> kNumBitModelTotalBits) * Prob;
52 const int kNumBits = (kNumBitModelTotalBits - kNumMoveReducingBits);
73 public const int kNumBitModelTotalBits = 11;
74 public const uint kBitModelTotal = (1 << kNumBitModelTotalBits);
91 uint newBound = (uint)(rangeDecoder.Range >> kNumBitModelTotalBits) * (uint)Prob;
  /external/lzma/Java/SevenZip/Compression/RangeCoder/
Decoder.java 8 static final int kNumBitModelTotalBits = 11;
9 static final int kBitModelTotal = (1 << kNumBitModelTotalBits);
57 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
Encoder.java 8 static final int kNumBitModelTotalBits = 11;
9 static final int kBitModelTotal = (1 << kNumBitModelTotalBits);
105 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
128 int kNumBits = (kNumBitModelTotalBits - kNumMoveReducingBits);
  /external/chromium_org/third_party/lzma_sdk/
Bcj2.c 18 #define kNumBitModelTotalBits 11
19 #define kBitModelTotal (1 << kNumBitModelTotalBits)
29 #define IF_BIT_0(p) ttt = *(p); bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
LzmaDec.c 11 #define kNumBitModelTotalBits 11
12 #define kBitModelTotal (1 << kNumBitModelTotalBits)
19 #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
49 #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
LzmaEnc.c 36 #define kNumBitModelTotalBits 11
37 #define kBitModelTotal (1 << kNumBitModelTotalBits)
555 UInt32 newBound = (p->range >> kNumBitModelTotalBits) * ttt;
619 ProbPrices[i >> kNumMoveReducingBits] = ((kNumBitModelTotalBits << kCyclesBits) - 15 - bitCount);
    [all...]
  /external/lzma/C/
Bcj2.c 18 #define kNumBitModelTotalBits 11
19 #define kBitModelTotal (1 << kNumBitModelTotalBits)
29 #define IF_BIT_0(p) ttt = *(p); bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
LzmaDec.c 11 #define kNumBitModelTotalBits 11
12 #define kBitModelTotal (1 << kNumBitModelTotalBits)
19 #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
49 #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
LzmaEnc.c 36 #define kNumBitModelTotalBits 11
37 #define kBitModelTotal (1 << kNumBitModelTotalBits)
555 UInt32 newBound = (p->range >> kNumBitModelTotalBits) * ttt;
619 ProbPrices[i >> kNumMoveReducingBits] = ((kNumBitModelTotalBits << kCyclesBits) - 15 - bitCount);
    [all...]
  /external/chromium_org/third_party/ots/third_party/lzma_sdk/
LzmaDec.c 12 #define kNumBitModelTotalBits 11
13 #define kBitModelTotal (1 << kNumBitModelTotalBits)
20 #define IF_BIT_0(p) ttt = *(p); NORMALIZE; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
50 #define IF_BIT_0_CHECK(p) ttt = *(p); NORMALIZE_CHECK; bound = (range >> kNumBitModelTotalBits) * ttt; if (code < bound)
LzmaEnc.c 37 #define kNumBitModelTotalBits 11
38 #define kBitModelTotal (1 << kNumBitModelTotalBits)
556 UInt32 newBound = (p->range >> kNumBitModelTotalBits) * ttt;
620 ProbPrices[i >> kNumMoveReducingBits] = ((kNumBitModelTotalBits << kCyclesBits) - 15 - bitCount);
    [all...]

Completed in 783 milliseconds