/
containers.v
472 lines (461 loc) · 15.4 KB
/
containers.v
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
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
// Copyright (c) 2019-2023 Alexander Medvednikov. All rights reserved.
// Use of this source code is governed by an MIT license that can be found in the LICENSE file.
module checker
import v.ast
import v.token
fn (mut c Checker) array_init(mut node ast.ArrayInit) ast.Type {
mut elem_type := ast.void_type
// `x := []string{}` (the type was set in the parser)
if node.typ != ast.void_type {
if node.elem_type != 0 {
elem_sym := c.table.sym(node.elem_type)
if node.typ.has_flag(.option) && (node.has_cap || node.has_len) {
c.error('Option array `${elem_sym.name}` cannot have initializers', node.pos)
}
if elem_sym.kind == .struct_ {
elem_info := elem_sym.info as ast.Struct
if elem_info.generic_types.len > 0 && elem_info.concrete_types.len == 0
&& !node.elem_type.has_flag(.generic) {
if c.table.cur_concrete_types.len == 0 {
c.error('generic struct `${elem_sym.name}` must specify type parameter, e.g. ${elem_sym.name}[int]',
node.elem_type_pos)
} else {
c.error('generic struct `${elem_sym.name}` must specify type parameter, e.g. ${elem_sym.name}[T]',
node.elem_type_pos)
}
}
} else if elem_sym.kind == .interface_ {
elem_info := elem_sym.info as ast.Interface
if elem_info.generic_types.len > 0 && elem_info.concrete_types.len == 0
&& !node.elem_type.has_flag(.generic) {
if c.table.cur_concrete_types.len == 0 {
c.error('generic interface `${elem_sym.name}` must specify type parameter, e.g. ${elem_sym.name}[int]',
node.elem_type_pos)
} else {
c.error('generic interface `${elem_sym.name}` must specify type parameter, e.g. ${elem_sym.name}[T]',
node.elem_type_pos)
}
}
} else if elem_sym.kind == .sum_type {
elem_info := elem_sym.info as ast.SumType
if elem_info.generic_types.len > 0 && elem_info.concrete_types.len == 0
&& !node.elem_type.has_flag(.generic) {
if c.table.cur_concrete_types.len == 0 {
c.error('generic sumtype `${elem_sym.name}` must specify type parameter, e.g. ${elem_sym.name}[int]',
node.elem_type_pos)
} else {
c.error('generic sumtype `${elem_sym.name}` must specify type parameter, e.g. ${elem_sym.name}[T]',
node.elem_type_pos)
}
}
}
}
if node.exprs.len == 0 {
if node.has_cap {
c.check_array_init_para_type('cap', mut node.cap_expr, node.pos)
}
if node.has_len {
c.check_array_init_para_type('len', mut node.len_expr, node.pos)
}
}
if node.has_default {
mut default_expr := node.default_expr
default_typ := c.check_expr_opt_call(default_expr, c.expr(mut default_expr))
node.default_type = default_typ
if !node.elem_type.has_flag(.option) && default_typ.has_flag(.option) {
c.error('cannot use unwrapped Option as initializer', default_expr.pos())
}
c.check_expected(default_typ, node.elem_type) or {
c.error(err.msg(), default_expr.pos())
}
}
if node.has_len {
len_typ := c.check_expr_opt_call(node.len_expr, c.expr(mut node.len_expr))
if len_typ.has_flag(.option) {
c.error('cannot use unwrapped Option as length', node.len_expr.pos())
}
if node.has_len && !node.has_default {
elem_type_sym := c.table.sym(node.elem_type)
if elem_type_sym.kind == .interface_ {
c.error('cannot instantiate an array of interfaces without also giving a default `init:` value',
node.len_expr.pos())
}
}
c.ensure_sumtype_array_has_default_value(node)
}
if node.has_cap {
cap_typ := c.check_expr_opt_call(node.cap_expr, c.expr(mut node.cap_expr))
if cap_typ.has_flag(.option) {
c.error('cannot use unwrapped Option as capacity', node.cap_expr.pos())
}
}
c.ensure_type_exists(node.elem_type, node.elem_type_pos)
if node.typ.has_flag(.generic) && c.table.cur_fn != unsafe { nil }
&& c.table.cur_fn.generic_names.len == 0 {
c.error('generic struct cannot be used in non-generic function', node.pos)
}
// `&int{}` check
if node.elem_type.is_any_kind_of_pointer() && !c.inside_unsafe && node.has_len {
c.warn('arrays of references need to be initialized right away, therefore `len:` cannot be used (unless inside `unsafe`)',
node.pos)
}
return node.typ
}
if node.is_fixed {
c.ensure_sumtype_array_has_default_value(node)
c.ensure_type_exists(node.elem_type, node.elem_type_pos)
if node.elem_type.is_any_kind_of_pointer() && !c.inside_unsafe && !c.is_builtin_mod {
c.warn('fixed arrays of references need to be initialized right away (unless inside `unsafe`)',
node.pos)
}
}
// `a = []`
if node.exprs.len == 0 {
// `a := fn_returning_opt_array() or { [] }`
if c.expected_type == ast.void_type && c.expected_or_type != ast.void_type {
c.expected_type = c.expected_or_type
}
mut type_sym := c.table.sym(c.expected_type)
if type_sym.kind != .array || type_sym.array_info().elem_type == ast.void_type {
c.error('array_init: no type specified (maybe: `[]Type{}` instead of `[]`)',
node.pos)
return ast.void_type
}
array_info := type_sym.array_info()
node.elem_type = array_info.elem_type
// clear option flag in case of: `fn opt_arr() ?[]int { return [] }`
return if c.expected_type.has_flag(.shared_f) {
c.expected_type.clear_flag(.shared_f).deref()
} else {
c.expected_type
}.clear_flags(.option, .result)
}
// `[1,2,3]`
if node.exprs.len > 0 && node.elem_type == ast.void_type {
mut expected_value_type := ast.void_type
mut expecting_interface_array := false
mut expecting_sumtype_array := false
mut is_first_elem_ptr := false
if c.expected_type != 0 {
expected_value_type = c.table.value_type(c.expected_type)
expected_value_sym := c.table.sym(expected_value_type)
if expected_value_sym.kind == .interface_ {
// array of interfaces? (`[dog, cat]`) Save the interface type (`Animal`)
expecting_interface_array = true
} else if expected_value_sym.kind == .sum_type {
expecting_sumtype_array = true
}
}
for i, mut expr in node.exprs {
typ := c.check_expr_opt_call(expr, c.expr(mut expr))
if typ == ast.void_type {
c.error('invalid void array element type', expr.pos())
}
node.expr_types << typ
// the first element's type
if expecting_interface_array {
if i == 0 {
elem_type = expected_value_type
c.expected_type = elem_type
c.type_implements(typ, elem_type, expr.pos())
}
if !typ.is_any_kind_of_pointer() && !c.inside_unsafe {
typ_sym := c.table.sym(typ)
if typ_sym.kind != .interface_ {
c.mark_as_referenced(mut &expr, true)
}
}
continue
} else if expecting_sumtype_array {
if i == 0 {
if c.table.is_sumtype_or_in_variant(expected_value_type, ast.mktyp(typ)) {
elem_type = expected_value_type
} else {
if expr.is_auto_deref_var() {
elem_type = ast.mktyp(typ.deref())
} else {
elem_type = ast.mktyp(typ)
}
}
c.expected_type = elem_type
}
continue
}
// the first element's type
if i == 0 {
if expr.is_auto_deref_var() {
elem_type = ast.mktyp(typ.deref())
} else {
elem_type = ast.mktyp(typ)
}
if typ.is_ptr() && c.in_for_count == 0 {
is_first_elem_ptr = true
}
c.expected_type = elem_type
continue
} else {
if !typ.is_any_kind_of_pointer() && !typ.is_int() && is_first_elem_ptr {
c.error('cannot have non-pointer of type `${c.table.type_to_str(typ)}` in a pointer array of type `${c.table.type_to_str(elem_type)}`',
expr.pos())
}
}
if expr !is ast.TypeNode {
if c.table.type_kind(elem_type) == .interface_ {
if c.type_implements(typ, elem_type, expr.pos()) {
continue
}
}
c.check_expected(typ, elem_type) or {
c.error('invalid array element: ${err.msg()}', expr.pos())
}
}
}
if node.is_fixed {
idx := c.table.find_or_register_array_fixed(elem_type, node.exprs.len, ast.empty_expr,
false)
if elem_type.has_flag(.generic) {
node.typ = ast.new_type(idx).set_flag(.generic)
} else {
node.typ = ast.new_type(idx)
}
} else {
idx := c.table.find_or_register_array(elem_type)
if elem_type.has_flag(.generic) {
node.typ = ast.new_type(idx).set_flag(.generic)
} else {
node.typ = ast.new_type(idx)
}
}
node.elem_type = elem_type
} else if node.is_fixed && node.exprs.len == 1 && node.elem_type != ast.void_type {
// `[50]u8`
mut fixed_size := i64(0)
mut init_expr := node.exprs[0]
c.expr(mut init_expr)
match mut init_expr {
ast.IntegerLiteral {
fixed_size = init_expr.val.int()
}
ast.CastExpr {
if !init_expr.typ.is_pure_int() {
c.error('only integer types are allowed', init_expr.pos)
}
match mut init_expr.expr {
ast.IntegerLiteral {
fixed_size = init_expr.expr.val.int()
}
ast.EnumVal {
if val := c.table.find_enum_field_val(init_expr.expr.enum_name,
init_expr.expr.val)
{
fixed_size = val
}
}
else {}
}
}
ast.EnumVal {
c.error('${init_expr.enum_name}.${init_expr.val} has to be casted to integer to be used as size',
init_expr.pos)
}
ast.Ident {
if mut init_expr.obj is ast.ConstField {
if mut init_expr.obj.expr is ast.EnumVal {
c.error('${init_expr.obj.expr.enum_name}.${init_expr.obj.expr.val} has to be casted to integer to be used as size',
init_expr.pos)
}
if mut init_expr.obj.expr is ast.CastExpr {
if !init_expr.obj.expr.typ.is_pure_int() {
c.error('only integer types are allowed', init_expr.pos)
}
}
if comptime_value := c.eval_comptime_const_expr(init_expr.obj.expr,
0)
{
fixed_size = comptime_value.i64() or { fixed_size }
}
} else {
c.error('non-constant array bound `${init_expr.name}`', init_expr.pos)
}
}
ast.InfixExpr {
if comptime_value := c.eval_comptime_const_expr(init_expr, 0) {
fixed_size = comptime_value.i64() or { fixed_size }
}
}
else {
c.error('fixed array size cannot use non-constant value', init_expr.pos())
}
}
if fixed_size <= 0 {
c.error('fixed size cannot be zero or negative (fixed_size: ${fixed_size})',
init_expr.pos())
}
idx := c.table.find_or_register_array_fixed(node.elem_type, int(fixed_size), init_expr,
false)
if node.elem_type.has_flag(.generic) {
node.typ = ast.new_type(idx).set_flag(.generic)
} else {
node.typ = ast.new_type(idx)
}
if node.has_default {
node.default_type = c.expr(mut node.default_expr)
}
}
return node.typ
}
fn (mut c Checker) check_array_init_para_type(para string, mut expr ast.Expr, pos token.Pos) {
sym := c.table.sym(c.unwrap_generic(c.expr(mut expr)))
if sym.kind !in [.int, .int_literal] {
c.error('array ${para} needs to be an int', pos)
}
}
fn (mut c Checker) ensure_sumtype_array_has_default_value(node ast.ArrayInit) {
sym := c.table.sym(node.elem_type)
if sym.kind == .sum_type && !node.has_default {
c.error('cannot initialize sum type array without default value', node.pos)
}
}
fn (mut c Checker) map_init(mut node ast.MapInit) ast.Type {
// `map = {}`
if node.keys.len == 0 && node.vals.len == 0 && node.typ == 0 {
sym := c.table.sym(c.expected_type)
if sym.kind == .map {
info := sym.map_info()
node.typ = c.expected_type.clear_flags(.option, .result)
node.key_type = info.key_type
node.value_type = info.value_type
return node.typ
} else {
if sym.kind == .struct_ {
c.error('`{}` can not be used for initialising empty structs any more. Use `${c.table.type_to_str(c.expected_type)}{}` instead.',
node.pos)
} else {
c.error('invalid empty map initialisation syntax, use e.g. map[string]int{} instead',
node.pos)
}
return ast.void_type
}
}
// `x := map[string]string` - set in parser
if node.typ != 0 {
info := c.table.sym(node.typ).map_info()
if info.value_type != 0 {
if info.value_type.has_flag(.result) {
c.error('cannot use Result type as map value type', node.pos)
}
val_sym := c.table.sym(info.value_type)
if val_sym.kind == .struct_ {
val_info := val_sym.info as ast.Struct
if val_info.generic_types.len > 0 && val_info.concrete_types.len == 0
&& !info.value_type.has_flag(.generic) {
if c.table.cur_concrete_types.len == 0 {
c.error('generic struct `${val_sym.name}` must specify type parameter, e.g. ${val_sym.name}[int]',
node.pos)
} else {
c.error('generic struct `${val_sym.name}` must specify type parameter, e.g. ${val_sym.name}[T]',
node.pos)
}
}
}
}
c.ensure_type_exists(info.key_type, node.pos)
c.ensure_type_exists(info.value_type, node.pos)
node.key_type = info.key_type
node.value_type = info.value_type
return node.typ
}
if node.keys.len > 0 && node.vals.len > 0 {
mut key0_type := ast.void_type
mut val0_type := ast.void_type
use_expected_type := c.expected_type != ast.void_type && !c.inside_const
&& c.table.sym(c.expected_type).kind == .map && !(c.inside_fn_arg
&& c.expected_type.has_flag(.generic))
if use_expected_type {
sym := c.table.sym(c.expected_type)
info := sym.map_info()
key0_type = c.unwrap_generic(info.key_type)
val0_type = c.unwrap_generic(info.value_type)
} else {
// `{'age': 20}`
mut key_ := node.keys[0]
key0_type = ast.mktyp(c.expr(mut key_))
if node.keys[0].is_auto_deref_var() {
key0_type = key0_type.deref()
}
mut val_ := node.vals[0]
val0_type = ast.mktyp(c.expr(mut val_))
if node.vals[0].is_auto_deref_var() {
val0_type = val0_type.deref()
}
node.val_types << val0_type
}
key0_type = c.unwrap_generic(key0_type)
val0_type = c.unwrap_generic(val0_type)
map_type := ast.new_type(c.table.find_or_register_map(key0_type, val0_type))
node.typ = map_type
node.key_type = key0_type
node.value_type = val0_type
map_value_sym := c.table.sym(node.value_type)
expecting_interface_map := map_value_sym.kind == .interface_
//
mut same_key_type := true
if node.keys.len == 1 && val0_type == ast.none_type {
c.error('map value cannot be only `none`', node.vals[0].pos())
}
for i, mut key in node.keys {
if i == 0 && !use_expected_type {
continue
}
mut val := node.vals[i]
c.expected_type = key0_type
key_type := c.expr(mut key)
c.expected_type = val0_type
val_type := c.expr(mut val)
node.val_types << val_type
val_type_sym := c.table.sym(val_type)
if !c.check_types(key_type, key0_type) || (i == 0 && key_type.is_number()
&& key0_type.is_number() && key0_type != ast.mktyp(key_type)) {
msg := c.expected_msg(key_type, key0_type)
c.error('invalid map key: ${msg}', key.pos())
same_key_type = false
}
if expecting_interface_map {
if val_type == node.value_type {
continue
}
if val_type_sym.kind == .struct_
&& c.type_implements(val_type, node.value_type, val.pos()) {
node.vals[i] = ast.CastExpr{
expr: val
typname: c.table.get_type_name(node.value_type)
typ: node.value_type
expr_type: val_type
pos: val.pos()
}
continue
} else {
msg := c.expected_msg(val_type, node.value_type)
c.error('invalid map value: ${msg}', val.pos())
}
}
if val_type == ast.none_type && val0_type.has_flag(.option) {
continue
}
if !c.check_types(val_type, val0_type)
|| val0_type.has_flag(.option) != val_type.has_flag(.option)
|| (i == 0 && val_type.is_number() && val0_type.is_number()
&& val0_type != ast.mktyp(val_type)) {
msg := c.expected_msg(val_type, val0_type)
c.error('invalid map value: ${msg}', val.pos())
}
}
if same_key_type {
for i in 1 .. node.keys.len {
c.check_dup_keys(node, i)
}
}
return map_type
}
return node.typ
}