HomeSort by relevance Sort by last modified time
    Searched full:predecessors (Results 1 - 25 of 294) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/test/Transforms/Mem2Reg/
2003-04-10-DFNotFound.ll 6 ; No predecessors!
2003-04-18-DeadBlockProblem.ll 11 Unreachable: ; No predecessors!
  /dalvik/dexgen/src/com/android/dexgen/rop/code/
RopMethod.java 34 * {@code null-ok;} array of predecessors for each block, indexed by block
37 private IntList[] predecessors; field in class:RopMethod
40 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
63 this.predecessors = null;
87 * Gets the predecessors associated with the given block. This throws
91 * @return {@code non-null;} the predecessors of that block
98 IntList result = predecessors[label];
108 * Gets the exit predecessors for this instance.
110 * @return {@code non-null;} the exit predecessors
135 * The predecessors have been calculated. It's safe t
153 IntList[] predecessors = new IntList[maxLabel]; local
    [all...]
  /dalvik/dx/src/com/android/dx/rop/code/
RopMethod.java 33 * {@code null-ok;} array of predecessors for each block, indexed by block
36 private IntList[] predecessors; field in class:RopMethod
39 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
62 this.predecessors = null;
86 * Gets the predecessors associated with the given block. This throws
90 * @return {@code non-null;} the predecessors of that block
97 IntList result = predecessors[label];
107 * Gets the exit predecessors for this instance.
109 * @return {@code non-null;} the exit predecessors
134 * The predecessors have been calculated. It's safe t
152 IntList[] predecessors = new IntList[maxLabel]; local
    [all...]
  /external/dexmaker/src/dx/java/com/android/dx/rop/code/
RopMethod.java 34 * {@code null-ok;} array of predecessors for each block, indexed by block
37 private IntList[] predecessors; field in class:RopMethod
40 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
63 this.predecessors = null;
87 * Gets the predecessors associated with the given block. This throws
91 * @return {@code non-null;} the predecessors of that block
98 IntList result = predecessors[label];
108 * Gets the exit predecessors for this instance.
110 * @return {@code non-null;} the exit predecessors
135 * The predecessors have been calculated. It's safe t
153 IntList[] predecessors = new IntList[maxLabel]; local
    [all...]
  /external/llvm/test/CodeGen/X86/
2003-08-23-DeadBlockTest.ll 6 Test: ; No predecessors!
tail-threshold.ll 4 ; tail-merge-threshold predecessors.
  /external/llvm/test/Transforms/ADCE/
2004-05-04-UnreachableBlock.ll 10 invoke_catch.0: ; No predecessors!
basictest.ll 7 BB2: ; No predecessors!
  /external/clang/test/CodeGen/
2002-03-14-BrokenPHINode.c 5 * in a PHI node must equal the number of predecessors for a basic block.
  /external/llvm/lib/MC/
MCFunction.cpp 49 Predecessors.push_back(MCBB);
53 return std::find(Predecessors.begin(), Predecessors.end(),
54 MCBB) != Predecessors.end();
  /external/llvm/test/ExecutionEngine/
2003-05-11-PHIRegAllocBug.ll 8 then: ; No predecessors!
test-phi.ll 12 Dead: ; No predecessors!
30 Dead: ; No predecessors!
  /external/llvm/test/ExecutionEngine/MCJIT/
2003-05-11-PHIRegAllocBug.ll 8 then: ; No predecessors!
test-phi.ll 12 Dead: ; No predecessors!
30 Dead: ; No predecessors!
  /external/llvm/test/Transforms/LCSSA/
2006-10-31-UnreachableBlock-2.ll 21 after_ret.0: ; No predecessors!
31 dead_block_after_break.0: ; No predecessors!
45 dead_block_after_break.1: ; No predecessors!
64 dead_block_after_break.2: ; No predecessors!
68 dead_block_after_goto.0: ; No predecessors!
74 dead_block_after_break.3: ; No predecessors!
84 dead_block_after_break.4: ; No predecessors!
88 dead_block_after_break.5: ; No predecessors!
92 dead_block_after_break.6: ; No predecessors!
98 dead_block_after_break.7: ; No predecessors!
    [all...]
  /external/llvm/test/Assembler/
2002-08-15-ConstantExprProblem.ll 13 BB2: ; No predecessors!
  /external/llvm/test/Transforms/ObjCARC/
pr12270.ll 9 return: ; No predecessors!
  /external/llvm/test/Transforms/LoopSimplify/
2007-10-28-InvokeCrash.ll 13 invcont17.normaldest917: ; No predecessors!
20 invcont17.normaldest.normaldest: ; No predecessors!
  /external/llvm/test/Transforms/CodeExtractor/
2004-03-13-LoopExtractorCrash.ll 34 after_ret.0: ; No predecessors!
52 after_ret.1: ; No predecessors!
70 after_ret.2: ; No predecessors!
  /external/llvm/test/Analysis/RegionInfo/
unreachable_bb.ll 8 notintree: ; No predecessors!
  /external/llvm/test/Transforms/Inline/
2006-07-12-InlinePruneCGUpdate.ll 24 cond_next: ; No predecessors!
42 cond_next31: ; No predecessors!
60 cond_next48: ; No predecessors!
78 cond_next65: ; No predecessors!
96 cond_next83: ; No predecessors!
114 cond_next101: ; No predecessors!
132 cond_next119: ; No predecessors!
150 cond_next137: ; No predecessors!
169 cond_next155: ; No predecessors!
187 cond_next173: ; No predecessors!
    [all...]
  /dalvik/vm/analysis/
VfyBasicBlock.h 33 * so we need to mantain a list of predecessors for each block.
45 PointerSet* predecessors; /* set of basic blocks that can flow here */ member in struct:VfyBasicBlock
  /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/
AnalyzedInstruction.java 53 protected final TreeSet<AnalyzedInstruction> predecessors = new TreeSet<AnalyzedInstruction>(); field in class:AnalyzedInstruction
101 return predecessors.size();
105 return Collections.unmodifiableSortedSet(predecessors);
109 return predecessors.add(predecessor);
159 //if this instruction has no predecessors, it is either the fake "StartOfMethod" instruction or it is an
161 if (predecessors.size() == 0) {
165 if (predecessors.first().instructionIndex == -1) {
203 * Iterates over the predecessors of this instruction, and merges all the post-instruction register types for the
206 * @return The register type resulting from merging the post-instruction register types from all predecessors
210 for (AnalyzedInstruction predecessor: predecessors) {
    [all...]
  /external/llvm/include/llvm/Analysis/
Interval.h 34 /// in the interval has all of its predecessors in the interval (except for the
66 /// Predecessors - List of BasicBlocks that have this Interval's header block
69 std::vector<BasicBlock*> Predecessors;
118 return I->Predecessors.begin();
121 return I->Predecessors.end();

Completed in 582 milliseconds

1 2 3 4 5 6 7 8 91011>>