Lines Matching refs:leftNo
518 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );
700 s32 leftNo, rightNo; // Node number for creating binary tree in HuffConstructTree() local
705 leftNo = -1; in HuffConstructTree()
719 if ( leftNo < 0 ) in HuffConstructTree()
721 leftNo = i; in HuffConstructTree()
723 else if ( table[i].Freq < table[ leftNo ].Freq ) in HuffConstructTree()
725 leftNo = i; in HuffConstructTree()
734 ( i == leftNo ) ) in HuffConstructTree()
755 table[ tableTop ].Freq = table[ leftNo ].Freq; in HuffConstructTree()
756 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
757 table[ tableTop ].ChNo[1] = (s16)leftNo; in HuffConstructTree()
759 table[ leftNo ].PaNo = (s16)tableTop; in HuffConstructTree()
760 table[ leftNo ].Bit = 0; in HuffConstructTree()
761 table[ leftNo ].PaDepth = 1; in HuffConstructTree()
773 table[ tableTop ].Freq = table[ leftNo ].Freq + table[ rightNo ].Freq; in HuffConstructTree()
774 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
776 if ( table[ leftNo ].LeafDepth > table[ rightNo ].LeafDepth ) in HuffConstructTree()
778 table[ tableTop ].LeafDepth = (u16)( table[ leftNo ].LeafDepth + 1 ); in HuffConstructTree()
785 table[ leftNo ].PaNo = table[ rightNo ].PaNo = (s16)(tableTop); in HuffConstructTree()
786 table[ leftNo ].Bit = 0; in HuffConstructTree()
789 HuffAddParentDepthToTable( table, (u16)leftNo, (u16)rightNo ); in HuffConstructTree()
792 leftNo = rightNo = -1; in HuffConstructTree()
807 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo ) in HuffAddParentDepthToTable() argument
809 table[ leftNo ].PaDepth++; in HuffAddParentDepthToTable()
812 if ( table[ leftNo ].LeafDepth != 0 ) in HuffAddParentDepthToTable()
814 … HuffAddParentDepthToTable( table, (u16)table[ leftNo ].ChNo[0], (u16)table[ leftNo ].ChNo[1] ); in HuffAddParentDepthToTable()