Lines Matching refs:ChNo

548     s16 ChNo[2];                       // Child Number (0: left side, 1: right side)  member
833 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
834 table[ tableTop ].ChNo[1] = (s16)leftNo; in HuffConstructTree()
851 table[ tableTop ].ChNo[0] = (s16)leftNo; in HuffConstructTree()
852 table[ tableTop ].ChNo[1] = (s16)rightNo; in HuffConstructTree()
891 … HuffAddParentDepthToTable( table, (u16)table[ leftNo ].ChNo[0], (u16)table[ leftNo ].ChNo[1] ); in HuffAddParentDepthToTable()
895 … HuffAddParentDepthToTable( table, (u16)table[ rightNo ].ChNo[0], (u16)table[ rightNo ].ChNo[1] ); in HuffAddParentDepthToTable()
908 HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[0], table[ nodeNo ].HuffCode ); in HuffAddCodeToTable()
909 HuffAddCodeToTable( table, (u16)table[ nodeNo ].ChNo[1], table[ nodeNo ].HuffCode ); in HuffAddCodeToTable()
929 leftHWord = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[0] ); in HuffAddCountHWordToTable()
930 rightHWord = HuffAddCountHWordToTable( table, (u16)table[nodeNo].ChNo[1] ); in HuffAddCountHWordToTable()
1177 if ( huffTable[ huffTable[nodeNo].ChNo[0] ].LeafDepth == 0) in HuffSetOneNodeOffset()
1180 huffTree[ huffTreeTop * 2 + 0 ] = (u8)huffTable[ nodeNo ].ChNo[0]; in HuffSetOneNodeOffset()
1181 huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u8)huffTable[ nodeNo ].ChNo[0]; in HuffSetOneNodeOffset()
1186 … huffTreeCtrl[ huffTreeTop ].leftNodeNo = (u16)huffTable[ nodeNo ].ChNo[0]; // Offset is required in HuffSetOneNodeOffset()
1190 if ( huffTable[ huffTable[ nodeNo ].ChNo[1] ].LeafDepth == 0 ) in HuffSetOneNodeOffset()
1193 huffTree[ huffTreeTop * 2 + 1 ] = (u8)huffTable[nodeNo].ChNo[1]; in HuffSetOneNodeOffset()
1194 huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u8)huffTable[ nodeNo ].ChNo[1]; in HuffSetOneNodeOffset()
1199 … huffTreeCtrl[ huffTreeTop ].rightNodeNo = (u16)huffTable[ nodeNo ].ChNo[1]; // Offset is required in HuffSetOneNodeOffset()