15898736035

Committed 26 Jun 2025 09:54AM UTC coverage: 65.01% (-0.1%) from 65.152%

Build # 15898736035

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #108 from daisytuner/library-node-symbols

Library node symbols

Run Details

3 of 32 new or added lines in 4 files covered. (9.38%)

4 existing lines in 3 files now uncovered.

8487 of 13055 relevant lines covered (65.01%)

139.12 hits per line

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

13.64

/src/data_flow/library_nodes/barrier_local_node.cpp

#include "sdfg/data_flow/library_nodes/barrier_local_node.h"

#include "sdfg/data_flow/library_node.h"

namespace sdfg {
namespace data_flow {

BarrierLocalNode::BarrierLocalNode(size_t element_id, const DebugInfo& debug_info,
                                   const graph::Vertex vertex, DataFlowGraph& parent,
                                   const data_flow::LibraryNodeCode code,
                                   const std::vector<std::string>& outputs,
                                   const std::vector<std::string>& inputs, const bool side_effect)
    : LibraryNode(element_id, debug_info, vertex, parent, code, outputs, inputs, side_effect) {

      };

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

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

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

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

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

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

symbolic::SymbolSet BarrierLocalNode::symbols() const { return {}; };

bool BarrierLocalNode::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::unique_ptr<DataFlowNode> BarrierLocalNode::clone(size_t element_id, const graph::Vertex vertex,
                                                      DataFlowGraph& parent) const {
    return std::unique_ptr<BarrierLocalNode>(
        new BarrierLocalNode(element_id, this->debug_info_, vertex, parent, this->code_,
                             this->outputs_, this->inputs_, this->side_effect_));
};

void BarrierLocalNode::replace(const symbolic::Expression& old_expression,
                               const symbolic::Expression& new_expression) {
    // Do nothing
};

}  // namespace data_flow
}  // namespace sdfg

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

daisytuner / sdfglib / 15898736035

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