| /freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| H A D | x86_64.cpp | 94 assert(EntrySym->getBlock().edges_size() == 1 && in registerExistingEntries() 96 registerPreExistingEntry(EntrySym->getBlock().edges().begin()->getTarget(), in registerExistingEntries() 103 assert(EntrySym->getBlock().edges_size() == 1 && in registerExistingEntries() 105 auto &GOTSym = EntrySym->getBlock().edges().begin()->getTarget(); in registerExistingEntries() 106 assert(GOTSym.getBlock().edges_size() == 1 && "GOT block edge count != 1"); in registerExistingEntries() 107 registerPreExistingEntry(GOTSym.getBlock().edges().begin()->getTarget(), in registerExistingEntries() 130 auto &GOTEntryBlock = E.getTarget().getBlock(); in optimizeGOTAndStubAccesses() 193 auto &StubBlock = E.getTarget().getBlock(); in optimizeGOTAndStubAccesses() 199 auto &GOTBlock = StubBlock.edges().begin()->getTarget().getBlock(); in optimizeGOTAndStubAccesses()
|
| H A D | aarch64.cpp | 209 assert(EntrySym->getBlock().edges_size() == 1 && in registerExistingEntries() 211 registerPreExistingEntry(EntrySym->getBlock().edges().begin()->getTarget(), in registerExistingEntries() 218 assert(EntrySym->getBlock().edges_size() == 2 && in registerExistingEntries() 220 auto &GOTSym = EntrySym->getBlock().edges().begin()->getTarget(); in registerExistingEntries() 221 assert(GOTSym.getBlock().edges_size() == 1 && "GOT block edge count != 1"); in registerExistingEntries() 222 registerPreExistingEntry(GOTSym.getBlock().edges().begin()->getTarget(), in registerExistingEntries() 316 auto &SigningFunctionBlock = SigningFunctionSym.getBlock(); in lowerPointer64AuthEdgesToSigningFunction()
|
| H A D | x86.cpp | 57 auto &StubBlock = E.getTarget().getBlock(); in optimizeGOTAndStubAccesses() 63 auto &GOTBlock = StubBlock.edges().begin()->getTarget().getBlock(); in optimizeGOTAndStubAccesses()
|
| H A D | SEHFrameSupport.h | 47 Children.insert(&Sym.getBlock()); in operator()
|
| H A D | JITLink.cpp | 143 auto &TargetBlock = TargetSym.getBlock(); in printEdge() 209 if (&Sym->getBlock() == Blocks[0]) in splitBlockImpl() 285 BlockSymbols[&Sym->getBlock()].push_back(Sym); in dump() 442 if (&Sym->getBlock() == &B && Sym->hasName() && Sym->getOffset() == 0 && in makeTargetOutOfRangeError()
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MemorySSAUpdater.cpp | 141 return getPreviousDefRecursive(MA->getBlock(), CachedPreviousDef); in getPreviousDef() 148 auto *Defs = MSSA->getWritableBlockDefs(MA->getBlock()); in getPreviousDefInBlock() 160 auto End = MSSA->getWritableBlockAccesses(MA->getBlock())->rend(); in getPreviousDefInBlock() 257 auto *Defs = MSSA->getBlockDefs(MU->getBlock()); in insertUse() 265 BasicBlock *StartBlock = MU->getBlock(); in insertUse() 274 MSSA->renamePass(MU->getBlock(), FirstDef, Visited); in insertUse() 280 MSSA->renamePass(Phi->getBlock(), nullptr, Visited); in insertUse() 309 if (!MSSA->DT->isReachableFromEntry(MD->getBlock())) { in insertDef() 320 if (DefBefore->getBlock() == MD->getBlock() && in insertDef() 370 DefiningBlocks.insert(MD->getBlock()); in insertDef() [all …]
|
| H A D | MemorySSA.cpp | 530 BasicBlock *BB = From->getBlock(); in getWalkTarget() 534 auto *Defs = MSSA.getBlockDefs(Node->getBlock()); in getWalkTarget() 880 const BasicBlock *ChainBB = DefChainEnd->getBlock(); in tryOptimizePhi() 884 if (DT.dominates(ChainBB, TP.Clobber->getBlock())) in tryOptimizePhi() 1155 bool AlreadyVisited = !Visited.insert(Root->getBlock()).second; in renamePass() 1159 IncomingVal = renameBlock(Root->getBlock(), IncomingVal, RenameAllUses); in renamePass() 1160 renameSuccessorPhis(Root->getBlock(), IncomingVal, RenameAllUses); in renamePass() 1173 BasicBlock *BB = Child->getBlock(); in renamePass() 1370 BasicBlock *BackBlock = VersionStack.back()->getBlock(); in optimizeUsesInBlock() 1373 while (VersionStack.back()->getBlock() == BackBlock) in optimizeUsesInBlock() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericDomTreeConstruction.h | 170 BlockNamePrinter(TreeNodePtr TN) : N(TN ? TN->getBlock() : nullptr) {} in BlockNamePrinter() 601 getNodeInfo(NumToNode[1]).IDom = AttachTo->getBlock(); in attachNewSubtree() 619 getNodeInfo(NumToNode[1]).IDom = AttachTo->getBlock(); in reattachExistingSubtree() 686 if (!llvm::is_contained(DT.Roots, To->getBlock())) in UpdateRootsBeforeInsertion() 738 LLVM_DEBUG(dbgs() << "\tReachable " << BlockNamePrinter(From->getBlock()) in InsertReachable() 739 << " -> " << BlockNamePrinter(To->getBlock()) << "\n"); in InsertReachable() 745 (From->getBlock() && To->getBlock()) in InsertReachable() 746 ? DT.findNearestCommonDominator(From->getBlock(), To->getBlock()) in InsertReachable() 782 assert(TN->getBlock() && II.Visited.count(TN) && "Preconditions!"); in InsertReachable() 793 for (const NodePtr Succ : getChildren<IsPostDom>(TN->getBlock(), BUI)) { in InsertReachable() [all …]
|
| H A D | GenericDomTree.h | 89 NodeT *getBlock() const { return TheBB; } 108 const NodeT *Nd = I->getBlock(); 113 const NodeT *N = I->getBlock(); 171 if (Node->getBlock()) 172 Node->getBlock()->printAsOperand(O, false); 349 if (Node->compare(Other.getNode(Node->getBlock()))) 435 Result.push_back(N->getBlock()); 546 return NodeA->getBlock(); 558 return isPostDominator() && !A->getBlock(); 882 unsigned Idx = *getNodeIndex(Node->getBlock());
|
| H A D | GenericIteratedDominanceFrontier.h | 177 NodeTy *BB = Node->getBlock(); in calculate() 190 NodeTy *SuccBB = SuccNode->getBlock(); in calculate()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | BranchFolding.cpp | 515 if (getBlock()->getNumber() < o.getBlock()->getNumber()) in operator <() 517 if (getBlock()->getNumber() > o.getBlock()->getNumber()) in operator <() 692 if (ProfitableToMerge(CurMPIter->getBlock(), I->getBlock(), in ComputeSameTails() 724 MachineBasicBlock *CurMBB = CurMPIter->getBlock(); in RemoveBlocksWithHash() 743 if (SameTails[i].getBlock() == PredBB) { in CreateCommonTailOnlyBlock() 749 unsigned t = EstimateRuntime(SameTails[i].getBlock()->begin(), in CreateCommonTailOnlyBlock() 759 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in CreateCommonTailOnlyBlock() 836 MachineBasicBlock *MBB = SameTails[commonTailIndex].getBlock(); in mergeCommonTails() 858 assert(Pos != SameTails[i].getBlock()->end() && in mergeCommonTails() 862 assert(Pos != SameTails[i].getBlock()->end() && in mergeCommonTails() [all …]
|
| H A D | BranchFolding.h | 60 MachineBasicBlock *getBlock() const { return Block; } in getBlock() function 101 MachineBasicBlock *getBlock() const { in getBlock() function 102 return getMergePotentialsElt().getBlock(); in getBlock() 106 return TailStartPos == getBlock()->begin(); in tailIsWholeBlock()
|
| H A D | LiveRangeCalc.cpp | 66 MachineBasicBlock *MBB = I.DomNode->getBlock(); in updateFromLiveIns() 346 MachineBasicBlock *MBB = Node->getBlock(); in updateSSA() 352 bool needPHI = !IDom || !Seen.test(IDom->getBlock()->getNumber()); in updateSSA() 358 IDomValue = Map[IDom->getBlock()]; in updateSSA() 363 Map[IDom->getBlock()].second = IDomValue.second = in updateSSA()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyExceptionInfo.cpp | 84 MachineBasicBlock *EHPad = DomNode->getBlock(); in recalculate() 128 MachineBasicBlock *EHPad = DomNode->getBlock(); in recalculate() 167 MachineBasicBlock *EHPad = DomNode->getBlock(); in recalculate() 197 MachineBasicBlock *MBB = DomNode->getBlock(); in recalculate() 244 MachineBasicBlock *MBB = DomNode->getBlock(); in recalculate()
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ProgramPoint.cpp | 114 if (const auto *B = castAs<BlockExit>().getBlock()) { in getSourceLocation() 149 if (const auto *B = castAs<FunctionExitPoint>().getBlock(); in getSourceLocation() 179 << castAs<BlockEntrance>().getBlock()->getBlockID(); in printJson() 185 << ", \"block_id\": " << FEP->getBlock()->getBlockID() in printJson()
|
| /freebsd/contrib/llvm-project/clang/lib/CodeGen/ |
| H A D | CGStmt.cpp | 736 ResolveBranchFixups(Dest.getBlock()); in EmitLabel() 739 EmitBlock(Dest.getBlock()); in EmitLabel() 1080 EmitBlock(LoopHeader.getBlock()); in EmitWhileStmt() 1084 emitConvergenceLoopToken(LoopHeader.getBlock())); in EmitWhileStmt() 1117 LoopStack.push(LoopHeader.getBlock(), CGM.getContext(), CGM.getCodeGenOpts(), in EmitWhileStmt() 1129 llvm::BasicBlock *ExitBlock = LoopExit.getBlock(); in EmitWhileStmt() 1147 if (ExitBlock != LoopExit.getBlock()) { in EmitWhileStmt() 1181 EmitBranch(LoopHeader.getBlock()); in EmitWhileStmt() 1186 EmitBlock(LoopExit.getBlock(), true); in EmitWhileStmt() 1191 SimplifyForwardingBlocks(LoopHeader.getBlock()); in EmitWhileStmt() [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 159 BE->getBlock()->getBlockID(), in enqueue() 229 BE->getBlock()->getBlockID(), in enqueue() 284 NumVisited = NumReached[BE->getBlock()]++; in enqueue()
|
| H A D | CoreEngine.cpp | 255 HandlePostStmt(WU.getBlock(), WU.getIndex(), Pred); in dispatchWorkItem() 344 unsigned BlockId = L.getBlock()->getBlockID(); in HandleBlockEntrance() 352 NodeBuilderContext Ctx(*this, L.getBlock(), Pred); in HandleBlockEntrance() 355 HandleBlockExit(L.getBlock(), Pred); in HandleBlockEntrance() 727 BlockEdge(C.getBlock(), Dst, NodePred->getLocationContext()); in generateNode() 738 Eng.G.getNode(BlockEdge(Src, I.getBlock(), Pred->getLocationContext()), in generateNode() 756 Eng.G.getNode(BlockEdge(Src, I.getBlock(), Pred->getLocationContext()), in generateCaseStmtNode()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | DominanceFrontierImpl.h | 82 BlockT *BB = Node->getBlock(); in calculate() 119 BlockT *childBB = IDominee->getBlock(); in calculate()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | ConstantHoisting.cpp | 202 while (IDom->getBlock()->isEHPad()) { in findMatInsertPt() 203 assert(Entry != IDom->getBlock() && "eh pad in entry block"); in findMatInsertPt() 207 return IDom->getBlock()->getTerminator()->getIterator(); in findMatInsertPt() 241 Node = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet() 261 if (Candidates.count(ChildDomNode->getBlock())) in findBestInsertionSet() 262 Orders.push_back(ChildDomNode->getBlock()); in findBestInsertionSet() 289 BasicBlock *Parent = DT.getNode(Node)->getIDom()->getBlock(); in findBestInsertionSet()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | DebugProgramInstruction.cpp | 514 BasicBlock *DbgRecord::getBlock() { return Marker->getParent(); } in getBlock() function in llvm::DbgRecord 516 const BasicBlock *DbgRecord::getBlock() const { return Marker->getParent(); } in getBlock() function in llvm::DbgRecord 518 Function *DbgRecord::getFunction() { return getBlock()->getParent(); } in getFunction() 521 return getBlock()->getParent(); in getFunction() 530 LLVMContext &DbgRecord::getContext() { return getBlock()->getContext(); } in getContext() 533 return getBlock()->getContext(); in getContext()
|
| /freebsd/contrib/llvm-project/llvm/lib/FuzzMutate/ |
| H A D | RandomIRBuilder.cpp | 35 while (Node && Node->getBlock()) { in getDominators() 36 ret.push_back(Node->getBlock()); in getDominators() 54 ret.push_back(Child->getBlock()); in getDominatees() 60 ret.push_back(Child->getBlock()); in getDominatees()
|
| /freebsd/contrib/llvm-project/clang/lib/CIR/Dialect/Transforms/ |
| H A D | FlattenCFG.cpp | 235 rewriter.getBlock(), op->getNextNode()->getIterator()); in matchAndRewrite() 256 mlir::Block *originalBlock = op->getBlock(); in matchAndRewrite() 330 mlir::Block *oldBlock = nextOp->getBlock(); in matchAndRewrite() 340 mlir::Block *oldBlock = caseOp->getBlock(); in matchAndRewrite() 354 mlir::Block *caseBlock = caseOp->getBlock(); in matchAndRewrite()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/ |
| H A D | ProgramPoint.h | 237 const CFGBlock *getBlock() const { in getBlock() function 242 const CFGBlock *B = getBlock(); in getFirstElement() 259 const CFGBlock *getBlock() const { in getBlock() function 264 return getBlock()->getTerminatorStmt(); in getTerminator() 347 const CFGBlock *getBlock() const { in getBlock() function
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 296 if (!NodeToProcess->node()->getBlock()->getSinglePredecessor()) in loadCSE() 298 for (auto &I : make_early_inc_range(*NodeToProcess->node()->getBlock())) { in loadCSE() 324 if (!L->contains(Child->getBlock())) in loadCSE() 805 BasicBlock *OriginalBBIDom = BBIDom->getBlock(); in UnrollLoop() 863 auto *ChildBB = ChildDomNode->getBlock(); in UnrollLoop() 975 if (L->contains(C->getBlock())) in UnrollLoop()
|