Mercurial > projects > ddmd
annotate dmd/SwitchStatement.d @ 63:cab4c37afb89
A bunch of implementations
| author | korDen |
|---|---|
| date | Mon, 23 Aug 2010 16:52:24 +0400 |
| parents | a8b50ff7f201 |
| children | 2e2a5c3f943a |
| rev | line source |
|---|---|
| 0 | 1 module dmd.SwitchStatement; |
| 2 | |
| 3 import dmd.Statement; | |
| 4 import dmd.Expression; | |
| 5 import dmd.DefaultStatement; | |
| 6 import dmd.TryFinallyStatement; | |
| 7 import dmd.Array; | |
| 8 import dmd.Loc; | |
| 9 import dmd.Scope; | |
| 10 import dmd.OutBuffer; | |
| 11 import dmd.HdrGenState; | |
| 12 import dmd.InlineScanState; | |
| 13 import dmd.IRState; | |
| 14 import dmd.InterState; | |
| 15 import dmd.BE; | |
| 16 import dmd.TY; | |
| 17 import dmd.WANT; | |
| 18 import dmd.GotoCaseStatement; | |
| 19 import dmd.CaseStatement; | |
| 20 import dmd.ArrayTypes; | |
| 21 import dmd.CompoundStatement; | |
| 22 import dmd.Global; | |
| 23 import dmd.SwitchErrorStatement; | |
| 24 import dmd.Type; | |
| 25 import dmd.HaltExp; | |
| 26 import dmd.ExpStatement; | |
| 27 import dmd.BreakStatement; | |
| 28 import dmd.EnumDeclaration; | |
| 29 import dmd.TypeEnum; | |
| 30 import dmd.Dsymbol; | |
| 31 import dmd.EnumMember; | |
| 32 import dmd.TypeTypedef; | |
| 33 import dmd.TOK; | |
| 34 import dmd.StringExp; | |
| 35 | |
| 36 import dmd.backend.Util; | |
| 37 import dmd.backend.block; | |
| 38 import dmd.backend.Blockx; | |
| 39 import dmd.backend.elem; | |
| 40 import dmd.backend.OPER; | |
| 41 import dmd.backend.TYM; | |
| 42 import dmd.backend.BC; | |
| 43 import dmd.backend.dt_t; | |
| 44 import dmd.backend.Symbol; | |
| 45 import dmd.backend.SC; | |
| 46 import dmd.backend.FL; | |
| 47 import dmd.backend.RTLSYM; | |
| 48 import dmd.backend.targ_types; | |
| 49 | |
| 4 | 50 import core.memory; |
| 2 | 51 |
|
5
63623152e82a
Fixed memory corruption bug which was introduced when attempting to restore GC functionality
dkoroskin <>
parents:
4
diff
changeset
|
52 import core.stdc.stdlib; |
|
63623152e82a
Fixed memory corruption bug which was introduced when attempting to restore GC functionality
dkoroskin <>
parents:
4
diff
changeset
|
53 |
| 0 | 54 class SwitchStatement : Statement |
| 55 { | |
| 56 Expression condition; | |
| 57 Statement body_; | |
| 58 bool isFinal; | |
| 59 | |
| 60 DefaultStatement sdefault = null; | |
| 61 TryFinallyStatement tf = null; | |
| 62 Array gotoCases; // array of unresolved GotoCaseStatement's | |
| 63 Array cases; // array of CaseStatement's | |
| 64 int hasNoDefault = 0; // !=0 if no default statement | |
| 65 int hasVars = 0; // !=0 if has variable case values | |
| 66 | |
| 67 this(Loc loc, Expression c, Statement b, bool isFinal) | |
| 68 { | |
| 69 super(loc); | |
| 70 | |
| 71 this.condition = c; | |
| 72 this.body_ = b; | |
| 73 this.isFinal = isFinal; | |
| 74 | |
| 75 gotoCases = new Array(); | |
| 76 } | |
| 77 | |
| 78 Statement syntaxCopy() | |
| 79 { | |
| 53 | 80 SwitchStatement s = new SwitchStatement(loc, |
| 81 condition.syntaxCopy(), body_.syntaxCopy(), isFinal); | |
| 82 return s; | |
| 0 | 83 } |
| 84 | |
| 85 Statement semantic(Scope sc) | |
| 86 { | |
| 87 //printf("SwitchStatement.semantic(%p)\n", this); | |
| 88 tf = sc.tf; | |
| 89 assert(!cases); // ensure semantic() is only run once | |
| 90 condition = condition.semantic(sc); | |
| 91 condition = resolveProperties(sc, condition); | |
| 92 if (condition.type.isString()) | |
| 93 { | |
| 94 // If it's not an array, cast it to one | |
| 95 if (condition.type.ty != Tarray) | |
| 96 { | |
| 97 condition = condition.implicitCastTo(sc, condition.type.nextOf().arrayOf()); | |
| 98 } | |
| 99 condition.type = condition.type.constOf(); | |
| 100 } | |
| 101 else | |
| 102 { | |
| 103 condition = condition.integralPromotions(sc); | |
| 104 condition.checkIntegral(); | |
| 105 } | |
| 106 condition = condition.optimize(WANTvalue); | |
| 107 | |
| 108 sc = sc.push(); | |
| 109 sc.sbreak = this; | |
| 110 sc.sw = this; | |
| 111 | |
| 112 cases = new Array(); | |
| 113 sc.noctor++; // BUG: should use Scope.mergeCallSuper() for each case instead | |
| 114 body_ = body_.semantic(sc); | |
| 115 sc.noctor--; | |
| 116 | |
| 117 // Resolve any goto case's with exp | |
| 118 for (int i = 0; i < gotoCases.dim; i++) | |
| 119 { | |
| 120 GotoCaseStatement gcs = cast(GotoCaseStatement)gotoCases.data[i]; | |
| 121 | |
| 122 if (!gcs.exp) | |
| 123 { | |
| 124 gcs.error("no case statement following goto case;"); | |
| 125 break; | |
| 126 } | |
| 127 | |
| 128 for (Scope scx = sc; scx; scx = scx.enclosing) | |
| 129 { | |
| 130 if (!scx.sw) | |
| 131 continue; | |
| 132 for (int j = 0; j < scx.sw.cases.dim; j++) | |
| 133 { | |
| 134 CaseStatement cs = cast(CaseStatement)scx.sw.cases.data[j]; | |
| 135 | |
| 136 if (cs.exp.equals(gcs.exp)) | |
| 137 { | |
| 138 gcs.cs = cs; | |
| 139 goto Lfoundcase; | |
| 140 } | |
| 141 } | |
| 142 } | |
| 143 gcs.error("case %s not found", gcs.exp.toChars()); | |
| 144 | |
| 145 Lfoundcase: | |
| 146 ; | |
| 147 } | |
| 148 | |
| 149 if (!sc.sw.sdefault && !isFinal) | |
| 150 { | |
| 151 hasNoDefault = 1; | |
| 152 | |
| 153 warning("switch statement has no default"); | |
| 154 | |
| 155 // Generate runtime error if the default is hit | |
| 156 Statements a = new Statements(); | |
| 157 CompoundStatement cs; | |
| 158 Statement s; | |
| 159 | |
| 160 if (global.params.useSwitchError) | |
| 161 s = new SwitchErrorStatement(loc); | |
| 162 else | |
| 163 { | |
| 164 Expression e = new HaltExp(loc); | |
| 165 s = new ExpStatement(loc, e); | |
| 166 } | |
| 167 | |
| 168 a.reserve(4); | |
| 169 a.push(cast(void*)body_); | |
| 170 a.push(cast(void*)new BreakStatement(loc, null)); | |
| 171 sc.sw.sdefault = new DefaultStatement(loc, s); | |
| 172 a.push(cast(void*)sc.sw.sdefault); | |
| 173 cs = new CompoundStatement(loc, a); | |
| 174 body_ = cs; | |
| 175 } | |
| 176 | |
| 177 version (DMDV2) { | |
| 178 if (isFinal) | |
| 179 { | |
| 180 Type t = condition.type; | |
| 181 while (t.ty == Ttypedef) | |
| 182 { | |
| 183 // Don't use toBasetype() because that will skip past enums | |
| 184 t = (cast(TypeTypedef)t).sym.basetype; | |
| 185 } | |
| 186 if (condition.type.ty == Tenum) | |
| 187 { | |
| 188 TypeEnum te = cast(TypeEnum)condition.type; | |
| 189 EnumDeclaration ed = te.toDsymbol(sc).isEnumDeclaration(); | |
| 190 assert(ed); | |
| 191 size_t dim = ed.members.dim; | |
| 192 for (size_t i = 0; i < dim; i++) | |
| 193 { | |
| 194 EnumMember em = (cast(Dsymbol)ed.members.data[i]).isEnumMember(); | |
| 195 if (em) | |
| 196 { | |
| 197 for (size_t j = 0; j < cases.dim; j++) | |
| 198 { | |
| 199 CaseStatement cs = cast(CaseStatement)cases.data[j]; | |
| 200 if (cs.exp.equals(em.value)) | |
| 201 goto L1; | |
| 202 } | |
| 203 error("enum member %s not represented in final switch", em.toChars()); | |
| 204 } | |
| 205 L1: | |
| 206 ; | |
| 207 } | |
| 208 } | |
| 209 } | |
| 210 } | |
| 211 | |
| 212 sc.pop(); | |
| 213 return this; | |
| 214 } | |
| 215 | |
| 216 bool hasBreak() | |
| 217 { | |
| 218 assert(false); | |
| 219 } | |
| 220 | |
| 221 bool usesEH() | |
| 222 { | |
| 223 assert(false); | |
| 224 } | |
| 225 | |
| 226 BE blockExit() | |
| 227 { | |
| 228 BE result = BE.BEnone; | |
| 229 if (condition.canThrow()) | |
| 230 result |= BE.BEthrow; | |
| 231 | |
| 232 if (body_) | |
| 233 { result |= body_.blockExit(); | |
| 234 if (result & BE.BEbreak) | |
| 235 { | |
| 236 result |= BE.BEfallthru; | |
| 237 result &= ~BE.BEbreak; | |
| 238 } | |
| 239 } | |
| 240 else | |
| 241 result |= BE.BEfallthru; | |
| 242 | |
| 243 return result; | |
| 244 } | |
| 245 | |
| 63 | 246 Expression interpret(InterState istate) |
| 0 | 247 { |
| 248 assert(false); | |
| 249 } | |
| 250 | |
| 251 void toCBuffer(OutBuffer buf, HdrGenState* hgs) | |
| 252 { | |
| 253 assert(false); | |
| 254 } | |
| 255 | |
| 256 Statement inlineScan(InlineScanState* iss) | |
| 257 { | |
| 258 //printf("SwitchStatement.inlineScan()\n"); | |
| 259 condition = condition.inlineScan(iss); | |
| 260 body_ = body_ ? body_.inlineScan(iss) : null; | |
| 261 if (sdefault) | |
| 262 sdefault = cast(DefaultStatement)sdefault.inlineScan(iss); | |
| 263 if (cases) | |
| 264 { | |
| 265 for (int i = 0; i < cases.dim; i++) | |
| 266 { | |
| 267 Statement s = cast(Statement)cases.data[i]; | |
| 268 cases.data[i] = cast(void*)s.inlineScan(iss); | |
| 269 } | |
| 270 } | |
| 271 return this; | |
| 272 } | |
| 273 | |
| 274 void toIR(IRState* irs) | |
| 275 { | |
| 276 int string; | |
| 277 Blockx* blx = irs.blx; | |
| 278 | |
| 279 //printf("SwitchStatement.toIR()\n"); | |
| 280 IRState mystate = IRState(irs,this); | |
| 281 | |
| 282 mystate.switchBlock = blx.curblock; | |
| 283 | |
| 284 /* Block for where "break" goes to | |
| 285 */ | |
| 286 mystate.breakBlock = block_calloc(blx); | |
| 287 | |
| 288 /* Block for where "default" goes to. | |
| 289 * If there is a default statement, then that is where default goes. | |
| 290 * If not, then do: | |
| 291 * default: break; | |
| 292 * by making the default block the same as the break block. | |
| 293 */ | |
| 294 mystate.defaultBlock = sdefault ? block_calloc(blx) : mystate.breakBlock; | |
| 295 | |
| 296 int numcases = 0; | |
| 297 if (cases) | |
| 298 numcases = cases.dim; | |
| 299 | |
| 300 incUsage(irs, loc); | |
| 301 elem* econd = condition.toElem(&mystate); | |
| 302 | |
| 303 version (DMDV2) { | |
| 304 if (hasVars) | |
| 305 { | |
| 306 /* Generate a sequence of if-then-else blocks for the cases. | |
| 307 */ | |
| 308 if (econd.Eoper != OPvar) | |
| 309 { | |
| 310 elem* e = exp2_copytotemp(econd); | |
| 311 block_appendexp(mystate.switchBlock, e); | |
| 312 econd = e.E2; | |
| 313 } | |
| 314 | |
| 315 for (int i = 0; i < numcases; i++) | |
| 316 { | |
| 317 CaseStatement cs = cast(CaseStatement)cases.data[i]; | |
| 318 | |
| 319 elem* ecase = cs.exp.toElem(&mystate); | |
| 320 elem* e = el_bin(OPeqeq, TYbool, el_copytree(econd), ecase); | |
| 321 block* b = blx.curblock; | |
| 322 block_appendexp(b, e); | |
| 323 block* bcase = block_calloc(blx); | |
| 324 cs.cblock = bcase; | |
| 325 block_next(blx, BCiftrue, null); | |
| 326 list_append(&b.Bsucc, bcase); | |
| 327 list_append(&b.Bsucc, blx.curblock); | |
| 328 } | |
| 329 | |
| 330 /* The final 'else' clause goes to the default | |
| 331 */ | |
| 332 block* b = blx.curblock; | |
| 333 block_next(blx, BCgoto, null); | |
| 334 list_append(&b.Bsucc, mystate.defaultBlock); | |
| 335 | |
| 336 body_.toIR(&mystate); | |
| 337 | |
| 338 /* Have the end of the switch body fall through to the block | |
| 339 * following the switch statement. | |
| 340 */ | |
| 341 block_goto(blx, BCgoto, mystate.breakBlock); | |
| 342 return; | |
| 343 } | |
| 344 } | |
| 345 | |
| 346 if (condition.type.isString()) | |
| 347 { | |
| 348 // Number the cases so we can unscramble things after the sort() | |
| 349 for (int i = 0; i < numcases; i++) | |
| 350 { | |
| 351 CaseStatement cs = cast(CaseStatement)cases.data[i]; | |
| 352 cs.index = i; | |
| 353 } | |
| 354 | |
| 355 cases.sort(); | |
| 356 | |
| 357 /* Create a sorted array of the case strings, and si | |
| 358 * will be the symbol for it. | |
| 359 */ | |
| 360 dt_t* dt = null; | |
| 361 Symbol* si = symbol_generate(SCstatic,type_fake(TYullong)); | |
| 362 version (MACHOBJ) { | |
| 363 si.Sseg = Segment.DATA; | |
| 364 } | |
| 365 dtdword(&dt, numcases); | |
| 366 dtxoff(&dt, si, 8, TYnptr); | |
| 367 | |
| 368 for (int i = 0; i < numcases; i++) | |
| 369 { | |
| 370 CaseStatement cs = cast(CaseStatement)cases.data[i]; | |
| 371 | |
| 372 if (cs.exp.op != TOKstring) | |
| 373 { | |
| 374 error("case '%s' is not a string", cs.exp.toChars()); // BUG: this should be an assert | |
| 375 } | |
| 376 else | |
| 377 { | |
| 378 StringExp se = cast(StringExp)(cs.exp); | |
| 379 uint len = se.len; | |
| 380 dtdword(&dt, len); | |
| 381 dtabytes(&dt, TYnptr, 0, se.len * se.sz, cast(char*)se.string_); | |
| 382 } | |
| 383 } | |
| 384 | |
| 385 si.Sdt = dt; | |
| 386 si.Sfl = FLdata; | |
| 387 outdata(si); | |
| 388 | |
| 389 /* Call: | |
| 390 * _d_switch_string(string[] si, string econd) | |
| 391 */ | |
| 392 elem* eparam = el_param(econd, el_var(si)); | |
| 393 switch (condition.type.nextOf().ty) | |
| 394 { | |
| 395 case Tchar: | |
| 396 econd = el_bin(OPcall, TYint, el_var(rtlsym[RTLSYM_SWITCH_STRING]), eparam); | |
| 397 break; | |
| 398 case Twchar: | |
| 399 econd = el_bin(OPcall, TYint, el_var(rtlsym[RTLSYM_SWITCH_USTRING]), eparam); | |
| 400 break; | |
| 401 case Tdchar: // BUG: implement | |
| 402 econd = el_bin(OPcall, TYint, el_var(rtlsym[RTLSYM_SWITCH_DSTRING]), eparam); | |
| 403 break; | |
| 404 default: | |
| 405 assert(0); | |
| 406 } | |
| 407 elem_setLoc(econd, loc); | |
| 408 string = 1; | |
| 409 } | |
| 410 else | |
| 411 string = 0; | |
| 412 block_appendexp(mystate.switchBlock, econd); | |
| 413 block_next(blx,BCswitch,null); | |
| 414 | |
|
5
63623152e82a
Fixed memory corruption bug which was introduced when attempting to restore GC functionality
dkoroskin <>
parents:
4
diff
changeset
|
415 /// |
|
63623152e82a
Fixed memory corruption bug which was introduced when attempting to restore GC functionality
dkoroskin <>
parents:
4
diff
changeset
|
416 targ_llong* pu = cast(targ_llong*) malloc(targ_llong.sizeof * (numcases + 1)); |
| 0 | 417 mystate.switchBlock.Bswitch = pu; |
| 418 /* First pair is the number of cases, and the default block | |
| 419 */ | |
| 420 *pu++ = numcases; | |
| 421 list_append(&mystate.switchBlock.Bsucc, mystate.defaultBlock); | |
| 422 | |
| 423 /* Fill in the first entry in each pair, which is the case value. | |
| 424 * CaseStatement.toIR() will fill in | |
| 425 * the second entry for each pair with the block. | |
| 426 */ | |
| 427 for (int i = 0; i < numcases; i++) | |
| 428 { | |
| 429 CaseStatement cs = cast(CaseStatement)cases.data[i]; | |
| 430 if (string) | |
| 431 { | |
| 432 pu[cs.index] = i; | |
| 433 } | |
| 434 else | |
| 435 { | |
| 436 pu[i] = cs.exp.toInteger(); | |
| 437 } | |
| 438 } | |
| 439 | |
| 440 body_.toIR(&mystate); | |
| 441 | |
| 442 /* Have the end of the switch body fall through to the block | |
| 443 * following the switch statement. | |
| 444 */ | |
| 445 block_goto(blx, BCgoto, mystate.breakBlock); | |
| 446 } | |
| 447 } |