17509713032

Committed 05 Sep 2025 11:40AM UTC coverage: 59.145% (+0.09%) from 59.057%

Build # 17509713032

Build Type

push

github

Committed by

web-flow

Commit Message

Schedule type extension (#221)

* Initial Draft

* Simplify schedule type class for serialization

* string ref

* fix and = operator

Run Details

60 of 72 new or added lines in 19 files covered. (83.33%)

4 existing lines in 2 files now uncovered.

9274 of 15680 relevant lines covered (59.15%)

115.92 hits per line

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

0.0

/src/data_flow/library_nodes/math/ml/batch_normalization.cpp

#include "sdfg/data_flow/library_nodes/math/ml/batch_normalization.h"

#include "sdfg/analysis/analysis.h"
#include "sdfg/analysis/scope_analysis.h"
#include "sdfg/builder/structured_sdfg_builder.h"

namespace sdfg {
namespace math {
namespace ml {

BatchNormalizationNode::BatchNormalizationNode(
    size_t element_id,
    const DebugInfo &debug_info,
    const graph::Vertex vertex,
    data_flow::DataFlowGraph &parent,
    int axis,
    const std::string &epsilon
)
    : MathNode(
          element_id,
          debug_info,
          vertex,
          parent,
          LibraryNodeType_BatchNormalization,
          {"Y"},
          {"X", "Scale", "B", "input_mean", "input_var"},
          data_flow::ImplementationType_NONE
      ),
      axis_(axis), epsilon_(epsilon) {}

void BatchNormalizationNode::validate(const Function &) const { /* TODO */ }

bool BatchNormalizationNode::expand(builder::StructuredSDFGBuilder &builder, analysis::AnalysisManager &analysis_manager) {
    auto &dataflow = this->get_parent();
    auto &block = static_cast<structured_control_flow::Block &>(*dataflow.get_parent());

    auto &scope_analysis = analysis_manager.get<analysis::ScopeAnalysis>();
    auto &parent = static_cast<structured_control_flow::Sequence &>(*scope_analysis.parent_scope(&block));
    int index = parent.index(block);
    auto &transition = parent.at(index).second;

    // Locate edges
    const data_flow::Memlet *iedge_input = nullptr;
    const data_flow::Memlet *iedge_scale = nullptr;
    const data_flow::Memlet *iedge_bias = nullptr;
    const data_flow::Memlet *iedge_mean = nullptr;
    const data_flow::Memlet *iedge_var = nullptr;
    const data_flow::Memlet *oedge_output = nullptr;
    for (const auto &edge : dataflow.in_edges(*this)) {
        if (edge.dst_conn() == "X") {
            iedge_input = &edge;
        } else if (edge.dst_conn() == "Scale") {
            iedge_scale = &edge;
        } else if (edge.dst_conn() == "B") {
            iedge_bias = &edge;
        } else if (edge.dst_conn() == "input_mean") {
            iedge_mean = &edge;
        } else if (edge.dst_conn() == "input_var") {
            iedge_var = &edge;
        }
    }
    for (const auto &edge : dataflow.out_edges(*this)) {
        if (edge.src_conn() == "Y") {
            oedge_output = &edge;
        }
    }
    if (!iedge_input || !iedge_scale || !iedge_bias || !iedge_mean || !iedge_var || !oedge_output) return false;

    std::string input_name = static_cast<const data_flow::AccessNode &>(iedge_input->src()).data();
    std::string scale_name = static_cast<const data_flow::AccessNode &>(iedge_scale->src()).data();
    std::string bias_name = static_cast<const data_flow::AccessNode &>(iedge_bias->src()).data();
    std::string mean_name = static_cast<const data_flow::AccessNode &>(iedge_mean->src()).data();
    std::string var_name = static_cast<const data_flow::AccessNode &>(iedge_var->src()).data();
    std::string output_name = static_cast<const data_flow::AccessNode &>(oedge_output->dst()).data();

    // Create new sequence before
    auto &new_sequence = builder.add_sequence_before(parent, block, transition.assignments(), block.debug_info());
    structured_control_flow::Sequence *last_scope = &new_sequence;

    // Create maps over output subset dims (parallel dims)
    data_flow::Subset domain_begin = oedge_output->begin_subset();
    data_flow::Subset domain_end = oedge_output->end_subset();

    std::vector<symbolic::Expression> loop_syms;
    structured_control_flow::Map *last_map = nullptr;
    for (size_t d = 0; d < domain_begin.size(); ++d) {
        std::string indvar_str = builder.find_new_name("_i");
        builder.add_container(indvar_str, types::Scalar(types::PrimitiveType::UInt64));
        auto indvar = symbolic::symbol(indvar_str);
        auto init = domain_begin[d];
        auto update = symbolic::add(indvar, symbolic::one());
        auto cond = symbolic::Lt(indvar, symbolic::add(domain_end[d], symbolic::one()));
        last_map = &builder.add_map(
            *last_scope,
            indvar,
            cond,
            init,
            update,
            structured_control_flow::ScheduleType_Sequential::create(),
            {},
            block.debug_info()
        );
        last_scope = &last_map->root();
        loop_syms.push_back(indvar);
    }

    // Create normalization block
    auto &norm_block = builder.add_block(*last_scope);

    // Create access nodes for normalization
    auto &input_access_norm = builder.add_access(norm_block, input_name);
    auto &scale_access_norm = builder.add_access(norm_block, scale_name);
    auto &bias_access_norm = builder.add_access(norm_block, bias_name);
    auto &mean_access_norm = builder.add_access(norm_block, mean_name);
    auto &var_access_norm = builder.add_access(norm_block, var_name);
    auto &output_access_norm = builder.add_access(norm_block, output_name);

    // Add epsilon to variance and compute standard deviation
    auto &add_epsilon_tasklet =
        builder.add_tasklet(norm_block, data_flow::TaskletCode::add, "_out", {"_in1", epsilon_});
    auto &var_eps_access = builder.add_access(norm_block, builder.find_new_name("_var_eps"));
    builder.add_computational_memlet(
        norm_block, var_access_norm, add_epsilon_tasklet, "_in1", loop_syms, iedge_var->base_type()
    );
    builder
        .add_computational_memlet(norm_block, add_epsilon_tasklet, "_out", var_eps_access, {}, iedge_var->base_type());

    auto &sqrt_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::sqrt, "_out", {"_in"});
    auto &std_dev_access = builder.add_access(norm_block, builder.find_new_name("_std_dev"));
    builder.add_computational_memlet(norm_block, var_eps_access, sqrt_tasklet, "_in", {}, iedge_var->base_type());
    builder.add_computational_memlet(norm_block, sqrt_tasklet, "_out", std_dev_access, {}, iedge_var->base_type());

    // Normalize: (x - mean) / std_dev
    auto &sub_norm_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::sub, "_out", {"_in1", "_in2"});
    auto &centered_access = builder.add_access(norm_block, builder.find_new_name("_centered"));
    builder.add_computational_memlet(
        norm_block, input_access_norm, sub_norm_tasklet, "_in1", loop_syms, iedge_input->base_type()
    );
    builder.add_computational_memlet(
        norm_block, mean_access_norm, sub_norm_tasklet, "_in2", loop_syms, iedge_mean->base_type()
    );
    builder
        .add_computational_memlet(norm_block, sub_norm_tasklet, "_out", centered_access, {}, iedge_input->base_type());

    auto &div_norm_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::div, "_out", {"_in1", "_in2"});
    auto &normalized_access = builder.add_access(norm_block, builder.find_new_name("_normalized"));
    builder
        .add_computational_memlet(norm_block, centered_access, div_norm_tasklet, "_in1", {}, iedge_input->base_type());
    builder
        .add_computational_memlet(norm_block, std_dev_access, div_norm_tasklet, "_in2", loop_syms, iedge_var->base_type());
    builder
        .add_computational_memlet(norm_block, div_norm_tasklet, "_out", normalized_access, {}, iedge_input->base_type());

    // Apply scale and bias: scale * normalized + bias
    auto &mul_scale_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::mul, "_out", {"_in1", "_in2"});
    auto &scaled_access = builder.add_access(norm_block, builder.find_new_name("_scaled"));
    builder
        .add_computational_memlet(norm_block, normalized_access, mul_scale_tasklet, "_in1", {}, iedge_input->base_type());
    builder.add_computational_memlet(
        norm_block, scale_access_norm, mul_scale_tasklet, "_in2", loop_syms, iedge_scale->base_type()
    );
    builder.add_computational_memlet(norm_block, mul_scale_tasklet, "_out", scaled_access, {}, iedge_input->base_type());

    auto &add_bias_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::add, "_out", {"_in1", "_in2"});
    builder.add_computational_memlet(norm_block, scaled_access, add_bias_tasklet, "_in1", {}, iedge_input->base_type());
    builder.add_computational_memlet(
        norm_block, bias_access_norm, add_bias_tasklet, "_in2", loop_syms, iedge_bias->base_type()
    );
    builder.add_computational_memlet(
        norm_block, add_bias_tasklet, "_out", output_access_norm, loop_syms, oedge_output->base_type()
    );

    // Cleanup old block
    builder.remove_memlet(block, *iedge_input);
    builder.remove_memlet(block, *iedge_scale);
    if (iedge_bias) {
        builder.remove_memlet(block, *iedge_bias);
    }
    builder.remove_memlet(block, *iedge_mean);
    builder.remove_memlet(block, *iedge_var);
    builder.remove_memlet(block, *oedge_output);
    builder.remove_node(block, *this);
    builder.remove_child(parent, index + 1);

    return true;
}

