Searched refs:rightNo (Results 1 – 1 of 1) sorted by relevance
555 void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );752 s32 leftNo, rightNo; // Node number for creating binary tree in HuffConstructTree() local758 rightNo = -1; in HuffConstructTree()791 if ( rightNo < 0 ) in HuffConstructTree()793 rightNo = i; in HuffConstructTree()795 else if ( table[i].Freq < table[rightNo].Freq ) in HuffConstructTree()797 rightNo = i; in HuffConstructTree()802 if ( rightNo < 0 ) in HuffConstructTree()825 table[ tableTop ].Freq = table[ leftNo ].Freq + table[ rightNo ].Freq; in HuffConstructTree()827 table[ tableTop ].ChNo[1] = (s16)rightNo; in HuffConstructTree()[all …]