Lines Matching refs:u8
43 u32 SearchLZ ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset, u32 m…
44 void SlideByte ( LZCompressInfo * info, const u8 *srcp );
45 inline void LZSlide ( LZCompressInfo * info, const u8 *srcp, u32 n );
65 u32 CompressLZImpl(const u8 *srcp, u32 size, u8 *dstp, void *work, bool exFormat) in CompressLZImpl()
68 u8 LZCompFlags; // Flag sequence indicating whether there is a compression in CompressLZImpl()
69 u8 *LZCompFlagsp; // Point to memory regions storing LZCompFlags in CompressLZImpl()
72 u8 i; in CompressLZImpl()
131 *dstp++ = (u8)( 0x10 | (length >> 12) ); in CompressLZImpl()
132 *dstp++ = (u8)( length >> 4 ); in CompressLZImpl()
138 *dstp++ = (u8)( length >> 4 ); in CompressLZImpl()
152 *dstp++ = (u8)( length << 4 | (lastOffset - 1) >> 8 ); in CompressLZImpl()
153 *dstp++ = (u8)( (lastOffset - 1) & 0xff); in CompressLZImpl()
198 u32 SearchLZ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset, u32 maxLength ) in SearchLZ()
200 const u8 *searchp; in SearchLZ()
201 const u8 *headp, *searchHeadp; in SearchLZ()
306 void SlideByte(LZCompressInfo * info, const u8 *srcp) in SlideByte()
309 u8 in_data = *srcp; in SlideByte()
320 u8 out_data = *(srcp - 4096); in SlideByte()
357 inline void LZSlide(LZCompressInfo * info, const u8 *srcp, u32 n) in LZSlide()
387 u32 CompressRL(const u8 *srcp, u32 size, u8 *dstp) in CompressRL()
391 u8 RLCompFlag; // 1 if performing run-length encoding in CompressRL()
392 u8 runLength; // Run length in CompressRL()
393 u8 rawDataLength; // Length of data not run in CompressRL()
396 …const u8 *startp; // Point to the start of compression target data for each proce… in CompressRL()
429 rawDataLength = (u8)(size - RLSrcCount); in CompressRL()
453 dstp[RLDstCount++] = (u8)(rawDataLength - 1); // Store "data length - 1" (7 bits) in CompressRL()
470 runLength = (u8)(size - RLSrcCount); in CompressRL()
488 dstp[RLDstCount++] = (u8)(0x80 | (runLength - 3)); // Add 3, and store from 3 to 130 in CompressRL()
524 u8 Bit; // Node's bit data
525 u8 _padding;
532 u8 leftOffsetNeed; // 1 if offset to left child node is required
533 u8 rightOffsetNeed; // 1 if an offset to the right child node is required
543 u8 *huffTree; // huffTree[ 256 * 2 ]; 512B
545 u8 huffTreeTop; //
546 u8 padding_[3]; //
551 void HuffCountData( HuffData* table, const u8 *srcp, u32 size, u8 bitSize );
553 u32 HuffConvertData( const HuffData *table, const u8* srcp, u8* dstp, u32 srcSize, u32 maxSize, u8…
557 u8 HuffAddCountHWordToTable ( HuffData *table, u16 nodeNo );
560 void HuffMakeSubsetHuffTree ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag );
561 u8 HuffRemainingNodeCanSetOffset( HuffCompressionInfo* info, u8 costHWord );
562 void HuffSetOneNodeOffset ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag );
582 u32 CompressHuffman( const u8 *srcp, u32 size, u8 *dstp, u8 huffBitSize, void *work ) in CompressHuffman()
634 dstp[ huffDstCount++ ] = ((u8*)info.huffTree)[ i ]; in CompressHuffman()
676 info->huffTree = (u8*)( (u32)work + sizeof(HuffData) * 512 ); in HuffInitTable()
677 info->huffTreeCtrl = (HuffTreeCtrlData*)( (u32)info->huffTree + sizeof(u8) * 512 ); in HuffInitTable()
695 u8* huffTree = info->huffTree; in HuffInitTable()
717 void HuffCountData( HuffData* table, const u8 *srcp, u32 size, u8 bitSize ) in HuffCountData()
720 u8 tmp; in HuffCountData()
733 tmp = (u8)( (srcp[ i ] & 0xf0) >> 4 ); in HuffCountData()
735 tmp = (u8)( srcp[ i ] & 0x0f ); in HuffCountData()
892 u8 HuffAddCountHWordToTable( HuffData *table, u16 nodeNo) in HuffAddCountHWordToTable()
894 u8 leftHWord, rightHWord; in HuffAddCountHWordToTable()
910 return (u8)( leftHWord + rightHWord + 1 ); in HuffAddCountHWordToTable()
923 u8 offsetNeedNum; in HuffMakeHuffTree()
925 u8 tmpRightFlag; in HuffMakeHuffTree()
957 tmpCostOffsetNeed = (u8)( info->huffTreeTop - i ); in HuffMakeHuffTree()
968 if ( ! HuffRemainingNodeCanSetOffset( info, (u8)tmpCostHWord ) ) in HuffMakeHuffTree()
994 if ( ! HuffRemainingNodeCanSetOffset( info, (u8)tmpCostHWord ) ) in HuffMakeHuffTree()
1015 HuffMakeSubsetHuffTree( info, (u8)costMaxKey, (u8)costMaxRightFlag); in HuffMakeHuffTree()
1038 HuffSetOneNodeOffset( info, (u8)i, tmpRightFlag); in HuffMakeHuffTree()
1051 void HuffMakeSubsetHuffTree( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag ) in HuffMakeSubsetHuffTree()
1053 u8 i; in HuffMakeSubsetHuffTree()
1086 u8 HuffRemainingNodeCanSetOffset( HuffCompressionInfo* info, u8 costHWord ) in HuffRemainingNodeCanSetOffset()
1088 u8 i; in HuffRemainingNodeCanSetOffset()
1131 void HuffSetOneNodeOffset( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag ) in HuffSetOneNodeOffset()
1134 u8 offsetData = 0; in HuffSetOneNodeOffset()
1137 u8* huffTree = info->huffTree; in HuffSetOneNodeOffset()
1139 u8 huffTreeTop = info->huffTreeTop; in HuffSetOneNodeOffset()
1156 huffTree[ huffTreeTop * 2 + 0 ] = (u8)huffTable[ nodeNo ].ChNo[0]; in HuffSetOneNodeOffset()
1157 huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u8)huffTable[ nodeNo ].ChNo[0]; in HuffSetOneNodeOffset()
1169 huffTree[ huffTreeTop * 2 + 1 ] = (u8)huffTable[nodeNo].ChNo[1]; in HuffSetOneNodeOffset()
1170 huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u8)huffTable[ nodeNo ].ChNo[1]; in HuffSetOneNodeOffset()
1178 offsetData |= (u8)( huffTreeTop - huffTreeNo - 1 ); in HuffSetOneNodeOffset()
1195 u32 HuffConvertData( const HuffData *table, const u8* srcp, u8* dstp, u32 srcSize, u32 maxSize, u8 … in HuffConvertData()
1198 u8 srcTmp; in HuffConvertData()
1206 u8 val = srcp[ i ]; in HuffConvertData()
1220 dstp[ dstSize++ ] = (u8)(bitStream >> (streamLength - (ii + 1) * 8)); in HuffConvertData()
1230 srcTmp = (u8)( val >> 4 ); // First four bits come later in HuffConvertData()
1234 …srcTmp = (u8)( val & 0x0F ); // Last four bits come first (because the decoder accesses in a Lit… in HuffConvertData()
1245 dstp[ dstSize++ ] = (u8)(bitStream >> (streamLength - (iii + 1) * 8)); in HuffConvertData()
1259 dstp[ dstSize++ ] = (u8)( bitStream << (8 - streamLength) ); in HuffConvertData()
1273 u8 tmp; in HuffConvertData()