Lines Matching refs:treep
420 u8* treep = (u8*)pTable; in MIi_VerifyHuffmanTable_() local
421 u8* treeStartp = treep + 1; in MIi_VerifyHuffmanTable_()
422 u32 treeSize = *treep; in MIi_VerifyHuffmanTable_()
442 treep = treeStartp; in MIi_VerifyHuffmanTable_()
443 while ( treep < treeEndp ) in MIi_VerifyHuffmanTable_()
447 u32 offset = (u32)( ( (*treep & 0x3F) + 1 ) << 1); in MIi_VerifyHuffmanTable_()
448 u8* nodep = (u8*)( (((u32)treep >> 1) << 1) + offset ); in MIi_VerifyHuffmanTable_()
451 if ( *treep == 0 && idx >= (treeSize * 2) ) in MIi_VerifyHuffmanTable_()
460 if ( *treep & 0x80 ) in MIi_VerifyHuffmanTable_()
465 if ( *treep & 0x40 ) in MIi_VerifyHuffmanTable_()
473 ++treep; in MIi_VerifyHuffmanTable_()
534 u8 *treep = (destCount != 0)? ((u8*)pSrc + 4) : ((u8*)pSrc + 8); in MI_SecureUncompressHuffman() local
535 u8 *treeStartp = treep + 1; in MI_SecureUncompressHuffman()
541 u32 treeSize = (u32)( (*treep + 1) << 1 ); in MI_SecureUncompressHuffman()
565 if ( ! MIi_VerifyHuffmanTable_(treep, (u8)dataBit) ) in MI_SecureUncompressHuffman()
570 pSrc = (u32*)( treep + treeSize ); in MI_SecureUncompressHuffman()
583 treep = treeStartp; in MI_SecureUncompressHuffman()
598 u32 treeCheck = *treep; in MI_SecureUncompressHuffman()
600 treep = (u8*)( (((u32)treep >> 1) << 1) + (((*treep & 0x3f) + 1) << 1) + treeShift ); in MI_SecureUncompressHuffman()
604 destTmp |= *treep << (32 - dataBit); in MI_SecureUncompressHuffman()
605 treep = treeStartp; in MI_SecureUncompressHuffman()