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

  /external/lzma/Java/SevenZip/Compression/LZMA/
Decoder.java 30 for (int posState = 0; posState < m_NumPosStates; posState++)
32 m_LowCoder[posState].Init();
33 m_MidCoder[posState].Init();
38 public int Decode(SevenZip.Compression.RangeCoder.Decoder rangeDecoder, int posState) throws IOException
41 return m_LowCoder[posState].Decode(rangeDecoder);
44 symbol += m_MidCoder[posState].Decode(rangeDecoder);
215 int posState = (int)nowPos64 & m_PosStateMask;
216 if (m_RangeDecoder.DecodeBit(m_IsMatchDecoders, (state << Base.kNumPosStatesBitsMax) + posState) == 0)
    [all...]
Encoder.java 177 for (int posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++)
179 _lowCoder[posState] = new BitTreeEncoder(Base.kNumLowLenBits);
180 _midCoder[posState] = new BitTreeEncoder(Base.kNumMidLenBits);
188 for (int posState = 0; posState < numPosStates; posState++)
190 _lowCoder[posState].Init();
191 _midCoder[posState].Init();
    [all...]
  /external/lzma/CS/7zip/Compress/LZMA/
LzmaDecoder.cs 22 for (uint posState = m_NumPosStates; posState < numPosStates; posState++)
24 m_LowCoder[posState] = new BitTreeDecoder(Base.kNumLowLenBits);
25 m_MidCoder[posState] = new BitTreeDecoder(Base.kNumMidLenBits);
33 for (uint posState = 0; posState < m_NumPosStates; posState++)
35 m_LowCoder[posState].Init();
36 m_MidCoder[posState].Init();
    [all...]
LzmaEncoder.cs 177 for (UInt32 posState = 0; posState < Base.kNumPosStatesEncodingMax; posState++)
179 _lowCoder[posState] = new RangeCoder.BitTreeEncoder(Base.kNumLowLenBits);
180 _midCoder[posState] = new RangeCoder.BitTreeEncoder(Base.kNumMidLenBits);
188 for (UInt32 posState = 0; posState < numPosStates; posState++)
190 _lowCoder[posState].Init();
191 _midCoder[posState].Init();
    [all...]
  /external/chromium_org/third_party/lzma_sdk/
LzmaEnc.c 733 static void LenEnc_Encode(CLenEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState)
738 RcTree_Encode(rc, p->low + (posState << kLenNumLowBits), kLenNumLowBits, symbol);
746 RcTree_Encode(rc, p->mid + (posState << kLenNumMidBits), kLenNumMidBits, symbol - kLenNumLowSymbols);
756 static void LenEnc_SetPrices(CLenEnc *p, UInt32 posState, UInt32 numSymbols, UInt32 *prices, UInt32 *ProbPrices)
767 prices[i] = a0 + RcTree_GetPrice(p->low + (posState << kLenNumLowBits), kLenNumLowBits, i, ProbPrices);
773 prices[i] = b0 + RcTree_GetPrice(p->mid + (posState << kLenNumMidBits), kLenNumMidBits, i - kLenNumLowSymbols, ProbPrices);
779 static void MY_FAST_CALL LenPriceEnc_UpdateTable(CLenPriceEnc *p, UInt32 posState, UInt32 *ProbPrices)
781 LenEnc_SetPrices(&p->p, posState, p->tableSize, p->prices[posState], ProbPrices);
782 p->counters[posState] = p->tableSize
    [all...]
LzmaDec.c 158 unsigned posState = processedPos & pbMask;
160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
216 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
267 probLen = prob + LenLow + (posState << kLenNumLowBits);
278 probLen = prob + LenMid + (posState << kLenNumMidBits);
500 unsigned posState = (p->processedPos) & ((1 << p->prop.pb) - 1);
502 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
560 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
603 probLen = prob + LenLow + (posState << kLenNumLowBits);
614 probLen = prob + LenMid + (posState << kLenNumMidBits)
    [all...]
  /external/chromium_org/third_party/ots/third_party/lzma_sdk/
LzmaEnc.c 734 static void LenEnc_Encode(CLenEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState)
739 RcTree_Encode(rc, p->low + (posState << kLenNumLowBits), kLenNumLowBits, symbol);
747 RcTree_Encode(rc, p->mid + (posState << kLenNumMidBits), kLenNumMidBits, symbol - kLenNumLowSymbols);
757 static void LenEnc_SetPrices(CLenEnc *p, UInt32 posState, UInt32 numSymbols, UInt32 *prices, UInt32 *ProbPrices)
768 prices[i] = a0 + RcTree_GetPrice(p->low + (posState << kLenNumLowBits), kLenNumLowBits, i, ProbPrices);
774 prices[i] = b0 + RcTree_GetPrice(p->mid + (posState << kLenNumMidBits), kLenNumMidBits, i - kLenNumLowSymbols, ProbPrices);
780 static void MY_FAST_CALL LenPriceEnc_UpdateTable(CLenPriceEnc *p, UInt32 posState, UInt32 *ProbPrices)
782 LenEnc_SetPrices(&p->p, posState, p->tableSize, p->prices[posState], ProbPrices);
783 p->counters[posState] = p->tableSize
    [all...]
LzmaDec.c 159 unsigned posState = processedPos & pbMask;
161 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
217 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
268 probLen = prob + LenLow + (posState << kLenNumLowBits);
279 probLen = prob + LenMid + (posState << kLenNumMidBits);
501 unsigned posState = (p->processedPos) & ((1 << p->prop.pb) - 1);
503 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
561 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
604 probLen = prob + LenLow + (posState << kLenNumLowBits);
615 probLen = prob + LenMid + (posState << kLenNumMidBits)
    [all...]
  /external/lzma/C/
LzmaEnc.c 733 static void LenEnc_Encode(CLenEnc *p, CRangeEnc *rc, UInt32 symbol, UInt32 posState)
738 RcTree_Encode(rc, p->low + (posState << kLenNumLowBits), kLenNumLowBits, symbol);
746 RcTree_Encode(rc, p->mid + (posState << kLenNumMidBits), kLenNumMidBits, symbol - kLenNumLowSymbols);
756 static void LenEnc_SetPrices(CLenEnc *p, UInt32 posState, UInt32 numSymbols, UInt32 *prices, UInt32 *ProbPrices)
767 prices[i] = a0 + RcTree_GetPrice(p->low + (posState << kLenNumLowBits), kLenNumLowBits, i, ProbPrices);
773 prices[i] = b0 + RcTree_GetPrice(p->mid + (posState << kLenNumMidBits), kLenNumMidBits, i - kLenNumLowSymbols, ProbPrices);
779 static void MY_FAST_CALL LenPriceEnc_UpdateTable(CLenPriceEnc *p, UInt32 posState, UInt32 *ProbPrices)
781 LenEnc_SetPrices(&p->p, posState, p->tableSize, p->prices[posState], ProbPrices);
782 p->counters[posState] = p->tableSize;
    [all...]
LzmaDec.c 158 unsigned posState = processedPos & pbMask;
160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
216 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
267 probLen = prob + LenLow + (posState << kLenNumLowBits);
278 probLen = prob + LenMid + (posState << kLenNumMidBits);
500 unsigned posState = (p->processedPos) & ((1 << p->prop.pb) - 1);
502 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
560 prob = probs + IsRep0Long + (state << kNumPosBitsMax) + posState;
603 probLen = prob + LenLow + (posState << kLenNumLowBits);
614 probLen = prob + LenMid + (posState << kLenNumMidBits);
    [all...]

Completed in 369 milliseconds