15512392058

Committed 07 Jun 2025 10:47PM UTC coverage: 62.261% (+4.8%) from 57.416%

Build # 15512392058

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #63 from daisytuner/schedules

Schedules

Run Details

152 of 194 new or added lines in 24 files covered. (78.35%)

39 existing lines in 7 files now uncovered.

7467 of 11993 relevant lines covered (62.26%)

127.08 hits per line

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

53.85

/src/codegen/code_generators/c_code_generator.cpp

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

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

namespace sdfg {
namespace codegen {

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

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

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

std::string CCodeGenerator::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 void " + sdfg_.name() + "(" + arglist.str() + ")";
};

bool CCodeGenerator::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 CCodeGenerator::dispatch_includes() {
    this->includes_stream_ << "#include <math.h>" << std::endl;
    this->includes_stream_ << "#include <stdbool.h>" << std::endl;
    this->includes_stream_ << "#include <stdlib.h>" << 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 CCodeGenerator::dispatch_structures() {
    // Forward declarations
    for (auto& structure : sdfg_.structures()) {
        this->classes_stream_ << "typedef struct " << structure << " " << 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_ << "typedef 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 (auto pointer_type = dynamic_cast<const sdfg::types::Pointer*>(&member_type)) {
                if (dynamic_cast<const sdfg::types::Structure*>(&pointer_type->pointee_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_ << "} " << structure << ";" << std::endl;
    }
};

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

void CCodeGenerator::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/c_code_generator.h"
2
3	#include "sdfg/codegen/dispatchers/node_dispatcher_factory.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
10	CCodeGenerator::CCodeGenerator(StructuredSDFG& sdfg)	10✔
11	: CodeGenerator(sdfg, InstrumentationStrategy::NONE) {	5✔
12	if (sdfg.type() != FunctionType_CPU) {	5✔
UNCOV 13	throw std::runtime_error("CCodeGenerator can only be used for CPU SDFGs");	×
14	}
15	};	5✔
16
NEW 17	CCodeGenerator::CCodeGenerator(StructuredSDFG& sdfg,	×
18	InstrumentationStrategy instrumentation_strategy)
NEW 19	: CodeGenerator(sdfg, instrumentation_strategy) {	×
NEW 20	if (sdfg.type() != FunctionType_CPU) {	×
UNCOV 21	throw std::runtime_error("CCodeGenerator can only be used for CPU SDFGs");	×
22	}
23	};	×
24
25	bool CCodeGenerator::generate() {	4✔
26	this->dispatch_includes();	4✔
27	this->dispatch_structures();	4✔
28	this->dispatch_globals();	4✔
29	this->dispatch_schedule();	4✔
30	return true;	4✔
31	};
32
33	std::string CCodeGenerator::function_definition() {	1✔
34	/******** Arglist ********/
35	std::vector<std::string> args;	1✔
36	for (auto& container : sdfg_.arguments()) {	1✔
NEW 37	args.push_back(language_extension_.declaration(container, sdfg_.type(container)));	×
38	}
39	std::stringstream arglist;	1✔
40	arglist << sdfg::helpers::join(args, ", ");	1✔
41
42	return "extern void " + sdfg_.name() + "(" + arglist.str() + ")";	1✔
43	};	1✔
44
45	bool CCodeGenerator::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
108	void CCodeGenerator::dispatch_includes() {	4✔
109	this->includes_stream_ << "#include <math.h>" << std::endl;	4✔
110	this->includes_stream_ << "#include <stdbool.h>" << std::endl;	4✔
111	this->includes_stream_ << "#include <stdlib.h>" << std::endl;	4✔
112	if (this->instrumentation_strategy_ != InstrumentationStrategy::NONE)	4✔
113	this->includes_stream_ << "#include <daisy_rtl.h>" << std::endl;	×
114
115	this->includes_stream_ << "#define __daisy_min(a,b) ((a)<(b)?(a):(b))" << std::endl;	4✔
116	this->includes_stream_ << "#define __daisy_max(a,b) ((a)>(b)?(a):(b))" << std::endl;	4✔
117	this->includes_stream_ << "#define __daisy_fma(a,b,c) a * b + c" << std::endl;	4✔
118	};	4✔
119
120	void CCodeGenerator::dispatch_structures() {	4✔
121	// Forward declarations
122	for (auto& structure : sdfg_.structures()) {	7✔
123	this->classes_stream_ << "typedef struct " << structure << " " << structure << ";"	3✔
124	<< std::endl;	3✔
125	}
126
127	// Generate topology-sorted structure definitions
128	typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> structures_graph;
129	typedef boost::graph_traits<structures_graph>::vertex_descriptor Vertex;
130	std::vector<std::string> names;	4✔
131	for (auto& structure : sdfg_.structures()) {	7✔
132	names.push_back(structure);	3✔
133	}
134	structures_graph graph(names.size());	4✔
135
136	for (auto& structure : names) {	7✔
137	auto& definition = sdfg_.structure(structure);	3✔
138	for (size_t i = 0; i < definition.num_members(); i++) {	6✔
139	auto member_type = &definition.member_type(symbolic::integer(i));	3✔
140	while (dynamic_cast<const types::Array*>(member_type)) {	3✔
141	auto array_type = static_cast<const types::Array*>(member_type);	×
142	member_type = &array_type->element_type();	×
143	}
144
145	if (auto member_structure = dynamic_cast<const sdfg::types::Structure*>(member_type)) {	3✔
146	boost::add_edge(	1✔
147	std::find(names.begin(), names.end(), member_structure->name()) - names.begin(),	1✔
148	std::find(names.begin(), names.end(), structure) - names.begin(), graph);	1✔
149	}	1✔
150	}	3✔
151	}
152
153	std::list<Vertex> order;	4✔
154	std::unordered_map<Vertex, boost::default_color_type> vertex_colors;	4✔
155	boost::topological_sort(graph, std::back_inserter(order),	8✔
156	boost::color_map(boost::make_assoc_property_map(vertex_colors)));	4✔
157	order.reverse();	4✔
158
159	for (auto& structure_index : order) {	7✔
160	std::string structure = names.at(structure_index);	3✔
161	auto& definition = sdfg_.structure(structure);	3✔
162	this->classes_stream_ << "typedef struct ";	3✔
163	if (definition.is_packed()) {	3✔
164	this->classes_stream_ << "__attribute__((packed)) ";	×
165	}	×
166	this->classes_stream_ << structure << std::endl;	3✔
167	this->classes_stream_ << "{\n";	3✔
168
169	for (size_t i = 0; i < definition.num_members(); i++) {	6✔
170	auto& member_type = definition.member_type(symbolic::integer(i));	3✔
171	if (auto pointer_type = dynamic_cast<const sdfg::types::Pointer*>(&member_type)) {	3✔
172	if (dynamic_cast<const sdfg::types::Structure*>(&pointer_type->pointee_type())) {	×
173	this->classes_stream_ << "struct ";	×
174	}	×
175	}	×
176	this->classes_stream_ << language_extension_.declaration("member_" + std::to_string(i),	3✔
177	member_type, false, true);	3✔
178	this->classes_stream_ << ";" << std::endl;	3✔
179	}	3✔
180
181	this->classes_stream_ << "} " << structure << ";" << std::endl;	3✔
182	}	3✔
183	};	4✔
184
185	void CCodeGenerator::dispatch_globals() {	4✔
186	for (auto& container : sdfg_.externals()) {	5✔
187	this->globals_stream_ << "extern "	2✔
188	<< language_extension_.declaration(container, sdfg_.type(container))	1✔
189	<< ";" << std::endl;	1✔
190	}
191	};	4✔
192
193	void CCodeGenerator::dispatch_schedule() {	4✔
194	// Map external variables to internal variables
195	for (auto& container : sdfg_.containers()) {	5✔
196	if (!sdfg_.is_internal(container)) {	1✔
197	continue;	1✔
198	}
199	std::string external_name =
200	container.substr(0, container.length() - external_suffix.length());	×
NEW 201	this->main_stream_ << language_extension_.declaration(container, sdfg_.type(container));	×
202	this->main_stream_ << " = "	×
203	<< language_extension_.type_cast("&" + external_name,	×
NEW 204	sdfg_.type(container));	×
205	this->main_stream_ << ";" << std::endl;	×
206	}	×
207
208	// Declare transient containers
209	for (auto& container : sdfg_.containers()) {	5✔
210	if (!sdfg_.is_transient(container)) {	1✔
211	continue;	1✔
212	}
213
214	std::string val =
NEW 215	this->language_extension_.declaration(container, sdfg_.type(container), false, true);	×
216	if (!val.empty()) {	×
217	this->main_stream_ << val;	×
218	this->main_stream_ << ";" << std::endl;	×
219	}	×
220	}	×
221
222	// Add instrumentation
223	auto instrumentation = create_instrumentation(instrumentation_strategy_, sdfg_);	4✔
224
225	auto dispatcher = create_dispatcher(language_extension_, sdfg_, sdfg_.root(), *instrumentation);	4✔
226	dispatcher->dispatch(this->main_stream_, this->globals_stream_, this->library_stream_);	4✔
227	};	4✔
228
229	} // namespace codegen
230	} // namespace sdfg

daisytuner / sdfglib / 15512392058

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