15656007340

Committed 14 Jun 2025 08:51PM UTC coverage: 13.234% (-49.9%) from 63.144%

Build # 15656007340

Build Type

Pull #76

github

Committed by

web-flow

Commit Message

Merge 9586c8161 into 413c53212

Pull Request Pull Request #76: New Loop Dependency Analysis

Run Details

361 of 465 new or added lines in 7 files covered. (77.63%)

6215 existing lines in 110 files now uncovered.

1612 of 12181 relevant lines covered (13.23%)

13.64 hits per line

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

0.0

/src/codegen/code_generators/cpp_code_generator.cpp

#include "sdfg/codegen/code_generators/cpp_code_generator.h"

#include "sdfg/codegen/dispatchers/node_dispatcher_registry.h"
#include "sdfg/codegen/instrumentation/instrumentation.h"
#include "sdfg/codegen/instrumentation/outermost_loops_instrumentation.h"

namespace sdfg {
namespace codegen {

CPPCodeGenerator::CPPCodeGenerator(StructuredSDFG& sdfg)
    : CodeGenerator(sdfg, InstrumentationStrategy::NONE) {
    if (sdfg.type() != FunctionType_CPU) {
        throw std::runtime_error("CPPCodeGenerator can only be used for CPU SDFGs");
    }
};

CPPCodeGenerator::CPPCodeGenerator(StructuredSDFG& sdfg,
                                   InstrumentationStrategy instrumentation_strategy)
    : CodeGenerator(sdfg, instrumentation_strategy) {
    if (sdfg.type() != FunctionType_CPU) {
        throw std::runtime_error("CPPCodeGenerator can only be used for CPU SDFGs");
    }
};

bool CPPCodeGenerator::generate() {
    this->dispatch_includes();
    this->dispatch_structures();
    this->dispatch_globals();
    this->dispatch_schedule();
    return true;
};

std::string CPPCodeGenerator::function_definition() {
    /********** Arglist **********/
    std::vector<std::string> args;
    for (auto& container : sdfg_.arguments()) {
        args.push_back(language_extension_.declaration(container, sdfg_.type(container)));
    }
    std::stringstream arglist;
    arglist << sdfg::helpers::join(args, ", ");

    return "extern \"C\" void " + sdfg_.name() + "(" + arglist.str() + ")";
};

bool CPPCodeGenerator::as_source(const std::filesystem::path& header_path,
                                 const std::filesystem::path& source_path,
                                 const std::filesystem::path& library_path) {
    std::ofstream ofs_header(header_path, std::ofstream::out);
    if (!ofs_header.is_open()) {
        return false;
    }

    std::ofstream ofs_source(source_path, std::ofstream::out);
    if (!ofs_source.is_open()) {
        return false;
    }

    std::ofstream ofs_library(library_path, std::ofstream::out);
    if (!ofs_library.is_open()) {
        return false;
    }

    ofs_header << "#pragma once" << std::endl;
    ofs_header << this->includes_stream_.str() << std::endl;
    ofs_header << this->classes_stream_.str() << std::endl;
    ofs_header.close();

    ofs_source << "#include \"" << header_path.filename().string() << "\"" << std::endl;
    ofs_source << this->globals_stream_.str() << std::endl;
    ofs_source << this->function_definition() << std::endl;
    ofs_source << "{" << std::endl;

    if (instrumentation_strategy_ != InstrumentationStrategy::NONE) {
        ofs_source << "__daisy_instrument_init();" << std::endl;
    }

    ofs_source << this->main_stream_.str() << std::endl;

    if (instrumentation_strategy_ != InstrumentationStrategy::NONE) {
        ofs_source << "__daisy_instrument_finalize();" << std::endl;
    }

    ofs_source << "}" << std::endl;
    ofs_source.close();

    auto library_content = this->library_stream_.str();
    if (library_content.empty()) {
        ofs_library.close();
        return true;
    }

    ofs_library << "#include \"" << header_path.filename().string() << "\"" << std::endl;
    ofs_library << std::endl;

    ofs_library << "#undef HWY_TARGET_INCLUDE" << std::endl;
    ofs_library << "#define HWY_TARGET_INCLUDE " << library_path.filename() << std::endl;
    ofs_library << "#include <hwy/foreach_target.h>" << std::endl;
    ofs_library << "#include <hwy/highway.h>" << std::endl;
    ofs_library << "#include <hwy/contrib/math/math-inl.h>" << std::endl;
    ofs_library << std::endl;

    ofs_library << library_content << std::endl;
    ofs_library.close();

    return true;
};

void CPPCodeGenerator::dispatch_includes() {
    this->includes_stream_ << "#include <cmath>" << std::endl;
    if (this->instrumentation_strategy_ != InstrumentationStrategy::NONE)
        this->includes_stream_ << "#include <daisy_rtl.h>" << std::endl;
    this->includes_stream_ << "#define __daisy_min(a,b) ((a)<(b)?(a):(b))" << std::endl;
    this->includes_stream_ << "#define __daisy_max(a,b) ((a)>(b)?(a):(b))" << std::endl;
    this->includes_stream_ << "#define __daisy_fma(a,b,c) a * b + c" << std::endl;
};

void CPPCodeGenerator::dispatch_structures() {
    // Forward declarations
    for (auto& structure : sdfg_.structures()) {
        this->classes_stream_ << "struct " << structure << ";" << std::endl;
    }

    // Generate topology-sorted structure definitions
    typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> structures_graph;
    typedef boost::graph_traits<structures_graph>::vertex_descriptor Vertex;
    std::vector<std::string> names;
    for (auto& structure : sdfg_.structures()) {
        names.push_back(structure);
    }
    structures_graph graph(names.size());

    for (auto& structure : names) {
        auto& definition = sdfg_.structure(structure);
        for (size_t i = 0; i < definition.num_members(); i++) {
            auto member_type = &definition.member_type(symbolic::integer(i));
            while (dynamic_cast<const types::Array*>(member_type)) {
                auto array_type = static_cast<const types::Array*>(member_type);
                member_type = &array_type->element_type();
            }

            if (auto member_structure = dynamic_cast<const sdfg::types::Structure*>(member_type)) {
                boost::add_edge(
                    std::find(names.begin(), names.end(), member_structure->name()) - names.begin(),
                    std::find(names.begin(), names.end(), structure) - names.begin(), graph);
            }
        }
    }

    std::list<Vertex> order;
    std::unordered_map<Vertex, boost::default_color_type> vertex_colors;
    boost::topological_sort(graph, std::back_inserter(order),
                            boost::color_map(boost::make_assoc_property_map(vertex_colors)));
    order.reverse();

    for (auto& structure_index : order) {
        std::string structure = names.at(structure_index);
        auto& definition = sdfg_.structure(structure);
        this->classes_stream_ << "struct ";
        if (definition.is_packed()) {
            this->classes_stream_ << "__attribute__((packed)) ";
        }
        this->classes_stream_ << structure << std::endl;
        this->classes_stream_ << "{\n";

        for (size_t i = 0; i < definition.num_members(); i++) {
            auto& member_type = definition.member_type(symbolic::integer(i));
            if (dynamic_cast<const sdfg::types::Structure*>(&member_type)) {
                this->classes_stream_ << "struct ";
            }
            this->classes_stream_ << language_extension_.declaration("member_" + std::to_string(i),
                                                                     member_type, false, true);
            this->classes_stream_ << ";" << std::endl;
        }

        this->classes_stream_ << "};" << std::endl;
    }
};

void CPPCodeGenerator::dispatch_globals() {
    for (auto& container : sdfg_.externals()) {
        this->globals_stream_ << "extern "
                              << language_extension_.declaration(container, sdfg_.type(container))
                              << ";" << std::endl;
    }
};

void CPPCodeGenerator::dispatch_schedule() {
    // Map external variables to internal variables
    for (auto& container : sdfg_.containers()) {
        if (!sdfg_.is_internal(container)) {
            continue;
        }
        std::string external_name =
            container.substr(0, container.length() - external_suffix.length());
        this->main_stream_ << language_extension_.declaration(container, sdfg_.type(container));
        this->main_stream_ << " = "
                           << language_extension_.type_cast("&" + external_name,
                                                            sdfg_.type(container));
        this->main_stream_ << ";" << std::endl;
    }

    // Declare transient containers
    for (auto& container : sdfg_.containers()) {
        if (!sdfg_.is_transient(container)) {
            continue;
        }

        std::string val =
            this->language_extension_.declaration(container, sdfg_.type(container), false, true);
        if (!val.empty()) {
            this->main_stream_ << val;
            this->main_stream_ << ";" << std::endl;
        }
    }

    // Add instrumentation
    auto instrumentation = create_instrumentation(instrumentation_strategy_, sdfg_);

    auto dispatcher = create_dispatcher(language_extension_, sdfg_, sdfg_.root(), *instrumentation);
    dispatcher->dispatch(this->main_stream_, this->globals_stream_, this->library_stream_);
};

}  // namespace codegen
}  // namespace sdfg

