Searched refs:BlockMap (Results 1 – 8 of 8) sorted by relevance
153 auto MapIt = BlockMap.find(Block);154 if (MapIt == BlockMap.end())215 Info.BlockMap.try_emplace(HeaderCandidate, NewCycle.get()); in run()267 Info.BlockMap.try_emplace(Block, NewCycle.get()); in run()350 BlockMap.clear(); in clear()374 auto MapIt = BlockMap.find(Block);375 if (MapIt != BlockMap.end())420 auto MapIt = BlockMap.find(Block); in validateTree()421 check(MapIt != BlockMap.end()); in validateTree()446 for (const auto &Entry : BlockMap) { in validateTree()
238 DenseMap<BlockT *, CycleT *> BlockMap; variable
47 typedef std::map<lldb::addr_t, lldb::DataBufferSP> BlockMap; typedef52 BlockMap m_L1_cache; // A first level memory cache whose chunk sizes vary that55 BlockMap m_L2_cache; // A memory cache of fixed size chinks
457 DenseMap<const BasicBlock *, BasicBlockState *> BlockMap; member in __anonae928f960311::GCPtrTracker489 return BlockMap.find(BB) != BlockMap.end(); in isMapped()555 BlockMap[&BB] = BBS; in GCPtrTracker()560 for (auto &BBI : BlockMap) { in GCPtrTracker()572 return BlockMap.lookup(BB); in getBasicBlockState()618 for (auto &BBI : BlockMap) in recalculateBBsStates()687 if (BlockMap[InBB]->AvailableOut.count(InValue)) in removeValidUnrelocatedDefs()
62 BlockMap::iterator pos = m_L1_cache.upper_bound(addr); in Flush()94 BlockMap::iterator pos = m_L2_cache.find(curr_addr); in Flush()140 BlockMap::iterator pos = m_L1_cache.upper_bound(addr); in Read()182 BlockMap::const_iterator pos = m_L2_cache.find(curr_addr); in Read()183 BlockMap::const_iterator end = m_L2_cache.end(); in Read()
403 return BlockMap[B->getBlockID()]; in lookupBlock()519 std::vector<til::BasicBlock *> BlockMap; variable
855 BlockMap.resize(NBlocks, nullptr); in enterCFG()860 BlockMap[B->getBlockID()] = BB; in enterCFG()896 CurrentBB->addPredecessor(BlockMap[Pred->getBlockID()]); in handlePredecessor()
1511 NonLocalDepInfo &BlockMap = NLDI->second.first; in removeInstruction() local1512 for (auto &Entry : BlockMap) in removeInstruction()