Searched refs:treep (Results 1 – 4 of 4) sorted by relevance
371 u8* treep = (u8*)pTable; in VerifyHuffmanTable() local372 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()[all …]
329 u8 *treep = (destCount != 0)? ((u8*)pSrc + 4) : ((u8*)pSrc + 8); in UncompressHuffman() local330 u8 *treeStartp = treep + 1; in UncompressHuffman()341 pSrc = (u32*)( treep + ((*treep + 1) << 1) ); in UncompressHuffman()342 treep = treeStartp; in UncompressHuffman()351 u32 treeCheck = *treep; in UncompressHuffman()353 treep = (u8*)( (((u32)treep >> 1) << 1) + (((*treep & 0x3f) + 1) << 1) + treeShift ); in UncompressHuffman()357 destTmp |= *treep << (32 - dataBit); in UncompressHuffman()358 treep = treeStartp; in UncompressHuffman()
116 context->treep = &context->tree[ 0 ]; in InitUncompContextHuffman()538 *context->treep++ = *srcp++; in ReadUncompHuffman()549 *context->treep++ = *srcp++; in ReadUncompHuffman()554 context->treep = &context->tree[ 1 ]; in ReadUncompHuffman()581 endFlag = (*context->treep << select) & TREE_END_MASK; in ReadUncompHuffman()582 context->treep = GetNextNode( context->treep, select ); in ReadUncompHuffman()594 context->destTmp |= *context->treep << ( 32 - context->bitSize ); in ReadUncompHuffman()595 context->treep = &context->tree[ 1 ]; in ReadUncompHuffman()
71 u8 *treep; // member