// // (C) Jan de Vaan 2007-2010, all rights reserved. See the accompanying "License.txt" for licensed use. // #ifndef CHARLS_SCAN #define CHARLS_SCAN #include "dcmtk/ofstd/ofmap.h" /* For OFPair */ #include "dcmtk/ofstd/oftypes.h" /* For OFTypename */ #include "dcmtk/ofstd/ofdiag.h" #include "lokuptbl.h" // This file contains the code for handling a "scan". Usually an image is encoded as a single scan. #include DCMTK_DIAGNOSTIC_IGNORE_CONST_EXPRESSION_WARNING extern CTable decodingTables[16]; extern OFVector rgquant8Ll; extern OFVector rgquant10Ll; extern OFVector rgquant12Ll; extern OFVector rgquant16Ll; // // Apply // inlinehint LONG ApplySign(LONG i, LONG sign) { return (sign ^ i) - sign; } // Two alternatives for GetPredictedValue() (second is slightly faster due to reduced branching) #if 0 inlinehint LONG GetPredictedValue(LONG Ra, LONG Rb, LONG Rc) { if (Ra < Rb) { if (Rc < Ra) return Rb; if (Rc > Rb) return Ra; } else { if (Rc < Rb) return Ra; if (Rc > Ra) return Rb; } return Ra + Rb - Rc; } #else inlinehint LONG GetPredictedValue(LONG Ra, LONG Rb, LONG Rc) { // sign trick reduces the number of if statements (branches) LONG sgn = BitWiseSign(Rb - Ra); // is Ra between Rc and Rb? if ((sgn ^ (Rc - Ra)) < 0) { return Rb; } else if ((sgn ^ (Rb - Rc)) < 0) { return Ra; } // default case, valid if Rc element of [Ra,Rb] return Ra + Rb - Rc; } #endif inlinehint LONG UnMapErrVal(LONG mappedError) { //LONG sign = ~((mappedError & 1) - 1); LONG sign = LONG(mappedError << (LONG_BITCOUNT-1)) >> (LONG_BITCOUNT-1); return sign ^ (mappedError >> 1); } inlinehint LONG GetMappedErrVal(LONG Errval) { LONG mappedError = (Errval >> (LONG_BITCOUNT-2)) ^ (2 * Errval); return mappedError; } inlinehint LONG ComputeContextID(LONG Q1, LONG Q2, LONG Q3) { return (Q1*9 + Q2)*9 + Q3; } // // // template class JlsCodec : public STRATEGY { public: typedef typename TRAITS::PIXEL PIXEL; typedef typename TRAITS::SAMPLE SAMPLE; public: JlsCodec(const TRAITS& inTraits, const JlsParameters& info) : STRATEGY(info), traits(inTraits), _rect(), _width(0), T1(0), T2(0), T3(0), _RUNindex(0), _pquant(0), _bCompare(0) { if (Info().ilv == ILV_NONE) { Info().components = 1; } } void SetPresets(const JlsCustomParameters& presets) { JlsCustomParameters presetDefault = ComputeDefault(traits.MAXVAL, traits.NEAR); InitParams(presets.T1 != 0 ? presets.T1 : presetDefault.T1, presets.T2 != 0 ? presets.T2 : presetDefault.T2, presets.T3 != 0 ? presets.T3 : presetDefault.T3, presets.RESET != 0 ? presets.RESET : presetDefault.RESET); } bool IsInterleaved() { if (Info().ilv == ILV_NONE) return false; if (Info().components == 1) return false; return true; } JlsParameters& Info() { return STRATEGY::_info; } signed char QuantizeGratientOrg(LONG Di); inlinehint LONG QuantizeGratient(LONG Di) { ASSERT(QuantizeGratientOrg(Di) == *(_pquant + Di)); return *(_pquant + Di); } void InitQuantizationLUT(); LONG DecodeValue(LONG k, LONG limit, LONG qbpp); inlinehint void EncodeMappedValue(LONG k, LONG mappedError, LONG limit); void IncrementRunIndex() { _RUNindex = MIN(31,_RUNindex + 1); } void DecrementRunIndex() { _RUNindex = MAX(0,_RUNindex - 1); } LONG DecodeRIError(CContextRunMode& ctx); Triplet DecodeRIPixel(Triplet Ra, Triplet Rb); SAMPLE DecodeRIPixel(LONG Ra, LONG Rb) { if (ABS(Ra - Rb) <= traits.NEAR) { LONG ErrVal = DecodeRIError(_contextRunmode[1]); return static_cast(traits.ComputeReconstructedSample(Ra, ErrVal)); } else { LONG ErrVal = DecodeRIError(_contextRunmode[0]); return static_cast(traits.ComputeReconstructedSample(Rb, ErrVal * Sign(Rb - Ra))); } } LONG DecodeRunPixels(PIXEL Ra, PIXEL* ptype, LONG cpixelMac); LONG DoRunMode(LONG index, DecoderStrategy*); void EncodeRIError(CContextRunMode& ctx, LONG Errval); SAMPLE EncodeRIPixel(LONG x, LONG Ra, LONG Rb) { if (ABS(Ra - Rb) <= traits.NEAR) { LONG ErrVal = traits.ComputeErrVal(x - Ra); EncodeRIError(_contextRunmode[1], ErrVal); return static_cast(traits.ComputeReconstructedSample(Ra, ErrVal)); } else { LONG ErrVal = traits.ComputeErrVal((x - Rb) * Sign(Rb - Ra)); EncodeRIError(_contextRunmode[0], ErrVal); return static_cast(traits.ComputeReconstructedSample(Rb, ErrVal * Sign(Rb - Ra))); } } Triplet EncodeRIPixel(Triplet x, Triplet Ra, Triplet Rb); void EncodeRunPixels(LONG runLength, bool bEndofline); LONG DoRunMode(LONG index, EncoderStrategy*); // Encode/decode a single sample. Performancewise the #1 important functions SAMPLE DoRegular(LONG Qs, LONG, LONG pred, DecoderStrategy*) { LONG sign = BitWiseSign(Qs); JlsContext& ctx = _contexts[ApplySign(Qs, sign)]; LONG k = ctx.GetGolomb(); LONG Px = traits.CorrectPrediction(pred + ApplySign(ctx.C, sign)); LONG ErrVal; const Code& code = decodingTables[k].Get(STRATEGY::PeekByte()); if (code.GetLength() != 0) { STRATEGY::Skip(code.GetLength()); ErrVal = code.GetValue(); ASSERT(ABS(ErrVal) < 65535); } else { ErrVal = UnMapErrVal(DecodeValue(k, traits.LIMIT, traits.qbpp)); if (ABS(ErrVal) > 65535) throw JlsException(InvalidCompressedData); } ErrVal = ErrVal ^ ((traits.NEAR == 0) ? ctx.GetErrorCorrection(k) : 0); ctx.UpdateVariables(ErrVal, traits.NEAR, traits.RESET); ErrVal = ApplySign(ErrVal, sign); return traits.ComputeReconstructedSample(Px, ErrVal); } SAMPLE DoRegular(LONG Qs, LONG x, LONG pred, EncoderStrategy*) { LONG sign = BitWiseSign(Qs); JlsContext& ctx = _contexts[ApplySign(Qs, sign)]; LONG k = ctx.GetGolomb(); LONG Px = traits.CorrectPrediction(pred + ApplySign(ctx.C, sign)); LONG ErrVal = traits.ComputeErrVal(ApplySign(x - Px, sign)); EncodeMappedValue(k, GetMappedErrVal(ctx.GetErrorCorrection(k | traits.NEAR) ^ ErrVal), traits.LIMIT); ctx.UpdateVariables(ErrVal, traits.NEAR, traits.RESET); ASSERT(traits.IsNear(traits.ComputeReconstructedSample(Px, ApplySign(ErrVal, sign)), x)); return static_cast(traits.ComputeReconstructedSample(Px, ApplySign(ErrVal, sign))); } void DoLine(SAMPLE* pdummy); void DoLine(Triplet* pdummy); void DoScan(BYTE **ptr, size_t *size, size_t offset); public: ProcessLine* CreateProcess(void* pvoidOut); void InitDefault(); void InitParams(LONG t1, LONG t2, LONG t3, LONG nReset); size_t EncodeScan(const void* rawData, BYTE **ptr, size_t *size, size_t offset, bool compare); size_t DecodeScan(void* rawData, const JlsRect& size, BYTE **buf, size_t *buf_size, size_t offset, bool bCompare); protected: // codec parameters TRAITS traits; JlsRect _rect; int _width; LONG T1; LONG T2; LONG T3; // compression context JlsContext _contexts[365]; CContextRunMode _contextRunmode[2]; LONG _RUNindex; PIXEL* _previousLine; // previous line ptr PIXEL* _currentLine; // current line ptr // quantization lookup table signed char* _pquant; OFVector _rgquant; // debugging bool _bCompare; }; // Functions to build tables used to decode short golomb codes. inlinehint OFPair CreateEncodedValue(LONG k, LONG mappedError) { LONG highbits = mappedError >> k; return OFMake_pair(highbits + k + 1, (LONG(1) << k) | (mappedError & ((LONG(1) << k) - 1))); } CTable InitTable(LONG k) { CTable table; short nerr; for (nerr = 0; ; nerr++) { // Q is not used when k != 0 LONG merrval = GetMappedErrVal(nerr);//, k, -1); OFPair paircode = CreateEncodedValue(k, merrval); if (paircode.first > CTable::cbit) break; Code code = Code( nerr, short(paircode.first) ); table.AddEntry(BYTE(paircode.second), code); } for (nerr = -1; ; nerr--) { // Q is not used when k != 0 LONG merrval = GetMappedErrVal(nerr);//, k, -1); OFPair paircode = CreateEncodedValue(k, merrval); if (paircode.first > CTable::cbit) break; Code code = Code(nerr, short(paircode.first)); table.AddEntry(BYTE(paircode.second), code); } return table; } // Encoding/decoding of golomb codes template LONG JlsCodec::DecodeValue(LONG k, LONG limit, LONG qbpp) { LONG highbits = STRATEGY::ReadHighbits(); if (highbits >= limit - (qbpp + 1)) return STRATEGY::ReadValue(qbpp) + 1; if (k == 0) return highbits; return (highbits << k) + STRATEGY::ReadValue(k); } template inlinehint void JlsCodec::EncodeMappedValue(LONG k, LONG mappedError, LONG limit) { LONG highbits = mappedError >> k; if (highbits < limit - traits.qbpp - 1) { if (highbits + 1 > 31) { STRATEGY::AppendToBitStream(0, highbits / 2); highbits = highbits - highbits / 2; } STRATEGY::AppendToBitStream(1, highbits + 1); STRATEGY::AppendToBitStream((mappedError & ((1 << k) - 1)), k); return; } if (limit - traits.qbpp > 31) { STRATEGY::AppendToBitStream(0, 31); STRATEGY::AppendToBitStream(1, limit - traits.qbpp - 31); } else { STRATEGY::AppendToBitStream(1, limit - traits.qbpp); } STRATEGY::AppendToBitStream((mappedError - 1) & ((1 << traits.qbpp) - 1), traits.qbpp); } // Sets up a lookup table to "Quantize" sample difference. template void JlsCodec::InitQuantizationLUT() { // for lossless mode with default parameters, we have precomputed te luts for bitcounts 8,10,12 and 16 if (traits.NEAR == 0 && traits.MAXVAL == (1 << traits.bpp) - 1) { JlsCustomParameters presets = ComputeDefault(traits.MAXVAL, traits.NEAR); if (presets.T1 == T1 && presets.T2 == T2 && presets.T3 == T3) { if (traits.bpp == 8) { _pquant = &rgquant8Ll[rgquant8Ll.size() / 2 ]; return; } if (traits.bpp == 10) { _pquant = &rgquant10Ll[rgquant10Ll.size() / 2 ]; return; } if (traits.bpp == 12) { _pquant = &rgquant12Ll[rgquant12Ll.size() / 2 ]; return; } if (traits.bpp == 16) { _pquant = &rgquant16Ll[rgquant16Ll.size() / 2 ]; return; } } } LONG RANGE = 1 << traits.bpp; _rgquant.resize(RANGE * 2); _pquant = &_rgquant[RANGE]; for (LONG i = -RANGE; i < RANGE; ++i) { _pquant[i] = QuantizeGratientOrg(i); } } template signed char JlsCodec::QuantizeGratientOrg(LONG Di) { if (Di <= -T3) return -4; if (Di <= -T2) return -3; if (Di <= -T1) return -2; if (Di < -traits.NEAR) return -1; if (Di <= traits.NEAR) return 0; if (Di < T1) return 1; if (Di < T2) return 2; if (Di < T3) return 3; return 4; } // RI = Run interruption: functions that handle the sample terminating a run. template LONG JlsCodec::DecodeRIError(CContextRunMode& ctx) { LONG k = ctx.GetGolomb(); LONG EMErrval = DecodeValue(k, traits.LIMIT - J[_RUNindex]-1, traits.qbpp); LONG Errval = ctx.ComputeErrVal(EMErrval + ctx._nRItype, k); ctx.UpdateVariables(Errval, EMErrval); return Errval; } template void JlsCodec::EncodeRIError(CContextRunMode& ctx, LONG Errval) { LONG k = ctx.GetGolomb(); bool map = ctx.ComputeMap(Errval, k); LONG EMErrval = 2 * ABS(Errval) - ctx._nRItype - map; ASSERT(Errval == ctx.ComputeErrVal(EMErrval + ctx._nRItype, k)); EncodeMappedValue(k, EMErrval, traits.LIMIT-J[_RUNindex]-1); ctx.UpdateVariables(Errval, EMErrval); } template Triplet JlsCodec::DecodeRIPixel(Triplet Ra, Triplet Rb) { LONG Errval1 = DecodeRIError(_contextRunmode[0]); LONG Errval2 = DecodeRIError(_contextRunmode[0]); LONG Errval3 = DecodeRIError(_contextRunmode[0]); return Triplet(traits.ComputeReconstructedSample(Rb.v1, Errval1 * Sign(Rb.v1 - Ra.v1)), traits.ComputeReconstructedSample(Rb.v2, Errval2 * Sign(Rb.v2 - Ra.v2)), traits.ComputeReconstructedSample(Rb.v3, Errval3 * Sign(Rb.v3 - Ra.v3))); } template Triplet JlsCodec::EncodeRIPixel(Triplet x, Triplet Ra, Triplet Rb) { LONG errval1 = traits.ComputeErrVal(Sign(Rb.v1 - Ra.v1) * (x.v1 - Rb.v1)); EncodeRIError(_contextRunmode[0], errval1); LONG errval2 = traits.ComputeErrVal(Sign(Rb.v2 - Ra.v2) * (x.v2 - Rb.v2)); EncodeRIError(_contextRunmode[0], errval2); LONG errval3 = traits.ComputeErrVal(Sign(Rb.v3 - Ra.v3) * (x.v3 - Rb.v3)); EncodeRIError(_contextRunmode[0], errval3); return Triplet(traits.ComputeReconstructedSample(Rb.v1, errval1 * Sign(Rb.v1 - Ra.v1)), traits.ComputeReconstructedSample(Rb.v2, errval2 * Sign(Rb.v2 - Ra.v2)), traits.ComputeReconstructedSample(Rb.v3, errval3 * Sign(Rb.v3 - Ra.v3))); } // RunMode: Functions that handle run-length encoding template void JlsCodec::EncodeRunPixels(LONG runLength, bool endOfLine) { while (runLength >= LONG(1 << J[_RUNindex])) { STRATEGY::AppendOnesToBitStream(1); runLength = runLength - LONG(1 << J[_RUNindex]); IncrementRunIndex(); } if (endOfLine) { if (runLength != 0) { STRATEGY::AppendOnesToBitStream(1); } } else { STRATEGY::AppendToBitStream(runLength, J[_RUNindex] + 1); // leading 0 + actual remaining length } } template LONG JlsCodec::DecodeRunPixels(PIXEL Ra, PIXEL* startPos, LONG cpixelMac) { LONG index = 0; while (STRATEGY::ReadBit()) { int count = MIN(1 << J[_RUNindex], int(cpixelMac - index)); index += count; ASSERT(index <= cpixelMac); if (count == (1 << J[_RUNindex])) { IncrementRunIndex(); } if (index == cpixelMac) break; } if (index != cpixelMac) { // incomplete run index += (J[_RUNindex] > 0) ? STRATEGY::ReadValue(J[_RUNindex]) : 0; } if (index > cpixelMac) throw JlsException(InvalidCompressedData); for (LONG i = 0; i < index; ++i) { startPos[i] = Ra; } return index; } template LONG JlsCodec::DoRunMode(LONG index, EncoderStrategy*) { LONG ctypeRem = _width - index; PIXEL* ptypeCurX = _currentLine + index; PIXEL* ptypePrevX = _previousLine + index; PIXEL Ra = ptypeCurX[-1]; LONG runLength = 0; while (traits.IsNear(ptypeCurX[runLength],Ra)) { ptypeCurX[runLength] = Ra; runLength++; if (runLength == ctypeRem) break; } EncodeRunPixels(runLength, runLength == ctypeRem); if (runLength == ctypeRem) return runLength; ptypeCurX[runLength] = EncodeRIPixel(ptypeCurX[runLength], Ra, ptypePrevX[runLength]); DecrementRunIndex(); return runLength + 1; } template LONG JlsCodec::DoRunMode(LONG startIndex, DecoderStrategy*) { PIXEL Ra = _currentLine[startIndex-1]; LONG runLength = DecodeRunPixels(Ra, _currentLine + startIndex, _width - startIndex); LONG endIndex = startIndex + runLength; if (endIndex == _width) return endIndex - startIndex; // run interruption PIXEL Rb = _previousLine[endIndex]; _currentLine[endIndex] = DecodeRIPixel(Ra, Rb); DecrementRunIndex(); return endIndex - startIndex + 1; } // DoLine: Encodes/Decodes a scanline of samples template void JlsCodec::DoLine(SAMPLE*) { LONG index = 0; LONG Rb = _previousLine[index-1]; LONG Rd = _previousLine[index]; while(index < _width) { LONG Ra = _currentLine[index -1]; LONG Rc = Rb; Rb = Rd; Rd = _previousLine[index + 1]; LONG Qs = ComputeContextID(QuantizeGratient(Rd - Rb), QuantizeGratient(Rb - Rc), QuantizeGratient(Rc - Ra)); if (Qs != 0) { _currentLine[index] = DoRegular(Qs, _currentLine[index], GetPredictedValue(Ra, Rb, Rc), (STRATEGY*)(NULL)); index++; } else { index += DoRunMode(index, (STRATEGY*)(NULL)); Rb = _previousLine[index-1]; Rd = _previousLine[index]; } } } // DoLine: Encodes/Decodes a scanline of triplets in ILV_SAMPLE mode template void JlsCodec::DoLine(Triplet*) { LONG index = 0; while(index < _width) { Triplet Ra = _currentLine[index -1]; Triplet Rc = _previousLine[index-1]; Triplet Rb = _previousLine[index]; Triplet Rd = _previousLine[index + 1]; LONG Qs1 = ComputeContextID(QuantizeGratient(Rd.v1 - Rb.v1), QuantizeGratient(Rb.v1 - Rc.v1), QuantizeGratient(Rc.v1 - Ra.v1)); LONG Qs2 = ComputeContextID(QuantizeGratient(Rd.v2 - Rb.v2), QuantizeGratient(Rb.v2 - Rc.v2), QuantizeGratient(Rc.v2 - Ra.v2)); LONG Qs3 = ComputeContextID(QuantizeGratient(Rd.v3 - Rb.v3), QuantizeGratient(Rb.v3 - Rc.v3), QuantizeGratient(Rc.v3 - Ra.v3)); if (Qs1 == 0 && Qs2 == 0 && Qs3 == 0) { index += DoRunMode(index, (STRATEGY*)(NULL)); } else { Triplet Rx; Rx.v1 = DoRegular(Qs1, _currentLine[index].v1, GetPredictedValue(Ra.v1, Rb.v1, Rc.v1), (STRATEGY*)(NULL)); Rx.v2 = DoRegular(Qs2, _currentLine[index].v2, GetPredictedValue(Ra.v2, Rb.v2, Rc.v2), (STRATEGY*)(NULL)); Rx.v3 = DoRegular(Qs3, _currentLine[index].v3, GetPredictedValue(Ra.v3, Rb.v3, Rc.v3), (STRATEGY*)(NULL)); _currentLine[index] = Rx; index++; } } } // DoScan: Encodes or decodes a scan. // In ILV_SAMPLE mode, multiple components are handled in DoLine // In ILV_LINE mode, a call do DoLine is made for every component // In ILV_NONE mode, DoScan is called for each component template void JlsCodec::DoScan(BYTE **ptr, size_t *size, size_t offset) { _width = Info().width; STRATEGY::Init(ptr, size, offset); LONG pixelstride = _width + 4; int components = Info().ilv == ILV_LINE ? Info().components : 1; OFVector vectmp(2 * components * pixelstride); OFVector rgRUNindex(components); for (LONG line = 0; line < Info().height; ++line) { _previousLine = &vectmp[1]; _currentLine = &vectmp[1 + components * pixelstride]; if ((line & 1) == 1) { PIXEL *tmp = _previousLine; _previousLine = _currentLine; _currentLine = tmp; } STRATEGY::OnLineBegin(_width, _currentLine, pixelstride); for (int component = 0; component < components; ++component) { _RUNindex = rgRUNindex[component]; // initialize edge pixels used for prediction _previousLine[_width] = _previousLine[_width - 1]; _currentLine[-1] = _previousLine[0]; DoLine((PIXEL*) NULL); // dummy arg for overload resolution rgRUNindex[component] = _RUNindex; _previousLine += pixelstride; _currentLine += pixelstride; } if (_rect.Y <= line && line < _rect.Y + _rect.Height) { STRATEGY::OnLineEnd(_rect.Width, _currentLine + _rect.X - (components * pixelstride), pixelstride); } } STRATEGY::EndScan(); } // Factory function for ProcessLine objects to copy/transform unencoded pixels to/from our scanline buffers. template ProcessLine* JlsCodec::CreateProcess(void* pvoidOut) { if (!IsInterleaved()) return new PostProcesSingleComponent(pvoidOut, Info(), sizeof(typename TRAITS::PIXEL)); if (Info().colorTransform == 0) return new ProcessTransformed >(pvoidOut, Info(), TransformNone()); if (Info().bitspersample == sizeof(SAMPLE)*8) { switch(Info().colorTransform) { case COLORXFORM_HP1 : return new ProcessTransformed >(pvoidOut, Info(), TransformHp1()); break; case COLORXFORM_HP2 : return new ProcessTransformed >(pvoidOut, Info(), TransformHp2()); break; case COLORXFORM_HP3 : return new ProcessTransformed >(pvoidOut, Info(), TransformHp3()); break; default: throw JlsException(UnsupportedColorTransform); } } else if (Info().bitspersample > 8) { int shift = 16 - Info().bitspersample; switch(Info().colorTransform) { case COLORXFORM_HP1 : return new ProcessTransformed > >(pvoidOut, Info(), TransformShifted >(shift)); break; case COLORXFORM_HP2 : return new ProcessTransformed > >(pvoidOut, Info(), TransformShifted >(shift)); break; case COLORXFORM_HP3 : return new ProcessTransformed > >(pvoidOut, Info(), TransformShifted >(shift)); break; default: throw JlsException(UnsupportedColorTransform); } } throw JlsException(UnsupportedBitDepthForTransform); } // Setup codec for encoding and calls DoScan template size_t JlsCodec::EncodeScan(const void* rawData, BYTE **ptr, size_t *size, size_t offset, bool compare) { STRATEGY::_processLine.reset(CreateProcess(const_cast(rawData))); if (compare) { STRATEGY::_qdecoder.reset(new JlsCodec(traits, Info())); STRATEGY::_qdecoder->Init(ptr, size, offset); } DoScan(ptr, size, offset); return STRATEGY::GetLength(); } // Setup codec for decoding and calls DoScan template size_t JlsCodec::DecodeScan(void* rawData, const JlsRect& rect, BYTE **ptr, size_t *size, size_t offset, bool bCompare) { STRATEGY::_processLine.reset(CreateProcess(rawData)); _bCompare = bCompare; BYTE rgbyte[20]; size_t readBytes = 0; ::memcpy(rgbyte, *ptr + offset + readBytes, 4); readBytes += 4; size_t cbyteScanheader = rgbyte[3] - 2; if (cbyteScanheader > sizeof(rgbyte)) throw JlsException(InvalidCompressedData); ::memcpy(rgbyte, *ptr + offset + readBytes, cbyteScanheader); readBytes += cbyteScanheader; _rect = rect; DoScan(ptr, size, offset + readBytes); return STRATEGY::GetCurBytePos() - (*ptr + offset); } // Initialize the codec data structures. Depends on JPEG-LS parameters like T1-T3. template void JlsCodec::InitParams(LONG t1, LONG t2, LONG t3, LONG nReset) { T1 = t1; T2 = t2; T3 = t3; InitQuantizationLUT(); LONG A = MAX(2, (traits.RANGE + 32)/64); for (unsigned int Q = 0; Q < sizeof(_contexts) / sizeof(_contexts[0]); ++Q) { _contexts[Q] = JlsContext(A); } _contextRunmode[0] = CContextRunMode(MAX(2, (traits.RANGE + 32)/64), 0, nReset); _contextRunmode[1] = CContextRunMode(MAX(2, (traits.RANGE + 32)/64), 1, nReset); _RUNindex = 0; } #endif