Home
last modified time | relevance | path

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

1234

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DDwarfStringPoolEntry.h76 assert(getEntry().Symbol && "No symbol available!");
77 return getEntry().Symbol;
81 uint64_t getOffset() const { return getEntry().Offset; } in getIndex()
85 assert(getEntry().isIndexed() && "Index is not set!");
86 return getEntry().Index;
98 const DwarfStringPoolEntry &getEntry() const { in getEntry()
95 const DwarfStringPoolEntry &getEntry() const { getEntry() function
H A DNonRelocatableStringpool.h33 getEntry("");
36 LLVM_ABI DwarfStringPoolEntryRef getEntry(StringRef S);
40 uint64_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); } in getStringOffset()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h58 return R->getEntry(); in deref()
122 BlockTy getEntry() { return Entry; } in getEntry() function
135 return N.getEntry();
154 return N.getEntry();
173 BlockTy getEntry() { return Entry; }
181 return N.getEntry();
200 return N.getEntry();
306 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); }
309 return nodes_iterator::begin(N->getEntry());
315 return nodes_iterator::end(N->getEntry());
H A DVPlanVerifier.cpp390 for (const VPBlockBase *VPB : vp_depth_first_shallow(Region->getEntry())) { in verifyBlocksInRegion()
404 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion()
423 all_of(vp_depth_first_shallow(Region->getEntry()), in verifyRegionRec()
431 if (any_of(vp_depth_first_shallow(Plan.getEntry()), in verify()
448 const VPBasicBlock *Entry = dyn_cast<VPBasicBlock>(TopRegion->getEntry()); in verify()
H A DVPlanUnroll.cpp133 auto PartI = vp_depth_first_shallow(Copy->getEntry()); in unrollReplicateRegionByUF()
134 auto Part0 = vp_depth_first_shallow(VPR->getEntry()); in unrollReplicateRegionByUF()
335 RPOT(VPR->getEntry()); in unrollBlock()
405 auto Iter = vp_depth_first_deep(Plan.getEntry()); in unrollByUF()
429 Plan.getEntry()); in unrollByUF()
501 vp_depth_first_shallow(Plan.getEntry())); in replicateByVF()
503 vp_depth_first_shallow(Plan.getVectorLoopRegion()->getEntry())); in replicateByVF()
H A DVPlan.cpp163 Block = Region->getEntry(); in getEntryBasicBlock()
170 Block = Region->getEntry(); in getEntryBasicBlock()
175 assert(ParentPlan->getEntry() == this && "Can only set plan on its entry."); in setPlan()
205 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors()
499 PredVPBlock == getPlan()->getEntry())))) && in connectToPredecessors()
560 if ((Replica && this == getParent()->getEntry()) || in execute()
787 const auto &[NewEntry, NewExiting] = cloneFrom(getEntry()); in clone()
830 assert(Region && !Region->isReplicator() && Region->getEntry() == this && in getCFGPredecessor()
846 for (VPBlockBase *Block : vp_depth_first_shallow(getEntry())) in cost()
869 VPBasicBlock *Then = cast<VPBasicBlock>(getEntry()->getSuccessors()[0]); in cost()
[all …]
H A DVPlanConstruction.cpp247 VPIRBasicBlock *Entry = cast<VPIRBasicBlock>(Plan->getEntry()); in buildPlainCFG()
317 Plan->getEntry()->setOneSuccessor(getOrCreateVPBB(TheLoop->getHeader())); in buildPlainCFG()
318 Plan->getEntry()->setPlan(&*Plan); in buildPlainCFG()
465 VPBlockBase *HeaderVPB = Plan.getEntry()->getSingleSuccessor(); in prepareForVectorization()
470 VPBlockUtils::insertBlockAfter(VecPreheader, Plan.getEntry()); in prepareForVectorization()
538 VPBlockUtils::connectBlocks(Plan.getEntry(), ScalarPH); in prepareForVectorization()
539 Plan.getEntry()->swapSuccessors(); in prepareForVectorization()
585 for (VPBlockBase *HeaderVPB : vp_post_order_shallow(Plan.getEntry())) in createLoopRegions()
H A DVPlanUtils.cpp44 Plan.getEntry()->appendRecipe(Expanded->getDefiningRecipe()); in getOrCreateVPValueForSCEVExpr()
132 auto DepthFirst = vp_depth_first_shallow(Plan.getEntry()); in getFirstLoopHeader()
H A DVPlanTransforms.cpp125 auto Iter = vp_depth_first_deep(Plan.getEntry()); in sinkScalarOperands()
214 auto *EntryBB = dyn_cast<VPBasicBlock>(R->getEntry()); in getPredicatedMask()
224 auto *EntryBB = cast<VPBasicBlock>(R->getEntry()); in getPredicatedThenBlock()
253 vp_depth_first_deep(Plan.getEntry()))) { in mergeReplicateRegionsIntoSuccessors()
380 vp_depth_first_deep(Plan.getEntry()))) { in addReplicateRegions()
412 vp_depth_first_deep(Plan.getEntry()))) { in mergeBlocksIntoPredecessors()
551 Plan.getEntry()); in removeDeadRecipes()
904 make_early_inc_range(*Plan.getEntry()->getEntryBasicBlock())) { in removeRedundantExpandSCEVRecipes()
1212 Plan.getEntry()); in simplifyRecipes()
1230 vp_depth_first_shallow(Plan.getVectorLoopRegion()->getEntry()))) { in narrowToSingleScalarRecipes()
[all …]
H A DVPlanDominatorTree.h32 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); }
/freebsd/contrib/llvm-project/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()
166 return find_singleton<BlockT>(llvm::inverse_children<BlockT *>(getEntry()), in getEnteringBlock()
214 if (getEntry()->getName().empty()) { in getNameStr()
217 getEntry()->printAsOperand(OS, false); in getNameStr()
219 entryName = std::string(getEntry()->getName()); in getNameStr()
239 BlockT *entry = getEntry(), *exit = getExit(); in verifyBBInRegion()
281 verifyWalk(getEntry(), &visited); in verifyRegion()
331 if (R->getEntry() != BB) in getSubRegionNode()
[all …]
H A DRegionInfo.h172 inline BlockT *getEntry() const { return entry.getPointer(); }
320 BlockT *getEntry() const {
321 return RegionNodeBase<Tr>::getEntry();
457 return contains(SubRegion->getEntry()) &&
607 block_iterator block_begin() { return block_iterator(getEntry(), getExit()); }
612 return const_block_iterator(getEntry(), getExit());
999 return getEntry();
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp478 Loops[Exit] = N->getEntry(); in analyzeLoops()
513 BasicBlock *BB = N->getEntry(); in gatherPredicates()
559 BasicBlock *Entry = R->getEntry(); in gatherPredicates()
583 << RN->getEntry()->getName() << "\n"); in collectInfos()
589 Visited.insert(RN->getEntry()); in collectInfos()
978 Order.back()->getEntry(); in getNextFlow()
990 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix()
1027 BBPredicates &Preds = Predicates[Node->getEntry()]; in dominatesPredicates()
1035 BBPredicates &Preds = Predicates[Node->getEntry()]; in isPredictableTrue()
1046 if (!Dominated && DT->dominates(BB, PrevNode->getEntry())) in isPredictableTrue()
[all …]
/freebsd/contrib/llvm-project/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()
292 if (R.getEntry() == &F.getEntryBlock()) in skipRegion()
H A DRegionPrinter.cpp76 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes()
81 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes()
216 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent(); in viewRegionInfo()
/freebsd/contrib/llvm-project/clang/lib/CIR/Interfaces/
H A DCIRLoopOpInterface.cpp24 regions.emplace_back(&op.getEntry(), op.getEntry().getArguments()); in getLoopOpSuccessorRegions()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/LogicalView/Core/
H A DLVRange.h69 LVScope *getEntry(LVAddress Address) const;
70 LVScope *getEntry(LVAddress LowerAddress, LVAddress UpperAddress) const;
/freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DDebugNamesDWARFIndex.cpp203 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
204 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
236 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables()
237 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables()
642 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetFunctions()
643 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetFunctions()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVRange.cpp83 LVScope *LVRange::getEntry(LVAddress Address) const { in getEntry() function in LVRange
109 LVScope *LVRange::getEntry(LVAddress LowerAddress, in getEntry() function in LVRange
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DControlHeightReduction.cpp161 return RegInfos.front().R->getEntry(); in getEntryBlock()
679 BasicBlock *EntryBB = R->getEntry(); in getBranchInsertPoint()
715 BasicBlock *Entry = R->getEntry(); in findScope()
806 BasicBlock *BB = E->getEntry(); in findScope()
874 BasicBlock *EntryBB = R->getEntry(); in checkScopeHoistable()
1023 auto *BI = cast<BranchInst>(RI.R->getEntry()->getTerminator()); in getCHRConditionValuesForRegion()
1166 RI.R->getEntry()->getTerminator()) in splitScope()
1201 RI.R->getEntry()->getTerminator()) in splitScope()
1330 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes()
1380 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in setCHRRegions()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DNonRelocatableStringpool.cpp14 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { in getEntry() function in llvm::NonRelocatableStringpool
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.h59 LLVM_ABI_FOR_TEST EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
H A DDbgEntityHistoryCalculator.cpp343 auto &Entry = HistMap.getEntry(Var, Index); in clobberRegEntries()
396 auto &Entry = HistMap.getEntry(Var, Index); in handleNewDebugValue()
561 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx); in calculateDbgEntityHistory()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DSearchableTableEmitter.cpp59 const Entry *getEntry(const Record *Def) const { in getEntry() function
145 Field.Enum->getEntry(cast<DefInit>(I)->getDef()); in primaryRepresentation()
239 return Field.Enum->getEntry(EnumEntry)->Value; in getNumericKey()
306 int64_t LHSv = Field.Enum->getEntry(LHSr)->Value; in compareBy()
307 int64_t RHSv = Field.Enum->getEntry(RHSr)->Value; in compareBy()

1234