| /external/llvm/include/llvm/MC/ |
| MCFunction.h | 41 /// \name Predecessors/Successors, to represent the CFG.
45 BasicBlockListTy Predecessors;
58 /// MC CFG access: Predecessors/Successors.
65 pred_const_iterator pred_begin() const { return Predecessors.begin(); }
66 pred_const_iterator pred_end() const { return Predecessors.end(); }
|
| /external/llvm/test/Transforms/Mem2Reg/ |
| 2005-11-28-Crash.ll | 43 then.4: ; No predecessors!
46 dead_block_after_goto: ; No predecessors!
58 after_ret: ; No predecessors!
|
| /external/llvm/test/CodeGen/X86/ |
| 2012-10-18-crash-dagco.ll | 48 bb47: ; No predecessors!
51 bb48: ; No predecessors!
|
| 2010-05-12-FastAllocKills.ll | 7 ; Predecessors according to CFG: BB#4 BB#5
17 ; Predecessors according to CFG: BB#4 BB#5
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaBasicBlock.java | 54 private BitSet predecessors; field in class:SsaBasicBlock
127 this.predecessors = new BitSet(parent.getBlocks().size());
157 result.predecessors = SsaMethod.bitSetFromLabelList(
340 * @return {@code non-null;} predecessors set, indexed by block index
343 return predecessors;
411 * All previous predecessors will be predecessors to the new block.
419 newPred.predecessors = predecessors;
426 predecessors = new BitSet(parent.getBlocks().size())
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaBasicBlock.java | 55 private BitSet predecessors; field in class:SsaBasicBlock
128 this.predecessors = new BitSet(parent.getBlocks().size());
158 result.predecessors = SsaMethod.bitSetFromLabelList(
341 * @return {@code non-null;} predecessors set, indexed by block index
344 return predecessors;
412 * All previous predecessors will be predecessors to the new block.
420 newPred.predecessors = predecessors;
427 predecessors = new BitSet(parent.getBlocks().size())
[all...] |
| /external/chromium/chrome/browser/sync/engine/ |
| syncer_util.h | 104 // Append |item|, followed by a chain of its predecessors selected by
107 // IS_UNAPPLIED_UPDATE or IS_UNSYNCED) selects which type of predecessors to
121 // reverse (and generally more useful) order: a chain of predecessors from
134 // Examine the up-to-date predecessors of this item according to the server
|
| /external/chromium_org/v8/src/ |
| hydrogen-deoptimizing-mark.cc | 64 const ZoneList<HBasicBlock*>* predecessors = block->predecessors(); local
65 int predecessors_length = predecessors->length();
68 if (!predecessors->at(j)->IsDeoptimizing()) {
|
| /external/llvm/lib/Analysis/ |
| Interval.cpp | 30 // There is a loop in this interval iff one of the predecessors of the header
49 OS << "Interval Predecessors:\n";
50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(),
51 E = Predecessors.end(); I != E; ++I)
|
| IntervalPartition.cpp | 62 getBlockInterval(*I)->Predecessors.push_back(Header);
82 // predecessors for each block.
110 // predecessors for each block.
|
| /external/llvm/test/Analysis/BasicAA/ |
| 2003-05-21-GEP-Problem.ll | 5 define void @table_reindex(%struct..apr_table_t* %t.1) { ; No predecessors!
|
| /external/llvm/test/CodeGen/Mips/ |
| ex2.ll | 25 return: ; No predecessors!
|
| /external/llvm/test/Transforms/JumpThreading/ |
| 2011-04-02-SimplifyDeadBlock.ll | 29 if.end43: ; No predecessors!
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 69 /// Predecessors/Successors - Keep track of the predecessor / successor
71 std::vector<MachineBasicBlock *> Predecessors;
260 pred_iterator pred_begin() { return Predecessors.begin(); }
261 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
262 pred_iterator pred_end() { return Predecessors.end(); }
263 const_pred_iterator pred_end() const { return Predecessors.end(); }
265 { return Predecessors.rbegin();}
267 { return Predecessors.rbegin();}
269 { return Predecessors.rend(); }
271 { return Predecessors.rend();
[all...] |
| /art/compiler/sea_ir/code_gen/ |
| code_gen.cc | 31 const std::vector<Region*>* predecessors = r->GetPredecessors(); local
32 DCHECK(NULL != predecessors);
33 DCHECK_GT(predecessors->size(), 0u);
35 llvm::Type::getInt32Ty(*llvm_data_->context_), predecessors->size(), phi->StringId());
259 const std::vector<Region*>* predecessors = r->GetPredecessors(); local
260 DCHECK(NULL != predecessors);
261 DCHECK_GT(predecessors->size(), 0u);
265 for (std::vector<Region*>::const_iterator cit = predecessors->begin();
266 cit != predecessors->end(); ++cit) {
|
| /external/llvm/test/Transforms/LCSSA/ |
| 2006-10-31-UnreachableBlock.ll | 23 dead_block_after_goto: ; No predecessors!
67 endif.3.i: ; No predecessors!
111 endif.6.i: ; No predecessors!
127 endif.8.i: ; No predecessors!
160 dead_block_after_break: ; No predecessors!
164 loopexit: ; No predecessors!
166 after_ret.0: ; No predecessors!
180 after_ret.1: ; No predecessors!
182 return: ; No predecessors!
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 34 /// predecessors.
146 /// basic block into the function, and moving some of the predecessors of BB to
147 /// be predecessors of the new block. The new predecessors are indicated by the
162 /// new basic blocks gets the predecessors listed in Preds. The other basic
163 /// block gets the remaining predecessors of OrigBB. The landingpad instruction
|
| /external/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 40 // Maps reachability to a common node by walking the predecessors of the
70 // Add the predecessors to the worklist.
|
| /art/compiler/sea_ir/ir/ |
| sea_node.h | 46 // Adds CFG predecessors and successors to each block.
|
| /external/bison/src/ |
| ielr.h | 43 symbol_number lookahead, state ***predecessors,
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 35 /// predecessors.
43 // of their predecessors is going away.
120 // Can't merge if there are multiple predecessors, or no predecessors.
164 // Inherit predecessors name if it exists.
348 // loop). To find this, examine each of the predecessors and determine which
429 /// basic block into the function, and moving some of the predecessors of BB to
430 /// be predecessors of the new block. The new predecessors are indicated by the
481 /// new basic blocks gets the predecessors listed in Preds. The other basi
[all...] |
| /external/llvm/test/Transforms/ADCE/ |
| 2002-05-23-ZeroArgPHITest.ll | 3 ; into was that when the reg109 PHI was getting zero predecessors, it was
|
| /external/llvm/test/Transforms/Inline/ |
| inline_prune.ll | 22 ; No predecessors!
|
| /external/chromium_org/sync/engine/ |
| get_commit_ids_command.h | 89 // OrderedCommitSet helpers for adding predecessors in order.
98 // Adds |item| and all its unsynced predecessors to |result| as necessary.
106 // Appends all commit ready predecessors of |item|, followed by |item| itself,
|
| /external/llvm/test/CodeGen/Generic/ |
| 2006-09-06-SwitchLowering.ll | 82 bb2060.i: ; No predecessors!
91 cond_next3473: ; No predecessors!
94 cond_next3521: ; No predecessors!
|
