17075331967

Committed 19 Aug 2025 04:09PM UTC coverage: 63.863% (-1.7%) from 65.547%

Build # 17075331967

Build Type

Pull #202

github

Committed by

web-flow

Commit Message

Merge 20cea4cf9 into e4bd52e4f

Pull Request Pull Request #202: adds element-wise ml nodes

Run Details

94 of 506 new or added lines in 22 files covered. (18.58%)

2 existing lines in 1 file now uncovered.

9239 of 14467 relevant lines covered (63.86%)

124.6 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/leaky_relu.cpp

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

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

#include "sdfg/analysis/scope_analysis.h"

namespace sdfg {
namespace math {
namespace ml {

LeakyReLUNode::LeakyReLUNode(
    size_t element_id,
    const DebugInfo& debug_info,
    const graph::Vertex vertex,
    data_flow::DataFlowGraph& parent,
    const std::string& alpha
)
    : ElementWiseUnaryNode(element_id, debug_info, vertex, parent, LibraryNodeType_LeakyReLU, {{"alpha", alpha}}) {}

bool LeakyReLUNode::expand_operation(
    builder::StructuredSDFGBuilder& builder,
    analysis::AnalysisManager& analysis_manager,
    structured_control_flow::Sequence& body,
    const std::string& input_name,
    const std::string& output_name,
    const types::IType& input_type,
    const types::IType& output_type,
    const data_flow::Subset& subset
) {
    // Add code
    auto& code_block = builder.add_block(body);
    auto& input_node = builder.add_access(code_block, input_name);
    auto& output_node_max = builder.add_access(code_block, output_name);
    auto& output_node_mul = builder.add_access(code_block, output_name);

    // max(x, 0)
    {
        auto& tasklet = builder.add_tasklet(code_block, data_flow::TaskletCode::fma, "_out", {"0.0f", "_in"});
        builder.add_computational_memlet(code_block, input_node, tasklet, "_in", subset, input_type);
        builder.add_computational_memlet(code_block, tasklet, "_out", output_node_max, subset, output_type);
    }
    // alpha * x
    {
        auto& tasklet =
            builder.add_tasklet(code_block, data_flow::TaskletCode::mul, "_out", {this->attributes_.at("alpha"), "_in"});
        builder.add_computational_memlet(code_block, output_node_max, tasklet, "_in", subset, output_type);
        builder.add_computational_memlet(code_block, tasklet, "_out", output_node_mul, subset, output_type);
    }

    return true;
}

std::unique_ptr<data_flow::DataFlowNode> LeakyReLUNode::
    clone(size_t element_id, const graph::Vertex vertex, data_flow::DataFlowGraph& parent) const {
    return std::unique_ptr<data_flow::DataFlowNode>(
        new LeakyReLUNode(element_id, this->debug_info(), vertex, parent, this->attributes_.at("alpha"))
    );
}

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

1	#include "sdfg/data_flow/library_nodes/math/ml/leaky_relu.h"
2
3	#include "sdfg/analysis/analysis.h"
4	#include "sdfg/builder/structured_sdfg_builder.h"
5
6	#include "sdfg/analysis/scope_analysis.h"
7
8	namespace sdfg {
9	namespace math {
10	namespace ml {
11
NEW 12	LeakyReLUNode::LeakyReLUNode(	×
13	size_t element_id,
14	const DebugInfo& debug_info,
15	const graph::Vertex vertex,
16	data_flow::DataFlowGraph& parent,
17	const std::string& alpha
18	)
NEW 19	: ElementWiseUnaryNode(element_id, debug_info, vertex, parent, LibraryNodeType_LeakyReLU, {{"alpha", alpha}}) {}	×
20
NEW 21	bool LeakyReLUNode::expand_operation(	×
22	builder::StructuredSDFGBuilder& builder,
23	analysis::AnalysisManager& analysis_manager,
24	structured_control_flow::Sequence& body,
25	const std::string& input_name,
26	const std::string& output_name,
27	const types::IType& input_type,
28	const types::IType& output_type,
29	const data_flow::Subset& subset
30	) {
31	// Add code
NEW 32	auto& code_block = builder.add_block(body);	×
NEW 33	auto& input_node = builder.add_access(code_block, input_name);	×
NEW 34	auto& output_node_max = builder.add_access(code_block, output_name);	×
NEW 35	auto& output_node_mul = builder.add_access(code_block, output_name);	×
36
37	// max(x, 0)
38	{
NEW 39	auto& tasklet = builder.add_tasklet(code_block, data_flow::TaskletCode::fma, "_out", {"0.0f", "_in"});	×
NEW 40	builder.add_computational_memlet(code_block, input_node, tasklet, "_in", subset, input_type);	×
NEW 41	builder.add_computational_memlet(code_block, tasklet, "_out", output_node_max, subset, output_type);	×
42	}
43	// alpha * x
44	{
NEW 45	auto& tasklet =	×
NEW 46	builder.add_tasklet(code_block, data_flow::TaskletCode::mul, "_out", {this->attributes_.at("alpha"), "_in"});	×
NEW 47	builder.add_computational_memlet(code_block, output_node_max, tasklet, "_in", subset, output_type);	×
NEW 48	builder.add_computational_memlet(code_block, tasklet, "_out", output_node_mul, subset, output_type);	×
49	}
50
NEW 51	return true;	×
NEW 52	}	×
53
54	std::unique_ptr<data_flow::DataFlowNode> LeakyReLUNode::
NEW 55	clone(size_t element_id, const graph::Vertex vertex, data_flow::DataFlowGraph& parent) const {	×
NEW 56	return std::unique_ptr<data_flow::DataFlowNode>(	×
NEW 57	new LeakyReLUNode(element_id, this->debug_info(), vertex, parent, this->attributes_.at("alpha"))	×
58	);
NEW 59	}	×
60
61	} // namespace ml
62	} // namespace math
63	} // namespace sdfg

daisytuner / sdfglib / 17075331967

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