28228448983

Committed 26 Jun 2026 09:06AM UTC coverage: 61.824% (+0.2%) from 61.644%

Build # 28228448983

Build Type

Pull #806

github

Committed by

web-flow

Commit Message

Merge 14f513ee8 into a0c38ffa1

Pull Request Pull Request #806: Map Collapse for Multiple targets in a neste sequence

Coverage Stats

165 of 185 new or added lines in 2 files covered. (89.19%)

844 existing lines in 25 files now uncovered.

39002 of 63086 relevant lines covered (61.82%)

977.72 hits per line

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

64.41

/sdfg/src/visualizer/visualizer.cpp

#include "sdfg/visualizer/visualizer.h"

#include <cassert>
#include <sstream>
#include <stdexcept>
#include <string>
#include <utility>
#include <vector>

#include "sdfg/data_flow/tasklet.h"
#include "sdfg/helpers/helpers.h"
#include "sdfg/structured_control_flow/block.h"
#include "sdfg/structured_control_flow/control_flow_node.h"
#include "sdfg/structured_control_flow/for.h"
#include "sdfg/structured_control_flow/if_else.h"
#include "sdfg/structured_control_flow/return.h"
#include "sdfg/structured_control_flow/sequence.h"
#include "sdfg/structured_control_flow/while.h"
#include "sdfg/structured_sdfg.h"
#include "sdfg/symbolic/symbolic.h"
#include "sdfg/types/type.h"
#include "symengine/basic.h"

