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()
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()
862                 HuffTable[tableTop].ChNo[0] = (s16)leftNo;  in MI_CompressHuffman()
863                 HuffTable[tableTop].ChNo[1] = (s16)leftNo;  in MI_CompressHuffman()
865                 HuffTable[leftNo].PaNo = (s16)tableTop;  in MI_CompressHuffman()
866                 HuffTable[leftNo].Bit = 0;  in MI_CompressHuffman()
867                 HuffTable[leftNo].PaDepth = 1;  in MI_CompressHuffman()
879         HuffTable[tableTop].Freq = HuffTable[leftNo].Freq + HuffTable[rightNo].Freq;  in MI_CompressHuffman()
880         HuffTable[tableTop].ChNo[0] = (s16)leftNo;  in MI_CompressHuffman()
882         if (HuffTable[leftNo].LeafDepth > HuffTable[rightNo].LeafDepth)  in MI_CompressHuffman()
884             HuffTable[tableTop].LeafDepth = (u16)(HuffTable[leftNo].LeafDepth + 1);  in MI_CompressHuffman()
891         HuffTable[leftNo].PaNo = HuffTable[rightNo].PaNo = (s16)tableTop;  in MI_CompressHuffman()
892         HuffTable[leftNo].Bit = 0;  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
1297     HuffTable[leftNo].PaDepth++;  in HuffUpdateParentDepth()
1300     if (HuffTable[leftNo].LeafDepth != 0)  in HuffUpdateParentDepth()
1302         HuffUpdateParentDepth((u16)HuffTable[leftNo].ChNo[0], (u16)HuffTable[leftNo].ChNo[1]);  in HuffUpdateParentDepth()