Searched refs:leftNo (Results 1 – 1 of 1) sorted by relevance
694 static void HuffUpdateParentDepth(u16 leftNo, u16 rightNo);766 s32 leftNo, rightNo; // Node number for creating binary tree in MI_CompressHuffman() local816 leftNo = rightNo = -1; in MI_CompressHuffman()825 leftNo = i; in MI_CompressHuffman()829 for (i = (u16)leftNo; i < tableTop; i++) in MI_CompressHuffman()832 (HuffTable[i].PaNo == 0) && (HuffTable[i].Freq < HuffTable[leftNo].Freq)) in MI_CompressHuffman()834 leftNo = i; in MI_CompressHuffman()840 if ((HuffTable[i].Freq != 0) && (HuffTable[i].PaNo == 0) && (i != leftNo)) in MI_CompressHuffman()850 (HuffTable[i].Freq < HuffTable[rightNo].Freq) && (i != leftNo)) in MI_CompressHuffman()861 HuffTable[tableTop].Freq = HuffTable[leftNo].Freq; in MI_CompressHuffman()[all …]