115 lines
3.1 KiB
C++
115 lines
3.1 KiB
C++
|
/*
|
||
|
|
* Copyright (c) 2000 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)
|
||
|
|
#ident "$Id: vvm_mult.cc,v 1.1 2000/01/13 03:35:36 steve Exp $"
|
||
|
|
#endif
|
||
|
|
|
||
|
|
# include "vvm_gates.h"
|
||
|
|
# include <assert.h>
|
||
|
|
|
||
|
|
void vvm_binop_mult(vpip_bit_t*r, unsigned nr,
|
||
|
|
const vpip_bit_t*a, unsigned na,
|
||
|
|
const vpip_bit_t*b, unsigned nb)
|
||
|
|
{
|
||
|
|
assert(nr >= (na+nb));
|
||
|
|
|
||
|
|
for (unsigned idx = 0 ; idx < nr ; idx += 1)
|
||
|
|
r[idx] = V0;
|
||
|
|
|
||
|
|
for (unsigned bdx = 0 ; bdx < nb ; bdx += 1) {
|
||
|
|
unsigned rdx = bdx;
|
||
|
|
vpip_bit_t c = V0;
|
||
|
|
for (unsigned idx = 0 ; idx < na ; idx += 1) {
|
||
|
|
r[rdx] = add_with_carry(r[rdx],a[idx]&b[bdx],c);
|
||
|
|
rdx += 1;
|
||
|
|
}
|
||
|
|
if (rdx < nr) r[rdx] = add_with_carry(r[rdx],c,c);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
vvm_mult::vvm_mult(unsigned rwid, unsigned awid,
|
||
|
|
unsigned bwid, unsigned swid)
|
||
|
|
: rwid_(rwid), awid_(awid), bwid_(bwid), swid_(swid)
|
||
|
|
{
|
||
|
|
bits_ = new vpip_bit_t[rwid_+awid_+bwid_+swid_];
|
||
|
|
out_ = new vvm_out_event::action_t[rwid_];
|
||
|
|
|
||
|
|
for (unsigned idx = 0 ; idx < rwid_+awid_+bwid_+swid_ ; idx += 1)
|
||
|
|
bits_[idx] = Vx;
|
||
|
|
|
||
|
|
for (unsigned idx = 0 ; idx < rwid_ ; idx += 1)
|
||
|
|
out_[idx] = 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
vvm_mult::~vvm_mult()
|
||
|
|
{
|
||
|
|
delete[]bits_;
|
||
|
|
delete[]out_;
|
||
|
|
}
|
||
|
|
|
||
|
|
void vvm_mult::config_rout(unsigned idx, vvm_out_event::action_t o)
|
||
|
|
{
|
||
|
|
assert(o);
|
||
|
|
assert(idx < rwid_);
|
||
|
|
out_[idx] = o;
|
||
|
|
}
|
||
|
|
|
||
|
|
void vvm_mult::init_DataA(unsigned idx, vpip_bit_t val)
|
||
|
|
{
|
||
|
|
assert(idx < awid_);
|
||
|
|
bits_[rwid_+idx] = val;
|
||
|
|
}
|
||
|
|
|
||
|
|
void vvm_mult::set_DataA(unsigned idx, vpip_bit_t val)
|
||
|
|
{
|
||
|
|
assert(idx < awid_);
|
||
|
|
bits_[rwid_+idx] = val;
|
||
|
|
vvm_binop_mult(bits_, rwid_,
|
||
|
|
bits_+rwid_, awid_,
|
||
|
|
bits_+rwid_+awid_, bwid_);
|
||
|
|
for (unsigned idx = 0 ; idx < rwid_ ; idx += 1)
|
||
|
|
if (out_[idx]) (out_[idx])(bits_[idx]);
|
||
|
|
}
|
||
|
|
|
||
|
|
void vvm_mult::init_DataB(unsigned idx, vpip_bit_t val)
|
||
|
|
{
|
||
|
|
assert(idx < bwid_);
|
||
|
|
bits_[rwid_+awid_+idx] = val;
|
||
|
|
}
|
||
|
|
|
||
|
|
void vvm_mult::set_DataB(unsigned idx, vpip_bit_t val)
|
||
|
|
{
|
||
|
|
assert(idx < bwid_);
|
||
|
|
bits_[rwid_+awid_+idx] = val;
|
||
|
|
vvm_binop_mult(bits_, rwid_,
|
||
|
|
bits_+rwid_, awid_,
|
||
|
|
bits_+rwid_+awid_, bwid_);
|
||
|
|
for (unsigned idx = 0 ; idx < rwid_ ; idx += 1)
|
||
|
|
if (out_[idx]) (out_[idx])(bits_[idx]);
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
* $Log: vvm_mult.cc,v $
|
||
|
|
* Revision 1.1 2000/01/13 03:35:36 steve
|
||
|
|
* Multiplication all the way to simulation.
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|