| /prebuilts/go/darwin-x86/src/cmd/vet/internal/cfg/ |
| cfg.go | 65 // A block may have 0-2 successors: zero for a return block or a block
|
| /prebuilts/go/linux-x86/src/cmd/vet/internal/cfg/ |
| cfg.go | 65 // A block may have 0-2 successors: zero for a return block or a block
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 255 if (SI == E) return nullptr; // no successors
258 return (SI == E) ? TheSucc : nullptr /* multiple successors */;
263 if (SI == E) return nullptr; // No successors
392 // Now we must loop through all of the successors of the New block (which
393 // _were_ the successors of the 'this' block), and update any PHI nodes in
394 // successors. If there were PHI nodes in the successors, then they need to
420 for (BasicBlock *Succ : TI->successors()) {
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64ConditionOptimizer.cpp | 147 for (auto SuccBB : MBB->successors())
|
| AArch64BranchRelaxation.cpp | 151 for (MachineBasicBlock *S : MBB->successors())
|
| /external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
| ir3_compiler_nir.c | 88 * figuring out the blocks successors
[all...] |
| ir3_ra.c | 791 for (unsigned j = 0; j < ARRAY_SIZE(block->successors); j++) {
792 struct ir3_block *succ = block->successors[j];
|
| /external/annotation-tools/asmx/src/org/objectweb/asm/ |
| MethodWriter.java | 246 * stores the list of its successors in the graph, as a linked list of Edge
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveDebugValues.cpp | 489 for (auto s : MBB->successors())
|
| TailDuplicator.cpp | 124 // Save the successors list.
138 // TailBB's immediate successors are now successors of those predecessors
417 /// After FromBB is tail duplicated into its predecessor blocks, the successors
573 // Check if any of the successors of TailBB has a PHI node in which the
582 for (auto SB : TailBB.successors()) {
620 for (MachineBasicBlock *BB : A.successors())
798 "TailDuplicate called on block with multiple successors!");
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIWholeQuadMode.cpp | 306 // All successors must be prepared to accept the same set of WQM/Exact data.
307 for (MachineBasicBlock *Succ : MBB.successors()) {
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 182 for (MachineBasicBlock *Succ : MBB->successors()) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| PlaceSafepoints.cpp | 279 for (BasicBlock *Succ : successors(BB)) {
537 // Since this is a latch, at least one of the successors must dominate
|
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 63 /// destination. This is a nontrivial operation because the successors of this
193 for (BasicBlock *Succ : SI->successors()) {
[all...] |
| /external/mesa3d/src/compiler/nir/ |
| nir.c | 298 start_block->successors[0] = end_block;
343 block->successors[0] = block->successors[1] = NULL;
405 body->successors[0] = body;
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86WinEHState.cpp | 585 // successors.
594 for (BasicBlock *SuccBB : successors(BB)) {
611 // At least two successors have different InitialStates,
711 // enqueue it's successors to see if we can infer their states.
714 for (BasicBlock *SuccBB : successors(BB))
718 // Try to hoist stores from successors.
725 // successors.
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 537 if (int successors = TI->getNumSuccessors()) {
538 for (int i = 0; i != successors; ++i) {
622 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
623 if (Successors) {
624 if (Successors == 1) {
643 for (int i = 0; i != Successors; ++i)
647 Edge += Successors;
717 // All edges with successors that aren't branches are "complex", because it
741 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
742 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 384 if (int successors = TI->getNumSuccessors()) {
385 for (int i = 0; i != successors; ++i) {
457 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
458 if (Successors) {
461 if (Successors == 1) {
483 for (int i = 0; i != Successors; ++i)
486 Edge += Successors;
521 // All edges with successors that aren't branches are "complex", because it
545 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors();
546 if (Successors > 1 && !isa<BranchInst>(TI) && !isa<ReturnInst>(TI))
[all...] |
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| hlo_computation_test.cc | 448 auto successors = predecessors[0]->control_successors(); local
449 EXPECT_THAT(successors, ::testing::ElementsAre(cloned_add));
|
| /external/v8/src/compiler/ |
| graph-visualizer.cc | 434 os_ << "successors";
435 for (BasicBlock* successor : current->successors()) {
527 for (BasicBlock* successor : current->successors()) {
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| deadcode.go | 23 // Mark successors as reachable
|
| dom.go | 116 // entry and using predFn/succFn to find predecessors/successors to allow
|
| /prebuilts/go/darwin-x86/src/image/jpeg/ |
| idct.go | 27 * customers, employees, agents, transferees, successors, and assigns.
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| deadcode.go | 23 // Mark successors as reachable
|
| dom.go | 116 // entry and using predFn/succFn to find predecessors/successors to allow
|
