20770413849

Committed 06 Jan 2026 10:50PM UTC coverage: 62.168% (+21.4%) from 40.764%

Build # 20770413849

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #433 from daisytuner/clang-coverage

updates clang coverage flags

Run Details

14988 of 24109 relevant lines covered (62.17%)

88.57 hits per line

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

72.22

/src/data_flow/library_nodes/math/tensor/elementwise_ops/add_node.cpp

#include "sdfg/data_flow/library_nodes/math/tensor/elementwise_ops/add_node.h"

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

#include "sdfg/analysis/scope_analysis.h"

namespace sdfg {
namespace math {
namespace tensor {

AddNode::AddNode(
    size_t element_id,
    const DebugInfo& debug_info,
    const graph::Vertex vertex,
    data_flow::DataFlowGraph& parent,
    const std::vector<symbolic::Expression>& shape
)
    : ElementWiseBinaryNode(element_id, debug_info, vertex, parent, LibraryNodeType_Add, shape) {}

bool AddNode::expand_operation(
    builder::StructuredSDFGBuilder& builder,
    analysis::AnalysisManager& analysis_manager,
    structured_control_flow::Sequence& body,
    const std::string& input_name_a,
    const std::string& input_name_b,
    const std::string& output_name,
    const types::IType& input_type_a,
    const types::IType& input_type_b,
    const types::IType& output_type,
    const data_flow::Subset& subset
) {
    // Add code
    auto& code_block = builder.add_block(body);
    data_flow::AccessNode* input_node_a;
    if (builder.subject().exists(input_name_a)) {
        input_node_a = &builder.add_access(code_block, input_name_a);
    } else {
        input_node_a = &builder.add_constant(code_block, input_name_a, input_type_a);
    }
    data_flow::AccessNode* input_node_b;
    if (builder.subject().exists(input_name_b)) {
        input_node_b = &builder.add_access(code_block, input_name_b);
    } else {
        input_node_b = &builder.add_constant(code_block, input_name_b, input_type_b);
    }
    auto& output_node = builder.add_access(code_block, output_name);

    bool is_int = types::is_integer(output_type.primitive_type());
    data_flow::TaskletCode opcode = is_int ? data_flow::TaskletCode::int_add : data_flow::TaskletCode::fp_add;

    auto& tasklet = builder.add_tasklet(code_block, opcode, "_out", {"_in1", "_in2"});

    if (input_type_a.type_id() == types::TypeID::Scalar) {
        builder.add_computational_memlet(code_block, *input_node_a, tasklet, "_in1", {}, input_type_a);
    } else {
        builder.add_computational_memlet(code_block, *input_node_a, tasklet, "_in1", subset, input_type_a);
    }
    if (input_type_b.type_id() == types::TypeID::Scalar) {
        builder.add_computational_memlet(code_block, *input_node_b, tasklet, "_in2", {}, input_type_b);
    } else {
        builder.add_computational_memlet(code_block, *input_node_b, tasklet, "_in2", subset, input_type_b);
    }
    builder.add_computational_memlet(code_block, tasklet, "_out", output_node, subset, output_type);

    return true;
}

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

} // namespace tensor
} // namespace math
} // namespace sdfg

1	#include "sdfg/data_flow/library_nodes/math/tensor/elementwise_ops/add_node.h"
2
3	#include "sdfg/analysis/analysis.h"
4	#include "sdfg/builder/structured_sdfg_builder.h"
5	#include "sdfg/types/type.h"
6
7	#include "sdfg/analysis/scope_analysis.h"
8
9	namespace sdfg {
10	namespace math {
11	namespace tensor {
12
13	AddNode::AddNode(
14	size_t element_id,
15	const DebugInfo& debug_info,
16	const graph::Vertex vertex,
17	data_flow::DataFlowGraph& parent,
18	const std::vector<symbolic::Expression>& shape
19	)
20	: ElementWiseBinaryNode(element_id, debug_info, vertex, parent, LibraryNodeType_Add, shape) {}	8✔
21
22	bool AddNode::expand_operation(
23	builder::StructuredSDFGBuilder& builder,
24	analysis::AnalysisManager& analysis_manager,
25	structured_control_flow::Sequence& body,
26	const std::string& input_name_a,
27	const std::string& input_name_b,
28	const std::string& output_name,
29	const types::IType& input_type_a,
30	const types::IType& input_type_b,
31	const types::IType& output_type,
32	const data_flow::Subset& subset
33	) {	6✔
34	// Add code
35	auto& code_block = builder.add_block(body);	6✔
36	data_flow::AccessNode* input_node_a;	6✔
37	if (builder.subject().exists(input_name_a)) {	6✔
38	input_node_a = &builder.add_access(code_block, input_name_a);	6✔
39	} else {	6✔
40	input_node_a = &builder.add_constant(code_block, input_name_a, input_type_a);	×
41	}	×
42	data_flow::AccessNode* input_node_b;	6✔
43	if (builder.subject().exists(input_name_b)) {	6✔
44	input_node_b = &builder.add_access(code_block, input_name_b);	6✔
45	} else {	6✔
46	input_node_b = &builder.add_constant(code_block, input_name_b, input_type_b);	×
47	}	×
48	auto& output_node = builder.add_access(code_block, output_name);	6✔
49
50	bool is_int = types::is_integer(output_type.primitive_type());	6✔
51	data_flow::TaskletCode opcode = is_int ? data_flow::TaskletCode::int_add : data_flow::TaskletCode::fp_add;	6✔
52
53	auto& tasklet = builder.add_tasklet(code_block, opcode, "_out", {"_in1", "_in2"});	6✔
54
55	if (input_type_a.type_id() == types::TypeID::Scalar) {	6✔
56	builder.add_computational_memlet(code_block, *input_node_a, tasklet, "_in1", {}, input_type_a);	×
57	} else {	6✔
58	builder.add_computational_memlet(code_block, *input_node_a, tasklet, "_in1", subset, input_type_a);	6✔
59	}	6✔
60	if (input_type_b.type_id() == types::TypeID::Scalar) {	6✔
61	builder.add_computational_memlet(code_block, *input_node_b, tasklet, "_in2", {}, input_type_b);	×
62	} else {	6✔
63	builder.add_computational_memlet(code_block, *input_node_b, tasklet, "_in2", subset, input_type_b);	6✔
64	}	6✔
65	builder.add_computational_memlet(code_block, tasklet, "_out", output_node, subset, output_type);	6✔
66
67	return true;	6✔
68	}	6✔
69
70	std::unique_ptr<data_flow::DataFlowNode> AddNode::
71	clone(size_t element_id, const graph::Vertex vertex, data_flow::DataFlowGraph& parent) const {	×
72	return std::unique_ptr<	×
73	data_flow::DataFlowNode>(new AddNode(element_id, this->debug_info(), vertex, parent, this->shape_));	×
74	}	×
75
76	} // namespace tensor
77	} // namespace math
78	} // namespace sdfg

daisytuner / sdfglib / 20770413849

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