Mercurial > projects > ldc
annotate dmd/func.c @ 1607:207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
---
dmd/arrayop.c | 30 ++++----
dmd/arraytypes.h | 2 +-
dmd/class.c | 8 +-
dmd/declaration.c | 10 ++--
dmd/declaration.h | 16 ++--
dmd/doc.c | 12 ++--
dmd/dsymbol.c | 4 +-
dmd/expression.c | 48 +++++++-------
dmd/expression.h | 32 +++++-----
dmd/func.c | 78 +++++++++++-----------
dmd/init.c | 2 +-
dmd/interpret.c | 8 +-
dmd/mtype.c | 190 ++++++++++++++++++++++++++--------------------------
dmd/mtype.h | 32 +++++-----
dmd/opover.c | 34 +++++-----
dmd/parse.c | 40 ++++++------
dmd/parse.h | 2 +-
dmd/statement.c | 90 +++++++++++++-------------
dmd/statement.h | 14 ++--
dmd/struct.c | 8 +-
dmd/template.c | 30 ++++----
gen/functions.cpp | 10 ++--
gen/functions.h | 2 +-
gen/tocall.cpp | 10 ++--
gen/typinf.cpp | 6 +-
25 files changed, 359 insertions(+), 359 deletions(-)
| author | Leandro Lucarella <llucax@gmail.com> |
|---|---|
| date | Wed, 06 Jan 2010 15:18:20 -0300 |
| parents | a413ae7329bf |
| children | 679d101395e8 |
| rev | line source |
|---|---|
| 1587 | 1 // Compiler implementation of the D programming language |
| 2 // Copyright (c) 1999-2009 by Digital Mars | |
| 3 // All Rights Reserved | |
| 4 // written by Walter Bright | |
| 5 // http://www.digitalmars.com | |
| 6 // License for redistribution is by either the Artistic License | |
| 7 // in artistic.txt, or the GNU General Public License in gnu.txt. | |
| 8 // See the included readme.txt for details. | |
| 9 | |
| 10 #include <stdio.h> | |
| 11 #include <assert.h> | |
| 12 | |
| 13 #include "mars.h" | |
| 14 #include "init.h" | |
| 15 #include "declaration.h" | |
| 16 #include "attrib.h" | |
| 17 #include "expression.h" | |
| 18 #include "scope.h" | |
| 19 #include "mtype.h" | |
| 20 #include "aggregate.h" | |
| 21 #include "identifier.h" | |
| 22 #include "id.h" | |
| 23 #include "module.h" | |
| 24 #include "statement.h" | |
| 25 #include "template.h" | |
| 26 #include "hdrgen.h" | |
| 27 | |
| 28 #ifdef IN_GCC | |
| 29 #include "d-dmd-gcc.h" | |
| 30 #endif | |
| 31 | |
| 32 /********************************* FuncDeclaration ****************************/ | |
| 33 | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
34 FuncDeclaration::FuncDeclaration(Loc loc, Loc endloc, Identifier *id, StorageClass storage_class, Type *type) |
| 1587 | 35 : Declaration(id) |
| 36 { | |
| 37 //printf("FuncDeclaration(id = '%s', type = %p)\n", id->toChars(), type); | |
| 38 //printf("storage_class = x%x\n", storage_class); | |
| 39 this->storage_class = storage_class; | |
| 40 this->type = type; | |
| 41 this->loc = loc; | |
| 42 this->endloc = endloc; | |
| 43 fthrows = NULL; | |
| 44 frequire = NULL; | |
| 45 fdrequire = NULL; | |
| 46 fdensure = NULL; | |
| 47 outId = NULL; | |
| 48 vresult = NULL; | |
| 49 returnLabel = NULL; | |
| 50 fensure = NULL; | |
| 51 fbody = NULL; | |
| 52 localsymtab = NULL; | |
| 53 vthis = NULL; | |
| 54 v_arguments = NULL; | |
| 55 #if IN_GCC | |
| 56 v_argptr = NULL; | |
| 57 #endif | |
| 58 parameters = NULL; | |
| 59 labtab = NULL; | |
| 60 overnext = NULL; | |
| 61 vtblIndex = -1; | |
| 62 hasReturnExp = 0; | |
| 63 naked = 0; | |
| 64 inlineStatus = ILSuninitialized; | |
| 65 inlineNest = 0; | |
| 66 inlineAsm = 0; | |
| 67 cantInterpret = 0; | |
| 68 semanticRun = 0; | |
| 69 #if DMDV1 | |
| 70 nestedFrameRef = 0; | |
| 71 #endif | |
| 72 fes = NULL; | |
| 73 introducing = 0; | |
| 74 tintro = NULL; | |
| 75 /* The type given for "infer the return type" is a TypeFunction with | |
| 76 * NULL for the return type. | |
| 77 */ | |
| 78 inferRetType = (type && type->nextOf() == NULL); | |
| 79 hasReturnExp = 0; | |
| 80 nrvo_can = 1; | |
| 81 nrvo_var = NULL; | |
| 82 #if IN_DMD | |
| 83 shidden = NULL; | |
| 84 #endif | |
| 85 | |
| 86 #if DMDV2 | |
| 87 builtin = BUILTINunknown; | |
| 88 tookAddressOf = 0; | |
| 89 #endif | |
| 90 | |
| 91 #if IN_LLVM | |
| 92 // LDC | |
| 93 isArrayOp = false; | |
| 94 allowInlining = false; | |
| 95 | |
| 96 availableExternally = true; // assume this unless proven otherwise | |
| 97 | |
| 98 // function types in ldc don't merge if the context parameter differs | |
| 99 // so we actually don't care about the function declaration, but only | |
| 100 // what kind of context parameter it has. | |
| 101 // however, this constructor is usually called from the parser, which | |
| 102 // unfortunately doesn't provide the information needed to get to the | |
| 103 // aggregate type. So we have to stick with the FuncDeclaration and | |
| 104 // just be sure we don't actually rely on the symbol it points to, | |
| 105 // but rather just the type of its context parameter. | |
| 106 // this means some function might have a function type pointing to | |
| 107 // another function declaration | |
| 108 | |
| 109 if (type) | |
| 110 { | |
| 111 assert(type->ty == Tfunction && "invalid function type"); | |
| 112 TypeFunction* tf = (TypeFunction*)type; | |
| 113 if (tf->funcdecl == NULL) | |
| 114 tf->funcdecl = this; | |
| 115 } | |
| 116 #endif | |
| 117 } | |
| 118 | |
| 119 Dsymbol *FuncDeclaration::syntaxCopy(Dsymbol *s) | |
| 120 { | |
| 121 FuncDeclaration *f; | |
| 122 | |
| 123 //printf("FuncDeclaration::syntaxCopy('%s')\n", toChars()); | |
| 124 if (s) | |
| 125 f = (FuncDeclaration *)s; | |
| 126 else | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
127 f = new FuncDeclaration(loc, endloc, ident, storage_class, type->syntaxCopy()); |
| 1587 | 128 f->outId = outId; |
| 129 f->frequire = frequire ? frequire->syntaxCopy() : NULL; | |
| 130 f->fensure = fensure ? fensure->syntaxCopy() : NULL; | |
| 131 f->fbody = fbody ? fbody->syntaxCopy() : NULL; | |
| 132 assert(!fthrows); // deprecated | |
| 133 | |
| 134 // LDC | |
| 135 f->intrinsicName = intrinsicName; | |
| 136 | |
| 137 return f; | |
| 138 } | |
| 139 | |
| 140 | |
| 141 // Do the semantic analysis on the external interface to the function. | |
| 142 | |
| 143 void FuncDeclaration::semantic(Scope *sc) | |
| 144 { TypeFunction *f; | |
| 145 StructDeclaration *sd; | |
| 146 ClassDeclaration *cd; | |
| 147 InterfaceDeclaration *id; | |
| 148 Dsymbol *pd; | |
| 149 | |
| 150 #if 0 | |
| 151 printf("FuncDeclaration::semantic(sc = %p, this = %p, '%s', linkage = %d)\n", sc, this, toPrettyChars(), sc->linkage); | |
| 152 if (isFuncLiteralDeclaration()) | |
| 153 printf("\tFuncLiteralDeclaration()\n"); | |
| 154 printf("sc->parent = %s, parent = %s\n", sc->parent->toChars(), parent ? parent->toChars() : ""); | |
| 155 printf("type: %p, %s\n", type, type->toChars()); | |
| 156 #endif | |
| 157 | |
| 158 if (semanticRun && isFuncLiteralDeclaration()) | |
| 159 { | |
| 160 /* Member functions that have return types that are | |
| 161 * forward references can have semantic() run more than | |
| 162 * once on them. | |
| 163 * See test\interface2.d, test20 | |
| 164 */ | |
| 165 return; | |
| 166 } | |
| 167 assert(semanticRun <= 1); | |
| 168 semanticRun = 1; | |
| 169 | |
| 170 if (!type->deco) | |
| 171 { | |
| 172 type = type->semantic(loc, sc); | |
| 173 } | |
| 174 //type->print(); | |
| 175 if (type->ty != Tfunction) | |
| 176 { | |
| 177 error("%s must be a function", toChars()); | |
| 178 return; | |
| 179 } | |
| 180 f = (TypeFunction *)(type); | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
181 size_t nparams = Parameter::dim(f->parameters); |
| 1587 | 182 |
| 183 linkage = sc->linkage; | |
| 184 // if (!parent) | |
| 185 { | |
| 186 //parent = sc->scopesym; | |
| 187 parent = sc->parent; | |
| 188 } | |
| 189 protection = sc->protection; | |
| 190 storage_class |= sc->stc; | |
| 191 //printf("function storage_class = x%x\n", storage_class); | |
| 192 Dsymbol *parent = toParent(); | |
| 193 | |
| 194 if (ident == Id::ctor && !isCtorDeclaration()) | |
| 195 error("_ctor is reserved for constructors"); | |
| 196 | |
| 197 if (isConst() || isAuto() || isScope()) | |
| 198 error("functions cannot be const, auto or scope"); | |
| 199 | |
| 200 if (isAbstract() && !isVirtual()) | |
| 201 error("non-virtual functions cannot be abstract"); | |
| 202 | |
| 203 if (isAbstract() && isFinal()) | |
| 204 error("cannot be both final and abstract"); | |
| 205 #if 0 | |
| 206 if (isAbstract() && fbody) | |
| 207 error("abstract functions cannot have bodies"); | |
| 208 #endif | |
| 209 | |
| 210 #if 0 | |
| 211 if (isStaticConstructor() || isStaticDestructor()) | |
| 212 { | |
| 213 if (!isStatic() || type->nextOf()->ty != Tvoid) | |
| 214 error("static constructors / destructors must be static void"); | |
| 215 if (f->arguments && f->arguments->dim) | |
| 216 error("static constructors / destructors must have empty parameter list"); | |
| 217 // BUG: check for invalid storage classes | |
| 218 } | |
| 219 #endif | |
| 220 | |
| 221 #ifdef IN_GCC | |
| 222 AggregateDeclaration *ad; | |
| 223 | |
| 224 ad = parent->isAggregateDeclaration(); | |
| 225 if (ad) | |
| 226 ad->methods.push(this); | |
| 227 #endif | |
| 228 sd = parent->isStructDeclaration(); | |
| 229 if (sd) | |
| 230 { | |
| 231 // Verify no constructors, destructors, etc. | |
| 232 if (isCtorDeclaration() || | |
| 233 isDtorDeclaration() | |
| 234 //|| isInvariantDeclaration() | |
| 235 //|| isUnitTestDeclaration() | |
| 236 ) | |
| 237 { | |
| 238 error("special member functions not allowed for %ss", sd->kind()); | |
| 239 } | |
| 240 | |
| 241 #if 0 | |
| 242 if (!sd->inv) | |
| 243 sd->inv = isInvariantDeclaration(); | |
| 244 | |
| 245 if (!sd->aggNew) | |
| 246 sd->aggNew = isNewDeclaration(); | |
| 247 | |
| 248 if (isDelete()) | |
| 249 { | |
| 250 if (sd->aggDelete) | |
| 251 error("multiple delete's for struct %s", sd->toChars()); | |
| 252 sd->aggDelete = (DeleteDeclaration *)(this); | |
| 253 } | |
| 254 #endif | |
| 255 } | |
| 256 | |
| 257 id = parent->isInterfaceDeclaration(); | |
| 258 if (id) | |
| 259 { | |
| 260 storage_class |= STCabstract; | |
| 261 | |
| 262 if (isCtorDeclaration() || | |
| 263 #if DMDV2 | |
| 264 isPostBlitDeclaration() || | |
| 265 #endif | |
| 266 isDtorDeclaration() || | |
| 267 isInvariantDeclaration() || | |
| 268 isUnitTestDeclaration() || isNewDeclaration() || isDelete()) | |
| 269 error("special function not allowed in interface %s", id->toChars()); | |
| 270 if (fbody) | |
| 271 error("function body is not abstract in interface %s", id->toChars()); | |
| 272 } | |
| 273 | |
| 274 /* Template member functions aren't virtual: | |
| 275 * interface TestInterface { void tpl(T)(); } | |
| 276 * and so won't work in interfaces | |
| 277 */ | |
| 278 if ((pd = toParent()) != NULL && | |
| 279 pd->isTemplateInstance() && | |
| 280 (pd = toParent2()) != NULL && | |
| 281 (id = pd->isInterfaceDeclaration()) != NULL) | |
| 282 { | |
| 283 error("template member function not allowed in interface %s", id->toChars()); | |
| 284 } | |
| 285 | |
| 286 cd = parent->isClassDeclaration(); | |
| 287 if (cd) | |
| 288 { int vi; | |
| 289 CtorDeclaration *ctor; | |
| 290 DtorDeclaration *dtor; | |
| 291 InvariantDeclaration *inv; | |
| 292 | |
| 293 if (isCtorDeclaration()) | |
| 294 { | |
| 295 // ctor = (CtorDeclaration *)this; | |
| 296 // if (!cd->ctor) | |
| 297 // cd->ctor = ctor; | |
| 298 return; | |
| 299 } | |
| 300 | |
| 301 #if 0 | |
| 302 dtor = isDtorDeclaration(); | |
| 303 if (dtor) | |
| 304 { | |
| 305 if (cd->dtor) | |
| 306 error("multiple destructors for class %s", cd->toChars()); | |
| 307 cd->dtor = dtor; | |
| 308 } | |
| 309 | |
| 310 inv = isInvariantDeclaration(); | |
| 311 if (inv) | |
| 312 { | |
| 313 cd->inv = inv; | |
| 314 } | |
| 315 | |
| 316 if (isNewDeclaration()) | |
| 317 { | |
| 318 if (!cd->aggNew) | |
| 319 cd->aggNew = (NewDeclaration *)(this); | |
| 320 } | |
| 321 | |
| 322 if (isDelete()) | |
| 323 { | |
| 324 if (cd->aggDelete) | |
| 325 error("multiple delete's for class %s", cd->toChars()); | |
| 326 cd->aggDelete = (DeleteDeclaration *)(this); | |
| 327 } | |
| 328 #endif | |
| 329 | |
| 330 if (storage_class & STCabstract) | |
| 331 cd->isabstract = 1; | |
| 332 | |
| 333 // if static function, do not put in vtbl[] | |
| 334 if (!isVirtual()) | |
| 335 { | |
| 336 //printf("\tnot virtual\n"); | |
| 337 goto Ldone; | |
| 338 } | |
| 339 | |
| 340 // Find index of existing function in vtbl[] to override | |
| 341 vi = findVtblIndex(&cd->vtbl, cd->baseClass ? cd->baseClass->vtbl.dim : 0); | |
| 342 switch (vi) | |
| 343 { | |
| 344 case -1: | |
| 345 /* Didn't find one, so | |
| 346 * This is an 'introducing' function which gets a new | |
| 347 * slot in the vtbl[]. | |
| 348 */ | |
| 349 | |
| 350 // Verify this doesn't override previous final function | |
| 351 if (cd->baseClass) | |
| 352 { Dsymbol *s = cd->baseClass->search(loc, ident, 0); | |
| 353 if (s) | |
| 354 { | |
| 355 FuncDeclaration *f = s->isFuncDeclaration(); | |
| 356 f = f->overloadExactMatch(type, getModule()); | |
| 357 if (f && f->isFinal() && f->prot() != PROTprivate) | |
| 358 error("cannot override final function %s", f->toPrettyChars()); | |
| 359 } | |
| 360 } | |
| 361 | |
| 362 if (isFinal()) | |
| 363 { | |
| 364 if (isOverride()) | |
| 365 error("does not override any function"); | |
| 366 cd->vtblFinal.push(this); | |
| 367 } | |
| 368 else | |
| 369 { | |
| 370 // Append to end of vtbl[] | |
| 371 //printf("\tintroducing function\n"); | |
| 372 introducing = 1; | |
| 373 vi = cd->vtbl.dim; | |
| 374 cd->vtbl.push(this); | |
| 375 vtblIndex = vi; | |
| 376 } | |
| 377 break; | |
| 378 | |
| 379 case -2: // can't determine because of fwd refs | |
| 380 cd->sizeok = 2; // can't finish due to forward reference | |
| 381 return; | |
| 382 | |
| 383 default: | |
| 384 { FuncDeclaration *fdv = (FuncDeclaration *)cd->vtbl.data[vi]; | |
| 385 // This function is covariant with fdv | |
| 386 if (fdv->isFinal()) | |
| 387 error("cannot override final function %s", fdv->toPrettyChars()); | |
| 388 | |
| 389 #if DMDV2 | |
| 390 if (!isOverride()) | |
| 391 warning(loc, "overrides base class function %s, but is not marked with 'override'", fdv->toPrettyChars()); | |
| 392 #endif | |
| 393 | |
| 394 if (fdv->toParent() == parent) | |
| 395 { | |
| 396 // If both are mixins, then error. | |
| 397 // If either is not, the one that is not overrides | |
| 398 // the other. | |
| 399 if (fdv->parent->isClassDeclaration()) | |
| 400 break; | |
| 401 if (!this->parent->isClassDeclaration() | |
| 402 #if !BREAKABI | |
| 403 && !isDtorDeclaration() | |
| 404 #endif | |
| 405 #if DMDV2 | |
| 406 && !isPostBlitDeclaration() | |
| 407 #endif | |
| 408 ) | |
| 409 error("multiple overrides of same function"); | |
| 410 } | |
| 411 cd->vtbl.data[vi] = (void *)this; | |
| 412 vtblIndex = vi; | |
| 413 | |
| 414 /* Remember which functions this overrides | |
| 415 */ | |
| 416 foverrides.push(fdv); | |
| 417 | |
| 418 /* This works by whenever this function is called, | |
| 419 * it actually returns tintro, which gets dynamically | |
| 420 * cast to type. But we know that tintro is a base | |
| 421 * of type, so we could optimize it by not doing a | |
| 422 * dynamic cast, but just subtracting the isBaseOf() | |
| 423 * offset if the value is != null. | |
| 424 */ | |
| 425 | |
| 426 if (fdv->tintro) | |
| 427 tintro = fdv->tintro; | |
| 428 else if (!type->equals(fdv->type)) | |
| 429 { | |
| 430 /* Only need to have a tintro if the vptr | |
| 431 * offsets differ | |
| 432 */ | |
| 433 int offset; | |
| 434 if (fdv->type->nextOf()->isBaseOf(type->nextOf(), &offset)) | |
| 435 { | |
| 436 tintro = fdv->type; | |
| 437 } | |
| 438 } | |
| 439 break; | |
| 440 } | |
| 441 } | |
| 442 | |
| 443 /* Go through all the interface bases. | |
| 444 * If this function is covariant with any members of those interface | |
| 445 * functions, set the tintro. | |
| 446 */ | |
| 447 for (int i = 0; i < cd->interfaces_dim; i++) | |
| 448 { | |
| 449 BaseClass *b = cd->interfaces[i]; | |
| 450 vi = findVtblIndex(&b->base->vtbl, b->base->vtbl.dim); | |
| 451 switch (vi) | |
| 452 { | |
| 453 case -1: | |
| 454 break; | |
| 455 | |
| 456 case -2: | |
| 457 cd->sizeok = 2; // can't finish due to forward reference | |
| 458 return; | |
| 459 | |
| 460 default: | |
| 461 { FuncDeclaration *fdv = (FuncDeclaration *)b->base->vtbl.data[vi]; | |
| 462 Type *ti = NULL; | |
| 463 | |
| 464 /* Remember which functions this overrides | |
| 465 */ | |
| 466 foverrides.push(fdv); | |
| 467 | |
| 468 if (fdv->tintro) | |
| 469 ti = fdv->tintro; | |
| 470 else if (!type->equals(fdv->type)) | |
| 471 { | |
| 472 /* Only need to have a tintro if the vptr | |
| 473 * offsets differ | |
| 474 */ | |
| 475 int offset; | |
| 476 if (fdv->type->nextOf()->isBaseOf(type->nextOf(), &offset)) | |
| 477 { | |
| 478 ti = fdv->type; | |
| 479 #if 0 | |
| 480 if (offset) | |
| 481 ti = fdv->type; | |
| 482 else if (type->nextOf()->ty == Tclass) | |
| 483 { ClassDeclaration *cdn = ((TypeClass *)type->nextOf())->sym; | |
| 484 if (cdn && cdn->sizeok != 1) | |
| 485 ti = fdv->type; | |
| 486 } | |
| 487 #endif | |
| 488 } | |
| 489 } | |
| 490 if (ti) | |
| 491 { | |
| 492 if (tintro && !tintro->equals(ti)) | |
| 493 { | |
| 494 error("incompatible covariant types %s and %s", tintro->toChars(), ti->toChars()); | |
| 495 } | |
| 496 tintro = ti; | |
| 497 } | |
| 498 goto L2; | |
| 499 } | |
| 500 } | |
| 501 } | |
| 502 | |
| 503 if (introducing && isOverride()) | |
| 504 { | |
| 505 error("does not override any function"); | |
| 506 } | |
| 507 | |
| 508 L2: ; | |
| 509 } | |
| 510 else if (isOverride() && !parent->isTemplateInstance()) | |
| 511 error("override only applies to class member functions"); | |
| 512 | |
| 513 /* Do not allow template instances to add virtual functions | |
| 514 * to a class. | |
| 515 */ | |
| 516 if (isVirtual()) | |
| 517 { | |
| 518 TemplateInstance *ti = parent->isTemplateInstance(); | |
| 519 if (ti) | |
| 520 { | |
| 521 // Take care of nested templates | |
| 522 while (1) | |
| 523 { | |
| 524 TemplateInstance *ti2 = ti->tempdecl->parent->isTemplateInstance(); | |
| 525 if (!ti2) | |
| 526 break; | |
| 527 ti = ti2; | |
| 528 } | |
| 529 | |
| 530 // If it's a member template | |
| 531 ClassDeclaration *cd = ti->tempdecl->isClassMember(); | |
| 532 if (cd) | |
| 533 { | |
| 534 error("cannot use template to add virtual function to class '%s'", cd->toChars()); | |
| 535 } | |
| 536 } | |
| 537 } | |
| 538 | |
| 539 if (isMain()) | |
| 540 { | |
| 541 // Check parameters to see if they are either () or (char[][] args) | |
| 542 switch (nparams) | |
| 543 { | |
| 544 case 0: | |
| 545 break; | |
| 546 | |
| 547 case 1: | |
| 548 { | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
549 Parameter *arg0 = Parameter::getNth(f->parameters, 0); |
| 1587 | 550 if (arg0->type->ty != Tarray || |
| 551 arg0->type->nextOf()->ty != Tarray || | |
| 552 arg0->type->nextOf()->nextOf()->ty != Tchar || | |
| 553 arg0->storageClass & (STCout | STCref | STClazy)) | |
| 554 goto Lmainerr; | |
| 555 break; | |
| 556 } | |
| 557 | |
| 558 default: | |
| 559 goto Lmainerr; | |
| 560 } | |
| 561 | |
| 562 if (!f->nextOf()) | |
| 563 error("must return int or void"); | |
| 564 else if (f->nextOf()->ty != Tint32 && f->nextOf()->ty != Tvoid) | |
| 565 error("must return int or void, not %s", f->nextOf()->toChars()); | |
| 566 if (f->varargs) | |
| 567 { | |
| 568 Lmainerr: | |
| 569 error("parameters must be main() or main(char[][] args)"); | |
| 570 } | |
| 571 } | |
| 572 | |
| 573 if (ident == Id::assign && (sd || cd)) | |
| 574 { // Disallow identity assignment operator. | |
| 575 | |
| 576 // opAssign(...) | |
| 577 if (nparams == 0) | |
| 578 { if (f->varargs == 1) | |
| 579 goto Lassignerr; | |
| 580 } | |
| 581 else | |
| 582 { | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
583 Parameter *arg0 = Parameter::getNth(f->parameters, 0); |
| 1587 | 584 Type *t0 = arg0->type->toBasetype(); |
| 585 Type *tb = sd ? sd->type : cd->type; | |
| 586 if (arg0->type->implicitConvTo(tb) || | |
| 587 (sd && t0->ty == Tpointer && t0->nextOf()->implicitConvTo(tb)) | |
| 588 ) | |
| 589 { | |
| 590 if (nparams == 1) | |
| 591 goto Lassignerr; | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
592 Parameter *arg1 = Parameter::getNth(f->parameters, 1); |
| 1587 | 593 if (arg1->defaultArg) |
| 594 goto Lassignerr; | |
| 595 } | |
| 596 } | |
| 597 } | |
| 598 | |
| 599 if (isVirtual()) | |
| 600 { | |
| 601 /* Rewrite contracts as nested functions, then call them. | |
| 602 * Doing it as nested functions means that overriding functions | |
| 603 * can call them. | |
| 604 */ | |
| 605 if (frequire) | |
| 606 { /* in { ... } | |
| 607 * becomes: | |
| 608 * void __require() { ... } | |
| 609 * __require(); | |
| 610 */ | |
| 611 Loc loc = frequire->loc; | |
| 612 TypeFunction *tf = new TypeFunction(NULL, Type::tvoid, 0, LINKd); | |
| 613 FuncDeclaration *fd = new FuncDeclaration(loc, loc, | |
| 614 Id::require, STCundefined, tf); | |
| 615 fd->fbody = frequire; | |
| 616 Statement *s1 = new DeclarationStatement(loc, fd); | |
| 617 Expression *e = new CallExp(loc, new VarExp(loc, fd), (Expressions *)NULL); | |
| 618 Statement *s2 = new ExpStatement(loc, e); | |
| 619 frequire = new CompoundStatement(loc, s1, s2); | |
| 620 fdrequire = fd; | |
| 621 } | |
| 622 | |
| 623 if (fensure) | |
| 624 { /* out (result) { ... } | |
| 625 * becomes: | |
| 626 * tret __ensure(ref tret result) { ... } | |
| 627 * __ensure(result); | |
| 628 */ | |
| 629 if (!outId && f->nextOf()->toBasetype()->ty != Tvoid) | |
| 630 outId = Id::result; // provide a default | |
| 631 | |
| 632 Loc loc = fensure->loc; | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
633 Parameters *arguments = new Parameters(); |
|
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
634 Parameter *a = NULL; |
| 1587 | 635 if (outId) |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
636 { a = new Parameter(STCref, f->nextOf(), outId, NULL); |
| 1587 | 637 arguments->push(a); |
| 638 } | |
| 639 TypeFunction *tf = new TypeFunction(arguments, Type::tvoid, 0, LINKd); | |
| 640 FuncDeclaration *fd = new FuncDeclaration(loc, loc, | |
| 641 Id::ensure, STCundefined, tf); | |
| 642 fd->fbody = fensure; | |
| 643 Statement *s1 = new DeclarationStatement(loc, fd); | |
| 644 Expression *eresult = NULL; | |
| 645 if (outId) | |
| 646 eresult = new IdentifierExp(loc, outId); | |
| 647 Expression *e = new CallExp(loc, new VarExp(loc, fd), eresult); | |
| 648 Statement *s2 = new ExpStatement(loc, e); | |
| 649 fensure = new CompoundStatement(loc, s1, s2); | |
| 650 fdensure = fd; | |
| 651 } | |
| 652 } | |
| 653 | |
| 654 Ldone: | |
| 655 /* Save scope for possible later use (if we need the | |
| 656 * function internals) | |
| 657 */ | |
| 658 scope = new Scope(*sc); | |
| 659 scope->setNoFree(); | |
| 660 return; | |
| 661 | |
| 662 Lassignerr: | |
| 663 error("identity assignment operator overload is illegal"); | |
| 664 } | |
| 665 | |
| 666 void FuncDeclaration::semantic2(Scope *sc) | |
| 667 { | |
| 668 } | |
| 669 | |
| 670 // Do the semantic analysis on the internals of the function. | |
| 671 | |
| 672 void FuncDeclaration::semantic3(Scope *sc) | |
| 673 { TypeFunction *f; | |
| 674 VarDeclaration *argptr = NULL; | |
| 675 VarDeclaration *_arguments = NULL; | |
| 676 | |
| 677 if (!parent) | |
| 678 { | |
| 679 if (global.errors) | |
| 680 return; | |
| 681 //printf("FuncDeclaration::semantic3(%s '%s', sc = %p)\n", kind(), toChars(), sc); | |
| 682 assert(0); | |
| 683 } | |
| 684 //printf("FuncDeclaration::semantic3('%s.%s', sc = %p, loc = %s)\n", parent->toChars(), toChars(), sc, loc.toChars()); | |
| 685 //fflush(stdout); | |
| 686 //printf("storage class = x%x %x\n", sc->stc, storage_class); | |
| 687 //{ static int x; if (++x == 2) *(char*)0=0; } | |
| 688 //printf("\tlinkage = %d\n", sc->linkage); | |
| 689 | |
| 690 //printf(" sc->incontract = %d\n", sc->incontract); | |
| 691 if (semanticRun >= 3) | |
| 692 return; | |
| 693 semanticRun = 3; | |
| 694 | |
| 695 // LDC | |
| 696 if (!global.params.useAvailableExternally) | |
| 697 availableExternally = false; | |
| 698 | |
| 699 if (!type || type->ty != Tfunction) | |
| 700 return; | |
| 701 f = (TypeFunction *)(type); | |
| 702 | |
| 703 // Check the 'throws' clause | |
| 704 if (fthrows) | |
| 705 { | |
| 706 for (int i = 0; i < fthrows->dim; i++) | |
| 707 { | |
| 708 Type *t = (Type *)fthrows->data[i]; | |
| 709 | |
| 710 t = t->semantic(loc, sc); | |
| 711 if (!t->isClassHandle()) | |
| 712 error("can only throw classes, not %s", t->toChars()); | |
| 713 } | |
| 714 } | |
| 715 | |
| 716 frequire = mergeFrequire(frequire); | |
| 717 fensure = mergeFensure(fensure); | |
| 718 | |
| 719 if (fbody || frequire) | |
| 720 { | |
| 721 /* Symbol table into which we place parameters and nested functions, | |
| 722 * solely to diagnose name collisions. | |
| 723 */ | |
| 724 localsymtab = new DsymbolTable(); | |
| 725 | |
| 726 // Establish function scope | |
| 727 ScopeDsymbol *ss = new ScopeDsymbol(); | |
| 728 ss->parent = sc->scopesym; | |
| 729 Scope *sc2 = sc->push(ss); | |
| 730 sc2->func = this; | |
| 731 sc2->parent = this; | |
| 732 sc2->callSuper = 0; | |
| 733 sc2->sbreak = NULL; | |
| 734 sc2->scontinue = NULL; | |
| 735 sc2->sw = NULL; | |
| 736 sc2->fes = fes; | |
| 737 sc2->linkage = LINKd; | |
| 738 sc2->stc &= ~(STCauto | STCscope | STCstatic | STCabstract | STCdeprecated | STCfinal); | |
| 739 sc2->protection = PROTpublic; | |
| 740 sc2->explicitProtection = 0; | |
| 741 sc2->structalign = 8; | |
| 742 sc2->incontract = 0; | |
| 743 sc2->enclosingFinally = NULL; | |
| 744 sc2->enclosingScopeExit = NULL; | |
| 745 sc2->noctor = 0; | |
| 746 | |
| 747 // Declare 'this' | |
| 748 AggregateDeclaration *ad = isThis(); | |
| 749 if (ad) | |
| 750 { VarDeclaration *v; | |
| 751 | |
| 752 if (isFuncLiteralDeclaration() && isNested()) | |
| 753 { | |
| 754 error("literals cannot be class members"); | |
| 755 return; | |
| 756 } | |
| 757 else | |
| 758 { | |
| 759 assert(!isNested()); // can't be both member and nested | |
| 760 assert(ad->handle); | |
| 761 v = new ThisDeclaration(loc, ad->handle); | |
| 762 v->storage_class |= STCparameter | STCin; | |
| 763 v->semantic(sc2); | |
| 764 if (!sc2->insert(v)) | |
| 765 assert(0); | |
| 766 v->parent = this; | |
| 767 vthis = v; | |
| 768 } | |
| 769 } | |
| 770 else if (isNested()) | |
| 771 { | |
| 772 /* The 'this' for a nested function is the link to the | |
| 773 * enclosing function's stack frame. | |
| 774 * Note that nested functions and member functions are disjoint. | |
| 775 */ | |
| 776 VarDeclaration *v = new ThisDeclaration(loc, Type::tvoid->pointerTo()); | |
| 777 v->storage_class |= STCparameter | STCin; | |
| 778 v->semantic(sc2); | |
| 779 if (!sc2->insert(v)) | |
| 780 assert(0); | |
| 781 v->parent = this; | |
| 782 vthis = v; | |
| 783 } | |
| 784 | |
| 785 // Declare hidden variable _arguments[] and _argptr | |
| 786 if (f->varargs == 1) | |
| 787 { | |
| 788 #if TARGET_NET | |
| 789 varArgs(sc2, f, argptr, _arguments); | |
| 790 #else | |
| 791 Type *t; | |
| 792 | |
| 793 if (f->linkage == LINKd) | |
| 794 { // Declare _arguments[] | |
| 795 #if BREAKABI | |
| 796 v_arguments = new VarDeclaration(0, Type::typeinfotypelist->type, Id::_arguments_typeinfo, NULL); | |
| 797 v_arguments->storage_class = STCparameter | STCin; | |
| 798 v_arguments->semantic(sc2); | |
| 799 sc2->insert(v_arguments); | |
| 800 v_arguments->parent = this; | |
| 801 | |
| 802 t = Type::typeinfo->type->arrayOf(); | |
| 803 _arguments = new VarDeclaration(0, t, Id::_arguments, NULL); | |
| 804 _arguments->semantic(sc2); | |
| 805 sc2->insert(_arguments); | |
| 806 _arguments->parent = this; | |
| 807 #else | |
| 808 t = Type::typeinfo->type->arrayOf(); | |
| 809 v_arguments = new VarDeclaration(0, t, Id::_arguments, NULL); | |
| 810 v_arguments->storage_class = STCparameter | STCin; | |
| 811 v_arguments->semantic(sc2); | |
| 812 sc2->insert(v_arguments); | |
| 813 v_arguments->parent = this; | |
| 814 #endif | |
| 815 } | |
| 816 if (f->linkage == LINKd || (parameters && parameters->dim)) | |
| 817 { // Declare _argptr | |
| 818 #if IN_GCC | |
| 819 t = d_gcc_builtin_va_list_d_type; | |
| 820 #else | |
| 821 t = Type::tvoid->pointerTo(); | |
| 822 #endif | |
| 823 argptr = new VarDeclaration(0, t, Id::_argptr, NULL); | |
| 824 argptr->semantic(sc2); | |
| 825 sc2->insert(argptr); | |
| 826 argptr->parent = this; | |
| 827 } | |
| 828 #endif | |
| 829 } | |
| 830 | |
| 831 #if IN_LLVM | |
| 832 // LDC make sure argument type is semanticed. | |
| 833 // Turns TypeTuple!(int, int) into two int parameters, for instance. | |
| 834 if (f->parameters) | |
| 835 { | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
836 for (size_t i = 0; i < Parameter::dim(f->parameters); i++) |
|
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
837 { Parameter *arg = (Parameter *)Parameter::getNth(f->parameters, i); |
| 1587 | 838 Type* nw = arg->type->semantic(0, sc); |
| 839 if (arg->type != nw) { | |
| 840 arg->type = nw; | |
| 841 // Examine this index again. | |
| 842 // This is important if it turned into a tuple. | |
| 843 // In particular, the empty tuple should be handled or the | |
| 844 // next parameter will be skipped. | |
| 845 // FIXME: Maybe we only need to do this for tuples, | |
| 846 // and can add tuple.length after decrement? | |
| 847 i--; | |
| 848 } | |
| 849 } | |
| 850 } | |
| 851 #endif | |
| 852 | |
| 853 // Propagate storage class from tuple parameters to their element-parameters. | |
| 854 if (f->parameters) | |
| 855 { | |
| 856 for (size_t i = 0; i < f->parameters->dim; i++) | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
857 { Parameter *arg = (Parameter *)f->parameters->data[i]; |
| 1587 | 858 |
| 859 //printf("[%d] arg->type->ty = %d %s\n", i, arg->type->ty, arg->type->toChars()); | |
| 860 if (arg->type->ty == Ttuple) | |
| 861 { TypeTuple *t = (TypeTuple *)arg->type; | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
862 size_t dim = Parameter::dim(t->arguments); |
| 1587 | 863 for (size_t j = 0; j < dim; j++) |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
864 { Parameter *narg = Parameter::getNth(t->arguments, j); |
| 1587 | 865 narg->storageClass = arg->storageClass; |
| 866 } | |
| 867 } | |
| 868 } | |
| 869 } | |
| 870 | |
| 871 /* Declare all the function parameters as variables | |
| 872 * and install them in parameters[] | |
| 873 */ | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
874 size_t nparams = Parameter::dim(f->parameters); |
| 1587 | 875 if (nparams) |
| 876 { /* parameters[] has all the tuples removed, as the back end | |
| 877 * doesn't know about tuples | |
| 878 */ | |
| 879 parameters = new Dsymbols(); | |
| 880 parameters->reserve(nparams); | |
| 881 for (size_t i = 0; i < nparams; i++) | |
| 882 { | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
883 Parameter *arg = Parameter::getNth(f->parameters, i); |
| 1587 | 884 Identifier *id = arg->ident; |
| 885 if (!id) | |
| 886 { | |
| 887 /* Generate identifier for un-named parameter, | |
| 888 * because we need it later on. | |
| 889 */ | |
| 890 arg->ident = id = Identifier::generateId("_param_", i); | |
| 891 } | |
| 892 Type *vtype = arg->type; | |
| 893 VarDeclaration *v = new VarDeclaration(loc, vtype, id, NULL); | |
| 894 //printf("declaring parameter %s of type %s\n", v->toChars(), v->type->toChars()); | |
| 895 v->storage_class |= STCparameter; | |
| 896 if (f->varargs == 2 && i + 1 == nparams) | |
| 897 v->storage_class |= STCvariadic; | |
| 898 v->storage_class |= arg->storageClass & (STCin | STCout | STCref | STClazy); | |
| 899 if (v->storage_class & STClazy) | |
| 900 v->storage_class |= STCin; | |
| 901 v->semantic(sc2); | |
| 902 if (!sc2->insert(v)) | |
| 903 error("parameter %s.%s is already defined", toChars(), v->toChars()); | |
| 904 else | |
| 905 parameters->push(v); | |
| 906 localsymtab->insert(v); | |
| 907 v->parent = this; | |
| 908 } | |
| 909 } | |
| 910 | |
| 911 // Declare the tuple symbols and put them in the symbol table, | |
| 912 // but not in parameters[]. | |
| 913 if (f->parameters) | |
| 914 { | |
| 915 for (size_t i = 0; i < f->parameters->dim; i++) | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
916 { Parameter *arg = (Parameter *)f->parameters->data[i]; |
| 1587 | 917 |
| 918 if (!arg->ident) | |
| 919 continue; // never used, so ignore | |
| 920 if (arg->type->ty == Ttuple) | |
| 921 { TypeTuple *t = (TypeTuple *)arg->type; | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
922 size_t dim = Parameter::dim(t->arguments); |
| 1587 | 923 Objects *exps = new Objects(); |
| 924 exps->setDim(dim); | |
| 925 for (size_t j = 0; j < dim; j++) | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
926 { Parameter *narg = Parameter::getNth(t->arguments, j); |
| 1587 | 927 assert(narg->ident); |
| 928 VarDeclaration *v = sc2->search(0, narg->ident, NULL)->isVarDeclaration(); | |
| 929 assert(v); | |
| 930 Expression *e = new VarExp(v->loc, v); | |
| 931 exps->data[j] = (void *)e; | |
| 932 } | |
| 933 assert(arg->ident); | |
| 934 TupleDeclaration *v = new TupleDeclaration(loc, arg->ident, exps); | |
| 935 //printf("declaring tuple %s\n", v->toChars()); | |
| 936 v->isexp = 1; | |
| 937 if (!sc2->insert(v)) | |
| 938 error("parameter %s.%s is already defined", toChars(), v->toChars()); | |
| 939 localsymtab->insert(v); | |
| 940 v->parent = this; | |
| 941 } | |
| 942 } | |
| 943 } | |
| 944 | |
| 945 /* Do the semantic analysis on the [in] preconditions and | |
| 946 * [out] postconditions. | |
| 947 */ | |
| 948 sc2->incontract++; | |
| 949 | |
| 950 if (frequire) | |
| 951 { /* frequire is composed of the [in] contracts | |
| 952 */ | |
| 953 // BUG: need to error if accessing out parameters | |
| 954 // BUG: need to treat parameters as const | |
| 955 // BUG: need to disallow returns and throws | |
| 956 // BUG: verify that all in and ref parameters are read | |
| 957 frequire = frequire->semantic(sc2); | |
| 958 labtab = NULL; // so body can't refer to labels | |
| 959 } | |
| 960 | |
| 961 if (fensure || addPostInvariant()) | |
| 962 { /* fensure is composed of the [out] contracts | |
| 963 */ | |
| 964 if (!type->nextOf()) | |
| 965 { // Have to do semantic() on fbody first | |
| 966 error("post conditions are not supported if the return type is inferred"); | |
| 967 return; | |
| 968 } | |
| 969 | |
| 970 ScopeDsymbol *sym = new ScopeDsymbol(); | |
| 971 sym->parent = sc2->scopesym; | |
| 972 sc2 = sc2->push(sym); | |
| 973 | |
| 974 assert(type->nextOf()); | |
| 975 if (type->nextOf()->ty == Tvoid) | |
| 976 { | |
| 977 if (outId) | |
| 978 error("void functions have no result"); | |
| 979 } | |
| 980 else | |
| 981 { | |
| 982 if (!outId) | |
| 983 outId = Id::result; // provide a default | |
| 984 } | |
| 985 | |
| 986 if (outId) | |
| 987 { // Declare result variable | |
| 988 VarDeclaration *v; | |
| 989 Loc loc = this->loc; | |
| 990 | |
| 991 if (fensure) | |
| 992 loc = fensure->loc; | |
| 993 | |
| 994 v = new VarDeclaration(loc, type->nextOf(), outId, NULL); | |
| 995 v->noscope = 1; | |
| 996 #if DMDV2 | |
| 997 if (f->isref) | |
| 998 { | |
| 999 v->storage_class |= STCref | STCforeach; | |
| 1000 } | |
| 1001 #endif | |
| 1002 sc2->incontract--; | |
| 1003 v->semantic(sc2); | |
| 1004 sc2->incontract++; | |
| 1005 if (!sc2->insert(v)) | |
| 1006 error("out result %s is already defined", v->toChars()); | |
| 1007 v->parent = this; | |
| 1008 vresult = v; | |
| 1009 | |
| 1010 // vresult gets initialized with the function return value | |
| 1011 // in ReturnStatement::semantic() | |
| 1012 } | |
| 1013 | |
| 1014 // BUG: need to treat parameters as const | |
| 1015 // BUG: need to disallow returns and throws | |
| 1016 if (fensure) | |
| 1017 { fensure = fensure->semantic(sc2); | |
| 1018 labtab = NULL; // so body can't refer to labels | |
| 1019 } | |
| 1020 | |
| 1021 if (!global.params.useOut) | |
| 1022 { fensure = NULL; // discard | |
| 1023 vresult = NULL; | |
| 1024 } | |
| 1025 | |
| 1026 // Postcondition invariant | |
| 1027 if (addPostInvariant()) | |
| 1028 { | |
| 1029 Expression *e = NULL; | |
| 1030 if (isCtorDeclaration()) | |
| 1031 { | |
| 1032 // Call invariant directly only if it exists | |
| 1033 InvariantDeclaration *inv = ad->inv; | |
| 1034 ClassDeclaration *cd = ad->isClassDeclaration(); | |
| 1035 | |
| 1036 while (!inv && cd) | |
| 1037 { | |
| 1038 cd = cd->baseClass; | |
| 1039 if (!cd) | |
| 1040 break; | |
| 1041 inv = cd->inv; | |
| 1042 } | |
| 1043 if (inv) | |
| 1044 { | |
| 1045 e = new DsymbolExp(0, inv); | |
| 1046 e = new CallExp(0, e); | |
| 1047 e = e->semantic(sc2); | |
| 1048 } | |
| 1049 } | |
| 1050 else | |
| 1051 { // Call invariant virtually | |
| 1052 Expression *v = new ThisExp(0); | |
| 1053 v->type = vthis->type; | |
| 1054 #if STRUCTTHISREF | |
| 1055 if (ad->isStructDeclaration()) | |
| 1056 v = v->addressOf(sc); | |
| 1057 #endif | |
| 1058 e = new AssertExp(0, v); | |
| 1059 } | |
| 1060 if (e) | |
| 1061 { | |
| 1062 ExpStatement *s = new ExpStatement(0, e); | |
| 1063 if (fensure) | |
| 1064 fensure = new CompoundStatement(0, s, fensure); | |
| 1065 else | |
| 1066 fensure = s; | |
| 1067 } | |
| 1068 } | |
| 1069 | |
| 1070 if (fensure) | |
| 1071 { returnLabel = new LabelDsymbol(Id::returnLabel); | |
| 1072 LabelStatement *ls = new LabelStatement(0, Id::returnLabel, fensure); | |
| 1073 ls->isReturnLabel = 1; | |
| 1074 returnLabel->statement = ls; | |
| 1075 } | |
| 1076 sc2 = sc2->pop(); | |
| 1077 } | |
| 1078 | |
| 1079 sc2->incontract--; | |
| 1080 | |
| 1081 if (fbody) | |
| 1082 { ClassDeclaration *cd = isClassMember(); | |
| 1083 | |
| 1084 /* If this is a class constructor | |
| 1085 */ | |
| 1086 if (isCtorDeclaration() && cd) | |
| 1087 { | |
| 1088 for (int i = 0; i < cd->fields.dim; i++) | |
| 1089 { VarDeclaration *v = (VarDeclaration *)cd->fields.data[i]; | |
| 1090 | |
| 1091 v->ctorinit = 0; | |
| 1092 } | |
| 1093 } | |
| 1094 | |
| 1095 if (inferRetType || f->retStyle() != RETstack) | |
| 1096 nrvo_can = 0; | |
| 1097 | |
| 1098 fbody = fbody->semantic(sc2); | |
| 1099 | |
| 1100 if (inferRetType) | |
| 1101 { // If no return type inferred yet, then infer a void | |
| 1102 if (!type->nextOf()) | |
| 1103 { | |
| 1104 ((TypeFunction *)type)->next = Type::tvoid; | |
| 1105 type = type->semantic(loc, sc); | |
| 1106 } | |
| 1107 f = (TypeFunction *)type; | |
| 1108 } | |
| 1109 | |
| 1110 int offend = fbody ? fbody->blockExit() & BEfallthru : TRUE; | |
| 1111 | |
| 1112 if (isStaticCtorDeclaration()) | |
| 1113 { /* It's a static constructor. Ensure that all | |
| 1114 * ctor consts were initialized. | |
| 1115 */ | |
| 1116 | |
| 1117 Dsymbol *p = toParent(); | |
| 1118 ScopeDsymbol *ad = p->isScopeDsymbol(); | |
| 1119 if (!ad) | |
| 1120 { | |
| 1121 error("static constructor can only be member of struct/class/module, not %s %s", p->kind(), p->toChars()); | |
| 1122 } | |
| 1123 else | |
| 1124 { | |
| 1125 for (int i = 0; i < ad->members->dim; i++) | |
| 1126 { Dsymbol *s = (Dsymbol *)ad->members->data[i]; | |
| 1127 | |
| 1128 s->checkCtorConstInit(); | |
| 1129 } | |
| 1130 } | |
| 1131 } | |
| 1132 | |
| 1133 if (isCtorDeclaration() && cd) | |
| 1134 { | |
| 1135 //printf("callSuper = x%x\n", sc2->callSuper); | |
| 1136 | |
| 1137 // Verify that all the ctorinit fields got initialized | |
| 1138 if (!(sc2->callSuper & CSXthis_ctor)) | |
| 1139 { | |
| 1140 for (int i = 0; i < cd->fields.dim; i++) | |
| 1141 { VarDeclaration *v = (VarDeclaration *)cd->fields.data[i]; | |
| 1142 | |
| 1143 if (v->ctorinit == 0 && v->isCtorinit()) | |
| 1144 error("missing initializer for const field %s", v->toChars()); | |
| 1145 } | |
| 1146 } | |
| 1147 | |
| 1148 if (!(sc2->callSuper & CSXany_ctor) && | |
| 1149 cd->baseClass && cd->baseClass->ctor) | |
| 1150 { | |
| 1151 sc2->callSuper = 0; | |
| 1152 | |
| 1153 // Insert implicit super() at start of fbody | |
| 1154 Expression *e1 = new SuperExp(0); | |
| 1155 Expression *e = new CallExp(0, e1); | |
| 1156 | |
| 1157 unsigned errors = global.errors; | |
| 1158 global.gag++; | |
| 1159 e = e->semantic(sc2); | |
| 1160 global.gag--; | |
| 1161 if (errors != global.errors) | |
| 1162 error("no match for implicit super() call in constructor"); | |
| 1163 | |
| 1164 Statement *s = new ExpStatement(0, e); | |
| 1165 fbody = new CompoundStatement(0, s, fbody); | |
| 1166 } | |
| 1167 } | |
| 1168 else if (fes) | |
| 1169 { // For foreach(){} body, append a return 0; | |
| 1170 Expression *e = new IntegerExp(0); | |
| 1171 Statement *s = new ReturnStatement(0, e); | |
| 1172 fbody = new CompoundStatement(0, fbody, s); | |
| 1173 assert(!returnLabel); | |
| 1174 } | |
| 1175 else if (!hasReturnExp && type->nextOf()->ty != Tvoid) | |
| 1176 error("expected to return a value of type %s", type->nextOf()->toChars()); | |
| 1177 else if (!inlineAsm) | |
| 1178 { | |
| 1179 #if DMDV2 | |
| 1180 int blockexit = fbody ? fbody->blockExit() : BEfallthru; | |
| 1181 if (f->isnothrow && blockexit & BEthrow) | |
| 1182 error("'%s' is nothrow yet may throw", toChars()); | |
| 1183 | |
| 1184 int offend = blockexit & BEfallthru; | |
| 1185 #endif | |
| 1186 if (type->nextOf()->ty == Tvoid) | |
| 1187 { | |
| 1188 if (offend && isMain()) | |
| 1189 { // Add a return 0; statement | |
| 1190 Statement *s = new ReturnStatement(0, new IntegerExp(0)); | |
| 1191 fbody = new CompoundStatement(0, fbody, s); | |
| 1192 } | |
| 1193 } | |
| 1194 else | |
| 1195 { | |
| 1196 if (offend) | |
| 1197 { Expression *e; | |
| 1198 #if DMDV1 | |
| 1199 warning(loc, "no return exp; or assert(0); at end of function"); | |
| 1200 #else | |
| 1201 error("no return exp; or assert(0); at end of function"); | |
| 1202 #endif | |
| 1203 if (global.params.useAssert && | |
| 1204 !global.params.useInline) | |
| 1205 { /* Add an assert(0, msg); where the missing return | |
| 1206 * should be. | |
| 1207 */ | |
| 1208 e = new AssertExp( | |
| 1209 endloc, | |
| 1210 new IntegerExp(0), | |
| 1211 new StringExp(loc, (char *)"missing return expression") | |
| 1212 ); | |
| 1213 } | |
| 1214 else | |
| 1215 e = new HaltExp(endloc); | |
| 1216 e = new CommaExp(0, e, type->nextOf()->defaultInit()); | |
| 1217 e = e->semantic(sc2); | |
| 1218 Statement *s = new ExpStatement(0, e); | |
| 1219 fbody = new CompoundStatement(0, fbody, s); | |
| 1220 } | |
| 1221 } | |
| 1222 } | |
| 1223 } | |
| 1224 | |
| 1225 { | |
| 1226 Statements *a = new Statements(); | |
| 1227 | |
| 1228 // Merge in initialization of 'out' parameters | |
| 1229 if (parameters) | |
| 1230 { for (size_t i = 0; i < parameters->dim; i++) | |
| 1231 { | |
| 1232 VarDeclaration *v = (VarDeclaration *)parameters->data[i]; | |
| 1233 if (v->storage_class & STCout) | |
| 1234 { | |
| 1235 assert(v->init); | |
| 1236 ExpInitializer *ie = v->init->isExpInitializer(); | |
| 1237 assert(ie); | |
| 1238 a->push(new ExpStatement(0, ie->exp)); | |
| 1239 } | |
| 1240 } | |
| 1241 } | |
| 1242 | |
| 1243 // we'll handle variadics ourselves | |
| 1244 #if !IN_LLVM | |
| 1245 if (argptr) | |
| 1246 { // Initialize _argptr to point past non-variadic arg | |
| 1247 #if IN_GCC | |
| 1248 // Handled in FuncDeclaration::toObjFile | |
| 1249 v_argptr = argptr; | |
| 1250 v_argptr->init = new VoidInitializer(loc); | |
| 1251 #else | |
| 1252 Type *t = argptr->type; | |
| 1253 VarDeclaration *p; | |
| 1254 unsigned offset; | |
| 1255 | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1256 Expression *e1 = new VarExp(0, argptr); |
| 1587 | 1257 if (parameters && parameters->dim) |
| 1258 p = (VarDeclaration *)parameters->data[parameters->dim - 1]; | |
| 1259 else | |
| 1260 p = v_arguments; // last parameter is _arguments[] | |
| 1261 if (p->storage_class & STClazy) | |
| 1262 // If the last parameter is lazy, it's the size of a delegate | |
| 1263 offset = PTRSIZE * 2; | |
| 1264 else | |
| 1265 offset = p->type->size(); | |
| 1266 offset = (offset + 3) & ~3; // assume stack aligns on 4 | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1267 Expression *e = new SymOffExp(0, p, offset); |
| 1587 | 1268 e = new AssignExp(0, e1, e); |
| 1269 e->type = t; | |
| 1270 a->push(new ExpStatement(0, e)); | |
| 1271 #endif // IN_GCC | |
| 1272 } | |
| 1273 | |
| 1274 if (_arguments) | |
| 1275 { | |
| 1276 /* Advance to elements[] member of TypeInfo_Tuple with: | |
| 1277 * _arguments = v_arguments.elements; | |
| 1278 */ | |
| 1279 Expression *e = new VarExp(0, v_arguments); | |
| 1280 e = new DotIdExp(0, e, Id::elements); | |
| 1281 Expression *e1 = new VarExp(0, _arguments); | |
| 1282 e = new AssignExp(0, e1, e); | |
| 1283 e->op = TOKconstruct; | |
| 1284 e = e->semantic(sc2); | |
| 1285 a->push(new ExpStatement(0, e)); | |
| 1286 } | |
| 1287 | |
| 1288 #endif // !IN_LLVM | |
| 1289 | |
| 1290 // Merge contracts together with body into one compound statement | |
| 1291 | |
| 1292 #ifdef _DH | |
| 1293 if (frequire && global.params.useIn) | |
| 1294 { frequire->incontract = 1; | |
| 1295 a->push(frequire); | |
| 1296 } | |
| 1297 #else | |
| 1298 if (frequire && global.params.useIn) | |
| 1299 a->push(frequire); | |
| 1300 #endif | |
| 1301 | |
| 1302 // Precondition invariant | |
| 1303 if (addPreInvariant()) | |
| 1304 { | |
| 1305 Expression *e = NULL; | |
| 1306 Expression *ee = NULL; | |
| 1307 if (isDtorDeclaration()) | |
| 1308 { | |
| 1309 // Call invariant directly only if it exists | |
| 1310 InvariantDeclaration *inv = ad->inv; | |
| 1311 ClassDeclaration *cd = ad->isClassDeclaration(); | |
| 1312 | |
| 1313 while (!inv && cd) | |
| 1314 { | |
| 1315 cd = cd->baseClass; | |
| 1316 if (!cd) | |
| 1317 break; | |
| 1318 inv = cd->inv; | |
| 1319 } | |
| 1320 if (inv) | |
| 1321 { | |
| 1322 e = new DsymbolExp(0, inv); | |
| 1323 e = new CallExp(0, e); | |
| 1324 e = e->semantic(sc2); | |
| 1325 } | |
| 1326 } | |
| 1327 else | |
| 1328 { // Call invariant virtually | |
| 1329 // LDC: unless this is a struct without invariant | |
| 1330 StructDeclaration* sd = ad->isStructDeclaration(); | |
| 1331 if (!sd || sd->inv) | |
| 1332 { | |
| 1333 ThisExp *v = new ThisExp(0); | |
| 1334 v->type = vthis->type; | |
| 1335 e = new AssertExp(loc, v, NULL); | |
| 1336 } | |
| 1337 | |
| 1338 // LDC: check for null this | |
| 1339 ThisExp* v = new ThisExp(0); | |
| 1340 v->type = vthis->type; | |
| 1341 #if STRUCTTHISREF | |
| 1342 if (ad->isStructDeclaration()) | |
| 1343 v = v->addressOf(sc); | |
| 1344 #endif | |
| 1345 v->var = vthis; | |
| 1346 | |
| 1347 NullExp *nv = new NullExp(0); | |
| 1348 nv->type = v->type; | |
| 1349 | |
| 1350 IdentityExp *ie = new IdentityExp(TOKnotidentity, 0, v, nv); | |
| 1351 ie->type = Type::tbool; | |
| 1352 | |
| 1353 Expression *se = new StringExp(0, (char *)"null this"); | |
| 1354 se = se->semantic(sc); | |
| 1355 se->type = Type::tchar->arrayOf(); | |
| 1356 | |
| 1357 ee = new AssertExp(loc, ie, se); | |
| 1358 } | |
| 1359 if (ee) | |
| 1360 { | |
| 1361 ExpStatement *s = new ExpStatement(0, ee); | |
| 1362 a->push(s); | |
| 1363 } | |
| 1364 if (e) | |
| 1365 { | |
| 1366 ExpStatement *s = new ExpStatement(0, e); | |
| 1367 a->push(s); | |
| 1368 } | |
| 1369 } | |
| 1370 | |
| 1371 if (fbody) | |
| 1372 a->push(fbody); | |
| 1373 | |
| 1374 if (fensure) | |
| 1375 { | |
| 1376 a->push(returnLabel->statement); | |
| 1377 | |
| 1378 if (type->nextOf()->ty != Tvoid) | |
| 1379 { | |
| 1380 // Create: return vresult; | |
| 1381 assert(vresult); | |
| 1382 Expression *e = new VarExp(0, vresult); | |
| 1383 if (tintro) | |
| 1384 { e = e->implicitCastTo(sc, tintro->nextOf()); | |
| 1385 e = e->semantic(sc); | |
| 1386 } | |
| 1387 ReturnStatement *s = new ReturnStatement(0, e); | |
| 1388 a->push(s); | |
| 1389 } | |
| 1390 } | |
| 1391 | |
| 1392 fbody = new CompoundStatement(0, a); | |
| 1393 #if DMDV2 | |
| 1394 /* Append destructor calls for parameters as finally blocks. | |
| 1395 */ | |
| 1396 if (parameters) | |
| 1397 { for (size_t i = 0; i < parameters->dim; i++) | |
| 1398 { | |
| 1399 VarDeclaration *v = (VarDeclaration *)parameters->data[i]; | |
| 1400 | |
| 1401 if (v->storage_class & (STCref | STCout)) | |
| 1402 continue; | |
| 1403 | |
| 1404 /* Don't do this for static arrays, since static | |
| 1405 * arrays are called by reference. Remove this | |
| 1406 * when we change them to call by value. | |
| 1407 */ | |
| 1408 if (v->type->toBasetype()->ty == Tsarray) | |
| 1409 continue; | |
| 1410 | |
| 1411 Expression *e = v->callAutoDtor(sc); | |
| 1412 if (e) | |
| 1413 { Statement *s = new ExpStatement(0, e); | |
| 1414 s = s->semantic(sc); | |
| 1415 if (fbody->blockExit() == BEfallthru) | |
| 1416 fbody = new CompoundStatement(0, fbody, s); | |
| 1417 else | |
| 1418 fbody = new TryFinallyStatement(0, fbody, s); | |
| 1419 } | |
| 1420 } | |
| 1421 } | |
| 1422 #endif | |
| 1423 | |
| 1424 // wrap body of synchronized functions in a synchronized statement | |
| 1425 if (isSynchronized()) | |
| 1426 { | |
| 1427 ClassDeclaration *cd = parent->isClassDeclaration(); | |
| 1428 if (!cd) | |
| 1429 error("synchronized function %s must be a member of a class", toChars()); | |
| 1430 | |
| 1431 Expression *sync; | |
| 1432 if (isStatic()) | |
| 1433 { | |
| 1434 // static member functions synchronize on classinfo | |
| 1435 sync = cd->type->dotExp(sc2, new TypeExp(loc, cd->type), Id::classinfo); | |
| 1436 } | |
| 1437 else | |
| 1438 { | |
| 1439 // non-static member functions synchronize on this | |
| 1440 sync = new VarExp(loc, vthis); | |
| 1441 } | |
| 1442 | |
| 1443 // we do not want to rerun semantics on the whole function, so we | |
| 1444 // manually adjust all labels in the function that currently don't | |
| 1445 // have an enclosingScopeExit to use the new SynchronizedStatement | |
| 1446 SynchronizedStatement* s = new SynchronizedStatement(loc, sync, NULL); | |
| 1447 s->semantic(sc2); | |
| 1448 s->body = fbody; | |
| 1449 | |
| 1450 // LDC | |
| 1451 LabelMap::iterator it, end = labmap.end(); | |
| 1452 for (it = labmap.begin(); it != end; ++it) | |
| 1453 if (it->second->enclosingScopeExit == NULL) | |
| 1454 it->second->enclosingScopeExit = s; | |
| 1455 | |
| 1456 a = new Statements; | |
| 1457 a->push(s); | |
| 1458 fbody = new CompoundStatement(0, a); | |
| 1459 } | |
| 1460 } | |
| 1461 | |
| 1462 sc2->callSuper = 0; | |
| 1463 sc2->pop(); | |
| 1464 } | |
| 1465 semanticRun = 4; | |
| 1466 } | |
| 1467 | |
| 1468 void FuncDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 1469 { | |
| 1470 //printf("FuncDeclaration::toCBuffer() '%s'\n", toChars()); | |
| 1471 | |
| 1472 type->toCBuffer(buf, ident, hgs); | |
| 1473 bodyToCBuffer(buf, hgs); | |
| 1474 } | |
| 1475 | |
| 1476 | |
| 1477 void FuncDeclaration::bodyToCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 1478 { | |
| 1479 if (fbody && | |
| 1480 (!hgs->hdrgen || hgs->tpltMember || canInline(1,1)) | |
| 1481 ) | |
| 1482 { buf->writenl(); | |
| 1483 | |
| 1484 // in{} | |
| 1485 if (frequire) | |
| 1486 { buf->writestring("in"); | |
| 1487 buf->writenl(); | |
| 1488 frequire->toCBuffer(buf, hgs); | |
| 1489 } | |
| 1490 | |
| 1491 // out{} | |
| 1492 if (fensure) | |
| 1493 { buf->writestring("out"); | |
| 1494 if (outId) | |
| 1495 { buf->writebyte('('); | |
| 1496 buf->writestring(outId->toChars()); | |
| 1497 buf->writebyte(')'); | |
| 1498 } | |
| 1499 buf->writenl(); | |
| 1500 fensure->toCBuffer(buf, hgs); | |
| 1501 } | |
| 1502 | |
| 1503 if (frequire || fensure) | |
| 1504 { buf->writestring("body"); | |
| 1505 buf->writenl(); | |
| 1506 } | |
| 1507 | |
| 1508 buf->writebyte('{'); | |
| 1509 buf->writenl(); | |
| 1510 fbody->toCBuffer(buf, hgs); | |
| 1511 buf->writebyte('}'); | |
| 1512 buf->writenl(); | |
| 1513 } | |
| 1514 else | |
| 1515 { buf->writeByte(';'); | |
| 1516 buf->writenl(); | |
| 1517 } | |
| 1518 } | |
| 1519 | |
| 1520 /**************************************************** | |
| 1521 * Merge into this function the 'in' contracts of all it overrides. | |
| 1522 * 'in's are OR'd together, i.e. only one of them needs to pass. | |
| 1523 */ | |
| 1524 | |
| 1525 Statement *FuncDeclaration::mergeFrequire(Statement *sf) | |
| 1526 { | |
| 1527 /* Implementing this is done by having the overriding function call | |
| 1528 * nested functions (the fdrequire functions) nested inside the overridden | |
| 1529 * function. This requires that the stack layout of the calling function's | |
| 1530 * parameters and 'this' pointer be in the same place (as the nested | |
| 1531 * function refers to them). | |
| 1532 * This is easy for the parameters, as they are all on the stack in the same | |
| 1533 * place by definition, since it's an overriding function. The problem is | |
| 1534 * getting the 'this' pointer in the same place, since it is a local variable. | |
| 1535 * We did some hacks in the code generator to make this happen: | |
| 1536 * 1. always generate exception handler frame, or at least leave space for it | |
| 1537 * in the frame (Windows 32 SEH only) | |
| 1538 * 2. always generate an EBP style frame | |
| 1539 * 3. since 'this' is passed in a register that is subsequently copied into | |
| 1540 * a stack local, allocate that local immediately following the exception | |
| 1541 * handler block, so it is always at the same offset from EBP. | |
| 1542 */ | |
| 1543 for (int i = 0; i < foverrides.dim; i++) | |
| 1544 { | |
| 1545 FuncDeclaration *fdv = (FuncDeclaration *)foverrides.data[i]; | |
| 1546 sf = fdv->mergeFrequire(sf); | |
| 1547 if (fdv->fdrequire) | |
| 1548 { | |
| 1549 //printf("fdv->frequire: %s\n", fdv->frequire->toChars()); | |
| 1550 /* Make the call: | |
| 1551 * try { __require(); } | |
| 1552 * catch { frequire; } | |
| 1553 */ | |
| 1554 Expression *eresult = NULL; | |
| 1555 Expression *e = new CallExp(loc, new VarExp(loc, fdv->fdrequire), eresult); | |
| 1556 Statement *s2 = new ExpStatement(loc, e); | |
| 1557 | |
| 1558 if (sf) | |
| 1559 { Catch *c = new Catch(loc, NULL, NULL, sf); | |
| 1560 Array *catches = new Array(); | |
| 1561 catches->push(c); | |
| 1562 sf = new TryCatchStatement(loc, s2, catches); | |
| 1563 } | |
| 1564 else | |
| 1565 sf = s2; | |
| 1566 } | |
| 1567 } | |
| 1568 return sf; | |
| 1569 } | |
| 1570 | |
| 1571 /**************************************************** | |
| 1572 * Merge into this function the 'out' contracts of all it overrides. | |
| 1573 * 'out's are AND'd together, i.e. all of them need to pass. | |
| 1574 */ | |
| 1575 | |
| 1576 Statement *FuncDeclaration::mergeFensure(Statement *sf) | |
| 1577 { | |
| 1578 /* Same comments as for mergeFrequire(), except that we take care | |
| 1579 * of generating a consistent reference to the 'result' local by | |
| 1580 * explicitly passing 'result' to the nested function as a reference | |
| 1581 * argument. | |
| 1582 * This won't work for the 'this' parameter as it would require changing | |
| 1583 * the semantic code for the nested function so that it looks on the parameter | |
| 1584 * list for the 'this' pointer, something that would need an unknown amount | |
| 1585 * of tweaking of various parts of the compiler that I'd rather leave alone. | |
| 1586 */ | |
| 1587 for (int i = 0; i < foverrides.dim; i++) | |
| 1588 { | |
| 1589 FuncDeclaration *fdv = (FuncDeclaration *)foverrides.data[i]; | |
| 1590 sf = fdv->mergeFensure(sf); | |
| 1591 if (fdv->fdensure) | |
| 1592 { | |
| 1593 //printf("fdv->fensure: %s\n", fdv->fensure->toChars()); | |
| 1594 // Make the call: __ensure(result) | |
| 1595 Expression *eresult = NULL; | |
| 1596 if (outId) | |
| 1597 eresult = new IdentifierExp(loc, outId); | |
| 1598 Expression *e = new CallExp(loc, new VarExp(loc, fdv->fdensure), eresult); | |
| 1599 Statement *s2 = new ExpStatement(loc, e); | |
| 1600 | |
| 1601 if (sf) | |
| 1602 { | |
| 1603 sf = new CompoundStatement(fensure->loc, s2, sf); | |
| 1604 } | |
| 1605 else | |
| 1606 sf = s2; | |
| 1607 } | |
| 1608 } | |
| 1609 return sf; | |
| 1610 } | |
| 1611 | |
| 1612 /**************************************************** | |
| 1613 * Determine if 'this' overrides fd. | |
| 1614 * Return !=0 if it does. | |
| 1615 */ | |
| 1616 | |
| 1617 int FuncDeclaration::overrides(FuncDeclaration *fd) | |
| 1618 { int result = 0; | |
| 1619 | |
| 1620 if (fd->ident == ident) | |
| 1621 { | |
| 1622 int cov = type->covariant(fd->type); | |
| 1623 if (cov) | |
| 1624 { ClassDeclaration *cd1 = toParent()->isClassDeclaration(); | |
| 1625 ClassDeclaration *cd2 = fd->toParent()->isClassDeclaration(); | |
| 1626 | |
| 1627 if (cd1 && cd2 && cd2->isBaseOf(cd1, NULL)) | |
| 1628 result = 1; | |
| 1629 } | |
| 1630 } | |
| 1631 return result; | |
| 1632 } | |
| 1633 | |
| 1634 /************************************************* | |
| 1635 * Find index of function in vtbl[0..dim] that | |
| 1636 * this function overrides. | |
| 1637 * Returns: | |
| 1638 * -1 didn't find one | |
| 1639 * -2 can't determine because of forward references | |
| 1640 */ | |
| 1641 | |
| 1642 int FuncDeclaration::findVtblIndex(Array *vtbl, int dim) | |
| 1643 { | |
| 1644 for (int vi = 0; vi < dim; vi++) | |
| 1645 { | |
| 1646 FuncDeclaration *fdv = ((Dsymbol *)vtbl->data[vi])->isFuncDeclaration(); | |
| 1647 if (fdv && fdv->ident == ident) | |
| 1648 { | |
| 1649 int cov = type->covariant(fdv->type); | |
| 1650 //printf("\tbaseclass cov = %d\n", cov); | |
| 1651 switch (cov) | |
| 1652 { | |
| 1653 case 0: // types are distinct | |
| 1654 break; | |
| 1655 | |
| 1656 case 1: | |
| 1657 return vi; | |
| 1658 | |
| 1659 case 2: | |
| 1660 //type->print(); | |
| 1661 //fdv->type->print(); | |
| 1662 //printf("%s %s\n", type->deco, fdv->type->deco); | |
| 1663 error("of type %s overrides but is not covariant with %s of type %s", | |
| 1664 type->toChars(), fdv->toPrettyChars(), fdv->type->toChars()); | |
| 1665 break; | |
| 1666 | |
| 1667 case 3: | |
| 1668 return -2; // forward references | |
| 1669 | |
| 1670 default: | |
| 1671 assert(0); | |
| 1672 } | |
| 1673 } | |
| 1674 } | |
| 1675 return -1; | |
| 1676 } | |
| 1677 | |
| 1678 /**************************************************** | |
| 1679 * Overload this FuncDeclaration with the new one f. | |
| 1680 * Return !=0 if successful; i.e. no conflict. | |
| 1681 */ | |
| 1682 | |
| 1683 int FuncDeclaration::overloadInsert(Dsymbol *s) | |
| 1684 { | |
| 1685 FuncDeclaration *f; | |
| 1686 AliasDeclaration *a; | |
| 1687 | |
| 1688 //printf("FuncDeclaration::overloadInsert(%s)\n", s->toChars()); | |
| 1689 a = s->isAliasDeclaration(); | |
| 1690 if (a) | |
| 1691 { | |
| 1692 if (overnext) | |
| 1693 return overnext->overloadInsert(a); | |
| 1694 if (!a->aliassym && a->type->ty != Tident && a->type->ty != Tinstance) | |
| 1695 { | |
| 1696 //printf("\ta = '%s'\n", a->type->toChars()); | |
| 1697 return FALSE; | |
| 1698 } | |
| 1699 overnext = a; | |
| 1700 //printf("\ttrue: no conflict\n"); | |
| 1701 return TRUE; | |
| 1702 } | |
| 1703 f = s->isFuncDeclaration(); | |
| 1704 if (!f) | |
| 1705 return FALSE; | |
| 1706 | |
| 1707 if (type && f->type && // can be NULL for overloaded constructors | |
| 1708 f->type->covariant(type) && | |
| 1709 !isFuncAliasDeclaration()) | |
| 1710 { | |
| 1711 //printf("\tfalse: conflict %s\n", kind()); | |
| 1712 return FALSE; | |
| 1713 } | |
| 1714 | |
| 1715 if (overnext) | |
| 1716 return overnext->overloadInsert(f); | |
| 1717 overnext = f; | |
| 1718 //printf("\ttrue: no conflict\n"); | |
| 1719 return TRUE; | |
| 1720 } | |
| 1721 | |
| 1722 /******************************************** | |
| 1723 * Find function in overload list that exactly matches t. | |
| 1724 */ | |
| 1725 | |
| 1726 /*************************************************** | |
| 1727 * Visit each overloaded function in turn, and call | |
| 1728 * (*fp)(param, f) on it. | |
| 1729 * Exit when no more, or (*fp)(param, f) returns 1. | |
| 1730 * Returns: | |
| 1731 * 0 continue | |
| 1732 * 1 done | |
| 1733 */ | |
| 1734 | |
| 1735 int overloadApply(Module* from, FuncDeclaration *fstart, | |
| 1736 int (*fp)(void *, FuncDeclaration *), | |
| 1737 void *param) | |
| 1738 { | |
| 1739 FuncDeclaration *f; | |
| 1740 Declaration *d; | |
| 1741 Declaration *next; | |
| 1742 | |
| 1743 for (d = fstart; d; d = next) | |
| 1744 { FuncAliasDeclaration *fa = d->isFuncAliasDeclaration(); | |
| 1745 | |
| 1746 if (fa) | |
| 1747 { | |
| 1748 if (fa->getModule() == from || fa->importprot != PROTprivate) | |
| 1749 if (overloadApply(from, fa->funcalias, fp, param)) | |
| 1750 return 1; | |
| 1751 next = fa->overnext; | |
| 1752 } | |
| 1753 else | |
| 1754 { | |
| 1755 AliasDeclaration *a = d->isAliasDeclaration(); | |
| 1756 | |
| 1757 if (a) | |
| 1758 { | |
| 1759 Dsymbol *s = a->toAlias(); | |
| 1760 next = s->isDeclaration(); | |
| 1761 if (next == a) | |
| 1762 break; | |
| 1763 if (next == fstart) | |
| 1764 break; | |
| 1765 if (a->importprot == PROTprivate && a->getModule() != from) | |
| 1766 if (FuncDeclaration* fd = next->isFuncDeclaration()) | |
| 1767 next = fd->overnext; | |
| 1768 } | |
| 1769 else | |
| 1770 { | |
| 1771 f = d->isFuncDeclaration(); | |
| 1772 if (!f) | |
| 1773 { d->error("is aliased to a function"); | |
| 1774 break; // BUG: should print error message? | |
| 1775 } | |
| 1776 if ((*fp)(param, f)) | |
| 1777 return 1; | |
| 1778 | |
| 1779 next = f->overnext; | |
| 1780 } | |
| 1781 } | |
| 1782 } | |
| 1783 return 0; | |
| 1784 } | |
| 1785 | |
| 1786 /******************************************** | |
| 1787 * If there are no overloads of function f, return that function, | |
| 1788 * otherwise return NULL. | |
| 1789 */ | |
| 1790 | |
| 1791 static int fpunique(void *param, FuncDeclaration *f) | |
| 1792 { FuncDeclaration **pf = (FuncDeclaration **)param; | |
| 1793 | |
| 1794 if (*pf) | |
| 1795 { *pf = NULL; | |
| 1796 return 1; // ambiguous, done | |
| 1797 } | |
| 1798 else | |
| 1799 { *pf = f; | |
| 1800 return 0; | |
| 1801 } | |
| 1802 } | |
| 1803 | |
| 1804 FuncDeclaration *FuncDeclaration::isUnique() | |
| 1805 { FuncDeclaration *result = NULL; | |
| 1806 | |
| 1807 overloadApply(getModule(), this, &fpunique, &result); | |
| 1808 return result; | |
| 1809 } | |
| 1810 | |
| 1811 /******************************************** | |
| 1812 * Find function in overload list that exactly matches t. | |
| 1813 */ | |
| 1814 | |
| 1815 struct Param1 | |
| 1816 { | |
| 1817 Type *t; // type to match | |
| 1818 FuncDeclaration *f; // return value | |
| 1819 }; | |
| 1820 | |
| 1821 int fp1(void *param, FuncDeclaration *f) | |
| 1822 { Param1 *p = (Param1 *)param; | |
| 1823 Type *t = p->t; | |
| 1824 | |
| 1825 if (t->equals(f->type)) | |
| 1826 { p->f = f; | |
| 1827 return 1; | |
| 1828 } | |
| 1829 | |
| 1830 #if DMDV2 | |
| 1831 /* Allow covariant matches, if it's just a const conversion | |
| 1832 * of the return type | |
| 1833 */ | |
| 1834 if (t->ty == Tfunction) | |
| 1835 { TypeFunction *tf = (TypeFunction *)f->type; | |
| 1836 if (tf->covariant(t) == 1 && | |
| 1837 tf->nextOf()->implicitConvTo(t->nextOf()) >= MATCHconst) | |
| 1838 { | |
| 1839 p->f = f; | |
| 1840 return 1; | |
| 1841 } | |
| 1842 } | |
| 1843 #endif | |
| 1844 return 0; | |
| 1845 } | |
| 1846 | |
| 1847 FuncDeclaration *FuncDeclaration::overloadExactMatch(Type *t, Module* from) | |
| 1848 { | |
| 1849 Param1 p; | |
| 1850 p.t = t; | |
| 1851 p.f = NULL; | |
| 1852 overloadApply(from, this, &fp1, &p); | |
| 1853 return p.f; | |
| 1854 } | |
| 1855 | |
| 1856 | |
| 1857 /******************************************** | |
| 1858 * Decide which function matches the arguments best. | |
| 1859 */ | |
| 1860 | |
| 1861 struct Param2 | |
| 1862 { | |
| 1863 Match *m; | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1864 #if DMDV2 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1865 Expression *ethis; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1866 #endif |
| 1587 | 1867 Expressions *arguments; |
| 1868 }; | |
| 1869 | |
| 1870 int fp2(void *param, FuncDeclaration *f) | |
| 1871 { Param2 *p = (Param2 *)param; | |
| 1872 Match *m = p->m; | |
| 1873 Expressions *arguments = p->arguments; | |
| 1874 MATCH match; | |
| 1875 | |
| 1876 if (f != m->lastf) // skip duplicates | |
| 1877 { | |
| 1878 m->anyf = f; | |
| 1879 TypeFunction *tf = (TypeFunction *)f->type; | |
| 1880 match = (MATCH) tf->callMatch(arguments); | |
| 1881 //printf("1match = %d\n", match); | |
| 1882 if (match != MATCHnomatch) | |
| 1883 { | |
| 1884 if (match > m->last) | |
| 1885 goto LfIsBetter; | |
| 1886 | |
| 1887 if (match < m->last) | |
| 1888 goto LlastIsBetter; | |
| 1889 | |
| 1890 /* See if one of the matches overrides the other. | |
| 1891 */ | |
| 1892 if (m->lastf->overrides(f)) | |
| 1893 goto LlastIsBetter; | |
| 1894 else if (f->overrides(m->lastf)) | |
| 1895 goto LfIsBetter; | |
| 1896 | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1897 #if DMDV2 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1898 /* Try to disambiguate using template-style partial ordering rules. |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1899 * In essence, if f() and g() are ambiguous, if f() can call g(), |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1900 * but g() cannot call f(), then pick f(). |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1901 * This is because f() is "more specialized." |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1902 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1903 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1904 MATCH c1 = f->leastAsSpecialized(m->lastf); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1905 MATCH c2 = m->lastf->leastAsSpecialized(f); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1906 //printf("c1 = %d, c2 = %d\n", c1, c2); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1907 if (c1 > c2) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1908 goto LfIsBetter; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1909 if (c1 < c2) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1910 goto LlastIsBetter; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1911 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
1912 #endif |
| 1587 | 1913 Lambiguous: |
| 1914 m->nextf = f; | |
| 1915 m->count++; | |
| 1916 return 0; | |
| 1917 | |
| 1918 LfIsBetter: | |
| 1919 m->last = match; | |
| 1920 m->lastf = f; | |
| 1921 m->count = 1; | |
| 1922 return 0; | |
| 1923 | |
| 1924 LlastIsBetter: | |
| 1925 return 0; | |
| 1926 } | |
| 1927 } | |
| 1928 return 0; | |
| 1929 } | |
| 1930 | |
| 1931 | |
| 1932 void overloadResolveX(Match *m, FuncDeclaration *fstart, | |
| 1933 Expression *ethis, Expressions *arguments, Module *from) | |
| 1934 { | |
| 1935 Param2 p; | |
| 1936 p.m = m; | |
| 1937 p.arguments = arguments; | |
| 1938 overloadApply(from, fstart, &fp2, &p); | |
| 1939 } | |
| 1940 | |
| 1941 | |
| 1942 FuncDeclaration *FuncDeclaration::overloadResolve(Loc loc, Expression *ethis, Expressions *arguments, Module *from, int flags) | |
| 1943 { | |
| 1944 TypeFunction *tf; | |
| 1945 Match m; | |
| 1946 | |
| 1947 #if 0 | |
| 1948 printf("FuncDeclaration::overloadResolve('%s')\n", toChars()); | |
| 1949 if (arguments) | |
| 1950 { int i; | |
| 1951 | |
| 1952 for (i = 0; i < arguments->dim; i++) | |
| 1953 { Expression *arg; | |
| 1954 | |
| 1955 arg = (Expression *)arguments->data[i]; | |
| 1956 assert(arg->type); | |
| 1957 printf("\t%s: ", arg->toChars()); | |
| 1958 arg->type->print(); | |
| 1959 } | |
| 1960 } | |
| 1961 #endif | |
| 1962 | |
| 1963 memset(&m, 0, sizeof(m)); | |
| 1964 m.last = MATCHnomatch; | |
| 1965 overloadResolveX(&m, this, NULL, arguments, from); | |
| 1966 | |
| 1967 if (m.count == 1) // exactly one match | |
| 1968 { | |
| 1969 return m.lastf; | |
| 1970 } | |
| 1971 else | |
| 1972 { | |
| 1973 OutBuffer buf; | |
| 1974 | |
| 1975 if (arguments) | |
| 1976 { | |
| 1977 HdrGenState hgs; | |
| 1978 | |
| 1979 argExpTypesToCBuffer(&buf, arguments, &hgs); | |
| 1980 } | |
| 1981 | |
| 1982 if (m.last == MATCHnomatch) | |
| 1983 { | |
| 1984 tf = (TypeFunction *)type; | |
| 1985 | |
| 1986 //printf("tf = %s, args = %s\n", tf->deco, ((Expression *)arguments->data[0])->type->deco); | |
| 1987 error(loc, "%s does not match parameter types (%s)", | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
1988 Parameter::argsTypesToChars(tf->parameters, tf->varargs), |
| 1587 | 1989 buf.toChars()); |
| 1990 return m.anyf; // as long as it's not a FuncAliasDeclaration | |
| 1991 } | |
| 1992 else | |
| 1993 { | |
| 1994 #if 1 | |
| 1995 TypeFunction *t1 = (TypeFunction *)m.lastf->type; | |
| 1996 TypeFunction *t2 = (TypeFunction *)m.nextf->type; | |
| 1997 | |
| 1998 error(loc, "called with argument types:\n\t(%s)\nmatches both:\n\t%s%s\nand:\n\t%s%s", | |
| 1999 buf.toChars(), | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2000 m.lastf->toPrettyChars(), Parameter::argsTypesToChars(t1->parameters, t1->varargs), |
|
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2001 m.nextf->toPrettyChars(), Parameter::argsTypesToChars(t2->parameters, t2->varargs)); |
| 1587 | 2002 #else |
| 2003 error(loc, "overloads %s and %s both match argument list for %s", | |
| 2004 m.lastf->type->toChars(), | |
| 2005 m.nextf->type->toChars(), | |
| 2006 m.lastf->toChars()); | |
| 2007 #endif | |
| 2008 return m.lastf; | |
| 2009 } | |
| 2010 } | |
| 2011 } | |
| 2012 | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2013 /************************************* |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2014 * Determine partial specialization order of 'this' vs g. |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2015 * This is very similar to TemplateDeclaration::leastAsSpecialized(). |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2016 * Returns: |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2017 * match 'this' is at least as specialized as g |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2018 * 0 g is more specialized than 'this' |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2019 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2020 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2021 #if DMDV2 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2022 MATCH FuncDeclaration::leastAsSpecialized(FuncDeclaration *g) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2023 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2024 #define LOG_LEASTAS 0 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2025 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2026 #if LOG_LEASTAS |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2027 printf("%s.leastAsSpecialized(%s)\n", toChars(), g->toChars()); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2028 #endif |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2029 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2030 /* This works by calling g() with f()'s parameters, and |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2031 * if that is possible, then f() is at least as specialized |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2032 * as g() is. |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2033 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2034 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2035 TypeFunction *tf = (TypeFunction *)type; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2036 TypeFunction *tg = (TypeFunction *)g->type; |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2037 size_t nfparams = Parameter::dim(tf->parameters); |
|
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2038 size_t ngparams = Parameter::dim(tg->parameters); |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2039 MATCH match = MATCHexact; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2040 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2041 /* If both functions have a 'this' pointer, and the mods are not |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2042 * the same and g's is not const, then this is less specialized. |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2043 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2044 if (needThis() && g->needThis()) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2045 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2046 if (tf->mod != tg->mod) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2047 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2048 if (tg->mod == MODconst) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2049 match = MATCHconst; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2050 else |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2051 return MATCHnomatch; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2052 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2053 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2054 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2055 /* Create a dummy array of arguments out of the parameters to f() |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2056 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2057 Expressions args; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2058 args.setDim(nfparams); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2059 for (int u = 0; u < nfparams; u++) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2060 { |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2061 Parameter *p = Parameter::getNth(tf->parameters, u); |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2062 Expression *e; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2063 if (p->storageClass & (STCref | STCout)) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2064 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2065 e = new IdentifierExp(0, p->ident); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2066 e->type = p->type; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2067 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2068 else |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2069 e = p->type->defaultInit(); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2070 args.data[u] = e; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2071 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2072 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2073 MATCH m = (MATCH) tg->callMatch(NULL, &args); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2074 if (m) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2075 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2076 /* A variadic parameter list is less specialized than a |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2077 * non-variadic one. |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2078 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2079 if (tf->varargs && !tg->varargs) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2080 goto L1; // less specialized |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2081 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2082 #if LOG_LEASTAS |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2083 printf(" matches %d, so is least as specialized\n", m); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2084 #endif |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2085 return m; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2086 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2087 L1: |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2088 #if LOG_LEASTAS |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2089 printf(" doesn't match, so is not as specialized\n"); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2090 #endif |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2091 return MATCHnomatch; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2092 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2093 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2094 /******************************************* |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2095 * Given a symbol that could be either a FuncDeclaration or |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2096 * a function template, resolve it to a function symbol. |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2097 * sc instantiation scope |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2098 * loc instantiation location |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2099 * targsi initial list of template arguments |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2100 * ethis if !NULL, the 'this' pointer argument |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2101 * fargs arguments to function |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2102 * flags 1: do not issue error message on no match, just return NULL |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2103 */ |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2104 |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2105 FuncDeclaration *resolveFuncCall(Scope *sc, Loc loc, Dsymbol *s, |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2106 Objects *tiargs, |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2107 Expression *ethis, |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2108 Expressions *arguments, |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2109 int flags) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2110 { |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2111 if (!s) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2112 return NULL; // no match |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2113 FuncDeclaration *f = s->isFuncDeclaration(); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2114 if (f) |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2115 f = f->overloadResolve(loc, ethis, arguments); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2116 else |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2117 { TemplateDeclaration *td = s->isTemplateDeclaration(); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2118 assert(td); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2119 f = td->deduceFunctionTemplate(sc, loc, tiargs, NULL, arguments, flags); |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2120 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2121 return f; |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2122 } |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2123 #endif |
|
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2124 |
| 1587 | 2125 /******************************** |
| 2126 * Labels are in a separate scope, one per function. | |
| 2127 */ | |
| 2128 | |
| 2129 LabelDsymbol *FuncDeclaration::searchLabel(Identifier *ident) | |
| 2130 { Dsymbol *s; | |
| 2131 | |
| 2132 if (!labtab) | |
| 2133 labtab = new DsymbolTable(); // guess we need one | |
| 2134 | |
| 2135 s = labtab->lookup(ident); | |
| 2136 if (!s) | |
| 2137 { | |
| 2138 s = new LabelDsymbol(ident); | |
| 2139 labtab->insert(s); | |
| 2140 } | |
| 2141 return (LabelDsymbol *)s; | |
| 2142 } | |
| 2143 | |
| 2144 /**************************************** | |
| 2145 * If non-static member function that has a 'this' pointer, | |
| 2146 * return the aggregate it is a member of. | |
| 2147 * Otherwise, return NULL. | |
| 2148 */ | |
| 2149 | |
| 2150 AggregateDeclaration *FuncDeclaration::isThis() | |
| 2151 { AggregateDeclaration *ad; | |
| 2152 | |
| 2153 //printf("+FuncDeclaration::isThis() '%s'\n", toChars()); | |
| 2154 ad = NULL; | |
| 2155 if ((storage_class & STCstatic) == 0) | |
| 2156 { | |
| 2157 ad = isMember2(); | |
| 2158 } | |
| 2159 //printf("-FuncDeclaration::isThis() %p\n", ad); | |
| 2160 return ad; | |
| 2161 } | |
| 2162 | |
| 2163 AggregateDeclaration *FuncDeclaration::isMember2() | |
| 2164 { AggregateDeclaration *ad; | |
| 2165 | |
| 2166 //printf("+FuncDeclaration::isMember2() '%s'\n", toChars()); | |
| 2167 ad = NULL; | |
| 2168 for (Dsymbol *s = this; s; s = s->parent) | |
| 2169 { | |
| 2170 //printf("\ts = '%s', parent = '%s', kind = %s\n", s->toChars(), s->parent->toChars(), s->parent->kind()); | |
| 2171 ad = s->isMember(); | |
| 2172 if (ad) | |
| 2173 { //printf("test4\n"); | |
| 2174 break; | |
| 2175 } | |
| 2176 if (!s->parent || | |
| 2177 (!s->parent->isTemplateInstance())) | |
| 2178 { //printf("test5\n"); | |
| 2179 break; | |
| 2180 } | |
| 2181 } | |
| 2182 //printf("-FuncDeclaration::isMember2() %p\n", ad); | |
| 2183 return ad; | |
| 2184 } | |
| 2185 | |
| 2186 /***************************************** | |
| 2187 * Determine lexical level difference from 'this' to nested function 'fd'. | |
| 2188 * Error if this cannot call fd. | |
| 2189 * Returns: | |
| 2190 * 0 same level | |
| 2191 * -1 increase nesting by 1 (fd is nested within 'this') | |
| 2192 * >0 decrease nesting by number | |
| 2193 */ | |
| 2194 | |
| 2195 int FuncDeclaration::getLevel(Loc loc, FuncDeclaration *fd) | |
| 2196 { int level; | |
| 2197 Dsymbol *s; | |
| 2198 Dsymbol *fdparent; | |
| 2199 | |
| 2200 //printf("FuncDeclaration::getLevel(fd = '%s')\n", fd->toChars()); | |
| 2201 fdparent = fd->toParent2(); | |
| 2202 if (fdparent == this) | |
| 2203 return -1; | |
| 2204 s = this; | |
| 2205 level = 0; | |
| 2206 while (fd != s && fdparent != s->toParent2()) | |
| 2207 { | |
| 2208 //printf("\ts = '%s'\n", s->toChars()); | |
| 2209 FuncDeclaration *thisfd = s->isFuncDeclaration(); | |
| 2210 if (thisfd) | |
| 2211 { if (!thisfd->isNested() && !thisfd->vthis) | |
| 2212 goto Lerr; | |
| 2213 } | |
| 2214 else | |
| 2215 { | |
| 2216 ClassDeclaration *thiscd = s->isClassDeclaration(); | |
| 2217 if (thiscd) | |
| 2218 { if (!thiscd->isNested()) | |
| 2219 goto Lerr; | |
| 2220 } | |
| 2221 else | |
| 2222 goto Lerr; | |
| 2223 } | |
| 2224 | |
| 2225 s = s->toParent2(); | |
| 2226 assert(s); | |
| 2227 level++; | |
| 2228 } | |
| 2229 return level; | |
| 2230 | |
| 2231 Lerr: | |
| 2232 error(loc, "cannot access frame of function %s", fd->toChars()); | |
| 2233 return 1; | |
| 2234 } | |
| 2235 | |
| 2236 void FuncDeclaration::appendExp(Expression *e) | |
| 2237 { Statement *s; | |
| 2238 | |
| 2239 s = new ExpStatement(0, e); | |
| 2240 appendState(s); | |
| 2241 } | |
| 2242 | |
| 2243 void FuncDeclaration::appendState(Statement *s) | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2244 { |
| 1587 | 2245 if (!fbody) |
| 2246 { Statements *a; | |
| 2247 | |
| 2248 a = new Statements(); | |
| 2249 fbody = new CompoundStatement(0, a); | |
| 2250 } | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2251 CompoundStatement *cs = fbody->isCompoundStatement(); |
| 1587 | 2252 cs->statements->push(s); |
| 2253 } | |
| 2254 | |
| 2255 const char *FuncDeclaration::toPrettyChars() | |
| 2256 { | |
| 2257 if (isMain()) | |
| 2258 return "D main"; | |
| 2259 else | |
| 2260 return Dsymbol::toPrettyChars(); | |
| 2261 } | |
| 2262 | |
| 2263 int FuncDeclaration::isMain() | |
| 2264 { | |
| 2265 return ident == Id::main && | |
| 2266 linkage != LINKc && !isMember() && !isNested(); | |
| 2267 } | |
| 2268 | |
| 2269 int FuncDeclaration::isWinMain() | |
| 2270 { | |
| 2271 //printf("FuncDeclaration::isWinMain() %s\n", toChars()); | |
| 2272 #if 0 | |
| 2273 int x = ident == Id::WinMain && | |
| 2274 linkage != LINKc && !isMember(); | |
| 2275 printf("%s\n", x ? "yes" : "no"); | |
| 2276 return x; | |
| 2277 #else | |
| 2278 return ident == Id::WinMain && | |
| 2279 linkage != LINKc && !isMember(); | |
| 2280 #endif | |
| 2281 } | |
| 2282 | |
| 2283 int FuncDeclaration::isDllMain() | |
| 2284 { | |
| 2285 return ident == Id::DllMain && | |
| 2286 linkage != LINKc && !isMember(); | |
| 2287 } | |
| 2288 | |
| 2289 int FuncDeclaration::isExport() | |
| 2290 { | |
| 2291 return protection == PROTexport; | |
| 2292 } | |
| 2293 | |
| 2294 int FuncDeclaration::isImportedSymbol() | |
| 2295 { | |
| 2296 //printf("isImportedSymbol()\n"); | |
| 2297 //printf("protection = %d\n", protection); | |
| 2298 return (protection == PROTexport) && !fbody; | |
| 2299 } | |
| 2300 | |
| 2301 // Determine if function goes into virtual function pointer table | |
| 2302 | |
| 2303 int FuncDeclaration::isVirtual() | |
| 2304 { | |
| 2305 #if 0 | |
| 2306 printf("FuncDeclaration::isVirtual(%s)\n", toChars()); | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2307 printf("isMember:%p isStatic:%d private:%d ctor:%d !Dlinkage:%d\n", isMember(), isStatic(), protection == PROTprivate, isCtorDeclaration(), linkage != LINKd); |
| 1587 | 2308 printf("result is %d\n", |
| 2309 isMember() && | |
| 2310 !(isStatic() || protection == PROTprivate || protection == PROTpackage) && | |
| 2311 toParent()->isClassDeclaration()); | |
| 2312 #endif | |
| 2313 return isMember() && | |
| 2314 !(isStatic() || protection == PROTprivate || protection == PROTpackage) && | |
| 2315 toParent()->isClassDeclaration(); | |
| 2316 } | |
| 2317 | |
| 2318 int FuncDeclaration::isFinal() | |
| 2319 { | |
| 2320 ClassDeclaration *cd; | |
| 2321 #if 0 | |
| 2322 printf("FuncDeclaration::isFinal(%s)\n", toChars()); | |
| 2323 printf("%p %d %d %d %d\n", isMember(), isStatic(), protection == PROTprivate, isCtorDeclaration(), linkage != LINKd); | |
| 2324 printf("result is %d\n", | |
| 2325 isMember() && | |
| 2326 !(isStatic() || protection == PROTprivate || protection == PROTpackage) && | |
| 2327 (cd = toParent()->isClassDeclaration()) != NULL && | |
| 2328 cd->storage_class & STCfinal); | |
| 2329 #endif | |
| 2330 return isMember() && | |
| 2331 (Declaration::isFinal() || | |
| 2332 ((cd = toParent()->isClassDeclaration()) != NULL && cd->storage_class & STCfinal)); | |
| 2333 } | |
| 2334 | |
| 2335 int FuncDeclaration::isAbstract() | |
| 2336 { | |
| 2337 return storage_class & STCabstract; | |
| 2338 } | |
| 2339 | |
| 2340 int FuncDeclaration::isCodeseg() | |
| 2341 { | |
| 2342 return TRUE; // functions are always in the code segment | |
| 2343 } | |
| 2344 | |
| 2345 // Determine if function needs | |
| 2346 // a static frame pointer to its lexically enclosing function | |
| 2347 | |
| 2348 int FuncDeclaration::isNested() | |
| 2349 { | |
| 2350 //if (!toParent()) | |
| 2351 //printf("FuncDeclaration::isNested('%s') parent=%p\n", toChars(), parent); | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
2352 //printf("\ttoParent2() = '%s'\n", toParent2()->toChars()); |
| 1587 | 2353 return ((storage_class & STCstatic) == 0) && toParent2() && |
| 2354 (toParent2()->isFuncDeclaration() != NULL); | |
| 2355 } | |
| 2356 | |
| 2357 int FuncDeclaration::needThis() | |
| 2358 { | |
| 2359 //printf("FuncDeclaration::needThis() '%s'\n", toChars()); | |
| 2360 int i = isThis() != NULL; | |
| 2361 //printf("\t%d\n", i); | |
| 2362 if (!i && isFuncAliasDeclaration()) | |
| 2363 i = ((FuncAliasDeclaration *)this)->funcalias->needThis(); | |
| 2364 return i; | |
| 2365 } | |
| 2366 | |
| 2367 int FuncDeclaration::addPreInvariant() | |
| 2368 { | |
| 2369 AggregateDeclaration *ad = isThis(); | |
| 2370 return (ad && | |
| 2371 //ad->isClassDeclaration() && | |
| 2372 global.params.useInvariants && | |
| 2373 (protection == PROTpublic || protection == PROTexport) && | |
| 2374 !naked); | |
| 2375 } | |
| 2376 | |
| 2377 int FuncDeclaration::addPostInvariant() | |
| 2378 { | |
| 2379 AggregateDeclaration *ad = isThis(); | |
| 2380 return (ad && | |
| 2381 ad->inv && | |
| 2382 //ad->isClassDeclaration() && | |
| 2383 global.params.useInvariants && | |
| 2384 (protection == PROTpublic || protection == PROTexport) && | |
| 2385 !naked); | |
| 2386 } | |
| 2387 | |
| 2388 /********************************** | |
| 2389 * Generate a FuncDeclaration for a runtime library function. | |
| 2390 */ | |
| 2391 | |
| 2392 // | |
| 2393 // LDC: Adjusted to give argument info to the runtime function decl. | |
| 2394 // | |
| 2395 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2396 FuncDeclaration *FuncDeclaration::genCfunc(Parameters *args, Type *treturn, const char *name) |
| 1587 | 2397 { |
| 2398 return genCfunc(args, treturn, Lexer::idPool(name)); | |
| 2399 } | |
| 2400 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2401 FuncDeclaration *FuncDeclaration::genCfunc(Parameters *args, Type *treturn, Identifier *id) |
| 1587 | 2402 { |
| 2403 FuncDeclaration *fd; | |
| 2404 TypeFunction *tf; | |
| 2405 Dsymbol *s; | |
| 2406 static DsymbolTable *st = NULL; | |
| 2407 | |
| 2408 //printf("genCfunc(name = '%s')\n", id->toChars()); | |
| 2409 //printf("treturn\n\t"); treturn->print(); | |
| 2410 | |
| 2411 // See if already in table | |
| 2412 if (!st) | |
| 2413 st = new DsymbolTable(); | |
| 2414 s = st->lookup(id); | |
| 2415 if (s) | |
| 2416 { | |
| 2417 fd = s->isFuncDeclaration(); | |
| 2418 assert(fd); | |
| 2419 assert(fd->type->nextOf()->equals(treturn)); | |
| 2420 } | |
| 2421 else | |
| 2422 { | |
| 2423 tf = new TypeFunction(args, treturn, 0, LINKc); | |
| 2424 fd = new FuncDeclaration(0, 0, id, STCstatic, tf); | |
| 2425 fd->protection = PROTpublic; | |
| 2426 fd->linkage = LINKc; | |
| 2427 | |
| 2428 st->insert(fd); | |
| 2429 } | |
| 2430 return fd; | |
| 2431 } | |
| 2432 | |
| 2433 const char *FuncDeclaration::kind() | |
| 2434 { | |
| 2435 return "function"; | |
| 2436 } | |
| 2437 | |
| 2438 /******************************* | |
| 2439 * Look at all the variables in this function that are referenced | |
| 2440 * by nested functions, and determine if a closure needs to be | |
| 2441 * created for them. | |
| 2442 */ | |
| 2443 | |
| 2444 #if DMDV2 | |
| 2445 int FuncDeclaration::needsClosure() | |
| 2446 { | |
| 2447 /* Need a closure for all the closureVars[] if any of the | |
| 2448 * closureVars[] are accessed by a | |
| 2449 * function that escapes the scope of this function. | |
| 2450 * We take the conservative approach and decide that any function that: | |
| 2451 * 1) is a virtual function | |
| 2452 * 2) has its address taken | |
| 2453 * 3) has a parent that escapes | |
| 2454 * | |
| 2455 * Note that since a non-virtual function can be called by | |
| 2456 * a virtual one, if that non-virtual function accesses a closure | |
| 2457 * var, the closure still has to be taken. Hence, we check for isThis() | |
| 2458 * instead of isVirtual(). (thanks to David Friedman) | |
| 2459 */ | |
| 2460 | |
| 2461 //printf("FuncDeclaration::needsClosure() %s\n", toChars()); | |
| 2462 for (int i = 0; i < closureVars.dim; i++) | |
| 2463 { VarDeclaration *v = (VarDeclaration *)closureVars.data[i]; | |
| 2464 assert(v->isVarDeclaration()); | |
| 2465 //printf("\tv = %s\n", v->toChars()); | |
| 2466 | |
| 2467 for (int j = 0; j < v->nestedrefs.dim; j++) | |
| 2468 { FuncDeclaration *f = (FuncDeclaration *)v->nestedrefs.data[j]; | |
| 2469 assert(f != this); | |
| 2470 | |
| 2471 //printf("\t\tf = %s, %d, %d\n", f->toChars(), f->isVirtual(), f->tookAddressOf); | |
| 2472 if (f->isThis() || f->tookAddressOf) | |
| 2473 goto Lyes; // assume f escapes this function's scope | |
| 2474 | |
| 2475 // Look to see if any parents of f that are below this escape | |
| 2476 for (Dsymbol *s = f->parent; s && s != this; s = s->parent) | |
| 2477 { | |
| 2478 f = s->isFuncDeclaration(); | |
| 2479 if (f && (f->isThis() || f->tookAddressOf)) | |
| 2480 goto Lyes; | |
| 2481 } | |
| 2482 } | |
| 2483 } | |
| 2484 return 0; | |
| 2485 | |
| 2486 Lyes: | |
| 2487 //printf("\tneeds closure\n"); | |
| 2488 return 1; | |
| 2489 } | |
| 2490 #endif | |
| 2491 | |
| 2492 /****************************** FuncAliasDeclaration ************************/ | |
| 2493 | |
| 2494 // Used as a way to import a set of functions from another scope into this one. | |
| 2495 | |
| 2496 FuncAliasDeclaration::FuncAliasDeclaration(FuncDeclaration *funcalias) | |
| 2497 : FuncDeclaration(funcalias->loc, funcalias->endloc, funcalias->ident, | |
| 2498 (enum STC)funcalias->storage_class, funcalias->type) | |
| 2499 { | |
| 2500 assert(funcalias != this); | |
| 2501 this->funcalias = funcalias; | |
| 2502 importprot = PROTundefined; | |
| 2503 } | |
| 2504 | |
| 2505 const char *FuncAliasDeclaration::kind() | |
| 2506 { | |
| 2507 return "function alias"; | |
| 2508 } | |
| 2509 | |
| 2510 | |
| 2511 /****************************** FuncLiteralDeclaration ************************/ | |
| 2512 | |
| 2513 FuncLiteralDeclaration::FuncLiteralDeclaration(Loc loc, Loc endloc, Type *type, | |
| 2514 enum TOK tok, ForeachStatement *fes) | |
| 2515 : FuncDeclaration(loc, endloc, NULL, STCundefined, type) | |
| 2516 { | |
| 2517 const char *id; | |
| 2518 | |
| 2519 if (fes) | |
| 2520 id = "__foreachbody"; | |
| 2521 else if (tok == TOKdelegate) | |
| 2522 id = "__dgliteral"; | |
| 2523 else | |
| 2524 id = "__funcliteral"; | |
| 2525 this->ident = Identifier::generateId(id); | |
| 2526 this->tok = tok; | |
| 2527 this->fes = fes; | |
| 2528 //printf("FuncLiteralDeclaration() id = '%s', type = '%s'\n", this->ident->toChars(), type->toChars()); | |
| 2529 } | |
| 2530 | |
| 2531 Dsymbol *FuncLiteralDeclaration::syntaxCopy(Dsymbol *s) | |
| 2532 { | |
| 2533 FuncLiteralDeclaration *f; | |
| 2534 | |
| 2535 //printf("FuncLiteralDeclaration::syntaxCopy('%s')\n", toChars()); | |
| 2536 if (s) | |
| 2537 f = (FuncLiteralDeclaration *)s; | |
| 2538 else | |
| 2539 f = new FuncLiteralDeclaration(loc, endloc, type->syntaxCopy(), tok, fes); | |
| 2540 FuncDeclaration::syntaxCopy(f); | |
| 2541 return f; | |
| 2542 } | |
| 2543 | |
| 2544 int FuncLiteralDeclaration::isNested() | |
| 2545 { | |
| 2546 //printf("FuncLiteralDeclaration::isNested() '%s'\n", toChars()); | |
| 2547 return (tok == TOKdelegate); | |
| 2548 } | |
| 2549 | |
| 2550 int FuncLiteralDeclaration::isVirtual() | |
| 2551 { | |
| 2552 return FALSE; | |
| 2553 } | |
| 2554 | |
| 2555 const char *FuncLiteralDeclaration::kind() | |
| 2556 { | |
| 2557 // GCC requires the (char*) casts | |
| 2558 return (tok == TOKdelegate) ? (char*)"delegate" : (char*)"function"; | |
| 2559 } | |
| 2560 | |
| 2561 void FuncLiteralDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2562 { | |
| 2563 static Identifier *idfunc; | |
| 2564 static Identifier *iddel; | |
| 2565 | |
| 2566 if (!idfunc) | |
| 2567 idfunc = new Identifier("function", 0); | |
| 2568 if (!iddel) | |
| 2569 iddel = new Identifier("delegate", 0); | |
| 2570 | |
| 2571 type->toCBuffer(buf, ((tok == TOKdelegate) ? iddel : idfunc), hgs); | |
| 2572 bodyToCBuffer(buf, hgs); | |
| 2573 } | |
| 2574 | |
| 2575 | |
| 2576 /********************************* CtorDeclaration ****************************/ | |
| 2577 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2578 CtorDeclaration::CtorDeclaration(Loc loc, Loc endloc, Parameters *arguments, int varargs) |
| 1587 | 2579 : FuncDeclaration(loc, endloc, Id::ctor, STCundefined, NULL) |
| 2580 { | |
| 2581 this->arguments = arguments; | |
| 2582 this->varargs = varargs; | |
| 2583 //printf("CtorDeclaration(loc = %s) %s\n", loc.toChars(), toChars()); | |
| 2584 } | |
| 2585 | |
| 2586 Dsymbol *CtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2587 { | |
| 2588 CtorDeclaration *f; | |
| 2589 | |
| 2590 f = new CtorDeclaration(loc, endloc, NULL, varargs); | |
| 2591 | |
| 2592 f->outId = outId; | |
| 2593 f->frequire = frequire ? frequire->syntaxCopy() : NULL; | |
| 2594 f->fensure = fensure ? fensure->syntaxCopy() : NULL; | |
| 2595 f->fbody = fbody ? fbody->syntaxCopy() : NULL; | |
| 2596 assert(!fthrows); // deprecated | |
| 2597 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2598 f->arguments = Parameter::arraySyntaxCopy(arguments); |
| 1587 | 2599 return f; |
| 2600 } | |
| 2601 | |
| 2602 | |
| 2603 void CtorDeclaration::semantic(Scope *sc) | |
| 2604 { | |
| 2605 ClassDeclaration *cd; | |
| 2606 Type *tret; | |
| 2607 | |
| 2608 //printf("CtorDeclaration::semantic()\n"); | |
| 2609 if (type) | |
| 2610 return; | |
| 2611 | |
| 2612 sc = sc->push(); | |
| 2613 sc->stc &= ~STCstatic; // not a static constructor | |
| 2614 | |
| 2615 parent = sc->parent; | |
| 2616 Dsymbol *parent = toParent(); | |
| 2617 cd = parent->isClassDeclaration(); | |
| 2618 if (!cd) | |
| 2619 { | |
| 2620 error("constructors are only for class definitions"); | |
| 2621 fatal(); | |
| 2622 tret = Type::tvoid; | |
| 2623 } | |
| 2624 else | |
| 2625 tret = cd->type; //->referenceTo(); | |
| 2626 type = new TypeFunction(arguments, tret, varargs, LINKd); | |
| 2627 #if STRUCTTHISREF | |
| 2628 if (ad && ad->isStructDeclaration()) | |
| 2629 ((TypeFunction *)type)->isref = 1; | |
| 2630 #endif | |
| 2631 if (!originalType) | |
| 2632 originalType = type; | |
| 2633 | |
| 2634 sc->flags |= SCOPEctor; | |
| 2635 type = type->semantic(loc, sc); | |
| 2636 sc->flags &= ~SCOPEctor; | |
| 2637 | |
| 2638 // Append: | |
| 2639 // return this; | |
| 2640 // to the function body | |
| 2641 if (fbody) | |
| 2642 { | |
| 2643 Expression *e = new ThisExp(loc); | |
| 2644 Statement *s = new ReturnStatement(loc, e); | |
| 2645 fbody = new CompoundStatement(loc, fbody, s); | |
| 2646 } | |
| 2647 | |
| 2648 FuncDeclaration::semantic(sc); | |
| 2649 | |
| 2650 sc->pop(); | |
| 2651 | |
| 2652 // See if it's the default constructor | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2653 if (cd && varargs == 0 && Parameter::dim(arguments) == 0) |
| 1587 | 2654 cd->defaultCtor = this; |
| 2655 } | |
| 2656 | |
| 2657 const char *CtorDeclaration::kind() | |
| 2658 { | |
| 2659 return "constructor"; | |
| 2660 } | |
| 2661 | |
| 2662 char *CtorDeclaration::toChars() | |
| 2663 { | |
| 2664 return (char *)"this"; | |
| 2665 } | |
| 2666 | |
| 2667 int CtorDeclaration::isVirtual() | |
| 2668 { | |
| 2669 return FALSE; | |
| 2670 } | |
| 2671 | |
| 2672 int CtorDeclaration::addPreInvariant() | |
| 2673 { | |
| 2674 return FALSE; | |
| 2675 } | |
| 2676 | |
| 2677 int CtorDeclaration::addPostInvariant() | |
| 2678 { | |
| 2679 return (isThis() && vthis && global.params.useInvariants); | |
| 2680 } | |
| 2681 | |
| 2682 | |
| 2683 void CtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2684 { | |
| 2685 buf->writestring("this"); | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
2686 Parameter::argsToCBuffer(buf, hgs, arguments, varargs); |
| 1587 | 2687 bodyToCBuffer(buf, hgs); |
| 2688 } | |
| 2689 | |
| 2690 /********************************* PostBlitDeclaration ****************************/ | |
| 2691 | |
| 2692 #if DMDV2 | |
| 2693 PostBlitDeclaration::PostBlitDeclaration(Loc loc, Loc endloc) | |
| 2694 : FuncDeclaration(loc, endloc, Id::_postblit, STCundefined, NULL) | |
| 2695 { | |
| 2696 } | |
| 2697 | |
| 2698 PostBlitDeclaration::PostBlitDeclaration(Loc loc, Loc endloc, Identifier *id) | |
| 2699 : FuncDeclaration(loc, endloc, id, STCundefined, NULL) | |
| 2700 { | |
| 2701 } | |
| 2702 | |
| 2703 Dsymbol *PostBlitDeclaration::syntaxCopy(Dsymbol *s) | |
| 2704 { | |
| 2705 assert(!s); | |
| 2706 PostBlitDeclaration *dd = new PostBlitDeclaration(loc, endloc, ident); | |
| 2707 return FuncDeclaration::syntaxCopy(dd); | |
| 2708 } | |
| 2709 | |
| 2710 | |
| 2711 void PostBlitDeclaration::semantic(Scope *sc) | |
| 2712 { | |
| 2713 //printf("PostBlitDeclaration::semantic() %s\n", toChars()); | |
| 2714 //printf("ident: %s, %s, %p, %p\n", ident->toChars(), Id::dtor->toChars(), ident, Id::dtor); | |
| 2715 parent = sc->parent; | |
| 2716 Dsymbol *parent = toParent(); | |
| 2717 StructDeclaration *ad = parent->isStructDeclaration(); | |
| 2718 if (!ad) | |
| 2719 { | |
| 2720 error("post blits are only for struct/union definitions, not %s %s", parent->kind(), parent->toChars()); | |
| 2721 } | |
| 2722 else if (ident == Id::_postblit) | |
| 2723 ad->postblits.push(this); | |
| 2724 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2725 | |
| 2726 sc = sc->push(); | |
| 2727 sc->stc &= ~STCstatic; // not static | |
| 2728 sc->linkage = LINKd; | |
| 2729 | |
| 2730 FuncDeclaration::semantic(sc); | |
| 2731 | |
| 2732 sc->pop(); | |
| 2733 } | |
| 2734 | |
| 2735 int PostBlitDeclaration::overloadInsert(Dsymbol *s) | |
| 2736 { | |
| 2737 return FALSE; // cannot overload postblits | |
| 2738 } | |
| 2739 | |
| 2740 int PostBlitDeclaration::addPreInvariant() | |
| 2741 { | |
| 2742 return FALSE; | |
| 2743 } | |
| 2744 | |
| 2745 int PostBlitDeclaration::addPostInvariant() | |
| 2746 { | |
| 2747 return (isThis() && vthis && global.params.useInvariants); | |
| 2748 } | |
| 2749 | |
| 2750 int PostBlitDeclaration::isVirtual() | |
| 2751 { | |
| 2752 return FALSE; | |
| 2753 } | |
| 2754 | |
| 2755 void PostBlitDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2756 { | |
| 2757 if (hgs->hdrgen) | |
| 2758 return; | |
| 2759 buf->writestring("=this()"); | |
| 2760 bodyToCBuffer(buf, hgs); | |
| 2761 } | |
| 2762 #endif | |
| 2763 | |
| 2764 /********************************* DtorDeclaration ****************************/ | |
| 2765 | |
| 2766 DtorDeclaration::DtorDeclaration(Loc loc, Loc endloc) | |
| 2767 : FuncDeclaration(loc, endloc, Id::dtor, STCundefined, NULL) | |
| 2768 { | |
| 2769 } | |
| 2770 | |
| 2771 DtorDeclaration::DtorDeclaration(Loc loc, Loc endloc, Identifier *id) | |
| 2772 : FuncDeclaration(loc, endloc, id, STCundefined, NULL) | |
| 2773 { | |
| 2774 } | |
| 2775 | |
| 2776 Dsymbol *DtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2777 { | |
| 2778 assert(!s); | |
| 2779 DtorDeclaration *dd = new DtorDeclaration(loc, endloc, ident); | |
| 2780 return FuncDeclaration::syntaxCopy(dd); | |
| 2781 } | |
| 2782 | |
| 2783 | |
| 2784 void DtorDeclaration::semantic(Scope *sc) | |
| 2785 { | |
| 2786 //printf("DtorDeclaration::semantic() %s\n", toChars()); | |
| 2787 //printf("ident: %s, %s, %p, %p\n", ident->toChars(), Id::dtor->toChars(), ident, Id::dtor); | |
| 2788 parent = sc->parent; | |
| 2789 Dsymbol *parent = toParent(); | |
| 2790 ClassDeclaration *cd = parent->isClassDeclaration(); | |
| 2791 if (!cd) | |
| 2792 { | |
| 2793 error("destructors are only for class/struct/union definitions, not %s %s", parent->kind(), parent->toChars()); | |
| 2794 fatal(); | |
| 2795 } | |
| 2796 else | |
| 2797 cd->dtors.push(this); | |
| 2798 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2799 | |
| 2800 sc = sc->push(); | |
| 2801 sc->stc &= ~STCstatic; // not a static destructor | |
| 2802 sc->linkage = LINKd; | |
| 2803 | |
| 2804 FuncDeclaration::semantic(sc); | |
| 2805 | |
| 2806 sc->pop(); | |
| 2807 } | |
| 2808 | |
| 2809 int DtorDeclaration::overloadInsert(Dsymbol *s) | |
| 2810 { | |
| 2811 return FALSE; // cannot overload destructors | |
| 2812 } | |
| 2813 | |
| 2814 int DtorDeclaration::addPreInvariant() | |
| 2815 { | |
| 2816 return (isThis() && vthis && global.params.useInvariants); | |
| 2817 } | |
| 2818 | |
| 2819 int DtorDeclaration::addPostInvariant() | |
| 2820 { | |
| 2821 return FALSE; | |
| 2822 } | |
| 2823 | |
| 2824 const char *DtorDeclaration::kind() | |
| 2825 { | |
| 2826 return "destructor"; | |
| 2827 } | |
| 2828 | |
| 2829 char *DtorDeclaration::toChars() | |
| 2830 { | |
| 2831 return (char *)"~this"; | |
| 2832 } | |
| 2833 | |
| 2834 int DtorDeclaration::isVirtual() | |
| 2835 { | |
| 2836 /* This should be FALSE so that dtor's don't get put into the vtbl[], | |
| 2837 * but doing so will require recompiling everything. | |
| 2838 */ | |
| 2839 #if BREAKABI | |
| 2840 return FALSE; | |
| 2841 #else | |
| 2842 return FuncDeclaration::isVirtual(); | |
| 2843 #endif | |
| 2844 } | |
| 2845 | |
| 2846 void DtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2847 { | |
| 2848 if (hgs->hdrgen) | |
| 2849 return; | |
| 2850 buf->writestring("~this()"); | |
| 2851 bodyToCBuffer(buf, hgs); | |
| 2852 } | |
| 2853 | |
| 2854 /********************************* StaticCtorDeclaration ****************************/ | |
| 2855 | |
| 2856 StaticCtorDeclaration::StaticCtorDeclaration(Loc loc, Loc endloc) | |
| 2857 : FuncDeclaration(loc, endloc, | |
| 2858 Identifier::generateId("_staticCtor"), STCstatic, NULL) | |
| 2859 { | |
| 2860 } | |
| 2861 | |
| 2862 Dsymbol *StaticCtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2863 { | |
| 2864 StaticCtorDeclaration *scd; | |
| 2865 | |
| 2866 assert(!s); | |
| 2867 scd = new StaticCtorDeclaration(loc, endloc); | |
| 2868 return FuncDeclaration::syntaxCopy(scd); | |
| 2869 } | |
| 2870 | |
| 2871 | |
| 2872 void StaticCtorDeclaration::semantic(Scope *sc) | |
| 2873 { | |
| 2874 //printf("StaticCtorDeclaration::semantic()\n"); | |
| 2875 | |
| 2876 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2877 | |
| 2878 /* If the static ctor appears within a template instantiation, | |
| 2879 * it could get called multiple times by the module constructors | |
| 2880 * for different modules. Thus, protect it with a gate. | |
| 2881 */ | |
| 2882 if (inTemplateInstance()) | |
| 2883 { | |
| 2884 /* Add this prefix to the function: | |
| 2885 * static int gate; | |
| 2886 * if (++gate != 1) return; | |
| 2887 * Note that this is not thread safe; should not have threads | |
| 2888 * during static construction. | |
| 2889 */ | |
| 2890 Identifier *id = Lexer::idPool("__gate"); | |
| 2891 VarDeclaration *v = new VarDeclaration(0, Type::tint32, id, NULL); | |
| 2892 v->storage_class = STCstatic; | |
| 2893 Statements *sa = new Statements(); | |
| 2894 Statement *s = new DeclarationStatement(0, v); | |
| 2895 sa->push(s); | |
| 2896 Expression *e = new IdentifierExp(0, id); | |
| 2897 e = new AddAssignExp(0, e, new IntegerExp(1)); | |
| 2898 e = new EqualExp(TOKnotequal, 0, e, new IntegerExp(1)); | |
| 2899 s = new IfStatement(0, NULL, e, new ReturnStatement(0, NULL), NULL); | |
| 2900 sa->push(s); | |
| 2901 if (fbody) | |
| 2902 sa->push(fbody); | |
| 2903 fbody = new CompoundStatement(0, sa); | |
| 2904 } | |
| 2905 | |
| 2906 FuncDeclaration::semantic(sc); | |
| 2907 | |
| 2908 // We're going to need ModuleInfo | |
| 2909 Module *m = getModule(); | |
| 2910 if (!m) | |
| 2911 m = sc->module; | |
| 2912 if (m) | |
| 2913 { m->needmoduleinfo = 1; | |
| 2914 #ifdef IN_GCC | |
| 2915 m->strictlyneedmoduleinfo = 1; | |
| 2916 #endif | |
| 2917 } | |
| 2918 } | |
| 2919 | |
| 2920 AggregateDeclaration *StaticCtorDeclaration::isThis() | |
| 2921 { | |
| 2922 return NULL; | |
| 2923 } | |
| 2924 | |
| 2925 int StaticCtorDeclaration::isStaticConstructor() | |
| 2926 { | |
| 2927 return TRUE; | |
| 2928 } | |
| 2929 | |
| 2930 int StaticCtorDeclaration::isVirtual() | |
| 2931 { | |
| 2932 return FALSE; | |
| 2933 } | |
| 2934 | |
| 2935 int StaticCtorDeclaration::addPreInvariant() | |
| 2936 { | |
| 2937 return FALSE; | |
| 2938 } | |
| 2939 | |
| 2940 int StaticCtorDeclaration::addPostInvariant() | |
| 2941 { | |
| 2942 return FALSE; | |
| 2943 } | |
| 2944 | |
| 2945 void StaticCtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 2946 { | |
| 2947 if (hgs->hdrgen) | |
| 2948 { buf->writestring("static this();\n"); | |
| 2949 return; | |
| 2950 } | |
| 2951 buf->writestring("static this()"); | |
| 2952 bodyToCBuffer(buf, hgs); | |
| 2953 } | |
| 2954 | |
| 2955 /********************************* StaticDtorDeclaration ****************************/ | |
| 2956 | |
| 2957 StaticDtorDeclaration::StaticDtorDeclaration(Loc loc, Loc endloc) | |
| 2958 : FuncDeclaration(loc, endloc, | |
| 2959 Identifier::generateId("_staticDtor"), STCstatic, NULL) | |
| 2960 { | |
| 2961 vgate = NULL; | |
| 2962 } | |
| 2963 | |
| 2964 Dsymbol *StaticDtorDeclaration::syntaxCopy(Dsymbol *s) | |
| 2965 { | |
| 2966 StaticDtorDeclaration *sdd; | |
| 2967 | |
| 2968 assert(!s); | |
| 2969 sdd = new StaticDtorDeclaration(loc, endloc); | |
| 2970 return FuncDeclaration::syntaxCopy(sdd); | |
| 2971 } | |
| 2972 | |
| 2973 | |
| 2974 void StaticDtorDeclaration::semantic(Scope *sc) | |
| 2975 { | |
| 2976 ClassDeclaration *cd; | |
| 2977 Type *tret; | |
| 2978 | |
| 2979 cd = sc->scopesym->isClassDeclaration(); | |
| 2980 if (!cd) | |
| 2981 { | |
| 2982 } | |
| 2983 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 2984 | |
| 2985 /* If the static ctor appears within a template instantiation, | |
| 2986 * it could get called multiple times by the module constructors | |
| 2987 * for different modules. Thus, protect it with a gate. | |
| 2988 */ | |
| 2989 if (inTemplateInstance()) | |
| 2990 { | |
| 2991 /* Add this prefix to the function: | |
| 2992 * static int gate; | |
| 2993 * if (--gate != 0) return; | |
| 2994 * Increment gate during constructor execution. | |
| 2995 * Note that this is not thread safe; should not have threads | |
| 2996 * during static destruction. | |
| 2997 */ | |
| 2998 Identifier *id = Lexer::idPool("__gate"); | |
| 2999 VarDeclaration *v = new VarDeclaration(0, Type::tint32, id, NULL); | |
| 3000 v->storage_class = STCstatic; | |
| 3001 Statements *sa = new Statements(); | |
| 3002 Statement *s = new DeclarationStatement(0, v); | |
| 3003 sa->push(s); | |
| 3004 Expression *e = new IdentifierExp(0, id); | |
| 3005 e = new AddAssignExp(0, e, new IntegerExp((uint64_t)-1)); | |
| 3006 e = new EqualExp(TOKnotequal, 0, e, new IntegerExp(0)); | |
| 3007 s = new IfStatement(0, NULL, e, new ReturnStatement(0, NULL), NULL); | |
| 3008 sa->push(s); | |
| 3009 if (fbody) | |
| 3010 sa->push(fbody); | |
| 3011 fbody = new CompoundStatement(0, sa); | |
| 3012 vgate = v; | |
| 3013 } | |
| 3014 | |
| 3015 FuncDeclaration::semantic(sc); | |
| 3016 | |
| 3017 // We're going to need ModuleInfo | |
| 3018 Module *m = getModule(); | |
| 3019 if (!m) | |
| 3020 m = sc->module; | |
| 3021 if (m) | |
| 3022 { m->needmoduleinfo = 1; | |
|
1602
a413ae7329bf
Merge DMD r243: some harmonization with D2 dmd
Leandro Lucarella <llucax@gmail.com>
parents:
1587
diff
changeset
|
3023 //printf("module2 %s needs moduleinfo\n", m->toChars()); |
| 1587 | 3024 #ifdef IN_GCC |
| 3025 m->strictlyneedmoduleinfo = 1; | |
| 3026 #endif | |
| 3027 } | |
| 3028 } | |
| 3029 | |
| 3030 AggregateDeclaration *StaticDtorDeclaration::isThis() | |
| 3031 { | |
| 3032 return NULL; | |
| 3033 } | |
| 3034 | |
| 3035 int StaticDtorDeclaration::isStaticDestructor() | |
| 3036 { | |
| 3037 return TRUE; | |
| 3038 } | |
| 3039 | |
| 3040 int StaticDtorDeclaration::isVirtual() | |
| 3041 { | |
| 3042 return FALSE; | |
| 3043 } | |
| 3044 | |
| 3045 int StaticDtorDeclaration::addPreInvariant() | |
| 3046 { | |
| 3047 return FALSE; | |
| 3048 } | |
| 3049 | |
| 3050 int StaticDtorDeclaration::addPostInvariant() | |
| 3051 { | |
| 3052 return FALSE; | |
| 3053 } | |
| 3054 | |
| 3055 void StaticDtorDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 3056 { | |
| 3057 if (hgs->hdrgen) | |
| 3058 return; | |
| 3059 buf->writestring("static ~this()"); | |
| 3060 bodyToCBuffer(buf, hgs); | |
| 3061 } | |
| 3062 | |
| 3063 /********************************* InvariantDeclaration ****************************/ | |
| 3064 | |
| 3065 InvariantDeclaration::InvariantDeclaration(Loc loc, Loc endloc) | |
| 3066 : FuncDeclaration(loc, endloc, Id::classInvariant, STCundefined, NULL) | |
| 3067 { | |
| 3068 } | |
| 3069 | |
| 3070 Dsymbol *InvariantDeclaration::syntaxCopy(Dsymbol *s) | |
| 3071 { | |
| 3072 InvariantDeclaration *id; | |
| 3073 | |
| 3074 assert(!s); | |
| 3075 id = new InvariantDeclaration(loc, endloc); | |
| 3076 FuncDeclaration::syntaxCopy(id); | |
| 3077 return id; | |
| 3078 } | |
| 3079 | |
| 3080 | |
| 3081 void InvariantDeclaration::semantic(Scope *sc) | |
| 3082 { | |
| 3083 AggregateDeclaration *ad; | |
| 3084 Type *tret; | |
| 3085 | |
| 3086 parent = sc->parent; | |
| 3087 Dsymbol *parent = toParent(); | |
| 3088 ad = parent->isAggregateDeclaration(); | |
| 3089 if (!ad) | |
| 3090 { | |
| 3091 error("invariants are only for struct/union/class definitions"); | |
| 3092 return; | |
| 3093 } | |
| 3094 else if (ad->inv && ad->inv != this) | |
| 3095 { | |
| 3096 error("more than one invariant for %s", ad->toChars()); | |
| 3097 } | |
| 3098 ad->inv = this; | |
| 3099 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 3100 | |
| 3101 sc = sc->push(); | |
| 3102 sc->stc &= ~STCstatic; // not a static invariant | |
| 3103 sc->incontract++; | |
| 3104 sc->linkage = LINKd; | |
| 3105 | |
| 3106 FuncDeclaration::semantic(sc); | |
| 3107 | |
| 3108 sc->pop(); | |
| 3109 } | |
| 3110 | |
| 3111 int InvariantDeclaration::isVirtual() | |
| 3112 { | |
| 3113 return FALSE; | |
| 3114 } | |
| 3115 | |
| 3116 int InvariantDeclaration::addPreInvariant() | |
| 3117 { | |
| 3118 return FALSE; | |
| 3119 } | |
| 3120 | |
| 3121 int InvariantDeclaration::addPostInvariant() | |
| 3122 { | |
| 3123 return FALSE; | |
| 3124 } | |
| 3125 | |
| 3126 void InvariantDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 3127 { | |
| 3128 if (hgs->hdrgen) | |
| 3129 return; | |
| 3130 buf->writestring("invariant"); | |
| 3131 bodyToCBuffer(buf, hgs); | |
| 3132 } | |
| 3133 | |
| 3134 | |
| 3135 /********************************* UnitTestDeclaration ****************************/ | |
| 3136 | |
| 3137 /******************************* | |
| 3138 * Generate unique unittest function Id so we can have multiple | |
| 3139 * instances per module. | |
| 3140 */ | |
| 3141 | |
| 3142 static Identifier *unitTestId() | |
| 3143 { | |
| 3144 return Lexer::uniqueId("__unittest"); | |
| 3145 } | |
| 3146 | |
| 3147 UnitTestDeclaration::UnitTestDeclaration(Loc loc, Loc endloc) | |
| 3148 : FuncDeclaration(loc, endloc, unitTestId(), STCundefined, NULL) | |
| 3149 { | |
| 3150 } | |
| 3151 | |
| 3152 Dsymbol *UnitTestDeclaration::syntaxCopy(Dsymbol *s) | |
| 3153 { | |
| 3154 UnitTestDeclaration *utd; | |
| 3155 | |
| 3156 assert(!s); | |
| 3157 utd = new UnitTestDeclaration(loc, endloc); | |
| 3158 return FuncDeclaration::syntaxCopy(utd); | |
| 3159 } | |
| 3160 | |
| 3161 | |
| 3162 void UnitTestDeclaration::semantic(Scope *sc) | |
| 3163 { | |
| 3164 if (global.params.useUnitTests) | |
| 3165 { | |
| 3166 type = new TypeFunction(NULL, Type::tvoid, FALSE, LINKd); | |
| 3167 Scope *sc2 = sc->push(); | |
| 3168 sc2->linkage = LINKd; | |
| 3169 FuncDeclaration::semantic(sc2); | |
| 3170 sc2->pop(); | |
| 3171 } | |
| 3172 | |
| 3173 #if 0 | |
| 3174 // We're going to need ModuleInfo even if the unit tests are not | |
| 3175 // compiled in, because other modules may import this module and refer | |
| 3176 // to this ModuleInfo. | |
| 3177 // (This doesn't make sense to me?) | |
| 3178 Module *m = getModule(); | |
| 3179 if (!m) | |
| 3180 m = sc->module; | |
| 3181 if (m) | |
| 3182 { | |
| 3183 //printf("module3 %s needs moduleinfo\n", m->toChars()); | |
| 3184 m->needmoduleinfo = 1; | |
| 3185 } | |
| 3186 #endif | |
| 3187 } | |
| 3188 | |
| 3189 AggregateDeclaration *UnitTestDeclaration::isThis() | |
| 3190 { | |
| 3191 return NULL; | |
| 3192 } | |
| 3193 | |
| 3194 int UnitTestDeclaration::isVirtual() | |
| 3195 { | |
| 3196 return FALSE; | |
| 3197 } | |
| 3198 | |
| 3199 int UnitTestDeclaration::addPreInvariant() | |
| 3200 { | |
| 3201 return FALSE; | |
| 3202 } | |
| 3203 | |
| 3204 int UnitTestDeclaration::addPostInvariant() | |
| 3205 { | |
| 3206 return FALSE; | |
| 3207 } | |
| 3208 | |
| 3209 void UnitTestDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 3210 { | |
| 3211 if (hgs->hdrgen) | |
| 3212 return; | |
| 3213 buf->writestring("unittest"); | |
| 3214 bodyToCBuffer(buf, hgs); | |
| 3215 } | |
| 3216 | |
| 3217 /********************************* NewDeclaration ****************************/ | |
| 3218 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3219 NewDeclaration::NewDeclaration(Loc loc, Loc endloc, Parameters *arguments, int varargs) |
| 1587 | 3220 : FuncDeclaration(loc, endloc, Id::classNew, STCstatic, NULL) |
| 3221 { | |
| 3222 this->arguments = arguments; | |
| 3223 this->varargs = varargs; | |
| 3224 } | |
| 3225 | |
| 3226 Dsymbol *NewDeclaration::syntaxCopy(Dsymbol *s) | |
| 3227 { | |
| 3228 NewDeclaration *f; | |
| 3229 | |
| 3230 f = new NewDeclaration(loc, endloc, NULL, varargs); | |
| 3231 | |
| 3232 FuncDeclaration::syntaxCopy(f); | |
| 3233 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3234 f->arguments = Parameter::arraySyntaxCopy(arguments); |
| 1587 | 3235 |
| 3236 return f; | |
| 3237 } | |
| 3238 | |
| 3239 | |
| 3240 void NewDeclaration::semantic(Scope *sc) | |
| 3241 { | |
| 3242 ClassDeclaration *cd; | |
| 3243 Type *tret; | |
| 3244 | |
| 3245 //printf("NewDeclaration::semantic()\n"); | |
| 3246 | |
| 3247 parent = sc->parent; | |
| 3248 Dsymbol *parent = toParent(); | |
| 3249 cd = parent->isClassDeclaration(); | |
| 3250 if (!cd && !parent->isStructDeclaration()) | |
| 3251 { | |
| 3252 error("new allocators only are for class or struct definitions"); | |
| 3253 } | |
| 3254 tret = Type::tvoid->pointerTo(); | |
| 3255 type = new TypeFunction(arguments, tret, varargs, LINKd); | |
| 3256 | |
| 3257 type = type->semantic(loc, sc); | |
| 3258 assert(type->ty == Tfunction); | |
| 3259 | |
| 3260 // Check that there is at least one argument of type size_t | |
| 3261 TypeFunction *tf = (TypeFunction *)type; | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3262 if (Parameter::dim(tf->parameters) < 1) |
| 1587 | 3263 { |
| 3264 error("at least one argument of type size_t expected"); | |
| 3265 } | |
| 3266 else | |
| 3267 { | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3268 Parameter *a = Parameter::getNth(tf->parameters, 0); |
| 1587 | 3269 if (!a->type->equals(Type::tsize_t)) |
| 3270 error("first argument must be type size_t, not %s", a->type->toChars()); | |
| 3271 } | |
| 3272 | |
| 3273 FuncDeclaration::semantic(sc); | |
| 3274 } | |
| 3275 | |
| 3276 const char *NewDeclaration::kind() | |
| 3277 { | |
| 3278 return "allocator"; | |
| 3279 } | |
| 3280 | |
| 3281 int NewDeclaration::isVirtual() | |
| 3282 { | |
| 3283 return FALSE; | |
| 3284 } | |
| 3285 | |
| 3286 int NewDeclaration::addPreInvariant() | |
| 3287 { | |
| 3288 return FALSE; | |
| 3289 } | |
| 3290 | |
| 3291 int NewDeclaration::addPostInvariant() | |
| 3292 { | |
| 3293 return FALSE; | |
| 3294 } | |
| 3295 | |
| 3296 void NewDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 3297 { | |
| 3298 buf->writestring("new"); | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3299 Parameter::argsToCBuffer(buf, hgs, arguments, varargs); |
| 1587 | 3300 bodyToCBuffer(buf, hgs); |
| 3301 } | |
| 3302 | |
| 3303 | |
| 3304 /********************************* DeleteDeclaration ****************************/ | |
| 3305 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3306 DeleteDeclaration::DeleteDeclaration(Loc loc, Loc endloc, Parameters *arguments) |
| 1587 | 3307 : FuncDeclaration(loc, endloc, Id::classDelete, STCstatic, NULL) |
| 3308 { | |
| 3309 this->arguments = arguments; | |
| 3310 } | |
| 3311 | |
| 3312 Dsymbol *DeleteDeclaration::syntaxCopy(Dsymbol *s) | |
| 3313 { | |
| 3314 DeleteDeclaration *f; | |
| 3315 | |
| 3316 f = new DeleteDeclaration(loc, endloc, NULL); | |
| 3317 | |
| 3318 FuncDeclaration::syntaxCopy(f); | |
| 3319 | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3320 f->arguments = Parameter::arraySyntaxCopy(arguments); |
| 1587 | 3321 |
| 3322 return f; | |
| 3323 } | |
| 3324 | |
| 3325 | |
| 3326 void DeleteDeclaration::semantic(Scope *sc) | |
| 3327 { | |
| 3328 ClassDeclaration *cd; | |
| 3329 | |
| 3330 //printf("DeleteDeclaration::semantic()\n"); | |
| 3331 | |
| 3332 parent = sc->parent; | |
| 3333 Dsymbol *parent = toParent(); | |
| 3334 cd = parent->isClassDeclaration(); | |
| 3335 if (!cd && !parent->isStructDeclaration()) | |
| 3336 { | |
| 3337 error("new allocators only are for class or struct definitions"); | |
| 3338 } | |
| 3339 type = new TypeFunction(arguments, Type::tvoid, 0, LINKd); | |
| 3340 | |
| 3341 type = type->semantic(loc, sc); | |
| 3342 assert(type->ty == Tfunction); | |
| 3343 | |
| 3344 // Check that there is only one argument of type void* | |
| 3345 TypeFunction *tf = (TypeFunction *)type; | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3346 if (Parameter::dim(tf->parameters) != 1) |
| 1587 | 3347 { |
| 3348 error("one argument of type void* expected"); | |
| 3349 } | |
| 3350 else | |
| 3351 { | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3352 Parameter *a = Parameter::getNth(tf->parameters, 0); |
| 1587 | 3353 if (!a->type->equals(Type::tvoid->pointerTo())) |
| 3354 error("one argument of type void* expected, not %s", a->type->toChars()); | |
| 3355 } | |
| 3356 | |
| 3357 FuncDeclaration::semantic(sc); | |
| 3358 } | |
| 3359 | |
| 3360 const char *DeleteDeclaration::kind() | |
| 3361 { | |
| 3362 return "deallocator"; | |
| 3363 } | |
| 3364 | |
| 3365 int DeleteDeclaration::isDelete() | |
| 3366 { | |
| 3367 return TRUE; | |
| 3368 } | |
| 3369 | |
| 3370 int DeleteDeclaration::isVirtual() | |
| 3371 { | |
| 3372 return FALSE; | |
| 3373 } | |
| 3374 | |
| 3375 int DeleteDeclaration::addPreInvariant() | |
| 3376 { | |
| 3377 return FALSE; | |
| 3378 } | |
| 3379 | |
| 3380 int DeleteDeclaration::addPostInvariant() | |
| 3381 { | |
| 3382 return FALSE; | |
| 3383 } | |
| 3384 | |
| 3385 void DeleteDeclaration::toCBuffer(OutBuffer *buf, HdrGenState *hgs) | |
| 3386 { | |
| 3387 buf->writestring("delete"); | |
|
1607
207a8a438dea
Merge DMD r253: refactor: Argument => Parameter
Leandro Lucarella <llucax@gmail.com>
parents:
1602
diff
changeset
|
3388 Parameter::argsToCBuffer(buf, hgs, arguments, 0); |
| 1587 | 3389 bodyToCBuffer(buf, hgs); |
| 3390 } | |
| 3391 | |
| 3392 | |
| 3393 | |
| 3394 |