2008-05-20 06:42:52 +02:00
|
|
|
/*
|
2010-10-10 06:35:57 +02:00
|
|
|
* Copyright (c) 2008-2010 Stephen Williams (steve@icarus.com)
|
2008-05-20 06:42:52 +02:00
|
|
|
*
|
|
|
|
|
* This source code is free software; you can redistribute it
|
|
|
|
|
* and/or modify it in source code form under the terms of the GNU
|
|
|
|
|
* General Public License as published by the Free Software
|
|
|
|
|
* Foundation; either version 2 of the License, or (at your option)
|
|
|
|
|
* any later version.
|
|
|
|
|
*
|
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
|
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
# include "config.h"
|
|
|
|
|
|
|
|
|
|
# include <iostream>
|
|
|
|
|
|
|
|
|
|
# include <typeinfo>
|
|
|
|
|
# include <cstdlib>
|
|
|
|
|
# include "compiler.h"
|
|
|
|
|
# include "netlist.h"
|
|
|
|
|
# include "netmisc.h"
|
2008-06-02 04:45:12 +02:00
|
|
|
# include "ivl_target_priv.h"
|
2008-05-20 06:42:52 +02:00
|
|
|
# include "ivl_assert.h"
|
|
|
|
|
|
2008-05-24 05:53:10 +02:00
|
|
|
static bool has_enable(ivl_switch_type_t tt)
|
|
|
|
|
{
|
|
|
|
|
switch (tt) {
|
|
|
|
|
case IVL_SW_TRANIF0:
|
|
|
|
|
case IVL_SW_TRANIF1:
|
|
|
|
|
case IVL_SW_RTRANIF0:
|
|
|
|
|
case IVL_SW_RTRANIF1:
|
|
|
|
|
return true;
|
|
|
|
|
default:
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2012-01-02 19:14:20 +01:00
|
|
|
NetTran::NetTran(NetScope*scope__, perm_string n, ivl_switch_type_t tt,
|
|
|
|
|
unsigned width)
|
|
|
|
|
: NetNode(scope__, n, has_enable(tt)? 3 : 2), type_(tt), wid_(width)
|
2008-05-20 06:42:52 +02:00
|
|
|
{
|
2008-09-11 04:34:28 +02:00
|
|
|
pin(0).set_dir(Link::PASSIVE);
|
|
|
|
|
pin(1).set_dir(Link::PASSIVE);
|
2008-05-24 05:53:10 +02:00
|
|
|
if (pin_count() == 3) {
|
2008-09-11 04:34:28 +02:00
|
|
|
pin(2).set_dir(Link::INPUT); // Enable
|
2008-05-20 06:42:52 +02:00
|
|
|
}
|
2010-10-10 06:35:57 +02:00
|
|
|
part_ = 0;
|
|
|
|
|
off_ = 0;
|
2008-05-20 06:42:52 +02:00
|
|
|
}
|
|
|
|
|
|
2008-10-13 18:51:05 +02:00
|
|
|
NetTran::NetTran(NetScope*scope__, perm_string n, unsigned wid, unsigned part, unsigned off)
|
|
|
|
|
: NetNode(scope__, n, 2), type_(IVL_SW_TRAN_VP), wid_(wid), part_(part), off_(off)
|
2008-06-03 20:16:25 +02:00
|
|
|
{
|
2008-09-11 04:34:28 +02:00
|
|
|
pin(0).set_dir(Link::PASSIVE);
|
|
|
|
|
pin(1).set_dir(Link::PASSIVE);
|
2008-06-03 20:16:25 +02:00
|
|
|
}
|
|
|
|
|
|
2008-05-20 06:42:52 +02:00
|
|
|
NetTran::~NetTran()
|
|
|
|
|
{
|
|
|
|
|
}
|
2008-06-02 04:45:12 +02:00
|
|
|
|
2008-06-03 20:16:25 +02:00
|
|
|
unsigned NetTran::vector_width() const
|
|
|
|
|
{
|
|
|
|
|
return wid_;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned NetTran::part_width() const
|
|
|
|
|
{
|
|
|
|
|
return part_;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned NetTran::part_offset() const
|
|
|
|
|
{
|
|
|
|
|
return off_;
|
|
|
|
|
}
|
|
|
|
|
|
2008-11-10 00:32:50 +01:00
|
|
|
void join_island(NetPins*obj)
|
2008-06-02 04:45:12 +02:00
|
|
|
{
|
|
|
|
|
IslandBranch*branch = dynamic_cast<IslandBranch*> (obj);
|
2008-06-04 05:21:39 +02:00
|
|
|
|
|
|
|
|
// If this is not even a branch, then stop now.
|
2008-06-02 04:45:12 +02:00
|
|
|
if (branch == 0)
|
|
|
|
|
return;
|
|
|
|
|
|
2008-06-04 05:21:39 +02:00
|
|
|
// If this is a branch, but already given to an island, then
|
|
|
|
|
// stop.
|
2008-11-10 00:32:50 +01:00
|
|
|
if (branch->island_)
|
2008-06-04 05:21:39 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
list<NetObj*> uncommitted_neighbors;
|
2008-06-02 04:45:12 +02:00
|
|
|
|
2008-06-04 05:21:39 +02:00
|
|
|
// Look for neighboring objects that might already be in
|
|
|
|
|
// islands. If we find something, then join that island.
|
2008-06-02 04:45:12 +02:00
|
|
|
for (unsigned idx = 0 ; idx < obj->pin_count() ; idx += 1) {
|
|
|
|
|
Nexus*nex = obj->pin(idx).nexus();
|
|
|
|
|
for (Link*cur = nex->first_nlink() ; cur ; cur = cur->next_nlink()) {
|
|
|
|
|
unsigned pin;
|
2008-08-05 05:54:05 +02:00
|
|
|
NetPins*tmp_pins;
|
|
|
|
|
cur->cur_link(tmp_pins, pin);
|
|
|
|
|
|
|
|
|
|
NetObj*tmp = dynamic_cast<NetObj*> (tmp_pins);
|
|
|
|
|
if (tmp == 0)
|
|
|
|
|
continue;
|
2008-06-04 05:21:39 +02:00
|
|
|
|
|
|
|
|
// Skip self.
|
2008-06-02 04:45:12 +02:00
|
|
|
if (tmp == obj)
|
|
|
|
|
continue;
|
|
|
|
|
|
2008-11-10 00:32:50 +01:00
|
|
|
// If tmp is not a branch, then skip it.
|
2008-06-02 04:45:12 +02:00
|
|
|
IslandBranch*tmp_branch = dynamic_cast<IslandBranch*> (tmp);
|
|
|
|
|
if (tmp_branch == 0)
|
|
|
|
|
continue;
|
|
|
|
|
|
2008-11-10 00:32:50 +01:00
|
|
|
// If tmp is an uncommitted branch, then save
|
2008-06-04 05:21:39 +02:00
|
|
|
// it. When I finally choose an island for self,
|
2008-06-10 18:02:24 +02:00
|
|
|
// these branches will be scanned so that they join
|
2008-06-04 05:21:39 +02:00
|
|
|
// this island as well.
|
2008-11-10 00:32:50 +01:00
|
|
|
if (tmp_branch->island_ == 0) {
|
2008-06-04 05:21:39 +02:00
|
|
|
uncommitted_neighbors.push_back(tmp);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
2008-11-10 00:32:50 +01:00
|
|
|
ivl_assert(*obj, branch->island_==0 || branch->island_==tmp_branch->island_);
|
2008-06-04 05:21:39 +02:00
|
|
|
|
|
|
|
|
// We found an existing island to join. Join it
|
|
|
|
|
// now. Keep scanning in order to find more neighbors.
|
2008-11-10 00:32:50 +01:00
|
|
|
if (branch->island_ == 0) {
|
2008-06-04 05:21:39 +02:00
|
|
|
if (debug_elaborate)
|
|
|
|
|
cerr << obj->get_fileline() << ": debug: "
|
2008-06-12 19:04:29 +02:00
|
|
|
<< "Join branch to existing island." << endl;
|
2008-11-10 00:32:50 +01:00
|
|
|
branch->island_ = tmp_branch->island_;
|
|
|
|
|
ivl_assert(*obj, branch->island_->discipline == tmp_branch->island_->discipline);
|
2008-06-04 05:21:39 +02:00
|
|
|
|
2008-11-10 00:32:50 +01:00
|
|
|
} else if (branch->island_ != tmp_branch->island_) {
|
2008-06-04 05:21:39 +02:00
|
|
|
cerr << obj->get_fileline() << ": internal error: "
|
|
|
|
|
<< "Oops, Found 2 neighboring islands." << endl;
|
|
|
|
|
ivl_assert(*obj, 0);
|
|
|
|
|
}
|
2008-06-02 04:45:12 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2008-06-12 19:04:29 +02:00
|
|
|
// If after all that we did not find an island to join, then
|
2008-06-04 05:21:39 +02:00
|
|
|
// start the island not and join it.
|
2008-11-10 00:32:50 +01:00
|
|
|
if (branch->island_ == 0) {
|
|
|
|
|
branch->island_ = new ivl_island_s;
|
|
|
|
|
branch->island_->discipline = branch->discipline_;
|
2008-06-02 04:45:12 +02:00
|
|
|
if (debug_elaborate)
|
|
|
|
|
cerr << obj->get_fileline() << ": debug: "
|
|
|
|
|
<< "Create new island for this branch" << endl;
|
|
|
|
|
}
|
|
|
|
|
|
2008-06-04 05:21:39 +02:00
|
|
|
// Now scan all the uncommitted neighbors I found. Calling
|
|
|
|
|
// join_island() on them will cause them to notice me in the
|
|
|
|
|
// process, and thus they will join my island. This process
|
|
|
|
|
// will recurse until all the connected branches join this island.
|
|
|
|
|
for (list<NetObj*>::iterator cur = uncommitted_neighbors.begin()
|
2010-10-23 23:57:59 +02:00
|
|
|
; cur != uncommitted_neighbors.end() ; ++ cur ) {
|
2008-06-04 05:21:39 +02:00
|
|
|
join_island(*cur);
|
|
|
|
|
}
|
2008-06-02 04:45:12 +02:00
|
|
|
}
|