Mercurial > projects > ldc
annotate dmd/func.c @ 136:0e28624814e8 trunk
[svn r140] did a lot of the work towards being able to pass multiple modules on the command line. not complete yet though
| author | lindquist |
|---|---|
| date | Thu, 17 Jan 2008 03:15:12 +0100 |
| parents | a7dfa0ed966c |
| children | 7f92f477ff53 |
| 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 <assert.h> | |
| 13 | |
| 14 #include "mars.h" | |
| 15 #include "init.h" | |
| 16 #include "declaration.h" | |
| 17 #include "attrib.h" | |
| 18 #include "expression.h" | |
| 19 #include "scope.h" | |
| 20 #include "mtype.h" | |
| 21 #include "aggregate.h" | |
| 22 #include "identifier.h" | |
| 23 #include "id.h" | |
| 24 #include "module.h" | |
| 25 #include "statement.h" | |
| 26 #include "template.h" | |
| 27 #include "hdrgen.h" | |
| 28 | |
| 29 #ifdef IN_GCC | |
| 30 #include "d-dmd-gcc.h" | |
| 31 #endif | |
| 32 | |
| 33 /********************************* FuncDeclaration ****************************/ | |
| 34 | |
| 35 FuncDeclaration::FuncDeclaration(Loc loc, Loc endloc, Identifier *id, enum STC storage_class, Type *type) | |
| 36 : Declaration(id) | |
| 37 { | |
| 38 this->storage_class = storage_class; | |
| 39 this->type = type; | |
| 40 this->loc = loc; | |
| 41 this->endloc = endloc; | |
| 42 fthrows = NULL; | |
| 43 frequire = NULL; | |
| 44 outId = NULL; | |
| 45 vresult = NULL; | |
| 46 returnLabel = NULL; | |
| 47 fensure = NULL; | |
| 48 fbody = NULL; | |
| 49 localsymtab = NULL; | |
| 50 vthis = NULL; | |
| 51 v_arguments = NULL; | |
| 52 #if IN_GCC | |
| 53 v_argptr = NULL; | |
| 54 #endif | |
| 55 parameters = NULL; | |
| 56 labtab = NULL; | |
| 57 overnext = NULL; | |
| 58 vtblIndex = -1; | |
| 59 hasReturnExp = 0; | |
| 60 naked = 0; | |
| 61 inlineStatus = ILSuninitialized; | |
| 62 inlineNest = 0; | |
| 63 inlineAsm = 0; | |
| 64 cantInterpret = 0; | |
| 65 semanticRun = 0; | |
| 66 nestedFrameRef = 0; | |
| 67 fes = NULL; | |
| 68 introducing = 0; | |
| 69 tintro = NULL; | |
| 70 inferRetType = (type && type->nextOf() == NULL); | |
| 71 scope = NULL; | |
| 72 hasReturnExp = 0; | |
| 73 nrvo_can = 1; | |
| 74 nrvo_var = NULL; | |
| 75 shidden = NULL; | |
|
136
0e28624814e8
[svn r140] did a lot of the work towards being able to pass multiple modules on the command line. not complete yet though
lindquist
parents:
130
diff
changeset
|
76 // llvmdc |
|
0e28624814e8
[svn r140] did a lot of the work towards being able to pass multiple modules on the command line. not complete yet though
lindquist
parents:
130
diff
changeset
|
77 runTimeHack = false; |
|
0e28624814e8
[svn r140] did a lot of the work towards being able to pass multiple modules on the command line. not complete yet though
lindquist
parents:
130
diff
changeset
|
78 irFunc = NULL; |
| 1 | 79 } |
| 80 | |
| 81 Dsymbol *FuncDeclaration::syntaxCopy(Dsymbol *s) | |
| 82 { | |
| 83 FuncDeclaration *f; | |
| 84 | |
| 85 //printf("FuncDeclaration::syntaxCopy('%s')\n", toChars()); | |
| 86 if (s) | |
| 87 f = (FuncDeclaration *)s; | |
| 88 else | |
| 89 f = new FuncDeclaration(loc, endloc, ident, (enum STC) storage_class, type->syntaxCopy()); | |
| 90 f->outId = outId; | |
| 91 f->frequire = frequire ? frequire->syntaxCopy() : NULL; | |
| 92 f->fensure = fensure ? fensure->syntaxCopy() : NULL; | |
| 93 f->fbody = fbody ? fbody->syntaxCopy() : NULL; | |
| 94 assert(!fthrows); // deprecated | |
| 95 return f; | |
| 96 } | |
| 97 | |
| 98 | |
| 99 // Do the semantic analysis on the external interface to the function. | |
| 100 | |
| 101 void FuncDeclaration::semantic(Scope *sc) | |
| 102 { TypeFunction *f; | |
| 103 StructDeclaration *sd; | |
| 104 ClassDeclaration *cd; | |
| 105 InterfaceDeclaration *id; | |
| 106 | |
| 107 #if 0 | |
| 108 printf("FuncDeclaration::semantic(sc = %p, this = %p, '%s', linkage = %d)\n", sc, this, toPrettyChars(), sc->linkage); | |
| 109 if (isFuncLiteralDeclaration()) | |
| 110 printf("\tFuncLiteralDeclaration()\n"); | |
| 111 printf("sc->parent = %s\n", sc->parent->toChars()); | |
| 112 printf("type: %s\n", type->toChars()); | |
| 113 #endif | |
| 114 | |
| 115 if (type->nextOf()) | |
| 116 type = type->semantic(loc, sc); | |
| 117 //type->print(); | |
| 118 if (type->ty != Tfunction) | |
| 119 { | |
| 120 error("%s must be a function", toChars()); | |
| 121 return; | |
| 122 } | |
| 123 f = (TypeFunction *)(type); | |
| 124 size_t nparams = Argument::dim(f->parameters); | |
| 125 | |
| 126 linkage = sc->linkage; | |
| 127 // if (!parent) | |
| 128 { | |
| 129 //parent = sc->scopesym; | |
| 130 parent = sc->parent; | |
| 131 } | |
| 132 protection = sc->protection; | |
| 133 storage_class |= sc->stc; | |
| 134 //printf("function storage_class = x%x\n", storage_class); | |
| 135 Dsymbol *parent = toParent(); | |
| 136 | |
| 137 if (isConst() || isAuto() || isScope()) | |
| 138 error("functions cannot be const or auto"); | |
| 139 | |
| 140 if (isAbstract() && !isVirtual()) | |
| 141 error("non-virtual functions cannot be abstract"); | |
| 130 | 142 |
| 143 if (isAbstract() && isFinal()) | |
| 144 error("cannot be both final and abstract"); | |
| 1 | 145 #if 0 |
| 146 if (isAbstract() && fbody) | |
| 147 error("abstract functions cannot have bodies"); | |
| 148 #endif | |
| 149 | |
| 150 #if 0 | |
| 151 if (isStaticConstructor() || isStaticDestructor()) | |
| 152 { | |
| 153 if (!isStatic() || type->nextOf()->ty != Tvoid) | |
| 154 error("static constructors / destructors must be static void"); | |
| 155 if (f->arguments && f->arguments->dim) | |
| 156 error("static constructors / destructors must have empty parameter list"); | |
| 157 // BUG: check for invalid storage classes | |
| 158 } | |
| 159 #endif | |
| 160 | |
| 161 #ifdef IN_GCC | |
| 162 AggregateDeclaration *ad; | |
| 163 | |
| 164 ad = parent->isAggregateDeclaration(); | |
| 165 if (ad) | |
| 166 ad->methods.push(this); | |
| 167 #endif | |
| 168 sd = parent->isStructDeclaration(); | |
| 169 if (sd) | |
| 170 { | |
| 171 // Verify no constructors, destructors, etc. | |
| 172 if (isCtorDeclaration() || | |
| 173 isDtorDeclaration() | |
| 174 //|| isInvariantDeclaration() | |
| 175 //|| isUnitTestDeclaration() | |
| 176 ) | |
| 177 { | |
| 178 error("special member functions not allowed for %ss", sd->kind()); | |
| 179 } | |
| 180 | |
| 181 #if 0 | |
| 182 if (!sd->inv) | |
| 183 sd->inv = isInvariantDeclaration(); | |
| 184 | |
| 185 if (!sd->aggNew) | |
| 186 sd->aggNew = isNewDeclaration(); | |
| 187 | |
| 188 if (isDelete()) | |
| 189 { | |
| 190 if (sd->aggDelete) | |
| 191 error("multiple delete's for struct %s", sd->toChars()); | |
| 192 sd->aggDelete = (DeleteDeclaration *)(this); | |
| 193 } | |
| 194 #endif | |
| 195 } | |
| 196 | |
| 197 id = parent->isInterfaceDeclaration(); | |
| 198 if (id) | |
| 199 { | |
| 200 storage_class |= STCabstract; | |
| 201 | |
| 202 if (isCtorDeclaration() || | |
| 203 isDtorDeclaration() || | |
| 204 isInvariantDeclaration() || | |
| 205 isUnitTestDeclaration() || isNewDeclaration() || isDelete()) | |
| 206 error("special function not allowed in interface %s", id->toChars()); | |
| 207 if (fbody) | |
| 208 error("function body is not abstract in interface %s", id->toChars()); | |
| 209 } | |
| 210 | |
| 211 cd = parent->isClassDeclaration(); | |
| 212 if (cd) | |
| 213 { int vi; | |
| 214 CtorDeclaration *ctor; | |
| 215 DtorDeclaration *dtor; | |
| 216 InvariantDeclaration *inv; | |
| 217 | |
| 218 if (isCtorDeclaration()) | |
| 219 { | |
| 220 // ctor = (CtorDeclaration *)this; | |
| 221 // if (!cd->ctor) | |
| 222 // cd->ctor = ctor; | |
| 223 return; | |
| 224 } | |
| 225 | |
| 226 #if 0 | |
| 227 dtor = isDtorDeclaration(); | |
| 228 if (dtor) | |
| 229 { | |
| 230 if (cd->dtor) | |
| 231 error("multiple destructors for class %s", cd->toChars()); | |
| 232 cd->dtor = dtor; | |
| 233 } | |
| 234 | |
| 235 inv = isInvariantDeclaration(); | |
| 236 if (inv) | |
| 237 { | |
| 238 cd->inv = inv; | |
| 239 } | |
| 240 | |
| 241 if (isNewDeclaration()) | |
| 242 { | |
| 243 if (!cd->aggNew) | |
| 244 cd->aggNew = (NewDeclaration *)(this); | |
| 245 } | |
| 246 | |
| 247 if (isDelete()) | |
| 248 { | |
| 249 if (cd->aggDelete) | |
| 250 error("multiple delete's for class %s", cd->toChars()); | |
| 251 cd->aggDelete = (DeleteDeclaration *)(this); | |
| 252 } | |
| 253 #endif | |
| 254 | |
| 255 if (storage_class & STCabstract) | |
| 256 cd->isabstract = 1; | |
| 257 | |
| 258 // if static function, do not put in vtbl[] | |
| 259 if (!isVirtual()) | |
| 260 { | |
| 261 //printf("\tnot virtual\n"); | |
| 19 | 262 goto Ldone; |
| 1 | 263 } |
| 264 | |
| 265 // Find index of existing function in vtbl[] to override | |
| 266 if (cd->baseClass) | |
| 267 { | |
| 268 for (vi = 0; vi < cd->baseClass->vtbl.dim; vi++) | |
| 269 { | |
| 270 FuncDeclaration *fdv = ((Dsymbol *)cd->vtbl.data[vi])->isFuncDeclaration(); | |
| 271 | |
| 272 // BUG: should give error if argument types match, | |
| 273 // but return type does not? | |
| 274 | |
| 275 //printf("\tvtbl[%d] = '%s'\n", vi, fdv ? fdv->ident->toChars() : ""); | |
| 276 if (fdv && fdv->ident == ident) | |
| 277 { | |
| 278 int cov = type->covariant(fdv->type); | |
| 279 //printf("\tbaseclass cov = %d\n", cov); | |
| 280 if (cov == 2) | |
| 281 { | |
| 282 //type->print(); | |
| 283 //fdv->type->print(); | |
| 284 //printf("%s %s\n", type->deco, fdv->type->deco); | |
| 285 error("of type %s overrides but is not covariant with %s of type %s", | |
| 286 type->toChars(), fdv->toPrettyChars(), fdv->type->toChars()); | |
| 287 } | |
| 288 if (cov == 1) | |
| 289 { | |
| 290 if (fdv->isFinal()) | |
| 291 error("cannot override final function %s", fdv->toPrettyChars()); | |
| 292 if (fdv->toParent() == parent) | |
| 293 { | |
| 294 // If both are mixins, then error. | |
| 295 // If either is not, the one that is not overrides | |
| 296 // the other. | |
| 297 if (fdv->parent->isClassDeclaration()) | |
| 298 goto L1; | |
| 299 if (!this->parent->isClassDeclaration() | |
| 300 #if !BREAKABI | |
| 301 && !isDtorDeclaration() | |
| 302 #endif | |
| 303 ) | |
| 304 error("multiple overrides of same function"); | |
| 305 } | |
| 306 cd->vtbl.data[vi] = (void *)this; | |
| 307 vtblIndex = vi; | |
| 308 | |
| 309 /* This works by whenever this function is called, | |
| 310 * it actually returns tintro, which gets dynamically | |
| 311 * cast to type. But we know that tintro is a base | |
| 312 * of type, so we could optimize it by not doing a | |
| 313 * dynamic cast, but just subtracting the isBaseOf() | |
| 314 * offset if the value is != null. | |
| 315 */ | |
| 316 | |
| 317 if (fdv->tintro) | |
| 318 tintro = fdv->tintro; | |
| 319 else if (!type->equals(fdv->type)) | |
| 320 { | |
| 321 /* Only need to have a tintro if the vptr | |
| 322 * offsets differ | |
| 323 */ | |
| 324 int offset; | |
| 325 if (fdv->type->nextOf()->isBaseOf(type->nextOf(), &offset)) | |
| 326 { | |
| 327 tintro = fdv->type; | |
| 328 } | |
| 329 } | |
| 330 goto L1; | |
| 331 } | |
| 332 if (cov == 3) | |
| 333 { | |
| 334 cd->sizeok = 2; // can't finish due to forward reference | |
| 335 return; | |
| 336 } | |
| 337 } | |
| 338 } | |
| 339 } | |
| 340 | |
| 341 // This is an 'introducing' function. | |
| 342 | |
| 343 // Verify this doesn't override previous final function | |
| 344 if (cd->baseClass) | |
| 345 { Dsymbol *s = cd->baseClass->search(loc, ident, 0); | |
| 346 if (s) | |
| 347 { | |
| 348 FuncDeclaration *f = s->isFuncDeclaration(); | |
| 349 f = f->overloadExactMatch(type); | |
| 350 if (f && f->isFinal() && f->prot() != PROTprivate) | |
| 351 error("cannot override final function %s", f->toPrettyChars()); | |
| 352 } | |
| 353 } | |
| 354 | |
| 355 if (isFinal()) | |
| 356 { | |
| 357 cd->vtblFinal.push(this); | |
| 358 } | |
| 359 else | |
| 360 { | |
| 361 // Append to end of vtbl[] | |
| 362 //printf("\tintroducing function\n"); | |
| 363 introducing = 1; | |
| 364 vi = cd->vtbl.dim; | |
| 365 cd->vtbl.push(this); | |
| 366 vtblIndex = vi; | |
| 367 } | |
| 368 | |
| 369 L1: ; | |
| 370 | |
| 371 /* Go through all the interface bases. | |
| 372 * If this function is covariant with any members of those interface | |
| 373 * functions, set the tintro. | |
| 374 */ | |
| 375 for (int i = 0; i < cd->interfaces_dim; i++) | |
| 376 { | |
| 377 BaseClass *b = cd->interfaces[i]; | |
| 378 for (vi = 0; vi < b->base->vtbl.dim; vi++) | |
| 379 { | |
| 380 Dsymbol *s = (Dsymbol *)b->base->vtbl.data[vi]; | |
| 381 //printf("interface %d vtbl[%d] %p %s\n", i, vi, s, s->toChars()); | |
| 382 FuncDeclaration *fdv = s->isFuncDeclaration(); | |
| 383 if (fdv && fdv->ident == ident) | |
| 384 { | |
| 385 int cov = type->covariant(fdv->type); | |
| 386 //printf("\tcov = %d\n", cov); | |
| 387 if (cov == 2) | |
| 388 { | |
| 389 //type->print(); | |
| 390 //fdv->type->print(); | |
| 391 //printf("%s %s\n", type->deco, fdv->type->deco); | |
| 392 error("of type %s overrides but is not covariant with %s of type %s", | |
| 393 type->toChars(), fdv->toPrettyChars(), fdv->type->toChars()); | |
| 394 } | |
| 395 if (cov == 1) | |
| 396 { Type *ti = NULL; | |
| 397 | |
| 398 if (fdv->tintro) | |
| 399 ti = fdv->tintro; | |
| 400 else if (!type->equals(fdv->type)) | |
| 401 { | |
| 402 /* Only need to have a tintro if the vptr | |
| 403 * offsets differ | |
| 404 */ | |
| 405 int offset; | |
| 406 if (fdv->type->nextOf()->isBaseOf(type->nextOf(), &offset)) | |
| 407 { | |
| 408 ti = fdv->type; | |
| 409 #if 0 | |
| 410 if (offset) | |
| 411 ti = fdv->type; | |
| 19 | 412 else if (type->nextOf()->ty == Tclass) |
| 413 { ClassDeclaration *cdn = ((TypeClass *)type->nextOf())->sym; | |
| 1 | 414 if (cdn && cdn->sizeok != 1) |
| 415 ti = fdv->type; | |
| 416 } | |
| 417 #endif | |
| 418 } | |
| 419 } | |
| 420 if (ti) | |
| 421 { | |
| 422 if (tintro && !tintro->equals(ti)) | |
| 423 { | |
| 424 error("incompatible covariant types %s and %s", tintro->toChars(), ti->toChars()); | |
| 425 } | |
| 426 tintro = ti; | |
| 427 } | |
| 428 goto L2; | |
| 429 } | |
| 430 if (cov == 3) | |
| 431 { | |
| 432 cd->sizeok = 2; // can't finish due to forward reference | |
| 433 return; | |
| 434 } | |
| 435 } | |
| 436 } | |
| 437 } | |
| 438 | |
| 439 if (introducing && isOverride()) | |
| 440 { | |
| 441 error("function %s does not override any", toChars()); | |
| 442 } | |
| 443 | |
| 444 L2: ; | |
| 445 } | |
| 446 else if (isOverride() && !parent->isTemplateInstance()) | |
| 447 error("override only applies to class member functions"); | |
| 448 | |
| 449 /* Do not allow template instances to add virtual functions | |
| 450 * to a class. | |
| 451 */ | |
| 452 if (isVirtual()) | |
| 453 { | |
| 454 TemplateInstance *ti = parent->isTemplateInstance(); | |
| 455 if (ti) | |
| 456 { | |
| 457 // Take care of nested templates | |
| 458 while (1) | |
| 459 { | |
| 460 TemplateInstance *ti2 = ti->tempdecl->parent->isTemplateInstance(); | |
| 461 if (!ti2) | |
| 462 break; | |
| 463 ti = ti2; | |
| 464 } | |
| 465 | |
| 466 // If it's a member template | |
| 467 ClassDeclaration *cd = ti->tempdecl->isClassMember(); | |
| 468 if (cd) | |
| 469 { | |
| 470 error("cannot use template to add virtual function to class '%s'", cd->toChars()); | |
| 471 } | |
| 472 } | |
| 473 } | |
| 474 | |
| 475 if (isMain()) | |
| 476 { | |
| 477 // Check parameters to see if they are either () or (char[][] args) | |
| 478 switch (nparams) | |
| 479 { | |
| 480 case 0: | |
| 481 break; | |
| 482 | |
| 483 case 1: | |
| 484 { | |
| 485 Argument *arg0 = Argument::getNth(f->parameters, 0); | |
| 486 if (arg0->type->ty != Tarray || | |
| 19 | 487 arg0->type->nextOf()->ty != Tarray || |
| 488 arg0->type->nextOf()->nextOf()->ty != Tchar || | |
| 1 | 489 arg0->storageClass & (STCout | STCref | STClazy)) |
| 490 goto Lmainerr; | |
| 491 break; | |
| 492 } | |
| 493 | |
| 494 default: | |
| 495 goto Lmainerr; | |
| 496 } | |
| 497 | |
| 498 if (f->nextOf()->ty != Tint32 && f->nextOf()->ty != Tvoid) | |
| 499 error("must return int or void, not %s", f->nextOf()->toChars()); | |
| 500 if (f->varargs) | |
| 501 { | |
| 502 Lmainerr: | |
| 503 error("parameters must be main() or main(char[][] args)"); | |
| 504 } | |
| 505 } | |
| 506 | |
| 507 if (ident == Id::assign && (sd || cd)) | |
| 508 { // Disallow identity assignment operator. | |
| 509 | |
| 510 // opAssign(...) | |
| 511 if (nparams == 0) | |
| 512 { if (f->varargs == 1) | |
| 513 goto Lassignerr; | |
| 514 } | |
| 515 else | |
| 516 { | |
| 517 Argument *arg0 = Argument::getNth(f->parameters, 0); | |
| 518 Type *t0 = arg0->type->toBasetype(); | |
| 519 Type *tb = sd ? sd->type : cd->type; | |
| 520 if (arg0->type->implicitConvTo(tb) || | |
| 521 (sd && t0->ty == Tpointer && t0->nextOf()->implicitConvTo(tb)) | |
| 522 ) | |
| 523 { | |
| 524 if (nparams == 1) | |
| 525 goto Lassignerr; | |
| 526 Argument *arg1 = Argument::getNth(f->parameters, 1); | |
| 527 if (arg1->defaultArg) | |
| 528 goto Lassignerr; | |
| 529 } | |
| 530 } | |
| 531 } | |
| 532 | |
| 19 | 533 Ldone: |
| 1 | 534 /* Save scope for possible later use (if we need the |
| 535 * function internals) | |
| 536 */ | |
| 537 scope = new Scope(*sc); | |
| 538 scope->setNoFree(); | |
| 539 return; | |
| 540 | |
| 541 Lassignerr: | |
| 542 error("identity assignment operator overload is illegal"); | |
| 543 } | |
| 544 | |
| 545 void FuncDeclaration::semantic2(Scope *sc) | |
| 546 { | |
| 547 } | |
| 548 | |
| 549 // Do the semantic analysis on the internals of the function. | |
| 550 | |
| 551 void FuncDeclaration::semantic3(Scope *sc) | |
| 552 { TypeFunction *f; | |
| 553 AggregateDeclaration *ad; | |
| 554 VarDeclaration *argptr = NULL; | |
| 555 VarDeclaration *_arguments = NULL; | |
| 556 | |
| 557 if (!parent) | |
| 558 { | |
| 92 | 559 if (global.errors) |
| 560 return; | |
| 1 | 561 printf("FuncDeclaration::semantic3(%s '%s', sc = %p)\n", kind(), toChars(), sc); |
| 562 assert(0); | |
| 563 } | |
| 564 //printf("FuncDeclaration::semantic3('%s.%s', sc = %p)\n", parent->toChars(), toChars(), sc); | |
| 565 //fflush(stdout); | |
| 566 //{ static int x; if (++x == 2) *(char*)0=0; } | |
| 567 //printf("\tlinkage = %d\n", sc->linkage); | |
| 568 | |
| 569 //printf(" sc->incontract = %d\n", sc->incontract); | |
| 570 if (semanticRun) | |
| 571 return; | |
| 572 semanticRun = 1; | |
| 573 | |
| 574 if (!type || type->ty != Tfunction) | |
| 575 return; | |
| 576 f = (TypeFunction *)(type); | |
| 577 size_t nparams = Argument::dim(f->parameters); | |
| 578 | |
| 579 // Check the 'throws' clause | |
| 580 if (fthrows) | |
| 581 { int i; | |
| 582 | |
| 583 for (i = 0; i < fthrows->dim; i++) | |
| 584 { | |
| 585 Type *t = (Type *)fthrows->data[i]; | |
| 586 | |
| 587 t = t->semantic(loc, sc); | |
| 588 if (!t->isClassHandle()) | |
| 589 error("can only throw classes, not %s", t->toChars()); | |
| 590 } | |
| 591 } | |
| 592 | |
| 593 if (fbody || frequire) | |
| 594 { | |
| 595 // Establish function scope | |
| 596 ScopeDsymbol *ss; | |
| 597 Scope *sc2; | |
| 598 | |
| 599 localsymtab = new DsymbolTable(); | |
| 600 | |
| 601 ss = new ScopeDsymbol(); | |
| 602 ss->parent = sc->scopesym; | |
| 603 sc2 = sc->push(ss); | |
| 604 sc2->func = this; | |
| 605 sc2->parent = this; | |
| 606 sc2->callSuper = 0; | |
| 607 sc2->sbreak = NULL; | |
| 608 sc2->scontinue = NULL; | |
| 609 sc2->sw = NULL; | |
| 610 sc2->fes = fes; | |
| 611 sc2->linkage = LINKd; | |
| 612 sc2->stc &= ~(STCauto | STCscope | STCstatic | STCabstract | STCdeprecated); | |
| 613 sc2->protection = PROTpublic; | |
| 614 sc2->explicitProtection = 0; | |
| 615 sc2->structalign = 8; | |
| 616 sc2->incontract = 0; | |
| 617 sc2->tf = NULL; | |
| 618 sc2->noctor = 0; | |
| 619 | |
| 620 // Declare 'this' | |
| 621 ad = isThis(); | |
| 622 if (ad) | |
| 623 { VarDeclaration *v; | |
| 624 | |
| 625 if (isFuncLiteralDeclaration() && isNested()) | |
| 626 { | |
| 627 error("literals cannot be class members"); | |
| 628 return; | |
| 629 } | |
| 630 else | |
| 631 { | |
| 632 assert(!isNested()); // can't be both member and nested | |
| 633 assert(ad->handle); | |
| 634 v = new ThisDeclaration(ad->handle); | |
| 635 v->storage_class |= STCparameter | STCin; | |
| 636 v->semantic(sc2); | |
| 637 if (!sc2->insert(v)) | |
| 638 assert(0); | |
| 639 v->parent = this; | |
| 640 vthis = v; | |
| 641 } | |
| 642 } | |
| 643 else if (isNested()) | |
| 644 { | |
| 645 VarDeclaration *v; | |
| 646 | |
| 647 v = new ThisDeclaration(Type::tvoid->pointerTo()); | |
| 648 v->storage_class |= STCparameter | STCin; | |
| 649 v->semantic(sc2); | |
| 650 if (!sc2->insert(v)) | |
| 651 assert(0); | |
| 652 v->parent = this; | |
| 653 vthis = v; | |
| 654 } | |
| 655 | |
| 656 // Declare hidden variable _arguments[] and _argptr | |
| 657 if (f->varargs == 1) | |
| 658 { Type *t; | |
| 659 | |
| 660 if (f->linkage == LINKd) | |
| 661 { // Declare _arguments[] | |
| 662 #if BREAKABI | |
| 663 v_arguments = new VarDeclaration(0, Type::typeinfotypelist->type, Id::_arguments_typeinfo, NULL); | |
| 664 v_arguments->storage_class = STCparameter | STCin; | |
| 665 v_arguments->semantic(sc2); | |
| 666 sc2->insert(v_arguments); | |
| 667 v_arguments->parent = this; | |
| 668 | |
| 669 t = Type::typeinfo->type->arrayOf(); | |
| 670 _arguments = new VarDeclaration(0, t, Id::_arguments, NULL); | |
| 671 _arguments->semantic(sc2); | |
| 672 sc2->insert(_arguments); | |
| 673 _arguments->parent = this; | |
| 674 #else | |
| 675 t = Type::typeinfo->type->arrayOf(); | |
| 676 v_arguments = new VarDeclaration(0, t, Id::_arguments, NULL); | |
| 677 v_arguments->storage_class = STCparameter | STCin; | |
| 678 v_arguments->semantic(sc2); | |
| 679 sc2->insert(v_arguments); | |
| 680 v_arguments->parent = this; | |
| 681 #endif | |
| 682 } | |
| 683 if (f->linkage == LINKd || (parameters && parameters->dim)) | |
| 684 { // Declare _argptr | |
| 685 #if IN_GCC | |
| 686 t = d_gcc_builtin_va_list_d_type; | |
| 687 #else | |
| 688 t = Type::tvoid->pointerTo(); | |
| 689 #endif | |
| 690 argptr = new VarDeclaration(0, t, Id::_argptr, NULL); | |
| 691 argptr->semantic(sc2); | |
| 692 sc2->insert(argptr); | |
| 693 argptr->parent = this; | |
| 694 } | |
| 695 } | |
| 696 | |
| 697 // Propagate storage class from tuple arguments to their sub-arguments. | |
| 698 if (f->parameters) | |
| 699 { | |
| 700 for (size_t i = 0; i < f->parameters->dim; i++) | |
| 701 { Argument *arg = (Argument *)f->parameters->data[i]; | |
| 702 | |
| 703 if (arg->type->ty == Ttuple) | |
| 704 { TypeTuple *t = (TypeTuple *)arg->type; | |
| 705 size_t dim = Argument::dim(t->arguments); | |
| 706 for (size_t j = 0; j < dim; j++) | |
| 707 { Argument *narg = Argument::getNth(t->arguments, j); | |
| 708 narg->storageClass = arg->storageClass; | |
| 709 } | |
| 710 } | |
| 711 } | |
| 712 } | |
| 713 | |
| 714 // Declare all the function parameters as variables | |
| 715 if (nparams) | |
| 716 { // parameters[] has all the tuples removed, as the back end | |
| 717 // doesn't know about tuples | |
| 718 parameters = new Dsymbols(); | |
| 719 parameters->reserve(nparams); | |
| 720 for (size_t i = 0; i < nparams; i++) | |
| 721 { | |
| 722 Argument *arg = Argument::getNth(f->parameters, i); | |
| 723 Identifier *id = arg->ident; | |
| 724 if (!id) | |
| 725 { | |
| 726 //error("no identifier for parameter %d of %s", i + 1, toChars()); | |
| 727 OutBuffer buf; | |
| 728 buf.printf("_param_%zu", i); | |
| 729 char *name = (char *)buf.extractData(); | |
| 730 id = new Identifier(name, TOKidentifier); | |
| 731 arg->ident = id; | |
| 732 } | |
| 733 VarDeclaration *v = new VarDeclaration(0, arg->type, id, NULL); | |
| 734 //printf("declaring parameter %s of type %s\n", v->toChars(), v->type->toChars()); | |
| 735 v->storage_class |= STCparameter; | |
| 736 if (f->varargs == 2 && i + 1 == nparams) | |
| 737 v->storage_class |= STCvariadic; | |
| 738 v->storage_class |= arg->storageClass & (STCin | STCout | STCref | STClazy); | |
| 739 if (v->storage_class & STClazy) | |
| 740 v->storage_class |= STCin; | |
| 741 v->semantic(sc2); | |
| 742 if (!sc2->insert(v)) | |
| 743 error("parameter %s.%s is already defined", toChars(), v->toChars()); | |
| 744 else | |
| 745 parameters->push(v); | |
| 746 localsymtab->insert(v); | |
| 747 v->parent = this; | |
| 748 // for llvm d | |
| 749 arg->vardecl = v; | |
| 750 } | |
| 751 } | |
| 752 | |
| 753 // Declare the tuple symbols and put them in the symbol table, | |
| 754 // but not in parameters[]. | |
| 755 if (f->parameters) | |
| 756 { | |
| 757 for (size_t i = 0; i < f->parameters->dim; i++) | |
| 758 { Argument *arg = (Argument *)f->parameters->data[i]; | |
| 759 | |
| 760 if (!arg->ident) | |
| 761 continue; // never used, so ignore | |
| 762 if (arg->type->ty == Ttuple) | |
| 763 { TypeTuple *t = (TypeTuple *)arg->type; | |
| 764 size_t dim = Argument::dim(t->arguments); | |
| 765 Objects *exps = new Objects(); | |
| 766 exps->setDim(dim); | |
| 767 for (size_t j = 0; j < dim; j++) | |
| 768 { Argument *narg = Argument::getNth(t->arguments, j); | |
| 769 assert(narg->ident); | |
| 770 VarDeclaration *v = sc2->search(0, narg->ident, NULL)->isVarDeclaration(); | |
| 771 assert(v); | |
| 772 Expression *e = new VarExp(0, v); | |
| 773 exps->data[j] = (void *)e; | |
| 774 } | |
| 775 assert(arg->ident); | |
| 776 TupleDeclaration *v = new TupleDeclaration(0, arg->ident, exps); | |
| 777 //printf("declaring tuple %s\n", v->toChars()); | |
| 778 v->isexp = 1; | |
| 779 if (!sc2->insert(v)) | |
| 780 error("parameter %s.%s is already defined", toChars(), v->toChars()); | |
| 781 localsymtab->insert(v); | |
| 782 v->parent = this; | |
| 783 } | |
| 784 } | |
| 785 } | |
| 786 | |
| 787 sc2->incontract++; | |
| 788 | |
| 789 if (frequire) | |
| 790 { | |
| 791 // BUG: need to error if accessing out parameters | |
| 792 // BUG: need to treat parameters as const | |
| 793 // BUG: need to disallow returns and throws | |
| 794 // BUG: verify that all in and ref parameters are read | |
| 795 frequire = frequire->semantic(sc2); | |
| 796 labtab = NULL; // so body can't refer to labels | |
| 797 } | |
| 798 | |
| 799 if (fensure || addPostInvariant()) | |
| 800 { | |
| 801 ScopeDsymbol *sym; | |
| 802 | |
| 803 sym = new ScopeDsymbol(); | |
| 804 sym->parent = sc2->scopesym; | |
| 805 sc2 = sc2->push(sym); | |
| 806 | |
| 807 assert(type->nextOf()); | |
| 808 if (type->nextOf()->ty == Tvoid) | |
| 809 { | |
| 810 if (outId) | |
| 811 error("void functions have no result"); | |
| 812 } | |
| 813 else | |
| 814 { | |
| 815 if (!outId) | |
| 816 outId = Id::result; // provide a default | |
| 817 } | |
| 818 | |
| 819 if (outId) | |
| 820 { // Declare result variable | |
| 821 VarDeclaration *v; | |
| 822 Loc loc = this->loc; | |
| 823 | |
| 824 if (fensure) | |
| 825 loc = fensure->loc; | |
| 826 | |
| 827 v = new VarDeclaration(loc, type->nextOf(), outId, NULL); | |
| 828 v->noauto = 1; | |
| 829 sc2->incontract--; | |
| 830 v->semantic(sc2); | |
| 831 sc2->incontract++; | |
| 832 if (!sc2->insert(v)) | |
| 833 error("out result %s is already defined", v->toChars()); | |
| 834 v->parent = this; | |
| 835 vresult = v; | |
| 836 | |
| 837 // vresult gets initialized with the function return value | |
| 838 // in ReturnStatement::semantic() | |
| 839 } | |
| 840 | |
| 841 // BUG: need to treat parameters as const | |
| 842 // BUG: need to disallow returns and throws | |
| 843 if (fensure) | |
| 844 { fensure = fensure->semantic(sc2); | |
| 845 labtab = NULL; // so body can't refer to labels | |
| 846 } | |
| 847 | |
| 848 if (!global.params.useOut) | |
| 849 { fensure = NULL; // discard | |
| 850 vresult = NULL; | |
| 851 } | |
| 852 | |
| 853 // Postcondition invariant | |
| 854 if (addPostInvariant()) | |
| 855 { | |
| 856 Expression *e = NULL; | |
| 857 if (isCtorDeclaration()) | |
| 858 { | |
| 859 // Call invariant directly only if it exists | |
| 860 InvariantDeclaration *inv = ad->inv; | |
| 861 ClassDeclaration *cd = ad->isClassDeclaration(); | |
| 862 | |
| 863 while (!inv && cd) | |
| 864 { | |
| 865 cd = cd->baseClass; | |
| 866 if (!cd) | |
| 867 break; | |
| 868 inv = cd->inv; | |
| 869 } | |
| 870 if (inv) | |
| 871 { | |
| 872 e = new DsymbolExp(0, inv); | |
| 873 e = new CallExp(0, e); | |
| 874 e = e->semantic(sc2); | |
| 875 } | |
| 876 } | |
| 877 else | |
| 878 { // Call invariant virtually | |
| 879 ThisExp *v = new ThisExp(0); | |
| 880 v->type = vthis->type; | |
| 881 e = new AssertExp(0, v); | |
| 882 } | |
| 883 if (e) | |
| 884 { | |
| 885 ExpStatement *s = new ExpStatement(0, e); | |
| 886 if (fensure) | |
| 887 fensure = new CompoundStatement(0, s, fensure); | |
| 888 else | |
| 889 fensure = s; | |
| 890 } | |
| 891 } | |
| 892 | |
| 893 if (fensure) | |
| 894 { returnLabel = new LabelDsymbol(Id::returnLabel); | |
| 895 LabelStatement *ls = new LabelStatement(0, Id::returnLabel, fensure); | |
| 896 ls->isReturnLabel = 1; | |
| 897 returnLabel->statement = ls; | |
| 898 } | |
| 899 sc2 = sc2->pop(); | |
| 900 } | |
| 901 | |
| 902 sc2->incontract--; | |
| 903 | |
| 904 if (fbody) | |
| 905 { ClassDeclaration *cd = isClassMember(); | |
| 906 | |
| 907 if (isCtorDeclaration() && cd) | |
| 908 { | |
| 909 for (int i = 0; i < cd->fields.dim; i++) | |
| 910 { VarDeclaration *v = (VarDeclaration *)cd->fields.data[i]; | |
| 911 | |
| 912 v->ctorinit = 0; | |
| 913 } | |
| 914 } | |
| 915 | |
| 916 if (inferRetType || f->retStyle() != RETstack) | |
| 917 nrvo_can = 0; | |
| 918 | |
| 919 fbody = fbody->semantic(sc2); | |
| 920 | |
| 921 if (inferRetType) | |
| 922 { // If no return type inferred yet, then infer a void | |
| 923 if (!type->nextOf()) | |
| 924 { | |
| 925 type->next = Type::tvoid; | |
| 926 type = type->semantic(loc, sc); | |
| 927 } | |
| 928 f = (TypeFunction *)type; | |
| 929 } | |
| 930 | |
| 931 int offend = fbody ? fbody->fallOffEnd() : TRUE; | |
| 932 | |
| 933 if (isStaticCtorDeclaration()) | |
| 934 { /* It's a static constructor. Ensure that all | |
| 935 * ctor consts were initialized. | |
| 936 */ | |
| 937 | |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
938 Dsymbol *p = toParent(); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
939 ScopeDsymbol *ad = p->isScopeDsymbol(); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
940 if (!ad) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
941 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
942 error("static constructor can only be member of struct/class/module, not %s %s", p->kind(), p->toChars()); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
943 } |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
944 else |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
945 { |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
946 for (int i = 0; i < ad->members->dim; i++) |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
947 { Dsymbol *s = (Dsymbol *)ad->members->data[i]; |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
948 |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
949 s->checkCtorConstInit(); |
|
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
950 } |
| 1 | 951 } |
| 952 } | |
| 953 | |
| 954 if (isCtorDeclaration() && cd) | |
| 955 { | |
| 956 //printf("callSuper = x%x\n", sc2->callSuper); | |
| 957 | |
| 958 // Verify that all the ctorinit fields got initialized | |
| 959 if (!(sc2->callSuper & CSXthis_ctor)) | |
| 960 { | |
| 961 for (int i = 0; i < cd->fields.dim; i++) | |
| 962 { VarDeclaration *v = (VarDeclaration *)cd->fields.data[i]; | |
| 963 | |
| 964 if (v->ctorinit == 0 && v->isCtorinit()) | |
| 965 error("missing initializer for const field %s", v->toChars()); | |
| 966 } | |
| 967 } | |
| 968 | |
| 969 if (!(sc2->callSuper & CSXany_ctor) && | |
| 970 cd->baseClass && cd->baseClass->ctor) | |
| 971 { | |
| 972 sc2->callSuper = 0; | |
| 973 | |
| 974 // Insert implicit super() at start of fbody | |
| 975 Expression *e1 = new SuperExp(0); | |
| 976 Expression *e = new CallExp(0, e1); | |
| 977 | |
| 978 unsigned errors = global.errors; | |
| 979 global.gag++; | |
| 980 e = e->semantic(sc2); | |
| 981 global.gag--; | |
| 982 if (errors != global.errors) | |
| 983 error("no match for implicit super() call in constructor"); | |
| 984 | |
| 985 Statement *s = new ExpStatement(0, e); | |
| 986 fbody = new CompoundStatement(0, s, fbody); | |
| 987 } | |
| 988 } | |
| 989 else if (fes) | |
| 990 { // For foreach(){} body, append a return 0; | |
| 991 Expression *e = new IntegerExp(0); | |
| 992 Statement *s = new ReturnStatement(0, e); | |
| 993 fbody = new CompoundStatement(0, fbody, s); | |
| 994 assert(!returnLabel); | |
| 995 } | |
| 996 else if (!hasReturnExp && type->nextOf()->ty != Tvoid) | |
| 997 error("expected to return a value of type %s", type->nextOf()->toChars()); | |
| 998 else if (!inlineAsm) | |
| 999 { | |
| 1000 if (type->nextOf()->ty == Tvoid) | |
| 1001 { | |
| 1002 if (offend && isMain()) | |
| 1003 { // Add a return 0; statement | |
| 1004 Statement *s = new ReturnStatement(0, new IntegerExp(0)); | |
| 1005 fbody = new CompoundStatement(0, fbody, s); | |
| 1006 } | |
| 1007 } | |
| 1008 else | |
| 1009 { | |
| 1010 if (offend) | |
| 1011 { Expression *e; | |
| 1012 | |
| 1013 if (global.params.warnings) | |
| 1014 { fprintf(stdmsg, "warning - "); | |
| 1015 error("no return at end of function"); | |
| 1016 } | |
| 1017 | |
| 1018 if (global.params.useAssert && | |
| 1019 !global.params.useInline) | |
| 1020 { /* Add an assert(0, msg); where the missing return | |
| 1021 * should be. | |
| 1022 */ | |
| 1023 e = new AssertExp( | |
| 1024 endloc, | |
| 1025 new IntegerExp(0), | |
| 1026 new StringExp(loc, "missing return expression") | |
| 1027 ); | |
| 1028 } | |
| 1029 else | |
| 1030 e = new HaltExp(endloc); | |
| 1031 e = new CommaExp(0, e, type->nextOf()->defaultInit()); | |
| 1032 e = e->semantic(sc2); | |
| 1033 Statement *s = new ExpStatement(0, e); | |
| 1034 fbody = new CompoundStatement(0, fbody, s); | |
| 1035 } | |
| 1036 } | |
| 1037 } | |
| 1038 } | |
| 1039 | |
| 1040 { | |
| 1041 Statements *a = new Statements(); | |
| 1042 | |
| 1043 // Merge in initialization of 'out' parameters | |
| 1044 if (parameters) | |
| 1045 { for (size_t i = 0; i < parameters->dim; i++) | |
| 1046 { VarDeclaration *v; | |
| 1047 | |
| 1048 v = (VarDeclaration *)parameters->data[i]; | |
| 1049 if (v->storage_class & STCout) | |
| 1050 { | |
| 1051 assert(v->init); | |
| 1052 ExpInitializer *ie = v->init->isExpInitializer(); | |
| 1053 assert(ie); | |
| 1054 a->push(new ExpStatement(0, ie->exp)); | |
| 1055 } | |
| 1056 } | |
| 1057 } | |
| 1058 | |
|
57
a9d29e9f1fed
[svn r61] Added support for D-style variadic functions :)
lindquist
parents:
50
diff
changeset
|
1059 // we'll handle variadics ourselves |
|
a9d29e9f1fed
[svn r61] Added support for D-style variadic functions :)
lindquist
parents:
50
diff
changeset
|
1060 #if !IN_LLVM |
| 1 | 1061 if (argptr) |
| 1062 { // Initialize _argptr to point past non-variadic arg | |
| 1063 #if IN_GCC | |
| 1064 // Handled in FuncDeclaration::toObjFile | |
| 1065 v_argptr = argptr; | |
| 1066 v_argptr->init = new VoidInitializer(loc); | |
| 1067 #else | |
| 1068 Expression *e1; | |
| 1069 Expression *e; | |
| 1070 Type *t = argptr->type; | |
| 1071 VarDeclaration *p; | |
| 1072 unsigned offset; | |
| 1073 | |
| 1074 e1 = new VarExp(0, argptr); | |
| 1075 if (parameters && parameters->dim) | |
| 1076 p = (VarDeclaration *)parameters->data[parameters->dim - 1]; | |
| 1077 else | |
| 1078 p = v_arguments; // last parameter is _arguments[] | |
| 1079 offset = p->type->size(); | |
| 1080 offset = (offset + 3) & ~3; // assume stack aligns on 4 | |
| 1081 e = new SymOffExp(0, p, offset); | |
| 1082 e = new AssignExp(0, e1, e); | |
| 1083 e->type = t; | |
| 1084 a->push(new ExpStatement(0, e)); | |
|
57
a9d29e9f1fed
[svn r61] Added support for D-style variadic functions :)
lindquist
parents:
50
diff
changeset
|
1085 #endif // IN_GCC |
| 1 | 1086 } |
| 1087 | |
| 1088 if (_arguments) | |
| 1089 { | |
| 1090 /* Advance to elements[] member of TypeInfo_Tuple with: | |
| 1091 * _arguments = v_arguments.elements; | |
| 1092 */ | |
| 1093 Expression *e = new VarExp(0, v_arguments); | |
| 1094 e = new DotIdExp(0, e, Id::elements); | |
| 1095 Expression *e1 = new VarExp(0, _arguments); | |
| 1096 e = new AssignExp(0, e1, e); | |
| 1097 e = e->semantic(sc); | |
| 1098 a->push(new ExpStatement(0, e)); | |
| 1099 } | |
| 1100 | |
|
57
a9d29e9f1fed
[svn r61] Added support for D-style variadic functions :)
lindquist
parents:
50
diff
changeset
|
1101 #endif // !IN_LLVM |
|
a9d29e9f1fed
[svn r61] Added support for D-style variadic functions :)
lindquist
parents:
50
diff
changeset
|
1102 |
| 1 | 1103 // Merge contracts together with body into one compound statement |
| 1104 | |
| 1105 #ifdef _DH | |
| 1106 if (frequire && global.params.useIn) | |
| 1107 { frequire->incontract = 1; | |
| 1108 a->push(frequire); | |
| 1109 } | |
| 1110 #else | |
| 1111 if (frequire && global.params.useIn) | |
| 1112 a->push(frequire); | |
| 1113 #endif | |
| 1114 | |
| 1115 // Precondition invariant | |
| 1116 if (addPreInvariant()) | |
| 1117 { | |
| 1118 Expression *e = NULL; | |
| 1119 if (isDtorDeclaration()) | |
| 1120 { | |
| 1121 // Call invariant directly only if it exists | |
| 1122 InvariantDeclaration *inv = ad->inv; | |
| 1123 ClassDeclaration *cd = ad->isClassDeclaration(); | |
| 1124 | |
| 1125 while (!inv && cd) | |
| 1126 { | |
| 1127 cd = cd->baseClass; | |
| 1128 if (!cd) | |
| 1129 break; | |
| 1130 inv = cd->inv; | |
| 1131 } | |
| 1132 if (inv) | |
| 1133 { | |
| 1134 e = new DsymbolExp(0, inv); | |
| 1135 e = new CallExp(0, e); | |
| 1136 e = e->semantic(sc2); | |
| 1137 } | |
| 1138 } | |
| 1139 else | |
| 1140 { // Call invariant virtually | |
| 1141 ThisExp *v = new ThisExp(0); | |
| 1142 v->type = vthis->type; | |
| 1143 Expression *se = new StringExp(0, "null this"); | |
| 1144 se = se->semantic(sc); | |
| 1145 se->type = Type::tchar->arrayOf(); | |
| 1146 e = new AssertExp(loc, v, se); | |
| 1147 } | |
| 1148 if (e) | |
| 1149 { | |
| 1150 ExpStatement *s = new ExpStatement(0, e); | |
| 1151 a->push(s); | |
| 1152 } | |
| 1153 } | |
| 1154 | |
| 1155 if (fbody) | |
| 1156 a->push(fbody); | |
| 1157 | |
| 1158 if (fensure) | |
| 1159 { | |
| 1160 a->push(returnLabel->statement); | |
| 1161 | |
| 1162 if (type->nextOf()->ty != Tvoid) | |
| 1163 { | |
| 1164 // Create: return vresult; | |
| 1165 assert(vresult); | |
| 1166 Expression *e = new VarExp(0, vresult); | |
| 1167 if (tintro) | |
| 1168 { e = e->implicitCastTo(sc, tintro->nextOf()); | |
| 1169 e = e->semantic(sc); | |
| 1170 } | |
| 1171 ReturnStatement *s = new ReturnStatement(0, e); | |
| 1172 a->push(s); | |
| 1173 } | |
| 1174 } | |
| 1175 | |
| 1176 fbody = new CompoundStatement(0, a); | |
| 1177 } | |
| 1178 | |
| 1179 sc2->callSuper = 0; | |
| 1180 sc2->pop(); | |
| 1181 } | |
| 1182 semanticRun = 2; | |
| 1183 } | |
| 1184 | |
| 1185 void FuncDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 1186 { | |
| 1187 //printf("FuncDeclaration::toCBuffer() '%s'\n", toChars()); | |
| 1188 | |
| 1189 type->toCBuffer(buf, ident, hgs); | |
| 1190 bodyToCBuffer(buf, hgs); | |
| 1191 } | |
| 1192 | |
| 1193 | |
| 1194 void FuncDeclaration::bodyToCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 1195 { | |
| 1196 if (fbody && | |
| 1197 (!hgs->hdrgen || hgs->tpltMember || canInline(1,1)) | |
| 1198 ) | |
| 1199 { buf->writenl(); | |
| 1200 | |
| 1201 // in{} | |
| 1202 if (frequire) | |
| 1203 { buf->writestring("in"); | |
| 1204 buf->writenl(); | |
| 1205 frequire->toCBuffer(buf, hgs); | |
| 1206 } | |
| 1207 | |
| 1208 // out{} | |
| 1209 if (fensure) | |
| 1210 { buf->writestring("out"); | |
| 1211 if (outId) | |
| 1212 { buf->writebyte('('); | |
| 1213 buf->writestring(outId->toChars()); | |
| 1214 buf->writebyte(')'); | |
| 1215 } | |
| 1216 buf->writenl(); | |
| 1217 fensure->toCBuffer(buf, hgs); | |
| 1218 } | |
| 1219 | |
| 1220 if (frequire || fensure) | |
| 1221 { buf->writestring("body"); | |
| 1222 buf->writenl(); | |
| 1223 } | |
| 1224 | |
| 1225 buf->writebyte('{'); | |
| 1226 buf->writenl(); | |
| 1227 fbody->toCBuffer(buf, hgs); | |
| 1228 buf->writebyte('}'); | |
| 1229 buf->writenl(); | |
| 1230 } | |
| 1231 else | |
| 1232 { buf->writeByte(';'); | |
| 1233 buf->writenl(); | |
| 1234 } | |
| 1235 } | |
| 1236 | |
| 1237 /**************************************************** | |
| 1238 * Determine if 'this' overrides fd. | |
| 1239 * Return !=0 if it does. | |
| 1240 */ | |
| 1241 | |
| 1242 int FuncDeclaration::overrides(FuncDeclaration *fd) | |
| 1243 { int result = 0; | |
| 1244 | |
| 1245 if (fd->ident == ident) | |
| 1246 { | |
| 1247 int cov = type->covariant(fd->type); | |
| 1248 if (cov) | |
| 1249 { ClassDeclaration *cd1 = toParent()->isClassDeclaration(); | |
| 1250 ClassDeclaration *cd2 = fd->toParent()->isClassDeclaration(); | |
| 1251 | |
| 1252 if (cd1 && cd2 && cd2->isBaseOf(cd1, NULL)) | |
| 1253 result = 1; | |
| 1254 } | |
| 1255 } | |
| 1256 return result; | |
| 1257 } | |
| 1258 | |
| 1259 /**************************************************** | |
| 1260 * Overload this FuncDeclaration with the new one f. | |
| 1261 * Return !=0 if successful; i.e. no conflict. | |
| 1262 */ | |
| 1263 | |
| 1264 int FuncDeclaration::overloadInsert(Dsymbol *s) | |
| 1265 { | |
| 1266 FuncDeclaration *f; | |
| 1267 AliasDeclaration *a; | |
| 1268 | |
| 1269 //printf("FuncDeclaration::overloadInsert(%s)\n", s->toChars()); | |
| 1270 a = s->isAliasDeclaration(); | |
| 1271 if (a) | |
| 1272 { | |
| 1273 if (overnext) | |
| 1274 return overnext->overloadInsert(a); | |
| 1275 if (!a->aliassym && a->type->ty != Tident && a->type->ty != Tinstance) | |
| 1276 { | |
| 1277 //printf("\ta = '%s'\n", a->type->toChars()); | |
| 1278 return FALSE; | |
| 1279 } | |
| 1280 overnext = a; | |
| 1281 //printf("\ttrue: no conflict\n"); | |
| 1282 return TRUE; | |
| 1283 } | |
| 1284 f = s->isFuncDeclaration(); | |
| 1285 if (!f) | |
| 1286 return FALSE; | |
| 1287 | |
| 1288 if (type && f->type && // can be NULL for overloaded constructors | |
| 1289 f->type->covariant(type) && | |
| 1290 !isFuncAliasDeclaration()) | |
| 1291 { | |
| 1292 //printf("\tfalse: conflict %s\n", kind()); | |
| 1293 return FALSE; | |
| 1294 } | |
| 1295 | |
| 1296 if (overnext) | |
| 1297 return overnext->overloadInsert(f); | |
| 1298 overnext = f; | |
| 1299 //printf("\ttrue: no conflict\n"); | |
| 1300 return TRUE; | |
| 1301 } | |
| 1302 | |
| 1303 /******************************************** | |
| 1304 * Find function in overload list that exactly matches t. | |
| 1305 */ | |
| 1306 | |
| 1307 /*************************************************** | |
| 1308 * Visit each overloaded function in turn, and call | |
| 1309 * (*fp)(param, f) on it. | |
| 1310 * Exit when no more, or (*fp)(param, f) returns 1. | |
| 1311 * Returns: | |
| 1312 * 0 continue | |
| 1313 * 1 done | |
| 1314 */ | |
| 1315 | |
| 1316 int overloadApply(FuncDeclaration *fstart, | |
| 1317 int (*fp)(void *, FuncDeclaration *), | |
| 1318 void *param) | |
| 1319 { | |
| 1320 FuncDeclaration *f; | |
| 1321 Declaration *d; | |
| 1322 Declaration *next; | |
| 1323 | |
| 1324 for (d = fstart; d; d = next) | |
| 1325 { FuncAliasDeclaration *fa = d->isFuncAliasDeclaration(); | |
| 1326 | |
| 1327 if (fa) | |
| 1328 { | |
| 1329 if (overloadApply(fa->funcalias, fp, param)) | |
| 1330 return 1; | |
| 1331 next = fa->overnext; | |
| 1332 } | |
| 1333 else | |
| 1334 { | |
| 1335 AliasDeclaration *a = d->isAliasDeclaration(); | |
| 1336 | |
| 1337 if (a) | |
| 1338 { | |
| 1339 Dsymbol *s = a->toAlias(); | |
| 1340 next = s->isDeclaration(); | |
| 1341 if (next == a) | |
| 1342 break; | |
| 1343 if (next == fstart) | |
| 1344 break; | |
| 1345 } | |
| 1346 else | |
| 1347 { | |
| 1348 f = d->isFuncDeclaration(); | |
| 1349 if (!f) | |
| 1350 { d->error("is aliased to a function"); | |
| 1351 break; // BUG: should print error message? | |
| 1352 } | |
| 1353 if ((*fp)(param, f)) | |
| 1354 return 1; | |
| 1355 | |
| 1356 next = f->overnext; | |
| 1357 } | |
| 1358 } | |
| 1359 } | |
| 1360 return 0; | |
| 1361 } | |
| 1362 | |
| 1363 /******************************************** | |
| 1364 * Find function in overload list that exactly matches t. | |
| 1365 */ | |
| 1366 | |
| 1367 struct Param1 | |
| 1368 { | |
| 1369 Type *t; // type to match | |
| 1370 FuncDeclaration *f; // return value | |
| 1371 }; | |
| 1372 | |
| 1373 int fp1(void *param, FuncDeclaration *f) | |
| 1374 { Param1 *p = (Param1 *)param; | |
| 1375 Type *t = p->t; | |
| 1376 | |
| 1377 if (t->equals(f->type)) | |
| 1378 { p->f = f; | |
| 1379 return 1; | |
| 1380 } | |
| 1381 | |
| 1382 #if V2 | |
| 1383 /* Allow covariant matches, if it's just a const conversion | |
| 1384 * of the return type | |
| 1385 */ | |
| 1386 if (t->ty == Tfunction) | |
| 1387 { TypeFunction *tf = (TypeFunction *)f->type; | |
| 1388 if (tf->covariant(t) == 1 && | |
| 1389 tf->nextOf()->implicitConvTo(t->nextOf()) >= MATCHconst) | |
| 1390 { | |
| 1391 p->f = f; | |
| 1392 return 1; | |
| 1393 } | |
| 1394 } | |
| 1395 #endif | |
| 1396 return 0; | |
| 1397 } | |
| 1398 | |
| 1399 FuncDeclaration *FuncDeclaration::overloadExactMatch(Type *t) | |
| 1400 { | |
| 1401 Param1 p; | |
| 1402 p.t = t; | |
| 1403 p.f = NULL; | |
| 1404 overloadApply(this, &fp1, &p); | |
| 1405 return p.f; | |
| 1406 } | |
| 1407 | |
| 1408 #if 0 | |
| 1409 FuncDeclaration *FuncDeclaration::overloadExactMatch(Type *t) | |
| 1410 { | |
| 1411 FuncDeclaration *f; | |
| 1412 Declaration *d; | |
| 1413 Declaration *next; | |
| 1414 | |
| 1415 for (d = this; d; d = next) | |
| 1416 { FuncAliasDeclaration *fa = d->isFuncAliasDeclaration(); | |
| 1417 | |
| 1418 if (fa) | |
| 1419 { | |
| 1420 FuncDeclaration *f2 = fa->funcalias->overloadExactMatch(t); | |
| 1421 if (f2) | |
| 1422 return f2; | |
| 1423 next = fa->overnext; | |
| 1424 } | |
| 1425 else | |
| 1426 { | |
| 1427 AliasDeclaration *a = d->isAliasDeclaration(); | |
| 1428 | |
| 1429 if (a) | |
| 1430 { | |
| 1431 Dsymbol *s = a->toAlias(); | |
| 1432 next = s->isDeclaration(); | |
| 1433 if (next == a) | |
| 1434 break; | |
| 1435 } | |
| 1436 else | |
| 1437 { | |
| 1438 f = d->isFuncDeclaration(); | |
| 1439 if (!f) | |
| 1440 break; // BUG: should print error message? | |
| 1441 if (t->equals(d->type)) | |
| 1442 return f; | |
| 1443 next = f->overnext; | |
| 1444 } | |
| 1445 } | |
| 1446 } | |
| 1447 return NULL; | |
| 1448 } | |
| 1449 #endif | |
| 1450 | |
| 1451 /******************************************** | |
| 1452 * Decide which function matches the arguments best. | |
| 1453 */ | |
| 1454 | |
| 1455 struct Param2 | |
| 1456 { | |
| 1457 Match *m; | |
| 1458 Expressions *arguments; | |
| 1459 }; | |
| 1460 | |
| 1461 int fp2(void *param, FuncDeclaration *f) | |
| 1462 { Param2 *p = (Param2 *)param; | |
| 1463 Match *m = p->m; | |
| 1464 Expressions *arguments = p->arguments; | |
| 1465 MATCH match; | |
| 1466 | |
| 1467 if (f != m->lastf) // skip duplicates | |
| 1468 { | |
| 1469 TypeFunction *tf; | |
| 1470 | |
| 1471 m->anyf = f; | |
| 1472 tf = (TypeFunction *)f->type; | |
| 1473 match = (MATCH) tf->callMatch(arguments); | |
| 1474 //printf("match = %d\n", match); | |
| 1475 if (match != MATCHnomatch) | |
| 1476 { | |
| 1477 if (match > m->last) | |
| 1478 goto LfIsBetter; | |
| 1479 | |
| 1480 if (match < m->last) | |
| 1481 goto LlastIsBetter; | |
| 1482 | |
| 1483 /* See if one of the matches overrides the other. | |
| 1484 */ | |
| 1485 if (m->lastf->overrides(f)) | |
| 1486 goto LlastIsBetter; | |
| 1487 else if (f->overrides(m->lastf)) | |
| 1488 goto LfIsBetter; | |
| 1489 | |
| 1490 Lambiguous: | |
| 1491 m->nextf = f; | |
| 1492 m->count++; | |
| 1493 return 0; | |
| 1494 | |
| 1495 LfIsBetter: | |
| 1496 m->last = match; | |
| 1497 m->lastf = f; | |
| 1498 m->count = 1; | |
| 1499 return 0; | |
| 1500 | |
| 1501 LlastIsBetter: | |
| 1502 return 0; | |
| 1503 } | |
| 1504 } | |
| 1505 return 0; | |
| 1506 } | |
| 1507 | |
| 1508 | |
| 1509 void overloadResolveX(Match *m, FuncDeclaration *fstart, Expressions *arguments) | |
| 1510 { | |
| 1511 Param2 p; | |
| 1512 p.m = m; | |
| 1513 p.arguments = arguments; | |
| 1514 overloadApply(fstart, &fp2, &p); | |
| 1515 } | |
| 1516 | |
| 1517 #if 0 | |
| 1518 // Recursive helper function | |
| 1519 | |
| 1520 void overloadResolveX(Match *m, FuncDeclaration *fstart, Expressions *arguments) | |
| 1521 { | |
| 1522 MATCH match; | |
| 1523 Declaration *d; | |
| 1524 Declaration *next; | |
| 1525 | |
| 1526 for (d = fstart; d; d = next) | |
| 1527 { | |
| 1528 FuncDeclaration *f; | |
| 1529 FuncAliasDeclaration *fa; | |
| 1530 AliasDeclaration *a; | |
| 1531 | |
| 1532 fa = d->isFuncAliasDeclaration(); | |
| 1533 if (fa) | |
| 1534 { | |
| 1535 overloadResolveX(m, fa->funcalias, arguments); | |
| 1536 next = fa->overnext; | |
| 1537 } | |
| 1538 else if ((f = d->isFuncDeclaration()) != NULL) | |
| 1539 { | |
| 1540 next = f->overnext; | |
| 1541 if (f == m->lastf) | |
| 1542 continue; // skip duplicates | |
| 1543 else | |
| 1544 { | |
| 1545 TypeFunction *tf; | |
| 1546 | |
| 1547 m->anyf = f; | |
| 1548 tf = (TypeFunction *)f->type; | |
| 1549 match = (MATCH) tf->callMatch(arguments); | |
| 1550 //printf("match = %d\n", match); | |
| 1551 if (match != MATCHnomatch) | |
| 1552 { | |
| 1553 if (match > m->last) | |
| 1554 goto LfIsBetter; | |
| 1555 | |
| 1556 if (match < m->last) | |
| 1557 goto LlastIsBetter; | |
| 1558 | |
| 1559 /* See if one of the matches overrides the other. | |
| 1560 */ | |
| 1561 if (m->lastf->overrides(f)) | |
| 1562 goto LlastIsBetter; | |
| 1563 else if (f->overrides(m->lastf)) | |
| 1564 goto LfIsBetter; | |
| 1565 | |
| 1566 Lambiguous: | |
| 1567 m->nextf = f; | |
| 1568 m->count++; | |
| 1569 continue; | |
| 1570 | |
| 1571 LfIsBetter: | |
| 1572 m->last = match; | |
| 1573 m->lastf = f; | |
| 1574 m->count = 1; | |
| 1575 continue; | |
| 1576 | |
| 1577 LlastIsBetter: | |
| 1578 continue; | |
| 1579 } | |
| 1580 } | |
| 1581 } | |
| 1582 else if ((a = d->isAliasDeclaration()) != NULL) | |
| 1583 { | |
| 1584 Dsymbol *s = a->toAlias(); | |
| 1585 next = s->isDeclaration(); | |
| 1586 if (next == a) | |
| 1587 break; | |
| 1588 if (next == fstart) | |
| 1589 break; | |
| 1590 } | |
| 1591 else | |
| 1592 { d->error("is aliased to a function"); | |
| 1593 break; | |
| 1594 } | |
| 1595 } | |
| 1596 } | |
| 1597 #endif | |
| 1598 | |
| 1599 FuncDeclaration *FuncDeclaration::overloadResolve(Loc loc, Expressions *arguments) | |
| 1600 { | |
| 1601 TypeFunction *tf; | |
| 1602 Match m; | |
| 1603 | |
| 1604 #if 0 | |
| 1605 printf("FuncDeclaration::overloadResolve('%s')\n", toChars()); | |
| 1606 if (arguments) | |
| 1607 { int i; | |
| 1608 | |
| 1609 for (i = 0; i < arguments->dim; i++) | |
| 1610 { Expression *arg; | |
| 1611 | |
| 1612 arg = (Expression *)arguments->data[i]; | |
| 1613 assert(arg->type); | |
| 1614 printf("\t%s: ", arg->toChars()); | |
| 1615 arg->type->print(); | |
| 1616 } | |
| 1617 } | |
| 1618 #endif | |
| 1619 | |
| 1620 memset(&m, 0, sizeof(m)); | |
| 1621 m.last = MATCHnomatch; | |
| 1622 overloadResolveX(&m, this, arguments); | |
| 1623 | |
| 1624 if (m.count == 1) // exactly one match | |
| 1625 { | |
| 1626 return m.lastf; | |
| 1627 } | |
| 1628 else | |
| 1629 { | |
| 1630 OutBuffer buf; | |
| 1631 | |
| 1632 if (arguments) | |
| 1633 { | |
| 1634 HdrGenState hgs; | |
| 1635 | |
| 1636 argExpTypesToCBuffer(&buf, arguments, &hgs); | |
| 1637 } | |
| 1638 | |
| 1639 if (m.last == MATCHnomatch) | |
| 1640 { | |
| 1641 tf = (TypeFunction *)type; | |
| 1642 | |
| 1643 //printf("tf = %s, args = %s\n", tf->deco, ((Expression *)arguments->data[0])->type->deco); | |
| 1644 error(loc, "%s does not match parameter types (%s)", | |
| 1645 Argument::argsTypesToChars(tf->parameters, tf->varargs), | |
| 1646 buf.toChars()); | |
| 1647 return m.anyf; // as long as it's not a FuncAliasDeclaration | |
| 1648 } | |
| 1649 else | |
| 1650 { | |
| 1651 #if 1 | |
| 1652 TypeFunction *t1 = (TypeFunction *)m.lastf->type; | |
| 1653 TypeFunction *t2 = (TypeFunction *)m.nextf->type; | |
| 1654 | |
| 1655 error(loc, "called with argument types:\n\t(%s)\nmatches both:\n\t%s%s\nand:\n\t%s%s", | |
| 1656 buf.toChars(), | |
| 1657 m.lastf->toPrettyChars(), Argument::argsTypesToChars(t1->parameters, t1->varargs), | |
| 1658 m.nextf->toPrettyChars(), Argument::argsTypesToChars(t2->parameters, t2->varargs)); | |
| 1659 #else | |
| 1660 error(loc, "overloads %s and %s both match argument list for %s", | |
| 1661 m.lastf->type->toChars(), | |
| 1662 m.nextf->type->toChars(), | |
| 1663 m.lastf->toChars()); | |
| 1664 #endif | |
| 1665 return m.lastf; | |
| 1666 } | |
| 1667 } | |
| 1668 } | |
| 1669 | |
| 1670 /******************************** | |
| 1671 * Labels are in a separate scope, one per function. | |
| 1672 */ | |
| 1673 | |
| 1674 LabelDsymbol *FuncDeclaration::searchLabel(Identifier *ident) | |
| 1675 { Dsymbol *s; | |
| 1676 | |
| 1677 if (!labtab) | |
| 1678 labtab = new DsymbolTable(); // guess we need one | |
| 1679 | |
| 1680 s = labtab->lookup(ident); | |
| 1681 if (!s) | |
| 1682 { | |
| 1683 s = new LabelDsymbol(ident); | |
| 1684 labtab->insert(s); | |
| 1685 } | |
| 1686 return (LabelDsymbol *)s; | |
| 1687 } | |
| 1688 | |
| 1689 AggregateDeclaration *FuncDeclaration::isThis() | |
| 1690 { AggregateDeclaration *ad; | |
| 1691 | |
| 1692 //printf("+FuncDeclaration::isThis() '%s'\n", toChars()); | |
| 1693 ad = NULL; | |
| 1694 if ((storage_class & STCstatic) == 0) | |
| 1695 { | |
| 1696 ad = isMember2(); | |
| 1697 } | |
| 1698 //printf("-FuncDeclaration::isThis() %p\n", ad); | |
| 1699 return ad; | |
| 1700 } | |
| 1701 | |
| 1702 AggregateDeclaration *FuncDeclaration::isMember2() | |
| 1703 { AggregateDeclaration *ad; | |
| 1704 | |
| 1705 //printf("+FuncDeclaration::isMember2() '%s'\n", toChars()); | |
| 1706 ad = NULL; | |
| 1707 for (Dsymbol *s = this; s; s = s->parent) | |
| 1708 { | |
| 1709 //printf("\ts = '%s', parent = '%s', kind = %s\n", s->toChars(), s->parent->toChars(), s->parent->kind()); | |
| 1710 ad = s->isMember(); | |
| 1711 if (ad) | |
| 1712 { //printf("test4\n"); | |
| 1713 break; | |
| 1714 } | |
| 1715 if (!s->parent || | |
| 1716 (!s->parent->isTemplateInstance())) | |
| 1717 { //printf("test5\n"); | |
| 1718 break; | |
| 1719 } | |
| 1720 } | |
| 1721 //printf("-FuncDeclaration::isMember2() %p\n", ad); | |
| 1722 return ad; | |
| 1723 } | |
| 1724 | |
| 1725 /***************************************** | |
| 1726 * Determine lexical level difference from 'this' to nested function 'fd'. | |
| 1727 * Error if this cannot call fd. | |
| 1728 * Returns: | |
| 1729 * 0 same level | |
| 1730 * -1 increase nesting by 1 (fd is nested within 'this') | |
| 1731 * >0 decrease nesting by number | |
| 1732 */ | |
| 1733 | |
| 1734 int FuncDeclaration::getLevel(Loc loc, FuncDeclaration *fd) | |
| 1735 { int level; | |
| 1736 Dsymbol *s; | |
| 1737 Dsymbol *fdparent; | |
| 1738 | |
| 1739 //printf("FuncDeclaration::getLevel(fd = '%s')\n", fd->toChars()); | |
| 1740 fdparent = fd->toParent2(); | |
| 1741 if (fdparent == this) | |
| 1742 return -1; | |
| 1743 s = this; | |
| 1744 level = 0; | |
| 1745 while (fd != s && fdparent != s->toParent2()) | |
| 1746 { | |
| 1747 //printf("\ts = '%s'\n", s->toChars()); | |
| 1748 FuncDeclaration *thisfd = s->isFuncDeclaration(); | |
| 1749 if (thisfd) | |
| 1750 { if (!thisfd->isNested() && !thisfd->vthis) | |
| 1751 goto Lerr; | |
| 1752 } | |
| 1753 else | |
| 1754 { | |
| 1755 ClassDeclaration *thiscd = s->isClassDeclaration(); | |
| 1756 if (thiscd) | |
| 1757 { if (!thiscd->isNested()) | |
| 1758 goto Lerr; | |
| 1759 } | |
| 1760 else | |
| 1761 goto Lerr; | |
| 1762 } | |
| 1763 | |
| 1764 s = s->toParent2(); | |
| 1765 assert(s); | |
| 1766 level++; | |
| 1767 } | |
| 1768 return level; | |
| 1769 | |
| 1770 Lerr: | |
| 1771 error(loc, "cannot access frame of function %s", fd->toChars()); | |
| 1772 return 1; | |
| 1773 } | |
| 1774 | |
| 1775 void FuncDeclaration::appendExp(Expression *e) | |
| 1776 { Statement *s; | |
| 1777 | |
| 1778 s = new ExpStatement(0, e); | |
| 1779 appendState(s); | |
| 1780 } | |
| 1781 | |
| 1782 void FuncDeclaration::appendState(Statement *s) | |
| 1783 { CompoundStatement *cs; | |
| 1784 | |
| 1785 if (!fbody) | |
| 1786 { Statements *a; | |
| 1787 | |
| 1788 a = new Statements(); | |
| 1789 fbody = new CompoundStatement(0, a); | |
| 1790 } | |
| 1791 cs = fbody->isCompoundStatement(); | |
| 1792 cs->statements->push(s); | |
| 1793 } | |
| 1794 | |
| 1795 | |
| 1796 int FuncDeclaration::isMain() | |
| 1797 { | |
| 1798 return ident == Id::main && | |
| 1799 linkage != LINKc && !isMember() && !isNested(); | |
| 1800 } | |
| 1801 | |
| 1802 int FuncDeclaration::isWinMain() | |
| 1803 { | |
| 1804 return ident == Id::WinMain && | |
| 1805 linkage != LINKc && !isMember(); | |
| 1806 } | |
| 1807 | |
| 1808 int FuncDeclaration::isDllMain() | |
| 1809 { | |
| 1810 return ident == Id::DllMain && | |
| 1811 linkage != LINKc && !isMember(); | |
| 1812 } | |
| 1813 | |
| 1814 int FuncDeclaration::isExport() | |
| 1815 { | |
| 1816 return protection == PROTexport; | |
| 1817 } | |
| 1818 | |
| 1819 int FuncDeclaration::isImportedSymbol() | |
| 1820 { | |
| 1821 //printf("isImportedSymbol()\n"); | |
| 1822 //printf("protection = %d\n", protection); | |
| 1823 return (protection == PROTexport) && !fbody; | |
| 1824 } | |
| 1825 | |
| 1826 // Determine if function goes into virtual function pointer table | |
| 1827 | |
| 1828 int FuncDeclaration::isVirtual() | |
| 1829 { | |
| 1830 #if 0 | |
| 1831 printf("FuncDeclaration::isVirtual(%s)\n", toChars()); | |
| 1832 printf("%p %d %d %d %d\n", isMember(), isStatic(), protection == PROTprivate, isCtorDeclaration(), linkage != LINKd); | |
| 1833 printf("result is %d\n", | |
| 1834 isMember() && | |
| 1835 !(isStatic() || protection == PROTprivate || protection == PROTpackage) && | |
| 1836 toParent()->isClassDeclaration()); | |
| 1837 #endif | |
| 1838 return isMember() && | |
| 1839 !(isStatic() || protection == PROTprivate || protection == PROTpackage) && | |
| 1840 toParent()->isClassDeclaration(); | |
| 1841 } | |
| 1842 | |
| 1843 int FuncDeclaration::isAbstract() | |
| 1844 { | |
| 1845 return storage_class & STCabstract; | |
| 1846 } | |
| 1847 | |
| 1848 int FuncDeclaration::isCodeseg() | |
| 1849 { | |
| 1850 return TRUE; // functions are always in the code segment | |
| 1851 } | |
| 1852 | |
| 1853 // Determine if function needs | |
| 1854 // a static frame pointer to its lexically enclosing function | |
| 1855 | |
| 1856 int FuncDeclaration::isNested() | |
| 1857 { | |
| 1858 //if (!toParent()) | |
| 1859 //printf("FuncDeclaration::isNested('%s') parent=%p\n", toChars(), parent); | |
| 1860 //printf("\ttoParent() = '%s'\n", toParent()->toChars()); | |
| 1861 return ((storage_class & STCstatic) == 0) && | |
| 1862 (toParent2()->isFuncDeclaration() != NULL); | |
| 1863 } | |
| 1864 | |
| 1865 int FuncDeclaration::needThis() | |
| 1866 { | |
| 1867 //printf("FuncDeclaration::needThis() '%s'\n", toChars()); | |
| 1868 int i = isThis() != NULL; | |
| 1869 //printf("\t%d\n", i); | |
| 1870 if (!i && isFuncAliasDeclaration()) | |
| 1871 i = ((FuncAliasDeclaration *)this)->funcalias->needThis(); | |
| 1872 return i; | |
| 1873 } | |
| 1874 | |
| 1875 int FuncDeclaration::addPreInvariant() | |
| 1876 { | |
| 1877 AggregateDeclaration *ad = isThis(); | |
| 1878 return (ad && | |
| 1879 //ad->isClassDeclaration() && | |
| 1880 global.params.useInvariants && | |
| 1881 (protection == PROTpublic || protection == PROTexport) && | |
| 1882 !naked); | |
| 1883 } | |
| 1884 | |
| 1885 int FuncDeclaration::addPostInvariant() | |
| 1886 { | |
| 1887 AggregateDeclaration *ad = isThis(); | |
| 1888 return (ad && | |
| 1889 ad->inv && | |
| 1890 //ad->isClassDeclaration() && | |
| 1891 global.params.useInvariants && | |
| 1892 (protection == PROTpublic || protection == PROTexport) && | |
| 1893 !naked); | |
| 1894 } | |
| 1895 | |
| 1896 /********************************** | |
| 1897 * Generate a FuncDeclaration for a runtime library function. | |
| 1898 */ | |
| 1899 | |
| 1900 FuncDeclaration *FuncDeclaration::genCfunc(Type *treturn, char *name) | |
| 1901 { | |
| 1902 return genCfunc(treturn, Lexer::idPool(name)); | |
| 1903 } | |
| 1904 | |
| 1905 FuncDeclaration *FuncDeclaration::genCfunc(Type *treturn, Identifier *id) | |
| 1906 { | |
| 1907 FuncDeclaration *fd; | |
| 1908 TypeFunction *tf; | |
| 1909 Dsymbol *s; | |
| 1910 static DsymbolTable *st = NULL; | |
| 1911 | |
| 1912 //printf("genCfunc(name = '%s')\n", id->toChars()); | |
| 1913 //printf("treturn\n\t"); treturn->print(); | |
| 1914 | |
| 1915 // See if already in table | |
| 1916 if (!st) | |
| 1917 st = new DsymbolTable(); | |
| 1918 s = st->lookup(id); | |
| 1919 if (s) | |
| 1920 { | |
| 1921 fd = s->isFuncDeclaration(); | |
| 1922 assert(fd); | |
| 1923 assert(fd->type->nextOf()->equals(treturn)); | |
| 1924 } | |
| 1925 else | |
| 1926 { | |
| 1927 tf = new TypeFunction(NULL, treturn, 0, LINKc); | |
| 1928 fd = new FuncDeclaration(0, 0, id, STCstatic, tf); | |
| 1929 fd->protection = PROTpublic; | |
| 1930 fd->linkage = LINKc; | |
| 1931 | |
| 1932 st->insert(fd); | |
| 1933 } | |
| 1934 return fd; | |
| 1935 } | |
| 1936 | |
| 1937 char *FuncDeclaration::kind() | |
| 1938 { | |
| 1939 return "function"; | |
| 1940 } | |
| 1941 | |
| 1942 /****************************** FuncAliasDeclaration ************************/ | |
| 1943 | |
| 1944 // Used as a way to import a set of functions from another scope into this one. | |
| 1945 | |
| 1946 FuncAliasDeclaration::FuncAliasDeclaration(FuncDeclaration *funcalias) | |
| 1947 : FuncDeclaration(funcalias->loc, funcalias->endloc, funcalias->ident, | |
| 1948 (enum STC)funcalias->storage_class, funcalias->type) | |
| 1949 { | |
| 1950 assert(funcalias != this); | |
| 1951 this->funcalias = funcalias; | |
| 1952 } | |
| 1953 | |
| 1954 char *FuncAliasDeclaration::kind() | |
| 1955 { | |
| 1956 return "function alias"; | |
| 1957 } | |
| 1958 | |
| 1959 | |
| 1960 /****************************** FuncLiteralDeclaration ************************/ | |
| 1961 | |
| 1962 FuncLiteralDeclaration::FuncLiteralDeclaration(Loc loc, Loc endloc, Type *type, | |
| 1963 enum TOK tok, ForeachStatement *fes) | |
| 1964 : FuncDeclaration(loc, endloc, NULL, STCundefined, type) | |
| 1965 { | |
| 1966 char *id; | |
| 1967 | |
| 1968 if (fes) | |
| 1969 id = "__foreachbody"; | |
| 1970 else if (tok == TOKdelegate) | |
| 1971 id = "__dgliteral"; | |
| 1972 else | |
| 1973 id = "__funcliteral"; | |
| 1974 this->ident = Identifier::generateId(id); | |
| 1975 this->tok = tok; | |
| 1976 this->fes = fes; | |
| 1977 //printf("FuncLiteralDeclaration() id = '%s', type = '%s'\n", this->ident->toChars(), type->toChars()); | |
| 1978 } | |
| 1979 | |
| 1980 Dsymbol *FuncLiteralDeclaration::syntaxCopy(Dsymbol *s) | |
| 1981 { | |
| 1982 FuncLiteralDeclaration *f; | |
| 1983 | |
| 1984 //printf("FuncLiteralDeclaration::syntaxCopy('%s')\n", toChars()); | |
| 1985 if (s) | |
| 1986 f = (FuncLiteralDeclaration *)s; | |
| 1987 else | |
| 1988 f = new FuncLiteralDeclaration(loc, endloc, type->syntaxCopy(), tok, fes); | |
| 1989 FuncDeclaration::syntaxCopy(f); | |
| 1990 return f; | |
| 1991 } | |
| 1992 | |
| 1993 int FuncLiteralDeclaration::isNested() | |
| 1994 { | |
| 1995 //printf("FuncLiteralDeclaration::isNested() '%s'\n", toChars()); | |
| 1996 return (tok == TOKdelegate); | |
| 1997 } | |
| 1998 | |
| 1999 char *FuncLiteralDeclaration::kind() | |
| 2000 { | |
| 2001 // GCC requires the (char*) casts | |
| 2002 return (tok == TOKdelegate) ? (char*)"delegate" : (char*)"function"; | |
| 2003 } | |
| 2004 | |
| 2005 void FuncLiteralDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2006 { | |
| 2007 static Identifier *idfunc; | |
| 2008 static Identifier *iddel; | |
| 2009 | |
| 2010 if (!idfunc) | |
| 2011 idfunc = new Identifier("function", 0); | |
| 2012 if (!iddel) | |
| 2013 iddel = new Identifier("delegate", 0); | |
| 2014 | |
| 2015 type->toCBuffer(buf, ((tok == TOKdelegate) ? iddel : idfunc), hgs); | |
| 2016 bodyToCBuffer(buf, hgs); | |
| 2017 } | |
| 2018 | |
| 2019 | |
| 2020 /********************************* CtorDeclaration ****************************/ | |
| 2021 | |
| 2022 CtorDeclaration::CtorDeclaration(Loc loc, Loc endloc, Arguments *arguments, int varargs) | |
| 2023 : FuncDeclaration(loc, endloc, Id::ctor, STCundefined, NULL) | |
| 2024 { | |
| 2025 this->arguments = arguments; | |
| 2026 this->varargs = varargs; | |
| 2027 //printf("CtorDeclaration() %s\n", toChars()); | |
| 2028 } | |
| 2029 | |
| 2030 Dsymbol *CtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2031 { | |
| 2032 CtorDeclaration *f; | |
| 2033 | |
| 2034 f = new CtorDeclaration(loc, endloc, NULL, varargs); | |
| 2035 | |
| 2036 f->outId = outId; | |
| 2037 f->frequire = frequire ? frequire->syntaxCopy() : NULL; | |
| 2038 f->fensure = fensure ? fensure->syntaxCopy() : NULL; | |
| 2039 f->fbody = fbody ? fbody->syntaxCopy() : NULL; | |
| 2040 assert(!fthrows); // deprecated | |
| 2041 | |
| 2042 f->arguments = Argument::arraySyntaxCopy(arguments); | |
| 2043 return f; | |
| 2044 } | |
| 2045 | |
| 2046 | |
| 2047 void CtorDeclaration::semantic(Scope *sc) | |
| 2048 { | |
| 2049 ClassDeclaration *cd; | |
| 2050 Type *tret; | |
| 2051 | |
| 2052 //printf("CtorDeclaration::semantic()\n"); | |
| 2053 | |
| 2054 sc = sc->push(); | |
| 2055 sc->stc &= ~STCstatic; // not a static constructor | |
| 2056 | |
| 2057 parent = sc->parent; | |
| 2058 Dsymbol *parent = toParent(); | |
| 2059 cd = parent->isClassDeclaration(); | |
| 2060 if (!cd) | |
| 2061 { | |
| 2062 error("constructors only are for class definitions"); | |
| 2063 tret = Type::tvoid; | |
| 2064 } | |
| 2065 else | |
| 2066 tret = cd->type; //->referenceTo(); | |
| 2067 type = new TypeFunction(arguments, tret, varargs, LINKd); | |
| 2068 | |
| 2069 sc->flags |= SCOPEctor; | |
| 2070 type = type->semantic(loc, sc); | |
| 2071 sc->flags &= ~SCOPEctor; | |
| 2072 | |
| 2073 // Append: | |
| 2074 // return this; | |
| 2075 // to the function body | |
| 2076 if (fbody) | |
| 2077 { Expression *e; | |
| 2078 Statement *s; | |
| 2079 | |
| 2080 e = new ThisExp(0); | |
| 2081 s = new ReturnStatement(0, e); | |
| 2082 fbody = new CompoundStatement(0, fbody, s); | |
| 2083 } | |
| 2084 | |
| 2085 FuncDeclaration::semantic(sc); | |
| 2086 | |
| 2087 sc->pop(); | |
| 2088 | |
| 2089 // See if it's the default constructor | |
| 2090 if (cd && varargs == 0 && Argument::dim(arguments) == 0) | |
| 2091 cd->defaultCtor = this; | |
| 2092 } | |
| 2093 | |
| 2094 char *CtorDeclaration::kind() | |
| 2095 { | |
| 2096 return "constructor"; | |
| 2097 } | |
| 2098 | |
| 2099 char *CtorDeclaration::toChars() | |
| 2100 { | |
| 2101 return "this"; | |
| 2102 } | |
| 2103 | |
| 2104 int CtorDeclaration::isVirtual() | |
| 2105 { | |
| 2106 return FALSE; | |
| 2107 } | |
| 2108 | |
| 2109 int CtorDeclaration::addPreInvariant() | |
| 2110 { | |
| 2111 return FALSE; | |
| 2112 } | |
| 2113 | |
| 2114 int CtorDeclaration::addPostInvariant() | |
| 2115 { | |
| 2116 return (vthis && global.params.useInvariants); | |
| 2117 } | |
| 2118 | |
| 2119 | |
| 2120 void CtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2121 { | |
| 2122 buf->writestring("this"); | |
| 2123 Argument::argsToCBuffer(buf, hgs, arguments, varargs); | |
| 2124 bodyToCBuffer(buf, hgs); | |
| 2125 } | |
| 2126 | |
| 2127 /********************************* DtorDeclaration ****************************/ | |
| 2128 | |
| 2129 DtorDeclaration::DtorDeclaration(Loc loc, Loc endloc) | |
| 2130 : FuncDeclaration(loc, endloc, Id::dtor, STCundefined, NULL) | |
| 2131 { | |
| 2132 } | |
| 2133 | |
| 2134 Dsymbol *DtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2135 { | |
| 2136 DtorDeclaration *dd; | |
| 2137 | |
| 2138 assert(!s); | |
| 2139 dd = new DtorDeclaration(loc, endloc); | |
| 2140 return FuncDeclaration::syntaxCopy(dd); | |
| 2141 } | |
| 2142 | |
| 2143 | |
| 2144 void DtorDeclaration::semantic(Scope *sc) | |
| 2145 { | |
| 2146 ClassDeclaration *cd; | |
| 2147 | |
| 2148 parent = sc->parent; | |
| 2149 Dsymbol *parent = toParent(); | |
| 2150 cd = parent->isClassDeclaration(); | |
| 2151 if (!cd) | |
| 2152 { | |
| 2153 error("destructors only are for class definitions"); | |
| 2154 } | |
| 2155 else | |
| 2156 cd->dtors.push(this); | |
| 2157 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2158 | |
| 2159 sc = sc->push(); | |
| 2160 sc->stc &= ~STCstatic; // not a static destructor | |
| 2161 sc->linkage = LINKd; | |
| 2162 | |
| 2163 FuncDeclaration::semantic(sc); | |
| 2164 | |
| 2165 sc->pop(); | |
| 2166 } | |
| 2167 | |
| 2168 int DtorDeclaration::overloadInsert(Dsymbol *s) | |
| 2169 { | |
| 2170 return FALSE; // cannot overload destructors | |
| 2171 } | |
| 2172 | |
| 2173 int DtorDeclaration::addPreInvariant() | |
| 2174 { | |
| 2175 return (vthis && global.params.useInvariants); | |
| 2176 } | |
| 2177 | |
| 2178 int DtorDeclaration::addPostInvariant() | |
| 2179 { | |
| 2180 return FALSE; | |
| 2181 } | |
| 2182 | |
| 2183 int DtorDeclaration::isVirtual() | |
| 2184 { | |
| 2185 /* This should be FALSE so that dtor's don't get put into the vtbl[], | |
| 2186 * but doing so will require recompiling everything. | |
| 2187 */ | |
| 2188 #if BREAKABI | |
| 2189 return FALSE; | |
| 2190 #else | |
| 2191 return FuncDeclaration::isVirtual(); | |
| 2192 #endif | |
| 2193 } | |
| 2194 | |
| 2195 void DtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2196 { | |
| 2197 if (hgs->hdrgen) | |
| 2198 return; | |
| 2199 buf->writestring("~this()"); | |
| 2200 bodyToCBuffer(buf, hgs); | |
| 2201 } | |
| 2202 | |
| 2203 /********************************* StaticCtorDeclaration ****************************/ | |
| 2204 | |
| 2205 StaticCtorDeclaration::StaticCtorDeclaration(Loc loc, Loc endloc) | |
| 19 | 2206 : FuncDeclaration(loc, endloc, |
| 2207 Identifier::generateId("_staticCtor"), STCstatic, NULL) | |
| 1 | 2208 { |
| 2209 } | |
| 2210 | |
| 2211 Dsymbol *StaticCtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2212 { | |
| 2213 StaticCtorDeclaration *scd; | |
| 2214 | |
| 2215 assert(!s); | |
| 2216 scd = new StaticCtorDeclaration(loc, endloc); | |
| 2217 return FuncDeclaration::syntaxCopy(scd); | |
| 2218 } | |
| 2219 | |
| 2220 | |
| 2221 void StaticCtorDeclaration::semantic(Scope *sc) | |
| 2222 { | |
| 2223 //printf("StaticCtorDeclaration::semantic()\n"); | |
| 2224 | |
| 2225 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2226 | |
| 2227 FuncDeclaration::semantic(sc); | |
| 2228 | |
| 2229 // We're going to need ModuleInfo | |
| 2230 Module *m = getModule(); | |
| 2231 if (!m) | |
| 2232 m = sc->module; | |
| 2233 if (m) | |
| 2234 { m->needmoduleinfo = 1; | |
| 2235 #ifdef IN_GCC | |
| 2236 m->strictlyneedmoduleinfo = 1; | |
| 2237 #endif | |
| 2238 } | |
| 2239 } | |
| 2240 | |
| 2241 AggregateDeclaration *StaticCtorDeclaration::isThis() | |
| 2242 { | |
| 2243 return NULL; | |
| 2244 } | |
| 2245 | |
| 2246 int StaticCtorDeclaration::isStaticConstructor() | |
| 2247 { | |
| 2248 return TRUE; | |
| 2249 } | |
| 2250 | |
| 2251 int StaticCtorDeclaration::isVirtual() | |
| 2252 { | |
| 2253 return FALSE; | |
| 2254 } | |
| 2255 | |
| 2256 int StaticCtorDeclaration::addPreInvariant() | |
| 2257 { | |
| 2258 return FALSE; | |
| 2259 } | |
| 2260 | |
| 2261 int StaticCtorDeclaration::addPostInvariant() | |
| 2262 { | |
| 2263 return FALSE; | |
| 2264 } | |
| 2265 | |
| 2266 void StaticCtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2267 { | |
| 2268 if (hgs->hdrgen) | |
|
35
3cfcb944304e
[svn r39] * Updated to DMD 1.022 with the exception of:
lindquist
parents:
19
diff
changeset
|
2269 { buf->writestring("static this();\n"); |
| 1 | 2270 return; |
| 2271 } | |
| 2272 buf->writestring("static this()"); | |
| 2273 bodyToCBuffer(buf, hgs); | |
| 2274 } | |
| 2275 | |
| 2276 /********************************* StaticDtorDeclaration ****************************/ | |
| 2277 | |
| 2278 StaticDtorDeclaration::StaticDtorDeclaration(Loc loc, Loc endloc) | |
| 19 | 2279 : FuncDeclaration(loc, endloc, |
| 2280 Identifier::generateId("_staticDtor"), STCstatic, NULL) | |
| 1 | 2281 { |
| 2282 } | |
| 2283 | |
| 2284 Dsymbol *StaticDtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2285 { | |
| 2286 StaticDtorDeclaration *sdd; | |
| 2287 | |
| 2288 assert(!s); | |
| 2289 sdd = new StaticDtorDeclaration(loc, endloc); | |
| 2290 return FuncDeclaration::syntaxCopy(sdd); | |
| 2291 } | |
| 2292 | |
| 2293 | |
| 2294 void StaticDtorDeclaration::semantic(Scope *sc) | |
| 2295 { | |
| 2296 ClassDeclaration *cd; | |
| 2297 Type *tret; | |
| 2298 | |
| 2299 cd = sc->scopesym->isClassDeclaration(); | |
| 2300 if (!cd) | |
| 2301 { | |
| 2302 } | |
| 2303 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2304 | |
| 2305 FuncDeclaration::semantic(sc); | |
| 2306 | |
| 2307 // We're going to need ModuleInfo | |
| 2308 Module *m = getModule(); | |
| 2309 if (!m) | |
| 2310 m = sc->module; | |
| 2311 if (m) | |
| 2312 { m->needmoduleinfo = 1; | |
| 2313 #ifdef IN_GCC | |
| 2314 m->strictlyneedmoduleinfo = 1; | |
| 2315 #endif | |
| 2316 } | |
| 2317 } | |
| 2318 | |
| 2319 AggregateDeclaration *StaticDtorDeclaration::isThis() | |
| 2320 { | |
| 2321 return NULL; | |
| 2322 } | |
| 2323 | |
| 2324 int StaticDtorDeclaration::isStaticDestructor() | |
| 2325 { | |
| 2326 return TRUE; | |
| 2327 } | |
| 2328 | |
| 2329 int StaticDtorDeclaration::isVirtual() | |
| 2330 { | |
| 2331 return FALSE; | |
| 2332 } | |
| 2333 | |
| 2334 int StaticDtorDeclaration::addPreInvariant() | |
| 2335 { | |
| 2336 return FALSE; | |
| 2337 } | |
| 2338 | |
| 2339 int StaticDtorDeclaration::addPostInvariant() | |
| 2340 { | |
| 2341 return FALSE; | |
| 2342 } | |
| 2343 | |
| 2344 void StaticDtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2345 { | |
| 2346 if (hgs->hdrgen) | |
| 2347 return; | |
| 2348 buf->writestring("static ~this()"); | |
| 2349 bodyToCBuffer(buf, hgs); | |
| 2350 } | |
| 2351 | |
| 2352 /********************************* InvariantDeclaration ****************************/ | |
| 2353 | |
| 2354 InvariantDeclaration::InvariantDeclaration(Loc loc, Loc endloc) | |
| 2355 : FuncDeclaration(loc, endloc, Id::classInvariant, STCundefined, NULL) | |
| 2356 { | |
| 2357 } | |
| 2358 | |
| 2359 Dsymbol *InvariantDeclaration::syntaxCopy(Dsymbol *s) | |
| 2360 { | |
| 2361 InvariantDeclaration *id; | |
| 2362 | |
| 2363 assert(!s); | |
| 2364 id = new InvariantDeclaration(loc, endloc); | |
| 2365 FuncDeclaration::syntaxCopy(id); | |
| 2366 return id; | |
| 2367 } | |
| 2368 | |
| 2369 | |
| 2370 void InvariantDeclaration::semantic(Scope *sc) | |
| 2371 { | |
| 2372 AggregateDeclaration *ad; | |
| 2373 Type *tret; | |
| 2374 | |
| 2375 parent = sc->parent; | |
| 2376 Dsymbol *parent = toParent(); | |
| 2377 ad = parent->isAggregateDeclaration(); | |
| 2378 if (!ad) | |
| 2379 { | |
| 2380 error("invariants only are for struct/union/class definitions"); | |
| 2381 return; | |
| 2382 } | |
| 2383 else if (ad->inv && ad->inv != this) | |
| 2384 { | |
| 2385 error("more than one invariant for %s", ad->toChars()); | |
| 2386 } | |
| 2387 ad->inv = this; | |
| 2388 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2389 | |
| 2390 sc = sc->push(); | |
| 2391 sc->stc &= ~STCstatic; // not a static invariant | |
| 2392 sc->incontract++; | |
| 2393 sc->linkage = LINKd; | |
| 2394 | |
| 2395 FuncDeclaration::semantic(sc); | |
| 2396 | |
| 2397 sc->pop(); | |
| 2398 } | |
| 2399 | |
| 2400 int InvariantDeclaration::isVirtual() | |
| 2401 { | |
| 2402 return FALSE; | |
| 2403 } | |
| 2404 | |
| 2405 int InvariantDeclaration::addPreInvariant() | |
| 2406 { | |
| 2407 return FALSE; | |
| 2408 } | |
| 2409 | |
| 2410 int InvariantDeclaration::addPostInvariant() | |
| 2411 { | |
| 2412 return FALSE; | |
| 2413 } | |
| 2414 | |
| 2415 void InvariantDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2416 { | |
| 2417 if (hgs->hdrgen) | |
| 2418 return; | |
| 2419 buf->writestring("invariant"); | |
| 2420 bodyToCBuffer(buf, hgs); | |
| 2421 } | |
| 2422 | |
| 2423 | |
| 2424 /********************************* UnitTestDeclaration ****************************/ | |
| 2425 | |
| 2426 /******************************* | |
| 2427 * Generate unique unittest function Id so we can have multiple | |
| 2428 * instances per module. | |
| 2429 */ | |
| 2430 | |
| 2431 static Identifier *unitTestId() | |
| 2432 { | |
| 2433 static int n; | |
| 2434 char buffer[10 + sizeof(n)*3 + 1]; | |
| 2435 | |
| 2436 sprintf(buffer,"__unittest%d", n); | |
| 2437 n++; | |
| 2438 return Lexer::idPool(buffer); | |
| 2439 } | |
| 2440 | |
| 2441 UnitTestDeclaration::UnitTestDeclaration(Loc loc, Loc endloc) | |
| 2442 : FuncDeclaration(loc, endloc, unitTestId(), STCundefined, NULL) | |
| 2443 { | |
| 2444 } | |
| 2445 | |
| 2446 Dsymbol *UnitTestDeclaration::syntaxCopy(Dsymbol *s) | |
| 2447 { | |
| 2448 UnitTestDeclaration *utd; | |
| 2449 | |
| 2450 assert(!s); | |
| 2451 utd = new UnitTestDeclaration(loc, endloc); | |
| 2452 return FuncDeclaration::syntaxCopy(utd); | |
| 2453 } | |
| 2454 | |
| 2455 | |
| 2456 void UnitTestDeclaration::semantic(Scope *sc) | |
| 2457 { | |
| 2458 if (global.params.useUnitTests) | |
| 2459 { | |
| 2460 Type *tret; | |
| 2461 | |
| 2462 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2463 FuncDeclaration::semantic(sc); | |
| 2464 } | |
| 2465 | |
| 2466 // We're going to need ModuleInfo even if the unit tests are not | |
| 2467 // compiled in, because other modules may import this module and refer | |
| 2468 // to this ModuleInfo. | |
| 2469 Module *m = getModule(); | |
| 2470 if (!m) | |
| 2471 m = sc->module; | |
| 2472 if (m) | |
| 2473 m->needmoduleinfo = 1; | |
| 2474 } | |
| 2475 | |
| 2476 AggregateDeclaration *UnitTestDeclaration::isThis() | |
| 2477 { | |
| 2478 return NULL; | |
| 2479 } | |
| 2480 | |
| 2481 int UnitTestDeclaration::isVirtual() | |
| 2482 { | |
| 2483 return FALSE; | |
| 2484 } | |
| 2485 | |
| 2486 int UnitTestDeclaration::addPreInvariant() | |
| 2487 { | |
| 2488 return FALSE; | |
| 2489 } | |
| 2490 | |
| 2491 int UnitTestDeclaration::addPostInvariant() | |
| 2492 { | |
| 2493 return FALSE; | |
| 2494 } | |
| 2495 | |
| 2496 void UnitTestDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2497 { | |
| 2498 if (hgs->hdrgen) | |
| 2499 return; | |
| 2500 buf->writestring("unittest"); | |
| 2501 bodyToCBuffer(buf, hgs); | |
| 2502 } | |
| 2503 | |
| 2504 /********************************* NewDeclaration ****************************/ | |
| 2505 | |
| 2506 NewDeclaration::NewDeclaration(Loc loc, Loc endloc, Arguments *arguments, int varargs) | |
| 2507 : FuncDeclaration(loc, endloc, Id::classNew, STCstatic, NULL) | |
| 2508 { | |
| 2509 this->arguments = arguments; | |
| 2510 this->varargs = varargs; | |
| 2511 } | |
| 2512 | |
| 2513 Dsymbol *NewDeclaration::syntaxCopy(Dsymbol *s) | |
| 2514 { | |
| 2515 NewDeclaration *f; | |
| 2516 | |
| 2517 f = new NewDeclaration(loc, endloc, NULL, varargs); | |
| 2518 | |
| 2519 FuncDeclaration::syntaxCopy(f); | |
| 2520 | |
| 2521 f->arguments = Argument::arraySyntaxCopy(arguments); | |
| 2522 | |
| 2523 return f; | |
| 2524 } | |
| 2525 | |
| 2526 | |
| 2527 void NewDeclaration::semantic(Scope *sc) | |
| 2528 { | |
| 2529 ClassDeclaration *cd; | |
| 2530 Type *tret; | |
| 2531 | |
| 2532 //printf("NewDeclaration::semantic()\n"); | |
| 2533 | |
| 2534 parent = sc->parent; | |
| 2535 Dsymbol *parent = toParent(); | |
| 2536 cd = parent->isClassDeclaration(); | |
| 2537 if (!cd && !parent->isStructDeclaration()) | |
| 2538 { | |
| 2539 error("new allocators only are for class or struct definitions"); | |
| 2540 } | |
| 2541 tret = Type::tvoid->pointerTo(); | |
| 2542 type = new TypeFunction(arguments, tret, varargs, LINKd); | |
| 2543 | |
| 2544 type = type->semantic(loc, sc); | |
| 2545 assert(type->ty == Tfunction); | |
| 2546 | |
| 2547 // Check that there is at least one argument of type uint | |
| 2548 TypeFunction *tf = (TypeFunction *)type; | |
| 2549 if (Argument::dim(tf->parameters) < 1) | |
| 2550 { | |
| 2551 error("at least one argument of type uint expected"); | |
| 2552 } | |
| 2553 else | |
| 2554 { | |
| 2555 Argument *a = Argument::getNth(tf->parameters, 0); | |
| 2556 if (!a->type->equals(Type::tuns32)) | |
| 2557 error("first argument must be type uint, not %s", a->type->toChars()); | |
| 2558 } | |
| 2559 | |
| 2560 FuncDeclaration::semantic(sc); | |
| 2561 } | |
| 2562 | |
| 2563 char *NewDeclaration::kind() | |
| 2564 { | |
| 2565 return "allocator"; | |
| 2566 } | |
| 2567 | |
| 2568 int NewDeclaration::isVirtual() | |
| 2569 { | |
| 2570 return FALSE; | |
| 2571 } | |
| 2572 | |
| 2573 int NewDeclaration::addPreInvariant() | |
| 2574 { | |
| 2575 return FALSE; | |
| 2576 } | |
| 2577 | |
| 2578 int NewDeclaration::addPostInvariant() | |
| 2579 { | |
| 2580 return FALSE; | |
| 2581 } | |
| 2582 | |
| 2583 void NewDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2584 { | |
| 2585 buf->writestring("new"); | |
| 2586 Argument::argsToCBuffer(buf, hgs, arguments, varargs); | |
| 2587 bodyToCBuffer(buf, hgs); | |
| 2588 } | |
| 2589 | |
| 2590 | |
| 2591 /********************************* DeleteDeclaration ****************************/ | |
| 2592 | |
| 2593 DeleteDeclaration::DeleteDeclaration(Loc loc, Loc endloc, Arguments *arguments) | |
| 2594 : FuncDeclaration(loc, endloc, Id::classDelete, STCstatic, NULL) | |
| 2595 { | |
| 2596 this->arguments = arguments; | |
| 2597 } | |
| 2598 | |
| 2599 Dsymbol *DeleteDeclaration::syntaxCopy(Dsymbol *s) | |
| 2600 { | |
| 2601 DeleteDeclaration *f; | |
| 2602 | |
| 2603 f = new DeleteDeclaration(loc, endloc, NULL); | |
| 2604 | |
| 2605 FuncDeclaration::syntaxCopy(f); | |
| 2606 | |
| 2607 f->arguments = Argument::arraySyntaxCopy(arguments); | |
| 2608 | |
| 2609 return f; | |
| 2610 } | |
| 2611 | |
| 2612 | |
| 2613 void DeleteDeclaration::semantic(Scope *sc) | |
| 2614 { | |
| 2615 ClassDeclaration *cd; | |
| 2616 | |
| 2617 //printf("DeleteDeclaration::semantic()\n"); | |
| 2618 | |
| 2619 parent = sc->parent; | |
| 2620 Dsymbol *parent = toParent(); | |
| 2621 cd = parent->isClassDeclaration(); | |
| 2622 if (!cd && !parent->isStructDeclaration()) | |
| 2623 { | |
| 2624 error("new allocators only are for class or struct definitions"); | |
| 2625 } | |
| 2626 type = new TypeFunction(arguments, Type::tvoid, 0, LINKd); | |
| 2627 | |
| 2628 type = type->semantic(loc, sc); | |
| 2629 assert(type->ty == Tfunction); | |
| 2630 | |
| 2631 // Check that there is only one argument of type void* | |
| 2632 TypeFunction *tf = (TypeFunction *)type; | |
| 2633 if (Argument::dim(tf->parameters) != 1) | |
| 2634 { | |
| 2635 error("one argument of type void* expected"); | |
| 2636 } | |
| 2637 else | |
| 2638 { | |
| 2639 Argument *a = Argument::getNth(tf->parameters, 0); | |
| 2640 if (!a->type->equals(Type::tvoid->pointerTo())) | |
| 2641 error("one argument of type void* expected, not %s", a->type->toChars()); | |
| 2642 } | |
| 2643 | |
| 2644 FuncDeclaration::semantic(sc); | |
| 2645 } | |
| 2646 | |
| 2647 char *DeleteDeclaration::kind() | |
| 2648 { | |
| 2649 return "deallocator"; | |
| 2650 } | |
| 2651 | |
| 2652 int DeleteDeclaration::isDelete() | |
| 2653 { | |
| 2654 return TRUE; | |
| 2655 } | |
| 2656 | |
| 2657 int DeleteDeclaration::isVirtual() | |
| 2658 { | |
| 2659 return FALSE; | |
| 2660 } | |
| 2661 | |
| 2662 int DeleteDeclaration::addPreInvariant() | |
| 2663 { | |
| 2664 return FALSE; | |
| 2665 } | |
| 2666 | |
| 2667 int DeleteDeclaration::addPostInvariant() | |
| 2668 { | |
| 2669 return FALSE; | |
| 2670 } | |
| 2671 | |
| 2672 void DeleteDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2673 { | |
| 2674 buf->writestring("delete"); | |
| 2675 Argument::argsToCBuffer(buf, hgs, arguments, 0); | |
| 2676 bodyToCBuffer(buf, hgs); | |
| 2677 } | |
| 2678 | |
| 2679 | |
| 2680 | |
| 2681 |