iverilog/tgt-vvp/vvp_process.c

260 lines
6.6 KiB
C
Raw Normal View History

2001-03-19 02:20:46 +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)
#ident "$Id: vvp_process.c,v 1.3 2001/03/21 01:49:43 steve Exp $"
2001-03-19 02:20:46 +01:00
#endif
# include "vvp_priv.h"
# include <assert.h>
static void show_statement(ivl_statement_t net);
2001-03-19 02:20:46 +01:00
/*
* This file includes the code needed to generate VVP code for
* processes. Scopes are already declared, we generate here the
* executable code for the processes.
*/
/*
* These functions handle the blocking assignment. Use the %set
* instruction to perform the actual assignment, and calculate any
* lvalues and rvalues that need calculating.
*
* The set_to_nexus function takes a particular nexus and generates
* the %set statements to assign the value.
*
* The show_stmt_assign function looks at the assign statement, scans
* the l-values, and matches bits of the r-value with the correct
* nexus.
*/
static void set_to_nexus(ivl_nexus_t nex, char bit)
{
unsigned idx;
for (idx = 0 ; idx < ivl_nexus_ptrs(nex) ; idx += 1) {
ivl_nexus_ptr_t ptr = ivl_nexus_ptr(nex, idx);
unsigned pin = ivl_nexus_ptr_pin(ptr);
ivl_signal_t sig = ivl_nexus_ptr_sig(ptr);
if (sig == 0)
continue;
switch (bit) {
case '0':
case '1':
break;
case 'x':
bit = '2';
break;
case 'z':
bit = '3';
break;
}
fprintf(vvp_out, " %%set V_%s[%u], %c\n",
ivl_signal_name(sig), pin, bit);
}
}
static void show_stmt_assign(ivl_statement_t net)
{
ivl_lval_t lval;
ivl_expr_t rval = ivl_stmt_rval(net);
/* Handle the special case that the r-value is a constant. We
can generate the %set statement directly, without any worry
about generating code to evaluate the r-value expressions. */
if (ivl_expr_type(rval) == IVL_EX_NUMBER) {
unsigned idx;
const char*bits = ivl_expr_bits(rval);
/* XXXX Only single l-value supported for now */
assert(ivl_stmt_lvals(net) == 1);
lval = ivl_stmt_lval(net, 0);
/* XXXX No mux support yet. */
assert(ivl_lval_mux(lval) == 0);
for (idx = 0 ; idx < ivl_lval_pins(lval) ; idx += 1)
set_to_nexus(ivl_lval_pin(lval, idx), bits[idx]);
return;
}
fprintf(stderr, "XXXX EXPRESSION TOO COMPLEX FOR ME?\n");
}
/*
* The delay statement is easy. Simply write a ``%delay <n>''
* instruction to delay the thread, then draw the included statement.
* The delay statement comes from verilog code like this:
*
* ...
* #<delay> <stmt>;
*/
static void show_stmt_delay(ivl_statement_t net)
{
unsigned long delay = ivl_stmt_delay_val(net);
ivl_statement_t stmt = ivl_stmt_sub_stmt(net);
fprintf(vvp_out, " %%delay %lu;\n", delay);
show_statement(stmt);
}
/*
* noop statements are implemented by doing nothing.
*/
static void show_stmt_noop(ivl_statement_t net)
{
}
2001-03-19 02:20:46 +01:00
static void show_system_task_call(ivl_statement_t net)
{
unsigned idx;
unsigned parm_count = ivl_stmt_parm_count(net);
if (parm_count == 0) {
fprintf(vvp_out, " %%vpi_call \"%s\";\n", ivl_stmt_name(net));
return;
}
fprintf(vvp_out, " %%vpi_call \"%s\"", ivl_stmt_name(net));
for (idx = 0 ; idx < parm_count ; idx += 1) {
ivl_expr_t expr = ivl_stmt_parm(net, idx);
switch (ivl_expr_type(expr)) {
case IVL_EX_STRING:
fprintf(vvp_out, ", \"%s\"", ivl_expr_string(expr));
break;
default:
fprintf(vvp_out, ", ?");
break;
}
}
fprintf(vvp_out, ";\n");
}
/*
* This function draws a statement as vvp assembly. It basically
* switches on the statement type and draws code based on the type and
* further specifics.
*/
static void show_statement(ivl_statement_t net)
{
const ivl_statement_type_t code = ivl_statement_type(net);
switch (code) {
case IVL_ST_ASSIGN:
show_stmt_assign(net);
break;
2001-03-19 02:20:46 +01:00
/* Begin-end blocks simply draw their contents. */
case IVL_ST_BLOCK: {
unsigned idx;
unsigned cnt = ivl_stmt_block_count(net);
for (idx = 0 ; idx < cnt ; idx += 1) {
show_statement(ivl_stmt_block_stmt(net, idx));
}
break;
}
case IVL_ST_DELAY:
show_stmt_delay(net);
break;
case IVL_ST_NOOP:
show_stmt_noop(net);
break;
2001-03-19 02:20:46 +01:00
case IVL_ST_STASK:
show_system_task_call(net);
break;
default:
fprintf(stderr, "vvp.tgt: Unable to draw statement type %u\n",
code);
break;
}
}
/*
* The process as a whole is surrounded by this code. We generate a
* start label that the .thread statement can use, and we generate
* code to terminate the thread.
*/
int draw_process(ivl_process_t net, void*x)
{
2001-03-20 02:44:13 +01:00
static unsigned thread_count = 0;
ivl_scope_t scope = ivl_process_scope(net);
fprintf(vvp_out, " .scope S_%s;\n", ivl_scope_name(scope));
2001-03-19 02:20:46 +01:00
/* Generate the entry label. Just give the thread a number so
that we ar certain the label is unique. */
fprintf(vvp_out, "T_%05d\n", thread_count);
/* Draw the contents of the thread. */
show_statement(ivl_process_stmt(net));
/* Terminate the thread with either an %end instruction (initial
statements) or a %jmp back to the beginning of the thread. */
switch (ivl_process_type(net)) {
case IVL_PR_INITIAL:
fprintf(vvp_out, " %%end;\n");
break;
case IVL_PR_ALWAYS:
fprintf(vvp_out, " %%jmp T_%05d;\n", thread_count);
break;
}
/* Now write out the .thread directive that tells vvp where
the thread starts. */
fprintf(vvp_out, " .thread T_%05d;\n", thread_count);
thread_count += 1;
return 0;
}
/*
* $Log: vvp_process.c,v $
* Revision 1.3 2001/03/21 01:49:43 steve
* Scan the scopes of a design, and draw behavioral
* blocking assignments of constants to vectors.
*
2001-03-20 02:44:13 +01:00
* Revision 1.2 2001/03/20 01:44:14 steve
* Put processes in the proper scope.
*
2001-03-19 02:20:46 +01:00
* Revision 1.1 2001/03/19 01:20:46 steve
* Add the tgt-vvp code generator target.
*
*/