iverilog/vvp/vthread.cc

126 lines
2.9 KiB
C++
Raw Normal View History

2001-03-11 01:29:38 +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-03-12 00:06:49 +01:00
#ident "$Id: vthread.cc,v 1.3 2001/03/11 23:06:49 steve Exp $"
2001-03-11 01:29:38 +01:00
#endif
# include "vthread.h"
# include "codes.h"
# include "schedule.h"
2001-03-11 23:42:11 +01:00
# include "functor.h"
# include <assert.h>
2001-03-11 01:29:38 +01:00
struct vthread_s {
/* This is the program counter. */
unsigned long pc;
};
/*
* Create a new thread with the given start address.
*/
vthread_t v_newthread(unsigned long pc)
{
vthread_t thr = new struct vthread_s;
thr->pc = pc;
return thr;
}
/*
* This function runs a thread by fetching an instruction,
* incrementing the PC, and executing the instruction.
*/
void vthread_run(vthread_t thr)
{
for (;;) {
vvp_code_t cp = codespace_index(thr->pc);
thr->pc += 1;
bool rc = (cp->opcode)(thr, cp);
if (rc == false)
return;
}
}
bool of_ASSIGN(vthread_t thr, vvp_code_t cp)
{
2001-03-11 23:42:11 +01:00
printf("thread %p: %%assign\n", thr);
unsigned char bit_val = 3;
2001-03-12 00:06:49 +01:00
if ((cp->bit_idx2 & ~0x3) == 0x0) {
bit_val = cp->bit_idx2&3;
2001-03-11 23:42:11 +01:00
} else {
printf("XXXX bit_idx out of range?\n");
}
2001-03-12 00:06:49 +01:00
schedule_assign(cp->iptr, bit_val, cp->bit_idx1);
2001-03-11 01:29:38 +01:00
return true;
}
bool of_DELAY(vthread_t thr, vvp_code_t cp)
{
2001-03-11 23:42:11 +01:00
printf("thread %p: %%delay %lu\n", thr, cp->number);
2001-03-11 01:29:38 +01:00
schedule_vthread(thr, cp->number);
return false;
}
bool of_END(vthread_t thr, vvp_code_t cp)
{
printf("thread %p: %%end\n", thr);
return false;
}
bool of_NOOP(vthread_t thr, vvp_code_t cp)
{
return true;
}
bool of_SET(vthread_t thr, vvp_code_t cp)
{
2001-03-12 00:06:49 +01:00
printf("thread %p: %%set %u, %u\n", thr, cp->iptr, cp->bit_idx1);
2001-03-11 23:42:11 +01:00
unsigned char bit_val = 3;
2001-03-12 00:06:49 +01:00
if ((cp->bit_idx1 & ~0x3) == 0x0) {
bit_val = cp->bit_idx1&3;
2001-03-11 23:42:11 +01:00
} else {
printf("XXXX bit_idx out of range?\n");
}
functor_set(cp->iptr, bit_val);
2001-03-11 01:29:38 +01:00
return true;
}
/*
* $Log: vthread.cc,v $
2001-03-12 00:06:49 +01:00
* Revision 1.3 2001/03/11 23:06:49 steve
* Compact the vvp_code_s structure.
*
2001-03-11 23:42:11 +01:00
* Revision 1.2 2001/03/11 22:42:11 steve
* Functor values and propagation.
*
2001-03-11 01:29:38 +01:00
* Revision 1.1 2001/03/11 00:29:39 steve
* Add the vvp engine to cvs.
*
*/