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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
|
/* valaarraycreationexpression.vala
*
* Copyright (C) 2006-2010 Jürg Billeter
* Copyright (C) 2006-2008 Raffaele Sandrini
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* This library 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
* Lesser General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author:
* Raffaele Sandrini <raffaele@sandrini.ch>
* Jürg Billeter <j@bitron.ch>
*/
using GLib;
/**
* Represents an array creation expression.
*
* {{{ new int[] { 1, 2, 3 } }}}
*/
public class Vala.ArrayCreationExpression : Expression {
/**
* The type of the elements of the array.
*/
public DataType element_type {
get { return _element_type; }
private set {
_element_type = value;
_element_type.parent_node = this;
}
}
/**
* The length type.
*/
public DataType? length_type {
get { return _length_type; }
set {
_length_type = value;
if (_length_type != null) {
_length_type.parent_node = this;
}
}
}
/**
* The rank of the array.
*/
public int rank { get; private set; }
/**
* The size for each dimension ascending from left to right.
*/
private List<Expression> sizes = new ArrayList<Expression> ();
/**
* The root array initializer list.
*/
public InitializerList? initializer_list {
get { return _initializer_list; }
private set {
_initializer_list = value;
if (_initializer_list != null) {
_initializer_list.parent_node = this;
}
}
}
private DataType _element_type;
private DataType _length_type;
private InitializerList? _initializer_list;
/**
* Add a size expression.
*/
public void append_size (Expression size) {
sizes.add (size);
if (size != null) {
size.parent_node = this;
}
}
/**
* Get the sizes for all dimensions ascending from left to right.
*/
public unowned List<Expression> get_sizes () {
return sizes;
}
public ArrayCreationExpression (DataType element_type, int rank, InitializerList? initializer_list, SourceReference? source_reference = null) {
this.element_type = element_type;
this.rank = rank;
this.initializer_list = initializer_list;
this.source_reference = source_reference;
}
public override void accept_children (CodeVisitor visitor) {
if (element_type != null) {
element_type.accept (visitor);
}
if (length_type != null) {
length_type.accept (visitor);
}
foreach (Expression e in sizes) {
e.accept (visitor);
}
if (initializer_list != null) {
initializer_list.accept (visitor);
}
}
public override void accept (CodeVisitor visitor) {
visitor.visit_array_creation_expression (this);
visitor.visit_expression (this);
}
public override bool is_pure () {
return false;
}
public override bool is_accessible (Symbol sym) {
if (element_type != null && !element_type.is_accessible (sym)) {
return false;
}
if (length_type != null && !length_type.is_accessible (sym)) {
return false;
}
foreach (Expression e in sizes) {
if (!e.is_accessible (sym)) {
return false;
}
}
if (initializer_list != null) {
return initializer_list.is_accessible (sym);
}
return true;
}
public override string to_string () {
var builder = new StringBuilder ("new ");
builder.append_printf ("%s[", element_type.to_string ());
bool first = true;
foreach (var size in sizes) {
if (first) {
builder.append (size.to_string ());
first = false;
} else {
builder.append_printf (", %s", size.to_string ());
}
}
builder.append_c (']');
if (initializer_list != null) {
builder.append (initializer_list.to_string ());
}
return builder.str;
}
public override void replace_expression (Expression old_node, Expression new_node) {
for (int i = 0; i < sizes.size; i++) {
if (sizes[i] == old_node) {
sizes[i] = new_node;
new_node.parent_node = this;
return;
}
}
}
public override void replace_type (DataType old_type, DataType new_type) {
if (element_type == old_type) {
element_type = new_type;
}
if (length_type == old_type) {
length_type = new_type;
}
}
private int create_sizes_from_initializer_list (CodeContext context, InitializerList il, int rank, List<Literal> sl) {
if (sl.size == (this.rank - rank)) {
// only add size if this is the first initializer list of the current dimension
var init = new IntegerLiteral (il.size.to_string (), il.source_reference);
init.check (context);
sl.add (init);
}
int subsize = -1;
foreach (Expression e in il.get_initializers ()) {
if (e is InitializerList && e.target_type is ArrayType) {
if (rank == 1) {
il.error = true;
e.error = true;
Report.error (e.source_reference, "Expected array element, got array initializer list");
return -1;
}
int size = create_sizes_from_initializer_list (context, (InitializerList) e, rank - 1, sl);
if (size == -1) {
return -1;
}
if (subsize >= 0 && subsize != size) {
il.error = true;
Report.error (il.source_reference, "Expected initializer list of size %d, got size %d", subsize, size);
return -1;
} else {
subsize = size;
}
} else {
if (rank != 1) {
il.error = true;
e.error = true;
Report.error (e.source_reference, "Expected array initializer list, got array element");
return -1;
}
}
}
return il.size;
}
public override bool check (CodeContext context) {
if (checked) {
return !error;
}
checked = true;
List<Expression> sizes = get_sizes ();
var initlist = initializer_list;
if (element_type != null) {
element_type.check (context);
// check whether there is the expected amount of type-arguments
if (!element_type.check_type_arguments (context, true)) {
error = true;
return false;
}
}
if (length_type == null) {
// Make sure that "int" is still picked up as default
length_type = context.analyzer.int_type.copy ();
} else {
length_type.check (context);
if (!(length_type is IntegerType) || length_type.nullable) {
error = true;
Report.error (length_type.source_reference, "Expected integer type as length type of array");
}
}
foreach (Expression e in sizes) {
e.check (context);
}
var calc_sizes = new ArrayList<Literal> ();
if (initlist != null) {
initlist.target_type = new ArrayType (element_type, rank, source_reference);
((ArrayType) initlist.target_type).length_type = length_type.copy ();
if (!initlist.check (context)) {
error = true;
}
var ret = create_sizes_from_initializer_list (context, initlist, rank, calc_sizes);
if (ret == -1) {
error = true;
}
if (calc_sizes.size != rank) {
error = true;
var actual_type = new ArrayType (element_type, calc_sizes.size, source_reference);
((ArrayType) actual_type).length_type = length_type;
Report.error (initlist.source_reference, "Expected initializer for `%s' but got `%s'", target_type.to_string (), actual_type.to_string ());
}
}
if (sizes.size > 0) {
/* check for errors in the size list */
foreach (Expression e in sizes) {
if (e.value_type == null) {
/* return on previous error */
return false;
} else if (!(e.value_type is IntegerType || e.value_type is EnumValueType)) {
error = true;
Report.error (e.source_reference, "Expression of integer type expected");
}
}
} else {
if (initlist == null) {
error = true;
/* this is an internal error because it is already handled by the parser */
Report.error (source_reference, "internal error: initializer list expected");
} else {
foreach (Expression size in calc_sizes) {
append_size (size);
}
}
}
if (error) {
return false;
}
/* check for wrong elements inside the initializer */
if (initializer_list != null && initializer_list.value_type == null) {
return false;
}
/* try to construct the type of the array */
if (element_type == null) {
error = true;
Report.error (source_reference, "Cannot determine the element type of the created array");
return false;
}
value_type = new ArrayType (element_type, rank, source_reference);
((ArrayType) value_type).length_type = length_type.copy ();
if (formal_target_type is ArrayType) {
((ArrayType) value_type).fixed_length = ((ArrayType) formal_target_type).fixed_length;
((ArrayType) value_type).inline_allocated = ((ArrayType) formal_target_type).inline_allocated;
}
value_type.value_owned = true;
if (!value_type.check (context)) {
return false;
}
return !error;
}
public override void emit (CodeGenerator codegen) {
foreach (Expression e in sizes) {
e.emit (codegen);
}
if (initializer_list != null) {
initializer_list.emit (codegen);
}
codegen.visit_array_creation_expression (this);
codegen.visit_expression (this);
}
public override void get_used_variables (Collection<Variable> collection) {
foreach (Expression e in sizes) {
e.get_used_variables (collection);
}
if (initializer_list != null) {
initializer_list.get_used_variables (collection);
}
}
}
|