18558780296

Committed 16 Oct 2025 10:49AM UTC coverage: 61.233% (-0.3%) from 61.523%

Build # 18558780296

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #279 from daisytuner/ext-prefix

Separate Dominance Analysis and Codegen for Linker with Prefixes

Run Details

62 of 95 new or added lines in 26 files covered. (65.26%)

13 existing lines in 7 files now uncovered.

8981 of 14667 relevant lines covered (61.23%)

98.73 hits per line

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

62.5

/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) {}	21✔
7
8	void DominanceAnalysis::run(AnalysisManager& analysis_manager) {	21✔
9	this->dom_tree_.clear();	21✔
10	this->pdom_tree_.clear();	21✔
11
12	auto& users_analysis = analysis_manager.get<analysis::Users>();	21✔
13
14	this->dom_tree_ = graph::dominator_tree(users_analysis.graph_, users_analysis.source_->vertex_);	21✔
15	this->pdom_tree_ = graph::post_dominator_tree(users_analysis.graph_);	21✔
16	}	21✔
17
18	bool DominanceAnalysis::dominates(User& user1, User& user2) {	27✔
19	auto dominator = this->dom_tree_.at(user2.vertex_);	27✔
20	while (dominator != boost::graph_traits<graph::Graph>::null_vertex()) {	104✔
21	if (dominator == user1.vertex_) {	104✔
22	return true;	27✔
23	}
24	dominator = this->dom_tree_.at(dominator);	77✔
25	}
NEW 26	return false;	×
27	};	27✔
28
NEW 29	bool DominanceAnalysis::post_dominates(User& user1, User& user2) {	×
NEW 30	auto dominator = this->pdom_tree_.at(user2.vertex_);	×
NEW 31	while (dominator != boost::graph_traits<graph::Graph>::null_vertex()) {	×
NEW 32	if (dominator == user1.vertex_) {	×
NEW 33	return true;	×
34	}
NEW 35	dominator = this->pdom_tree_.at(dominator);	×
36	}
NEW 37	return false;	×
NEW 38	};	×
39
40	} // namespace analysis
41	} // namespace sdfg

daisytuner / sdfglib / 18558780296

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