15613307699

Committed 12 Jun 2025 02:27PM UTC coverage: 61.1% (+0.2%) from 60.871%

Build # 15613307699

Build Type

push

github

Committed by

web-flow

Commit Message

Add thread barrier (#69)

* thread barrier definition

* define thread barrier dispatcher

* renameing

* refactor and node definition + serializer

* Constructor update

* integration analog to dispatcher registration

* add dispatcher test

* default dispatcher simplification

* simplify test

* Public symbol definition

Run Details

64 of 95 new or added lines in 11 files covered. (67.37%)

4 existing lines in 2 files now uncovered.

6641 of 10869 relevant lines covered (61.1%)

99.73 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

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

daisytuner / sdfglib / 15613307699

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