diff options
| author | Chris Lattner <sabre@nondot.org> | 2003-11-11 20:12:32 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2003-11-11 20:12:32 +0000 |
| commit | da05b051975e9e680c23d6303bf26d3cc933c9bf (patch) | |
| tree | 26ec52540681d2c45988372cbf75461f401be041 /llvm/lib/Analysis/DataStructure | |
| parent | 895b12faff424178c827685230903621c643bfce (diff) | |
| download | bcm5719-llvm-da05b051975e9e680c23d6303bf26d3cc933c9bf.tar.gz bcm5719-llvm-da05b051975e9e680c23d6303bf26d3cc933c9bf.zip | |
Compute node offsets correctly
llvm-svn: 9895
Diffstat (limited to 'llvm/lib/Analysis/DataStructure')
| -rw-r--r-- | llvm/lib/Analysis/DataStructure/DataStructure.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/llvm/lib/Analysis/DataStructure/DataStructure.cpp b/llvm/lib/Analysis/DataStructure/DataStructure.cpp index 2883899b1c3..d53c7fa5d7b 100644 --- a/llvm/lib/Analysis/DataStructure/DataStructure.cpp +++ b/llvm/lib/Analysis/DataStructure/DataStructure.cpp @@ -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. |
