1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350
|
{
Copyright (c) 2000-2002 by Florian Klaempfl
Type checking and register allocation for load/assignment nodes
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
unit nld;
{$i fpcdefs.inc}
interface
uses
node,
{$ifdef state_tracking}
nstate,
{$endif}
symconst,symbase,symtype,symsym,symdef;
type
Trttidatatype = (rdt_normal,rdt_ord2str,rdt_str2ord);
tloadnodeflags = (
loadnf_is_self,
loadnf_load_self_pointer,
loadnf_inherited,
{ the loadnode is generated internally and a varspez=vs_const should be ignore,
this requires that the parameter is actually passed by value
Be really carefull when using this flag! }
loadnf_isinternal_ignoreconst,
loadnf_only_uninitialized_hint
);
tloadnode = class(tunarynode)
protected
fprocdef : tprocdef;
fprocdefderef : tderef;
function handle_threadvar_access: tnode; virtual;
public
loadnodeflags : set of tloadnodeflags;
symtableentry : tsym;
symtableentryderef : tderef;
symtable : TSymtable;
constructor create(v : tsym;st : TSymtable);virtual;
constructor create_procvar(v : tsym;d:tprocdef;st : TSymtable);virtual;
constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
procedure ppuwrite(ppufile:tcompilerppufile);override;
procedure buildderefimpl;override;
procedure derefimpl;override;
procedure set_mp(p:tnode);
function is_addr_param_load:boolean;virtual;
function dogetcopy : tnode;override;
function pass_1 : tnode;override;
function pass_typecheck:tnode;override;
procedure mark_write;override;
function docompare(p: tnode): boolean; override;
procedure printnodedata(var t:text);override;
procedure setprocdef(p : tprocdef);
property procdef: tprocdef read fprocdef write setprocdef;
end;
tloadnodeclass = class of tloadnode;
{ different assignment types }
tassigntype = (at_normal,at_plus,at_minus,at_star,at_slash);
tassignmentnode = class(tbinarynode)
protected
function direct_shortstring_assignment: boolean; virtual;
public
assigntype : tassigntype;
constructor create(l,r : tnode);virtual;
{ no checks for validity of assignment }
constructor create_internal(l,r : tnode);virtual;
constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
procedure ppuwrite(ppufile:tcompilerppufile);override;
function dogetcopy : tnode;override;
function pass_1 : tnode;override;
function pass_typecheck:tnode;override;
function simplify(forinline : boolean) : tnode;override;
{$ifdef state_tracking}
function track_state_pass(exec_known:boolean):boolean;override;
{$endif state_tracking}
function docompare(p: tnode): boolean; override;
end;
tassignmentnodeclass = class of tassignmentnode;
tarrayconstructorrangenode = class(tbinarynode)
constructor create(l,r : tnode);virtual;
function pass_1 : tnode;override;
function pass_typecheck:tnode;override;
end;
tarrayconstructorrangenodeclass = class of tarrayconstructorrangenode;
tarrayconstructornode = class(tbinarynode)
protected
procedure wrapmanagedvarrec(var n: tnode);virtual;abstract;
public
constructor create(l,r : tnode);virtual;
function dogetcopy : tnode;override;
function pass_1 : tnode;override;
function pass_typecheck:tnode;override;
function docompare(p: tnode): boolean; override;
procedure force_type(def:tdef);
procedure insert_typeconvs;
end;
tarrayconstructornodeclass = class of tarrayconstructornode;
ttypenode = class(tnode)
allowed : boolean;
helperallowed : boolean;
typedef : tdef;
typedefderef : tderef;
typesym : tsym;
typesymderef : tderef;
constructor create(def:tdef);virtual;
constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
procedure ppuwrite(ppufile:tcompilerppufile);override;
procedure buildderefimpl;override;
procedure derefimpl;override;
function pass_1 : tnode;override;
function pass_typecheck:tnode;override;
function dogetcopy : tnode;override;
function docompare(p: tnode): boolean; override;
end;
ttypenodeclass = class of ttypenode;
trttinode = class(tnode)
l1,l2 : longint;
rttitype : trttitype;
rttidef : tstoreddef;
rttidefderef : tderef;
rttidatatype : Trttidatatype;
constructor create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);virtual;
constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
procedure ppuwrite(ppufile:tcompilerppufile);override;
procedure buildderefimpl;override;
procedure derefimpl;override;
function dogetcopy : tnode;override;
function pass_1 : tnode;override;
function pass_typecheck:tnode;override;
function docompare(p: tnode): boolean; override;
end;
trttinodeclass = class of trttinode;
var
cloadnode : tloadnodeclass = tloadnode;
cassignmentnode : tassignmentnodeclass = tassignmentnode;
carrayconstructorrangenode : tarrayconstructorrangenodeclass = tarrayconstructorrangenode;
carrayconstructornode : tarrayconstructornodeclass = tarrayconstructornode;
ctypenode : ttypenodeclass = ttypenode;
crttinode : trttinodeclass = trttinode;
{ Current assignment node }
aktassignmentnode : tassignmentnode;
implementation
uses
verbose,globtype,globals,systems,constexp,
symnot,symtable,
defutil,defcmp,
htypechk,pass_1,procinfo,paramgr,
cpuinfo,
ncon,ninl,ncnv,nmem,ncal,nutils,
cgbase
;
{*****************************************************************************
TLOADNODE
*****************************************************************************}
function tloadnode.handle_threadvar_access: tnode;
begin
{ nothing special by default }
result:=nil;
end;
constructor tloadnode.create(v : tsym;st : TSymtable);
begin
inherited create(loadn,nil);
if not assigned(v) then
internalerror(200108121);
symtableentry:=v;
symtable:=st;
fprocdef:=nil;
end;
constructor tloadnode.create_procvar(v : tsym;d:tprocdef;st : TSymtable);
begin
inherited create(loadn,nil);
if not assigned(v) then
internalerror(200108122);
symtableentry:=v;
symtable:=st;
fprocdef:=d;
end;
constructor tloadnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
begin
inherited ppuload(t,ppufile);
ppufile.getderef(symtableentryderef);
symtable:=nil;
ppufile.getderef(fprocdefderef);
ppufile.getsmallset(loadnodeflags);
end;
procedure tloadnode.ppuwrite(ppufile:tcompilerppufile);
begin
inherited ppuwrite(ppufile);
ppufile.putderef(symtableentryderef);
ppufile.putderef(fprocdefderef);
ppufile.putsmallset(loadnodeflags);
end;
procedure tloadnode.buildderefimpl;
begin
inherited buildderefimpl;
symtableentryderef.build(symtableentry);
fprocdefderef.build(fprocdef);
end;
procedure tloadnode.derefimpl;
begin
inherited derefimpl;
symtableentry:=tsym(symtableentryderef.resolve);
symtable:=symtableentry.owner;
fprocdef:=tprocdef(fprocdefderef.resolve);
end;
procedure tloadnode.set_mp(p:tnode);
begin
{ typen nodes should not be set }
if p.nodetype=typen then
internalerror(200301042);
left:=p;
end;
function tloadnode.dogetcopy : tnode;
var
n : tloadnode;
begin
n:=tloadnode(inherited dogetcopy);
n.symtable:=symtable;
n.symtableentry:=symtableentry;
n.fprocdef:=fprocdef;
result:=n;
end;
function tloadnode.is_addr_param_load:boolean;
begin
result:=(symtable.symtabletype=parasymtable) and
(symtableentry.typ=paravarsym) and
not(vo_has_local_copy in tparavarsym(symtableentry).varoptions) and
not(loadnf_load_self_pointer in loadnodeflags) and
paramanager.push_addr_param(tparavarsym(symtableentry).varspez,tparavarsym(symtableentry).vardef,tprocdef(symtable.defowner).proccalloption);
end;
function tloadnode.pass_typecheck:tnode;
begin
result:=nil;
case symtableentry.typ of
absolutevarsym :
resultdef:=tabsolutevarsym(symtableentry).vardef;
constsym:
begin
if tconstsym(symtableentry).consttyp=constresourcestring then
resultdef:=getansistringdef
else
internalerror(22799);
end;
staticvarsym :
begin
tabstractvarsym(symtableentry).IncRefCountBy(1);
{ static variables referenced in procedures or from finalization,
variable needs to be in memory.
It is too hard and the benefit is too small to detect whether a
variable is only used in the finalization to add support for it (PFV) }
if assigned(current_procinfo) and
(symtable.symtabletype=staticsymtable) and
(
(symtable.symtablelevel<>current_procinfo.procdef.localst.symtablelevel) or
(current_procinfo.procdef.proctypeoption=potype_unitfinalize)
) then
make_not_regable(self,[ra_addr_taken]);
resultdef:=tabstractvarsym(symtableentry).vardef;
if vo_is_thread_var in tstaticvarsym(symtableentry).varoptions then
result:=handle_threadvar_access;
end;
paravarsym,
localvarsym :
begin
tabstractvarsym(symtableentry).IncRefCountBy(1);
{ Nested variable? The we need to load the framepointer of
the parent procedure }
if assigned(current_procinfo) and
(symtable.symtabletype in [localsymtable,parasymtable]) and
(symtable.symtablelevel<>current_procinfo.procdef.parast.symtablelevel) then
begin
if assigned(left) then
internalerror(200309289);
left:=cloadparentfpnode.create(tprocdef(symtable.defowner),lpf_forload);
{ we can't inline the referenced parent procedure }
exclude(tprocdef(symtable.defowner).procoptions,po_inline);
{ reference in nested procedures, variable needs to be in memory }
{ and behaves as if its address escapes its parent block }
make_not_regable(self,[ra_addr_taken]);
end;
{ fix self type which is declared as voidpointer in the
definition }
if vo_is_self in tabstractvarsym(symtableentry).varoptions then
begin
resultdef:=tprocdef(symtableentry.owner.defowner).struct;
if is_objectpascal_helper(resultdef) then
resultdef:=tobjectdef(resultdef).extendeddef;
if (po_classmethod in tprocdef(symtableentry.owner.defowner).procoptions) or
(po_staticmethod in tprocdef(symtableentry.owner.defowner).procoptions) then
resultdef:=cclassrefdef.create(resultdef)
else if (is_object(resultdef) or is_record(resultdef)) and
(loadnf_load_self_pointer in loadnodeflags) then
resultdef:=getpointerdef(resultdef);
end
else if vo_is_vmt in tabstractvarsym(symtableentry).varoptions then
begin
resultdef:=tprocdef(symtableentry.owner.defowner).struct;
resultdef:=cclassrefdef.create(resultdef);
end
else
resultdef:=tabstractvarsym(symtableentry).vardef;
end;
procsym :
begin
{ Return the first procdef. In case of overloaded
procdefs the matching procdef will be choosen
when the expected procvardef is known, see get_information
in htypechk.pas (PFV) }
if not assigned(fprocdef) then
fprocdef:=tprocdef(tprocsym(symtableentry).ProcdefList[0])
else if po_kylixlocal in fprocdef.procoptions then
CGMessage(type_e_cant_take_address_of_local_subroutine);
{ the result is a fprocdef, addrn and proc_to_procvar
typeconvn need this as resultdef so they know
that the address needs to be returned }
resultdef:=fprocdef;
{ process methodpointer/framepointer }
if assigned(left) then
typecheckpass(left);
end;
labelsym:
begin
tlabelsym(symtableentry).used:=true;
resultdef:=voidtype;
end;
else
internalerror(200104141);
end;
end;
procedure Tloadnode.mark_write;
begin
include(flags,nf_write);
end;
function tloadnode.pass_1 : tnode;
begin
result:=nil;
expectloc:=LOC_REFERENCE;
if (cs_create_pic in current_settings.moduleswitches) and
not(symtableentry.typ in [paravarsym,localvarsym]) then
include(current_procinfo.flags,pi_needs_got);
case symtableentry.typ of
absolutevarsym :
;
constsym:
begin
if tconstsym(symtableentry).consttyp=constresourcestring then
expectloc:=LOC_CREFERENCE;
end;
staticvarsym,
localvarsym,
paravarsym :
begin
if assigned(left) then
firstpass(left);
if not is_addr_param_load and
tabstractvarsym(symtableentry).is_regvar(is_addr_param_load) then
expectloc:=tvarregable2tcgloc[tabstractvarsym(symtableentry).varregable]
else
if (tabstractvarsym(symtableentry).varspez=vs_const) then
expectloc:=LOC_CREFERENCE;
if (target_info.system=system_powerpc_darwin) and
([vo_is_dll_var,vo_is_external] * tabstractvarsym(symtableentry).varoptions <> []) then
include(current_procinfo.flags,pi_needs_got);
{ call to get address of threadvar }
if (vo_is_thread_var in tabstractvarsym(symtableentry).varoptions) then
include(current_procinfo.flags,pi_do_call);
if nf_write in flags then
Tabstractvarsym(symtableentry).trigger_notifications(vn_onwrite)
else
Tabstractvarsym(symtableentry).trigger_notifications(vn_onread);
end;
procsym :
begin
{ initialise left for nested procs if necessary }
if (m_nested_procvars in current_settings.modeswitches) then
setprocdef(fprocdef);
{ method pointer or nested proc ? }
if assigned(left) then
begin
expectloc:=LOC_CREGISTER;
firstpass(left);
end;
end;
labelsym :
begin
if not assigned(tlabelsym(symtableentry).asmblocklabel) and
not assigned(tlabelsym(symtableentry).code) then
Message(parser_e_label_outside_proc);
end
else
internalerror(200104143);
end;
end;
function tloadnode.docompare(p: tnode): boolean;
begin
docompare :=
inherited docompare(p) and
(symtableentry = tloadnode(p).symtableentry) and
(fprocdef = tloadnode(p).fprocdef) and
(symtable = tloadnode(p).symtable);
end;
procedure tloadnode.printnodedata(var t:text);
begin
inherited printnodedata(t);
write(t,printnodeindention,'symbol = ',symtableentry.name);
if symtableentry.typ=procsym then
write(t,printnodeindention,'procdef = ',fprocdef.mangledname);
writeln(t,'');
end;
procedure tloadnode.setprocdef(p : tprocdef);
begin
fprocdef:=p;
resultdef:=p;
{ nested procedure? }
if assigned(p) and
is_nested_pd(p) then
begin
if not(m_nested_procvars in current_settings.modeswitches) then
CGMessage(type_e_cant_take_address_of_local_subroutine)
else
begin
{ parent frame pointer pointer as "self" }
left.free;
left:=cloadparentfpnode.create(tprocdef(p.owner.defowner),lpf_forpara);
end;
end
{ we should never go from nested to non-nested }
else if assigned(left) and
(left.nodetype=loadparentfpn) then
internalerror(2010072201);
end;
{*****************************************************************************
TASSIGNMENTNODE
*****************************************************************************}
function tassignmentnode.direct_shortstring_assignment: boolean;
begin
result:=
is_char(right.resultdef) or
(right.resultdef.typ=stringdef);
end;
constructor tassignmentnode.create(l,r : tnode);
begin
inherited create(assignn,l,r);
l.mark_write;
assigntype:=at_normal;
if r.nodetype = typeconvn then
ttypeconvnode(r).warn_pointer_to_signed:=false;
end;
constructor tassignmentnode.create_internal(l, r: tnode);
begin
create(l,r);
include(flags,nf_internal);
end;
constructor tassignmentnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
begin
inherited ppuload(t,ppufile);
assigntype:=tassigntype(ppufile.getbyte);
end;
procedure tassignmentnode.ppuwrite(ppufile:tcompilerppufile);
begin
inherited ppuwrite(ppufile);
ppufile.putbyte(byte(assigntype));
end;
function tassignmentnode.dogetcopy : tnode;
var
n : tassignmentnode;
begin
n:=tassignmentnode(inherited dogetcopy);
n.assigntype:=assigntype;
result:=n;
end;
function tassignmentnode.simplify(forinline : boolean) : tnode;
begin
result:=nil;
{ assignment nodes can perform several floating point }
{ type conversions directly, so no typeconversions }
{ are inserted in those cases. When inlining, a }
{ variable may be replaced by a constant which can be }
{ converted at compile time, so check for this case }
if is_real(left.resultdef) and
is_real(right.resultdef) and
is_constrealnode(right) and
not equal_defs(right.resultdef,left.resultdef) then
inserttypeconv(right,left.resultdef);
end;
function tassignmentnode.pass_typecheck:tnode;
var
hp : tnode;
useshelper : boolean;
oldassignmentnode : tassignmentnode;
begin
result:=nil;
resultdef:=voidtype;
{ must be made unique }
set_unique(left);
typecheckpass(left);
{ PI. This is needed to return correct resultdef of add nodes for ansistrings
rawbytestring return needs to be replaced by left.resultdef }
oldassignmentnode:=aktassignmentnode;
aktassignmentnode:=self;
typecheckpass(right);
aktassignmentnode:=oldassignmentnode;
set_varstate(right,vs_read,[vsf_must_be_valid]);
set_varstate(left,vs_written,[]);
if codegenerror then
exit;
{ tp procvar support, when we don't expect a procvar
then we need to call the procvar }
if (left.resultdef.typ<>procvardef) then
maybe_call_procvar(right,true);
{ assignments to formaldefs and open arrays aren't allowed }
if is_open_array(left.resultdef) then
CGMessage(type_e_assignment_not_allowed)
else if (left.resultdef.typ=formaldef) then
if not(target_info.system in systems_managed_vm) then
CGMessage(type_e_assignment_not_allowed)
else
begin
{ on managed platforms, assigning to formaldefs is allowed (but
typecasting them on the left hand side isn't), but primitive
values need to be boxed first }
if (right.resultdef.typ in [orddef,floatdef]) then
begin
right:=cinlinenode.create(in_box_x,false,ccallparanode.create(right,nil));
typecheckpass(right);
end;
end;
{ test if node can be assigned, properties are allowed }
if not(nf_internal in flags) then
if not valid_for_assignment(left,true) then
{ errors can in situations that cause the compiler to run out of
memory, such as assigning to an implicit pointer-to-array
converted node (that array is 2^31 or 2^63 bytes large) }
exit;
{ assigning nil to a dynamic array clears the array }
if is_dynamic_array(left.resultdef) and
(right.nodetype=niln) then
begin
{ remove property flag to avoid errors, see comments for }
{ tf_winlikewidestring assignments below }
exclude(left.flags,nf_isproperty);
{ generate a setlength node so it can be intercepted by
target-specific code }
result:=cinlinenode.create(in_setlength_x,false,
ccallparanode.create(genintconstnode(0),
ccallparanode.create(left,nil)));
left:=nil;
exit;
end;
{ shortstring helpers can do the conversion directly,
so treat them separatly }
if (is_shortstring(left.resultdef)) then
begin
{ insert typeconv, except for chars that are handled in
secondpass and except for ansi/wide string that can
be converted immediatly }
if not direct_shortstring_assignment then
inserttypeconv(right,left.resultdef);
if right.resultdef.typ=stringdef then
begin
useshelper:=true;
{ convert constant strings to shortstrings. But
skip empty constant strings, that will be handled
in secondpass }
if (right.nodetype=stringconstn) then
begin
{ verify if range fits within shortstring }
{ just emit a warning, delphi gives an }
{ error, only if the type definition of }
{ of the string is less < 255 characters }
if not is_open_string(left.resultdef) and
(tstringconstnode(right).len > tstringdef(left.resultdef).len) then
cgmessage(type_w_string_too_long);
inserttypeconv(right,left.resultdef);
if (right.nodetype=stringconstn) and
(tstringconstnode(right).len=0) then
useshelper:=false;
end
else if (tstringdef(right.resultdef).stringtype in [st_unicodestring,st_widestring]) then
Message2(type_w_implicit_string_cast_loss,right.resultdef.typename,left.resultdef.typename);
{ rest is done in pass 1 (JM) }
if useshelper then
exit;
end
end
{ floating point assignments can also perform the conversion directly }
else if is_real(left.resultdef) and is_real(right.resultdef) and
not is_constrealnode(right)
{$ifdef cpufpemu}
{ the emulator can't do this obviously }
and not(current_settings.fputype in [fpu_libgcc,fpu_soft])
{$endif cpufpemu}
{$ifdef x86}
{ the assignment node code can't convert a double in an }
{ sse register to an extended value in memory more }
{ efficiently than a type conversion node, so don't }
{ bother implementing support for that }
and (use_vectorfpu(left.resultdef) or not(use_vectorfpu(right.resultdef)))
{$endif}
{$ifdef arm}
{ the assignment node code can't convert a single in
an interger register to a double in an mmregister or
vice versa }
and (use_vectorfpu(left.resultdef) and
use_vectorfpu(right.resultdef) and
(tfloatdef(left.resultdef).floattype=tfloatdef(right.resultdef).floattype))
{$endif}
then
begin
check_ranges(fileinfo,right,left.resultdef);
end
else
begin
{ check if the assignment may cause a range check error }
check_ranges(fileinfo,right,left.resultdef);
{ beginners might be confused about an error message like
Incompatible types: got "untyped" expected "LongInt"
when trying to assign the result of a procedure, so give
a better error message, see also #19122 }
if (left.resultdef.typ<>procvardef) and
(right.nodetype=calln) and is_void(right.resultdef) then
CGMessage(type_e_procedures_return_no_value)
else
inserttypeconv(right,left.resultdef);
end;
{ call helpers for interface }
if is_interfacecom_or_dispinterface(left.resultdef) then
begin
{ Normal interface assignments are handled by the generic refcount incr/decr }
if not def_is_related(right.resultdef,left.resultdef) then
begin
{ remove property flag to avoid errors, see comments for }
{ tf_winlikewidestring assignments below }
exclude(left.flags,nf_isproperty);
hp:=
ccallparanode.create(
cguidconstnode.create(tobjectdef(left.resultdef).iidguid^),
ccallparanode.create(
ctypeconvnode.create_internal(right,voidpointertype),
ccallparanode.create(
ctypeconvnode.create_internal(left,voidpointertype),
nil)));
result:=ccallnode.createintern('fpc_intf_assign_by_iid',hp);
left:=nil;
right:=nil;
exit;
end;
end;
{ check if local proc/func is assigned to procvar }
if right.resultdef.typ=procvardef then
test_local_to_procvar(tprocvardef(right.resultdef),left.resultdef);
end;
function tassignmentnode.pass_1 : tnode;
var
hp: tnode;
oldassignmentnode : tassignmentnode;
hdef: tdef;
hs: string;
needrtti: boolean;
begin
result:=nil;
expectloc:=LOC_VOID;
firstpass(left);
{ Optimize the reuse of the destination of the assingment in left.
Allow the use of the left inside the tree generated on the right.
This is especially useful for string routines where the destination
is pushed as a parameter. Using the final destination of left directly
save a temp allocation and copy of data (PFV) }
oldassignmentnode:=aktassignmentnode;
aktassignmentnode:=self;
firstpass(right);
aktassignmentnode:=oldassignmentnode;
if nf_assign_done_in_right in flags then
begin
result:=right;
right:=nil;
exit;
end;
if codegenerror then
exit;
{ assignment to refcounted variable -> inc/decref }
if is_managed_type(left.resultdef) then
include(current_procinfo.flags,pi_do_call);
needrtti:=false;
if (is_shortstring(left.resultdef)) then
begin
if right.resultdef.typ=stringdef then
begin
if (right.nodetype<>stringconstn) or
(tstringconstnode(right).len<>0) then
begin
{ remove property flag to avoid errors, see comments for }
{ tf_winlikewidestring assignments below }
exclude(left.flags, nf_isproperty);
hp:=ccallparanode.create
(right,
ccallparanode.create(left,nil));
result:=ccallnode.createintern('fpc_'+tstringdef(right.resultdef).stringtypname+'_to_shortstr',hp);
firstpass(result);
left:=nil;
right:=nil;
end;
end;
exit;
end
{ call helpers for composite types containing automated types }
else if is_managed_type(left.resultdef) and
(left.resultdef.typ in [arraydef,objectdef,recorddef]) and
not is_interfacecom_or_dispinterface(left.resultdef) and
not is_dynamic_array(left.resultdef) and
not(target_info.system in systems_garbage_collected_managed_types) then
begin
hp:=ccallparanode.create(caddrnode.create_internal(
crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
ccallparanode.create(ctypeconvnode.create_internal(
caddrnode.create_internal(left),voidpointertype),
ccallparanode.create(ctypeconvnode.create_internal(
caddrnode.create_internal(right),voidpointertype),
nil)));
result:=ccallnode.createintern('fpc_copy_proc',hp);
firstpass(result);
left:=nil;
right:=nil;
exit;
end
{ call helpers for variant, they can contain non ref. counted types like
vararrays which must be really copied }
else if (left.resultdef.typ=variantdef) and
not(target_info.system in systems_garbage_collected_managed_types) then
begin
{ remove property flag to avoid errors, see comments for }
{ tf_winlikewidestring assignments below }
exclude(left.flags,nf_isproperty);
hdef:=search_system_type('TVARDATA').typedef;
hp:=ccallparanode.create(ctypeconvnode.create_internal(
right,hdef),
ccallparanode.create(ctypeconvnode.create_internal(
left,hdef),
nil));
result:=ccallnode.createintern('fpc_variant_copy',hp);
firstpass(result);
left:=nil;
right:=nil;
exit;
end
else if not(target_info.system in systems_garbage_collected_managed_types) and
not(is_const(left)) then
begin
{ call helpers for pointer-sized managed types }
if is_widestring(left.resultdef) then
hs:='fpc_widestr_assign'
else if is_ansistring(left.resultdef) then
hs:='fpc_ansistr_assign'
else if is_unicodestring(left.resultdef) then
hs:='fpc_unicodestr_assign'
else if is_interfacecom_or_dispinterface(left.resultdef) then
hs:='fpc_intf_assign'
else if is_dynamic_array(left.resultdef) then
begin
hs:='fpc_dynarray_assign';
needrtti:=true;
end
else
exit;
end
else
exit;
{ The first argument of these procedures is a var parameter. Properties cannot }
{ be passed to var or out parameters, because in that case setters/getters are not }
{ used. Further, if we would allow it in case there are no getters or setters, you }
{ would need source changes in case these are introduced later on, thus defeating }
{ part of the transparency advantages of properties. In this particular case, }
{ however: }
{ a) if there is a setter, this code will not be used since then the assignment }
{ will be converted to a procedure call }
{ b) the getter is irrelevant, because fpc_widestr_assign must always decrease }
{ the refcount of the field to which we are writing }
{ c) source code changes are not required if a setter is added/removed, because }
{ this transformation is handled at compile time }
{ -> we can remove the nf_isproperty flag (if any) from left, so that in case it }
{ is a property which refers to a field without a setter call, we will not get }
{ an error about trying to pass a property as a var parameter }
exclude(left.flags,nf_isproperty);
hp:=ccallparanode.create(ctypeconvnode.create_internal(right,voidpointertype),
ccallparanode.create(ctypeconvnode.create_internal(left,voidpointertype),
nil));
if needrtti then
hp:=ccallparanode.create(
caddrnode.create_internal(
crttinode.create(tstoreddef(left.resultdef),initrtti,rdt_normal)),
hp);
result:=ccallnode.createintern(hs,hp);
firstpass(result);
left:=nil;
right:=nil;
end;
function tassignmentnode.docompare(p: tnode): boolean;
begin
docompare :=
inherited docompare(p) and
(assigntype = tassignmentnode(p).assigntype);
end;
{$ifdef state_tracking}
function Tassignmentnode.track_state_pass(exec_known:boolean):boolean;
var se:Tstate_entry;
begin
track_state_pass:=false;
if exec_known then
begin
track_state_pass:=right.track_state_pass(exec_known);
{Force a new resultdef pass.}
right.resultdef:=nil;
do_typecheckpass(right);
typecheckpass(right);
aktstate.store_fact(left.getcopy,right.getcopy);
end
else
aktstate.delete_fact(left);
end;
{$endif}
{*****************************************************************************
TARRAYCONSTRUCTORRANGENODE
*****************************************************************************}
constructor tarrayconstructorrangenode.create(l,r : tnode);
begin
inherited create(arrayconstructorrangen,l,r);
end;
function tarrayconstructorrangenode.pass_typecheck:tnode;
begin
result:=nil;
typecheckpass(left);
typecheckpass(right);
set_varstate(left,vs_read,[vsf_must_be_valid]);
set_varstate(right,vs_read,[vsf_must_be_valid]);
if codegenerror then
exit;
resultdef:=left.resultdef;
end;
function tarrayconstructorrangenode.pass_1 : tnode;
begin
result:=nil;
CGMessage(parser_e_illegal_expression);
end;
{****************************************************************************
TARRAYCONSTRUCTORNODE
*****************************************************************************}
constructor tarrayconstructornode.create(l,r : tnode);
begin
inherited create(arrayconstructorn,l,r);
end;
function tarrayconstructornode.dogetcopy : tnode;
var
n : tarrayconstructornode;
begin
n:=tarrayconstructornode(inherited dogetcopy);
result:=n;
end;
function tarrayconstructornode.pass_typecheck:tnode;
var
hdef : tdef;
hp : tarrayconstructornode;
len : longint;
varia : boolean;
eq : tequaltype;
hnodetype : tnodetype;
begin
result:=nil;
{ are we allowing array constructor? Then convert it to a set.
Do this only if we didn't convert the arrayconstructor yet. This
is needed for the cases where the resultdef is forced for a second
run }
if not(allow_array_constructor) then
begin
hp:=tarrayconstructornode(getcopy);
arrayconstructor_to_set(tnode(hp));
result:=hp;
exit;
end;
{ only pass left tree, right tree contains next construct if any }
hdef:=nil;
hnodetype:=errorn;
len:=0;
varia:=false;
if assigned(left) then
begin
hp:=self;
while assigned(hp) do
begin
typecheckpass(hp.left);
set_varstate(hp.left,vs_read,[vsf_must_be_valid]);
if (hdef=nil) then
begin
hdef:=hp.left.resultdef;
hnodetype:=hp.left.nodetype;
end
else
begin
{ If we got a niln we don't know the type yet and need to take the
type of the next array element.
This is to handle things like [nil,tclass,tclass], see also tw8371 (PFV) }
if hnodetype=niln then
begin
eq:=compare_defs(hp.left.resultdef,hdef,hnodetype);
if eq>te_incompatible then
begin
hdef:=hp.left.resultdef;
hnodetype:=hp.left.nodetype;
end;
end
else
eq:=compare_defs(hdef,hp.left.resultdef,hp.left.nodetype);
if (not varia) and (eq<te_equal) then
begin
{ If both are integers we need to take the type that can hold both
defs }
if is_integer(hdef) and is_integer(hp.left.resultdef) then
begin
if is_in_limit(hdef,hp.left.resultdef) then
hdef:=hp.left.resultdef;
end
else
if (nf_novariaallowed in flags) then
varia:=true;
end;
end;
inc(len);
hp:=tarrayconstructornode(hp.right);
end;
end;
{ Set the type of empty or varia arrays to void. Also
do this if the type is array of const/open array
because those can't be used with setelementdef }
if not assigned(hdef) or
varia or
is_array_of_const(hdef) or
is_open_array(hdef) then
hdef:=voidtype;
resultdef:=carraydef.create(0,len-1,s32inttype);
tarraydef(resultdef).elementdef:=hdef;
include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
if varia then
include(tarraydef(resultdef).arrayoptions,ado_IsVariant);
end;
procedure tarrayconstructornode.force_type(def:tdef);
var
hp : tarrayconstructornode;
begin
tarraydef(resultdef).elementdef:=def;
include(tarraydef(resultdef).arrayoptions,ado_IsConstructor);
exclude(tarraydef(resultdef).arrayoptions,ado_IsVariant);
if assigned(left) then
begin
hp:=self;
while assigned(hp) do
begin
inserttypeconv(hp.left,def);
hp:=tarrayconstructornode(hp.right);
end;
end;
end;
procedure tarrayconstructornode.insert_typeconvs;
var
hp : tarrayconstructornode;
dovariant : boolean;
begin
dovariant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
{ only pass left tree, right tree contains next construct if any }
if assigned(left) then
begin
hp:=self;
while assigned(hp) do
begin
typecheckpass(hp.left);
{ Insert typeconvs for array of const }
if dovariant then
{ at this time C varargs are no longer an arrayconstructornode }
insert_varargstypeconv(hp.left,false);
hp:=tarrayconstructornode(hp.right);
end;
end;
end;
function tarrayconstructornode.pass_1 : tnode;
var
hp : tarrayconstructornode;
do_variant,
do_managed_variant:boolean;
begin
do_variant:=(nf_forcevaria in flags) or (ado_isvariant in tarraydef(resultdef).arrayoptions);
do_managed_variant:=
do_variant and
(target_info.system in systems_managed_vm);
result:=nil;
{ Insert required type convs, this must be
done in pass 1, because the call must be
typecheckpassed already }
if assigned(left) then
begin
insert_typeconvs;
{ call firstpass for all nodes }
hp:=self;
while assigned(hp) do
begin
if hp.left<>nil then
begin
{This check is pessimistic; a call will happen depending
on the location in which the elements will be found in
pass 2.}
if not do_variant then
include(current_procinfo.flags,pi_do_call);
firstpass(hp.left);
if do_managed_variant then
wrapmanagedvarrec(hp.left);
end;
hp:=tarrayconstructornode(hp.right);
end;
end;
{ set the elementdef to the correct type in case of a managed
variant array }
if do_managed_variant then
tarraydef(resultdef).elementdef:=search_system_type('TVARREC').typedef;
expectloc:=LOC_CREFERENCE;
end;
function tarrayconstructornode.docompare(p: tnode): boolean;
begin
docompare:=inherited docompare(p);
end;
{*****************************************************************************
TTYPENODE
*****************************************************************************}
constructor ttypenode.create(def:tdef);
begin
inherited create(typen);
typedef:=def;
typesym:=def.typesym;
allowed:=false;
helperallowed:=false;
end;
constructor ttypenode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
begin
inherited ppuload(t,ppufile);
ppufile.getderef(typedefderef);
ppufile.getderef(typesymderef);
allowed:=boolean(ppufile.getbyte);
helperallowed:=boolean(ppufile.getbyte);
end;
procedure ttypenode.ppuwrite(ppufile:tcompilerppufile);
begin
inherited ppuwrite(ppufile);
ppufile.putderef(typedefderef);
ppufile.putderef(typesymderef);
ppufile.putbyte(byte(allowed));
ppufile.putbyte(byte(helperallowed));
end;
procedure ttypenode.buildderefimpl;
begin
inherited buildderefimpl;
typedefderef.build(typedef);
typesymderef.build(typesym);
end;
procedure ttypenode.derefimpl;
begin
inherited derefimpl;
typedef:=tdef(typedefderef.resolve);
typesym:=tsym(typesymderef.resolve);
end;
function ttypenode.pass_typecheck:tnode;
begin
result:=nil;
resultdef:=typedef;
{ check if it's valid }
if typedef.typ = errordef then
CGMessage(parser_e_illegal_expression);
end;
function ttypenode.pass_1 : tnode;
begin
result:=nil;
expectloc:=LOC_VOID;
{ a typenode can't generate code, so we give here
an error. Else it'll be an abstract error in pass_generate_code.
Only when the allowed flag is set we don't generate
an error }
if not allowed then
CGMessage(parser_e_no_type_not_allowed_here);
if not helperallowed and is_objectpascal_helper(typedef) then
CGMessage(parser_e_no_category_as_types);
end;
function ttypenode.dogetcopy : tnode;
var
n : ttypenode;
begin
n:=ttypenode(inherited dogetcopy);
n.allowed:=allowed;
n.typedef:=typedef;
n.helperallowed:=helperallowed;
result:=n;
end;
function ttypenode.docompare(p: tnode): boolean;
begin
docompare :=
inherited docompare(p) and
(typedef=ttypenode(p).typedef) and
(allowed=ttypenode(p).allowed) and
(helperallowed=ttypenode(p).helperallowed);
end;
{*****************************************************************************
TRTTINODE
*****************************************************************************}
constructor trttinode.create(def:tstoreddef;rt:trttitype;dt:Trttidatatype);
begin
inherited create(rttin);
rttidef:=def;
rttitype:=rt;
rttidatatype:=dt;
end;
constructor trttinode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
begin
inherited ppuload(t,ppufile);
ppufile.getderef(rttidefderef);
rttitype:=trttitype(ppufile.getbyte);
rttidatatype:=trttidatatype(ppufile.getbyte);
end;
procedure trttinode.ppuwrite(ppufile:tcompilerppufile);
begin
inherited ppuwrite(ppufile);
ppufile.putderef(rttidefderef);
ppufile.putbyte(byte(rttitype));
ppufile.putbyte(byte(rttidatatype));
end;
procedure trttinode.buildderefimpl;
begin
inherited buildderefimpl;
rttidefderef.build(rttidef);
end;
procedure trttinode.derefimpl;
begin
inherited derefimpl;
rttidef:=tstoreddef(rttidefderef.resolve);
end;
function trttinode.dogetcopy : tnode;
var
n : trttinode;
begin
n:=trttinode(inherited dogetcopy);
n.rttidef:=rttidef;
n.rttitype:=rttitype;
n.rttidatatype:=rttidatatype;
result:=n;
end;
function trttinode.pass_typecheck:tnode;
begin
{ rtti information will be returned as a void pointer }
result:=nil;
resultdef:=voidpointertype;
end;
function trttinode.pass_1 : tnode;
begin
result:=nil;
expectloc:=LOC_CREFERENCE;
if (cs_create_pic in current_settings.moduleswitches) and
(tf_pic_uses_got in target_info.flags) then
include(current_procinfo.flags,pi_needs_got);
end;
function trttinode.docompare(p: tnode): boolean;
begin
docompare :=
inherited docompare(p) and
(rttidef = trttinode(p).rttidef) and
(rttitype = trttinode(p).rttitype) and
(rttidatatype = trttinode(p).rttidatatype);
end;
end.
|