iverilog/emit.cc

626 lines
14 KiB
C++
Raw Normal View History

1998-11-04 00:28:49 +01:00
/*
* Copyright (c) 1998-2000 Stephen Williams (steve@icarus.com)
1998-11-04 00:28:49 +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
#ident "$Id: emit.cc,v 1.71 2003/01/26 21:15:58 steve Exp $"
1998-11-04 00:28:49 +01:00
#endif
# include "config.h"
# include <iostream>
1998-11-04 00:28:49 +01:00
/*
* The emit function is called to generate the output required of the
* target.
*/
# include "target.h"
# include "netlist.h"
# include <typeinfo>
# include <cassert>
bool NetNode::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
cerr << "EMIT: Gate type? " << typeid(*this).name() << endl;
return false;
1998-11-04 00:28:49 +01:00
}
bool NetLogic::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
tgt->logic(this);
return true;
1998-11-04 00:28:49 +01:00
}
bool NetUDP::emit_node(struct target_t*tgt) const
{
tgt->udp(this);
return true;
}
bool NetAddSub::emit_node(struct target_t*tgt) const
1999-09-03 06:28:38 +02:00
{
tgt->lpm_add_sub(this);
return true;
1999-09-03 06:28:38 +02:00
}
bool NetCaseCmp::emit_node(struct target_t*tgt) const
1999-10-10 03:59:54 +02:00
{
tgt->net_case_cmp(this);
return true;
1999-10-10 03:59:54 +02:00
}
bool NetCAssign::emit_node(struct target_t*tgt) const
{
tgt->net_cassign(this);
return true;
}
bool NetCLShift::emit_node(struct target_t*tgt) const
{
tgt->lpm_clshift(this);
return true;
}
bool NetCompare::emit_node(struct target_t*tgt) const
1999-11-15 00:43:45 +01:00
{
tgt->lpm_compare(this);
return true;
1999-11-15 00:43:45 +01:00
}
bool NetConst::emit_node(struct target_t*tgt) const
{
return tgt->net_const(this);
}
bool NetDivide::emit_node(struct target_t*tgt) const
2000-04-01 23:40:22 +02:00
{
tgt->lpm_divide(this);
return true;
2000-04-01 23:40:22 +02:00
}
bool NetFF::emit_node(struct target_t*tgt) const
{
tgt->lpm_ff(this);
return true;
}
bool NetForce::emit_node(struct target_t*tgt) const
2000-04-22 06:20:19 +02:00
{
tgt->net_force(this);
return true;
2000-04-22 06:20:19 +02:00
}
2000-09-17 23:26:15 +02:00
bool NetModulo::emit_node(struct target_t*tgt) const
{
tgt->lpm_modulo(this);
return true;
}
bool NetMult::emit_node(struct target_t*tgt) const
{
tgt->lpm_mult(this);
return true;
}
bool NetMux::emit_node(struct target_t*tgt) const
{
tgt->lpm_mux(this);
return true;
}
bool NetRamDq::emit_node(struct target_t*tgt) const
{
tgt->lpm_ram_dq(this);
return true;
}
2002-03-09 03:10:22 +01:00
bool NetUserFunc::emit_node(struct target_t*tgt) const
{
return tgt->net_function(this);
}
bool NetBUFZ::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
return tgt->bufz(this);
1998-11-04 00:28:49 +01:00
}
bool NetProcTop::emit(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
return tgt->process(this);
1998-11-04 00:28:49 +01:00
}
bool NetProc::emit_proc(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
cerr << "EMIT: Proc type? " << typeid(*this).name() << endl;
1999-09-22 18:57:23 +02:00
return false;
1998-11-04 00:28:49 +01:00
}
bool NetAssign::emit_proc(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
tgt->proc_assign(this);
1999-09-22 18:57:23 +02:00
return true;
1998-11-04 00:28:49 +01:00
}
bool NetAssignNB::emit_proc(struct target_t*tgt) const
{
tgt->proc_assign_nb(this);
1999-09-22 18:57:23 +02:00
return true;
}
bool NetBlock::emit_proc(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
return tgt->proc_block(this);
1998-11-04 00:28:49 +01:00
}
bool NetCase::emit_proc(struct target_t*tgt) const
{
tgt->proc_case(this);
1999-09-22 18:57:23 +02:00
return true;
}
bool NetCAssign::emit_proc(struct target_t*tgt) const
{
return tgt->proc_cassign(this);
}
bool NetCondit::emit_proc(struct target_t*tgt) const
{
return tgt->proc_condit(this);
}
bool NetDeassign::emit_proc(struct target_t*tgt) const
{
return tgt->proc_deassign(this);
}
bool NetDisable::emit_proc(struct target_t*tgt) const
{
return tgt->proc_disable(this);
}
bool NetForce::emit_proc(struct target_t*tgt) const
2000-04-22 06:20:19 +02:00
{
return tgt->proc_force(this);
2000-04-22 06:20:19 +02:00
}
bool NetForever::emit_proc(struct target_t*tgt) const
{
tgt->proc_forever(this);
1999-09-22 18:57:23 +02:00
return true;
}
bool NetPDelay::emit_proc(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
return tgt->proc_delay(this);
1998-11-04 00:28:49 +01:00
}
bool NetPDelay::emit_proc_recurse(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
if (statement_) return statement_->emit_proc(tgt);
return true;
1998-11-04 00:28:49 +01:00
}
bool NetRelease::emit_proc(struct target_t*tgt) const
{
return tgt->proc_release(this);
}
bool NetRepeat::emit_proc(struct target_t*tgt) const
{
tgt->proc_repeat(this);
1999-09-22 18:57:23 +02:00
return true;
}
bool NetSTask::emit_proc(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
tgt->proc_stask(this);
1999-09-22 18:57:23 +02:00
return true;
1999-07-03 04:12:51 +02:00
}
bool NetUTask::emit_proc(struct target_t*tgt) const
1999-07-03 04:12:51 +02:00
{
tgt->proc_utask(this);
1999-09-22 18:57:23 +02:00
return true;
1998-11-04 00:28:49 +01:00
}
bool NetWhile::emit_proc(struct target_t*tgt) const
{
tgt->proc_while(this);
1999-09-22 18:57:23 +02:00
return true;
}
void NetBlock::emit_recurse(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
if (last_ == 0)
return;
NetProc*cur = last_;
do {
cur = cur->next_;
cur->emit_proc(tgt);
1998-11-04 00:28:49 +01:00
} while (cur != last_);
}
bool NetCondit::emit_recurse_if(struct target_t*tgt) const
{
if (if_)
return if_->emit_proc(tgt);
else
return true;
}
bool NetCondit::emit_recurse_else(struct target_t*tgt) const
{
if (else_)
return else_->emit_proc(tgt);
else
return true;
}
bool NetEvProbe::emit_node(struct target_t*tgt) const
2000-04-10 07:26:05 +02:00
{
tgt->net_probe(this);
return true;
2000-04-10 07:26:05 +02:00
}
bool NetEvTrig::emit_proc(struct target_t*tgt) const
{
return tgt->proc_trigger(this);
}
bool NetEvWait::emit_proc(struct target_t*tgt) const
{
return tgt->proc_wait(this);
}
bool NetEvWait::emit_recurse(struct target_t*tgt) const
{
2000-04-10 07:26:05 +02:00
if (!statement_) return true;
return statement_->emit_proc(tgt);
}
void NetForever::emit_recurse(struct target_t*tgt) const
{
if (statement_)
statement_->emit_proc(tgt);
}
void NetRepeat::emit_recurse(struct target_t*tgt) const
{
if (statement_)
statement_->emit_proc(tgt);
}
void NetScope::emit_scope(struct target_t*tgt) const
{
tgt->scope(this);
for (NetEvent*cur = events_ ; cur ; cur = cur->snext_)
tgt->event(cur);
for (NetVariable*cur = vars_ ; cur ; cur = cur->snext_)
tgt->variable(cur);
for (NetScope*cur = sub_ ; cur ; cur = cur->sib_)
cur->emit_scope(tgt);
if (signals_) {
NetNet*cur = signals_->sig_next_;
do {
tgt->signal(cur);
cur = cur->sig_next_;
} while (cur != signals_->sig_next_);
}
2000-05-02 05:13:30 +02:00
if (memories_) {
NetMemory*cur = memories_->snext_;
do {
tgt->memory(cur);
2000-05-02 05:13:30 +02:00
cur = cur->snext_;
} while (cur != memories_->snext_);
}
}
void NetScope::emit_defs(struct target_t*tgt) const
{
switch (type_) {
case MODULE:
for (NetScope*cur = sub_ ; cur ; cur = cur->sib_)
cur->emit_defs(tgt);
break;
case FUNC:
tgt->func_def(this);
break;
case TASK:
2001-04-02 04:28:12 +02:00
tgt->task_def(this);
break;
}
}
void NetWhile::emit_proc_recurse(struct target_t*tgt) const
{
proc_->emit_proc(tgt);
}
bool Design::emit(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
1999-09-22 18:57:23 +02:00
bool rc = true;
rc = rc && tgt->start_design(this);
if (rc == false)
return false;
1998-11-04 00:28:49 +01:00
1999-11-27 20:07:57 +01:00
// enumerate the scopes
for (list<NetScope*>::const_iterator scope = root_scopes_.begin();
scope != root_scopes_.end(); scope++)
(*scope)->emit_scope(tgt);
1999-11-27 20:07:57 +01:00
1998-11-04 00:28:49 +01:00
// emit nodes
if (nodes_) {
1998-11-04 00:28:49 +01:00
NetNode*cur = nodes_->node_next_;
do {
rc = rc && cur->emit_node(tgt);
1998-11-04 00:28:49 +01:00
cur = cur->node_next_;
} while (cur != nodes_->node_next_);
}
// emit task and function definitions
for (list<NetScope*>::const_iterator scope = root_scopes_.begin();
scope != root_scopes_.end(); scope++)
(*scope)->emit_defs(tgt);
1999-07-07 06:20:57 +02:00
1998-11-04 00:28:49 +01:00
// emit the processes
for (const NetProcTop*idx = procs_ ; idx ; idx = idx->next_)
rc = rc && idx->emit(tgt);
1998-11-04 00:28:49 +01:00
if (tgt->end_design(this) != 0)
rc = false;
1999-09-22 18:57:23 +02:00
return rc;
1998-11-04 00:28:49 +01:00
}
void NetEBinary::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_binary(this);
}
void NetEConcat::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_concat(this);
}
1998-11-04 00:28:49 +01:00
void NetEConst::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_const(this);
}
void NetECReal::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_creal(this);
}
void NetEMemory::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_memory(this);
}
1999-09-20 04:21:10 +02:00
void NetEParam::expr_scan(struct expr_scan_t*tgt) const
{
cerr << get_line() << ":internal error: unexpected NetEParam."
<< endl;
}
1999-11-27 20:07:57 +01:00
void NetEScope::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_scope(this);
}
void NetESelect::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_select(this);
}
void NetESFunc::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_sfunc(this);
}
void NetEUFunc::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_ufunc(this);
}
void NetESignal::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_signal(this);
}
void NetEBitSel::expr_scan(struct expr_scan_t*tgt) const
1999-04-25 02:44:10 +02:00
{
tgt->expr_subsignal(this);
}
1999-07-17 21:50:59 +02:00
void NetETernary::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_ternary(this);
}
1998-11-04 00:28:49 +01:00
void NetEUnary::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_unary(this);
}
void NetEVariable::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_variable(this);
}
bool emit(const Design*des, const char*type)
1998-11-04 00:28:49 +01:00
{
for (unsigned idx = 0 ; target_table[idx] ; idx += 1) {
const struct target*tgt = target_table[idx];
2000-11-04 02:54:01 +01:00
if (strcmp(tgt->name, type) == 0)
return des->emit(tgt->meth);
1999-09-22 18:57:23 +02:00
1998-11-04 00:28:49 +01:00
}
cerr << "error: Code generator type " << type
<< " not found." << endl;
return false;
1998-11-04 00:28:49 +01:00
}
/*
* $Log: emit.cc,v $
* Revision 1.71 2003/01/26 21:15:58 steve
* Rework expression parsing and elaboration to
* accommodate real/realtime values and expressions.
*
* Revision 1.70 2002/11/03 20:36:10 steve
* Error message for mising code generator type.
*
* Revision 1.69 2002/08/12 01:34:59 steve
* conditional ident string using autoconfig.
*
* Revision 1.68 2002/06/05 03:44:25 steve
* Add support for memory words in l-value of
* non-blocking assignments, and remove the special
* NetAssignMem_ and NetAssignMemNB classes.
*
* Revision 1.67 2002/06/04 05:38:44 steve
* Add support for memory words in l-value of
* blocking assignments, and remove the special
* NetAssignMem class.
*
2002-03-09 03:10:22 +01:00
* Revision 1.66 2002/03/09 02:10:22 steve
* Add the NetUserFunc netlist node.
*
* Revision 1.65 2002/01/28 00:52:41 steve
* Add support for bit select of parameters.
* This leads to a NetESelect node and the
* vvp code generator to support that.
*
* Revision 1.64 2002/01/19 19:02:08 steve
* Pass back target errors processing conditionals.
*
* Revision 1.63 2001/10/19 21:53:24 steve
* Support multiple root modules (Philip Blundell)
*
* Revision 1.62 2001/08/25 23:50:02 steve
* Change the NetAssign_ class to refer to the signal
* instead of link into the netlist. This is faster
* and uses less space. Make the NetAssignNB carry
* the delays instead of the NetAssign_ lval objects.
*
* Change the vvp code generator to support multiple
* l-values, i.e. concatenations of part selects.
*
* Revision 1.61 2001/07/27 04:51:44 steve
* Handle part select expressions as variants of
* NetESignal/IVL_EX_SIGNAL objects, instead of
* creating new and useless temporary signals.
*
* Revision 1.60 2001/07/25 03:10:49 steve
* Create a config.h.in file to hold all the config
* junk, and support gcc 3.0. (Stephan Boettcher)
*
* Revision 1.59 2001/04/22 23:09:46 steve
* More UDP consolidation from Stephan Boettcher.
*
* Revision 1.58 2001/04/06 02:28:02 steve
* Generate vvp code for functions with ports.
*
2001-04-02 04:28:12 +02:00
* Revision 1.57 2001/04/02 02:28:12 steve
* Generate code for task calls.
*
* Revision 1.56 2001/03/27 03:31:06 steve
* Support error code from target_t::end_design method.
*
2000-11-04 02:54:01 +01:00
* Revision 1.55 2000/11/04 01:54:01 steve
* Modifications in support of gcc 2.96
*
2000-09-26 03:35:42 +02:00
* Revision 1.54 2000/09/26 01:35:42 steve
* Remove the obsolete NetEIdent class.
*
2000-09-17 23:26:15 +02:00
* Revision 1.53 2000/09/17 21:26:15 steve
* Add support for modulus (Eric Aardoom)
*
* Revision 1.52 2000/09/02 20:54:20 steve
* Rearrange NetAssign to make NetAssign_ separate.
*
* Revision 1.51 2000/08/14 04:39:56 steve
* add th t-dll functions for net_const, net_bufz and processes.
*
* Revision 1.50 2000/08/09 03:43:45 steve
* Move all file manipulation out of target class.
*
* Revision 1.49 2000/08/08 01:50:42 steve
* target methods need not take a file stream.
*
* Revision 1.48 2000/07/30 18:25:43 steve
* Rearrange task and function elaboration so that the
* NetTaskDef and NetFuncDef functions are created during
* signal enaboration, and carry these objects in the
* NetScope class instead of the extra, useless map in
* the Design class.
*
* Revision 1.47 2000/07/29 16:21:08 steve
* Report code generation errors through proc_delay.
*
* Revision 1.46 2000/07/27 05:13:44 steve
* Support elaboration of disable statements.
*
* Revision 1.45 2000/05/11 23:37:27 steve
* Add support for procedural continuous assignment.
*
* Revision 1.44 2000/05/04 03:37:58 steve
* Add infrastructure for system functions, move
* $time to that structure and add $random.
*
2000-05-02 05:13:30 +02:00
* Revision 1.43 2000/05/02 03:13:31 steve
* Move memories to the NetScope object.
*
* Revision 1.42 2000/05/02 00:58:12 steve
* Move signal tables to the NetScope class.
*
* Revision 1.41 2000/04/23 03:45:24 steve
* Add support for the procedural release statement.
*
2000-04-22 06:20:19 +02:00
* Revision 1.40 2000/04/22 04:20:19 steve
* Add support for force assignment.
*
* Revision 1.39 2000/04/12 04:23:58 steve
* Named events really should be expressed with PEIdent
* objects in the pform,
*
* Handle named events within the mix of net events
* and edges. As a unified lot they get caught together.
* wait statements are broken into more complex statements
* that include a conditional.
*
* Do not generate NetPEvent or NetNEvent objects in
* elaboration. NetEvent, NetEvWait and NetEvProbe
* take over those functions in the netlist.
1998-11-04 00:28:49 +01:00
*/