Lines Matching refs:leftNo

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
782 leftNo = -1; in HuffConstructTree()
796 if ( leftNo < 0 ) in HuffConstructTree()
798 leftNo = i; in HuffConstructTree()
800 else if ( table[i].Freq < table[ leftNo ].Freq ) in HuffConstructTree()
802 leftNo = i; in HuffConstructTree()
811 ( i == leftNo ) ) in HuffConstructTree()
832 table[ tableTop ].Freq = table[ leftNo ].Freq; in HuffConstructTree()
833 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
834 table[ tableTop ].ChNo[1] = (s16)leftNo; in HuffConstructTree()
836 table[ leftNo ].PaNo = (s16)tableTop; in HuffConstructTree()
837 table[ leftNo ].Bit = 0; in HuffConstructTree()
838 table[ leftNo ].PaDepth = 1; in HuffConstructTree()
850 table[ tableTop ].Freq = table[ leftNo ].Freq + table[ rightNo ].Freq; in HuffConstructTree()
851 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
853 if ( table[ leftNo ].LeafDepth > table[ rightNo ].LeafDepth ) in HuffConstructTree()
855 table[ tableTop ].LeafDepth = (u16)( table[ leftNo ].LeafDepth + 1 ); in HuffConstructTree()
862 table[ leftNo ].PaNo = table[ rightNo ].PaNo = (s16)(tableTop); in HuffConstructTree()
863 table[ leftNo ].Bit = 0; 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
886 table[ leftNo ].PaDepth++; in HuffAddParentDepthToTable()
889 if ( table[ leftNo ].LeafDepth != 0 ) in HuffAddParentDepthToTable()
891 … HuffAddParentDepthToTable( table, (u16)table[ leftNo ].ChNo[0], (u16)table[ leftNo ].ChNo[1] ); in HuffAddParentDepthToTable()