Lines Matching refs:u8
63 static u8 SearchLZ ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset…
64 static void SlideByte ( LZCompressInfo * info, const u8 *srcp );
65 static inline void LZSlide ( LZCompressInfo * info, const u8 *srcp, u32 n );
83 u32 CXCompressLZ(const u8 *srcp, u32 size, u8 *dstp, void *work) in CXCompressLZ()
86 u8 LZCompFlags; // Flag series indicating whether there is a compression in CXCompressLZ()
87 u8 *LZCompFlagsp; // Point to memory regions storing LZCompFlags in CXCompressLZ()
89 …u8 lastLength; // Length of matching data (the longest matching data at the ti… in CXCompressLZ()
90 u8 i; in CXCompressLZ()
130 *dstp++ = (u8)((lastLength - 3) << 4 | (lastOffset - 1) >> 8); in CXCompressLZ()
131 *dstp++ = (u8)((lastOffset - 1) & 0xff); in CXCompressLZ()
174 static u8 SearchLZ( LZCompressInfo * info, const u8 *nextp, u32 remainSize, u16 *offset ) in SearchLZ()
176 const u8 *searchp; in SearchLZ()
177 const u8 *headp, *searchHeadp; in SearchLZ()
179 u8 maxLength = 2; in SearchLZ()
180 u8 tmpLength; in SearchLZ()
282 static void SlideByte(LZCompressInfo * info, const u8 *srcp) in SlideByte()
285 u8 in_data = *srcp; in SlideByte()
296 u8 out_data = *(srcp - 4096); in SlideByte()
333 static inline void LZSlide(LZCompressInfo * info, const u8 *srcp, u32 n) in LZSlide()
361 u32 CXCompressRL(const u8 *srcp, u32 size, u8 *dstp) in CXCompressRL()
365 u8 RLCompFlag; // 1 if performing run length encoding in CXCompressRL()
366 u8 runLength; // Run length in CXCompressRL()
367 u8 rawDataLength; // Length of data not run in CXCompressRL()
370 …const u8 *startp; // Point to the start of compression target data for each proce… in CXCompressRL()
394 rawDataLength = (u8)(size - RLSrcCount); in CXCompressRL()
418 dstp[RLDstCount++] = (u8)(rawDataLength - 1); // Store "data length - 1" (7 bits) in CXCompressRL()
435 runLength = (u8)(size - RLSrcCount); in CXCompressRL()
453 dstp[RLDstCount++] = (u8)(0x80 | (runLength - 3)); // Add 3, and store 3 to 130 in CXCompressRL()
487 u8 Bit; // Node's bit data
488 u8 _padding;
495 u8 leftOffsetNeed; // 1 if offset to left child node is required
496 u8 rightOffsetNeed; // 1 if offset to right child node is required
506 u8 *huffTree; // huffTree[ 256 * 2 ]; 512B
508 u8 huffTreeTop; //
509 u8 padding_[3]; //
514 static void HuffCountData( HuffData* table, const u8 *srcp, u32 size, u8 bitSize );
516 … u32 HuffConvertData( const HuffData *table, const u8* srcp, u8* dstp, u32 srcSize, u32 maxSize, …
520 static u8 HuffAddCountHWordToTable ( HuffData *table, u16 nodeNo );
523 static void HuffMakeSubsetHuffTree ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeF…
524 static u8 HuffRemainingNodeCanSetOffset( HuffCompressionInfo* info, u8 costHWord );
525 static void HuffSetOneNodeOffset ( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeF…
543 u32 CXCompressHuffman( const u8 *srcp, u32 size, u8 *dstp, u8 huffBitSize, void *work ) in CXCompressHuffman()
583 dstp[ huffDstCount++ ] = ((u8*)info.huffTree)[ i ]; in CXCompressHuffman()
624 info->huffTree = (u8*)( (u32)work + sizeof(HuffData) * 512 ); in HuffInitTable()
625 info->huffTreeCtrl = (HuffTreeCtrlData*)( (u32)info->huffTree + sizeof(u8) * 512 ); in HuffInitTable()
643 u8* huffTree = info->huffTree; in HuffInitTable()
665 static void HuffCountData( HuffData* table, const u8 *srcp, u32 size, u8 bitSize ) in HuffCountData()
668 u8 tmp; in HuffCountData()
681 tmp = (u8)( (srcp[ i ] & 0xf0) >> 4 ); in HuffCountData()
683 tmp = (u8)( srcp[ i ] & 0x0f ); in HuffCountData()
840 static u8 HuffAddCountHWordToTable( HuffData *table, u16 nodeNo) in HuffAddCountHWordToTable()
842 u8 leftHWord, rightHWord; in HuffAddCountHWordToTable()
858 return (u8)( leftHWord + rightHWord + 1 ); in HuffAddCountHWordToTable()
871 u8 offsetNeedNum; in HuffMakeHuffTree()
872 u8 tmpKey, tmpRightFlag; in HuffMakeHuffTree()
904 tmpCostOffsetNeed = (u8)( info->huffTreeTop - i ); in HuffMakeHuffTree()
915 if ( ! HuffRemainingNodeCanSetOffset( info, (u8)tmpCostHWord ) ) in HuffMakeHuffTree()
941 if ( ! HuffRemainingNodeCanSetOffset( info, (u8)tmpCostHWord ) ) in HuffMakeHuffTree()
962 HuffMakeSubsetHuffTree( info, (u8)costMaxKey, (u8)costMaxRightFlag); in HuffMakeHuffTree()
985 HuffSetOneNodeOffset( info, (u8)i, tmpRightFlag); in HuffMakeHuffTree()
998 static void HuffMakeSubsetHuffTree( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag ) in HuffMakeSubsetHuffTree()
1000 u8 i; in HuffMakeSubsetHuffTree()
1033 static u8 HuffRemainingNodeCanSetOffset( HuffCompressionInfo* info, u8 costHWord ) in HuffRemainingNodeCanSetOffset()
1035 u8 i; in HuffRemainingNodeCanSetOffset()
1078 static void HuffSetOneNodeOffset( HuffCompressionInfo* info, u16 huffTreeNo, u8 rightNodeFlag ) in HuffSetOneNodeOffset()
1081 u8 offsetData = 0; in HuffSetOneNodeOffset()
1084 u8* huffTree = info->huffTree; in HuffSetOneNodeOffset()
1086 u8 huffTreeTop = info->huffTreeTop; in HuffSetOneNodeOffset()
1103 huffTree[ huffTreeTop * 2 + 0 ] = (u8)huffTable[ nodeNo ].ChNo[0]; in HuffSetOneNodeOffset()
1104 huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u8)huffTable[ nodeNo ].ChNo[0]; in HuffSetOneNodeOffset()
1116 huffTree[ huffTreeTop * 2 + 1 ] = (u8)huffTable[nodeNo].ChNo[1]; in HuffSetOneNodeOffset()
1117 huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u8)huffTable[ nodeNo ].ChNo[1]; in HuffSetOneNodeOffset()
1125 offsetData |= (u8)( huffTreeTop - huffTreeNo - 1 ); in HuffSetOneNodeOffset()
1142 …c u32 HuffConvertData( const HuffData *table, const u8* srcp, u8* dstp, u32 srcSize, u32 maxSize, … in HuffConvertData()
1145 u8 srcTmp; in HuffConvertData()
1166 dstp[ dstSize++ ] = (u8)(bitStream >> (streamLength - (ii + 1) * 8)); in HuffConvertData()
1176 srcTmp = (u8)( srcp[ i ] >> 4 ); // first four bits come later in HuffConvertData()
1180 …srcTmp = (u8)( srcp[ i ] & 0x0F ); // last four bits come first (because the decoder accesses in… in HuffConvertData()
1191 dstp[ dstSize++ ] = (u8)(bitStream >> (streamLength - (iii + 1) * 8)); in HuffConvertData()
1205 dstp[ dstSize++ ] = (u8)( bitStream << (8 - streamLength) ); in HuffConvertData()
1219 u8 tmp; in HuffConvertData()