diff options
author | Alon Zakai <alonzakai@gmail.com> | 2013-06-05 14:36:11 -0700 |
---|---|---|
committer | Alon Zakai <alonzakai@gmail.com> | 2013-06-05 18:15:06 -0700 |
commit | 956208e3eec94089e0aefd17736df50522b9131e (patch) | |
tree | cbb91391776e52e53c91aac4c989ff0dc3dadbf6 | |
parent | a569e626a18d38d3179b1a12d4b915c8ba4b2092 (diff) |
remove unneeded parameter to FindIndependentGroups
-rw-r--r-- | src/relooper/Relooper.cpp | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/src/relooper/Relooper.cpp b/src/relooper/Relooper.cpp index 8c72b0a6..7183ea68 100644 --- a/src/relooper/Relooper.cpp +++ b/src/relooper/Relooper.cpp @@ -528,8 +528,6 @@ void Relooper::Calculate(Block *Entry) { DebugDump(Blocks, " outer blocks:"); DebugDump(NextEntries, " outer entries:"); - // TODO: Optionally hoist additional blocks into the loop - LoopShape *Loop = new LoopShape(); Notice(Loop); @@ -551,7 +549,7 @@ void Relooper::Calculate(Block *Entry) { // For each entry, find the independent group reachable by it. The independent group is // the entry itself, plus all the blocks it can reach that cannot be directly reached by another entry. Note that we // ignore directly reaching the entry itself by another entry. - void FindIndependentGroups(BlockSet &Blocks, BlockSet &Entries, BlockBlockSetMap& IndependentGroups) { + void FindIndependentGroups(BlockSet &Entries, BlockBlockSetMap& IndependentGroups) { typedef std::map<Block*, Block*> BlockBlockMap; struct HelperClass { @@ -756,7 +754,7 @@ void Relooper::Calculate(Block *Entry) { // independent blocks from an entry/ies. It is important to remove through // multiples as opposed to looping since the former is more performant. BlockBlockSetMap IndependentGroups; - FindIndependentGroups(Blocks, *Entries, IndependentGroups); + FindIndependentGroups(*Entries, IndependentGroups); PrintDebug("Independent groups: %d\n", IndependentGroups.size()); |