15731283590

Committed 18 Jun 2025 11:12AM UTC coverage: 64.351% (-0.2%) from 64.576%

Build # 15731283590

Build Type

Pull #86

github

Committed by

web-flow

Commit Message

Merge 99df43790 into 32b5d7ae4

Pull Request Pull Request #86: Add optimizer functionality

Run Details

144 of 227 new or added lines in 9 files covered. (63.44%)

453 existing lines in 14 files now uncovered.

8125 of 12626 relevant lines covered (64.35%)

153.57 hits per line

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

76.14

/src/analysis/assumptions_analysis.cpp

#include "sdfg/analysis/assumptions_analysis.h"

#include <utility>
#include <vector>

#include "sdfg/analysis/scope_analysis.h"
#include "sdfg/analysis/users.h"
#include "sdfg/structured_control_flow/sequence.h"
#include "sdfg/symbolic/assumptions.h"
#include "sdfg/symbolic/conjunctive_normal_form.h"
#include "sdfg/symbolic/extreme_values.h"
#include "sdfg/symbolic/polynomials.h"
#include "sdfg/symbolic/series.h"

namespace sdfg {
namespace analysis {

AssumptionsAnalysis::AssumptionsAnalysis(StructuredSDFG& sdfg)
    : Analysis(sdfg) {

      };

void AssumptionsAnalysis::visit_block(structured_control_flow::Block* block,
                                      analysis::AnalysisManager& analysis_manager) {
    return;
};

void AssumptionsAnalysis::visit_sequence(structured_control_flow::Sequence* sequence,
                                         analysis::AnalysisManager& analysis_manager) {
    return;
};

void AssumptionsAnalysis::visit_if_else(structured_control_flow::IfElse* if_else,
                                        analysis::AnalysisManager& analysis_manager) {
    auto& users = analysis_manager.get<analysis::Users>();
    for (size_t i = 0; i < if_else->size(); i++) {
        auto& scope = if_else->at(i).first;
        auto condition = if_else->at(i).second;
        auto symbols = symbolic::atoms(condition);

        // Assumption: symbols are read-only in scope
        bool read_only = true;
        analysis::UsersView scope_users(users, scope);
        for (auto& sym : symbols) {
            if (scope_users.writes(sym->get_name()).size() > 0) {
                read_only = false;
                break;
            }
        }
        if (!read_only) {
            continue;
        }

        try {
            auto cnf = symbolic::conjunctive_normal_form(condition);

            // Assumption: no or conditions
            bool has_complex_clauses = false;
            for (auto& clause : cnf) {
                if (clause.size() > 1) {
                    has_complex_clauses = true;
                    break;
                }
            }
            if (has_complex_clauses) {
                continue;
            }

            for (auto& sym : symbols) {
                symbolic::Expression ub = symbolic::infty(1);
                symbolic::Expression lb = symbolic::infty(-1);
                for (auto& clause : cnf) {
                    auto& literal = clause[0];
                    // Literal does not use symbol
                    if (!symbolic::uses(literal, sym)) {
                        continue;
                    }

                    if (SymEngine::is_a<SymEngine::Equality>(*literal)) {
                        auto eq = SymEngine::rcp_dynamic_cast<const SymEngine::Equality>(literal);
                        auto lhs = eq->get_args()[0];
                        auto rhs = eq->get_args()[1];
                        if (SymEngine::eq(*lhs, *sym) && !symbolic::uses(rhs, sym)) {
                            ub = rhs;
                            lb = rhs;
                            break;
                        } else if (SymEngine::eq(*rhs, *sym) && !symbolic::uses(lhs, sym)) {
                            ub = lhs;
                            lb = lhs;
                            break;
                        }
                    } else if (SymEngine::is_a<SymEngine::StrictLessThan>(*literal)) {
                        auto lt =
                            SymEngine::rcp_dynamic_cast<const SymEngine::StrictLessThan>(literal);
                        auto lhs = lt->get_args()[0];
                        auto rhs = lt->get_args()[1];
                        if (SymEngine::eq(*lhs, *sym) && !symbolic::uses(rhs, sym)) {
                            if (symbolic::eq(ub, symbolic::infty(1))) {
                                ub = rhs;
                            } else {
                                ub = symbolic::min(ub, rhs);
                            }
                        } else if (SymEngine::eq(*rhs, *sym) && !symbolic::uses(lhs, sym)) {
                            if (symbolic::eq(lb, symbolic::infty(-1))) {
                                lb = lhs;
                            } else {
                                lb = symbolic::max(lb, lhs);
                            }
                        }
                    } else if (SymEngine::is_a<SymEngine::LessThan>(*literal)) {
                        auto lt = SymEngine::rcp_dynamic_cast<const SymEngine::LessThan>(literal);
                        auto lhs = lt->get_args()[0];
                        auto rhs = lt->get_args()[1];
                        if (SymEngine::eq(*lhs, *sym) && !symbolic::uses(rhs, sym)) {
                            if (symbolic::eq(ub, symbolic::infty(1))) {
                                ub = rhs;
                            } else {
                                ub = symbolic::min(ub, rhs);
                            }
                        } else if (SymEngine::eq(*rhs, *sym) && !symbolic::uses(lhs, sym)) {
                            if (symbolic::eq(lb, symbolic::infty(-1))) {
                                lb = lhs;
                            } else {
                                lb = symbolic::max(lb, lhs);
                            }
                        }
                    }
                }

                // Failed to infer anything
                if (symbolic::eq(ub, symbolic::infty(1)) && symbolic::eq(lb, symbolic::infty(-1))) {
                    continue;
                }

                if (this->assumptions_.find(&scope) == this->assumptions_.end()) {
                    this->assumptions_.insert({&scope, symbolic::Assumptions()});
                }
                auto& scope_assumptions = this->assumptions_[&scope];
                if (scope_assumptions.find(sym) == scope_assumptions.end()) {
                    scope_assumptions.insert({sym, symbolic::Assumption(sym)});
                }

                if (!symbolic::eq(ub, symbolic::infty(1))) {
                    scope_assumptions[sym].upper_bound(ub);
                }
                if (!symbolic::eq(lb, symbolic::infty(-1))) {
                    scope_assumptions[sym].lower_bound(lb);
                }
            }
        } catch (const symbolic::CNFException& e) {
            continue;
        }
    }
};

void AssumptionsAnalysis::visit_while(structured_control_flow::While* while_loop,
                                      analysis::AnalysisManager& analysis_manager) {
    return;
};

void AssumptionsAnalysis::visit_for(structured_control_flow::For* for_loop,
                                    analysis::AnalysisManager& analysis_manager) {
    auto& assums = this->get(*for_loop);

    // Prove that update is monotonic
    auto indvar = for_loop->indvar();
    auto update = for_loop->update();
    if (!symbolic::is_monotonic(update, indvar, assums)) {
        return;
    }

    // Add new assumptions
    auto& body = for_loop->root();
    if (this->assumptions_.find(&body) == this->assumptions_.end()) {
        this->assumptions_.insert({&body, symbolic::Assumptions()});
    }
    auto& body_assumptions = this->assumptions_[&body];
    if (body_assumptions.find(indvar) == body_assumptions.end()) {
        body_assumptions.insert({indvar, symbolic::Assumption(indvar)});
    }

    // monotonic => init is lower bound
    body_assumptions[indvar].lower_bound(for_loop->init());
    try {
        auto cnf = symbolic::conjunctive_normal_form(for_loop->condition());
        auto ub = symbolic::upper_bound(cnf, indvar);
        if (ub == SymEngine::null) {
            return;
        }
        body_assumptions[indvar].upper_bound(ub);
    } catch (const symbolic::CNFException& e) {
        return;
    }
}

void AssumptionsAnalysis::visit_map(structured_control_flow::Map* map,
                                    analysis::AnalysisManager& analysis_manager) {
    auto indvar = map->indvar();

    auto& body = map->root();
    if (this->assumptions_.find(&body) == this->assumptions_.end()) {
        this->assumptions_.insert({&body, symbolic::Assumptions()});
    }
    auto& body_assumptions = this->assumptions_[&body];
    if (body_assumptions.find(indvar) == body_assumptions.end()) {
        body_assumptions.insert({indvar, symbolic::Assumption(indvar)});
    }
    body_assumptions[indvar].lower_bound(symbolic::zero());
    body_assumptions[indvar].upper_bound(symbolic::sub(map->num_iterations(), symbolic::one()));
};

void AssumptionsAnalysis::traverse(structured_control_flow::Sequence& root,
                                   analysis::AnalysisManager& analysis_manager) {
    std::list<structured_control_flow::ControlFlowNode*> queue = {&root};
    while (!queue.empty()) {
        auto current = queue.front();
        queue.pop_front();

        if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(current)) {
            this->visit_block(block_stmt, analysis_manager);
        } else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(current)) {
            this->visit_sequence(sequence_stmt, analysis_manager);
            for (size_t i = 0; i < sequence_stmt->size(); i++) {
                queue.push_back(&sequence_stmt->at(i).first);
            }
        } else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(current)) {
            this->visit_if_else(if_else_stmt, analysis_manager);
            for (size_t i = 0; i < if_else_stmt->size(); i++) {
                queue.push_back(&if_else_stmt->at(i).first);
            }
        } else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(current)) {
            this->visit_while(while_stmt, analysis_manager);
            queue.push_back(&while_stmt->root());
        } else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(current)) {
            this->visit_for(for_stmt, analysis_manager);
            queue.push_back(&for_stmt->root());
        } else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(current)) {
            this->visit_map(map_stmt, analysis_manager);
            queue.push_back(&map_stmt->root());
        }
    }
};

