Mercurial > projects > ldc
annotate dmd/optimize.c @ 94:61615fa85940 trunk
[svn r98] Added support for std.c.stdlib.alloca via pragma(LLVM_internal, "alloca").
Added support for array .sort and .reverse properties.
Fixed some bugs with pointer arithmetic.
Disabled some DMD AST optimizations that was messing things up, destroying valuable information.
Added a KDevelop project file, this is what I use for coding LLVMDC now :)
Other minor stuff.
| author | lindquist |
|---|---|
| date | Mon, 12 Nov 2007 06:32:46 +0100 |
| parents | 70d6113eeb8c |
| children | 2b72433d5c8c |
| rev | line source |
|---|---|
| 1 | 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 } | |
|
94
61615fa85940
[svn r98] Added support for std.c.stdlib.alloca via pragma(LLVM_internal, "alloca").
lindquist
parents:
92
diff
changeset
|
212 #if !IN_LLVM |
| 1 | 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 %jd is out of bounds [0..%jd]", index, dim); | |
| 238 e = new SymOffExp(loc, ve->var, index * ts->next->size()); | |
| 239 e->type = type; | |
| 240 return e; | |
| 241 } | |
| 242 } | |
| 243 } | |
|
94
61615fa85940
[svn r98] Added support for std.c.stdlib.alloca via pragma(LLVM_internal, "alloca").
lindquist
parents:
92
diff
changeset
|
244 #endif |
| 1 | 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 | |
| 279 Expression *CallExp::optimize(int result) | |
| 280 { Expression *e = this; | |
| 281 | |
| 282 e1 = e1->optimize(result); | |
| 283 if (e1->op == TOKvar && result & WANTinterpret) | |
| 284 { | |
| 285 FuncDeclaration *fd = ((VarExp *)e1)->var->isFuncDeclaration(); | |
| 286 if (fd) | |
| 287 { | |
| 288 Expression *eresult = fd->interpret(NULL, arguments); | |
| 92 | 289 if (eresult && eresult != EXP_VOID_INTERPRET) |
| 1 | 290 e = eresult; |
| 291 else if (result & WANTinterpret) | |
| 292 error("cannot evaluate %s at compile time", toChars()); | |
| 293 } | |
| 294 } | |
| 295 return e; | |
| 296 } | |
| 297 | |
| 298 | |
| 299 Expression *CastExp::optimize(int result) | |
| 300 { | |
| 301 //printf("CastExp::optimize(result = %d) %s\n", result, toChars()); | |
| 302 //printf("from %s to %s\n", type->toChars(), to->toChars()); | |
| 303 //printf("from %s\n", type->toChars()); | |
| 304 //printf("type = %p\n", type); | |
| 305 assert(type); | |
| 306 enum TOK op1 = e1->op; | |
| 307 | |
| 308 e1 = e1->optimize(result); | |
| 309 if (result & WANTinterpret) | |
| 310 e1 = fromConstInitializer(e1); | |
| 311 | |
| 312 if ((e1->op == TOKstring || e1->op == TOKarrayliteral) && | |
| 313 (type->ty == Tpointer || type->ty == Tarray) && | |
| 314 type->next->equals(e1->type->next) | |
| 315 ) | |
| 316 { | |
| 317 e1->type = type; | |
| 318 return e1; | |
| 319 } | |
| 320 /* The first test here is to prevent infinite loops | |
| 321 */ | |
| 322 if (op1 != TOKarrayliteral && e1->op == TOKarrayliteral) | |
| 323 return e1->castTo(NULL, to); | |
| 324 if (e1->op == TOKnull && | |
| 325 (type->ty == Tpointer || type->ty == Tclass)) | |
| 326 { | |
| 327 e1->type = type; | |
| 328 return e1; | |
| 329 } | |
| 330 | |
| 331 if (result & WANTflags && type->ty == Tclass && e1->type->ty == Tclass) | |
| 332 { | |
| 333 // See if we can remove an unnecessary cast | |
| 334 ClassDeclaration *cdfrom; | |
| 335 ClassDeclaration *cdto; | |
| 336 int offset; | |
| 337 | |
| 338 cdfrom = e1->type->isClassHandle(); | |
| 339 cdto = type->isClassHandle(); | |
| 340 if (cdto->isBaseOf(cdfrom, &offset) && offset == 0) | |
| 341 { | |
| 342 e1->type = type; | |
| 343 return e1; | |
| 344 } | |
| 345 } | |
| 346 | |
| 347 Expression *e; | |
| 348 | |
| 349 if (e1->isConst()) | |
| 350 { | |
| 351 if (e1->op == TOKsymoff) | |
| 352 { | |
| 353 if (type->size() == e1->type->size() && | |
| 354 type->toBasetype()->ty != Tsarray) | |
| 355 { | |
| 356 e1->type = type; | |
| 357 return e1; | |
| 358 } | |
| 359 return this; | |
| 360 } | |
| 361 if (to->toBasetype()->ty == Tvoid) | |
| 362 e = this; | |
| 363 else | |
| 364 e = Cast(type, to, e1); | |
| 365 } | |
| 366 else | |
| 367 e = this; | |
| 368 return e; | |
| 369 } | |
| 370 | |
| 371 Expression *BinExp::optimize(int result) | |
| 372 { | |
| 373 //printf("BinExp::optimize(result = %d) %s\n", result, toChars()); | |
| 374 e1 = e1->optimize(result); | |
| 375 e2 = e2->optimize(result); | |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
376 if (op == TOKshlass || op == TOKshrass || op == TOKushrass) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
377 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
378 if (e2->isConst() == 1) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
379 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
380 integer_t i2 = e2->toInteger(); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
381 d_uns64 sz = e1->type->size() * 8; |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
382 if (i2 < 0 || i2 > sz) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
383 { error("shift assign by %jd is outside the range 0..%zu", i2, sz); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
384 e2 = new IntegerExp(0); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
385 } |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
386 } |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
387 } |
| 1 | 388 return this; |
| 389 } | |
| 390 | |
| 391 Expression *AddExp::optimize(int result) | |
| 392 { Expression *e; | |
| 393 | |
| 394 //printf("AddExp::optimize(%s)\n", toChars()); | |
| 395 e1 = e1->optimize(result); | |
| 396 e2 = e2->optimize(result); | |
| 397 if (e1->isConst() && e2->isConst()) | |
| 398 { | |
| 399 if (e1->op == TOKsymoff && e2->op == TOKsymoff) | |
| 400 return this; | |
| 401 e = Add(type, e1, e2); | |
| 402 } | |
| 403 else | |
| 404 e = this; | |
| 405 return e; | |
| 406 } | |
| 407 | |
| 408 Expression *MinExp::optimize(int result) | |
| 409 { Expression *e; | |
| 410 | |
| 411 e1 = e1->optimize(result); | |
| 412 e2 = e2->optimize(result); | |
| 413 if (e1->isConst() && e2->isConst()) | |
| 414 { | |
| 415 if (e2->op == TOKsymoff) | |
| 416 return this; | |
| 417 e = Min(type, e1, e2); | |
| 418 } | |
| 419 else | |
| 420 e = this; | |
| 421 return e; | |
| 422 } | |
| 423 | |
| 424 Expression *MulExp::optimize(int result) | |
| 425 { Expression *e; | |
| 426 | |
| 427 //printf("MulExp::optimize(result = %d) %s\n", result, toChars()); | |
| 428 e1 = e1->optimize(result); | |
| 429 e2 = e2->optimize(result); | |
| 430 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 431 { | |
| 432 e = Mul(type, e1, e2); | |
| 433 } | |
| 434 else | |
| 435 e = this; | |
| 436 return e; | |
| 437 } | |
| 438 | |
| 439 Expression *DivExp::optimize(int result) | |
| 440 { Expression *e; | |
| 441 | |
| 442 //printf("DivExp::optimize(%s)\n", toChars()); | |
| 443 e1 = e1->optimize(result); | |
| 444 e2 = e2->optimize(result); | |
| 445 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 446 { | |
| 447 e = Div(type, e1, e2); | |
| 448 } | |
| 449 else | |
| 450 e = this; | |
| 451 return e; | |
| 452 } | |
| 453 | |
| 454 Expression *ModExp::optimize(int result) | |
| 455 { Expression *e; | |
| 456 | |
| 457 e1 = e1->optimize(result); | |
| 458 e2 = e2->optimize(result); | |
| 459 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 460 { | |
| 461 e = Mod(type, e1, e2); | |
| 462 } | |
| 463 else | |
| 464 e = this; | |
| 465 return e; | |
| 466 } | |
| 467 | |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
468 Expression *shift_optimize(int result, BinExp *e, Expression *(*shift)(Type *, Expression *, Expression *)) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
469 { Expression *ex = e; |
| 1 | 470 |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
471 e->e1 = e->e1->optimize(result); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
472 e->e2 = e->e2->optimize(result); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
473 if (e->e2->isConst() == 1) |
| 1 | 474 { |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
475 integer_t i2 = e->e2->toInteger(); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
476 d_uns64 sz = e->e1->type->size() * 8; |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
477 if (i2 < 0 || i2 > sz) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
478 { error("shift by %jd is outside the range 0..%zu", i2, sz); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
479 e->e2 = new IntegerExp(0); |
| 1 | 480 } |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
481 if (e->e1->isConst() == 1) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
482 ex = (*shift)(e->type, e->e1, e->e2); |
| 1 | 483 } |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
484 return ex; |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
485 } |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
486 |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
487 Expression *ShlExp::optimize(int result) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
488 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
489 //printf("ShlExp::optimize(result = %d) %s\n", result, toChars()); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
490 return shift_optimize(result, this, Shl); |
| 1 | 491 } |
| 492 | |
| 493 Expression *ShrExp::optimize(int result) | |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
494 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
495 //printf("ShrExp::optimize(result = %d) %s\n", result, toChars()); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
496 return shift_optimize(result, this, Shr); |
| 1 | 497 } |
| 498 | |
| 499 Expression *UshrExp::optimize(int result) | |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
500 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
501 //printf("UshrExp::optimize(result = %d) %s\n", result, toChars()); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
1
diff
changeset
|
502 return shift_optimize(result, this, Ushr); |
| 1 | 503 } |
| 504 | |
| 505 Expression *AndExp::optimize(int result) | |
| 506 { Expression *e; | |
| 507 | |
| 508 e1 = e1->optimize(result); | |
| 509 e2 = e2->optimize(result); | |
| 510 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 511 e = And(type, e1, e2); | |
| 512 else | |
| 513 e = this; | |
| 514 return e; | |
| 515 } | |
| 516 | |
| 517 Expression *OrExp::optimize(int result) | |
| 518 { Expression *e; | |
| 519 | |
| 520 e1 = e1->optimize(result); | |
| 521 e2 = e2->optimize(result); | |
| 522 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 523 e = Or(type, e1, e2); | |
| 524 else | |
| 525 e = this; | |
| 526 return e; | |
| 527 } | |
| 528 | |
| 529 Expression *XorExp::optimize(int result) | |
| 530 { Expression *e; | |
| 531 | |
| 532 e1 = e1->optimize(result); | |
| 533 e2 = e2->optimize(result); | |
| 534 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 535 e = Xor(type, e1, e2); | |
| 536 else | |
| 537 e = this; | |
| 538 return e; | |
| 539 } | |
| 540 | |
| 541 Expression *CommaExp::optimize(int result) | |
| 542 { Expression *e; | |
| 543 | |
| 544 //printf("CommaExp::optimize(result = %d) %s\n", result, toChars()); | |
| 545 e1 = e1->optimize(result & WANTinterpret); | |
| 546 e2 = e2->optimize(result); | |
| 547 if (!e1 || e1->op == TOKint64 || e1->op == TOKfloat64 || !e1->checkSideEffect(2)) | |
| 548 { | |
| 549 e = e2; | |
| 550 if (e) | |
| 551 e->type = type; | |
| 552 } | |
| 553 else | |
| 554 e = this; | |
| 555 //printf("-CommaExp::optimize(result = %d) %s\n", result, e->toChars()); | |
| 556 return e; | |
| 557 } | |
| 558 | |
| 559 Expression *ArrayLengthExp::optimize(int result) | |
| 560 { Expression *e; | |
| 561 | |
| 562 //printf("ArrayLengthExp::optimize(result = %d) %s\n", result, toChars()); | |
| 563 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
| 564 e = this; | |
| 565 if (e1->op == TOKstring || e1->op == TOKarrayliteral || e1->op == TOKassocarrayliteral) | |
| 566 { | |
| 567 e = ArrayLength(type, e1); | |
| 568 } | |
| 569 return e; | |
| 570 } | |
| 571 | |
| 572 Expression *EqualExp::optimize(int result) | |
| 573 { Expression *e; | |
| 574 | |
| 575 //printf("EqualExp::optimize(result = %x) %s\n", result, toChars()); | |
| 576 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
| 577 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
| 578 e = this; | |
| 579 | |
| 580 Expression *e1 = fromConstInitializer(this->e1); | |
| 581 Expression *e2 = fromConstInitializer(this->e2); | |
| 582 | |
| 583 e = Equal(op, type, e1, e2); | |
| 584 if (e == EXP_CANT_INTERPRET) | |
| 585 e = this; | |
| 586 return e; | |
| 587 } | |
| 588 | |
| 589 Expression *IdentityExp::optimize(int result) | |
| 590 { Expression *e; | |
| 591 | |
| 592 //printf("IdentityExp::optimize(result = %d) %s\n", result, toChars()); | |
| 593 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
| 594 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
| 595 e = this; | |
| 596 | |
| 597 if (this->e1->isConst() && this->e2->isConst()) | |
| 598 { | |
| 599 e = Identity(op, type, this->e1, this->e2); | |
| 600 } | |
| 601 return e; | |
| 602 } | |
| 603 | |
| 604 Expression *IndexExp::optimize(int result) | |
| 605 { Expression *e; | |
| 606 | |
| 607 //printf("IndexExp::optimize(result = %d) %s\n", result, toChars()); | |
| 608 Expression *e1 = this->e1->optimize(WANTvalue | (result & WANTinterpret)); | |
| 609 if (result & WANTinterpret) | |
| 610 e1 = fromConstInitializer(e1); | |
| 611 e2 = e2->optimize(WANTvalue | (result & WANTinterpret)); | |
| 612 e = Index(type, e1, e2); | |
| 613 if (e == EXP_CANT_INTERPRET) | |
| 614 e = this; | |
| 615 return e; | |
| 616 } | |
| 617 | |
| 618 Expression *SliceExp::optimize(int result) | |
| 619 { Expression *e; | |
| 620 | |
| 621 //printf("SliceExp::optimize(result = %d) %s\n", result, toChars()); | |
| 622 e = this; | |
| 623 e1 = e1->optimize(WANTvalue | (result & WANTinterpret)); | |
| 624 if (!lwr) | |
| 625 { if (e1->op == TOKstring) | |
| 626 { // Convert slice of string literal into dynamic array | |
| 627 Type *t = e1->type->toBasetype(); | |
| 628 if (t->next) | |
| 629 e = e1->castTo(NULL, t->next->arrayOf()); | |
| 630 } | |
| 631 return e; | |
| 632 } | |
| 633 if (result & WANTinterpret) | |
| 634 e1 = fromConstInitializer(e1); | |
| 635 lwr = lwr->optimize(WANTvalue | (result & WANTinterpret)); | |
| 636 upr = upr->optimize(WANTvalue | (result & WANTinterpret)); | |
| 637 e = Slice(type, e1, lwr, upr); | |
| 638 if (e == EXP_CANT_INTERPRET) | |
| 639 e = this; | |
| 640 return e; | |
| 641 } | |
| 642 | |
| 643 Expression *AndAndExp::optimize(int result) | |
| 644 { Expression *e; | |
| 645 | |
| 646 //printf("AndAndExp::optimize(%d) %s\n", result, toChars()); | |
| 647 e1 = e1->optimize(WANTflags | (result & WANTinterpret)); | |
| 648 e = this; | |
| 649 if (e1->isBool(FALSE)) | |
| 650 { | |
| 651 e = new CommaExp(loc, e1, new IntegerExp(loc, 0, type)); | |
| 652 e->type = type; | |
| 653 e = e->optimize(result); | |
| 654 } | |
| 655 else | |
| 656 { | |
| 657 e2 = e2->optimize(WANTflags | (result & WANTinterpret)); | |
| 658 if (result && e2->type->toBasetype()->ty == Tvoid && !global.errors) | |
| 659 error("void has no value"); | |
| 660 if (e1->isConst()) | |
| 661 { | |
| 662 if (e2->isConst()) | |
| 663 { int n1 = e1->isBool(1); | |
| 664 int n2 = e2->isBool(1); | |
| 665 | |
| 666 e = new IntegerExp(loc, n1 && n2, type); | |
| 667 } | |
| 668 else if (e1->isBool(TRUE)) | |
| 669 e = new BoolExp(loc, e2, type); | |
| 670 } | |
| 671 } | |
| 672 return e; | |
| 673 } | |
| 674 | |
| 675 Expression *OrOrExp::optimize(int result) | |
| 676 { Expression *e; | |
| 677 | |
| 678 e1 = e1->optimize(WANTflags | (result & WANTinterpret)); | |
| 679 e = this; | |
| 680 if (e1->isBool(TRUE)) | |
| 681 { // Replace with (e1, 1) | |
| 682 e = new CommaExp(loc, e1, new IntegerExp(loc, 1, type)); | |
| 683 e->type = type; | |
| 684 e = e->optimize(result); | |
| 685 } | |
| 686 else | |
| 687 { | |
| 688 e2 = e2->optimize(WANTflags | (result & WANTinterpret)); | |
| 689 if (result && e2->type->toBasetype()->ty == Tvoid && !global.errors) | |
| 690 error("void has no value"); | |
| 691 if (e1->isConst()) | |
| 692 { | |
| 693 if (e2->isConst()) | |
| 694 { int n1 = e1->isBool(1); | |
| 695 int n2 = e2->isBool(1); | |
| 696 | |
| 697 e = new IntegerExp(loc, n1 || n2, type); | |
| 698 } | |
| 699 else if (e1->isBool(FALSE)) | |
| 700 e = new BoolExp(loc, e2, type); | |
| 701 } | |
| 702 } | |
| 703 return e; | |
| 704 } | |
| 705 | |
| 706 Expression *CmpExp::optimize(int result) | |
| 707 { Expression *e; | |
| 708 | |
| 709 //printf("CmpExp::optimize() %s\n", toChars()); | |
| 710 e1 = e1->optimize(result); | |
| 711 e2 = e2->optimize(result); | |
| 712 if (e1->isConst() == 1 && e2->isConst() == 1) | |
| 713 { | |
| 714 e = Cmp(op, type, this->e1, this->e2); | |
| 715 } | |
| 716 else | |
| 717 e = this; | |
| 718 return e; | |
| 719 } | |
| 720 | |
| 721 Expression *CatExp::optimize(int result) | |
| 722 { Expression *e; | |
| 723 | |
| 724 //printf("CatExp::optimize(%d) %s\n", result, toChars()); | |
| 725 e1 = e1->optimize(result); | |
| 726 e2 = e2->optimize(result); | |
| 727 e = Cat(type, e1, e2); | |
| 728 if (e == EXP_CANT_INTERPRET) | |
| 729 e = this; | |
| 730 return e; | |
| 731 } | |
| 732 | |
| 733 | |
| 734 Expression *CondExp::optimize(int result) | |
| 735 { Expression *e; | |
| 736 | |
| 737 econd = econd->optimize(WANTflags | (result & WANTinterpret)); | |
| 738 if (econd->isBool(TRUE)) | |
| 739 e = e1->optimize(result); | |
| 740 else if (econd->isBool(FALSE)) | |
| 741 e = e2->optimize(result); | |
| 742 else | |
| 743 { e1 = e1->optimize(result); | |
| 744 e2 = e2->optimize(result); | |
| 745 e = this; | |
| 746 } | |
| 747 return e; | |
| 748 } | |
| 749 | |
| 750 |