Mercurial > projects > ddmd
annotate dmd/SliceExp.d @ 135:af1bebfd96a4 dmd2037
dmd 2.038
| author | Eldar Insafutdinov <e.insafutdinov@gmail.com> |
|---|---|
| date | Mon, 13 Sep 2010 22:19:42 +0100 |
| parents | 60bb0fe4563e |
| children | e3afd1303184 |
| rev | line source |
|---|---|
| 72 | 1 module dmd.SliceExp; |
| 2 | |
| 114 | 3 import dmd.common; |
| 72 | 4 import dmd.Expression; |
| 5 import dmd.expression.ArrayLength; | |
| 6 import dmd.backend.elem; | |
| 7 import dmd.UnaExp; | |
| 8 import dmd.Identifier; | |
| 9 import dmd.IdentifierExp; | |
| 10 import dmd.ArrayExp; | |
| 11 import dmd.STC; | |
| 0 | 12 import dmd.InterState; |
| 13 import dmd.ScopeDsymbol; | |
| 14 import dmd.WANT; | |
| 15 import dmd.ArrayScopeSymbol; | |
| 16 import dmd.CallExp; | |
| 17 import dmd.DotIdExp; | |
| 18 import dmd.Id; | |
| 19 import dmd.expression.Util; | |
| 20 import dmd.TypeTuple; | |
| 21 import dmd.TupleExp; | |
| 22 import dmd.TypeStruct; | |
| 23 import dmd.TypeClass; | |
| 24 import dmd.TY; | |
| 25 import dmd.Type; | |
| 72 | 26 import dmd.AggregateDeclaration; |
| 27 import dmd.OutBuffer; | |
| 28 import dmd.Loc; | |
| 29 import dmd.Scope; | |
| 30 import dmd.InlineCostState; | |
| 0 | 31 import dmd.VarDeclaration; |
| 32 import dmd.ErrorExp; | |
| 33 import dmd.TypeExp; | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
34 import dmd.Parameter; |
| 72 | 35 import dmd.ExpInitializer; |
| 36 import dmd.IRState; | |
| 37 import dmd.InlineDoState; | |
| 38 import dmd.ArrayTypes; | |
| 39 import dmd.HdrGenState; | |
| 40 import dmd.InlineScanState; | |
| 0 | 41 import dmd.TOK; |
| 42 import dmd.TypeSArray; | |
| 43 import dmd.GlobalExpressions; | |
| 44 import dmd.Global; | |
| 45 import dmd.PREC; | |
| 46 | |
| 47 import dmd.expression.Slice; | |
| 48 import dmd.expression.Util; | |
| 49 | |
| 50 import dmd.backend.Util; | |
| 51 import dmd.backend.Symbol; | |
| 52 import dmd.backend.OPER; | |
| 53 import dmd.backend.TYM; | |
| 54 import dmd.codegen.Util; | |
| 55 | |
| 72 | 56 import core.stdc.string; |
| 57 | |
| 0 | 58 class SliceExp : UnaExp |
| 59 { | |
| 60 Expression upr; // null if implicit 0 | |
| 61 Expression lwr; // null if implicit [length - 1] | |
| 62 | |
| 63 VarDeclaration lengthVar = null; | |
| 64 | |
| 65 this(Loc loc, Expression e1, Expression lwr, Expression upr) | |
| 72 | 66 { |
| 0 | 67 super(loc, TOK.TOKslice, SliceExp.sizeof, e1); |
| 68 this.upr = upr; | |
| 69 this.lwr = lwr; | |
| 70 } | |
| 71 | |
| 72 | 72 override Expression syntaxCopy() |
| 0 | 73 { |
| 72 | 74 Expression lwr = null; |
| 75 if (this.lwr) | |
| 76 lwr = this.lwr.syntaxCopy(); | |
| 77 | |
| 78 Expression upr = null; | |
| 79 if (this.upr) | |
| 80 upr = this.upr.syntaxCopy(); | |
| 81 | |
| 53 | 82 return new SliceExp(loc, e1.syntaxCopy(), lwr, upr); |
| 0 | 83 } |
| 84 | |
| 72 | 85 override Expression semantic(Scope sc) |
| 0 | 86 { |
| 87 Expression e; | |
| 88 AggregateDeclaration ad; | |
| 89 //FuncDeclaration fd; | |
| 90 ScopeDsymbol sym; | |
| 91 | |
| 92 version (LOGSEMANTIC) { | |
| 93 printf("SliceExp.semantic('%s')\n", toChars()); | |
| 94 } | |
| 95 if (type) | |
| 96 return this; | |
| 97 | |
| 98 UnaExp.semantic(sc); | |
| 99 e1 = resolveProperties(sc, e1); | |
| 100 | |
| 101 e = this; | |
| 102 | |
| 103 Type t = e1.type.toBasetype(); | |
| 104 if (t.ty == Tpointer) | |
| 105 { | |
| 106 if (!lwr || !upr) | |
| 107 error("need upper and lower bound to slice pointer"); | |
| 108 } | |
| 109 else if (t.ty == Tarray) | |
| 110 { | |
| 111 } | |
| 112 else if (t.ty == Tsarray) | |
| 113 { | |
| 114 } | |
| 115 else if (t.ty == Tclass) | |
| 116 { | |
| 117 ad = (cast(TypeClass)t).sym; | |
| 118 goto L1; | |
| 119 } | |
| 120 else if (t.ty == Tstruct) | |
| 121 { | |
| 122 ad = (cast(TypeStruct)t).sym; | |
| 123 | |
| 124 L1: | |
| 125 if (search_function(ad, Id.slice)) | |
| 126 { | |
| 127 // Rewrite as e1.slice(lwr, upr) | |
| 128 e = new DotIdExp(loc, e1, Id.slice); | |
| 129 | |
| 130 if (lwr) | |
| 131 { | |
| 132 assert(upr); | |
| 133 e = new CallExp(loc, e, lwr, upr); | |
| 134 } | |
| 135 else | |
| 136 { | |
| 137 assert(!upr); | |
| 138 e = new CallExp(loc, e); | |
| 139 } | |
| 140 e = e.semantic(sc); | |
| 141 return e; | |
| 142 } | |
| 143 goto Lerror; | |
| 144 } | |
| 145 else if (t.ty == Ttuple) | |
| 146 { | |
| 147 if (!lwr && !upr) | |
| 148 return e1; | |
| 149 if (!lwr || !upr) | |
| 150 { error("need upper and lower bound to slice tuple"); | |
| 151 goto Lerror; | |
| 152 } | |
| 153 } | |
| 154 else | |
| 155 goto Lerror; | |
| 156 | |
| 157 { | |
| 158 Scope sc2 = sc; | |
| 159 if (t.ty == Tsarray || t.ty == Tarray || t.ty == Ttuple) | |
| 160 { | |
| 161 sym = new ArrayScopeSymbol(sc, this); | |
| 162 sym.loc = loc; | |
| 163 sym.parent = sc.scopesym; | |
| 164 sc2 = sc.push(sym); | |
| 165 } | |
| 166 | |
| 167 if (lwr) | |
| 168 { | |
| 169 lwr = lwr.semantic(sc2); | |
| 170 lwr = resolveProperties(sc2, lwr); | |
| 171 lwr = lwr.implicitCastTo(sc2, Type.tsize_t); | |
| 172 } | |
| 173 if (upr) | |
| 174 { | |
| 175 upr = upr.semantic(sc2); | |
| 176 upr = resolveProperties(sc2, upr); | |
| 177 upr = upr.implicitCastTo(sc2, Type.tsize_t); | |
| 178 } | |
| 179 | |
| 180 if (sc2 != sc) | |
| 181 sc2.pop(); | |
| 182 } | |
| 183 | |
| 184 if (t.ty == Ttuple) | |
| 185 { | |
| 186 lwr = lwr.optimize(WANTvalue); | |
| 187 upr = upr.optimize(WANTvalue); | |
| 188 ulong i1 = lwr.toUInteger(); | |
| 189 ulong i2 = upr.toUInteger(); | |
| 190 | |
| 191 size_t length; | |
| 192 TupleExp te; | |
| 193 TypeTuple tup; | |
| 194 | |
| 195 if (e1.op == TOKtuple) // slicing an expression tuple | |
| 196 { | |
| 197 te = cast(TupleExp)e1; | |
| 198 length = te.exps.dim; | |
| 199 } | |
| 200 else if (e1.op == TOKtype) // slicing a type tuple | |
| 201 { | |
| 202 tup = cast(TypeTuple)t; | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
203 length = Parameter.dim(tup.arguments); |
| 0 | 204 } |
| 205 else | |
| 206 assert(0); | |
| 207 | |
| 208 if (i1 <= i2 && i2 <= length) | |
| 209 { | |
| 210 size_t j1 = cast(size_t) i1; | |
| 211 size_t j2 = cast(size_t) i2; | |
| 212 | |
| 213 if (e1.op == TOKtuple) | |
| 214 { | |
|
84
be2ab491772e
Expressions -> Vector!Expression
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
72
diff
changeset
|
215 auto exps = new Expressions; |
| 0 | 216 exps.setDim(j2 - j1); |
| 217 for (size_t i = 0; i < j2 - j1; i++) | |
| 218 { | |
|
84
be2ab491772e
Expressions -> Vector!Expression
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
72
diff
changeset
|
219 auto e2 = te.exps[j1 + i]; |
|
be2ab491772e
Expressions -> Vector!Expression
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
72
diff
changeset
|
220 exps[i] = e2; |
| 0 | 221 } |
| 222 e = new TupleExp(loc, exps); | |
| 223 } | |
| 224 else | |
| 225 { | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
226 auto args = new Parameters; |
| 0 | 227 args.reserve(j2 - j1); |
| 228 for (size_t i = j1; i < j2; i++) | |
| 229 { | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
230 auto arg = Parameter.getNth(tup.arguments, i); |
|
126
1765f3ef917d
ClassDeclarations, Arguments -> Vector
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
114
diff
changeset
|
231 args.push(arg); |
| 0 | 232 } |
| 233 e = new TypeExp(e1.loc, new TypeTuple(args)); | |
| 234 } | |
| 235 e = e.semantic(sc); | |
| 236 } | |
| 237 else | |
| 238 { | |
| 239 error("string slice [%ju .. %ju] is out of bounds", i1, i2); | |
| 240 e = new ErrorExp(); | |
| 241 } | |
| 242 return e; | |
| 243 } | |
| 244 | |
| 245 if (t.ty == Tarray) | |
| 246 { | |
| 247 type = e1.type; | |
| 248 } | |
| 249 else | |
| 250 type = t.nextOf().arrayOf(); | |
| 251 return e; | |
| 252 | |
| 253 Lerror: | |
| 254 string s; | |
| 255 if (t.ty == Tvoid) | |
| 256 s = e1.toChars(); | |
| 257 else | |
| 258 s = t.toChars(); | |
| 259 error("%s cannot be sliced with []", s); | |
| 260 e = new ErrorExp(); | |
| 261 return e; | |
| 262 } | |
| 263 | |
| 72 | 264 override void checkEscape() |
| 0 | 265 { |
| 266 e1.checkEscape(); | |
| 267 } | |
| 135 | 268 |
| 269 override void checkEscapeRef() | |
| 270 { | |
| 271 e1.checkEscapeRef(); | |
| 272 } | |
| 0 | 273 |
| 274 version (DMDV2) { | |
| 72 | 275 override int isLvalue() |
| 0 | 276 { |
| 277 return 1; | |
| 278 } | |
| 279 } | |
| 72 | 280 override Expression toLvalue(Scope sc, Expression e) |
| 0 | 281 { |
| 282 return this; | |
| 283 } | |
| 284 | |
| 72 | 285 override Expression modifiableLvalue(Scope sc, Expression e) |
| 0 | 286 { |
| 287 error("slice expression %s is not a modifiable lvalue", toChars()); | |
| 288 return this; | |
| 289 } | |
| 290 | |
| 72 | 291 override void toCBuffer(OutBuffer buf, HdrGenState* hgs) |
| 0 | 292 { |
| 293 expToCBuffer(buf, hgs, e1, precedence[op]); | |
| 294 buf.writeByte('['); | |
| 295 if (upr || lwr) | |
| 296 { | |
| 297 if (lwr) | |
| 298 expToCBuffer(buf, hgs, lwr, PREC.PREC_assign); | |
| 299 else | |
| 300 buf.writeByte('0'); | |
| 301 buf.writestring(".."); | |
| 302 if (upr) | |
| 303 expToCBuffer(buf, hgs, upr, PREC.PREC_assign); | |
| 304 else | |
| 305 buf.writestring("length"); // BUG: should be array.length | |
| 306 } | |
| 307 buf.writeByte(']'); | |
| 308 } | |
| 309 | |
| 72 | 310 override Expression optimize(int result) |
| 0 | 311 { |
| 312 Expression e; | |
| 313 | |
| 314 //printf("SliceExp::optimize(result = %d) %s\n", result, toChars()); | |
| 315 e = this; | |
| 316 e1 = e1.optimize(WANTvalue | (result & WANTinterpret)); | |
| 317 if (!lwr) | |
| 318 { | |
| 319 if (e1.op == TOKstring) | |
| 320 { | |
| 321 // Convert slice of string literal into dynamic array | |
| 322 Type t = e1.type.toBasetype(); | |
| 323 if (t.nextOf()) | |
| 324 e = e1.castTo(null, t.nextOf().arrayOf()); | |
| 325 } | |
| 326 return e; | |
| 327 } | |
| 328 e1 = fromConstInitializer(result, e1); | |
| 329 lwr = lwr.optimize(WANTvalue | (result & WANTinterpret)); | |
| 330 upr = upr.optimize(WANTvalue | (result & WANTinterpret)); | |
| 331 e = Slice(type, e1, lwr, upr); | |
| 332 if (e is EXP_CANT_INTERPRET) | |
| 333 e = this; | |
| 334 //printf("-SliceExp::optimize() %s\n", e->toChars()); | |
| 335 return e; | |
| 336 } | |
| 337 | |
| 72 | 338 override Expression interpret(InterState istate) |
| 0 | 339 { |
| 72 | 340 Expression e; |
| 341 Expression e1; | |
| 342 Expression lwr; | |
| 343 Expression upr; | |
| 344 | |
| 345 version (LOG) { | |
| 346 printf("SliceExp.interpret() %s\n", toChars()); | |
| 347 } | |
| 348 e1 = this.e1.interpret(istate); | |
| 349 if (e1 is EXP_CANT_INTERPRET) | |
| 350 goto Lcant; | |
| 351 if (!this.lwr) | |
| 352 { | |
| 353 e = e1.castTo(null, type); | |
| 354 return e.interpret(istate); | |
| 355 } | |
| 356 | |
| 357 /* Set the $ variable | |
| 358 */ | |
| 359 e = ArrayLength(Type.tsize_t, e1); | |
| 360 if (e is EXP_CANT_INTERPRET) | |
| 361 goto Lcant; | |
| 362 if (lengthVar) | |
| 363 lengthVar.value = e; | |
| 364 | |
| 365 /* Evaluate lower and upper bounds of slice | |
| 366 */ | |
| 367 lwr = this.lwr.interpret(istate); | |
| 368 if (lwr is EXP_CANT_INTERPRET) | |
| 369 goto Lcant; | |
| 370 upr = this.upr.interpret(istate); | |
| 371 if (upr is EXP_CANT_INTERPRET) | |
| 372 goto Lcant; | |
| 373 | |
| 374 return Slice(type, e1, lwr, upr); | |
| 375 | |
| 376 Lcant: | |
| 63 | 377 return EXP_CANT_INTERPRET; |
| 0 | 378 } |
| 379 | |
| 72 | 380 override void dump(int indent) |
| 0 | 381 { |
| 382 assert(false); | |
| 383 } | |
| 384 | |
| 72 | 385 override elem* toElem(IRState* irs) |
| 0 | 386 { |
| 387 //printf("SliceExp.toElem()\n"); | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
388 auto t1 = e1.type.toBasetype(); |
|
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
389 auto e = e1.toElem(irs); |
| 0 | 390 if (lwr) |
| 391 { | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
392 auto einit = resolveLengthVar(lengthVar, &e, t1); |
|
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
393 |
|
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
394 int sz = cast(uint)t1.nextOf().size(); |
| 0 | 395 |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
396 auto elwr = lwr.toElem(irs); |
|
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
397 auto eupr = upr.toElem(irs); |
| 0 | 398 |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
399 auto elwr2 = el_same(&elwr); |
| 0 | 400 |
| 401 // Create an array reference where: | |
| 402 // length is (upr - lwr) | |
| 403 // pointer is (ptr + lwr*sz) | |
| 404 // Combine as (length pair ptr) | |
| 405 | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
406 if (irs.arrayBoundsCheck()) |
| 0 | 407 { |
| 408 // Checks (unsigned compares): | |
| 409 // upr <= array.length | |
| 410 // lwr <= upr | |
| 411 | |
| 412 elem *c1; | |
| 413 elem *c2; | |
| 414 elem *ea; | |
| 415 elem *eb; | |
| 416 elem *eupr2; | |
| 417 elem *elength; | |
| 418 | |
| 419 if (t1.ty == Tpointer) | |
| 420 { | |
| 421 // Just do lwr <= upr check | |
| 422 | |
| 423 eupr2 = el_same(&eupr); | |
| 424 eupr2.Ety = TYuint; // make sure unsigned comparison | |
| 425 c1 = el_bin(OPle, TYint, elwr2, eupr2); | |
| 426 c1 = el_combine(eupr, c1); | |
| 427 goto L2; | |
| 428 } | |
| 429 else if (t1.ty == Tsarray) | |
| 430 { | |
| 431 TypeSArray tsa = cast(TypeSArray)t1; | |
| 432 ulong length = tsa.dim.toInteger(); | |
| 433 | |
| 434 elength = el_long(TYuint, length); | |
| 435 goto L1; | |
| 436 } | |
| 437 else if (t1.ty == Tarray) | |
| 438 { | |
| 439 if (lengthVar) | |
| 440 elength = el_var(lengthVar.toSymbol()); | |
| 441 else | |
| 442 { | |
| 443 elength = e; | |
| 444 e = el_same(&elength); | |
| 445 elength = el_una(OP64_32, TYuint, elength); | |
| 446 } | |
| 447 L1: | |
| 448 eupr2 = el_same(&eupr); | |
| 449 c1 = el_bin(OPle, TYint, eupr, elength); | |
| 450 eupr2.Ety = TYuint; // make sure unsigned comparison | |
| 451 c2 = el_bin(OPle, TYint, elwr2, eupr2); | |
| 452 c1 = el_bin(OPandand, TYint, c1, c2); // (c1 && c2) | |
| 453 | |
| 454 L2: | |
| 455 // Construct: (c1 || ModuleArray(line)) | |
| 456 Symbol* sassert; | |
| 457 | |
| 458 sassert = irs.blx.module_.toModuleArray(); | |
| 459 ea = el_bin(OPcall,TYvoid,el_var(sassert), el_long(TYint, loc.linnum)); | |
| 460 eb = el_bin(OPoror,TYvoid,c1,ea); | |
| 461 elwr = el_combine(elwr, eb); | |
| 462 | |
| 463 elwr2 = el_copytree(elwr2); | |
| 464 eupr = el_copytree(eupr2); | |
| 465 } | |
| 466 } | |
| 467 | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
468 auto eptr = array_toPtr(e1.type, e); |
| 0 | 469 |
| 470 elem *elength = el_bin(OPmin, TYint, eupr, elwr2); | |
| 471 eptr = el_bin(OPadd, TYnptr, eptr, el_bin(OPmul, TYint, el_copytree(elwr2), el_long(TYint, sz))); | |
| 472 | |
| 473 e = el_pair(TYullong, elength, eptr); | |
| 474 e = el_combine(elwr, e); | |
| 475 e = el_combine(einit, e); | |
| 476 } | |
| 477 else if (t1.ty == Tsarray) | |
| 478 { | |
| 479 e = sarray_toDarray(loc, t1, null, e); | |
| 480 } | |
| 481 | |
| 482 el_setLoc(e,loc); | |
| 483 return e; | |
| 484 } | |
| 485 | |
| 72 | 486 override void scanForNestedRef(Scope sc) |
| 0 | 487 { |
| 72 | 488 e1.scanForNestedRef(sc); |
| 489 | |
| 490 if (lengthVar) | |
| 491 { | |
| 492 //printf("lengthVar\n"); | |
| 493 lengthVar.parent = sc.parent; | |
| 494 } | |
| 495 if (lwr) | |
| 496 lwr.scanForNestedRef(sc); | |
| 497 if (upr) | |
| 64 | 498 upr.scanForNestedRef(sc); |
| 0 | 499 } |
| 500 | |
| 72 | 501 override void buildArrayIdent(OutBuffer buf, Expressions arguments) |
| 0 | 502 { |
| 72 | 503 buf.writestring("Slice"); |
|
84
be2ab491772e
Expressions -> Vector!Expression
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
72
diff
changeset
|
504 arguments.shift(this); |
| 0 | 505 } |
| 506 | |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
507 override Expression buildArrayLoop(Parameters fparams) |
| 0 | 508 { |
| 72 | 509 Identifier id = Identifier.generateId("p", fparams.dim); |
|
130
60bb0fe4563e
dmdfe 2.037 first main iteration
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
126
diff
changeset
|
510 auto param = new Parameter(STCconst, type, id, null); |
|
126
1765f3ef917d
ClassDeclarations, Arguments -> Vector
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
114
diff
changeset
|
511 fparams.shift(param); |
| 72 | 512 Expression e = new IdentifierExp(Loc(0), id); |
| 513 Expressions arguments = new Expressions(); | |
| 514 Expression index = new IdentifierExp(Loc(0), Id.p); | |
|
84
be2ab491772e
Expressions -> Vector!Expression
Eldar Insafutdinov <e.insafutdinov@gmail.com>
parents:
72
diff
changeset
|
515 arguments.push(index); |
| 72 | 516 e = new ArrayExp(Loc(0), e, arguments); |
|
12
832f71e6f96c
*Exp and *AssignExp arrayOp implementation added (might be a bit incomplete)
korDen
parents:
0
diff
changeset
|
517 return e; |
| 0 | 518 } |
| 519 | |
| 72 | 520 override int inlineCost(InlineCostState* ics) |
| 0 | 521 { |
| 522 int cost = 1 + e1.inlineCost(ics); | |
| 523 if (lwr) | |
| 524 cost += lwr.inlineCost(ics); | |
| 525 if (upr) | |
| 526 cost += upr.inlineCost(ics); | |
| 527 return cost; | |
| 528 } | |
| 529 | |
| 72 | 530 override Expression doInline(InlineDoState ids) |
| 0 | 531 { |
| 532 SliceExp are = cast(SliceExp)copy(); | |
| 533 | |
| 534 are.e1 = e1.doInline(ids); | |
| 535 | |
| 536 if (lengthVar) | |
| 537 { | |
| 538 //printf("lengthVar\n"); | |
| 539 VarDeclaration vd = lengthVar; | |
| 540 ExpInitializer ie; | |
| 541 ExpInitializer ieto; | |
| 542 VarDeclaration vto; | |
| 543 | |
| 544 vto = new VarDeclaration(vd.loc, vd.type, vd.ident, vd.init); | |
| 545 ///*vto = *vd; | |
| 546 memcpy(cast(void*)vto, cast(void*)vd, VarDeclaration.classinfo.init.length); | |
| 547 | |
| 548 vto.parent = ids.parent; | |
| 549 vto.csym = null; | |
| 550 vto.isym = null; | |
| 551 | |
| 552 ids.from.push(cast(void*)vd); | |
| 553 ids.to.push(cast(void*)vto); | |
| 554 | |
| 555 if (vd.init) | |
| 556 { | |
| 557 ie = vd.init.isExpInitializer(); | |
| 558 assert(ie); | |
| 559 ieto = new ExpInitializer(ie.loc, ie.exp.doInline(ids)); | |
| 560 vto.init = ieto; | |
| 561 } | |
| 562 | |
| 563 are.lengthVar = vto; | |
| 564 } | |
| 565 | |
| 566 if (lwr) | |
| 567 are.lwr = lwr.doInline(ids); | |
| 568 if (upr) | |
| 569 are.upr = upr.doInline(ids); | |
| 570 return are; | |
| 571 } | |
| 572 | |
| 72 | 573 override Expression inlineScan(InlineScanState* iss) |
| 0 | 574 { |
| 575 e1 = e1.inlineScan(iss); | |
| 576 if (lwr) | |
| 577 lwr = lwr.inlineScan(iss); | |
| 578 if (upr) | |
| 579 upr = upr.inlineScan(iss); | |
| 580 return this; | |
| 581 } | |
| 582 } | |
| 583 |