16463734605

Committed 23 Jul 2025 06:56AM UTC coverage: 65.244% (-0.8%) from 66.011%

Build # 16463734605

Build Type

Pull #156

github

Committed by

web-flow

Commit Message

Merge c49539d03 into 4c085404b

Pull Request Pull Request #156: adds draft for GEMM node

Run Details

10 of 165 new or added lines in 5 files covered. (6.06%)

3 existing lines in 1 file now uncovered.

8331 of 12769 relevant lines covered (65.24%)

132.3 hits per line

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

50.0

/src/data_flow/library_node.cpp

#include "sdfg/data_flow/library_node.h"

#include <string>

namespace sdfg {
namespace data_flow {

LibraryNode::LibraryNode(
    size_t element_id,
    const DebugInfo& debug_info,
    const graph::Vertex vertex,
    DataFlowGraph& parent,
    const LibraryNodeCode& code,
    const std::vector<std::string>& outputs,
    const std::vector<std::string>& inputs,
    const bool side_effect
)
    : CodeNode(element_id, debug_info, vertex, parent), code_(code), outputs_(outputs), inputs_(inputs),
      side_effect_(side_effect), implementation_type_(ImplementationType_NONE) {

      };

const LibraryNodeCode& LibraryNode::code() const { return this->code_; };

const ImplementationType& LibraryNode::implementation_type() const { return this->implementation_type_; };

ImplementationType& LibraryNode::implementation_type() { return this->implementation_type_; };

const std::vector<std::string>& LibraryNode::inputs() const { return this->inputs_; };

const std::vector<std::string>& LibraryNode::outputs() const { return this->outputs_; };

const std::string& LibraryNode::input(size_t index) const { return this->inputs_[index]; };

const std::string& LibraryNode::output(size_t index) const { return this->outputs_[index]; };

bool LibraryNode::side_effect() const { return this->side_effect_; };

bool LibraryNode::needs_connector(size_t index) const {
    // Is non-constant, if starts with _in prefix
    if (this->inputs_[index].compare(0, 3, "_in") == 0) {
        return true;
    }
    return false;
};

std::string LibraryNode::toStr() const { return std::string(this->code_.value()); }

} // namespace data_flow
} // namespace sdfg

1	#include "sdfg/data_flow/library_node.h"
2
3	#include <string>
4
5	namespace sdfg {
6	namespace data_flow {
7
8	LibraryNode::LibraryNode(	11✔
9	size_t element_id,
10	const DebugInfo& debug_info,
11	const graph::Vertex vertex,
12	DataFlowGraph& parent,
13	const LibraryNodeCode& code,
14	const std::vector<std::string>& outputs,
15	const std::vector<std::string>& inputs,
16	const bool side_effect
17	)
18	: CodeNode(element_id, debug_info, vertex, parent), code_(code), outputs_(outputs), inputs_(inputs),	22✔
19	side_effect_(side_effect), implementation_type_(ImplementationType_NONE) {	22✔
20
21	};	11✔
22
23	const LibraryNodeCode& LibraryNode::code() const { return this->code_; };	6✔
24
25	const ImplementationType& LibraryNode::implementation_type() const { return this->implementation_type_; };	1✔
26
NEW 27	ImplementationType& LibraryNode::implementation_type() { return this->implementation_type_; };	×
28
29	const std::vector<std::string>& LibraryNode::inputs() const { return this->inputs_; };	12✔
30
31	const std::vector<std::string>& LibraryNode::outputs() const { return this->outputs_; };	12✔
32
33	const std::string& LibraryNode::input(size_t index) const { return this->inputs_[index]; };	×
34
35	const std::string& LibraryNode::output(size_t index) const { return this->outputs_[index]; };	×
36
37	bool LibraryNode::side_effect() const { return this->side_effect_; };	6✔
38
39	bool LibraryNode::needs_connector(size_t index) const {	×
40	// Is non-constant, if starts with _in prefix
41	if (this->inputs_[index].compare(0, 3, "_in") == 0) {	×
42	return true;	×
43	}
44	return false;	×
45	};	×
46
47	std::string LibraryNode::toStr() const { return std::string(this->code_.value()); }	×
48
49	} // namespace data_flow
50	} // namespace sdfg

daisytuner / sdfglib / 16463734605

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