Searched refs:rootNo (Results 1 – 1 of 1) sorted by relevance
697 static void HuffMakeHuffTree(u16 rootNo);771 u16 rootNo; // Binary tree's root number in MI_CompressHuffman() local873 rootNo = tableTop; in MI_CompressHuffman()874 nodeNum = (u16)((rootNo - sHuffDataNum + 1) * 2 + 1); in MI_CompressHuffman()902 …HuffMakeCode(rootNo, 0x00); // The Huffman code is the code with HuffCode's lower bit maske… in MI_CompressHuffman()905 (void)HuffCountHWord(rootNo); in MI_CompressHuffman()908 HuffMakeHuffTree(rootNo); in MI_CompressHuffman()1021 static void HuffMakeHuffTree(u16 rootNo) in HuffMakeHuffTree() argument1044 HuffTreeCtrl[0].rightNodeNo = rootNo; in HuffMakeHuffTree()