1	#include "sdfg/codegen/code_generators/cpp_code_generator.h"
2
3	#include "sdfg/codegen/dispatchers/node_dispatcher_registry.h"
4	#include "sdfg/codegen/instrumentation/instrumentation.h"
5	#include "sdfg/codegen/instrumentation/outermost_loops_instrumentation.h"
6
7	namespace sdfg {
8	namespace codegen {
9
UNCOV 10	CPPCodeGenerator::CPPCodeGenerator(StructuredSDFG& sdfg)	×
UNCOV 11	: CodeGenerator(sdfg, InstrumentationStrategy::NONE) {	×
UNCOV 12	if (sdfg.type() != FunctionType_CPU) {	×
13	throw std::runtime_error("CPPCodeGenerator can only be used for CPU SDFGs");	×
14	}
UNCOV 15	};	×
16
17	CPPCodeGenerator::CPPCodeGenerator(StructuredSDFG& sdfg,	×
18	InstrumentationStrategy instrumentation_strategy)
19	: CodeGenerator(sdfg, instrumentation_strategy) {	×
20	if (sdfg.type() != FunctionType_CPU) {	×
21	throw std::runtime_error("CPPCodeGenerator can only be used for CPU SDFGs");	×
22	}
23	};	×
24
UNCOV 25	bool CPPCodeGenerator::generate() {	×
UNCOV 26	this->dispatch_includes();	×
UNCOV 27	this->dispatch_structures();	×
UNCOV 28	this->dispatch_globals();	×
UNCOV 29	this->dispatch_schedule();	×
UNCOV 30	return true;	×
31	};
32
UNCOV 33	std::string CPPCodeGenerator::function_definition() {	×
34	/******** Arglist ********/
UNCOV 35	std::vector<std::string> args;	×
UNCOV 36	for (auto& container : sdfg_.arguments()) {	×
37	args.push_back(language_extension_.declaration(container, sdfg_.type(container)));	×
38	}
UNCOV 39	std::stringstream arglist;	×
UNCOV 40	arglist << sdfg::helpers::join(args, ", ");	×
41
UNCOV 42	return "extern \"C\" void " + sdfg_.name() + "(" + arglist.str() + ")";	×
UNCOV 43	};	×
44
45	bool CPPCodeGenerator::as_source(const std::filesystem::path& header_path,	×
46	const std::filesystem::path& source_path,
47	const std::filesystem::path& library_path) {
48	std::ofstream ofs_header(header_path, std::ofstream::out);	×
49	if (!ofs_header.is_open()) {	×
50	return false;	×
51	}
52
53	std::ofstream ofs_source(source_path, std::ofstream::out);	×
54	if (!ofs_source.is_open()) {	×
55	return false;	×
56	}
57
58	std::ofstream ofs_library(library_path, std::ofstream::out);	×
59	if (!ofs_library.is_open()) {	×
60	return false;	×
61	}
62
63	ofs_header << "#pragma once" << std::endl;	×
64	ofs_header << this->includes_stream_.str() << std::endl;	×
65	ofs_header << this->classes_stream_.str() << std::endl;	×
66	ofs_header.close();	×
67
68	ofs_source << "#include \"" << header_path.filename().string() << "\"" << std::endl;	×
69	ofs_source << this->globals_stream_.str() << std::endl;	×
70	ofs_source << this->function_definition() << std::endl;	×
71	ofs_source << "{" << std::endl;	×
72
73	if (instrumentation_strategy_ != InstrumentationStrategy::NONE) {	×
74	ofs_source << "__daisy_instrument_init();" << std::endl;	×
75	}	×
76
77	ofs_source << this->main_stream_.str() << std::endl;	×
78
79	if (instrumentation_strategy_ != InstrumentationStrategy::NONE) {	×
80	ofs_source << "__daisy_instrument_finalize();" << std::endl;	×
81	}	×
82
83	ofs_source << "}" << std::endl;	×
84	ofs_source.close();	×
85
86	auto library_content = this->library_stream_.str();	×
87	if (library_content.empty()) {	×
88	ofs_library.close();	×
89	return true;	×
90	}
91
92	ofs_library << "#include \"" << header_path.filename().string() << "\"" << std::endl;	×
93	ofs_library << std::endl;	×
94
95	ofs_library << "#undef HWY_TARGET_INCLUDE" << std::endl;	×
96	ofs_library << "#define HWY_TARGET_INCLUDE " << library_path.filename() << std::endl;	×
97	ofs_library << "#include <hwy/foreach_target.h>" << std::endl;	×
98	ofs_library << "#include <hwy/highway.h>" << std::endl;	×
99	ofs_library << "#include <hwy/contrib/math/math-inl.h>" << std::endl;	×
100	ofs_library << std::endl;	×
101
102	ofs_library << library_content << std::endl;	×
103	ofs_library.close();	×
104
105	return true;	×
106	};	×
107
UNCOV 108	void CPPCodeGenerator::dispatch_includes() {	×
UNCOV 109	this->includes_stream_ << "#include <cmath>" << std::endl;	×
UNCOV 110	if (this->instrumentation_strategy_ != InstrumentationStrategy::NONE)	×
111	this->includes_stream_ << "#include <daisy_rtl.h>" << std::endl;	×
UNCOV 112	this->includes_stream_ << "#define __daisy_min(a,b) ((a)<(b)?(a):(b))" << std::endl;	×
UNCOV 113	this->includes_stream_ << "#define __daisy_max(a,b) ((a)>(b)?(a):(b))" << std::endl;	×
UNCOV 114	this->includes_stream_ << "#define __daisy_fma(a,b,c) a * b + c" << std::endl;	×
UNCOV 115	};	×
116
UNCOV 117	void CPPCodeGenerator::dispatch_structures() {	×
118	// Forward declarations
UNCOV 119	for (auto& structure : sdfg_.structures()) {	×
UNCOV 120	this->classes_stream_ << "struct " << structure << ";" << std::endl;	×
121	}
122
123	// Generate topology-sorted structure definitions
124	typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> structures_graph;
125	typedef boost::graph_traits<structures_graph>::vertex_descriptor Vertex;
UNCOV 126	std::vector<std::string> names;	×
UNCOV 127	for (auto& structure : sdfg_.structures()) {	×
UNCOV 128	names.push_back(structure);	×
129	}
UNCOV 130	structures_graph graph(names.size());	×
131
UNCOV 132	for (auto& structure : names) {	×
UNCOV 133	auto& definition = sdfg_.structure(structure);	×
UNCOV 134	for (size_t i = 0; i < definition.num_members(); i++) {	×
UNCOV 135	auto member_type = &definition.member_type(symbolic::integer(i));	×
UNCOV 136	while (dynamic_cast<const types::Array*>(member_type)) {	×
137	auto array_type = static_cast<const types::Array*>(member_type);	×
138	member_type = &array_type->element_type();	×
139	}
140
UNCOV 141	if (auto member_structure = dynamic_cast<const sdfg::types::Structure*>(member_type)) {	×
UNCOV 142	boost::add_edge(	×
UNCOV 143	std::find(names.begin(), names.end(), member_structure->name()) - names.begin(),	×
UNCOV 144	std::find(names.begin(), names.end(), structure) - names.begin(), graph);	×
UNCOV 145	}	×
UNCOV 146	}	×
147	}
148
UNCOV 149	std::list<Vertex> order;	×
UNCOV 150	std::unordered_map<Vertex, boost::default_color_type> vertex_colors;	×
UNCOV 151	boost::topological_sort(graph, std::back_inserter(order),	×
UNCOV 152	boost::color_map(boost::make_assoc_property_map(vertex_colors)));	×
UNCOV 153	order.reverse();	×
154
UNCOV 155	for (auto& structure_index : order) {	×
UNCOV 156	std::string structure = names.at(structure_index);	×
UNCOV 157	auto& definition = sdfg_.structure(structure);	×
UNCOV 158	this->classes_stream_ << "struct ";	×
UNCOV 159	if (definition.is_packed()) {	×
UNCOV 160	this->classes_stream_ << "__attribute__((packed)) ";	×
UNCOV 161	}	×
UNCOV 162	this->classes_stream_ << structure << std::endl;	×
UNCOV 163	this->classes_stream_ << "{\n";	×
164
UNCOV 165	for (size_t i = 0; i < definition.num_members(); i++) {	×
UNCOV 166	auto& member_type = definition.member_type(symbolic::integer(i));	×
UNCOV 167	if (dynamic_cast<const sdfg::types::Structure*>(&member_type)) {	×
UNCOV 168	this->classes_stream_ << "struct ";	×
UNCOV 169	}	×
UNCOV 170	this->classes_stream_ << language_extension_.declaration("member_" + std::to_string(i),	×
UNCOV 171	member_type, false, true);	×
UNCOV 172	this->classes_stream_ << ";" << std::endl;	×
UNCOV 173	}	×
174
UNCOV 175	this->classes_stream_ << "};" << std::endl;	×
UNCOV 176	}	×
UNCOV 177	};	×
178
UNCOV 179	void CPPCodeGenerator::dispatch_globals() {	×
UNCOV 180	for (auto& container : sdfg_.externals()) {	×
UNCOV 181	this->globals_stream_ << "extern "	×
UNCOV 182	<< language_extension_.declaration(container, sdfg_.type(container))	×
UNCOV 183	<< ";" << std::endl;	×
184	}
UNCOV 185	};	×
186
UNCOV 187	void CPPCodeGenerator::dispatch_schedule() {	×
188	// Map external variables to internal variables
UNCOV 189	for (auto& container : sdfg_.containers()) {	×
UNCOV 190	if (!sdfg_.is_internal(container)) {	×
UNCOV 191	continue;	×
192	}
193	std::string external_name =
194	container.substr(0, container.length() - external_suffix.length());	×
195	this->main_stream_ << language_extension_.declaration(container, sdfg_.type(container));	×
196	this->main_stream_ << " = "	×
197	<< language_extension_.type_cast("&" + external_name,	×
198	sdfg_.type(container));	×
199	this->main_stream_ << ";" << std::endl;	×
200	}	×
201
202	// Declare transient containers
UNCOV 203	for (auto& container : sdfg_.containers()) {	×
UNCOV 204	if (!sdfg_.is_transient(container)) {	×
UNCOV 205	continue;	×
206	}
207
208	std::string val =
209	this->language_extension_.declaration(container, sdfg_.type(container), false, true);	×
210	if (!val.empty()) {	×
211	this->main_stream_ << val;	×
212	this->main_stream_ << ";" << std::endl;	×
213	}	×
214	}	×
215
216	// Add instrumentation
UNCOV 217	auto instrumentation = create_instrumentation(instrumentation_strategy_, sdfg_);	×
218
UNCOV 219	auto dispatcher = create_dispatcher(language_extension_, sdfg_, sdfg_.root(), *instrumentation);	×
UNCOV 220	dispatcher->dispatch(this->main_stream_, this->globals_stream_, this->library_stream_);	×
UNCOV 221	};	×
222
223	} // namespace codegen
224	} // namespace sdfg

daisytuner / sdfglib / 15656007340

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