From a13d6ceed799c5a342fb2d499b88b5fcb950970e Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Mon, 1 Apr 2002 22:20:48 +0000 Subject: [PATCH] Support resolving function arguments/return values to pointers that index into other objects. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2094 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Analysis/DataStructure/ComputeClosure.cpp | 20 ++++++++++++++----- 1 file changed, 15 insertions(+), 5 deletions(-) diff --git a/lib/Analysis/DataStructure/ComputeClosure.cpp b/lib/Analysis/DataStructure/ComputeClosure.cpp index 493b282b8f6..6466f0ba1ac 100644 --- a/lib/Analysis/DataStructure/ComputeClosure.cpp +++ b/lib/Analysis/DataStructure/ComputeClosure.cpp @@ -18,11 +18,21 @@ // Make all of the pointers that point to Val also point to N. // static void copyEdgesFromTo(PointerVal Val, DSNode *N) { - assert(Val.Index == 0 && "copyEdgesFromTo:index != 0 TODO"); - - const vector &PVSToUpdate(Val.Node->getReferrers()); - for (unsigned i = 0, e = PVSToUpdate.size(); i != e; ++i) - PVSToUpdate[i]->add(N); // TODO: support index + unsigned ValIdx = Val.Index; + unsigned NLinks = N->getNumLinks(); + + const vector &PVSsToUpdate(Val.Node->getReferrers()); + for (unsigned i = 0, e = PVSsToUpdate.size(); i != e; ++i) { + // Loop over all of the pointers pointing to Val... + PointerValSet &PVS = *PVSsToUpdate[i]; + for (unsigned j = 0, je = PVS.size(); j != je; ++j) { + if (PVS[j].Node == Val.Node && PVS[j].Index >= ValIdx && + PVS[j].Index < ValIdx+NLinks) + PVS.add(PointerVal(N, PVS[j].Index-ValIdx)); + + //PVS.add(PointerVal(N, Val.Index)); // TODO: support index + } + } } static void ResolveNodesTo(const PointerVal &FromPtr, -- 2.34.1