Mercurial > projects > ddmd
annotate dmd/TypeFunction.d @ 95:ae5b11064a9a
beginning of 2.036 branch
| author | Trass3r |
|---|---|
| date | Mon, 30 Aug 2010 23:08:44 +0200 |
| parents | 43073c7c7769 |
| children | acd69f84627e |
| rev | line source |
|---|---|
| 0 | 1 module dmd.TypeFunction; |
| 2 | |
| 3 import dmd.TypeNext; | |
| 4 import dmd.TypeSArray; | |
| 5 import dmd.TypeArray; | |
| 6 import dmd.ArrayTypes; | |
| 7 import dmd.LINK; | |
| 8 import dmd.StructDeclaration; | |
| 9 import dmd.TypeStruct; | |
| 10 import dmd.Global; | |
| 11 import dmd.STC; | |
| 12 import dmd.MOD; | |
| 73 | 13 import dmd.PROT; |
| 0 | 14 import dmd.Type; |
| 15 import dmd.Loc; | |
| 16 import dmd.Scope; | |
| 17 import dmd.Identifier; | |
| 18 import dmd.OutBuffer; | |
| 19 import dmd.HdrGenState; | |
| 20 import dmd.CppMangleState; | |
| 21 import dmd.TypeInfoDeclaration; | |
| 22 import dmd.MATCH; | |
| 23 import dmd.Argument; | |
| 24 import dmd.Expression; | |
| 25 import dmd.RET; | |
| 26 import dmd.TY; | |
| 27 import dmd.Util; | |
| 28 | |
| 29 import dmd.backend.TYPE; | |
| 30 import dmd.backend.PARAM; | |
| 31 import dmd.backend.Util; | |
| 32 import dmd.backend.TYM; | |
| 33 import dmd.backend.TF; | |
| 34 import dmd.backend.mTY; | |
| 35 | |
| 36 import core.stdc.stdlib; | |
| 37 import core.stdc.string; | |
| 38 | |
| 39 class TypeFunction : TypeNext | |
| 40 { | |
| 41 // .next is the return type | |
| 42 | |
| 43 Arguments parameters; // function parameters | |
| 44 int varargs; // 1: T t, ...) style for variable number of arguments | |
| 45 // 2: T t ...) style for variable number of arguments | |
| 46 bool isnothrow; // true: nothrow | |
| 47 bool ispure; // true: pure | |
| 48 bool isproperty; // can be called without parentheses | |
| 49 bool isref; // true: returns a reference | |
| 50 LINK linkage; // calling convention | |
| 51 | |
| 52 int inuse; | |
| 53 | |
| 54 this(Arguments parameters, Type treturn, int varargs, LINK linkage) | |
| 55 { | |
| 56 super(TY.Tfunction, treturn); | |
| 57 | |
| 58 //if (!treturn) *(char*)0=0; | |
| 59 // assert(treturn); | |
| 60 assert(0 <= varargs && varargs <= 2); | |
| 61 this.parameters = parameters; | |
| 62 this.varargs = varargs; | |
| 63 this.linkage = linkage; | |
| 64 } | |
| 65 | |
| 72 | 66 override Type syntaxCopy() |
| 0 | 67 { |
| 68 Type treturn = next ? next.syntaxCopy() : null; | |
| 69 Arguments params = Argument.arraySyntaxCopy(parameters); | |
| 70 TypeFunction t = new TypeFunction(params, treturn, varargs, linkage); | |
| 71 t.mod = mod; | |
| 72 t.isnothrow = isnothrow; | |
| 73 t.ispure = ispure; | |
| 74 t.isproperty = isproperty; | |
| 75 t.isref = isref; | |
| 76 | |
| 77 return t; | |
| 78 } | |
| 79 | |
| 80 version (DumbClone) { | |
| 81 } else { | |
| 82 final TypeFunction cloneTo(TypeFunction t) | |
| 83 { | |
| 84 super.cloneTo(t); | |
| 85 | |
| 86 // these 3 should be set by ctor | |
| 87 assert(t.parameters is null); | |
| 88 assert(t.varargs == varargs); | |
| 89 assert(t.linkage == linkage); | |
| 90 | |
| 91 t.isnothrow = isnothrow; | |
| 92 t.ispure = ispure; | |
| 93 t.isproperty = isproperty; | |
| 94 t.isref = isref; | |
| 95 t.inuse = inuse; | |
| 96 | |
| 97 if (parameters) | |
| 98 { | |
| 99 t.parameters = parameters.copy(); | |
| 100 for (size_t i = 0; i < parameters.dim; i++) | |
| 101 { | |
| 102 Argument arg = cast(Argument)parameters.data[i]; | |
| 103 Argument cpy = arg.clone(); | |
| 104 t.parameters.data[i] = cast(void*)cpy; | |
| 105 } | |
| 106 } | |
| 107 | |
| 108 return t; | |
| 109 } | |
| 110 | |
| 111 TypeFunction clone() | |
| 112 { | |
| 113 assert(this.classinfo == TypeFunction.classinfo); | |
| 114 return cloneTo(new TypeFunction(null, next, varargs, linkage)); | |
| 115 } | |
| 116 } | |
| 72 | 117 override Type semantic(Loc loc, Scope sc) |
| 0 | 118 { |
| 119 if (deco) // if semantic() already run | |
| 120 { | |
| 121 //printf("already done\n"); | |
| 122 return this; | |
| 123 } | |
| 124 //printf("TypeFunction.semantic() this = %p\n", this); | |
| 125 //printf("TypeFunction.semantic() %s, sc.stc = %x\n", toChars(), sc.stc); | |
| 126 | |
| 127 /* Copy in order to not mess up original. | |
| 128 * This can produce redundant copies if inferring return type, | |
| 129 * as semantic() will get called again on this. | |
| 130 */ | |
| 131 | |
| 132 TypeFunction tf = cast(TypeFunction)clone(); | |
| 133 | |
| 134 if (sc.stc & STC.STCpure) | |
| 135 tf.ispure = true; | |
| 136 if (sc.stc & STC.STCnothrow) | |
| 137 tf.isnothrow = true; | |
| 138 if (sc.stc & STC.STCref) | |
| 139 tf.isref = true; | |
| 140 | |
| 141 tf.linkage = sc.linkage; | |
| 142 if (tf.next) | |
| 143 { | |
| 144 tf.next = tf.next.semantic(loc,sc); | |
| 145 if (tf.next.toBasetype().ty == TY.Tsarray) | |
| 146 { error(loc, "functions cannot return static array %s", tf.next.toChars()); | |
| 147 tf.next = Type.terror; | |
| 148 } | |
| 149 if (tf.next.toBasetype().ty == TY.Tfunction) | |
| 150 { error(loc, "functions cannot return a function"); | |
| 151 tf.next = Type.terror; | |
| 152 } | |
| 153 if (tf.next.toBasetype().ty == TY.Ttuple) | |
| 154 { error(loc, "functions cannot return a tuple"); | |
| 155 tf.next = Type.terror; | |
| 156 } | |
| 157 if (tf.next.isauto() && !(sc.flags & SCOPE.SCOPEctor)) | |
| 158 error(loc, "functions cannot return scope %s", tf.next.toChars()); | |
| 159 } | |
| 160 | |
| 161 if (tf.parameters) | |
| 73 | 162 { |
| 163 /* Create a scope for evaluating the default arguments for the parameters | |
| 164 */ | |
| 165 Scope argsc = sc.push(); | |
| 166 argsc.stc = STCundefined; // don't inherit storage class | |
| 167 argsc.protection = PROT.PROTpublic; | |
| 168 | |
| 169 size_t dim = Argument.dim(tf.parameters); | |
| 0 | 170 |
| 171 for (size_t i = 0; i < dim; i++) | |
| 172 { Argument arg = Argument.getNth(tf.parameters, i); | |
| 173 | |
| 174 tf.inuse++; | |
| 73 | 175 arg.type = arg.type.semantic(loc, argsc); |
| 0 | 176 if (tf.inuse == 1) tf.inuse--; |
| 177 | |
| 178 arg.type = arg.type.addStorageClass(arg.storageClass); | |
| 179 | |
| 180 if (arg.storageClass & (STC.STCauto | STC.STCalias | STC.STCstatic)) | |
| 181 { | |
| 182 if (!arg.type) | |
| 183 continue; | |
| 184 } | |
| 185 | |
| 186 Type t = arg.type.toBasetype(); | |
| 187 | |
| 188 if (arg.storageClass & (STC.STCout | STC.STCref | STC.STClazy)) | |
| 189 { | |
| 190 if (t.ty == TY.Tsarray) | |
| 191 error(loc, "cannot have out or ref parameter of type %s", t.toChars()); | |
| 192 if (arg.storageClass & STC.STCout && arg.type.mod) | |
| 193 error(loc, "cannot have const/invariant out parameter of type %s", t.toChars()); | |
| 194 } | |
| 195 if (!(arg.storageClass & STC.STClazy) && t.ty == TY.Tvoid) | |
| 196 error(loc, "cannot have parameter of type %s", arg.type.toChars()); | |
| 197 | |
| 198 if (arg.defaultArg) | |
| 199 { | |
| 73 | 200 arg.defaultArg = arg.defaultArg.semantic(argsc); |
| 201 arg.defaultArg = resolveProperties(argsc, arg.defaultArg); | |
| 202 arg.defaultArg = arg.defaultArg.implicitCastTo(argsc, arg.type); | |
| 0 | 203 } |
| 204 | |
| 205 /* If arg turns out to be a tuple, the number of parameters may | |
| 206 * change. | |
| 207 */ | |
| 208 if (t.ty == TY.Ttuple) | |
| 209 { dim = Argument.dim(tf.parameters); | |
| 210 i--; | |
| 211 } | |
| 212 } | |
| 73 | 213 argsc.pop(); |
| 0 | 214 } |
| 215 if (tf.next) | |
| 216 tf.deco = tf.merge().deco; | |
| 217 | |
| 218 if (tf.inuse) | |
| 219 { error(loc, "recursive type"); | |
| 220 tf.inuse = 0; | |
| 221 return terror; | |
| 222 } | |
| 223 | |
| 224 if (tf.varargs == 1 && tf.linkage != LINK.LINKd && Argument.dim(tf.parameters) == 0) | |
| 225 error(loc, "variadic functions with non-D linkage must have at least one parameter"); | |
| 226 | |
| 227 /* Don't return merge(), because arg identifiers and default args | |
| 228 * can be different | |
| 229 * even though the types match | |
| 230 */ | |
| 231 return tf; | |
| 232 } | |
| 233 | |
| 72 | 234 override void toDecoBuffer(OutBuffer buf, int flag) |
| 0 | 235 { |
| 236 ubyte mc; | |
| 237 | |
| 238 //printf("TypeFunction.toDecoBuffer() this = %p %s\n", this, toChars()); | |
| 239 //static int nest; if (++nest == 50) *(char*)0=0; | |
| 240 if (inuse) | |
| 241 { | |
| 242 inuse = 2; // flag error to caller | |
| 243 return; | |
| 244 } | |
| 245 inuse++; | |
| 246 static if (true) { | |
| 247 if (mod & MOD.MODshared) | |
| 248 buf.writeByte('O'); | |
| 249 if (mod & MOD.MODconst) | |
| 250 buf.writeByte('x'); | |
| 251 else if (mod & MOD.MODinvariant) | |
| 252 buf.writeByte('y'); | |
| 253 } | |
| 254 switch (linkage) | |
| 255 { | |
| 256 case LINK.LINKd: mc = 'F'; break; | |
| 257 case LINK.LINKc: mc = 'U'; break; | |
| 258 case LINK.LINKwindows: mc = 'W'; break; | |
| 259 case LINK.LINKpascal: mc = 'V'; break; | |
| 260 case LINK.LINKcpp: mc = 'R'; break; | |
| 261 } | |
| 262 buf.writeByte(mc); | |
| 263 if (ispure || isnothrow || isproperty || isref) | |
| 264 { | |
| 265 if (ispure) | |
| 266 buf.writestring("Na"); | |
| 267 if (isnothrow) | |
| 268 buf.writestring("Nb"); | |
| 269 if (isref) | |
| 270 buf.writestring("Nc"); | |
| 271 if (isproperty) | |
| 272 buf.writestring("Nd"); | |
| 273 } | |
| 274 // Write argument types | |
| 275 Argument.argsToDecoBuffer(buf, parameters); | |
| 276 //if (buf.data[buf.offset - 1] == '@') halt(); | |
| 277 buf.writeByte('Z' - varargs); // mark end of arg list | |
| 79 | 278 assert(next); |
| 0 | 279 next.toDecoBuffer(buf); |
| 280 inuse--; | |
| 281 } | |
| 282 | |
| 72 | 283 override void toCBuffer(OutBuffer buf, Identifier ident, HdrGenState* hgs) |
| 0 | 284 { |
| 285 //printf("TypeFunction.toCBuffer() this = %p\n", this); | |
| 286 string p = null; | |
| 287 | |
| 288 if (inuse) | |
| 289 { | |
| 290 inuse = 2; // flag error to caller | |
| 291 return; | |
| 292 } | |
| 293 inuse++; | |
| 294 | |
| 295 /* Use 'storage class' style for attributes | |
| 296 */ | |
| 297 if (mod & MODconst) | |
| 298 buf.writestring("const "); | |
| 299 if (mod & MODinvariant) | |
| 300 buf.writestring("immutable "); | |
| 301 if (mod & MODshared) | |
| 302 buf.writestring("shared "); | |
| 303 | |
| 304 if (ispure) | |
| 305 buf.writestring("pure "); | |
| 306 if (isnothrow) | |
| 307 buf.writestring("nothrow "); | |
| 308 if (isproperty) | |
| 309 buf.writestring("@property "); | |
| 310 if (isref) | |
| 311 buf.writestring("ref "); | |
| 312 | |
| 313 if (next && (!ident || ident.toHChars2() == ident.toChars())) | |
| 314 next.toCBuffer2(buf, hgs, MODundefined); | |
| 315 if (hgs.ddoc != 1) | |
| 316 { | |
| 317 switch (linkage) | |
| 318 { | |
| 319 case LINKd: p = null; break; | |
| 73 | 320 case LINKc: p = " C"; break; |
| 321 case LINKwindows: p = " Windows"; break; | |
| 322 case LINKpascal: p = " Pascal"; break; | |
| 323 case LINKcpp: p = " C++"; break; | |
| 0 | 324 default: |
| 325 assert(0); | |
| 326 } | |
| 327 } | |
| 328 | |
| 329 if (!hgs.hdrgen && p) | |
| 330 buf.writestring(p); | |
| 331 if (ident) | |
| 332 { | |
| 333 buf.writeByte(' '); | |
| 334 buf.writestring(ident.toHChars2()); | |
| 335 } | |
| 336 Argument.argsToCBuffer(buf, hgs, parameters, varargs); | |
| 337 inuse--; | |
| 338 } | |
| 339 | |
| 72 | 340 override void toCBuffer2(OutBuffer buf, HdrGenState* hgs, MOD mod) |
| 0 | 341 { |
| 342 //printf("TypeFunction::toCBuffer2() this = %p, ref = %d\n", this, isref); | |
| 343 string p; | |
| 344 | |
| 345 if (inuse) | |
| 346 { | |
| 347 inuse = 2; // flag error to caller | |
| 348 return; | |
| 349 } | |
| 350 | |
| 351 inuse++; | |
| 352 if (next) | |
| 353 next.toCBuffer2(buf, hgs, MODundefined); | |
| 354 | |
| 355 if (hgs.ddoc != 1) | |
| 356 { | |
| 357 switch (linkage) | |
| 358 { | |
| 359 case LINKd: p = null; break; | |
| 360 case LINKc: p = "C "; break; | |
| 361 case LINKwindows: p = "Windows "; break; | |
| 362 case LINKpascal: p = "Pascal "; break; | |
| 363 case LINKcpp: p = "C++ "; break; | |
| 364 default: assert(0); | |
| 365 } | |
| 366 } | |
| 367 | |
| 368 if (!hgs.hdrgen && p) | |
| 369 buf.writestring(p); | |
| 370 buf.writestring(" function"); | |
| 371 Argument.argsToCBuffer(buf, hgs, parameters, varargs); | |
| 372 | |
| 373 /* Use postfix style for attributes | |
| 374 */ | |
| 375 if (mod != this.mod) | |
| 376 { | |
| 377 modToBuffer(buf); | |
| 378 } | |
| 379 | |
| 380 if (ispure) | |
| 381 buf.writestring(" pure"); | |
| 382 if (isnothrow) | |
| 383 buf.writestring(" nothrow"); | |
| 384 if (isproperty) | |
| 385 buf.writestring(" @property"); | |
| 386 if (isref) | |
| 387 buf.writestring(" ref"); | |
| 388 | |
| 389 inuse--; | |
| 390 } | |
| 391 | |
| 72 | 392 override MATCH deduceType(Scope sc, Type tparam, TemplateParameters parameters, Objects dedtypes) |
| 0 | 393 { |
| 394 assert(false); | |
| 395 } | |
| 396 | |
| 72 | 397 override TypeInfoDeclaration getTypeInfoDeclaration() |
| 0 | 398 { |
| 399 assert(false); | |
| 400 } | |
| 401 | |
| 72 | 402 override Type reliesOnTident() |
| 0 | 403 { |
| 404 if (parameters) | |
| 405 { | |
| 406 for (size_t i = 0; i < parameters.dim; i++) | |
| 407 { | |
| 408 Argument arg = cast(Argument)parameters.data[i]; | |
| 409 Type t = arg.type.reliesOnTident(); | |
| 410 if (t) | |
| 411 return t; | |
| 412 } | |
| 413 } | |
| 414 return next.reliesOnTident(); | |
| 415 } | |
| 416 | |
| 417 version (CPP_MANGLE) { | |
| 418 void toCppMangle(OutBuffer buf, CppMangleState* cms) | |
| 419 { | |
| 420 assert(false); | |
| 421 } | |
| 422 } | |
| 423 | |
| 424 /*************************** | |
| 425 * Examine function signature for parameter p and see if | |
| 426 * p can 'escape' the scope of the function. | |
| 427 */ | |
| 428 bool parameterEscapes(Argument p) | |
| 429 { | |
| 430 /* Scope parameters do not escape. | |
| 431 * Allow 'lazy' to imply 'scope' - | |
| 432 * lazy parameters can be passed along | |
| 433 * as lazy parameters to the next function, but that isn't | |
| 434 * escaping. | |
| 435 */ | |
| 436 if (p.storageClass & (STC.STCscope | STC.STClazy)) | |
| 437 return false; | |
| 438 | |
| 439 if (ispure) | |
| 440 { /* With pure functions, we need only be concerned if p escapes | |
| 441 * via any return statement. | |
| 442 */ | |
| 443 Type tret = nextOf().toBasetype(); | |
| 444 if (!isref && !tret.hasPointers()) | |
| 445 { /* The result has no references, so p could not be escaping | |
| 446 * that way. | |
| 447 */ | |
| 448 return false; | |
| 449 } | |
| 450 } | |
| 451 | |
| 452 /* Assume it escapes in the absence of better information. | |
| 453 */ | |
| 454 return true; | |
| 455 } | |
| 456 | |
| 457 /******************************** | |
| 458 * 'args' are being matched to function 'this' | |
| 459 * Determine match level. | |
| 460 * Returns: | |
| 461 * MATCHxxxx | |
| 462 */ | |
| 463 MATCH callMatch(Expression ethis, Expressions args) | |
| 464 { | |
| 465 //printf("TypeFunction.callMatch() %s\n", toChars()); | |
| 466 MATCH match = MATCH.MATCHexact; // assume exact match | |
| 467 | |
| 468 if (ethis) | |
| 469 { | |
| 470 Type t = ethis.type; | |
| 471 if (t.toBasetype().ty == TY.Tpointer) | |
| 472 t = t.toBasetype().nextOf(); // change struct* to struct | |
| 473 | |
| 474 if (t.mod != mod) | |
| 475 { | |
| 476 if (mod == MOD.MODconst) | |
| 477 match = MATCH.MATCHconst; | |
| 478 else | |
| 479 return MATCH.MATCHnomatch; | |
| 480 } | |
| 481 } | |
| 482 | |
| 483 size_t nparams = Argument.dim(parameters); | |
| 484 size_t nargs = args ? args.dim : 0; | |
| 485 if (nparams == nargs) { | |
| 486 ; | |
| 487 } else if (nargs > nparams) | |
| 488 { | |
| 489 if (varargs == 0) | |
| 490 goto Nomatch; // too many args; no match | |
| 491 match = MATCH.MATCHconvert; // match ... with a "conversion" match level | |
| 492 } | |
| 493 | |
| 494 for (size_t u = 0; u < nparams; u++) | |
| 495 { | |
| 496 MATCH m; | |
| 497 Expression arg; | |
| 498 | |
| 499 // BUG: what about out and ref? | |
| 500 | |
| 501 Argument p = Argument.getNth(parameters, u); | |
| 502 assert(p); | |
| 503 if (u >= nargs) | |
| 504 { | |
| 505 if (p.defaultArg) | |
| 506 continue; | |
| 507 if (varargs == 2 && u + 1 == nparams) | |
| 508 goto L1; | |
| 509 goto Nomatch; // not enough arguments | |
| 510 } | |
| 511 | |
| 512 arg = cast(Expression)args.data[u]; | |
| 513 assert(arg); | |
| 514 | |
| 515 // Non-lvalues do not match ref or out parameters | |
| 516 if (p.storageClass & (STC.STCref | STC.STCout) && !arg.isLvalue()) | |
| 517 goto Nomatch; | |
| 518 | |
| 519 if (p.storageClass & STC.STClazy && p.type.ty == TY.Tvoid && arg.type.ty != TY.Tvoid) | |
| 520 m = MATCH.MATCHconvert; | |
| 521 else | |
| 522 m = arg.implicitConvTo(p.type); | |
| 523 //printf("\tm = %d\n", m); | |
| 524 if (m == MATCH.MATCHnomatch) // if no match | |
| 525 { | |
| 526 L1: | |
| 527 if (varargs == 2 && u + 1 == nparams) // if last varargs param | |
| 528 { | |
| 529 Type tb = p.type.toBasetype(); | |
| 530 TypeSArray tsa; | |
| 531 long sz; | |
| 532 | |
| 533 switch (tb.ty) | |
| 534 { | |
| 535 case TY.Tsarray: | |
| 536 tsa = cast(TypeSArray)tb; | |
| 537 sz = tsa.dim.toInteger(); | |
| 538 if (sz != nargs - u) | |
| 539 goto Nomatch; | |
| 540 case TY.Tarray: | |
| 541 { | |
| 542 TypeArray ta = cast(TypeArray)tb; | |
| 543 for (; u < nargs; u++) | |
| 544 { | |
| 545 arg = cast(Expression)args.data[u]; | |
| 546 assert(arg); | |
| 547 static if (true) { | |
| 548 /* If lazy array of delegates, | |
| 549 * convert arg(s) to delegate(s) | |
| 550 */ | |
| 551 Type tret = p.isLazyArray(); | |
| 552 if (tret) | |
| 553 { | |
| 554 if (ta.next.equals(arg.type)) | |
| 555 { | |
| 556 m = MATCH.MATCHexact; | |
| 557 } | |
| 558 else | |
| 559 { | |
| 560 m = arg.implicitConvTo(tret); | |
| 561 if (m == MATCH.MATCHnomatch) | |
| 562 { | |
| 563 if (tret.toBasetype().ty == TY.Tvoid) | |
| 564 m = MATCH.MATCHconvert; | |
| 565 } | |
| 566 } | |
| 567 } | |
| 568 else | |
| 569 m = arg.implicitConvTo(ta.next); | |
| 570 } else { | |
| 571 m = arg.implicitConvTo(ta.next); | |
| 572 } | |
| 573 if (m == MATCH.MATCHnomatch) | |
| 574 goto Nomatch; | |
| 575 | |
| 576 if (m < match) | |
| 577 match = m; | |
| 578 } | |
| 579 goto Ldone; | |
| 580 } | |
| 581 | |
| 582 case TY.Tclass: | |
| 583 // Should see if there's a constructor match? | |
| 584 // Or just leave it ambiguous? | |
| 585 goto Ldone; | |
| 586 | |
| 587 default: | |
| 588 goto Nomatch; | |
| 589 } | |
| 590 } | |
| 591 | |
| 592 goto Nomatch; | |
| 593 } | |
| 594 | |
| 595 if (m < match) | |
| 596 match = m; // pick worst match | |
| 597 } | |
| 598 | |
| 599 Ldone: | |
| 600 //printf("match = %d\n", match); | |
| 601 return match; | |
| 602 | |
| 603 Nomatch: | |
| 604 //printf("no match\n"); | |
| 605 return MATCH.MATCHnomatch; | |
| 606 } | |
| 607 | |
| 72 | 608 override type* toCtype() |
| 0 | 609 { |
| 610 if (ctype) { | |
| 611 return ctype; | |
| 612 } | |
| 613 | |
| 614 type* t; | |
| 615 if (true) | |
| 616 { | |
| 617 param_t* paramtypes; | |
| 618 tym_t tyf; | |
| 619 type* tp; | |
| 620 | |
| 621 paramtypes = null; | |
| 622 size_t nparams = Argument.dim(parameters); | |
| 623 for (size_t i = 0; i < nparams; i++) | |
| 624 { | |
| 625 Argument arg = Argument.getNth(parameters, i); | |
| 626 tp = arg.type.toCtype(); | |
| 627 if (arg.storageClass & (STC.STCout | STC.STCref)) | |
| 628 { | |
| 629 // C doesn't have reference types, so it's really a pointer | |
| 630 // to the parameter type | |
| 631 tp = type_allocn(TYM.TYref, tp); | |
| 632 } | |
| 633 param_append_type(¶mtypes,tp); | |
| 634 } | |
| 635 tyf = totym(); | |
| 636 t = type_alloc(tyf); | |
| 637 t.Tflags |= TF.TFprototype; | |
| 638 if (varargs != 1) | |
| 639 t.Tflags |= TF.TFfixed; | |
| 640 ctype = t; | |
| 641 t.Tnext = next.toCtype(); | |
| 642 t.Tnext.Tcount++; | |
| 643 t.Tparamtypes = paramtypes; | |
| 644 } | |
| 645 ctype = t; | |
| 646 return t; | |
| 647 } | |
| 648 | |
| 649 /*************************** | |
| 650 * Determine return style of function - whether in registers or | |
| 651 * through a hidden pointer to the caller's stack. | |
| 652 */ | |
| 653 RET retStyle() | |
| 654 { | |
| 655 //printf("TypeFunction.retStyle() %s\n", toChars()); | |
| 95 | 656 version (DMDV2) |
| 657 { | |
| 0 | 658 if (isref) |
| 659 return RET.RETregs; // returns a pointer | |
| 660 } | |
| 661 | |
| 662 Type tn = next.toBasetype(); | |
| 95 | 663 Type tns = tn; |
| 664 ulong sz = tn.size(); | |
| 0 | 665 |
| 95 | 666 version(SARRAYVALUE) |
| 667 { | |
| 668 if (tn.ty == Tsarray) | |
| 669 { | |
| 670 do | |
| 671 { | |
| 672 tns = tns.nextOf().toBasetype(); | |
| 673 } while (tns.ty == Tsarray); | |
| 674 if (tns.ty != Tstruct) | |
| 675 { | |
| 676 if (global.params.isLinux && linkage != LINKd) | |
| 677 {} | |
| 678 else | |
| 679 { | |
| 680 switch (sz) | |
| 681 { case 1: | |
| 682 case 2: | |
| 683 case 4: | |
| 684 case 8: | |
| 685 return RETregs; // return small structs in regs | |
| 686 // (not 3 byte structs!) | |
| 687 default: | |
| 688 break; | |
| 689 } | |
| 690 } | |
| 691 return RETstack; | |
| 692 } | |
| 693 } | |
| 694 } | |
| 695 if (tns.ty == TY.Tstruct) | |
| 0 | 696 { |
| 697 StructDeclaration sd = (cast(TypeStruct)tn).sym; | |
| 698 if (global.params.isLinux && linkage != LINK.LINKd) { | |
| 699 ; | |
| 700 } | |
| 95 | 701 ///version (DMDV2) { // TODO: |
| 702 else if (sd.dtor || sd.cpctor) | |
| 703 { | |
| 0 | 704 } |
| 705 ///} | |
| 706 else | |
| 707 { | |
| 95 | 708 switch (sz) |
| 0 | 709 { |
| 710 case 1: | |
| 711 case 2: | |
| 712 case 4: | |
| 713 case 8: | |
| 714 return RET.RETregs; // return small structs in regs | |
| 715 // (not 3 byte structs!) | |
| 716 default: | |
| 717 break; | |
| 718 } | |
| 719 } | |
| 720 return RET.RETstack; | |
| 721 } | |
| 722 else if ((global.params.isLinux || global.params.isOSX || global.params.isFreeBSD || global.params.isSolaris) && | |
| 723 linkage == LINK.LINKc && | |
| 724 tn.iscomplex()) | |
| 725 { | |
| 726 if (tn.ty == TY.Tcomplex32) | |
| 727 return RET.RETregs; // in EDX:EAX, not ST1:ST0 | |
| 728 else | |
| 729 return RET.RETstack; | |
| 730 } | |
| 731 else | |
| 732 return RET.RETregs; | |
| 733 } | |
| 734 | |
| 72 | 735 override TYM totym() |
| 0 | 736 { |
| 737 TYM tyf; | |
| 738 | |
| 739 //printf("TypeFunction.totym(), linkage = %d\n", linkage); | |
| 740 switch (linkage) | |
| 741 { | |
| 742 case LINK.LINKwindows: | |
| 743 tyf = (varargs == 1) ? TYM.TYnfunc : TYM.TYnsfunc; | |
| 744 break; | |
| 745 | |
| 746 case LINK.LINKpascal: | |
| 747 tyf = (varargs == 1) ? TYM.TYnfunc : TYM.TYnpfunc; | |
| 748 break; | |
| 749 | |
| 750 case LINK.LINKc: | |
| 751 tyf = TYM.TYnfunc; | |
|
22
fd4acc376c45
Implemented object file output and linking on linux.
Robert Clipsham <robert@octarineparrot.com>
parents:
0
diff
changeset
|
752 version (POSIX) {///TARGET_LINUX || TARGET_OSX || TARGET_FREEBSD || TARGET_SOLARIS |
| 0 | 753 if (retStyle() == RET.RETstack) |
| 754 tyf = TYM.TYhfunc; | |
| 755 } | |
| 756 break; | |
| 757 | |
| 758 case LINK.LINKd: | |
| 759 tyf = (varargs == 1) ? TYM.TYnfunc : TYM.TYjfunc; | |
| 760 break; | |
| 761 | |
| 762 case LINK.LINKcpp: | |
| 763 tyf = TYM.TYnfunc; | |
| 764 break; | |
| 765 | |
| 766 default: | |
| 767 writef("linkage = %d\n", linkage); | |
| 768 assert(0); | |
| 769 } | |
| 770 version (DMDV2) { | |
| 771 if (isnothrow) | |
| 772 tyf |= mTY.mTYnothrow; | |
| 773 } | |
| 774 return tyf; | |
| 775 } | |
|
22
fd4acc376c45
Implemented object file output and linking on linux.
Robert Clipsham <robert@octarineparrot.com>
parents:
0
diff
changeset
|
776 } |