cerc-io/solidity
11
0
Fork 0
mirror of https://github.com/ethereum/solidity synced 2023-10-03 13:03:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fixup! Implementation of Lengauer-Tarjan algorithm to find dominators

Browse Source
This commit is contained in:
Kamil Śliwak
2023-09-22 14:49:15 +02:00
committed by r0qs
parent 83583f3448
commit 66b95967e6
2 changed files with 9 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/libyul/DominatorTest.cpp
+4 -2
View File
@@ -16,6 +16,8 @@
*/
#include <libyul/backends/evm/Dominator.h>
#include <test/libsolidity/util/SoltestErrors.h>
#include <boost/test/unit_test.hpp>
using namespace solidity::yul;
@@ -64,14 +66,14 @@ protected:
std::map<std::string, size_t> _expectedDFSIndices
)
{
assert(_edges.size() > 0);
soltestAssert(_edges.size() > 0);
ImmediateDominatorTest* graph = new ImmediateDominatorTest();
for (std::string v: _vertices)
graph->vertices.insert(make_pair(v, new Vertex{v, std::vector<Vertex*>{}}));
graph->entry = graph->vertices[_vertices[0]];
assert(_vertices.size() > 0 && _vertices.size() == graph->vertices.size());
soltestAssert(_vertices.size() > 0 && _vertices.size() == graph->vertices.size());
graph->numVertices = _vertices.size();
for (auto [from, to]: _edges)