Searched refs:leftNo (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() local757 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()[all …]