Mercurial > projects > ldc
annotate dmd/optimize.c @ 883:b52d5de7783f
GC defines and linkage changes.
author | Christian Kamm <kamm incasoftware de> |
---|---|
date | Thu, 08 Jan 2009 18:20:02 +0100 |
parents | 330f999ade44 |
children | d8c44f1e08e1 |
rev | line source |
---|---|
336 | 1 |
2 // Compiler implementation of the D programming language | |
3 // Copyright (c) 1999-2007 by Digital Mars | |
4 // All Rights Reserved | |
5 // written by Walter Bright | |
6 // http://www.digitalmars.com | |
7 // License for redistribution is by either the Artistic License | |
8 // in artistic.txt, or the GNU General Public License in gnu.txt. | |
9 // See the included readme.txt for details. | |
10 | |
11 #include <stdio.h> | |
12 #include <ctype.h> | |
13 #include <assert.h> | |
14 #include <math.h> | |
15 | |
16 #if __DMC__ | |
17 #include <complex.h> | |
18 #endif | |
19 | |
20 #include "lexer.h" | |
21 #include "mtype.h" | |
22 #include "expression.h" | |
23 #include "declaration.h" | |
24 #include "aggregate.h" | |
25 #include "init.h" | |
26 | |
27 | |
28 #ifdef IN_GCC | |
29 #include "d-gcc-real.h" | |
30 | |
31 /* %% fix? */ | |
32 extern "C" bool real_isnan (const real_t *); | |
33 #endif | |
34 | |
35 static real_t zero; // work around DMC bug for now | |
36 | |
37 | |
38 /************************************* | |
39 * If expression is a variable with a const initializer, | |
40 * return that initializer. | |
41 */ | |
42 | |
43 Expression *fromConstInitializer(Expression *e1) | |
44 { | |
45 //printf("fromConstInitializer(%s)\n", e1->toChars()); | |
46 if (e1->op == TOKvar) | |
47 { VarExp *ve = (VarExp *)e1; | |
48 VarDeclaration *v = ve->var->isVarDeclaration(); | |
49 if (v && v->isConst() && v->init) | |
50 { Expression *ei = v->init->toExpression(); | |
51 if (ei && ei->type) | |
52 e1 = ei; | |
53 } | |
54 } | |
55 return e1; | |
56 } | |
57 | |
58 | |
59 Expression *Expression::optimize(int result) | |
60 { | |
61 //printf("Expression::optimize(result = x%x) %s\n", result, toChars()); | |
62 return this; | |
63 } | |
64 | |
65 Expression *VarExp::optimize(int result) | |
66 { | |
67 if (result & WANTinterpret) | |
68 { | |
69 return fromConstInitializer(this); | |
70 } | |
71 return this; | |
72 } | |
73 | |
74 Expression *TupleExp::optimize(int result) | |
75 { | |
76 for (size_t i = 0; i < exps->dim; i++) | |
77 { Expression *e = (Expression *)exps->data[i]; | |
78 | |
79 e = e->optimize(WANTvalue | (result & WANTinterpret)); | |
80 exps->data[i] = (void *)e; | |
81 } | |
82 return this; | |
83 } | |
84 | |
85 Expression *ArrayLiteralExp::optimize(int result) | |
86 { | |
87 if (elements) | |
88 { | |
89 for (size_t i = 0; i < elements->dim; i++) | |
90 { Expression *e = (Expression *)elements->data[i]; | |
91 | |
92 e = e->optimize(WANTvalue | (result & WANTinterpret)); | |
93 elements->data[i] = (void *)e; | |
94 } | |
95 } | |
96 return this; | |
97 } | |
98 | |
99 Expression *AssocArrayLiteralExp::optimize(int result) | |
100 { | |
101 assert(keys->dim == values->dim); | |
102 for (size_t i = 0; i < keys->dim; i++) | |
103 { Expression *e = (Expression *)keys->data[i]; | |
104 | |
105 e = e->optimize(WANTvalue | (result & WANTinterpret)); | |
106 keys->data[i] = (void *)e; | |
107 | |
108 e = (Expression *)values->data[i]; | |
109 e = e->optimize(WANTvalue | (result & WANTinterpret)); | |
110 values->data[i] = (void *)e; | |
111 } | |
112 return this; | |
113 } | |
114 | |
115 Expression *StructLiteralExp::optimize(int result) | |
116 { | |
117 if (elements) | |
118 { | |
119 for (size_t i = 0; i < elements->dim; i++) | |
120 { Expression *e = (Expression *)elements->data[i]; | |
121 if (!e) | |
122 continue; | |
123 e = e->optimize(WANTvalue | (result & WANTinterpret)); | |
124 elements->data[i] = (void *)e; | |
125 } | |
126 } | |
127 return this; | |
128 } | |
129 | |
130 Expression *TypeExp::optimize(int result) | |
131 { | |
132 return this; | |
133 } | |
134 | |
135 Expression *UnaExp::optimize(int result) | |
136 { | |
137 e1 = e1->optimize(result); | |
138 return this; | |
139 } | |
140 | |
141 Expression *NegExp::optimize(int result) | |
142 { Expression *e; | |
143 | |
144 e1 = e1->optimize(result); | |
145 if (e1->isConst() == 1) | |
146 { | |
147 e = Neg(type, e1); | |
148 } | |
149 else | |
150 e = this; | |
151 return e; | |
152 } | |
153 | |
154 Expression *ComExp::optimize(int result) | |
155 { Expression *e; | |
156 | |
157 e1 = e1->optimize(result); | |
158 if (e1->isConst() == 1) | |
159 { | |
160 e = Com(type, e1); | |
161 } | |
162 else | |
163 e = this; | |
164 return e; | |
165 } | |
166 | |
167 Expression *NotExp::optimize(int result) | |
168 { Expression *e; | |
169 | |
170 e1 = e1->optimize(result); | |
171 if (e1->isConst() == 1) | |
172 { | |
173 e = Not(type, e1); | |
174 } | |
175 else | |
176 e = this; | |
177 return e; | |
178 } | |
179 | |
180 Expression *BoolExp::optimize(int result) | |
181 { Expression *e; | |
182 | |
183 e1 = e1->optimize(result); | |
184 if (e1->isConst() == 1) | |
185 { | |
186 e = Bool(type, e1); | |
187 } | |
188 else | |
189 e = this; | |
190 return e; | |
191 } | |
192 | |
193 Expression *AddrExp::optimize(int result) | |
194 { Expression *e; | |
195 | |
196 //printf("AddrExp::optimize(result = %d) %s\n", result, toChars()); | |
197 e1 = e1->optimize(result); | |
198 // Convert &*ex to ex | |
199 if (e1->op == TOKstar) | |
200 { Expression *ex; | |
201 | |
202 ex = ((PtrExp *)e1)->e1; | |
203 if (type->equals(ex->type)) | |
204 e = ex; | |
205 else | |
206 { | |
207 e = ex->copy(); | |
208 e->type = type; | |
209 } | |
210 return e; | |
211 } | |
212 #if !IN_LLVM | |
213 if (e1->op == TOKvar) | |
214 { VarExp *ve = (VarExp *)e1; | |
215 if (!ve->var->isOut() && !ve->var->isRef() && | |
216 !ve->var->isImportedSymbol()) | |
217 { | |
218 e = new SymOffExp(loc, ve->var, 0); | |
219 e->type = type; | |
220 return e; | |
221 } | |
222 } | |
223 if (e1->op == TOKindex) | |
224 { // Convert &array[n] to &array+n | |
225 IndexExp *ae = (IndexExp *)e1; | |
226 | |
227 if (ae->e2->op == TOKint64 && ae->e1->op == TOKvar) | |
228 { | |
229 integer_t index = ae->e2->toInteger(); | |
230 VarExp *ve = (VarExp *)ae->e1; | |
231 if (ve->type->ty == Tsarray && ve->type->next->ty != Tbit | |
232 && !ve->var->isImportedSymbol()) | |
233 { | |
234 TypeSArray *ts = (TypeSArray *)ve->type; | |
235 integer_t dim = ts->dim->toInteger(); | |
236 if (index < 0 || index >= dim) | |
237 error("array index %lld is out of bounds [0..%lld]", index, dim); | |
238 e = new SymOffExp(loc, ve->var, index * ts->next->size()); | |
239 e->type = type; | |
240 return e; | |
241 } | |
242 } | |
243 } | |
244 #endif | |
245 return this; | |
246 } | |
247 | |
248 Expression *PtrExp::optimize(int result) | |
249 { | |
250 //printf("PtrExp::optimize(result = x%x) %s\n", result, toChars()); | |
251 e1 = e1->optimize(result); | |
252 // Convert *&ex to ex | |
253 if (e1->op == TOKaddress) | |
254 { Expression *e; | |
255 Expression *ex; | |
256 | |
257 ex = ((AddrExp *)e1)->e1; | |
258 if (type->equals(ex->type)) | |
259 e = ex; | |
260 else | |
261 { | |
262 e = ex->copy(); | |
263 e->type = type; | |
264 } | |
265 return e; | |
266 } | |
267 // Constant fold *(&structliteral + offset) | |
268 if (e1->op == TOKadd) | |
269 { | |
270 Expression *e; | |
271 e = Ptr(type, e1); | |
272 if (e != EXP_CANT_INTERPRET) | |
273 return e; | |
274 } | |
275 | |
276 return this; | |
277 } | |
278 | |
588
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
279 Expression *DotVarExp::optimize(int result) |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
280 { |
875
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
281 //printf("DotVarExp::optimize(result = x%x) %s\n", result, toChars()); |
588
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
282 e1 = e1->optimize(result); |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
283 |
875
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
284 #if DMDV2 |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
285 if (e1->op == TOKvar) |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
286 { VarExp *ve = (VarExp *)e1; |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
287 VarDeclaration *v = ve->var->isVarDeclaration(); |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
288 Expression *e = expandVar(result, v); |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
289 if (e && e->op == TOKstructliteral) |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
290 { StructLiteralExp *sle = (StructLiteralExp *)e; |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
291 VarDeclaration *vf = var->isVarDeclaration(); |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
292 if (vf) |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
293 { |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
294 e = sle->getField(type, vf->offset); |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
295 if (e != EXP_CANT_INTERPRET) |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
296 return e; |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
297 } |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
298 } |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
299 } |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
300 else |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
301 #endif |
588
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
302 if (e1->op == TOKstructliteral) |
875
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
303 { StructLiteralExp *sle = (StructLiteralExp *)e1; |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
304 VarDeclaration *vf = var->isVarDeclaration(); |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
305 if (vf) |
588
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
306 { |
875
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
307 Expression *e = sle->getField(type, vf->offset); |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
308 if (e != EXP_CANT_INTERPRET) |
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
309 return e; |
588
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
310 } |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
311 } |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
312 |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
313 return this; |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
314 } |
870652a9af23
Constant fold structliteral.member again.
Christian Kamm <kamm incasoftware de>
parents:
336
diff
changeset
|
315 |
336 | 316 Expression *CallExp::optimize(int result) |
317 { Expression *e = this; | |
318 | |
319 e1 = e1->optimize(result); | |
320 if (e1->op == TOKvar && result & WANTinterpret) | |
321 { | |
322 FuncDeclaration *fd = ((VarExp *)e1)->var->isFuncDeclaration(); | |
323 if (fd) | |
324 { | |
325 Expression *eresult = fd->interpret(NULL, arguments); | |
326 if (eresult && eresult != EXP_VOID_INTERPRET) | |
327 e = eresult; | |
328 else if (result & WANTinterpret) | |
329 error("cannot evaluate %s at compile time", toChars()); | |
330 } | |
331 } | |
332 return e; | |
333 } | |
334 | |
335 | |
336 Expression *CastExp::optimize(int result) | |
337 { | |
338 //printf("CastExp::optimize(result = %d) %s\n", result, toChars()); | |
339 //printf("from %s to %s\n", type->toChars(), to->toChars()); | |
340 //printf("from %s\n", type->toChars()); | |
875
330f999ade44
Merged DMD 1.038
Tomas Lindquist Olsen <tomas.l.olsen@gmail.com>
parents:
588
diff
changeset
|
341 //printf("e1->type %s\n", e1->type->toChars()); |
336 | 342 //printf("type = %p\n", type); |
343 assert(type); | |
344 enum TOK op1 = e1->op; | |
345 | |
346 e1 = e1->optimize(result); | |
347 if (result & WANTinterpret) | |
348 e1 = fromConstInitializer(e1); | |
349 | |
350 if ((e1->op == TOKstring || e1->op == TOKarrayliteral) && | |
351 (type->ty == Tpointer || type->ty == Tarray) && | |
352 type->next->equals(e1->type->next) | |
353 ) | |
354 { | |
355 e1->type = type; | |
356 return e1; | |
357 } | |
358 /* The first test here is to prevent infinite loops | |
359 */ | |
360 if (op1 != TOKarrayliteral && e1->op == TOKarrayliteral) | |
361 return e1->castTo(NULL, to); | |
362 if (e1->op == TOKnull && | |
363 (type->ty == Tpointer || type->ty == Tclass)) | |
364 { | |
365 e1->type = type; | |
366 return e1; | |
367 } | |
368 | |
369 if (result & WANTflags && type->ty == Tclass && e1->type->ty == Tclass) | |
370 { | |
371 // See if we can remove an unnecessary cast | |
372 ClassDeclaration *cdfrom; | |
373 ClassDeclaration *cdto; | |
374 int offset; | |
375 | |
376 cdfrom = e1->type->isClassHandle(); | |
377 cdto = type->isClassHandle(); | |
378 if (cdto->isBaseOf(cdfrom, &offset) && offset == 0) | |
379 { | |
380 e1->type = type; | |
381 return e1; | |
382 } | |
383 } | |
384 | |
385 Expression *e; | |
386 | |
387 if (e1->isConst()) | |
388 { | |
389 if (e1->op == TOKsymoff) | |
390 { | |
391 if (type->size() == e1->type->size() && | |
392 type->toBasetype()->ty != Tsarray) | |
393 { | |
394 e1->type = type; | |
395 return e1; | |
396 } | |
397 return this; | |
398 } | |
399 if (to->toBasetype()->ty == Tvoid) | |
400 e = this; | |
401 else | |
402 e = Cast(type, to, e1); | |
403 } | |
404 else | |
405 e = this; | |
406 return e; | |
407 } | |
408 | |
409 Expression *BinExp::optimize(int result) | |
410 { | |
411 //printf("BinExp::optimize(result = %d) %s\n", result, toChars()); | |
412 e1 = e1->optimize(result); | |
413 e2 = e2->optimize(result); | |
414 if (op == TOKshlass || op == TOKshrass || op == TOKushrass) | |
415 { | |
416 if (e2->isConst() == 1) | |
417 { | |
418 integer_t i2 = e2->toInteger(); | |
419 d_uns64 sz = e1->type->size() * 8; | |
420 if (i2 < 0 || i2 > sz) | |
421 { | |
422 error("shift assign by %lld is outside the range 0..%"PRIuSIZE, i2, sz); | |
423 e2 = new IntegerExp(0); | |
424 } | |
425 } | |
426 } | |
427 return this; | |
428 } | |
429 | |
430 Expression *AddExp::optimize(int result) | |
431 { Expression *e; | |
432 | |
433 //printf("AddExp::optimize(%s)\n", toChars()); | |
434 e1 = e1->optimize(result); | |
435 e2 = e2->optimize(result); | |
436 if (e1->isConst() && e2->isConst()) | |
437 { | |
438 if (e1->op == TOKsymoff && e2->op == TOKsymoff) | |
439 return this; | |
440 e = Add(type, e1, e2); | |
441 } | |
442 else | |
443 e = this; | |
444 return e; | |
445 } | |
446 | |
447 Expression *MinExp::optimize(int result) | |
448 { Expression *e; | |
449 | |
450 e1 = e1->optimize(result); | |
451 e2 = e2->optimize(result); | |
452 if (e1->isConst() && e2->isConst()) | |
453 { | |
454 if (e2->op == TOKsymoff) | |
455 return this; | |
456 e = Min(type, e1, e2); | |
457 } | |
458 else | |
459 e = this; | |
460 return e; | |
461 } | |
462 | |
463 Expression *MulExp::optimize(int result) | |
464 { Expression *e; | |
465 | |
466 //printf("MulExp::optimize(result = %d) %s\n", result, toChars()); | |
467 e1 = e1->optimize(result); | |
468 e2 = e2->optimize(result); | |
469 if (e1->isConst() == 1 && e2->isConst() == 1) | |
470 { | |
471 e = Mul(type, e1, e2); | |
472 } | |
473 else | |
474 e = this; | |
475 return e; | |
476 } | |
477 | |
478 Expression *DivExp::optimize(int result) | |
479 { Expression *e; | |
480 | |
481 //printf("DivExp::optimize(%s)\n", toChars()); | |
482 e1 = e1->optimize(result); | |
483 e2 = e2->optimize(result); | |
484 if (e1->isConst() == 1 && e2->isConst() == 1) | |
485 { | |
486 e = Div(type, e1, e2); | |
487 } | |
488 else | |
489 e = this; | |
490 return e; | |
491 } | |
492 | |
493 Expression *ModExp::optimize(int result) | |
494 { Expression *e; | |
495 | |
496 e1 = e1->optimize(result); | |
497 e2 = e2->optimize(result); | |
498 if (e1->isConst() == 1 && e2->isConst() == 1) | |
499 { | |
500 e = Mod(type, e1, e2); | |
501 } | |
502 else | |
503 e = this; | |
504 return e; | |
505 } | |
506 | |
507 Expression *shift_optimize(int result, BinExp *e, Expression *(*shift)(Type *, Expression *, Expression *)) | |
508 { Expression *ex = e; | |
509 | |
510 e->e1 = e->e1->optimize(result); | |
511 e->e2 = e->e2->optimize(result); | |
512 if (e->e2->isConst() == 1) | |
513 { | |
514 integer_t i2 = e->e2->toInteger(); | |
515 d_uns64 sz = e->e1->type->size() * 8; | |
516 if (i2 < 0 || i2 > sz) | |
517 { | |
518 error("shift by %lld is outside the range 0..%"PRIuSIZE, i2, sz); | |
519 e->e2 = new IntegerExp(0); | |
520 } | |
521 if (e->e1->isConst() == 1) | |
522 ex = (*shift)(e->type, e->e1, e->e2); | |
523 } | |
524 return ex; | |
525 } | |
526 | |
527 Expression *ShlExp::optimize(int result) | |
528 { | |
529 //printf("ShlExp::optimize(result = %d) %s\n", result, toChars()); | |
530 return shift_optimize(result, this, Shl); | |
531 } | |
532 | |
533 Expression *ShrExp::optimize(int result) | |
534 { | |
535 //printf("ShrExp::optimize(result = %d) %s\n", result, toChars()); | |
536 return shift_optimize(result, this, Shr); | |
537 } | |
538 | |
539 Expression *UshrExp::optimize(int result) | |
540 { | |
541 //printf("UshrExp::optimize(result = %d) %s\n", result, toChars()); | |
542 return shift_optimize(result, this, Ushr); | |
543 } | |
544 | |
545 Expression *AndExp::optimize(int result) | |
546 { Expression *e; | |
547 | |
548 e1 = e1->optimize(result); | |
549 e2 = e2->optimize(result); | |
550 if (e1->isConst() == 1 && e2->isConst() == 1) | |
551 e = And(type, e1, e2); | |
552 else | |
553 e = this; | |
554 return e; | |
555 } | |
556 | |
557 Expression *OrExp::optimize(int result) | |
558 { Expression *e; | |
559 | |
560 e1 = e1->optimize(result); | |
561 e2 = e2->optimize(result); | |
562 if (e1->isConst() == 1 && e2->isConst() == 1) | |
563 e = Or(type, e1, e2); | |
564 else | |
565 e = this; | |
566 return e; | |
567 } | |
568 | |
569 Expression *XorExp::optimize(int result) | |
570 { Expression *e; | |
571 | |
572 e1 = e1->optimize(result); | |
573 e2 = e2->optimize(result); | |
574 if (e1->isConst() == 1 && e2->isConst() == 1) | |
575 e = Xor(type, e1, e2); | |
576 else | |
577 e = this; | |
578 return e; | |
579 } | |
580 | |
581 Expression *CommaExp::optimize(int result) | |
582 { Expression *e; | |
583 | |
584 //printf("CommaExp::optimize(result = %d) %s\n", result, toChars()); | |
585 e1 = e1->optimize(result & WANTinterpret); | |
586 e2 = e2->optimize(result); | |
587 if (!e1 || e1->op == TOKint64 || e1->op == TOKfloat64 || !e1->checkSideEffect(2)) | |
588 { | |
589 e = e2; | |
590 if (e) | |
591 e->type = type; | |
592 } | |
593 else | |
594 e = this; | |
595 //printf("-CommaExp::optimize(result = %d) %s\n", result, e->toChars()); | |
596 return e; | |
597 } | |
598 | |
599 Expression *ArrayLengthExp::optimize(int result) | |
600 { Expression *e; | |
601 | |
602 //printf("ArrayLengthExp::optimize(result = %d) %s\n", result, toChars()); | |
603 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
604 e = this; | |
605 if (e1->op == TOKstring || e1->op == TOKarrayliteral || e1->op == TOKassocarrayliteral) | |
606 { | |
607 e = ArrayLength(type, e1); | |
608 } | |
609 return e; | |
610 } | |
611 | |
612 Expression *EqualExp::optimize(int result) | |
613 { Expression *e; | |
614 | |
615 //printf("EqualExp::optimize(result = %x) %s\n", result, toChars()); | |
616 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
617 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
618 e = this; | |
619 | |
620 Expression *e1 = fromConstInitializer(this->e1); | |
621 Expression *e2 = fromConstInitializer(this->e2); | |
622 | |
623 e = Equal(op, type, e1, e2); | |
624 if (e == EXP_CANT_INTERPRET) | |
625 e = this; | |
626 return e; | |
627 } | |
628 | |
629 Expression *IdentityExp::optimize(int result) | |
630 { Expression *e; | |
631 | |
632 //printf("IdentityExp::optimize(result = %d) %s\n", result, toChars()); | |
633 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
634 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
635 e = this; | |
636 | |
637 if (this->e1->isConst() && this->e2->isConst()) | |
638 { | |
639 e = Identity(op, type, this->e1, this->e2); | |
640 } | |
641 return e; | |
642 } | |
643 | |
644 Expression *IndexExp::optimize(int result) | |
645 { Expression *e; | |
646 | |
647 //printf("IndexExp::optimize(result = %d) %s\n", result, toChars()); | |
648 Expression *e1 = this->e1->optimize(WANTvalue | (result & WANTinterpret)); | |
649 if (result & WANTinterpret) | |
650 e1 = fromConstInitializer(e1); | |
651 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
652 e = Index(type, e1, e2); | |
653 if (e == EXP_CANT_INTERPRET) | |
654 e = this; | |
655 return e; | |
656 } | |
657 | |
658 Expression *SliceExp::optimize(int result) | |
659 { Expression *e; | |
660 | |
661 //printf("SliceExp::optimize(result = %d) %s\n", result, toChars()); | |
662 e = this; | |
663 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
664 if (!lwr) | |
665 { if (e1->op == TOKstring) | |
666 { // Convert slice of string literal into dynamic array | |
667 Type *t = e1->type->toBasetype(); | |
668 if (t->next) | |
669 e = e1->castTo(NULL, t->next->arrayOf()); | |
670 } | |
671 return e; | |
672 } | |
673 if (result & WANTinterpret) | |
674 e1 = fromConstInitializer(e1); | |
675 lwr = lwr->optimize(WANTvalue | (result & WANTinterpret)); | |
676 upr = upr->optimize(WANTvalue | (result & WANTinterpret)); | |
677 e = Slice(type, e1, lwr, upr); | |
678 if (e == EXP_CANT_INTERPRET) | |
679 e = this; | |
680 return e; | |
681 } | |
682 | |
683 Expression *AndAndExp::optimize(int result) | |
684 { Expression *e; | |
685 | |
686 //printf("AndAndExp::optimize(%d) %s\n", result, toChars()); | |
687 e1 = e1->optimize(WANTflags | (result & WANTinterpret)); | |
688 e = this; | |
689 if (e1->isBool(FALSE)) | |
690 { | |
691 e = new CommaExp(loc, e1, new IntegerExp(loc, 0, type)); | |
692 e->type = type; | |
693 e = e->optimize(result); | |
694 } | |
695 else | |
696 { | |
697 e2 = e2->optimize(WANTflags | (result & WANTinterpret)); | |
698 if (result && e2->type->toBasetype()->ty == Tvoid && !global.errors) | |
699 error("void has no value"); | |
700 if (e1->isConst()) | |
701 { | |
702 if (e2->isConst()) | |
703 { int n1 = e1->isBool(1); | |
704 int n2 = e2->isBool(1); | |
705 | |
706 e = new IntegerExp(loc, n1 && n2, type); | |
707 } | |
708 else if (e1->isBool(TRUE)) | |
709 e = new BoolExp(loc, e2, type); | |
710 } | |
711 } | |
712 return e; | |
713 } | |
714 | |
715 Expression *OrOrExp::optimize(int result) | |
716 { Expression *e; | |
717 | |
718 e1 = e1->optimize(WANTflags | (result & WANTinterpret)); | |
719 e = this; | |
720 if (e1->isBool(TRUE)) | |
721 { // Replace with (e1, 1) | |
722 e = new CommaExp(loc, e1, new IntegerExp(loc, 1, type)); | |
723 e->type = type; | |
724 e = e->optimize(result); | |
725 } | |
726 else | |
727 { | |
728 e2 = e2->optimize(WANTflags | (result & WANTinterpret)); | |
729 if (result && e2->type->toBasetype()->ty == Tvoid && !global.errors) | |
730 error("void has no value"); | |
731 if (e1->isConst()) | |
732 { | |
733 if (e2->isConst()) | |
734 { int n1 = e1->isBool(1); | |
735 int n2 = e2->isBool(1); | |
736 | |
737 e = new IntegerExp(loc, n1 || n2, type); | |
738 } | |
739 else if (e1->isBool(FALSE)) | |
740 e = new BoolExp(loc, e2, type); | |
741 } | |
742 } | |
743 return e; | |
744 } | |
745 | |
746 Expression *CmpExp::optimize(int result) | |
747 { Expression *e; | |
748 | |
749 //printf("CmpExp::optimize() %s\n", toChars()); | |
750 e1 = e1->optimize(result); | |
751 e2 = e2->optimize(result); | |
752 if (e1->isConst() == 1 && e2->isConst() == 1) | |
753 { | |
754 e = Cmp(op, type, this->e1, this->e2); | |
755 } | |
756 else | |
757 e = this; | |
758 return e; | |
759 } | |
760 | |
761 Expression *CatExp::optimize(int result) | |
762 { Expression *e; | |
763 | |
764 //printf("CatExp::optimize(%d) %s\n", result, toChars()); | |
765 e1 = e1->optimize(result); | |
766 e2 = e2->optimize(result); | |
767 e = Cat(type, e1, e2); | |
768 if (e == EXP_CANT_INTERPRET) | |
769 e = this; | |
770 return e; | |
771 } | |
772 | |
773 | |
774 Expression *CondExp::optimize(int result) | |
775 { Expression *e; | |
776 | |
777 econd = econd->optimize(WANTflags | (result & WANTinterpret)); | |
778 if (econd->isBool(TRUE)) | |
779 e = e1->optimize(result); | |
780 else if (econd->isBool(FALSE)) | |
781 e = e2->optimize(result); | |
782 else | |
783 { e1 = e1->optimize(result); | |
784 e2 = e2->optimize(result); | |
785 e = this; | |
786 } | |
787 return e; | |
788 } | |
789 | |
790 |