| /external/dexmaker/src/main/java/com/google/dexmaker/ |
| Label.java | 19 import com.android.dx.rop.code.BasicBlock;
69 BasicBlock toBasicBlock() {
90 return new BasicBlock(id, result, successors, primarySuccessorIndex);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| Cloning.h | 34 class BasicBlock;
96 BasicBlock *CloneBasicBlock(const BasicBlock *BB,
|
| /external/chromium_org/v8/src/compiler/ |
| instruction-selector.h | 96 bool IsNextInAssemblyOrder(const BasicBlock* block) const;
153 void VisitBlock(BasicBlock* block);
157 void VisitControl(BasicBlock* block);
180 void VisitCall(Node* call, BasicBlock* continuation,
181 BasicBlock* deoptimization);
182 void VisitGoto(BasicBlock* target);
183 void VisitBranch(Node* input, BasicBlock* tbranch, BasicBlock* fbranch);
203 BasicBlock* current_block_;
|
| verifier.cc | 257 BasicBlock* container, BasicBlock* use_block,
259 BasicBlock* block = use_block;
274 static void CheckInputsDominate(Schedule* schedule, BasicBlock* block,
278 BasicBlock* use_block = block;
299 BasicBlock* start = schedule->start();
312 BasicBlock* block = rpo_order->at(b);
314 BasicBlock* dom = block->dominator_;
328 ZoneQueue<BasicBlock*> queue(zone);
332 BasicBlock* block = queue.front()
[all...] |
| /external/lldb/include/lldb/Expression/ |
| IRToDWARF.h | 103 bool runOnBasicBlock(llvm::BasicBlock &BB, Relocator &Relocator);
|
| /external/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 34 static std::string getSimpleNodeLabel(const BasicBlock *Node,
46 static std::string getCompleteNodeLabel(const BasicBlock *Node,
91 std::string getNodeLabel(const BasicBlock *Node,
99 static std::string getEdgeSourceLabel(const BasicBlock *Node,
|
| IntervalPartition.h | 41 typedef std::map<BasicBlock*, Interval*> IntervalMapTy;
78 inline Interval *getBlockInterval(BasicBlock *BB) {
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXAllocaHoisting.cpp | 27 for (BasicBlock::iterator BI = I->begin(), BE = I->end(); BI != BE;) {
|
| NVPTXLowerAggrCopies.cpp | 39 BasicBlock *origBB = splitAt->getParent();
40 BasicBlock *newBB = splitAt->getParent()->splitBasicBlock(splitAt, "split");
41 BasicBlock *loopBB = BasicBlock::Create(Context, "loadstoreloop", &F, newBB);
77 BasicBlock *origBB = splitAt->getParent();
78 BasicBlock *newBB = splitAt->getParent()->splitBasicBlock(splitAt, "split");
79 BasicBlock *loopBB = BasicBlock::Create(Context, "loadstoreloop", &F, newBB);
113 //const BasicBlock *firstBB = &F.front(); // first BB in F
115 //BasicBlock *bb = BI
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BypassSlowDivision.cpp | 79 BasicBlock::iterator &J,
97 BasicBlock *MainBB = I;
98 BasicBlock *SuccessorBB = I->splitBasicBlock(J);
102 BasicBlock *SlowBB = BasicBlock::Create(F.getContext(), "",
118 BasicBlock *FastBB = BasicBlock::Create(F.getContext(), "",
187 BasicBlock::iterator &J,
229 for (BasicBlock::iterator J = I->begin(); J != I->end(); J++) {
|
| InlineFunction.cpp | 47 BasicBlock *OuterResumeDest; ///< Destination of the invoke's unwind.
48 BasicBlock *InnerResumeDest; ///< Destination for the callee's resume.
60 llvm::BasicBlock *InvokeBB = II->getParent();
61 BasicBlock::iterator I = OuterResumeDest->begin();
73 BasicBlock *getOuterResumeDest() const {
77 BasicBlock *getInnerResumeDest();
92 void addIncomingPHIValuesFor(BasicBlock *BB) const {
96 void addIncomingPHIValuesForInto(BasicBlock *src, BasicBlock *dest) const {
97 BasicBlock::iterator I = dest->begin()
[all...] |
| Mem2Reg.cpp | 61 BasicBlock &BB = F.getEntryBlock(); // Get the entry node for the function
72 for (BasicBlock::iterator I = BB.begin(), E = --BB.end(); I != E; ++I)
|
| /external/llvm/unittests/Transforms/Utils/ |
| IntegerDivision.cpp | 11 #include "llvm/IR/BasicBlock.h"
34 BasicBlock *BB = BasicBlock::Create(C, "", F);
64 BasicBlock *BB = BasicBlock::Create(C, "", F);
94 BasicBlock *BB = BasicBlock::Create(C, "", F);
124 BasicBlock *BB = BasicBlock::Create(C, "", F);
155 BasicBlock *BB = BasicBlock::Create(C, "", F)
[all...] |
| /external/llvm/lib/Analysis/ |
| LoopInfo.cpp | 34 template class llvm::LoopBase<BasicBlock, Loop>;
35 template class llvm::LoopInfoBase<BasicBlock, Loop>;
116 BasicBlock *Preheader = getLoopPreheader();
142 BasicBlock *H = getHeader();
144 BasicBlock *Incoming = nullptr, *Backedge = nullptr;
161 for (BasicBlock::iterator I = H->begin(); isa<PHINode>(I); ++I) {
180 BasicBlock *BB = *BI;
181 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E;++I)
184 BasicBlock *UserBB = UI->getParent();
224 for (BasicBlock::iterator BI = (*I)->begin(), BE = (*I)->end(); BI != BE; ++BI)
[all...] |
| CodeMetrics.cpp | 25 void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB,
29 for (BasicBlock::const_iterator II = BB->begin(), E = BB->end();
|
| /external/llvm/unittests/IR/ |
| LegacyPassManagerTest.cpp | 22 #include "llvm/IR/BasicBlock.h"
254 virtual bool runOnBasicBlock(BasicBlock &BB) {
479 BasicBlock* label_entry = BasicBlock::Create(getGlobalContext(), "entry",func_test1,nullptr);
494 BasicBlock* label_entry_5 = BasicBlock::Create(getGlobalContext(), "entry",func_test2,nullptr);
509 BasicBlock* label_entry_8 = BasicBlock::Create(getGlobalContext(), "entry",func_test3,nullptr);
527 BasicBlock* label_entry_11 = BasicBlock::Create(getGlobalContext(), "entry",func_test4,nullptr)
[all...] |
| /art/compiler/dex/ |
| mir_graph.cc | 155 BasicBlock* MIRGraph::SplitBlock(DexOffset code_offset,
156 BasicBlock* orig_block, BasicBlock** immed_pred_block_p) {
168 BasicBlock* bottom_block = NewMemBB(kDalvikByteCode, num_blocks_++);
183 BasicBlock* bb_taken = GetBasicBlock(bottom_block->taken);
193 BasicBlock* bb_fall_through = GetBasicBlock(bottom_block->fall_through);
208 BasicBlock* bb = GetBasicBlock(successor_block_info->block);
247 * the first in a BasicBlock, we can't hit it here.
266 BasicBlock* MIRGraph::FindBlock(DexOffset code_offset, bool split, bool create,
267 BasicBlock** immed_pred_block_p)
[all...] |
| pass_me.h | 26 struct BasicBlock;
35 kOptimizationBasicBlockChange = 1, /**< @brief Has there been a change to a BasicBlock? */
44 BasicBlock* bb;
59 kNoNodes, /**< @brief Skip BasicBlock traversal. */
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| Ropper.java | 21 import com.android.dx.rop.code.BasicBlock;
112 private final ArrayList<BasicBlock> result;
301 BasicBlock subCaller = labelToBlock(label);
321 BasicBlock subCaller = labelToBlock(label);
391 this.result = new ArrayList<BasicBlock>(blocks.size() * 2 + 10);
481 for (BasicBlock bb : result) {
551 BasicBlock one = result.get(i);
567 private BasicBlock labelToBlock(int label) {
585 private void addBlock(BasicBlock block, IntList subroutines) {
606 private boolean addOrReplaceBlock(BasicBlock block, IntList subroutines)
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| test-schedule.cc | 39 BasicBlock* entry = schedule.start();
56 BasicBlock* entry = schedule.start();
57 BasicBlock* next = schedule.NewBasicBlock();
75 BasicBlock* entry = schedule.start();
76 BasicBlock* tblock = schedule.NewBasicBlock();
77 BasicBlock* fblock = schedule.NewBasicBlock();
106 BasicBlock* entry = schedule.start();
120 BasicBlock* entry = schedule.start();
|
| /external/clang/lib/CodeGen/ |
| CGCUDARuntime.cpp | 30 llvm::BasicBlock *ConfigOKBlock = CGF.createBasicBlock("kcall.configok");
31 llvm::BasicBlock *ContBlock = CGF.createBasicBlock("kcall.end");
|
| /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/lib/Transforms/IPO/ |
| PruneEH.cpp | 48 void DeleteBasicBlock(BasicBlock *BB);
115 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
192 BasicBlock *UnwindBlock = II->getUnwindDest();
210 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
217 BasicBlock *New = BB->splitBasicBlock(I);
236 void PruneEH::DeleteBasicBlock(BasicBlock *BB) {
241 for (BasicBlock::iterator I = BB->end(), E = BB->begin(); I != E; ) {
253 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
|
| /external/llvm/lib/CodeGen/ |
| CodeGenPrepare.cpp | 98 BasicBlock::iterator CurInstIterator;
136 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const;
137 void EliminateMostlyEmptyBlock(BasicBlock *BB);
138 bool OptimizeBlock(BasicBlock &BB);
147 bool DupRetToEnableTailCallOpts(BasicBlock *BB);
208 BasicBlock *BB = I++;
218 SmallPtrSet<BasicBlock*, 8> WorkList;
220 SmallVector<BasicBlock*, 2> Successors(succ_begin(BB), succ_end(BB));
224 for (SmallVectorImpl<BasicBlock*>::iterato
[all...] |
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen.cc | 12 #include "sandbox/linux/seccomp-bpf/basicblock.h"
277 BasicBlock* CodeGen::MakeBasicBlock(Instruction* head, Instruction* tail) {
280 BasicBlock* bb = new BasicBlock;
298 BasicBlock** firstBlock) {
308 BasicBlock* bb = MakeBasicBlock(head, tail);
316 BasicBlock* CodeGen::CutGraphIntoBasicBlocks(
324 BasicBlock* first_block = NULL;
390 static int PointerCompare(const BasicBlock* block1,
391 const BasicBlock* block2
[all...] |
