/external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
D | RopMethod.java | 37 private IntList[] predecessors; field in RopMethod 63 this.predecessors = null; in RopMethod() 98 IntList result = predecessors[label]; in labelToPredecessors() 141 result.predecessors = predecessors; in withRegisterOffset() 153 IntList[] predecessors = new IntList[maxLabel]; in calcPredecessors() local 172 IntList succPreds = predecessors[succLabel]; in calcPredecessors() 175 predecessors[succLabel] = succPreds; in calcPredecessors() 184 IntList preds = predecessors[i]; in calcPredecessors() 200 if (predecessors[firstLabel] == null) { in calcPredecessors() 201 predecessors[firstLabel] = IntList.EMPTY; in calcPredecessors() [all …]
|
/external/llvm/test/Transforms/LCSSA/ |
D | 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 …]
|
D | 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/dexmaker/src/dx/java/com/android/dx/ssa/ |
D | SsaBasicBlock.java | 55 private BitSet predecessors; field in SsaBasicBlock 128 this.predecessors = new BitSet(parent.getBlocks().size()); in SsaBasicBlock() 158 result.predecessors = SsaMethod.bitSetFromLabelList( in newFromRop() 344 return predecessors; in getPredecessors() 420 newPred.predecessors = predecessors; in insertNewPredecessor() 427 predecessors = new BitSet(parent.getBlocks().size()); in insertNewPredecessor() 428 predecessors.set(newPred.index); in insertNewPredecessor() 431 for (int i = newPred.predecessors.nextSetBit(0); i >= 0; in insertNewPredecessor() 432 i = newPred.predecessors.nextSetBit(i + 1)) { in insertNewPredecessor() 462 newSucc.predecessors.set(this.index); in insertNewSuccessor() [all …]
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
D | AnalyzedInstruction.java | 56 protected final TreeSet<AnalyzedInstruction> predecessors = new TreeSet<AnalyzedInstruction>(); field in AnalyzedInstruction 97 return predecessors.size(); in getPredecessorCount() 101 return Collections.unmodifiableSortedSet(predecessors); in getPredecessors() 105 return predecessors.add(predecessor); in addPredecessor() 153 if (predecessors.size() == 0) { in isBeginningInstruction() 157 if (predecessors.first().instructionIndex == -1) { in isBeginningInstruction() 202 for (AnalyzedInstruction predecessor: predecessors) {
|
/external/llvm/test/Transforms/Inline/ |
D | 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 …]
|
/external/v8/src/compiler/ |
D | schedule.cc | 40 BasicBlock::Predecessors predecessors = block->predecessors(); in operator <<() local 42 for (BasicBlock::Predecessors::iterator j = predecessors.begin(); in operator <<() 43 j != predecessors.end(); ++j) { in operator <<()
|
D | schedule.h | 104 Predecessors predecessors() { return static_cast<Predecessors>(inputs()); } in predecessors() function 113 BasicBlock::Predecessors predecessors = this->predecessors(); in PredecessorIndexOf() local 114 for (BasicBlock::Predecessors::iterator i = predecessors.begin(); in PredecessorIndexOf() 115 i != predecessors.end(); ++i) { in PredecessorIndexOf()
|
D | instruction.cc | 438 BasicBlock::Predecessors predecessors = block->predecessors(); in operator <<() local 439 for (BasicBlock::Predecessors::iterator iter = predecessors.begin(); in operator <<() 440 iter != predecessors.end(); ++iter) { in operator <<()
|
/external/bison/src/ |
D | AnnotationList.c | 196 state ***predecessors, in AnnotationList__compute_lhs_contributions() argument 211 predecessors, item_lookahead_sets)) in AnnotationList__compute_lhs_contributions() 221 state ***predecessors, in AnnotationList__computePredecessorAnnotations() argument 231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor) in AnnotationList__computePredecessorAnnotations() 287 follow_kernel_items, always_follows, predecessors, in AnnotationList__computePredecessorAnnotations() 320 predecessors, in AnnotationList__computePredecessorAnnotations() 396 follow_kernel_items, always_follows, predecessors, in AnnotationList__computePredecessorAnnotations() 412 state ***predecessors, bitset **item_lookahead_sets, in AnnotationList__compute_from_inadequacies() argument 496 always_follows, predecessors, item_lookahead_sets, in AnnotationList__compute_from_inadequacies() 558 follow_kernel_items, always_follows, predecessors, in AnnotationList__compute_from_inadequacies()
|
D | ielr.c | 379 symbol_number lookahead, state ***predecessors, in ielr_item_has_lookahead() argument 428 for (predecessor = predecessors[s->number]; in ielr_item_has_lookahead() 441 for (predecessor = predecessors[s->number]; in ielr_item_has_lookahead() 455 predecessors, item_lookahead_sets); in ielr_item_has_lookahead() 484 bitsetv always_follows, state ***predecessors, in ielr_compute_annotation_lists() argument 511 states[i], follow_kernel_items, always_follows, predecessors, in ielr_compute_annotation_lists() 1133 state ***predecessors; in ielr() local 1137 lr_type == LR_TYPE__CANONICAL_LR ? NULL : &predecessors); in ielr() 1146 predecessors, &max_annotations, in ielr() 1152 free (predecessors[i]); in ielr() [all …]
|
D | ielr.h | 43 symbol_number lookahead, state ***predecessors,
|
/external/llvm/test/Transforms/CodeExtractor/ |
D | 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/Transforms/Mem2Reg/ |
D | 2005-11-28-Crash.ll | 43 then.4: ; No predecessors! 46 dead_block_after_goto: ; No predecessors! 58 after_ret: ; No predecessors!
|
D | 2003-04-10-DFNotFound.ll | 6 ; No predecessors!
|
/external/llvm/test/ExecutionEngine/MCJIT/ |
D | test-phi.ll | 12 Dead: ; No predecessors! 30 Dead: ; No predecessors!
|
D | 2003-05-11-PHIRegAllocBug.ll | 6 then: ; No predecessors!
|
/external/llvm/test/Transforms/LoopSimplify/ |
D | 2007-10-28-InvokeCrash.ll | 13 invcont17.normaldest917: ; No predecessors! 20 invcont17.normaldest.normaldest: ; No predecessors!
|
/external/llvm/test/ExecutionEngine/OrcMCJIT/ |
D | test-phi.ll | 12 Dead: ; No predecessors! 30 Dead: ; No predecessors!
|
/external/llvm/test/CodeGen/X86/ |
D | 2010-01-11-ExtraPHIArg.ll | 83 bb2060.i: ; No predecessors! 92 cond_next3473: ; No predecessors! 95 cond_next3521: ; No predecessors!
|
D | 2012-10-18-crash-dagco.ll | 48 bb47: ; No predecessors! 51 bb48: ; No predecessors!
|
D | 2003-08-23-DeadBlockTest.ll | 6 Test: ; No predecessors!
|
/external/llvm/test/CodeGen/Generic/ |
D | 2006-09-06-SwitchLowering.ll | 82 bb2060.i: ; No predecessors! 91 cond_next3473: ; No predecessors! 94 cond_next3521: ; No predecessors!
|
/external/llvm/test/Transforms/SimplifyCFG/ |
D | EqualPHIEdgeBlockMerge.ll | 48 ; R's incoming value is undef and both of those predecessors are simple 78 ; V's incoming value is undef and both of those predecessors are simple 79 ; unconditional branches. Note that X has predecessors beyond 80 ; the direct predecessors of U. 106 ; After merging X into Y, we should have 5 predecessors
|
/external/llvm/test/Transforms/ADCE/ |
D | 2004-05-04-UnreachableBlock.ll | 10 invoke_catch.0: ; No predecessors!
|