69     u16     windowPos;                 // Top position of the history window
70     u16     windowLen;                 // Length of the history window
79 static u32         SearchLZ   ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset…
104 …u16     lastOffset;                // Offset to matching data (the longest matching data at the ti…  in CXCompressLZImpl()
230 static u32 SearchLZ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset, u32 maxLe…  in SearchLZ()
234     u16     maxOffset;  in SearchLZ()
239     const u16 windowPos = info->windowPos;  in SearchLZ()
240     const u16 windowLen = info->windowLen;  in SearchLZ()
297             maxOffset = (u16)(nextp - searchp);  in SearchLZ()
320     u16     i;  in LZInitTable()
342     u16     insert_offset;  in SlideByte()
347     const u16 windowPos = info->windowPos;  in SlideByte()
348     const u16 windowLen = info->windowLen;  in SlideByte()
378         info->windowPos = (u16)((windowPos + 1) % 0x1000);  in SlideByte()
546     u16 No;                            // Data number
549     u16 PaDepth;                       // Parent node depth
550     u16 LeafDepth;                     // Depth to leaf
554 …u16 HWord;                         // For each intermediate node, the amount of memory needed to s…
562     u16 leftNodeNo;                    // The left child node's number
563     u16 rightNodeNo;                   // Right child node's number
578 static void HuffInitTable( HuffCompressionInfo* info, void* work, u16 dataNum );
580 static u16  HuffConstructTree( HuffData* table, u32 dataNum );
583 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );
584 static void HuffAddCodeToTable       ( HuffData *table, u16 nodeNo, u32 paHuffCode );
585 static u8   HuffAddCountHWordToTable ( HuffData *table, u16 nodeNo );
587 static void HuffMakeHuffTree             ( HuffCompressionInfo* info, u16 rootNo );
588 static void HuffMakeSubsetHuffTree       ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeF…
590 static void HuffSetOneNodeOffset         ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeF…
612     u16 rootNo;                        // Binary tree's root number  in CXCompressHuffman()
613     u16 huffDataNum  = (u16)(1 << huffBitSize);      // 8->256, 4->16  in CXCompressHuffman()
658     for ( i = 0; i < (u16)( (info.huffTreeTop + 1) * 2 ); i++ )  // Tree table  in CXCompressHuffman()
697 static void HuffInitTable( HuffCompressionInfo* info, void* work, u16 dataNum )  in HuffInitTable()
713             table[ i ].No = (u16)i;  in HuffInitTable()
774 static u16 HuffConstructTree( HuffData *table, u32 dataNum )  in HuffConstructTree()
778     u16     tableTop = (u16)dataNum; // The table top number at time of table's creation  in HuffConstructTree()
779     u16     rootNo;                  // Binary tree's root number  in HuffConstructTree()
780     u16     nodeNum;                 // Number of valid nodes  in HuffConstructTree()
845             nodeNum = (u16)( (rootNo - dataNum + 1) * 2 + 1 );  in HuffConstructTree()
855             table[ tableTop ].LeafDepth = (u16)( table[ leftNo ].LeafDepth + 1 );  in HuffConstructTree()
859             table[ tableTop ].LeafDepth = (u16)( table[ rightNo ].LeafDepth + 1 );  in HuffConstructTree()
866         HuffAddParentDepthToTable( table, (u16)leftNo, (u16)rightNo );  in HuffConstructTree()
884 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo )  in HuffAddParentDepthToTable()
891 …  HuffAddParentDepthToTable( table, (u16)table[ leftNo  ].ChNo[0], (u16)table[ leftNo  ].ChNo[1] );  in HuffAddParentDepthToTable()
895 …  HuffAddParentDepthToTable( table, (u16)table[ rightNo ].ChNo[0], (u16)table[ rightNo ].ChNo[1] );  in HuffAddParentDepthToTable()
902 static void HuffAddCodeToTable( HuffData* table, u16 nodeNo, u32 paHuffCode )  in HuffAddCodeToTable()
908         HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[0], table[ nodeNo ].HuffCode );  in HuffAddCodeToTable()
909         HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[1], table[ nodeNo ].HuffCode );  in HuffAddCodeToTable()
917 static u8 HuffAddCountHWordToTable( HuffData *table, u16 nodeNo)  in HuffAddCountHWordToTable()
929         leftHWord  = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[0] );  in HuffAddCountHWordToTable()
930         rightHWord = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[1] );  in HuffAddCountHWordToTable()
934     table[ nodeNo ].HWord = (u16)( leftHWord + rightHWord + 1 );  in HuffAddCountHWordToTable()
942 static void HuffMakeHuffTree( HuffCompressionInfo* info, u16 rootNo )  in HuffMakeHuffTree()
1047                 u16 tmp = 0;  in HuffMakeHuffTree()
1075 static void HuffMakeSubsetHuffTree( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag )  in HuffMakeSubsetHuffTree()
1155 static void HuffSetOneNodeOffset( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag )  in HuffSetOneNodeOffset()
1157     u16 nodeNo;  in HuffSetOneNodeOffset()
1186 …  huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u16)huffTable[ nodeNo ].ChNo[0];  // Offset is required  in HuffSetOneNodeOffset()
1199 …  huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u16)huffTable[ nodeNo ].ChNo[1]; // Offset is required  in HuffSetOneNodeOffset()