luke
/
iverilog
mirror of https://github.com/steveicarus/iverilog.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Infinitely wide behavioral add.

This commit is contained in:
steve 2001-06-22 00:03:05 +00:00
parent 8cdf51f913
commit 1f1bfd0eab
1 changed files with 32 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
vvp/vthread.cc
View File

@ -17,7 +17,7 @@
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*/ */
#if !defined(WINNT) #if !defined(WINNT)
#ident "$Id: vthread.cc,v 1.44 2001/06/18 01:09:32 steve Exp $" #ident "$Id: vthread.cc,v 1.45 2001/06/22 00:03:05 steve Exp $"
#endif #endif
# include "vthread.h" # include "vthread.h"
@ -297,14 +297,23 @@ bool of_AND(vthread_t thr, vvp_code_t cp)
return true; return true;
} }
# define CPU_BITS (8*sizeof(unsigned long))
# define TOP_BIT (1UL << (CPU_BITS-1))
bool of_ADD(vthread_t thr, vvp_code_t cp) bool of_ADD(vthread_t thr, vvp_code_t cp)
{ {
assert(cp->bit_idx1 >= 4); assert(cp->bit_idx1 >= 4);
assert(cp->number <= 8*sizeof(unsigned long));
unsigned idx1 = cp->bit_idx1; unsigned idx1 = cp->bit_idx1;
unsigned idx2 = cp->bit_idx2; unsigned idx2 = cp->bit_idx2;
unsigned long lv = 0, rv = 0;
unsigned awid = cp->number / (8*sizeof(unsigned long)) + 1;
unsigned long*lva = new unsigned long [awid+1];
unsigned long*rva = new unsigned long [awid+1];
for (unsigned idx = 0 ; idx < awid ; idx += 1) {
lva[idx] = 0;
rva[idx] = 0;
}
for (unsigned idx = 0 ; idx < cp->number ; idx += 1) { for (unsigned idx = 0 ; idx < cp->number ; idx += 1) {
unsigned lb = thr_get_bit(thr, idx1); unsigned lb = thr_get_bit(thr, idx1);
@ -313,24 +322,36 @@ bool of_ADD(vthread_t thr, vvp_code_t cp)
if ((lb | rb) & 2) if ((lb | rb) & 2)
goto x_out; goto x_out;
lv |= lb << idx; lva[idx/CPU_BITS] |= lb << (idx % CPU_BITS);
rv |= rb << idx; rva[idx/CPU_BITS] |= rb << (idx % CPU_BITS);
idx1 += 1; idx1 += 1;
if (idx2 >= 4) if (idx2 >= 4)
idx2 += 1; idx2 += 1;
} }
lv += rv; unsigned long carry;
carry = 0;
for (unsigned idx = 0 ; idx < awid ; idx += 1) {
unsigned long tmp = (lva[idx] | rva[idx]) & TOP_BIT;
lva[idx] += rva[idx] + carry;
carry = (tmp > lva[idx]) ? 1 : 0;
}
for (unsigned idx = 0 ; idx < cp->number ; idx += 1) { for (unsigned idx = 0 ; idx < cp->number ; idx += 1) {
thr_put_bit(thr, cp->bit_idx1+idx, (lv&1) ? 1 : 0); unsigned bit = lva[idx/CPU_BITS] >> (idx % CPU_BITS);
lv >>= 1; thr_put_bit(thr, cp->bit_idx1+idx, (bit&1) ? 1 : 0);
} }
delete[]lva;
delete[]rva;
return true; return true;
x_out: x_out:
delete[]lva;
delete[]rva;
for (unsigned idx = 0 ; idx < cp->number ; idx += 1) for (unsigned idx = 0 ; idx < cp->number ; idx += 1)
thr_put_bit(thr, cp->bit_idx1+idx, 2); thr_put_bit(thr, cp->bit_idx1+idx, 2);
@ -1205,6 +1226,9 @@ bool of_ZOMBIE(vthread_t thr, vvp_code_t)
/* /*
* $Log: vthread.cc,v $ * $Log: vthread.cc,v $
* Revision 1.45 2001/06/22 00:03:05 steve
* Infinitely wide behavioral add.
*
* Revision 1.44 2001/06/18 01:09:32 steve * Revision 1.44 2001/06/18 01:09:32 steve
* More behavioral unary reduction operators. * More behavioral unary reduction operators.
* (Stephan Boettcher) * (Stephan Boettcher)