2014-07-23 22:39:29 +02:00
|
|
|
#ifndef IVL_nettypes_H
|
|
|
|
|
#define IVL_nettypes_H
|
2012-03-26 02:59:05 +02:00
|
|
|
/*
|
2014-07-23 22:39:29 +02:00
|
|
|
* Copyright (c) 2012-2014 Stephen Williams (steve@icarus.com)
|
2012-03-26 02:59:05 +02: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
|
2012-08-29 03:41:23 +02:00
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
2012-03-26 02:59:05 +02:00
|
|
|
*/
|
|
|
|
|
|
2012-09-15 19:27:43 +02:00
|
|
|
# include "ivl_target.h"
|
2012-09-30 00:13:45 +02:00
|
|
|
# include <list>
|
|
|
|
|
# include <vector>
|
|
|
|
|
# include <climits>
|
|
|
|
|
# include <ostream>
|
|
|
|
|
# include <cassert>
|
|
|
|
|
|
|
|
|
|
class netrange_t;
|
2012-07-14 03:41:41 +02:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* This is a fully abstract type that is a type that can be attached
|
|
|
|
|
* to a NetNet object.
|
|
|
|
|
*/
|
2012-09-23 18:28:49 +02:00
|
|
|
class ivl_type_s {
|
2012-07-14 03:41:41 +02:00
|
|
|
public:
|
2012-09-23 18:28:49 +02:00
|
|
|
virtual ~ivl_type_s() =0;
|
2013-11-29 21:43:34 +01:00
|
|
|
virtual bool packed(void) const;
|
2012-08-06 01:28:40 +02:00
|
|
|
virtual long packed_width(void) const;
|
2012-09-30 00:13:45 +02:00
|
|
|
virtual std::vector<netrange_t> slice_dimensions() const;
|
2012-09-15 19:27:43 +02:00
|
|
|
|
2013-09-29 03:31:22 +02:00
|
|
|
// Some types have a base variable type. This is the bit type
|
|
|
|
|
// for packed data types, or IVL_VT_DARRAY or IVL_VT_CLASS for
|
|
|
|
|
// those specific types.
|
2012-09-15 19:27:43 +02:00
|
|
|
virtual ivl_variable_type_t base_type() const;
|
2012-09-16 02:16:05 +02:00
|
|
|
virtual bool get_signed() const;
|
|
|
|
|
|
2013-09-29 23:48:42 +02:00
|
|
|
// Return true if "that" type is compatible with this
|
2014-01-31 01:16:19 +01:00
|
|
|
// type. Compatible means the types are essentially the same.
|
2013-09-29 23:48:42 +02:00
|
|
|
bool type_compatible(ivl_type_t that) const;
|
|
|
|
|
|
2012-09-16 02:16:05 +02:00
|
|
|
virtual std::ostream& debug_dump(std::ostream&) const;
|
2013-09-29 23:48:42 +02:00
|
|
|
|
|
|
|
|
private:
|
2014-01-31 01:16:19 +01:00
|
|
|
// The "type_compatible" method uses this virtual method to
|
2013-09-29 23:48:42 +02:00
|
|
|
// invoke type-specific tests of compatibility. This should
|
|
|
|
|
// only be called by the type_compatible method above.
|
|
|
|
|
virtual bool test_compatibility(ivl_type_t that) const;
|
2012-07-14 03:41:41 +02:00
|
|
|
};
|
2012-03-26 02:59:05 +02:00
|
|
|
|
2012-09-30 19:34:09 +02:00
|
|
|
/*
|
|
|
|
|
* There are a couple types of array types. This class represents the
|
|
|
|
|
* common bits of array types.
|
|
|
|
|
*/
|
|
|
|
|
class netarray_t : public ivl_type_s {
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
inline explicit netarray_t(ivl_type_t etype) : element_type_(etype) { }
|
|
|
|
|
~netarray_t();
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
// Some virtual methods have a common implementation for arrays.
|
|
|
|
|
ivl_variable_type_t base_type() const;
|
|
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
inline ivl_type_t element_type() const { return element_type_; }
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
ivl_type_t element_type_;
|
|
|
|
|
};
|
|
|
|
|
|
2012-09-23 18:28:49 +02:00
|
|
|
inline static std::ostream& operator << (std::ostream&out, const ivl_type_s&obj)
|
2012-09-16 02:16:05 +02:00
|
|
|
{
|
|
|
|
|
return obj.debug_dump(out);
|
|
|
|
|
}
|
|
|
|
|
|
2012-03-26 02:59:05 +02:00
|
|
|
class netrange_t {
|
|
|
|
|
|
|
|
|
|
public:
|
2012-07-14 03:41:41 +02:00
|
|
|
// Create an undefined range. An undefined range is a range
|
|
|
|
|
// used to declare dynamic arrays, etc.
|
|
|
|
|
inline netrange_t() : msb_(LONG_MAX), lsb_(LONG_MAX) { }
|
|
|
|
|
// Create a properly defined netrange
|
|
|
|
|
inline netrange_t(long m, long l) : msb_(m), lsb_(l) { }
|
|
|
|
|
// Copy constructure.
|
2012-03-26 02:59:05 +02:00
|
|
|
inline netrange_t(const netrange_t&that)
|
2012-07-14 03:41:41 +02:00
|
|
|
: msb_(that.msb_), lsb_(that.lsb_) { }
|
2012-03-26 02:59:05 +02:00
|
|
|
|
|
|
|
|
inline netrange_t& operator = (const netrange_t&that)
|
2012-07-14 03:41:41 +02:00
|
|
|
{ msb_ = that.msb_; lsb_ = that.lsb_; return *this; }
|
2012-03-26 02:59:05 +02:00
|
|
|
|
2012-07-14 03:41:41 +02:00
|
|
|
inline bool defined() const
|
2012-08-08 21:21:24 +02:00
|
|
|
{ return msb_!=LONG_MAX || lsb_!= LONG_MAX; }
|
2012-03-26 02:59:05 +02:00
|
|
|
|
|
|
|
|
inline unsigned long width()const
|
2012-07-14 03:41:41 +02:00
|
|
|
{ if (!defined()) return 0;
|
|
|
|
|
else if (msb_ >= lsb_) return msb_-lsb_+1;
|
|
|
|
|
else return lsb_-msb_+1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
inline long get_msb() const { assert(defined()); return msb_; }
|
|
|
|
|
inline long get_lsb() const { assert(defined()); return lsb_; }
|
|
|
|
|
|
2013-09-29 23:48:42 +02:00
|
|
|
inline bool operator == (const netrange_t&that) const
|
|
|
|
|
{ if (msb_ != that.msb_) return false;
|
|
|
|
|
if (lsb_ != that.lsb_) return false;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
inline bool operator != (const netrange_t&that) const
|
|
|
|
|
{ if (msb_ != that.msb_) return true;
|
|
|
|
|
if (lsb_ != that.lsb_) return true;
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2012-07-14 03:41:41 +02:00
|
|
|
private:
|
|
|
|
|
long msb_;
|
|
|
|
|
long lsb_;
|
2012-03-26 02:59:05 +02:00
|
|
|
};
|
|
|
|
|
|
2012-09-30 00:13:45 +02:00
|
|
|
extern std::ostream&operator << (std::ostream&out, const std::list<netrange_t>&rlist);
|
|
|
|
|
extern std::ostream&operator << (std::ostream&out, const std::vector<netrange_t>&rlist);
|
|
|
|
|
|
|
|
|
|
extern unsigned long netrange_width(const std::vector<netrange_t>&dims);
|
2012-03-26 02:59:05 +02:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Take as input a list of packed dimensions and a list of prefix
|
|
|
|
|
* indices, and calculate the offset/width of the resulting slice into
|
|
|
|
|
* the packed array.
|
|
|
|
|
*/
|
2012-09-30 00:13:45 +02:00
|
|
|
extern bool prefix_to_slice(const std::vector<netrange_t>&dims,
|
2012-03-26 02:59:05 +02:00
|
|
|
const std::list<long>&prefix, long sb,
|
|
|
|
|
long&loff, unsigned long&lwid);
|
|
|
|
|
|
2014-07-23 22:39:29 +02:00
|
|
|
#endif /* IVL_nettypes_H */
|