Lines Matching refs:treep
359 u8* treep = (u8*)pTable; in CXiVerifyHuffmanTable_() local
360 u8* treeStartp = treep + 1; in CXiVerifyHuffmanTable_()
361 u32 treeSize = *treep; in CXiVerifyHuffmanTable_()
381 treep = treeStartp; in CXiVerifyHuffmanTable_()
382 while ( treep < treeEndp ) in CXiVerifyHuffmanTable_()
386 u32 offset = (u32)( ( (*treep & 0x3F) + 1 ) << 1); in CXiVerifyHuffmanTable_()
387 u8* nodep = (u8*)( (((u32)treep >> 1) << 1) + offset ); in CXiVerifyHuffmanTable_()
390 if ( *treep == 0 && idx >= (treeSize * 2) ) in CXiVerifyHuffmanTable_()
399 if ( *treep & 0x80 ) in CXiVerifyHuffmanTable_()
404 if ( *treep & 0x40 ) in CXiVerifyHuffmanTable_()
412 ++treep; in CXiVerifyHuffmanTable_()
472 u8 *treep = (destCount != 0)? ((u8*)pSrc + 4) : ((u8*)pSrc + 8); in CXSecureUncompressHuffman() local
473 u8 *treeStartp = treep + 1; in CXSecureUncompressHuffman()
479 u32 treeSize = (u32)( (*treep + 1) << 1 ); in CXSecureUncompressHuffman()
503 if ( ! CXiVerifyHuffmanTable_(treep, (u8)dataBit) ) in CXSecureUncompressHuffman()
508 pSrc = (u32*)( treep + treeSize ); in CXSecureUncompressHuffman()
516 treep = treeStartp; in CXSecureUncompressHuffman()
531 u32 treeCheck = *treep; in CXSecureUncompressHuffman()
533 treep = (u8*)( (((u32)treep >> 1) << 1) + (((*treep & 0x3f) + 1) << 1) + treeShift ); in CXSecureUncompressHuffman()
537 destTmp |= *treep << (32 - dataBit); in CXSecureUncompressHuffman()
538 treep = treeStartp; in CXSecureUncompressHuffman()