1998-11-04 00:28:49 +01:00
|
|
|
/*
|
|
|
|
|
* 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)
|
1999-05-10 02:16:57 +02:00
|
|
|
#ident "$Id: Statement.cc,v 1.6 1999/05/10 00:16:58 steve Exp $"
|
1998-11-04 00:28:49 +01:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
# include "Statement.h"
|
|
|
|
|
# include "PExpr.h"
|
|
|
|
|
|
|
|
|
|
Statement::~Statement()
|
|
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
PBlock::PBlock(BL_TYPE t, const list<Statement*>&st)
|
|
|
|
|
: bl_type_(t)
|
|
|
|
|
{
|
|
|
|
|
nlist_ = st.size();
|
|
|
|
|
list_ = new Statement*[nlist_];
|
|
|
|
|
|
|
|
|
|
list<Statement*>::const_iterator s = st.begin();
|
|
|
|
|
for (unsigned idx = 0 ; s != st.end() ; s ++, idx += 1 ) {
|
|
|
|
|
list_[idx] = *s;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
PBlock::~PBlock()
|
|
|
|
|
{
|
|
|
|
|
for (unsigned idx = 0 ; idx < nlist_ ; idx += 1)
|
|
|
|
|
delete list_[idx];
|
|
|
|
|
|
|
|
|
|
delete[]list_;
|
|
|
|
|
}
|
|
|
|
|
|
1999-05-10 02:16:57 +02:00
|
|
|
PCallTask::PCallTask(const string&n, const svector<PExpr*>&p)
|
|
|
|
|
: name_(n), parms_(p)
|
1998-11-04 00:28:49 +01:00
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
1999-02-03 05:20:11 +01:00
|
|
|
PCase::PCase(PExpr*ex, list<PCase::Item*>*l)
|
|
|
|
|
: expr_(ex)
|
|
|
|
|
{
|
|
|
|
|
nitems_ = l->size();
|
|
|
|
|
items_ = new Item[nitems_];
|
|
|
|
|
|
|
|
|
|
list<PCase::Item*>::const_iterator cur;
|
|
|
|
|
unsigned idx;
|
|
|
|
|
for (cur = l->begin(), idx = 0 ; cur != l->end() ; cur ++, idx += 1) {
|
|
|
|
|
items_[idx] = *(*cur);
|
|
|
|
|
delete (*cur);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
delete l;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
PCase::~PCase()
|
|
|
|
|
{
|
|
|
|
|
delete expr_;
|
|
|
|
|
for (unsigned idx = 0 ; idx < nitems_ ; idx += 1) {
|
|
|
|
|
if (items_[idx].expr) delete items_[idx].expr;
|
|
|
|
|
if (items_[idx].stat) delete items_[idx].stat;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
delete[]items_;
|
|
|
|
|
}
|
|
|
|
|
|
1998-11-07 18:05:05 +01:00
|
|
|
PCondit::~PCondit()
|
|
|
|
|
{
|
|
|
|
|
delete expr_;
|
|
|
|
|
delete if_;
|
|
|
|
|
delete else_;
|
|
|
|
|
}
|
|
|
|
|
|
1999-01-25 06:45:56 +01:00
|
|
|
PProcess::~PProcess()
|
|
|
|
|
{
|
|
|
|
|
delete statement_;
|
|
|
|
|
}
|
1998-11-04 00:28:49 +01:00
|
|
|
|
1998-11-11 04:13:04 +01:00
|
|
|
PWhile::~PWhile()
|
|
|
|
|
{
|
|
|
|
|
delete cond_;
|
|
|
|
|
delete statement_;
|
|
|
|
|
}
|
|
|
|
|
|
1998-11-04 00:28:49 +01:00
|
|
|
/*
|
|
|
|
|
* $Log: Statement.cc,v $
|
1999-05-10 02:16:57 +02:00
|
|
|
* Revision 1.6 1999/05/10 00:16:58 steve
|
|
|
|
|
* Parse and elaborate the concatenate operator
|
|
|
|
|
* in structural contexts, Replace vector<PExpr*>
|
|
|
|
|
* and list<PExpr*> with svector<PExpr*>, evaluate
|
|
|
|
|
* constant expressions with parameters, handle
|
|
|
|
|
* memories as lvalues.
|
|
|
|
|
*
|
|
|
|
|
* Parse task declarations, integer types.
|
|
|
|
|
*
|
1999-02-03 05:20:11 +01:00
|
|
|
* Revision 1.5 1999/02/03 04:20:11 steve
|
|
|
|
|
* Parse and elaborate the Verilog CASE statement.
|
|
|
|
|
*
|
1999-01-25 06:45:56 +01:00
|
|
|
* Revision 1.4 1999/01/25 05:45:56 steve
|
|
|
|
|
* Add the LineInfo class to carry the source file
|
|
|
|
|
* location of things. PGate, Statement and PProcess.
|
|
|
|
|
*
|
|
|
|
|
* elaborate handles module parameter mismatches,
|
|
|
|
|
* missing or incorrect lvalues for procedural
|
|
|
|
|
* assignment, and errors are propogated to the
|
|
|
|
|
* top of the elaboration call tree.
|
|
|
|
|
*
|
|
|
|
|
* Attach line numbers to processes, gates and
|
|
|
|
|
* assignment statements.
|
|
|
|
|
*
|
1998-11-11 04:13:04 +01:00
|
|
|
* Revision 1.3 1998/11/11 03:13:04 steve
|
|
|
|
|
* Handle while loops.
|
|
|
|
|
*
|
1998-11-07 18:05:05 +01:00
|
|
|
* 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.
|
|
|
|
|
*
|
1998-11-04 00:28:49 +01:00
|
|
|
* Revision 1.1 1998/11/03 23:28:55 steve
|
|
|
|
|
* Introduce verilog to CVS.
|
|
|
|
|
*
|
|
|
|
|
*/
|
|
|
|
|
|