15704003944

Committed 17 Jun 2025 09:51AM UTC coverage: 64.576% (-0.4%) from 64.973%

Build # 15704003944

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #84 from daisytuner/element-ids

Use counter-based element ids

Run Details

196 of 215 new or added lines in 29 files covered. (91.16%)

58 existing lines in 5 files now uncovered.

8041 of 12452 relevant lines covered (64.58%)

117.69 hits per line

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

14.29

/src/data_flow/barrier_local_node.cpp

#include "sdfg/data_flow/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_; };

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/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
29	bool BarrierLocalNode::needs_connector(size_t index) const {	×
30	// Is non-constant, if starts with _in prefix
31	if (this->inputs_[index].compare(0, 3, "_in") == 0) {	×
32	return true;	×
33	}
34	return false;	×
35	};	×
36
NEW 37	std::unique_ptr<DataFlowNode> BarrierLocalNode::clone(size_t element_id, const graph::Vertex vertex,	×
38	DataFlowGraph& parent) const {
39	return std::unique_ptr<BarrierLocalNode>(	×
NEW 40	new BarrierLocalNode(element_id, this->debug_info_, vertex, parent, this->code_,	×
NEW 41	this->outputs_, this->inputs_, this->side_effect_));	×
UNCOV 42	};	×
43
44	void BarrierLocalNode::replace(const symbolic::Expression& old_expression,	×
45	const symbolic::Expression& new_expression) {
46	// Do nothing
47	};	×
48
49	} // namespace data_flow
50	} // namespace sdfg

daisytuner / sdfglib / 15704003944

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