| /dalvik/vm/compiler/ |
| CompilerUtility.h | 57 struct BasicBlock;
75 void dvmGetBlockName(struct BasicBlock *bb, char *name);
|
| Compiler.h | 187 struct BasicBlock;
222 struct BasicBlock *bb);
224 struct BasicBlock *bb);
226 struct BasicBlock *bb);
228 struct BasicBlock *bb);
231 struct BasicBlock *bb);
239 bool (*func)(struct CompilationUnit *, struct BasicBlock *),
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| ProfilingUtils.h | 21 class BasicBlock;
30 void IncrementCounterInBlock(BasicBlock *BB, unsigned CounterNum,
|
| BoundsChecking.cpp | 61 BasicBlock *TrapBB;
63 BasicBlock *getTrapBB();
78 BasicBlock *BoundsChecking::getTrapBB() {
83 BasicBlock::iterator PrevInsertPoint = Builder->GetInsertPoint();
84 TrapBB = BasicBlock::Create(Fn->getContext(), "trap", Fn);
114 BasicBlock *OldBB = Inst->getParent();
115 BasicBlock *Cont = OldBB->splitBasicBlock(Inst);
|
| /external/llvm/include/llvm/IR/ |
| Instructions.h | 67 const Twine &Name, BasicBlock *InsertAtEnd);
70 AllocaInst(Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd);
75 const Twine &Name, BasicBlock *InsertAtEnd);
144 LoadInst(Value *Ptr, const Twine &NameStr, BasicBlock *InsertAtEnd);
148 BasicBlock *InsertAtEnd);
152 unsigned Align, BasicBlock *InsertAtEnd);
160 BasicBlock *InsertAtEnd);
163 LoadInst(Value *Ptr, const char *NameStr, BasicBlock *InsertAtEnd);
167 BasicBlock *InsertAtEnd);
268 StoreInst(Value *Val, Value *Ptr, BasicBlock *InsertAtEnd)
[all...] |
| /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/CodeGen/ |
| MachineModuleInfo.cpp | 42 void setPtr(BasicBlock *BB) {
59 Function *Fn; // The containing function of the BasicBlock.
60 unsigned Index; // The index in BBCallbacks for the BasicBlock.
63 DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry> AddrLabelSymbols;
65 /// BBCallbacks - Callbacks for the BasicBlock's that we have entries for. We
70 /// whose corresponding BasicBlock got deleted. These symbols need to be
83 for (DenseMap<AssertingVH<BasicBlock>, AddrLabelSymEntry>::iterator
89 MCSymbol *getAddrLabelSymbol(BasicBlock *BB);
90 std::vector<MCSymbol*> getAddrLabelSymbolToEmit(BasicBlock *BB);
95 void UpdateForDeletedBlock(BasicBlock *BB)
[all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsOptimizeMathLibCalls.cpp | 49 BasicBlock &CurrBB,
83 for (BasicBlock::iterator II = CurrBB->begin(), IE = CurrBB->end();
126 BasicBlock &CurrBB,
147 BasicBlock *JoinBB = llvm::SplitBlock(&CurrBB, Call->getNextNode(), this);
153 BasicBlock *LibCallBB = BasicBlock::Create(CurrBB.getContext(), "call.sqrt",
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reg2Mem.cpp | 22 #include "llvm/IR/BasicBlock.h"
49 const BasicBlock *BB = Inst->getParent();
75 BasicBlock *BBEntry = &F.getEntryBlock();
82 BasicBlock::iterator I = BBEntry->begin();
95 for (BasicBlock::iterator iib = ibb->begin(), iie = ibb->end();
114 for (BasicBlock::iterator iib = ibb->begin(), iie = ibb->end();
|
| LoopUnswitch.cpp | 140 BasicBlock *loopHeader;
141 BasicBlock *loopPreheader;
146 std::vector<BasicBlock*> LoopBlocks;
148 std::vector<BasicBlock*> NewBlocks;
199 void SplitExitEdges(Loop *L, const SmallVectorImpl<BasicBlock *> &ExitBlocks);
203 BasicBlock *ExitBlock);
210 BasicBlock *TrueDest,
211 BasicBlock *FalseDest,
215 void RemoveBlockIfDead(BasicBlock *BB,
219 BasicBlock **LoopExit = 0)
[all...] |
| Sink.cpp | 56 bool ProcessBlock(BasicBlock &BB);
58 bool AllUsesDominatedByBlock(Instruction *Inst, BasicBlock *BB) const;
59 bool IsAcceptableTarget(Instruction *Inst, BasicBlock *SuccToSinkTo) const;
75 BasicBlock *BB) const {
84 BasicBlock *UseBlock = UseInst->getParent();
119 bool Sinking::ProcessBlock(BasicBlock &BB) {
131 BasicBlock::iterator I = BB.end();
181 BasicBlock *SuccToSinkTo) const {
235 BasicBlock *SuccToSinkTo = 0;
243 BasicBlock *Candidate = (*I)->getBlock()
[all...] |
| LoopRotation.cpp | 102 static void RewriteUsesOfClonedInstructions(BasicBlock *OrigHeader,
103 BasicBlock *OrigPreheader,
106 BasicBlock::iterator I, E = OrigHeader->end();
142 BasicBlock *UserBB = UserInst->getParent();
167 static bool shouldSpeculateInstrs(BasicBlock::iterator Begin,
168 BasicBlock::iterator End) {
170 for (BasicBlock::iterator I = Begin; I != End; ++I) {
217 BasicBlock *Latch = L->getLoopLatch();
225 BasicBlock *LastExit = Latch->getSinglePredecessor();
243 BasicBlock *Header = Jmp->getSuccessor(0)
[all...] |
| /external/llvm/tools/llvm-diff/ |
| DiffConsumer.cpp | 36 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); BI != BE; ++BI)
110 } else if (isa<BasicBlock>(I->L)) {
111 BasicBlock *L = cast<BasicBlock>(I->L);
112 BasicBlock *R = cast<BasicBlock>(I->R);
|
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 31 BasicBlock *BB0 = FI++;
32 BasicBlock::iterator BBI = BB0->begin();
37 BasicBlock *BB1 = FI++;
41 BasicBlock *BB2 = FI++;
45 BasicBlock *BB3 = FI++;
50 BasicBlock *BB4 = FI++;
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 20 import com.android.dx.rop.code.BasicBlock;
108 private final ArrayList<BasicBlock> result;
220 BasicBlock subCaller = labelToBlock(label);
240 BasicBlock subCaller = labelToBlock(label);
306 this.result = new ArrayList<BasicBlock>(blocks.size() * 2 + 10);
392 for (BasicBlock bb : result) {
462 BasicBlock one = result.get(i);
478 private BasicBlock labelToBlock(int label) {
496 private void addBlock(BasicBlock block, IntList subroutines) {
517 private boolean addOrReplaceBlock(BasicBlock block, IntList subroutines)
[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...] |
| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 36 std::set<BasicBlock*> BBToVisit;
69 virtual void recurseBasicBlock(BasicBlock *BB);
119 void ProfileEstimatorPass::recurseBasicBlock(BasicBlock *BB) {
121 // Break the recursion if this BasicBlock was already visited.
130 std::set<BasicBlock*> ProcessedPreds;
203 BasicBlock *Latch = BBLoop->getLoopLatch();
239 const BasicBlock *Dest = GetPath(BB, (*ei).first, p, GetPathToDest);
241 const BasicBlock *Parent = p.find(Dest)->second;
261 std::set<BasicBlock*> ProcessedSuccs;
339 BasicBlock *entry = &F.getEntryBlock()
[all...] |
| PathProfileVerifier.cpp | 72 typedef std::map<BasicBlock*,DuplicateToIndexMap> BlockToDuplicateMap;
73 typedef std::map<BasicBlock*,BlockToDuplicateMap> NestedBlockToIndexMap;
87 arrayMap[(BasicBlock*)0][F->begin()][0] = i++;
93 BasicBlock* prev = 0;
128 edgeArray[arrayMap[(BasicBlock*)0][currentPath->getFirstBlockInPath()][0]]
136 BasicBlock* source = nextEdge->getSource();
137 BasicBlock* target = nextEdge->getTarget();
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 77 BasicBlock *Dest;
79 ValueEqualityComparisonCase(ConstantInt *Value, BasicBlock *Dest)
87 bool operator==(BasicBlock *RHSDest) const { return Dest == RHSDest; }
94 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI,
97 BasicBlock *Pred,
113 bool run(BasicBlock *BB);
126 BasicBlock *SI1BB = SI1->getParent();
127 BasicBlock *SI2BB = SI2->getParent();
128 SmallPtrSet<BasicBlock*, 16> SI1Succs(succ_begin(SI1BB), succ_end(SI1BB));
132 for (BasicBlock::iterator BBI = (*I)->begin()
[all...] |
| SSAUpdater.cpp | 33 typedef DenseMap<BasicBlock*, Value*> AvailableValsTy;
54 bool SSAUpdater::HasValueForBlock(BasicBlock *BB) const {
58 void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) {
66 DenseMap<BasicBlock*, Value*> &ValueMapping) {
81 Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) {
86 Value *SSAUpdater::GetValueInMiddleOfBlock(BasicBlock *BB) {
94 SmallVector<std::pair<BasicBlock*, Value*>, 8> PredValues;
102 BasicBlock *PredBB = SomePhi->getIncomingBlock(i);
115 BasicBlock *PredBB = *PI;
139 DenseMap<BasicBlock*, Value*> ValueMapping(PredValues.begin()
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir.h | 298 class BasicBlock;
706 BasicBlock *bb;
848 BasicBlock *bb;
854 class BasicBlock
857 BasicBlock(Function *);
858 ~BasicBlock();
860 BasicBlock *clone(ClonePolicy<Function>&) const;
866 bool dominatedBy(BasicBlock *bb);
867 inline bool reachableBy(const BasicBlock *by, const BasicBlock *term)
[all...] |
| nv50_ir_inlines.h | 362 bool BasicBlock::reachableBy(const BasicBlock *by, const BasicBlock *term)
367 BasicBlock *BasicBlock::get(Iterator &iter)
369 return reinterpret_cast<BasicBlock *>(iter.get());
372 BasicBlock *BasicBlock::get(Graph::Node *node)
375 return reinterpret_cast<BasicBlock *>(node->data);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir.h | 298 class BasicBlock;
706 BasicBlock *bb;
848 BasicBlock *bb;
854 class BasicBlock
857 BasicBlock(Function *);
858 ~BasicBlock();
860 BasicBlock *clone(ClonePolicy<Function>&) const;
866 bool dominatedBy(BasicBlock *bb);
867 inline bool reachableBy(const BasicBlock *by, const BasicBlock *term)
[all...] |
| /art/compiler/dex/ |
| mir_graph.cc | 131 BasicBlock* MIRGraph::SplitBlock(unsigned int code_offset,
132 BasicBlock* orig_block, BasicBlock** immed_pred_block_p) {
141 BasicBlock *bottom_block = NewMemBB(kDalvikByteCode, num_blocks_++);
180 BasicBlock *bb = successor_block_info->block;
209 BasicBlock* MIRGraph::FindBlock(unsigned int code_offset, bool split, bool create,
210 BasicBlock** immed_pred_block_p) {
211 BasicBlock* bb;
213 SafeMap<unsigned int, BasicBlock*>::iterator it;
229 BasicBlock *new_bb = SplitBlock(code_offset, bb, bb == *immed_pred_block_p
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdater.h | 21 class BasicBlock;
43 //typedef DenseMap<BasicBlock*, Value*> AvailableValsTy;
70 void AddAvailableValue(BasicBlock *BB, Value *V);
74 bool HasValueForBlock(BasicBlock *BB) const;
78 Value *GetValueAtEndOfBlock(BasicBlock *BB);
100 Value *GetValueInMiddleOfBlock(BasicBlock *BB);
119 Value *GetValueAtEndOfBlockInternal(BasicBlock *BB);
|
