Home
last modified time | relevance | path

Searched refs:succ (Results 1 – 25 of 49) sorted by relevance

12

/llvm-project-15.0.7/llvm/lib/ProfileData/
H A DGCOV.cpp415 if (!succ.empty()) { in print()
417 for (const GCOVArc *Edge : succ) { in print()
447 if (i == u->succ.size()) { in augmentOneCycle()
455 GCOVArc *succ = u->succ[i]; in augmentOneCycle() local
459 if (succ->cycleCount == 0 || !succ->dst.traversable || &succ->dst == u) in augmentOneCycle()
461 if (succ->dst.incoming == nullptr) { in augmentOneCycle()
462 succ->dst.incoming = succ; in augmentOneCycle()
470 if (v == &succ->dst) in augmentOneCycle()
473 succ->cycleCount -= minCount; in augmentOneCycle()
477 if (v == &succ->dst) in augmentOneCycle()
[all …]
/llvm-project-15.0.7/bolt/test/X86/
H A Dpre-aggregated-perf.test35 NEWFORMAT: succ: [ { bid: 1, cnt: 22 } ]
38 NEWFORMAT: succ: [ { bid: 3, cnt: 33, mis: 4 }, { bid: 2, cnt: 22 } ]
41 NEWFORMAT: succ: [ { bid: 3, cnt: 22 } ]
44 NEWFORMAT: succ: [ { bid: 1, cnt: 58 }, { bid: 4, cnt: 22 } ]
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dtail-dup-break-cfg.ll97 ; This function arranges for the successors of %succ to have already been laid
98 ; out. When we consider whether to lay out succ after bb and to tail-duplicate
106 ; CHECK: # %succ
120 br i1 %tagbit2eq0, label %succ, label %c, !prof !3 ; %succ more likely
124 br label %succ
125 succ:
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp95 const ExplodedNode *succ = *(node->succ_begin()); in shouldCollect() local
96 if (succ->pred_size() != 1) in shouldCollect()
141 const ProgramPoint SuccLoc = succ->getLocation(); in shouldCollect()
160 ExplodedNode *succ = *(node->succ_begin()); in collectNode() local
161 pred->replaceSuccessor(succ); in collectNode()
162 succ->replacePredecessor(pred); in collectNode()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp121 MachineBasicBlock* succ = *BB.succ_begin(); in runOnMachineFunction() local
123 MachineBasicBlock::iterator start = succ->begin(); in runOnMachineFunction()
124 while (start != succ->end() && start->isPHI()) { in runOnMachineFunction()
/llvm-project-15.0.7/llvm/test/Transforms/LCSSA/
H A Drewrite-existing-dbg-values.ll66 ; CHECK-NEXT: br label %for.exit1.succ
68 ; CHECK-LABEL: for.exit1.succ:
93 br label %for.exit1.succ
95 for.exit1.succ: ; preds = %for.exit1
105 exit: ; preds = %for.exit2, %for.exit1.succ
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dcanonicalize-dce.mlir23 "test.br"(%arg0)[^succ] : (f32) -> ()
24 ^succ(%0: f32):
153 …"test.br"(%arg0, %arg1, %arg2, %arg3, %arg4)[^succ] : (tensor<1xf32>, tensor<2xf32>, tensor<3xf32>…
154 ^succ(%t1: tensor<1xf32>, %t2: tensor<2xf32>, %t3: tensor<3xf32>, %t4: tensor<4xf32>, %t5: tensor<5…
/llvm-project-15.0.7/llvm/include/llvm/ProfileData/
H A DGCOV.h285 void addDstEdge(GCOVArc *Edge) { succ.push_back(Edge); } in addDstEdge()
292 return make_range(succ.begin(), succ.end()); in dsts()
308 SmallVector<GCOVArc *, 2> succ; variable
/llvm-project-15.0.7/mlir/lib/Interfaces/
H A DControlFlowInterfaces.cpp102 for (RegionSuccessor &succ : successors) { in verifyTypesAlongAllEdges()
104 if (!succ.isParent()) in verifyTypesAlongAllEdges()
105 succRegionNo = succ.getSuccessor()->getRegionNumber(); in verifyTypesAlongAllEdges()
126 TypeRange succInputsTypes = succ.getSuccessorInputs().getTypes(); in verifyTypesAlongAllEdges()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DSink.cpp91 Loop *succ = LI.getLoopFor(SuccToSinkTo); in IsAcceptableTarget() local
93 if (succ != nullptr && succ != cur) in IsAcceptableTarget()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DRegionIterator.h88 NodeRef succ; in getISucc() local
89 succ = getNode()->getParent()->getNode(BB); in getISucc()
90 assert(succ && "BB not in Region or entered subregion!"); in getISucc()
91 return succ; in getISucc()
H A DDependenceAnalysis.h192 void setNextSuccessor(const Dependence *succ) { NextSuccessor = succ; } in setNextSuccessor() argument
/llvm-project-15.0.7/clang/utils/analyzer/
H A Dexploded-graph-rewriter.py365 succ = result.group(2)
366 self.nodes[pred].successors.append(succ)
367 self.nodes[succ].predecessors.append(pred)
844 def visit_edge(self, pred, succ): argument
846 pred.node_name(), succ.node_name(),
905 for succ in sorted(graph.nodes[node].successors):
906 logging.debug('Visiting edge: %s -> %s ' % (node, succ))
907 visitor.visit_edge(graph.nodes[node], graph.nodes[succ])
928 succ = graph.nodes[succ_id]
930 succ.predecessors = [node_id]
/llvm-project-15.0.7/llvm/bindings/ocaml/target/
H A Dllvm_target.ml89 external succ : t -> t option = "llvm_target_succ"
101 | Some target -> step (succ target) (target :: lst)
H A Dllvm_target.mli141 (** [succ t] returns the next target after [t], or [None]
143 val succ : t -> t option val
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dcfi-inserter-verify-inconsistent-offset.mir12 # CHECK: *** Inconsistent CFA register and/or offset between pred and succ ***
H A Dcfi-inserter-verify-inconsistent-csr.mir16 # CHECK: *** Inconsistent CSR Saved between pred and succ in function inconsistentCSR ***
H A Dcfi-inserter-verify-inconsistent-register.mir12 # CHECK: *** Inconsistent CFA register and/or offset between pred and succ ***
/llvm-project-15.0.7/llvm/test/Transforms/AtomicExpand/PowerPC/
H A Dcmpxchg.ll57 %succ = extractvalue {i128, i1} %pair, 1
58 ret i1 %succ
/llvm-project-15.0.7/mlir/lib/IR/
H A DPatternMatch.cpp280 [dest](Block *succ) { return succ == dest; }) && in mergeBlocks() argument
/llvm-project-15.0.7/mlir/lib/Dialect/ControlFlow/IR/
H A DControlFlowOps.cpp146 Block *succ = op.getDest(); in simplifyBrToBlockWithSinglePred() local
148 if (succ == opParent || !llvm::hasSingleElement(succ->getPredecessors())) in simplifyBrToBlockWithSinglePred()
152 rewriter.mergeBlocks(succ, opParent, op.getOperands()); in simplifyBrToBlockWithSinglePred()
/llvm-project-15.0.7/mlir/lib/Analysis/
H A DLiveness.cpp101 for (Block *succ : block->getSuccessors()) { in updateLiveOut()
102 const BlockInfoBuilder &builder = builders.find(succ)->second; in updateLiveOut()
/llvm-project-15.0.7/mlir/lib/Transforms/Utils/
H A DRegionUtils.cpp295 unsigned succ = succE - succI - 1; in eraseTerminatorSuccessorOperands() local
296 SuccessorOperands succOperands = branchOp.getSuccessorOperands(succ); in eraseTerminatorSuccessorOperands()
297 Block *successor = terminator->getSuccessor(succ); in eraseTerminatorSuccessorOperands()
/llvm-project-15.0.7/mlir/lib/Dialect/Bufferization/Transforms/
H A DBufferDeallocation.cpp155 for (Block *succ : current->getSuccessors()) in recurse()
156 recurse(*succ, current); in recurse()
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp98 if (const CFGBlock *succ = *i) in computeReachableBlocks() local
99 worklist.push_back(succ); in computeReachableBlocks()

12