cerc-io/solidity
10
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-08-11 18:50:53 +02:00 committed by r0qs
parent bb55b7cfe5
commit 9aad3688dc
No known key found for this signature in database
GPG Key ID: 61503DBA6667276C
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
test/libyul/DominatorTest.cpp
View File

@ -71,20 +71,20 @@ protected:
{ {
soltestAssert(_edges.size() > 0); soltestAssert(_edges.size() > 0);
ImmediateDominatorTest* graph = new ImmediateDominatorTest(); ImmediateDominatorTest* test = new ImmediateDominatorTest();
for (std::string v: _vertices) for (std::string name: _vertices)
graph->vertices.insert(make_pair(v, new Vertex{v, std::vector<Vertex*>{}})); test->vertices.insert(make_pair(name, new Vertex{name, std::vector<Vertex*>{}}));
graph->entry = graph->vertices[_vertices[0]]; test->entry = test->vertices[_vertices[0]];
soltestAssert(_vertices.size() > 0 && _vertices.size() == graph->vertices.size()); soltestAssert(_vertices.size() > 0 && _vertices.size() == test->vertices.size());
graph->numVertices = _vertices.size(); test->numVertices = _vertices.size();
for (auto const& [from, to]: _edges) for (auto const& [from, to]: _edges)
graph->vertices[from]->successors.push_back(graph->vertices[to]); test->vertices[from]->successors.push_back(test->vertices[to]);
graph->expectedIdom = _expectedIdom; test->expectedIdom = _expectedIdom;
graph->expectedDFSIndices = _expectedDFSIndices; test->expectedDFSIndices = _expectedDFSIndices;
return graph; return test;
} }
std::map<std::string, size_t> toDFSIndices(std::map<Vertex, size_t> const& _vertexIndices) std::map<std::string, size_t> toDFSIndices(std::map<Vertex, size_t> const& _vertexIndices)