16313696218

Committed 16 Jul 2025 07:52AM UTC coverage: 64.642% (-0.2%) from 64.843%

Build # 16313696218

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #141 from daisytuner/dataflow-ranges

Several convenience improvements for library nodes

Run Details

60 of 141 new or added lines in 14 files covered. (42.55%)

8 existing lines in 7 files now uncovered.

8556 of 13236 relevant lines covered (64.64%)

178.45 hits per line

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

15.0

/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)
    : LibraryNode(element_id, debug_info, vertex, parent, BARRIER_LOCAL, {}, {}, true) {

      };

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));
};

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

daisytuner / sdfglib / 16313696218

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