20241896885

Committed 15 Dec 2025 05:44PM UTC coverage: 40.075% (-0.2%) from 40.251%

Build # 20241896885

Build Type

Pull #392

github

Committed by

web-flow

Commit Message

Merge 1719a4ffa into e5e8aa90d

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

Run Details

13609 of 43928 branches covered (30.98%)

Branch coverage included in aggregate %.

26 of 47 new or added lines in 3 files covered. (55.32%)

51 existing lines in 6 files now uncovered.

11621 of 19029 relevant lines covered (61.07%)

92.92 hits per line

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

51.89

/src/visitor/structured_sdfg_visitor.cpp

#include "sdfg/visitor/structured_sdfg_visitor.h"

namespace sdfg {
namespace visitor {

StructuredSDFGVisitor::
    StructuredSDFGVisitor(builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager)
    : builder_(builder), analysis_manager_(analysis_manager) {}

bool StructuredSDFGVisitor::visit() { return this->visit_internal(builder_.subject().root()); }

bool StructuredSDFGVisitor::visit_internal(structured_control_flow::Sequence& parent) {
    if (this->accept(parent)) {
        return true;
    }

    for (size_t i = 0; i < parent.size(); i++) {
        auto& current = parent.at(i).first;

        if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(&current)) {
            if (this->accept(*block_stmt)) {
                return true;
            }
        } else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(&current)) {
            if (this->visit_internal(*sequence_stmt)) {
                return true;
            }
        } else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(&current)) {
            if (this->accept(*if_else_stmt)) {
                return true;
            }

            for (size_t i = 0; i < if_else_stmt->size(); i++) {
                if (this->visit_internal(if_else_stmt->at(i).first)) {
                    return true;
                }
            }
        } else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(&current)) {
            if (this->accept(*for_stmt)) {
                return true;
            }

            if (this->visit_internal(for_stmt->root())) {
                return true;
            }
        } else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(&current)) {
            if (this->accept(*map_stmt)) {
                return true;
            }

            if (this->visit_internal(map_stmt->root())) {
                return true;
            }
        } else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(&current)) {
            if (this->accept(*while_stmt)) {
                return true;
            }

            if (this->visit_internal(while_stmt->root())) {
                return true;
            }
        } else if (auto continue_stmt = dynamic_cast<structured_control_flow::Continue*>(&current)) {
            if (this->accept(*continue_stmt)) {
                return true;
            }
        } else if (auto break_stmt = dynamic_cast<structured_control_flow::Break*>(&current)) {
            if (this->accept(*break_stmt)) {
                return true;
            }
        } else if (auto return_stmt = dynamic_cast<structured_control_flow::Return*>(&current)) {
            if (this->accept(*return_stmt)) {
                return true;
            }
        }
    }

    return false;
};

bool StructuredSDFGVisitor::accept(structured_control_flow::Block& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::Sequence& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::Return& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::IfElse& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::While& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::Continue& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::Break& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::For& node) { return false; };

bool StructuredSDFGVisitor::accept(structured_control_flow::Map& node) { return false; };

NonStoppingStructuredSDFGVisitor::NonStoppingStructuredSDFGVisitor(
    builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager
)
    : StructuredSDFGVisitor(builder, analysis_manager), applied_(false) {}

bool NonStoppingStructuredSDFGVisitor::visit() {
    this->visit_internal(builder_.subject().root());
    return this->applied_;
}

