Home
last modified time | relevance | path

Searched refs:posStateNext (Results 1 – 4 of 4) sorted by relevance

/external/lzma/Java/SevenZip/Compression/LZMA/
DEncoder.java856 int posStateNext = (position + 1) & _posStateMask; in GetOptimum() local
858 …sion.RangeCoder.Encoder.GetPrice1(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]) + in GetOptimum()
865 0, lenTest2, state2, posStateNext); in GetOptimum()
916 int posStateNext = (position + lenTest) & _posStateMask; in GetOptimum() local
919 …sion.RangeCoder.Encoder.GetPrice0(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]) + in GetOptimum()
925 posStateNext = (position + lenTest + 1) & _posStateMask; in GetOptimum()
926 …ssion.RangeCoder.Encoder.GetPrice1(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]); in GetOptimum()
934 int curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
991 int posStateNext = (position + lenTest) & _posStateMask; in GetOptimum() local
993 …sion.RangeCoder.Encoder.GetPrice0(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]) + in GetOptimum()
[all …]
/external/lzma/CS/7zip/Compress/LZMA/
DLzmaEncoder.cs856 UInt32 posStateNext = (position + 1) & _posStateMask; in GetOptimum()
858 _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice1() + in GetOptimum()
865 0, lenTest2, state2, posStateNext); in GetOptimum()
916 UInt32 posStateNext = (position + lenTest) & _posStateMask; in GetOptimum()
919 _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice0() + in GetOptimum()
925 posStateNext = (position + lenTest + 1) & _posStateMask; in GetOptimum()
926 …AndLenCharPrice + _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice1(); in GetOptimum()
934 UInt32 curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
991 UInt32 posStateNext = (position + lenTest) & _posStateMask; in GetOptimum()
993 _isMatch[(state2.Index << Base.kNumPosStatesBitsMax) + posStateNext].GetPrice0() + in GetOptimum()
[all …]
/external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lzma/
DEncoder.java756 int posStateNext = (position + 1) & _posStateMask; in GetOptimum() local
759 .GetPrice1(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]) in GetOptimum()
765 int curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
807 int posStateNext = (position + lenTest) & _posStateMask; in GetOptimum() local
811 .GetPrice0(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]) in GetOptimum()
815 posStateNext = (position + lenTest + 1) & _posStateMask; in GetOptimum()
818 .GetPrice1(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]); in GetOptimum()
827 int curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
877 int posStateNext = (position + lenTest) & _posStateMask; in GetOptimum() local
880 .GetPrice0(_isMatch[(state2 << Base.kNumPosStatesBitsMax) + posStateNext]) in GetOptimum()
[all …]
/external/lzma/C/
DLzmaEnc.c1295 UInt32 posStateNext = (position + 1) & p->pbMask; in GetOptimum() local
1297 GET_PRICE_1(p->isMatch[state2][posStateNext]) + in GetOptimum()
1306 curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1366 UInt32 posStateNext = (position + lenTest) & p->pbMask; in GetOptimum() local
1369 GET_PRICE_0(p->isMatch[state2][posStateNext]) + in GetOptimum()
1373 posStateNext = (position + lenTest + 1) & p->pbMask; in GetOptimum()
1375 GET_PRICE_1(p->isMatch[state2][posStateNext]) + in GetOptimum()
1385 … curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1456 UInt32 posStateNext = (position + lenTest) & p->pbMask; in GetOptimum() local
1458 GET_PRICE_0(p->isMatch[state2][posStateNext]) + in GetOptimum()
[all …]