Lines Matching refs:treep
371 u8* treep = (u8*)pTable; in VerifyHuffmanTable() local
372 u8* treeStartp = treep + 1; in VerifyHuffmanTable()
373 u32 treeSize = *treep; in VerifyHuffmanTable()
393 treep = treeStartp; in VerifyHuffmanTable()
394 while ( treep < treeEndp ) in VerifyHuffmanTable()
398 u32 offset = (u32)( ( (*treep & 0x3F) + 1 ) << 1); in VerifyHuffmanTable()
399 u8* nodep = (u8*)( (((u32)treep >> 1) << 1) + offset ); in VerifyHuffmanTable()
402 if ( *treep == 0 && idx >= (treeSize * 2) ) in VerifyHuffmanTable()
411 if ( *treep & 0x80 ) in VerifyHuffmanTable()
416 if ( *treep & 0x40 ) in VerifyHuffmanTable()
424 ++treep; in VerifyHuffmanTable()
490 u8 *treep = (destCount != 0)? ((u8*)pSrc + 4) : ((u8*)pSrc + 8); in SecureUncompressHuffman() local
491 u8 *treeStartp = treep + 1; in SecureUncompressHuffman()
497 u32 treeSize = (u32)( (*treep + 1) << 1 ); in SecureUncompressHuffman()
521 if ( ! internal::VerifyHuffmanTable(treep, (u8)dataBit) ) in SecureUncompressHuffman()
526 pSrc = (u32*)( treep + treeSize ); in SecureUncompressHuffman()
534 treep = treeStartp; in SecureUncompressHuffman()
549 u32 treeCheck = *treep; in SecureUncompressHuffman()
551 treep = (u8*)( (((u32)treep >> 1) << 1) + (((*treep & 0x3f) + 1) << 1) + treeShift ); in SecureUncompressHuffman()
555 destTmp |= *treep << (32 - dataBit); in SecureUncompressHuffman()
556 treep = treeStartp; in SecureUncompressHuffman()
815 u16* treep = (u16*)pTable; in LHVerifyTable() local
816 u16* treeStartp = treep + 1; in LHVerifyTable()
817 u32 treeSize = *treep; in LHVerifyTable()
836 treep = treeStartp; in LHVerifyTable()
837 while ( treep < treeEndp ) in LHVerifyTable()
841 u32 offset = (u32)( ( (*treep & ofs_mask) + 1 ) << 1 ); in LHVerifyTable()
842 u16* nodep = (u16*)((u32)treep & ~0x3) + offset; in LHVerifyTable()
845 if ( *treep == 0 && idx >= treeSize - 4 ) in LHVerifyTable()
853 if ( *treep & l_mask ) in LHVerifyTable()
858 if ( *treep & r_mask ) in LHVerifyTable()
866 ++treep; in LHVerifyTable()