mirror of
https://github.com/steveicarus/iverilog.git
synced 2026-08-29 01:03:29 +02:00
Drive strengths and delays are often handled as a pair of drive values and a rise/fall/decay triple. Add small helper types to carry these groups and use them in the continuous assignment and gate/UDP elaboration paths. Use the same helper types when propagating drive and delay values through netlist links. Also add helpers for dumping the values in debug output. This keeps the behavior consistent and fixes one small bug where some of the debug dumps printed the pointer value for the delays, rather than the actual delay values. Signed-off-by: Lars-Peter Clausen <[email protected]>
186 lines
4.7 KiB
C++
186 lines
4.7 KiB
C++
/*
|
|
* Copyright (c) 1999-2026 Stephen Williams ([email protected])
|
|
*
|
|
* 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
# include "config.h"
|
|
|
|
# include <iostream>
|
|
|
|
# include "PDelays.h"
|
|
# include "PExpr.h"
|
|
# include "verinum.h"
|
|
# include "netmisc.h"
|
|
|
|
using namespace std;
|
|
|
|
PDelays::PDelays()
|
|
{
|
|
delete_flag_ = true;
|
|
for (unsigned idx = 0 ; idx < 3 ; idx += 1)
|
|
delay_[idx] = 0;
|
|
}
|
|
|
|
PDelays::~PDelays()
|
|
{
|
|
if (delete_flag_) {
|
|
for (unsigned idx = 0 ; idx < 3 ; idx += 1)
|
|
delete delay_[idx];
|
|
}
|
|
}
|
|
|
|
void PDelays::set_delay(PExpr*del)
|
|
{
|
|
assert(del);
|
|
assert(delay_[0] == 0);
|
|
delay_[0] = del;
|
|
delete_flag_ = true;
|
|
}
|
|
|
|
|
|
void PDelays::set_delays(const list<PExpr*>*del, bool df)
|
|
{
|
|
assert(del);
|
|
assert(del->size() <= 3);
|
|
|
|
list<PExpr*>::const_iterator cur = del->begin();
|
|
for (unsigned idx = 0 ; cur != del->end() ; idx += 1, ++cur)
|
|
delay_[idx] = *cur;
|
|
|
|
delete_flag_ = df;
|
|
}
|
|
|
|
unsigned PDelays::delay_count() const
|
|
{
|
|
unsigned dly_cnt = 0;
|
|
for (unsigned idx = 0 ; idx < 3 ; idx += 1)
|
|
if (delay_[idx]) dly_cnt += 1;
|
|
|
|
return dly_cnt;
|
|
}
|
|
|
|
static NetExpr*calculate_val(Design*des, NetScope*scope, PExpr*expr)
|
|
{
|
|
NetExpr*dex = elab_and_eval(des, scope, expr, -1);
|
|
|
|
check_for_inconsistent_delays(scope);
|
|
|
|
/* If the delay expression is a real constant or vector
|
|
constant, then evaluate it, scale it to the local time
|
|
units, and return an adjusted value. */
|
|
|
|
if (NetECReal*tmp = dynamic_cast<NetECReal*>(dex)) {
|
|
uint64_t delay = get_scaled_time_from_real(des, scope, tmp);
|
|
|
|
delete tmp;
|
|
NetEConst*tmp2 = new NetEConst(verinum(delay, 64));
|
|
tmp2->set_line(*expr);
|
|
return tmp2;
|
|
}
|
|
|
|
|
|
if (NetEConst*tmp = dynamic_cast<NetEConst*>(dex)) {
|
|
verinum fn = tmp->value();
|
|
uint64_t delay = des->scale_to_precision(fn.as_ulong64(), scope);
|
|
|
|
delete tmp;
|
|
NetEConst*tmp2 = new NetEConst(verinum(delay, 64));
|
|
tmp2->set_line(*expr);
|
|
return tmp2;
|
|
}
|
|
|
|
/* Oops, cannot evaluate down to a constant. */
|
|
return dex;
|
|
}
|
|
|
|
static NetExpr* make_delay_nets(Design*des, NetScope*scope, NetExpr*expr)
|
|
{
|
|
if (expr == 0)
|
|
return 0;
|
|
|
|
if (dynamic_cast<NetESignal*> (expr))
|
|
return expr;
|
|
|
|
if (dynamic_cast<NetEConst*> (expr))
|
|
return expr;
|
|
|
|
NetNet*sig = expr->synthesize(des, scope, expr);
|
|
if (sig == 0) {
|
|
cerr << expr->get_fileline() << ": error: Expression " << *expr
|
|
<< " is not suitable as a delay expression." << endl;
|
|
des->errors += 1;
|
|
return 0;
|
|
}
|
|
|
|
expr = new NetESignal(sig);
|
|
return expr;
|
|
}
|
|
|
|
static const NetExpr *calc_decay_time(const NetExpr *rise,
|
|
const NetExpr *fall)
|
|
{
|
|
const NetEConst *c_rise = dynamic_cast<const NetEConst*>(rise);
|
|
const NetEConst *c_fall = dynamic_cast<const NetEConst*>(fall);
|
|
if (c_rise && c_fall) {
|
|
if (c_rise->value() < c_fall->value()) return rise;
|
|
else return fall;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void PDelays::eval_delays(Design*des, NetScope*scope, delay_exprs_t &delays,
|
|
bool as_nets_flag) const
|
|
{
|
|
assert(scope);
|
|
|
|
if (delay_[0]) {
|
|
NetExpr *rise = calculate_val(des, scope, delay_[0]);
|
|
if (as_nets_flag)
|
|
rise = make_delay_nets(des, scope, rise);
|
|
delays.rise = rise;
|
|
|
|
if (delay_[1]) {
|
|
NetExpr *fall = calculate_val(des, scope, delay_[1]);
|
|
if (as_nets_flag)
|
|
fall = make_delay_nets(des, scope, fall);
|
|
delays.fall = fall;
|
|
|
|
if (delay_[2]) {
|
|
NetExpr *decay = calculate_val(des, scope, delay_[2]);
|
|
if (as_nets_flag)
|
|
decay = make_delay_nets(des, scope, decay);
|
|
delays.decay = decay;
|
|
|
|
} else {
|
|
// If this is zero then we need to do the min()
|
|
// at run time.
|
|
delays.decay = calc_decay_time(delays.rise,
|
|
delays.fall);
|
|
}
|
|
} else {
|
|
assert(delay_[2] == 0);
|
|
delays.fall = delays.rise;
|
|
delays.decay = delays.rise;
|
|
}
|
|
} else {
|
|
delays.rise = nullptr;
|
|
delays.fall = nullptr;
|
|
delays.decay = nullptr;
|
|
}
|
|
}
|