2001-03-20 07:16:23 +01:00
|
|
|
/*
|
|
|
|
|
* Copyright (c) 2001 Stephen Williams (steve@icarus.com)
|
|
|
|
|
*
|
|
|
|
|
* 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
|
|
|
|
|
*/
|
|
|
|
|
#if !defined(WINNT)
|
2001-06-22 01:05:08 +02:00
|
|
|
#ident "$Id: vpi_signal.cc,v 1.17 2001/06/21 23:05:08 steve Exp $"
|
2001-03-20 07:16:23 +01:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* vpiReg handles are handled here. These objects represent vectors of
|
|
|
|
|
* .var objects that can be manipulated by the VPI module.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
# include "vpi_priv.h"
|
2001-03-21 06:13:03 +01:00
|
|
|
# include "functor.h"
|
2001-05-09 06:23:18 +02:00
|
|
|
# include <stdio.h>
|
2001-03-20 07:16:23 +01:00
|
|
|
# include <malloc.h>
|
|
|
|
|
# include <assert.h>
|
|
|
|
|
|
2001-03-25 22:45:09 +02:00
|
|
|
/*
|
|
|
|
|
* Hex digits that represent 4-value bits of Verilog are not as
|
|
|
|
|
* trivially obvious to display as if the bits were the usual 2-value
|
|
|
|
|
* bits. So, although it is possible to write a function that
|
|
|
|
|
* generates a correct character for 4*4-value bits, it is easier to
|
|
|
|
|
* just perform the lookup in a table. This only takes 256 bytes,
|
|
|
|
|
* which is not many executable instructions:-)
|
|
|
|
|
*
|
|
|
|
|
* The table is calculated as compile time, therefore, by the
|
|
|
|
|
* draw_tt.c program.
|
|
|
|
|
*/
|
2001-03-25 21:38:05 +02:00
|
|
|
extern const char hex_digits[256];
|
|
|
|
|
|
2001-03-25 22:45:09 +02:00
|
|
|
extern const char oct_digits[256];
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
/*
|
|
|
|
|
* implement vpi_get for vpiReg objects.
|
|
|
|
|
*/
|
|
|
|
|
static int signal_get(int code, vpiHandle ref)
|
|
|
|
|
{
|
|
|
|
|
assert((ref->vpi_type->type_code==vpiNet)
|
|
|
|
|
|| (ref->vpi_type->type_code==vpiReg));
|
|
|
|
|
|
|
|
|
|
struct __vpiSignal*rfp = (struct __vpiSignal*)ref;
|
|
|
|
|
|
|
|
|
|
switch (code) {
|
|
|
|
|
|
|
|
|
|
case vpiSigned:
|
2001-04-04 19:43:19 +02:00
|
|
|
return rfp->signed_flag != 0;
|
2001-03-20 07:16:23 +01:00
|
|
|
|
|
|
|
|
case vpiSize:
|
|
|
|
|
if (rfp->msb >= rfp->lsb)
|
|
|
|
|
return rfp->msb - rfp->lsb + 1;
|
|
|
|
|
else
|
|
|
|
|
return rfp->lsb - rfp->msb + 1;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static char* signal_get_str(int code, vpiHandle ref)
|
|
|
|
|
{
|
|
|
|
|
assert((ref->vpi_type->type_code==vpiNet)
|
|
|
|
|
|| (ref->vpi_type->type_code==vpiReg));
|
|
|
|
|
|
|
|
|
|
struct __vpiSignal*rfp = (struct __vpiSignal*)ref;
|
|
|
|
|
|
|
|
|
|
switch (code) {
|
|
|
|
|
|
|
|
|
|
case vpiFullName:
|
|
|
|
|
return (char*)rfp->name;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2001-03-21 06:13:03 +01:00
|
|
|
static char buf[4096];
|
|
|
|
|
|
2001-04-04 19:43:19 +02:00
|
|
|
static void signal_vpiDecStrVal(struct __vpiSignal*rfp, s_vpi_value*vp)
|
|
|
|
|
{
|
|
|
|
|
unsigned wid = (rfp->msb >= rfp->lsb)
|
|
|
|
|
? (rfp->msb - rfp->lsb + 1)
|
|
|
|
|
: (rfp->lsb - rfp->msb + 1);
|
|
|
|
|
|
|
|
|
|
unsigned long val = 0;
|
|
|
|
|
unsigned count_x = 0, count_z = 0;
|
|
|
|
|
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
2001-04-05 03:34:26 +02:00
|
|
|
vvp_ipoint_t fptr = ipoint_index(rfp->bits, wid-idx-1);
|
2001-04-04 19:43:19 +02:00
|
|
|
val *= 2;
|
|
|
|
|
switch (functor_oval(fptr)) {
|
|
|
|
|
case 0:
|
|
|
|
|
break;
|
|
|
|
|
case 1:
|
|
|
|
|
val += 1;
|
|
|
|
|
break;
|
|
|
|
|
case 2:
|
|
|
|
|
count_x += 1;
|
|
|
|
|
break;
|
|
|
|
|
case 3:
|
|
|
|
|
count_z += 1;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (count_x == wid) {
|
|
|
|
|
buf[0] = 'x';
|
|
|
|
|
buf[1] = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (count_x > 0) {
|
|
|
|
|
buf[0] = 'X';
|
|
|
|
|
buf[1] = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (count_z == wid) {
|
|
|
|
|
buf[0] = 'z';
|
|
|
|
|
buf[1] = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (count_z > 0) {
|
|
|
|
|
buf[0] = 'Z';
|
|
|
|
|
buf[1] = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (rfp->signed_flag) {
|
2001-05-22 06:08:49 +02:00
|
|
|
long tmp;
|
|
|
|
|
assert(sizeof(tmp) == sizeof(val));
|
|
|
|
|
if (val & (1<<(wid-1)) && wid < 8*sizeof(tmp)) {
|
|
|
|
|
tmp = -1;
|
|
|
|
|
tmp <<= wid;
|
|
|
|
|
tmp |= val;
|
|
|
|
|
} else {
|
|
|
|
|
tmp = val;
|
|
|
|
|
}
|
|
|
|
|
sprintf(buf, "%ld", tmp);
|
|
|
|
|
|
2001-04-04 19:43:19 +02:00
|
|
|
} else {
|
|
|
|
|
sprintf(buf, "%lu", val);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
/*
|
|
|
|
|
* The get_value method reads the values of the functors and returns
|
|
|
|
|
* the vector to the caller. This causes no side-effect, and reads the
|
|
|
|
|
* variables like a %load would.
|
|
|
|
|
*/
|
|
|
|
|
static void signal_get_value(vpiHandle ref, s_vpi_value*vp)
|
|
|
|
|
{
|
|
|
|
|
assert((ref->vpi_type->type_code==vpiNet)
|
|
|
|
|
|| (ref->vpi_type->type_code==vpiReg));
|
|
|
|
|
|
|
|
|
|
struct __vpiSignal*rfp = (struct __vpiSignal*)ref;
|
|
|
|
|
|
2001-03-21 06:13:03 +01:00
|
|
|
unsigned wid = (rfp->msb >= rfp->lsb)
|
|
|
|
|
? (rfp->msb - rfp->lsb + 1)
|
|
|
|
|
: (rfp->lsb - rfp->msb + 1);
|
|
|
|
|
|
|
|
|
|
switch (vp->format) {
|
|
|
|
|
|
2001-05-15 17:09:08 +02:00
|
|
|
case vpiIntVal:
|
|
|
|
|
assert(wid <= 8 * sizeof vp->value.integer);
|
|
|
|
|
vp->value.integer = 0;
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
|
|
|
|
vvp_ipoint_t fptr = ipoint_index(rfp->bits, idx);
|
|
|
|
|
switch (functor_oval(fptr)) {
|
|
|
|
|
case 0:
|
|
|
|
|
break;
|
|
|
|
|
case 1:
|
|
|
|
|
vp->value.integer |= 1<<idx;
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
idx = wid;
|
|
|
|
|
vp->value.integer = 0;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
2001-03-21 06:13:03 +01:00
|
|
|
case vpiBinStrVal:
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
|
|
|
|
vvp_ipoint_t fptr = ipoint_index(rfp->bits, idx);
|
2001-04-04 19:43:19 +02:00
|
|
|
buf[wid-idx-1] = "01xz"[functor_oval(fptr)];
|
2001-03-21 06:13:03 +01:00
|
|
|
}
|
|
|
|
|
buf[wid] = 0;
|
|
|
|
|
vp->value.str = buf;
|
|
|
|
|
break;
|
|
|
|
|
|
2001-03-25 21:38:05 +02:00
|
|
|
case vpiHexStrVal: {
|
|
|
|
|
unsigned hval, hwid;
|
|
|
|
|
hwid = (wid + 3) / 4;
|
|
|
|
|
buf[hwid] = 0;
|
|
|
|
|
hval = 0;
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
|
|
|
|
vvp_ipoint_t fptr = ipoint_index(rfp->bits, idx);
|
2001-04-04 19:43:19 +02:00
|
|
|
hval = hval | (functor_oval(fptr) << 2*(idx % 4));
|
2001-03-25 21:38:05 +02:00
|
|
|
|
|
|
|
|
if (idx%4 == 3) {
|
|
|
|
|
hwid -= 1;
|
|
|
|
|
buf[hwid] = hex_digits[hval];
|
|
|
|
|
hval = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (hwid > 0) {
|
|
|
|
|
hwid -= 1;
|
|
|
|
|
buf[hwid] = hex_digits[hval];
|
|
|
|
|
hval = 0;
|
|
|
|
|
}
|
|
|
|
|
vp->value.str = buf;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2001-03-25 22:45:09 +02:00
|
|
|
case vpiOctStrVal: {
|
|
|
|
|
unsigned hval, hwid;
|
|
|
|
|
hwid = (wid + 2) / 3;
|
|
|
|
|
buf[hwid] = 0;
|
|
|
|
|
hval = 0;
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
|
|
|
|
vvp_ipoint_t fptr = ipoint_index(rfp->bits, idx);
|
2001-04-04 19:43:19 +02:00
|
|
|
hval = hval | (functor_oval(fptr) << 2*(idx % 3));
|
2001-03-25 22:45:09 +02:00
|
|
|
|
|
|
|
|
if (idx%3 == 2) {
|
|
|
|
|
hwid -= 1;
|
|
|
|
|
buf[hwid] = oct_digits[hval];
|
|
|
|
|
hval = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (hwid > 0) {
|
|
|
|
|
hwid -= 1;
|
|
|
|
|
buf[hwid] = oct_digits[hval];
|
|
|
|
|
hval = 0;
|
|
|
|
|
}
|
|
|
|
|
vp->value.str = buf;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2001-04-04 19:43:19 +02:00
|
|
|
case vpiDecStrVal:
|
|
|
|
|
signal_vpiDecStrVal(rfp, vp);
|
2001-04-05 03:34:26 +02:00
|
|
|
vp->value.str = buf;
|
2001-04-04 19:43:19 +02:00
|
|
|
break;
|
|
|
|
|
|
2001-03-21 06:13:03 +01:00
|
|
|
default:
|
|
|
|
|
/* XXXX Not implemented yet. */
|
|
|
|
|
assert(0);
|
|
|
|
|
}
|
2001-03-20 07:16:23 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The put_value method writes the value into the vector, and returns
|
|
|
|
|
* the affected ref. This operation works much like the %set or
|
|
|
|
|
* %assign instructions and causes all the side-effects that the
|
|
|
|
|
* equivilent instruction would cause.
|
|
|
|
|
*/
|
|
|
|
|
static vpiHandle signal_put_value(vpiHandle ref, s_vpi_value*vp,
|
2001-04-25 06:45:52 +02:00
|
|
|
p_vpi_time when, int flags)
|
2001-03-20 07:16:23 +01:00
|
|
|
{
|
2001-05-14 02:42:32 +02:00
|
|
|
unsigned wid;
|
|
|
|
|
struct __vpiSignal*rfp;
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
assert((ref->vpi_type->type_code==vpiNet)
|
|
|
|
|
|| (ref->vpi_type->type_code==vpiReg));
|
|
|
|
|
|
2001-05-14 02:42:32 +02:00
|
|
|
rfp = (struct __vpiSignal*)ref;
|
2001-03-20 07:16:23 +01:00
|
|
|
|
2001-04-25 06:45:52 +02:00
|
|
|
/* XXXX delays are not yet supported. */
|
|
|
|
|
assert(flags == vpiNoDelay);
|
|
|
|
|
|
2001-05-14 02:42:32 +02:00
|
|
|
wid = (rfp->msb >= rfp->lsb)
|
2001-04-25 06:45:52 +02:00
|
|
|
? (rfp->msb - rfp->lsb + 1)
|
|
|
|
|
: (rfp->lsb - rfp->msb + 1);
|
|
|
|
|
|
|
|
|
|
switch (vp->format) {
|
|
|
|
|
|
2001-04-26 02:01:33 +02:00
|
|
|
case vpiIntVal: {
|
2001-05-14 02:42:32 +02:00
|
|
|
if (wid > 8*sizeof(long)) {
|
|
|
|
|
fprintf(stderr, "internal error: wid(%u) "
|
|
|
|
|
"too large.\n", wid);
|
|
|
|
|
assert(0);
|
|
|
|
|
}
|
2001-04-26 02:01:33 +02:00
|
|
|
|
|
|
|
|
long val = vp->value.integer;
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
2001-05-09 01:32:26 +02:00
|
|
|
functor_set(ipoint_index(rfp->bits,idx), val&1,
|
2001-05-30 05:02:35 +02:00
|
|
|
(val&1)? St1 : St0, true);
|
2001-04-26 02:01:33 +02:00
|
|
|
val >>= 1;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
2001-04-25 06:45:52 +02:00
|
|
|
case vpiScalarVal:
|
|
|
|
|
switch (vp->value.scalar) {
|
|
|
|
|
case vpi0:
|
2001-05-30 05:02:35 +02:00
|
|
|
functor_set(rfp->bits, 0, St0, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
case vpi1:
|
2001-05-30 05:02:35 +02:00
|
|
|
functor_set(rfp->bits, 1, St1, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
case vpiX:
|
2001-05-30 05:02:35 +02:00
|
|
|
functor_set(rfp->bits, 2, StX, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
case vpiZ:
|
2001-05-30 05:02:35 +02:00
|
|
|
functor_set(rfp->bits, 3, HiZ, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
assert(0);
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case vpiVectorVal: {
|
|
|
|
|
assert(wid <= sizeof (unsigned long));
|
|
|
|
|
|
|
|
|
|
unsigned long aval = vp->value.vector->aval;
|
|
|
|
|
unsigned long bval = vp->value.vector->bval;
|
|
|
|
|
for (unsigned idx = 0 ; idx < wid ; idx += 1) {
|
|
|
|
|
int bit = (aval&1) | ((bval<<1)&2);
|
|
|
|
|
switch (bit) {
|
|
|
|
|
case 0: /* zero */
|
2001-05-09 01:32:26 +02:00
|
|
|
functor_set(ipoint_index(rfp->bits,idx),
|
2001-05-30 05:02:35 +02:00
|
|
|
0, St0, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
case 1: /* one */
|
2001-05-09 01:32:26 +02:00
|
|
|
functor_set(ipoint_index(rfp->bits,idx),
|
2001-05-30 05:02:35 +02:00
|
|
|
1, St1, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
case 2: /* z */
|
2001-05-09 01:32:26 +02:00
|
|
|
functor_set(ipoint_index(rfp->bits,idx),
|
2001-05-30 05:02:35 +02:00
|
|
|
3, HiZ, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
case 3: /* x */
|
2001-05-09 01:32:26 +02:00
|
|
|
functor_set(ipoint_index(rfp->bits,idx),
|
2001-05-30 05:02:35 +02:00
|
|
|
2, StX, true);
|
2001-04-25 06:45:52 +02:00
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
aval >>= 1;
|
|
|
|
|
bval >>= 1;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
assert(0);
|
|
|
|
|
|
|
|
|
|
}
|
2001-03-20 07:16:23 +01:00
|
|
|
|
|
|
|
|
return ref;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2001-06-22 01:05:08 +02:00
|
|
|
/*
|
|
|
|
|
* Signals that are created for the design are kept in a table sorted
|
|
|
|
|
* by the functor address so that I cal look up that functor given the
|
|
|
|
|
* functor address. This is used by callbacks, for example.
|
|
|
|
|
*
|
|
|
|
|
* XXXX NOTE: I need to balance this tree someday.
|
|
|
|
|
*/
|
2001-06-22 00:54:12 +02:00
|
|
|
static struct __vpiSignal*by_bits_root = 0;
|
|
|
|
|
static void by_bits_insert(struct __vpiSignal*sig)
|
|
|
|
|
{
|
|
|
|
|
if (by_bits_root == 0) {
|
|
|
|
|
by_bits_root = sig;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct __vpiSignal*cur = by_bits_root;
|
|
|
|
|
for (;;) {
|
|
|
|
|
if (cur->bits > sig->bits) {
|
|
|
|
|
if (cur->by_bits[0] == 0) {
|
|
|
|
|
cur->by_bits[0] = sig;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
cur = cur->by_bits[0];
|
|
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
if (cur->by_bits[1] == 0) {
|
|
|
|
|
cur->by_bits[1] = sig;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
cur = cur->by_bits[1];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct __vpiSignal* vpip_sig_from_ptr(vvp_ipoint_t ptr)
|
|
|
|
|
{
|
|
|
|
|
struct __vpiSignal*cur = by_bits_root;
|
|
|
|
|
|
|
|
|
|
while (cur) {
|
|
|
|
|
if (ptr < cur->bits) {
|
|
|
|
|
cur = cur->by_bits[0];
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned wid = (cur->msb > cur->lsb)
|
|
|
|
|
? cur->msb - cur->lsb
|
|
|
|
|
: cur->lsb - cur->msb;
|
|
|
|
|
|
|
|
|
|
if (ptr > ipoint_index(cur->bits, wid)) {
|
|
|
|
|
cur = cur->by_bits[1];
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return cur;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return cur;
|
|
|
|
|
}
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
static const struct __vpirt vpip_reg_rt = {
|
|
|
|
|
vpiReg,
|
|
|
|
|
signal_get,
|
|
|
|
|
signal_get_str,
|
|
|
|
|
signal_get_value,
|
|
|
|
|
signal_put_value,
|
|
|
|
|
0,
|
|
|
|
|
0
|
|
|
|
|
};
|
|
|
|
|
|
2001-03-25 01:35:35 +01:00
|
|
|
static const struct __vpirt vpip_net_rt = {
|
|
|
|
|
vpiNet,
|
|
|
|
|
signal_get,
|
|
|
|
|
signal_get_str,
|
|
|
|
|
signal_get_value,
|
|
|
|
|
signal_put_value,
|
|
|
|
|
0,
|
|
|
|
|
0
|
|
|
|
|
};
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
/*
|
|
|
|
|
* Construct a vpiReg object. Give the object specified dimensions,
|
|
|
|
|
* and point to the specified functor for the lsb.
|
|
|
|
|
*/
|
2001-04-05 03:34:26 +02:00
|
|
|
vpiHandle vpip_make_reg(char*name, int msb, int lsb, bool signed_flag,
|
|
|
|
|
vvp_ipoint_t base)
|
2001-03-20 07:16:23 +01:00
|
|
|
{
|
|
|
|
|
struct __vpiSignal*obj = (struct __vpiSignal*)
|
|
|
|
|
malloc(sizeof(struct __vpiSignal));
|
|
|
|
|
obj->base.vpi_type = &vpip_reg_rt;
|
|
|
|
|
obj->name = name;
|
|
|
|
|
obj->msb = msb;
|
|
|
|
|
obj->lsb = lsb;
|
2001-04-05 03:34:26 +02:00
|
|
|
obj->signed_flag = signed_flag? 1 : 0;
|
2001-03-20 07:16:23 +01:00
|
|
|
obj->bits = base;
|
2001-06-22 00:54:12 +02:00
|
|
|
obj->callbacks = 0;
|
|
|
|
|
obj->by_bits[0] = 0;
|
|
|
|
|
obj->by_bits[1] = 0;
|
2001-03-20 07:16:23 +01:00
|
|
|
|
|
|
|
|
obj->scope = vpip_peek_current_scope();
|
|
|
|
|
|
2001-06-22 00:54:12 +02:00
|
|
|
by_bits_insert(obj);
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
return &obj->base;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2001-03-25 01:35:35 +01:00
|
|
|
/*
|
|
|
|
|
* Construct a vpiReg object. Give the object specified dimensions,
|
|
|
|
|
* and point to the specified functor for the lsb.
|
|
|
|
|
*/
|
2001-04-05 03:34:26 +02:00
|
|
|
vpiHandle vpip_make_net(char*name, int msb, int lsb, bool signed_flag,
|
|
|
|
|
vvp_ipoint_t base)
|
2001-03-25 01:35:35 +01:00
|
|
|
{
|
|
|
|
|
struct __vpiSignal*obj = (struct __vpiSignal*)
|
|
|
|
|
malloc(sizeof(struct __vpiSignal));
|
|
|
|
|
obj->base.vpi_type = &vpip_net_rt;
|
|
|
|
|
obj->name = name;
|
|
|
|
|
obj->msb = msb;
|
|
|
|
|
obj->lsb = lsb;
|
2001-04-05 03:34:26 +02:00
|
|
|
obj->signed_flag = signed_flag? 1 : 0;
|
2001-03-25 01:35:35 +01:00
|
|
|
obj->bits = base;
|
2001-06-22 00:54:12 +02:00
|
|
|
obj->callbacks = 0;
|
|
|
|
|
obj->by_bits[0] = 0;
|
|
|
|
|
obj->by_bits[1] = 0;
|
2001-03-25 01:35:35 +01:00
|
|
|
|
|
|
|
|
obj->scope = vpip_peek_current_scope();
|
|
|
|
|
|
2001-06-22 00:54:12 +02:00
|
|
|
by_bits_insert(obj);
|
|
|
|
|
|
2001-03-25 01:35:35 +01:00
|
|
|
return &obj->base;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2001-03-20 07:16:23 +01:00
|
|
|
/*
|
|
|
|
|
* $Log: vpi_signal.cc,v $
|
2001-06-22 01:05:08 +02:00
|
|
|
* Revision 1.17 2001/06/21 23:05:08 steve
|
|
|
|
|
* Some documentation of callback behavior.
|
|
|
|
|
*
|
2001-06-22 00:54:12 +02:00
|
|
|
* Revision 1.16 2001/06/21 22:54:12 steve
|
|
|
|
|
* Support cbValueChange callbacks.
|
|
|
|
|
*
|
2001-05-30 05:02:35 +02:00
|
|
|
* Revision 1.15 2001/05/30 03:02:35 steve
|
|
|
|
|
* Propagate strength-values instead of drive strengths.
|
|
|
|
|
*
|
2001-05-22 06:08:49 +02:00
|
|
|
* Revision 1.14 2001/05/22 04:08:49 steve
|
|
|
|
|
* correctly interpret signed decimal values.
|
|
|
|
|
*
|
2001-05-15 17:09:08 +02:00
|
|
|
* Revision 1.13 2001/05/15 15:09:08 steve
|
|
|
|
|
* Add the glossary file.
|
|
|
|
|
*
|
2001-05-14 02:42:32 +02:00
|
|
|
* Revision 1.12 2001/05/14 00:42:32 steve
|
|
|
|
|
* test width of target with bit size of long.
|
|
|
|
|
*
|
2001-05-09 06:23:18 +02:00
|
|
|
* Revision 1.11 2001/05/09 04:23:19 steve
|
|
|
|
|
* Now that the interactive debugger exists,
|
|
|
|
|
* there is no use for the output dump.
|
|
|
|
|
*
|
2001-05-09 01:32:26 +02:00
|
|
|
* Revision 1.10 2001/05/08 23:32:26 steve
|
|
|
|
|
* Add to the debugger the ability to view and
|
|
|
|
|
* break on functors.
|
|
|
|
|
*
|
|
|
|
|
* Add strengths to functors at compile time,
|
|
|
|
|
* and Make functors pass their strengths as they
|
|
|
|
|
* propagate their output.
|
2001-03-20 07:16:23 +01:00
|
|
|
*/
|
|
|
|
|
|