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:16 +02:00
committed by r0qs
parent 9aad3688dc
commit ffb53ad8a6
2 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/libyul/DominatorTest.cpp
+2 -2
View File
@@ -69,14 +69,14 @@ protected:
std::map<std::string, size_t> _expectedDFSIndices
)
{
soltestAssert(_edges.size() > 0);
soltestAssert(!_edges.empty());
ImmediateDominatorTest* test = new ImmediateDominatorTest();
for (std::string name: _vertices)
test->vertices.insert(make_pair(name, new Vertex{name, std::vector<Vertex*>{}}));
test->entry = test->vertices[_vertices[0]];
soltestAssert(_vertices.size() > 0 && _vertices.size() == test->vertices.size());
soltestAssert(!_vertices.empty() && _vertices.size() == test->vertices.size());
test->numVertices = _vertices.size();
for (auto const& [from, to]: _edges)