Home
last modified time | relevance | path

Searched refs:SCCs (Results 1 – 19 of 19) sorted by relevance

/llvm-project-15.0.7/llvm/test/Analysis/LazyCallGraph/
H A Dbasic.ll256 ; Verify the SCCs formed.
258 ; CHECK-LABEL: RefSCC with 1 call SCCs:
262 ; CHECK-LABEL: RefSCC with 1 call SCCs:
266 ; CHECK-LABEL: RefSCC with 1 call SCCs:
270 ; CHECK-LABEL: RefSCC with 1 call SCCs:
274 ; CHECK-LABEL: RefSCC with 1 call SCCs:
278 ; CHECK-LABEL: RefSCC with 1 call SCCs:
282 ; CHECK-LABEL: RefSCC with 1 call SCCs:
286 ; CHECK-LABEL: RefSCC with 1 call SCCs:
290 ; CHECK-LABEL: RefSCC with 1 call SCCs:
[all …]
H A Dalias.ll11 ; CHECK: RefSCC with 1 call SCCs:
15 ; CHECK: RefSCC with 1 call SCCs:
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLazyCallGraph.cpp344 for (SCC *C : SCCs) { in verify()
384 for (SCC *C : SCCs) { in verify()
534 SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx + 1, in updatePostorderSequenceForEdgeInsertion()
569 SCCs.begin() + SourceIdx + 1, SCCs.begin() + TargetIdx + 1, in updatePostorderSequenceForEdgeInsertion()
582 return make_range(SCCs.begin() + SourceIdx, SCCs.begin() + TargetIdx); in updatePostorderSequenceForEdgeInsertion()
927 SCCs.insert(SCCs.begin() + OldIdx, NewSCCs.begin(), NewSCCs.end()); in switchInternalEdgeToRef()
1122 MergedSCCs.append(RC->SCCs.begin(), RC->SCCs.end()); in insertIncomingRefEdge()
1123 RC->SCCs.clear(); in insertIncomingRefEdge()
1130 MergedSCCs.append(SCCs.begin(), SCCs.end()); in insertIncomingRefEdge()
1394 SCCs.clear(); in removeInternalRefEdge()
[all …]
H A DSyntheticCountsUtils.cpp86 std::vector<SccTy> SCCs; in propagate() local
90 SCCs.push_back(*I); in propagate()
95 for (auto &SCC : reverse(SCCs)) in propagate()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h543 SmallVector<SCC *, 4> SCCs; variable
553 SCCs.clear(); in clear()
572 OS << "..., " << *RC.SCCs.back();
604 iterator begin() const { return SCCs.begin(); } in begin()
605 iterator end() const { return SCCs.end(); } in end()
607 ssize_t size() const { return SCCs.size(); } in size()
609 SCC &operator[](int Idx) { return *SCCs[Idx]; }
612 return SCCs.begin() + SCCIndices.find(&C)->second; in find()
/llvm-project-15.0.7/llvm/test/Other/
H A Dcgscc-refscc-mutation-order.ll3 ; We want to run passes on every SCC in a RefSCC without bailing even if one of the SCCs becomes a …
6 ; SCCs in the RefSCC become their own RefSCC as passes run on them. Otherwise we
H A Dcgscc-observe-devirt.ll2 ; the CGSCC pass manager correctly observes and re-visits SCCs that change
61 ; makes sure we walk across the SCCs in that order.
H A Dcgscc-iterate-function-mutation.ll8 ; simplifycfg to delete call edges and this ends up splitting both the SCCs
68 ; splitting the SCCs while leaving the RefSCC intact. This is accomplished by
/llvm-project-15.0.7/mlir/test/Dialect/LLVMIR/
H A Dcallgraph.mlir16 // CHECK-LABEL: -- SCCs --
61 // CHECK: -- SCCs --
/llvm-project-15.0.7/llvm/test/Analysis/BlockFrequencyInfo/
H A Dirreducible.ll44 ; In addition to loops, -block-freq has limited support for irreducible SCCs,
45 ; which are SCCs with multiple entry blocks. Irreducible SCCs are discovered
48 ; The headers of irreducible sub-SCCs consist of its entry blocks and all nodes
189 ; Two unrelated irreducible SCCs.
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dinlining-dce.mlir58 // functions in different SCCs that are referenced by calls materialized during
/llvm-project-15.0.7/llvm/test/Transforms/Inline/
H A Dcgscc-cycle-debug.ll2 ; that repeatedly rerun the new, current SCC; second is a worklist for all newly split SCCs. We nee…
H A Dcgscc-invalidate.ll66 ; dominators after splitting an SCC into two smaller SCCs.
H A Dcgscc-cycle.ll149 ; test3_a->test3_c will be converted to a call edge, and the two SCCs will be
/llvm-project-15.0.7/llvm/test/Transforms/Inline/ML/
H A Dstate-tracking-scc-splits.ll13 ; simplifycfg to delete call edges and this ends up splitting both the SCCs
/llvm-project-15.0.7/polly/lib/External/isl/
H A DChangeLog76 - optionally combine SCCs incrementally in scheduler
/llvm-project-15.0.7/llvm/docs/DependenceGraphs/
H A Dindex.rst134 …3. The paper describes two types of pi-blocks; *recurrences* whose bodies are SCCs and *IN* nodes …
/llvm-project-15.0.7/llvm/docs/
H A DPasses.rst287 ``-print-callgraph-sccs``: Print SCCs of the Call Graph
290 This pass, only available in ``opt``, prints the SCCs of the call graph to
293 ``-print-cfg-sccs``: Print SCCs of each function CFG
296 This pass, only available in ``opt``, printsthe SCCs of each function CFG to
H A DWritingAnLLVMPass.rst423 has to handle SCCs with more than one node in it. All of the virtual methods
438 SCCs being processed. The ``doInitialization`` method call is not scheduled to