void AssumptionsAnalysis::run(analysis::AnalysisManager& analysis_manager) {
    this->assumptions_.clear();

    // Add sdfg assumptions
    this->assumptions_.insert({&sdfg_.root(), symbolic::Assumptions()});

    // Add additional assumptions
    for (auto& entry : this->additional_assumptions_) {
        this->assumptions_[&sdfg_.root()][entry.first] = entry.second;
    }

    // Forward propagate for each node
    this->traverse(sdfg_.root(), analysis_manager);
};

const symbolic::Assumptions AssumptionsAnalysis::get(structured_control_flow::ControlFlowNode& node,
                                                     bool include_trivial_bounds) {
    // Compute assumptions on the fly

    // Node-level assumptions
    symbolic::Assumptions assums;
    if (this->assumptions_.find(&node) != this->assumptions_.end()) {
        for (auto& entry : this->assumptions_[&node]) {
            assums.insert({entry.first, entry.second});
        }
    }

    AnalysisManager manager(this->sdfg_);
    auto& scope_analysis = manager.get<ScopeAnalysis>();

    auto scope = scope_analysis.parent_scope(&node);
    while (scope != nullptr) {
        // Don't overwrite lower scopes' assumptions
        if (this->assumptions_.find(scope) != this->assumptions_.end()) {
            for (auto& entry : this->assumptions_[scope]) {
                if (assums.find(entry.first) == assums.end()) {
                    assums.insert({entry.first, entry.second});
                }
            }
        }
        scope = scope_analysis.parent_scope(scope);
    }

    if (include_trivial_bounds) {
        for (auto& entry : sdfg_.assumptions()) {
            if (assums.find(entry.first) == assums.end()) {
                assums.insert({entry.first, entry.second});
            }
        }
    }

    return assums;
};

}  // namespace analysis
}  // namespace sdfg

