23848280014

Committed 01 Apr 2026 12:21PM UTC coverage: 64.42% (-0.07%) from 64.49%

Build # 23848280014

Build Type

Pull #624

github

Committed by

web-flow

Commit Message

Merge 2e8bcfaf8 into 53580ad0f

Pull Request Pull Request #624: Skip redundant invalidates on perfect loop distribution

Coverage Stats

43 of 45 new or added lines in 2 files covered. (95.56%)

286 existing lines in 8 files now uncovered.

28812 of 44725 relevant lines covered (64.42%)

435.84 hits per line

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

65.64

/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/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 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(Function const& function, 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 = function.structure(structure_type->name());

        auto memberIdx = SymEngine::rcp_dynamic_cast<const SymEngine::Integer>(sub.at(subIdx));
        if (!memberIdx.is_null()) {
            this->stream_ << ".member_" << this->expression(memberIdx->__str__());
            auto& member_type = definition.member_type(memberIdx);
            this->visualizeSubset(function, sub, &member_type, subIdx + 1);
        } else {
            this->stream_ << ".member[" << subsetRangeString(sub, subIdx) << "]";
            this->visualizeSubset(function, 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(function, 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(function, 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(function, sub, pointee_type, subIdx + 1);
    } else {
        if (type == nullptr) {
            this->stream_ << "(rogue)";
        }
        this->stream_ << "[" << subsetRangeString(sub, subIdx) << "]";
        visualizeSubset(function, sub, nullptr, subIdx + 1);
    }
}

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

daisytuner / docc / 23848280014

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