| /art/compiler/dex/ |
| post_opt_passes.cc | 44 BasicBlock* bb = pass_me_data_holder->bb;
57 BasicBlock* bb = pass_me_data_holder->bb;
86 for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) {
92 for (BasicBlock* bb = second.Next(); bb != nullptr; bb = second.Next()) {
102 for (BasicBlock* child = child_iter.Next(); child != nullptr; child = child_iter.Next()) {
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlock.java | 27 public final class BasicBlock implements LabeledItem {
59 public BasicBlock(int label, InsnList insns, IntList successors,
262 public BasicBlock withRegisterOffset(int delta) {
263 return new BasicBlock(label, insns.withRegisterOffset(delta),
272 * BasicBlock visitor interface
279 public void visitBlock (BasicBlock b);
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlock.java | 27 public final class BasicBlock implements LabeledItem {
59 public BasicBlock(int label, InsnList insns, IntList successors,
262 public BasicBlock withRegisterOffset(int delta) {
263 return new BasicBlock(label, insns.withRegisterOffset(delta),
272 * BasicBlock visitor interface
279 public void visitBlock (BasicBlock b);
|
| /external/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 51 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) {
64 void BasicBlock::reservePredecessors(unsigned NumPreds) {
73 void BasicBlock::renumberVars() {
84 for (BasicBlock *B : Blocks) {
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| BasicBlock.java | 27 public final class BasicBlock implements LabeledItem {
59 public BasicBlock(int label, InsnList insns, IntList successors,
262 public BasicBlock withRegisterOffset(int delta) {
263 return new BasicBlock(label, insns.withRegisterOffset(delta),
272 * BasicBlock visitor interface
279 public void visitBlock (BasicBlock b);
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCAPElim.cpp | 45 static bool OptimizeBB(BasicBlock *BB);
77 const BasicBlock *BB = I;
78 for (BasicBlock::const_iterator J = BB->begin(), F = BB->end();
94 bool ObjCARCAPElim::OptimizeBB(BasicBlock *BB) {
98 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reg2Mem.cpp | 21 #include "llvm/IR/BasicBlock.h"
50 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();
|
| 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();
122 bool Sinking::ProcessBlock(BasicBlock &BB) {
134 BasicBlock::iterator I = BB.end();
184 BasicBlock *SuccToSinkTo) const {
245 BasicBlock *SuccToSinkTo = nullptr;
253 BasicBlock *Candidate = (*I)->getBlock()
[all...] |
| TailRecursionElimination.cpp | 106 BasicBlock *&OldEntry,
110 bool FoldReturnAndProcessPred(BasicBlock *BB,
111 ReturnInst *Ret, BasicBlock *&OldEntry,
115 bool ProcessReturningBlock(ReturnInst *RI, BasicBlock *&OldEntry,
276 DenseMap<BasicBlock *, VisitType> Visited;
281 SmallVector<BasicBlock *, 32> WorklistUnescaped, WorklistEscaped;
292 BasicBlock *BB = &F.getEntryBlock();
388 BasicBlock *OldEntry = nullptr;
500 if (BasicBlock *UniquePred = RI->getParent()->getUniquePredecessor())
561 static Instruction *FirstNonDbg(BasicBlock::iterator I)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| StdCatchBuilder.java | 19 import com.android.dexgen.rop.code.BasicBlock;
85 BasicBlock block = blocks.get(i);
102 BasicBlock block = blocks.get(i);
129 BasicBlock currentStartBlock = null;
130 BasicBlock currentEndBlock = null;
133 BasicBlock block = blocks.labelToBlock(order[i]);
216 private static CatchHandlerList handlersFor(BasicBlock block,
274 private static CatchTable.Entry makeEntry(BasicBlock start,
275 BasicBlock end, CatchHandlerList handlers,
300 private static boolean rangeIsValid(BasicBlock start, BasicBlock end
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| StdCatchBuilder.java | 19 import com.android.dx.rop.code.BasicBlock;
84 BasicBlock block = blocks.get(i);
101 BasicBlock block = blocks.get(i);
128 BasicBlock currentStartBlock = null;
129 BasicBlock currentEndBlock = null;
132 BasicBlock block = blocks.labelToBlock(order[i]);
215 private static CatchHandlerList handlersFor(BasicBlock block,
273 private static CatchTable.Entry makeEntry(BasicBlock start,
274 BasicBlock end, CatchHandlerList handlers,
299 private static boolean rangeIsValid(BasicBlock start, BasicBlock end
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| StdCatchBuilder.java | 19 import com.android.dx.rop.code.BasicBlock;
85 BasicBlock block = blocks.get(i);
102 BasicBlock block = blocks.get(i);
129 BasicBlock currentStartBlock = null;
130 BasicBlock currentEndBlock = null;
133 BasicBlock block = blocks.labelToBlock(order[i]);
216 private static CatchHandlerList handlersFor(BasicBlock block,
274 private static CatchTable.Entry makeEntry(BasicBlock start,
275 BasicBlock end, CatchHandlerList handlers,
300 private static boolean rangeIsValid(BasicBlock start, BasicBlock end
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 14 // 1. A Function* object, composed of BasicBlock nodes.
46 // BasicBlock that is the header node. This is the opposite of
49 inline BasicBlock *getNodeHeader(BasicBlock *BB) { return BB; }
50 inline BasicBlock *getNodeHeader(Interval *I) { return I->getHeaderNode(); }
52 // getSourceGraphNode - Given a BasicBlock and the source graph, return the
53 // source graph node that corresponds to the BasicBlock. This is the opposite
56 inline BasicBlock *getSourceGraphNode(Function *, BasicBlock *BB) {
59 inline Interval *getSourceGraphNode(IntervalPartition *IP, BasicBlock *BB)
[all...] |
| /external/lldb/include/lldb/Expression/ |
| IRForTarget.h | 24 class BasicBlock;
374 RewriteObjCSelectors (llvm::BasicBlock &basic_block);
406 RewritePersistentAllocs (llvm::BasicBlock &basic_block);
503 ResolveCalls (llvm::BasicBlock &basic_block);
517 RemoveCXAAtExit (llvm::BasicBlock &basic_block);
557 RemoveGuards (llvm::BasicBlock &basic_block);
589 ReplaceStaticLiterals (llvm::BasicBlock &basic_block);
|
| /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...] |
| Instructions.h | 67 const Twine &Name, BasicBlock *InsertAtEnd);
70 AllocaInst(Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd);
75 const Twine &Name, BasicBlock *InsertAtEnd);
158 LoadInst(Value *Ptr, const Twine &NameStr, BasicBlock *InsertAtEnd);
162 BasicBlock *InsertAtEnd);
166 unsigned Align, BasicBlock *InsertAtEnd);
174 BasicBlock *InsertAtEnd);
177 LoadInst(Value *Ptr, const char *NameStr, BasicBlock *InsertAtEnd);
182 BasicBlock *InsertAtEnd);
283 StoreInst(Value *Val, Value *Ptr, BasicBlock *InsertAtEnd)
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 117 static uint32_t getMaxWeightFor(BasicBlock *BB) {
126 bool BranchProbabilityInfo::calcUnreachableHeuristics(BasicBlock *BB) {
176 bool BranchProbabilityInfo::calcMetadataWeights(BasicBlock *BB) {
220 bool BranchProbabilityInfo::calcColdCallHeuristics(BasicBlock *BB) {
242 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
275 bool BranchProbabilityInfo::calcPointerHeuristics(BasicBlock *BB) {
308 bool BranchProbabilityInfo::calcLoopBranchHeuristics(BasicBlock *BB) {
365 bool BranchProbabilityInfo::calcZeroHeuristics(BasicBlock *BB) {
439 bool BranchProbabilityInfo::calcFloatingPointHeuristics(BasicBlock *BB) {
475 bool BranchProbabilityInfo::calcInvokeHeuristics(BasicBlock *BB)
[all...] |
| RegionPrinter.cpp | 44 BasicBlock *BB = Node->getNodeAs<BasicBlock>();
82 BasicBlock *srcBB = srcNode->getNodeAs<BasicBlock>();
83 BasicBlock *destBB = destNode->getNodeAs<BasicBlock>();
|
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 122 DenseMap<BasicBlock*, BasicBlock*> Blocks;
126 unsigned getUnprocPredCount(BasicBlock *Block) const {
133 typedef std::pair<BasicBlock*, BasicBlock*> BlockPair;
156 bool tryUnify(BasicBlock *L, BasicBlock *R) {
157 BasicBlock *&Ref = Blocks[L];
192 void diff(BasicBlock *L, BasicBlock *R)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 80 BasicBlock *Dest;
82 ValueEqualityComparisonCase(ConstantInt *Value, BasicBlock *Dest)
90 bool operator==(BasicBlock *RHSDest) const { return Dest == RHSDest; }
97 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI,
100 BasicBlock *Pred,
116 bool run(BasicBlock *BB);
129 BasicBlock *SI1BB = SI1->getParent();
130 BasicBlock *SI2BB = SI2->getParent();
131 SmallPtrSet<BasicBlock*, 16> SI1Succs(succ_begin(SI1BB), succ_end(SI1BB));
135 for (BasicBlock::iterator BBI = (*I)->begin()
[all...] |
| PromoteMemoryToRegister.cpp | 106 SmallVector<BasicBlock *, 32> DefiningBlocks;
107 SmallVector<BasicBlock *, 32> UsingBlocks;
110 BasicBlock *OnlyBlock;
168 RenamePassData(BasicBlock *B, BasicBlock *P, const ValVector &V)
170 BasicBlock *BB;
171 BasicBlock *Pred;
215 const BasicBlock *BB = I->getParent();
217 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); BBI != E;
248 /// since we already maintain a map from BasicBlock* to a stable numberin
[all...] |
| Local.cpp | 61 bool llvm::ConstantFoldTerminator(BasicBlock *BB, bool DeleteDeadConditions,
69 BasicBlock *Dest1 = BI->getSuccessor(0);
70 BasicBlock *Dest2 = BI->getSuccessor(1);
75 BasicBlock *Destination = Cond->getZExtValue() ? Dest1 : Dest2;
76 BasicBlock *OldDest = Cond->getZExtValue() ? Dest2 : Dest1;
116 BasicBlock *TheOnlyDest = SI->getDefaultDest();
117 BasicBlock *DefaultDest = TheOnlyDest;
178 BasicBlock *BB = SI->getParent();
183 BasicBlock *Succ = SI->getSuccessor(i);
232 BasicBlock *TheOnlyDest = BA->getBasicBlock()
[all...] |
| /external/llvm/unittests/ExecutionEngine/JIT/ |
| JITTest.cpp | 15 #include "llvm/IR/BasicBlock.h"
62 BasicBlock *Entry = BasicBlock::Create(M->getContext(), "entry", F);
299 BasicBlock *Entry = BasicBlock::Create(Context, "entry", TestFunction);
329 BasicBlock *Block1 = BasicBlock::Create(Context, "block1", Func1);
330 BasicBlock *Block2 = BasicBlock::Create(Context, "block2", Func2);
331 BasicBlock *True2 = BasicBlock::Create(Context, "cond_true", Func2)
[all...] |
| /external/chromium_org/v8/src/compiler/ |
| scheduler.cc | 72 void FixNode(BasicBlock* block, Node* node) {
124 BasicBlock* block = schedule_->NewBasicBlock();
161 void CollectSuccessorBlocks(Node* node, BasicBlock** buffer,
172 BasicBlock* branch_block = schedule_->block(branch_block_node);
175 BasicBlock* successor_blocks[2];
187 BasicBlock* block = schedule_->block(merge);
193 BasicBlock* predecessor_block = schedule_->block(*j);
203 BasicBlock* return_block = schedule_->block(return_block_node);
208 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ)
[all...] |
| /external/llvm/unittests/Linker/ |
| LinkModulesTest.cpp | 11 #include "llvm/IR/BasicBlock.h"
31 EntryBB = BasicBlock::Create(Ctx, "entry", F);
32 SwitchCase1BB = BasicBlock::Create(Ctx, "switch.case.1", F);
33 SwitchCase2BB = BasicBlock::Create(Ctx, "switch.case.2", F);
34 ExitBB = BasicBlock::Create(Ctx, "exit", F);
63 BasicBlock *EntryBB;
64 BasicBlock *SwitchCase1BB;
65 BasicBlock *SwitchCase2BB;
66 BasicBlock *ExitBB;
133 BasicBlock *BB = BasicBlock::Create(Ctx, "", F)
[all...] |