namespace sdfg {
namespace visualizer {

constexpr const char* code_to_string(data_flow::TaskletCode c) {
    switch (c) {
        case data_flow::TaskletCode::assign:
            return "=";
        case data_flow::TaskletCode::int_add:
        case data_flow::TaskletCode::fp_add:
            return "+";
        case data_flow::TaskletCode::int_sub:
        case data_flow::TaskletCode::fp_sub:
            return "-";
        case data_flow::TaskletCode::int_mul:
        case data_flow::TaskletCode::fp_mul:
            return "*";
        case data_flow::TaskletCode::int_udiv:
        case data_flow::TaskletCode::int_sdiv:
        case data_flow::TaskletCode::fp_div:
            return "/";
        case data_flow::TaskletCode::int_urem:
        case data_flow::TaskletCode::int_srem:
        case data_flow::TaskletCode::fp_rem:
            return "%";
        case data_flow::TaskletCode::fp_fma:
            return "fma";
        case data_flow::TaskletCode::fp_one:
            return "of!=";
        default:
            return "?";
    };
};

std::string Visualizer::expression(const std::string expr) {
    if (this->replacements_.empty()) return expr;
    std::string res = expr;
    size_t pos1 = 0, pos2 = 0;
    for (std::pair<const std::string, const std::string> replace : this->replacements_) {
        pos2 = res.find(replace.first);
        if (pos2 == res.npos) continue;
        pos1 = 0;
        std::stringstream res_tmp;
        while (pos2 < res.npos) {
            res_tmp << res.substr(pos1, pos2 - pos1) << replace.second;
            pos1 = pos2 + replace.first.size();
            pos2 = res.find(replace.first, pos1);
        }
        if (pos1 < res.npos) res_tmp << res.substr(pos1);
        res = res_tmp.str();
    }
    return res;
}

void Visualizer::visualizeNode(const StructuredSDFG& sdfg, const structured_control_flow::ControlFlowNode& node) {
    if (auto block = dynamic_cast<const structured_control_flow::Block*>(&node)) {
        this->visualizeBlock(sdfg, *block);
        return;
    }
    if (auto sequence = dynamic_cast<const structured_control_flow::Sequence*>(&node)) {
        this->visualizeSequence(sdfg, *sequence);
        return;
    }
    if (auto if_else = dynamic_cast<const structured_control_flow::IfElse*>(&node)) {
        this->visualizeIfElse(sdfg, *if_else);
        return;
    }
    if (auto while_loop = dynamic_cast<const structured_control_flow::While*>(&node)) {
        this->visualizeWhile(sdfg, *while_loop);
        return;
    }
    if (auto loop = dynamic_cast<const structured_control_flow::For*>(&node)) {
        this->visualizeFor(sdfg, *loop);
        return;
    }
    if (auto return_node = dynamic_cast<const structured_control_flow::Return*>(&node)) {
        this->visualizeReturn(sdfg, *return_node);
        return;
    }
    if (auto break_node = dynamic_cast<const structured_control_flow::Break*>(&node)) {
        this->visualizeBreak(sdfg, *break_node);
        return;
    }
    if (auto continue_node = dynamic_cast<const structured_control_flow::Continue*>(&node)) {
        this->visualizeContinue(sdfg, *continue_node);
        return;
    }
    if (auto reduce_node = dynamic_cast<const structured_control_flow::Reduce*>(&node)) {
        this->visualizeReduce(sdfg, *reduce_node);
        return;
    }
    if (auto map_node = dynamic_cast<const structured_control_flow::Map*>(&node)) {
        this->visualizeMap(sdfg, *map_node);
        return;
    }
    throw std::runtime_error("Unsupported control flow node");
}

void Visualizer::visualizeTasklet(data_flow::Tasklet const& tasklet) {
    std::string op = code_to_string(tasklet.code());
    std::vector<std::string> arguments;
    for (size_t i = 0; i < tasklet.inputs().size(); ++i) {
        arguments.push_back(this->expression(tasklet.input(i)));
    }

    if (tasklet.code() == data_flow::TaskletCode::assign) {
        this->stream_ << arguments.at(0);
    } else if (tasklet.code() == data_flow::TaskletCode::fp_fma) {
        if (arguments.size() != 3) throw std::runtime_error("FMA requires 3 arguments");
        this->stream_ << arguments.at(0) << " * " << arguments.at(1) << " + " << arguments.at(2);
    } else {
        this->stream_ << op << "(" << helpers::join(arguments, ", ") << ")";
    }
}

void Visualizer::visualizeForBounds(
    symbolic::Symbol const& indvar,
    symbolic::Expression const& init,
    symbolic::Condition const& condition,
    symbolic::Expression const& update
) {
    this->stream_ << indvar->get_name() << " = " << this->expression(init->__str__()) << "; "
                  << this->expression(condition->__str__()) << "; " << indvar->get_name() << " = "
                  << this->expression(update->__str__());
}

std::string Visualizer::subsetRangeString(data_flow::Subset const& subset, int subIdx) {
    auto& dim = subset.at(subIdx);
    return this->expression(dim->__str__());
}

/// @brief If known, use the type to better visualize structures. Then track the type as far as it goes.
void Visualizer::visualizeSubset(data_flow::Subset const& sub, types::IType const* type, int subIdx) {
    if (static_cast<int>(sub.size()) <= subIdx) {
        return;
    }
    if (auto structure_type = dynamic_cast<const types::Structure*>(type)) {
        types::StructureDefinition const& definition = this->sdfg_.structure(structure_type->name());

        auto& memberIdx = sub.at(subIdx);
        if (!memberIdx.is_null() && SymEngine::is_a<SymEngine::Integer>(*memberIdx)) {
            this->stream_ << ".member_" << this->expression(memberIdx->__str__());
            auto& member_type = definition.member_type(SymEngine::rcp_dynamic_cast<const SymEngine::Integer>(memberIdx)
            );
            this->visualizeSubset(sub, &member_type, subIdx + 1);
        } else {
            this->stream_ << ".member[" << subsetRangeString(sub, subIdx) << "]";
            this->visualizeSubset(sub, nullptr, subIdx + 1);
        }
    } else if (auto tensor_type = dynamic_cast<const types::Tensor*>(type)) {
        auto& shape = tensor_type->shape();
        int tensor_dims = shape.size();
        int i = 0;
        while (i < tensor_dims && subIdx < sub.size()) {
            this->stream_ << "[" << subsetRangeString(sub, i) << ":" << subsetRangeString(shape, i) << "]";
            ++subIdx;
            ++i;
        }
        if (subIdx < sub.size()) {
            this->visualizeSubset(sub, &tensor_type->element_type(), subIdx);
        }
    } else if (auto array_type = dynamic_cast<const types::Array*>(type)) {
        this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";
        types::IType const& element_type = array_type->element_type();
        this->visualizeSubset(sub, &element_type, subIdx + 1);
    } else if (auto pointer_type = dynamic_cast<const types::Pointer*>(type)) {
        this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";
        const types::IType* pointee_type;
        if (pointer_type->has_pointee_type()) {
            pointee_type = &pointer_type->pointee_type();
        } else {
            auto z = symbolic::zero();
            if (!symbolic::eq(sub.at(subIdx), z)) {
                this->stream_ << "#illgl";
            }
            pointee_type = nullptr;
        }
        this->visualizeSubset(sub, pointee_type, subIdx + 1);
    } else {
        if (type == nullptr) {
            this->stream_ << "(rogue)";
        }
        this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";
        visualizeSubset(sub, nullptr, subIdx + 1);
    }
}

void Visualizer::visualize() {
    if (const auto* unstructured_sdfg = dynamic_cast<const SDFG*>(&this->sdfg_)) {
        this->visualizeSDFG(*unstructured_sdfg);
    } else if (const auto* structured_sdfg = dynamic_cast<const StructuredSDFG*>(&this->sdfg_)) {
        this->visualizeStructuredSDFG(*structured_sdfg);
    } else {
        throw InvalidSDFGException("Visualizer: Invalid SDFG type");
    }
}

} // namespace visualizer
} // namespace sdfg

