2001-11-10 19:07:11 +01:00
|
|
|
/*
|
2005-04-03 07:45:51 +02:00
|
|
|
* Copyright (c) 2005 Stephen Williams <steve@icarus.com>
|
2001-11-10 19:07:11 +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
|
|
|
|
|
*/
|
2002-08-12 03:34:58 +02:00
|
|
|
#ifdef HAVE_CVS_IDENT
|
2005-09-20 20:34:01 +02:00
|
|
|
#ident "$Id: delay.cc,v 1.10 2005/09/20 18:34:02 steve Exp $"
|
2001-11-10 19:07:11 +01:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#include "delay.h"
|
2005-05-14 21:43:23 +02:00
|
|
|
#include "schedule.h"
|
2001-11-10 19:07:11 +01:00
|
|
|
#include <assert.h>
|
|
|
|
|
|
2005-04-03 07:45:51 +02:00
|
|
|
vvp_delay_t::vvp_delay_t(vvp_time64_t rise, vvp_time64_t fall)
|
2001-11-10 19:07:11 +01:00
|
|
|
{
|
2005-04-03 07:45:51 +02:00
|
|
|
rise_ = rise;
|
|
|
|
|
fall_ = fall;
|
|
|
|
|
decay_= fall < rise? fall : rise;
|
|
|
|
|
min_delay_ = decay_;
|
2001-11-10 19:07:11 +01:00
|
|
|
}
|
|
|
|
|
|
2005-04-03 07:45:51 +02:00
|
|
|
vvp_delay_t::vvp_delay_t(vvp_time64_t rise, vvp_time64_t fall, vvp_time64_t decay)
|
2001-11-10 19:07:11 +01:00
|
|
|
{
|
2005-04-03 07:45:51 +02:00
|
|
|
rise_ = rise;
|
|
|
|
|
fall_ = fall;
|
|
|
|
|
decay_= decay;
|
|
|
|
|
|
|
|
|
|
min_delay_ = rise_;
|
|
|
|
|
if (fall_ < min_delay_)
|
|
|
|
|
min_delay_ = fall_;
|
|
|
|
|
if (decay_ < min_delay_)
|
|
|
|
|
min_delay_ = decay_;
|
2001-11-10 19:07:11 +01:00
|
|
|
}
|
|
|
|
|
|
2005-04-03 07:45:51 +02:00
|
|
|
vvp_delay_t::~vvp_delay_t()
|
2001-11-10 19:07:11 +01:00
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
2005-04-03 07:45:51 +02:00
|
|
|
vvp_time64_t vvp_delay_t::get_delay(vvp_bit4_t from, vvp_bit4_t to)
|
2001-11-10 19:07:11 +01:00
|
|
|
{
|
2005-04-03 07:45:51 +02:00
|
|
|
switch (from) {
|
|
|
|
|
case BIT4_0:
|
|
|
|
|
switch (to) {
|
|
|
|
|
case BIT4_0: return 0;
|
|
|
|
|
case BIT4_1: return rise_;
|
|
|
|
|
case BIT4_X: return min_delay_;
|
|
|
|
|
case BIT4_Z: return decay_;
|
|
|
|
|
}
|
2001-11-10 19:07:11 +01:00
|
|
|
break;
|
2005-04-03 07:45:51 +02:00
|
|
|
case BIT4_1:
|
|
|
|
|
switch (to) {
|
|
|
|
|
case BIT4_0: return fall_;
|
|
|
|
|
case BIT4_1: return 0;
|
|
|
|
|
case BIT4_X: return min_delay_;
|
|
|
|
|
case BIT4_Z: return decay_;
|
2001-11-10 19:07:11 +01:00
|
|
|
}
|
2004-10-04 03:10:51 +02:00
|
|
|
break;
|
2005-04-03 07:45:51 +02:00
|
|
|
case BIT4_X:
|
|
|
|
|
switch (to) {
|
|
|
|
|
case BIT4_0: return fall_;
|
|
|
|
|
case BIT4_1: return rise_;
|
|
|
|
|
case BIT4_X: return 0;
|
|
|
|
|
case BIT4_Z: return decay_;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
case BIT4_Z:
|
|
|
|
|
switch (to) {
|
|
|
|
|
case BIT4_0: return fall_;
|
|
|
|
|
case BIT4_1: return rise_;
|
|
|
|
|
case BIT4_X: return min_delay_;
|
|
|
|
|
case BIT4_Z: return 0;
|
2001-11-10 19:07:11 +01:00
|
|
|
}
|
2005-04-03 07:45:51 +02:00
|
|
|
break;
|
2001-11-10 19:07:11 +01:00
|
|
|
}
|
|
|
|
|
|
2005-04-03 07:45:51 +02:00
|
|
|
assert(0);
|
|
|
|
|
return 0;
|
2001-11-10 19:07:11 +01:00
|
|
|
}
|
|
|
|
|
|
2005-07-06 06:29:25 +02:00
|
|
|
vvp_time64_t vvp_delay_t::get_min_delay() const
|
|
|
|
|
{
|
|
|
|
|
return min_delay_;
|
|
|
|
|
}
|
|
|
|
|
|
2005-06-02 18:02:11 +02:00
|
|
|
vvp_fun_delay::vvp_fun_delay(vvp_net_t*n, vvp_bit4_t init, const vvp_delay_t&d)
|
2005-07-06 06:29:25 +02:00
|
|
|
: net_(n), delay_(d), cur_vec4_(1)
|
2005-05-14 21:43:23 +02:00
|
|
|
{
|
2005-07-06 06:29:25 +02:00
|
|
|
cur_vec4_.set_bit(0, init);
|
|
|
|
|
flag_real_ = false;
|
|
|
|
|
flag_vec4_ = false;
|
2005-05-14 21:43:23 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
vvp_fun_delay::~vvp_fun_delay()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* FIXME: This implementation currently only uses the LSB to determine
|
|
|
|
|
* the delay type for the entire vector. It needs to be upgraded to
|
|
|
|
|
* account for different delays for different bits by generating a
|
|
|
|
|
* stream of vectors that lead up to the actual value.
|
|
|
|
|
*/
|
2005-06-22 02:04:48 +02:00
|
|
|
void vvp_fun_delay::recv_vec4(vvp_net_ptr_t port, const vvp_vector4_t&bit)
|
2005-05-14 21:43:23 +02:00
|
|
|
{
|
2005-07-06 06:29:25 +02:00
|
|
|
if (cur_vec4_.eeq(bit))
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
vvp_time64_t use_delay;
|
|
|
|
|
use_delay = delay_.get_delay(cur_vec4_.value(0), bit.value(0));
|
|
|
|
|
|
|
|
|
|
cur_vec4_ = bit;
|
|
|
|
|
if (use_delay == 0) {
|
|
|
|
|
vvp_send_vec4(net_->out, cur_vec4_);
|
|
|
|
|
} else {
|
|
|
|
|
flag_vec4_ = true;
|
|
|
|
|
flag_real_ = false;
|
|
|
|
|
schedule_generic(this, use_delay, false);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_fun_delay::recv_real(vvp_net_ptr_t port, double bit)
|
|
|
|
|
{
|
|
|
|
|
if (cur_real_ == bit)
|
2005-05-14 21:43:23 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
vvp_time64_t use_delay;
|
2005-07-06 06:29:25 +02:00
|
|
|
use_delay = delay_.get_min_delay();
|
2005-05-14 21:43:23 +02:00
|
|
|
|
2005-07-06 06:29:25 +02:00
|
|
|
cur_real_ = bit;
|
|
|
|
|
if (use_delay == 0) {
|
|
|
|
|
vvp_send_real(net_->out, cur_real_);
|
|
|
|
|
} else {
|
|
|
|
|
flag_vec4_ = false;
|
|
|
|
|
flag_real_ = true;
|
2005-06-09 07:04:45 +02:00
|
|
|
schedule_generic(this, use_delay, false);
|
2005-07-06 06:29:25 +02:00
|
|
|
}
|
2005-06-02 18:02:11 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void vvp_fun_delay::run_run()
|
|
|
|
|
{
|
2005-07-06 06:29:25 +02:00
|
|
|
if (flag_vec4_) {
|
|
|
|
|
vvp_send_vec4(net_->out, cur_vec4_);
|
|
|
|
|
flag_vec4_ = false;
|
|
|
|
|
}
|
|
|
|
|
if (flag_real_) {
|
|
|
|
|
vvp_send_real(net_->out, cur_real_);
|
|
|
|
|
flag_real_ = false;
|
|
|
|
|
}
|
2005-05-14 21:43:23 +02:00
|
|
|
}
|
|
|
|
|
|
2001-11-10 19:07:11 +01:00
|
|
|
/*
|
2005-04-03 07:45:51 +02:00
|
|
|
* $Log: delay.cc,v $
|
2005-09-20 20:34:01 +02:00
|
|
|
* Revision 1.10 2005/09/20 18:34:02 steve
|
|
|
|
|
* Clean up compiler warnings.
|
|
|
|
|
*
|
2005-07-06 06:29:25 +02:00
|
|
|
* Revision 1.9 2005/07/06 04:29:25 steve
|
|
|
|
|
* Implement real valued signals and arith nodes.
|
|
|
|
|
*
|
2005-06-22 02:04:48 +02:00
|
|
|
* Revision 1.8 2005/06/22 00:04:49 steve
|
|
|
|
|
* Reduce vvp_vector4 copies by using const references.
|
|
|
|
|
*
|
2005-06-09 07:04:45 +02:00
|
|
|
* Revision 1.7 2005/06/09 05:04:45 steve
|
|
|
|
|
* Support UDP initial values.
|
|
|
|
|
*
|
2005-06-02 18:02:11 +02:00
|
|
|
* Revision 1.6 2005/06/02 16:02:11 steve
|
|
|
|
|
* Add support for notif0/1 gates.
|
|
|
|
|
* Make delay nodes support inertial delay.
|
|
|
|
|
* Add the %force/link instruction.
|
|
|
|
|
*
|
2005-05-14 21:43:23 +02:00
|
|
|
* Revision 1.5 2005/05/14 19:43:23 steve
|
|
|
|
|
* Move functor delays to vvp_delay_fun object.
|
|
|
|
|
*
|
2005-04-03 07:45:51 +02:00
|
|
|
* Revision 1.4 2005/04/03 05:45:51 steve
|
|
|
|
|
* Rework the vvp_delay_t class.
|
|
|
|
|
*
|
|
|
|
|
*/
|