Lines Matching refs:rightNo
694 static void HuffUpdateParentDepth(u16 leftNo, u16 rightNo);
766 s32 leftNo, rightNo; // Node number for creating binary tree in MI_CompressHuffman() local
816 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()
882 if (HuffTable[leftNo].LeafDepth > HuffTable[rightNo].LeafDepth) in MI_CompressHuffman()
888 HuffTable[tableTop].LeafDepth = (u16)(HuffTable[rightNo].LeafDepth + 1); in MI_CompressHuffman()
891 HuffTable[leftNo].PaNo = HuffTable[rightNo].PaNo = (s16)tableTop; in MI_CompressHuffman()
893 HuffTable[rightNo].Bit = 1; in MI_CompressHuffman()
895 HuffUpdateParentDepth((u16)leftNo, (u16)rightNo); in MI_CompressHuffman()
898 leftNo = rightNo = -1; in MI_CompressHuffman()
1295 static void HuffUpdateParentDepth(u16 leftNo, u16 rightNo) in HuffUpdateParentDepth() argument
1298 HuffTable[rightNo].PaDepth++; in HuffUpdateParentDepth()
1304 if (HuffTable[rightNo].LeafDepth != 0) in HuffUpdateParentDepth()
1306 HuffUpdateParentDepth((u16)HuffTable[rightNo].ChNo[0], (u16)HuffTable[rightNo].ChNo[1]); in HuffUpdateParentDepth()