Searched refs:leftNo (Results 1 – 1 of 1) sorted by relevance
518 static void HuffAddParentDepthToTable( HuffData *table, u16 leftNo, u16 rightNo );700 s32 leftNo, rightNo; // Node number for creating binary tree in HuffConstructTree() local705 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()[all …]