HomeSort by relevance Sort by last modified time
    Searched defs:predecessors (Results 1 - 8 of 8) sorted by null

  /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
  /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 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/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/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...]
  /dalvik/vm/compiler/
CompilerIR.h 167 BitVector *predecessors; member in struct:BasicBlock
  /external/v8/src/
hydrogen.h 68 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; } function in class:v8::internal::HBasicBlock
136 // predecessors should contain the inlined exit sequence:
    [all...]
  /prebuilt/sdk/tools/lib/
dx.jar 

Completed in 262 milliseconds