iverilog/vvp/event.h

98 lines
2.8 KiB
C
Raw Normal View History

2001-11-06 04:07:21 +01:00
#ifndef __event_H
#define __event_H
/*
2004-12-18 19:52:44 +01:00
* Copyright (c) 2004 Stephen Williams (steve@icarus.com)
2001-11-06 04:07:21 +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
*/
#ifdef HAVE_CVS_IDENT
2004-12-18 19:52:44 +01:00
#ident "$Id: event.h,v 1.7 2004/12/18 18:52:44 steve Exp $"
2001-11-06 04:07:21 +01:00
#endif
# include "vvp_net.h"
# include "pointers.h"
2001-11-06 04:07:21 +01:00
/*
* Event / edge detection functors
*/
/*
* A "waitable" functor is one that the %wait instruction can wait
* on. This includes the infrastructure needed to hold threads.
*/
struct waitable_hooks_s {
2004-12-18 19:52:44 +01:00
vthread_t threads;
2004-12-18 19:52:44 +01:00
protected:
void run_waiting_threads_();
2001-11-06 04:07:21 +01:00
};
/*
* The vvp_fun_edge functor detects events that are edges of various
* types. This should be hooked to a vvp_net_t that is connected to
* the output of a signal that we wish to watch for edges.
*/
class vvp_fun_edge : public vvp_net_fun_t, public waitable_hooks_s {
public:
typedef unsigned short edge_t;
explicit vvp_fun_edge(edge_t e);
virtual ~vvp_fun_edge();
2001-11-06 04:07:21 +01:00
void recv_vec4(vvp_net_ptr_t port, vvp_vector4_t bit);
2001-11-06 04:07:21 +01:00
private:
vvp_vector4_t bits_;
edge_t edge_;
};
2001-11-06 04:07:21 +01:00
extern const vvp_fun_edge::edge_t vvp_edge_posedge;
extern const vvp_fun_edge::edge_t vvp_edge_negedge;
extern const vvp_fun_edge::edge_t vvp_edge_anyedge;
extern const vvp_fun_edge::edge_t vvp_edge_none;
2001-11-06 04:07:21 +01:00
/*
2004-12-18 19:52:44 +01:00
* A named event is simpler then a vvp_fun_edge in that it triggers on
* any input at all to port-0. The idea here is that behavioral code
* can use a %set/v instruction to trigger the event.
*/
2004-12-18 19:52:44 +01:00
class vvp_named_event : public vvp_net_fun_t, public waitable_hooks_s {
public:
2004-12-18 19:52:44 +01:00
explicit vvp_named_event(struct __vpiHandle*eh);
~vvp_named_event();
void recv_vec4(vvp_net_ptr_t port, vvp_vector4_t bit);
2004-12-18 19:52:44 +01:00
private:
struct __vpiHandle*handle_;
};
2001-11-06 04:07:21 +01:00
/*
* $Log: event.h,v $
2004-12-18 19:52:44 +01:00
* Revision 1.7 2004/12/18 18:52:44 steve
* Rework named events and event/or.
*
* Revision 1.6 2004/12/11 02:31:29 steve
* Rework of internals to carry vectors through nexus instead
* of single bits. Make the ivl, tgt-vvp and vvp initial changes
* down this path.
2001-11-06 04:07:21 +01:00
*/
#endif // __event_H