/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 120 BasicBlock *Dest; 122 ValueEqualityComparisonCase(ConstantInt *Value, BasicBlock *Dest) 130 bool operator==(BasicBlock *RHSDest) const { return Dest == RHSDest; } 139 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI, 142 BasicBlock *Pred, 162 bool run(BasicBlock *BB); 174 BasicBlock *SI1BB = SI1->getParent(); 175 BasicBlock *SI2BB = SI2->getParent(); 176 SmallPtrSet<BasicBlock*, 16> SI1Succs(succ_begin(SI1BB), succ_end(SI1BB)); 180 for (BasicBlock [all...] |
H A D | PromoteMemoryToRegister.cpp | 97 SmallVector<BasicBlock *, 32> DefiningBlocks; 98 SmallVector<BasicBlock *, 32> UsingBlocks; 101 BasicBlock *OnlyBlock; 159 RenamePassData(BasicBlock *B, BasicBlock *P, const ValVector &V) 161 BasicBlock *BB; 162 BasicBlock *Pred; 206 const BasicBlock *BB = I->getParent(); 241 /// since we already maintain a map from BasicBlock* to a stable numbering 261 SmallPtrSet<BasicBlock *, 1 [all...] |
H A D | LoopUnroll.cpp | 27 #include "llvm/IR/BasicBlock.h" 62 PN->setIncomingBlock(i, cast<BasicBlock>(It->second)); 75 static BasicBlock * 76 FoldBlockIntoPredecessor(BasicBlock *BB, LoopInfo* LI, ScalarEvolution *SE, 81 BasicBlock *OnlyPred = BB->getSinglePredecessor(); 163 BasicBlock *Preheader = L->getLoopPreheader(); 169 BasicBlock *LatchBlock = L->getLoopLatch(); 181 BasicBlock *Header = L->getHeader(); 219 SmallVector<BasicBlock *, 4> ExitBlocks; 224 [&](BasicBlock *B [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | PGOInstrumentation.cpp | 173 const BasicBlock *SrcBB; 174 const BasicBlock *DestBB; 179 PGOEdge(const BasicBlock *Src, const BasicBlock *Dest, unsigned W = 1) 220 BasicBlock *getInstrBB(Edge *E); 223 BBInfo &getBBInfo(const BasicBlock *BB) const { return MST.getBBInfo(BB); } 262 BasicBlock *Succ = TI->getSuccessor(I); 275 BasicBlock *FuncPGOInstrumentation<Edge, BBInfo>::getInstrBB(Edge *E) { 279 BasicBlock *SrcBB = const_cast<BasicBlock *>( [all...] |
H A D | CFGMST.h | 45 DenseMap<const BasicBlock *, std::unique_ptr<BBInfo>> BBInfos; 56 bool unionGroups(const BasicBlock *BB1, const BasicBlock *BB2) { 76 BBInfo &getBBInfo(const BasicBlock *BB) const { 88 const BasicBlock *BB = &(F.getEntryBlock()); 108 BasicBlock *TargetBB = TI->getSuccessor(i); 171 const BasicBlock *BB = BI.first; 185 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) {
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/ |
H A D | SIAnnotateControlFlow.cpp | 33 typedef std::pair<BasicBlock *, Value *> StackEntry; 72 bool isTopOfStack(BasicBlock *BB); 76 void push(BasicBlock *BB, Value *Saved); 90 void closeControlFlow(BasicBlock *BB); 156 bool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) { 166 void SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) { 173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); 221 BasicBlock *Parent = Phi->getParent(); 228 BasicBlock *From = Phi->getIncomingBlock(i); 239 BasicBlock *IDo [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 58 bool ProcessBlock(BasicBlock &BB); 60 bool AllUsesDominatedByBlock(Instruction *Inst, BasicBlock *BB) const; 61 bool IsAcceptableTarget(Instruction *Inst, BasicBlock *SuccToSinkTo) const; 77 BasicBlock *BB) const { 85 BasicBlock *UseBlock = UseInst->getParent(); 120 bool Sinking::ProcessBlock(BasicBlock &BB) { 132 BasicBlock::iterator I = BB.end(); 189 BasicBlock *SuccToSinkTo) const { 255 BasicBlock *SuccToSinkTo = nullptr; 263 BasicBlock *Candidat [all...] |
H A D | TailRecursionElimination.cpp | 108 BasicBlock *&OldEntry, 112 bool FoldReturnAndProcessPred(BasicBlock *BB, 113 ReturnInst *Ret, BasicBlock *&OldEntry, 117 bool ProcessReturningBlock(ReturnInst *RI, BasicBlock *&OldEntry, 280 DenseMap<BasicBlock *, VisitType> Visited; 285 SmallVector<BasicBlock *, 32> WorklistUnescaped, WorklistEscaped; 296 BasicBlock *BB = &F.getEntryBlock(); 394 BasicBlock *OldEntry = nullptr; 411 BasicBlock *BB = &*BBI++; // FoldReturnAndProcessPred may delete BB. 499 if (BasicBlock *UniquePre [all...] |
H A D | LICM.cpp | 77 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI); 80 static bool hoist(Instruction &I, BasicBlock *Preheader); 98 CloneInstructionInExitBlock(Instruction &I, BasicBlock &ExitBlock, PHINode &PN, 151 BasicBlock *Preheader; // The preheader block of the current loop... 157 void cloneBasicBlockAnalysis(BasicBlock *From, BasicBlock *To, 228 for (BasicBlock *BB : L->blocks()) { 257 SmallVector<BasicBlock *, 8> ExitBlocks; 316 BasicBlock *BB = N->getBlock(); 329 for (BasicBlock [all...] |
H A D | LoopUnswitch.cpp | 187 BasicBlock *loopHeader; 188 BasicBlock *loopPreheader; 193 std::vector<BasicBlock*> LoopBlocks; 195 std::vector<BasicBlock*> NewBlocks; 241 const SmallVectorImpl<BasicBlock *> &ExitBlocks); 248 BasicBlock *ExitBlock, TerminatorInst *TI); 256 BasicBlock *TrueDest, 257 BasicBlock *FalseDest, 585 for (BasicBlock::iterator BBI = (*I)->begin(), E = (*I)->end(); 606 static bool isTrivialLoopExitBlockHelper(Loop *L, BasicBlock *B [all...] |
H A D | LoopRotation.cpp | 53 static void RewriteUsesOfClonedInstructions(BasicBlock *OrigHeader, 54 BasicBlock *OrigPreheader, 57 BasicBlock::iterator I, E = OrigHeader->end(); 93 BasicBlock *UserBB = UserInst->getParent(); 132 BasicBlock *OrigHeader = L->getHeader(); 133 BasicBlock *OrigLatch = L->getLoopLatch(); 173 BasicBlock *OrigPreheader = L->getLoopPreheader(); 190 BasicBlock *Exit = BI->getSuccessor(0); 191 BasicBlock *NewHeader = BI->getSuccessor(1); 206 BasicBlock [all...] |
H A D | InductiveRangeCheckElimination.cpp | 442 BasicBlock *Header; 443 BasicBlock *Latch; 448 BasicBlock *LatchExit; 464 Result.Header = cast<BasicBlock>(Map(Header)); 465 Result.Latch = cast<BasicBlock>(Map(Latch)); 467 Result.LatchExit = cast<BasicBlock>(Map(LatchExit)); 495 std::vector<BasicBlock *> Blocks; 507 BasicBlock *PseudoExit; 508 BasicBlock *ExitSelector; 531 static void replacePHIBlock(PHINode *PN, BasicBlock *Bloc [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/ |
H A D | Instrumentation.h | 18 #include "llvm/IR/BasicBlock.h" 44 BasicBlock::iterator PrepareToSplitEntryBlock(BasicBlock &BB, 45 BasicBlock::iterator IP);
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | CFGPrinter.h | 34 static std::string getSimpleNodeLabel(const BasicBlock *Node, 46 static std::string getCompleteNodeLabel(const BasicBlock *Node, 91 std::string getNodeLabel(const BasicBlock *Node, 99 static std::string getEdgeSourceLabel(const BasicBlock *Node,
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | SampleProfile.cpp | 91 typedef DenseMap<const BasicBlock *, uint64_t> BlockWeightMap; 92 typedef DenseMap<const BasicBlock *, const BasicBlock *> EquivalenceClassMap; 93 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge; 95 typedef DenseMap<const BasicBlock *, SmallVector<const BasicBlock *, 8>> 132 ErrorOr<uint64_t> getBlockWeight(const BasicBlock *BB) const; 138 void printBlockWeight(raw_ostream &OS, const BasicBlock *BB) const; 139 void printBlockEquivalence(raw_ostream &OS, const BasicBlock *B [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCAPElim.cpp | 45 static bool OptimizeBB(BasicBlock *BB); 75 for (const BasicBlock &BB : *Callee) { 91 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) { 95 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
H A D | ObjCARCOpts.cpp | 180 /// \brief Per-BasicBlock state. 199 SmallVector<BasicBlock *, 2> Preds; 203 SmallVector<BasicBlock *, 2> Succs; 303 typedef SmallVectorImpl<BasicBlock *>::const_iterator edge_iterator; 309 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); } 310 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); } 494 void CheckForCFGHazards(const BasicBlock *BB, 495 DenseMap<const BasicBlock *, BBState> &BBStates, 497 bool VisitInstructionBottomUp(Instruction *Inst, BasicBlock *BB, 500 bool VisitBottomUp(BasicBlock *B [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 37 template class llvm::LoopBase<BasicBlock, Loop>; 38 template class llvm::LoopInfoBase<BasicBlock, Loop>; 110 BasicBlock *Preheader = getLoopPreheader(); 143 BasicBlock *H = getHeader(); 145 BasicBlock *Incoming = nullptr, *Backedge = nullptr; 162 for (BasicBlock::iterator I = H->begin(); isa<PHINode>(I); ++I) { 181 BasicBlock *BB = *BI; 182 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;++I) { 191 BasicBlock *UserBB = UI->getParent(); 247 for (BasicBlock [all...] |
H A D | BranchProbabilityInfo.cpp | 115 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) { 177 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) { 247 bool BranchProbabilityInfo::calcColdCallHeuristics(BasicBlock *BB) { 269 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 305 bool BranchProbabilityInfo::calcPointerHeuristics(BasicBlock *BB) { 340 bool BranchProbabilityInfo::calcLoopBranchHeuristics(BasicBlock *BB, 396 bool BranchProbabilityInfo::calcZeroHeuristics(BasicBlock *BB) { 479 bool BranchProbabilityInfo::calcFloatingPointHeuristics(BasicBlock *BB) { 516 bool BranchProbabilityInfo::calcInvokeHeuristics(BasicBlock *BB) { 546 isEdgeHot(const BasicBlock *Sr [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/ |
H A D | HexagonCommonGEP.cpp | 105 void getBlockTraversalOrder(BasicBlock *Root, ValueVect &Order); 111 BasicBlock *recalculatePlacement(GepNode *Node, NodeChildrenMap &NCM, 113 BasicBlock *recalculatePlacementRec(GepNode *Node, NodeChildrenMap &NCM, 117 bool isInMainPath(BasicBlock *B, Loop *L); 118 BasicBlock *adjustForInvariance(GepNode *Node, NodeChildrenMap &NCM, 125 Value *fabricateGEP(NodeVect &NA, BasicBlock::iterator At, 126 BasicBlock *LocB); 297 void HexagonCommonGEP::getBlockTraversalOrder(BasicBlock *Root, 399 BasicBlock *B = cast<BasicBlock>(* [all...] |
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | MachineModuleInfo.cpp | 44 void setPtr(BasicBlock *BB) { 60 Function *Fn; // The containing function of the BasicBlock. 61 unsigned Index; // The index in BBCallbacks for the BasicBlock. 64 DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry> AddrLabelSymbols; 66 /// BBCallbacks - Callbacks for the BasicBlock's that we have entries for. We 71 /// whose corresponding BasicBlock got deleted. These symbols need to be 84 ArrayRef<MCSymbol *> getAddrLabelSymbolToEmit(BasicBlock *BB); 89 void UpdateForDeletedBlock(BasicBlock *BB); 90 void UpdateForRAUWBlock(BasicBlock *Old, BasicBlock *Ne [all...] |
/freebsd-11.0-release/contrib/llvm/tools/lldb/include/lldb/Expression/ |
H A D | IRDynamicChecks.h | 17 class BasicBlock; 161 llvm::BasicBlock &BB);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/CodeGen/ |
H A D | CGCUDARuntime.cpp | 30 llvm::BasicBlock *ConfigOKBlock = CGF.createBasicBlock("kcall.configok"); 31 llvm::BasicBlock *ContBlock = CGF.createBasicBlock("kcall.end");
|
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | Instruction.h | 29 class BasicBlock; 37 public ilist_node_with_parent<Instruction, BasicBlock> { 41 BasicBlock *Parent; 58 inline const BasicBlock *getParent() const { return Parent; } 59 inline BasicBlock *getParent() { return Parent; } 446 bool isUsedOutsideOfBlock(const BasicBlock *BB) const; 514 void setParent(BasicBlock *P); 532 BasicBlock *InsertAtEnd);
|
H A D | ValueSymbolTable.h | 24 class BasicBlock; 37 friend class SymbolTableListTraits<BasicBlock>;
|