std::unique_ptr<data_flow::DataFlowNode> BatchNormalizationNode::
    clone(size_t element_id, const graph::Vertex vertex, data_flow::DataFlowGraph &parent) const {
    return std::unique_ptr<data_flow::DataFlowNode>(
        new BatchNormalizationNode(element_id, this->debug_info(), vertex, parent, axis_, epsilon_)
    );
}

nlohmann::json BatchNormalizationNodeSerializer::serialize(const data_flow::LibraryNode &library_node) {
    const BatchNormalizationNode &node = static_cast<const BatchNormalizationNode &>(library_node);
    nlohmann::json j;

    j["code"] = node.code().value();
    j["axis"] = node.axis();
    j["epsilon"] = node.epsilon();

    return j;
}

data_flow::LibraryNode &BatchNormalizationNodeSerializer::deserialize(
    const nlohmann::json &j, builder::StructuredSDFGBuilder &builder, structured_control_flow::Block &parent
) {
    auto code = j["code"].get<std::string>();
    if (code != LibraryNodeType_BatchNormalization.value()) {
        throw std::runtime_error("Invalid library node code");
    }

    sdfg::serializer::JSONSerializer serializer;
    DebugInfo debug_info = serializer.json_to_debug_info(j["debug_info"]);

    auto axis = j["axis"].get<int>();
    auto epsilon = j["epsilon"].get<std::string>();

    return builder.add_library_node<BatchNormalizationNode>(parent, debug_info, axis, epsilon);
}

} // namespace ml
} // namespace math
} // namespace sdfg