1	#include "sdfg/analysis/assumptions_analysis.h"
2
3	#include <utility>
4	#include <vector>
5
6	#include "sdfg/analysis/scope_analysis.h"
7	#include "sdfg/analysis/users.h"
8	#include "sdfg/structured_control_flow/sequence.h"
9	#include "sdfg/symbolic/assumptions.h"
10	#include "sdfg/symbolic/conjunctive_normal_form.h"
11	#include "sdfg/symbolic/extreme_values.h"
12	#include "sdfg/symbolic/polynomials.h"
13	#include "sdfg/symbolic/series.h"
14
15	namespace sdfg {
16	namespace analysis {
17
18	AssumptionsAnalysis::AssumptionsAnalysis(StructuredSDFG& sdfg)	378✔
19	: Analysis(sdfg) {	189✔
20
21	};	189✔
22
23	void AssumptionsAnalysis::visit_block(structured_control_flow::Block* block,	247✔
24	analysis::AnalysisManager& analysis_manager) {
25	return;	247✔
26	};
27
28	void AssumptionsAnalysis::visit_sequence(structured_control_flow::Sequence* sequence,	498✔
29	analysis::AnalysisManager& analysis_manager) {
30	return;	498✔
31	};
32
33	void AssumptionsAnalysis::visit_if_else(structured_control_flow::IfElse* if_else,	8✔
34	analysis::AnalysisManager& analysis_manager) {
35	auto& users = analysis_manager.get<analysis::Users>();	8✔
36	for (size_t i = 0; i < if_else->size(); i++) {	20✔
37	auto& scope = if_else->at(i).first;	12✔
38	auto condition = if_else->at(i).second;	12✔
39	auto symbols = symbolic::atoms(condition);	12✔
40
41	// Assumption: symbols are read-only in scope
42	bool read_only = true;	12✔
43	analysis::UsersView scope_users(users, scope);	12✔
44	for (auto& sym : symbols) {	29✔
45	if (scope_users.writes(sym->get_name()).size() > 0) {	17✔
46	read_only = false;	×
47	break;	×
48	}
49	}
50	if (!read_only) {	12✔
51	continue;	×
52	}
53
54	try {
55	auto cnf = symbolic::conjunctive_normal_form(condition);	12✔
56
57	// Assumption: no or conditions
58	bool has_complex_clauses = false;	12✔
59	for (auto& clause : cnf) {	25✔
60	if (clause.size() > 1) {	13✔
61	has_complex_clauses = true;	×
62	break;	×
63	}
64	}
65	if (has_complex_clauses) {	12✔
66	continue;	×
67	}
68
69	for (auto& sym : symbols) {	29✔
70	symbolic::Expression ub = symbolic::infty(1);	17✔
71	symbolic::Expression lb = symbolic::infty(-1);	17✔
72	for (auto& clause : cnf) {	29✔
73	auto& literal = clause[0];	20✔
74	// Literal does not use symbol
75	if (!symbolic::uses(literal, sym)) {	20✔
76	continue;	2✔
77	}
78
79	if (SymEngine::is_a<SymEngine::Equality>(*literal)) {	18✔
80	auto eq = SymEngine::rcp_dynamic_cast<const SymEngine::Equality>(literal);	8✔
81	auto lhs = eq->get_args()[0];	8✔
82	auto rhs = eq->get_args()[1];	8✔
83	if (SymEngine::eq(lhs, sym) && !symbolic::uses(rhs, sym)) {	8✔
84	ub = rhs;	2✔
85	lb = rhs;	2✔
86	break;	2✔
87	} else if (SymEngine::eq(rhs, sym) && !symbolic::uses(lhs, sym)) {	6✔
88	ub = lhs;	6✔
89	lb = lhs;	6✔
90	break;	6✔
91	}
92	} else if (SymEngine::is_a<SymEngine::StrictLessThan>(*literal)) {	18✔
93	auto lt =
94	SymEngine::rcp_dynamic_cast<const SymEngine::StrictLessThan>(literal);	6✔
95	auto lhs = lt->get_args()[0];	6✔
96	auto rhs = lt->get_args()[1];	6✔
97	if (SymEngine::eq(lhs, sym) && !symbolic::uses(rhs, sym)) {	6✔
98	if (symbolic::eq(ub, symbolic::infty(1))) {	3✔
99	ub = rhs;	3✔
100	} else {	3✔
101	ub = symbolic::min(ub, rhs);	×
102	}
103	} else if (SymEngine::eq(rhs, sym) && !symbolic::uses(lhs, sym)) {	6✔
104	if (symbolic::eq(lb, symbolic::infty(-1))) {	3✔
105	lb = lhs;	3✔
106	} else {	3✔
107	lb = symbolic::max(lb, lhs);	×
108	}
109	}	3✔
110	} else if (SymEngine::is_a<SymEngine::LessThan>(*literal)) {	10✔
111	auto lt = SymEngine::rcp_dynamic_cast<const SymEngine::LessThan>(literal);	×
112	auto lhs = lt->get_args()[0];	×
113	auto rhs = lt->get_args()[1];	×
114	if (SymEngine::eq(lhs, sym) && !symbolic::uses(rhs, sym)) {	×
115	if (symbolic::eq(ub, symbolic::infty(1))) {	×
116	ub = rhs;	×
117	} else {	×
118	ub = symbolic::min(ub, rhs);	×
119	}
120	} else if (SymEngine::eq(rhs, sym) && !symbolic::uses(lhs, sym)) {	×
121	if (symbolic::eq(lb, symbolic::infty(-1))) {	×
122	lb = lhs;	×
123	} else {	×
124	lb = symbolic::max(lb, lhs);	×
125	}
126	}	×
127	}	×
128	}
129
130	// Failed to infer anything
131	if (symbolic::eq(ub, symbolic::infty(1)) && symbolic::eq(lb, symbolic::infty(-1))) {	23✔
132	continue;	4✔
133	}
134
135	if (this->assumptions_.find(&scope) == this->assumptions_.end()) {	13✔
136	this->assumptions_.insert({&scope, symbolic::Assumptions()});	8✔
137	}	8✔
138	auto& scope_assumptions = this->assumptions_[&scope];	13✔
139	if (scope_assumptions.find(sym) == scope_assumptions.end()) {	13✔
140	scope_assumptions.insert({sym, symbolic::Assumption(sym)});	13✔
141	}	13✔
142
143	if (!symbolic::eq(ub, symbolic::infty(1))) {	13✔
144	scope_assumptions[sym].upper_bound(ub);	11✔
145	}	11✔
146	if (!symbolic::eq(lb, symbolic::infty(-1))) {	13✔
147	scope_assumptions[sym].lower_bound(lb);	11✔
148	}	11✔
149	}	17✔
150	} catch (const symbolic::CNFException& e) {	12✔
151	continue;
152	}	×
153	}	12✔
154	};	8✔
155
156	void AssumptionsAnalysis::visit_while(structured_control_flow::While* while_loop,	×
157	analysis::AnalysisManager& analysis_manager) {
158	return;	×
159	};
160
161	void AssumptionsAnalysis::visit_for(structured_control_flow::For* for_loop,	297✔
162	analysis::AnalysisManager& analysis_manager) {
163	auto& assums = this->get(*for_loop);	297✔
164
165	// Prove that update is monotonic
166	auto indvar = for_loop->indvar();	297✔
167	auto update = for_loop->update();	297✔
168	if (!symbolic::is_monotonic(update, indvar, assums)) {	297✔
UNCOV 169	return;	×
170	}
171
172	// Add new assumptions
173	auto& body = for_loop->root();	297✔
174	if (this->assumptions_.find(&body) == this->assumptions_.end()) {	297✔
175	this->assumptions_.insert({&body, symbolic::Assumptions()});	297✔
176	}	297✔
177	auto& body_assumptions = this->assumptions_[&body];	297✔
178	if (body_assumptions.find(indvar) == body_assumptions.end()) {	297✔
179	body_assumptions.insert({indvar, symbolic::Assumption(indvar)});	297✔
180	}	297✔
181
182	// monotonic => init is lower bound
183	body_assumptions[indvar].lower_bound(for_loop->init());	297✔
184	try {
185	auto cnf = symbolic::conjunctive_normal_form(for_loop->condition());	297✔
186	auto ub = symbolic::upper_bound(cnf, indvar);	297✔
187	if (ub == SymEngine::null) {	297✔
188	return;	5✔
189	}
190	body_assumptions[indvar].upper_bound(ub);	292✔
191	} catch (const symbolic::CNFException& e) {	297✔
192	return;
193	}	×
194	}	297✔
195
196	void AssumptionsAnalysis::visit_map(structured_control_flow::Map* map,	×
197	analysis::AnalysisManager& analysis_manager) {
198	auto indvar = map->indvar();	×
199
200	auto& body = map->root();	×
201	if (this->assumptions_.find(&body) == this->assumptions_.end()) {	×
202	this->assumptions_.insert({&body, symbolic::Assumptions()});	×
203	}	×
204	auto& body_assumptions = this->assumptions_[&body];	×
205	if (body_assumptions.find(indvar) == body_assumptions.end()) {	×
206	body_assumptions.insert({indvar, symbolic::Assumption(indvar)});	×
207	}	×
208	body_assumptions[indvar].lower_bound(symbolic::zero());	×
209	body_assumptions[indvar].upper_bound(symbolic::sub(map->num_iterations(), symbolic::one()));	×
210	};	×
211
212	void AssumptionsAnalysis::traverse(structured_control_flow::Sequence& root,	189✔
213	analysis::AnalysisManager& analysis_manager) {
214	std::list<structured_control_flow::ControlFlowNode*> queue = {&root};	189✔
215	while (!queue.empty()) {	1,239✔
216	auto current = queue.front();	1,050✔
217	queue.pop_front();	1,050✔
218
219	if (auto block_stmt = dynamic_cast<structured_control_flow::Block*>(current)) {	1,050✔
220	this->visit_block(block_stmt, analysis_manager);	247✔
221	} else if (auto sequence_stmt = dynamic_cast<structured_control_flow::Sequence*>(current)) {	1,050✔
222	this->visit_sequence(sequence_stmt, analysis_manager);	498✔
223	for (size_t i = 0; i < sequence_stmt->size(); i++) {	1,050✔
224	queue.push_back(&sequence_stmt->at(i).first);	552✔
225	}	552✔
226	} else if (auto if_else_stmt = dynamic_cast<structured_control_flow::IfElse*>(current)) {	803✔
227	this->visit_if_else(if_else_stmt, analysis_manager);	8✔
228	for (size_t i = 0; i < if_else_stmt->size(); i++) {	20✔
229	queue.push_back(&if_else_stmt->at(i).first);	12✔
230	}	12✔
231	} else if (auto while_stmt = dynamic_cast<structured_control_flow::While*>(current)) {	305✔
232	this->visit_while(while_stmt, analysis_manager);	×
233	queue.push_back(&while_stmt->root());	×
234	} else if (auto for_stmt = dynamic_cast<structured_control_flow::For*>(current)) {	297✔
235	this->visit_for(for_stmt, analysis_manager);	297✔
236	queue.push_back(&for_stmt->root());	297✔
237	} else if (auto map_stmt = dynamic_cast<structured_control_flow::Map*>(current)) {	297✔
238	this->visit_map(map_stmt, analysis_manager);	×
239	queue.push_back(&map_stmt->root());	×
240	}	×
241	}
242	};	189✔
243
244	void AssumptionsAnalysis::run(analysis::AnalysisManager& analysis_manager) {	189✔
245	this->assumptions_.clear();	189✔
246
247	// Add sdfg assumptions
248	this->assumptions_.insert({&sdfg_.root(), symbolic::Assumptions()});	189✔
249
250	// Add additional assumptions
251	for (auto& entry : this->additional_assumptions_) {	189✔
252	this->assumptions_[&sdfg_.root()][entry.first] = entry.second;	×
253	}
254
255	// Forward propagate for each node
256	this->traverse(sdfg_.root(), analysis_manager);	189✔
257	};	189✔
258
259	const symbolic::Assumptions AssumptionsAnalysis::get(structured_control_flow::ControlFlowNode& node,	566✔
260	bool include_trivial_bounds) {
261	// Compute assumptions on the fly
262
263	// Node-level assumptions
264	symbolic::Assumptions assums;	566✔
265	if (this->assumptions_.find(&node) != this->assumptions_.end()) {	566✔
266	for (auto& entry : this->assumptions_[&node]) {	192✔
267	assums.insert({entry.first, entry.second});	96✔
268	}
269	}	96✔
270
271	AnalysisManager manager(this->sdfg_);	566✔
272	auto& scope_analysis = manager.get<ScopeAnalysis>();	566✔
273
274	auto scope = scope_analysis.parent_scope(&node);	566✔
275	while (scope != nullptr) {	1,896✔
276	// Don't overwrite lower scopes' assumptions
277	if (this->assumptions_.find(scope) != this->assumptions_.end()) {	1,330✔
278	for (auto& entry : this->assumptions_[scope]) {	1,239✔
279	if (assums.find(entry.first) == assums.end()) {	339✔
280	assums.insert({entry.first, entry.second});	339✔
281	}	339✔
282	}
283	}	900✔
284	scope = scope_analysis.parent_scope(scope);	1,330✔
285	}
286
287	if (include_trivial_bounds) {	566✔
288	for (auto& entry : sdfg_.assumptions()) {	1,194✔
289	if (assums.find(entry.first) == assums.end()) {	931✔
290	assums.insert({entry.first, entry.second});	686✔
291	}	686✔
292	}
293	}	263✔
294
295	return assums;	566✔
296	};	566✔
297
298	} // namespace analysis
299	} // namespace sdfg

daisytuner / sdfglib / 15731283590

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