bool NonStoppingStructuredSDFGVisitor::visit_internal(structured_control_flow::Sequence& parent) {
    applied_ |= this->accept(parent);

    for (size_t i = 0; i < parent.size(); i++) {
        auto& current = parent.at(i).first;

        if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(&current)) {
            applied_ |= this->accept(*block_stmt);
        } else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(&current)) {
            this->visit_internal(*sequence_stmt);
        } else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(&current)) {
            applied_ |= this->accept(*if_else_stmt);

            for (size_t i = 0; i < if_else_stmt->size(); i++) {
                this->visit_internal(if_else_stmt->at(i).first);
            }
        } else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(&current)) {
            applied_ |= this->accept(*for_stmt);
            this->visit_internal(for_stmt->root());
        } else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(&current)) {
            applied_ |= this->accept(*map_stmt);
            this->visit_internal(map_stmt->root());
        } else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(&current)) {
            applied_ |= this->accept(*while_stmt);
            this->visit_internal(while_stmt->root());
        } else if (auto continue_stmt = dynamic_cast<structured_control_flow::Continue*>(&current)) {
            applied_ |= this->accept(*continue_stmt);
        } else if (auto break_stmt = dynamic_cast<structured_control_flow::Break*>(&current)) {
            applied_ |= this->accept(*break_stmt);
        } else if (auto return_stmt = dynamic_cast<structured_control_flow::Return*>(&current)) {
            applied_ |= this->accept(*return_stmt);
        }
    }

    return false;
};

bool ActualStructuredSDFGVisitor::visit(sdfg::structured_control_flow::ControlFlowNode& node) { return dispatch(node); }

bool ActualStructuredSDFGVisitor::dispatch(ControlFlowNode& node) {
    //// ARGH. The most inefficient variant of them all. Is there a good way to
    if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(&node)) {
        return this->visit(*block_stmt);
    } else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(&node)) {
        return this->visit(*sequence_stmt);
    } else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(&node)) {
        return this->visit(*if_else_stmt);
    } else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(&node)) {
        return this->visit(*for_stmt);
    } else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(&node)) {
        return this->visit(*map_stmt);
    } else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(&node)) {
        return this->visit(*while_stmt);
    } else if (auto continue_stmt = dynamic_cast<structured_control_flow::Continue*>(&node)) {
        return this->visit(*continue_stmt);
    } else if (auto break_stmt = dynamic_cast<structured_control_flow::Break*>(&node)) {
        return this->visit(*break_stmt);
    } else if (auto return_stmt = dynamic_cast<structured_control_flow::Return*>(&node)) {
        return this->visit(*return_stmt);
    }

    return false;
}


ActualStructuredSDFGVisitor::ActualStructuredSDFGVisitor() {}

bool ActualStructuredSDFGVisitor::visit(Block& node) { return false; }
bool ActualStructuredSDFGVisitor::visit(Sequence& node) {
    for (int i = 0; i < node.size(); ++i) {
        visit(node.at(i).first);
    }

    return true;
}
bool ActualStructuredSDFGVisitor::visit(Return& node) { return false; }
bool ActualStructuredSDFGVisitor::visit(IfElse& node) {
    for (int i = 0; i < node.size(); ++i) {
        visit(node.at(i).first);
    }

    return true;
}
bool ActualStructuredSDFGVisitor::visit(For& node) { return handleStructuredLoop(node); }
bool ActualStructuredSDFGVisitor::visit(Map& node) { return handleStructuredLoop(node); }
bool ActualStructuredSDFGVisitor::handleStructuredLoop(StructuredLoop& loop) { return visit(loop.root()); }
bool ActualStructuredSDFGVisitor::visit(While& node) { return visit(node.root()); }
bool ActualStructuredSDFGVisitor::visit(Continue& node) { return false; }
bool ActualStructuredSDFGVisitor::visit(Break& node) { return false; }
} // namespace visitor
} // namespace sdfg

