2014-07-19 13:54:32 -05:00
|
|
|
/*
|
|
|
|
* yosys -- Yosys Open SYnthesis Suite
|
|
|
|
*
|
|
|
|
* Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and/or distribute this software for any
|
|
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
|
|
* copyright notice and this permission notice appear in all copies.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "kernel/rtlil.h"
|
|
|
|
#include "kernel/satgen.h"
|
|
|
|
#include "kernel/sigtools.h"
|
|
|
|
#include "kernel/modwalker.h"
|
|
|
|
#include "kernel/register.h"
|
|
|
|
#include "kernel/log.h"
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
struct ShareWorkerConfig
|
|
|
|
{
|
2014-07-19 20:03:04 -05:00
|
|
|
bool opt_force;
|
|
|
|
bool opt_aggressive;
|
|
|
|
bool opt_fast;
|
2014-07-19 13:54:32 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
struct ShareWorker
|
|
|
|
{
|
|
|
|
ShareWorkerConfig config;
|
|
|
|
RTLIL::Design *design;
|
|
|
|
RTLIL::Module *module;
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
CellTypes fwd_ct, cone_ct;
|
2014-07-19 13:54:32 -05:00
|
|
|
ModWalker modwalker;
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
std::set<RTLIL::Cell*> cells_to_remove;
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
|
|
|
|
// ------------------------------------------------------------------------------
|
|
|
|
// Find terminal bits -- i.e. bits that do not (exclusively) feed into a mux tree
|
|
|
|
// ------------------------------------------------------------------------------
|
|
|
|
|
|
|
|
std::set<RTLIL::SigBit> terminal_bits;
|
|
|
|
|
|
|
|
void find_terminal_bits()
|
|
|
|
{
|
|
|
|
std::set<RTLIL::SigBit> queue_strong_bits, queue_weak_bits;
|
|
|
|
std::set<RTLIL::Cell*> visited_cells;
|
|
|
|
|
|
|
|
queue_weak_bits.insert(modwalker.signal_outputs.begin(), modwalker.signal_outputs.end());
|
|
|
|
|
|
|
|
for (auto &it : module->cells)
|
|
|
|
{
|
|
|
|
RTLIL::Cell *cell = it.second;
|
|
|
|
|
|
|
|
if (cell->type == "$mux" || cell->type == "$pmux")
|
|
|
|
{
|
|
|
|
std::vector<RTLIL::SigBit> bits = modwalker.sigmap(cell->connections.at("\\S"));
|
|
|
|
queue_strong_bits.insert(bits.begin(), bits.end());
|
|
|
|
}
|
|
|
|
else if (!fwd_ct.cell_known(cell->type))
|
|
|
|
{
|
|
|
|
std::set<RTLIL::SigBit> &bits = modwalker.cell_inputs[cell];
|
|
|
|
queue_weak_bits.insert(bits.begin(), bits.end());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
terminal_bits.insert(queue_strong_bits.begin(), queue_strong_bits.end());
|
|
|
|
terminal_bits.insert(queue_weak_bits.begin(), queue_weak_bits.end());
|
|
|
|
|
|
|
|
while (!queue_strong_bits.empty())
|
|
|
|
{
|
|
|
|
std::set<ModWalker::PortBit> portbits;
|
|
|
|
modwalker.get_drivers(portbits, queue_strong_bits);
|
|
|
|
queue_strong_bits.clear();
|
|
|
|
|
|
|
|
for (auto &pbit : portbits)
|
|
|
|
if (fwd_ct.cell_known(pbit.cell->type) && visited_cells.count(pbit.cell) == 0) {
|
|
|
|
std::set<RTLIL::SigBit> &bits = modwalker.cell_inputs[pbit.cell];
|
|
|
|
terminal_bits.insert(bits.begin(), bits.end());
|
|
|
|
queue_strong_bits.insert(bits.begin(), bits.end());
|
|
|
|
visited_cells.insert(pbit.cell);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
while (!queue_weak_bits.empty())
|
|
|
|
{
|
|
|
|
std::set<ModWalker::PortBit> portbits;
|
|
|
|
modwalker.get_drivers(portbits, queue_weak_bits);
|
|
|
|
queue_weak_bits.clear();
|
|
|
|
|
|
|
|
for (auto &pbit : portbits) {
|
|
|
|
if (pbit.cell->type == "$mux" || pbit.cell->type == "$pmux")
|
|
|
|
continue;
|
|
|
|
if (fwd_ct.cell_known(pbit.cell->type) && visited_cells.count(pbit.cell) == 0) {
|
|
|
|
std::set<RTLIL::SigBit> &bits = modwalker.cell_inputs[pbit.cell];
|
|
|
|
terminal_bits.insert(bits.begin(), bits.end());
|
|
|
|
queue_weak_bits.insert(bits.begin(), bits.end());
|
|
|
|
visited_cells.insert(pbit.cell);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-19 13:54:32 -05:00
|
|
|
// ---------------------------------------------------
|
|
|
|
// Find shareable cells and compatible groups of cells
|
|
|
|
// ---------------------------------------------------
|
|
|
|
|
|
|
|
std::set<RTLIL::Cell*> shareable_cells;
|
|
|
|
|
|
|
|
void find_shareable_cells()
|
|
|
|
{
|
|
|
|
for (auto &it : module->cells)
|
|
|
|
{
|
|
|
|
RTLIL::Cell *cell = it.second;
|
|
|
|
|
|
|
|
if (!design->selected(module, cell) || !modwalker.ct.cell_known(cell->type))
|
|
|
|
continue;
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
for (auto &bit : modwalker.cell_outputs[cell])
|
|
|
|
if (terminal_bits.count(bit))
|
|
|
|
goto not_a_muxed_cell;
|
|
|
|
|
|
|
|
if (0)
|
|
|
|
not_a_muxed_cell:
|
|
|
|
continue;
|
|
|
|
|
2014-07-20 08:00:18 -05:00
|
|
|
// FIXME: Creation of super cells is broken for this cell types
|
|
|
|
if (cell->type == "$shr" || cell->type == "$mod")
|
|
|
|
continue;
|
|
|
|
|
2014-07-19 20:03:04 -05:00
|
|
|
if (config.opt_force) {
|
2014-07-20 03:36:46 -05:00
|
|
|
shareable_cells.insert(cell);
|
2014-07-19 13:54:32 -05:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell->type == "$memrd") {
|
|
|
|
if (!cell->parameters.at("\\CLK_ENABLE").as_bool())
|
2014-07-20 03:36:46 -05:00
|
|
|
shareable_cells.insert(cell);
|
2014-07-19 13:54:32 -05:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell->type == "$mul" || cell->type == "$div" || cell->type == "$mod") {
|
2014-07-19 20:03:04 -05:00
|
|
|
if (config.opt_aggressive || cell->parameters.at("\\Y_WIDTH").as_int() > 4)
|
2014-07-20 03:36:46 -05:00
|
|
|
shareable_cells.insert(cell);
|
2014-07-19 13:54:32 -05:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell->type == "$shl" || cell->type == "$shr" || cell->type == "$sshl" || cell->type == "$sshr") {
|
2014-07-19 20:03:04 -05:00
|
|
|
if (config.opt_aggressive || cell->parameters.at("\\Y_WIDTH").as_int() > 8)
|
2014-07-20 03:36:46 -05:00
|
|
|
shareable_cells.insert(cell);
|
2014-07-19 20:03:04 -05:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cell->type == "$add" || cell->type == "$sub") {
|
|
|
|
if (config.opt_aggressive || cell->parameters.at("\\Y_WIDTH").as_int() > 10)
|
2014-07-20 03:36:46 -05:00
|
|
|
shareable_cells.insert(cell);
|
2014-07-19 13:54:32 -05:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool is_shareable_pair(RTLIL::Cell *c1, RTLIL::Cell *c2)
|
|
|
|
{
|
|
|
|
if (c1->type != c2->type)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (c1->type == "$memrd")
|
|
|
|
{
|
|
|
|
if (c1->parameters.at("\\MEMID").decode_string() != c2->parameters.at("\\MEMID").decode_string())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2014-07-19 20:03:04 -05:00
|
|
|
if (c1->type == "$mul" || c1->type == "$div" || c1->type == "$mod" || c1->type == "$add" || c1->type == "$sub" ||
|
2014-07-19 13:54:32 -05:00
|
|
|
c1->type == "$shl" || c1->type == "$shr" || c1->type == "$sshl" || c1->type == "$sshr")
|
|
|
|
{
|
|
|
|
if (c1->parameters.at("\\A_SIGNED").as_bool() != c2->parameters.at("\\A_SIGNED").as_bool())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (c1->parameters.at("\\B_SIGNED").as_bool() != c2->parameters.at("\\B_SIGNED").as_bool())
|
|
|
|
return false;
|
|
|
|
|
2014-07-19 20:03:04 -05:00
|
|
|
if (!config.opt_aggressive)
|
|
|
|
{
|
|
|
|
int a1_width = c1->parameters.at("\\A_WIDTH").as_int();
|
|
|
|
int b1_width = c1->parameters.at("\\B_WIDTH").as_int();
|
|
|
|
int y1_width = c1->parameters.at("\\Y_WIDTH").as_int();
|
2014-07-19 13:54:32 -05:00
|
|
|
|
2014-07-19 20:03:04 -05:00
|
|
|
int a2_width = c2->parameters.at("\\A_WIDTH").as_int();
|
|
|
|
int b2_width = c2->parameters.at("\\B_WIDTH").as_int();
|
|
|
|
int y2_width = c2->parameters.at("\\Y_WIDTH").as_int();
|
2014-07-19 13:54:32 -05:00
|
|
|
|
2014-07-19 20:03:04 -05:00
|
|
|
if (std::max(a1_width, a2_width) > 2 * std::min(a1_width, a2_width)) return false;
|
|
|
|
if (std::max(b1_width, b2_width) > 2 * std::min(b1_width, b2_width)) return false;
|
|
|
|
if (std::max(y1_width, y2_width) > 2 * std::min(y1_width, y2_width)) return false;
|
|
|
|
}
|
2014-07-19 13:54:32 -05:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (auto &it : c1->parameters)
|
|
|
|
if (c2->parameters.count(it.first) == 0 || c2->parameters.at(it.first) != it.second)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (auto &it : c2->parameters)
|
|
|
|
if (c1->parameters.count(it.first) == 0 || c1->parameters.at(it.first) != it.second)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void find_shareable_partners(std::vector<RTLIL::Cell*> &results, RTLIL::Cell *cell)
|
|
|
|
{
|
|
|
|
results.clear();
|
|
|
|
for (auto c : shareable_cells)
|
|
|
|
if (c != cell && is_shareable_pair(c, cell))
|
|
|
|
results.push_back(c);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-20 08:00:18 -05:00
|
|
|
// -----------------------
|
|
|
|
// Create replacement cell
|
|
|
|
// -----------------------
|
|
|
|
|
|
|
|
RTLIL::Cell *make_supercell(RTLIL::Cell *c1, RTLIL::Cell *c2, RTLIL::SigSpec act)
|
|
|
|
{
|
|
|
|
if (c1->type == "$mul" || c1->type == "$div" || c1->type == "$mod" || c1->type == "$add" || c1->type == "$sub" ||
|
|
|
|
c1->type == "$shl" || c1->type == "$shr" || c1->type == "$sshl" || c1->type == "$sshr")
|
|
|
|
{
|
|
|
|
log_assert(c1->type == c2->type);
|
|
|
|
|
|
|
|
bool a_signed = c1->parameters.at("\\A_SIGNED").as_bool();
|
|
|
|
bool b_signed = c1->parameters.at("\\B_SIGNED").as_bool();
|
|
|
|
|
|
|
|
log_assert(a_signed == c2->parameters.at("\\A_SIGNED").as_bool());
|
|
|
|
log_assert(b_signed == c2->parameters.at("\\B_SIGNED").as_bool());
|
|
|
|
|
|
|
|
RTLIL::SigSpec a1 = c1->connections.at("\\A");
|
|
|
|
RTLIL::SigSpec b1 = c1->connections.at("\\B");
|
|
|
|
RTLIL::SigSpec y1 = c1->connections.at("\\Y");
|
|
|
|
|
|
|
|
RTLIL::SigSpec a2 = c2->connections.at("\\A");
|
|
|
|
RTLIL::SigSpec b2 = c2->connections.at("\\B");
|
|
|
|
RTLIL::SigSpec y2 = c2->connections.at("\\Y");
|
|
|
|
|
|
|
|
int a_width = std::max(a1.width, a2.width);
|
|
|
|
int b_width = std::max(b1.width, b2.width);
|
|
|
|
int y_width = std::max(y1.width, y2.width);
|
|
|
|
|
|
|
|
if (a1.width != a_width) a1 = module->addPos(NEW_ID, a1, module->new_wire(a_width, NEW_ID), a_signed)->connections.at("\\Y");
|
|
|
|
if (b1.width != b_width) b1 = module->addPos(NEW_ID, b1, module->new_wire(b_width, NEW_ID), b_signed)->connections.at("\\Y");
|
|
|
|
|
|
|
|
if (a2.width != a_width) a2 = module->addPos(NEW_ID, a2, module->new_wire(a_width, NEW_ID), a_signed)->connections.at("\\Y");
|
|
|
|
if (b2.width != b_width) b2 = module->addPos(NEW_ID, b2, module->new_wire(b_width, NEW_ID), b_signed)->connections.at("\\Y");
|
|
|
|
|
|
|
|
RTLIL::SigSpec a = module->Mux(NEW_ID, a2, a1, act);
|
|
|
|
RTLIL::SigSpec b = module->Mux(NEW_ID, b2, b1, act);
|
|
|
|
RTLIL::Wire *y = module->new_wire(y_width, NEW_ID);
|
|
|
|
|
|
|
|
RTLIL::Cell *supercell = new RTLIL::Cell;
|
|
|
|
supercell->name = NEW_ID;
|
|
|
|
supercell->type = c1->type;
|
|
|
|
supercell->parameters["\\A_SIGNED"] = a_signed;
|
|
|
|
supercell->parameters["\\B_SIGNED"] = b_signed;
|
|
|
|
supercell->parameters["\\A_WIDTH"] = a_width;
|
|
|
|
supercell->parameters["\\B_WIDTH"] = b_width;
|
|
|
|
supercell->parameters["\\Y_WIDTH"] = y_width;
|
|
|
|
supercell->connections["\\A"] = a;
|
|
|
|
supercell->connections["\\B"] = b;
|
|
|
|
supercell->connections["\\Y"] = y;
|
|
|
|
module->add(supercell);
|
|
|
|
|
|
|
|
RTLIL::SigSpec new_y1(y, y1.width);
|
|
|
|
RTLIL::SigSpec new_y2(y, y2.width);
|
|
|
|
|
|
|
|
module->connections.push_back(RTLIL::SigSig(y1, new_y1));
|
|
|
|
module->connections.push_back(RTLIL::SigSig(y2, new_y2));
|
|
|
|
|
|
|
|
return supercell;
|
|
|
|
}
|
|
|
|
|
|
|
|
log_abort();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2014-07-19 13:54:32 -05:00
|
|
|
// --------------------------------------------------------
|
|
|
|
// Finding control inputs and activation pattern for a cell
|
|
|
|
// --------------------------------------------------------
|
|
|
|
|
|
|
|
std::map<RTLIL::Cell*, std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>>> activation_patterns_cache;
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
bool sort_check_activation_pattern(std::pair<RTLIL::SigSpec, RTLIL::Const> &p)
|
2014-07-19 13:54:32 -05:00
|
|
|
{
|
2014-07-20 03:36:46 -05:00
|
|
|
std::map<RTLIL::SigBit, RTLIL::State> p_bits;
|
2014-07-19 13:54:32 -05:00
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
std::vector<RTLIL::SigBit> p_first_bits = p.first;
|
|
|
|
for (int i = 0; i < SIZE(p_first_bits); i++) {
|
|
|
|
RTLIL::SigBit b = p_first_bits[i];
|
|
|
|
RTLIL::State v = p.second.bits[i];
|
|
|
|
if (p_bits.count(b) && p_bits.at(b) != v)
|
|
|
|
return false;
|
|
|
|
p_bits[b] = v;
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
p.first = RTLIL::SigSpec();
|
|
|
|
p.second.bits.clear();
|
2014-07-19 13:54:32 -05:00
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
for (auto &it : p_bits) {
|
|
|
|
p.first.append_bit(it.first);
|
|
|
|
p.second.bits.push_back(it.second);
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
2014-07-20 03:36:46 -05:00
|
|
|
|
|
|
|
return true;
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
void optimize_activation_patterns(std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> & /* patterns */)
|
|
|
|
{
|
|
|
|
// TODO: Remove patterns that are contained in other patterns
|
|
|
|
// TODO: Consolidate pairs of patterns that only differ in the value for one signal bit
|
|
|
|
}
|
|
|
|
|
|
|
|
const std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> &find_cell_activation_patterns(RTLIL::Cell *cell, const char *indent)
|
2014-07-19 13:54:32 -05:00
|
|
|
{
|
|
|
|
if (activation_patterns_cache.count(cell))
|
|
|
|
return activation_patterns_cache.at(cell);
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
const std::set<RTLIL::SigBit> &cell_out_bits = modwalker.cell_outputs[cell];
|
|
|
|
std::set<RTLIL::Cell*> driven_cells;
|
2014-07-19 13:54:32 -05:00
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
for (auto &bit : cell_out_bits)
|
|
|
|
{
|
|
|
|
if (terminal_bits.count(bit)) {
|
|
|
|
// Terminal cells are always active: unconditional activation pattern
|
|
|
|
activation_patterns_cache[cell].insert(std::pair<RTLIL::SigSpec, RTLIL::Const>());
|
|
|
|
return activation_patterns_cache.at(cell);
|
|
|
|
}
|
|
|
|
for (auto &pbit : modwalker.signal_consumers[bit]) {
|
|
|
|
log_assert(fwd_ct.cell_known(pbit.cell->type));
|
|
|
|
driven_cells.insert(pbit.cell);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (auto c : driven_cells)
|
|
|
|
{
|
2014-07-20 04:41:57 -05:00
|
|
|
const std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> &c_patterns = find_cell_activation_patterns(c, indent);
|
2014-07-19 13:54:32 -05:00
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
if (c->type == "$mux" || c->type == "$pmux")
|
|
|
|
{
|
|
|
|
bool used_in_a = false;
|
|
|
|
std::set<int> used_in_b_parts;
|
|
|
|
|
|
|
|
int width = c->parameters.at("\\WIDTH").as_int();
|
|
|
|
std::vector<RTLIL::SigBit> sig_a = modwalker.sigmap(c->connections.at("\\A"));
|
|
|
|
std::vector<RTLIL::SigBit> sig_b = modwalker.sigmap(c->connections.at("\\B"));
|
|
|
|
std::vector<RTLIL::SigBit> sig_s = modwalker.sigmap(c->connections.at("\\S"));
|
|
|
|
|
|
|
|
for (auto &bit : sig_a)
|
|
|
|
if (cell_out_bits.count(bit))
|
|
|
|
used_in_a = true;
|
|
|
|
|
|
|
|
for (int i = 0; i < SIZE(sig_b); i++)
|
|
|
|
if (cell_out_bits.count(sig_b[i]))
|
|
|
|
used_in_b_parts.insert(i / width);
|
|
|
|
|
|
|
|
if (used_in_a)
|
|
|
|
for (auto p : c_patterns) {
|
|
|
|
for (int i = 0; i < SIZE(sig_s); i++)
|
|
|
|
p.first.append_bit(sig_s[i]), p.second.bits.push_back(RTLIL::State::S0);
|
2014-07-20 04:41:57 -05:00
|
|
|
if (sort_check_activation_pattern(p))
|
2014-07-20 03:36:46 -05:00
|
|
|
activation_patterns_cache[cell].insert(p);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (int idx : used_in_b_parts)
|
|
|
|
for (auto p : c_patterns) {
|
|
|
|
p.first.append_bit(sig_s[idx]), p.second.bits.push_back(RTLIL::State::S1);
|
2014-07-20 04:41:57 -05:00
|
|
|
if (sort_check_activation_pattern(p))
|
2014-07-20 03:36:46 -05:00
|
|
|
activation_patterns_cache[cell].insert(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
// Not a mux: just copy the activation patterns
|
|
|
|
for (auto &p : c_patterns)
|
|
|
|
activation_patterns_cache[cell].insert(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
optimize_activation_patterns(activation_patterns_cache[cell]);
|
|
|
|
if (activation_patterns_cache[cell].empty()) {
|
|
|
|
log("%sFound cell that is never activated: %s\n", indent, log_id(cell));
|
2014-07-20 08:00:18 -05:00
|
|
|
RTLIL::SigSpec cell_outputs = modwalker.cell_outputs[cell];
|
|
|
|
module->connections.push_back(RTLIL::SigSig(cell_outputs, RTLIL::SigSpec(RTLIL::State::Sx, cell_outputs.width)));
|
2014-07-20 04:41:57 -05:00
|
|
|
cells_to_remove.insert(cell);
|
|
|
|
}
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
return activation_patterns_cache[cell];
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
RTLIL::SigSpec bits_from_activation_patterns(const std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> &activation_patterns)
|
|
|
|
{
|
|
|
|
std::set<RTLIL::SigBit> all_bits;
|
|
|
|
for (auto &it : activation_patterns) {
|
|
|
|
std::vector<RTLIL::SigBit> bits = it.first;
|
|
|
|
all_bits.insert(bits.begin(), bits.end());
|
|
|
|
}
|
|
|
|
|
|
|
|
RTLIL::SigSpec signal;
|
|
|
|
for (auto &bit : all_bits)
|
|
|
|
signal.append_bit(bit);
|
|
|
|
|
|
|
|
return signal;
|
|
|
|
}
|
|
|
|
|
2014-07-20 08:00:18 -05:00
|
|
|
RTLIL::SigSpec make_cell_activation_logic(const std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> &activation_patterns)
|
|
|
|
{
|
|
|
|
RTLIL::Wire *all_cases_wire = module->new_wire(0, NEW_ID);
|
|
|
|
for (auto &p : activation_patterns) {
|
|
|
|
all_cases_wire->width++;
|
|
|
|
module->addEq(NEW_ID, p.first, p.second, RTLIL::SigSpec(all_cases_wire, 1, all_cases_wire->width - 1));
|
|
|
|
}
|
|
|
|
if (all_cases_wire->width == 1)
|
|
|
|
return all_cases_wire;
|
|
|
|
return module->ReduceOr(NEW_ID, all_cases_wire);
|
|
|
|
}
|
|
|
|
|
2014-07-19 13:54:32 -05:00
|
|
|
|
|
|
|
// -------------
|
|
|
|
// Setup and run
|
|
|
|
// -------------
|
|
|
|
|
|
|
|
ShareWorker(ShareWorkerConfig config, RTLIL::Design *design, RTLIL::Module *module) :
|
|
|
|
config(config), design(design), module(module)
|
|
|
|
{
|
2014-07-20 03:36:46 -05:00
|
|
|
fwd_ct.setup_internals();
|
|
|
|
|
2014-07-19 13:54:32 -05:00
|
|
|
cone_ct.setup_internals();
|
|
|
|
cone_ct.cell_types.erase("$mul");
|
|
|
|
cone_ct.cell_types.erase("$mod");
|
|
|
|
cone_ct.cell_types.erase("$div");
|
|
|
|
cone_ct.cell_types.erase("$pow");
|
|
|
|
cone_ct.cell_types.erase("$shl");
|
|
|
|
cone_ct.cell_types.erase("$shr");
|
|
|
|
cone_ct.cell_types.erase("$sshl");
|
|
|
|
cone_ct.cell_types.erase("$sshr");
|
|
|
|
|
|
|
|
modwalker.setup(design, module);
|
2014-07-20 03:36:46 -05:00
|
|
|
|
|
|
|
find_terminal_bits();
|
2014-07-19 13:54:32 -05:00
|
|
|
find_shareable_cells();
|
|
|
|
|
|
|
|
if (shareable_cells.size() < 2)
|
|
|
|
return;
|
|
|
|
|
|
|
|
log("Found %d cells in module %s that may be considered for resource sharing.\n",
|
2014-07-20 03:36:46 -05:00
|
|
|
SIZE(shareable_cells), log_id(module));
|
2014-07-19 13:54:32 -05:00
|
|
|
|
|
|
|
while (!shareable_cells.empty())
|
|
|
|
{
|
|
|
|
RTLIL::Cell *cell = *shareable_cells.begin();
|
|
|
|
shareable_cells.erase(cell);
|
|
|
|
|
|
|
|
log(" Analyzing resource sharing options for %s:\n", log_id(cell));
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
const std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> &cell_activation_patterns = find_cell_activation_patterns(cell, " ");
|
2014-07-20 03:36:46 -05:00
|
|
|
RTLIL::SigSpec cell_activation_signals = bits_from_activation_patterns(cell_activation_patterns);
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
if (cell_activation_patterns.empty()) {
|
|
|
|
log (" Cell is never active. Sharing is pointless, we simply remove it.\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
if (cell_activation_patterns.count(std::pair<RTLIL::SigSpec, RTLIL::Const>())) {
|
|
|
|
log (" Cell is always active. Therefore no sharing is possible.\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
log(" Found %d activation_patterns using ctrl signal %s.\n", SIZE(cell_activation_patterns), log_signal(cell_activation_signals));
|
|
|
|
|
2014-07-19 13:54:32 -05:00
|
|
|
std::vector<RTLIL::Cell*> candidates;
|
|
|
|
find_shareable_partners(candidates, cell);
|
|
|
|
|
|
|
|
if (candidates.empty()) {
|
|
|
|
log(" No candidates found.\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
log(" Found %d candidates:", SIZE(candidates));
|
2014-07-19 13:54:32 -05:00
|
|
|
for (auto c : candidates)
|
|
|
|
log(" %s", log_id(c));
|
|
|
|
log("\n");
|
|
|
|
|
|
|
|
for (auto other_cell : candidates)
|
|
|
|
{
|
|
|
|
log(" Analyzing resource sharing with %s:\n", log_id(other_cell));
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
const std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> &other_cell_activation_patterns = find_cell_activation_patterns(other_cell, " ");
|
2014-07-19 13:54:32 -05:00
|
|
|
RTLIL::SigSpec other_cell_activation_signals = bits_from_activation_patterns(other_cell_activation_patterns);
|
|
|
|
|
2014-07-20 04:41:57 -05:00
|
|
|
if (other_cell_activation_patterns.empty()) {
|
|
|
|
log (" Cell is never active. Sharing is pointless, we simply remove it.\n");
|
|
|
|
shareable_cells.erase(other_cell);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2014-07-20 03:36:46 -05:00
|
|
|
if (other_cell_activation_patterns.count(std::pair<RTLIL::SigSpec, RTLIL::Const>())) {
|
2014-07-20 04:41:57 -05:00
|
|
|
log (" Cell is always active. Therefore no sharing is possible.\n");
|
2014-07-19 13:54:32 -05:00
|
|
|
continue;
|
2014-07-20 03:36:46 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
log(" Found %d activation_patterns using ctrl signal %s.\n",
|
|
|
|
SIZE(other_cell_activation_patterns), log_signal(other_cell_activation_signals));
|
2014-07-19 13:54:32 -05:00
|
|
|
|
|
|
|
ezDefaultSAT ez;
|
|
|
|
SatGen satgen(&ez, &modwalker.sigmap);
|
|
|
|
|
|
|
|
std::set<RTLIL::Cell*> sat_cells;
|
|
|
|
std::set<RTLIL::SigBit> bits_queue;
|
|
|
|
|
|
|
|
std::vector<int> cell_active, other_cell_active;
|
|
|
|
RTLIL::SigSpec all_ctrl_signals;
|
|
|
|
|
|
|
|
for (auto &p : cell_activation_patterns) {
|
|
|
|
log(" Activation pattern for cell %s: %s = %s\n", log_id(cell), log_signal(p.first), log_signal(p.second));
|
|
|
|
cell_active.push_back(ez.vec_eq(satgen.importSigSpec(p.first), satgen.importSigSpec(p.second)));
|
|
|
|
all_ctrl_signals.append(p.first);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (auto &p : other_cell_activation_patterns) {
|
|
|
|
log(" Activation pattern for cell %s: %s = %s\n", log_id(other_cell), log_signal(p.first), log_signal(p.second));
|
|
|
|
other_cell_active.push_back(ez.vec_eq(satgen.importSigSpec(p.first), satgen.importSigSpec(p.second)));
|
|
|
|
all_ctrl_signals.append(p.first);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (auto &bit : cell_activation_signals.to_sigbit_vector())
|
|
|
|
bits_queue.insert(bit);
|
|
|
|
|
|
|
|
for (auto &bit : other_cell_activation_signals.to_sigbit_vector())
|
|
|
|
bits_queue.insert(bit);
|
|
|
|
|
|
|
|
while (!bits_queue.empty())
|
|
|
|
{
|
|
|
|
std::set<ModWalker::PortBit> portbits;
|
|
|
|
modwalker.get_drivers(portbits, bits_queue);
|
|
|
|
bits_queue.clear();
|
|
|
|
|
|
|
|
for (auto &pbit : portbits)
|
|
|
|
if (sat_cells.count(pbit.cell) == 0 && cone_ct.cell_known(pbit.cell->type)) {
|
2014-07-19 20:03:04 -05:00
|
|
|
if (config.opt_fast && modwalker.cell_outputs[pbit.cell].size() >= 4)
|
|
|
|
continue;
|
2014-07-19 13:54:32 -05:00
|
|
|
// log(" Adding cell %s (%s) to SAT problem.\n", log_id(pbit.cell), log_id(pbit.cell->type));
|
2014-07-20 03:36:46 -05:00
|
|
|
bits_queue.insert(modwalker.cell_inputs[pbit.cell].begin(), modwalker.cell_inputs[pbit.cell].end());
|
2014-07-19 13:54:32 -05:00
|
|
|
satgen.importCell(pbit.cell);
|
|
|
|
sat_cells.insert(pbit.cell);
|
|
|
|
}
|
2014-07-19 20:03:04 -05:00
|
|
|
|
|
|
|
if (config.opt_fast && sat_cells.size() > 100)
|
|
|
|
break;
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
all_ctrl_signals.sort_and_unify();
|
|
|
|
std::vector<int> sat_model = satgen.importSigSpec(all_ctrl_signals);
|
|
|
|
std::vector<bool> sat_model_values;
|
|
|
|
|
|
|
|
ez.assume(ez.AND(ez.expression(ez.OpOr, cell_active), ez.expression(ez.OpOr, other_cell_active)));
|
|
|
|
|
|
|
|
log(" Size of SAT problem: %d cells, %d variables, %d clauses\n",
|
2014-07-20 03:36:46 -05:00
|
|
|
SIZE(sat_cells), ez.numCnfVariables(), ez.numCnfClauses());
|
2014-07-19 13:54:32 -05:00
|
|
|
|
|
|
|
if (ez.solve(sat_model, sat_model_values)) {
|
|
|
|
log(" According to the SAT solver this pair of cells can not be shared.\n");
|
2014-07-20 03:36:46 -05:00
|
|
|
log(" Model from SAT solver: %s = %d'", log_signal(all_ctrl_signals), SIZE(sat_model_values));
|
|
|
|
for (int i = SIZE(sat_model_values)-1; i >= 0; i--)
|
2014-07-19 13:54:32 -05:00
|
|
|
log("%c", sat_model_values[i] ? '1' : '0');
|
|
|
|
log("\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
log(" According to the SAT solver this pair of cells can be shared.\n");
|
|
|
|
shareable_cells.erase(other_cell);
|
2014-07-20 08:00:18 -05:00
|
|
|
|
|
|
|
int cell_select_score = 0;
|
|
|
|
int other_cell_select_score = 0;
|
|
|
|
|
|
|
|
for (auto &p : cell_activation_patterns)
|
|
|
|
cell_select_score += p.first.width;
|
|
|
|
|
|
|
|
for (auto &p : other_cell_activation_patterns)
|
|
|
|
other_cell_select_score += p.first.width;
|
|
|
|
|
|
|
|
RTLIL::Cell *supercell;
|
|
|
|
if (cell_select_score <= other_cell_select_score) {
|
|
|
|
RTLIL::SigSpec act = make_cell_activation_logic(cell_activation_patterns);
|
|
|
|
supercell = make_supercell(cell, other_cell, act);
|
|
|
|
log(" Activation signal for %s: %s\n", log_id(cell), log_signal(act));
|
|
|
|
} else {
|
|
|
|
RTLIL::SigSpec act = make_cell_activation_logic(other_cell_activation_patterns);
|
|
|
|
supercell = make_supercell(other_cell, cell, act);
|
|
|
|
log(" Activation signal for %s: %s\n", log_id(other_cell), log_signal(act));
|
|
|
|
}
|
|
|
|
|
|
|
|
log(" New cell: %s (%s)\n", log_id(supercell), log_id(supercell->type));
|
|
|
|
|
|
|
|
std::set<std::pair<RTLIL::SigSpec, RTLIL::Const>> supercell_activation_patterns;
|
|
|
|
supercell_activation_patterns.insert(cell_activation_patterns.begin(), cell_activation_patterns.end());
|
|
|
|
supercell_activation_patterns.insert(other_cell_activation_patterns.begin(), other_cell_activation_patterns.end());
|
|
|
|
optimize_activation_patterns(supercell_activation_patterns);
|
|
|
|
activation_patterns_cache[supercell] = supercell_activation_patterns;
|
|
|
|
shareable_cells.insert(supercell);
|
|
|
|
|
|
|
|
cells_to_remove.insert(cell);
|
|
|
|
cells_to_remove.insert(other_cell);
|
2014-07-19 13:54:32 -05:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2014-07-20 04:41:57 -05:00
|
|
|
|
|
|
|
if (!cells_to_remove.empty()) {
|
|
|
|
log("Removing %d cells in module %s:\n", SIZE(cells_to_remove), log_id(module));
|
|
|
|
for (auto c : cells_to_remove) {
|
|
|
|
log(" Removing cell %s (%s).\n", log_id(c), log_id(c->type));
|
|
|
|
module->cells.erase(c->name);
|
|
|
|
delete c;
|
|
|
|
}
|
|
|
|
}
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct SharePass : public Pass {
|
|
|
|
SharePass() : Pass("share", "perform sat-based resource sharing") { }
|
|
|
|
virtual void help()
|
|
|
|
{
|
|
|
|
// |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|
|
|
|
|
log("\n");
|
|
|
|
log(" share [options] [selection]\n");
|
|
|
|
log("\n");
|
|
|
|
log("This pass merges shareable resources into a single resource. A SAT solver\n");
|
|
|
|
log("is used to determine if two resources are share-able.\n");
|
|
|
|
log("\n");
|
2014-07-19 20:03:04 -05:00
|
|
|
log(" -force\n");
|
2014-07-19 13:54:32 -05:00
|
|
|
log(" Per default the selection of cells that is considered for sharing is\n");
|
2014-07-19 20:03:04 -05:00
|
|
|
log(" narrowed using a list of cell types. With this option all selected\n");
|
2014-07-19 13:54:32 -05:00
|
|
|
log(" cells are considered for resource sharing.\n");
|
|
|
|
log("\n");
|
|
|
|
log(" IMPORTANT NOTE: If the -all option is used then no cells with internal\n");
|
|
|
|
log(" state must be selected!\n");
|
|
|
|
log("\n");
|
2014-07-19 20:03:04 -05:00
|
|
|
log(" -aggressive\n");
|
|
|
|
log(" Per default some heuristics are used to reduce the number of cells\n");
|
|
|
|
log(" considered for resource sharing to only large resources. This options\n");
|
|
|
|
log(" turns this heuristics off, resulting in much more cells being considered\n");
|
|
|
|
log(" for resource sharing.\n");
|
|
|
|
log("\n");
|
|
|
|
log(" -fast\n");
|
2014-07-20 03:36:46 -05:00
|
|
|
log(" Only consider the simple part of the control logic in SAT solving, resulting\n");
|
2014-07-19 20:03:04 -05:00
|
|
|
log(" in much easier SAT problems at the cost of maybe missing some oportunities\n");
|
|
|
|
log(" for resource sharing.\n");
|
|
|
|
log("\n");
|
2014-07-19 13:54:32 -05:00
|
|
|
}
|
|
|
|
virtual void execute(std::vector<std::string> args, RTLIL::Design *design)
|
|
|
|
{
|
|
|
|
ShareWorkerConfig config;
|
2014-07-19 20:03:04 -05:00
|
|
|
config.opt_force = false;
|
|
|
|
config.opt_aggressive = false;
|
|
|
|
config.opt_fast = false;
|
2014-07-19 13:54:32 -05:00
|
|
|
|
|
|
|
log_header("Executing SHARE pass (SAT-based resource sharing).\n");
|
|
|
|
|
|
|
|
size_t argidx;
|
|
|
|
for (argidx = 1; argidx < args.size(); argidx++) {
|
2014-07-19 20:03:04 -05:00
|
|
|
if (args[argidx] == "-force") {
|
|
|
|
config.opt_force = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (args[argidx] == "-aggressive") {
|
|
|
|
config.opt_aggressive = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (args[argidx] == "-fast") {
|
|
|
|
config.opt_fast = true;
|
2014-07-19 13:54:32 -05:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
extra_args(args, argidx, design);
|
|
|
|
|
|
|
|
for (auto &mod_it : design->modules)
|
|
|
|
if (design->selected(mod_it.second))
|
|
|
|
ShareWorker(config, design, mod_it.second);
|
|
|
|
}
|
|
|
|
} SharePass;
|
|
|
|
|