Home
last modified time | relevance | path

Searched refs:getEntry (Results 1 – 25 of 83) sorted by relevance

1234

/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DDwarfStringPoolEntry.h73 assert(getEntry().Symbol && "No symbol available!"); in getSymbol()
74 return getEntry().Symbol; in getSymbol()
78 uint64_t getOffset() const { return getEntry().Offset; } in getOffset()
82 assert(getEntry().isIndexed() && "Index is not set!"); in getIndex()
83 return getEntry().Index; in getIndex()
95 const DwarfStringPoolEntry &getEntry() const { in getEntry() function
H A DNonRelocatableStringpool.h35 EmptyString = getEntry(""); in Translator()
38 DwarfStringPoolEntryRef getEntry(StringRef S);
42 uint64_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); } in getStringOffset()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp47 df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyBlocksInRegion()
99 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion()
119 df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyRegionRec()
228 VPBlockRecursiveTraversalWrapper<const VPBlockBase *>(Plan.getEntry())); in verifyPlanIsValid()
239 const VPBasicBlock *Entry = dyn_cast<VPBasicBlock>(TopRegion->getEntry()); in verifyPlanIsValid()
274 Plan.getEntry())))) { in verifyPlanIsValid()
275 if (Region->getEntry()->getNumPredecessors() != 0) { in verifyPlanIsValid()
H A DVPlanTransforms.cpp28 RPOT(Plan->getEntry()); in VPInstructionsToVPRecipes()
106 VPBlockRecursiveTraversalWrapper<VPBlockBase *>(Plan.getEntry())); in sinkScalarOperands()
187 auto *EntryBB = dyn_cast<VPBasicBlock>(R->getEntry()); in getPredicatedMask()
197 auto *EntryBB = cast<VPBasicBlock>(R->getEntry()); in getPredicatedThenBlock()
223 VPBlockRecursiveTraversalWrapper<VPBlockBase *>(Plan.getEntry())))); in mergeReplicateRegions()
366 RPOT(Plan.getEntry()); in removeDeadRecipes()
421 make_early_inc_range(*Plan.getEntry()->getEntryBasicBlock())) { in removeRedundantExpandSCEVRecipes()
H A DVPlan.cpp142 Block = Region->getEntry(); in getEntryBasicBlock()
149 Block = Region->getEntry(); in getEntryBasicBlock()
154 assert(ParentPlan->getEntry() == this && in setPlan()
185 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors()
764 for (const VPBlockBase *Block : depth_first(getEntry())) { in print()
866 for (const VPBlockBase *Block : depth_first(Plan.getEntry())) in dump()
950 assert(Region->getEntry() && "Region contains no inner blocks."); in dumpRegion()
951 for (const VPBlockBase *Block : depth_first(Region->getEntry())) in dumpRegion()
1020 ReversePostOrderTraversal<VPBlockBase *> RPOT(Region->getEntry()); in visitRegion()
1085 Plan.getEntry())); in assignSlots()
[all …]
H A DVPlan.h2182 const VPBlockBase *getEntry() const { return Entry; } in getEntry() function
2183 VPBlockBase *getEntry() { return Entry; } in getEntry() function
2313 return nodes_iterator::begin(N->getEntry());
2332 return nodes_iterator::begin(N->getEntry());
2390 return R->getEntry();
2447 BlockTy getEntry() { return Entry; }
2462 return N.getEntry();
2481 return N.getEntry();
2575 VPBlockBase *getEntry() { return Entry; }
2576 const VPBlockBase *getEntry() const { return Entry; }
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DRegionIterator.h111 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
114 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
124 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
150 while (BItor != BlockTraits::child_end(getNode()->getEntry())
191 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
197 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()
204 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator()
235 while (Itor != succ_end(Node->getEntry())
294 return R->getNode(R->getEntry()); \
310 return R->getBBNode(R->getEntry()); \
H A DRegionInfoImpl.h68 BlockT *OldEntry = getEntry(); in replaceEntryRecursive()
77 if (Child->getEntry() == OldEntry) in replaceEntryRecursive()
108 BlockT *entry = getEntry(), *exit = getExit(); in contains()
162 BlockT *entry = getEntry(); in getEnteringBlock()
232 if (getEntry()->getName().empty()) { in getNameStr()
235 getEntry()->printAsOperand(OS, false); in getNameStr()
257 BlockT *entry = getEntry(), *exit = getExit(); in verifyBBInRegion()
300 verifyWalk(getEntry(), &visited); in verifyRegion()
350 if (R->getEntry() != BB) in getSubRegionNode()
465 if (R->getEntry() != exit) { in getExpandedRegion()
[all …]
H A DRegionInfo.h174 inline BlockT *getEntry() const { return entry.getPointer(); }
322 BlockT *getEntry() const {
323 return RegionNodeBase<Tr>::getEntry();
459 return contains(SubRegion->getEntry()) &&
609 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
614 return const_block_iterator(getEntry(), getExit());
998 return getEntry();
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp429 Loops[Exit] = N->getEntry(); in analyzeLoops()
458 BasicBlock *BB = N->getEntry(); in gatherPredicates()
504 BasicBlock *Entry = R->getEntry(); in gatherPredicates()
534 Visited.insert(RN->getEntry()); in collectInfos()
756 Order.back()->getEntry(); in getNextFlow()
766 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix()
837 Visited.insert(Node->getEntry()); in wireFlow()
850 BasicBlock *Entry = Node->getEntry(); in wireFlow()
872 BasicBlock *LoopStart = Node->getEntry(); in handleLoops()
882 LoopEnd = Loops[Node->getEntry()]; in handleLoops()
[all …]
/llvm-project-15.0.7/llvm/unittests/Transforms/Vectorize/
H A DVPlanSlpTest.cpp100 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
172 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
244 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
308 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
445 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
517 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
589 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
665 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
726 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
789 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
[all …]
H A DVPlanHCFGTest.cpp44 VPBasicBlock *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
172 VPBlockBase *Entry = Plan->getEntry()->getEntryBasicBlock(); in TEST_F()
/llvm-project-15.0.7/lldb/source/Plugins/SymbolFile/DWARF/
H A DDebugNamesDWARFIndex.cpp110 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
111 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
134 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
135 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
276 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetFunctions()
277 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetFunctions()
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp397 MachineBasicBlock *getEntry();
552 MachineBasicBlock *getEntry() { in getEntry() function in __anonde98b0ec0211::RegionMRT
1227 MachineBasicBlock *Entry = Region->getEntry(); in regionIsSimpleIf()
1249 MachineBasicBlock *Entry = Region->getEntry(); in transformSimpleIfRegion()
1648 auto Entry = Region->getEntry(); in rewriteRegionEntryPHIs()
2333 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); in createIfRegion()
2495 MachineBasicBlock *Entry = LRegion->getEntry(); in splitEntry()
2525 LRegion->setEntry(Region->getEntry()); in initLinearizedRegion()
2682 if (isFunctionEntryBlock(LRegion->getEntry())) { in structurizeComplexRegion()
2683 resolvePHIInfos(LRegion->getEntry()); in structurizeComplexRegion()
[all …]
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DRegionPass.cpp94 PassManagerPrettyStackEntry X(P, *CurrentRegion->getEntry()); in runOnFunction()
192 if (!isFunctionInPrintList(R->getEntry()->getParent()->getName())) in runOnRegion()
284 Function &F = *R.getEntry()->getParent(); in skipRegion()
291 if (R.getEntry() == &F.getEntryBlock()) in skipRegion()
H A DRegionPrinter.cpp77 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes()
82 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes()
223 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent(); in viewRegionInfo()
/llvm-project-15.0.7/polly/lib/CodeGen/
H A DUtils.cpp81 PollyIRBuilder Builder(S.getEntry()); in executeScopConditionally()
97 BasicBlock *EntryBB = S.getEntry(); in executeScopConditionally()
149 BranchInst *CondBr = Builder.CreateCondBr(RTC, StartBlock, S.getEntry()); in executeScopConditionally()
/llvm-project-15.0.7/llvm/unittests/CodeGen/
H A DDwarfStringPoolEntryRefTest.cpp79 EXPECT_TRUE(isEntryEqual(Ref1.getEntry(), DwarfEntry1)); in TEST()
84 EXPECT_TRUE(isEntryEqual(Ref2.getEntry(), DwarfEntry1)); in TEST()
101 EXPECT_TRUE(isEntryEqual(Ref3.getEntry(), DwarfEntry2)); in TEST()
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/
H A DSnippetRepetitor.cpp31 auto Entry = Filler.getEntry(); in Repeat()
62 auto Entry = Filler.getEntry(); in Repeat()
/llvm-project-15.0.7/clang/unittests/Analysis/
H A DCFGDominatorTree.cpp47 EXPECT_EQ(EntryBlock, &cfg->getEntry()); in TEST()
140 EXPECT_EQ(EntryBlock, &cfg->getEntry()); in TEST()
/llvm-project-15.0.7/polly/lib/Analysis/
H A DScopGraphPrinter.cpp50 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes()
55 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes()
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp153 return RegInfos.front().R->getEntry(); in getEntryBlock()
672 BasicBlock *EntryBB = R->getEntry(); in getBranchInsertPoint()
708 BasicBlock *Entry = R->getEntry(); in findScope()
799 BasicBlock *BB = E->getEntry(); in findScope()
867 BasicBlock *EntryBB = R->getEntry(); in checkScopeHoistable()
1328 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1381 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in setCHRRegions()
1481 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in hoistScopeConditions()
1639 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in assertBranchOrSelectConditionHoisted()
1671 BasicBlock *EntryBlock = FirstRegion->getEntry(); in transformScopes()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.h56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
/llvm-project-15.0.7/polly/lib/Support/
H A DScopHelper.cpp43 BasicBlock *Entry = R->getEntry(); in simplifyRegionEntry()
82 while (!AncestorR->isTopLevelRegion() && AncestorR->getEntry() == Entry) { in simplifyRegionEntry()
437 Loop *L = LI.getLoopFor(S.getEntry()); in getLoopSurroundingScop()
499 Loop *L = LI.getLoopFor(NonAffineSubRegion->getEntry()); in getRegionNodeLoop()
559 for (BasicBlock &I : *R.getEntry()->getParent()) in isHoistableLoad()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DNonRelocatableStringpool.cpp14 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { in getEntry() function in llvm::NonRelocatableStringpool

1234