Home
last modified time | relevance | path

Searched refs:BasicBlock (Results 1 – 25 of 676) sorted by relevance

12345678910>>...28

/freebsd-src/contrib/llvm-project/llvm/include/llvm/IR/
H A DBasicBlock.h1 //===- llvm/BasicBlock.h - Represent a basic block in the VM ----*- C++ -*-===//
9 // This file contains the declaration of the BasicBlock class.
50 /// tables. The type of a BasicBlock is "Type::LabelTy" because the basic block
56 /// the blocks. The BasicBlock class allows malformed basic blocks to occur
60 class BasicBlock final : public Value, // Basic blocks are data objects also
61 public ilist_node_with_parent<BasicBlock, Function> {
64 ilist_parent<BasicBlock>>;
71 friend class SymbolTableListTraits<BasicBlock>;
122 /// BasicBlock::getMarker, this can be nullptr, a DbgMarker, or
154 explicit BasicBlock(LLVMContex
470 friend BasicBlock; global() variable
[all...]
H A DDominators.h26 #include "llvm/IR/BasicBlock.h"
46 extern template class DomTreeNodeBase<BasicBlock>;
47 extern template class DominatorTreeBase<BasicBlock, false>; // DomTree
48 extern template class DominatorTreeBase<BasicBlock, true>; // PostDomTree
50 extern template class cfg::Update<BasicBlock *>;
53 using BBDomTree = DomTreeBase<BasicBlock>;
54 using BBPostDomTree = PostDomTreeBase<BasicBlock>;
56 using BBUpdates = ArrayRef<llvm::cfg::Update<BasicBlock *>>;
58 using BBDomTreeGraphDiff = GraphDiff<BasicBlock *, false>;
59 using BBPostDomTreeGraphDiff = GraphDiff<BasicBlock *, tru
102 BasicBlockEdge(const std::pair<BasicBlock *,BasicBlock * > & Pair) BasicBlockEdge() argument
105 BasicBlockEdge(const std::pair<const BasicBlock *,const BasicBlock * > & Pair) BasicBlockEdge() argument
[all...]
H A DCFG.h104 using pred_iterator = PredIterator<BasicBlock, Value::user_iterator>;
106 PredIterator<const BasicBlock, Value::const_user_iterator>;
110 inline pred_iterator pred_begin(BasicBlock *BB) { return pred_iterator(BB); } in pred_begin()
111 inline const_pred_iterator pred_begin(const BasicBlock *BB) { in pred_begin()
114 inline pred_iterator pred_end(BasicBlock *BB) { return pred_iterator(BB, true);} in pred_end()
115 inline const_pred_iterator pred_end(const BasicBlock *BB) { in pred_end()
118 inline bool pred_empty(const BasicBlock *BB) { in pred_empty()
123 inline unsigned pred_size(const BasicBlock *BB) { in pred_size()
126 inline pred_range predecessors(BasicBlock *BB) { in predecessors()
129 inline const_pred_range predecessors(const BasicBlock *BB) { in predecessors()
[all …]
H A DPredIteratorCache.h29 mutable DenseMap<BasicBlock *, BasicBlock **> BlockToPredsMap;
30 mutable DenseMap<BasicBlock *, unsigned> BlockToPredCountMap;
42 BasicBlock **GetPreds(BasicBlock *BB) { in GetPreds()
43 BasicBlock **&Entry = BlockToPredsMap[BB]; in GetPreds()
47 SmallVector<BasicBlock *, 32> PredCache(predecessors(BB)); in GetPreds()
52 Entry = Memory.Allocate<BasicBlock *>(PredCache.size()); in GetPreds()
57 unsigned GetNumPreds(BasicBlock *BB) const { in GetNumPreds()
65 size_t size(BasicBlock *BB) const { return GetNumPreds(BB); } in size()
66 ArrayRef<BasicBlock *> get(BasicBlock *BB) { in get()
H A DInstructions.h48 class BasicBlock;
924 /// specified BasicBlock.
2310 /// instruction to the specified BasicBlock.
2398 /// the new instruction to the specified BasicBlock.
2552 using block_iterator = BasicBlock **;
2553 using const_block_iterator = BasicBlock * const *;
2597 BasicBlock *getIncomingBlock(unsigned i) const {
2604 BasicBlock *getIncomingBlock(const Use &U) const {
2612 BasicBlock *getIncomingBlock(Value::const_user_iterator I) const {
2616 void setIncomingBlock(unsigned i, BasicBlock *B
46 class BasicBlock; global() variable
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DJumpThreading.h32 class BasicBlock;
55 using PredValueInfo = SmallVectorImpl<std::pair<Constant *, BasicBlock *>>;
56 using PredValueInfoTy = SmallVector<std::pair<Constant *, BasicBlock *>, 8>;
92 SmallPtrSet<const BasicBlock *, 16> LoopHeaders;
94 SmallSet<AssertingVH<const BasicBlock>, 16> LoopHeaders;
115 bool processBlock(BasicBlock *BB);
116 bool maybeMergeBasicBlockIntoOnlyPred(BasicBlock *BB);
117 void updateSSA(BasicBlock *BB, BasicBlock *NewBB,
120 BasicBlock
31 class BasicBlock; global() variable
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h49 void detachDeadBlocks(ArrayRef <BasicBlock *> BBs,
54 void DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU = nullptr,
63 void DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs,
77 bool FoldSingleEntryPHINodes(BasicBlock *BB,
84 bool DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI = nullptr,
96 bool MergeBlockIntoPredecessor(BasicBlock *BB, DomTreeUpdater *DTU = nullptr,
111 SmallPtrSetImpl<BasicBlock *> &MergeBlocks, Loop *L = nullptr,
117 bool RemoveRedundantDbgInstrs(BasicBlock *BB);
121 void ReplaceInstWithValue(BasicBlock::iterator &BI, Value *V);
127 void ReplaceInstWithInst(BasicBlock *BB, BasicBlock::iterator &BI,
[all …]
H A DCodeExtractor.h26 class BasicBlock; variable
51 DenseMap<BasicBlock *, DenseSet<Value *>> BaseMemAddrs;
55 DenseSet<BasicBlock *> SideEffectingBlocks;
57 void findSideEffectInfoForBlock(BasicBlock &BB);
69 bool doesBlockContainClobberOfAddr(BasicBlock &BB, AllocaInst *Addr) const;
98 BasicBlock *AllocationBlock;
104 SetVector<BasicBlock *> Blocks;
110 SmallVector<BasicBlock *, 4> OldTargets;
138 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
143 BasicBlock *AllocationBloc
[all...]
H A DLoopConstrainer.h18 class BasicBlock; variable
37 BasicBlock *Header = nullptr;
38 BasicBlock *Latch = nullptr;
43 BasicBlock *LatchExit = nullptr;
68 Result.Header = cast<BasicBlock>(Map(Header)); in map()
69 Result.Latch = cast<BasicBlock>(Map(Latch)); in map()
71 Result.LatchExit = cast<BasicBlock>(Map(LatchExit)); in map()
113 std::vector<BasicBlock *> Blocks;
125 BasicBlock *PseudoExit = nullptr;
126 BasicBlock *ExitSelector = nullptr;
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/IR/
H A DBasicBlock.cpp1 //===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===//
9 // This file implements the BasicBlock class for the IR library.
13 #include "llvm/IR/BasicBlock.h"
52 DbgMarker *BasicBlock::createMarker(Instruction *I) { in createMarker()
63 DbgMarker *BasicBlock::createMarker(InstListType::iterator It) { in convertToNewDbgValues()
76 void BasicBlock::convertToNewDbgValues() { in convertToNewDbgValues()
115 void BasicBlock::convertFromNewDbgValues() { in convertFromNewDbgValues()
141 void BasicBlock::dumpDbgValues() const { in validateDbgValues()
152 void BasicBlock in validateDbgValues()
220 BasicBlock::BasicBlock(LLVMContext &C, const Twine &Name, Function *NewParent, BasicBlock() function in BasicBlock
[all...]
H A DDominators.cpp53 for (const BasicBlock *Succ : successors(Start)) { in isSingleEdge()
73 template class llvm::DomTreeNodeBase<BasicBlock>;
74 template class llvm::DominatorTreeBase<BasicBlock, false>; // DomTreeBase
75 template class llvm::DominatorTreeBase<BasicBlock, true>; // PostDomTreeBase
77 template class llvm::cfg::Update<BasicBlock *>;
90 DomTreeBuilder::BBDomTree &DT, BasicBlock *From, BasicBlock *To);
92 DomTreeBuilder::BBPostDomTree &DT, BasicBlock *From, BasicBlock *To);
95 DomTreeBuilder::BBDomTree &DT, BasicBlock *From, BasicBlock *To);
97 DomTreeBuilder::BBPostDomTree &DT, BasicBlock *From, BasicBlock *To);
122 bool DominatorTree::dominates(const BasicBlock *BB, const Use &U) const { in dominates()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DMemorySSAUpdater.h44 class BasicBlock; variable
52 using CFGUpdate = cfg::Update<BasicBlock *>;
62 SmallPtrSet<BasicBlock *, 8> VisitedBlocks;
89 void removeEdge(BasicBlock *From, BasicBlock *To);
93 void removeDuplicatePhiEdgesBetween(const BasicBlock *From,
94 const BasicBlock *To);
96 void updatePhisWhenInsertingUniqueBackedgeBlock(BasicBlock *LoopHeader,
97 BasicBlock *LoopPreheader,
98 BasicBlock *BackedgeBloc
[all...]
H A DBranchProbabilityInfo.h19 #include "llvm/IR/BasicBlock.h"
158 BranchProbability getEdgeProbability(const BasicBlock *Src,
164 BranchProbability getEdgeProbability(const BasicBlock *Src,
165 const BasicBlock *Dst) const;
167 BranchProbability getEdgeProbability(const BasicBlock *Src,
174 bool isEdgeHot(const BasicBlock *Src, const BasicBlock *Dst) const;
181 raw_ostream &printEdgeProbability(raw_ostream &OS, const BasicBlock *Src,
182 const BasicBlock *Dst) const;
190 void setEdgeProbability(const BasicBlock *Sr
[all...]
H A DIteratedDominanceFrontier.h17 class BasicBlock; variable
22 template <bool IsPostDom> struct ChildrenGetterTy<BasicBlock, IsPostDom> {
23 using NodeRef = BasicBlock *;
24 using ChildrenTy = SmallVector<BasicBlock *, 8>;
27 ChildrenGetterTy(const GraphDiff<BasicBlock *, IsPostDom> *GD) : GD(GD) {
33 const GraphDiff<BasicBlock *, IsPostDom> *GD = nullptr;
39 class IDFCalculator final : public IDFCalculatorBase<BasicBlock, IsPostDom> {
42 typename llvm::IDFCalculatorBase<BasicBlock, IsPostDom>;
45 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT)
48 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT,
[all …]
H A DInterval.h
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFlattenCFG.cpp17 #include "llvm/IR/BasicBlock.h"
40 bool FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder);
45 bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder);
52 bool CompareIfRegionBlock(BasicBlock *Block1, BasicBlock *Block2,
53 BasicBlock *Head2);
58 bool run(BasicBlock *BB);
136 bool FlattenCFGOpt::FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder) { in FlattenParallelAndOr()
141 BasicBlock *LastCondBlock = nullptr; in FlattenParallelAndOr()
142 BasicBlock *FirstCondBloc in FlattenParallelAndOr()
[all...]
H A DBasicBlockUtils.cpp1 //===- BasicBlockUtils.cpp - BasicBlock Utilities --------------------------==//
24 #include "llvm/IR/BasicBlock.h"
63 ArrayRef<BasicBlock *> BBs, in detachDeadBlocks()
69 SmallPtrSet<BasicBlock *, 4> UniqueSuccessors; in detachDeadBlocks()
70 for (BasicBlock *Succ : successors(BB)) { in detachDeadBlocks()
96 void llvm::DeleteDeadBlock(BasicBlock *BB, DomTreeUpdater *DTU, in DeleteDeadBlock()
101 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU, in DeleteDeadBlocks()
105 SmallPtrSet<BasicBlock *, 4> Dead(BBs.begin(), BBs.end()); in DeleteDeadBlocks()
108 for (BasicBlock *Pred : predecessors(BB)) in DeleteDeadBlocks()
118 for (BasicBlock *B in DeleteDeadBlocks()
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp22 #include "llvm/IR/BasicBlock.h"
75 using BBValuePair = std::pair<BasicBlock *, Value *>;
78 using BBVector = SmallVector<BasicBlock *, 8>;
82 using BBSet = SmallPtrSet<BasicBlock *, 8>;
85 using BB2BBVecMap = MapVector<BasicBlock *, BBVector>;
87 using BBPhiMap = DenseMap<BasicBlock *, PhiMap>;
88 using BBPredicates = DenseMap<BasicBlock *, Value *>;
89 using PredMap = DenseMap<BasicBlock *, BBPredicates>;
90 using BB2BBMap = DenseMap<BasicBlock *, BasicBlock *>;
657 findUndefBlocks(BasicBlock * PHIBlock,const SmallSet<BasicBlock *,8> & Incomings,SmallVector<BasicBlock * > & UndefBlks) const findUndefBlocks() argument
908 __anonabeaf6490302(std::pair<BasicBlock *, Value *> Pred) dominatesPredicates() argument
[all...]
H A DLoopSink.cpp78 static BlockFrequency adjustedSumFreq(SmallPtrSetImpl<BasicBlock *> &BBs, in adjustedSumFreq()
81 for (BasicBlock *B : BBs) in adjustedSumFreq()
115 static SmallPtrSet<BasicBlock *, 2>
116 findBBsToSinkInto(const Loop &L, const SmallPtrSetImpl<BasicBlock *> &UseBBs, in findBBsToSinkInto()
117 const SmallVectorImpl<BasicBlock *> &ColdLoopBBs, in findBBsToSinkInto()
119 SmallPtrSet<BasicBlock *, 2> BBsToSinkInto; in findBBsToSinkInto()
124 SmallPtrSet<BasicBlock *, 2> BBsDominatedByColdestBB; in findBBsToSinkInto()
134 for (BasicBlock *ColdestBB : ColdLoopBBs) { in findBBsToSinkInto()
136 for (BasicBlock *SinkedBB : BBsToSinkInto) in findBBsToSinkInto()
143 for (BasicBlock *DominatedBB : BBsDominatedByColdestBB) { in findBBsToSinkInto()
[all …]
H A DDFAJumpThreading.cpp136 std::vector<BasicBlock *> *NewBBs); in DFAJumpThreading()
160 std::vector<BasicBlock *> NewBBs; in unfoldSelectInstrs()
183 BasicBlock *EndBlock, StringRef NewBBName, BasicBlock **NewBlock, in createBasicBlockAndSinkSelectInst()
185 std::vector<BasicBlock *> *NewBBs) { in createBasicBlockAndSinkSelectInst()
189 *NewBlock = BasicBlock::Create(SI->getContext(), NewBBName,
207 std::vector<BasicBlock *> *NewBBs) { in unfold()
210 BasicBlock *StartBlock = SI->getParent(); in unfold()
211 BasicBlock *EndBlock = SIUse->getParent(); in unfold()
220 BasicBlock *TrueBloc in unfold()
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/
H A DCFG.cpp1 //===-- CFG.cpp - BasicBlock analysis --------------------------------------==//
35 SmallVectorImpl<std::pair<const BasicBlock*,const BasicBlock*> > &Result) { in FindFunctionBackedges() argument
36 const BasicBlock *BB = &F.getEntryBlock(); in FindFunctionBackedges()
40 SmallPtrSet<const BasicBlock*, 8> Visited; in FindFunctionBackedges()
41 SmallVector<std::pair<const BasicBlock *, const_succ_iterator>, 8> VisitStack; in FindFunctionBackedges()
42 SmallPtrSet<const BasicBlock*, 8> InStack; in FindFunctionBackedges()
48 std::pair<const BasicBlock *, const_succ_iterator> &Top = VisitStack.back(); in FindFunctionBackedges()
49 const BasicBlock *ParentBB = Top.first; in FindFunctionBackedges()
79 unsigned llvm::GetSuccessorNumber(const BasicBlock *B
[all...]
H A DMemorySSAUpdater.cpp19 #include "llvm/IR/BasicBlock.h"
37 BasicBlock *BB, in getPreviousDefRecursive()
38 DenseMap<BasicBlock *, TrackingVH<MemoryAccess>> &CachedPreviousDef) { in getPreviousDefRecursive() argument
49 if (BasicBlock *Pred = BB->getUniquePredecessor()) { in getPreviousDefRecursive()
140 DenseMap<BasicBlock *, TrackingVH<MemoryAccess>> CachedPreviousDef; in getPreviousDef()
173 BasicBlock *BB, in getPreviousDefFromEnd()
174 DenseMap<BasicBlock *, TrackingVH<MemoryAccess>> &CachedPreviousDef) { in getPreviousDefFromEnd() argument
264 SmallPtrSet<BasicBlock *, 16> Visited; in insertUse()
265 BasicBlock *StartBlock = MU->getBlock(); in insertUse()
285 static void setMemoryPhiValueForBlock(MemoryPhi *MP, const BasicBlock *B
891 __anon725ef00a0702(const SmallSetVector<BasicBlock *, 2> &BBSet) applyInsertUpdates() argument
1348 removeBlocks(const SmallSetVector<BasicBlock *,8> & DeadBlocks) removeBlocks() argument
[all...]
/freebsd-src/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp58 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) { in addPredecessor()
71 void BasicBlock::reservePredecessors(unsigned NumPreds) { in reservePredecessors()
152 unsigned BasicBlock::renumberInstrs(unsigned ID) { in renumberInstrs()
165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort()
189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort()
208 void BasicBlock::computeDominator() { in computeDominator()
209 BasicBlock *Candidate = nullptr; in computeDominator()
235 void BasicBlock::computePostDominator() { in computePostDominator()
236 BasicBlock *Candidate = nullptr; in computePostDominator()
266 static inline void computeNodeSize(BasicBlock *B, in computeNodeSize()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp30 #include "llvm/IR/BasicBlock.h"
156 SmallVector<BasicBlock *, 4> Entries;
159 BasicBlock *ReturnBlock = nullptr;
162 BasicBlock *NonReturnBlock = nullptr;
165 SmallVector<BasicBlock *, 4> ReturnBlockPreds;
173 OutlineRegionInfo(ArrayRef<BasicBlock *> Region, in OutlineRegionInfo()
174 BasicBlock *EntryBlock, BasicBlock *ExitBlock, in OutlineRegionInfo()
175 BasicBlock *ReturnBlock) in OutlineRegionInfo()
178 SmallVector<BasicBlock *, in OutlineRegionInfo()
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DBlockCoverageInference.h26 class BasicBlock; variable
33 using BlockSet = SmallSetVector<const BasicBlock *, 4>;
38 bool shouldInstrumentBlock(const BasicBlock &BB) const;
42 BlockSet getDependencies(const BasicBlock &BB) const;
56 const DenseMap<const BasicBlock *, bool> *Coverage = nullptr) const;
64 DenseMap<const BasicBlock *, BlockSet> PredecessorDependencies;
68 DenseMap<const BasicBlock *, BlockSet> SuccessorDependencies;
75 void getReachableAvoiding(const BasicBlock &Start, const BasicBlock &Avoid,
78 static std::string getBlockNames(ArrayRef<const BasicBlock *> BBs);
80 return getBlockNames(ArrayRef<const BasicBlock *>(BBs.begin(), BBs.end())); in getBlockNames()

12345678910>>...28