/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | DwarfStringPoolEntry.h | 76 assert(getEntry().Symbol && "No symbol available!"); in getSymbol() 77 return getEntry().Symbol; in getSymbol() 81 uint64_t getOffset() const { return getEntry().Offset; } in getOffset() 85 assert(getEntry().isIndexed() && "Index is not set!"); in getIndex() 86 return getEntry().Index; in getIndex() 98 const DwarfStringPoolEntry &getEntry() const { in getEntry() function
|
H A D | NonRelocatableStringpool.h | 35 getEntry(""); in Translator() 38 DwarfStringPoolEntryRef getEntry(StringRef S); 42 uint64_t getStringOffset(StringRef S) { return getEntry(S).getOffset(); } in getStringOffset()
|
H A D | DbgEntityHistoryCalculator.h | 107 Entry &getEntry(InlinedEntity Var, EntryIndex Index) { in getEntry() function
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanCFG.h | 56 return R->getEntry(); in deref() 120 BlockTy getEntry() { return Entry; } in getEntry() function 133 return N.getEntry(); 152 return N.getEntry(); 171 BlockTy getEntry() { return Entry; } 179 return N.getEntry(); 198 return N.getEntry(); 296 static NodeRef getEntryNode(GraphRef N) { return N->getEntry(); } 299 return nodes_iterator::begin(N->getEntry()); 305 return nodes_iterator::end(N->getEntry());
|
H A D | VPlanVerifier.cpp | 48 for (const VPBlockBase *VPB : vp_depth_first_shallow(Region->getEntry())) { in verifyBlocksInRegion() 99 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion() 119 df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyRegionRec() 237 auto Iter = vp_depth_first_deep(Plan.getEntry()); in verifyPlanIsValid() 245 const VPBasicBlock *Entry = dyn_cast<VPBasicBlock>(TopRegion->getEntry()); in verifyPlanIsValid() 279 vp_depth_first_deep(Plan.getEntry()))) { in verifyPlanIsValid() 280 if (Region->getEntry()->getNumPredecessors() != 0) { in verifyPlanIsValid()
|
H A D | VPlanTransforms.cpp | 38 Plan->getEntry()); in VPInstructionsToVPRecipes() 102 auto Iter = vp_depth_first_deep(Plan.getEntry()); in sinkScalarOperands() 183 auto *EntryBB = dyn_cast<VPBasicBlock>(R->getEntry()); in getPredicatedMask() 193 auto *EntryBB = cast<VPBasicBlock>(R->getEntry()); in getPredicatedThenBlock() 222 vp_depth_first_deep(Plan.getEntry()))) { in mergeReplicateRegionsIntoSuccessors() 335 vp_depth_first_deep(Plan.getEntry()))) { in addReplicateRegions() 374 vp_depth_first_deep(Plan.getEntry()))) { in mergeBlocksIntoPredecessors() 467 Plan.getEntry()); in removeDeadRecipes() 544 make_early_inc_range(*Plan.getEntry()->getEntryBasicBlock())) { in removeRedundantExpandSCEVRecipes() 869 Plan.getEntry()); in simplifyRecipes() [all …]
|
H A D | VPlan.cpp | 154 Block = Region->getEntry(); in getEntryBasicBlock() 161 Block = Region->getEntry(); in getEntryBasicBlock() 167 (ParentPlan->getEntry() == this || ParentPlan->getPreheader() == this) && in setPlan() 198 assert(Parent->getEntry() == this && in getEnclosingBlockWithPredecessors() 895 for (const VPBlockBase *Block : vp_depth_first_shallow(getEntry())) { in print() 1025 for (const VPBlockBase *Block : vp_depth_first_shallow(Plan.getEntry())) in dump() 1109 assert(Region->getEntry() && "Region contains no inner blocks."); in dumpRegion() 1110 for (const VPBlockBase *Block : vp_depth_first_shallow(Region->getEntry())) in dumpRegion() 1196 RPOT(Region->getEntry()); in visitRegion() 1258 RPOT(VPBlockDeepTraversalWrapper<const VPBlockBase *>(Plan.getEntry())); in assignSlots()
|
H A D | VPlanDominatorTree.h | 31 static NodePtr getEntryNode(ParentPtr Parent) { return Parent->getEntry(); }
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | RegionIterator.h | 111 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 D | RegionInfoImpl.h | 68 BlockT *OldEntry = getEntry(); in replaceEntryRecursive() 77 if (Child->getEntry() == OldEntry) in replaceEntryRecursive() 108 BlockT *entry = getEntry(), *exit = getExit(); in contains() 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() 446 if (R->getEntry() != exit) { in getExpandedRegion() [all …]
|
H A D | RegionInfo.h | 174 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()); 1001 return getEntry();
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 438 Loops[Exit] = N->getEntry(); in analyzeLoops() 467 BasicBlock *BB = N->getEntry(); in gatherPredicates() 513 BasicBlock *Entry = R->getEntry(); in gatherPredicates() 543 Visited.insert(RN->getEntry()); in collectInfos() 853 Order.back()->getEntry(); in getNextFlow() 870 BasicBlock *Entry = PrevNode->getEntry(); in needPrefix() 941 Visited.insert(Node->getEntry()); in wireFlow() 954 BasicBlock *Entry = Node->getEntry(); in wireFlow() 978 BasicBlock *LoopStart = Node->getEntry(); in handleLoops() 988 LoopEnd = Loops[Node->getEntry()]; in handleLoops() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | RegionPass.cpp | 94 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 D | RegionPrinter.cpp | 76 if (R->getParent()->getEntry() == destBB) in getEdgeAttributes() 81 if (R && R->getEntry() == destBB && R->contains(srcBB)) in getEdgeAttributes() 222 llvm::Function *F = RI->getTopLevelRegion()->getEntry()->getParent(); in viewRegionInfo()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUMachineCFGStructurizer.cpp | 397 MachineBasicBlock *getEntry(); 552 MachineBasicBlock *getEntry() { in getEntry() function in __anon27e10c840211::RegionMRT 1227 MachineBasicBlock *Entry = Region->getEntry(); in regionIsSimpleIf() 1249 MachineBasicBlock *Entry = Region->getEntry(); in transformSimpleIfRegion() 1648 auto Entry = Region->getEntry(); in rewriteRegionEntryPHIs() 2332 bool isEntry = CurrentRegion->getEntry() == InnerRegion->getEntry(); in createIfRegion() 2494 MachineBasicBlock *Entry = LRegion->getEntry(); in splitEntry() 2524 LRegion->setEntry(Region->getEntry()); in initLinearizedRegion() 2678 if (isFunctionEntryBlock(LRegion->getEntry())) { in structurizeComplexRegion() 2679 resolvePHIInfos(LRegion->getEntry()); in structurizeComplexRegion() [all …]
|
/freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DebugNamesDWARFIndex.cpp | 123 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables() 124 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables() 156 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetGlobalVariables() 157 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetGlobalVariables() 298 llvm::Expected<DebugNames::Entry> entry_or = ni.getEntry(&entry_offset); in GetFunctions() 299 for (; entry_or; entry_or = ni.getEntry(&entry_offset)) { in GetFunctions()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/LogicalView/Core/ |
H A D | LVRange.h | 68 LVScope *getEntry(LVAddress Address) const; 69 LVScope *getEntry(LVAddress LowerAddress, LVAddress UpperAddress) const;
|
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/ |
H A D | LVRange.cpp | 83 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 D | ControlHeightReduction.cpp | 161 return RegInfos.front().R->getEntry(); in getEntryBlock() 680 BasicBlock *EntryBB = R->getEntry(); in getBranchInsertPoint() 716 BasicBlock *Entry = R->getEntry(); in findScope() 807 BasicBlock *BB = E->getEntry(); in findScope() 875 BasicBlock *EntryBB = R->getEntry(); in checkScopeHoistable() 1336 Scope->RegInfos[0].R->getEntry()->getTerminator()) in filterScopes() 1389 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in setCHRRegions() 1489 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in hoistScopeConditions() 1647 auto *BI = cast<BranchInst>(R->getEntry()->getTerminator()); in assertBranchOrSelectConditionHoisted() 1700 BasicBlock *EntryBlock = FirstRegion->getEntry(); in transformScopes() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfStringPool.h | 56 EntryRef getEntry(AsmPrinter &Asm, StringRef Str);
|
H A D | DbgEntityHistoryCalculator.cpp | 343 auto &Entry = HistMap.getEntry(Var, Index); in clobberRegEntries() 383 auto &Entry = HistMap.getEntry(Var, Index); in handleNewDebugValue() 552 DbgValueHistoryMap::Entry &Ent = DbgValues.getEntry(Pair.first, Idx); in calculateDbgEntityHistory()
|
H A D | DwarfStringPool.cpp | 39 DwarfStringPool::EntryRef DwarfStringPool::getEntry(AsmPrinter &Asm, in getEntry() function in DwarfStringPool
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | NonRelocatableStringpool.cpp | 14 DwarfStringPoolEntryRef NonRelocatableStringpool::getEntry(StringRef S) { in getEntry() function in llvm::NonRelocatableStringpool
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | UninitializedValues.cpp | 583 if (B == &cfg.getEntry()) in getUninitUse() 929 const CFGBlock &entry = cfg.getEntry(); in runUninitializedVariablesAnalysis() 939 worklist.enqueueSuccessors(&cfg.getEntry()); in runUninitializedVariablesAnalysis() 941 wasAnalyzed[cfg.getEntry().getBlockID()] = true; in runUninitializedVariablesAnalysis()
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
H A D | ControlFlowContext.cpp | 52 BlocksToVisit.push_back(&Cfg.getEntry()); in findReachableBlocks()
|