Lines Matching refs:HuffDstCount
762 u32 HuffDstCount; // Number of bytes of compressed data in MI_CompressHuffman() local
913 HuffDstCount = 4; in MI_CompressHuffman()
915 …if (HuffDstCount + (HuffTreeTop + 1) * 2 >= size) // Quit on error if size becomes larger than s… in MI_CompressHuffman()
922 dstp[HuffDstCount++] = ((u8 *)HuffTree)[i]; in MI_CompressHuffman()
927 while (HuffDstCount & 0x3) in MI_CompressHuffman()
929 if (HuffDstCount & 0x1) in MI_CompressHuffman()
934 dstp[HuffDstCount++] = 0; in MI_CompressHuffman()
946 if (HuffDstCount + (streamLength / 8) >= size) in MI_CompressHuffman()
953 dstp[HuffDstCount++] = (u8)(bitStream >> (streamLength - (ii + 1) * 8)); in MI_CompressHuffman()
971 if (HuffDstCount + (streamLength / 8) >= size) in MI_CompressHuffman()
978 dstp[HuffDstCount++] = (u8)(bitStream >> (streamLength - (iii + 1) * 8)); in MI_CompressHuffman()
987 if (HuffDstCount + 1 >= size) in MI_CompressHuffman()
992 dstp[HuffDstCount++] = (u8)(bitStream << (8 - streamLength)); in MI_CompressHuffman()
998 while (HuffDstCount & 0x3) in MI_CompressHuffman()
1000 dstp[HuffDstCount++] = 0; in MI_CompressHuffman()
1003 …for (i = 1 + (HuffTreeTop + 1) * 2 / 4; i < (HuffDstCount / 4) + 1; i++) // Little endian conve… in MI_CompressHuffman()
1013 return HuffDstCount; in MI_CompressHuffman()