emit.cc

/*
 * Copyright (c) 1998 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: emit.cc,v 1.31 1999/11/28 23:42:02 steve Exp $"
#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(ostream&o, struct target_t*tgt) const
{
      cerr << "EMIT: Gate type? " << typeid(*this).name() << endl;
}

void NetLogic::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->logic(o, this);
}

void NetUDP::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->udp(o, this);
}

void NetAddSub::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->lpm_add_sub(o, this);
}

void NetAssign::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->net_assign(o, this);
}

void NetAssignNB::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->net_assign_nb(o, this);
}

void NetCaseCmp::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->net_case_cmp(o, this);
}

void NetCLShift::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->lpm_clshift(o, this);
}

void NetCompare::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->lpm_compare(o, this);
}

void NetConst::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->net_const(o, this);
}

void NetFF::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->lpm_ff(o, this);
}

void NetMux::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->lpm_mux(o, this);
}

void NetRamDq::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->lpm_ram_dq(o, this);
}

void NetNEvent::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->net_event(o, this);
}

void NetBUFZ::emit_node(ostream&o, struct target_t*tgt) const
{
      tgt->bufz(o, this);
}

bool NetProcTop::emit(ostream&o, struct target_t*tgt) const
{
      return tgt->process(o, this);
}

bool NetProc::emit_proc(ostream&o, struct target_t*tgt) const
{
      cerr << "EMIT: Proc type? " << typeid(*this).name() << endl;
      return false;
}

bool NetAssign::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_assign(o, this);
      return true;
}

bool NetAssignNB::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_assign_nb(o, this);
      return true;
}

bool NetAssignMem::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_assign_mem(o, this);
      return true;
}

bool NetAssignMemNB::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_assign_mem_nb(o, this);
      return true;
}

bool NetBlock::emit_proc(ostream&o, struct target_t*tgt) const
{
      return tgt->proc_block(o, this);
}

bool NetCase::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_case(o, this);
      return true;
}

bool NetCondit::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_condit(o, this);
      return true;
}

bool NetForever::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_forever(o, this);
      return true;
}

bool NetPDelay::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_delay(o, this);
      return true;
}

void NetPDelay::emit_proc_recurse(ostream&o, struct target_t*tgt) const
{
      if (statement_) statement_->emit_proc(o, tgt);
}

bool NetPEvent::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_event(o, this);
      return true;
}

void NetPEvent::emit_proc_recurse(ostream&o, struct target_t*tgt) const
{
      if (statement_) statement_->emit_proc(o, tgt);
}

bool NetRepeat::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_repeat(o, this);
      return true;
}

bool NetSTask::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_stask(o, this);
      return true;
}

bool NetUTask::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_utask(o, this);
      return true;
}

bool NetWhile::emit_proc(ostream&o, struct target_t*tgt) const
{
      tgt->proc_while(o, this);
      return true;
}

void NetBlock::emit_recurse(ostream&o, struct target_t*tgt) const
{
      if (last_ == 0)
	    return;

      NetProc*cur = last_;
      do {
	    cur = cur->next_;
	    cur->emit_proc(o, tgt);
      } while (cur != last_);
}

void NetCondit::emit_recurse_if(ostream&o, struct target_t*tgt) const
{
      if (if_)
	    if_->emit_proc(o, tgt);
}

void NetCondit::emit_recurse_else(ostream&o, struct target_t*tgt) const
{
      if (else_)
	    else_->emit_proc(o, tgt);
}

void NetForever::emit_recurse(ostream&o, struct target_t*tgt) const
{
      if (statement_)
	    statement_->emit_proc(o, tgt);
}

void NetRepeat::emit_recurse(ostream&o, struct target_t*tgt) const
{
      if (statement_)
	    statement_->emit_proc(o, tgt);
}

void NetWhile::emit_proc_recurse(ostream&o, struct target_t*tgt) const
{
      proc_->emit_proc(o, tgt);
}

bool Design::emit(ostream&o, struct target_t*tgt) const
{
      bool rc = true;
      tgt->start_design(o, this);

	// enumerate the scopes
      { map<string,NetScope*>::const_iterator sc;
        for (sc = scopes_.begin() ;  sc != scopes_.end() ;  sc++) {
	      tgt->scope(o, (*sc).second);
	}
      }

	// emit signals
      if (signals_) {
	    NetNet*cur = signals_->sig_next_;
	    do {
		  tgt->signal(o, cur);
		  cur = cur->sig_next_;
	    } while (cur != signals_->sig_next_);
      }


	// emit memories
      {
	    map<string,NetMemory*>::const_iterator mi;
	    for (mi = memories_.begin() ;  mi != memories_.end() ; mi++) {
		  tgt->memory(o, (*mi).second);
	    }
      }


	// emit nodes
      if (nodes_) {
	    NetNode*cur = nodes_->node_next_;
	    do {
		  cur->emit_node(o, tgt);
		  cur = cur->node_next_;
	    } while (cur != nodes_->node_next_);
      }


	// emit function definitions
      {
	    map<string,NetFuncDef*>::const_iterator ta;
	    for (ta = funcs_.begin() ; ta != funcs_.end() ;  ta ++) {
		  tgt->func_def(o, (*ta).second);
	    }
      }

	// emit task definitions
      {
	    map<string,NetTaskDef*>::const_iterator ta;
	    for (ta = tasks_.begin() ; ta != tasks_.end() ;  ta ++) {
		  tgt->task_def(o, (*ta).second);
	    }
      }

	// emit the processes
      for (const NetProcTop*idx = procs_ ;  idx ;  idx = idx->next_)
	    rc = rc && idx->emit(o, tgt);

      tgt->end_design(o, this);
      return rc;
}

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);
}

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);
}

void NetEParam::expr_scan(struct expr_scan_t*tgt) const
{
      cerr << get_line() << ":internal error: unexpected NetEParam."
	   << endl;
}

void NetEScope::expr_scan(struct expr_scan_t*tgt) const
{
      tgt->expr_scope(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 NetESubSignal::expr_scan(struct expr_scan_t*tgt) const
{
      tgt->expr_subsignal(this);
}

void NetETernary::expr_scan(struct expr_scan_t*tgt) const
{
      tgt->expr_ternary(this);
}

void NetEUnary::expr_scan(struct expr_scan_t*tgt) const
{
      tgt->expr_unary(this);
}

bool emit(ostream&o, const Design*des, const char*type)
{
      for (unsigned idx = 0 ;  target_table[idx] ;  idx += 1) {
	    const struct target*tgt = target_table[idx];
	    if (tgt->name == type)
		  return des->emit(o, tgt->meth);

      }
}


/*
 * $Log: emit.cc,v $
 * 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.
 *
 * 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.
 *
 * 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.
 *
 * Revision 1.24  1999/10/10 01:59:54  steve
 *  Structural case equals device.
 *
 * Revision 1.23  1999/09/22 16:57:23  steve
 *  Catch parallel blocks in vvm emit.
 *
 * 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.
 *
 * 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.
 *
 * Revision 1.18  1999/07/17 19:50:59  steve
 *  netlist support for ternary operator.
 *
 * Revision 1.17  1999/07/17 03:39:11  steve
 *  simplified process scan for targets.
 *
 * Revision 1.16  1999/07/07 04:20:57  steve
 *  Emit vvm for user defined tasks.
 *
 * 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.
 *
 * Revision 1.8  1999/04/25 00:44:10  steve
 *  Core handles subsignal expressions.
 *
 * Revision 1.7  1999/04/19 01:59:36  steve
 *  Add memories to the parse and elaboration phases.
 *
 * Revision 1.6  1999/02/08 02:49:56  steve
 *  Turn the NetESignal into a NetNode so
 *  that it can connect to the netlist.
 *  Implement the case statement.
 *  Convince t-vvm to output code for
 *  the case statement.
 *
 * Revision 1.5  1999/02/01 00:26:49  steve
 *  Carry some line info to the netlist,
 *  Dump line numbers for processes.
 *  Elaborate prints errors about port vector
 *  width mismatch
 *  Emit better handles null statements.
 *
 * Revision 1.4  1998/12/01 00:42:14  steve
 *  Elaborate UDP devices,
 *  Support UDP type attributes, and
 *  pass those attributes to nodes that
 *  are instantiated by elaboration,
 *  Put modules into a map instead of
 *  a simple list.
 *
 * Revision 1.3  1998/11/09 18:55:34  steve
 *  Add procedural while loops,
 *  Parse procedural for loops,
 *  Add procedural wait statements,
 *  Add constant nodes,
 *  Add XNOR logic gate,
 *  Make vvm output look a bit prettier.
 *
 * Revision 1.2  1998/11/07 17:05:05  steve
 *  Handle procedural conditional, and some
 *  of the conditional expressions.
 *
 *  Elaborate signals and identifiers differently,
 *  allowing the netlist to hold signal information.
 *
 * Revision 1.1  1998/11/03 23:28:57  steve
 *  Introduce verilog to CVS.
 *
 */