Searched refs:rightNo (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()842 rightNo = i; in MI_CompressHuffman()846 for (i = (u16)rightNo; i < tableTop; i++) in MI_CompressHuffman()850 (HuffTable[i].Freq < HuffTable[rightNo].Freq) && (i != leftNo)) in MI_CompressHuffman()852 rightNo = i; in MI_CompressHuffman()856 if (rightNo < 0) in MI_CompressHuffman()879 HuffTable[tableTop].Freq = HuffTable[leftNo].Freq + HuffTable[rightNo].Freq; in MI_CompressHuffman()881 HuffTable[tableTop].ChNo[1] = (s16)rightNo; in MI_CompressHuffman()[all …]