Searched refs:successors (Results 1 - 18 of 18) sorted by relevance

/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DBasicBlock.java35 * {@code non-null;} full list of successors that this block may
38 private final IntList successors; field in class:BasicBlock
42 * {@code -1} if this block has no successors (that is, it
52 * @param successors {@code non-null;} full list of successors that this
56 * successors (that is, it exits the function/method or is an
59 public BasicBlock(int label, InsnList insns, IntList successors, argument
94 successors.throwIfMutable();
97 throw new NullPointerException("successors == null");
104 if (primarySuccessor >= 0 && !successors
[all...]
H A DLocalVariableExtractor.java177 IntList successors = block.getSuccessors();
178 int succSz = successors.size();
182 int succ = successors.get(i);
H A DRopMethod.java158 * For each block, find its successors, and add the block's label to
164 IntList successors = one.getSuccessors();
165 int ssz = successors.size();
171 int succLabel = successors.get(j);
H A DBasicBlockList.java223 * the preferred successor. If the block has no successors, then
231 IntList successors = block.getSuccessors();
232 int succSize = successors.size();
239 return labelToBlock(successors.get(0));
246 return labelToBlock(successors.get(0));
256 * @return {@code true} if the two blocks' non-primary successors
/external/dexmaker/src/main/java/com/google/dexmaker/
H A DLabel.java77 IntList successors = new IntList();
79 successors.add(catchLabel.id);
83 successors.add(primarySuccessorIndex);
86 successors.add(alternateSuccessor.id);
88 successors.setImmutable();
90 return new BasicBlock(id, result, successors, primarySuccessorIndex);
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DSsaBasicBlock.java58 private BitSet successors; field in class:SsaBasicBlock
129 this.successors = new BitSet(parent.getBlocks().size());
162 result.successors
348 * @return {@code non-null;} successors set, indexed by block index
351 return successors;
421 newPred.successors.set(index) ;
456 if (!successors.get(other.index)) {
463 newSucc.successors.set(other.index) ;
477 successors.clear(other.index);
478 successors
[all...]
H A DLocalVariableExtractor.java110 // The exit block has no insns and no successors
194 IntList successors = block.getSuccessorList();
195 int succSz = successors.size();
199 int succ = successors.get(i);
H A DSsaConverter.java142 * successors and multiple predecessors.
168 * Any block with that has both multiple successors and multiple
243 BitSet successors = (BitSet)block.getSuccessors().clone();
244 for (int j = successors.nextSetBit(0);
245 j >= 0; j = successors.nextSetBit(j+1)) {
H A DSsaRenamer.java654 BitSet successors = block.getSuccessors();
655 for (int i = successors.nextSetBit(0); i >= 0;
656 i = successors.nextSetBit(i + 1)) {
/external/dexmaker/src/dx/java/com/android/dx/dex/code/
H A DStdCatchBuilder.java218 IntList successors = block.getSuccessors();
219 int succSize = successors.size();
231 || (primary != successors.get(catchSize))))) {
234 * successor -- if any -- last in the successors list, but
238 "shouldn't happen: weird successors list");
257 CodeAddress oneHandler = addresses.getStart(successors.get(i));
H A DRopTranslator.java331 * (aka default) successor (if any). Keep following successors
386 * unordered successors (hopefully the primary), and so
387 * on, until we run out of unordered successors.
422 IntList successors = one.getSuccessors();
423 int ssz = successors.size();
426 int candidate = successors.get(i);
618 IntList successors = block.getSuccessors();
620 int succSz = successors.size();
625 * less than the number of successors and that the last
632 (primarySuccessor != successors
[all...]
/external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/
H A DAnalyzedInstruction.java58 protected final LinkedList<AnalyzedInstruction> successors = new LinkedList<AnalyzedInstruction>(); field in class:AnalyzedInstruction
113 successors.add(successor);
127 return successors.size();
131 return Collections.unmodifiableList(successors);
H A DMethodAnalyzer.java70 //successors, e.g. the first real instruction, the first instructions in any exception handlers covering the first
183 for (AnalyzedInstruction successor: startOfMethod.successors) {
227 for (AnalyzedInstruction successor: instructionToAnalyze.successors) {
286 for (AnalyzedInstruction successor: startOfMethod.successors) {
311 for (AnalyzedInstruction successor: instructionToVerify.successors) {
411 //Using a for loop inside the while loop optimizes for the common case of the successors of an instruction
412 //occurring after the instruction. Any successors that occur prior to the instruction will be picked up on
443 for (AnalyzedInstruction successor: instruction.successors) {
510 //finally, populate the successors and predecessors for each instruction. We start at the fake "StartOfMethod"
511 //instruction and follow the execution path. Any unreachable code won't have any predecessors or successors,
[all...]
/external/llvm/lib/CodeGen/
H A DShrinkWrapping.cpp17 // placed in the loop exit nodes (the successors of loop _exiting_ nodes).
199 /// successors.
205 SmallVector<MachineBasicBlock*, 4> successors; local
210 successors.push_back(SUCC);
213 unsigned i = 0, e = successors.size();
216 MachineBasicBlock* SUCC = successors[i];
220 SUCC = successors[i];
292 // anticipated at successors of MBB.
353 /// 3. all CSRs are used in all immediate successors of the entry block.
482 << ": all CSRs used in imm successors o
745 SmallVector<MachineBasicBlock*, 4> successors; local
[all...]
/external/llvm/lib/Support/Windows/
H A DPath.inc75 // If there is a null character, it and all its successors are ignored.
/external/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp391 if (int successors = TI->getNumSuccessors()) {
392 for (int i = 0; i != successors; ++i) {
529 // All edges with successors that aren't branches are "complex", because it
/external/v8/src/
H A Djsregexp.cc4688 if (successors() != NULL) {
4689 for (int i = 0; i < successors()->length(); i++) {
4690 OutSet* successor = successors()->at(i);
4699 successors()->Add(result);
H A Djsregexp.h355 // The successors are a list of sets that contain the same values
358 ZoneList<OutSet*>* successors() { return successors_; } function in class:v8::internal::OutSet
414 // successors in a zone and caches them.

Completed in 191 milliseconds