iverilog/vvm/vvm_gates.h

871 lines
23 KiB
C
Raw Normal View History

1998-11-10 00:44:10 +01:00
#ifndef __vvm_gates_H
#define __vvm_gates_H
/*
* Copyright (c) 1998-2000 Stephen Williams (steve@icarus.com)
1998-11-10 00:44:10 +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
*/
#if !defined(WINNT) && !defined(macintosh)
2000-03-24 04:47:01 +01:00
#ident "$Id: vvm_gates.h,v 1.50 2000/03/24 03:47:01 steve Exp $"
1998-11-10 00:44:10 +01:00
#endif
# include "vvm.h"
# include "vvm_signal.h"
1998-11-10 00:44:10 +01:00
# include <assert.h>
1999-11-24 05:38:49 +01:00
extern vpip_bit_t compute_nand(const vpip_bit_t*inp, unsigned count);
extern vpip_bit_t compute_and(const vpip_bit_t*inp, unsigned count);
extern vpip_bit_t compute_nor(const vpip_bit_t*inp, unsigned count);
extern vpip_bit_t compute_or(const vpip_bit_t*inp, unsigned count);
1999-11-24 05:38:49 +01:00
extern vpip_bit_t compute_xor(const vpip_bit_t*inp, unsigned count);
extern vpip_bit_t compute_xnor(const vpip_bit_t*inp, unsigned count);
extern void compute_mux(vpip_bit_t*out, unsigned wid,
const vpip_bit_t*sel, unsigned swid,
const vpip_bit_t*dat, unsigned size);
1998-11-10 00:44:10 +01:00
/*
* A vvm gate is constructed with an input width and an output
* function. The input width represents all the input signals that go
* into generating a single output value. The output value is passed
* to the output function, which may fan the result however makes
* sense. The output is scheduled as an event.
*/
class vvm_out_event : public vvm_event {
public:
typedef void (*action_t)(vpip_bit_t); // XXXX Remove me!
1998-11-10 00:44:10 +01:00
vvm_out_event(vpip_bit_t v, vvm_nexus::drive_t*o);
~vvm_out_event();
void event_function();
1998-11-10 00:44:10 +01:00
private:
vvm_nexus::drive_t*output_;
const vpip_bit_t val_;
1998-11-10 00:44:10 +01:00
};
class vvm_1bit_out : public vvm_nexus::drive_t {
public:
vvm_1bit_out(unsigned delay);
~vvm_1bit_out();
void output(vpip_bit_t);
private:
unsigned delay_;
};
/*
2000-03-17 18:25:53 +01:00
* This class implements the LPM_ADD_SUB device type. The width of
* the device is a constructor parameter. The device handles addition and
* subtraction, selectable by the Add_Sub input. When configured as a
* subtractor, the device works by adding the 2s complement of
* DataB.
*/
2000-03-17 18:25:53 +01:00
class vvm_add_sub : public vvm_nexus::recvr_t {
public:
2000-03-17 18:25:53 +01:00
explicit vvm_add_sub(unsigned width);
~vvm_add_sub();
2000-03-17 18:25:53 +01:00
vvm_nexus::drive_t* config_rout(unsigned idx);
vvm_nexus::drive_t* config_cout();
2000-03-17 18:25:53 +01:00
unsigned key_DataA(unsigned idx) const;
unsigned key_DataB(unsigned idx) const;
2000-03-17 18:25:53 +01:00
void init_DataA(unsigned idx, vpip_bit_t val);
void init_DataB(unsigned idx, vpip_bit_t val);
void init_Add_Sub(unsigned, vpip_bit_t val);
1999-12-16 03:42:14 +01:00
2000-03-17 18:25:53 +01:00
void start();
private:
2000-03-17 18:25:53 +01:00
void take_value(unsigned key, vpip_bit_t val);
2000-03-17 18:25:53 +01:00
unsigned width_;
vpip_bit_t*ibits_;
1999-12-16 03:42:14 +01:00
vpip_bit_t c_;
// this is the inverse of the Add_Sub port. It is 0 for add,
// and 1 for subtract.
vpip_bit_t ndir_;
2000-03-17 18:25:53 +01:00
vvm_nexus::drive_t*ro_;
vvm_nexus::drive_t co_;
2000-03-17 18:25:53 +01:00
void compute_();
private: // not implemented
vvm_add_sub(const vvm_add_sub&);
vvm_add_sub& operator= (const vvm_add_sub&);
};
2000-03-17 20:23:59 +01:00
/*
* These are implementations of reduction AND. the vvm_and class is
* the parameterized form, that takes the width of the gate input as a
* parameter. The vvm_andN classes are versions that have specific
* widths. The latter should be preferred over the generic form.
*/
template <unsigned WIDTH>
class vvm_and : public vvm_1bit_out, public vvm_nexus::recvr_t {
1998-11-10 00:44:10 +01:00
public:
explicit vvm_and(unsigned d)
: vvm_1bit_out(d) { }
1998-11-10 00:44:10 +01:00
void init_I(unsigned idx, vpip_bit_t val)
{ input_[idx] = val; }
1999-01-01 02:44:56 +01:00
void start()
{ output(compute_and(input_,WIDTH)); }
private:
void take_value(unsigned key, vpip_bit_t val) { set_I(key, val); }
void set_I(unsigned idx, vpip_bit_t val)
{ if (input_[idx] == val) return;
input_[idx] = val;
output(compute_and(input_,WIDTH));
1998-11-10 00:44:10 +01:00
}
private:
vpip_bit_t input_[WIDTH];
1998-11-10 00:44:10 +01:00
};
2000-03-17 20:23:59 +01:00
class vvm_and2 : public vvm_1bit_out, public vvm_nexus::recvr_t {
public:
explicit vvm_and2(unsigned long d);
~vvm_and2();
void init_I(unsigned idx, vpip_bit_t val);
void start();
private:
void take_value(unsigned key, vpip_bit_t val);
vpip_bit_t input_[2];
};
/*
* This class implements LPM_CLSHIFT devices with specified data width
* and selector input width. The direction bit is a single bit input.
*/
class vvm_clshift : public vvm_nexus::recvr_t {
public:
vvm_clshift(unsigned wid, unsigned dwid);
~vvm_clshift();
void init_Data(unsigned idx, vpip_bit_t val);
void init_Distance(unsigned idx, vpip_bit_t val);
void init_Direction(unsigned, vpip_bit_t val);
vvm_nexus::drive_t* config_rout(unsigned idx);
unsigned key_Data(unsigned idx) const;
unsigned key_Distance(unsigned idx) const;
unsigned key_Direction(unsigned) const;
private:
void take_value(unsigned key, vpip_bit_t val);
1999-11-15 01:42:31 +01:00
private:
unsigned width_, wdist_;
vpip_bit_t dir_;
1999-11-15 01:42:31 +01:00
int dist_val_;
vpip_bit_t*ibits_;
vvm_nexus::drive_t*out_;
void calculate_dist_();
void compute_();
};
2000-03-17 18:25:53 +01:00
/*
* This class implements structural comparators, specifically the
* LPM_COMPARE device type.
*/
class vvm_compare : public vvm_nexus::recvr_t {
1999-11-15 00:43:45 +01:00
public:
2000-03-17 18:25:53 +01:00
explicit vvm_compare(unsigned w);
~vvm_compare();
1999-11-15 00:43:45 +01:00
2000-03-17 18:25:53 +01:00
void init_DataA(unsigned idx, vpip_bit_t val);
void init_DataB(unsigned idx, vpip_bit_t val);
1999-11-15 00:43:45 +01:00
2000-03-17 18:25:53 +01:00
unsigned key_DataA(unsigned idx) const;
unsigned key_DataB(unsigned idx) const;
1999-11-15 00:43:45 +01:00
2000-03-17 18:25:53 +01:00
vvm_nexus::drive_t* config_ALB_out();
vvm_nexus::drive_t* config_ALEB_out();
vvm_nexus::drive_t* config_AGB_out();
vvm_nexus::drive_t* config_AGEB_out();
1999-11-15 00:43:45 +01:00
private:
2000-03-17 18:25:53 +01:00
void take_value(unsigned key, vpip_bit_t val);
unsigned width_;
vpip_bit_t*ibits_;
1999-11-15 00:43:45 +01:00
vpip_bit_t gt_;
vpip_bit_t lt_;
2000-03-17 18:25:53 +01:00
vvm_nexus::drive_t out_lt_;
vvm_nexus::drive_t out_le_;
vvm_nexus::drive_t out_gt_;
vvm_nexus::drive_t out_ge_;
1999-11-15 00:43:45 +01:00
2000-03-17 18:25:53 +01:00
void compute_();
1999-11-15 00:43:45 +01:00
2000-03-17 18:25:53 +01:00
private: // not implemented
vvm_compare(const vvm_compare&);
vvm_compare& operator= (const vvm_compare&);
1999-11-15 00:43:45 +01:00
};
/*
2000-03-19 00:22:37 +01:00
* This class simulates the LPM flip-flop device. The vvm_ff class
* supports arbitrary width devices. For each output Q, there is a
* unique input D. The CLK input is common for all the bit lanes.
*/
2000-03-19 00:22:37 +01:00
class vvm_ff : public vvm_nexus::recvr_t {
public:
2000-03-19 00:22:37 +01:00
explicit vvm_ff(unsigned wid);
~vvm_ff();
2000-03-19 00:22:37 +01:00
vvm_nexus::drive_t* config_rout(unsigned idx);
2000-03-19 00:22:37 +01:00
unsigned key_Data(unsigned idx) const;
unsigned key_Clock() const;
2000-03-19 00:22:37 +01:00
void init_Data(unsigned idx, vpip_bit_t val);
void init_Clock(unsigned, vpip_bit_t val);
private:
2000-03-19 00:22:37 +01:00
void take_value(unsigned key, vpip_bit_t val);
unsigned width_;
vpip_bit_t*bits_;
vpip_bit_t clk_;
2000-03-19 00:22:37 +01:00
vvm_nexus::drive_t* out_;
2000-03-19 00:22:37 +01:00
void latch_();
private: // not implemeneted
vvm_ff(const vvm_ff&);
vvm_ff& operator= (const vvm_ff&);
};
/*
* This class behaves like a combinational multiplier. The device
* behaves like the LPM_MULT device.
*/
2000-03-17 04:05:13 +01:00
class vvm_mult : public vvm_nexus::recvr_t {
public:
explicit vvm_mult(unsigned rwid, unsigned awid,
unsigned bwid, unsigned swid);
~vvm_mult();
void init_DataA(unsigned idx, vpip_bit_t val);
void init_DataB(unsigned idx, vpip_bit_t val);
void init_Sum(unsigned idx, vpip_bit_t val);
2000-03-17 04:05:13 +01:00
vvm_nexus::drive_t* config_rout(unsigned idx);
unsigned key_DataA(unsigned idx) const;
unsigned key_DataB(unsigned idx) const;
unsigned key_Sum(unsigned idx) const;
private:
2000-03-17 04:05:13 +01:00
void take_value(unsigned key, vpip_bit_t val);
unsigned rwid_;
unsigned awid_;
unsigned bwid_;
unsigned swid_;
vpip_bit_t*bits_;
2000-03-17 04:05:13 +01:00
vvm_nexus::drive_t*out_;
};
1999-11-13 04:46:52 +01:00
/*
* This class supports mux devices. The width is the width of the data
* (or bus) path, SIZE is the number of alternative inputs and SELWID
* is the size (in bits) of the selector input. The device passes to
* the output the bits of the input selected by the selector.
1999-11-13 04:46:52 +01:00
*/
2000-03-17 00:13:49 +01:00
class vvm_mux : public vvm_nexus::recvr_t {
1999-11-13 04:46:52 +01:00
public:
explicit vvm_mux(unsigned width, unsigned size, unsigned selwid);
~vvm_mux();
1999-11-13 04:46:52 +01:00
void init_Sel(unsigned idx, vpip_bit_t val);
void init_Data(unsigned idx, vpip_bit_t val);
1999-11-13 04:46:52 +01:00
vvm_nexus::drive_t* config_rout(unsigned idx);
2000-03-17 00:13:49 +01:00
unsigned key_Sel(unsigned idx) const;
unsigned key_Data(unsigned wi, unsigned si) const;
2000-03-17 00:13:49 +01:00
private:
void take_value(unsigned key, vpip_bit_t val);
1999-11-13 04:46:52 +01:00
unsigned width_, size_, selwid_;
vpip_bit_t*bits_;
1999-11-13 04:46:52 +01:00
vvm_nexus::drive_t*out_;
void evaluate_();
1999-11-13 04:46:52 +01:00
private: // not implemented
vvm_mux(const vvm_mux&);
vvm_mux& operator= (vvm_mux&);
1999-11-13 04:46:52 +01:00
};
template <unsigned WIDTH>
class vvm_or : public vvm_1bit_out, public vvm_nexus::recvr_t {
1999-06-09 02:58:06 +02:00
public:
explicit vvm_or(unsigned long d)
: vvm_1bit_out(d) { }
1999-06-09 02:58:06 +02:00
void init_I(unsigned idx, vpip_bit_t val)
{ input_[idx] = val; }
1999-06-09 02:58:06 +02:00
void start()
{ output(compute_or(input_,WIDTH)); }
1999-06-09 02:58:06 +02:00
private:
void take_value(unsigned key, vpip_bit_t val) { set_I(key, val); }
void set_I(unsigned idx, vpip_bit_t val)
{ if (input_[idx] == val)
1999-06-09 02:58:06 +02:00
return;
input_[idx] = val;
output(compute_or(input_,WIDTH));
1999-06-09 02:58:06 +02:00
}
private:
vpip_bit_t input_[WIDTH];
1999-06-09 02:58:06 +02:00
};
template <unsigned WIDTH>
class vvm_nor : public vvm_1bit_out, public vvm_nexus::recvr_t {
1999-10-09 21:24:36 +02:00
public:
explicit vvm_nor(unsigned long d)
: vvm_1bit_out(d) { }
1999-10-09 21:24:36 +02:00
void init_I(unsigned idx, vpip_bit_t val)
{ input_[idx] = val; }
1999-10-09 21:24:36 +02:00
void start()
{ output(compute_nor(input_,WIDTH)); }
1999-10-09 21:24:36 +02:00
private:
void take_value(unsigned key, vpip_bit_t val) { set_I(key, val); }
void set_I(unsigned idx, vpip_bit_t val)
{ if (input_[idx] == val)
1999-10-09 21:24:36 +02:00
return;
input_[idx] = val;
output(compute_nor(input_,WIDTH));
1999-10-09 21:24:36 +02:00
}
vpip_bit_t input_[WIDTH];
1999-10-09 21:24:36 +02:00
};
2000-03-17 20:23:59 +01:00
class vvm_nor2 : public vvm_1bit_out, public vvm_nexus::recvr_t {
public:
explicit vvm_nor2(unsigned long d);
~vvm_nor2();
void init_I(unsigned idx, vpip_bit_t val);
void start();
private:
void take_value(unsigned key, vpip_bit_t val);
vpip_bit_t input_[2];
};
/*
* This object implements a LPM_RAM_DQ device, except for the actual
* contents of the memory, which are stored in a vvm_memory_t
* object. Note that there may be many vvm_ram_dq items referencing
* the same memory.
*
* XXXX Only asynchronous reads are supported.
* XXXX Only *synchronous* writes with WE are supported.
*/
template <unsigned WIDTH, unsigned AWIDTH, unsigned SIZE>
2000-03-24 04:47:01 +01:00
class vvm_ram_dq : protected vvm_ram_callback, public vvm_nexus::recvr_t {
public:
vvm_ram_dq(vvm_memory_t<WIDTH,SIZE>*mem)
: mem_(mem)
{ mem->set_callback(this);
2000-03-24 04:47:01 +01:00
for (unsigned idx = 0 ; idx < AWIDTH+WIDTH+2 ; idx += 1)
ibits_[idx] = StX;
}
void init_Address(unsigned idx, vpip_bit_t val)
2000-03-24 04:47:01 +01:00
{ ibits_[idx] = val; }
void init_Data(unsigned idx, vpip_bit_t val)
2000-03-24 04:47:01 +01:00
{ ibits_[AWIDTH+idx] = val; }
void init_WE(unsigned, vpip_bit_t val)
2000-03-24 04:47:01 +01:00
{ ibits_[AWIDTH+WIDTH] = val; }
void init_InClock(unsigned, vpip_bit_t val)
2000-03-24 04:47:01 +01:00
{ ibits_[AWIDTH+WIDTH+1] = val; }
unsigned key_Address(unsigned idx) const { return idx; }
unsigned key_Data(unsigned idx) const { return AWIDTH+idx; }
unsigned key_WE() const { return AWIDTH+WIDTH + 0; }
unsigned key_InClock() const { return AWIDTH+WIDTH + 1; }
vvm_nexus::drive_t* config_rout(unsigned idx) { return out_+idx; }
void take_value(unsigned key, vpip_bit_t val)
{ if (ibits_[key] == val) return;
if (key == key_InClock()) {
vpip_bit_t tmp = ibits_[key];
ibits_[key] = val;
if (B_IS1(ibits_[key_WE()])) return;
if (posedge(tmp, val)) mem_->set_word(addr_val_, ibits_+AWIDTH);
return;
} else {
ibits_[key] = val;
if (key < AWIDTH) {
compute_();
send_out_();
}
}
}
2000-03-24 04:47:01 +01:00
void handle_write(unsigned idx) { if (idx == addr_val_) send_out_(); }
private:
vvm_memory_t<WIDTH,SIZE>*mem_;
2000-03-24 04:47:01 +01:00
vpip_bit_t ibits_[AWIDTH+WIDTH+2];
vvm_nexus::drive_t out_[WIDTH];
unsigned long addr_val_;
void compute_()
{ unsigned bit;
unsigned mask;
addr_val_ = 0;
for (bit = 0, mask = 1 ; bit < AWIDTH ; bit += 1, mask <<= 1)
2000-03-24 04:47:01 +01:00
if (B_IS1(ibits_[bit])) addr_val_ |= mask;
}
void send_out_()
{ vvm_bitset_t<WIDTH>ov = mem_->get_word(addr_val_);
2000-03-24 04:47:01 +01:00
for (unsigned bit = 0 ; bit < WIDTH ; bit += 1) {
vvm_out_event*ev = new vvm_out_event(ov[bit], out_+bit);
ev->schedule();
}
}
};
class vvm_buf : public vvm_1bit_out, public vvm_nexus::recvr_t {
public:
explicit vvm_buf(unsigned long d);
~vvm_buf();
void init_I(unsigned, vpip_bit_t);
void start() { }
private:
void take_value(unsigned, vpip_bit_t val);
};
class vvm_bufif1 : public vvm_1bit_out, public vvm_nexus::recvr_t {
public:
explicit vvm_bufif1(unsigned long d);
~vvm_bufif1();
void init_I(unsigned, vpip_bit_t);
void start() { }
private:
vpip_bit_t input_[2];
void take_value(unsigned key, vpip_bit_t val);
};
template <unsigned WIDTH>
class vvm_nand : public vvm_1bit_out, public vvm_nexus::recvr_t {
1998-11-10 00:44:10 +01:00
public:
explicit vvm_nand(unsigned long d)
: vvm_1bit_out(d) { }
1998-11-10 00:44:10 +01:00
void init_I(unsigned idx, vpip_bit_t val)
{ input_[idx] = val; }
void start()
{ output(compute_nand(input_,WIDTH)); }
private:
void take_value(unsigned key, vpip_bit_t val) { set_I(key, val); }
void set_I(unsigned idx, vpip_bit_t val)
{ if (input_[idx] == val) return;
input_[idx] = val;
output(compute_nand(input_,WIDTH));
1998-11-10 00:44:10 +01:00
}
private:
vpip_bit_t input_[WIDTH];
1998-11-10 00:44:10 +01:00
};
/*
* Simple inverter buffer.
*/
class vvm_not : public vvm_1bit_out, public vvm_nexus::recvr_t {
1998-11-10 00:44:10 +01:00
public:
explicit vvm_not(unsigned long d);
~vvm_not();
1998-11-10 00:44:10 +01:00
void init_I(unsigned, vpip_bit_t);
void start();
1998-11-10 00:44:10 +01:00
private:
void take_value(unsigned key, vpip_bit_t val);
1998-11-10 00:44:10 +01:00
};
template <unsigned WIDTH>
class vvm_xnor : public vvm_1bit_out, public vvm_nexus::recvr_t {
1998-11-10 00:44:10 +01:00
public:
explicit vvm_xnor(unsigned long d)
: vvm_1bit_out(d) { }
1998-11-10 00:44:10 +01:00
void init_I(unsigned idx, vpip_bit_t val) { input_[idx] = val; }
1999-01-31 19:15:55 +01:00
void start()
{ output(compute_xnor(input_,WIDTH)); }
private:
void take_value(unsigned key, vpip_bit_t val) { set_I(key, val); }
void set_I(unsigned idx, vpip_bit_t val)
{ if (input_[idx] == val)
1998-11-10 00:44:10 +01:00
return;
input_[idx] = val;
output(compute_xnor(input_,WIDTH));
1998-11-10 00:44:10 +01:00
}
private:
vpip_bit_t input_[WIDTH];
1998-11-10 00:44:10 +01:00
};
template <unsigned WIDTH>
class vvm_xor : public vvm_1bit_out, public vvm_nexus::recvr_t {
1998-11-10 00:44:10 +01:00
public:
explicit vvm_xor(unsigned long d)
: vvm_1bit_out(d) { }
1998-11-10 00:44:10 +01:00
void init_I(unsigned idx, vpip_bit_t val)
{ input_[idx] = val; }
1999-01-01 02:44:56 +01:00
void start()
{ output(compute_xor(input_,WIDTH)); }
private:
void take_value(unsigned key, vpip_bit_t val) { set_I(key, val); }
void set_I(unsigned idx, vpip_bit_t val)
{ if (input_[idx] == val)
1998-11-10 00:44:10 +01:00
return;
input_[idx] = val;
output(compute_xor(input_,WIDTH)); }
1999-01-01 02:44:56 +01:00
private:
vpip_bit_t input_[WIDTH];
1998-11-10 00:44:10 +01:00
};
1999-10-10 03:59:54 +02:00
/*
* This gate has only 3 pins, the output at pin 0 and two inputs. The
* output is 1 or 0 if the two inputs are exactly equal or not.
*/
class vvm_eeq : public vvm_1bit_out, public vvm_nexus::recvr_t {
1999-10-10 03:59:54 +02:00
public:
explicit vvm_eeq(unsigned long d);
~vvm_eeq();
1999-10-10 03:59:54 +02:00
void init_I(unsigned idx, vpip_bit_t val);
1999-10-10 03:59:54 +02:00
void start();
1999-10-10 03:59:54 +02:00
private:
void take_value(unsigned key, vpip_bit_t val);
1999-10-10 03:59:54 +02:00
vpip_bit_t compute_() const;
1999-10-10 03:59:54 +02:00
vpip_bit_t input_[2];
1999-10-10 03:59:54 +02:00
};
/*
* A Sequential UDP has a more complex truth table, and handles
* edges. Pin 0 is an output, and all the remaining pins are
* input. The WIDTH is the number of input pins.
*
* See vvm.txt for a description of the gate transition table.
*/
template <unsigned WIDTH> class vvm_udp_ssequ {
public:
explicit vvm_udp_ssequ(vvm_out_event::action_t o, vpip_bit_t i,
const vvm_u32*tab)
: output_(o), table_(tab)
{ state_[0] = i;
for (unsigned idx = 1; idx < WIDTH+1 ; idx += 1)
state_[idx] = Vx;
}
void init(unsigned pin, vpip_bit_t val)
{ state_[pin] = val; }
void set(unsigned pin, vpip_bit_t val)
{ assert(pin > 0);
assert(pin < WIDTH+1);
if (val == Vz) val = Vx;
if (state_[pin] == val) return;
// Convert the current state into a table index.
unsigned entry = 0;
for (unsigned idx = 0 ; idx < WIDTH+1 ; idx += 1) {
entry *= 3;
entry += state_[idx];
}
// Get the table entry, and the 4bits that encode
// activity on this pin.
vvm_u32 code = table_[entry];
code >>= 4 * (WIDTH-pin);
switch (state_[pin]*4 + val) {
case (V0*4 + V1):
case (V1*4 + V0):
case (Vx*4 + V0):
code = (code>>2) & 3;
break;
case (V0*4 + Vx):
case (V1*4 + Vx):
case (Vx*4 + V1):
code &= 3;
break;
}
// Convert the code to a vpip_bit_t and run with it.
vpip_bit_t outval = (code == 0)? V0 : (code == 1)? V1 : Vx;
state_[0] = outval;
state_[pin] = val;
vvm_event*ev = new vvm_out_event(outval, output_);
ev->schedule(1); // XXXX Delay not supported.
}
private:
vvm_out_event::action_t output_;
const vvm_u32*const table_;
vpip_bit_t state_[WIDTH+1];
};
2000-03-18 03:26:02 +01:00
/*
* The bufz is a trivial device that simply passes its input to its
* output. Unlike a buf devince, this does not change Vz values to Vx,
* it instead passes the Vz unaltered.
*
* This device is useful for isolating nets.
*/
class vvm_bufz : public vvm_nexus::recvr_t, public vvm_nexus::drive_t {
1998-11-10 00:44:10 +01:00
public:
2000-03-18 03:26:02 +01:00
explicit vvm_bufz();
~vvm_bufz();
2000-03-18 03:26:02 +01:00
void init(unsigned idx, vpip_bit_t val);
1998-11-10 00:44:10 +01:00
private:
2000-03-18 03:26:02 +01:00
void take_value(unsigned, vpip_bit_t val);
1998-11-10 00:44:10 +01:00
};
/*
* Threads use the vvm_sync to wait for something to happen. This
* class cooperates with the vvm_pevent class that is the actual gates
* that receive signals. By handling the suspension and the awakening
* separately, I can trivially handle event OR expressions.
*
* When there is an event expression in the source, the elaborator
* makes NetNEvent objects, which are approximately represented by the
* vvm_pevent class.
*/
class vvm_sync {
public:
vvm_sync();
void wait(vvm_thread*);
void wakeup();
private:
vvm_thread*hold_;
private: // not implemented
vvm_sync(const vvm_sync&);
vvm_sync& operator= (const vvm_sync&);
};
template <unsigned WIDTH> class vvm_pevent : public vvm_nexus::recvr_t {
1998-11-10 00:44:10 +01:00
public:
enum EDGE { ANYEDGE, POSEDGE, NEGEDGE };
explicit vvm_pevent(vvm_sync*tgt, EDGE e)
: target_(tgt), edge_(e)
{ for (unsigned idx = 0 ; idx < WIDTH ; idx += 1)
value_[idx] = HiZ;
}
1998-11-10 00:44:10 +01:00
vvm_bitset_t<WIDTH> get() const { return value_; }
void init_P(int idx, vpip_bit_t val)
{ assert(idx < WIDTH);
value_[idx] = val;
}
private:
void take_value(unsigned key, vpip_bit_t val) { set_P(key, val); }
void set_P(unsigned idx, vpip_bit_t val)
{ if (value_[idx] == val) return;
switch (edge_) {
case ANYEDGE:
target_->wakeup();
break;
case POSEDGE:
if (B_IS1(val))
target_->wakeup();
break;
case NEGEDGE:
if (B_IS0(val))
target_->wakeup();
break;
}
value_[idx] = val;
}
1998-11-10 00:44:10 +01:00
private:
vvm_sync*target_;
vvm_bitset_t<WIDTH> value_;
EDGE edge_;
1998-11-10 00:44:10 +01:00
private: // not implemented
vvm_pevent(const vvm_pevent&);
vvm_pevent& operator= (const vvm_pevent&);
};
/*
* $Log: vvm_gates.h,v $
2000-03-24 04:47:01 +01:00
* Revision 1.50 2000/03/24 03:47:01 steve
* Update vvm_ram_dq to nexus style.
*
* Revision 1.49 2000/03/22 04:26:41 steve
* Replace the vpip_bit_t with a typedef and
* define values for all the different bit
* values, including strengths.
*
2000-03-19 00:22:37 +01:00
* Revision 1.48 2000/03/18 23:22:37 steve
* Update the FF device to nexus style.
*
2000-03-18 03:26:02 +01:00
* Revision 1.47 2000/03/18 02:26:02 steve
* Update bufz to nexus style.
*
* Revision 1.46 2000/03/18 01:27:00 steve
* Generate references into a table of nexus objects instead of
* generating lots of isolated nexus objects. Easier on linkers
* and compilers,
*
* Add missing nexus support for l-value bit selects,
*
* Detemplatize the vvm_mux type.
*
* Fix up the vvm_nexus destructor to disconnect from drivers.
*
2000-03-17 20:23:59 +01:00
* Revision 1.45 2000/03/17 19:24:00 steve
* nor2 and and2 optimized gates.
*
2000-03-17 18:25:53 +01:00
* Revision 1.44 2000/03/17 17:25:53 steve
* Adder and comparator in nexus style.
*
* Revision 1.43 2000/03/17 03:36:07 steve
* Remove some useless template parameters.
*
2000-03-17 04:05:13 +01:00
* Revision 1.42 2000/03/17 03:05:13 steve
* Update vvm_mult to nexus style.
*
* Revision 1.41 2000/03/17 02:22:03 steve
* vvm_clshift implementation without templates.
*
2000-03-17 00:13:49 +01:00
* Revision 1.40 2000/03/16 23:13:49 steve
* Update LPM_MUX to nexus style.
*
* Revision 1.39 2000/03/16 21:47:27 steve
* Update LMP_CLSHIFT to use nexus interface.
*
* Revision 1.38 2000/03/16 19:03:04 steve
* Revise the VVM backend to use nexus objects so that
* drivers and resolution functions can be used, and
* the t-vvm module doesn't need to write a zillion
* output functions.
*
* Revision 1.37 2000/02/23 04:43:43 steve
* Some compilers do not accept the not symbol.
*
* Revision 1.36 2000/02/23 02:56:57 steve
* Macintosh compilers do not support ident.
*
* Revision 1.35 2000/01/13 03:35:35 steve
* Multiplication all the way to simulation.
*
1999-12-19 21:57:07 +01:00
* Revision 1.34 1999/12/19 20:57:07 steve
* Proper init_ method prototype.
*
1999-12-16 03:42:14 +01:00
* Revision 1.33 1999/12/16 02:42:15 steve
* Simulate carry output on adders.
*
* Revision 1.32 1999/12/12 19:47:54 steve
* Remove the useless vvm_simulation class.
*
* Revision 1.31 1999/12/05 02:24:09 steve
* Synthesize LPM_RAM_DQ for writes into memories.
1998-11-10 00:44:10 +01:00
*/
#endif