15262928007

Committed 26 May 2025 10:36PM UTC coverage: 58.284% (-2.0%) from 60.304%

Build # 15262928007

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #36 from daisytuner/sdfg-validation

Introduces new definition of memlets plus sanity checks

Run Details

104 of 266 new or added lines in 6 files covered. (39.1%)

241 existing lines in 15 files now uncovered.

7908 of 13568 relevant lines covered (58.28%)

96.1 hits per line

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

69.57

/src/data_flow/code_node.cpp

#include "sdfg/data_flow/code_node.h"

namespace sdfg {
namespace data_flow {

CodeNode::CodeNode(size_t element_id, const DebugInfo& debug_info, const graph::Vertex vertex,
                   DataFlowGraph& parent,
                   const std::vector<std::pair<std::string, sdfg::types::Scalar>>& outputs,
                   const std::vector<std::pair<std::string, sdfg::types::Scalar>>& inputs)
    : DataFlowNode(element_id, debug_info, vertex, parent), outputs_(outputs), inputs_(inputs) {

      };

const std::vector<std::pair<std::string, sdfg::types::Scalar>>& CodeNode::outputs() const {
    return this->outputs_;
};

const std::pair<std::string, sdfg::types::Scalar> CodeNode::output(size_t index) const {
    return this->outputs_[index];
};

const sdfg::types::Scalar& CodeNode::output_type(const std::string& input) const {
    return this->outputs_.at(0).second;
};

const std::vector<std::pair<std::string, sdfg::types::Scalar>>& CodeNode::inputs() const {
    return this->inputs_;
};

const std::pair<std::string, sdfg::types::Scalar> CodeNode::input(size_t index) const {
    return this->inputs_[index];
};

const sdfg::types::Scalar& CodeNode::input_type(const std::string& input) const {
    return std::find_if(this->inputs_.begin(), this->inputs_.end(),
                        [&input](const std::pair<std::string, sdfg::types::Scalar>& p) {
                            return p.first == input;
                        })
        ->second;
};

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

}  // namespace data_flow
}  // namespace sdfg

1	#include "sdfg/data_flow/code_node.h"
2
3	namespace sdfg {
4	namespace data_flow {
5
6	CodeNode::CodeNode(size_t element_id, const DebugInfo& debug_info, const graph::Vertex vertex,	366✔
7	DataFlowGraph& parent,
8	const std::vector<std::pair<std::string, sdfg::types::Scalar>>& outputs,
9	const std::vector<std::pair<std::string, sdfg::types::Scalar>>& inputs)
10	: DataFlowNode(element_id, debug_info, vertex, parent), outputs_(outputs), inputs_(inputs) {	366✔
11
12	};	366✔
13
14	const std::vector<std::pair<std::string, sdfg::types::Scalar>>& CodeNode::outputs() const {	364✔
15	return this->outputs_;	364✔
16	};
17
18	const std::pair<std::string, sdfg::types::Scalar> CodeNode::output(size_t index) const {	184✔
19	return this->outputs_[index];	184✔
20	};
21
UNCOV 22	const sdfg::types::Scalar& CodeNode::output_type(const std::string& input) const {	×
UNCOV 23	return this->outputs_.at(0).second;	×
24	};
25
26	const std::vector<std::pair<std::string, sdfg::types::Scalar>>& CodeNode::inputs() const {	633✔
27	return this->inputs_;	633✔
28	};
29
30	const std::pair<std::string, sdfg::types::Scalar> CodeNode::input(size_t index) const {	443✔
31	return this->inputs_[index];	443✔
32	};
33
UNCOV 34	const sdfg::types::Scalar& CodeNode::input_type(const std::string& input) const {	×
UNCOV 35	return std::find_if(this->inputs_.begin(), this->inputs_.end(),	×
UNCOV 36	[&input](const std::pair<std::string, sdfg::types::Scalar>& p) {	×
UNCOV 37	return p.first == input;	×
38	})
UNCOV 39	->second;	×
40	};
41
42	bool CodeNode::needs_connector(size_t index) const {	224✔
43	// Is non-constant, if starts with _in prefix
44	if (this->inputs_[index].first.compare(0, 3, "_in") == 0) {	224✔
45	return true;	19✔
46	}
47	return false;	205✔
48	};	224✔
49
50	} // namespace data_flow
51	} // namespace sdfg

daisytuner / sdfglib / 15262928007

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