16439608634

Committed 22 Jul 2025 08:57AM UTC coverage: 65.982% (+0.9%) from 65.094%

Build # 16439608634

Build Type

Pull #153

github

Committed by

web-flow

Commit Message

Merge 373570200 into abe57c083

Pull Request Pull Request #153: Restricts memlets to contiguous memory

Run Details

213 of 317 new or added lines in 30 files covered. (67.19%)

66 existing lines in 7 files now uncovered.

8321 of 12611 relevant lines covered (65.98%)

128.51 hits per line

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

8.82

/src/passes/dataflow/dead_reference_elimination.cpp

#include "sdfg/passes/dataflow/dead_reference_elimination.h"

#include "sdfg/analysis/users.h"

namespace sdfg {
namespace passes {

DeadReferenceElimination::DeadReferenceElimination()
    : Pass() {

      };

std::string DeadReferenceElimination::name() { return "DeadReferenceElimination"; };

bool DeadReferenceElimination::
    run_pass(builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager) {
    bool applied = false;

    auto& sdfg = builder.subject();
    auto& users = analysis_manager.get<analysis::Users>();

    std::list<std::string> to_delete;
    for (auto& name : sdfg.containers()) {
        if (!sdfg.is_transient(name)) {
            continue;
        }
        if (!dynamic_cast<const types::Pointer*>(&sdfg.type(name))) {
            continue;
        }
        // Requirement: Pointer is only assigned
        auto reads = users.reads(name);
        auto writes = users.writes(name);
        if (reads.size() > 0 || writes.size() > 0) {
            continue;
        }
        auto views = users.views(name);
        auto moves = users.moves(name);
        if (views.size() > 0) {
            continue;
        }

        for (auto& move : moves) {
            auto access_node = dynamic_cast<data_flow::AccessNode*>(move->element());
            auto& graph = dynamic_cast<data_flow::DataFlowGraph&>(access_node->get_parent());
            auto& block = dynamic_cast<structured_control_flow::Block&>(*graph.get_parent());
            builder.clear_node(block, *access_node);
            applied = true;
        }

        to_delete.push_back(name);
    }
    for (auto& name : to_delete) {
        builder.remove_container(name);
    }

    return applied;
};

} // namespace passes
} // namespace sdfg

1	#include "sdfg/passes/dataflow/dead_reference_elimination.h"
2
3	#include "sdfg/analysis/users.h"
4
5	namespace sdfg {
6	namespace passes {
7
8	DeadReferenceElimination::DeadReferenceElimination()	1✔
9	: Pass() {	1✔
10
11	};	1✔
12
13	std::string DeadReferenceElimination::name() { return "DeadReferenceElimination"; };	×
14
15	bool DeadReferenceElimination::
NEW 16	run_pass(builder::StructuredSDFGBuilder& builder, analysis::AnalysisManager& analysis_manager) {	×
UNCOV 17	bool applied = false;	×
18
19	auto& sdfg = builder.subject();	×
20	auto& users = analysis_manager.get<analysis::Users>();	×
21
22	std::list<std::string> to_delete;	×
23	for (auto& name : sdfg.containers()) {	×
24	if (!sdfg.is_transient(name)) {	×
25	continue;	×
26	}
27	if (!dynamic_cast<const types::Pointer*>(&sdfg.type(name))) {	×
28	continue;	×
29	}
30	// Requirement: Pointer is only assigned
31	auto reads = users.reads(name);	×
32	auto writes = users.writes(name);	×
33	if (reads.size() > 0 \|\| writes.size() > 0) {	×
34	continue;	×
35	}
36	auto views = users.views(name);	×
37	auto moves = users.moves(name);	×
38	if (views.size() > 0) {	×
39	continue;	×
40	}
41
42	for (auto& move : moves) {	×
43	auto access_node = dynamic_cast<data_flow::AccessNode*>(move->element());	×
44	auto& graph = dynamic_cast<data_flow::DataFlowGraph&>(access_node->get_parent());	×
45	auto& block = dynamic_cast<structured_control_flow::Block&>(*graph.get_parent());	×
46	builder.clear_node(block, *access_node);	×
47	applied = true;	×
48	}
49
50	to_delete.push_back(name);	×
51	}	×
52	for (auto& name : to_delete) {	×
53	builder.remove_container(name);	×
54	}
55
56	return applied;	×
57	};	×
58
59	} // namespace passes
60	} // namespace sdfg

daisytuner / sdfglib / 16439608634

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