cerc-io/solidity
16
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:56:35 +02:00 committed by r0qs
parent ffb53ad8a6
commit 56cabdc69a
No known key found for this signature in database
GPG Key ID: 61503DBA6667276C
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
libyul/backends/evm/Dominator.h
View File

@ -211,7 +211,7 @@ public:
// Process the vertices in decreasing order of the dfs number // Process the vertices in decreasing order of the dfs number
for (auto it = m_vertex.rbegin(); it != m_vertex.rend(); ++it) for (auto it = m_vertex.rbegin(); it != m_vertex.rend(); ++it)
{ {
auto w = m_vertexIndex[*it]; Vertex const& w = m_vertexIndex[*it];
// step 3 // step 3
// NOTE: this is an optimization, i.e. performing the step 3 before step 2. // NOTE: this is an optimization, i.e. performing the step 3 before step 2.
// The goal is to process the bucket in the beginning of the loop for the vertex ``w`` // The goal is to process the bucket in the beginning of the loop for the vertex ``w``
@ -230,7 +230,7 @@ public:
); );
// step 2 // step 2
for (auto v: predecessors[w]) for (size_t v: predecessors[w])
{ {
size_t u = eval(v); size_t u = eval(v);
if (semi[u] < semi[w]) if (semi[u] < semi[w])