2019-02-08 16:53:12 -06:00
|
|
|
/*
|
|
|
|
* yosys -- Yosys Open SYnthesis Suite
|
|
|
|
*
|
|
|
|
* Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>
|
2019-06-12 11:40:51 -05:00
|
|
|
* 2019 Eddie Hung <eddie@fpgeh.com>
|
2019-02-08 16:53:12 -06:00
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2019-06-14 14:40:51 -05:00
|
|
|
// https://stackoverflow.com/a/46137633
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
#include <stdlib.h>
|
|
|
|
#define __builtin_bswap32 _byteswap_ulong
|
|
|
|
#elif defined(__APPLE__)
|
|
|
|
#include <libkern/OSByteOrder.h>
|
|
|
|
#define __builtin_bswap32 OSSwapInt32
|
|
|
|
#endif
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
#include "kernel/yosys.h"
|
|
|
|
#include "kernel/sigtools.h"
|
2019-04-17 13:08:42 -05:00
|
|
|
#include "kernel/utils.h"
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
USING_YOSYS_NAMESPACE
|
|
|
|
PRIVATE_NAMESPACE_BEGIN
|
|
|
|
|
2019-06-14 14:25:06 -05:00
|
|
|
inline int32_t to_big_endian(int32_t i32) {
|
|
|
|
#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
|
|
|
|
return __builtin_bswap32(i32);
|
|
|
|
#elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
|
|
|
|
return i32;
|
|
|
|
#else
|
|
|
|
#error "Unknown endianness"
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
void aiger_encode(std::ostream &f, int x)
|
|
|
|
{
|
|
|
|
log_assert(x >= 0);
|
|
|
|
|
|
|
|
while (x & ~0x7f) {
|
|
|
|
f.put((x & 0x7f) | 0x80);
|
|
|
|
x = x >> 7;
|
|
|
|
}
|
|
|
|
|
|
|
|
f.put(x);
|
|
|
|
}
|
|
|
|
|
2019-02-11 17:18:42 -06:00
|
|
|
struct XAigerWriter
|
2019-02-08 16:53:12 -06:00
|
|
|
{
|
|
|
|
Module *module;
|
|
|
|
SigMap sigmap;
|
|
|
|
|
|
|
|
pool<SigBit> input_bits, output_bits;
|
2019-06-16 11:34:26 -05:00
|
|
|
dict<SigBit, SigBit> not_map, alias_map;
|
2019-02-08 16:53:12 -06:00
|
|
|
dict<SigBit, pair<SigBit, SigBit>> and_map;
|
2019-05-27 13:38:52 -05:00
|
|
|
vector<std::tuple<SigBit,RTLIL::Cell*,RTLIL::IdString,int>> ci_bits;
|
|
|
|
vector<std::tuple<SigBit,RTLIL::Cell*,RTLIL::IdString,int,int>> co_bits;
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
vector<pair<int, int>> aig_gates;
|
2019-06-16 11:34:26 -05:00
|
|
|
vector<int> aig_outputs;
|
2019-02-08 16:53:12 -06:00
|
|
|
int aig_m = 0, aig_i = 0, aig_l = 0, aig_o = 0, aig_a = 0;
|
|
|
|
|
|
|
|
dict<SigBit, int> aig_map;
|
|
|
|
dict<SigBit, int> ordered_outputs;
|
|
|
|
|
2019-04-12 16:13:11 -05:00
|
|
|
vector<Cell*> box_list;
|
2019-06-20 21:27:00 -05:00
|
|
|
bool omode = false;
|
2019-04-12 16:13:11 -05:00
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
int mkgate(int a0, int a1)
|
|
|
|
{
|
|
|
|
aig_m++, aig_a++;
|
|
|
|
aig_gates.push_back(a0 > a1 ? make_pair(a0, a1) : make_pair(a1, a0));
|
|
|
|
return 2*aig_m;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bit2aig(SigBit bit)
|
|
|
|
{
|
2019-06-21 00:09:13 -05:00
|
|
|
auto it = aig_map.find(bit);
|
|
|
|
if (it != aig_map.end()) {
|
|
|
|
log_assert(it->second >= 0);
|
|
|
|
return it->second;
|
|
|
|
}
|
|
|
|
|
2019-06-21 14:43:20 -05:00
|
|
|
// NB: Cannot use iterator returned from aig_map.insert()
|
|
|
|
// since this function is called recursively
|
|
|
|
|
2019-06-21 00:09:13 -05:00
|
|
|
int a = -1;
|
|
|
|
if (not_map.count(bit)) {
|
|
|
|
a = bit2aig(not_map.at(bit)) ^ 1;
|
|
|
|
} else
|
|
|
|
if (and_map.count(bit)) {
|
|
|
|
auto args = and_map.at(bit);
|
|
|
|
int a0 = bit2aig(args.first);
|
|
|
|
int a1 = bit2aig(args.second);
|
|
|
|
a = mkgate(a0, a1);
|
|
|
|
} else
|
|
|
|
if (alias_map.count(bit)) {
|
|
|
|
a = bit2aig(alias_map.at(bit));
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bit == State::Sx || bit == State::Sz) {
|
2019-06-21 14:46:55 -05:00
|
|
|
log_debug("Design contains 'x' or 'z' bits. Treating as 1'b0.\n");
|
2019-06-21 00:09:13 -05:00
|
|
|
a = aig_map.at(State::S0);
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-06-21 00:09:13 -05:00
|
|
|
log_assert(a >= 0);
|
|
|
|
aig_map[bit] = a;
|
|
|
|
return a;
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-06-16 11:34:26 -05:00
|
|
|
XAigerWriter(Module *module, bool holes_mode=false) : module(module), sigmap(module)
|
2019-02-08 16:53:12 -06:00
|
|
|
{
|
|
|
|
pool<SigBit> undriven_bits;
|
|
|
|
pool<SigBit> unused_bits;
|
|
|
|
|
|
|
|
// promote public wires
|
|
|
|
for (auto wire : module->wires())
|
|
|
|
if (wire->name[0] == '\\')
|
|
|
|
sigmap.add(wire);
|
|
|
|
|
|
|
|
// promote input wires
|
|
|
|
for (auto wire : module->wires())
|
|
|
|
if (wire->port_input)
|
|
|
|
sigmap.add(wire);
|
|
|
|
|
|
|
|
// promote output wires
|
|
|
|
for (auto wire : module->wires())
|
|
|
|
if (wire->port_output)
|
|
|
|
sigmap.add(wire);
|
|
|
|
|
|
|
|
for (auto wire : module->wires())
|
|
|
|
{
|
2019-04-23 18:11:14 -05:00
|
|
|
bool keep = wire->attributes.count("\\keep");
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
for (int i = 0; i < GetSize(wire); i++)
|
|
|
|
{
|
|
|
|
SigBit wirebit(wire, i);
|
|
|
|
SigBit bit = sigmap(wirebit);
|
|
|
|
|
2019-06-12 17:44:30 -05:00
|
|
|
if (bit.wire) {
|
|
|
|
undriven_bits.insert(bit);
|
|
|
|
unused_bits.insert(bit);
|
|
|
|
}
|
2019-02-08 16:53:12 -06:00
|
|
|
|
2019-05-29 17:24:09 -05:00
|
|
|
if (wire->port_input || keep) {
|
|
|
|
if (bit != wirebit)
|
|
|
|
alias_map[bit] = wirebit;
|
2019-04-23 18:11:14 -05:00
|
|
|
input_bits.insert(wirebit);
|
2019-05-29 17:24:09 -05:00
|
|
|
}
|
2019-02-08 16:53:12 -06:00
|
|
|
|
2019-04-23 18:11:14 -05:00
|
|
|
if (wire->port_output || keep) {
|
2019-06-20 12:21:57 -05:00
|
|
|
if (bit != RTLIL::Sx) {
|
|
|
|
if (bit != wirebit)
|
|
|
|
alias_map[wirebit] = bit;
|
|
|
|
output_bits.insert(wirebit);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
log_debug("Skipping PO '%s' driven by 1'bx\n", log_signal(wirebit));
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-22 13:22:29 -05:00
|
|
|
for (auto bit : input_bits)
|
2019-05-29 17:24:09 -05:00
|
|
|
undriven_bits.erase(sigmap(bit));
|
2019-02-08 16:53:12 -06:00
|
|
|
for (auto bit : output_bits)
|
2019-02-26 14:17:51 -06:00
|
|
|
if (!bit.wire->port_input)
|
|
|
|
unused_bits.erase(bit);
|
2019-02-08 16:53:12 -06:00
|
|
|
|
2019-06-14 15:34:40 -05:00
|
|
|
// TODO: Speed up toposort -- ultimately we care about
|
|
|
|
// box ordering, but not individual AIG cells
|
2019-06-14 15:28:47 -05:00
|
|
|
dict<SigBit, pool<IdString>> bit_drivers, bit_users;
|
|
|
|
TopoSort<IdString, RTLIL::sort_by_id_str> toposort;
|
2019-04-17 13:08:42 -05:00
|
|
|
bool abc_box_seen = false;
|
|
|
|
|
2019-06-14 15:07:56 -05:00
|
|
|
for (auto cell : module->selected_cells()) {
|
2019-02-08 16:53:12 -06:00
|
|
|
if (cell->type == "$_NOT_")
|
|
|
|
{
|
|
|
|
SigBit A = sigmap(cell->getPort("\\A").as_bit());
|
|
|
|
SigBit Y = sigmap(cell->getPort("\\Y").as_bit());
|
|
|
|
unused_bits.erase(A);
|
|
|
|
undriven_bits.erase(Y);
|
|
|
|
not_map[Y] = A;
|
2019-06-14 15:28:47 -05:00
|
|
|
if (!holes_mode) {
|
|
|
|
toposort.node(cell->name);
|
|
|
|
bit_users[A].insert(cell->name);
|
|
|
|
bit_drivers[Y].insert(cell->name);
|
|
|
|
}
|
2019-02-08 16:53:12 -06:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell->type == "$_AND_")
|
|
|
|
{
|
|
|
|
SigBit A = sigmap(cell->getPort("\\A").as_bit());
|
|
|
|
SigBit B = sigmap(cell->getPort("\\B").as_bit());
|
|
|
|
SigBit Y = sigmap(cell->getPort("\\Y").as_bit());
|
|
|
|
unused_bits.erase(A);
|
|
|
|
unused_bits.erase(B);
|
|
|
|
undriven_bits.erase(Y);
|
|
|
|
and_map[Y] = make_pair(A, B);
|
2019-06-14 12:13:17 -05:00
|
|
|
if (!holes_mode) {
|
2019-06-14 15:28:47 -05:00
|
|
|
toposort.node(cell->name);
|
|
|
|
bit_users[A].insert(cell->name);
|
|
|
|
bit_users[B].insert(cell->name);
|
|
|
|
bit_drivers[Y].insert(cell->name);
|
2019-06-14 12:13:17 -05:00
|
|
|
}
|
2019-02-08 16:53:12 -06:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2019-06-14 15:28:47 -05:00
|
|
|
log_assert(!holes_mode);
|
|
|
|
|
2019-06-14 12:13:17 -05:00
|
|
|
RTLIL::Module* inst_module = module->design->module(cell->type);
|
2019-06-16 11:34:26 -05:00
|
|
|
if (inst_module && inst_module->attributes.count("\\abc_box_id")) {
|
2019-04-19 17:47:36 -05:00
|
|
|
abc_box_seen = true;
|
2019-06-14 15:28:47 -05:00
|
|
|
|
|
|
|
if (!holes_mode) {
|
|
|
|
toposort.node(cell->name);
|
|
|
|
for (const auto &conn : cell->connections()) {
|
|
|
|
if (cell->input(conn.first)) {
|
|
|
|
// Ignore inout for the sake of topographical ordering
|
|
|
|
if (cell->output(conn.first)) continue;
|
|
|
|
for (auto bit : sigmap(conn.second))
|
|
|
|
bit_users[bit].insert(cell->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell->output(conn.first))
|
|
|
|
for (auto bit : sigmap(conn.second))
|
|
|
|
bit_drivers[bit].insert(cell->name);
|
|
|
|
}
|
|
|
|
}
|
2019-04-19 17:47:36 -05:00
|
|
|
}
|
|
|
|
else {
|
2019-04-17 13:08:42 -05:00
|
|
|
for (const auto &c : cell->connections()) {
|
2019-04-17 18:03:29 -05:00
|
|
|
if (c.second.is_fully_const()) continue;
|
2019-06-12 17:43:43 -05:00
|
|
|
auto is_input = cell->input(c.first);
|
|
|
|
auto is_output = cell->output(c.first);
|
2019-06-21 17:45:51 -05:00
|
|
|
if (!is_input && !is_output)
|
|
|
|
log_error("Connection '%s' on cell '%s' (type '%s') not recognised!\n", log_id(c.first), log_id(cell), log_id(cell->type));
|
2019-06-12 17:43:43 -05:00
|
|
|
|
|
|
|
if (is_input) {
|
|
|
|
for (auto b : c.second.bits()) {
|
|
|
|
Wire *w = b.wire;
|
|
|
|
if (!w) continue;
|
|
|
|
if (!w->port_output) {
|
2019-04-17 13:08:42 -05:00
|
|
|
SigBit I = sigmap(b);
|
|
|
|
if (I != b)
|
|
|
|
alias_map[b] = I;
|
2019-04-16 17:01:45 -05:00
|
|
|
output_bits.insert(b);
|
2019-04-17 13:08:42 -05:00
|
|
|
unused_bits.erase(b);
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
2019-02-21 13:15:25 -06:00
|
|
|
}
|
2019-06-12 17:43:43 -05:00
|
|
|
}
|
|
|
|
if (is_output) {
|
|
|
|
for (auto b : c.second.bits()) {
|
|
|
|
Wire *w = b.wire;
|
|
|
|
if (!w) continue;
|
2019-05-28 14:42:17 -05:00
|
|
|
input_bits.insert(b);
|
2019-04-17 13:08:42 -05:00
|
|
|
SigBit O = sigmap(b);
|
2019-05-28 14:42:17 -05:00
|
|
|
if (O != b)
|
|
|
|
alias_map[O] = b;
|
2019-04-17 18:03:29 -05:00
|
|
|
undriven_bits.erase(O);
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
2019-02-16 23:00:39 -06:00
|
|
|
}
|
2019-02-15 13:51:21 -06:00
|
|
|
}
|
|
|
|
}
|
2019-04-12 16:13:11 -05:00
|
|
|
|
2019-04-12 18:17:48 -05:00
|
|
|
//log_warning("Unsupported cell type: %s (%s)\n", log_id(cell->type), log_id(cell));
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-06-14 15:31:18 -05:00
|
|
|
if (abc_box_seen) {
|
2019-04-17 13:08:42 -05:00
|
|
|
for (auto &it : bit_users)
|
|
|
|
if (bit_drivers.count(it.first))
|
|
|
|
for (auto driver_cell : bit_drivers.at(it.first))
|
2019-06-14 15:28:47 -05:00
|
|
|
for (auto user_cell : it.second)
|
|
|
|
toposort.edge(driver_cell, user_cell);
|
|
|
|
|
|
|
|
#if 0
|
2019-06-04 14:01:25 -05:00
|
|
|
toposort.analyze_loops = true;
|
|
|
|
#endif
|
|
|
|
bool no_loops = toposort.sort();
|
2019-06-14 15:28:47 -05:00
|
|
|
#if 0
|
2019-06-04 14:01:25 -05:00
|
|
|
unsigned i = 0;
|
|
|
|
for (auto &it : toposort.loops) {
|
2019-06-26 22:02:38 -05:00
|
|
|
log(" loop %d\n", i++);
|
|
|
|
for (auto cell_name : it) {
|
|
|
|
auto cell = module->cell(cell_name);
|
|
|
|
log_assert(cell);
|
|
|
|
log("\t%s (%s @ %s)\n", log_id(cell), log_id(cell->type), cell->get_src_attribute().c_str());
|
|
|
|
}
|
2019-06-04 14:01:25 -05:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
log_assert(no_loops);
|
|
|
|
|
2019-06-27 18:07:14 -05:00
|
|
|
pool<IdString> seen_boxes;
|
2019-04-17 13:08:42 -05:00
|
|
|
for (auto cell_name : toposort.sorted) {
|
|
|
|
RTLIL::Cell *cell = module->cell(cell_name);
|
2019-06-27 18:07:14 -05:00
|
|
|
log_assert(cell);
|
|
|
|
|
2019-04-17 13:08:42 -05:00
|
|
|
RTLIL::Module* box_module = module->design->module(cell->type);
|
2019-06-14 15:28:47 -05:00
|
|
|
if (!box_module || !box_module->attributes.count("\\abc_box_id"))
|
|
|
|
continue;
|
2019-04-17 13:08:42 -05:00
|
|
|
|
2019-06-27 18:07:14 -05:00
|
|
|
if (seen_boxes.insert(cell->type).second) {
|
|
|
|
auto it = box_module->attributes.find("\\abc_carry");
|
|
|
|
if (it != box_module->attributes.end()) {
|
|
|
|
RTLIL::Wire *carry_in = nullptr, *carry_out = nullptr;
|
|
|
|
auto carry_in_out = it->second.decode_string();
|
|
|
|
auto pos = carry_in_out.find(',');
|
|
|
|
if (pos == std::string::npos)
|
|
|
|
log_error("'abc_carry' attribute on module '%s' does not contain ','.\n", log_id(cell->type));
|
|
|
|
auto carry_in_name = RTLIL::escape_id(carry_in_out.substr(0, pos));
|
|
|
|
carry_in = box_module->wire(carry_in_name);
|
|
|
|
if (!carry_in || !carry_in->port_input)
|
|
|
|
log_error("'abc_carry' on module '%s' contains '%s' which does not exist or is not an input port.\n", log_id(cell->type), carry_in_name.c_str());
|
|
|
|
|
|
|
|
auto carry_out_name = RTLIL::escape_id(carry_in_out.substr(pos+1));
|
|
|
|
carry_out = box_module->wire(carry_out_name);
|
|
|
|
if (!carry_out || !carry_out->port_output)
|
|
|
|
log_error("'abc_carry' on module '%s' contains '%s' which does not exist or is not an output port.\n", log_id(cell->type), carry_out_name.c_str());
|
|
|
|
|
|
|
|
auto &ports = box_module->ports;
|
|
|
|
for (auto jt = ports.begin(); jt != ports.end(); ) {
|
|
|
|
RTLIL::Wire* w = box_module->wire(*jt);
|
|
|
|
log_assert(w);
|
|
|
|
if (w == carry_in || w == carry_out) {
|
|
|
|
jt = ports.erase(jt);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (w->port_id > carry_in->port_id)
|
|
|
|
--w->port_id;
|
|
|
|
if (w->port_id > carry_out->port_id)
|
|
|
|
--w->port_id;
|
|
|
|
log_assert(w->port_input || w->port_output);
|
|
|
|
log_assert(ports[w->port_id-1] == w->name);
|
|
|
|
++jt;
|
2019-05-30 03:23:36 -05:00
|
|
|
}
|
2019-06-27 18:07:14 -05:00
|
|
|
ports.push_back(carry_in->name);
|
|
|
|
carry_in->port_id = ports.size();
|
|
|
|
ports.push_back(carry_out->name);
|
|
|
|
carry_out->port_id = ports.size();
|
2019-05-30 03:23:36 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-21 18:19:23 -05:00
|
|
|
// Fully pad all unused input connections of this box cell with S0
|
2019-05-26 13:26:38 -05:00
|
|
|
// Fully pad all undriven output connections of this box cell with anonymous wires
|
2019-05-28 01:10:59 -05:00
|
|
|
// NB: Assume box_module->ports are sorted alphabetically
|
|
|
|
// (as RTLIL::Module::fixup_ports() would do)
|
|
|
|
for (const auto &port_name : box_module->ports) {
|
|
|
|
RTLIL::Wire* w = box_module->wire(port_name);
|
|
|
|
log_assert(w);
|
|
|
|
auto it = cell->connections_.find(port_name);
|
2019-05-21 18:19:23 -05:00
|
|
|
if (w->port_input) {
|
2019-05-28 01:10:59 -05:00
|
|
|
RTLIL::SigSpec rhs;
|
2019-05-21 18:19:23 -05:00
|
|
|
if (it != cell->connections_.end()) {
|
2019-05-26 13:26:38 -05:00
|
|
|
if (GetSize(it->second) < GetSize(w))
|
|
|
|
it->second.append(RTLIL::SigSpec(RTLIL::S0, GetSize(w)-GetSize(it->second)));
|
2019-05-28 01:10:59 -05:00
|
|
|
rhs = it->second;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
rhs = RTLIL::SigSpec(RTLIL::S0, GetSize(w));
|
|
|
|
cell->setPort(port_name, rhs);
|
|
|
|
}
|
|
|
|
|
|
|
|
int offset = 0;
|
2019-06-20 12:47:20 -05:00
|
|
|
for (auto b : rhs.bits()) {
|
2019-05-28 01:10:59 -05:00
|
|
|
SigBit I = sigmap(b);
|
2019-06-20 12:47:20 -05:00
|
|
|
if (b == RTLIL::Sx)
|
|
|
|
b = RTLIL::S0;
|
|
|
|
else if (I != b) {
|
|
|
|
if (I == RTLIL::Sx)
|
|
|
|
alias_map[b] = RTLIL::S0;
|
|
|
|
else
|
|
|
|
alias_map[b] = I;
|
|
|
|
}
|
2019-05-28 01:10:59 -05:00
|
|
|
co_bits.emplace_back(b, cell, port_name, offset++, 0);
|
2019-05-28 13:29:59 -05:00
|
|
|
unused_bits.erase(b);
|
2019-05-21 18:19:23 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (w->port_output) {
|
2019-05-28 01:10:59 -05:00
|
|
|
RTLIL::SigSpec rhs;
|
2019-05-21 18:19:23 -05:00
|
|
|
auto it = cell->connections_.find(w->name);
|
|
|
|
if (it != cell->connections_.end()) {
|
2019-05-26 13:26:38 -05:00
|
|
|
if (GetSize(it->second) < GetSize(w))
|
|
|
|
it->second.append(module->addWire(NEW_ID, GetSize(w)-GetSize(it->second)));
|
2019-05-28 01:10:59 -05:00
|
|
|
rhs = it->second;
|
2019-05-21 18:19:23 -05:00
|
|
|
}
|
2019-05-28 01:10:59 -05:00
|
|
|
else {
|
|
|
|
rhs = module->addWire(NEW_ID, GetSize(w));
|
|
|
|
cell->setPort(port_name, rhs);
|
2019-04-17 13:08:42 -05:00
|
|
|
}
|
2019-05-28 01:10:59 -05:00
|
|
|
|
|
|
|
int offset = 0;
|
|
|
|
for (const auto &b : rhs.bits()) {
|
2019-05-28 14:42:17 -05:00
|
|
|
ci_bits.emplace_back(b, cell, port_name, offset++);
|
2019-04-17 13:08:42 -05:00
|
|
|
SigBit O = sigmap(b);
|
2019-05-28 14:42:17 -05:00
|
|
|
if (O != b)
|
|
|
|
alias_map[O] = b;
|
2019-05-28 13:29:59 -05:00
|
|
|
undriven_bits.erase(O);
|
2019-05-30 18:03:22 -05:00
|
|
|
|
|
|
|
auto jt = input_bits.find(b);
|
|
|
|
if (jt != input_bits.end()) {
|
|
|
|
log_assert(b.wire->attributes.count("\\keep"));
|
|
|
|
input_bits.erase(b);
|
|
|
|
}
|
2019-04-17 13:08:42 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
box_list.emplace_back(cell);
|
|
|
|
}
|
2019-06-14 15:28:47 -05:00
|
|
|
|
|
|
|
// TODO: Free memory from toposort, bit_drivers, bit_users
|
2019-04-17 13:08:42 -05:00
|
|
|
}
|
|
|
|
|
2019-02-26 14:17:51 -06:00
|
|
|
for (auto bit : input_bits) {
|
2019-06-20 21:31:22 -05:00
|
|
|
if (!output_bits.count(bit))
|
|
|
|
continue;
|
2019-02-26 14:17:51 -06:00
|
|
|
RTLIL::Wire *wire = bit.wire;
|
2019-04-23 18:11:14 -05:00
|
|
|
// If encountering an inout port, or a keep-ed wire, then create a new wire
|
|
|
|
// with $inout.out suffix, make it a PO driven by the existing inout, and
|
|
|
|
// inherit existing inout's drivers
|
2019-06-20 21:31:22 -05:00
|
|
|
if ((wire->port_input && wire->port_output && !undriven_bits.count(bit))
|
2019-04-23 18:11:14 -05:00
|
|
|
|| wire->attributes.count("\\keep")) {
|
2019-05-30 18:03:22 -05:00
|
|
|
RTLIL::IdString wire_name = wire->name.str() + "$inout.out";
|
|
|
|
RTLIL::Wire *new_wire = module->wire(wire_name);
|
2019-02-26 14:17:51 -06:00
|
|
|
if (!new_wire)
|
2019-05-30 18:03:22 -05:00
|
|
|
new_wire = module->addWire(wire_name, GetSize(wire));
|
2019-02-26 14:17:51 -06:00
|
|
|
SigBit new_bit(new_wire, bit.offset);
|
|
|
|
module->connect(new_bit, bit);
|
|
|
|
if (not_map.count(bit))
|
|
|
|
not_map[new_bit] = not_map.at(bit);
|
2019-06-21 16:35:58 -05:00
|
|
|
else if (and_map.count(bit)) {
|
|
|
|
//and_map[new_bit] = and_map.at(bit); // Breaks gcc-4.8
|
|
|
|
and_map.insert(std::make_pair(new_bit, and_map.at(bit)));
|
|
|
|
}
|
2019-02-26 14:17:51 -06:00
|
|
|
else if (alias_map.count(bit))
|
|
|
|
alias_map[new_bit] = alias_map.at(bit);
|
2019-04-19 17:47:36 -05:00
|
|
|
else
|
|
|
|
alias_map[new_bit] = bit;
|
2019-04-23 18:11:14 -05:00
|
|
|
output_bits.erase(bit);
|
2019-04-12 16:13:11 -05:00
|
|
|
output_bits.insert(new_bit);
|
2019-02-26 14:17:51 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
for (auto bit : unused_bits)
|
|
|
|
undriven_bits.erase(bit);
|
|
|
|
|
2019-04-19 10:37:10 -05:00
|
|
|
if (!undriven_bits.empty() && !holes_mode) {
|
2019-02-08 16:53:12 -06:00
|
|
|
undriven_bits.sort();
|
|
|
|
for (auto bit : undriven_bits) {
|
|
|
|
log_warning("Treating undriven bit %s.%s like $anyseq.\n", log_id(module), log_signal(bit));
|
|
|
|
input_bits.insert(bit);
|
|
|
|
}
|
|
|
|
log_warning("Treating a total of %d undriven bits in %s like $anyseq.\n", GetSize(undriven_bits), log_id(module));
|
|
|
|
}
|
|
|
|
|
2019-05-26 16:14:13 -05:00
|
|
|
if (holes_mode) {
|
2019-05-27 13:38:52 -05:00
|
|
|
struct sort_by_port_id {
|
|
|
|
bool operator()(const RTLIL::SigBit& a, const RTLIL::SigBit& b) const {
|
|
|
|
return a.wire->port_id < b.wire->port_id;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
input_bits.sort(sort_by_port_id());
|
|
|
|
output_bits.sort(sort_by_port_id());
|
2019-05-26 16:14:13 -05:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
input_bits.sort();
|
|
|
|
output_bits.sort();
|
|
|
|
}
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
not_map.sort();
|
|
|
|
and_map.sort();
|
|
|
|
|
|
|
|
aig_map[State::S0] = 0;
|
|
|
|
aig_map[State::S1] = 1;
|
|
|
|
|
2019-04-16 18:37:47 -05:00
|
|
|
for (auto bit : input_bits) {
|
2019-02-15 13:51:21 -06:00
|
|
|
aig_m++, aig_i++;
|
2019-05-30 18:03:22 -05:00
|
|
|
log_assert(!aig_map.count(bit));
|
2019-04-16 18:37:47 -05:00
|
|
|
aig_map[bit] = 2*aig_m;
|
2019-02-15 13:51:21 -06:00
|
|
|
}
|
|
|
|
|
2019-04-16 18:37:47 -05:00
|
|
|
for (auto &c : ci_bits) {
|
2019-05-30 18:03:22 -05:00
|
|
|
RTLIL::SigBit bit = std::get<0>(c);
|
2019-02-08 16:53:12 -06:00
|
|
|
aig_m++, aig_i++;
|
2019-06-16 11:34:26 -05:00
|
|
|
aig_map[bit] = 2*aig_m;
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-04-12 18:17:48 -05:00
|
|
|
for (auto &c : co_bits) {
|
2019-05-27 13:38:52 -05:00
|
|
|
RTLIL::SigBit bit = std::get<0>(c);
|
2019-05-30 18:03:22 -05:00
|
|
|
std::get<4>(c) = ordered_outputs[bit] = aig_o++;
|
2019-02-15 13:51:21 -06:00
|
|
|
aig_outputs.push_back(bit2aig(bit));
|
|
|
|
}
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
for (auto bit : output_bits) {
|
2019-04-12 18:17:48 -05:00
|
|
|
ordered_outputs[bit] = aig_o++;
|
2019-02-08 16:53:12 -06:00
|
|
|
aig_outputs.push_back(bit2aig(bit));
|
|
|
|
}
|
2019-06-20 21:27:00 -05:00
|
|
|
|
|
|
|
if (output_bits.empty()) {
|
|
|
|
aig_o++;
|
|
|
|
aig_outputs.push_back(0);
|
|
|
|
omode = true;
|
|
|
|
}
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-06-12 12:00:57 -05:00
|
|
|
void write_aiger(std::ostream &f, bool ascii_mode)
|
2019-02-08 16:53:12 -06:00
|
|
|
{
|
2019-02-14 16:52:47 -06:00
|
|
|
int aig_obc = aig_o;
|
|
|
|
int aig_obcj = aig_obc;
|
|
|
|
int aig_obcjf = aig_obcj;
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
log_assert(aig_m == aig_i + aig_l + aig_a);
|
|
|
|
log_assert(aig_obcjf == GetSize(aig_outputs));
|
|
|
|
|
2019-02-14 16:52:47 -06:00
|
|
|
f << stringf("%s %d %d %d %d %d", ascii_mode ? "aag" : "aig", aig_m, aig_i, aig_l, aig_o, aig_a);
|
|
|
|
f << stringf("\n");
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
if (ascii_mode)
|
|
|
|
{
|
|
|
|
for (int i = 0; i < aig_i; i++)
|
|
|
|
f << stringf("%d\n", 2*i+2);
|
|
|
|
|
|
|
|
for (int i = 0; i < aig_obc; i++)
|
|
|
|
f << stringf("%d\n", aig_outputs.at(i));
|
|
|
|
|
|
|
|
for (int i = aig_obc; i < aig_obcj; i++)
|
|
|
|
f << stringf("1\n");
|
|
|
|
|
|
|
|
for (int i = aig_obc; i < aig_obcj; i++)
|
|
|
|
f << stringf("%d\n", aig_outputs.at(i));
|
|
|
|
|
|
|
|
for (int i = aig_obcj; i < aig_obcjf; i++)
|
|
|
|
f << stringf("%d\n", aig_outputs.at(i));
|
|
|
|
|
|
|
|
for (int i = 0; i < aig_a; i++)
|
|
|
|
f << stringf("%d %d %d\n", 2*(aig_i+aig_l+i)+2, aig_gates.at(i).first, aig_gates.at(i).second);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
for (int i = 0; i < aig_obc; i++)
|
|
|
|
f << stringf("%d\n", aig_outputs.at(i));
|
|
|
|
|
|
|
|
for (int i = aig_obc; i < aig_obcj; i++)
|
|
|
|
f << stringf("1\n");
|
|
|
|
|
|
|
|
for (int i = aig_obc; i < aig_obcj; i++)
|
|
|
|
f << stringf("%d\n", aig_outputs.at(i));
|
|
|
|
|
|
|
|
for (int i = aig_obcj; i < aig_obcjf; i++)
|
|
|
|
f << stringf("%d\n", aig_outputs.at(i));
|
|
|
|
|
|
|
|
for (int i = 0; i < aig_a; i++) {
|
|
|
|
int lhs = 2*(aig_i+aig_l+i)+2;
|
|
|
|
int rhs0 = aig_gates.at(i).first;
|
|
|
|
int rhs1 = aig_gates.at(i).second;
|
|
|
|
int delta0 = lhs - rhs0;
|
|
|
|
int delta1 = rhs0 - rhs1;
|
|
|
|
aiger_encode(f, delta0);
|
|
|
|
aiger_encode(f, delta1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-12 16:13:11 -05:00
|
|
|
f << "c";
|
|
|
|
|
2019-06-16 11:34:26 -05:00
|
|
|
if (!box_list.empty()) {
|
2019-06-14 14:00:02 -05:00
|
|
|
auto write_buffer = [](std::stringstream &buffer, int i32) {
|
2019-06-14 14:25:06 -05:00
|
|
|
int32_t i32_be = to_big_endian(i32);
|
2019-06-14 14:00:02 -05:00
|
|
|
buffer.write(reinterpret_cast<const char*>(&i32_be), sizeof(i32_be));
|
2019-04-16 17:01:45 -05:00
|
|
|
};
|
2019-06-14 14:00:02 -05:00
|
|
|
|
|
|
|
std::stringstream h_buffer;
|
|
|
|
auto write_h_buffer = std::bind(write_buffer, std::ref(h_buffer), std::placeholders::_1);
|
2019-04-16 17:01:45 -05:00
|
|
|
write_h_buffer(1);
|
2019-06-16 11:34:26 -05:00
|
|
|
log_debug("ciNum = %zu\n", input_bits.size() + ci_bits.size());
|
|
|
|
write_h_buffer(input_bits.size() + ci_bits.size());
|
|
|
|
log_debug("coNum = %zu\n", output_bits.size() + co_bits.size());
|
|
|
|
write_h_buffer(output_bits.size() + co_bits.size());
|
|
|
|
log_debug("piNum = %zu\n", input_bits.size());
|
|
|
|
write_h_buffer(input_bits.size());
|
|
|
|
log_debug("poNum = %zu\n", output_bits.size());
|
|
|
|
write_h_buffer(output_bits.size());
|
2019-05-30 18:03:22 -05:00
|
|
|
log_debug("boxNum = %zu\n", box_list.size());
|
2019-04-16 17:01:45 -05:00
|
|
|
write_h_buffer(box_list.size());
|
|
|
|
|
|
|
|
RTLIL::Module *holes_module = nullptr;
|
2019-06-14 15:08:38 -05:00
|
|
|
holes_module = module->design->addModule("$__holes__");
|
2019-05-21 18:19:23 -05:00
|
|
|
log_assert(holes_module);
|
2019-04-16 17:01:45 -05:00
|
|
|
|
2019-05-26 16:14:13 -05:00
|
|
|
int port_id = 1;
|
2019-05-28 01:10:59 -05:00
|
|
|
int box_count = 0;
|
2019-04-16 17:01:45 -05:00
|
|
|
for (auto cell : box_list) {
|
2019-05-21 18:19:23 -05:00
|
|
|
RTLIL::Module* box_module = module->design->module(cell->type);
|
|
|
|
int box_inputs = 0, box_outputs = 0;
|
2019-05-26 04:44:36 -05:00
|
|
|
Cell *holes_cell = nullptr;
|
2019-06-03 14:30:54 -05:00
|
|
|
if (box_module->get_bool_attribute("\\whitebox")) {
|
2019-05-26 04:44:36 -05:00
|
|
|
holes_cell = holes_module->addCell(cell->name, cell->type);
|
2019-06-03 14:30:54 -05:00
|
|
|
holes_cell->parameters = cell->parameters;
|
|
|
|
}
|
2019-05-21 18:19:23 -05:00
|
|
|
|
2019-05-30 14:26:51 -05:00
|
|
|
// NB: Assume box_module->ports are sorted alphabetically
|
|
|
|
// (as RTLIL::Module::fixup_ports() would do)
|
|
|
|
for (const auto &port_name : box_module->ports) {
|
|
|
|
RTLIL::Wire *w = box_module->wire(port_name);
|
|
|
|
log_assert(w);
|
|
|
|
RTLIL::Wire *holes_wire;
|
2019-05-26 00:34:50 -05:00
|
|
|
RTLIL::SigSpec port_wire;
|
|
|
|
if (w->port_input) {
|
|
|
|
for (int i = 0; i < GetSize(w); i++) {
|
|
|
|
box_inputs++;
|
|
|
|
holes_wire = holes_module->wire(stringf("\\i%d", box_inputs));
|
|
|
|
if (!holes_wire) {
|
|
|
|
holes_wire = holes_module->addWire(stringf("\\i%d", box_inputs));
|
|
|
|
holes_wire->port_input = true;
|
2019-05-26 16:14:13 -05:00
|
|
|
holes_wire->port_id = port_id++;
|
|
|
|
holes_module->ports.push_back(holes_wire->name);
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
2019-05-26 04:44:36 -05:00
|
|
|
if (holes_cell)
|
|
|
|
port_wire.append(holes_wire);
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
2019-05-26 04:44:36 -05:00
|
|
|
if (!port_wire.empty())
|
|
|
|
holes_cell->setPort(w->name, port_wire);
|
2019-05-26 00:34:50 -05:00
|
|
|
}
|
|
|
|
if (w->port_output) {
|
|
|
|
box_outputs += GetSize(w);
|
|
|
|
for (int i = 0; i < GetSize(w); i++) {
|
|
|
|
if (GetSize(w) == 1)
|
|
|
|
holes_wire = holes_module->addWire(stringf("%s.%s", cell->name.c_str(), w->name.c_str()));
|
|
|
|
else
|
|
|
|
holes_wire = holes_module->addWire(stringf("%s.%s[%d]", cell->name.c_str(), w->name.c_str(), i));
|
|
|
|
holes_wire->port_output = true;
|
2019-05-26 16:14:13 -05:00
|
|
|
holes_wire->port_id = port_id++;
|
|
|
|
holes_module->ports.push_back(holes_wire->name);
|
2019-05-26 04:44:36 -05:00
|
|
|
if (holes_cell)
|
|
|
|
port_wire.append(holes_wire);
|
|
|
|
else
|
|
|
|
holes_module->connect(holes_wire, RTLIL::S0);
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
2019-05-26 04:44:36 -05:00
|
|
|
if (!port_wire.empty())
|
|
|
|
holes_cell->setPort(w->name, port_wire);
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
|
|
|
}
|
2019-05-21 18:19:23 -05:00
|
|
|
|
2019-04-16 17:01:45 -05:00
|
|
|
write_h_buffer(box_inputs);
|
|
|
|
write_h_buffer(box_outputs);
|
2019-05-26 00:34:50 -05:00
|
|
|
write_h_buffer(box_module->attributes.at("\\abc_box_id").as_int());
|
2019-05-28 01:10:59 -05:00
|
|
|
write_h_buffer(box_count++);
|
2019-04-12 20:16:25 -05:00
|
|
|
}
|
2019-04-16 17:01:45 -05:00
|
|
|
|
|
|
|
f << "h";
|
|
|
|
std::string buffer_str = h_buffer.str();
|
2019-06-14 14:25:06 -05:00
|
|
|
int32_t buffer_size_be = to_big_endian(buffer_str.size());
|
2019-04-16 17:01:45 -05:00
|
|
|
f.write(reinterpret_cast<const char*>(&buffer_size_be), sizeof(buffer_size_be));
|
|
|
|
f.write(buffer_str.data(), buffer_str.size());
|
|
|
|
|
2019-06-16 11:34:26 -05:00
|
|
|
std::stringstream r_buffer;
|
|
|
|
auto write_r_buffer = std::bind(write_buffer, std::ref(r_buffer), std::placeholders::_1);
|
|
|
|
write_r_buffer(0);
|
|
|
|
|
|
|
|
f << "r";
|
|
|
|
buffer_str = r_buffer.str();
|
|
|
|
buffer_size_be = to_big_endian(buffer_str.size());
|
|
|
|
f.write(reinterpret_cast<const char*>(&buffer_size_be), sizeof(buffer_size_be));
|
|
|
|
f.write(buffer_str.data(), buffer_str.size());
|
2019-04-22 19:41:21 -05:00
|
|
|
|
2019-04-16 17:01:45 -05:00
|
|
|
if (holes_module) {
|
2019-06-21 19:16:38 -05:00
|
|
|
log_push();
|
|
|
|
|
2019-05-26 16:14:13 -05:00
|
|
|
// NB: fixup_ports() will sort ports by name
|
|
|
|
//holes_module->fixup_ports();
|
|
|
|
holes_module->check();
|
2019-04-16 17:01:45 -05:00
|
|
|
|
|
|
|
holes_module->design->selection_stack.emplace_back(false);
|
|
|
|
RTLIL::Selection& sel = holes_module->design->selection_stack.back();
|
|
|
|
sel.select(holes_module);
|
|
|
|
|
2019-05-26 00:34:50 -05:00
|
|
|
// TODO: Should not need to opt_merge if we only instantiate
|
|
|
|
// each box type once...
|
|
|
|
Pass::call(holes_module->design, "opt_merge -share_all");
|
|
|
|
|
2019-05-26 04:44:36 -05:00
|
|
|
Pass::call(holes_module->design, "flatten -wb");
|
2019-05-26 00:34:50 -05:00
|
|
|
|
2019-06-14 15:10:46 -05:00
|
|
|
// TODO: Should techmap/aigmap/check all lib_whitebox-es just once,
|
|
|
|
// instead of per write_xaiger call
|
2019-06-14 06:02:12 -05:00
|
|
|
Pass::call(holes_module->design, "techmap");
|
2019-05-26 04:44:36 -05:00
|
|
|
Pass::call(holes_module->design, "aigmap");
|
2019-06-14 15:08:38 -05:00
|
|
|
for (auto cell : holes_module->cells())
|
|
|
|
if (!cell->type.in("$_NOT_", "$_AND_"))
|
|
|
|
log_error("Whitebox contents cannot be represented as AIG. Please verify whiteboxes are synthesisable.\n");
|
2019-04-16 17:01:45 -05:00
|
|
|
|
2019-06-14 15:08:38 -05:00
|
|
|
Pass::call(holes_module->design, "clean -purge");
|
2019-04-16 17:01:45 -05:00
|
|
|
|
|
|
|
std::stringstream a_buffer;
|
2019-06-16 11:34:26 -05:00
|
|
|
XAigerWriter writer(holes_module, true /* holes_mode */);
|
2019-06-12 12:00:57 -05:00
|
|
|
writer.write_aiger(a_buffer, false /*ascii_mode*/);
|
2019-04-16 17:01:45 -05:00
|
|
|
|
2019-06-14 15:08:38 -05:00
|
|
|
holes_module->design->selection_stack.pop_back();
|
|
|
|
|
2019-04-16 17:01:45 -05:00
|
|
|
f << "a";
|
|
|
|
std::string buffer_str = a_buffer.str();
|
2019-06-14 14:25:06 -05:00
|
|
|
int32_t buffer_size_be = to_big_endian(buffer_str.size());
|
2019-04-16 17:01:45 -05:00
|
|
|
f.write(reinterpret_cast<const char*>(&buffer_size_be), sizeof(buffer_size_be));
|
|
|
|
f.write(buffer_str.data(), buffer_str.size());
|
|
|
|
holes_module->design->remove(holes_module);
|
2019-06-21 19:16:38 -05:00
|
|
|
|
|
|
|
log_pop();
|
2019-04-16 17:01:45 -05:00
|
|
|
}
|
|
|
|
}
|
2019-04-12 16:13:11 -05:00
|
|
|
|
|
|
|
f << stringf("Generated by %s\n", yosys_version_str);
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-06-12 12:00:57 -05:00
|
|
|
void write_map(std::ostream &f, bool verbose_map)
|
2019-02-08 16:53:12 -06:00
|
|
|
{
|
|
|
|
dict<int, string> input_lines;
|
|
|
|
dict<int, string> output_lines;
|
|
|
|
dict<int, string> wire_lines;
|
|
|
|
|
|
|
|
for (auto wire : module->wires())
|
|
|
|
{
|
2019-02-15 13:51:21 -06:00
|
|
|
//if (!verbose_map && wire->name[0] == '$')
|
|
|
|
// continue;
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
SigSpec sig = sigmap(wire);
|
|
|
|
|
|
|
|
for (int i = 0; i < GetSize(wire); i++)
|
|
|
|
{
|
2019-02-17 00:22:17 -06:00
|
|
|
RTLIL::SigBit b(wire, i);
|
2019-04-12 18:17:48 -05:00
|
|
|
if (input_bits.count(b)) {
|
2019-04-23 18:11:14 -05:00
|
|
|
int a = aig_map.at(b);
|
2019-02-08 16:53:12 -06:00
|
|
|
log_assert((a & 1) == 0);
|
|
|
|
input_lines[a] += stringf("input %d %d %s\n", (a >> 1)-1, i, log_id(wire));
|
|
|
|
}
|
|
|
|
|
2019-04-12 18:17:48 -05:00
|
|
|
if (output_bits.count(b)) {
|
2019-02-17 00:22:17 -06:00
|
|
|
int o = ordered_outputs.at(b);
|
2019-05-28 01:10:59 -05:00
|
|
|
output_lines[o] += stringf("output %lu %d %s\n", o - co_bits.size(), i, log_id(wire));
|
2019-02-20 13:09:13 -06:00
|
|
|
continue;
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
|
2019-02-20 13:09:13 -06:00
|
|
|
if (verbose_map) {
|
|
|
|
if (aig_map.count(sig[i]) == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
int a = aig_map.at(sig[i]);
|
|
|
|
wire_lines[a] += stringf("wire %d %d %s\n", a, i, log_id(wire));
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
input_lines.sort();
|
|
|
|
for (auto &it : input_lines)
|
|
|
|
f << it.second;
|
2019-05-28 01:10:59 -05:00
|
|
|
log_assert(input_lines.size() == input_bits.size());
|
2019-02-08 16:53:12 -06:00
|
|
|
|
2019-05-28 01:10:59 -05:00
|
|
|
int box_count = 0;
|
|
|
|
for (auto cell : box_list)
|
|
|
|
f << stringf("box %d %d %s\n", box_count++, 0, log_id(cell->name));
|
|
|
|
|
2019-02-08 16:53:12 -06:00
|
|
|
output_lines.sort();
|
|
|
|
for (auto &it : output_lines)
|
|
|
|
f << it.second;
|
2019-05-28 01:10:59 -05:00
|
|
|
log_assert(output_lines.size() == output_bits.size());
|
2019-06-20 21:27:00 -05:00
|
|
|
if (omode && output_bits.empty())
|
|
|
|
f << "output " << output_lines.size() << " 0 $__dummy__\n";
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
wire_lines.sort();
|
|
|
|
for (auto &it : wire_lines)
|
|
|
|
f << it.second;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2019-02-11 17:18:42 -06:00
|
|
|
struct XAigerBackend : public Backend {
|
|
|
|
XAigerBackend() : Backend("xaiger", "write design to XAIGER file") { }
|
2019-02-08 16:53:12 -06:00
|
|
|
void help() YS_OVERRIDE
|
|
|
|
{
|
|
|
|
// |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|
|
|
|
|
log("\n");
|
2019-02-11 17:18:42 -06:00
|
|
|
log(" write_xaiger [options] [filename]\n");
|
2019-02-08 16:53:12 -06:00
|
|
|
log("\n");
|
2019-02-11 17:18:42 -06:00
|
|
|
log("Write the current design to an XAIGER file. The design must be flattened and\n");
|
|
|
|
log("all unsupported cells will be converted into psuedo-inputs and pseudo-outputs.\n");
|
2019-02-08 16:53:12 -06:00
|
|
|
log("\n");
|
|
|
|
log(" -ascii\n");
|
2019-04-18 19:43:13 -05:00
|
|
|
log(" write ASCII version of AIGER format\n");
|
2019-02-08 16:53:12 -06:00
|
|
|
log("\n");
|
|
|
|
log(" -map <filename>\n");
|
|
|
|
log(" write an extra file with port and latch symbols\n");
|
|
|
|
log("\n");
|
|
|
|
log(" -vmap <filename>\n");
|
|
|
|
log(" like -map, but more verbose\n");
|
|
|
|
log("\n");
|
|
|
|
}
|
|
|
|
void execute(std::ostream *&f, std::string filename, std::vector<std::string> args, RTLIL::Design *design) YS_OVERRIDE
|
|
|
|
{
|
|
|
|
bool ascii_mode = false;
|
|
|
|
bool verbose_map = false;
|
|
|
|
std::string map_filename;
|
|
|
|
|
2019-02-11 17:18:42 -06:00
|
|
|
log_header(design, "Executing XAIGER backend.\n");
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
size_t argidx;
|
|
|
|
for (argidx = 1; argidx < args.size(); argidx++)
|
|
|
|
{
|
|
|
|
if (args[argidx] == "-ascii") {
|
|
|
|
ascii_mode = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (map_filename.empty() && args[argidx] == "-map" && argidx+1 < args.size()) {
|
|
|
|
map_filename = args[++argidx];
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (map_filename.empty() && args[argidx] == "-vmap" && argidx+1 < args.size()) {
|
|
|
|
map_filename = args[++argidx];
|
|
|
|
verbose_map = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
extra_args(f, filename, args, argidx);
|
|
|
|
|
|
|
|
Module *top_module = design->top_module();
|
|
|
|
|
|
|
|
if (top_module == nullptr)
|
|
|
|
log_error("Can't find top module in current design!\n");
|
|
|
|
|
2019-06-16 11:34:26 -05:00
|
|
|
XAigerWriter writer(top_module);
|
2019-06-12 12:00:57 -05:00
|
|
|
writer.write_aiger(*f, ascii_mode);
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
if (!map_filename.empty()) {
|
|
|
|
std::ofstream mapf;
|
|
|
|
mapf.open(map_filename.c_str(), std::ofstream::trunc);
|
|
|
|
if (mapf.fail())
|
|
|
|
log_error("Can't open file `%s' for writing: %s\n", map_filename.c_str(), strerror(errno));
|
2019-06-12 12:00:57 -05:00
|
|
|
writer.write_map(mapf, verbose_map);
|
2019-02-08 16:53:12 -06:00
|
|
|
}
|
|
|
|
}
|
2019-02-11 17:18:42 -06:00
|
|
|
} XAigerBackend;
|
2019-02-08 16:53:12 -06:00
|
|
|
|
|
|
|
PRIVATE_NAMESPACE_END
|