/
typesem.d
4587 lines (4221 loc) · 152 KB
/
typesem.d
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
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* Semantic analysis for D types.
*
* Copyright: Copyright (C) 1999-2021 by The D Language Foundation, All Rights Reserved
* Authors: $(LINK2 http://www.digitalmars.com, Walter Bright)
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(LINK2 https://github.com/dlang/dmd/blob/master/src/dmd/typesem.d, _typesem.d)
* Documentation: https://dlang.org/phobos/dmd_typesem.html
* Coverage: https://codecov.io/gh/dlang/dmd/src/master/src/dmd/typesem.d
*/
module dmd.typesem;
import core.checkedint;
import core.stdc.string;
import core.stdc.stdio;
import dmd.access;
import dmd.aggregate;
import dmd.aliasthis;
import dmd.arrayop;
import dmd.arraytypes;
import dmd.astcodegen;
import dmd.complex;
import dmd.dcast;
import dmd.dclass;
import dmd.declaration;
import dmd.denum;
import dmd.dimport;
import dmd.dmangle;
import dmd.dmodule;
import dmd.dscope;
import dmd.dstruct;
import dmd.dsymbol;
import dmd.dsymbolsem;
import dmd.dtemplate;
import dmd.errors;
import dmd.expression;
import dmd.expressionsem;
import dmd.func;
import dmd.globals;
import dmd.hdrgen;
import dmd.id;
import dmd.identifier;
import dmd.imphint;
import dmd.init;
import dmd.initsem;
import dmd.visitor;
import dmd.mtype;
import dmd.objc;
import dmd.opover;
import dmd.parse;
import dmd.root.ctfloat;
import dmd.root.rmem;
import dmd.root.outbuffer;
import dmd.root.rootobject;
import dmd.root.string;
import dmd.root.stringtable;
import dmd.semantic3;
import dmd.sideeffect;
import dmd.target;
import dmd.tokens;
import dmd.typesem;
/**************************
* This evaluates exp while setting length to be the number
* of elements in the tuple t.
*/
private Expression semanticLength(Scope* sc, Type t, Expression exp)
{
if (auto tt = t.isTypeTuple())
{
ScopeDsymbol sym = new ArrayScopeSymbol(sc, tt);
sym.parent = sc.scopesym;
sc = sc.push(sym);
sc = sc.startCTFE();
exp = exp.expressionSemantic(sc);
sc = sc.endCTFE();
sc.pop();
}
else
{
sc = sc.startCTFE();
exp = exp.expressionSemantic(sc);
sc = sc.endCTFE();
}
return exp;
}
private Expression semanticLength(Scope* sc, TupleDeclaration tup, Expression exp)
{
ScopeDsymbol sym = new ArrayScopeSymbol(sc, tup);
sym.parent = sc.scopesym;
sc = sc.push(sym);
sc = sc.startCTFE();
exp = exp.expressionSemantic(sc);
sc = sc.endCTFE();
sc.pop();
return exp;
}
/*************************************
* Resolve a tuple index, `s[oindex]`, by figuring out what `s[oindex]` represents.
* Setting one of pe/pt/ps.
* Params:
* loc = location for error messages
* sc = context
* s = symbol being indexed - could be a tuple, could be an expression
* pe = set if s[oindex] is an Expression, otherwise null
* pt = set if s[oindex] is a Type, otherwise null
* ps = set if s[oindex] is a Dsymbol, otherwise null
* oindex = index into s
*/
private void resolveTupleIndex(const ref Loc loc, Scope* sc, Dsymbol s, out Expression pe, out Type pt, out Dsymbol ps, RootObject oindex)
{
auto tup = s.isTupleDeclaration();
auto eindex = isExpression(oindex);
auto tindex = isType(oindex);
auto sindex = isDsymbol(oindex);
if (!tup)
{
// It's really an index expression
if (tindex)
eindex = new TypeExp(loc, tindex);
else if (sindex)
eindex = symbolToExp(sindex, loc, sc, false);
Expression e = new IndexExp(loc, symbolToExp(s, loc, sc, false), eindex);
e = e.expressionSemantic(sc);
resolveExp(e, pt, pe, ps);
return;
}
// Convert oindex to Expression, then try to resolve to constant.
if (tindex)
tindex.resolve(loc, sc, eindex, tindex, sindex);
if (sindex)
eindex = symbolToExp(sindex, loc, sc, false);
if (!eindex)
{
.error(loc, "index `%s` is not an expression", oindex.toChars());
pt = Type.terror;
return;
}
eindex = semanticLength(sc, tup, eindex);
eindex = eindex.ctfeInterpret();
if (eindex.op == TOK.error)
{
pt = Type.terror;
return;
}
const(uinteger_t) d = eindex.toUInteger();
if (d >= tup.objects.dim)
{
.error(loc, "tuple index `%llu` exceeds length %zu", d, tup.objects.dim);
pt = Type.terror;
return;
}
RootObject o = (*tup.objects)[cast(size_t)d];
ps = isDsymbol(o);
if (auto t = isType(o))
pt = t.typeSemantic(loc, sc);
if (auto e = isExpression(o))
resolveExp(e, pt, pe, ps);
}
/*************************************
* Takes an array of Identifiers and figures out if
* it represents a Type, Expression, or Dsymbol.
* Params:
* mt = array of identifiers
* loc = location for error messages
* sc = context
* s = symbol to start search at
* scopesym = unused
* pe = set if expression otherwise null
* pt = set if type otherwise null
* ps = set if symbol otherwise null
* typeid = set if in TypeidExpression https://dlang.org/spec/expression.html#TypeidExpression
*/
private void resolveHelper(TypeQualified mt, const ref Loc loc, Scope* sc, Dsymbol s, Dsymbol scopesym,
out Expression pe, out Type pt, out Dsymbol ps, bool intypeid = false)
{
version (none)
{
printf("TypeQualified::resolveHelper(sc = %p, idents = '%s')\n", sc, mt.toChars());
if (scopesym)
printf("\tscopesym = '%s'\n", scopesym.toChars());
}
if (!s)
{
/* Look for what user might have intended
*/
const p = mt.mutableOf().unSharedOf().toChars();
auto id = Identifier.idPool(p, cast(uint)strlen(p));
if (const n = importHint(id.toString()))
error(loc, "`%s` is not defined, perhaps `import %.*s;` ?", p, cast(int)n.length, n.ptr);
else if (auto s2 = sc.search_correct(id))
error(loc, "undefined identifier `%s`, did you mean %s `%s`?", p, s2.kind(), s2.toChars());
else if (const q = Scope.search_correct_C(id))
error(loc, "undefined identifier `%s`, did you mean `%s`?", p, q);
else
error(loc, "undefined identifier `%s`", p);
pt = Type.terror;
return;
}
//printf("\t1: s = '%s' %p, kind = '%s'\n",s.toChars(), s, s.kind());
Declaration d = s.isDeclaration();
if (d && (d.storage_class & STC.templateparameter))
s = s.toAlias();
else
{
// check for deprecated or disabled aliases
s.checkDeprecated(loc, sc);
if (d)
d.checkDisabled(loc, sc, true);
}
s = s.toAlias();
//printf("\t2: s = '%s' %p, kind = '%s'\n",s.toChars(), s, s.kind());
for (size_t i = 0; i < mt.idents.dim; i++)
{
RootObject id = mt.idents[i];
if (id.dyncast() == DYNCAST.expression ||
id.dyncast() == DYNCAST.type)
{
Type tx;
Expression ex;
Dsymbol sx;
resolveTupleIndex(loc, sc, s, ex, tx, sx, id);
if (sx)
{
s = sx.toAlias();
continue;
}
if (tx)
ex = new TypeExp(loc, tx);
assert(ex);
ex = typeToExpressionHelper(mt, ex, i + 1);
ex = ex.expressionSemantic(sc);
resolveExp(ex, pt, pe, ps);
return;
}
Type t = s.getType(); // type symbol, type alias, or type tuple?
uint errorsave = global.errors;
int flags = t is null ? SearchLocalsOnly : IgnorePrivateImports;
Dsymbol sm = s.searchX(loc, sc, id, flags);
if (sm)
{
if (!(sc.flags & SCOPE.ignoresymbolvisibility) && !symbolIsVisible(sc, sm))
{
.error(loc, "`%s` is not visible from module `%s`", sm.toPrettyChars(), sc._module.toChars());
sm = null;
}
// Same check as in Expression.semanticY(DotIdExp)
else if (sm.isPackage() && checkAccess(sc, cast(Package)sm))
{
// @@@DEPRECATED_2.096@@@
// Should be an error in 2.106. Just remove the deprecation call
// and uncomment the null assignment
deprecation(loc, "%s %s is not accessible here, perhaps add 'static import %s;'", sm.kind(), sm.toPrettyChars(), sm.toPrettyChars());
//sm = null;
}
}
if (global.errors != errorsave)
{
pt = Type.terror;
return;
}
void helper3()
{
Expression e;
VarDeclaration v = s.isVarDeclaration();
FuncDeclaration f = s.isFuncDeclaration();
if (intypeid || !v && !f)
e = symbolToExp(s, loc, sc, true);
else
e = new VarExp(loc, s.isDeclaration(), true);
e = typeToExpressionHelper(mt, e, i);
e = e.expressionSemantic(sc);
resolveExp(e, pt, pe, ps);
}
//printf("\t3: s = %p %s %s, sm = %p\n", s, s.kind(), s.toChars(), sm);
if (intypeid && !t && sm && sm.needThis())
return helper3();
if (VarDeclaration v = s.isVarDeclaration())
{
// https://issues.dlang.org/show_bug.cgi?id=19913
// v.type would be null if it is a forward referenced member.
if (v.type is null)
v.dsymbolSemantic(sc);
if (v.storage_class & (STC.const_ | STC.immutable_ | STC.manifest) ||
v.type.isConst() || v.type.isImmutable())
{
// https://issues.dlang.org/show_bug.cgi?id=13087
// this.field is not constant always
if (!v.isThisDeclaration())
return helper3();
}
}
if (!sm)
{
if (!t)
{
if (s.isDeclaration()) // var, func, or tuple declaration?
{
t = s.isDeclaration().type;
if (!t && s.isTupleDeclaration()) // expression tuple?
return helper3();
}
else if (s.isTemplateInstance() ||
s.isImport() || s.isPackage() || s.isModule())
{
return helper3();
}
}
if (t)
{
sm = t.toDsymbol(sc);
if (sm && id.dyncast() == DYNCAST.identifier)
{
sm = sm.search(loc, cast(Identifier)id, IgnorePrivateImports);
if (!sm)
return helper3();
}
else
return helper3();
}
else
{
if (id.dyncast() == DYNCAST.dsymbol)
{
// searchX already handles errors for template instances
assert(global.errors);
}
else
{
assert(id.dyncast() == DYNCAST.identifier);
sm = s.search_correct(cast(Identifier)id);
if (sm)
error(loc, "identifier `%s` of `%s` is not defined, did you mean %s `%s`?", id.toChars(), mt.toChars(), sm.kind(), sm.toChars());
else
error(loc, "identifier `%s` of `%s` is not defined", id.toChars(), mt.toChars());
}
pe = ErrorExp.get();
return;
}
}
s = sm.toAlias();
}
if (auto em = s.isEnumMember())
{
// It's not a type, it's an expression
pe = em.getVarExp(loc, sc);
return;
}
if (auto v = s.isVarDeclaration())
{
/* This is mostly same with DsymbolExp::semantic(), but we cannot use it
* because some variables used in type context need to prevent lowering
* to a literal or contextful expression. For example:
*
* enum a = 1; alias b = a;
* template X(alias e){ alias v = e; } alias x = X!(1);
* struct S { int v; alias w = v; }
* // TypeIdentifier 'a', 'e', and 'v' should be TOK.variable,
* // because getDsymbol() need to work in AliasDeclaration::semantic().
*/
if (!v.type ||
!v.type.deco && v.inuse)
{
if (v.inuse) // https://issues.dlang.org/show_bug.cgi?id=9494
error(loc, "circular reference to %s `%s`", v.kind(), v.toPrettyChars());
else
error(loc, "forward reference to %s `%s`", v.kind(), v.toPrettyChars());
pt = Type.terror;
return;
}
if (v.type.ty == Terror)
pt = Type.terror;
else
pe = new VarExp(loc, v);
return;
}
if (auto fld = s.isFuncLiteralDeclaration())
{
//printf("'%s' is a function literal\n", fld.toChars());
auto e = new FuncExp(loc, fld);
pe = e.expressionSemantic(sc);
return;
}
version (none)
{
if (FuncDeclaration fd = s.isFuncDeclaration())
{
pe = new DsymbolExp(loc, fd);
return;
}
}
Type t;
while (1)
{
t = s.getType();
if (t)
break;
ps = s;
return;
}
if (auto ti = t.isTypeInstance())
if (ti != mt && !ti.deco)
{
if (!ti.tempinst.errors)
error(loc, "forward reference to `%s`", ti.toChars());
pt = Type.terror;
return;
}
if (t.ty == Ttuple)
pt = t;
else
pt = t.merge();
}
/************************************
* Transitively search a type for all function types.
* If any function types with parameters are found that have parameter identifiers
* or default arguments, remove those and create a new type stripped of those.
* This is used to determine the "canonical" version of a type which is useful for
* comparisons.
* Params:
* t = type to scan
* Returns:
* `t` if no parameter identifiers or default arguments found, otherwise a new type that is
* the same as t but with no parameter identifiers or default arguments.
*/
private Type stripDefaultArgs(Type t)
{
static Parameters* stripParams(Parameters* parameters)
{
static Parameter stripParameter(Parameter p)
{
Type t = stripDefaultArgs(p.type);
return (t != p.type || p.defaultArg || p.ident || p.userAttribDecl)
? new Parameter(p.storageClass, t, null, null, null)
: null;
}
if (parameters)
{
foreach (i, p; *parameters)
{
Parameter ps = stripParameter(p);
if (ps)
{
// Replace params with a copy we can modify
Parameters* nparams = new Parameters(parameters.dim);
foreach (j, ref np; *nparams)
{
Parameter pj = (*parameters)[j];
if (j < i)
np = pj;
else if (j == i)
np = ps;
else
{
Parameter nps = stripParameter(pj);
np = nps ? nps : pj;
}
}
return nparams;
}
}
}
return parameters;
}
if (t is null)
return t;
if (auto tf = t.isTypeFunction())
{
Type tret = stripDefaultArgs(tf.next);
Parameters* params = stripParams(tf.parameterList.parameters);
if (tret == tf.next && params == tf.parameterList.parameters)
return t;
TypeFunction tr = cast(TypeFunction)tf.copy();
tr.parameterList.parameters = params;
tr.next = tret;
//printf("strip %s\n <- %s\n", tr.toChars(), t.toChars());
return tr;
}
else if (auto tt = t.isTypeTuple())
{
Parameters* args = stripParams(tt.arguments);
if (args == tt.arguments)
return t;
TypeTuple tr = cast(TypeTuple)t.copy();
tr.arguments = args;
return tr;
}
else if (t.ty == Tenum)
{
// TypeEnum::nextOf() may be != NULL, but it's not necessary here.
return t;
}
else
{
Type tn = t.nextOf();
Type n = stripDefaultArgs(tn);
if (n == tn)
return t;
TypeNext tr = cast(TypeNext)t.copy();
tr.next = n;
return tr;
}
}
/******************************************
* We've mistakenly parsed `t` as a type.
* Redo `t` as an Expression only if there are no type modifiers.
* Params:
* t = mistaken type
* Returns:
* t redone as Expression, null if cannot
*/
Expression typeToExpression(Type t)
{
static Expression visitSArray(TypeSArray t)
{
if (auto e = t.next.typeToExpression())
return new ArrayExp(t.dim.loc, e, t.dim);
return null;
}
static Expression visitAArray(TypeAArray t)
{
if (auto e = t.next.typeToExpression())
{
if (auto ei = t.index.typeToExpression())
return new ArrayExp(t.loc, e, ei);
}
return null;
}
static Expression visitIdentifier(TypeIdentifier t)
{
return typeToExpressionHelper(t, new IdentifierExp(t.loc, t.ident));
}
static Expression visitInstance(TypeInstance t)
{
return typeToExpressionHelper(t, new ScopeExp(t.loc, t.tempinst));
}
// easy way to enable 'auto v = new int[mixin("exp")];' in 2.088+
static Expression visitMixin(TypeMixin t)
{
return new TypeExp(t.loc, t);
}
if (t.mod)
return null;
switch (t.ty)
{
case Tsarray: return visitSArray(cast(TypeSArray) t);
case Taarray: return visitAArray(cast(TypeAArray) t);
case Tident: return visitIdentifier(cast(TypeIdentifier) t);
case Tinstance: return visitInstance(cast(TypeInstance) t);
case Tmixin: return visitMixin(cast(TypeMixin) t);
default: return null;
}
}
/* Helper function for `typeToExpression`. Contains common code
* for TypeQualified derived classes.
*/
Expression typeToExpressionHelper(TypeQualified t, Expression e, size_t i = 0)
{
//printf("toExpressionHelper(e = %s %s)\n", Token.toChars(e.op), e.toChars());
foreach (id; t.idents[i .. t.idents.dim])
{
//printf("\t[%d] e: '%s', id: '%s'\n", i, e.toChars(), id.toChars());
final switch (id.dyncast())
{
// ... '. ident'
case DYNCAST.identifier:
e = new DotIdExp(e.loc, e, cast(Identifier)id);
break;
// ... '. name!(tiargs)'
case DYNCAST.dsymbol:
auto ti = (cast(Dsymbol)id).isTemplateInstance();
assert(ti);
e = new DotTemplateInstanceExp(e.loc, e, ti.name, ti.tiargs);
break;
// ... '[type]'
case DYNCAST.type: // https://issues.dlang.org/show_bug.cgi?id=1215
e = new ArrayExp(t.loc, e, new TypeExp(t.loc, cast(Type)id));
break;
// ... '[expr]'
case DYNCAST.expression: // https://issues.dlang.org/show_bug.cgi?id=1215
e = new ArrayExp(t.loc, e, cast(Expression)id);
break;
case DYNCAST.object:
case DYNCAST.tuple:
case DYNCAST.parameter:
case DYNCAST.statement:
case DYNCAST.condition:
case DYNCAST.templateparameter:
assert(0);
}
}
return e;
}
/******************************************
* Perform semantic analysis on a type.
* Params:
* type = Type AST node
* loc = the location of the type
* sc = context
* Returns:
* `Type` with completed semantic analysis, `Terror` if errors
* were encountered
*/
extern(C++) Type typeSemantic(Type type, const ref Loc loc, Scope* sc)
{
static Type error()
{
return Type.terror;
}
Type visitType(Type t)
{
if (t.ty == Tint128 || t.ty == Tuns128)
{
.error(loc, "`cent` and `ucent` types not implemented");
return error();
}
return t.merge();
}
Type visitVector(TypeVector mtype)
{
const errors = global.errors;
mtype.basetype = mtype.basetype.typeSemantic(loc, sc);
if (errors != global.errors)
return error();
mtype.basetype = mtype.basetype.toBasetype().mutableOf();
if (mtype.basetype.ty != Tsarray)
{
.error(loc, "T in __vector(T) must be a static array, not `%s`", mtype.basetype.toChars());
return error();
}
TypeSArray t = cast(TypeSArray)mtype.basetype;
const sz = cast(int)t.size(loc);
final switch (target.isVectorTypeSupported(sz, t.nextOf()))
{
case 0:
// valid
break;
case 1:
// no support at all
.error(loc, "SIMD vector types not supported on this platform");
return error();
case 2:
// invalid base type
.error(loc, "vector type `%s` is not supported on this platform", mtype.toChars());
return error();
case 3:
// invalid size
.error(loc, "%d byte vector type `%s` is not supported on this platform", sz, mtype.toChars());
return error();
}
return merge(mtype);
}
Type visitSArray(TypeSArray mtype)
{
//printf("TypeSArray::semantic() %s\n", toChars());
Type t;
Expression e;
Dsymbol s;
mtype.next.resolve(loc, sc, e, t, s);
if (auto tup = s ? s.isTupleDeclaration() : null)
{
mtype.dim = semanticLength(sc, tup, mtype.dim);
mtype.dim = mtype.dim.ctfeInterpret();
if (mtype.dim.op == TOK.error)
return error();
uinteger_t d = mtype.dim.toUInteger();
if (d >= tup.objects.dim)
{
.error(loc, "tuple index %llu exceeds %llu", cast(ulong)d, cast(ulong)tup.objects.dim);
return error();
}
RootObject o = (*tup.objects)[cast(size_t)d];
if (o.dyncast() != DYNCAST.type)
{
.error(loc, "`%s` is not a type", mtype.toChars());
return error();
}
return (cast(Type)o).addMod(mtype.mod);
}
if (t && t.ty == Terror)
return error();
Type tn = mtype.next.typeSemantic(loc, sc);
if (tn.ty == Terror)
return error();
Type tbn = tn.toBasetype();
if (mtype.dim)
{
//https://issues.dlang.org/show_bug.cgi?id=15478
if (mtype.dim.isDotVarExp())
{
if (Declaration vd = mtype.dim.isDotVarExp().var)
{
FuncDeclaration fd = vd.toAlias().isFuncDeclaration();
if (fd)
mtype.dim = new CallExp(loc, fd, null);
}
}
auto errors = global.errors;
mtype.dim = semanticLength(sc, tbn, mtype.dim);
if (errors != global.errors)
return error();
mtype.dim = mtype.dim.optimize(WANTvalue);
mtype.dim = mtype.dim.ctfeInterpret();
if (mtype.dim.op == TOK.error)
return error();
errors = global.errors;
dinteger_t d1 = mtype.dim.toInteger();
if (errors != global.errors)
return error();
mtype.dim = mtype.dim.implicitCastTo(sc, Type.tsize_t);
mtype.dim = mtype.dim.optimize(WANTvalue);
if (mtype.dim.op == TOK.error)
return error();
errors = global.errors;
dinteger_t d2 = mtype.dim.toInteger();
if (errors != global.errors)
return error();
if (mtype.dim.op == TOK.error)
return error();
Type overflowError()
{
.error(loc, "`%s` size %llu * %llu exceeds 0x%llx size limit for static array",
mtype.toChars(), cast(ulong)tbn.size(loc), cast(ulong)d1, target.maxStaticDataSize);
return error();
}
if (d1 != d2)
return overflowError();
Type tbx = tbn.baseElemOf();
if (tbx.ty == Tstruct && !(cast(TypeStruct)tbx).sym.members ||
tbx.ty == Tenum && !(cast(TypeEnum)tbx).sym.members)
{
/* To avoid meaningless error message, skip the total size limit check
* when the bottom of element type is opaque.
*/
}
else if (tbn.isTypeBasic() ||
tbn.ty == Tpointer ||
tbn.ty == Tarray ||
tbn.ty == Tsarray ||
tbn.ty == Taarray ||
(tbn.ty == Tstruct && ((cast(TypeStruct)tbn).sym.sizeok == Sizeok.done)) ||
tbn.ty == Tclass)
{
/* Only do this for types that don't need to have semantic()
* run on them for the size, since they may be forward referenced.
*/
bool overflow = false;
if (mulu(tbn.size(loc), d2, overflow) >= target.maxStaticDataSize || overflow)
return overflowError();
}
}
switch (tbn.ty)
{
case Ttuple:
{
// Index the tuple to get the type
assert(mtype.dim);
TypeTuple tt = cast(TypeTuple)tbn;
uinteger_t d = mtype.dim.toUInteger();
if (d >= tt.arguments.dim)
{
.error(loc, "tuple index %llu exceeds %llu", cast(ulong)d, cast(ulong)tt.arguments.dim);
return error();
}
Type telem = (*tt.arguments)[cast(size_t)d].type;
return telem.addMod(mtype.mod);
}
case Tfunction:
case Tnone:
.error(loc, "cannot have array of `%s`", tbn.toChars());
return error();
default:
break;
}
if (tbn.isscope())
{
.error(loc, "cannot have array of scope `%s`", tbn.toChars());
return error();
}
/* Ensure things like const(immutable(T)[3]) become immutable(T[3])
* and const(T)[3] become const(T[3])
*/
mtype.next = tn;
mtype.transitive();
return mtype.addMod(tn.mod).merge();
}
Type visitDArray(TypeDArray mtype)
{
Type tn = mtype.next.typeSemantic(loc, sc);
Type tbn = tn.toBasetype();
switch (tbn.ty)
{
case Ttuple:
return tbn;
case Tfunction:
case Tnone:
.error(loc, "cannot have array of `%s`", tbn.toChars());
return error();
case Terror:
return error();
default:
break;
}
if (tn.isscope())
{
.error(loc, "cannot have array of scope `%s`", tn.toChars());
return error();
}
mtype.next = tn;
mtype.transitive();
return merge(mtype);
}
Type visitAArray(TypeAArray mtype)
{
//printf("TypeAArray::semantic() %s index.ty = %d\n", mtype.toChars(), mtype.index.ty);
if (mtype.deco)
{
return mtype;
}
mtype.loc = loc;
if (sc)
sc.setNoFree();
// Deal with the case where we thought the index was a type, but
// in reality it was an expression.
if (mtype.index.ty == Tident || mtype.index.ty == Tinstance || mtype.index.ty == Tsarray || mtype.index.ty == Ttypeof || mtype.index.ty == Treturn || mtype.index.ty == Tmixin)
{
Expression e;
Type t;
Dsymbol s;
mtype.index.resolve(loc, sc, e, t, s);
//https://issues.dlang.org/show_bug.cgi?id=15478
if (s)
{
if (FuncDeclaration fd = s.toAlias().isFuncDeclaration())
e = new CallExp(loc, fd, null);
}
if (e)
{
// It was an expression -
// Rewrite as a static array
auto tsa = new TypeSArray(mtype.next, e);
return tsa.typeSemantic(loc, sc);
}
else if (t)
mtype.index = t.typeSemantic(loc, sc);
else
{
.error(loc, "index is not a type or an expression");
return error();
}
}
else
mtype.index = mtype.index.typeSemantic(loc, sc);
mtype.index = mtype.index.merge2();
if (mtype.index.nextOf() && !mtype.index.nextOf().isImmutable())
{
mtype.index = mtype.index.constOf().mutableOf();
version (none)
{
printf("index is %p %s\n", mtype.index, mtype.index.toChars());
mtype.index.check();
printf("index.mod = x%x\n", mtype.index.mod);
printf("index.ito = x%p\n", mtype.index.getMcache().ito);
if (mtype.index.getMcache().ito)
{
printf("index.ito.mod = x%x\n", mtype.index.getMcache().ito.mod);
printf("index.ito.ito = x%p\n", mtype.index.getMcache().ito.getMcache().ito);
}
}
}
switch (mtype.index.toBasetype().ty)
{
case Tfunction:
case Tvoid:
case Tnone:
case Ttuple:
.error(loc, "cannot have associative array key of `%s`", mtype.index.toBasetype().toChars());
goto case Terror;
case Terror:
return error();
default:
break;
}
Type tbase = mtype.index.baseElemOf();
while (tbase.ty == Tarray)
tbase = tbase.nextOf().baseElemOf();
if (auto ts = tbase.isTypeStruct())
{
/* AA's need typeid(index).equals() and getHash(). Issue error if not correctly set up.
*/
StructDeclaration sd = ts.sym;
if (sd.semanticRun < PASS.semanticdone)
sd.dsymbolSemantic(null);
// duplicate a part of StructDeclaration::semanticTypeInfoMembers
//printf("AA = %s, key: xeq = %p, xerreq = %p xhash = %p\n", toChars(), sd.xeq, sd.xerreq, sd.xhash);
if (sd.xeq && sd.xeq.generated && sd.xeq._scope && sd.xeq.semanticRun < PASS.semantic3done)
{
uint errors = global.startGagging();
sd.xeq.semantic3(sd.xeq._scope);
if (global.endGagging(errors))
sd.xeq = sd.xerreq;
}
//printf("AA = %s, key: xeq = %p, xhash = %p\n", toChars(), sd.xeq, sd.xhash);
const(char)* s = (mtype.index.toBasetype().ty != Tstruct) ? "bottom of " : "";
if (!sd.xeq)
{
// If sd.xhash != NULL:
// sd or its fields have user-defined toHash.
// AA assumes that its result is consistent with bitwise equality.
// else:
// bitwise equality & hashing
}
else if (sd.xeq == sd.xerreq)
{
if (search_function(sd, Id.eq))