Lines Matching refs:i
106 u8 i; in CXCompressLZImpl() local
140 for ( i = 0; i < 8; i++ ) in CXCompressLZImpl()
211 i = 0; in CXCompressLZImpl()
212 while ( (LZDstCount + i) & 0x3 ) in CXCompressLZImpl()
215 i++; in CXCompressLZImpl()
320 u16 i; in LZInitTable() local
326 for ( i = 0; i < 256; i++ ) in LZInitTable()
328 info->LZByteTable[i] = -1; in LZInitTable()
329 info->LZEndTable [i] = -1; in LZInitTable()
391 u32 i; in LZSlide() local
393 for (i = 0; i < n; i++) in LZSlide()
424 u32 i; in CXCompressRL() local
454 for (i = 0; i < 128; i++) // Data volume that can be expressed in 7 bits is 0 to 127 in CXCompressRL()
465 if (startp[i] == startp[i + 1] && startp[i] == startp[i + 2]) in CXCompressRL()
484 for (i = 0; i < rawDataLength; i++) in CXCompressRL()
495 for (i = 3; i < 128 + 2; i++) in CXCompressRL()
527 i = 0; in CXCompressRL()
528 while ((RLDstCount + i) & 0x3) in CXCompressRL()
530 dstp[RLDstCount + i] = 0; in CXCompressRL()
531 i++; in CXCompressRL()
611 s32 i; in CXCompressHuffman() local
658 for ( i = 0; i < (u16)( (info.huffTreeTop + 1) * 2 ); i++ ) // Tree table in CXCompressHuffman()
660 dstp[ huffDstCount++ ] = ((u8*)info.huffTree)[ i ]; in CXCompressHuffman()
699 u32 i; in HuffInitTable() local
710 for ( i = 0; i < dataNum * 2U; i++ ) in HuffInitTable()
712 table[ i ] = HUFF_TABLE_INIT_DATA; in HuffInitTable()
713 table[ i ].No = (u16)i; in HuffInitTable()
723 for ( i = 0; i < 256; i++ ) in HuffInitTable()
725 huffTree[ i * 2 ] = 0; in HuffInitTable()
726 huffTree[ i * 2 + 1 ] = 0; in HuffInitTable()
727 huffTreeCtrl[ i ] = HUFF_TREE_CTRL_INIT_DATA; in HuffInitTable()
744 u32 i; in HuffCountData() local
749 for ( i = 0; i < size; i++ ) in HuffCountData()
751 table[ srcp[ i ] ].Freq++; // 8-bit encoding in HuffCountData()
756 for ( i = 0; i < size; i++ ) // 4-bit encoding in HuffCountData()
758 tmp = (u8)( (srcp[ i ] & 0xf0) >> 4 ); in HuffCountData()
760 tmp = (u8)( srcp[ i ] & 0x0f ); in HuffCountData()
776 s32 i; in HuffConstructTree() local
788 for ( i = 0; i < tableTop; i++ ) in HuffConstructTree()
790 if ( ( table[i].Freq == 0 ) || in HuffConstructTree()
791 ( table[i].PaNo != 0 ) ) in HuffConstructTree()
798 leftNo = i; in HuffConstructTree()
800 else if ( table[i].Freq < table[ leftNo ].Freq ) in HuffConstructTree()
802 leftNo = i; in HuffConstructTree()
807 for ( i = 0; i < tableTop; i++ ) in HuffConstructTree()
809 if ( ( table[i].Freq == 0 ) || in HuffConstructTree()
810 ( table[i].PaNo != 0 ) || in HuffConstructTree()
811 ( i == leftNo ) ) in HuffConstructTree()
818 rightNo = i; in HuffConstructTree()
820 else if ( table[i].Freq < table[rightNo].Freq ) in HuffConstructTree()
822 rightNo = i; in HuffConstructTree()
944 s16 i; in HuffMakeHuffTree() local
961 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffMakeHuffTree()
963 if ( info->huffTreeCtrl[ i ].leftOffsetNeed ) in HuffMakeHuffTree()
967 if ( info->huffTreeCtrl[ i ].rightOffsetNeed ) in HuffMakeHuffTree()
979 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffMakeHuffTree()
981 tmpCostOffsetNeed = (u8)( info->huffTreeTop - i ); in HuffMakeHuffTree()
984 if (info->huffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
986 tmpCostHWord = (s16)info->huffTable[ info->huffTreeCtrl[i].leftNodeNo ].HWord; in HuffMakeHuffTree()
998 costMaxKey = i; in HuffMakeHuffTree()
1003 costMaxKey = i; in HuffMakeHuffTree()
1010 if ( info->huffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
1012 tmpCostHWord = (s16)info->huffTable[info->huffTreeCtrl[i].rightNodeNo].HWord; in HuffMakeHuffTree()
1024 costMaxKey = i; in HuffMakeHuffTree()
1029 costMaxKey = i; in HuffMakeHuffTree()
1045 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffMakeHuffTree()
1049 if (info->huffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
1051 tmp = info->huffTable[ info->huffTreeCtrl[i].leftNodeNo ].HWord; in HuffMakeHuffTree()
1053 if (info->huffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
1055 if ( info->huffTable[info->huffTreeCtrl[i].rightNodeNo ].HWord > tmp ) in HuffMakeHuffTree()
1062 HuffSetOneNodeOffset( info, (u8)i, tmpRightFlag); in HuffMakeHuffTree()
1077 u8 i; in HuffMakeSubsetHuffTree() local
1079 i = info->huffTreeTop; in HuffMakeSubsetHuffTree()
1091 while ( i < info->huffTreeTop ) in HuffMakeSubsetHuffTree()
1093 if ( info->huffTreeCtrl[ i ].leftOffsetNeed ) in HuffMakeSubsetHuffTree()
1095 HuffSetOneNodeOffset( info, i, 0); in HuffMakeSubsetHuffTree()
1096 info->huffTreeCtrl[ i ].leftOffsetNeed = 0; in HuffMakeSubsetHuffTree()
1098 if ( info->huffTreeCtrl[ i ].rightOffsetNeed ) in HuffMakeSubsetHuffTree()
1100 HuffSetOneNodeOffset( info, i, 1); in HuffMakeSubsetHuffTree()
1101 info->huffTreeCtrl[ i ].rightOffsetNeed = 0; in HuffMakeSubsetHuffTree()
1103 i++; in HuffMakeSubsetHuffTree()
1112 u8 i; in HuffRemainingNodeCanSetOffset() local
1118 for ( i = 0; i < info->huffTreeTop; i++ ) in HuffRemainingNodeCanSetOffset()
1120 if ( info->huffTreeCtrl[i].leftOffsetNeed ) in HuffRemainingNodeCanSetOffset()
1122 if ( (info->huffTreeTop - i) <= capacity ) in HuffRemainingNodeCanSetOffset()
1131 if ( info->huffTreeCtrl[i].rightOffsetNeed ) in HuffRemainingNodeCanSetOffset()
1133 if ( (info->huffTreeTop - i) <= capacity ) in HuffRemainingNodeCanSetOffset()
1221 u32 i, ii, iii; in HuffConvertData() local
1228 for ( i = 0; i < srcSize; i++ ) in HuffConvertData()
1230 u8 val = srcp[ i ]; in HuffConvertData()
1295 for ( i = 0; i < dstSize / 4; i++ ) in HuffConvertData()
1298 tmp = dstp[i * 4 + 0]; in HuffConvertData()
1299 dstp[i * 4 + 0] = dstp[i * 4 + 3]; in HuffConvertData()
1300 dstp[i * 4 + 3] = tmp; // Swap in HuffConvertData()
1301 tmp = dstp[i * 4 + 1]; in HuffConvertData()
1302 dstp[i * 4 + 1] = dstp[i * 4 + 2]; in HuffConvertData()
1303 dstp[i * 4 + 2] = tmp; // Swap in HuffConvertData()