Lines Matching refs:i
72 u8 i; in CompressLZImpl() local
106 for ( i = 0; i < 8; i++ ) in CompressLZImpl()
177 i = 0; in CompressLZImpl()
178 while ( (LZDstCount + i) & 0x3 ) in CompressLZImpl()
181 i++; in CompressLZImpl()
288 u16 i; in LZInitTable() local
294 for ( i = 0; i < 256; i++ ) in LZInitTable()
296 info->LZByteTable[i] = -1; in LZInitTable()
297 info->LZEndTable [i] = -1; in LZInitTable()
359 u32 i; in LZSlide() local
361 for (i = 0; i < n; i++) in LZSlide()
394 u32 i; in CompressRL() local
424 for (i = 0; i < 128; i++) // Data volume that can be expressed in 7 bits is 0 to 127 in CompressRL()
435 if (startp[i] == startp[i + 1] && startp[i] == startp[i + 2]) in CompressRL()
454 for (i = 0; i < rawDataLength; i++) in CompressRL()
465 for (i = 3; i < 128 + 2; i++) in CompressRL()
497 i = 0; in CompressRL()
498 while ((RLDstCount + i) & 0x3) in CompressRL()
500 dstp[RLDstCount + i] = 0; in CompressRL()
501 i++; in CompressRL()
585 s32 i; in CompressHuffman() local
632 for ( i = 0; i < (u16)( (info.huffTreeTop + 1) * 2 ); i++ ) // Tree table in CompressHuffman()
634 dstp[ huffDstCount++ ] = ((u8*)info.huffTree)[ i ]; in CompressHuffman()
674 u32 i; in HuffInitTable() local
685 for ( i = 0; i < dataNum * 2U; i++ ) in HuffInitTable()
687 table[ i ] = HUFF_TABLE_INIT_DATA; in HuffInitTable()
688 table[ i ].No = (u16)i; in HuffInitTable()
698 for ( i = 0; i < 256; i++ ) in HuffInitTable()
700 huffTree[ i * 2 ] = 0; in HuffInitTable()
701 huffTree[ i * 2 + 1 ] = 0; in HuffInitTable()
702 huffTreeCtrl[ i ] = HUFF_TREE_CTRL_INIT_DATA; in HuffInitTable()
719 u32 i; in HuffCountData() local
724 for ( i = 0; i < size; i++ ) in HuffCountData()
726 table[ srcp[ i ] ].Freq++; // 8-bit encoding in HuffCountData()
731 for ( i = 0; i < size; i++ ) // 4-bit encoding in HuffCountData()
733 tmp = (u8)( (srcp[ i ] & 0xf0) >> 4 ); in HuffCountData()
735 tmp = (u8)( srcp[ i ] & 0x0f ); in HuffCountData()
751 s32 i; in HuffConstructTree() local
763 for ( i = 0; i < tableTop; i++ ) in HuffConstructTree()
765 if ( ( table[i].Freq == 0 ) || in HuffConstructTree()
766 ( table[i].PaNo != 0 ) ) in HuffConstructTree()
773 leftNo = i; in HuffConstructTree()
775 else if ( table[i].Freq < table[ leftNo ].Freq ) in HuffConstructTree()
777 leftNo = i; in HuffConstructTree()
782 for ( i = 0; i < tableTop; i++ ) in HuffConstructTree()
784 if ( ( table[i].Freq == 0 ) || in HuffConstructTree()
785 ( table[i].PaNo != 0 ) || in HuffConstructTree()
786 ( i == leftNo ) ) in HuffConstructTree()
793 rightNo = i; in HuffConstructTree()
795 else if ( table[i].Freq < table[rightNo].Freq ) in HuffConstructTree()
797 rightNo = i; in HuffConstructTree()
919 s16 i; in HuffMakeHuffTree() local
937 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffMakeHuffTree()
939 if ( info->huffTreeCtrl[ i ].leftOffsetNeed ) in HuffMakeHuffTree()
943 if ( info->huffTreeCtrl[ i ].rightOffsetNeed ) in HuffMakeHuffTree()
955 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffMakeHuffTree()
957 tmpCostOffsetNeed = (u8)( info->huffTreeTop - i ); in HuffMakeHuffTree()
960 if (info->huffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
962 tmpCostHWord = (s16)info->huffTable[ info->huffTreeCtrl[i].leftNodeNo ].HWord; in HuffMakeHuffTree()
974 costMaxKey = i; in HuffMakeHuffTree()
979 costMaxKey = i; in HuffMakeHuffTree()
986 if ( info->huffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
988 tmpCostHWord = (s16)info->huffTable[info->huffTreeCtrl[i].rightNodeNo].HWord; in HuffMakeHuffTree()
1000 costMaxKey = i; in HuffMakeHuffTree()
1005 costMaxKey = i; in HuffMakeHuffTree()
1021 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffMakeHuffTree()
1025 if (info->huffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
1027 tmp = info->huffTable[ info->huffTreeCtrl[i].leftNodeNo ].HWord; in HuffMakeHuffTree()
1029 if (info->huffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
1031 if ( info->huffTable[info->huffTreeCtrl[i].rightNodeNo ].HWord > tmp ) in HuffMakeHuffTree()
1038 HuffSetOneNodeOffset( info, (u8)i, tmpRightFlag); in HuffMakeHuffTree()
1053 u8 i; in HuffMakeSubsetHuffTree() local
1055 i = info->huffTreeTop; in HuffMakeSubsetHuffTree()
1067 while ( i < info->huffTreeTop ) in HuffMakeSubsetHuffTree()
1069 if ( info->huffTreeCtrl[ i ].leftOffsetNeed ) in HuffMakeSubsetHuffTree()
1071 HuffSetOneNodeOffset( info, i, 0); in HuffMakeSubsetHuffTree()
1072 info->huffTreeCtrl[ i ].leftOffsetNeed = 0; in HuffMakeSubsetHuffTree()
1074 if ( info->huffTreeCtrl[ i ].rightOffsetNeed ) in HuffMakeSubsetHuffTree()
1076 HuffSetOneNodeOffset( info, i, 1); in HuffMakeSubsetHuffTree()
1077 info->huffTreeCtrl[ i ].rightOffsetNeed = 0; in HuffMakeSubsetHuffTree()
1079 i++; in HuffMakeSubsetHuffTree()
1088 u8 i; in HuffRemainingNodeCanSetOffset() local
1094 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffRemainingNodeCanSetOffset()
1096 if ( info->huffTreeCtrl[i].leftOffsetNeed ) in HuffRemainingNodeCanSetOffset()
1098 if ( (info->huffTreeTop - i) <= capacity ) in HuffRemainingNodeCanSetOffset()
1107 if ( info->huffTreeCtrl[i].rightOffsetNeed ) in HuffRemainingNodeCanSetOffset()
1109 if ( (info->huffTreeTop - i) <= capacity ) in HuffRemainingNodeCanSetOffset()
1197 u32 i, ii, iii; in HuffConvertData() local
1204 for ( i = 0; i < srcSize; i++ ) in HuffConvertData()
1206 u8 val = srcp[ i ]; in HuffConvertData()
1271 for ( i = 0; i < dstSize / 4; i++ ) in HuffConvertData()
1274 tmp = dstp[i * 4 + 0]; in HuffConvertData()
1275 dstp[i * 4 + 0] = dstp[i * 4 + 3]; in HuffConvertData()
1276 dstp[i * 4 + 3] = tmp; // Swap in HuffConvertData()
1277 tmp = dstp[i * 4 + 1]; in HuffConvertData()
1278 dstp[i * 4 + 1] = dstp[i * 4 + 2]; in HuffConvertData()
1279 dstp[i * 4 + 2] = tmp; // Swap in HuffConvertData()