Searched refs:treep (Results 1 – 3 of 3) sorted by relevance
420 u8* treep = (u8*)pTable; in MIi_VerifyHuffmanTable_() local421 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_()[all …]
89 context->treep = &context->tree[0]; in MI_InitUncompContextHuffman()631 … ldr r5, [r0, #MIUncompContextHuffman.treep] // r5: treep = context->treep; in MI_ReadUncompHuffman()719 … str r5, [r0, #MIUncompContextHuffman.treep] // r5: context->treep = treep; in MI_ReadUncompHuffman()
62 …u8 *treep; // Huffman encoding table, current pointer … member