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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
/* $Id$
*
* Resolve ranges of positional and named aggregates.
*
* Copyright (C) 2008-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include "frontend/visitor/ResolveAggregates.hpp"
#include <cassert>
#include "frontend/ast/Aggregate.hpp"
#include "frontend/ast/Others.hpp"
#include "frontend/ast/ConstInteger.hpp"
#include "frontend/reporting/ErrorRegistry.hpp"
namespace ast {
ResolveAggregates::ResolveAggregates(
const DiscreteRange &arrayRange
) :
haveOthers(false),
named(false),
positional(false),
othersErrorReported(false),
currentRange(NULL),
sequencer(arrayRange)
{
}
ResolveAggregates::~ResolveAggregates()
{
}
void
ResolveAggregates::visit(Aggregate &node)
{
assert(node.associations != NULL);
this->haveOthers = false;
this->named = false;
this->positional = false;
for (std::list<ElementAssociation*>::iterator i =
node.associations->begin();
i != node.associations->end();
i++) {
(*i)->accept(*this);
}
if (this->named && this->positional) {
CompileError *ce =
new CompileError(node,
"Mixing named with positional association.");
ErrorRegistry::addError(ce);
return;
}
if (! this->sequencer.rs.empty()) {
std::string s =
std::string("Indices not covered by aggregate: ");
s += util::MiscUtil::toString(this->sequencer.rs);
CompileError *ce = new CompileError(node, s);
ErrorRegistry::addError(ce);
}
}
void
ResolveAggregates::visit(ElementAssociation &node)
{
if (this->haveOthers) {
// element after an "others" element not allowed.
if (! this->othersErrorReported) {
this->othersErrorReported = true;
CompileError *ce =
new CompileError(node,
"Associaion after Others.");
ErrorRegistry::addError(ce);
}
return;
}
if (node.choices == NULL) {
// positional association
this->positional = true;
if (this->sequencer.rs.empty()) {
CompileError *ce =
new CompileError(node,
"Index out of range.");
ErrorRegistry::addError(ce);
return;
}
universal_integer val = this->sequencer.getNext();
node.range = new RangeSet(val, val);
return;
}
// node.choices != NULL: either named or others
this->listTraverse(*node.choices);
if (this->haveOthers) {
if (node.choices->size() > 1) {
// others mixed with elements.
CompileError *ce =
new CompileError(node,
"Others in wrong place.");
ErrorRegistry::addError(ce);
this->currentRange = NULL;
return;
}
// only one others element. set the Range by it.
node.range = this->sequencer.getRemainder();
// all elements have been consumed by others. clear sequencer
this->sequencer.rs.clear();
return;
}
this->named = true;
node.range = this->currentRange;
this->currentRange = NULL;
}
void
ResolveAggregates::visit(Others &node)
{
if (this->haveOthers) {
CompileError *ce =
new ast::CompileError(node,
"Duplicate others choice.");
ErrorRegistry::addError(ce);
}
this->haveOthers = true;
}
void
ResolveAggregates::visit(ConstInteger &node)
{
if (this->currentRange == NULL) {
this->currentRange = new RangeSet(node.value, node.value);
} else {
this->currentRange->plus(node.value, node.value);
}
bool ret = this->sequencer.rs.minus(node.value, node.value);
if (! ret) {
CompileError *ce = new CompileError(node,
"Aggregate range doesn't fit array range.");
ErrorRegistry::addError(ce);
}
}
void
ResolveAggregates::visit(DiscreteRange &node)
{
if (this->currentRange == NULL) {
this->currentRange = new RangeSet(node);
} else {
this->currentRange->plus(node);
}
bool ret = this->sequencer.rs.minus(node);
if (! ret) {
CompileError *ce = new CompileError(node,
"Aggregate index doesn't fit array range.");
ErrorRegistry::addError(ce);
}
}
void
ResolveAggregates::process(AstNode &node)
{
CompileError *ce =
new CompileError(node,
"Aggregate range/index not locally static.");
ErrorRegistry::addError(ce);
}
/* ****************** nested class Sequencer **************** */
ResolveAggregates::Sequencer::Sequencer(
const DiscreteRange &byRange
) :
rs(byRange),
direction(byRange.direction)
{
}
universal_integer
ResolveAggregates::Sequencer::getNext(void)
{
universal_integer ret = 0;
switch (this->direction) {
case DiscreteRange::DIRECTION_UP:
ret = this->rs.getLowerBound();
break;
case DiscreteRange::DIRECTION_DOWN:
ret = this->rs.getUpperBound();
break;
}
bool b = this->rs.minus(ret, ret);
assert(b);
return ret;
}
RangeSet *
ResolveAggregates::Sequencer::getRemainder(void) const
{
return new RangeSet(this->rs);
}
}; /* namespace ast */
|
