Lines Matching refs:i
50 u8 i; in MI_CompressLZImpl() local
70 for (i = 0; i < 8; i++) in MI_CompressLZImpl()
139 i = 0; in MI_CompressLZImpl()
140 while ((LZDstCount + i) & 0x3) in MI_CompressLZImpl()
143 i++; in MI_CompressLZImpl()
266 u16 i; in LZInitTable() local
272 for (i = 0; i < 256; i++) in LZInitTable()
274 info->LZByteTable[i] = -1; in LZInitTable()
275 info->LZEndTable[i] = -1; in LZInitTable()
337 u32 i; in LZSlide() local
339 for (i = 0; i < n; i++) in LZSlide()
368 u8 i; in MI_CompressLZFastImpl() local
389 for (i = 0; i < 8; i++) in MI_CompressLZFastImpl()
460 i = 0; in MI_CompressLZFastImpl()
461 while ((LZDstCount + i) & 0x3) in MI_CompressLZFastImpl()
464 i++; in MI_CompressLZFastImpl()
589 u32 i; in MI_CompressRL() local
605 for (i = 0; i < 128; i++) // Data volume that can be expressed in 7 bits is 0 to 127 in MI_CompressRL()
616 if (startp[i] == startp[i + 1] && startp[i] == startp[i + 2]) in MI_CompressRL()
635 for (i = 0; i < rawDataLength; i++) in MI_CompressRL()
646 for (i = 3; i < 128 + 2; i++) in MI_CompressRL()
678 i = 0; in MI_CompressRL()
679 while ((RLDstCount + i) & 0x3) in MI_CompressRL()
681 dstp[RLDstCount + i] = 0; in MI_CompressRL()
682 i++; in MI_CompressRL()
767 s32 i, ii, iii; in MI_CompressHuffman() local
790 for (i = 0; i < (u16)(sHuffDataNum * 2); i++) in MI_CompressHuffman()
792 HuffTable[i] = HuffTableInitData; in MI_CompressHuffman()
793 HuffTable[i].No = (u16)i; in MI_CompressHuffman()
799 for (i = 0; i < size; i++) in MI_CompressHuffman()
801 HuffTable[srcp[i]].Freq++; // 8-bit encoding in MI_CompressHuffman()
806 for (i = 0; i < size; i++) in MI_CompressHuffman()
808 tmp = (u8)((srcp[i] & 0xf0) >> 4); // Store from upper 4 bits first in MI_CompressHuffman()
810 tmp = (u8)(srcp[i] & 0x0f); in MI_CompressHuffman()
821 for (i = 0; i < tableTop; i++) in MI_CompressHuffman()
823 if ((HuffTable[i].Freq != 0) && (HuffTable[i].PaNo == 0)) in MI_CompressHuffman()
825 leftNo = i; in MI_CompressHuffman()
829 for (i = (u16)leftNo; i < tableTop; i++) in MI_CompressHuffman()
831 if ((HuffTable[i].Freq != 0) && in MI_CompressHuffman()
832 (HuffTable[i].PaNo == 0) && (HuffTable[i].Freq < HuffTable[leftNo].Freq)) in MI_CompressHuffman()
834 leftNo = i; in MI_CompressHuffman()
838 for (i = 0; i < tableTop; i++) in MI_CompressHuffman()
840 if ((HuffTable[i].Freq != 0) && (HuffTable[i].PaNo == 0) && (i != leftNo)) in MI_CompressHuffman()
842 rightNo = i; in MI_CompressHuffman()
846 for (i = (u16)rightNo; i < tableTop; i++) in MI_CompressHuffman()
848 if ((HuffTable[i].Freq != 0) && in MI_CompressHuffman()
849 (HuffTable[i].PaNo == 0) && in MI_CompressHuffman()
850 (HuffTable[i].Freq < HuffTable[rightNo].Freq) && (i != leftNo)) in MI_CompressHuffman()
852 rightNo = i; in MI_CompressHuffman()
920 for (i = 0; i < (u16)((HuffTreeTop + 1) * 2); i++) // Tree table in MI_CompressHuffman()
922 dstp[HuffDstCount++] = ((u8 *)HuffTree)[i]; in MI_CompressHuffman()
938 for (i = 0; i < size; i++) // Data compression in MI_CompressHuffman()
940 u8 val = srcp[i]; in MI_CompressHuffman()
1003 …for (i = 1 + (HuffTreeTop + 1) * 2 / 4; i < (HuffDstCount / 4) + 1; i++) // Little endian conve… in MI_CompressHuffman()
1005 tmp = dstp[i * 4 + 0]; in MI_CompressHuffman()
1006 dstp[i * 4 + 0] = dstp[i * 4 + 3]; in MI_CompressHuffman()
1007 dstp[i * 4 + 3] = tmp; // Swap in MI_CompressHuffman()
1008 tmp = dstp[i * 4 + 1]; in MI_CompressHuffman()
1009 dstp[i * 4 + 1] = dstp[i * 4 + 2]; in MI_CompressHuffman()
1010 dstp[i * 4 + 2] = tmp; // Swap in MI_CompressHuffman()
1023 s16 i; in HuffMakeHuffTree() local
1032 for (i = 0; i < 256; i++) in HuffMakeHuffTree()
1034 HuffTree[i * 2] = HuffTree[i * 2 + 1] = 0; in HuffMakeHuffTree()
1036 for (i = 0; i < 256; i++) in HuffMakeHuffTree()
1038 HuffTreeCtrl[i] = HuffTreeCtrlInitData; in HuffMakeHuffTree()
1050 for (i = 0; i < HuffTreeTop; i++) in HuffMakeHuffTree()
1052 if (HuffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
1056 if (HuffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
1068 for (i = 0; i < HuffTreeTop; i++) in HuffMakeHuffTree()
1071 tmpCostOffsetNeed = (u8)(HuffTreeTop - i); in HuffMakeHuffTree()
1074 if (HuffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
1076 tmpCostHWord = (s16)HuffTable[HuffTreeCtrl[i].leftNodeNo].HWord; in HuffMakeHuffTree()
1088 costMaxKey = i; in HuffMakeHuffTree()
1093 costMaxKey = i; in HuffMakeHuffTree()
1101 if (HuffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
1103 tmpCostHWord = (s16)HuffTable[HuffTreeCtrl[i].rightNodeNo].HWord; in HuffMakeHuffTree()
1115 costMaxKey = i; in HuffMakeHuffTree()
1120 costMaxKey = i; in HuffMakeHuffTree()
1137 for (i = 0; i < HuffTreeTop; i++) in HuffMakeHuffTree()
1141 if (HuffTreeCtrl[i].leftOffsetNeed) in HuffMakeHuffTree()
1143 tmp = HuffTable[HuffTreeCtrl[i].leftNodeNo].HWord; in HuffMakeHuffTree()
1145 if (HuffTreeCtrl[i].rightOffsetNeed) in HuffMakeHuffTree()
1147 if (HuffTable[HuffTreeCtrl[i].rightNodeNo].HWord > tmp) in HuffMakeHuffTree()
1154 HuffSetOneNodeOffset((u8)i, tmpRightFlag); in HuffMakeHuffTree()
1170 u8 i; in HuffMakeSubsetHuffTree() local
1172 i = HuffTreeTop; in HuffMakeSubsetHuffTree()
1184 while (i < HuffTreeTop) in HuffMakeSubsetHuffTree()
1186 if (HuffTreeCtrl[i].leftOffsetNeed) in HuffMakeSubsetHuffTree()
1188 HuffSetOneNodeOffset(i, 0); in HuffMakeSubsetHuffTree()
1189 HuffTreeCtrl[i].leftOffsetNeed = 0; in HuffMakeSubsetHuffTree()
1191 if (HuffTreeCtrl[i].rightOffsetNeed) in HuffMakeSubsetHuffTree()
1193 HuffSetOneNodeOffset(i, 1); in HuffMakeSubsetHuffTree()
1194 HuffTreeCtrl[i].rightOffsetNeed = 0; in HuffMakeSubsetHuffTree()
1196 i++; in HuffMakeSubsetHuffTree()
1205 u8 i; in HuffRemainingNodeCanSetOffset() local
1211 for (i = 0; i < HuffTreeTop; i++) in HuffRemainingNodeCanSetOffset()
1213 if (HuffTreeCtrl[i].leftOffsetNeed) in HuffRemainingNodeCanSetOffset()
1215 if ((HuffTreeTop - i) <= capacity) in HuffRemainingNodeCanSetOffset()
1224 if (HuffTreeCtrl[i].rightOffsetNeed) in HuffRemainingNodeCanSetOffset()
1226 if ((HuffTreeTop - i) <= capacity) in HuffRemainingNodeCanSetOffset()