Lines Matching refs:leftNo

555 void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );
752 s32 leftNo, rightNo; // Node number for creating binary tree in HuffConstructTree() local
757 leftNo = -1; in HuffConstructTree()
771 if ( leftNo < 0 ) in HuffConstructTree()
773 leftNo = i; in HuffConstructTree()
775 else if ( table[i].Freq < table[ leftNo ].Freq ) in HuffConstructTree()
777 leftNo = i; in HuffConstructTree()
786 ( i == leftNo ) ) in HuffConstructTree()
807 table[ tableTop ].Freq = table[ leftNo ].Freq; in HuffConstructTree()
808 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
809 table[ tableTop ].ChNo[1] = (s16)leftNo; in HuffConstructTree()
811 table[ leftNo ].PaNo = (s16)tableTop; in HuffConstructTree()
812 table[ leftNo ].Bit = 0; in HuffConstructTree()
813 table[ leftNo ].PaDepth = 1; in HuffConstructTree()
825 table[ tableTop ].Freq = table[ leftNo ].Freq + table[ rightNo ].Freq; in HuffConstructTree()
826 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
828 if ( table[ leftNo ].LeafDepth > table[ rightNo ].LeafDepth ) in HuffConstructTree()
830 table[ tableTop ].LeafDepth = (u16)( table[ leftNo ].LeafDepth + 1 ); in HuffConstructTree()
837 table[ leftNo ].PaNo = table[ rightNo ].PaNo = (s16)(tableTop); in HuffConstructTree()
838 table[ leftNo ].Bit = 0; in HuffConstructTree()
841 HuffAddParentDepthToTable( table, (u16)leftNo, (u16)rightNo ); in HuffConstructTree()
844 leftNo = rightNo = -1; in HuffConstructTree()
859 void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo ) in HuffAddParentDepthToTable() argument
861 table[ leftNo ].PaDepth++; in HuffAddParentDepthToTable()
864 if ( table[ leftNo ].LeafDepth != 0 ) in HuffAddParentDepthToTable()
866 … HuffAddParentDepthToTable( table, (u16)table[ leftNo ].ChNo[0], (u16)table[ leftNo ].ChNo[1] ); in HuffAddParentDepthToTable()