20246862025

Committed 15 Dec 2025 08:43PM UTC coverage: 40.09% (-0.2%) from 40.251%

Build # 20246862025

Build Type

Pull #392

github

Committed by

web-flow

Commit Message

Merge c2c63ceb6 into e5e8aa90d

Pull Request Pull Request #392: refactors passes to improve performance

Run Details

13611 of 43926 branches covered (30.99%)

Branch coverage included in aggregate %.

102 of 141 new or added lines in 12 files covered. (72.34%)

58 existing lines in 10 files now uncovered.

11618 of 19005 relevant lines covered (61.13%)

90.79 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

83.33

/src/analysis/dominance_analysis.cpp

#include "sdfg/analysis/dominance_analysis.h"

namespace sdfg {
namespace analysis {

DominanceAnalysis::DominanceAnalysis(StructuredSDFG& sdfg) : Analysis(sdfg) {}

void DominanceAnalysis::run(AnalysisManager& analysis_manager) {
    this->dom_tree_.clear();
    this->pdom_tree_.clear();

    auto& users_analysis = analysis_manager.get<analysis::Users>();

    this->dom_tree_ = graph::dominator_tree(users_analysis.graph_, users_analysis.source_->vertex_);
    this->pdom_tree_ = graph::post_dominator_tree(users_analysis.graph_);
}

bool DominanceAnalysis::dominates(User& user1, User& user2) {
    auto dominator = this->dom_tree_.at(user2.vertex_);
    while (dominator != boost::graph_traits<graph::Graph>::null_vertex()) {
        if (dominator == user1.vertex_) {
            return true;
        }
        dominator = this->dom_tree_.at(dominator);
    }
    return false;
};

bool DominanceAnalysis::post_dominates(User& user1, User& user2) {
    auto dominator = this->pdom_tree_.at(user2.vertex_);
    while (dominator != boost::graph_traits<graph::Graph>::null_vertex()) {
        if (dominator == user1.vertex_) {
            return true;
        }
        dominator = this->pdom_tree_.at(dominator);
    }
    return false;
};

} // namespace analysis
} // namespace sdfg

1	#include "sdfg/analysis/dominance_analysis.h"
2
3	namespace sdfg {
4	namespace analysis {
5
6	DominanceAnalysis::DominanceAnalysis(StructuredSDFG& sdfg) : Analysis(sdfg) {}	124✔
7
8	void DominanceAnalysis::run(AnalysisManager& analysis_manager) {	124✔
9	this->dom_tree_.clear();	124✔
10	this->pdom_tree_.clear();	124✔
11
12	auto& users_analysis = analysis_manager.get<analysis::Users>();	124✔
13
14	this->dom_tree_ = graph::dominator_tree(users_analysis.graph_, users_analysis.source_->vertex_);	124!
15	this->pdom_tree_ = graph::post_dominator_tree(users_analysis.graph_);	124!
16	}	124✔
17
18	bool DominanceAnalysis::dominates(User& user1, User& user2) {	220✔
19	auto dominator = this->dom_tree_.at(user2.vertex_);	220✔
20	while (dominator != boost::graph_traits<graph::Graph>::null_vertex()) {	1,763!
21	if (dominator == user1.vertex_) {	1,763✔
22	return true;	220✔
23	}
24	dominator = this->dom_tree_.at(dominator);	1,543✔
25	}
UNCOV 26	return false;	×
27	};	220✔
28
29	bool DominanceAnalysis::post_dominates(User& user1, User& user2) {	6✔
30	auto dominator = this->pdom_tree_.at(user2.vertex_);	6✔
31	while (dominator != boost::graph_traits<graph::Graph>::null_vertex()) {	16!
32	if (dominator == user1.vertex_) {	16✔
33	return true;	6✔
34	}
35	dominator = this->pdom_tree_.at(dominator);	10✔
36	}
37	return false;	×
38	};	6✔
39
40	} // namespace analysis
41	} // namespace sdfg

daisytuner / sdfglib / 20246862025

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous