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

1 2 3

  /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...]
  /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
VfyBasicBlock.cpp 86 newBlock->predecessors = dvmPointerSetAlloc(32);
87 if (newBlock->predecessors == NULL) {
96 dvmPointerSetFree(newBlock->predecessors);
127 PointerSet* preds = targetBlock->predecessors;
230 if (dvmPointerSetGetCount(curBlock->predecessors) > 256) {
259 PointerSet* preds = block->predecessors;
546 dvmPointerSetFree(block->predecessors);
  /external/bison/src/
ielr.h 43 symbol_number lookahead, state ***predecessors,
AnnotationList.h 81 * - \c follow_kernel_items, \c always_follows, and \c predecessors were
111 state ***predecessors, bitset **item_lookahead_sets,
AnnotationList.c 196 state ***predecessors,
211 predecessors, item_lookahead_sets))
221 state ***predecessors,
231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor)
287 follow_kernel_items, always_follows, predecessors,
320 predecessors,
396 follow_kernel_items, always_follows, predecessors,
412 state ***predecessors, bitset **item_lookahead_sets,
496 always_follows, predecessors, item_lookahead_sets,
558 follow_kernel_items, always_follows, predecessors,
    [all...]
ielr.c 379 symbol_number lookahead, state ***predecessors,
423 check all predecessors' goto follows for the LHS. */
428 for (predecessor = predecessors[s->number];
441 for (predecessor = predecessors[s->number];
455 predecessors, item_lookahead_sets);
469 * - \c follow_kernel_items, \c always_follows, and \c predecessors
484 bitsetv always_follows, state ***predecessors,
511 states[i], follow_kernel_items, always_follows, predecessors,
1133 state ***predecessors; local
    [all...]
  /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()) {
hydrogen-environment-liveness.cc 210 // store computed information for this block and add predecessors
216 for (int i = 0; i < block->predecessors()->length(); ++i) {
217 worklist.Add(block->predecessors()->at(i)->block_id());
hydrogen-range-analysis.cc 65 if (block->predecessors()->length() == 1) {
66 HBasicBlock* pred = block->predecessors()->first();
hydrogen-escape-analysis.cc 118 for (int i = 0; i < block->predecessors()->length(); i++) {
236 if (succ->predecessors()->length() == 1) {
hydrogen-representation-changes.cc 39 next = use_value->block()->predecessors()->at(use_index)->end();
  /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...]
  /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...]
  /dalvik/vm/compiler/
Frontend.cpp 538 dvmCompilerClearBit(bottomBlock->taken->predecessors, origBlock->id);
539 dvmCompilerSetBit(bottomBlock->taken->predecessors, bottomBlock->id);
547 dvmCompilerSetBit(bottomBlock->predecessors, origBlock->id);
549 dvmCompilerClearBit(bottomBlock->fallThrough->predecessors,
551 dvmCompilerSetBit(bottomBlock->fallThrough->predecessors,
568 dvmCompilerClearBit(bb->predecessors, origBlock->id);
569 dvmCompilerSetBit(bb->predecessors, bottomBlock->id);
796 /* Verify if all the successor is connected with all the claimed predecessors */
801 dvmBitVectorIteratorInit(bb->predecessors, &bvIterator);
942 dvmCompilerSetBit(takenBlock->predecessors, curBlock->id)
    [all...]
Loop.cpp 98 int numPred = dvmCountSetBits(bb->predecessors);
100 dvmBitVectorIteratorInit(bb->predecessors, &bvIterator);
108 dvmIsBitSet(bb->predecessors, cUnit->entryBlock->id)) {
524 dvmClearAllBits(bb->predecessors);
532 int numPred = dvmCountSetBits(firstBB->predecessors);
647 dvmCompilerSetBit(bb->taken->predecessors, bb->id);
661 dvmCompilerSetBit(bb->fallThrough->predecessors, bb->id);
IntermediateRep.cpp 26 bb->predecessors = dvmCompilerAllocBitVector(blockId > 32 ? blockId : 32,
CompilerIR.h 170 BitVector *predecessors; member in struct:BasicBlock
  /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) {
  /art/compiler/dex/
mir_graph.cc 159 bottom_block->taken->predecessors->Delete(orig_block);
160 bottom_block->taken->predecessors->Insert(bottom_block);
166 bottom_block->predecessors->Insert(orig_block);
168 bottom_block->fall_through->predecessors->Delete(orig_block);
169 bottom_block->fall_through->predecessors->Insert(bottom_block);
181 bb->predecessors->Delete(orig_block);
182 bb->predecessors->Insert(bottom_block);
312 taken_block->predecessors->Insert(cur_block);
335 fallthrough_block->predecessors->Insert(cur_block);
409 case_block->predecessors->Insert(cur_block)
    [all...]
mir_optimization.cc 23 static unsigned int Predecessors(BasicBlock* bb) {
24 return bb->predecessors->Size();
112 if ((bb == NULL) || Predecessors(bb) != 1) {
164 if (bb == NULL || (Predecessors(bb) != 1)) {
347 (Predecessors(tk) == 1) && (Predecessors(ft) == 1)) {
511 if ((walker->block_type == kEntryBlock) || (Predecessors(walker) != 1)) {
514 BasicBlock* prev = walker->predecessors->Get(0);
583 DCHECK_EQ(Predecessors(bb_next), 1U);
633 } else if (bb->predecessors->Size() == 1)
    [all...]
  /external/llvm/lib/CodeGen/
ShrinkWrapping.cpp 236 /// predecessors.
241 // AvailIn[MBB] = INTERSECT(AvailOut[P] for P in PREDECESSORS(MBB))
242 SmallVector<MachineBasicBlock*, 4> predecessors; local
247 predecessors.push_back(PRED);
250 unsigned i = 0, e = predecessors.size();
253 MachineBasicBlock* PRED = predecessors[i];
257 PRED = predecessors[i];
295 // available at predecessors of MBB.
448 assert(HDR->pred_size() > 0 && "Loop header has no predecessors?");
592 // Propagate selected bits to successors, predecessors of MBB
682 SmallVector<MachineBasicBlock*, 4> predecessors; local
    [all...]

Completed in 2187 milliseconds

1 2 3