1	#include "sdfg/data_flow/library_nodes/math/ml/batch_normalization.h"
2
3	#include "sdfg/analysis/analysis.h"
4	#include "sdfg/analysis/scope_analysis.h"
5	#include "sdfg/builder/structured_sdfg_builder.h"
6
7	namespace sdfg {
8	namespace math {
9	namespace ml {
10
11	BatchNormalizationNode::BatchNormalizationNode(	×
12	size_t element_id,
13	const DebugInfo &debug_info,
14	const graph::Vertex vertex,
15	data_flow::DataFlowGraph &parent,
16	int axis,
17	const std::string &epsilon
18	)
19	: MathNode(	×
20	element_id,	×
21	debug_info,	×
22	vertex,	×
23	parent,	×
24	LibraryNodeType_BatchNormalization,
25	{"Y"},	×
26	{"X", "Scale", "B", "input_mean", "input_var"},	×
27	data_flow::ImplementationType_NONE
28	),
29	axis_(axis), epsilon_(epsilon) {}	×
30
31	void BatchNormalizationNode::validate(const Function &) const { /* TODO */ }	×
32
33	bool BatchNormalizationNode::expand(builder::StructuredSDFGBuilder &builder, analysis::AnalysisManager &analysis_manager) {	×
34	auto &dataflow = this->get_parent();	×
35	auto &block = static_cast<structured_control_flow::Block &>(*dataflow.get_parent());	×
36
37	auto &scope_analysis = analysis_manager.get<analysis::ScopeAnalysis>();	×
38	auto &parent = static_cast<structured_control_flow::Sequence &>(*scope_analysis.parent_scope(&block));	×
39	int index = parent.index(block);	×
40	auto &transition = parent.at(index).second;	×
41
42	// Locate edges
43	const data_flow::Memlet *iedge_input = nullptr;	×
44	const data_flow::Memlet *iedge_scale = nullptr;	×
45	const data_flow::Memlet *iedge_bias = nullptr;	×
46	const data_flow::Memlet *iedge_mean = nullptr;	×
47	const data_flow::Memlet *iedge_var = nullptr;	×
48	const data_flow::Memlet *oedge_output = nullptr;	×
49	for (const auto &edge : dataflow.in_edges(*this)) {	×
50	if (edge.dst_conn() == "X") {	×
51	iedge_input = &edge;	×
52	} else if (edge.dst_conn() == "Scale") {	×
53	iedge_scale = &edge;	×
54	} else if (edge.dst_conn() == "B") {	×
55	iedge_bias = &edge;	×
56	} else if (edge.dst_conn() == "input_mean") {	×
57	iedge_mean = &edge;	×
58	} else if (edge.dst_conn() == "input_var") {	×
59	iedge_var = &edge;	×
60	}	×
61	}
62	for (const auto &edge : dataflow.out_edges(*this)) {	×
63	if (edge.src_conn() == "Y") {	×
64	oedge_output = &edge;	×
65	}	×
66	}
67	if (!iedge_input \|\| !iedge_scale \|\| !iedge_bias \|\| !iedge_mean \|\| !iedge_var \|\| !oedge_output) return false;	×
68
69	std::string input_name = static_cast<const data_flow::AccessNode &>(iedge_input->src()).data();	×
70	std::string scale_name = static_cast<const data_flow::AccessNode &>(iedge_scale->src()).data();	×
71	std::string bias_name = static_cast<const data_flow::AccessNode &>(iedge_bias->src()).data();	×
72	std::string mean_name = static_cast<const data_flow::AccessNode &>(iedge_mean->src()).data();	×
73	std::string var_name = static_cast<const data_flow::AccessNode &>(iedge_var->src()).data();	×
74	std::string output_name = static_cast<const data_flow::AccessNode &>(oedge_output->dst()).data();	×
75
76	// Create new sequence before
77	auto &new_sequence = builder.add_sequence_before(parent, block, transition.assignments(), block.debug_info());	×
78	structured_control_flow::Sequence *last_scope = &new_sequence;	×
79
80	// Create maps over output subset dims (parallel dims)
81	data_flow::Subset domain_begin = oedge_output->begin_subset();	×
82	data_flow::Subset domain_end = oedge_output->end_subset();	×
83
84	std::vector<symbolic::Expression> loop_syms;	×
85	structured_control_flow::Map *last_map = nullptr;	×
86	for (size_t d = 0; d < domain_begin.size(); ++d) {	×
87	std::string indvar_str = builder.find_new_name("_i");	×
88	builder.add_container(indvar_str, types::Scalar(types::PrimitiveType::UInt64));	×
89	auto indvar = symbolic::symbol(indvar_str);	×
90	auto init = domain_begin[d];	×
91	auto update = symbolic::add(indvar, symbolic::one());	×
92	auto cond = symbolic::Lt(indvar, symbolic::add(domain_end[d], symbolic::one()));	×
93	last_map = &builder.add_map(	×
94	*last_scope,	×
95	indvar,
96	cond,
97	init,
98	update,
NEW 99	structured_control_flow::ScheduleType_Sequential::create(),	×
100	{},	×
101	block.debug_info()	×
102	);
103	last_scope = &last_map->root();	×
104	loop_syms.push_back(indvar);	×
105	}	×
106
107	// Create normalization block
108	auto &norm_block = builder.add_block(*last_scope);	×
109
110	// Create access nodes for normalization
111	auto &input_access_norm = builder.add_access(norm_block, input_name);	×
112	auto &scale_access_norm = builder.add_access(norm_block, scale_name);	×
113	auto &bias_access_norm = builder.add_access(norm_block, bias_name);	×
114	auto &mean_access_norm = builder.add_access(norm_block, mean_name);	×
115	auto &var_access_norm = builder.add_access(norm_block, var_name);	×
116	auto &output_access_norm = builder.add_access(norm_block, output_name);	×
117
118	// Add epsilon to variance and compute standard deviation
119	auto &add_epsilon_tasklet =	×
120	builder.add_tasklet(norm_block, data_flow::TaskletCode::add, "_out", {"_in1", epsilon_});	×
121	auto &var_eps_access = builder.add_access(norm_block, builder.find_new_name("_var_eps"));	×
122	builder.add_computational_memlet(	×
123	norm_block, var_access_norm, add_epsilon_tasklet, "_in1", loop_syms, iedge_var->base_type()	×
124	);
125	builder	×
126	.add_computational_memlet(norm_block, add_epsilon_tasklet, "_out", var_eps_access, {}, iedge_var->base_type());	×
127
128	auto &sqrt_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::sqrt, "_out", {"_in"});	×
129	auto &std_dev_access = builder.add_access(norm_block, builder.find_new_name("_std_dev"));	×
130	builder.add_computational_memlet(norm_block, var_eps_access, sqrt_tasklet, "_in", {}, iedge_var->base_type());	×
131	builder.add_computational_memlet(norm_block, sqrt_tasklet, "_out", std_dev_access, {}, iedge_var->base_type());	×
132
133	// Normalize: (x - mean) / std_dev
134	auto &sub_norm_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::sub, "_out", {"_in1", "_in2"});	×
135	auto &centered_access = builder.add_access(norm_block, builder.find_new_name("_centered"));	×
136	builder.add_computational_memlet(	×
137	norm_block, input_access_norm, sub_norm_tasklet, "_in1", loop_syms, iedge_input->base_type()	×
138	);
139	builder.add_computational_memlet(	×
140	norm_block, mean_access_norm, sub_norm_tasklet, "_in2", loop_syms, iedge_mean->base_type()	×
141	);
142	builder	×
143	.add_computational_memlet(norm_block, sub_norm_tasklet, "_out", centered_access, {}, iedge_input->base_type());	×
144
145	auto &div_norm_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::div, "_out", {"_in1", "_in2"});	×
146	auto &normalized_access = builder.add_access(norm_block, builder.find_new_name("_normalized"));	×
147	builder	×
148	.add_computational_memlet(norm_block, centered_access, div_norm_tasklet, "_in1", {}, iedge_input->base_type());	×
149	builder	×
150	.add_computational_memlet(norm_block, std_dev_access, div_norm_tasklet, "_in2", loop_syms, iedge_var->base_type());	×
151	builder	×
152	.add_computational_memlet(norm_block, div_norm_tasklet, "_out", normalized_access, {}, iedge_input->base_type());	×
153
154	// Apply scale and bias: scale * normalized + bias
155	auto &mul_scale_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::mul, "_out", {"_in1", "_in2"});	×
156	auto &scaled_access = builder.add_access(norm_block, builder.find_new_name("_scaled"));	×
157	builder	×
158	.add_computational_memlet(norm_block, normalized_access, mul_scale_tasklet, "_in1", {}, iedge_input->base_type());	×
159	builder.add_computational_memlet(	×
160	norm_block, scale_access_norm, mul_scale_tasklet, "_in2", loop_syms, iedge_scale->base_type()	×
161	);
162	builder.add_computational_memlet(norm_block, mul_scale_tasklet, "_out", scaled_access, {}, iedge_input->base_type());	×
163
164	auto &add_bias_tasklet = builder.add_tasklet(norm_block, data_flow::TaskletCode::add, "_out", {"_in1", "_in2"});	×
165	builder.add_computational_memlet(norm_block, scaled_access, add_bias_tasklet, "_in1", {}, iedge_input->base_type());	×
166	builder.add_computational_memlet(	×
167	norm_block, bias_access_norm, add_bias_tasklet, "_in2", loop_syms, iedge_bias->base_type()	×
168	);
169	builder.add_computational_memlet(	×
170	norm_block, add_bias_tasklet, "_out", output_access_norm, loop_syms, oedge_output->base_type()	×
171	);
172
173	// Cleanup old block
174	builder.remove_memlet(block, *iedge_input);	×
175	builder.remove_memlet(block, *iedge_scale);	×
176	if (iedge_bias) {	×
177	builder.remove_memlet(block, *iedge_bias);	×
178	}	×
179	builder.remove_memlet(block, *iedge_mean);	×
180	builder.remove_memlet(block, *iedge_var);	×
181	builder.remove_memlet(block, *oedge_output);	×
182	builder.remove_node(block, *this);	×
183	builder.remove_child(parent, index + 1);	×
184
185	return true;	×
186	}	×
187
188	std::unique_ptr<data_flow::DataFlowNode> BatchNormalizationNode::
189	clone(size_t element_id, const graph::Vertex vertex, data_flow::DataFlowGraph &parent) const {	×
190	return std::unique_ptr<data_flow::DataFlowNode>(	×
191	new BatchNormalizationNode(element_id, this->debug_info(), vertex, parent, axis_, epsilon_)	×
192	);
193	}	×
194
195	nlohmann::json BatchNormalizationNodeSerializer::serialize(const data_flow::LibraryNode &library_node) {	×
196	const BatchNormalizationNode &node = static_cast<const BatchNormalizationNode &>(library_node);	×
197	nlohmann::json j;	×
198
199	j["code"] = node.code().value();	×
200	j["axis"] = node.axis();	×
201	j["epsilon"] = node.epsilon();	×
202
203	return j;	×
204	}	×
205
206	data_flow::LibraryNode &BatchNormalizationNodeSerializer::deserialize(	×
207	const nlohmann::json &j, builder::StructuredSDFGBuilder &builder, structured_control_flow::Block &parent
208	) {
209	auto code = j["code"].get<std::string>();	×
210	if (code != LibraryNodeType_BatchNormalization.value()) {	×
211	throw std::runtime_error("Invalid library node code");	×
212	}
213
214	sdfg::serializer::JSONSerializer serializer;	×
215	DebugInfo debug_info = serializer.json_to_debug_info(j["debug_info"]);	×
216
217	auto axis = j["axis"].get<int>();	×
218	auto epsilon = j["epsilon"].get<std::string>();	×
219
220	return builder.add_library_node<BatchNormalizationNode>(parent, debug_info, axis, epsilon);	×
221	}	×
222
223	} // namespace ml
224	} // namespace math
225	} // namespace sdfg

daisytuner / sdfglib / 17509713032

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