162 lines
4.4 KiB
C++
162 lines
4.4 KiB
C++
#ifndef __PExpr_H
|
|
#define __PExpr_H
|
|
/*
|
|
* 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: PExpr.h,v 1.3 1998/11/09 18:55:33 steve Exp $"
|
|
#endif
|
|
|
|
# include <string>
|
|
# include "verinum.h"
|
|
|
|
class Design;
|
|
class NetNet;
|
|
class NetExpr;
|
|
|
|
/*
|
|
* The PExpr class hierarchy supports the description of
|
|
* expressions. The parser can generate expression objects from the
|
|
* source, possibly reducing things that it knows how to reduce.
|
|
*
|
|
* The elaborate_net method is used by structural elaboration to build
|
|
* up a netlist interpretation of the expression.
|
|
*/
|
|
|
|
class PExpr {
|
|
public:
|
|
virtual ~PExpr();
|
|
|
|
virtual void dump(ostream&) const;
|
|
virtual NetNet* elaborate_net(Design*des, const string&path) const;
|
|
virtual NetExpr*elaborate_expr(Design*des, const string&path) const;
|
|
|
|
// This attempts to evaluate a constant expression, and return
|
|
// a verinum as a result. If the expression cannot be
|
|
// evaluated, return 0.
|
|
virtual verinum* eval_const() const;
|
|
};
|
|
|
|
ostream& operator << (ostream&, const PExpr&);
|
|
|
|
class PEIdent : public PExpr {
|
|
|
|
public:
|
|
explicit PEIdent(const string&s)
|
|
: text_(s), msb_(0), lsb_(0) { }
|
|
|
|
virtual void dump(ostream&) const;
|
|
virtual NetNet* elaborate_net(Design*des, const string&path) const;
|
|
virtual NetExpr*elaborate_expr(Design*des, const string&path) const;
|
|
|
|
|
|
private:
|
|
string text_;
|
|
|
|
public:
|
|
// Use these to support bit- and part-select operators.
|
|
PExpr*msb_;
|
|
PExpr*lsb_;
|
|
};
|
|
|
|
class PENumber : public PExpr {
|
|
|
|
public:
|
|
explicit PENumber(verinum*vp)
|
|
: value_(vp) { assert(vp); }
|
|
~PENumber() { delete value_; }
|
|
|
|
const verinum& value() const { return *value_; }
|
|
|
|
virtual void dump(ostream&) const;
|
|
virtual NetNet* elaborate_net(Design*des, const string&path) const;
|
|
virtual NetExpr*elaborate_expr(Design*des, const string&path) const;
|
|
virtual verinum* eval_const() const;
|
|
|
|
private:
|
|
verinum*const value_;
|
|
};
|
|
|
|
class PEString : public PExpr {
|
|
|
|
public:
|
|
explicit PEString(const string&s)
|
|
: text_(s) { }
|
|
|
|
string value() const { return text_; }
|
|
virtual void dump(ostream&) const;
|
|
virtual NetExpr*elaborate_expr(Design*des, const string&path) const;
|
|
|
|
private:
|
|
const string text_;
|
|
};
|
|
|
|
class PEUnary : public PExpr {
|
|
|
|
public:
|
|
explicit PEUnary(char op, PExpr*ex)
|
|
: op_(op), expr_(ex) { }
|
|
|
|
virtual void dump(ostream&out) const;
|
|
virtual NetNet* elaborate_net(Design*des, const string&path) const;
|
|
virtual NetExpr*elaborate_expr(Design*des, const string&path) const;
|
|
|
|
private:
|
|
char op_;
|
|
PExpr*expr_;
|
|
};
|
|
|
|
class PEBinary : public PExpr {
|
|
|
|
public:
|
|
explicit PEBinary(char op, PExpr*l, PExpr*r)
|
|
: op_(op), left_(l), right_(r) { }
|
|
|
|
virtual void dump(ostream&out) const;
|
|
virtual NetNet* elaborate_net(Design*des, const string&path) const;
|
|
virtual NetExpr*elaborate_expr(Design*des, const string&path) const;
|
|
|
|
private:
|
|
char op_;
|
|
PExpr*left_;
|
|
PExpr*right_;
|
|
};
|
|
|
|
/*
|
|
* $Log: PExpr.h,v $
|
|
* Revision 1.3 1998/11/09 18:55:33 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:54 steve
|
|
* Introduce verilog to CVS.
|
|
*
|
|
*/
|
|
#endif
|