diff options
author | Alon Zakai <alonzakai@gmail.com> | 2017-10-11 10:12:43 -0700 |
---|---|---|
committer | GitHub <noreply@github.com> | 2017-10-11 10:12:43 -0700 |
commit | 69408e62ee1909c09a9a1a87616b3d0f6a8329e5 (patch) | |
tree | 4f38411ebaf6c4a7678dea01cb767e914e871161 /src | |
parent | d11d8743a74e5f0651c2492454ecd636edc18b2f (diff) | |
download | binaryen-69408e62ee1909c09a9a1a87616b3d0f6a8329e5.tar.gz binaryen-69408e62ee1909c09a9a1a87616b3d0f6a8329e5.tar.bz2 binaryen-69408e62ee1909c09a9a1a87616b3d0f6a8329e5.zip |
fix re-reloop fuzz bug, we need to ensure a terminator in all relooper blocks (#1214)
Diffstat (limited to 'src')
-rw-r--r-- | src/cfg/Relooper.h | 2 | ||||
-rw-r--r-- | src/passes/ReReloop.cpp | 31 |
2 files changed, 33 insertions, 0 deletions
diff --git a/src/cfg/Relooper.h b/src/cfg/Relooper.h index 50f40fd88..f12ed2945 100644 --- a/src/cfg/Relooper.h +++ b/src/cfg/Relooper.h @@ -136,6 +136,7 @@ struct InsertOrderedSet } size_t size() const { return Map.size(); } + bool empty() const { return Map.empty(); } void clear() { Map.clear(); @@ -194,6 +195,7 @@ struct InsertOrderedMap } size_t size() const { return Map.size(); } + bool empty() const { return Map.empty(); } size_t count(const Key& k) const { return Map.count(k); } InsertOrderedMap() {} diff --git a/src/passes/ReReloop.cpp b/src/passes/ReReloop.cpp index 7e202b002..c36363ba9 100644 --- a/src/passes/ReReloop.cpp +++ b/src/passes/ReReloop.cpp @@ -30,6 +30,10 @@ #include "cfg/Relooper.h" #include "ast_utils.h" +#ifdef RERELOOP_DEBUG +#include <wasm-printing.h> +#endif + namespace wasm { struct ReReloop final : public Pass { @@ -307,6 +311,33 @@ struct ReReloop final : public Pass { } // finish the current block finishBlock(); + // blocks that do not have any exits are dead ends in the relooper. we need + // to make sure that are in fact dead ends, and do not flow control anywhere. + // add a return as needed + for (auto* cfgBlock : relooper.Blocks) { + auto* block = cfgBlock->Code->cast<Block>(); + if (cfgBlock->BranchesOut.empty() && block->type != unreachable) { + block->list.push_back( + function->result == none ? (Expression*)builder->makeReturn() + : (Expression*)builder->makeUnreachable() + ); + block->finalize(); + } + } +#ifdef RERELOOP_DEBUG + std::cout << "rerelooping " << function->name << '\n'; + for (auto* block : relooper.Blocks) { + std::cout << block << " block:\n" << block->Code << '\n'; + for (auto& pair : block->BranchesOut) { + auto* target = pair.first; + auto* branch = pair.second; + std::cout << "branch to " << target << "\n"; + if (branch->Condition) { + std::cout << " with condition\n" << branch->Condition << '\n'; + } + } + } +#endif // run the relooper to recreate control flow relooper.Calculate(entry); // render |