| /external/llvm/lib/Transforms/Scalar/ |
| TailRecursionElimination.cpp | 100 BasicBlock *&OldEntry,
104 bool FoldReturnAndProcessPred(BasicBlock *BB,
105 ReturnInst *Ret, BasicBlock *&OldEntry,
109 bool ProcessReturningBlock(ReturnInst *RI, BasicBlock *&OldEntry,
143 BasicBlock *BB = AI->getParent();
179 BasicBlock *OldEntry = 0;
193 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
249 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
328 if (BasicBlock *UniquePred = RI->getParent()->getUniquePredecessor())
389 static Instruction *FirstNonDbg(BasicBlock::iterator I)
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 649 /// \brief Per-BasicBlock state.
671 SmallVector<BasicBlock *, 2> Preds;
674 SmallVector<BasicBlock *, 2> Succs;
758 typedef SmallVectorImpl<BasicBlock *>::const_iterator edge_iterator;
764 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
765 void addPred(BasicBlock *Pred) { Preds.push_back(Pred); }
[all...] |
| /dalvik/vm/compiler/ |
| InlineTransformation.cpp | 40 BasicBlock *invokeBB,
44 BasicBlock *moveResultBB = invokeBB->fallThrough;
140 BasicBlock *invokeBB,
228 BasicBlock *invokeBB,
262 BasicBlock *invokeBB)
276 BasicBlock *invokeBB,
312 BasicBlock *bb = (BasicBlock *) dvmGrowableListIteratorNext(&iterator);
|
| Frontend.cpp | 512 static BasicBlock *splitBlock(CompilationUnit *cUnit,
514 BasicBlock *origBlock,
515 BasicBlock **immedPredBlockP)
526 BasicBlock *bottomBlock = dvmCompilerNewBB(kDalvikByteCode,
567 BasicBlock *bb = successorBlockInfo->block;
596 static BasicBlock *findBlock(CompilationUnit *cUnit,
599 BasicBlock **immedPredBlockP)
602 BasicBlock *bb;
606 bb = (BasicBlock *) blockList->elemList[i];
613 BasicBlock *newBB = splitBlock(cUnit, codeOffset, bb
[all...] |
| Loop.cpp | 95 static BasicBlock *findPredecessorBlock(const CompilationUnit *cUnit,
96 const BasicBlock *bb)
104 return (BasicBlock *) dvmGrowableListGetElement(&cUnit->blockList,
112 return (BasicBlock *) dvmGrowableListGetElement(&cUnit->blockList,
173 BasicBlock *loopBackBlock = cUnit->entryBlock->fallThrough;
345 BasicBlock *loopBody = cUnit->entryBlock->fallThrough;
432 BasicBlock *entry = cUnit->entryBlock;
514 void resetBlockEdges(BasicBlock *bb)
522 struct BasicBlock *bb)
530 BasicBlock *firstBB = cUnit->entryBlock->fallThrough
[all...] |
| /dalvik/vm/compiler/codegen/arm/armv7-a-neon/ |
| MethodCodegenDriver.cpp | 41 BasicBlock *bb)
109 BasicBlock *bb, ArmLIR *labelList)
139 static bool handleMethodFmt11x(CompilationUnit *cUnit, MIR *mir, BasicBlock *bb,
177 static bool handleMethodFmt21t(CompilationUnit *cUnit, MIR *mir, BasicBlock *bb,
198 static bool handleMethodFmt22t(CompilationUnit *cUnit, MIR *mir, BasicBlock *bb,
220 BasicBlock *bb, ArmLIR *labelList)
226 BasicBlock *bb, ArmLIR *labelList)
242 static bool methodBlockCodeGen(CompilationUnit *cUnit, BasicBlock *bb)
|
| /external/clang/lib/CodeGen/ |
| CGCUDARuntime.cpp | 30 llvm::BasicBlock *ConfigOKBlock = CGF.createBasicBlock("kcall.configok");
31 llvm::BasicBlock *ContBlock = CGF.createBasicBlock("kcall.end");
|
| CGCleanup.cpp | 280 llvm::BasicBlock *CleanupEntry) {
281 llvm::SmallPtrSet<llvm::BasicBlock*, 4> CasesAdded;
316 llvm::BasicBlock *Block) {
335 void CodeGenFunction::ResolveBranchFixups(llvm::BasicBlock *Block) {
342 llvm::SmallPtrSet<llvm::BasicBlock*, 4> ModifiedOptimisticBlocks;
355 llvm::BasicBlock *BranchBB = Fixup.OptimisticBranchBlock;
417 static llvm::BasicBlock *CreateNormalEntry(CodeGenFunction &CGF,
420 llvm::BasicBlock *Entry = Scope.getNormalBlock();
433 static llvm::BasicBlock *SimplifyCleanupEntry(CodeGenFunction &CGF,
434 llvm::BasicBlock *Entry)
[all...] |
| /external/llvm/examples/ParallelJIT/ |
| ParallelJIT.cpp | 45 BasicBlock *BB = BasicBlock::Create(M->getContext(), "EntryBlock", Add1F);
75 BasicBlock *BB = BasicBlock::Create(M->getContext(), "EntryBlock", FibF);
86 BasicBlock *RetBB = BasicBlock::Create(M->getContext(), "return", FibF);
88 BasicBlock* RecurseBB = BasicBlock::Create(M->getContext(), "recurse", FibF);
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfo.h | 31 BlockFrequencyImpl<BasicBlock, Function, BranchProbabilityInfo> *BFI;
50 BlockFrequency getBlockFreq(const BasicBlock *BB) const;
|
| MemoryDependenceAnalysis.h | 22 #include "llvm/IR/BasicBlock.h"
189 /// each BasicBlock (the BB entry) it keeps a MemDepResult.
191 BasicBlock *BB;
194 NonLocalDepEntry(BasicBlock *bb, MemDepResult result)
198 NonLocalDepEntry(BasicBlock *bb) : BB(bb) {}
201 BasicBlock *getBB() const { return BB; }
213 /// For each BasicBlock (the BB entry) it keeps a MemDepResult and the
219 NonLocalDepResult(BasicBlock *bb, MemDepResult result, Value *address)
223 BasicBlock *getBB() const { return Entry.getBB(); }
273 typedef PointerIntPair<BasicBlock*, 1, bool> BBSkipFirstBlockPair
[all...] |
| /external/llvm/include/llvm/IR/ |
| InstrTypes.h | 43 Use *Ops, unsigned NumOps, BasicBlock *InsertAtEnd)
51 virtual BasicBlock *getSuccessorV(unsigned idx) const = 0;
53 virtual void setSuccessorV(unsigned idx, BasicBlock *B) = 0;
65 BasicBlock *getSuccessor(unsigned idx) const {
71 void setSuccessor(unsigned idx, BasicBlock *B) {
98 UnaryInstruction(Type *Ty, unsigned iType, Value *V, BasicBlock *IAE)
145 const Twine &Name, BasicBlock *InsertAtEnd);
158 /// into a BasicBlock right before the specified instruction. The specified
167 /// BasicBlock specified.
170 const Twine &Name, BasicBlock *InsertAtEnd)
[all...] |
| /external/llvm/lib/Analysis/ |
| BlockFrequencyInfo.cpp | 34 BFI = new BlockFrequencyImpl<BasicBlock, Function, BranchProbabilityInfo>();
56 BlockFrequency BlockFrequencyInfo::getBlockFreq(const BasicBlock *BB) const {
|
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 47 void DeleteBasicBlock(BasicBlock *BB);
114 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
191 BasicBlock *UnwindBlock = II->getUnwindDest();
209 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
216 BasicBlock *New = BB->splitBasicBlock(I);
235 void PruneEH::DeleteBasicBlock(BasicBlock *BB) {
240 for (BasicBlock::iterator I = BB->end(), E = BB->begin(); I != E; ) {
252 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
|
| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| cross_block_slp.ll | 8 ; float B1 = B[1]; <----- BasicBlock #1
14 ; A[0] += B0; <------- BasicBlock #3
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_from_tgsi.cpp | 1074 void insertConvergenceOps(BasicBlock *conv, BasicBlock *fork);
1096 bool visit(BasicBlock *bb) { return false; }
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_from_tgsi.cpp | 1074 void insertConvergenceOps(BasicBlock *conv, BasicBlock *fork);
1096 bool visit(BasicBlock *bb) { return false; }
[all...] |
| /art/compiler/llvm/ |
| gbc_expander.cc | 139 std::vector<llvm::BasicBlock*> basic_blocks_;
141 std::vector<llvm::BasicBlock*> basic_block_landing_pads_;
142 llvm::BasicBlock* current_bb_;
143 std::map<llvm::BasicBlock*, std::vector<std::pair<llvm::BasicBlock*, llvm::BasicBlock*> > >
145 llvm::BasicBlock* basic_block_unwind_;
185 void RewriteBasicBlock(llvm::BasicBlock* original_block);
187 void UpdatePhiInstruction(llvm::BasicBlock* old_basic_block,
188 llvm::BasicBlock* new_basic_block)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| InlineFunction.cpp | 46 BasicBlock *OuterResumeDest; ///< Destination of the invoke's unwind.
47 BasicBlock *InnerResumeDest; ///< Destination for the callee's resume.
59 llvm::BasicBlock *InvokeBB = II->getParent();
60 BasicBlock::iterator I = OuterResumeDest->begin();
72 BasicBlock *getOuterResumeDest() const {
76 BasicBlock *getInnerResumeDest();
91 void addIncomingPHIValuesFor(BasicBlock *BB) const {
95 void addIncomingPHIValuesForInto(BasicBlock *src, BasicBlock *dest) const {
96 BasicBlock::iterator I = dest->begin()
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| Local.h | 26 class BasicBlock;
57 bool ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions = false,
89 bool SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD = 0,
96 /// RemovePredecessorAndSimplify - Like BasicBlock::removePredecessor, this
107 void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
116 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = 0);
124 bool TryToSimplifyUncondBranchFromEmptyBlock(BasicBlock *BB);
131 bool EliminateDuplicatePHINodes(BasicBlock *BB);
139 bool SimplifyCFG(BasicBlock *BB, const TargetTransformInfo &TTI
[all...] |
| /external/llvm/lib/CodeGen/ |
| StackProtector.cpp | 77 BasicBlock *CreateFailBB();
231 BasicBlock *BB = I;
233 for (BasicBlock::iterator
296 BasicBlock &Entry = F->getEntryBlock();
315 BasicBlock *FailBB = 0; // The basic block to jump to if check fails.
316 BasicBlock *FailBBDom = 0; // FailBB's dominator.
321 BasicBlock *BB = I++;
354 BasicBlock *NewBB = BB->splitBasicBlock(RI, "SP_return");
387 BasicBlock *StackProtector::CreateFailBB() {
389 BasicBlock *FailBB = BasicBlock::Create(Context, "CallStackCheckFailBlk", F)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_lowering_nvc0.cpp | 45 virtual bool visit(BasicBlock *);
97 NVC0LegalizeSSA::visit(BasicBlock *bb)
128 virtual bool visit(BasicBlock *);
132 bool tryReplaceContWithBra(BasicBlock *);
133 void propagateJoin(BasicBlock *);
154 const BasicBlock *term,
201 const BasicBlock *term,
293 BasicBlock *bb = reinterpret_cast<BasicBlock *>(i.get());
321 BasicBlock *tb = texes[i]->bb
[all...] |
| /external/mesa3d/src/gallium/drivers/nvc0/codegen/ |
| nv50_ir_lowering_nvc0.cpp | 45 virtual bool visit(BasicBlock *);
97 NVC0LegalizeSSA::visit(BasicBlock *bb)
128 virtual bool visit(BasicBlock *);
132 bool tryReplaceContWithBra(BasicBlock *);
133 void propagateJoin(BasicBlock *);
154 const BasicBlock *term,
201 const BasicBlock *term,
293 BasicBlock *bb = reinterpret_cast<BasicBlock *>(i.get());
321 BasicBlock *tb = texes[i]->bb
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| PathProfiling.cpp | 82 // Creates a new BLInstrumentationNode from a BasicBlock.
83 BLInstrumentationNode(BasicBlock* BB);
192 void splitUpdate(BLInstrumentationEdge* formerEdge, BasicBlock* newBlock);
222 virtual BallLarusNode* createNode(BasicBlock* BB);
291 BasicBlock::iterator getInsertionPoint(
292 BasicBlock* block, Value* pathNumber);
314 BasicBlock::iterator insertPoint,
403 // Creates a new BLInstrumentationNode from a BasicBlock.
404 BLInstrumentationNode::BLInstrumentationNode(BasicBlock* BB) :
485 BasicBlock* source = sourceNode->getBlock()
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen.cc | 301 BasicBlock *CodeGen::MakeBasicBlock(Instruction *head,
305 BasicBlock *bb = new BasicBlock;
323 BasicBlock **firstBlock) {
332 BasicBlock *bb = MakeBasicBlock(head, tail);
340 BasicBlock *CodeGen::CutGraphIntoBasicBlocks(
347 BasicBlock *first_block = NULL;
413 static int PointerCompare(const BasicBlock *block1, const BasicBlock *block2,
490 // We enter all of our basic blocks into a set using the BasicBlock::Less(
[all...] |
