Mercurial > projects > ldc
annotate dmd/optimize.c @ 888:d8c44f1e08e1
Fix #164.
author | Christian Kamm <kamm incasoftware de> |
---|---|
date | Sat, 17 Jan 2009 17:41:03 +0100 |
parents | 330f999ade44 |
children | e74e2e53ba3b |
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 { | |
888 | 355 // make a copy before adjusting type to avoid |
356 // messing up the type of an existing initializer | |
357 e1 = e1->syntaxCopy(); | |
336 | 358 e1->type = type; |
359 return e1; | |
360 } | |
361 /* The first test here is to prevent infinite loops | |
362 */ | |
363 if (op1 != TOKarrayliteral && e1->op == TOKarrayliteral) | |
364 return e1->castTo(NULL, to); | |
365 if (e1->op == TOKnull && | |
366 (type->ty == Tpointer || type->ty == Tclass)) | |
367 { | |
888 | 368 e1 = e1->syntaxCopy(); |
336 | 369 e1->type = type; |
370 return e1; | |
371 } | |
372 | |
373 if (result & WANTflags && type->ty == Tclass && e1->type->ty == Tclass) | |
374 { | |
375 // See if we can remove an unnecessary cast | |
376 ClassDeclaration *cdfrom; | |
377 ClassDeclaration *cdto; | |
378 int offset; | |
379 | |
380 cdfrom = e1->type->isClassHandle(); | |
381 cdto = type->isClassHandle(); | |
382 if (cdto->isBaseOf(cdfrom, &offset) && offset == 0) | |
383 { | |
888 | 384 e1 = e1->syntaxCopy(); |
336 | 385 e1->type = type; |
386 return e1; | |
387 } | |
388 } | |
389 | |
390 Expression *e; | |
391 | |
392 if (e1->isConst()) | |
393 { | |
394 if (e1->op == TOKsymoff) | |
395 { | |
396 if (type->size() == e1->type->size() && | |
397 type->toBasetype()->ty != Tsarray) | |
398 { | |
888 | 399 e1 = e1->syntaxCopy(); |
336 | 400 e1->type = type; |
401 return e1; | |
402 } | |
403 return this; | |
404 } | |
405 if (to->toBasetype()->ty == Tvoid) | |
406 e = this; | |
407 else | |
408 e = Cast(type, to, e1); | |
409 } | |
410 else | |
411 e = this; | |
412 return e; | |
413 } | |
414 | |
415 Expression *BinExp::optimize(int result) | |
416 { | |
417 //printf("BinExp::optimize(result = %d) %s\n", result, toChars()); | |
418 e1 = e1->optimize(result); | |
419 e2 = e2->optimize(result); | |
420 if (op == TOKshlass || op == TOKshrass || op == TOKushrass) | |
421 { | |
422 if (e2->isConst() == 1) | |
423 { | |
424 integer_t i2 = e2->toInteger(); | |
425 d_uns64 sz = e1->type->size() * 8; | |
426 if (i2 < 0 || i2 > sz) | |
427 { | |
428 error("shift assign by %lld is outside the range 0..%"PRIuSIZE, i2, sz); | |
429 e2 = new IntegerExp(0); | |
430 } | |
431 } | |
432 } | |
433 return this; | |
434 } | |
435 | |
436 Expression *AddExp::optimize(int result) | |
437 { Expression *e; | |
438 | |
439 //printf("AddExp::optimize(%s)\n", toChars()); | |
440 e1 = e1->optimize(result); | |
441 e2 = e2->optimize(result); | |
442 if (e1->isConst() && e2->isConst()) | |
443 { | |
444 if (e1->op == TOKsymoff && e2->op == TOKsymoff) | |
445 return this; | |
446 e = Add(type, e1, e2); | |
447 } | |
448 else | |
449 e = this; | |
450 return e; | |
451 } | |
452 | |
453 Expression *MinExp::optimize(int result) | |
454 { Expression *e; | |
455 | |
456 e1 = e1->optimize(result); | |
457 e2 = e2->optimize(result); | |
458 if (e1->isConst() && e2->isConst()) | |
459 { | |
460 if (e2->op == TOKsymoff) | |
461 return this; | |
462 e = Min(type, e1, e2); | |
463 } | |
464 else | |
465 e = this; | |
466 return e; | |
467 } | |
468 | |
469 Expression *MulExp::optimize(int result) | |
470 { Expression *e; | |
471 | |
472 //printf("MulExp::optimize(result = %d) %s\n", result, toChars()); | |
473 e1 = e1->optimize(result); | |
474 e2 = e2->optimize(result); | |
475 if (e1->isConst() == 1 && e2->isConst() == 1) | |
476 { | |
477 e = Mul(type, e1, e2); | |
478 } | |
479 else | |
480 e = this; | |
481 return e; | |
482 } | |
483 | |
484 Expression *DivExp::optimize(int result) | |
485 { Expression *e; | |
486 | |
487 //printf("DivExp::optimize(%s)\n", toChars()); | |
488 e1 = e1->optimize(result); | |
489 e2 = e2->optimize(result); | |
490 if (e1->isConst() == 1 && e2->isConst() == 1) | |
491 { | |
492 e = Div(type, e1, e2); | |
493 } | |
494 else | |
495 e = this; | |
496 return e; | |
497 } | |
498 | |
499 Expression *ModExp::optimize(int result) | |
500 { Expression *e; | |
501 | |
502 e1 = e1->optimize(result); | |
503 e2 = e2->optimize(result); | |
504 if (e1->isConst() == 1 && e2->isConst() == 1) | |
505 { | |
506 e = Mod(type, e1, e2); | |
507 } | |
508 else | |
509 e = this; | |
510 return e; | |
511 } | |
512 | |
513 Expression *shift_optimize(int result, BinExp *e, Expression *(*shift)(Type *, Expression *, Expression *)) | |
514 { Expression *ex = e; | |
515 | |
516 e->e1 = e->e1->optimize(result); | |
517 e->e2 = e->e2->optimize(result); | |
518 if (e->e2->isConst() == 1) | |
519 { | |
520 integer_t i2 = e->e2->toInteger(); | |
521 d_uns64 sz = e->e1->type->size() * 8; | |
522 if (i2 < 0 || i2 > sz) | |
523 { | |
524 error("shift by %lld is outside the range 0..%"PRIuSIZE, i2, sz); | |
525 e->e2 = new IntegerExp(0); | |
526 } | |
527 if (e->e1->isConst() == 1) | |
528 ex = (*shift)(e->type, e->e1, e->e2); | |
529 } | |
530 return ex; | |
531 } | |
532 | |
533 Expression *ShlExp::optimize(int result) | |
534 { | |
535 //printf("ShlExp::optimize(result = %d) %s\n", result, toChars()); | |
536 return shift_optimize(result, this, Shl); | |
537 } | |
538 | |
539 Expression *ShrExp::optimize(int result) | |
540 { | |
541 //printf("ShrExp::optimize(result = %d) %s\n", result, toChars()); | |
542 return shift_optimize(result, this, Shr); | |
543 } | |
544 | |
545 Expression *UshrExp::optimize(int result) | |
546 { | |
547 //printf("UshrExp::optimize(result = %d) %s\n", result, toChars()); | |
548 return shift_optimize(result, this, Ushr); | |
549 } | |
550 | |
551 Expression *AndExp::optimize(int result) | |
552 { Expression *e; | |
553 | |
554 e1 = e1->optimize(result); | |
555 e2 = e2->optimize(result); | |
556 if (e1->isConst() == 1 && e2->isConst() == 1) | |
557 e = And(type, e1, e2); | |
558 else | |
559 e = this; | |
560 return e; | |
561 } | |
562 | |
563 Expression *OrExp::optimize(int result) | |
564 { Expression *e; | |
565 | |
566 e1 = e1->optimize(result); | |
567 e2 = e2->optimize(result); | |
568 if (e1->isConst() == 1 && e2->isConst() == 1) | |
569 e = Or(type, e1, e2); | |
570 else | |
571 e = this; | |
572 return e; | |
573 } | |
574 | |
575 Expression *XorExp::optimize(int result) | |
576 { Expression *e; | |
577 | |
578 e1 = e1->optimize(result); | |
579 e2 = e2->optimize(result); | |
580 if (e1->isConst() == 1 && e2->isConst() == 1) | |
581 e = Xor(type, e1, e2); | |
582 else | |
583 e = this; | |
584 return e; | |
585 } | |
586 | |
587 Expression *CommaExp::optimize(int result) | |
588 { Expression *e; | |
589 | |
590 //printf("CommaExp::optimize(result = %d) %s\n", result, toChars()); | |
591 e1 = e1->optimize(result & WANTinterpret); | |
592 e2 = e2->optimize(result); | |
593 if (!e1 || e1->op == TOKint64 || e1->op == TOKfloat64 || !e1->checkSideEffect(2)) | |
594 { | |
595 e = e2; | |
596 if (e) | |
597 e->type = type; | |
598 } | |
599 else | |
600 e = this; | |
601 //printf("-CommaExp::optimize(result = %d) %s\n", result, e->toChars()); | |
602 return e; | |
603 } | |
604 | |
605 Expression *ArrayLengthExp::optimize(int result) | |
606 { Expression *e; | |
607 | |
608 //printf("ArrayLengthExp::optimize(result = %d) %s\n", result, toChars()); | |
609 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
610 e = this; | |
611 if (e1->op == TOKstring || e1->op == TOKarrayliteral || e1->op == TOKassocarrayliteral) | |
612 { | |
613 e = ArrayLength(type, e1); | |
614 } | |
615 return e; | |
616 } | |
617 | |
618 Expression *EqualExp::optimize(int result) | |
619 { Expression *e; | |
620 | |
621 //printf("EqualExp::optimize(result = %x) %s\n", result, toChars()); | |
622 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
623 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
624 e = this; | |
625 | |
626 Expression *e1 = fromConstInitializer(this->e1); | |
627 Expression *e2 = fromConstInitializer(this->e2); | |
628 | |
629 e = Equal(op, type, e1, e2); | |
630 if (e == EXP_CANT_INTERPRET) | |
631 e = this; | |
632 return e; | |
633 } | |
634 | |
635 Expression *IdentityExp::optimize(int result) | |
636 { Expression *e; | |
637 | |
638 //printf("IdentityExp::optimize(result = %d) %s\n", result, toChars()); | |
639 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
640 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
641 e = this; | |
642 | |
643 if (this->e1->isConst() && this->e2->isConst()) | |
644 { | |
645 e = Identity(op, type, this->e1, this->e2); | |
646 } | |
647 return e; | |
648 } | |
649 | |
650 Expression *IndexExp::optimize(int result) | |
651 { Expression *e; | |
652 | |
653 //printf("IndexExp::optimize(result = %d) %s\n", result, toChars()); | |
654 Expression *e1 = this->e1->optimize(WANTvalue | (result & WANTinterpret)); | |
655 if (result & WANTinterpret) | |
656 e1 = fromConstInitializer(e1); | |
657 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
658 e = Index(type, e1, e2); | |
659 if (e == EXP_CANT_INTERPRET) | |
660 e = this; | |
661 return e; | |
662 } | |
663 | |
664 Expression *SliceExp::optimize(int result) | |
665 { Expression *e; | |
666 | |
667 //printf("SliceExp::optimize(result = %d) %s\n", result, toChars()); | |
668 e = this; | |
669 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
670 if (!lwr) | |
671 { if (e1->op == TOKstring) | |
672 { // Convert slice of string literal into dynamic array | |
673 Type *t = e1->type->toBasetype(); | |
674 if (t->next) | |
675 e = e1->castTo(NULL, t->next->arrayOf()); | |
676 } | |
677 return e; | |
678 } | |
679 if (result & WANTinterpret) | |
680 e1 = fromConstInitializer(e1); | |
681 lwr = lwr->optimize(WANTvalue | (result & WANTinterpret)); | |
682 upr = upr->optimize(WANTvalue | (result & WANTinterpret)); | |
683 e = Slice(type, e1, lwr, upr); | |
684 if (e == EXP_CANT_INTERPRET) | |
685 e = this; | |
686 return e; | |
687 } | |
688 | |
689 Expression *AndAndExp::optimize(int result) | |
690 { Expression *e; | |
691 | |
692 //printf("AndAndExp::optimize(%d) %s\n", result, toChars()); | |
693 e1 = e1->optimize(WANTflags | (result & WANTinterpret)); | |
694 e = this; | |
695 if (e1->isBool(FALSE)) | |
696 { | |
697 e = new CommaExp(loc, e1, new IntegerExp(loc, 0, type)); | |
698 e->type = type; | |
699 e = e->optimize(result); | |
700 } | |
701 else | |
702 { | |
703 e2 = e2->optimize(WANTflags | (result & WANTinterpret)); | |
704 if (result && e2->type->toBasetype()->ty == Tvoid && !global.errors) | |
705 error("void has no value"); | |
706 if (e1->isConst()) | |
707 { | |
708 if (e2->isConst()) | |
709 { int n1 = e1->isBool(1); | |
710 int n2 = e2->isBool(1); | |
711 | |
712 e = new IntegerExp(loc, n1 && n2, type); | |
713 } | |
714 else if (e1->isBool(TRUE)) | |
715 e = new BoolExp(loc, e2, type); | |
716 } | |
717 } | |
718 return e; | |
719 } | |
720 | |
721 Expression *OrOrExp::optimize(int result) | |
722 { Expression *e; | |
723 | |
724 e1 = e1->optimize(WANTflags | (result & WANTinterpret)); | |
725 e = this; | |
726 if (e1->isBool(TRUE)) | |
727 { // Replace with (e1, 1) | |
728 e = new CommaExp(loc, e1, new IntegerExp(loc, 1, type)); | |
729 e->type = type; | |
730 e = e->optimize(result); | |
731 } | |
732 else | |
733 { | |
734 e2 = e2->optimize(WANTflags | (result & WANTinterpret)); | |
735 if (result && e2->type->toBasetype()->ty == Tvoid && !global.errors) | |
736 error("void has no value"); | |
737 if (e1->isConst()) | |
738 { | |
739 if (e2->isConst()) | |
740 { int n1 = e1->isBool(1); | |
741 int n2 = e2->isBool(1); | |
742 | |
743 e = new IntegerExp(loc, n1 || n2, type); | |
744 } | |
745 else if (e1->isBool(FALSE)) | |
746 e = new BoolExp(loc, e2, type); | |
747 } | |
748 } | |
749 return e; | |
750 } | |
751 | |
752 Expression *CmpExp::optimize(int result) | |
753 { Expression *e; | |
754 | |
755 //printf("CmpExp::optimize() %s\n", toChars()); | |
756 e1 = e1->optimize(result); | |
757 e2 = e2->optimize(result); | |
758 if (e1->isConst() == 1 && e2->isConst() == 1) | |
759 { | |
760 e = Cmp(op, type, this->e1, this->e2); | |
761 } | |
762 else | |
763 e = this; | |
764 return e; | |
765 } | |
766 | |
767 Expression *CatExp::optimize(int result) | |
768 { Expression *e; | |
769 | |
770 //printf("CatExp::optimize(%d) %s\n", result, toChars()); | |
771 e1 = e1->optimize(result); | |
772 e2 = e2->optimize(result); | |
773 e = Cat(type, e1, e2); | |
774 if (e == EXP_CANT_INTERPRET) | |
775 e = this; | |
776 return e; | |
777 } | |
778 | |
779 | |
780 Expression *CondExp::optimize(int result) | |
781 { Expression *e; | |
782 | |
783 econd = econd->optimize(WANTflags | (result & WANTinterpret)); | |
784 if (econd->isBool(TRUE)) | |
785 e = e1->optimize(result); | |
786 else if (econd->isBool(FALSE)) | |
787 e = e2->optimize(result); | |
788 else | |
789 { e1 = e1->optimize(result); | |
790 e2 = e2->optimize(result); | |
791 e = this; | |
792 } | |
793 return e; | |
794 } | |
795 | |
796 |