summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorAlon Zakai <alonzakai@gmail.com>2016-07-18 15:31:52 -0700
committerAlon Zakai <alonzakai@gmail.com>2016-07-18 15:31:52 -0700
commit8ae76ea9554267a5cf482b7f0443080656e13a5a (patch)
treed6264f2afc55afdb588f900e21afcd464cd7802d /src
parent1335cf78817d993a50c62a1c6395ffb35d0a0c63 (diff)
downloadbinaryen-8ae76ea9554267a5cf482b7f0443080656e13a5a.tar.gz
binaryen-8ae76ea9554267a5cf482b7f0443080656e13a5a.tar.bz2
binaryen-8ae76ea9554267a5cf482b7f0443080656e13a5a.zip
remove an unneeded param in the relooper
Diffstat (limited to 'src')
-rw-r--r--src/cfg/Relooper.cpp9
1 files changed, 5 insertions, 4 deletions
diff --git a/src/cfg/Relooper.cpp b/src/cfg/Relooper.cpp
index dbdaa5507..348c3f894 100644
--- a/src/cfg/Relooper.cpp
+++ b/src/cfg/Relooper.cpp
@@ -568,7 +568,7 @@ void Relooper::Calculate(Block *Entry) {
Solipsize(*iter, Branch::Break, Loop, InnerBlocks);
}
// Finish up
- Shape *Inner = Process(InnerBlocks, Entries, nullptr);
+ Shape *Inner = Process(InnerBlocks, Entries);
Loop->Inner = Inner;
return Loop;
}
@@ -723,7 +723,7 @@ void Relooper::Calculate(Block *Entry) {
iter = Next; // increment carefully because Solipsize can remove us
}
}
- Multiple->InnerMap[CurrEntry->Id] = Process(CurrBlocks, CurrEntries, nullptr);
+ Multiple->InnerMap[CurrEntry->Id] = Process(CurrBlocks, CurrEntries);
// If we are not fused, then our entries will actually be checked
if (!Fused) {
CurrEntry->IsCheckedMultipleEntry = true;
@@ -745,13 +745,14 @@ void Relooper::Calculate(Block *Entry) {
// The Make* functions receive a NextEntries. If they fill it with data, those are the entries for the
// ->Next block on them, and the blocks are what remains in Blocks (which Make* modify). In this way
// we avoid recursing on Next (imagine a long chain of Simples, if we recursed we could blow the stack).
- Shape *Process(BlockSet &Blocks, BlockSet& InitialEntries, Shape *Prev) {
+ Shape *Process(BlockSet &Blocks, BlockSet& InitialEntries) {
PrintDebug("Process() called\n", 0);
BlockSet *Entries = &InitialEntries;
BlockSet TempEntries[2];
int CurrTempIndex = 0;
BlockSet *NextEntries;
Shape *Ret = nullptr;
+ Shape *Prev = nullptr;
#define Make(call) \
Shape *Temp = call; \
if (Prev) Prev->Next = Temp; \
@@ -876,7 +877,7 @@ void Relooper::Calculate(Block *Entry) {
BlockSet Entries;
Entries.insert(Entry);
- Root = Analyzer(this).Process(AllBlocks, Entries, nullptr);
+ Root = Analyzer(this).Process(AllBlocks, Entries);
assert(Root);
}