| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 208 BasicBlock *StartBB, Instruction *StartInst,
210 SmallPtrSet<const BasicBlock *, 4> &Visited,
212 BasicBlock::iterator StartPos = StartInst;
214 SmallVector<std::pair<BasicBlock *, BasicBlock::iterator>, 4> Worklist;
217 std::pair<BasicBlock *, BasicBlock::iterator> Pair =
219 BasicBlock *LocalStartBB = Pair.first;
220 BasicBlock::iterator LocalStartPos = Pair.second;
221 BasicBlock::iterator StartBBBegin = LocalStartBB->begin()
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LoopSimplify.cpp | 74 static void placeSplitBlockCarefully(BasicBlock *NewBB,
75 SmallVectorImpl<BasicBlock *> &SplitPreds,
90 BasicBlock *FoundBB = nullptr;
112 BasicBlock *llvm::InsertPreheaderForLoop(Loop *L, Pass *PP) {
113 BasicBlock *Header = L->getHeader();
116 SmallVector<BasicBlock*, 8> OutsideBlocks;
119 BasicBlock *P = *PI;
132 BasicBlock *PreheaderBB;
137 SmallVector<BasicBlock*, 2> NewBBs;
159 static BasicBlock *rewriteLoopExitBlock(Loop *L, BasicBlock *Exit, Pass *PP)
[all...] |
| LoopUnroll.cpp | 25 #include "llvm/IR/BasicBlock.h"
60 PN->setIncomingBlock(i, cast<BasicBlock>(It->second));
69 static BasicBlock *FoldBlockIntoPredecessor(BasicBlock *BB, LoopInfo* LI,
74 BasicBlock *OnlyPred = BB->getSinglePredecessor();
150 BasicBlock *Preheader = L->getLoopPreheader();
156 BasicBlock *LatchBlock = L->getLoopLatch();
168 BasicBlock *Header = L->getHeader();
268 BasicBlock *LoopExit = BI->getSuccessor(ContinueOnTrue);
274 for (BasicBlock::iterator I = Header->begin(); isa<PHINode>(I); ++I)
[all...] |
| CodeExtractor.cpp | 52 static bool isBlockValidForExtraction(const BasicBlock &BB) {
58 for (BasicBlock::const_iterator I = BB.begin(), E = BB.end(); I != E; ++I) {
72 static SetVector<BasicBlock *> buildExtractionBlockSet(IteratorT BBBegin,
74 SetVector<BasicBlock *> Result;
91 for (SetVector<BasicBlock *>::iterator I = std::next(Result.begin()),
105 static SetVector<BasicBlock *>
106 buildExtractionBlockSet(ArrayRef<BasicBlock *> BBs) {
111 static SetVector<BasicBlock *>
114 // Just a single BasicBlock.
115 return buildExtractionBlockSet(RN.getNodeAs<BasicBlock>());
[all...] |
| SSAUpdater.cpp | 32 typedef DenseMap<BasicBlock*, Value*> AvailableValsTy;
53 bool SSAUpdater::HasValueForBlock(BasicBlock *BB) const {
57 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) {
65 SmallDenseMap<BasicBlock*, Value*, 8> &ValueMapping) {
80 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) {
85 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) {
93 SmallVector<std::pair<BasicBlock*, Value*>, 8> PredValues;
101 BasicBlock *PredBB = SomePhi->getIncomingBlock(i);
114 BasicBlock *PredBB = *PI;
138 SmallDenseMap<BasicBlock*, Value*, 8> ValueMapping(PredValues.begin()
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SampleProfile.cpp | 109 typedef DenseMap<BasicBlock *, unsigned> BlockWeightMap;
110 typedef DenseMap<BasicBlock *, BasicBlock *> EquivalenceClassMap;
111 typedef std::pair<BasicBlock *, BasicBlock *> Edge;
113 typedef DenseMap<BasicBlock *, SmallVector<BasicBlock *, 8>> BlockEdgeMap;
130 unsigned getBlockWeight(BasicBlock *B);
139 void printBlockWeight(raw_ostream &OS, BasicBlock *BB);
140 void printBlockEquivalence(raw_ostream &OS, BasicBlock *BB)
[all...] |
| LoopUnswitch.cpp | 141 BasicBlock *loopHeader;
142 BasicBlock *loopPreheader;
147 std::vector<BasicBlock*> LoopBlocks;
149 std::vector<BasicBlock*> NewBlocks;
191 void SplitExitEdges(Loop *L, const SmallVectorImpl<BasicBlock *> &ExitBlocks);
195 BasicBlock *ExitBlock);
202 BasicBlock *TrueDest,
203 BasicBlock *FalseDest,
208 BasicBlock **LoopExit = nullptr);
480 for (BasicBlock::iterator BBI = (*I)->begin(), E = (*I)->end()
[all...] |
| PartiallyInlineLibCalls.cpp | 45 BasicBlock &CurrBB, Function::iterator &BB);
68 for (BasicBlock::iterator II = CurrBB->begin(), IE = CurrBB->end();
104 BasicBlock &CurrBB,
125 BasicBlock *JoinBB = llvm::SplitBlock(&CurrBB, Call->getNextNode(), this);
131 BasicBlock *LibCallBB = BasicBlock::Create(CurrBB.getContext(), "call.sqrt",
|
| JumpThreading.cpp | 53 typedef SmallVectorImpl<std::pair<Constant*, BasicBlock*> > PredValueInfo;
54 typedef SmallVector<std::pair<Constant*, BasicBlock*>, 8> PredValueInfoTy;
84 SmallPtrSet<BasicBlock*, 16> LoopHeaders;
86 SmallSet<AssertingVH<BasicBlock>, 16> LoopHeaders;
88 DenseSet<std::pair<Value*, BasicBlock*> > RecursionSet;
92 DenseSet<std::pair<Value*, BasicBlock*> > &TheSet;
93 std::pair<Value*, BasicBlock*> ThePair;
95 RecursionSetRemover(DenseSet<std::pair<Value*, BasicBlock*> > &S,
96 std::pair<Value*, BasicBlock*> P)
118 bool ProcessBlock(BasicBlock *BB)
[all...] |
| LoopRotation.cpp | 126 static void RewriteUsesOfClonedInstructions(BasicBlock *OrigHeader,
127 BasicBlock *OrigPreheader,
130 BasicBlock::iterator I, E = OrigHeader->end();
166 BasicBlock *UserBB = UserInst->getParent();
191 static bool shouldSpeculateInstrs(BasicBlock::iterator Begin,
192 BasicBlock::iterator End) {
194 for (BasicBlock::iterator I = Begin; I != End; ++I) {
241 BasicBlock *Latch = L->getLoopLatch();
249 BasicBlock *LastExit = Latch->getSinglePredecessor();
267 BasicBlock *Header = Jmp->getSuccessor(0)
[all...] |
| LoopInstSimplify.cpp | 80 SmallVector<BasicBlock*, 8> ExitBlocks;
88 typedef PointerIntPair<BasicBlock*, 1> WorklistItem;
90 SmallPtrSet<BasicBlock*, 32> Visited;
104 BasicBlock *BB = Item.getPointer();
108 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {
150 BasicBlock *SuccBB = *SI;
159 SmallVector<BasicBlock*, 8> SubLoopExitBlocks;
163 BasicBlock *ExitBB = SubLoopExitBlocks[i];
|
| /external/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 48 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF);
59 BasicBlock *RetBB = BasicBlock::Create(Context, "return", FibF);
61 BasicBlock* RecurseBB = BasicBlock::Create(Context, "recurse", FibF);
|
| /external/llvm/lib/Analysis/ |
| LazyValueInfo.cpp | 319 /// exactly one Value*. The entries are sorted by the BasicBlock* of the
321 typedef std::map<AssertingVH<BasicBlock>, LVILatticeVal> ValueCacheEntryTy;
330 typedef std::pair<AssertingVH<BasicBlock>, Value*> OverDefinedPairTy;
335 DenseSet<AssertingVH<BasicBlock> > SeenBlocks;
340 std::stack<std::pair<BasicBlock*, Value*> > BlockValueStack;
349 BasicBlock *BB;
352 OverDefinedCacheUpdater(Value *V, BasicBlock *B, LVILatticeVal &LV,
365 LVILatticeVal getBlockValue(Value *Val, BasicBlock *BB);
366 bool getEdgeValue(Value *V, BasicBlock *F, BasicBlock *T
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 38 bool dominates(BasicBlock *, BasicBlock *);
167 insert(&BasicBlock::get(cfg->getRoot())->dom);
171 nw = &BasicBlock::get(vert[DOM(v)])->dom;;
172 nv = &BasicBlock::get(vert[v])->dom;
191 BasicBlock *bb;
196 bb = BasicBlock::get(reinterpret_cast<Node *>(dtIt->get()));
200 BasicBlock *dfLocal = BasicBlock::get(succIt.getNode());
206 BasicBlock *cb = BasicBlock::get(chldIt.getNode())
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 38 bool dominates(BasicBlock *, BasicBlock *);
167 insert(&BasicBlock::get(cfg->getRoot())->dom);
171 nw = &BasicBlock::get(vert[DOM(v)])->dom;;
172 nv = &BasicBlock::get(vert[v])->dom;
191 BasicBlock *bb;
196 bb = BasicBlock::get(reinterpret_cast<Node *>(dtIt->get()));
200 BasicBlock *dfLocal = BasicBlock::get(succIt.getNode());
206 BasicBlock *cb = BasicBlock::get(chldIt.getNode())
[all...] |
| /art/compiler/dex/ |
| bb_optimizations.cc | 31 BasicBlock* bb = pass_me_data_holder->bb;
39 * BasicBlock Combine pass implementation start.
46 BasicBlock* bb = pass_me_data_holder->bb;
55 * BasicBlock Optimization pass implementation start.
|
| /external/lldb/include/lldb/Expression/ |
| IRDynamicChecks.h | 17 class BasicBlock;
161 llvm::BasicBlock &BB);
|
| /external/llvm/examples/ModuleMaker/ |
| ModuleMaker.cpp | 42 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", F);
|
| /external/llvm/include/llvm/Analysis/ |
| LoopPass.h | 80 virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {}
149 void cloneBasicBlockSimpleAnalysis(BasicBlock *From, BasicBlock *To, Loop *L);
|
| /external/llvm/lib/Target/R600/ |
| SIAnnotateControlFlow.cpp | 32 typedef std::pair<BasicBlock *, Value *> StackEntry;
69 bool isTopOfStack(BasicBlock *BB);
73 void push(BasicBlock *BB, Value *Saved);
87 void closeControlFlow(BasicBlock *BB);
152 bool SIAnnotateControlFlow::isTopOfStack(BasicBlock *BB) {
162 void SIAnnotateControlFlow::push(BasicBlock *BB, Value *Saved) {
169 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
208 BasicBlock *Parent = Phi->getParent();
215 BasicBlock *From = Phi->getIncomingBlock(i);
226 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock()
[all...] |
| /external/llvm/examples/HowToUseJIT/ |
| HowToUseJIT.cpp | 71 BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", Add1F);
101 BB = BasicBlock::Create(Context, "EntryBlock", FooF);
|
| /external/llvm/include/llvm/IR/ |
| ValueSymbolTable.h | 24 class BasicBlock;
37 friend class SymbolTableListTraits<BasicBlock, Function>;
38 friend class SymbolTableListTraits<Instruction, BasicBlock>;
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 113 SmallVector<BasicBlock*, 8> ExitBlocks;
127 SmallVector<BasicBlock*, 8> ExitBlocks;
175 std::vector<BasicBlock*> BlocksToNotExtract;
226 BasicBlock *Parent = II->getParent();
227 BasicBlock *LPad = II->getUnwindDest();
234 BasicBlock *BB = *PI;
244 SmallVector<BasicBlock*, 2> NewBBs;
250 std::set<BasicBlock*> TranslatedBlocksToNotExtract;
252 BasicBlock *BB = BlocksToNotExtract[i];
278 BasicBlock &BB = *BI
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.h | 22 class BasicBlock;
33 llvm::BasicBlock *CachedLandingPad;
34 llvm::BasicBlock *CachedEHDispatchBlock;
106 llvm::BasicBlock *getCachedLandingPad() const {
110 void setCachedLandingPad(llvm::BasicBlock *block) {
114 llvm::BasicBlock *getCachedEHDispatchBlock() const {
118 void setCachedEHDispatchBlock(llvm::BasicBlock *block) {
123 if (llvm::BasicBlock *block = getCachedEHDispatchBlock())
151 llvm::BasicBlock *Block;
182 void setCatchAllHandler(unsigned I, llvm::BasicBlock *Block)
[all...] |
| /external/llvm/examples/BrainF/ |
| BrainF.cpp | 78 builder = new IRBuilder<>(BasicBlock::Create(C, label, brainf_func));
82 BasicBlock* BB = builder->GetInsertBlock();
122 endbb = BasicBlock::Create(C, label, brainf_func);
154 aberrorbb = BasicBlock::Create(C, label, brainf_func);
184 void BrainF::readloop(PHINode *phi, BasicBlock *oldbb, BasicBlock *testbb,
260 BasicBlock *nextbb = BasicBlock::Create(C, label, brainf_func);
286 BasicBlock *testbb = BasicBlock::Create(C, label, brainf_func)
[all...] |
