diff options
| author | Arthur Eubanks <aeubanks@google.com> | 2025-02-14 16:42:28 -0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-02-14 16:42:28 -0800 |
| commit | caaa288fa3658b40a35a8e327bf140921ecfaaf9 (patch) | |
| tree | 82b5fe8a9939151a6e43a74aee77f7729e9b2d69 /llvm/lib/Analysis/LazyCallGraph.cpp | |
| parent | 28c52edbe33e671ace58309e60598f3342e9ca73 (diff) | |
| download | llvm-caaa288fa3658b40a35a8e327bf140921ecfaaf9.zip llvm-caaa288fa3658b40a35a8e327bf140921ecfaaf9.tar.gz llvm-caaa288fa3658b40a35a8e327bf140921ecfaaf9.tar.bz2 | |
Revert "[Coroutines][LazyCallGraph] addSplitRefRecursiveFunctions allows spurious ref edges between new functions." (#127285)
Reverts llvm/llvm-project#116285
Breaks expensive checks build, e.g.
https://lab.llvm.org/buildbot/#/builders/16/builds/13821
Diffstat (limited to 'llvm/lib/Analysis/LazyCallGraph.cpp')
| -rw-r--r-- | llvm/lib/Analysis/LazyCallGraph.cpp | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/llvm/lib/Analysis/LazyCallGraph.cpp b/llvm/lib/Analysis/LazyCallGraph.cpp index eb91b76..5aa36bf 100644 --- a/llvm/lib/Analysis/LazyCallGraph.cpp +++ b/llvm/lib/Analysis/LazyCallGraph.cpp @@ -1720,7 +1720,6 @@ void LazyCallGraph::addSplitRefRecursiveFunctions( for (Function *NewFunction : NewFunctions) { Node &NewN = initNode(*NewFunction); - // Make the original function reference each new function OriginalN->insertEdgeInternal(NewN, Edge::Kind::Ref); // Check if there is any edge from any new function back to any function in @@ -1776,9 +1775,8 @@ void LazyCallGraph::addSplitRefRecursiveFunctions( if (F1 == F2) continue; Node &N2 = get(*F2); - assert(!N1->lookup(N2) || - (!N1->lookup(N2)->isCall() && - "Edges between new functions must be ref edges")); + assert(!N1->lookup(N2)->isCall() && + "Edges between new functions must be ref edges"); } } #endif |