1	#include "sdfg/visualizer/visualizer.h"
2
3	#include <cassert>
4	#include <sstream>
5	#include <stdexcept>
6	#include <string>
7	#include <utility>
8	#include <vector>
9
10	#include "sdfg/data_flow/tasklet.h"
11	#include "sdfg/helpers/helpers.h"
12	#include "sdfg/structured_control_flow/block.h"
13	#include "sdfg/structured_control_flow/control_flow_node.h"
14	#include "sdfg/structured_control_flow/for.h"
15	#include "sdfg/structured_control_flow/if_else.h"
16	#include "sdfg/structured_control_flow/return.h"
17	#include "sdfg/structured_control_flow/sequence.h"
18	#include "sdfg/structured_control_flow/while.h"
19	#include "sdfg/structured_sdfg.h"
20	#include "sdfg/symbolic/symbolic.h"
21	#include "sdfg/types/type.h"
22	#include "symengine/basic.h"
23
24	namespace sdfg {
25	namespace visualizer {
26
27	constexpr const char* code_to_string(data_flow::TaskletCode c) {	18✔
28	switch (c) {	18✔
29	case data_flow::TaskletCode::assign:	7✔
30	return "=";	7✔
31	case data_flow::TaskletCode::int_add:	1✔
32	case data_flow::TaskletCode::fp_add:	4✔
33	return "+";	4✔
34	case data_flow::TaskletCode::int_sub:	1✔
35	case data_flow::TaskletCode::fp_sub:	2✔
36	return "-";	2✔
37	case data_flow::TaskletCode::int_mul:	×
38	case data_flow::TaskletCode::fp_mul:	4✔
39	return "*";	4✔
40	case data_flow::TaskletCode::int_udiv:	×
41	case data_flow::TaskletCode::int_sdiv:	×
42	case data_flow::TaskletCode::fp_div:	×
43	return "/";	×
44	case data_flow::TaskletCode::int_urem:	×
45	case data_flow::TaskletCode::int_srem:	×
46	case data_flow::TaskletCode::fp_rem:	×
47	return "%";	×
48	case data_flow::TaskletCode::fp_fma:	1✔
49	return "fma";	1✔
50	case data_flow::TaskletCode::fp_one:	×
51	return "of!=";	×
52	default:	×
53	return "?";	×
54	};	18✔
55	};	×
56
57	std::string Visualizer::expression(const std::string expr) {	84✔
58	if (this->replacements_.empty()) return expr;	84✔
59	std::string res = expr;	×
60	size_t pos1 = 0, pos2 = 0;	×
61	for (std::pair<const std::string, const std::string> replace : this->replacements_) {	×
62	pos2 = res.find(replace.first);	×
63	if (pos2 == res.npos) continue;	×
64	pos1 = 0;	×
65	std::stringstream res_tmp;	×
66	while (pos2 < res.npos) {	×
67	res_tmp << res.substr(pos1, pos2 - pos1) << replace.second;	×
68	pos1 = pos2 + replace.first.size();	×
69	pos2 = res.find(replace.first, pos1);	×
70	}	×
71	if (pos1 < res.npos) res_tmp << res.substr(pos1);	×
72	res = res_tmp.str();	×
73	}	×
74	return res;	×
75	}	84✔
76
77	void Visualizer::visualizeNode(const StructuredSDFG& sdfg, const structured_control_flow::ControlFlowNode& node) {	35✔
78	if (auto block = dynamic_cast<const structured_control_flow::Block*>(&node)) {	35✔
79	this->visualizeBlock(sdfg, *block);	19✔
80	return;	19✔
81	}	19✔
82	if (auto sequence = dynamic_cast<const structured_control_flow::Sequence*>(&node)) {	16✔
83	this->visualizeSequence(sdfg, *sequence);	×
84	return;	×
85	}	×
86	if (auto if_else = dynamic_cast<const structured_control_flow::IfElse*>(&node)) {	16✔
87	this->visualizeIfElse(sdfg, *if_else);	3✔
88	return;	3✔
89	}	3✔
90	if (auto while_loop = dynamic_cast<const structured_control_flow::While*>(&node)) {	13✔
91	this->visualizeWhile(sdfg, *while_loop);	2✔
92	return;	2✔
93	}	2✔
94	if (auto loop = dynamic_cast<const structured_control_flow::For*>(&node)) {	11✔
95	this->visualizeFor(sdfg, *loop);	6✔
96	return;	6✔
97	}	6✔
98	if (auto return_node = dynamic_cast<const structured_control_flow::Return*>(&node)) {	5✔
99	this->visualizeReturn(sdfg, *return_node);	2✔
100	return;	2✔
101	}	2✔
102	if (auto break_node = dynamic_cast<const structured_control_flow::Break*>(&node)) {	3✔
103	this->visualizeBreak(sdfg, *break_node);	1✔
104	return;	1✔
105	}	1✔
106	if (auto continue_node = dynamic_cast<const structured_control_flow::Continue*>(&node)) {	2✔
107	this->visualizeContinue(sdfg, *continue_node);	1✔
108	return;	1✔
109	}	1✔
110	if (auto reduce_node = dynamic_cast<const structured_control_flow::Reduce*>(&node)) {	1✔
111	this->visualizeReduce(sdfg, *reduce_node);	1✔
112	return;	1✔
113	}	1✔
114	if (auto map_node = dynamic_cast<const structured_control_flow::Map*>(&node)) {	×
115	this->visualizeMap(sdfg, *map_node);	×
UNCOV 116	return;	×
UNCOV 117	}	×
UNCOV 118	throw std::runtime_error("Unsupported control flow node");	×
UNCOV 119	}	×
120
121	void Visualizer::visualizeTasklet(data_flow::Tasklet const& tasklet) {	18✔
122	std::string op = code_to_string(tasklet.code());	18✔
123	std::vector<std::string> arguments;	18✔
124	for (size_t i = 0; i < tasklet.inputs().size(); ++i) {	48✔
125	arguments.push_back(this->expression(tasklet.input(i)));	30✔
126	}	30✔
127
128	if (tasklet.code() == data_flow::TaskletCode::assign) {	18✔
129	this->stream_ << arguments.at(0);	7✔
130	} else if (tasklet.code() == data_flow::TaskletCode::fp_fma) {	11✔
131	if (arguments.size() != 3) throw std::runtime_error("FMA requires 3 arguments");	1✔
132	this->stream_ << arguments.at(0) << " * " << arguments.at(1) << " + " << arguments.at(2);	1✔
133	} else {	10✔
134	this->stream_ << op << "(" << helpers::join(arguments, ", ") << ")";	10✔
135	}	10✔
136	}	18✔
137
138	void Visualizer::visualizeForBounds(
139	symbolic::Symbol const& indvar,
140	symbolic::Expression const& init,
141	symbolic::Condition const& condition,
142	symbolic::Expression const& update
143	) {	7✔
144	this->stream_ << indvar->get_name() << " = " << this->expression(init->__str__()) << "; "	7✔
145	<< this->expression(condition->__str__()) << "; " << indvar->get_name() << " = "	7✔
146	<< this->expression(update->__str__());	7✔
147	}	7✔
148
149	std::string Visualizer::subsetRangeString(data_flow::Subset const& subset, int subIdx) {	27✔
150	auto& dim = subset.at(subIdx);	27✔
151	return this->expression(dim->__str__());	27✔
152	}	27✔
153
154	/// @brief If known, use the type to better visualize structures. Then track the type as far as it goes.
155	void Visualizer::visualizeSubset(data_flow::Subset const& sub, types::IType const* type, int subIdx) {	69✔
156	if (static_cast<int>(sub.size()) <= subIdx) {	69✔
157	return;	42✔
158	}	42✔
159	if (auto structure_type = dynamic_cast<const types::Structure*>(type)) {	27✔
160	types::StructureDefinition const& definition = this->sdfg_.structure(structure_type->name());	×
161
162	auto& memberIdx = sub.at(subIdx);	×
163	if (!memberIdx.is_null() && SymEngine::is_a<SymEngine::Integer>(*memberIdx)) {	×
164	this->stream_ << ".member_" << this->expression(memberIdx->__str__());	×
165	auto& member_type = definition.member_type(SymEngine::rcp_dynamic_cast<const SymEngine::Integer>(memberIdx)	×
166	);	×
167	this->visualizeSubset(sub, &member_type, subIdx + 1);	×
UNCOV 168	} else {	×
169	this->stream_ << ".member[" << subsetRangeString(sub, subIdx) << "]";	×
170	this->visualizeSubset(sub, nullptr, subIdx + 1);	×
171	}	×
172	} else if (auto tensor_type = dynamic_cast<const types::Tensor*>(type)) {	27✔
173	auto& shape = tensor_type->shape();	×
174	int tensor_dims = shape.size();	×
175	int i = 0;	×
176	while (i < tensor_dims && subIdx < sub.size()) {	×
177	this->stream_ << "[" << subsetRangeString(sub, i) << ":" << subsetRangeString(shape, i) << "]";	×
178	++subIdx;	×
179	++i;	×
UNCOV 180	}	×
UNCOV 181	if (subIdx < sub.size()) {	×
UNCOV 182	this->visualizeSubset(sub, &tensor_type->element_type(), subIdx);	×
UNCOV 183	}	×
184	} else if (auto array_type = dynamic_cast<const types::Array*>(type)) {	27✔
185	this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";	14✔
186	types::IType const& element_type = array_type->element_type();	14✔
187	this->visualizeSubset(sub, &element_type, subIdx + 1);	14✔
188	} else if (auto pointer_type = dynamic_cast<const types::Pointer*>(type)) {	14✔
189	this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";	12✔
190	const types::IType* pointee_type;	12✔
191	if (pointer_type->has_pointee_type()) {	12✔
192	pointee_type = &pointer_type->pointee_type();	9✔
193	} else {	9✔
194	auto z = symbolic::zero();	3✔
195	if (!symbolic::eq(sub.at(subIdx), z)) {	3✔
196	this->stream_ << "#illgl";	1✔
197	}	1✔
198	pointee_type = nullptr;	3✔
199	}	3✔
200	this->visualizeSubset(sub, pointee_type, subIdx + 1);	12✔
201	} else {	12✔
202	if (type == nullptr) {	1✔
203	this->stream_ << "(rogue)";	1✔
204	}	1✔
205	this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";	1✔
206	visualizeSubset(sub, nullptr, subIdx + 1);	1✔
207	}	1✔
208	}	27✔
209
210	void Visualizer::visualize() {	14✔
211	if (const auto* unstructured_sdfg = dynamic_cast<const SDFG*>(&this->sdfg_)) {	14✔
212	this->visualizeSDFG(*unstructured_sdfg);	1✔
213	} else if (const auto* structured_sdfg = dynamic_cast<const StructuredSDFG*>(&this->sdfg_)) {	13✔
214	this->visualizeStructuredSDFG(*structured_sdfg);	13✔
215	} else {	13✔
UNCOV 216	throw InvalidSDFGException("Visualizer: Invalid SDFG type");	×
UNCOV 217	}	×
218	}	14✔
219
220	} // namespace visualizer
221	} // namespace sdfg

daisytuner / docc / 28228448983

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