| /external/llvm/test/CodeGen/MIR/ARM/ |
| cfi-same-value.mir | 31 successors: %bb.2, %bb.1
45 successors: %bb.2
|
| /external/llvm/test/CodeGen/MIR/X86/ |
| stack-object-debug-info.mir | 59 successors: %bb.1.for.body
61 successors: %bb.1.for.body
|
| virtual-registers.mir | 46 successors: %bb.2.exit, %bb.1.less
81 successors: %bb.2.exit, %bb.1.less
|
| /external/llvm/test/CodeGen/X86/ |
| 2010-05-12-FastAllocKills.ll | 13 ; Successors according to CFG: BB#5
27 ; Successors according to CFG: BB#5
|
| switch-jump-table.ll | 58 ; CHECK-JT-PROB: Successors according to CFG: BB#6({{[0-9a-fx/= ]+}}14.29%) BB#8({{[0-9a-fx/= ]+}}85.71%)
59 ; CHECK-JT-PROB: Successors according to CFG: BB#1({{[0-9a-fx/= ]+}}16.67%) BB#2({{[0-9a-fx/= ]+}}16.67%) BB#3({{[0-9a-fx/= ]+}}16.67%) BB#4({{[0-9a-fx/= ]+}}16.67%) BB#5({{[0-9a-fx/= ]+}}33.33%)
|
| /art/test/543-checker-dce-trycatch/src/ |
| Main.java | 35 // where TryBoundary still has exception handler successors after having removed
|
| /external/llvm/test/CodeGen/ARM/ |
| 2011-04-27-IfCvtBug.ll | 4 ; successors) and use inverse depth first search to traverse the BBs. However
|
| /external/llvm/test/Transforms/LoopUnroll/ |
| 2012-04-09-unroll-indirectbr.ll | 4 ; indirectbr successors. SimplifyCFG then considers them to be unreachable.
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 177 IntList successors = block.getSuccessors(); local
178 int succSz = successors.size();
182 int succ = successors.get(i);
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 177 IntList successors = block.getSuccessors(); local
178 int succSz = successors.size();
182 int succ = successors.get(i);
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| LocalVariableExtractor.java | 177 IntList successors = block.getSuccessors(); local
178 int succSz = successors.size();
182 int succ = successors.get(i);
|
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 41 /// in the terminator instruction's list of successors. It is an error to call
46 /// edges from a block with multiple successors to a block with multiple
60 /// walking down successors from From to reach To, with a fixed threshold.
|
| /external/llvm/lib/Analysis/ |
| Interval.cpp | 54 OS << "Interval Successors:\n";
55 for (std::vector<BasicBlock*>::const_iterator I = Successors.begin(),
56 E = Successors.end(); I != E; ++I)
|
| BranchProbabilityInfo.cpp | 118 /// \brief Calculate edge weights for successors lead to unreachable.
140 // If all successors are in the set of blocks post-dominated by unreachable,
193 // Check that the number of successors is manageable.
194 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors");
196 // Ensure there are weights for all of the successors. Note that the first
249 // Determine which successors are post-dominated by a cold block.
258 // If all successors are in the set of blocks post-dominated by cold calls,
584 /// to the successors.
620 /// to the successors.
687 // the successors of a block iteratively
[all...] |
| /external/llvm/lib/CodeGen/ |
| LivePhysRegs.cpp | 155 // The return block has no successors whose live-ins we could merge
162 // To get the live-outs we simply merge the live-ins of all successors.
163 for (const MachineBasicBlock *Succ : MBB->successors())
|
| MachineBasicBlock.cpp | 317 // Print the successors of this block according to the CFG.
320 OS << " Successors according to CFG:";
416 // A block with no successors has no concerns with fall-through edges.
455 // successors is its layout successor, rewrite it to a fallthrough
467 // Walk through the successors and find the successor which is not
517 // no greater than the number of successors.
520 "The sum of successors's probabilities exceeds one.");
528 if (!(Probs.empty() && !Successors.empty()))
530 Successors.push_back(Succ);
539 Successors.push_back(Succ)
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 324 * (aka default) successor (if any). Keep following successors
379 * unordered successors (hopefully the primary), and so
380 * on, until we run out of unordered successors.
415 IntList successors = one.getSuccessors(); local
416 int ssz = successors.size();
419 int candidate = successors.get(i);
611 IntList successors = block.getSuccessors(); local
613 int succSz = successors.size();
618 * less than the number of successors and that the last
625 (primarySuccessor != successors.get(casesSz)))
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| RopTranslator.java | 330 * (aka default) successor (if any). Keep following successors
385 * unordered successors (hopefully the primary), and so
386 * on, until we run out of unordered successors.
421 IntList successors = one.getSuccessors(); local
422 int ssz = successors.size();
425 int candidate = successors.get(i);
617 IntList successors = block.getSuccessors(); local
619 int succSz = successors.size();
624 * less than the number of successors and that the last
631 (primarySuccessor != successors.get(casesSz)))
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| RopTranslator.java | 331 * (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(); local
423 int ssz = successors.size();
426 int candidate = successors.get(i);
618 IntList successors = block.getSuccessors(); local
620 int succSz = successors.size();
625 * less than the number of successors and that the last
632 (primarySuccessor != successors.get(casesSz)))
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| Label.java | 161 * 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.next' leads
[all...] |
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 76 std::map<change_ty, std::vector<change_ty> > Successors;
101 assert(Successors.count(Node) && "Invalid node!");
102 return Successors[Node].begin();
105 assert(Successors.count(Node) && "Invalid node!");
106 return Successors[Node].end();
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
192 Successors[it->first].push_back(it->second);
|
| /art/test/510-checker-try-catch/smali/ |
| SsaBuilder.smali | 28 ## CHECK-NEXT: successors "<<BAdd:B\d+>>"
34 ## CHECK-NEXT: successors
43 ## CHECK-NEXT: successors "<<BAdd>>"
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 523 if (int successors = TI->getNumSuccessors()) {
524 for (int i = 0; i != successors; ++i) {
610 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
611 if (Successors) {
612 if (Successors == 1) {
634 for (int i = 0; i != Successors; ++i)
638 Edge += Successors;
708 // All edges with successors that aren't branches are "complex", because it
732 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
733 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
[all...] |
| /external/v8/src/compiler/ |
| schedule.h | 69 // Successors.
70 BasicBlockVector& successors() { return successors_; } function in class:v8::internal::compiler::final
71 const BasicBlockVector& successors() const { return successors_; } function in class:v8::internal::compiler::final
|
| /art/test/596-checker-dead-phi/smali/ |
| IrreducibleLoop.smali | 47 # its successors. To do that, load a boolean value and compare NotEqual to 1.
|
