2 * yosys -- Yosys Open SYnthesis Suite
4 * Copyright (C) 2019-2020 whitequark <whitequark@whitequark.org>
6 * Permission to use, copy, modify, and/or distribute this software for any
7 * purpose with or without fee is hereby granted, provided that the above
8 * copyright notice and this permission notice appear in all copies.
10 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
20 #include "kernel/rtlil.h"
21 #include "kernel/register.h"
22 #include "kernel/sigtools.h"
23 #include "kernel/utils.h"
24 #include "kernel/celltypes.h"
25 #include "kernel/log.h"
28 PRIVATE_NAMESPACE_BEGIN
31 // Peter Eades; Xuemin Lin; W. F. Smyth, "A Fast Effective Heuristic For The Feedback Arc Set Problem"
32 // Information Processing Letters, Vol. 47, pp 319-323, 1993
33 // https://pdfs.semanticscholar.org/c7ed/d9acce96ca357876540e19664eb9d976637f.pdf
35 // A topological sort (on a cell/wire graph) is always possible in a fully flattened RTLIL design without
36 // processes or logic loops where every wire has a single driver. Logic loops are illegal in RTLIL and wires
37 // with multiple drivers can be split by the `splitnets` pass; however, interdependencies between processes
38 // or module instances can create strongly connected components without introducing evaluation nondeterminism.
39 // We wish to support designs with such benign SCCs (as well as designs with multiple drivers per wire), so
40 // we sort the graph in a way that minimizes feedback arcs. If there are no feedback arcs in the sorted graph,
41 // then a more efficient evaluation method is possible, since eval() will always immediately converge.
47 pool
<Vertex
*, hash_ptr_ops
> preds
, succs
;
49 Vertex() : data(NULL
), prev(this), next(this) {}
50 Vertex(T
*data
) : data(data
), prev(NULL
), next(NULL
) {}
54 log_assert(data
== NULL
);
56 log_assert(prev
== next
);
62 void link(Vertex
*list
)
64 log_assert(prev
== NULL
&& next
== NULL
);
67 list
->prev
->next
= this;
73 log_assert(prev
->next
== this && next
->prev
== this);
81 return succs
.size() - preds
.size();
85 std::vector
<Vertex
*> vertices
;
86 Vertex
*sources
= new Vertex
;
87 Vertex
*sinks
= new Vertex
;
88 dict
<int, Vertex
*> bins
;
96 for (auto vertex
: vertices
)
102 Vertex
*vertex
= new Vertex(data
);
103 vertices
.push_back(vertex
);
107 void relink(Vertex
*vertex
)
109 if (vertex
->succs
.empty())
111 else if (vertex
->preds
.empty())
112 vertex
->link(sources
);
114 int delta
= vertex
->delta();
115 if (!bins
.count(delta
))
116 bins
[delta
] = new Vertex
;
117 vertex
->link(bins
[delta
]);
121 Vertex
*remove(Vertex
*vertex
)
124 for (auto pred
: vertex
->preds
) {
127 log_assert(pred
->succs
[vertex
]);
129 pred
->succs
.erase(vertex
);
132 for (auto succ
: vertex
->succs
) {
135 log_assert(succ
->preds
[vertex
]);
137 succ
->preds
.erase(vertex
);
140 vertex
->preds
.clear();
141 vertex
->succs
.clear();
145 std::vector
<Vertex
*> schedule()
147 std::vector
<Vertex
*> s1
, s2r
;
148 for (auto vertex
: vertices
)
150 bool bins_empty
= false;
151 while (!(sinks
->empty() && sources
->empty() && bins_empty
)) {
152 while (!sinks
->empty())
153 s2r
.push_back(remove(sinks
->next
));
154 while (!sources
->empty())
155 s1
.push_back(remove(sources
->next
));
156 // Choosing u in this implementation isn't O(1), but the paper handwaves which data structure they suggest
157 // using to get O(1) relinking *and* find-max-key ("it is clear"... no it isn't), so this code uses a very
158 // naive implementation of find-max-key.
160 bins
.template sort
<std::greater
<int>>();
161 for (auto bin
: bins
) {
162 if (!bin
.second
->empty()) {
164 s1
.push_back(remove(bin
.second
->next
));
169 s1
.insert(s1
.end(), s2r
.rbegin(), s2r
.rend());
174 bool is_unary_cell(RTLIL::IdString type
)
177 ID($
not), ID($logic_not
), ID($reduce_and
), ID($reduce_or
), ID($reduce_xor
), ID($reduce_xnor
), ID($reduce_bool
),
181 bool is_binary_cell(RTLIL::IdString type
)
184 ID($
and), ID($
or), ID($
xor), ID($xnor
), ID($logic_and
), ID($logic_or
),
185 ID($shl
), ID($sshl
), ID($shr
), ID($sshr
), ID($shift
), ID($shiftx
),
186 ID($eq
), ID($ne
), ID($eqx
), ID($nex
), ID($gt
), ID($ge
), ID($lt
), ID($le
),
187 ID($add
), ID($sub
), ID($mul
), ID($div
), ID($mod
));
190 bool is_extending_cell(RTLIL::IdString type
)
193 ID($logic_not
), ID($logic_and
), ID($logic_or
),
194 ID($reduce_and
), ID($reduce_or
), ID($reduce_xor
), ID($reduce_xnor
), ID($reduce_bool
));
197 bool is_elidable_cell(RTLIL::IdString type
)
199 return is_unary_cell(type
) || is_binary_cell(type
) || type
.in(
200 ID($mux
), ID($concat
), ID($slice
), ID($pmux
));
203 bool is_sync_ff_cell(RTLIL::IdString type
)
206 ID($dff
), ID($dffe
));
209 bool is_ff_cell(RTLIL::IdString type
)
211 return is_sync_ff_cell(type
) || type
.in(
212 ID($adff
), ID($dffsr
), ID($dlatch
), ID($dlatchsr
), ID($sr
));
215 bool is_internal_cell(RTLIL::IdString type
)
217 return type
[0] == '$' && !type
.begins_with("$paramod");
220 bool is_cxxrtl_blackbox_cell(const RTLIL::Cell
*cell
)
222 RTLIL::Module
*cell_module
= cell
->module
->design
->module(cell
->type
);
223 log_assert(cell_module
!= nullptr);
224 return cell_module
->get_bool_attribute(ID(cxxrtl_blackbox
));
227 enum class CxxrtlPortType
{
228 UNKNOWN
= 0, // or mixed comb/sync
233 CxxrtlPortType
cxxrtl_port_type(const RTLIL::Cell
*cell
, RTLIL::IdString port
)
235 RTLIL::Module
*cell_module
= cell
->module
->design
->module(cell
->type
);
236 if (cell_module
== nullptr || !cell_module
->get_bool_attribute(ID(cxxrtl_blackbox
)))
237 return CxxrtlPortType::UNKNOWN
;
238 RTLIL::Wire
*cell_output_wire
= cell_module
->wire(port
);
239 log_assert(cell_output_wire
!= nullptr);
240 bool is_comb
= cell_output_wire
->get_bool_attribute(ID(cxxrtl_comb
));
241 bool is_sync
= cell_output_wire
->get_bool_attribute(ID(cxxrtl_sync
));
242 if (is_comb
&& is_sync
)
243 log_cmd_error("Port `%s.%s' is marked as both `cxxrtl_comb` and `cxxrtl_sync`.\n",
244 log_id(cell_module
), log_signal(cell_output_wire
));
246 return CxxrtlPortType::COMB
;
248 return CxxrtlPortType::SYNC
;
249 return CxxrtlPortType::UNKNOWN
;
252 bool is_cxxrtl_comb_port(const RTLIL::Cell
*cell
, RTLIL::IdString port
)
254 return cxxrtl_port_type(cell
, port
) == CxxrtlPortType::COMB
;
257 bool is_cxxrtl_sync_port(const RTLIL::Cell
*cell
, RTLIL::IdString port
)
259 return cxxrtl_port_type(cell
, port
) == CxxrtlPortType::SYNC
;
272 RTLIL::SigSig connect
= {};
273 const RTLIL::Cell
*cell
= NULL
;
274 const RTLIL::Process
*process
= NULL
;
277 std::vector
<Node
*> nodes
;
278 dict
<const RTLIL::Wire
*, pool
<Node
*, hash_ptr_ops
>> wire_comb_defs
, wire_sync_defs
, wire_uses
;
279 dict
<const RTLIL::Wire
*, bool> wire_def_elidable
, wire_use_elidable
;
283 for (auto node
: nodes
)
287 void add_defs(Node
*node
, const RTLIL::SigSpec
&sig
, bool fully_sync
, bool elidable
)
289 for (auto chunk
: sig
.chunks())
292 wire_sync_defs
[chunk
.wire
].insert(node
);
294 wire_comb_defs
[chunk
.wire
].insert(node
);
296 // Only comb defs of an entire wire in the right order can be elided.
297 if (!fully_sync
&& sig
.is_wire())
298 wire_def_elidable
[sig
.as_wire()] = elidable
;
301 void add_uses(Node
*node
, const RTLIL::SigSpec
&sig
)
303 for (auto chunk
: sig
.chunks())
305 wire_uses
[chunk
.wire
].insert(node
);
306 // Only a single use of an entire wire in the right order can be elided.
307 // (But the use can include other chunks.)
308 if (!wire_use_elidable
.count(chunk
.wire
))
309 wire_use_elidable
[chunk
.wire
] = true;
311 wire_use_elidable
[chunk
.wire
] = false;
315 bool is_elidable(const RTLIL::Wire
*wire
) const
317 if (wire_def_elidable
.count(wire
) && wire_use_elidable
.count(wire
))
318 return wire_def_elidable
.at(wire
) && wire_use_elidable
.at(wire
);
323 void add_connect_defs_uses(Node
*node
, const RTLIL::SigSig
&conn
)
325 add_defs(node
, conn
.first
, /*fully_sync=*/false, /*elidable=*/true);
326 add_uses(node
, conn
.second
);
329 Node
*add_node(const RTLIL::SigSig
&conn
)
331 Node
*node
= new Node
;
332 node
->type
= Node::Type::CONNECT
;
333 node
->connect
= conn
;
334 nodes
.push_back(node
);
335 add_connect_defs_uses(node
, conn
);
340 void add_cell_sync_defs(Node
*node
, const RTLIL::Cell
*cell
)
342 // To understand why this node type is necessary and why it produces comb defs, consider a cell
343 // with input \i and sync output \o, used in a design such that \i is connected to \o. This does
344 // not result in a feedback arc because the output is synchronous. However, a naive implementation
345 // of code generation for cells that assigns to inputs, evaluates cells, assigns from outputs
346 // would not be able to immediately converge...
349 // cell->p_i = i_tmp.curr;
351 // i_tmp.next = cell->p_o.curr;
353 // ... since the wire connecting the input and output ports would not be localizable. To solve
354 // this, the cell is split into two scheduling nodes; one exclusively for sync outputs, and
355 // another for inputs and all non-sync outputs. This way the generated code can be rearranged...
358 // i_tmp = cell->p_o.curr;
359 // cell->p_i = i_tmp;
362 // eliminating the unnecessary delta cycle. Conceptually, the CELL_SYNC node type is a series of
363 // connections of the form `connect \lhs \cell.\sync_output`; the right-hand side of these is not
364 // expressible as a wire in RTLIL. If it was expressible, then `\cell.\sync_output` would have
365 // a sync def, and this node would be an ordinary CONNECT node, with `\lhs` having a comb def.
366 // Because it isn't, a special node type is used, the right-hand side does not appear anywhere,
367 // and the left-hand side has a comb def.
368 for (auto conn
: cell
->connections())
369 if (cell
->output(conn
.first
))
370 if (is_cxxrtl_sync_port(cell
, conn
.first
)) {
371 // See note regarding elidability below.
372 add_defs(node
, conn
.second
, /*fully_sync=*/false, /*elidable=*/false);
376 void add_cell_eval_defs_uses(Node
*node
, const RTLIL::Cell
*cell
)
378 for (auto conn
: cell
->connections()) {
379 if (cell
->output(conn
.first
)) {
380 if (is_elidable_cell(cell
->type
))
381 add_defs(node
, conn
.second
, /*fully_sync=*/false, /*elidable=*/true);
382 else if (is_sync_ff_cell(cell
->type
) || (cell
->type
== ID($memrd
) && cell
->getParam(ID::CLK_ENABLE
).as_bool()))
383 add_defs(node
, conn
.second
, /*fully_sync=*/true, /*elidable=*/false);
384 else if (is_internal_cell(cell
->type
))
385 add_defs(node
, conn
.second
, /*fully_sync=*/false, /*elidable=*/false);
386 else if (!is_cxxrtl_sync_port(cell
, conn
.first
)) {
387 // Although at first it looks like outputs of user-defined cells may always be elided, the reality is
388 // more complex. Fully sync outputs produce no defs and so don't participate in elision. Fully comb
389 // outputs are assigned in a different way depending on whether the cell's eval() immediately converged.
390 // Unknown/mixed outputs could be elided, but should be rare in practical designs and don't justify
391 // the infrastructure required to elide outputs of cells with many of them.
392 add_defs(node
, conn
.second
, /*fully_sync=*/false, /*elidable=*/false);
395 if (cell
->input(conn
.first
))
396 add_uses(node
, conn
.second
);
400 Node
*add_node(const RTLIL::Cell
*cell
)
402 log_assert(cell
->known());
404 bool has_fully_sync_outputs
= false;
405 for (auto conn
: cell
->connections())
406 if (cell
->output(conn
.first
) && is_cxxrtl_sync_port(cell
, conn
.first
)) {
407 has_fully_sync_outputs
= true;
410 if (has_fully_sync_outputs
) {
411 Node
*node
= new Node
;
412 node
->type
= Node::Type::CELL_SYNC
;
414 nodes
.push_back(node
);
415 add_cell_sync_defs(node
, cell
);
418 Node
*node
= new Node
;
419 node
->type
= Node::Type::CELL_EVAL
;
421 nodes
.push_back(node
);
422 add_cell_eval_defs_uses(node
, cell
);
427 void add_case_defs_uses(Node
*node
, const RTLIL::CaseRule
*case_
)
429 for (auto &action
: case_
->actions
) {
430 add_defs(node
, action
.first
, /*is_sync=*/false, /*elidable=*/false);
431 add_uses(node
, action
.second
);
433 for (auto sub_switch
: case_
->switches
) {
434 add_uses(node
, sub_switch
->signal
);
435 for (auto sub_case
: sub_switch
->cases
) {
436 for (auto &compare
: sub_case
->compare
)
437 add_uses(node
, compare
);
438 add_case_defs_uses(node
, sub_case
);
443 void add_process_defs_uses(Node
*node
, const RTLIL::Process
*process
)
445 add_case_defs_uses(node
, &process
->root_case
);
446 for (auto sync
: process
->syncs
)
447 for (auto action
: sync
->actions
) {
448 if (sync
->type
== RTLIL::STp
|| sync
->type
== RTLIL::STn
|| sync
->type
== RTLIL::STe
)
449 add_defs(node
, action
.first
, /*is_sync=*/true, /*elidable=*/false);
451 add_defs(node
, action
.first
, /*is_sync=*/false, /*elidable=*/false);
452 add_uses(node
, action
.second
);
456 Node
*add_node(const RTLIL::Process
*process
)
458 Node
*node
= new Node
;
459 node
->type
= Node::Type::PROCESS
;
460 node
->process
= process
;
461 nodes
.push_back(node
);
462 add_process_defs_uses(node
, process
);
467 std::vector
<std::string
> split_by(const std::string
&str
, const std::string
&sep
)
469 std::vector
<std::string
> result
;
472 size_t curr
= str
.find_first_of(sep
, prev
);
473 if (curr
== std::string::npos
) {
474 std::string part
= str
.substr(prev
);
475 if (!part
.empty()) result
.push_back(part
);
478 std::string part
= str
.substr(prev
, curr
- prev
);
479 if (!part
.empty()) result
.push_back(part
);
486 std::string
escape_cxx_string(const std::string
&input
)
488 std::string output
= "\"";
489 for (auto c
: input
) {
492 output
.push_back('\\');
495 char l
= c
& 0xf, h
= (c
>> 4) & 0xf;
496 output
.append("\\x");
497 output
.push_back((h
< 10 ? '0' + h
: 'a' + h
- 10));
498 output
.push_back((l
< 10 ? '0' + l
: 'a' + l
- 10));
501 output
.push_back('"');
502 if (output
.find('\0') != std::string::npos
) {
503 output
.insert(0, "std::string {");
504 output
.append(stringf(", %zu}", input
.size()));
510 std::string
get_hdl_name(T
*object
)
512 if (object
->has_attribute(ID::hdlname
))
513 return object
->get_string_attribute(ID::hdlname
);
515 return object
->name
.str().substr(1);
518 struct CxxrtlWorker
{
519 bool split_intf
= false;
520 std::string intf_filename
;
521 std::string design_ns
= "cxxrtl_design";
522 std::ostream
*impl_f
= nullptr;
523 std::ostream
*intf_f
= nullptr;
525 bool run_flatten
= false;
526 bool run_proc
= false;
528 bool unbuffer_internal
= false;
529 bool unbuffer_public
= false;
530 bool localize_internal
= false;
531 bool localize_public
= false;
532 bool elide_internal
= false;
533 bool elide_public
= false;
535 bool debug_info
= false;
537 std::ostringstream f
;
541 dict
<const RTLIL::Module
*, SigMap
> sigmaps
;
542 pool
<const RTLIL::Wire
*> edge_wires
;
543 dict
<RTLIL::SigBit
, RTLIL::SyncType
> edge_types
;
544 pool
<const RTLIL::Memory
*> writable_memories
;
545 dict
<const RTLIL::Cell
*, pool
<const RTLIL::Cell
*>> transparent_for
;
546 dict
<const RTLIL::Wire
*, FlowGraph::Node
> elided_wires
;
547 dict
<const RTLIL::Module
*, std::vector
<FlowGraph::Node
>> schedule
;
548 pool
<const RTLIL::Wire
*> unbuffered_wires
;
549 pool
<const RTLIL::Wire
*> localized_wires
;
550 dict
<const RTLIL::Wire
*, const RTLIL::Wire
*> debug_alias_wires
;
551 dict
<const RTLIL::Wire
*, RTLIL::Const
> debug_const_wires
;
552 dict
<const RTLIL::Module
*, pool
<std::string
>> blackbox_specializations
;
553 dict
<const RTLIL::Module
*, bool> eval_converges
;
559 indent
.resize(indent
.size() - 1);
562 // RTLIL allows any characters in names other than whitespace. This presents an issue for generating C++ code
563 // because C++ identifiers may be only alphanumeric, cannot clash with C++ keywords, and cannot clash with cxxrtl
564 // identifiers. This issue can be solved with a name mangling scheme. We choose a name mangling scheme that results
565 // in readable identifiers, does not depend on an up-to-date list of C++ keywords, and is easy to apply. Its rules:
566 // 1. All generated identifiers start with `_`.
567 // 1a. Generated identifiers for public names (beginning with `\`) start with `p_`.
568 // 1b. Generated identifiers for internal names (beginning with `$`) start with `i_`.
569 // 2. An underscore is escaped with another underscore, i.e. `__`.
570 // 3. Any other non-alnum character is escaped with underscores around its lowercase hex code, e.g. `@` as `_40_`.
571 std::string
mangle_name(const RTLIL::IdString
&name
)
575 for (char c
: name
.str()) {
587 } else if (c
== '_') {
590 char l
= c
& 0xf, h
= (c
>> 4) & 0xf;
592 mangled
+= (h
< 10 ? '0' + h
: 'a' + h
- 10);
593 mangled
+= (l
< 10 ? '0' + l
: 'a' + l
- 10);
601 std::string
mangle_module_name(const RTLIL::IdString
&name
, bool is_blackbox
= false)
605 return "bb_" + mangle_name(name
);
606 return mangle_name(name
);
609 std::string
mangle_memory_name(const RTLIL::IdString
&name
)
611 // Class member namespace.
612 return "memory_" + mangle_name(name
);
615 std::string
mangle_cell_name(const RTLIL::IdString
&name
)
617 // Class member namespace.
618 return "cell_" + mangle_name(name
);
621 std::string
mangle_wire_name(const RTLIL::IdString
&name
)
623 // Class member namespace.
624 return mangle_name(name
);
627 std::string
mangle(const RTLIL::Module
*module
)
629 return mangle_module_name(module
->name
, /*is_blackbox=*/module
->get_bool_attribute(ID(cxxrtl_blackbox
)));
632 std::string
mangle(const RTLIL::Memory
*memory
)
634 return mangle_memory_name(memory
->name
);
637 std::string
mangle(const RTLIL::Cell
*cell
)
639 return mangle_cell_name(cell
->name
);
642 std::string
mangle(const RTLIL::Wire
*wire
)
644 return mangle_wire_name(wire
->name
);
647 std::string
mangle(RTLIL::SigBit sigbit
)
649 log_assert(sigbit
.wire
!= NULL
);
650 if (sigbit
.wire
->width
== 1)
651 return mangle(sigbit
.wire
);
652 return mangle(sigbit
.wire
) + "_" + std::to_string(sigbit
.offset
);
655 std::vector
<std::string
> template_param_names(const RTLIL::Module
*module
)
657 if (!module
->has_attribute(ID(cxxrtl_template
)))
660 if (module
->attributes
.at(ID(cxxrtl_template
)).flags
!= RTLIL::CONST_FLAG_STRING
)
661 log_cmd_error("Attribute `cxxrtl_template' of module `%s' is not a string.\n", log_id(module
));
663 std::vector
<std::string
> param_names
= split_by(module
->get_string_attribute(ID(cxxrtl_template
)), " \t");
664 for (const auto ¶m_name
: param_names
) {
665 // Various lowercase prefixes (p_, i_, cell_, ...) are used for member variables, so require
666 // parameters to start with an uppercase letter to avoid name conflicts. (This is the convention
667 // in both Verilog and C++, anyway.)
668 if (!isupper(param_name
[0]))
669 log_cmd_error("Attribute `cxxrtl_template' of module `%s' includes a parameter `%s', "
670 "which does not start with an uppercase letter.\n",
671 log_id(module
), param_name
.c_str());
676 std::string
template_params(const RTLIL::Module
*module
, bool is_decl
)
678 std::vector
<std::string
> param_names
= template_param_names(module
);
679 if (param_names
.empty())
682 std::string params
= "<";
684 for (const auto ¶m_name
: param_names
) {
690 params
+= param_name
;
696 std::string
template_args(const RTLIL::Cell
*cell
)
698 RTLIL::Module
*cell_module
= cell
->module
->design
->module(cell
->type
);
699 log_assert(cell_module
!= nullptr);
700 if (!cell_module
->get_bool_attribute(ID(cxxrtl_blackbox
)))
703 std::vector
<std::string
> param_names
= template_param_names(cell_module
);
704 if (param_names
.empty())
707 std::string params
= "<";
709 for (const auto ¶m_name
: param_names
) {
713 params
+= "/*" + param_name
+ "=*/";
714 RTLIL::IdString id_param_name
= '\\' + param_name
;
715 if (!cell
->hasParam(id_param_name
))
716 log_cmd_error("Cell `%s.%s' does not have a parameter `%s', which is required by the templated module `%s'.\n",
717 log_id(cell
->module
), log_id(cell
), param_name
.c_str(), log_id(cell_module
));
718 RTLIL::Const param_value
= cell
->getParam(id_param_name
);
719 if (((param_value
.flags
& ~RTLIL::CONST_FLAG_SIGNED
) != 0) || param_value
.as_int() < 0)
720 log_cmd_error("Parameter `%s' of cell `%s.%s', which is required by the templated module `%s', "
721 "is not a positive integer.\n",
722 param_name
.c_str(), log_id(cell
->module
), log_id(cell
), log_id(cell_module
));
723 params
+= std::to_string(cell
->getParam(id_param_name
).as_int());
729 std::string
fresh_temporary()
731 return stringf("tmp_%d", temporary
++);
734 void dump_attrs(const RTLIL::AttrObject
*object
)
736 for (auto attr
: object
->attributes
) {
737 f
<< indent
<< "// " << attr
.first
.str() << ": ";
738 if (attr
.second
.flags
& RTLIL::CONST_FLAG_STRING
) {
739 f
<< attr
.second
.decode_string();
741 f
<< attr
.second
.as_int(/*is_signed=*/attr
.second
.flags
& RTLIL::CONST_FLAG_SIGNED
);
747 void dump_const_init(const RTLIL::Const
&data
, int width
, int offset
= 0, bool fixed_width
= false)
749 const int CHUNK_SIZE
= 32;
752 int chunk_width
= min(width
, CHUNK_SIZE
);
753 uint32_t chunk
= data
.extract(offset
, chunk_width
).as_int();
755 f
<< stringf("0x%.*xu", (3 + chunk_width
) / 4, chunk
);
757 f
<< stringf("%#xu", chunk
);
758 if (width
> CHUNK_SIZE
)
760 offset
+= CHUNK_SIZE
;
766 void dump_const_init(const RTLIL::Const
&data
)
768 dump_const_init(data
, data
.size());
771 void dump_const(const RTLIL::Const
&data
, int width
, int offset
= 0, bool fixed_width
= false)
773 f
<< "value<" << width
<< ">";
774 dump_const_init(data
, width
, offset
, fixed_width
);
777 void dump_const(const RTLIL::Const
&data
)
779 dump_const(data
, data
.size());
782 bool dump_sigchunk(const RTLIL::SigChunk
&chunk
, bool is_lhs
)
784 if (chunk
.wire
== NULL
) {
785 dump_const(chunk
.data
, chunk
.width
, chunk
.offset
);
788 if (elided_wires
.count(chunk
.wire
)) {
790 const FlowGraph::Node
&node
= elided_wires
[chunk
.wire
];
792 case FlowGraph::Node::Type::CONNECT
:
793 dump_connect_elided(node
.connect
);
795 case FlowGraph::Node::Type::CELL_EVAL
:
796 log_assert(is_elidable_cell(node
.cell
->type
));
797 dump_cell_elided(node
.cell
);
802 } else if (unbuffered_wires
[chunk
.wire
]) {
803 f
<< mangle(chunk
.wire
);
805 f
<< mangle(chunk
.wire
) << (is_lhs
? ".next" : ".curr");
807 if (chunk
.width
== chunk
.wire
->width
&& chunk
.offset
== 0)
809 else if (chunk
.width
== 1)
810 f
<< ".slice<" << chunk
.offset
<< ">()";
812 f
<< ".slice<" << chunk
.offset
+chunk
.width
-1 << "," << chunk
.offset
<< ">()";
817 bool dump_sigspec(const RTLIL::SigSpec
&sig
, bool is_lhs
)
822 } else if (sig
.is_chunk()) {
823 return dump_sigchunk(sig
.as_chunk(), is_lhs
);
825 dump_sigchunk(*sig
.chunks().rbegin(), is_lhs
);
826 for (auto it
= sig
.chunks().rbegin() + 1; it
!= sig
.chunks().rend(); ++it
) {
828 dump_sigchunk(*it
, is_lhs
);
835 void dump_sigspec_lhs(const RTLIL::SigSpec
&sig
)
837 dump_sigspec(sig
, /*is_lhs=*/true);
840 void dump_sigspec_rhs(const RTLIL::SigSpec
&sig
)
842 // In the contexts where we want template argument deduction to occur for `template<size_t Bits> ... value<Bits>`,
843 // it is necessary to have the argument to already be a `value<N>`, since template argument deduction and implicit
844 // type conversion are mutually exclusive. In these contexts, we use dump_sigspec_rhs() to emit an explicit
845 // type conversion, but only if the expression needs it.
846 bool is_complex
= dump_sigspec(sig
, /*is_lhs=*/false);
851 void collect_sigspec_rhs(const RTLIL::SigSpec
&sig
, std::vector
<RTLIL::IdString
> &cells
)
853 for (auto chunk
: sig
.chunks()) {
854 if (!chunk
.wire
|| !elided_wires
.count(chunk
.wire
))
857 const FlowGraph::Node
&node
= elided_wires
[chunk
.wire
];
859 case FlowGraph::Node::Type::CONNECT
:
860 collect_connect(node
.connect
, cells
);
862 case FlowGraph::Node::Type::CELL_EVAL
:
863 collect_cell_eval(node
.cell
, cells
);
871 void dump_connect_elided(const RTLIL::SigSig
&conn
)
873 dump_sigspec_rhs(conn
.second
);
876 bool is_connect_elided(const RTLIL::SigSig
&conn
)
878 return conn
.first
.is_wire() && elided_wires
.count(conn
.first
.as_wire());
881 void collect_connect(const RTLIL::SigSig
&conn
, std::vector
<RTLIL::IdString
> &cells
)
883 if (!is_connect_elided(conn
))
886 collect_sigspec_rhs(conn
.second
, cells
);
889 void dump_connect(const RTLIL::SigSig
&conn
)
891 if (is_connect_elided(conn
))
894 f
<< indent
<< "// connection\n";
896 dump_sigspec_lhs(conn
.first
);
898 dump_connect_elided(conn
);
902 void dump_cell_sync(const RTLIL::Cell
*cell
)
904 const char *access
= is_cxxrtl_blackbox_cell(cell
) ? "->" : ".";
905 f
<< indent
<< "// cell " << cell
->name
.str() << " syncs\n";
906 for (auto conn
: cell
->connections())
907 if (cell
->output(conn
.first
))
908 if (is_cxxrtl_sync_port(cell
, conn
.first
)) {
910 dump_sigspec_lhs(conn
.second
);
911 f
<< " = " << mangle(cell
) << access
<< mangle_wire_name(conn
.first
) << ".curr;\n";
915 void dump_cell_elided(const RTLIL::Cell
*cell
)
918 if (is_unary_cell(cell
->type
)) {
919 f
<< cell
->type
.substr(1);
920 if (is_extending_cell(cell
->type
))
921 f
<< '_' << (cell
->getParam(ID::A_SIGNED
).as_bool() ? 's' : 'u');
922 f
<< "<" << cell
->getParam(ID::Y_WIDTH
).as_int() << ">(";
923 dump_sigspec_rhs(cell
->getPort(ID::A
));
926 } else if (is_binary_cell(cell
->type
)) {
927 f
<< cell
->type
.substr(1);
928 if (is_extending_cell(cell
->type
))
929 f
<< '_' << (cell
->getParam(ID::A_SIGNED
).as_bool() ? 's' : 'u') <<
930 (cell
->getParam(ID::B_SIGNED
).as_bool() ? 's' : 'u');
931 f
<< "<" << cell
->getParam(ID::Y_WIDTH
).as_int() << ">(";
932 dump_sigspec_rhs(cell
->getPort(ID::A
));
934 dump_sigspec_rhs(cell
->getPort(ID::B
));
937 } else if (cell
->type
== ID($mux
)) {
939 dump_sigspec_rhs(cell
->getPort(ID::S
));
941 dump_sigspec_rhs(cell
->getPort(ID::B
));
943 dump_sigspec_rhs(cell
->getPort(ID::A
));
945 // Parallel (one-hot) muxes
946 } else if (cell
->type
== ID($pmux
)) {
947 int width
= cell
->getParam(ID::WIDTH
).as_int();
948 int s_width
= cell
->getParam(ID::S_WIDTH
).as_int();
949 for (int part
= 0; part
< s_width
; part
++) {
951 dump_sigspec_rhs(cell
->getPort(ID::S
).extract(part
));
953 dump_sigspec_rhs(cell
->getPort(ID::B
).extract(part
* width
, width
));
956 dump_sigspec_rhs(cell
->getPort(ID::A
));
957 for (int part
= 0; part
< s_width
; part
++) {
961 } else if (cell
->type
== ID($concat
)) {
962 dump_sigspec_rhs(cell
->getPort(ID::B
));
964 dump_sigspec_rhs(cell
->getPort(ID::A
));
967 } else if (cell
->type
== ID($slice
)) {
968 dump_sigspec_rhs(cell
->getPort(ID::A
));
970 f
<< cell
->getParam(ID::OFFSET
).as_int() + cell
->getParam(ID::Y_WIDTH
).as_int() - 1;
972 f
<< cell
->getParam(ID::OFFSET
).as_int();
979 bool is_cell_elided(const RTLIL::Cell
*cell
)
981 return is_elidable_cell(cell
->type
) && cell
->hasPort(ID::Y
) && cell
->getPort(ID::Y
).is_wire() &&
982 elided_wires
.count(cell
->getPort(ID::Y
).as_wire());
985 void collect_cell_eval(const RTLIL::Cell
*cell
, std::vector
<RTLIL::IdString
> &cells
)
987 if (!is_cell_elided(cell
))
990 cells
.push_back(cell
->name
);
991 for (auto port
: cell
->connections())
992 if (port
.first
!= ID::Y
)
993 collect_sigspec_rhs(port
.second
, cells
);
996 void dump_cell_eval(const RTLIL::Cell
*cell
)
998 if (is_cell_elided(cell
))
1000 if (cell
->type
== ID($meminit
))
1001 return; // Handled elsewhere.
1003 std::vector
<RTLIL::IdString
> elided_cells
;
1004 if (is_elidable_cell(cell
->type
)) {
1005 for (auto port
: cell
->connections())
1006 if (port
.first
!= ID::Y
)
1007 collect_sigspec_rhs(port
.second
, elided_cells
);
1009 if (elided_cells
.empty()) {
1011 f
<< indent
<< "// cell " << cell
->name
.str() << "\n";
1013 f
<< indent
<< "// cells";
1014 for (auto elided_cell
: elided_cells
)
1015 f
<< " " << elided_cell
.str();
1020 if (is_elidable_cell(cell
->type
)) {
1022 dump_sigspec_lhs(cell
->getPort(ID::Y
));
1024 dump_cell_elided(cell
);
1027 } else if (is_ff_cell(cell
->type
)) {
1028 if (cell
->hasPort(ID::CLK
) && cell
->getPort(ID::CLK
).is_wire()) {
1029 // Edge-sensitive logic
1030 RTLIL::SigBit clk_bit
= cell
->getPort(ID::CLK
)[0];
1031 clk_bit
= sigmaps
[clk_bit
.wire
->module
](clk_bit
);
1032 f
<< indent
<< "if (" << (cell
->getParam(ID::CLK_POLARITY
).as_bool() ? "posedge_" : "negedge_")
1033 << mangle(clk_bit
) << ") {\n";
1035 if (cell
->type
== ID($dffe
)) {
1036 f
<< indent
<< "if (";
1037 dump_sigspec_rhs(cell
->getPort(ID::EN
));
1038 f
<< " == value<1> {" << cell
->getParam(ID::EN_POLARITY
).as_bool() << "u}) {\n";
1042 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1044 dump_sigspec_rhs(cell
->getPort(ID::D
));
1046 if (cell
->type
== ID($dffe
)) {
1048 f
<< indent
<< "}\n";
1051 f
<< indent
<< "}\n";
1052 } else if (cell
->hasPort(ID::EN
)) {
1053 // Level-sensitive logic
1054 f
<< indent
<< "if (";
1055 dump_sigspec_rhs(cell
->getPort(ID::EN
));
1056 f
<< " == value<1> {" << cell
->getParam(ID::EN_POLARITY
).as_bool() << "u}) {\n";
1059 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1061 dump_sigspec_rhs(cell
->getPort(ID::D
));
1064 f
<< indent
<< "}\n";
1066 if (cell
->hasPort(ID::ARST
)) {
1067 // Asynchronous reset (entire coarse cell at once)
1068 f
<< indent
<< "if (";
1069 dump_sigspec_rhs(cell
->getPort(ID::ARST
));
1070 f
<< " == value<1> {" << cell
->getParam(ID::ARST_POLARITY
).as_bool() << "u}) {\n";
1073 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1075 dump_const(cell
->getParam(ID::ARST_VALUE
));
1078 f
<< indent
<< "}\n";
1080 if (cell
->hasPort(ID::SET
)) {
1081 // Asynchronous set (for individual bits)
1083 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1085 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1087 dump_const(RTLIL::Const(RTLIL::S1
, cell
->getParam(ID::WIDTH
).as_int()));
1089 dump_sigspec_rhs(cell
->getPort(ID::SET
));
1090 f
<< (cell
->getParam(ID::SET_POLARITY
).as_bool() ? "" : ".bit_not()") << ");\n";
1092 if (cell
->hasPort(ID::CLR
)) {
1093 // Asynchronous clear (for individual bits; priority over set)
1095 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1097 dump_sigspec_lhs(cell
->getPort(ID::Q
));
1099 dump_const(RTLIL::Const(RTLIL::S0
, cell
->getParam(ID::WIDTH
).as_int()));
1101 dump_sigspec_rhs(cell
->getPort(ID::CLR
));
1102 f
<< (cell
->getParam(ID::CLR_POLARITY
).as_bool() ? "" : ".bit_not()") << ");\n";
1105 } else if (cell
->type
.in(ID($memrd
), ID($memwr
))) {
1106 if (cell
->getParam(ID::CLK_ENABLE
).as_bool()) {
1107 RTLIL::SigBit clk_bit
= cell
->getPort(ID::CLK
)[0];
1108 clk_bit
= sigmaps
[clk_bit
.wire
->module
](clk_bit
);
1109 f
<< indent
<< "if (" << (cell
->getParam(ID::CLK_POLARITY
).as_bool() ? "posedge_" : "negedge_")
1110 << mangle(clk_bit
) << ") {\n";
1113 RTLIL::Memory
*memory
= cell
->module
->memories
[cell
->getParam(ID::MEMID
).decode_string()];
1114 std::string valid_index_temp
= fresh_temporary();
1115 f
<< indent
<< "auto " << valid_index_temp
<< " = memory_index(";
1116 dump_sigspec_rhs(cell
->getPort(ID::ADDR
));
1117 f
<< ", " << memory
->start_offset
<< ", " << memory
->size
<< ");\n";
1118 if (cell
->type
== ID($memrd
)) {
1119 bool has_enable
= cell
->getParam(ID::CLK_ENABLE
).as_bool() && !cell
->getPort(ID::EN
).is_fully_ones();
1121 f
<< indent
<< "if (";
1122 dump_sigspec_rhs(cell
->getPort(ID::EN
));
1126 // The generated code has two bounds checks; one in an assertion, and another that guards the read.
1127 // This is done so that the code does not invoke undefined behavior under any conditions, but nevertheless
1128 // loudly crashes if an illegal condition is encountered. The assert may be turned off with -NDEBUG not
1129 // just for release builds, but also to make sure the simulator (which is presumably embedded in some
1130 // larger program) will never crash the code that calls into it.
1132 // If assertions are disabled, out of bounds reads are defined to return zero.
1133 f
<< indent
<< "assert(" << valid_index_temp
<< ".valid && \"out of bounds read\");\n";
1134 f
<< indent
<< "if(" << valid_index_temp
<< ".valid) {\n";
1136 if (writable_memories
[memory
]) {
1137 std::string addr_temp
= fresh_temporary();
1138 f
<< indent
<< "const value<" << cell
->getPort(ID::ADDR
).size() << "> &" << addr_temp
<< " = ";
1139 dump_sigspec_rhs(cell
->getPort(ID::ADDR
));
1141 std::string lhs_temp
= fresh_temporary();
1142 f
<< indent
<< "value<" << memory
->width
<< "> " << lhs_temp
<< " = "
1143 << mangle(memory
) << "[" << valid_index_temp
<< ".index];\n";
1144 std::vector
<const RTLIL::Cell
*> memwr_cells(transparent_for
[cell
].begin(), transparent_for
[cell
].end());
1145 std::sort(memwr_cells
.begin(), memwr_cells
.end(),
1146 [](const RTLIL::Cell
*a
, const RTLIL::Cell
*b
) {
1147 return a
->getParam(ID::PRIORITY
).as_int() < b
->getParam(ID::PRIORITY
).as_int();
1149 for (auto memwr_cell
: memwr_cells
) {
1150 f
<< indent
<< "if (" << addr_temp
<< " == ";
1151 dump_sigspec_rhs(memwr_cell
->getPort(ID::ADDR
));
1154 f
<< indent
<< lhs_temp
<< " = " << lhs_temp
;
1156 dump_sigspec_rhs(memwr_cell
->getPort(ID::DATA
));
1158 dump_sigspec_rhs(memwr_cell
->getPort(ID::EN
));
1161 f
<< indent
<< "}\n";
1164 dump_sigspec_lhs(cell
->getPort(ID::DATA
));
1165 f
<< " = " << lhs_temp
<< ";\n";
1168 dump_sigspec_lhs(cell
->getPort(ID::DATA
));
1169 f
<< " = " << mangle(memory
) << "[" << valid_index_temp
<< ".index];\n";
1172 f
<< indent
<< "} else {\n";
1175 dump_sigspec_lhs(cell
->getPort(ID::DATA
));
1176 f
<< " = value<" << memory
->width
<< "> {};\n";
1178 f
<< indent
<< "}\n";
1181 f
<< indent
<< "}\n";
1183 } else /*if (cell->type == ID($memwr))*/ {
1184 log_assert(writable_memories
[memory
]);
1185 // See above for rationale of having both the assert and the condition.
1187 // If assertions are disabled, out of bounds writes are defined to do nothing.
1188 f
<< indent
<< "assert(" << valid_index_temp
<< ".valid && \"out of bounds write\");\n";
1189 f
<< indent
<< "if (" << valid_index_temp
<< ".valid) {\n";
1191 f
<< indent
<< mangle(memory
) << ".update(" << valid_index_temp
<< ".index, ";
1192 dump_sigspec_rhs(cell
->getPort(ID::DATA
));
1194 dump_sigspec_rhs(cell
->getPort(ID::EN
));
1195 f
<< ", " << cell
->getParam(ID::PRIORITY
).as_int() << ");\n";
1197 f
<< indent
<< "}\n";
1199 if (cell
->getParam(ID::CLK_ENABLE
).as_bool()) {
1201 f
<< indent
<< "}\n";
1204 } else if (is_internal_cell(cell
->type
)) {
1205 log_cmd_error("Unsupported internal cell `%s'.\n", cell
->type
.c_str());
1208 log_assert(cell
->known());
1209 const char *access
= is_cxxrtl_blackbox_cell(cell
) ? "->" : ".";
1210 for (auto conn
: cell
->connections())
1211 if (cell
->input(conn
.first
) && !cell
->output(conn
.first
)) {
1212 f
<< indent
<< mangle(cell
) << access
<< mangle_wire_name(conn
.first
) << " = ";
1213 dump_sigspec_rhs(conn
.second
);
1215 if (getenv("CXXRTL_VOID_MY_WARRANTY")) {
1216 // Until we have proper clock tree detection, this really awful hack that opportunistically
1217 // propagates prev_* values for clocks can be used to estimate how much faster a design could
1218 // be if only one clock edge was simulated by replacing:
1219 // top.p_clk = value<1>{0u}; top.step();
1220 // top.p_clk = value<1>{1u}; top.step();
1222 // top.prev_p_clk = value<1>{0u}; top.p_clk = value<1>{1u}; top.step();
1223 // Don't rely on this; it will be removed without warning.
1224 RTLIL::Module
*cell_module
= cell
->module
->design
->module(cell
->type
);
1225 if (cell_module
!= nullptr && cell_module
->wire(conn
.first
) && conn
.second
.is_wire()) {
1226 RTLIL::Wire
*cell_module_wire
= cell_module
->wire(conn
.first
);
1227 if (edge_wires
[conn
.second
.as_wire()] && edge_wires
[cell_module_wire
]) {
1228 f
<< indent
<< mangle(cell
) << access
<< "prev_" << mangle(cell_module_wire
) << " = ";
1229 f
<< "prev_" << mangle(conn
.second
.as_wire()) << ";\n";
1233 } else if (cell
->input(conn
.first
)) {
1234 f
<< indent
<< mangle(cell
) << access
<< mangle_wire_name(conn
.first
) << ".next = ";
1235 dump_sigspec_rhs(conn
.second
);
1238 auto assign_from_outputs
= [&](bool cell_converged
) {
1239 for (auto conn
: cell
->connections()) {
1240 if (cell
->output(conn
.first
)) {
1241 if (conn
.second
.empty())
1242 continue; // ignore disconnected ports
1243 if (is_cxxrtl_sync_port(cell
, conn
.first
))
1244 continue; // fully sync ports are handled in CELL_SYNC nodes
1246 dump_sigspec_lhs(conn
.second
);
1247 f
<< " = " << mangle(cell
) << access
<< mangle_wire_name(conn
.first
);
1248 // Similarly to how there is no purpose to buffering cell inputs, there is also no purpose to buffering
1249 // combinatorial cell outputs in case the cell converges within one cycle. (To convince yourself that
1250 // this optimization is valid, consider that, since the cell converged within one cycle, it would not
1251 // have any buffered wires if they were not output ports. Imagine inlining the cell's eval() function,
1252 // and consider the fate of the localized wires that used to be output ports.)
1254 // Unlike cell inputs (which are never buffered), it is not possible to know apriori whether the cell
1255 // (which may be late bound) will converge immediately. Because of this, the choice between using .curr
1256 // (appropriate for buffered outputs) and .next (appropriate for unbuffered outputs) is made at runtime.
1257 if (cell_converged
&& is_cxxrtl_comb_port(cell
, conn
.first
))
1264 f
<< indent
<< "if (" << mangle(cell
) << access
<< "eval()) {\n";
1266 assign_from_outputs(/*cell_converged=*/true);
1268 f
<< indent
<< "} else {\n";
1270 f
<< indent
<< "converged = false;\n";
1271 assign_from_outputs(/*cell_converged=*/false);
1273 f
<< indent
<< "}\n";
1277 void dump_assign(const RTLIL::SigSig
&sigsig
)
1280 dump_sigspec_lhs(sigsig
.first
);
1282 dump_sigspec_rhs(sigsig
.second
);
1286 void dump_case_rule(const RTLIL::CaseRule
*rule
)
1288 for (auto action
: rule
->actions
)
1289 dump_assign(action
);
1290 for (auto switch_
: rule
->switches
)
1291 dump_switch_rule(switch_
);
1294 void dump_switch_rule(const RTLIL::SwitchRule
*rule
)
1296 // The switch attributes are printed before the switch condition is captured.
1298 std::string signal_temp
= fresh_temporary();
1299 f
<< indent
<< "const value<" << rule
->signal
.size() << "> &" << signal_temp
<< " = ";
1300 dump_sigspec(rule
->signal
, /*is_lhs=*/false);
1304 for (auto case_
: rule
->cases
) {
1305 // The case attributes (for nested cases) are printed before the if/else if/else statement.
1311 if (!case_
->compare
.empty()) {
1314 for (auto &compare
: case_
->compare
) {
1318 if (compare
.is_fully_def()) {
1319 f
<< signal_temp
<< " == ";
1320 dump_sigspec(compare
, /*is_lhs=*/false);
1321 } else if (compare
.is_fully_const()) {
1322 RTLIL::Const compare_mask
, compare_value
;
1323 for (auto bit
: compare
.as_const()) {
1327 compare_mask
.bits
.push_back(RTLIL::S1
);
1328 compare_value
.bits
.push_back(bit
);
1334 compare_mask
.bits
.push_back(RTLIL::S0
);
1335 compare_value
.bits
.push_back(RTLIL::S0
);
1342 f
<< "and_uu<" << compare
.size() << ">(" << signal_temp
<< ", ";
1343 dump_const(compare_mask
);
1345 dump_const(compare_value
);
1354 dump_case_rule(case_
);
1357 f
<< indent
<< "}\n";
1360 void dump_process(const RTLIL::Process
*proc
)
1363 f
<< indent
<< "// process " << proc
->name
.str() << "\n";
1364 // The case attributes (for root case) are always empty.
1365 log_assert(proc
->root_case
.attributes
.empty());
1366 dump_case_rule(&proc
->root_case
);
1367 for (auto sync
: proc
->syncs
) {
1368 RTLIL::SigBit sync_bit
;
1369 if (!sync
->signal
.empty()) {
1370 sync_bit
= sync
->signal
[0];
1371 sync_bit
= sigmaps
[sync_bit
.wire
->module
](sync_bit
);
1374 pool
<std::string
> events
;
1375 switch (sync
->type
) {
1377 log_assert(sync_bit
.wire
!= nullptr);
1378 events
.insert("posedge_" + mangle(sync_bit
));
1381 log_assert(sync_bit
.wire
!= nullptr);
1382 events
.insert("negedge_" + mangle(sync_bit
));
1385 log_assert(sync_bit
.wire
!= nullptr);
1386 events
.insert("posedge_" + mangle(sync_bit
));
1387 events
.insert("negedge_" + mangle(sync_bit
));
1391 events
.insert("true");
1400 if (!events
.empty()) {
1401 f
<< indent
<< "if (";
1403 for (auto &event
: events
) {
1411 for (auto action
: sync
->actions
)
1412 dump_assign(action
);
1414 f
<< indent
<< "}\n";
1419 void dump_wire(const RTLIL::Wire
*wire
, bool is_local_context
)
1421 if (elided_wires
.count(wire
))
1424 if (localized_wires
[wire
] && is_local_context
) {
1426 f
<< indent
<< "value<" << wire
->width
<< "> " << mangle(wire
) << ";\n";
1428 if (!localized_wires
[wire
] && !is_local_context
) {
1430 if (wire
->module
->has_attribute(ID(cxxrtl_blackbox
)) && wire
->has_attribute(ID(cxxrtl_width
))) {
1431 width
= wire
->get_string_attribute(ID(cxxrtl_width
));
1433 width
= std::to_string(wire
->width
);
1438 if (wire
->port_input
&& wire
->port_output
)
1440 else if (wire
->port_input
)
1442 else if (wire
->port_output
)
1444 f
<< (unbuffered_wires
[wire
] ? "value" : "wire") << "<" << width
<< "> " << mangle(wire
);
1445 if (wire
->has_attribute(ID::init
)) {
1447 dump_const_init(wire
->attributes
.at(ID::init
));
1450 if (edge_wires
[wire
]) {
1451 if (unbuffered_wires
[wire
]) {
1452 f
<< indent
<< "value<" << width
<< "> prev_" << mangle(wire
);
1453 if (wire
->has_attribute(ID::init
)) {
1455 dump_const_init(wire
->attributes
.at(ID::init
));
1459 for (auto edge_type
: edge_types
) {
1460 if (edge_type
.first
.wire
== wire
) {
1461 std::string prev
, next
;
1462 if (unbuffered_wires
[wire
]) {
1463 prev
= "prev_" + mangle(edge_type
.first
.wire
);
1464 next
= mangle(edge_type
.first
.wire
);
1466 prev
= mangle(edge_type
.first
.wire
) + ".curr";
1467 next
= mangle(edge_type
.first
.wire
) + ".next";
1469 prev
+= ".slice<" + std::to_string(edge_type
.first
.offset
) + ">().val()";
1470 next
+= ".slice<" + std::to_string(edge_type
.first
.offset
) + ">().val()";
1471 if (edge_type
.second
!= RTLIL::STn
) {
1472 f
<< indent
<< "bool posedge_" << mangle(edge_type
.first
) << "() const {\n";
1474 f
<< indent
<< "return !" << prev
<< " && " << next
<< ";\n";
1476 f
<< indent
<< "}\n";
1478 if (edge_type
.second
!= RTLIL::STp
) {
1479 f
<< indent
<< "bool negedge_" << mangle(edge_type
.first
) << "() const {\n";
1481 f
<< indent
<< "return " << prev
<< " && !" << next
<< ";\n";
1483 f
<< indent
<< "}\n";
1491 void dump_memory(RTLIL::Module
*module
, const RTLIL::Memory
*memory
)
1493 vector
<const RTLIL::Cell
*> init_cells
;
1494 for (auto cell
: module
->cells())
1495 if (cell
->type
== ID($meminit
) && cell
->getParam(ID::MEMID
).decode_string() == memory
->name
.str())
1496 init_cells
.push_back(cell
);
1498 std::sort(init_cells
.begin(), init_cells
.end(), [](const RTLIL::Cell
*a
, const RTLIL::Cell
*b
) {
1499 int a_addr
= a
->getPort(ID::ADDR
).as_int(), b_addr
= b
->getPort(ID::ADDR
).as_int();
1500 int a_prio
= a
->getParam(ID::PRIORITY
).as_int(), b_prio
= b
->getParam(ID::PRIORITY
).as_int();
1501 return a_prio
> b_prio
|| (a_prio
== b_prio
&& a_addr
< b_addr
);
1505 f
<< indent
<< "memory<" << memory
->width
<< "> " << mangle(memory
)
1506 << " { " << memory
->size
<< "u";
1507 if (init_cells
.empty()) {
1512 for (auto cell
: init_cells
) {
1514 RTLIL::Const data
= cell
->getPort(ID::DATA
).as_const();
1515 size_t width
= cell
->getParam(ID::WIDTH
).as_int();
1516 size_t words
= cell
->getParam(ID::WORDS
).as_int();
1517 f
<< indent
<< "memory<" << memory
->width
<< ">::init<" << words
<< "> { "
1518 << stringf("%#x", cell
->getPort(ID::ADDR
).as_int()) << ", {";
1520 for (size_t n
= 0; n
< words
; n
++) {
1522 f
<< "\n" << indent
;
1525 dump_const(data
, width
, n
* width
, /*fixed_width=*/true);
1529 f
<< "\n" << indent
<< "}},\n";
1532 f
<< indent
<< "};\n";
1536 void dump_eval_method(RTLIL::Module
*module
)
1539 f
<< indent
<< "bool converged = " << (eval_converges
.at(module
) ? "true" : "false") << ";\n";
1540 if (!module
->get_bool_attribute(ID(cxxrtl_blackbox
))) {
1541 for (auto wire
: module
->wires()) {
1542 if (edge_wires
[wire
]) {
1543 for (auto edge_type
: edge_types
) {
1544 if (edge_type
.first
.wire
== wire
) {
1545 if (edge_type
.second
!= RTLIL::STn
) {
1546 f
<< indent
<< "bool posedge_" << mangle(edge_type
.first
) << " = ";
1547 f
<< "this->posedge_" << mangle(edge_type
.first
) << "();\n";
1549 if (edge_type
.second
!= RTLIL::STp
) {
1550 f
<< indent
<< "bool negedge_" << mangle(edge_type
.first
) << " = ";
1551 f
<< "this->negedge_" << mangle(edge_type
.first
) << "();\n";
1557 for (auto wire
: module
->wires())
1558 dump_wire(wire
, /*is_local_context=*/true);
1559 for (auto node
: schedule
[module
]) {
1560 switch (node
.type
) {
1561 case FlowGraph::Node::Type::CONNECT
:
1562 dump_connect(node
.connect
);
1564 case FlowGraph::Node::Type::CELL_SYNC
:
1565 dump_cell_sync(node
.cell
);
1567 case FlowGraph::Node::Type::CELL_EVAL
:
1568 dump_cell_eval(node
.cell
);
1570 case FlowGraph::Node::Type::PROCESS
:
1571 dump_process(node
.process
);
1576 f
<< indent
<< "return converged;\n";
1580 void dump_commit_method(RTLIL::Module
*module
)
1583 f
<< indent
<< "bool changed = false;\n";
1584 for (auto wire
: module
->wires()) {
1585 if (elided_wires
.count(wire
))
1587 if (unbuffered_wires
[wire
]) {
1588 if (edge_wires
[wire
])
1589 f
<< indent
<< "prev_" << mangle(wire
) << " = " << mangle(wire
) << ";\n";
1592 if (!module
->get_bool_attribute(ID(cxxrtl_blackbox
)) || wire
->port_id
!= 0)
1593 f
<< indent
<< "changed |= " << mangle(wire
) << ".commit();\n";
1595 if (!module
->get_bool_attribute(ID(cxxrtl_blackbox
))) {
1596 for (auto memory
: module
->memories
) {
1597 if (!writable_memories
[memory
.second
])
1599 f
<< indent
<< "changed |= " << mangle(memory
.second
) << ".commit();\n";
1601 for (auto cell
: module
->cells()) {
1602 if (is_internal_cell(cell
->type
))
1604 const char *access
= is_cxxrtl_blackbox_cell(cell
) ? "->" : ".";
1605 f
<< indent
<< "changed |= " << mangle(cell
) << access
<< "commit();\n";
1608 f
<< indent
<< "return changed;\n";
1612 void dump_debug_info_method(RTLIL::Module
*module
)
1614 size_t count_public_wires
= 0;
1615 size_t count_const_wires
= 0;
1616 size_t count_alias_wires
= 0;
1617 size_t count_member_wires
= 0;
1618 size_t count_skipped_wires
= 0;
1620 f
<< indent
<< "assert(path.empty() || path[path.size() - 1] == ' ');\n";
1621 for (auto wire
: module
->wires()) {
1622 if (wire
->name
[0] != '\\')
1624 count_public_wires
++;
1625 if (debug_const_wires
.count(wire
)) {
1626 // Wire tied to a constant
1627 f
<< indent
<< "static const value<" << wire
->width
<< "> const_" << mangle(wire
) << " = ";
1628 dump_const(debug_const_wires
[wire
]);
1630 f
<< indent
<< "items.add(path + " << escape_cxx_string(get_hdl_name(wire
));
1631 f
<< ", debug_item(const_" << mangle(wire
) << ", ";
1632 f
<< wire
->start_offset
<< "));\n";
1633 count_const_wires
++;
1634 } else if (debug_alias_wires
.count(wire
)) {
1635 // Alias of a member wire
1636 f
<< indent
<< "items.add(path + " << escape_cxx_string(get_hdl_name(wire
));
1637 f
<< ", debug_item(debug_alias(), " << mangle(debug_alias_wires
[wire
]) << ", ";
1638 f
<< wire
->start_offset
<< "));\n";
1639 count_alias_wires
++;
1640 } else if (!localized_wires
.count(wire
)) {
1642 f
<< indent
<< "items.add(path + " << escape_cxx_string(get_hdl_name(wire
));
1643 f
<< ", debug_item(" << mangle(wire
) << ", ";
1644 f
<< wire
->start_offset
<< "));\n";
1645 count_member_wires
++;
1647 count_skipped_wires
++;
1650 for (auto &memory_it
: module
->memories
) {
1651 if (memory_it
.first
[0] != '\\')
1653 f
<< indent
<< "items.add(path + " << escape_cxx_string(get_hdl_name(memory_it
.second
));
1654 f
<< ", debug_item(" << mangle(memory_it
.second
) << ", ";
1655 f
<< memory_it
.second
->start_offset
<< "));\n";
1657 for (auto cell
: module
->cells()) {
1658 if (is_internal_cell(cell
->type
))
1660 const char *access
= is_cxxrtl_blackbox_cell(cell
) ? "->" : ".";
1661 f
<< indent
<< mangle(cell
) << access
<< "debug_info(items, ";
1662 f
<< "path + " << escape_cxx_string(get_hdl_name(cell
) + ' ') << ");\n";
1666 log_debug("Debug information statistics for module `%s':\n", log_id(module
));
1667 log_debug(" Public wires: %zu, of which:\n", count_public_wires
);
1668 log_debug(" Const wires: %zu\n", count_const_wires
);
1669 log_debug(" Alias wires: %zu\n", count_alias_wires
);
1670 log_debug(" Member wires: %zu\n", count_member_wires
);
1671 log_debug(" Other wires: %zu (no debug information)\n", count_skipped_wires
);
1674 void dump_metadata_map(const dict
<RTLIL::IdString
, RTLIL::Const
> &metadata_map
)
1676 if (metadata_map
.empty()) {
1677 f
<< "metadata_map()";
1680 f
<< "metadata_map({\n";
1682 for (auto metadata_item
: metadata_map
) {
1683 if (!metadata_item
.first
.begins_with("\\"))
1685 f
<< indent
<< "{ " << escape_cxx_string(metadata_item
.first
.str().substr(1)) << ", ";
1686 if (metadata_item
.second
.flags
& RTLIL::CONST_FLAG_REAL
) {
1687 f
<< std::showpoint
<< std::stod(metadata_item
.second
.decode_string()) << std::noshowpoint
;
1688 } else if (metadata_item
.second
.flags
& RTLIL::CONST_FLAG_STRING
) {
1689 f
<< escape_cxx_string(metadata_item
.second
.decode_string());
1691 f
<< metadata_item
.second
.as_int(/*is_signed=*/metadata_item
.second
.flags
& RTLIL::CONST_FLAG_SIGNED
);
1692 if (!(metadata_item
.second
.flags
& RTLIL::CONST_FLAG_SIGNED
))
1698 f
<< indent
<< "})";
1701 void dump_module_intf(RTLIL::Module
*module
)
1704 if (module
->get_bool_attribute(ID(cxxrtl_blackbox
))) {
1705 if (module
->has_attribute(ID(cxxrtl_template
)))
1706 f
<< indent
<< "template" << template_params(module
, /*is_decl=*/true) << "\n";
1707 f
<< indent
<< "struct " << mangle(module
) << " : public module {\n";
1709 for (auto wire
: module
->wires()) {
1710 if (wire
->port_id
!= 0)
1711 dump_wire(wire
, /*is_local_context=*/false);
1714 f
<< indent
<< "bool eval() override {\n";
1715 dump_eval_method(module
);
1716 f
<< indent
<< "}\n";
1718 f
<< indent
<< "bool commit() override {\n";
1719 dump_commit_method(module
);
1720 f
<< indent
<< "}\n";
1723 f
<< indent
<< "void debug_info(debug_items &items, std::string path = \"\") override {\n";
1724 dump_debug_info_method(module
);
1725 f
<< indent
<< "}\n";
1728 f
<< indent
<< "static std::unique_ptr<" << mangle(module
);
1729 f
<< template_params(module
, /*is_decl=*/false) << "> ";
1730 f
<< "create(std::string name, metadata_map parameters, metadata_map attributes);\n";
1732 f
<< indent
<< "}; // struct " << mangle(module
) << "\n";
1734 if (blackbox_specializations
.count(module
)) {
1735 // If templated black boxes are used, the constructor of any module which includes the black box cell
1736 // (which calls the declared but not defined in the generated code `create` function) may only be used
1737 // if (a) the create function is defined in the same translation unit, or (b) the create function has
1738 // a forward-declared explicit specialization.
1740 // Option (b) makes it possible to have the generated code and the black box implementation in different
1741 // translation units, which is convenient. Of course, its downside is that black boxes must predefine
1742 // a specialization for every combination of parameters the generated code may use; but since the main
1743 // purpose of templated black boxes is abstracting over datapath width, it is expected that there would
1744 // be very few such combinations anyway.
1745 for (auto specialization
: blackbox_specializations
[module
]) {
1746 f
<< indent
<< "template<>\n";
1747 f
<< indent
<< "std::unique_ptr<" << mangle(module
) << specialization
<< "> ";
1748 f
<< mangle(module
) << specialization
<< "::";
1749 f
<< "create(std::string name, metadata_map parameters, metadata_map attributes);\n";
1754 f
<< indent
<< "struct " << mangle(module
) << " : public module {\n";
1756 for (auto wire
: module
->wires())
1757 dump_wire(wire
, /*is_local_context=*/false);
1759 bool has_memories
= false;
1760 for (auto memory
: module
->memories
) {
1761 dump_memory(module
, memory
.second
);
1762 has_memories
= true;
1766 bool has_cells
= false;
1767 for (auto cell
: module
->cells()) {
1768 if (is_internal_cell(cell
->type
))
1771 RTLIL::Module
*cell_module
= module
->design
->module(cell
->type
);
1772 log_assert(cell_module
!= nullptr);
1773 if (cell_module
->get_bool_attribute(ID(cxxrtl_blackbox
))) {
1774 f
<< indent
<< "std::unique_ptr<" << mangle(cell_module
) << template_args(cell
) << "> ";
1775 f
<< mangle(cell
) << " = " << mangle(cell_module
) << template_args(cell
);
1776 f
<< "::create(" << escape_cxx_string(get_hdl_name(cell
)) << ", ";
1777 dump_metadata_map(cell
->parameters
);
1779 dump_metadata_map(cell
->attributes
);
1782 f
<< indent
<< mangle(cell_module
) << " " << mangle(cell
) << ";\n";
1788 f
<< indent
<< "bool eval() override;\n";
1789 f
<< indent
<< "bool commit() override;\n";
1791 f
<< indent
<< "void debug_info(debug_items &items, std::string path = \"\") override;\n";
1793 f
<< indent
<< "}; // struct " << mangle(module
) << "\n";
1798 void dump_module_impl(RTLIL::Module
*module
)
1800 if (module
->get_bool_attribute(ID(cxxrtl_blackbox
)))
1802 f
<< indent
<< "bool " << mangle(module
) << "::eval() {\n";
1803 dump_eval_method(module
);
1804 f
<< indent
<< "}\n";
1806 f
<< indent
<< "bool " << mangle(module
) << "::commit() {\n";
1807 dump_commit_method(module
);
1808 f
<< indent
<< "}\n";
1811 f
<< indent
<< "void " << mangle(module
) << "::debug_info(debug_items &items, std::string path) {\n";
1812 dump_debug_info_method(module
);
1813 f
<< indent
<< "}\n";
1818 void dump_design(RTLIL::Design
*design
)
1820 RTLIL::Module
*top_module
= nullptr;
1821 std::vector
<RTLIL::Module
*> modules
;
1822 TopoSort
<RTLIL::Module
*> topo_design
;
1823 for (auto module
: design
->modules()) {
1824 if (!design
->selected_module(module
))
1826 if (module
->get_bool_attribute(ID(cxxrtl_blackbox
)))
1827 modules
.push_back(module
); // cxxrtl blackboxes first
1828 if (module
->get_blackbox_attribute() || module
->get_bool_attribute(ID(cxxrtl_blackbox
)))
1830 if (module
->get_bool_attribute(ID::top
))
1831 top_module
= module
;
1833 topo_design
.node(module
);
1834 for (auto cell
: module
->cells()) {
1835 if (is_internal_cell(cell
->type
) || is_cxxrtl_blackbox_cell(cell
))
1837 RTLIL::Module
*cell_module
= design
->module(cell
->type
);
1838 log_assert(cell_module
!= nullptr);
1839 topo_design
.edge(cell_module
, module
);
1842 log_assert(topo_design
.sort());
1843 modules
.insert(modules
.end(), topo_design
.sorted
.begin(), topo_design
.sorted
.end());
1846 // The only thing more depraved than include guards, is mangling filenames to turn them into include guards.
1847 std::string include_guard
= design_ns
+ "_header";
1848 std::transform(include_guard
.begin(), include_guard
.end(), include_guard
.begin(), ::toupper
);
1850 f
<< "#ifndef " << include_guard
<< "\n";
1851 f
<< "#define " << include_guard
<< "\n";
1853 if (top_module
!= nullptr && debug_info
) {
1854 f
<< "#include <backends/cxxrtl/cxxrtl_capi.h>\n";
1856 f
<< "#ifdef __cplusplus\n";
1857 f
<< "extern \"C\" {\n";
1860 f
<< "cxxrtl_toplevel " << design_ns
<< "_create();\n";
1862 f
<< "#ifdef __cplusplus\n";
1867 f
<< "// The CXXRTL C API is not available because the design is built without debug information.\n";
1870 f
<< "#ifdef __cplusplus\n";
1872 f
<< "#include <backends/cxxrtl/cxxrtl.h>\n";
1874 f
<< "using namespace cxxrtl;\n";
1876 f
<< "namespace " << design_ns
<< " {\n";
1878 for (auto module
: modules
)
1879 dump_module_intf(module
);
1880 f
<< "} // namespace " << design_ns
<< "\n";
1882 f
<< "#endif // __cplusplus\n";
1885 *intf_f
<< f
.str(); f
.str("");
1889 f
<< "#include \"" << intf_filename
<< "\"\n";
1891 f
<< "#include <backends/cxxrtl/cxxrtl.h>\n";
1893 f
<< "#if defined(CXXRTL_INCLUDE_CAPI_IMPL) || \\\n";
1894 f
<< " defined(CXXRTL_INCLUDE_VCD_CAPI_IMPL)\n";
1895 f
<< "#include <backends/cxxrtl/cxxrtl_capi.cc>\n";
1898 f
<< "#if defined(CXXRTL_INCLUDE_VCD_CAPI_IMPL)\n";
1899 f
<< "#include <backends/cxxrtl/cxxrtl_vcd_capi.cc>\n";
1902 f
<< "using namespace cxxrtl_yosys;\n";
1904 f
<< "namespace " << design_ns
<< " {\n";
1906 for (auto module
: modules
) {
1908 dump_module_intf(module
);
1909 dump_module_impl(module
);
1911 f
<< "} // namespace " << design_ns
<< "\n";
1913 if (top_module
!= nullptr && debug_info
) {
1914 f
<< "cxxrtl_toplevel " << design_ns
<< "_create() {\n";
1916 std::string top_type
= design_ns
+ "::" + mangle(top_module
);
1917 f
<< indent
<< "return new _cxxrtl_toplevel { ";
1918 f
<< "std::unique_ptr<" << top_type
<< ">(new " + top_type
+ ")";
1924 *impl_f
<< f
.str(); f
.str("");
1927 // Edge-type sync rules require us to emit edge detectors, which require coordination between
1928 // eval and commit phases. To do this we need to collect them upfront.
1930 // Note that the simulator commit phase operates at wire granularity but edge-type sync rules
1931 // operate at wire bit granularity; it is possible to have code similar to:
1932 // wire [3:0] clocks;
1933 // always @(posedge clocks[0]) ...
1934 // To handle this we track edge sensitivity both for wires and wire bits.
1935 void register_edge_signal(SigMap
&sigmap
, RTLIL::SigSpec signal
, RTLIL::SyncType type
)
1937 signal
= sigmap(signal
);
1938 log_assert(signal
.is_wire() && signal
.is_bit());
1939 log_assert(type
== RTLIL::STp
|| type
== RTLIL::STn
|| type
== RTLIL::STe
);
1941 RTLIL::SigBit sigbit
= signal
[0];
1942 if (!edge_types
.count(sigbit
))
1943 edge_types
[sigbit
] = type
;
1944 else if (edge_types
[sigbit
] != type
)
1945 edge_types
[sigbit
] = RTLIL::STe
;
1946 edge_wires
.insert(signal
.as_wire());
1949 void analyze_design(RTLIL::Design
*design
)
1951 bool has_feedback_arcs
= false;
1952 bool has_buffered_comb_wires
= false;
1954 for (auto module
: design
->modules()) {
1955 if (!design
->selected_module(module
))
1958 SigMap
&sigmap
= sigmaps
[module
];
1961 if (module
->get_bool_attribute(ID(cxxrtl_blackbox
))) {
1962 for (auto port
: module
->ports
) {
1963 RTLIL::Wire
*wire
= module
->wire(port
);
1964 if (wire
->port_input
&& !wire
->port_output
)
1965 unbuffered_wires
.insert(wire
);
1966 if (wire
->has_attribute(ID(cxxrtl_edge
))) {
1967 RTLIL::Const edge_attr
= wire
->attributes
[ID(cxxrtl_edge
)];
1968 if (!(edge_attr
.flags
& RTLIL::CONST_FLAG_STRING
) || (int)edge_attr
.decode_string().size() != GetSize(wire
))
1969 log_cmd_error("Attribute `cxxrtl_edge' of port `%s.%s' is not a string with one character per bit.\n",
1970 log_id(module
), log_signal(wire
));
1972 std::string edges
= wire
->get_string_attribute(ID(cxxrtl_edge
));
1973 for (int i
= 0; i
< GetSize(wire
); i
++) {
1974 RTLIL::SigSpec wire_sig
= wire
;
1977 case 'p': register_edge_signal(sigmap
, wire_sig
[i
], RTLIL::STp
); break;
1978 case 'n': register_edge_signal(sigmap
, wire_sig
[i
], RTLIL::STn
); break;
1979 case 'a': register_edge_signal(sigmap
, wire_sig
[i
], RTLIL::STe
); break;
1981 log_cmd_error("Attribute `cxxrtl_edge' of port `%s.%s' contains specifiers "
1982 "other than '-', 'p', 'n', or 'a'.\n",
1983 log_id(module
), log_signal(wire
));
1989 // Black boxes converge by default, since their implementations are quite unlikely to require
1990 // internal propagation of comb signals.
1991 eval_converges
[module
] = true;
1997 for (auto conn
: module
->connections())
1998 flow
.add_node(conn
);
2000 dict
<const RTLIL::Cell
*, FlowGraph::Node
*> memrw_cell_nodes
;
2001 dict
<std::pair
<RTLIL::SigBit
, const RTLIL::Memory
*>,
2002 pool
<const RTLIL::Cell
*>> memwr_per_domain
;
2003 for (auto cell
: module
->cells()) {
2005 log_cmd_error("Unknown cell `%s'.\n", log_id(cell
->type
));
2007 RTLIL::Module
*cell_module
= design
->module(cell
->type
);
2009 cell_module
->get_blackbox_attribute() &&
2010 !cell_module
->get_bool_attribute(ID(cxxrtl_blackbox
)))
2011 log_cmd_error("External blackbox cell `%s' is not marked as a CXXRTL blackbox.\n", log_id(cell
->type
));
2014 cell_module
->get_bool_attribute(ID(cxxrtl_blackbox
)) &&
2015 cell_module
->get_bool_attribute(ID(cxxrtl_template
)))
2016 blackbox_specializations
[cell_module
].insert(template_args(cell
));
2018 FlowGraph::Node
*node
= flow
.add_node(cell
);
2020 // Various DFF cells are treated like posedge/negedge processes, see above for details.
2021 if (cell
->type
.in(ID($dff
), ID($dffe
), ID($adff
), ID($dffsr
))) {
2022 if (cell
->getPort(ID::CLK
).is_wire())
2023 register_edge_signal(sigmap
, cell
->getPort(ID::CLK
),
2024 cell
->parameters
[ID::CLK_POLARITY
].as_bool() ? RTLIL::STp
: RTLIL::STn
);
2026 // Similar for memory port cells.
2027 if (cell
->type
.in(ID($memrd
), ID($memwr
))) {
2028 if (cell
->getParam(ID::CLK_ENABLE
).as_bool()) {
2029 if (cell
->getPort(ID::CLK
).is_wire())
2030 register_edge_signal(sigmap
, cell
->getPort(ID::CLK
),
2031 cell
->parameters
[ID::CLK_POLARITY
].as_bool() ? RTLIL::STp
: RTLIL::STn
);
2033 memrw_cell_nodes
[cell
] = node
;
2035 // Optimize access to read-only memories.
2036 if (cell
->type
== ID($memwr
))
2037 writable_memories
.insert(module
->memories
[cell
->getParam(ID::MEMID
).decode_string()]);
2038 // Collect groups of memory write ports in the same domain.
2039 if (cell
->type
== ID($memwr
) && cell
->getParam(ID::CLK_ENABLE
).as_bool() && cell
->getPort(ID::CLK
).is_wire()) {
2040 RTLIL::SigBit clk_bit
= sigmap(cell
->getPort(ID::CLK
))[0];
2041 const RTLIL::Memory
*memory
= module
->memories
[cell
->getParam(ID::MEMID
).decode_string()];
2042 memwr_per_domain
[{clk_bit
, memory
}].insert(cell
);
2044 // Handling of packed memories is delegated to the `memory_unpack` pass, so we can rely on the presence
2045 // of RTLIL memory objects and $memrd/$memwr/$meminit cells.
2046 if (cell
->type
.in(ID($mem
)))
2049 for (auto cell
: module
->cells()) {
2050 // Collect groups of memory write ports read by every transparent read port.
2051 if (cell
->type
== ID($memrd
) && cell
->getParam(ID::CLK_ENABLE
).as_bool() && cell
->getPort(ID::CLK
).is_wire() &&
2052 cell
->getParam(ID::TRANSPARENT
).as_bool()) {
2053 RTLIL::SigBit clk_bit
= sigmap(cell
->getPort(ID::CLK
))[0];
2054 const RTLIL::Memory
*memory
= module
->memories
[cell
->getParam(ID::MEMID
).decode_string()];
2055 for (auto memwr_cell
: memwr_per_domain
[{clk_bit
, memory
}]) {
2056 transparent_for
[cell
].insert(memwr_cell
);
2057 // Our implementation of transparent $memrd cells reads \EN, \ADDR and \DATA from every $memwr cell
2058 // in the same domain, which isn't directly visible in the netlist. Add these uses explicitly.
2059 flow
.add_uses(memrw_cell_nodes
[cell
], memwr_cell
->getPort(ID::EN
));
2060 flow
.add_uses(memrw_cell_nodes
[cell
], memwr_cell
->getPort(ID::ADDR
));
2061 flow
.add_uses(memrw_cell_nodes
[cell
], memwr_cell
->getPort(ID::DATA
));
2066 for (auto proc
: module
->processes
) {
2067 flow
.add_node(proc
.second
);
2069 for (auto sync
: proc
.second
->syncs
)
2070 switch (sync
->type
) {
2071 // Edge-type sync rules require pre-registration.
2075 register_edge_signal(sigmap
, sync
->signal
, sync
->type
);
2078 // Level-type sync rules require no special handling.
2085 log_cmd_error("Global clock is not supported.\n");
2087 // Handling of init-type sync rules is delegated to the `proc_init` pass, so we can use the wire
2088 // attribute regardless of input.
2094 for (auto wire
: module
->wires()) {
2095 if (!flow
.is_elidable(wire
)) continue;
2096 if (wire
->port_id
!= 0) continue;
2097 if (wire
->get_bool_attribute(ID::keep
)) continue;
2098 if (wire
->name
.begins_with("$") && !elide_internal
) continue;
2099 if (wire
->name
.begins_with("\\") && !elide_public
) continue;
2100 if (edge_wires
[wire
]) continue;
2101 log_assert(flow
.wire_comb_defs
[wire
].size() == 1);
2102 elided_wires
[wire
] = **flow
.wire_comb_defs
[wire
].begin();
2105 dict
<FlowGraph::Node
*, pool
<const RTLIL::Wire
*>, hash_ptr_ops
> node_defs
;
2106 for (auto wire_comb_def
: flow
.wire_comb_defs
)
2107 for (auto node
: wire_comb_def
.second
)
2108 node_defs
[node
].insert(wire_comb_def
.first
);
2110 Scheduler
<FlowGraph::Node
> scheduler
;
2111 dict
<FlowGraph::Node
*, Scheduler
<FlowGraph::Node
>::Vertex
*, hash_ptr_ops
> node_map
;
2112 for (auto node
: flow
.nodes
)
2113 node_map
[node
] = scheduler
.add(node
);
2114 for (auto node_def
: node_defs
) {
2115 auto vertex
= node_map
[node_def
.first
];
2116 for (auto wire
: node_def
.second
)
2117 for (auto succ_node
: flow
.wire_uses
[wire
]) {
2118 auto succ_vertex
= node_map
[succ_node
];
2119 vertex
->succs
.insert(succ_vertex
);
2120 succ_vertex
->preds
.insert(vertex
);
2124 auto eval_order
= scheduler
.schedule();
2125 pool
<FlowGraph::Node
*, hash_ptr_ops
> evaluated
;
2126 pool
<const RTLIL::Wire
*> feedback_wires
;
2127 for (auto vertex
: eval_order
) {
2128 auto node
= vertex
->data
;
2129 schedule
[module
].push_back(*node
);
2130 // Any wire that is an output of node vo and input of node vi where vo is scheduled later than vi
2131 // is a feedback wire. Feedback wires indicate apparent logic loops in the design, which may be
2132 // caused by a true logic loop, but usually are a benign result of dependency tracking that works
2133 // on wire, not bit, level. Nevertheless, feedback wires cannot be localized.
2134 evaluated
.insert(node
);
2135 for (auto wire
: node_defs
[node
])
2136 for (auto succ_node
: flow
.wire_uses
[wire
])
2137 if (evaluated
[succ_node
]) {
2138 feedback_wires
.insert(wire
);
2139 // Feedback wires may never be elided because feedback requires state, but the point of elision
2140 // (and localization) is to eliminate state.
2141 elided_wires
.erase(wire
);
2145 if (!feedback_wires
.empty()) {
2146 has_feedback_arcs
= true;
2147 log("Module `%s' contains feedback arcs through wires:\n", log_id(module
));
2148 for (auto wire
: feedback_wires
)
2149 log(" %s\n", log_id(wire
));
2152 for (auto wire
: module
->wires()) {
2153 if (feedback_wires
[wire
]) continue;
2154 if (wire
->port_output
&& !module
->get_bool_attribute(ID::top
)) continue;
2155 if (wire
->name
.begins_with("$") && !unbuffer_internal
) continue;
2156 if (wire
->name
.begins_with("\\") && !unbuffer_public
) continue;
2157 if (flow
.wire_sync_defs
.count(wire
) > 0) continue;
2158 unbuffered_wires
.insert(wire
);
2159 if (edge_wires
[wire
]) continue;
2160 if (wire
->get_bool_attribute(ID::keep
)) continue;
2161 if (wire
->port_input
|| wire
->port_output
) continue;
2162 if (wire
->name
.begins_with("$") && !localize_internal
) continue;
2163 if (wire
->name
.begins_with("\\") && !localize_public
) continue;
2164 localized_wires
.insert(wire
);
2167 // For maximum performance, the state of the simulation (which is the same as the set of its double buffered
2168 // wires, since using a singly buffered wire for any kind of state introduces a race condition) should contain
2169 // no wires attached to combinatorial outputs. Feedback wires, by definition, make that impossible. However,
2170 // it is possible that a design with no feedback arcs would end up with doubly buffered wires in such cases
2171 // as a wire with multiple drivers where one of them is combinatorial and the other is synchronous. Such designs
2172 // also require more than one delta cycle to converge.
2173 pool
<const RTLIL::Wire
*> buffered_comb_wires
;
2174 for (auto wire
: module
->wires()) {
2175 if (flow
.wire_comb_defs
[wire
].size() > 0 && !unbuffered_wires
[wire
] && !feedback_wires
[wire
])
2176 buffered_comb_wires
.insert(wire
);
2178 if (!buffered_comb_wires
.empty()) {
2179 has_buffered_comb_wires
= true;
2180 log("Module `%s' contains buffered combinatorial wires:\n", log_id(module
));
2181 for (auto wire
: buffered_comb_wires
)
2182 log(" %s\n", log_id(wire
));
2185 eval_converges
[module
] = feedback_wires
.empty() && buffered_comb_wires
.empty();
2188 // Find wires that alias other wires or are tied to a constant; debug information can be enriched with these
2189 // at essentially zero additional cost.
2191 // Note that the information collected here can't be used for optimizing the netlist: debug information queries
2192 // are pure and run on a design in a stable state, which allows assumptions that do not otherwise hold.
2193 for (auto wire
: module
->wires()) {
2194 if (wire
->name
[0] != '\\')
2196 if (!unbuffered_wires
[wire
])
2198 const RTLIL::Wire
*wire_it
= wire
;
2200 if (!(flow
.wire_def_elidable
.count(wire_it
) && flow
.wire_def_elidable
[wire_it
]))
2201 break; // not an alias: complex def
2202 log_assert(flow
.wire_comb_defs
[wire_it
].size() == 1);
2203 FlowGraph::Node
*node
= *flow
.wire_comb_defs
[wire_it
].begin();
2204 if (node
->type
!= FlowGraph::Node::Type::CONNECT
)
2205 break; // not an alias: def by cell
2206 RTLIL::SigSpec rhs_sig
= node
->connect
.second
;
2207 if (rhs_sig
.is_wire()) {
2208 RTLIL::Wire
*rhs_wire
= rhs_sig
.as_wire();
2209 if (unbuffered_wires
[rhs_wire
]) {
2210 wire_it
= rhs_wire
; // maybe an alias
2212 debug_alias_wires
[wire
] = rhs_wire
; // is an alias
2215 } else if (rhs_sig
.is_fully_const()) {
2216 debug_const_wires
[wire
] = rhs_sig
.as_const(); // is a const
2219 break; // not an alias: complex rhs
2225 if (has_feedback_arcs
|| has_buffered_comb_wires
) {
2226 // Although both non-feedback buffered combinatorial wires and apparent feedback wires may be eliminated
2227 // by optimizing the design, if after `proc; flatten` there are any feedback wires remaining, it is very
2228 // likely that these feedback wires are indicative of a true logic loop, so they get emphasized in the message.
2229 const char *why_pessimistic
= nullptr;
2230 if (has_feedback_arcs
)
2231 why_pessimistic
= "feedback wires";
2232 else if (has_buffered_comb_wires
)
2233 why_pessimistic
= "buffered combinatorial wires";
2234 log_warning("Design contains %s, which require delta cycles during evaluation.\n", why_pessimistic
);
2236 log("Flattening may eliminate %s from the design.\n", why_pessimistic
);
2238 log("Converting processes to netlists may eliminate %s from the design.\n", why_pessimistic
);
2242 void check_design(RTLIL::Design
*design
, bool &has_sync_init
, bool &has_packed_mem
)
2244 has_sync_init
= has_packed_mem
= false;
2246 for (auto module
: design
->modules()) {
2247 if (module
->get_blackbox_attribute() && !module
->has_attribute(ID(cxxrtl_blackbox
)))
2250 if (!design
->selected_whole_module(module
))
2251 if (design
->selected_module(module
))
2252 log_cmd_error("Can't handle partially selected module `%s'!\n", id2cstr(module
->name
));
2253 if (!design
->selected_module(module
))
2256 for (auto proc
: module
->processes
)
2257 for (auto sync
: proc
.second
->syncs
)
2258 if (sync
->type
== RTLIL::STi
)
2259 has_sync_init
= true;
2261 for (auto cell
: module
->cells())
2262 if (cell
->type
== ID($mem
))
2263 has_packed_mem
= true;
2267 void prepare_design(RTLIL::Design
*design
)
2269 bool did_anything
= false;
2270 bool has_sync_init
, has_packed_mem
;
2272 check_design(design
, has_sync_init
, has_packed_mem
);
2274 Pass::call(design
, "flatten");
2275 did_anything
= true;
2278 Pass::call(design
, "proc");
2279 did_anything
= true;
2280 } else if (has_sync_init
) {
2281 // We're only interested in proc_init, but it depends on proc_prune and proc_clean, so call those
2282 // in case they weren't already. (This allows `yosys foo.v -o foo.cc` to work.)
2283 Pass::call(design
, "proc_prune");
2284 Pass::call(design
, "proc_clean");
2285 Pass::call(design
, "proc_init");
2286 did_anything
= true;
2288 if (has_packed_mem
) {
2289 Pass::call(design
, "memory_unpack");
2290 did_anything
= true;
2292 // Recheck the design if it was modified.
2293 if (has_sync_init
|| has_packed_mem
)
2294 check_design(design
, has_sync_init
, has_packed_mem
);
2295 log_assert(!(has_sync_init
|| has_packed_mem
));
2299 analyze_design(design
);
2303 struct CxxrtlBackend
: public Backend
{
2304 static const int DEFAULT_OPT_LEVEL
= 6;
2305 static const int OPT_LEVEL_DEBUG
= 4;
2306 static const int DEFAULT_DEBUG_LEVEL
= 1;
2308 CxxrtlBackend() : Backend("cxxrtl", "convert design to C++ RTL simulation") { }
2309 void help() YS_OVERRIDE
2311 // |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|
2313 log(" write_cxxrtl [options] [filename]\n");
2315 log("Write C++ code that simulates the design. The generated code requires a driver\n");
2316 log("that instantiates the design, toggles its clock, and interacts with its ports.\n");
2318 log("The following driver may be used as an example for a design with a single clock\n");
2319 log("driving rising edge triggered flip-flops:\n");
2321 log(" #include \"top.cc\"\n");
2323 log(" int main() {\n");
2324 log(" cxxrtl_design::p_top top;\n");
2325 log(" top.step();\n");
2326 log(" while (1) {\n");
2327 log(" /* user logic */\n");
2328 log(" top.p_clk = value<1> {0u};\n");
2329 log(" top.step();\n");
2330 log(" top.p_clk = value<1> {1u};\n");
2331 log(" top.step();\n");
2335 log("Note that CXXRTL simulations, just like the hardware they are simulating, are\n");
2336 log("subject to race conditions. If, in the example above, the user logic would run\n");
2337 log("simultaneously with the rising edge of the clock, the design would malfunction.\n");
2339 log("This backend supports replacing parts of the design with black boxes implemented\n");
2340 log("in C++. If a module marked as a CXXRTL black box, its implementation is ignored,\n");
2341 log("and the generated code consists only of an interface and a factory function.\n");
2342 log("The driver must implement the factory function that creates an implementation of\n");
2343 log("the black box, taking into account the parameters it is instantiated with.\n");
2345 log("For example, the following Verilog code defines a CXXRTL black box interface for\n");
2346 log("a synchronous debug sink:\n");
2348 log(" (* cxxrtl_blackbox *)\n");
2349 log(" module debug(...);\n");
2350 log(" (* cxxrtl_edge = \"p\" *) input clk;\n");
2351 log(" input en;\n");
2352 log(" input [7:0] i_data;\n");
2353 log(" (* cxxrtl_sync *) output [7:0] o_data;\n");
2354 log(" endmodule\n");
2356 log("For this HDL interface, this backend will generate the following C++ interface:\n");
2358 log(" struct bb_p_debug : public module {\n");
2359 log(" value<1> p_clk;\n");
2360 log(" bool posedge_p_clk() const { /* ... */ }\n");
2361 log(" value<1> p_en;\n");
2362 log(" value<8> p_i_data;\n");
2363 log(" wire<8> p_o_data;\n");
2365 log(" bool eval() override;\n");
2366 log(" bool commit() override;\n");
2368 log(" static std::unique_ptr<bb_p_debug>\n");
2369 log(" create(std::string name, metadata_map parameters, metadata_map attributes);\n");
2372 log("The `create' function must be implemented by the driver. For example, it could\n");
2373 log("always provide an implementation logging the values to standard error stream:\n");
2375 log(" namespace cxxrtl_design {\n");
2377 log(" struct stderr_debug : public bb_p_debug {\n");
2378 log(" bool eval() override {\n");
2379 log(" if (posedge_p_clk() && p_en)\n");
2380 log(" fprintf(stderr, \"debug: %%02x\\n\", p_i_data.data[0]);\n");
2381 log(" p_o_data.next = p_i_data;\n");
2382 log(" return bb_p_debug::eval();\n");
2386 log(" std::unique_ptr<bb_p_debug>\n");
2387 log(" bb_p_debug::create(std::string name, cxxrtl::metadata_map parameters,\n");
2388 log(" cxxrtl::metadata_map attributes) {\n");
2389 log(" return std::make_unique<stderr_debug>();\n");
2394 log("For complex applications of black boxes, it is possible to parameterize their\n");
2395 log("port widths. For example, the following Verilog code defines a CXXRTL black box\n");
2396 log("interface for a configurable width debug sink:\n");
2398 log(" (* cxxrtl_blackbox, cxxrtl_template = \"WIDTH\" *)\n");
2399 log(" module debug(...);\n");
2400 log(" parameter WIDTH = 8;\n");
2401 log(" (* cxxrtl_edge = \"p\" *) input clk;\n");
2402 log(" input en;\n");
2403 log(" (* cxxrtl_width = \"WIDTH\" *) input [WIDTH - 1:0] i_data;\n");
2404 log(" (* cxxrtl_width = \"WIDTH\" *) output [WIDTH - 1:0] o_data;\n");
2405 log(" endmodule\n");
2407 log("For this parametric HDL interface, this backend will generate the following C++\n");
2408 log("interface (only the differences are shown):\n");
2410 log(" template<size_t WIDTH>\n");
2411 log(" struct bb_p_debug : public module {\n");
2413 log(" value<WIDTH> p_i_data;\n");
2414 log(" wire<WIDTH> p_o_data;\n");
2416 log(" static std::unique_ptr<bb_p_debug<WIDTH>>\n");
2417 log(" create(std::string name, metadata_map parameters, metadata_map attributes);\n");
2420 log("The `create' function must be implemented by the driver, specialized for every\n");
2421 log("possible combination of template parameters. (Specialization is necessary to\n");
2422 log("enable separate compilation of generated code and black box implementations.)\n");
2424 log(" template<size_t SIZE>\n");
2425 log(" struct stderr_debug : public bb_p_debug<SIZE> {\n");
2429 log(" template<>\n");
2430 log(" std::unique_ptr<bb_p_debug<8>>\n");
2431 log(" bb_p_debug<8>::create(std::string name, cxxrtl::metadata_map parameters,\n");
2432 log(" cxxrtl::metadata_map attributes) {\n");
2433 log(" return std::make_unique<stderr_debug<8>>();\n");
2436 log("The following attributes are recognized by this backend:\n");
2438 log(" cxxrtl_blackbox\n");
2439 log(" only valid on modules. if specified, the module contents are ignored,\n");
2440 log(" and the generated code includes only the module interface and a factory\n");
2441 log(" function, which will be called to instantiate the module.\n");
2443 log(" cxxrtl_edge\n");
2444 log(" only valid on inputs of black boxes. must be one of \"p\", \"n\", \"a\".\n");
2445 log(" if specified on signal `clk`, the generated code includes edge detectors\n");
2446 log(" `posedge_p_clk()` (if \"p\"), `negedge_p_clk()` (if \"n\"), or both (if\n");
2447 log(" \"a\"), simplifying implementation of clocked black boxes.\n");
2449 log(" cxxrtl_template\n");
2450 log(" only valid on black boxes. must contain a space separated sequence of\n");
2451 log(" identifiers that have a corresponding black box parameters. for each\n");
2452 log(" of them, the generated code includes a `size_t` template parameter.\n");
2454 log(" cxxrtl_width\n");
2455 log(" only valid on ports of black boxes. must be a constant expression, which\n");
2456 log(" is directly inserted into generated code.\n");
2458 log(" cxxrtl_comb, cxxrtl_sync\n");
2459 log(" only valid on outputs of black boxes. if specified, indicates that every\n");
2460 log(" bit of the output port is driven, correspondingly, by combinatorial or\n");
2461 log(" synchronous logic. this knowledge is used for scheduling optimizations.\n");
2462 log(" if neither is specified, the output will be pessimistically treated as\n");
2463 log(" driven by both combinatorial and synchronous logic.\n");
2465 log("The following options are supported by this backend:\n");
2468 log(" generate separate interface (.h) and implementation (.cc) files.\n");
2469 log(" if specified, the backend must be called with a filename, and filename\n");
2470 log(" of the interface is derived from filename of the implementation.\n");
2471 log(" otherwise, interface and implementation are generated together.\n");
2473 log(" -namespace <ns-name>\n");
2474 log(" place the generated code into namespace <ns-name>. if not specified,\n");
2475 log(" \"cxxrtl_design\" is used.\n");
2477 log(" -noflatten\n");
2478 log(" don't flatten the design. fully flattened designs can evaluate within\n");
2479 log(" one delta cycle if they have no combinatorial feedback.\n");
2480 log(" note that the debug interface and waveform dumps use full hierarchical\n");
2481 log(" names for all wires even in flattened designs.\n");
2484 log(" don't convert processes to netlists. in most designs, converting\n");
2485 log(" processes significantly improves evaluation performance at the cost of\n");
2486 log(" slight increase in compilation time.\n");
2488 log(" -O <level>\n");
2489 log(" set the optimization level. the default is -O%d. higher optimization\n", DEFAULT_OPT_LEVEL
);
2490 log(" levels dramatically decrease compile and run time, and highest level\n");
2491 log(" possible for a design should be used.\n");
2494 log(" no optimization.\n");
2497 log(" localize internal wires if possible.\n");
2500 log(" like -O1, and unbuffer internal wires if possible.\n");
2503 log(" like -O2, and elide internal wires if possible.\n");
2506 log(" like -O3, and unbuffer public wires not marked (*keep*) if possible.\n");
2509 log(" like -O4, and localize public wires not marked (*keep*) if possible.\n");
2512 log(" like -O5, and elide public wires not marked (*keep*) if possible.\n");
2515 log(" highest optimization level that provides debug information for all\n");
2516 log(" public wires. currently, alias for -O%d.\n", OPT_LEVEL_DEBUG
);
2518 log(" -g <level>\n");
2519 log(" set the debug level. the default is -g%d. higher debug levels provide\n", DEFAULT_DEBUG_LEVEL
);
2520 log(" more visibility and generate more code, but do not pessimize evaluation.\n");
2523 log(" no debug information.\n");
2526 log(" debug information for non-optimized public wires. this also makes it\n");
2527 log(" possible to use the C API.\n");
2531 void execute(std::ostream
*&f
, std::string filename
, std::vector
<std::string
> args
, RTLIL::Design
*design
) YS_OVERRIDE
2533 bool noflatten
= false;
2534 bool noproc
= false;
2535 int opt_level
= DEFAULT_OPT_LEVEL
;
2536 int debug_level
= DEFAULT_DEBUG_LEVEL
;
2537 CxxrtlWorker worker
;
2539 log_header(design
, "Executing CXXRTL backend.\n");
2542 for (argidx
= 1; argidx
< args
.size(); argidx
++)
2544 if (args
[argidx
] == "-noflatten") {
2548 if (args
[argidx
] == "-noproc") {
2552 if (args
[argidx
] == "-Og") {
2553 opt_level
= OPT_LEVEL_DEBUG
;
2556 if (args
[argidx
] == "-O" && argidx
+1 < args
.size() && args
[argidx
+1] == "g") {
2558 opt_level
= OPT_LEVEL_DEBUG
;
2561 if (args
[argidx
] == "-O" && argidx
+1 < args
.size()) {
2562 opt_level
= std::stoi(args
[++argidx
]);
2565 if (args
[argidx
].substr(0, 2) == "-O" && args
[argidx
].size() == 3 && isdigit(args
[argidx
][2])) {
2566 opt_level
= std::stoi(args
[argidx
].substr(2));
2569 if (args
[argidx
] == "-g" && argidx
+1 < args
.size()) {
2570 debug_level
= std::stoi(args
[++argidx
]);
2573 if (args
[argidx
].substr(0, 2) == "-g" && args
[argidx
].size() == 3 && isdigit(args
[argidx
][2])) {
2574 debug_level
= std::stoi(args
[argidx
].substr(2));
2577 if (args
[argidx
] == "-header") {
2578 worker
.split_intf
= true;
2581 if (args
[argidx
] == "-namespace" && argidx
+1 < args
.size()) {
2582 worker
.design_ns
= args
[++argidx
];
2587 extra_args(f
, filename
, args
, argidx
);
2589 worker
.run_flatten
= !noflatten
;
2590 worker
.run_proc
= !noproc
;
2591 switch (opt_level
) {
2592 // the highest level here must match DEFAULT_OPT_LEVEL
2594 worker
.elide_public
= true;
2597 worker
.localize_public
= true;
2600 worker
.unbuffer_public
= true;
2603 worker
.elide_internal
= true;
2606 worker
.localize_internal
= true;
2609 worker
.unbuffer_internal
= true;
2614 log_cmd_error("Invalid optimization level %d.\n", opt_level
);
2616 switch (debug_level
) {
2617 // the highest level here must match DEFAULT_DEBUG_LEVEL
2619 worker
.debug_info
= true;
2624 log_cmd_error("Invalid debug information level %d.\n", debug_level
);
2627 std::ofstream intf_f
;
2628 if (worker
.split_intf
) {
2629 if (filename
== "<stdout>")
2630 log_cmd_error("Option -header must be used with a filename.\n");
2632 worker
.intf_filename
= filename
.substr(0, filename
.rfind('.')) + ".h";
2633 intf_f
.open(worker
.intf_filename
, std::ofstream::trunc
);
2635 log_cmd_error("Can't open file `%s' for writing: %s\n",
2636 worker
.intf_filename
.c_str(), strerror(errno
));
2638 worker
.intf_f
= &intf_f
;
2642 worker
.prepare_design(design
);
2643 worker
.dump_design(design
);
2647 PRIVATE_NAMESPACE_END