From 5170f33f53e478647aa95183eeff840c2bc4ed2c Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Kamil=20=C5=9Aliwak?= Date: Fri, 11 Aug 2023 17:15:49 +0200 Subject: [PATCH] fixup! Implementation of Lengauer-Tarjan algorithm to find dominators --- test/libyul/DominatorTest.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/test/libyul/DominatorTest.cpp b/test/libyul/DominatorTest.cpp index 8c7e20390..9e80c98ad 100644 --- a/test/libyul/DominatorTest.cpp +++ b/test/libyul/DominatorTest.cpp @@ -449,16 +449,16 @@ BOOST_FIXTURE_TEST_CASE(immediate_dominator, DominatorFixture) } ); - for (ImmediateDominatorTest const* g: inputGraph) + for (ImmediateDominatorTest const* test: inputGraph) { Dominator< ImmediateDominatorTest::Vertex, ImmediateDominatorTest::ForEachVertexSuccessorTest - > dom(*g->entry, g->numVertices); + > dominatorFinder(*test->entry, test->numVertices); - for (auto [v, idx]: dom.vertexIndices()) - BOOST_CHECK(g->expectedDFSIndices.at(v.data) == idx); - BOOST_TEST(dom.immediateDominators() == g->expectedIdom); + for (auto [v, idx]: dominatorFinder.vertexIndices()) + BOOST_CHECK(test->expectedDFSIndices.at(v.data) == idx); + BOOST_TEST(dominatorFinder.immediateDominators() == test->expectedIdom); } }