iverilog/emit.cc

625 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
*/
#if !defined(WINNT) && !defined(macintosh)
#ident "$Id: emit.cc,v 1.49 2000/08/08 01:50:42 steve Exp $"
1998-11-04 00:28:49 +01:00
#endif
/*
* The emit function is called to generate the output required of the
* target.
*/
# include "target.h"
# include "netlist.h"
# include <iostream>
# include <typeinfo>
# include <cassert>
void NetNode::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
cerr << "EMIT: Gate type? " << typeid(*this).name() << endl;
}
void NetLogic::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
tgt->logic(this);
1998-11-04 00:28:49 +01:00
}
void NetUDP_COMB::emit_node(struct target_t*tgt) const
{
tgt->udp_comb(this);
}
void NetUDP::emit_node(struct target_t*tgt) const
{
tgt->udp(this);
}
void NetAddSub::emit_node(struct target_t*tgt) const
1999-09-03 06:28:38 +02:00
{
tgt->lpm_add_sub(this);
1999-09-03 06:28:38 +02:00
}
void NetAssign::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
tgt->net_assign(this);
1998-11-04 00:28:49 +01:00
}
void NetAssignNB::emit_node(struct target_t*tgt) const
{
tgt->net_assign_nb(this);
}
void NetCaseCmp::emit_node(struct target_t*tgt) const
1999-10-10 03:59:54 +02:00
{
tgt->net_case_cmp(this);
1999-10-10 03:59:54 +02:00
}
void NetCAssign::emit_node(struct target_t*tgt) const
{
tgt->net_cassign(this);
}
void NetCLShift::emit_node(struct target_t*tgt) const
{
tgt->lpm_clshift(this);
}
void NetCompare::emit_node(struct target_t*tgt) const
1999-11-15 00:43:45 +01:00
{
tgt->lpm_compare(this);
1999-11-15 00:43:45 +01:00
}
void NetConst::emit_node(struct target_t*tgt) const
{
tgt->net_const(this);
}
void NetDivide::emit_node(struct target_t*tgt) const
2000-04-01 23:40:22 +02:00
{
tgt->lpm_divide(this);
2000-04-01 23:40:22 +02:00
}
void NetFF::emit_node(struct target_t*tgt) const
{
tgt->lpm_ff(this);
}
void NetForce::emit_node(struct target_t*tgt) const
2000-04-22 06:20:19 +02:00
{
tgt->net_force(this);
2000-04-22 06:20:19 +02:00
}
void NetMult::emit_node(struct target_t*tgt) const
{
tgt->lpm_mult(this);
}
void NetMux::emit_node(struct target_t*tgt) const
{
tgt->lpm_mux(this);
}
void NetRamDq::emit_node(struct target_t*tgt) const
{
tgt->lpm_ram_dq(this);
}
void NetBUFZ::emit_node(struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
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 NetAssignMem::emit_proc(struct target_t*tgt) const
{
tgt->proc_assign_mem(this);
1999-09-22 18:57:23 +02:00
return true;
}
bool NetAssignMemNB::emit_proc(struct target_t*tgt) const
{
tgt->proc_assign_mem_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
{
tgt->proc_condit(this);
1999-09-22 18:57:23 +02:00
return true;
}
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_);
}
void NetCondit::emit_recurse_if(struct target_t*tgt) const
{
if (if_)
if_->emit_proc(tgt);
}
void NetCondit::emit_recurse_else(struct target_t*tgt) const
{
if (else_)
else_->emit_proc(tgt);
}
void NetEvProbe::emit_node(struct target_t*tgt) const
2000-04-10 07:26:05 +02:00
{
tgt->net_probe(this);
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 (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->func_def());
break;
case TASK:
tgt->task_def(this->task_def());
break;
}
}
void NetWhile::emit_proc_recurse(struct target_t*tgt) const
{
proc_->emit_proc(tgt);
}
1999-09-22 18:57:23 +02:00
bool Design::emit(ostream&o, struct target_t*tgt) const
1998-11-04 00:28:49 +01:00
{
1999-09-22 18:57:23 +02:00
bool rc = true;
1998-11-04 00:28:49 +01:00
tgt->start_design(o, this);
1999-11-27 20:07:57 +01:00
// enumerate the scopes
root_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 {
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
root_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
tgt->end_design(this);
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 NetEIdent::expr_scan(struct expr_scan_t*tgt) const
{
tgt->expr_ident(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 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);
}
1999-04-25 02:44:10 +02:00
void NetESubSignal::expr_scan(struct expr_scan_t*tgt) const
{
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);
}
1999-09-22 18:57:23 +02:00
bool emit(ostream&o, 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];
1999-09-22 18:57:23 +02:00
if (tgt->name == type)
return des->emit(o, tgt->meth);
1998-11-04 00:28:49 +01:00
}
}
/*
* $Log: emit.cc,v $
* 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.
*
2000-04-10 07:26:05 +02:00
* Revision 1.38 2000/04/10 05:26:06 steve
* All events now use the NetEvent class.
*
* Revision 1.37 2000/04/04 03:20:15 steve
* Simulate named event trigger and waits.
*
2000-04-01 23:40:22 +02:00
* Revision 1.36 2000/04/01 21:40:22 steve
* Add support for integer division.
*
* Revision 1.35 2000/03/29 04:37:11 steve
* New and improved combinational primitives.
*
* Revision 1.34 2000/03/08 04:36:53 steve
* Redesign the implementation of scopes and parameters.
* I now generate the scopes and notice the parameters
* in a separate pass over the pform. Once the scopes
* are generated, I can process overrides and evalutate
* paremeters before elaboration begins.
*
* Revision 1.33 2000/02/23 02:56:54 steve
* Macintosh compilers do not support ident.
*
* Revision 1.32 2000/01/13 03:35:35 steve
* Multiplication all the way to simulation.
*
* Revision 1.31 1999/11/28 23:42:02 steve
* NetESignal object no longer need to be NetNode
* objects. Let them keep a pointer to NetNet objects.
*
1999-11-27 20:07:57 +01:00
* Revision 1.30 1999/11/27 19:07:57 steve
* Support the creation of scopes.
*
* Revision 1.29 1999/11/21 00:13:08 steve
* Support memories in continuous assignments.
*
1999-11-15 00:43:45 +01:00
* Revision 1.28 1999/11/14 23:43:45 steve
* Support combinatorial comparators.
*
* Revision 1.27 1999/11/14 20:24:28 steve
* Add support for the LPM_CLSHIFT device.
*
* Revision 1.26 1999/11/04 03:53:26 steve
* Patch to synthesize unary ~ and the ternary operator.
* Thanks to Larry Doolittle <LRDoolittle@lbl.gov>.
*
* Add the LPM_MUX device, and integrate it with the
* ternary synthesis from Larry. Replace the lpm_mux
* generator in t-xnf.cc to use XNF EQU devices to
* put muxs into function units.
*
* Rewrite elaborate_net for the PETernary class to
* also use the LPM_MUX device.
*
* Revision 1.25 1999/11/01 02:07:40 steve
* Add the synth functor to do generic synthesis
* and add the LPM_FF device to handle rows of
* flip-flops.
*
1999-10-10 03:59:54 +02:00
* Revision 1.24 1999/10/10 01:59:54 steve
* Structural case equals device.
*
1999-09-22 18:57:23 +02:00
* Revision 1.23 1999/09/22 16:57:23 steve
* Catch parallel blocks in vvm emit.
*
1999-09-20 04:21:10 +02:00
* Revision 1.22 1999/09/20 02:21:10 steve
* Elaborate parameters in phases.
*
* Revision 1.21 1999/09/15 01:55:06 steve
* Elaborate non-blocking assignment to memories.
*
1999-09-03 06:28:38 +02:00
* Revision 1.20 1999/09/03 04:28:38 steve
* elaborate the binary plus operator.
*
* Revision 1.19 1999/08/31 22:38:29 steve
* Elaborate and emit to vvm procedural functions.
*
1999-07-17 21:50:59 +02:00
* Revision 1.18 1999/07/17 19:50:59 steve
* netlist support for ternary operator.
*
1999-07-17 05:39:11 +02:00
* Revision 1.17 1999/07/17 03:39:11 steve
* simplified process scan for targets.
*
1999-07-07 06:20:57 +02:00
* Revision 1.16 1999/07/07 04:20:57 steve
* Emit vvm for user defined tasks.
*
1999-07-03 04:12:51 +02:00
* Revision 1.15 1999/07/03 02:12:51 steve
* Elaborate user defined tasks.
*
* Revision 1.14 1999/06/19 21:06:16 steve
* Elaborate and supprort to vvm the forever
* and repeat statements.
*
* Revision 1.13 1999/06/09 03:00:06 steve
* Add support for procedural concatenation expression.
*
* Revision 1.12 1999/06/06 20:45:38 steve
* Add parse and elaboration of non-blocking assignments,
* Replace list<PCase::Item*> with an svector version,
* Add integer support.
*
* Revision 1.11 1999/05/12 04:03:19 steve
* emit NetAssignMem objects in vvm target.
*
* Revision 1.10 1999/05/07 01:21:18 steve
* Handle total lack of nodes and signals.
*
* Revision 1.9 1999/05/01 02:57:53 steve
* Handle much more complex event expressions.
*
1999-04-25 02:44:10 +02:00
* Revision 1.8 1999/04/25 00:44:10 steve
* Core handles subsignal expressions.
1998-11-04 00:28:49 +01:00
*/