1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/*
* Copyright (c) 2010-2024 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
# include "netenum.h"
# include "compiler.h"
# include <cassert>
using namespace std;
netenum_t::netenum_t(ivl_type_t btype, size_t name_count, bool integer_flag)
: base_type_(btype), integer_flag_(integer_flag), names_(name_count),
bits_(name_count)
{
}
netenum_t::~netenum_t()
{
}
bool netenum_t::get_signed() const
{
return base_type_->get_signed();
}
bool netenum_t::get_isint() const
{
return integer_flag_;
}
/*
* Enumerations are by definition always packed.
*/
bool netenum_t::packed() const
{
return true;
}
long netenum_t::packed_width() const
{
return base_type_->packed_width();
}
netranges_t netenum_t::slice_dimensions() const
{
return base_type_->slice_dimensions();
}
bool netenum_t::insert_name(size_t name_idx, perm_string name, const verinum&val)
{
std::pair<std::map<perm_string,verinum>::iterator, bool> res;
assert(val.has_len() && packed_width() >= 0 &&
val.len() == (unsigned long)packed_width());
// Insert a map of the name to the value. This also gets a
// flag that returns true if the name is unique, or false
// otherwise.
res = names_map_.insert( make_pair(name,val) );
assert(name_idx < names_.size() && names_[name_idx] == 0);
names_[name_idx] = name;
return res.second;
}
void netenum_t::insert_name_close(void)
{
for (size_t idx = 0 ; idx < names_.size() ; idx += 1) {
// If we failed to elaborate the name then skip this step.
if (names_[idx].nil()) continue;
netenum_t::iterator cur = names_map_.find(names_[idx]);
vector<char>str (cur->second.len() + 1);
for (unsigned bit = 0 ; bit < cur->second.len() ; bit += 1) {
switch (cur->second.get(bit)) {
case verinum::V0:
str[bit] = '0';
break;
case verinum::V1:
str[bit] = '1';
break;
case verinum::Vx:
str[bit] = 'x';
break;
case verinum::Vz:
str[bit] = 'z';
break;
}
}
bits_[idx] = bits_strings.make(&str[0]);
}
}
netenum_t::iterator netenum_t::find_name(perm_string name) const
{
return names_map_.find(name);
}
/*
* Check to see if the given value is already in the enumeration mapping.
*/
perm_string netenum_t::find_value(const verinum&val) const
{
perm_string res;
for(netenum_t::iterator cur = names_map_.begin();
cur != names_map_.end(); ++ cur) {
if (cur->second == val) {
res = cur->first;
break;
}
}
return res;
}
netenum_t::iterator netenum_t::end_name() const
{
return names_map_.end();
}
netenum_t::iterator netenum_t::first_name() const
{
return names_map_.find(names_.front());
}
netenum_t::iterator netenum_t::last_name() const
{
return names_map_.find(names_.back());
}
perm_string netenum_t::name_at(size_t idx) const
{
assert(idx < names_.size());
return names_[idx];
}
perm_string netenum_t::bits_at(size_t idx) const
{
return bits_[idx];
}
bool netenum_t::matches(const netenum_t*other) const
{
return this == other;
}
|
