Compute node offsets correctly

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@9895 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-11-11 20:12:32 +00:00
parent aab9ca73fd
commit 413406c068

View File

@ -1652,13 +1652,13 @@ void DSGraph::computeNodeMapping(const DSNodeHandle &NH1,
if (Entry.getNode()) {
// Termination of recursion!
assert(Entry.getNode() == N2 &&
Entry.getOffset() == (NH1.getOffset()+NH2.getOffset()) &&
Entry.getOffset() == (NH2.getOffset()-NH1.getOffset()) &&
"Inconsistent mapping detected!");
return;
}
Entry.setNode(N2);
Entry.setOffset(NH1.getOffset()+NH2.getOffset());
Entry.setOffset(NH2.getOffset()-NH1.getOffset());
// Loop over all of the fields that N1 and N2 have in common, recursively
// mapping the edges together now.