mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-03-03 14:31:10 +00:00
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:
parent
aab9ca73fd
commit
413406c068
@ -1652,13 +1652,13 @@ void DSGraph::computeNodeMapping(const DSNodeHandle &NH1,
|
|||||||
if (Entry.getNode()) {
|
if (Entry.getNode()) {
|
||||||
// Termination of recursion!
|
// Termination of recursion!
|
||||||
assert(Entry.getNode() == N2 &&
|
assert(Entry.getNode() == N2 &&
|
||||||
Entry.getOffset() == (NH1.getOffset()+NH2.getOffset()) &&
|
Entry.getOffset() == (NH2.getOffset()-NH1.getOffset()) &&
|
||||||
"Inconsistent mapping detected!");
|
"Inconsistent mapping detected!");
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
Entry.setNode(N2);
|
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
|
// Loop over all of the fields that N1 and N2 have in common, recursively
|
||||||
// mapping the edges together now.
|
// mapping the edges together now.
|
||||||
|
Loading…
x
Reference in New Issue
Block a user