1998-11-13 07:23:17 +01:00
|
|
|
/*
|
2000-02-23 03:56:53 +01:00
|
|
|
* Copyright (c) 1998-2000 Stephen Williams (steve@icarus.com)
|
1998-11-13 07:23:17 +01: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
|
|
|
|
|
*/
|
2000-02-23 03:56:53 +01:00
|
|
|
#if !defined(WINNT) && !defined(macintosh)
|
2000-07-15 07:13:43 +02:00
|
|
|
#ident "$Id: cprop.cc,v 1.13 2000/07/15 05:13:43 steve Exp $"
|
1998-11-13 07:23:17 +01:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
# include "netlist.h"
|
2000-05-14 19:55:04 +02:00
|
|
|
# include "netmisc.h"
|
1999-12-17 07:18:15 +01:00
|
|
|
# include "functor.h"
|
1998-11-13 07:23:17 +01:00
|
|
|
# include <assert.h>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
/*
|
|
|
|
|
* The cprop function below invokes constant propogation where
|
|
|
|
|
* possible. The elaboration generates NetConst objects. I can remove
|
|
|
|
|
* these and replace the gates connected to it with simpler ones. I
|
|
|
|
|
* may even be able to replace nets with a new constant.
|
|
|
|
|
*/
|
1998-11-13 07:23:17 +01:00
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
struct cprop_functor : public functor_t {
|
1998-11-13 07:23:17 +01:00
|
|
|
|
1999-12-30 05:19:12 +01:00
|
|
|
unsigned count;
|
|
|
|
|
|
|
|
|
|
virtual void lpm_add_sub(Design*des, NetAddSub*obj);
|
|
|
|
|
virtual void lpm_ff(Design*des, NetFF*obj);
|
1999-12-17 07:18:15 +01:00
|
|
|
virtual void lpm_logic(Design*des, NetLogic*obj);
|
2000-07-15 07:13:43 +02:00
|
|
|
virtual void lpm_mux(Design*des, NetMux*obj);
|
1999-12-17 07:18:15 +01:00
|
|
|
};
|
1998-11-13 07:23:17 +01:00
|
|
|
|
1999-12-30 05:19:12 +01:00
|
|
|
void cprop_functor::lpm_add_sub(Design*des, NetAddSub*obj)
|
|
|
|
|
{
|
|
|
|
|
// For now, only additions are handled.
|
|
|
|
|
if (obj->attribute("LPM_Direction") != "ADD")
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
// If the low bit on the A side is 0, then eliminate it from
|
|
|
|
|
// the adder, and pass the B side directly to the
|
|
|
|
|
// result. Don't reduce the adder smaller then a 1-bit
|
|
|
|
|
// adder. These will be eliminated later.
|
|
|
|
|
while ((obj->width() > 1)
|
2000-05-14 19:55:04 +02:00
|
|
|
&& link_drivers_constant(obj->pin_DataA(0))
|
1999-12-30 05:19:12 +01:00
|
|
|
&& (driven_value(obj->pin_DataA(0)) == verinum::V0)) {
|
|
|
|
|
|
|
|
|
|
NetAddSub*tmp = 0;
|
|
|
|
|
tmp = new NetAddSub(obj->name(), obj->width()-1);
|
|
|
|
|
//connect(tmp->pin_Aclr(), obj->pin_Aclr());
|
|
|
|
|
//connect(tmp->pin_Add_Sub(), obj->pin_Add_Sub());
|
|
|
|
|
//connect(tmp->pin_Clock(), obj->pin_Clock());
|
|
|
|
|
//connect(tmp->pin_Cin(), obj->pin_Cin());
|
|
|
|
|
connect(tmp->pin_Cout(), obj->pin_Cout());
|
|
|
|
|
//connect(tmp->pin_Overflow(), obj->pin_Overflow());
|
|
|
|
|
for (unsigned idx = 0 ; idx < tmp->width() ; idx += 1) {
|
|
|
|
|
connect(tmp->pin_DataA(idx), obj->pin_DataA(idx+1));
|
|
|
|
|
connect(tmp->pin_DataB(idx), obj->pin_DataB(idx+1));
|
|
|
|
|
connect(tmp->pin_Result(idx), obj->pin_Result(idx+1));
|
|
|
|
|
}
|
|
|
|
|
connect(obj->pin_Result(0), obj->pin_DataB(0));
|
|
|
|
|
delete obj;
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
obj = tmp;
|
|
|
|
|
count += 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Now do the same thing on the B side.
|
|
|
|
|
while ((obj->width() > 1)
|
2000-05-14 19:55:04 +02:00
|
|
|
&& link_drivers_constant(obj->pin_DataB(0))
|
1999-12-30 05:19:12 +01:00
|
|
|
&& (driven_value(obj->pin_DataB(0)) == verinum::V0)) {
|
|
|
|
|
|
|
|
|
|
NetAddSub*tmp = 0;
|
|
|
|
|
tmp = new NetAddSub(obj->name(), obj->width()-1);
|
|
|
|
|
//connect(tmp->pin_Aclr(), obj->pin_Aclr());
|
|
|
|
|
//connect(tmp->pin_Add_Sub(), obj->pin_Add_Sub());
|
|
|
|
|
//connect(tmp->pin_Clock(), obj->pin_Clock());
|
|
|
|
|
//connect(tmp->pin_Cin(), obj->pin_Cin());
|
|
|
|
|
connect(tmp->pin_Cout(), obj->pin_Cout());
|
|
|
|
|
//connect(tmp->pin_Overflow(), obj->pin_Overflow());
|
|
|
|
|
for (unsigned idx = 0 ; idx < tmp->width() ; idx += 1) {
|
|
|
|
|
connect(tmp->pin_DataA(idx), obj->pin_DataA(idx+1));
|
|
|
|
|
connect(tmp->pin_DataB(idx), obj->pin_DataB(idx+1));
|
|
|
|
|
connect(tmp->pin_Result(idx), obj->pin_Result(idx+1));
|
|
|
|
|
}
|
|
|
|
|
connect(obj->pin_Result(0), obj->pin_DataA(0));
|
|
|
|
|
delete obj;
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
obj = tmp;
|
|
|
|
|
count += 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If the adder is only 1 bit wide, then replace it with the
|
|
|
|
|
// simple logic gate.
|
|
|
|
|
if (obj->width() == 1) {
|
|
|
|
|
NetLogic*tmp;
|
|
|
|
|
if (obj->pin_Cout().is_linked()) {
|
|
|
|
|
tmp = new NetLogic(des->local_symbol(obj->name()), 3,
|
|
|
|
|
NetLogic::AND);
|
|
|
|
|
connect(tmp->pin(0), obj->pin_Cout());
|
|
|
|
|
connect(tmp->pin(1), obj->pin_DataA(0));
|
|
|
|
|
connect(tmp->pin(2), obj->pin_DataB(0));
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
}
|
|
|
|
|
tmp = new NetLogic(obj->name(), 3, NetLogic::XOR);
|
|
|
|
|
connect(tmp->pin(0), obj->pin_Result(0));
|
|
|
|
|
connect(tmp->pin(1), obj->pin_DataA(0));
|
|
|
|
|
connect(tmp->pin(2), obj->pin_DataB(0));
|
|
|
|
|
delete obj;
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
count += 1;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void cprop_functor::lpm_ff(Design*des, NetFF*obj)
|
|
|
|
|
{
|
|
|
|
|
// Look for and count unlinked FF outputs. Note that if the
|
|
|
|
|
// Data and Q pins are connected together, they can be removed
|
|
|
|
|
// from the circuit.
|
|
|
|
|
unsigned unlinked_count = 0;
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->width() ; idx += 1) {
|
|
|
|
|
if (connected(obj->pin_Data(idx), obj->pin_Q(idx))) {
|
|
|
|
|
obj->pin_Data(idx).unlink();
|
|
|
|
|
obj->pin_Q(idx).unlink();
|
|
|
|
|
}
|
|
|
|
|
if (! obj->pin_Q(idx).is_linked())
|
|
|
|
|
unlinked_count += 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If the entire FF is unlinked, remove the whole thing.
|
|
|
|
|
if (unlinked_count == obj->width()) {
|
|
|
|
|
delete obj;
|
|
|
|
|
count += 1;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If some of the FFs are unconnected, make a new FF array
|
|
|
|
|
// that does not include the useless FF devices.
|
|
|
|
|
if (unlinked_count > 0) {
|
|
|
|
|
NetFF*tmp = new NetFF(obj->name(), obj->width()-unlinked_count);
|
|
|
|
|
connect(tmp->pin_Clock(), obj->pin_Clock());
|
|
|
|
|
connect(tmp->pin_Enable(), obj->pin_Enable());
|
|
|
|
|
connect(tmp->pin_Aload(), obj->pin_Aload());
|
|
|
|
|
connect(tmp->pin_Aset(), obj->pin_Aset());
|
|
|
|
|
connect(tmp->pin_Aclr(), obj->pin_Aclr());
|
|
|
|
|
connect(tmp->pin_Sload(), obj->pin_Sload());
|
|
|
|
|
connect(tmp->pin_Sset(), obj->pin_Sset());
|
|
|
|
|
connect(tmp->pin_Sclr(), obj->pin_Sclr());
|
|
|
|
|
|
|
|
|
|
unsigned tidx = 0;
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->width() ; idx += 1)
|
|
|
|
|
if (obj->pin_Q(idx).is_linked()) {
|
|
|
|
|
connect(tmp->pin_Data(tidx), obj->pin_Data(idx));
|
|
|
|
|
connect(tmp->pin_Q(tidx), obj->pin_Q(idx));
|
|
|
|
|
tidx += 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
assert(tidx == obj->width() - unlinked_count);
|
|
|
|
|
delete obj;
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
count += 1;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
void cprop_functor::lpm_logic(Design*des, NetLogic*obj)
|
1998-11-13 07:23:17 +01:00
|
|
|
{
|
1999-12-17 07:18:15 +01:00
|
|
|
switch (obj->type()) {
|
|
|
|
|
|
|
|
|
|
case NetLogic::AND:
|
|
|
|
|
// If there is one zero input to an AND gate, we know
|
|
|
|
|
// the resulting output is going to be zero and can
|
|
|
|
|
// elininate the gate.
|
|
|
|
|
for (unsigned idx = 1 ; idx < obj->pin_count() ; idx += 1) {
|
2000-05-14 19:55:04 +02:00
|
|
|
if (! link_drivers_constant(obj->pin(idx)))
|
1999-12-17 07:18:15 +01:00
|
|
|
continue;
|
|
|
|
|
if (driven_value(obj->pin(idx)) == verinum::V0) {
|
|
|
|
|
connect(obj->pin(0), obj->pin(idx));
|
|
|
|
|
delete obj;
|
1999-12-30 05:19:12 +01:00
|
|
|
count += 1;
|
1999-12-17 07:18:15 +01:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
1998-11-13 07:23:17 +01:00
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
// There are no zero constant drivers. If there are any
|
|
|
|
|
// non-constant drivers, give up.
|
|
|
|
|
for (unsigned idx = 1 ; idx < obj->pin_count() ; idx += 1) {
|
2000-05-14 19:55:04 +02:00
|
|
|
if (! link_drivers_constant(obj->pin(idx)))
|
1999-12-17 07:18:15 +01:00
|
|
|
return;
|
1998-11-13 07:23:17 +01:00
|
|
|
}
|
|
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
// If there are any non-1 values (Vx or Vz) then the
|
|
|
|
|
// result is Vx.
|
|
|
|
|
for (unsigned idx = 1 ; idx < obj->pin_count() ; idx += 1) {
|
|
|
|
|
if (driven_value(obj->pin(idx)) != verinum::V1) {
|
|
|
|
|
connect(obj->pin(0), obj->pin(idx));
|
|
|
|
|
delete obj;
|
1999-12-30 05:19:12 +01:00
|
|
|
count += 1;
|
1999-12-17 07:18:15 +01:00
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// What's left? The inputs are all 1's, return the first
|
|
|
|
|
// input as the output value and remove the gate.
|
|
|
|
|
connect(obj->pin(0), obj->pin(1));
|
|
|
|
|
delete obj;
|
1999-12-30 05:19:12 +01:00
|
|
|
count += 1;
|
1999-12-17 07:18:15 +01:00
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
break;
|
1998-11-13 07:23:17 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2000-07-15 07:13:43 +02:00
|
|
|
/*
|
|
|
|
|
* This detects the case where the mux selects between a value an
|
|
|
|
|
* Vz. In this case, replace the device with a bufif with the sel
|
|
|
|
|
* input used to enable the output.
|
|
|
|
|
*/
|
|
|
|
|
void cprop_functor::lpm_mux(Design*des, NetMux*obj)
|
|
|
|
|
{
|
|
|
|
|
if (obj->size() != 2)
|
|
|
|
|
return;
|
|
|
|
|
if (obj->sel_width() != 1)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
/* If the first input is all constant Vz, then replace the
|
|
|
|
|
NetMux with an array of BUFIF1 devices, with the enable
|
|
|
|
|
connected to the select input. */
|
|
|
|
|
bool flag = true;
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->width() ; idx += 1) {
|
|
|
|
|
if (! link_drivers_constant(obj->pin_Data(idx, 0))) {
|
|
|
|
|
flag = false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (driven_value(obj->pin_Data(idx, 0)) != verinum::Vz) {
|
|
|
|
|
flag = false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (flag) {
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->width() ; idx += 1) {
|
|
|
|
|
NetLogic*tmp = new NetLogic(des->local_symbol(obj->name()),
|
|
|
|
|
3, NetLogic::BUFIF1);
|
|
|
|
|
|
|
|
|
|
connect(obj->pin_Result(idx), tmp->pin(0));
|
|
|
|
|
connect(obj->pin_Data(idx,1), tmp->pin(1));
|
|
|
|
|
connect(obj->pin_Sel(0), tmp->pin(2));
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
count += 1;
|
|
|
|
|
delete obj;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If instead the second input is all constant Vz, replace the
|
|
|
|
|
NetMux with an array of BUFIF0 devices. */
|
|
|
|
|
flag = true;
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->width() ; idx += 1) {
|
|
|
|
|
if (! link_drivers_constant(obj->pin_Data(idx, 1))) {
|
|
|
|
|
flag = false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (driven_value(obj->pin_Data(idx, 1)) != verinum::Vz) {
|
|
|
|
|
flag = false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (flag) {
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->width() ; idx += 1) {
|
|
|
|
|
NetLogic*tmp = new NetLogic(des->local_symbol(obj->name()),
|
|
|
|
|
3, NetLogic::BUFIF1);
|
|
|
|
|
|
|
|
|
|
connect(obj->pin_Result(idx), tmp->pin(0));
|
|
|
|
|
connect(obj->pin_Data(idx,0), tmp->pin(1));
|
|
|
|
|
connect(obj->pin_Sel(0), tmp->pin(2));
|
|
|
|
|
des->add_node(tmp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
count += 1;
|
|
|
|
|
delete obj;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-11-13 07:23:17 +01:00
|
|
|
/*
|
1999-12-17 07:18:15 +01:00
|
|
|
* This functor looks to see if the constant is connected to nothing
|
1998-11-13 07:23:17 +01:00
|
|
|
* but signals. If that is the case, delete the dangling constant and
|
1999-12-17 07:18:15 +01:00
|
|
|
* the now useless signals. This functor is applied after the regular
|
|
|
|
|
* functor to clean up dangling constants that might be left behind.
|
1998-11-13 07:23:17 +01:00
|
|
|
*/
|
1999-12-17 07:18:15 +01:00
|
|
|
struct cprop_dc_functor : public functor_t {
|
|
|
|
|
|
|
|
|
|
virtual void lpm_const(Design*des, NetConst*obj);
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
void cprop_dc_functor::lpm_const(Design*des, NetConst*obj)
|
1998-11-13 07:23:17 +01:00
|
|
|
{
|
2000-01-02 18:56:42 +01:00
|
|
|
// If there are any links that take input, the constant is
|
|
|
|
|
// used structurally somewhere.
|
1999-12-17 04:38:46 +01:00
|
|
|
for (unsigned idx = 0 ; idx < obj->pin_count() ; idx += 1)
|
|
|
|
|
if (count_inputs(obj->pin(idx)) > 0)
|
|
|
|
|
return;
|
1998-11-13 07:23:17 +01:00
|
|
|
|
2000-01-02 18:56:42 +01:00
|
|
|
// Look for signals that have NetESignal nodes attached to
|
|
|
|
|
// them. If I find any, this this constant is used by a
|
|
|
|
|
// behavioral expression somewhere.
|
|
|
|
|
for (unsigned idx = 0 ; idx < obj->pin_count() ; idx += 1) {
|
2000-06-25 21:59:41 +02:00
|
|
|
Nexus*nex = obj->pin(idx).nexus();
|
|
|
|
|
for (Link*clnk = nex->first_nlink()
|
|
|
|
|
; clnk ; clnk = clnk->next_nlink()) {
|
|
|
|
|
|
2000-06-25 00:55:19 +02:00
|
|
|
NetObj*cur;
|
|
|
|
|
unsigned pin;
|
|
|
|
|
clnk->cur_link(cur, pin);
|
|
|
|
|
|
2000-01-02 18:56:42 +01:00
|
|
|
NetNet*tmp = dynamic_cast<NetNet*>(cur);
|
|
|
|
|
if (tmp && tmp->get_eref() > 0)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1998-12-02 05:37:13 +01:00
|
|
|
|
|
|
|
|
// Done. Delete me.
|
1998-11-13 07:23:17 +01:00
|
|
|
delete obj;
|
|
|
|
|
}
|
|
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
|
1998-11-13 07:23:17 +01:00
|
|
|
void cprop(Design*des)
|
|
|
|
|
{
|
1999-12-30 05:19:12 +01:00
|
|
|
// Continually propogate constants until a scan finds nothing
|
|
|
|
|
// to do.
|
1999-12-17 07:18:15 +01:00
|
|
|
cprop_functor prop;
|
1999-12-30 05:19:12 +01:00
|
|
|
do {
|
|
|
|
|
prop.count = 0;
|
|
|
|
|
des->functor(&prop);
|
|
|
|
|
} while (prop.count > 0);
|
1998-11-13 07:23:17 +01:00
|
|
|
|
1999-12-17 07:18:15 +01:00
|
|
|
cprop_dc_functor dc;
|
|
|
|
|
des->functor(&dc);
|
1998-11-13 07:23:17 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* $Log: cprop.cc,v $
|
2000-07-15 07:13:43 +02:00
|
|
|
* Revision 1.13 2000/07/15 05:13:43 steve
|
|
|
|
|
* Detect muxing Vz as a bufufN.
|
|
|
|
|
*
|
2000-06-25 21:59:41 +02:00
|
|
|
* Revision 1.12 2000/06/25 19:59:41 steve
|
|
|
|
|
* Redesign Links to include the Nexus class that
|
|
|
|
|
* carries properties of the connected set of links.
|
|
|
|
|
*
|
2000-06-25 00:55:19 +02:00
|
|
|
* Revision 1.11 2000/06/24 22:55:19 steve
|
|
|
|
|
* Get rid of useless next_link method.
|
|
|
|
|
*
|
2000-05-14 19:55:04 +02:00
|
|
|
* Revision 1.10 2000/05/14 17:55:04 steve
|
|
|
|
|
* Support initialization of FF Q value.
|
|
|
|
|
*
|
2000-05-07 06:37:55 +02:00
|
|
|
* Revision 1.9 2000/05/07 04:37:56 steve
|
|
|
|
|
* Carry strength values from Verilog source to the
|
|
|
|
|
* pform and netlist for gates.
|
|
|
|
|
*
|
|
|
|
|
* Change vvm constants to use the driver_t to drive
|
|
|
|
|
* a constant value. This works better if there are
|
|
|
|
|
* multiple drivers on a signal.
|
|
|
|
|
*
|
2000-04-28 23:00:28 +02:00
|
|
|
* Revision 1.8 2000/04/28 21:00:28 steve
|
|
|
|
|
* Over agressive signal elimination in constant probadation.
|
|
|
|
|
*
|
2000-02-23 03:56:53 +01:00
|
|
|
* Revision 1.7 2000/02/23 02:56:54 steve
|
|
|
|
|
* Macintosh compilers do not support ident.
|
|
|
|
|
*
|
2000-01-02 18:56:42 +01:00
|
|
|
* Revision 1.6 2000/01/02 17:56:42 steve
|
|
|
|
|
* Do not delete constants that input to exressions.
|
|
|
|
|
*
|
1999-12-30 05:19:12 +01:00
|
|
|
* Revision 1.5 1999/12/30 04:19:12 steve
|
|
|
|
|
* Propogate constant 0 in low bits of adders.
|
|
|
|
|
*
|
1999-12-17 07:18:15 +01:00
|
|
|
* Revision 1.4 1999/12/17 06:18:15 steve
|
|
|
|
|
* Rewrite the cprop functor to use the functor_t interface.
|
|
|
|
|
*
|
1999-12-17 04:38:46 +01:00
|
|
|
* Revision 1.3 1999/12/17 03:38:46 steve
|
|
|
|
|
* NetConst can now hold wide constants.
|
|
|
|
|
*
|
1998-12-02 05:37:13 +01:00
|
|
|
* Revision 1.2 1998/12/02 04:37:13 steve
|
|
|
|
|
* Add the nobufz function to eliminate bufz objects,
|
|
|
|
|
* Object links are marked with direction,
|
|
|
|
|
* constant propagation is more careful will wide links,
|
|
|
|
|
* Signal folding is aware of attributes, and
|
|
|
|
|
* the XNF target can dump UDP objects based on LCA
|
|
|
|
|
* attributes.
|
|
|
|
|
*
|
1998-11-13 07:23:17 +01:00
|
|
|
* Revision 1.1 1998/11/13 06:23:17 steve
|
|
|
|
|
* Introduce netlist optimizations with the
|
|
|
|
|
* cprop function to do constant propogation.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|