mirror of
https://github.com/YosysHQ/yosys
synced 2025-04-12 12:08:19 +00:00
266 lines
11 KiB
C++
266 lines
11 KiB
C++
/*
|
|
* yosys -- Yosys Open SYnthesis Suite
|
|
*
|
|
* Copyright (C) 2024 Emily Schmidt <emily@yosyshq.com>
|
|
*
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
* copyright notice and this permission notice appear in all copies.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
*
|
|
*/
|
|
|
|
#include "kernel/yosys.h"
|
|
#include "kernel/functionalir.h"
|
|
|
|
USING_YOSYS_NAMESPACE
|
|
PRIVATE_NAMESPACE_BEGIN
|
|
|
|
const char illegal_characters[] = "!\"#%&'()*+,-./:;<=>?@[]\\^`{|}~ ";
|
|
const char *reserved_keywords[] = {
|
|
"alignas","alignof","and","and_eq","asm","atomic_cancel","atomic_commit",
|
|
"atomic_noexcept","auto","bitand","bitor","bool","break","case",
|
|
"catch","char","char16_t","char32_t","char8_t","class","co_await",
|
|
"co_return","co_yield","compl","concept","const","const_cast","consteval",
|
|
"constexpr","constinit","continue","decltype","default","delete",
|
|
"do","double","dynamic_cast","else","enum","explicit","export",
|
|
"extern","false","float","for","friend","goto","if","inline",
|
|
"int","long","mutable","namespace","new","noexcept","not","not_eq",
|
|
"nullptr","operator","or","or_eq","private","protected","public",
|
|
"reflexpr","register","reinterpret_cast","requires","return","short",
|
|
"signed","sizeof","static","static_log_assert","static_cast","struct",
|
|
"switch","synchronized","template","this","thread_local","throw",
|
|
"true","try","typedef","typeid","typename","union","unsigned",
|
|
"using","virtual","void","volatile","wchar_t","while","xor","xor_eq",
|
|
nullptr
|
|
};
|
|
|
|
struct CxxType {
|
|
FunctionalIR::Sort sort;
|
|
CxxType(FunctionalIR::Sort sort) : sort(sort) {}
|
|
std::string to_string() const {
|
|
if(sort.is_memory()) {
|
|
return stringf("Memory<%d, %d>", sort.addr_width(), sort.data_width());
|
|
} else if(sort.is_signal()) {
|
|
return stringf("Signal<%d>", sort.width());
|
|
} else {
|
|
log_error("unknown sort");
|
|
}
|
|
}
|
|
};
|
|
|
|
struct CxxWriter {
|
|
std::ostream &f;
|
|
CxxWriter(std::ostream &out) : f(out) {}
|
|
void printf(const char *fmt, ...)
|
|
{
|
|
va_list va;
|
|
va_start(va, fmt);
|
|
f << vstringf(fmt, va);
|
|
va_end(va);
|
|
}
|
|
};
|
|
|
|
struct CxxStruct {
|
|
std::string name;
|
|
dict<IdString, CxxType> types;
|
|
FunctionalTools::Scope scope;
|
|
CxxStruct(std::string name)
|
|
: name(name), scope(illegal_characters, reserved_keywords) {
|
|
scope.reserve("out");
|
|
scope.reserve("dump");
|
|
}
|
|
void insert(IdString name, CxxType type) {
|
|
scope(name);
|
|
types.insert({name, type});
|
|
}
|
|
void print(CxxWriter &f) {
|
|
f.printf("\tstruct %s {\n", name.c_str());
|
|
for (auto p : types) {
|
|
f.printf("\t\t%s %s;\n", p.second.to_string().c_str(), scope(p.first).c_str());
|
|
}
|
|
f.printf("\n\t\ttemplate <typename T> void visit(T &&fn) {\n");
|
|
for (auto p : types) {
|
|
f.printf("\t\t\tfn(\"%s\", %s);\n", RTLIL::unescape_id(p.first).c_str(), scope(p.first).c_str());
|
|
}
|
|
f.printf("\t\t}\n");
|
|
f.printf("\t};\n\n");
|
|
};
|
|
std::string operator[](IdString field) {
|
|
return scope(field);
|
|
}
|
|
};
|
|
|
|
struct CxxTemplate {
|
|
vector<std::variant<std::string, int>> _v;
|
|
public:
|
|
CxxTemplate(std::string fmt) {
|
|
std::string buf;
|
|
for(auto it = fmt.begin(); it != fmt.end(); it++){
|
|
if(*it == '%'){
|
|
it++;
|
|
log_assert(it != fmt.end());
|
|
if(*it == '%')
|
|
buf += *it;
|
|
else {
|
|
log_assert(*it >= '0' && *it <= '9');
|
|
_v.emplace_back(std::move(buf));
|
|
_v.emplace_back((int)(*it - '0'));
|
|
}
|
|
}else
|
|
buf += *it;
|
|
}
|
|
if(!buf.empty())
|
|
_v.emplace_back(std::move(buf));
|
|
}
|
|
template<typename... Args> static std::string format(CxxTemplate fmt, Args&&... args) {
|
|
vector<std::string> strs = {args...};
|
|
std::string result;
|
|
for(auto &v : fmt._v){
|
|
if(std::string *s = std::get_if<std::string>(&v))
|
|
result += *s;
|
|
else if(int *i = std::get_if<int>(&v))
|
|
result += strs[*i];
|
|
else
|
|
log_error("missing case");
|
|
}
|
|
return result;
|
|
}
|
|
};
|
|
|
|
template<class NodeNames> struct CxxPrintVisitor {
|
|
using Node = FunctionalIR::Node;
|
|
NodeNames np;
|
|
CxxStruct &input_struct;
|
|
CxxStruct &state_struct;
|
|
CxxPrintVisitor(NodeNames np, CxxStruct &input_struct, CxxStruct &state_struct) : np(np), input_struct(input_struct), state_struct(state_struct) { }
|
|
template<class T> std::string arg_to_string(T n) { return std::to_string(n); }
|
|
std::string arg_to_string(std::string n) { return n; }
|
|
std::string arg_to_string(Node n) { return np(n); }
|
|
template<typename... Args> std::string format(std::string fmt, Args&&... args) {
|
|
return CxxTemplate::format(fmt, arg_to_string(args)...);
|
|
}
|
|
std::string buf(Node, Node n) { return np(n); }
|
|
std::string slice(Node, Node a, int, int offset, int out_width) { return format("%0.slice<%2>(%1)", a, offset, out_width); }
|
|
std::string zero_extend(Node, Node a, int, int out_width) { return format("%0.zero_extend<%1>()", a, out_width); }
|
|
std::string sign_extend(Node, Node a, int, int out_width) { return format("%0.sign_extend<%1>()", a, out_width); }
|
|
std::string concat(Node, Node a, int, Node b, int) { return format("%0.concat(%1)", a, b); }
|
|
std::string add(Node, Node a, Node b, int) { return format("%0 + %1", a, b); }
|
|
std::string sub(Node, Node a, Node b, int) { return format("%0 - %1", a, b); }
|
|
std::string bitwise_and(Node, Node a, Node b, int) { return format("%0 & %1", a, b); }
|
|
std::string bitwise_or(Node, Node a, Node b, int) { return format("%0 | %1", a, b); }
|
|
std::string bitwise_xor(Node, Node a, Node b, int) { return format("%0 ^ %1", a, b); }
|
|
std::string bitwise_not(Node, Node a, int) { return format("~%0", a); }
|
|
std::string unary_minus(Node, Node a, int) { return format("-%0", a); }
|
|
std::string reduce_and(Node, Node a, int) { return format("%0.all()", a); }
|
|
std::string reduce_or(Node, Node a, int) { return format("%0.any()", a); }
|
|
std::string reduce_xor(Node, Node a, int) { return format("%0.parity()", a); }
|
|
std::string equal(Node, Node a, Node b, int) { return format("%0 == %1", a, b); }
|
|
std::string not_equal(Node, Node a, Node b, int) { return format("%0 != %1", a, b); }
|
|
std::string signed_greater_than(Node, Node a, Node b, int) { return format("%0.signed_greater_than(%1)", a, b); }
|
|
std::string signed_greater_equal(Node, Node a, Node b, int) { return format("%0.signed_greater_equal(%1)", a, b); }
|
|
std::string unsigned_greater_than(Node, Node a, Node b, int) { return format("%0 > %1", a, b); }
|
|
std::string unsigned_greater_equal(Node, Node a, Node b, int) { return format("%0 >= %1", a, b); }
|
|
std::string logical_shift_left(Node, Node a, Node b, int, int) { return format("%0 << %1", a, b); }
|
|
std::string logical_shift_right(Node, Node a, Node b, int, int) { return format("%0 >> %1", a, b); }
|
|
std::string arithmetic_shift_right(Node, Node a, Node b, int, int) { return format("%0.arithmetic_shift_right(%1)", a, b); }
|
|
std::string mux(Node, Node a, Node b, Node s, int) { return format("%2.any() ? %1 : %0", a, b, s); }
|
|
std::string pmux(Node, Node a, Node b, Node s, int, int) { return format("%0.pmux(%1, %2)", a, b, s); }
|
|
std::string constant(Node, RTLIL::Const value) { return format("Signal<%0>(%1)", value.size(), value.as_int()); }
|
|
std::string input(Node, IdString name) { return format("input.%0", input_struct[name]); }
|
|
std::string state(Node, IdString name) { return format("current_state.%0", state_struct[name]); }
|
|
std::string memory_read(Node, Node mem, Node addr, int, int) { return format("%0.read(%1)", mem, addr); }
|
|
std::string memory_write(Node, Node mem, Node addr, Node data, int, int) { return format("%0.write(%1, %2)", mem, addr, data); }
|
|
std::string undriven(Node, int width) { return format("Signal<%0>(0)", width); }
|
|
};
|
|
|
|
struct CxxModule {
|
|
FunctionalIR ir;
|
|
CxxStruct input_struct, output_struct, state_struct;
|
|
std::string module_name;
|
|
|
|
explicit CxxModule(Module *module) :
|
|
ir(FunctionalIR::from_module(module)),
|
|
input_struct("Inputs"),
|
|
output_struct("Outputs"),
|
|
state_struct("State")
|
|
{
|
|
for (auto [name, sort] : ir.inputs())
|
|
input_struct.insert(name, sort);
|
|
for (auto [name, sort] : ir.outputs())
|
|
output_struct.insert(name, sort);
|
|
for (auto [name, sort] : ir.state())
|
|
state_struct.insert(name, sort);
|
|
module_name = FunctionalTools::Scope(illegal_characters, reserved_keywords)(module->name);
|
|
}
|
|
void write_header(CxxWriter &f) {
|
|
f.printf("#include \"sim.h\"\n\n");
|
|
}
|
|
void write_struct_def(CxxWriter &f) {
|
|
f.printf("struct %s {\n", module_name.c_str());
|
|
input_struct.print(f);
|
|
output_struct.print(f);
|
|
state_struct.print(f);
|
|
f.printf("\tstatic void eval(Inputs const &, Outputs &, State const &, State &);\n");
|
|
f.printf("};\n\n");
|
|
}
|
|
void write_eval_def(CxxWriter &f) {
|
|
f.printf("void %s::eval(%s::Inputs const &input, %s::Outputs &output, %s::State const ¤t_state, %s::State &next_state)\n{\n", module_name.c_str(), module_name.c_str(), module_name.c_str(), module_name.c_str(), module_name.c_str());
|
|
FunctionalTools::Scope locals(illegal_characters, reserved_keywords);
|
|
locals.reserve("input");
|
|
locals.reserve("output");
|
|
locals.reserve("current_state");
|
|
locals.reserve("next_state");
|
|
auto node_name = [&](FunctionalIR::Node n) { return locals(n.id(), n.name()); };
|
|
for (auto node : ir)
|
|
f.printf("\t%s %s = %s;\n", CxxType(node.sort()).to_string().c_str(), node_name(node).c_str(), node.visit(CxxPrintVisitor(node_name, input_struct, state_struct)).c_str());
|
|
for (auto [name, sort] : ir.state())
|
|
f.printf("\tnext_state.%s = %s;\n", state_struct[name].c_str(), node_name(ir.get_state_next_node(name)).c_str());
|
|
for (auto [name, sort] : ir.outputs())
|
|
f.printf("\toutput.%s = %s;\n", output_struct[name].c_str(), node_name(ir.get_output_node(name)).c_str());
|
|
f.printf("}\n");
|
|
}
|
|
};
|
|
|
|
struct FunctionalCxxBackend : public Backend
|
|
{
|
|
FunctionalCxxBackend() : Backend("functional_cxx", "convert design to C++ using the functional backend") {}
|
|
|
|
void help() override
|
|
{
|
|
// |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|
|
|
log("\n");
|
|
}
|
|
|
|
void printCxx(std::ostream &stream, std::string, Module *module)
|
|
{
|
|
CxxWriter f(stream);
|
|
CxxModule mod(module);
|
|
mod.write_header(f);
|
|
mod.write_struct_def(f);
|
|
mod.write_eval_def(f);
|
|
}
|
|
|
|
void execute(std::ostream *&f, std::string filename, std::vector<std::string> args, RTLIL::Design *design) override
|
|
{
|
|
log_header(design, "Executing Functional C++ backend.\n");
|
|
|
|
size_t argidx = 1;
|
|
extra_args(f, filename, args, argidx, design);
|
|
|
|
for (auto module : design->selected_modules()) {
|
|
log("Dumping module `%s'.\n", module->name.c_str());
|
|
printCxx(*f, filename, module);
|
|
}
|
|
}
|
|
} FunctionalCxxBackend;
|
|
|
|
PRIVATE_NAMESPACE_END
|