forked from dlang/dmd
/
interpret.c
6306 lines (5890 loc) · 206 KB
/
interpret.c
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
// Compiler implementation of the D programming language
// Copyright (c) 1999-2012 by Digital Mars
// All Rights Reserved
// written by Walter Bright
// http://www.digitalmars.com
// License for redistribution is by either the Artistic License
// in artistic.txt, or the GNU General Public License in gnu.txt.
// See the included readme.txt for details.
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <string.h> // mem{cpy|set}()
#include "rmem.h"
#include "statement.h"
#include "expression.h"
#include "cond.h"
#include "init.h"
#include "staticassert.h"
#include "mtype.h"
#include "scope.h"
#include "declaration.h"
#include "aggregate.h"
#include "id.h"
#include "utf.h"
#include "attrib.h" // for AttribDeclaration
#include "template.h"
#include "port.h"
#include "ctfe.h"
#define LOG 0
#define LOGASSIGN 0
#define LOGCOMPILE 0
#define SHOWPERFORMANCE 0
// Maximum allowable recursive function calls in CTFE
#define CTFE_RECURSION_LIMIT 1000
/**
The values of all CTFE variables
*/
struct CtfeStack
{
private:
/* The stack. Every declaration we encounter is pushed here,
together with the VarDeclaration, and the previous
stack address of that variable, so that we can restore it
when we leave the stack frame.
Note that when a function is forward referenced, the interpreter must
run semantic3, and that may start CTFE again with a NULL istate. Thus
the stack might not be empty when CTFE begins.
Ctfe Stack addresses are just 0-based integers, but we save
them as 'void *' because Array can only do pointers.
*/
Expressions values; // values on the stack
VarDeclarations vars; // corresponding variables
Array<void> savedId; // id of the previous state of that var
Array<void> frames; // all previous frame pointers
Expressions savedThis; // all previous values of localThis
/* Global constants get saved here after evaluation, so we never
* have to redo them. This saves a lot of time and memory.
*/
Expressions globalValues; // values of global constants
size_t framepointer; // current frame pointer
size_t maxStackPointer; // most stack we've ever used
Expression *localThis; // value of 'this', or NULL if none
public:
CtfeStack();
size_t stackPointer();
// The current value of 'this', or NULL if none
Expression *getThis();
// Largest number of stack positions we've used
size_t maxStackUsage();
// Start a new stack frame, using the provided 'this'.
void startFrame(Expression *thisexp);
void endFrame();
bool isInCurrentFrame(VarDeclaration *v);
Expression *getValue(VarDeclaration *v);
void setValue(VarDeclaration *v, Expression *e);
void push(VarDeclaration *v);
void pop(VarDeclaration *v);
void popAll(size_t stackpointer);
void saveGlobalConstant(VarDeclaration *v, Expression *e);
};
struct InterState
{
InterState *caller; // calling function's InterState
FuncDeclaration *fd; // function being interpreted
Statement *start; // if !=NULL, start execution at this statement
Statement *gotoTarget; /* target of EXP_GOTO_INTERPRET result; also
* target of labelled EXP_BREAK_INTERPRET or
* EXP_CONTINUE_INTERPRET. (NULL if no label).
*/
bool awaitingLvalueReturn; // Support for ref return values:
// Any return to this function should return an lvalue.
InterState();
};
/************** CtfeStack ********************************************/
CtfeStack ctfeStack;
CtfeStack::CtfeStack() : framepointer(0), maxStackPointer(0)
{
}
size_t CtfeStack::stackPointer()
{
return values.dim;
}
Expression *CtfeStack::getThis()
{
return localThis;
}
// Largest number of stack positions we've used
size_t CtfeStack::maxStackUsage()
{
return maxStackPointer;
}
void CtfeStack::startFrame(Expression *thisexp)
{
size_t oldframe = framepointer;
frames.push((void *)(size_t)(framepointer));
savedThis.push(localThis);
framepointer = stackPointer();
localThis = thisexp;
}
void CtfeStack::endFrame()
{
size_t oldframe = (size_t)(frames[frames.dim-1]);
localThis = savedThis[savedThis.dim-1];
popAll(framepointer);
framepointer = oldframe;
frames.setDim(frames.dim - 1);
savedThis.setDim(savedThis.dim -1);
}
bool CtfeStack::isInCurrentFrame(VarDeclaration *v)
{
if (v->isDataseg() && !v->isCTFE())
return false; // It's a global
return v->ctfeAdrOnStack >= framepointer;
}
Expression *CtfeStack::getValue(VarDeclaration *v)
{
if ((v->isDataseg() || v->storage_class & STCmanifest) && !v->isCTFE())
{
assert(v->ctfeAdrOnStack >= 0 &&
v->ctfeAdrOnStack < globalValues.dim);
return globalValues[v->ctfeAdrOnStack];
}
assert(v->ctfeAdrOnStack >= 0 && v->ctfeAdrOnStack < stackPointer());
return values[v->ctfeAdrOnStack];
}
void CtfeStack::setValue(VarDeclaration *v, Expression *e)
{
assert(!v->isDataseg() || v->isCTFE());
assert(v->ctfeAdrOnStack >= 0 && v->ctfeAdrOnStack < stackPointer());
values[v->ctfeAdrOnStack] = e;
}
void CtfeStack::push(VarDeclaration *v)
{
assert(!v->isDataseg() || v->isCTFE());
if (v->ctfeAdrOnStack!= (size_t)-1
&& v->ctfeAdrOnStack >= framepointer)
{ // Already exists in this frame, reuse it.
values[v->ctfeAdrOnStack] = NULL;
return;
}
savedId.push((void *)(size_t)(v->ctfeAdrOnStack));
v->ctfeAdrOnStack = values.dim;
vars.push(v);
values.push(NULL);
}
void CtfeStack::pop(VarDeclaration *v)
{
assert(!v->isDataseg() || v->isCTFE());
assert(!(v->storage_class & (STCref | STCout)));
int oldid = v->ctfeAdrOnStack;
v->ctfeAdrOnStack = (int)(size_t)(savedId[oldid]);
if (v->ctfeAdrOnStack == values.dim - 1)
{
values.pop();
vars.pop();
savedId.pop();
}
}
void CtfeStack::popAll(size_t stackpointer)
{
if (stackPointer() > maxStackPointer)
maxStackPointer = stackPointer();
assert(values.dim >= stackpointer);
for (size_t i = stackpointer; i < values.dim; ++i)
{
VarDeclaration *v = vars[i];
v->ctfeAdrOnStack = (size_t)(savedId[i]);
}
values.setDim(stackpointer);
vars.setDim(stackpointer);
savedId.setDim(stackpointer);
}
void CtfeStack::saveGlobalConstant(VarDeclaration *v, Expression *e)
{
#if DMDV2
assert( v->init && (v->isConst() || v->isImmutable() || v->storage_class & STCmanifest) && !v->isCTFE());
#else
assert( v->init && v->isConst() && !v->isCTFE());
#endif
v->ctfeAdrOnStack = globalValues.dim;
globalValues.push(e);
}
/************** InterState ********************************************/
InterState::InterState()
{
memset(this, 0, sizeof(InterState));
}
/************** CtfeStatus ********************************************/
int CtfeStatus::callDepth = 0;
int CtfeStatus::stackTraceCallsToSuppress = 0;
int CtfeStatus::maxCallDepth = 0;
int CtfeStatus::numArrayAllocs = 0;
int CtfeStatus::numAssignments = 0;
// CTFE diagnostic information
void printCtfePerformanceStats()
{
#if SHOWPERFORMANCE
printf(" ---- CTFE Performance ----\n");
printf("max call depth = %d\tmax stack = %d\n", CtfeStatus::maxCallDepth, ctfeStack.maxStackUsage());
printf("array allocs = %d\tassignments = %d\n\n", CtfeStatus::numArrayAllocs, CtfeStatus::numAssignments);
#endif
}
Expression * resolveReferences(Expression *e);
Expression *getVarExp(Loc loc, InterState *istate, Declaration *d, CtfeGoal goal);
VarDeclaration *findParentVar(Expression *e);
Expression *evaluateIfBuiltin(InterState *istate, Loc loc,
FuncDeclaration *fd, Expressions *arguments, Expression *pthis);
Expression *scrubReturnValue(Loc loc, Expression *e);
/*************************************
* CTFE-object code for a single function
*
* Currently only counts the number of local variables in the function
*/
struct CompiledCtfeFunction
{
FuncDeclaration *func; // Function being compiled, NULL if global scope
int numVars; // Number of variables declared in this function
Loc callingloc;
CompiledCtfeFunction(FuncDeclaration *f)
{
func = f;
numVars = 0;
}
void onDeclaration(VarDeclaration *v)
{
//printf("%s CTFE declare %s\n", v->loc.toChars(), v->toChars());
++numVars;
}
static int walkAllVars(Expression *e, void *_this);
void onExpression(Expression *e)
{
e->apply(&walkAllVars, this);
}
};
int CompiledCtfeFunction::walkAllVars(Expression *e, void *_this)
{
CompiledCtfeFunction *ccf = (CompiledCtfeFunction *)_this;
if (e->op == TOKerror)
{
// Currently there's a front-end bug: silent errors
// can occur inside delegate literals inside is(typeof()).
// Suppress the check in this case.
if (global.gag && ccf->func)
return 1;
printf("CTFE: ErrorExp in %s\n", ccf->func ? ccf->func->loc.toChars() : ccf->callingloc.toChars());
assert(0);
}
if (e->op == TOKdeclaration)
{
DeclarationExp *decl = (DeclarationExp *)e;
VarDeclaration *v = decl->declaration->isVarDeclaration();
if (!v)
return 0;
TupleDeclaration *td = v->toAlias()->isTupleDeclaration();
if (td)
{
if (!td->objects)
return 0;
for(size_t i= 0; i < td->objects->dim; ++i)
{
RootObject *o = td->objects->tdata()[i];
Expression *ex = isExpression(o);
DsymbolExp *s = (ex && ex->op == TOKdsymbol) ? (DsymbolExp *)ex : NULL;
assert(s);
VarDeclaration *v2 = s->s->isVarDeclaration();
assert(v2);
if (!v2->isDataseg() || v2->isCTFE())
ccf->onDeclaration(v2);
}
}
else if (!(v->isDataseg() || v->storage_class & STCmanifest) || v->isCTFE())
ccf->onDeclaration(v);
Dsymbol *s = v->toAlias();
if (s == v && !v->isStatic() && v->init)
{
ExpInitializer *ie = v->init->isExpInitializer();
if (ie)
ccf->onExpression(ie->exp);
}
}
else if (e->op == TOKindex && ((IndexExp *)e)->lengthVar)
ccf->onDeclaration( ((IndexExp *)e)->lengthVar);
else if (e->op == TOKslice && ((SliceExp *)e)->lengthVar)
ccf->onDeclaration( ((SliceExp *)e)->lengthVar);
return 0;
}
void Statement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s Statement::ctfeCompile %s\n", loc.toChars(), toChars());
#endif
assert(0);
}
void ExpStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ExpStatement::ctfeCompile\n", loc.toChars());
#endif
if (exp)
ccf->onExpression(exp);
}
void CompoundStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s CompoundStatement::ctfeCompile\n", loc.toChars());
#endif
for (size_t i = 0; i < statements->dim; i++)
{ Statement *s = (*statements)[i];
if (s)
s->ctfeCompile(ccf);
}
}
void UnrolledLoopStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s UnrolledLoopStatement::ctfeCompile\n", loc.toChars());
#endif
for (size_t i = 0; i < statements->dim; i++)
{ Statement *s = (*statements)[i];
if (s)
s->ctfeCompile(ccf);
}
}
void IfStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s IfStatement::ctfeCompile\n", loc.toChars());
#endif
ccf->onExpression(condition);
if (ifbody)
ifbody->ctfeCompile(ccf);
if (elsebody)
elsebody->ctfeCompile(ccf);
}
void ScopeStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ScopeStatement::ctfeCompile\n", loc.toChars());
#endif
if (statement)
statement->ctfeCompile(ccf);
}
void OnScopeStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s OnScopeStatement::ctfeCompile\n", loc.toChars());
#endif
// rewritten to try/catch/finally
assert(0);
}
void DoStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s DoStatement::ctfeCompile\n", loc.toChars());
#endif
ccf->onExpression(condition);
if (body)
body->ctfeCompile(ccf);
}
void WhileStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s WhileStatement::ctfeCompile\n", loc.toChars());
#endif
// rewritten to ForStatement
assert(0);
}
void ForStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ForStatement::ctfeCompile\n", loc.toChars());
#endif
if (init)
init->ctfeCompile(ccf);
if (condition)
ccf->onExpression(condition);
if (increment)
ccf->onExpression(increment);
if (body)
body->ctfeCompile(ccf);
}
void ForeachStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ForeachStatement::ctfeCompile\n", loc.toChars());
#endif
// rewritten for ForStatement
assert(0);
}
void SwitchStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s SwitchStatement::ctfeCompile\n", loc.toChars());
#endif
ccf->onExpression(condition);
// Note that the body contains the the Case and Default
// statements, so we only need to compile the expressions
for (size_t i = 0; i < cases->dim; i++)
{
ccf->onExpression((*cases)[i]->exp);
}
if (body)
body->ctfeCompile(ccf);
}
void CaseStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s CaseStatement::ctfeCompile\n", loc.toChars());
#endif
if (statement)
statement->ctfeCompile(ccf);
}
void DefaultStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s DefaultStatement::ctfeCompile\n", loc.toChars());
#endif
if (statement)
statement->ctfeCompile(ccf);
}
void GotoDefaultStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s GotoDefaultStatement::ctfeCompile\n", loc.toChars());
#endif
}
void GotoCaseStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s GotoCaseStatement::ctfeCompile\n", loc.toChars());
#endif
}
void SwitchErrorStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s SwitchErrorStatement::ctfeCompile\n", loc.toChars());
#endif
}
void ReturnStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ReturnStatement::ctfeCompile\n", loc.toChars());
#endif
if (exp)
ccf->onExpression(exp);
}
void BreakStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s BreakStatement::ctfeCompile\n", loc.toChars());
#endif
}
void ContinueStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ContinueStatement::ctfeCompile\n", loc.toChars());
#endif
}
void WithStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s WithStatement::ctfeCompile\n", loc.toChars());
#endif
// If it is with(Enum) {...}, just execute the body.
if (exp->op == TOKimport || exp->op == TOKtype)
{}
else
{
ccf->onDeclaration(wthis);
ccf->onExpression(exp);
}
if (body)
body->ctfeCompile(ccf);
}
void TryCatchStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s TryCatchStatement::ctfeCompile\n", loc.toChars());
#endif
if (body)
body->ctfeCompile(ccf);
for (size_t i = 0; i < catches->dim; i++)
{
#if DMDV1
Catch *ca = (Catch *)catches->data[i];
#else
Catch *ca = catches->tdata()[i];
#endif
if (ca->var)
ccf->onDeclaration(ca->var);
if (ca->handler)
ca->handler->ctfeCompile(ccf);
}
}
void TryFinallyStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s TryFinallyStatement::ctfeCompile\n", loc.toChars());
#endif
if (body)
body->ctfeCompile(ccf);
if (finalbody)
finalbody->ctfeCompile(ccf);
}
void ThrowStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ThrowStatement::ctfeCompile\n", loc.toChars());
#endif
ccf->onExpression(exp);
}
void GotoStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s GotoStatement::ctfeCompile\n", loc.toChars());
#endif
}
void LabelStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s LabelStatement::ctfeCompile\n", loc.toChars());
#endif
if (statement)
statement->ctfeCompile(ccf);
}
#if DMDV2
void ImportStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ImportStatement::ctfeCompile\n", loc.toChars());
#endif
// Contains no variables or executable code
}
void ForeachRangeStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s ForeachRangeStatement::ctfeCompile\n", loc.toChars());
#endif
// rewritten for ForStatement
assert(0);
}
#endif
void AsmStatement::ctfeCompile(CompiledCtfeFunction *ccf)
{
#if LOGCOMPILE
printf("%s AsmStatement::ctfeCompile\n", loc.toChars());
#endif
// we can't compile asm statements
}
/*************************************
* Compile this function for CTFE.
* At present, this merely allocates variables.
*/
void FuncDeclaration::ctfeCompile()
{
#if LOGCOMPILE
printf("\n%s FuncDeclaration::ctfeCompile %s\n", loc.toChars(), toChars());
#endif
assert(!ctfeCode);
assert(!semantic3Errors);
assert(semanticRun == PASSsemantic3done);
ctfeCode = new CompiledCtfeFunction(this);
if (parameters)
{
Type *tb = type->toBasetype();
assert(tb->ty == Tfunction);
TypeFunction *tf = (TypeFunction *)tb;
for (size_t i = 0; i < parameters->dim; i++)
{
Parameter *arg = Parameter::getNth(tf->parameters, i);
VarDeclaration *v = (*parameters)[i];
ctfeCode->onDeclaration(v);
}
}
if (vresult)
ctfeCode->onDeclaration(vresult);
fbody->ctfeCompile(ctfeCode);
}
/*************************************
*
* Entry point for CTFE.
* A compile-time result is required. Give an error if not possible
*/
Expression *Expression::ctfeInterpret()
{
if (type == Type::terror)
return this;
// This code is outside a function, but still needs to be compiled
// (there are compiler-generated temporary variables such as __dollar).
// However, this will only be run once and can then be discarded.
CompiledCtfeFunction ctfeCodeGlobal(NULL);
ctfeCodeGlobal.callingloc = loc;
ctfeCodeGlobal.onExpression(this);
Expression *e = interpret(NULL);
if (e != EXP_CANT_INTERPRET)
e = scrubReturnValue(loc, e);
if (e == EXP_CANT_INTERPRET)
e = new ErrorExp();
return e;
}
/* Run CTFE on the expression, but allow the expression to be a TypeExp
* or a tuple containing a TypeExp. (This is required by pragma(msg)).
*/
Expression *ctfeInterpretForPragmaMsg(Expression *e)
{
if (e->op == TOKerror || e->op == TOKtype)
return e;
// It's also OK for it to be a function declaration (happens only with
// __traits(getOverloads))
if (e->op == TOKvar && ((VarExp *)e)->var->isFuncDeclaration())
{
return e;
}
if (e->op != TOKtuple)
return e->ctfeInterpret();
// Tuples need to be treated seperately, since they are
// allowed to contain a TypeExp in this case.
TupleExp *tup = (TupleExp *)e;
Expressions *expsx = NULL;
for (size_t i = 0; i < tup->exps->dim; ++i)
{
Expression *g = (*tup->exps)[i];
Expression *h = g;
h = ctfeInterpretForPragmaMsg(g);
if (h != g)
{
if (!expsx)
{
expsx = new Expressions();
expsx->setDim(tup->exps->dim);
for (size_t j = 0; j < tup->exps->dim; j++)
(*expsx)[j] = (*tup->exps)[j];
}
(*expsx)[i] = h;
}
}
if (expsx)
{
TupleExp *te = new TupleExp(e->loc, expsx);
expandTuples(te->exps);
te->type = new TypeTuple(te->exps);
return te;
}
return e;
}
/*************************************
* Attempt to interpret a function given the arguments.
* Input:
* istate state for calling function (NULL if none)
* arguments function arguments
* thisarg 'this', if a needThis() function, NULL if not.
*
* Return result expression if successful, EXP_CANT_INTERPRET if not,
* or EXP_VOID_INTERPRET if function returned void.
*/
Expression *FuncDeclaration::interpret(InterState *istate, Expressions *arguments, Expression *thisarg)
{
#if LOG
printf("\n********\n%s FuncDeclaration::interpret(istate = %p) %s\n", loc.toChars(), istate, toChars());
#endif
if (semanticRun == PASSsemantic3)
{
error("circular dependency. Functions cannot be interpreted while being compiled");
return EXP_CANT_INTERPRET;
}
if (!functionSemantic3())
return EXP_CANT_INTERPRET;
if (semanticRun < PASSsemantic3done)
return EXP_CANT_INTERPRET;
// CTFE-compile the function
if (!ctfeCode)
ctfeCompile();
Type *tb = type->toBasetype();
assert(tb->ty == Tfunction);
TypeFunction *tf = (TypeFunction *)tb;
Type *tret = tf->next->toBasetype();
if (tf->varargs && arguments &&
((parameters && arguments->dim != parameters->dim) || (!parameters && arguments->dim)))
{
error("C-style variadic functions are not yet implemented in CTFE");
return EXP_CANT_INTERPRET;
}
// Nested functions always inherit the 'this' pointer from the parent,
// except for delegates. (Note that the 'this' pointer may be null).
// Func literals report isNested() even if they are in global scope,
// so we need to check that the parent is a function.
if (isNested() && toParent2()->isFuncDeclaration() && !thisarg && istate)
thisarg = ctfeStack.getThis();
size_t dim = 0;
if (needThis() && !thisarg)
{ // error, no this. Prevent segfault.
error("need 'this' to access member %s", toChars());
return EXP_CANT_INTERPRET;
}
if (thisarg && !istate)
{ // Check that 'this' aleady has a value
if (thisarg->interpret(istate) == EXP_CANT_INTERPRET)
return EXP_CANT_INTERPRET;
}
static int evaluatingArgs = 0;
// Place to hold all the arguments to the function while
// we are evaluating them.
Expressions eargs;
if (arguments)
{
dim = arguments->dim;
assert(!dim || (parameters && (parameters->dim == dim)));
/* Evaluate all the arguments to the function,
* store the results in eargs[]
*/
eargs.setDim(dim);
for (size_t i = 0; i < dim; i++)
{ Expression *earg = (*arguments)[i];
Parameter *arg = Parameter::getNth(tf->parameters, i);
if (arg->storageClass & (STCout | STCref))
{
if (!istate && (arg->storageClass & STCout))
{ // initializing an out parameter involves writing to it.
earg->error("global %s cannot be passed as an 'out' parameter at compile time", earg->toChars());
return EXP_CANT_INTERPRET;
}
// Convert all reference arguments into lvalue references
++evaluatingArgs;
earg = earg->interpret(istate, ctfeNeedLvalueRef);
--evaluatingArgs;
if (earg == EXP_CANT_INTERPRET)
return earg;
}
else if (arg->storageClass & STClazy)
{
}
else
{ /* Value parameters
*/
Type *ta = arg->type->toBasetype();
if (ta->ty == Tsarray && earg->op == TOKaddress)
{
/* Static arrays are passed by a simple pointer.
* Skip past this to get at the actual arg.
*/
earg = ((AddrExp *)earg)->e1;
}
++evaluatingArgs;
earg = earg->interpret(istate);
--evaluatingArgs;
if (earg == EXP_CANT_INTERPRET)
return earg;
/* Struct literals are passed by value, but we don't need to
* copy them if they are passed as const
*/
if (earg->op == TOKstructliteral
#if DMDV2
&& !(arg->storageClass & (STCconst | STCimmutable))
#endif
)
earg = copyLiteral(earg);
}
if (earg->op == TOKthrownexception)
{
if (istate)
return earg;
((ThrownExceptionExp *)earg)->generateUncaughtError();
return EXP_CANT_INTERPRET;
}
eargs[i] = earg;
}
}
// Now that we've evaluated all the arguments, we can start the frame
// (this is the moment when the 'call' actually takes place).
InterState istatex;
istatex.caller = istate;
istatex.fd = this;
ctfeStack.startFrame(thisarg);
if (arguments)
{
for (size_t i = 0; i < dim; i++)
{ Expression *earg = eargs[i];
Parameter *arg = Parameter::getNth(tf->parameters, i);
VarDeclaration *v = (*parameters)[i];
#if LOG
printf("arg[%d] = %s\n", i, earg->toChars());
#endif
if (arg->storageClass & (STCout | STCref) && earg->op == TOKvar)
{
VarExp *ve = (VarExp *)earg;
VarDeclaration *v2 = ve->var->isVarDeclaration();
if (!v2)
{
error("cannot interpret %s as a ref parameter", ve->toChars());
return EXP_CANT_INTERPRET;
}
/* The push() isn't a variable we'll use, it's just a place
* to save the old value of v.
* Note that v might be v2! So we need to save v2's index
* before pushing.
*/
size_t oldadr = v2->ctfeAdrOnStack;
ctfeStack.push(v);
v->ctfeAdrOnStack = oldadr;
assert(v2->hasValue());
}
else
{ // Value parameters and non-trivial references
ctfeStack.push(v);
v->setValueWithoutChecking(earg);
}
#if LOG || LOGASSIGN
printf("interpreted arg[%d] = %s\n", i, earg->toChars());
showCtfeExpr(earg);
#endif
}
}
if (vresult)
ctfeStack.push(vresult);
// Enter the function
++CtfeStatus::callDepth;
if (CtfeStatus::callDepth > CtfeStatus::maxCallDepth)
CtfeStatus::maxCallDepth = CtfeStatus::callDepth;
Expression *e = NULL;
while (1)
{
if (CtfeStatus::callDepth > CTFE_RECURSION_LIMIT)
{ // This is a compiler error. It must not be suppressed.
global.gag = 0;
error("CTFE recursion limit exceeded");
e = EXP_CANT_INTERPRET;
break;
}
e = fbody->interpret(&istatex);
if (e == EXP_CANT_INTERPRET)
{
#if LOG
printf("function body failed to interpret\n");
#endif
}
/* This is how we deal with a recursive statement AST
* that has arbitrary goto statements in it.
* Bubble up a 'result' which is the target of the goto
* statement, then go recursively down the AST looking
* for that statement, then execute starting there.
*/
if (e == EXP_GOTO_INTERPRET)
{
istatex.start = istatex.gotoTarget; // set starting statement
istatex.gotoTarget = NULL;
}
else
break;
}
assert(e != EXP_CONTINUE_INTERPRET && e != EXP_BREAK_INTERPRET);
// Leave the function
--CtfeStatus::callDepth;
ctfeStack.endFrame();
// If fell off the end of a void function, return void
if (!e && type->toBasetype()->nextOf()->ty == Tvoid)
return EXP_VOID_INTERPRET;
// If result is void, return void
if (e == EXP_VOID_INTERPRET)
return e;
// If it generated an exception, return it
if (exceptionOrCantInterpret(e))
{
if (istate || e == EXP_CANT_INTERPRET)
return e;
((ThrownExceptionExp *)e)->generateUncaughtError();
return EXP_CANT_INTERPRET;
}
// If we're about to leave CTFE, make sure we don't crash the