This repository has been archived by the owner on Jun 20, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 52
/
expr.cc
3151 lines (2615 loc) · 88.4 KB
/
expr.cc
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
/* expr.cc -- Lower D frontend expressions to GCC trees.
Copyright (C) 2015-2018 Free Software Foundation, Inc.
GCC is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3, or (at your option)
any later version.
GCC 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "dfrontend/aggregate.h"
#include "dfrontend/ctfe.h"
#include "dfrontend/declaration.h"
#include "dfrontend/expression.h"
#include "dfrontend/init.h"
#include "dfrontend/module.h"
#include "dfrontend/mtype.h"
#include "dfrontend/template.h"
#include "tree.h"
#include "fold-const.h"
#include "diagnostic.h"
#include "langhooks.h"
#include "tm.h"
#include "function.h"
#include "toplev.h"
#include "varasm.h"
#include "predict.h"
#include "stor-layout.h"
#include "d-tree.h"
#include "d-frontend.h"
/* Implements the visitor interface to build the GCC trees of all Expression
AST classes emitted from the D Front-end.
All visit methods accept one parameter E, which holds the frontend AST
of the expression to compile. They also don't return any value, instead
generated code is cached in RESULT_ and returned from the caller. */
class ExprVisitor : public Visitor
{
tree result_;
bool constp_;
/* Determine if type is a struct that has a postblit. */
bool needs_postblit (Type *t)
{
t = t->baseElemOf ();
if (t->ty == Tstruct)
{
StructDeclaration *sd = ((TypeStruct *) t)->sym;
if (sd->postblit)
return true;
}
return false;
}
/* Determine if type is a struct that has a destructor. */
bool needs_dtor (Type *t)
{
t = t->baseElemOf ();
if (t->ty == Tstruct)
{
StructDeclaration *sd = ((TypeStruct *) t)->sym;
if (sd->dtor)
return true;
}
return false;
}
/* Determine if expression is suitable lvalue. */
bool lvalue_p (Expression *e)
{
return ((e->op != TOKslice && e->isLvalue ())
|| (e->op == TOKslice && ((UnaExp *) e)->e1->isLvalue ())
|| (e->op == TOKcast && ((UnaExp *) e)->e1->isLvalue ()));
}
/* Build an expression of code CODE, data type TYPE, and operands ARG0 and
ARG1. Perform relevant conversions needs for correct code operations. */
tree binary_op (tree_code code, tree type, tree arg0, tree arg1)
{
tree t0 = TREE_TYPE (arg0);
tree t1 = TREE_TYPE (arg1);
tree ret = NULL_TREE;
bool unsignedp = TYPE_UNSIGNED (t0) || TYPE_UNSIGNED (t1);
/* Deal with float mod expressions immediately. */
if (code == FLOAT_MOD_EXPR)
return build_float_modulus (type, arg0, arg1);
if (POINTER_TYPE_P (t0) && INTEGRAL_TYPE_P (t1))
return build_nop (type, build_offset_op (code, arg0, arg1));
if (INTEGRAL_TYPE_P (t0) && POINTER_TYPE_P (t1))
return build_nop (type, build_offset_op (code, arg1, arg0));
if (POINTER_TYPE_P (t0) && POINTER_TYPE_P (t1))
{
/* Need to convert pointers to integers because tree-vrp asserts
against (ptr MINUS ptr). */
tree ptrtype = lang_hooks.types.type_for_mode (ptr_mode,
TYPE_UNSIGNED (type));
arg0 = d_convert (ptrtype, arg0);
arg1 = d_convert (ptrtype, arg1);
ret = fold_build2 (code, ptrtype, arg0, arg1);
}
else if (INTEGRAL_TYPE_P (type) && (TYPE_UNSIGNED (type) != unsignedp))
{
tree inttype = (unsignedp)
? d_unsigned_type (type) : d_signed_type (type);
ret = fold_build2 (code, inttype, arg0, arg1);
}
else
{
/* If the operation needs excess precision. */
tree eptype = excess_precision_type (type);
if (eptype != NULL_TREE)
{
arg0 = d_convert (eptype, arg0);
arg1 = d_convert (eptype, arg1);
}
else
eptype = type;
/* Front-end does not do this conversion and GCC does not
always do it right. */
if (COMPLEX_FLOAT_TYPE_P (t0) && !COMPLEX_FLOAT_TYPE_P (t1))
arg1 = d_convert (t0, arg1);
else if (COMPLEX_FLOAT_TYPE_P (t1) && !COMPLEX_FLOAT_TYPE_P (t0))
arg0 = d_convert (t1, arg0);
ret = fold_build2 (code, eptype, arg0, arg1);
}
return d_convert (type, ret);
}
/* Build a binary expression of code CODE, assigning the result into E1. */
tree binop_assignment (tree_code code, Expression *e1, Expression *e2)
{
/* Skip casts for lhs assignment. */
Expression *e1b = e1;
while (e1b->op == TOKcast)
{
CastExp *ce = (CastExp *) e1b;
gcc_assert (same_type_p (ce->type, ce->to));
e1b = ce->e1;
}
/* Stabilize LHS for assignment. */
tree lhs = build_expr (e1b);
tree lexpr = stabilize_expr (&lhs);
/* The LHS expression could be an assignment, to which it's operation gets
lost during gimplification. */
if (TREE_CODE (lhs) == MODIFY_EXPR)
{
lexpr = compound_expr (lexpr, lhs);
lhs = TREE_OPERAND (lhs, 0);
}
lhs = stabilize_reference (lhs);
/* Save RHS, to ensure that the expression is evaluated before LHS. */
tree rhs = build_expr (e2);
tree rexpr = d_save_expr (rhs);
rhs = this->binary_op (code, build_ctype (e1->type),
convert_expr (lhs, e1b->type, e1->type), rexpr);
if (TREE_SIDE_EFFECTS (rhs))
rhs = compound_expr (rexpr, rhs);
tree expr = modify_expr (lhs, convert_expr (rhs, e1->type, e1b->type));
return compound_expr (lexpr, expr);
}
public:
ExprVisitor (bool constp)
{
this->result_ = NULL_TREE;
this->constp_ = constp;
}
tree result (void)
{
return this->result_;
}
/* Visitor interfaces, each Expression class should have
overridden the default. */
void visit (Expression *)
{
gcc_unreachable ();
}
/* Build a conditional expression. If either the second or third
expression is void, then the resulting type is void. Otherwise
they are implicitly converted to a common type. */
void visit (CondExp *e)
{
tree cond = convert_for_condition (build_expr (e->econd),
e->econd->type);
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
if (e->type->ty != Tvoid)
{
t1 = convert_expr (t1, e->e1->type, e->type);
t2 = convert_expr (t2, e->e2->type, e->type);
}
this->result_ = build_condition (build_ctype (e->type), cond, t1, t2);
}
/* Build an identity comparison expression. Operands go through the
usual conversions to bring them to a common type before comparison.
The result type is bool. */
void visit (IdentityExp *e)
{
tree_code code = (e->op == TOKidentity) ? EQ_EXPR : NE_EXPR;
Type *tb1 = e->e1->type->toBasetype ();
Type *tb2 = e->e2->type->toBasetype ();
if ((tb1->ty == Tsarray || tb1->ty == Tarray)
&& (tb2->ty == Tsarray || tb2->ty == Tarray))
{
/* For static and dynamic arrays, identity is defined as referring to
the same array elements and the same number of elements. */
tree t1 = d_array_convert (e->e1);
tree t2 = d_array_convert (e->e2);
this->result_ = d_convert (build_ctype (e->type),
build_boolop (code, t1, t2));
}
else if (tb1->isfloating () && tb1->ty != Tvector)
{
/* For floating point values, identity is defined as the bits in the
operands being identical. */
tree t1 = d_save_expr (build_expr (e->e1));
tree t2 = d_save_expr (build_expr (e->e2));
tree tmemcmp = builtin_decl_explicit (BUILT_IN_MEMCMP);
tree size = size_int (TYPE_PRECISION (TREE_TYPE (t1)) / BITS_PER_UNIT);
tree result = build_call_expr (tmemcmp, 3, build_address (t1),
build_address (t2), size);
this->result_ = build_boolop (code, result, integer_zero_node);
}
else if (tb1->ty == Tstruct)
{
/* For struct objects, identity is defined as bits in operands being
identical also. Alignment holes in structs are ignored. */
StructDeclaration *sd = ((TypeStruct *) tb1)->sym;
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
gcc_assert (same_type_p (tb1, tb2));
this->result_ = build_struct_comparison (code, sd, t1, t2);
}
else
{
/* For operands of other types, identity is defined as being the
same as equality expressions. */
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
this->result_ = d_convert (build_ctype (e->type),
build_boolop (code, t1, t2));
}
}
/* Build an equality expression, which compare the two operands for either
equality or inequality. Operands go through the usual conversions to bring
them to a common type before comparison. The result type is bool. */
void visit (EqualExp *e)
{
Type *tb1 = e->e1->type->toBasetype ();
Type *tb2 = e->e2->type->toBasetype ();
tree_code code = (e->op == TOKequal) ? EQ_EXPR : NE_EXPR;
if ((tb1->ty == Tsarray || tb1->ty == Tarray)
&& (tb2->ty == Tsarray || tb2->ty == Tarray))
{
/* For static and dynamic arrays, equality is defined as the lengths of
the arrays matching, and all the elements are equal. */
Type *t1elem = tb1->nextOf ()->toBasetype ();
Type *t2elem = tb1->nextOf ()->toBasetype ();
/* Check if comparisons of arrays can be optimized using memcmp.
This will inline EQ expressions as:
e1.length == e2.length && memcmp(e1.ptr, e2.ptr, size) == 0;
Or when generating a NE expression:
e1.length != e2.length || memcmp(e1.ptr, e2.ptr, size) != 0; */
if ((t1elem->isintegral () || t1elem->ty == Tvoid
|| (t1elem->ty == Tstruct && !((TypeStruct *)t1elem)->sym->xeq))
&& t1elem->ty == t2elem->ty)
{
tree t1 = d_array_convert (e->e1);
tree t2 = d_array_convert (e->e2);
tree result;
/* Make temporaries to prevent multiple evaluations. */
tree t1saved = d_save_expr (t1);
tree t2saved = d_save_expr (t2);
/* Length of arrays, for comparisons done before calling memcmp. */
tree t1len = d_array_length (t1saved);
tree t2len = d_array_length (t2saved);
/* Reference to array data. */
tree t1ptr = d_array_ptr (t1saved);
tree t2ptr = d_array_ptr (t2saved);
/* Compare arrays using memcmp if possible, otherwise for structs,
each field is compared inline. */
if (t1elem->ty != Tstruct
|| identity_compare_p (((TypeStruct *) t1elem)->sym))
{
tree size = size_mult_expr (t1len, size_int (t1elem->size ()));
tree tmemcmp = builtin_decl_explicit (BUILT_IN_MEMCMP);
result = build_call_expr (tmemcmp, 3, t1ptr, t2ptr, size);
result = build_boolop (code, result, integer_zero_node);
}
else
{
StructDeclaration *sd = ((TypeStruct *) t1elem)->sym;
result = build_array_struct_comparison (code, sd, t1len,
t1ptr, t2ptr);
}
/* Check array length first before passing to memcmp.
For equality expressions, this becomes:
(e1.length == 0 || memcmp);
Otherwise for inequality:
(e1.length != 0 && memcmp); */
tree tsizecmp = build_boolop (code, t1len, size_zero_node);
if (e->op == TOKequal)
result = build_boolop (TRUTH_ORIF_EXPR, tsizecmp, result);
else
result = build_boolop (TRUTH_ANDIF_EXPR, tsizecmp, result);
/* Finally, check if lengths of both arrays match if dynamic.
The frontend should have already guaranteed that static arrays
have same size. */
if (tb1->ty == Tsarray && tb2->ty == Tsarray)
gcc_assert (tb1->size () == tb2->size ());
else
{
tree tlencmp = build_boolop (code, t1len, t2len);
if (e->op == TOKequal)
result = build_boolop (TRUTH_ANDIF_EXPR, tlencmp, result);
else
result = build_boolop (TRUTH_ORIF_EXPR, tlencmp, result);
}
/* Ensure left-to-right order of evaluation. */
if (TREE_SIDE_EFFECTS (t2))
result = compound_expr (t2saved, result);
if (TREE_SIDE_EFFECTS (t1))
result = compound_expr (t1saved, result);
this->result_ = result;
}
else
{
/* Use _adEq2() to compare each element. */
Type *t1array = t1elem->arrayOf ();
tree result = build_libcall (LIBCALL_ADEQ2, e->type, 3,
d_array_convert (e->e1),
d_array_convert (e->e2),
build_typeinfo (t1array));
if (e->op == TOKnotequal)
result = build1 (TRUTH_NOT_EXPR, build_ctype (e->type), result);
this->result_ = result;
}
}
else if (tb1->ty == Tstruct)
{
/* Equality for struct objects means the logical product of all
equality results of the corresponding object fields. */
StructDeclaration *sd = ((TypeStruct *) tb1)->sym;
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
gcc_assert (same_type_p (tb1, tb2));
this->result_ = build_struct_comparison (code, sd, t1, t2);
}
else if (tb1->ty == Taarray && tb2->ty == Taarray)
{
/* Use _aaEqual() for associative arrays. */
TypeAArray *taa1 = (TypeAArray *) tb1;
tree result = build_libcall (LIBCALL_AAEQUAL, e->type, 3,
build_typeinfo (taa1),
build_expr (e->e1),
build_expr (e->e2));
if (e->op == TOKnotequal)
result = build1 (TRUTH_NOT_EXPR, build_ctype (e->type), result);
this->result_ = result;
}
else
{
/* For operands of other types, equality is defined as the bit pattern
of the type matches exactly. */
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
this->result_ = d_convert (build_ctype (e->type),
build_boolop (code, t1, t2));
}
}
/* Build an `in' expression. This is a condition to see if an element
exists in an associative array. The result is a pointer to the
element, or null if false. */
void visit (InExp *e)
{
Type *tb2 = e->e2->type->toBasetype ();
gcc_assert (tb2->ty == Taarray);
Type *tkey = ((TypeAArray *) tb2)->index->toBasetype ();
tree key = convert_expr (build_expr (e->e1), e->e1->type, tkey);
/* Build a call to _aaInX(). */
this->result_ = build_libcall (LIBCALL_AAINX, e->type, 3,
build_expr (e->e2),
build_typeinfo (tkey),
build_address (key));
}
/* Build a relational expression. The result type is bool. */
void visit (CmpExp *e)
{
Type *tb1 = e->e1->type->toBasetype ();
Type *tb2 = e->e2->type->toBasetype ();
tree result;
tree_code code;
switch (e->op)
{
case TOKle:
code = LE_EXPR;
break;
case TOKlt:
code = LT_EXPR;
break;
case TOKge:
code = GE_EXPR;
break;
case TOKgt:
code = GT_EXPR;
break;
default:
gcc_unreachable ();
}
if ((tb1->ty == Tsarray || tb1->ty == Tarray)
&& (tb2->ty == Tsarray || tb2->ty == Tarray))
{
/* For static and dynamic arrays, the result of the relational op is
the result of the operator applied to the first non-equal element
of the array. If two arrays compare equal, but are of different
lengths, the shorter array compares as less than the longer. */
Type *telem = tb1->nextOf ()->toBasetype ();
tree call = build_libcall (LIBCALL_ADCMP2, Type::tint32, 3,
d_array_convert (e->e1),
d_array_convert (e->e2),
build_typeinfo (telem->arrayOf ()));
result = build_boolop (code, call, integer_zero_node);
this->result_ = d_convert (build_ctype (e->type), result);
return;
}
/* Simple comparison. */
result = build_boolop (code, build_expr (e->e1), build_expr (e->e2));
this->result_ = d_convert (build_ctype (e->type), result);
}
/* Build an `and if' expression. If the right operand expression is void,
then the resulting type is void. Otherwise the result is bool. */
void visit (AndAndExp *e)
{
if (e->e2->type->toBasetype ()->ty != Tvoid)
{
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
t1 = convert_for_condition (t1, e->e1->type);
t2 = convert_for_condition (t2, e->e2->type);
this->result_ = d_convert (build_ctype (e->type),
build_boolop (TRUTH_ANDIF_EXPR, t1, t2));
}
else
{
tree t1 = convert_for_condition (build_expr (e->e1), e->e1->type);
tree t2 = build_expr_dtor (e->e2);
this->result_ = build_condition (build_ctype (e->type),
t1, t2, void_node);
}
}
/* Build an `or if' expression. If the right operand expression is void,
then the resulting type is void. Otherwise the result is bool. */
void visit (OrOrExp *e)
{
if (e->e2->type->toBasetype ()->ty != Tvoid)
{
tree t1 = convert_for_condition (build_expr (e->e1), e->e1->type);
tree t2 = convert_for_condition (build_expr (e->e2), e->e2->type);
this->result_ = d_convert (build_ctype (e->type),
build_boolop (TRUTH_ORIF_EXPR, t1, t2));
}
else
{
tree t1 = convert_for_condition (build_expr (e->e1), e->e1->type);
tree t2 = build_expr_dtor (e->e2);
tree cond = build1 (TRUTH_NOT_EXPR, bool_type_node, t1);
this->result_ = build_condition (build_ctype (e->type),
cond, t2, void_node);
}
}
/* Build a binary operand expression. Operands go through usual arithmetic
conversions to bring them to a common type before evaluating. */
void visit (BinExp *e)
{
tree_code code;
switch (e->op)
{
case TOKadd:
case TOKmin:
if ((e->e1->type->isreal () && e->e2->type->isimaginary ())
|| (e->e1->type->isimaginary () && e->e2->type->isreal ()))
{
/* If the result is complex, then we can shortcut binary_op.
Frontend should have already validated types and sizes. */
tree t1 = build_expr (e->e1);
tree t2 = build_expr (e->e2);
if (e->op == TOKmin)
t2 = build1 (NEGATE_EXPR, TREE_TYPE (t2), t2);
if (e->e1->type->isreal ())
this->result_ = complex_expr (build_ctype (e->type), t1, t2);
else
this->result_ = complex_expr (build_ctype (e->type), t2, t1);
return;
}
else
code = (e->op == TOKadd)
? PLUS_EXPR : MINUS_EXPR;
break;
case TOKmul:
code = MULT_EXPR;
break;
case TOKdiv:
code = e->e1->type->isintegral ()
? TRUNC_DIV_EXPR : RDIV_EXPR;
break;
case TOKmod:
code = e->e1->type->isfloating ()
? FLOAT_MOD_EXPR : TRUNC_MOD_EXPR;
break;
case TOKand:
code = BIT_AND_EXPR;
break;
case TOKor:
code = BIT_IOR_EXPR;
break;
case TOKxor:
code = BIT_XOR_EXPR;
break;
case TOKshl:
code = LSHIFT_EXPR;
break;
case TOKshr:
code = RSHIFT_EXPR;
break;
case TOKushr:
code = UNSIGNED_RSHIFT_EXPR;
break;
default:
gcc_unreachable ();
}
this->result_ = this->binary_op (code, build_ctype (e->type),
build_expr (e->e1), build_expr (e->e2));
}
/* Build a power expression, which raises its left operand to the power of
its right operand. */
void visit (PowExp *e)
{
/* Result type determines what version of pow() we call. */
tree powtype = build_ctype (e->type->toBasetype ());
/* If type is int, implicitly convert to double. This allows backend
to fold the call into a constant return value. */
if (e->type->isintegral ())
powtype = double_type_node;
/* Lookup compatible builtin. */
tree powfn = NULL_TREE;
if (TYPE_MAIN_VARIANT (powtype) == double_type_node)
powfn = builtin_decl_explicit (BUILT_IN_POW);
else if (TYPE_MAIN_VARIANT (powtype) == float_type_node)
powfn = builtin_decl_explicit (BUILT_IN_POWF);
else if (TYPE_MAIN_VARIANT (powtype) == long_double_type_node)
powfn = builtin_decl_explicit (BUILT_IN_POWL);
if (powfn == NULL_TREE)
{
Type *tb1 = e->e1->type->toBasetype ();
if (tb1->ty == Tarray || tb1->ty == Tsarray)
error ("Array operation %s not implemented", e->toChars ());
else
error ("%s ^^ %s is not supported",
e->e1->type->toChars (), e->e2->type->toChars ());
this->result_ = error_mark_node;
return;
}
tree t1 = d_convert (powtype, build_expr (e->e1));
tree t2 = d_convert (powtype, build_expr (e->e2));
this->result_ = d_convert (build_ctype (e->type),
build_call_expr (powfn, 2, t1, t2));
}
/* Build a concat expression, which concatenates two or more arrays of the
same type, producing a dynamic array with the result. If one operand
is an element type, that element is converted to an array of length 1. */
void visit (CatExp *e)
{
Type *tb1 = e->e1->type->toBasetype ();
Type *tb2 = e->e2->type->toBasetype ();
Type *etype;
if (tb1->ty == Tarray || tb1->ty == Tsarray)
etype = tb1->nextOf ();
else
etype = tb2->nextOf ();
vec<tree, va_gc> *elemvars = NULL;
tree result;
if (e->e1->op == TOKcat)
{
/* Flatten multiple concatenations to an array.
So the expression ((a ~ b) ~ c) becomes [a, b, c] */
int ndims = 2;
for (Expression *ex = e->e1; ex->op == TOKcat;)
{
if (ex->op == TOKcat)
{
ex = ((CatExp *) ex)->e1;
ndims++;
}
}
/* Store all concatenation args to a temporary byte[][ndims] array. */
Type *targselem = Type::tint8->arrayOf ();
tree var = create_temporary_var (make_array_type (targselem, ndims));
tree init = build_constructor (TREE_TYPE (var), NULL);
vec_safe_push (elemvars, var);
/* Loop through each concatenation from right to left. */
vec<constructor_elt, va_gc> *elms = NULL;
CatExp *ce = e;
int dim = ndims - 1;
for (Expression *oe = ce->e2; oe != NULL;
(ce->e1->op != TOKcat
? (oe = ce->e1)
: (ce = (CatExp *)ce->e1, oe = ce->e2)))
{
tree arg = d_array_convert (etype, oe, &elemvars);
tree index = size_int (dim);
CONSTRUCTOR_APPEND_ELT (elms, index, d_save_expr (arg));
/* Finished pushing all arrays. */
if (oe == ce->e1)
break;
dim -= 1;
}
/* Check there is no logic bug in constructing byte[][] of arrays. */
gcc_assert (dim == 0);
CONSTRUCTOR_ELTS (init) = elms;
DECL_INITIAL (var) = init;
tree arrs = d_array_value (build_ctype (targselem->arrayOf ()),
size_int (ndims), build_address (var));
result = build_libcall (LIBCALL_ARRAYCATNTX, e->type, 2,
build_typeinfo (e->type), arrs);
}
else
{
/* Handle single concatenation (a ~ b). */
result = build_libcall (LIBCALL_ARRAYCATT, e->type, 3,
build_typeinfo (e->type),
d_array_convert (etype, e->e1, &elemvars),
d_array_convert (etype, e->e2, &elemvars));
}
for (size_t i = 0; i < vec_safe_length (elemvars); ++i)
result = bind_expr ((*elemvars)[i], result);
this->result_ = result;
}
/* Build a assignment operator expression. The right operand is implicitly
converted to the type of the left operand, and assigned to it. */
void visit (BinAssignExp *e)
{
tree_code code;
Expression *e1b = e->e1;
switch (e->op)
{
case TOKaddass:
code = PLUS_EXPR;
break;
case TOKminass:
code = MINUS_EXPR;
break;
case TOKmulass:
code = MULT_EXPR;
break;
case TOKdivass:
code = e->e1->type->isintegral ()
? TRUNC_DIV_EXPR : RDIV_EXPR;
break;
case TOKmodass:
code = e->e1->type->isfloating ()
? FLOAT_MOD_EXPR : TRUNC_MOD_EXPR;
break;
case TOKandass:
code = BIT_AND_EXPR;
break;
case TOKorass:
code = BIT_IOR_EXPR;
break;
case TOKxorass:
code = BIT_XOR_EXPR;
break;
case TOKpowass:
gcc_unreachable ();
case TOKshlass:
code = LSHIFT_EXPR;
break;
case TOKshrass:
case TOKushrass:
/* Use the original lhs type before it was promoted. The left operand
of `>>>=' does not undergo integral promotions before shifting.
Strip off casts just incase anyway. */
while (e1b->op == TOKcast)
{
CastExp *ce = (CastExp *) e1b;
gcc_assert (same_type_p (ce->type, ce->to));
e1b = ce->e1;
}
code = (e->op == TOKshrass) ? RSHIFT_EXPR : UNSIGNED_RSHIFT_EXPR;
break;
default:
gcc_unreachable ();
}
tree exp = this->binop_assignment (code, e1b, e->e2);
this->result_ = convert_expr (exp, e1b->type, e->type);
}
/* Build a concat assignment expression. The right operand is appended
to the the left operand. */
void visit (CatAssignExp *e)
{
Type *tb1 = e->e1->type->toBasetype ();
Type *tb2 = e->e2->type->toBasetype ();
Type *etype = tb1->nextOf ()->toBasetype ();
if (tb1->ty == Tarray && tb2->ty == Tdchar
&& (etype->ty == Tchar || etype->ty == Twchar))
{
/* Append a dchar to a char[] or wchar[] */
libcall_fn libcall = (etype->ty == Tchar)
? LIBCALL_ARRAYAPPENDCD : LIBCALL_ARRAYAPPENDWD;
this->result_ = build_libcall (libcall, e->type, 2,
build_address (build_expr (e->e1)),
build_expr (e->e2));
}
else
{
gcc_assert (tb1->ty == Tarray || tb2->ty == Tsarray);
tree tinfo = build_typeinfo (e->type);
tree ptr = build_address (build_expr (e->e1));
if ((tb2->ty == Tarray || tb2->ty == Tsarray)
&& same_type_p (etype, tb2->nextOf ()->toBasetype ()))
{
/* Append an array. */
this->result_ = build_libcall (LIBCALL_ARRAYAPPENDT, e->type, 3,
tinfo, ptr, d_array_convert (e->e2));
}
else if (same_type_p (etype, tb2))
{
/* Append an element. */
tree result = build_libcall (LIBCALL_ARRAYAPPENDCTX, e->type, 3,
tinfo, ptr, size_one_node);
result = d_save_expr (result);
/* Assign e2 to last element. */
tree offexp = d_array_length (result);
offexp = build2 (MINUS_EXPR, TREE_TYPE (offexp),
offexp, size_one_node);
offexp = d_save_expr (offexp);
tree ptrexp = d_array_ptr (result);
ptrexp = void_okay_p (ptrexp);
ptrexp = build_array_index (ptrexp, offexp);
/* Evaluate expression before appending. */
tree t2 = build_expr (e->e2);
tree expr = stabilize_expr (&t2);
t2 = d_save_expr (t2);
result = modify_expr (build_deref (ptrexp), t2);
result = compound_expr (t2, result);
this->result_ = compound_expr (expr, result);
}
else
gcc_unreachable ();
}
}
/* Build an assignment expression. The right operand is implicitly
converted to the type of the left operand, and assigned to it. */
void visit (AssignExp *e)
{
/* First, handle special assignment semantics. */
/* Look for array.length = n; */
if (e->e1->op == TOKarraylength)
{
/* Assignment to an array's length property; resize the array. */
ArrayLengthExp *ale = (ArrayLengthExp *) e->e1;
tree newlength = convert_expr (build_expr (e->e2), e->e2->type,
Type::tsize_t);
tree ptr = build_address (build_expr (ale->e1));
/* Don't want the basetype for the element type. */
Type *etype = ale->e1->type->toBasetype ()->nextOf ();
libcall_fn libcall = etype->isZeroInit ()
? LIBCALL_ARRAYSETLENGTHT : LIBCALL_ARRAYSETLENGTHIT;
tree result = build_libcall (libcall, ale->e1->type, 3,
build_typeinfo (ale->e1->type),
newlength, ptr);
this->result_ = d_array_length (result);
return;
}
/* Look for array[] = n; */
if (e->e1->op == TOKslice)
{
SliceExp *se = (SliceExp *) e->e1;
Type *stype = se->e1->type->toBasetype ();
Type *etype = stype->nextOf ()->toBasetype ();
/* Determine if we need to run postblit or dtor. */
bool postblit = this->needs_postblit (etype) && this->lvalue_p (e->e2);
bool destructor = this->needs_dtor (etype);
if (e->memset & blockAssign)
{
/* Set a range of elements to one value. */
tree t1 = d_save_expr (build_expr (e->e1));
tree t2 = build_expr (e->e2);
tree result;
if ((postblit || destructor) && e->op != TOKblit)
{
libcall_fn libcall = (e->op == TOKconstruct)
? LIBCALL_ARRAYSETCTOR : LIBCALL_ARRAYSETASSIGN;
/* So we can call postblits on const/immutable objects. */
tree ti = build_typeinfo (etype->unSharedOf ()->mutableOf ());
tree result = build_libcall (libcall, Type::tvoid, 4,
d_array_ptr (t1),
build_address (t2),
d_array_length (t1), ti);
this->result_ = compound_expr (result, t1);
return;
}
if (integer_zerop (t2))
{
tree tmemset = builtin_decl_explicit (BUILT_IN_MEMSET);
tree size = size_mult_expr (d_array_length (t1),
size_int (etype->size ()));
result = build_call_expr (tmemset, 3, d_array_ptr (t1),
integer_zero_node, size);
}
else
result = build_array_set (d_array_ptr (t1),
d_array_length (t1), t2);
this->result_ = compound_expr (result, t1);
}
else
{
/* Perform a memcpy operation. */