1	#include "sdfg/visitor/structured_sdfg_visitor.h"
2
3	namespace sdfg {
4	namespace visitor {
5
6	StructuredSDFGVisitor::
7	StructuredSDFGVisitor(builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager)	70✔
8	: builder_(builder), analysis_manager_(analysis_manager) {}	70✔
9
10	bool StructuredSDFGVisitor::visit() { return this->visit_internal(builder_.subject().root()); }	19✔
11
12	bool StructuredSDFGVisitor::visit_internal(structured_control_flow::Sequence& parent) {	27✔
13	if (this->accept(parent)) {	27✔
14	return true;	9✔
15	}
16
17	for (size_t i = 0; i < parent.size(); i++) {	29✔
18	auto& current = parent.at(i).first;	22✔
19
20	if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(&current)) {	22!
21	if (this->accept(*block_stmt)) {	3✔
22	return true;	1✔
23	}
24	} else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(&current)) {	21!
25	if (this->visit_internal(*sequence_stmt)) {	2✔
26	return true;	1✔
27	}
28	} else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(&current)) {	18!
29	if (this->accept(*if_else_stmt)) {	3✔
30	return true;	1✔
31	}
32
33	for (size_t i = 0; i < if_else_stmt->size(); i++) {	3✔
34	if (this->visit_internal(if_else_stmt->at(i).first)) {	1!
35	return true;	×
36	}
37	}	1✔
38	} else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(&current)) {	16!
39	if (this->accept(*for_stmt)) {	3✔
40	return true;	1✔
41	}
42
43	if (this->visit_internal(for_stmt->root())) {	2!
44	return true;	×
45	}
46	} else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(&current)) {	13!
47	if (this->accept(*map_stmt)) {	1!
48	return true;	1✔
49	}
50
UNCOV 51	if (this->visit_internal(map_stmt->root())) {	×
UNCOV 52	return true;	×
53	}
54	} else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(&current)) {	10!
55	if (this->accept(*while_stmt)) {	4✔
56	return true;	1✔
57	}
58
59	if (this->visit_internal(while_stmt->root())) {	3✔
60	return true;	2✔
61	}
62	} else if (auto continue_stmt = dynamic_cast<structured_control_flow::Continue*>(&current)) {	7!
63	if (this->accept(*continue_stmt)) {	2✔
64	return true;	1✔
65	}
66	} else if (auto break_stmt = dynamic_cast<structured_control_flow::Break*>(&current)) {	5!
67	if (this->accept(*break_stmt)) {	2✔
68	return true;	1✔
69	}
70	} else if (auto return_stmt = dynamic_cast<structured_control_flow::Return*>(&current)) {	3!
71	if (this->accept(*return_stmt)) {	2✔
72	return true;	1✔
73	}
74	}	1✔
75	}	11✔
76
77	return false;	7✔
78	};	27✔
79
80	bool StructuredSDFGVisitor::accept(structured_control_flow::Block& node) { return false; };	95✔
81
82	bool StructuredSDFGVisitor::accept(structured_control_flow::Sequence& node) { return false; };	106✔
83
84	bool StructuredSDFGVisitor::accept(structured_control_flow::Return& node) { return false; };	1✔
85
86	bool StructuredSDFGVisitor::accept(structured_control_flow::IfElse& node) { return false; };	2✔
87
88	bool StructuredSDFGVisitor::accept(structured_control_flow::While& node) { return false; };	1✔
89
90	bool StructuredSDFGVisitor::accept(structured_control_flow::Continue& node) { return false; };	1✔
91
92	bool StructuredSDFGVisitor::accept(structured_control_flow::Break& node) { return false; };	1✔
93
94	bool StructuredSDFGVisitor::accept(structured_control_flow::For& node) { return false; };	9✔
95
UNCOV 96	bool StructuredSDFGVisitor::accept(structured_control_flow::Map& node) { return false; };	×
97
98	NonStoppingStructuredSDFGVisitor::NonStoppingStructuredSDFGVisitor(	51✔
99	builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager
100	)
101	: StructuredSDFGVisitor(builder, analysis_manager), applied_(false) {}	51✔
102
103	bool NonStoppingStructuredSDFGVisitor::visit() {	51✔
104	this->visit_internal(builder_.subject().root());	51✔
105	return this->applied_;	51✔
106	}
107
108	bool NonStoppingStructuredSDFGVisitor::visit_internal(structured_control_flow::Sequence& parent) {	109✔
109	applied_ \|= this->accept(parent);	109✔
110
111	for (size_t i = 0; i < parent.size(); i++) {	263✔
112	auto& current = parent.at(i).first;	154✔
113
114	if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(&current)) {	154!
115	applied_ \|= this->accept(*block_stmt);	111✔
116	} else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(&current)) {	154!
117	this->visit_internal(*sequence_stmt);	×
118	} else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(&current)) {	43!
119	applied_ \|= this->accept(*if_else_stmt);	15✔
120
121	for (size_t i = 0; i < if_else_stmt->size(); i++) {	45✔
122	this->visit_internal(if_else_stmt->at(i).first);	30!
123	}	30✔
124	} else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(&current)) {	43!
125	applied_ \|= this->accept(*for_stmt);	16✔
126	this->visit_internal(for_stmt->root());	16✔
127	} else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(&current)) {	28!
128	applied_ \|= this->accept(*map_stmt);	12✔
129	this->visit_internal(map_stmt->root());	12✔
130	} else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(&current)) {	12!
131	applied_ \|= this->accept(*while_stmt);	×
132	this->visit_internal(while_stmt->root());	×
133	} else if (auto continue_stmt = dynamic_cast<structured_control_flow::Continue*>(&current)) {	×
134	applied_ \|= this->accept(*continue_stmt);	×
135	} else if (auto break_stmt = dynamic_cast<structured_control_flow::Break*>(&current)) {	×
136	applied_ \|= this->accept(*break_stmt);	×
137	} else if (auto return_stmt = dynamic_cast<structured_control_flow::Return*>(&current)) {	×
138	applied_ \|= this->accept(*return_stmt);	×
139	}	×
140	}	154✔
141
142	return false;	109✔
143	};	×
144
145	bool ActualStructuredSDFGVisitor::visit(sdfg::structured_control_flow::ControlFlowNode& node) { return dispatch(node); }	×
146
147	bool ActualStructuredSDFGVisitor::dispatch(ControlFlowNode& node) {	×
148	//// ARGH. The most inefficient variant of them all. Is there a good way to
149	if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(&node)) {	×
150	return this->visit(*block_stmt);	×
151	} else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(&node)) {	×
152	return this->visit(*sequence_stmt);	×
153	} else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(&node)) {	×
154	return this->visit(*if_else_stmt);	×
155	} else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(&node)) {	×
156	return this->visit(*for_stmt);	×
157	} else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(&node)) {	×
158	return this->visit(*map_stmt);	×
159	} else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(&node)) {	×
160	return this->visit(*while_stmt);	×
161	} else if (auto continue_stmt = dynamic_cast<structured_control_flow::Continue*>(&node)) {	×
162	return this->visit(*continue_stmt);	×
163	} else if (auto break_stmt = dynamic_cast<structured_control_flow::Break*>(&node)) {	×
164	return this->visit(*break_stmt);	×
165	} else if (auto return_stmt = dynamic_cast<structured_control_flow::Return*>(&node)) {	×
166	return this->visit(*return_stmt);	×
167	}
168
169	return false;	×
170	}	×
171
172
173	ActualStructuredSDFGVisitor::ActualStructuredSDFGVisitor() {}	×
174
175	bool ActualStructuredSDFGVisitor::visit(Block& node) { return false; }	×
176	bool ActualStructuredSDFGVisitor::visit(Sequence& node) {	×
177	for (int i = 0; i < node.size(); ++i) {	×
178	visit(node.at(i).first);	×
179	}	×
180
181	return true;	×
182	}
183	bool ActualStructuredSDFGVisitor::visit(Return& node) { return false; }	×
184	bool ActualStructuredSDFGVisitor::visit(IfElse& node) {	×
185	for (int i = 0; i < node.size(); ++i) {	×
186	visit(node.at(i).first);	×
187	}	×
188
189	return true;	×
190	}	×
191	bool ActualStructuredSDFGVisitor::visit(For& node) { return handleStructuredLoop(node); }	×
192	bool ActualStructuredSDFGVisitor::visit(Map& node) { return handleStructuredLoop(node); }	×
193	bool ActualStructuredSDFGVisitor::handleStructuredLoop(StructuredLoop& loop) { return visit(loop.root()); }	×
194	bool ActualStructuredSDFGVisitor::visit(While& node) { return visit(node.root()); }	×
195	bool ActualStructuredSDFGVisitor::visit(Continue& node) { return false; }	×
196	bool ActualStructuredSDFGVisitor::visit(Break& node) { return false; }	×
197	} // namespace visitor
198	} // namespace sdfg

daisytuner / sdfglib / 20241896885

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