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

12

/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/v8/src/compiler/
H A Dschedule.cc73 BasicBlock::Successors successors = block->successors(); local
75 for (BasicBlock::Successors::iterator j = successors.begin();
76 j != successors.end(); ++j) {
H A Dinstruction.cc472 BasicBlock::Successors successors = block->successors(); local
473 for (BasicBlock::Successors::iterator iter = successors.begin();
474 iter != successors.end(); ++iter) {
H A Dscheduler.cc66 ConnectBlocks(*i); // Connect block to its predecessor/successors.
133 Node* successors[2]; local
134 CollectSuccessorProjections(node, successors, a, b);
135 BuildBlockForNode(successors[0]);
136 BuildBlockForNode(successors[1]);
164 Node* successors[2]; local
165 CollectSuccessorProjections(node, successors, true_opcode, false_opcode);
166 buffer[0] = schedule_->block(successors[0]);
167 buffer[1] = schedule_->block(successors[1]);
972 // Finished with all successors; po
[all...]
H A Dregister-allocator.cc533 BasicBlock::Successors successors = block->successors(); local
534 for (BasicBlock::Successors::iterator i = successors.begin();
535 i != successors.end(); ++i) {
775 BasicBlock::Successors successors = block->successors(); local
776 for (BasicBlock::Successors::iterator succ = successors.begin();
777 succ != successors.end(); ++succ) {
793 BasicBlock::Successors successors = block->successors(); local
[all...]
/external/mockito/cglib-and-asm/src/org/mockito/asm/
H A DLabel.java161 * of this basic block. Each node also stores the list of its successors in
222 * The successors of this node in the control flow graph. These successors
226 Edge successors; field in class:Label
483 // adds JSR to the successors of this block, if it is a RET block
488 e.successor = JSR.successors.successor;
489 e.next = successors;
490 successors = e;
502 Edge e = successors;
504 // if this block is a JSR block, then 'successors
[all...]
H A DMethodWriter.java343 * stores the list of its successors in the graph, as a linked list of Edge
882 * has at least two successors in the control flow graph:
1100 // adds current block successors
1110 // adds current block successors
1226 // adds it to the successors of 'l'
1227 b.next = l.successors;
1228 l.successors = b;
1245 * successors (which can be changed in the process).
1266 // updates the successors of the current basic block
1267 Edge e = l.successors;
[all...]
/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/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
H A DAnalyzedInstruction.java61 protected final LinkedList<AnalyzedInstruction> successors = new LinkedList<AnalyzedInstruction>(); field in class:AnalyzedInstruction
109 successors.add(successor);
123 return successors.size();
127 return Collections.unmodifiableList(successors);
/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/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp171 for (auto *Block : successors())
234 // of its successors have already computed their post-dominators. This is
239 for (auto *Succ : successors()) {
/external/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp61 for (BasicBlock *BB : successors(entryBlock)) {
/external/clang/include/clang/Analysis/Analyses/
H A DThreadSafetyTIL.h1368 ArrayRef<BasicBlock*> successors();
1370 ArrayRef<BasicBlock*> successors() const { function in class:clang::threadSafety::Terminator
1371 return const_cast<Terminator*>(this)->successors();
1397 ArrayRef<BasicBlock*> successors() { function in class:clang::threadSafety::Goto
1447 ArrayRef<BasicBlock*> successors() { function in class:clang::threadSafety::Branch
1481 ArrayRef<BasicBlock*> successors() { function in class:clang::threadSafety::Return
1504 inline ArrayRef<BasicBlock*> Terminator::successors() { function in class:clang::threadSafety::Terminator
1506 case COP_Goto: return cast<Goto>(this)->successors();
1507 case COP_Branch: return cast<Branch>(this)->successors();
1508 case COP_Return: return cast<Return>(this)->successors();
1582 ArrayRef<BasicBlock*> successors() { return TermInstr->successors(); } function in class:clang::threadSafety::BasicBlock
1583 ArrayRef<BasicBlock*> successors() const { return TermInstr->successors(); } function in class:clang::threadSafety::BasicBlock
[all...]
/external/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp308 /// \brief Mark a chain's successors as having one fewer preds.
311 /// quickly walk the successors of each block in the chain and mark them as
312 /// having one fewer active predecessor. It also adds any successors of this
318 // Walk all the blocks in this chain, marking their successors as having
321 // Add any successors for which this is the only un-placed in-loop
325 for (MachineBasicBlock *Succ : MBB->successors()) {
343 /// This looks across all successors of a particular block and attempts to
345 /// successors which also pass the block filter. It will attempt to avoid
367 for (MachineBasicBlock *Succ : BB->successors()) {
385 // successors mus
[all...]
/external/llvm/include/llvm/IR/
H A DCFG.h164 // SuccIterator which describes a basic block that has zero successors.
271 inline succ_range successors(BasicBlock *BB) { function in namespace:llvm
274 inline succ_const_range successors(const BasicBlock *BB) { function in namespace:llvm
/external/llvm/lib/Analysis/
H A DDivergenceAnalysis.cpp256 for (BasicBlock *Succ : successors(BB)) {
278 // Terminators with less than two successors won't introduce sync
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h74 /// Weights - Keep track of the weights to the successors. This vector
309 inline iterator_range<succ_iterator> successors() { function in class:llvm::MachineBasicBlock
312 inline iterator_range<const_succ_iterator> successors() const { function in class:llvm::MachineBasicBlock
392 /// removeSuccessor - Remove successor from the successors list of this
397 /// removeSuccessor - Remove specified successor from the successors list of
408 /// transferSuccessors - Transfers all the successors from MBB to this
409 /// machine basic block (i.e., copies all the successors fromMBB and
410 /// remove all the successors from fromMBB).
413 /// transferSuccessorsAndUpdatePHIs - Transfers all the successors, as
602 /// DestA and DestB, remove any other MBB successors fro
[all...]

Completed in 748 milliseconds

12