583 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );
777     s32     leftNo, rightNo;         // Node's numbers at time of binary tree's creation  in HuffConstructTree()  local
783     rightNo = -1;  in HuffConstructTree()
816             if ( rightNo < 0 )  in HuffConstructTree()
818                 rightNo = i;  in HuffConstructTree()
820             else if ( table[i].Freq < table[rightNo].Freq )  in HuffConstructTree()
822                 rightNo = i;  in HuffConstructTree()
827         if ( rightNo < 0 )  in HuffConstructTree()
850         table[ tableTop ].Freq = table[ leftNo ].Freq + table[ rightNo ].Freq;  in HuffConstructTree()
852         table[ tableTop ].ChNo[1] = (s16)rightNo;  in HuffConstructTree()
853         if ( table[ leftNo ].LeafDepth > table[ rightNo ].LeafDepth )  in HuffConstructTree()
859             table[ tableTop ].LeafDepth = (u16)( table[ rightNo ].LeafDepth + 1 );  in HuffConstructTree()
862         table[ leftNo  ].PaNo = table[ rightNo ].PaNo = (s16)(tableTop);  in HuffConstructTree()
864         table[ rightNo ].Bit  = 1;  in HuffConstructTree()
866         HuffAddParentDepthToTable( table, (u16)leftNo, (u16)rightNo );  in HuffConstructTree()
869         leftNo = rightNo = -1;  in HuffConstructTree()
884 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo )  in HuffAddParentDepthToTable()  argument
887     table[ rightNo ].PaDepth++;  in HuffAddParentDepthToTable()
893     if ( table[ rightNo ].LeafDepth != 0 )  in HuffAddParentDepthToTable()
895 …  HuffAddParentDepthToTable( table, (u16)table[ rightNo ].ChNo[0], (u16)table[ rightNo ].ChNo[1] );  in HuffAddParentDepthToTable()