Lines Matching refs:u16

34     u16     windowPos;                 // Initial position of the history window
35 u16 windowLen; // Length of the history window
43 u32 SearchLZ ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset, u32 m…
70u16 lastOffset; // Offset to matching data (the longest matching data at the ti… in CompressLZImpl()
198 u32 SearchLZ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset, u32 maxLength ) in SearchLZ()
202 u16 maxOffset = 0; in SearchLZ()
207 const u16 windowPos = info->windowPos; in SearchLZ()
208 const u16 windowLen = info->windowLen; in SearchLZ()
265 maxOffset = (u16)(nextp - searchp); in SearchLZ()
288 u16 i; in LZInitTable()
310 u16 insert_offset; in SlideByte()
315 const u16 windowPos = info->windowPos; in SlideByte()
316 const u16 windowLen = info->windowLen; in SlideByte()
346 info->windowPos = (u16)((windowPos + 1) % 0x1000); in SlideByte()
518 u16 No; // Data number
521 u16 PaDepth; // Parent node depth
522 u16 LeafDepth; // Depth to leaf
526u16 HWord; // For each intermediate node, the amount of memory needed to s…
534 u16 leftNodeNo; // The left child node number
535 u16 rightNodeNo; // Right child node number
550 void HuffInitTable( HuffCompressionInfo* info, void* work, u16 dataNum );
552 u16 HuffConstructTree( HuffData* table, u32 dataNum );
555 void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );
556 void HuffAddCodeToTable ( HuffData *table, u16 nodeNo, u32 paHuffCode );
557 u8 HuffAddCountHWordToTable ( HuffData *table, u16 nodeNo );
559 void HuffMakeHuffTree ( HuffCompressionInfo* info, u16 rootNo );
560 void HuffMakeSubsetHuffTree ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag );
562 void HuffSetOneNodeOffset ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag );
586 u16 rootNo; // Binary tree's root number in CompressHuffman()
587 u16 huffDataNum = (u16)(1 << huffBitSize); // 8->256, 4->16 in CompressHuffman()
632 for ( i = 0; i < (u16)( (info.huffTreeTop + 1) * 2 ); i++ ) // Tree table in CompressHuffman()
672 void HuffInitTable( HuffCompressionInfo* info, void* work, u16 dataNum ) in HuffInitTable()
688 table[ i ].No = (u16)i; in HuffInitTable()
749 u16 HuffConstructTree( HuffData *table, u32 dataNum ) in HuffConstructTree()
753 u16 tableTop = (u16)dataNum; // When creating table, the table top number in HuffConstructTree()
754 u16 rootNo; // Binary tree's root number in HuffConstructTree()
830 table[ tableTop ].LeafDepth = (u16)( table[ leftNo ].LeafDepth + 1 ); in HuffConstructTree()
834 table[ tableTop ].LeafDepth = (u16)( table[ rightNo ].LeafDepth + 1 ); in HuffConstructTree()
841 HuffAddParentDepthToTable( table, (u16)leftNo, (u16)rightNo ); in HuffConstructTree()
859 void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo ) in HuffAddParentDepthToTable()
866 … HuffAddParentDepthToTable( table, (u16)table[ leftNo ].ChNo[0], (u16)table[ leftNo ].ChNo[1] ); in HuffAddParentDepthToTable()
870 … HuffAddParentDepthToTable( table, (u16)table[ rightNo ].ChNo[0], (u16)table[ rightNo ].ChNo[1] ); in HuffAddParentDepthToTable()
877 void HuffAddCodeToTable( HuffData* table, u16 nodeNo, u32 paHuffCode ) in HuffAddCodeToTable()
883 HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[0], table[ nodeNo ].HuffCode ); in HuffAddCodeToTable()
884 HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[1], table[ nodeNo ].HuffCode ); in HuffAddCodeToTable()
892 u8 HuffAddCountHWordToTable( HuffData *table, u16 nodeNo) in HuffAddCountHWordToTable()
904 leftHWord = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[0] ); in HuffAddCountHWordToTable()
905 rightHWord = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[1] ); in HuffAddCountHWordToTable()
909 table[ nodeNo ].HWord = (u16)( leftHWord + rightHWord + 1 ); in HuffAddCountHWordToTable()
917 void HuffMakeHuffTree( HuffCompressionInfo* info, u16 rootNo ) in HuffMakeHuffTree()
1023 u16 tmp = 0; in HuffMakeHuffTree()
1051 void HuffMakeSubsetHuffTree( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag ) in HuffMakeSubsetHuffTree()
1131 void HuffSetOneNodeOffset( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag ) in HuffSetOneNodeOffset()
1133 u16 nodeNo; in HuffSetOneNodeOffset()
1162 … huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u16)huffTable[ nodeNo ].ChNo[0]; // Offset is required in HuffSetOneNodeOffset()
1175 … huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u16)huffTable[ nodeNo ].ChNo[1]; // Offset is required in HuffSetOneNodeOffset()