53     u16     windowPos;                 // Initial position of the history window.
54     u16     windowLen;                 // Length of the history window.
63 static u8          SearchLZ   ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset…
88 …u16     lastOffset;                // Offset to matching data (the longest matching data at the ti…  in CXCompressLZ()
174 static u8 SearchLZ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset )  in SearchLZ()
178     u16     maxOffset;  in SearchLZ()
183     const u16 windowPos = info->windowPos;  in SearchLZ()
184     const u16 windowLen = info->windowLen;  in SearchLZ()
241             maxOffset = (u16)(nextp - searchp);  in SearchLZ()
264     u16     i;  in LZInitTable()
286     u16     insert_offset;  in SlideByte()
291     const u16 windowPos = info->windowPos;  in SlideByte()
292     const u16 windowLen = info->windowLen;  in SlideByte()
322         info->windowPos = (u16)((windowPos + 1) % 0x1000);  in SlideByte()
481     u16 No;                            // Data No.
484     u16 PaDepth;                       // Parent node depth
485     u16 LeafDepth;                     // Depth to leaf
489 …u16 HWord;                         // For each intermediate node, the amount of memory needed to s…
497     u16 leftNodeNo;                    // The left child node No.
498     u16 rightNodeNo;                   // Right child node no.
513 static void HuffInitTable( HuffCompressionInfo* info, void* work, u16 dataNum );
515 static u16  HuffConstructTree( HuffData* table, u32 dataNum );
518 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );
519 static void HuffAddCodeToTable       ( HuffData *table, u16 nodeNo, u32 paHuffCode );
520 static u8   HuffAddCountHWordToTable ( HuffData *table, u16 nodeNo );
522 static void HuffMakeHuffTree             ( HuffCompressionInfo* info, u16 rootNo );
523 static void HuffMakeSubsetHuffTree       ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeF…
525 static void HuffSetOneNodeOffset         ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeF…
547     u16 rootNo;                        // Binary tree's root No.  in CXCompressHuffman()
548     u16 huffDataNum  = (u16)(1 << huffBitSize);      // 8->256, 4->16  in CXCompressHuffman()
581     for ( i = 0; i < (u16)( (info.huffTreeTop + 1) * 2 ); i++ )  // Tree table  in CXCompressHuffman()
620 static void HuffInitTable( HuffCompressionInfo* info, void* work, u16 dataNum )  in HuffInitTable()
636             table[ i ].No = (u16)i;  in HuffInitTable()
697 static u16 HuffConstructTree( HuffData *table, u32 dataNum )  in HuffConstructTree()
701     u16     tableTop = (u16)dataNum; // When creating table, the table top No.  in HuffConstructTree()
702     u16     rootNo;                  // Binary tree's root No.  in HuffConstructTree()
703     u16     nodeNum;                 // Number of valid nodes  in HuffConstructTree()
768             nodeNum = (u16)( (rootNo - dataNum + 1) * 2 + 1 );  in HuffConstructTree()
778             table[ tableTop ].LeafDepth = (u16)( table[ leftNo ].LeafDepth + 1 );  in HuffConstructTree()
782             table[ tableTop ].LeafDepth = (u16)( table[ rightNo ].LeafDepth + 1 );  in HuffConstructTree()
789         HuffAddParentDepthToTable( table, (u16)leftNo, (u16)rightNo );  in HuffConstructTree()
807 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo )  in HuffAddParentDepthToTable()
814 …  HuffAddParentDepthToTable( table, (u16)table[ leftNo  ].ChNo[0], (u16)table[ leftNo  ].ChNo[1] );  in HuffAddParentDepthToTable()
818 …  HuffAddParentDepthToTable( table, (u16)table[ rightNo ].ChNo[0], (u16)table[ rightNo ].ChNo[1] );  in HuffAddParentDepthToTable()
825 static void HuffAddCodeToTable( HuffData* table, u16 nodeNo, u32 paHuffCode )  in HuffAddCodeToTable()
831         HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[0], (u16)table[ nodeNo ].HuffCode );  in HuffAddCodeToTable()
832         HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[1], (u16)table[ nodeNo ].HuffCode );  in HuffAddCodeToTable()
840 static u8 HuffAddCountHWordToTable( HuffData *table, u16 nodeNo)  in HuffAddCountHWordToTable()
852         leftHWord  = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[0] );  in HuffAddCountHWordToTable()
853         rightHWord = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[1] );  in HuffAddCountHWordToTable()
857     table[ nodeNo ].HWord = (u16)( leftHWord + rightHWord + 1 );  in HuffAddCountHWordToTable()
865 static void HuffMakeHuffTree( HuffCompressionInfo* info, u16 rootNo )  in HuffMakeHuffTree()
970                 u16 tmp = 0;  in HuffMakeHuffTree()
998 static void HuffMakeSubsetHuffTree( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag )  in HuffMakeSubsetHuffTree()
1078 static void HuffSetOneNodeOffset( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag )  in HuffSetOneNodeOffset()
1080     u16 nodeNo;  in HuffSetOneNodeOffset()
1109 …     huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u16)huffTable[ nodeNo ].ChNo[0];  // Offset required  in HuffSetOneNodeOffset()
1122 …     huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u16)huffTable[ nodeNo ].ChNo[1]; // Offset required  in HuffSetOneNodeOffset()