ncal.pas 113 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 by Florian Klaempfl
  4. This file implements the node for sub procedure calling.
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit ncal;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. cutils,cclasses,
  23. globtype,cpuinfo,
  24. node,nbas,
  25. {$ifdef state_tracking}
  26. nstate,
  27. {$endif state_tracking}
  28. symbase,symtype,symppu,symsym,symdef,symtable;
  29. type
  30. pcandidate = ^tcandidate;
  31. tcandidate = record
  32. next : pcandidate;
  33. data : tprocdef;
  34. wrongpara,
  35. firstpara : tparaitem;
  36. exact_count,
  37. equal_count,
  38. cl1_count,
  39. cl2_count,
  40. cl3_count,
  41. coper_count : integer; { should be signed }
  42. ordinal_distance : bestreal;
  43. invalid : boolean;
  44. wrongparanr : byte;
  45. end;
  46. tcallnode = class(tbinarynode)
  47. private
  48. paravisible : boolean;
  49. paralength : smallint;
  50. function candidates_find:pcandidate;
  51. procedure candidates_free(procs:pcandidate);
  52. procedure candidates_list(procs:pcandidate;all:boolean);
  53. procedure candidates_get_information(procs:pcandidate);
  54. function candidates_choose_best(procs:pcandidate;var bestpd:tprocdef):integer;
  55. procedure candidates_find_wrong_para(procs:pcandidate);
  56. {$ifdef EXTDEBUG}
  57. procedure candidates_dump_info(lvl:longint;procs:pcandidate);
  58. {$endif EXTDEBUG}
  59. function gen_self_tree_methodpointer:tnode;
  60. function gen_self_tree:tnode;
  61. function gen_vmt_tree:tnode;
  62. procedure bind_paraitem;
  63. { function return node, this is used to pass the data for a
  64. ret_in_param return value }
  65. _funcretnode : tnode;
  66. procedure setfuncretnode(const returnnode: tnode);
  67. procedure convert_carg_array_of_const;
  68. public
  69. { the symbol containing the definition of the procedure }
  70. { to call }
  71. symtableprocentry : tprocsym;
  72. symtableprocentryderef : tderef;
  73. { symtable where the entry was found, needed for with support }
  74. symtableproc : tsymtable;
  75. { the definition of the procedure to call }
  76. procdefinition : tabstractprocdef;
  77. procdefinitionderef : tderef;
  78. { tree that contains the pointer to the object for this method }
  79. methodpointer : tnode;
  80. { inline function body }
  81. inlinecode : tnode;
  82. { varargs tparaitems }
  83. varargsparas : tlinkedlist;
  84. { node that specifies where the result should be put for calls }
  85. { that return their result in a parameter }
  86. property funcretnode: tnode read _funcretnode write setfuncretnode;
  87. { separately specified resulttype for some compilerprocs (e.g. }
  88. { you can't have a function with an "array of char" resulttype }
  89. { the RTL) (JM) }
  90. restype: ttype;
  91. restypeset: boolean;
  92. { only the processor specific nodes need to override this }
  93. { constructor }
  94. constructor create(l:tnode; v : tprocsym;st : tsymtable; mp : tnode);virtual;
  95. constructor create_def(l:tnode;def:tprocdef;mp:tnode);virtual;
  96. constructor create_procvar(l,r:tnode);
  97. constructor createintern(const name: string; params: tnode);
  98. constructor createinternres(const name: string; params: tnode; const res: ttype);
  99. constructor createinternreturn(const name: string; params: tnode; returnnode : tnode);
  100. destructor destroy;override;
  101. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  102. procedure ppuwrite(ppufile:tcompilerppufile);override;
  103. procedure buildderefimpl;override;
  104. procedure derefimpl;override;
  105. function getcopy : tnode;override;
  106. { Goes through all symbols in a class and subclasses and calls
  107. verify abstract for each .
  108. }
  109. procedure verifyabstractcalls;
  110. { called for each definition in a class and verifies if a method
  111. is abstract or not, if it is abstract, give out a warning
  112. }
  113. procedure verifyabstract(p : tnamedindexitem;arg:pointer);
  114. procedure insertintolist(l : tnodelist);override;
  115. function pass_1 : tnode;override;
  116. function det_resulttype:tnode;override;
  117. {$ifdef state_tracking}
  118. function track_state_pass(exec_known:boolean):boolean;override;
  119. {$endif state_tracking}
  120. function docompare(p: tnode): boolean; override;
  121. procedure printnodedata(var t:text);override;
  122. function para_count:longint;
  123. private
  124. AbstractMethodsList : TStringList;
  125. end;
  126. tcallnodeclass = class of tcallnode;
  127. tcallparaflags = (
  128. { flags used by tcallparanode }
  129. cpf_is_colon_para
  130. );
  131. tcallparanode = class(tbinarynode)
  132. public
  133. callparaflags : set of tcallparaflags;
  134. paraitem : tparaitem;
  135. used_by_callnode : boolean;
  136. { only the processor specific nodes need to override this }
  137. { constructor }
  138. constructor create(expr,next : tnode);virtual;
  139. destructor destroy;override;
  140. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  141. procedure ppuwrite(ppufile:tcompilerppufile);override;
  142. function getcopy : tnode;override;
  143. procedure insertintolist(l : tnodelist);override;
  144. procedure get_paratype;
  145. procedure insert_typeconv(do_count : boolean);
  146. procedure det_registers;
  147. procedure firstcallparan;
  148. procedure secondcallparan;virtual;abstract;
  149. function docompare(p: tnode): boolean; override;
  150. procedure printnodetree(var t:text);override;
  151. end;
  152. tcallparanodeclass = class of tcallparanode;
  153. function reverseparameters(p: tcallparanode): tcallparanode;
  154. var
  155. ccallnode : tcallnodeclass;
  156. ccallparanode : tcallparanodeclass;
  157. { Current callnode, this is needed for having a link
  158. between the callparanodes and the callnode they belong to }
  159. aktcallnode : tcallnode;
  160. implementation
  161. uses
  162. systems,
  163. verbose,globals,
  164. symconst,paramgr,defutil,defcmp,
  165. htypechk,pass_1,
  166. ncnv,nld,ninl,nadd,ncon,nmem,
  167. procinfo,
  168. cgbase
  169. ;
  170. type
  171. tobjectinfoitem = class(tlinkedlistitem)
  172. objinfo : tobjectdef;
  173. constructor create(def : tobjectdef);
  174. end;
  175. {****************************************************************************
  176. HELPERS
  177. ****************************************************************************}
  178. function reverseparameters(p: tcallparanode): tcallparanode;
  179. var
  180. hp1, hp2: tcallparanode;
  181. begin
  182. hp1:=nil;
  183. while assigned(p) do
  184. begin
  185. { pull out }
  186. hp2:=p;
  187. p:=tcallparanode(p.right);
  188. { pull in }
  189. hp2.right:=hp1;
  190. hp1:=hp2;
  191. end;
  192. reverseparameters:=hp1;
  193. end;
  194. function gen_high_tree(p:tnode;openstring:boolean):tnode;
  195. var
  196. temp: tnode;
  197. len : integer;
  198. loadconst : boolean;
  199. hightree : tnode;
  200. begin
  201. len:=-1;
  202. loadconst:=true;
  203. hightree:=nil;
  204. case p.resulttype.def.deftype of
  205. arraydef :
  206. begin
  207. { handle via a normal inline in_high_x node }
  208. loadconst := false;
  209. hightree := geninlinenode(in_high_x,false,p.getcopy);
  210. { only substract low(array) if it's <> 0 }
  211. temp := geninlinenode(in_low_x,false,p.getcopy);
  212. resulttypepass(temp);
  213. if (temp.nodetype <> ordconstn) or
  214. (tordconstnode(temp).value <> 0) then
  215. hightree := caddnode.create(subn,hightree,temp)
  216. else
  217. temp.free;
  218. end;
  219. stringdef :
  220. begin
  221. if openstring then
  222. begin
  223. { handle via a normal inline in_high_x node }
  224. loadconst := false;
  225. hightree := geninlinenode(in_high_x,false,p.getcopy);
  226. end
  227. else
  228. begin
  229. { passing a string to an array of char }
  230. if (p.nodetype=stringconstn) then
  231. begin
  232. len:=str_length(p);
  233. if len>0 then
  234. dec(len);
  235. end
  236. else
  237. begin
  238. hightree:=caddnode.create(subn,geninlinenode(in_length_x,false,p.getcopy),
  239. cordconstnode.create(1,s32bittype,false));
  240. loadconst:=false;
  241. end;
  242. end;
  243. end;
  244. else
  245. len:=0;
  246. end;
  247. if loadconst then
  248. hightree:=cordconstnode.create(len,s32bittype,true)
  249. else
  250. begin
  251. if not assigned(hightree) then
  252. internalerror(200304071);
  253. hightree:=ctypeconvnode.create(hightree,s32bittype);
  254. end;
  255. result:=hightree;
  256. end;
  257. function is_better_candidate(currpd,bestpd:pcandidate):integer;
  258. var
  259. res : integer;
  260. begin
  261. {
  262. Return values:
  263. > 0 when currpd is better than bestpd
  264. < 0 when bestpd is better than currpd
  265. = 0 when both are equal
  266. To choose the best candidate we use the following order:
  267. - Incompatible flag
  268. - (Smaller) Number of convert operator parameters.
  269. - (Smaller) Number of convertlevel 2 parameters.
  270. - (Smaller) Number of convertlevel 1 parameters.
  271. - (Bigger) Number of exact parameters.
  272. - (Smaller) Number of equal parameters.
  273. - (Smaller) Total of ordinal distance. For example, the distance of a word
  274. to a byte is 65535-255=65280.
  275. }
  276. if bestpd^.invalid then
  277. begin
  278. if currpd^.invalid then
  279. res:=0
  280. else
  281. res:=1;
  282. end
  283. else
  284. if currpd^.invalid then
  285. res:=-1
  286. else
  287. begin
  288. { less operator parameters? }
  289. res:=(bestpd^.coper_count-currpd^.coper_count);
  290. if (res=0) then
  291. begin
  292. { less cl3 parameters? }
  293. res:=(bestpd^.cl3_count-currpd^.cl3_count);
  294. if (res=0) then
  295. begin
  296. { less cl2 parameters? }
  297. res:=(bestpd^.cl2_count-currpd^.cl2_count);
  298. if (res=0) then
  299. begin
  300. { less cl1 parameters? }
  301. res:=(bestpd^.cl1_count-currpd^.cl1_count);
  302. if (res=0) then
  303. begin
  304. { more exact parameters? }
  305. res:=(currpd^.exact_count-bestpd^.exact_count);
  306. if (res=0) then
  307. begin
  308. { less equal parameters? }
  309. res:=(bestpd^.equal_count-currpd^.equal_count);
  310. if (res=0) then
  311. begin
  312. { smaller ordinal distance? }
  313. if (currpd^.ordinal_distance<bestpd^.ordinal_distance) then
  314. res:=1
  315. else
  316. if (currpd^.ordinal_distance>bestpd^.ordinal_distance) then
  317. res:=-1
  318. else
  319. res:=0;
  320. end;
  321. end;
  322. end;
  323. end;
  324. end;
  325. end;
  326. end;
  327. is_better_candidate:=res;
  328. end;
  329. procedure var_para_allowed(var eq:tequaltype;def_from,def_to:Tdef);
  330. begin
  331. { Note: eq must be already valid, it will only be updated! }
  332. case def_to.deftype of
  333. formaldef :
  334. begin
  335. { all types can be passed to a formaldef }
  336. eq:=te_equal;
  337. end;
  338. orddef :
  339. begin
  340. { allows conversion from word to integer and
  341. byte to shortint, but only for TP7 compatibility }
  342. if (m_tp7 in aktmodeswitches) and
  343. (def_from.deftype=orddef) and
  344. (def_from.size=def_to.size) then
  345. eq:=te_convert_l1;
  346. end;
  347. arraydef :
  348. begin
  349. if is_open_array(def_to) and
  350. is_dynamic_array(def_from) and
  351. equal_defs(tarraydef(def_from).elementtype.def,tarraydef(def_to).elementtype.def) then
  352. eq:=te_convert_l2;
  353. end;
  354. pointerdef :
  355. begin
  356. { an implicit pointer conversion is allowed }
  357. if (def_from.deftype=pointerdef) then
  358. eq:=te_convert_l1;
  359. end;
  360. stringdef :
  361. begin
  362. { all shortstrings are allowed, size is not important }
  363. if is_shortstring(def_from) and
  364. is_shortstring(def_to) then
  365. eq:=te_equal;
  366. end;
  367. objectdef :
  368. begin
  369. { child objects can be also passed }
  370. { in non-delphi mode, otherwise }
  371. { they must match exactly, except }
  372. { if they are objects }
  373. if (def_from.deftype=objectdef) and
  374. (
  375. not(m_delphi in aktmodeswitches) or
  376. (
  377. (tobjectdef(def_from).objecttype=odt_object) and
  378. (tobjectdef(def_to).objecttype=odt_object)
  379. )
  380. ) and
  381. (tobjectdef(def_from).is_related(tobjectdef(def_to))) then
  382. eq:=te_convert_l1;
  383. end;
  384. filedef :
  385. begin
  386. { an implicit file conversion is also allowed }
  387. { from a typed file to an untyped one }
  388. if (def_from.deftype=filedef) and
  389. (tfiledef(def_from).filetyp = ft_typed) and
  390. (tfiledef(def_to).filetyp = ft_untyped) then
  391. eq:=te_convert_l1;
  392. end;
  393. end;
  394. end;
  395. procedure para_allowed(var eq:tequaltype;p:tcallparanode;def_to:tdef);
  396. begin
  397. { Note: eq must be already valid, it will only be updated! }
  398. case def_to.deftype of
  399. formaldef :
  400. begin
  401. { all types can be passed to a formaldef }
  402. eq:=te_equal;
  403. end;
  404. stringdef :
  405. begin
  406. { to support ansi/long/wide strings in a proper way }
  407. { string and string[10] are assumed as equal }
  408. { when searching the correct overloaded procedure }
  409. if (p.resulttype.def.deftype=stringdef) and
  410. (tstringdef(def_to).string_typ=tstringdef(p.resulttype.def).string_typ) then
  411. eq:=te_equal
  412. else
  413. { Passing a constant char to ansistring or shortstring or
  414. a widechar to widestring then handle it as equal. }
  415. if (p.left.nodetype=ordconstn) and
  416. (
  417. is_char(p.resulttype.def) and
  418. (is_shortstring(def_to) or is_ansistring(def_to))
  419. ) or
  420. (
  421. is_widechar(p.resulttype.def) and
  422. is_widestring(def_to)
  423. ) then
  424. eq:=te_equal
  425. end;
  426. setdef :
  427. begin
  428. { set can also be a not yet converted array constructor }
  429. if (p.resulttype.def.deftype=arraydef) and
  430. (tarraydef(p.resulttype.def).IsConstructor) and
  431. not(tarraydef(p.resulttype.def).IsVariant) then
  432. eq:=te_equal;
  433. end;
  434. procvardef :
  435. begin
  436. { in tp7 mode proc -> procvar is allowed }
  437. if (m_tp_procvar in aktmodeswitches) and
  438. (p.left.nodetype=calln) and
  439. (proc_to_procvar_equal(tprocdef(tcallnode(p.left).procdefinition),tprocvardef(def_to),true)>=te_equal) then
  440. eq:=te_equal;
  441. end;
  442. end;
  443. end;
  444. {****************************************************************************
  445. TOBJECTINFOITEM
  446. ****************************************************************************}
  447. constructor tobjectinfoitem.create(def : tobjectdef);
  448. begin
  449. inherited create;
  450. objinfo := def;
  451. end;
  452. {****************************************************************************
  453. TCALLPARANODE
  454. ****************************************************************************}
  455. constructor tcallparanode.create(expr,next : tnode);
  456. begin
  457. inherited create(callparan,expr,next);
  458. if not assigned(expr) then
  459. internalerror(200305091);
  460. expr.set_file_line(self);
  461. callparaflags:=[];
  462. end;
  463. destructor tcallparanode.destroy;
  464. begin
  465. { When the node is used by callnode then
  466. we don't destroy left, the callnode takes care of it }
  467. if used_by_callnode then
  468. left:=nil;
  469. inherited destroy;
  470. end;
  471. constructor tcallparanode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  472. begin
  473. inherited ppuload(t,ppufile);
  474. ppufile.getsmallset(callparaflags);
  475. end;
  476. procedure tcallparanode.ppuwrite(ppufile:tcompilerppufile);
  477. begin
  478. inherited ppuwrite(ppufile);
  479. ppufile.putsmallset(callparaflags);
  480. end;
  481. function tcallparanode.getcopy : tnode;
  482. var
  483. n : tcallparanode;
  484. begin
  485. n:=tcallparanode(inherited getcopy);
  486. n.callparaflags:=callparaflags;
  487. n.paraitem:=paraitem;
  488. result:=n;
  489. end;
  490. procedure tcallparanode.insertintolist(l : tnodelist);
  491. begin
  492. end;
  493. procedure tcallparanode.get_paratype;
  494. var
  495. old_array_constructor : boolean;
  496. begin
  497. inc(parsing_para_level);
  498. if assigned(right) then
  499. tcallparanode(right).get_paratype;
  500. old_array_constructor:=allow_array_constructor;
  501. allow_array_constructor:=true;
  502. resulttypepass(left);
  503. allow_array_constructor:=old_array_constructor;
  504. if codegenerror then
  505. resulttype:=generrortype
  506. else
  507. resulttype:=left.resulttype;
  508. dec(parsing_para_level);
  509. end;
  510. procedure tcallparanode.insert_typeconv(do_count : boolean);
  511. var
  512. oldtype : ttype;
  513. {$ifdef extdebug}
  514. store_count_ref : boolean;
  515. {$endif def extdebug}
  516. begin
  517. inc(parsing_para_level);
  518. {$ifdef extdebug}
  519. if do_count then
  520. begin
  521. store_count_ref:=count_ref;
  522. count_ref:=true;
  523. end;
  524. {$endif def extdebug}
  525. { Be sure to have the resulttype }
  526. if not assigned(left.resulttype.def) then
  527. resulttypepass(left);
  528. if (left.nodetype<>nothingn) then
  529. begin
  530. { Handle varargs and hidden paras directly, no typeconvs or }
  531. { typechecking needed }
  532. if (nf_varargs_para in flags) then
  533. begin
  534. { convert pascal to C types }
  535. case left.resulttype.def.deftype of
  536. stringdef :
  537. inserttypeconv(left,charpointertype);
  538. floatdef :
  539. inserttypeconv(left,s64floattype);
  540. end;
  541. set_varstate(left,vs_used,true);
  542. resulttype:=left.resulttype;
  543. end
  544. else
  545. if (paraitem.is_hidden) then
  546. begin
  547. set_varstate(left,vs_used,true);
  548. resulttype:=left.resulttype;
  549. end
  550. else
  551. begin
  552. { Do we need arrayconstructor -> set conversion, then insert
  553. it here before the arrayconstructor node breaks the tree
  554. with its conversions of enum->ord }
  555. if (left.nodetype=arrayconstructorn) and
  556. (paraitem.paratype.def.deftype=setdef) then
  557. inserttypeconv(left,paraitem.paratype);
  558. { set some settings needed for arrayconstructor }
  559. if is_array_constructor(left.resulttype.def) then
  560. begin
  561. if is_array_of_const(paraitem.paratype.def) then
  562. begin
  563. { force variant array }
  564. include(left.flags,nf_forcevaria);
  565. end
  566. else
  567. begin
  568. include(left.flags,nf_novariaallowed);
  569. { now that the resultting type is know we can insert the required
  570. typeconvs for the array constructor }
  571. tarrayconstructornode(left).force_type(tarraydef(paraitem.paratype.def).elementtype);
  572. end;
  573. end;
  574. { check if local proc/func is assigned to procvar }
  575. if left.resulttype.def.deftype=procvardef then
  576. test_local_to_procvar(tprocvardef(left.resulttype.def),paraitem.paratype.def);
  577. { test conversions }
  578. if not(is_shortstring(left.resulttype.def) and
  579. is_shortstring(paraitem.paratype.def)) and
  580. (paraitem.paratype.def.deftype<>formaldef) then
  581. begin
  582. { Process open parameters }
  583. if paramanager.push_high_param(paraitem.paratyp,paraitem.paratype.def,aktcallnode.procdefinition.proccalloption) then
  584. begin
  585. { insert type conv but hold the ranges of the array }
  586. oldtype:=left.resulttype;
  587. inserttypeconv(left,paraitem.paratype);
  588. left.resulttype:=oldtype;
  589. end
  590. else
  591. begin
  592. { for ordinals, floats and enums, verify if we might cause
  593. some range-check errors. }
  594. if (paraitem.paratype.def.deftype in [enumdef,orddef,floatdef]) and
  595. (left.resulttype.def.deftype in [enumdef,orddef,floatdef]) and
  596. (left.nodetype in [vecn,loadn,calln]) then
  597. begin
  598. if (left.resulttype.def.size>paraitem.paratype.def.size) then
  599. begin
  600. if (cs_check_range in aktlocalswitches) then
  601. Message(type_w_smaller_possible_range_check)
  602. else
  603. Message(type_h_smaller_possible_range_check);
  604. end;
  605. end;
  606. inserttypeconv(left,paraitem.paratype);
  607. end;
  608. if codegenerror then
  609. begin
  610. dec(parsing_para_level);
  611. exit;
  612. end;
  613. end;
  614. { check var strings }
  615. if (cs_strict_var_strings in aktlocalswitches) and
  616. is_shortstring(left.resulttype.def) and
  617. is_shortstring(paraitem.paratype.def) and
  618. (paraitem.paratyp in [vs_out,vs_var]) and
  619. not(is_open_string(paraitem.paratype.def)) and
  620. not(equal_defs(left.resulttype.def,paraitem.paratype.def)) then
  621. begin
  622. aktfilepos:=left.fileinfo;
  623. CGMessage(type_e_strict_var_string_violation);
  624. end;
  625. { Handle formal parameters separate }
  626. if (paraitem.paratype.def.deftype=formaldef) then
  627. begin
  628. { load procvar if a procedure is passed }
  629. if (m_tp_procvar in aktmodeswitches) and
  630. (left.nodetype=calln) and
  631. (is_void(left.resulttype.def)) then
  632. load_procvar_from_calln(left);
  633. case paraitem.paratyp of
  634. vs_var,
  635. vs_out :
  636. begin
  637. if not valid_for_formal_var(left) then
  638. CGMessagePos(left.fileinfo,parser_e_illegal_parameter_list);
  639. end;
  640. vs_const :
  641. begin
  642. if not valid_for_formal_const(left) then
  643. CGMessagePos(left.fileinfo,parser_e_illegal_parameter_list);
  644. end;
  645. end;
  646. end
  647. else
  648. begin
  649. { check if the argument is allowed }
  650. if (paraitem.paratyp in [vs_out,vs_var]) then
  651. valid_for_var(left);
  652. end;
  653. if paraitem.paratyp in [vs_var,vs_const] then
  654. begin
  655. { Causes problems with const ansistrings if also }
  656. { done for vs_const (JM) }
  657. if paraitem.paratyp = vs_var then
  658. set_unique(left);
  659. make_not_regable(left);
  660. end;
  661. { ansistrings out paramaters doesn't need to be }
  662. { unique, they are finalized }
  663. if paraitem.paratyp=vs_out then
  664. make_not_regable(left);
  665. if do_count then
  666. begin
  667. if paraitem.paratyp in [vs_var,vs_out] then
  668. set_varstate(left,vs_used,false)
  669. else
  670. set_varstate(left,vs_used,true);
  671. end;
  672. { must only be done after typeconv PM }
  673. resulttype:=paraitem.paratype;
  674. end;
  675. end;
  676. { process next node }
  677. if assigned(right) then
  678. tcallparanode(right).insert_typeconv(do_count);
  679. dec(parsing_para_level);
  680. {$ifdef extdebug}
  681. if do_count then
  682. count_ref:=store_count_ref;
  683. {$endif def extdebug}
  684. end;
  685. procedure tcallparanode.det_registers;
  686. begin
  687. if assigned(right) then
  688. begin
  689. tcallparanode(right).det_registers;
  690. registers32:=right.registers32;
  691. registersfpu:=right.registersfpu;
  692. {$ifdef SUPPORT_MMX}
  693. registersmmx:=right.registersmmx;
  694. {$endif}
  695. end;
  696. firstpass(left);
  697. if left.registers32>registers32 then
  698. registers32:=left.registers32;
  699. if left.registersfpu>registersfpu then
  700. registersfpu:=left.registersfpu;
  701. {$ifdef SUPPORT_MMX}
  702. if left.registersmmx>registersmmx then
  703. registersmmx:=left.registersmmx;
  704. {$endif SUPPORT_MMX}
  705. end;
  706. procedure tcallparanode.firstcallparan;
  707. begin
  708. if not assigned(left.resulttype.def) then
  709. get_paratype;
  710. det_registers;
  711. end;
  712. function tcallparanode.docompare(p: tnode): boolean;
  713. begin
  714. docompare :=
  715. inherited docompare(p) and
  716. (callparaflags = tcallparanode(p).callparaflags)
  717. ;
  718. end;
  719. procedure tcallparanode.printnodetree(var t:text);
  720. begin
  721. printnodelist(t);
  722. end;
  723. {****************************************************************************
  724. TCALLNODE
  725. ****************************************************************************}
  726. constructor tcallnode.create(l:tnode;v : tprocsym;st : tsymtable; mp : tnode);
  727. begin
  728. inherited create(calln,l,nil);
  729. symtableprocentry:=v;
  730. symtableproc:=st;
  731. include(flags,nf_return_value_used);
  732. methodpointer:=mp;
  733. procdefinition:=nil;
  734. restypeset:=false;
  735. _funcretnode:=nil;
  736. inlinecode:=nil;
  737. paralength:=-1;
  738. varargsparas:=nil;
  739. end;
  740. constructor tcallnode.create_def(l:tnode;def:tprocdef;mp:tnode);
  741. begin
  742. inherited create(calln,l,nil);
  743. symtableprocentry:=nil;
  744. symtableproc:=nil;
  745. include(flags,nf_return_value_used);
  746. methodpointer:=mp;
  747. procdefinition:=def;
  748. restypeset:=false;
  749. _funcretnode:=nil;
  750. inlinecode:=nil;
  751. paralength:=-1;
  752. varargsparas:=nil;
  753. end;
  754. constructor tcallnode.create_procvar(l,r:tnode);
  755. begin
  756. inherited create(calln,l,r);
  757. symtableprocentry:=nil;
  758. symtableproc:=nil;
  759. include(flags,nf_return_value_used);
  760. methodpointer:=nil;
  761. procdefinition:=nil;
  762. restypeset:=false;
  763. _funcretnode:=nil;
  764. inlinecode:=nil;
  765. paralength:=-1;
  766. varargsparas:=nil;
  767. end;
  768. constructor tcallnode.createintern(const name: string; params: tnode);
  769. var
  770. srsym: tsym;
  771. symowner: tsymtable;
  772. begin
  773. if not (cs_compilesystem in aktmoduleswitches) then
  774. begin
  775. srsym := searchsymonlyin(systemunit,name);
  776. symowner := systemunit;
  777. end
  778. else
  779. begin
  780. searchsym(name,srsym,symowner);
  781. if not assigned(srsym) then
  782. searchsym(upper(name),srsym,symowner);
  783. end;
  784. if not assigned(srsym) or
  785. (srsym.typ <> procsym) then
  786. begin
  787. {$ifdef EXTDEBUG}
  788. Comment(V_Error,'unknown compilerproc '+name);
  789. {$endif EXTDEBUG}
  790. internalerror(200107271);
  791. end;
  792. self.create(params,tprocsym(srsym),symowner,nil);
  793. end;
  794. constructor tcallnode.createinternres(const name: string; params: tnode; const res: ttype);
  795. begin
  796. self.createintern(name,params);
  797. restype := res;
  798. restypeset := true;
  799. { both the normal and specified resulttype either have to be returned via a }
  800. { parameter or not, but no mixing (JM) }
  801. if paramanager.ret_in_param(restype.def,pocall_compilerproc) xor
  802. paramanager.ret_in_param(symtableprocentry.first_procdef.rettype.def,symtableprocentry.first_procdef.proccalloption) then
  803. internalerror(200108291);
  804. end;
  805. constructor tcallnode.createinternreturn(const name: string; params: tnode; returnnode : tnode);
  806. begin
  807. self.createintern(name,params);
  808. _funcretnode:=returnnode;
  809. if not paramanager.ret_in_param(symtableprocentry.first_procdef.rettype.def,symtableprocentry.first_procdef.proccalloption) then
  810. internalerror(200204247);
  811. end;
  812. procedure tcallnode.setfuncretnode(const returnnode: tnode);
  813. var
  814. para: tcallparanode;
  815. begin
  816. if assigned(_funcretnode) then
  817. _funcretnode.free;
  818. _funcretnode := returnnode;
  819. { if the resulttype pass hasn't occurred yet, that one will do }
  820. { everything }
  821. if assigned(resulttype.def) then
  822. begin
  823. { these are returned as values, but we can optimize their loading }
  824. { as well }
  825. if is_ansistring(resulttype.def) or
  826. is_widestring(resulttype.def) then
  827. exit;
  828. para := tcallparanode(left);
  829. while assigned(para) do
  830. begin
  831. if para.paraitem.is_hidden and
  832. (vo_is_funcret in tvarsym(para.paraitem.parasym).varoptions) then
  833. begin
  834. para.left.free;
  835. para.left := _funcretnode.getcopy;
  836. exit;
  837. end;
  838. para := tcallparanode(para.right);
  839. end;
  840. { no hidden resultpara found, error! }
  841. internalerror(200306087);
  842. end;
  843. end;
  844. destructor tcallnode.destroy;
  845. begin
  846. methodpointer.free;
  847. _funcretnode.free;
  848. inlinecode.free;
  849. if assigned(varargsparas) then
  850. varargsparas.free;
  851. inherited destroy;
  852. end;
  853. constructor tcallnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  854. begin
  855. inherited ppuload(t,ppufile);
  856. ppufile.getderef(symtableprocentryderef);
  857. {$ifdef fpc}
  858. {$warning FIXME: No withsymtable support}
  859. {$endif}
  860. symtableproc:=nil;
  861. ppufile.getderef(procdefinitionderef);
  862. restypeset:=boolean(ppufile.getbyte);
  863. methodpointer:=ppuloadnode(ppufile);
  864. _funcretnode:=ppuloadnode(ppufile);
  865. inlinecode:=ppuloadnode(ppufile);
  866. end;
  867. procedure tcallnode.ppuwrite(ppufile:tcompilerppufile);
  868. begin
  869. inherited ppuwrite(ppufile);
  870. ppufile.putderef(symtableprocentryderef);
  871. ppufile.putderef(procdefinitionderef);
  872. ppufile.putbyte(byte(restypeset));
  873. ppuwritenode(ppufile,methodpointer);
  874. ppuwritenode(ppufile,_funcretnode);
  875. ppuwritenode(ppufile,inlinecode);
  876. end;
  877. procedure tcallnode.buildderefimpl;
  878. begin
  879. inherited buildderefimpl;
  880. symtableprocentryderef.build(symtableprocentry);
  881. procdefinitionderef.build(procdefinition);
  882. if assigned(methodpointer) then
  883. methodpointer.buildderefimpl;
  884. if assigned(_funcretnode) then
  885. _funcretnode.buildderefimpl;
  886. if assigned(inlinecode) then
  887. inlinecode.buildderefimpl;
  888. end;
  889. procedure tcallnode.derefimpl;
  890. begin
  891. inherited derefimpl;
  892. symtableprocentry:=tprocsym(symtableprocentryderef.resolve);
  893. symtableproc:=symtableprocentry.owner;
  894. procdefinition:=tprocdef(procdefinitionderef.resolve);
  895. if assigned(methodpointer) then
  896. methodpointer.derefimpl;
  897. if assigned(_funcretnode) then
  898. _funcretnode.derefimpl;
  899. if assigned(inlinecode) then
  900. inlinecode.derefimpl;
  901. end;
  902. function tcallnode.getcopy : tnode;
  903. var
  904. n : tcallnode;
  905. hp : tparaitem;
  906. begin
  907. n:=tcallnode(inherited getcopy);
  908. n.symtableprocentry:=symtableprocentry;
  909. n.symtableproc:=symtableproc;
  910. n.procdefinition:=procdefinition;
  911. n.restype := restype;
  912. n.restypeset := restypeset;
  913. if assigned(methodpointer) then
  914. n.methodpointer:=methodpointer.getcopy
  915. else
  916. n.methodpointer:=nil;
  917. if assigned(_funcretnode) then
  918. n._funcretnode:=_funcretnode.getcopy
  919. else
  920. n._funcretnode:=nil;
  921. if assigned(inlinecode) then
  922. n.inlinecode:=inlinecode.getcopy
  923. else
  924. n.inlinecode:=nil;
  925. if assigned(varargsparas) then
  926. begin
  927. n.varargsparas:=tlinkedlist.create;
  928. hp:=tparaitem(varargsparas.first);
  929. while assigned(hp) do
  930. begin
  931. n.varargsparas.concat(hp.getcopy);
  932. hp:=tparaitem(hp.next);
  933. end;
  934. end
  935. else
  936. n.varargsparas:=nil;
  937. result:=n;
  938. end;
  939. procedure tcallnode.insertintolist(l : tnodelist);
  940. begin
  941. end;
  942. procedure tcallnode.convert_carg_array_of_const;
  943. var
  944. hp : tarrayconstructornode;
  945. oldleft : tcallparanode;
  946. begin
  947. oldleft:=tcallparanode(left);
  948. if oldleft.left.nodetype<>arrayconstructorn then
  949. begin
  950. CGMessage1(type_e_wrong_type_in_array_constructor,oldleft.left.resulttype.def.typename);
  951. exit;
  952. end;
  953. { Get arrayconstructor node and insert typeconvs }
  954. hp:=tarrayconstructornode(oldleft.left);
  955. hp.insert_typeconvs;
  956. { Add c args parameters }
  957. { It could be an empty set }
  958. if assigned(hp) and
  959. assigned(hp.left) then
  960. begin
  961. while assigned(hp) do
  962. begin
  963. left:=ccallparanode.create(hp.left,left);
  964. { set callparanode resulttype and flags }
  965. left.resulttype:=hp.left.resulttype;
  966. include(left.flags,nf_varargs_para);
  967. hp.left:=nil;
  968. hp:=tarrayconstructornode(hp.right);
  969. end;
  970. end;
  971. { Remove value of old array of const parameter, but keep it
  972. in the list because it is required for bind_paraitem.
  973. Generate a nothign to keep callparanoed.left valid }
  974. oldleft.left.free;
  975. oldleft.left:=cnothingnode.create;
  976. end;
  977. procedure tcallnode.verifyabstract(p : tnamedindexitem;arg:pointer);
  978. var
  979. hp : tprocdef;
  980. j: integer;
  981. begin
  982. if (tsym(p).typ=procsym) then
  983. begin
  984. for j:=1 to tprocsym(p).procdef_count do
  985. begin
  986. { index starts at 1 }
  987. hp:=tprocsym(p).procdef[j];
  988. { If this is an abstract method insert into the list }
  989. if (po_abstractmethod in hp.procoptions) then
  990. AbstractMethodsList.Insert(hp.procsym.name)
  991. else
  992. { If this symbol is already in the list, and it is
  993. an overriding method or dynamic, then remove it from the list
  994. }
  995. begin
  996. { symbol was found }
  997. if AbstractMethodsList.Find(hp.procsym.name) <> nil then
  998. begin
  999. if po_overridingmethod in hp.procoptions then
  1000. AbstractMethodsList.Remove(hp.procsym.name);
  1001. end;
  1002. end;
  1003. end;
  1004. end;
  1005. end;
  1006. procedure tcallnode.verifyabstractcalls;
  1007. var
  1008. objectdf : tobjectdef;
  1009. parents : tlinkedlist;
  1010. objectinfo : tobjectinfoitem;
  1011. stritem : tstringlistitem;
  1012. begin
  1013. objectdf := nil;
  1014. { verify if trying to create an instance of a class which contains
  1015. non-implemented abstract methods }
  1016. { first verify this class type, no class than exit }
  1017. { also, this checking can only be done if the constructor is directly
  1018. called, indirect constructor calls cannot be checked.
  1019. }
  1020. if assigned(methodpointer) then
  1021. begin
  1022. if (methodpointer.resulttype.def.deftype = objectdef) then
  1023. objectdf:=tobjectdef(methodpointer.resulttype.def)
  1024. else
  1025. if (methodpointer.resulttype.def.deftype = classrefdef) and
  1026. (tclassrefdef(methodpointer.resulttype.def).pointertype.def.deftype = objectdef) and
  1027. (methodpointer.nodetype in [typen,loadvmtaddrn]) then
  1028. objectdf:=tobjectdef(tclassrefdef(methodpointer.resulttype.def).pointertype.def);
  1029. end;
  1030. if not assigned(objectdf) then
  1031. exit;
  1032. parents := tlinkedlist.create;
  1033. AbstractMethodsList := tstringlist.create;
  1034. { insert all parents in this class : the first item in the
  1035. list will be the base parent of the class .
  1036. }
  1037. while assigned(objectdf) do
  1038. begin
  1039. objectinfo:=tobjectinfoitem.create(objectdf);
  1040. parents.insert(objectinfo);
  1041. objectdf := objectdf.childof;
  1042. end;
  1043. { now all parents are in the correct order
  1044. insert all abstract methods in the list, and remove
  1045. those which are overriden by parent classes.
  1046. }
  1047. objectinfo:=tobjectinfoitem(parents.first);
  1048. while assigned(objectinfo) do
  1049. begin
  1050. objectdf := objectinfo.objinfo;
  1051. if assigned(objectdf.symtable) then
  1052. objectdf.symtable.foreach({$ifdef FPCPROCVAR}@{$endif}verifyabstract,nil);
  1053. objectinfo:=tobjectinfoitem(objectinfo.next);
  1054. end;
  1055. if assigned(parents) then
  1056. parents.free;
  1057. { Finally give out a warning for each abstract method still in the list }
  1058. stritem := tstringlistitem(AbstractMethodsList.first);
  1059. if assigned(stritem) then
  1060. Message1(type_w_instance_with_abstract,objectdf.objname^);
  1061. while assigned(stritem) do
  1062. begin
  1063. if assigned(stritem.fpstr) then
  1064. Message1(sym_h_param_list,stritem.str);
  1065. stritem := tstringlistitem(stritem.next);
  1066. end;
  1067. if assigned(AbstractMethodsList) then
  1068. AbstractMethodsList.Free;
  1069. end;
  1070. function Tcallnode.candidates_find:pcandidate;
  1071. var
  1072. j : integer;
  1073. pd : tprocdef;
  1074. procs,hp : pcandidate;
  1075. found,
  1076. has_overload_directive : boolean;
  1077. topclassh : tobjectdef;
  1078. srsymtable : tsymtable;
  1079. srprocsym : tprocsym;
  1080. procedure proc_add(pd:tprocdef);
  1081. var
  1082. i : integer;
  1083. begin
  1084. { generate new candidate entry }
  1085. new(hp);
  1086. fillchar(hp^,sizeof(tcandidate),0);
  1087. hp^.data:=pd;
  1088. hp^.next:=procs;
  1089. procs:=hp;
  1090. { Find last parameter, skip all default parameters
  1091. that are not passed. Ignore this skipping for varargs }
  1092. hp^.firstpara:=tparaitem(pd.Para.last);
  1093. if not(po_varargs in pd.procoptions) then
  1094. begin
  1095. for i:=1 to pd.maxparacount-paralength do
  1096. hp^.firstpara:=tparaitem(hp^.firstPara.previous);
  1097. end;
  1098. end;
  1099. begin
  1100. procs:=nil;
  1101. { when the definition has overload directive set, we search for
  1102. overloaded definitions in the class, this only needs to be done once
  1103. for class entries as the tree keeps always the same }
  1104. if (not symtableprocentry.overloadchecked) and
  1105. (symtableprocentry.owner.symtabletype=objectsymtable) and
  1106. (po_overload in symtableprocentry.first_procdef.procoptions) then
  1107. search_class_overloads(symtableprocentry);
  1108. { when the class passed is defined in this unit we
  1109. need to use the scope of that class. This is a trick
  1110. that can be used to access protected members in other
  1111. units. At least kylix supports it this way (PFV) }
  1112. if assigned(symtableproc) and
  1113. (symtableproc.symtabletype=objectsymtable) and
  1114. (symtableproc.defowner.owner.symtabletype in [globalsymtable,staticsymtable]) and
  1115. (symtableproc.defowner.owner.unitid=0) then
  1116. topclassh:=tobjectdef(symtableproc.defowner)
  1117. else
  1118. begin
  1119. if assigned(current_procinfo) then
  1120. topclassh:=current_procinfo.procdef._class
  1121. else
  1122. topclassh:=nil;
  1123. end;
  1124. { link all procedures which have the same # of parameters }
  1125. paravisible:=false;
  1126. for j:=1 to symtableprocentry.procdef_count do
  1127. begin
  1128. pd:=symtableprocentry.procdef[j];
  1129. { Is the procdef visible? This needs to be checked on
  1130. procdef level since a symbol can contain both private and
  1131. public declarations. But the check should not be done
  1132. when the callnode is generated by a property }
  1133. if (nf_isproperty in flags) or
  1134. (pd.owner.symtabletype<>objectsymtable) or
  1135. pd.is_visible_for_object(topclassh) then
  1136. begin
  1137. { we have at least one procedure that is visible }
  1138. paravisible:=true;
  1139. { only when the # of parameter are supported by the
  1140. procedure }
  1141. if (paralength>=pd.minparacount) and
  1142. ((po_varargs in pd.procoptions) or { varargs }
  1143. (paralength<=pd.maxparacount)) then
  1144. proc_add(pd);
  1145. end;
  1146. end;
  1147. { remember if the procedure is declared with the overload directive,
  1148. it's information is still needed also after all procs are removed }
  1149. has_overload_directive:=(po_overload in symtableprocentry.first_procdef.procoptions);
  1150. { when the definition has overload directive set, we search for
  1151. overloaded definitions in the symtablestack. The found
  1152. entries are only added to the procs list and not the procsym, because
  1153. the list can change in every situation }
  1154. if has_overload_directive and
  1155. (symtableprocentry.owner.symtabletype<>objectsymtable) then
  1156. begin
  1157. srsymtable:=symtableprocentry.owner.next;
  1158. while assigned(srsymtable) do
  1159. begin
  1160. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1161. begin
  1162. srprocsym:=tprocsym(srsymtable.speedsearch(symtableprocentry.name,symtableprocentry.speedvalue));
  1163. { process only visible procsyms }
  1164. if assigned(srprocsym) and
  1165. (srprocsym.typ=procsym) and
  1166. srprocsym.is_visible_for_object(topclassh) then
  1167. begin
  1168. { if this procedure doesn't have overload we can stop
  1169. searching }
  1170. if not(po_overload in srprocsym.first_procdef.procoptions) then
  1171. break;
  1172. { process all overloaded definitions }
  1173. for j:=1 to srprocsym.procdef_count do
  1174. begin
  1175. pd:=srprocsym.procdef[j];
  1176. { only when the # of parameter are supported by the
  1177. procedure }
  1178. if (paralength>=pd.minparacount) and
  1179. ((po_varargs in pd.procoptions) or { varargs }
  1180. (paralength<=pd.maxparacount)) then
  1181. begin
  1182. found:=false;
  1183. hp:=procs;
  1184. while assigned(hp) do
  1185. begin
  1186. { Only compare visible parameters for the user }
  1187. if compare_paras(hp^.data.para,pd.para,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1188. begin
  1189. found:=true;
  1190. break;
  1191. end;
  1192. hp:=hp^.next;
  1193. end;
  1194. if not found then
  1195. proc_add(pd);
  1196. end;
  1197. end;
  1198. end;
  1199. end;
  1200. srsymtable:=srsymtable.next;
  1201. end;
  1202. end;
  1203. candidates_find:=procs;
  1204. end;
  1205. procedure tcallnode.candidates_free(procs:pcandidate);
  1206. var
  1207. hpnext,
  1208. hp : pcandidate;
  1209. begin
  1210. hp:=procs;
  1211. while assigned(hp) do
  1212. begin
  1213. hpnext:=hp^.next;
  1214. dispose(hp);
  1215. hp:=hpnext;
  1216. end;
  1217. end;
  1218. procedure tcallnode.candidates_list(procs:pcandidate;all:boolean);
  1219. var
  1220. hp : pcandidate;
  1221. begin
  1222. hp:=procs;
  1223. while assigned(hp) do
  1224. begin
  1225. if all or
  1226. (not hp^.invalid) then
  1227. MessagePos1(hp^.data.fileinfo,sym_h_param_list,hp^.data.fullprocname(false));
  1228. hp:=hp^.next;
  1229. end;
  1230. end;
  1231. {$ifdef EXTDEBUG}
  1232. procedure Tcallnode.candidates_dump_info(lvl:longint;procs:pcandidate);
  1233. function ParaTreeStr(p:tcallparanode):string;
  1234. begin
  1235. result:='';
  1236. while assigned(p) do
  1237. begin
  1238. if result<>'' then
  1239. result:=result+',';
  1240. result:=result+p.resulttype.def.typename;
  1241. p:=tcallparanode(p.right);
  1242. end;
  1243. end;
  1244. var
  1245. hp : pcandidate;
  1246. currpara : tparaitem;
  1247. begin
  1248. if not CheckVerbosity(lvl) then
  1249. exit;
  1250. Comment(lvl+V_LineInfo,'Overloaded callnode: '+symtableprocentry.name+'('+ParaTreeStr(tcallparanode(left))+')');
  1251. hp:=procs;
  1252. while assigned(hp) do
  1253. begin
  1254. Comment(lvl,' '+hp^.data.fullprocname(false));
  1255. if (hp^.invalid) then
  1256. Comment(lvl,' invalid')
  1257. else
  1258. begin
  1259. Comment(lvl,' ex: '+tostr(hp^.exact_count)+
  1260. ' eq: '+tostr(hp^.equal_count)+
  1261. ' l1: '+tostr(hp^.cl1_count)+
  1262. ' l2: '+tostr(hp^.cl2_count)+
  1263. ' l3: '+tostr(hp^.cl3_count)+
  1264. ' oper: '+tostr(hp^.coper_count)+
  1265. ' ord: '+realtostr(hp^.exact_count));
  1266. { Print parameters in left-right order }
  1267. currpara:=hp^.firstpara;
  1268. if assigned(currpara) then
  1269. begin
  1270. while assigned(currpara.next) do
  1271. currpara:=tparaitem(currpara.next);
  1272. end;
  1273. while assigned(currpara) do
  1274. begin
  1275. if (not currpara.is_hidden) then
  1276. Comment(lvl,' - '+currpara.paratype.def.typename+' : '+EqualTypeName[currpara.eqval]);
  1277. currpara:=tparaitem(currpara.previous);
  1278. end;
  1279. end;
  1280. hp:=hp^.next;
  1281. end;
  1282. end;
  1283. {$endif EXTDEBUG}
  1284. procedure Tcallnode.candidates_get_information(procs:pcandidate);
  1285. var
  1286. hp : pcandidate;
  1287. currpara : tparaitem;
  1288. currparanr : byte;
  1289. def_from,
  1290. def_to : tdef;
  1291. pt : tcallparanode;
  1292. eq : tequaltype;
  1293. convtype : tconverttype;
  1294. pdoper : tprocdef;
  1295. begin
  1296. { process all procs }
  1297. hp:=procs;
  1298. while assigned(hp) do
  1299. begin
  1300. { We compare parameters in reverse order (right to left),
  1301. the firstpara is already pointing to the last parameter
  1302. were we need to start comparing }
  1303. currparanr:=paralength;
  1304. currpara:=hp^.firstpara;
  1305. while assigned(currpara) and (currpara.is_hidden) do
  1306. currpara:=tparaitem(currpara.previous);
  1307. pt:=tcallparanode(left);
  1308. while assigned(pt) and assigned(currpara) do
  1309. begin
  1310. { retrieve current parameter definitions to compares }
  1311. eq:=te_incompatible;
  1312. def_from:=pt.resulttype.def;
  1313. def_to:=currpara.paratype.def;
  1314. if not(assigned(def_from)) then
  1315. internalerror(200212091);
  1316. if not(
  1317. assigned(def_to) or
  1318. ((po_varargs in hp^.data.procoptions) and
  1319. (currparanr>hp^.data.minparacount))
  1320. ) then
  1321. internalerror(200212092);
  1322. { varargs are always equal, but not exact }
  1323. if (po_varargs in hp^.data.procoptions) and
  1324. (currparanr>hp^.data.minparacount) then
  1325. begin
  1326. inc(hp^.equal_count);
  1327. eq:=te_equal;
  1328. end
  1329. else
  1330. { same definition -> exact }
  1331. if (def_from=def_to) then
  1332. begin
  1333. inc(hp^.exact_count);
  1334. eq:=te_exact;
  1335. end
  1336. else
  1337. { for value and const parameters check if a integer is constant or
  1338. included in other integer -> equal and calc ordinal_distance }
  1339. if not(currpara.paratyp in [vs_var,vs_out]) and
  1340. is_integer(def_from) and
  1341. is_integer(def_to) and
  1342. is_in_limit(def_from,def_to) then
  1343. begin
  1344. inc(hp^.equal_count);
  1345. eq:=te_equal;
  1346. hp^.ordinal_distance:=hp^.ordinal_distance+
  1347. abs(bestreal(torddef(def_from).low)-bestreal(torddef(def_to).low));
  1348. hp^.ordinal_distance:=hp^.ordinal_distance+
  1349. abs(bestreal(torddef(def_to).high)-bestreal(torddef(def_from).high));
  1350. { Give wrong sign a small penalty, this is need to get a diffrence
  1351. from word->[longword,longint] }
  1352. if is_signed(def_from)<>is_signed(def_to) then
  1353. hp^.ordinal_distance:=hp^.ordinal_distance+1.0;
  1354. end
  1355. else
  1356. { generic type comparision }
  1357. begin
  1358. eq:=compare_defs_ext(def_from,def_to,pt.left.nodetype,
  1359. false,true,convtype,pdoper);
  1360. { when the types are not equal we need to check
  1361. some special case for parameter passing }
  1362. if (eq<te_equal) then
  1363. begin
  1364. if currpara.paratyp in [vs_var,vs_out] then
  1365. begin
  1366. { para requires an equal type so the previous found
  1367. match was not good enough, reset to incompatible }
  1368. eq:=te_incompatible;
  1369. { var_para_allowed will return te_equal and te_convert_l1 to
  1370. make a difference for best matching }
  1371. var_para_allowed(eq,pt.resulttype.def,currpara.paratype.def)
  1372. end
  1373. else
  1374. para_allowed(eq,pt,def_to);
  1375. end;
  1376. case eq of
  1377. te_exact :
  1378. internalerror(200212071); { already checked }
  1379. te_equal :
  1380. inc(hp^.equal_count);
  1381. te_convert_l1 :
  1382. inc(hp^.cl1_count);
  1383. te_convert_l2 :
  1384. inc(hp^.cl2_count);
  1385. te_convert_l3 :
  1386. inc(hp^.cl3_count);
  1387. te_convert_operator :
  1388. inc(hp^.coper_count);
  1389. te_incompatible :
  1390. hp^.invalid:=true;
  1391. else
  1392. internalerror(200212072);
  1393. end;
  1394. end;
  1395. { stop checking when an incompatible parameter is found }
  1396. if hp^.invalid then
  1397. begin
  1398. { store the current parameter info for
  1399. a nice error message when no procedure is found }
  1400. hp^.wrongpara:=currpara;
  1401. hp^.wrongparanr:=currparanr;
  1402. break;
  1403. end;
  1404. {$ifdef EXTDEBUG}
  1405. { store equal in node tree for dump }
  1406. currpara.eqval:=eq;
  1407. {$endif EXTDEBUG}
  1408. { next parameter in the call tree }
  1409. pt:=tcallparanode(pt.right);
  1410. { next parameter for definition, only goto next para
  1411. if we're out of the varargs }
  1412. if not(po_varargs in hp^.data.procoptions) or
  1413. (currparanr<=hp^.data.maxparacount) then
  1414. begin
  1415. { Ignore vs_hidden parameters }
  1416. repeat
  1417. currpara:=tparaitem(currpara.previous);
  1418. until (not assigned(currpara)) or (not currpara.is_hidden);
  1419. end;
  1420. dec(currparanr);
  1421. end;
  1422. if not(hp^.invalid) and
  1423. (assigned(pt) or assigned(currpara) or (currparanr<>0)) then
  1424. internalerror(200212141);
  1425. { next candidate }
  1426. hp:=hp^.next;
  1427. end;
  1428. end;
  1429. function Tcallnode.candidates_choose_best(procs:pcandidate;var bestpd:tprocdef):integer;
  1430. var
  1431. besthpstart,
  1432. hp : pcandidate;
  1433. cntpd,
  1434. res : integer;
  1435. begin
  1436. {
  1437. Returns the number of candidates left and the
  1438. first candidate is returned in pdbest
  1439. }
  1440. { Setup the first procdef as best, only count it as a result
  1441. when it is valid }
  1442. bestpd:=procs^.data;
  1443. if procs^.invalid then
  1444. cntpd:=0
  1445. else
  1446. cntpd:=1;
  1447. if assigned(procs^.next) then
  1448. begin
  1449. besthpstart:=procs;
  1450. hp:=procs^.next;
  1451. while assigned(hp) do
  1452. begin
  1453. res:=is_better_candidate(hp,besthpstart);
  1454. if (res>0) then
  1455. begin
  1456. { hp is better, flag all procs to be incompatible }
  1457. while (besthpstart<>hp) do
  1458. begin
  1459. besthpstart^.invalid:=true;
  1460. besthpstart:=besthpstart^.next;
  1461. end;
  1462. { besthpstart is already set to hp }
  1463. bestpd:=besthpstart^.data;
  1464. cntpd:=1;
  1465. end
  1466. else
  1467. if (res<0) then
  1468. begin
  1469. { besthpstart is better, flag current hp to be incompatible }
  1470. hp^.invalid:=true;
  1471. end
  1472. else
  1473. begin
  1474. { res=0, both are valid }
  1475. if not hp^.invalid then
  1476. inc(cntpd);
  1477. end;
  1478. hp:=hp^.next;
  1479. end;
  1480. end;
  1481. candidates_choose_best:=cntpd;
  1482. end;
  1483. procedure tcallnode.candidates_find_wrong_para(procs:pcandidate);
  1484. var
  1485. currparanr : smallint;
  1486. hp : pcandidate;
  1487. pt : tcallparanode;
  1488. begin
  1489. { Only process the first overloaded procdef }
  1490. hp:=procs;
  1491. { Find callparanode corresponding to the argument }
  1492. pt:=tcallparanode(left);
  1493. currparanr:=paralength;
  1494. while assigned(pt) and
  1495. (currparanr>hp^.wrongparanr) do
  1496. begin
  1497. pt:=tcallparanode(pt.right);
  1498. dec(currparanr);
  1499. end;
  1500. if (currparanr<>hp^.wrongparanr) or
  1501. not assigned(pt) then
  1502. internalerror(200212094);
  1503. { Show error message, when it was a var or out parameter
  1504. guess that it is a missing typeconv }
  1505. if hp^.wrongpara.paratyp in [vs_var,vs_out] then
  1506. CGMessagePos2(left.fileinfo,parser_e_call_by_ref_without_typeconv,
  1507. pt.resulttype.def.typename,hp^.wrongpara.paratype.def.typename)
  1508. else
  1509. CGMessagePos3(pt.fileinfo,type_e_wrong_parameter_type,
  1510. tostr(hp^.wrongparanr),pt.resulttype.def.typename,hp^.wrongpara.paratype.def.typename);
  1511. end;
  1512. function tcallnode.gen_self_tree_methodpointer:tnode;
  1513. var
  1514. hsym : tvarsym;
  1515. begin
  1516. { find self field in methodpointer record }
  1517. hsym:=tvarsym(trecorddef(methodpointertype.def).symtable.search('self'));
  1518. if not assigned(hsym) then
  1519. internalerror(200305251);
  1520. { Load tmehodpointer(right).self }
  1521. result:=csubscriptnode.create(
  1522. hsym,
  1523. ctypeconvnode.create_explicit(right.getcopy,methodpointertype));
  1524. end;
  1525. function tcallnode.gen_self_tree:tnode;
  1526. var
  1527. selftree : tnode;
  1528. begin
  1529. selftree:=nil;
  1530. { constructors }
  1531. if (procdefinition.proctypeoption=potype_constructor) then
  1532. begin
  1533. if not(nf_inherited in flags) then
  1534. begin
  1535. { push 0 as self when allocation is needed }
  1536. if (methodpointer.resulttype.def.deftype=classrefdef) or
  1537. (nf_new_call in flags) then
  1538. selftree:=cpointerconstnode.create(0,voidpointertype)
  1539. else
  1540. begin
  1541. if methodpointer.nodetype=typen then
  1542. selftree:=load_self_node
  1543. else
  1544. selftree:=methodpointer.getcopy;
  1545. end;
  1546. end
  1547. else
  1548. selftree:=load_self_node;
  1549. end
  1550. else
  1551. begin
  1552. { Calling a static/class method from a non-static/class method,
  1553. then we need to load self with the VMT }
  1554. if (
  1555. (po_classmethod in procdefinition.procoptions) and
  1556. not(assigned(current_procinfo.procdef) and
  1557. (po_classmethod in current_procinfo.procdef.procoptions))
  1558. ) or
  1559. (
  1560. (po_staticmethod in procdefinition.procoptions) and
  1561. not(assigned(current_procinfo.procdef) and
  1562. (po_staticmethod in current_procinfo.procdef.procoptions))
  1563. ) then
  1564. begin
  1565. if (procdefinition.deftype<>procdef) then
  1566. internalerror(200305062);
  1567. if (oo_has_vmt in tprocdef(procdefinition)._class.objectoptions) then
  1568. begin
  1569. if methodpointer.resulttype.def.deftype=classrefdef then
  1570. selftree:=methodpointer.getcopy
  1571. else
  1572. selftree:=cloadvmtaddrnode.create(methodpointer.getcopy);
  1573. end
  1574. else
  1575. selftree:=cpointerconstnode.create(0,voidpointertype);
  1576. end
  1577. else
  1578. begin
  1579. if methodpointer.nodetype=typen then
  1580. selftree:=load_self_node
  1581. else
  1582. selftree:=methodpointer.getcopy;
  1583. end;
  1584. end;
  1585. result:=selftree;
  1586. end;
  1587. function tcallnode.gen_vmt_tree:tnode;
  1588. var
  1589. vmttree : tnode;
  1590. begin
  1591. vmttree:=nil;
  1592. if not(procdefinition.proctypeoption in [potype_constructor,potype_destructor]) then
  1593. internalerror(200305051);
  1594. { inherited call, no create/destroy }
  1595. if (nf_inherited in flags) then
  1596. vmttree:=cpointerconstnode.create(0,voidpointertype)
  1597. else
  1598. { do not create/destroy when called from member function
  1599. without specifying self explicit }
  1600. if (nf_member_call in flags) then
  1601. begin
  1602. if (methodpointer.resulttype.def.deftype=classrefdef) and
  1603. (procdefinition.proctypeoption=potype_constructor) then
  1604. vmttree:=methodpointer.getcopy
  1605. else
  1606. vmttree:=cpointerconstnode.create(0,voidpointertype);
  1607. end
  1608. else
  1609. { constructor with extended syntax called from new }
  1610. if (nf_new_call in flags) then
  1611. vmttree:=cloadvmtaddrnode.create(ctypenode.create(methodpointer.resulttype))
  1612. else
  1613. { destructor with extended syntax called from dispose }
  1614. if (nf_dispose_call in flags) then
  1615. vmttree:=cloadvmtaddrnode.create(methodpointer.getcopy)
  1616. else
  1617. if (methodpointer.resulttype.def.deftype=classrefdef) then
  1618. begin
  1619. { constructor call via classreference => allocate memory }
  1620. if (procdefinition.proctypeoption=potype_constructor) and
  1621. is_class(tclassrefdef(methodpointer.resulttype.def).pointertype.def) then
  1622. begin
  1623. vmttree:=methodpointer.getcopy;
  1624. { Only a typenode can be passed when it is called with <class of xx>.create }
  1625. if vmttree.nodetype=typen then
  1626. vmttree:=cloadvmtaddrnode.create(vmttree);
  1627. end
  1628. else
  1629. vmttree:=cpointerconstnode.create(0,voidpointertype);
  1630. end
  1631. else
  1632. { class }
  1633. if is_class(methodpointer.resulttype.def) then
  1634. begin
  1635. { destructor: release instance, flag(vmt)=1
  1636. constructor: direct call, do nothing, leave vmt=0 }
  1637. if (procdefinition.proctypeoption=potype_destructor) then
  1638. vmttree:=cpointerconstnode.create(1,voidpointertype)
  1639. else
  1640. vmttree:=cpointerconstnode.create(0,voidpointertype);
  1641. end
  1642. else
  1643. { object }
  1644. begin
  1645. { destructor: direct call, no dispose, vmt=0
  1646. constructor: initialize object, load vmt }
  1647. if (procdefinition.proctypeoption=potype_constructor) then
  1648. { old styled inherited call? }
  1649. if (methodpointer.nodetype=typen) then
  1650. vmttree:=cpointerconstnode.create(0,voidpointertype)
  1651. else
  1652. vmttree:=cloadvmtaddrnode.create(ctypenode.create(methodpointer.resulttype))
  1653. else
  1654. vmttree:=cpointerconstnode.create(0,voidpointertype);
  1655. end;
  1656. result:=vmttree;
  1657. end;
  1658. procedure tcallnode.bind_paraitem;
  1659. var
  1660. i : integer;
  1661. pt : tcallparanode;
  1662. oldppt : ^tcallparanode;
  1663. varargspara,
  1664. currpara : tparaitem;
  1665. used_by_callnode : boolean;
  1666. hiddentree : tnode;
  1667. newstatement : tstatementnode;
  1668. temp : ttempcreatenode;
  1669. begin
  1670. pt:=tcallparanode(left);
  1671. oldppt:=@left;
  1672. { flag all callparanodes that belong to the varargs }
  1673. i:=paralength;
  1674. while (i>procdefinition.maxparacount) do
  1675. begin
  1676. include(pt.flags,nf_varargs_para);
  1677. oldppt:[email protected];
  1678. pt:=tcallparanode(pt.right);
  1679. dec(i);
  1680. end;
  1681. { skip varargs that are inserted by array of const }
  1682. while assigned(pt) and
  1683. (nf_varargs_para in pt.flags) do
  1684. pt:=tcallparanode(pt.right);
  1685. { process normal parameters and insert hidden parameters }
  1686. currpara:=tparaitem(procdefinition.Para.last);
  1687. while assigned(currpara) do
  1688. begin
  1689. if currpara.is_hidden then
  1690. begin
  1691. { generate hidden tree }
  1692. used_by_callnode:=false;
  1693. hiddentree:=nil;
  1694. if (vo_is_funcret in tvarsym(currpara.parasym).varoptions) then
  1695. begin
  1696. { Generate funcretnode if not specified }
  1697. if assigned(funcretnode) then
  1698. begin
  1699. hiddentree:=funcretnode.getcopy;
  1700. end
  1701. else
  1702. begin
  1703. hiddentree:=internalstatements(newstatement,false);
  1704. { need to use resulttype instead of procdefinition.rettype,
  1705. because they can be different }
  1706. temp:=ctempcreatenode.create(resulttype,resulttype.def.size,tt_persistent);
  1707. addstatement(newstatement,temp);
  1708. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  1709. addstatement(newstatement,ctemprefnode.create(temp));
  1710. end;
  1711. end
  1712. else
  1713. if vo_is_high_value in tvarsym(currpara.parasym).varoptions then
  1714. begin
  1715. if not assigned(pt) then
  1716. internalerror(200304082);
  1717. { we need the information of the next parameter }
  1718. hiddentree:=gen_high_tree(pt.left,is_open_string(tparaitem(currpara.previous).paratype.def));
  1719. end
  1720. else
  1721. if vo_is_self in tvarsym(currpara.parasym).varoptions then
  1722. begin
  1723. if assigned(right) then
  1724. hiddentree:=gen_self_tree_methodpointer
  1725. else
  1726. hiddentree:=gen_self_tree;
  1727. end
  1728. else
  1729. if vo_is_vmt in tvarsym(currpara.parasym).varoptions then
  1730. begin
  1731. hiddentree:=gen_vmt_tree;
  1732. end
  1733. else
  1734. if vo_is_parentfp in tvarsym(currpara.parasym).varoptions then
  1735. begin
  1736. if not(assigned(procdefinition.owner.defowner)) then
  1737. internalerror(200309287);
  1738. hiddentree:=cloadparentfpnode.create(tprocdef(procdefinition.owner.defowner));
  1739. end;
  1740. { add the hidden parameter }
  1741. if not assigned(hiddentree) then
  1742. internalerror(200304073);
  1743. { Already insert para and let the previous node point to
  1744. this new node }
  1745. pt:=ccallparanode.create(hiddentree,oldppt^);
  1746. pt.used_by_callnode:=used_by_callnode;
  1747. oldppt^:=pt;
  1748. end;
  1749. if not assigned(pt) then
  1750. internalerror(200310052);
  1751. pt.paraitem:=currpara;
  1752. oldppt:[email protected];
  1753. pt:=tcallparanode(pt.right);
  1754. currpara:=tparaitem(currpara.previous)
  1755. end;
  1756. { Create paraitems for varargs }
  1757. pt:=tcallparanode(left);
  1758. while assigned(pt) do
  1759. begin
  1760. if nf_varargs_para in pt.flags then
  1761. begin
  1762. if not assigned(varargsparas) then
  1763. varargsparas:=tlinkedlist.create;
  1764. varargspara:=tparaitem.create;
  1765. varargspara.paratyp:=vs_value;
  1766. varargspara.paratype:=pt.resulttype;
  1767. varargsparas.concat(varargspara);
  1768. pt.paraitem:=varargspara;
  1769. end;
  1770. pt:=tcallparanode(pt.right);
  1771. end;
  1772. end;
  1773. function tcallnode.det_resulttype:tnode;
  1774. var
  1775. procs : pcandidate;
  1776. oldcallnode : tcallnode;
  1777. hpt : tnode;
  1778. pt : tcallparanode;
  1779. lastpara : longint;
  1780. currpara : tparaitem;
  1781. cand_cnt : integer;
  1782. i : longint;
  1783. method_must_be_valid,
  1784. is_const : boolean;
  1785. label
  1786. errorexit;
  1787. begin
  1788. result:=nil;
  1789. procs:=nil;
  1790. oldcallnode:=aktcallnode;
  1791. aktcallnode:=nil;
  1792. { determine length of parameter list }
  1793. pt:=tcallparanode(left);
  1794. paralength:=0;
  1795. while assigned(pt) do
  1796. begin
  1797. inc(paralength);
  1798. pt:=tcallparanode(pt.right);
  1799. end;
  1800. { determine the type of the parameters }
  1801. if assigned(left) then
  1802. begin
  1803. tcallparanode(left).get_paratype;
  1804. if codegenerror then
  1805. goto errorexit;
  1806. end;
  1807. { procedure variable ? }
  1808. if assigned(right) then
  1809. begin
  1810. set_varstate(right,vs_used,true);
  1811. resulttypepass(right);
  1812. if codegenerror then
  1813. exit;
  1814. procdefinition:=tabstractprocdef(right.resulttype.def);
  1815. { Compare parameters from right to left }
  1816. currpara:=tparaitem(procdefinition.Para.last);
  1817. while assigned(currpara) and (currpara.is_hidden) do
  1818. currpara:=tparaitem(currpara.previous);
  1819. pt:=tcallparanode(left);
  1820. lastpara:=paralength;
  1821. while assigned(currpara) and assigned(pt) do
  1822. begin
  1823. { only goto next para if we're out of the varargs }
  1824. if not(po_varargs in procdefinition.procoptions) or
  1825. (lastpara<=procdefinition.maxparacount) then
  1826. begin
  1827. repeat
  1828. currpara:=tparaitem(currpara.previous);
  1829. until (not assigned(currpara)) or (not currpara.is_hidden);
  1830. end;
  1831. pt:=tcallparanode(pt.right);
  1832. dec(lastpara);
  1833. end;
  1834. if assigned(pt) or assigned(currpara) then
  1835. begin
  1836. if assigned(pt) then
  1837. aktfilepos:=pt.fileinfo;
  1838. CGMessage(parser_e_wrong_parameter_size);
  1839. goto errorexit;
  1840. end;
  1841. end
  1842. else
  1843. { not a procedure variable }
  1844. begin
  1845. { do we know the procedure to call ? }
  1846. if not(assigned(procdefinition)) then
  1847. begin
  1848. procs:=candidates_find;
  1849. { no procedures found? then there is something wrong
  1850. with the parameter size or the procedures are
  1851. not accessible }
  1852. if not assigned(procs) then
  1853. begin
  1854. { when it's an auto inherited call and there
  1855. is no procedure found, but the procedures
  1856. were defined with overload directive and at
  1857. least two procedures are defined then we ignore
  1858. this inherited by inserting a nothingn. Only
  1859. do this ugly hack in Delphi mode as it looks more
  1860. like a bug. It's also not documented }
  1861. if (m_delphi in aktmodeswitches) and
  1862. (nf_anon_inherited in flags) and
  1863. (symtableprocentry.owner.symtabletype=objectsymtable) and
  1864. (po_overload in symtableprocentry.first_procdef.procoptions) and
  1865. (symtableprocentry.procdef_count>=2) then
  1866. result:=cnothingnode.create
  1867. else
  1868. begin
  1869. { in tp mode we can try to convert to procvar if
  1870. there are no parameters specified. Only try it
  1871. when there is only one proc definition, else the
  1872. loadnode will give a strange error }
  1873. if not(assigned(left)) and
  1874. not(nf_inherited in flags) and
  1875. (m_tp_procvar in aktmodeswitches) and
  1876. (symtableprocentry.procdef_count=1) then
  1877. begin
  1878. hpt:=cloadnode.create(tprocsym(symtableprocentry),symtableproc);
  1879. if assigned(methodpointer) then
  1880. tloadnode(hpt).set_mp(methodpointer.getcopy);
  1881. resulttypepass(hpt);
  1882. result:=hpt;
  1883. end
  1884. else
  1885. begin
  1886. if assigned(left) then
  1887. aktfilepos:=left.fileinfo;
  1888. if paravisible then
  1889. begin
  1890. CGMessage(parser_e_wrong_parameter_size);
  1891. symtableprocentry.write_parameter_lists(nil);
  1892. end
  1893. else
  1894. CGMessage(parser_e_cant_access_private_member);
  1895. end;
  1896. end;
  1897. goto errorexit;
  1898. end;
  1899. { Retrieve information about the candidates }
  1900. candidates_get_information(procs);
  1901. {$ifdef EXTDEBUG}
  1902. { Display info when multiple candidates are found }
  1903. if assigned(procs^.next) then
  1904. candidates_dump_info(V_Debug,procs);
  1905. {$endif EXTDEBUG}
  1906. { Choose the best candidate and count the number of
  1907. candidates left }
  1908. cand_cnt:=candidates_choose_best(procs,tprocdef(procdefinition));
  1909. { All parameters are checked, check if there are any
  1910. procedures left }
  1911. if cand_cnt>0 then
  1912. begin
  1913. { Multiple candidates left? }
  1914. if cand_cnt>1 then
  1915. begin
  1916. CGMessage(cg_e_cant_choose_overload_function);
  1917. {$ifdef EXTDEBUG}
  1918. candidates_dump_info(V_Hint,procs);
  1919. {$else}
  1920. candidates_list(procs,false);
  1921. {$endif EXTDEBUG}
  1922. { we'll just use the first candidate to make the
  1923. call }
  1924. end;
  1925. { assign procdefinition }
  1926. if symtableproc=nil then
  1927. symtableproc:=procdefinition.owner;
  1928. { update browser information }
  1929. if make_ref then
  1930. begin
  1931. tprocdef(procdefinition).lastref:=tref.create(tprocdef(procdefinition).lastref,@fileinfo);
  1932. inc(tprocdef(procdefinition).refcount);
  1933. if tprocdef(procdefinition).defref=nil then
  1934. tprocdef(procdefinition).defref:=tprocdef(procdefinition).lastref;
  1935. end;
  1936. end
  1937. else
  1938. begin
  1939. { No candidates left, this must be a type error,
  1940. because wrong size is already checked. procdefinition
  1941. is filled with the first (random) definition that is
  1942. found. We use this definition to display a nice error
  1943. message that the wrong type is passed }
  1944. candidates_find_wrong_para(procs);
  1945. candidates_list(procs,true);
  1946. {$ifdef EXTDEBUG}
  1947. candidates_dump_info(V_Hint,procs);
  1948. {$endif EXTDEBUG}
  1949. { We can not proceed, release all procs and exit }
  1950. candidates_free(procs);
  1951. goto errorexit;
  1952. end;
  1953. candidates_free(procs);
  1954. end; { end of procedure to call determination }
  1955. { add needed default parameters }
  1956. if assigned(procdefinition) and
  1957. (paralength<procdefinition.maxparacount) then
  1958. begin
  1959. currpara:=tparaitem(procdefinition.Para.first);
  1960. i:=0;
  1961. while (i<paralength) do
  1962. begin
  1963. if not assigned(currpara) then
  1964. internalerror(200306181);
  1965. if not currpara.is_hidden then
  1966. inc(i);
  1967. currpara:=tparaitem(currpara.next);
  1968. end;
  1969. while assigned(currpara) and
  1970. currpara.is_hidden do
  1971. currpara:=tparaitem(currpara.next);
  1972. while assigned(currpara) do
  1973. begin
  1974. if not assigned(currpara.defaultvalue) then
  1975. internalerror(200212142);
  1976. left:=ccallparanode.create(genconstsymtree(tconstsym(currpara.defaultvalue)),left);
  1977. currpara:=tparaitem(currpara.next);
  1978. end;
  1979. end;
  1980. end;
  1981. { handle predefined procedures }
  1982. is_const:=(po_internconst in procdefinition.procoptions) and
  1983. ((block_type in [bt_const,bt_type]) or
  1984. (assigned(left) and (tcallparanode(left).left.nodetype in [realconstn,ordconstn])));
  1985. if (procdefinition.proccalloption=pocall_internproc) or is_const then
  1986. begin
  1987. if assigned(left) then
  1988. begin
  1989. { ptr and settextbuf needs two args }
  1990. if assigned(tcallparanode(left).right) then
  1991. begin
  1992. hpt:=geninlinenode(tprocdef(procdefinition).extnumber,is_const,left);
  1993. left:=nil;
  1994. end
  1995. else
  1996. begin
  1997. hpt:=geninlinenode(tprocdef(procdefinition).extnumber,is_const,tcallparanode(left).left);
  1998. tcallparanode(left).left:=nil;
  1999. end;
  2000. end
  2001. else
  2002. hpt:=geninlinenode(tprocdef(procdefinition).extnumber,is_const,nil);
  2003. result:=hpt;
  2004. goto errorexit;
  2005. end;
  2006. { ensure that the result type is set }
  2007. if not restypeset then
  2008. begin
  2009. { constructors return their current class type, not the type where the
  2010. constructor is declared, this can be different because of inheritance }
  2011. if (procdefinition.proctypeoption=potype_constructor) and
  2012. assigned(methodpointer) and
  2013. assigned(methodpointer.resulttype.def) and
  2014. (methodpointer.resulttype.def.deftype=classrefdef) then
  2015. resulttype:=tclassrefdef(methodpointer.resulttype.def).pointertype
  2016. else
  2017. resulttype:=procdefinition.rettype;
  2018. end
  2019. else
  2020. resulttype:=restype;
  2021. if resulttype.def.needs_inittable then
  2022. include(current_procinfo.flags,pi_needs_implicit_finally);
  2023. if assigned(methodpointer) then
  2024. begin
  2025. resulttypepass(methodpointer);
  2026. { direct call to inherited abstract method, then we
  2027. can already give a error in the compiler instead
  2028. of a runtime error }
  2029. if (nf_inherited in flags) and
  2030. (po_abstractmethod in procdefinition.procoptions) then
  2031. CGMessage(cg_e_cant_call_abstract_method);
  2032. { if an inherited con- or destructor should be }
  2033. { called in a con- or destructor then a warning }
  2034. { will be made }
  2035. { con- and destructors need a pointer to the vmt }
  2036. if (nf_inherited in flags) and
  2037. (procdefinition.proctypeoption in [potype_constructor,potype_destructor]) and
  2038. is_object(methodpointer.resulttype.def) and
  2039. not(current_procinfo.procdef.proctypeoption in [potype_constructor,potype_destructor]) then
  2040. CGMessage(cg_w_member_cd_call_from_method);
  2041. if methodpointer.nodetype<>typen then
  2042. begin
  2043. hpt:=methodpointer;
  2044. while assigned(hpt) and (hpt.nodetype in [subscriptn,vecn]) do
  2045. hpt:=tunarynode(hpt).left;
  2046. if (procdefinition.proctypeoption=potype_constructor) and
  2047. assigned(symtableproc) and
  2048. (symtableproc.symtabletype=withsymtable) and
  2049. (tnode(twithsymtable(symtableproc).withrefnode).nodetype=temprefn) then
  2050. CGmessage(cg_e_cannot_call_cons_dest_inside_with);
  2051. { R.Init then R will be initialized by the constructor,
  2052. Also allow it for simple loads }
  2053. if (procdefinition.proctypeoption=potype_constructor) or
  2054. ((hpt.nodetype=loadn) and
  2055. (
  2056. (methodpointer.resulttype.def.deftype=classrefdef) or
  2057. (
  2058. (methodpointer.resulttype.def.deftype=objectdef) and
  2059. not(oo_has_virtual in tobjectdef(methodpointer.resulttype.def).objectoptions)
  2060. )
  2061. )
  2062. ) then
  2063. method_must_be_valid:=false
  2064. else
  2065. method_must_be_valid:=true;
  2066. set_varstate(methodpointer,vs_used,method_must_be_valid);
  2067. { The object is already used if it is called once }
  2068. if (hpt.nodetype=loadn) and
  2069. (tloadnode(hpt).symtableentry.typ=varsym) then
  2070. tvarsym(tloadnode(hpt).symtableentry).varstate:=vs_used;
  2071. end;
  2072. { if we are calling the constructor, ignore inherited
  2073. calls }
  2074. if (procdefinition.proctypeoption=potype_constructor) and
  2075. not(nf_inherited in flags) then
  2076. verifyabstractcalls;
  2077. end
  2078. else
  2079. begin
  2080. { When this is method the methodpointer must be available }
  2081. if (right=nil) and
  2082. (procdefinition.owner.symtabletype=objectsymtable) then
  2083. internalerror(200305061);
  2084. end;
  2085. { Change loading of array of const to varargs }
  2086. if assigned(left) and
  2087. is_array_of_const(tparaitem(procdefinition.para.last).paratype.def) and
  2088. (procdefinition.proccalloption in [pocall_cppdecl,pocall_cdecl]) then
  2089. convert_carg_array_of_const;
  2090. { bind paraitems to the callparanodes and insert hidden parameters }
  2091. aktcallnode:=self;
  2092. bind_paraitem;
  2093. { methodpointer is only needed for virtual calls, and
  2094. it should then be loaded with the VMT }
  2095. if (po_virtualmethod in procdefinition.procoptions) and
  2096. not(assigned(methodpointer) and
  2097. (methodpointer.nodetype=typen)) then
  2098. begin
  2099. if not assigned(methodpointer) then
  2100. internalerror(200305063);
  2101. if (methodpointer.resulttype.def.deftype<>classrefdef) then
  2102. begin
  2103. methodpointer:=cloadvmtaddrnode.create(methodpointer);
  2104. resulttypepass(methodpointer);
  2105. end;
  2106. end
  2107. else
  2108. begin
  2109. { not needed anymore }
  2110. methodpointer.free;
  2111. methodpointer:=nil;
  2112. end;
  2113. { insert type conversions for parameters }
  2114. if assigned(left) then
  2115. tcallparanode(left).insert_typeconv(true);
  2116. errorexit:
  2117. aktcallnode:=oldcallnode;
  2118. end;
  2119. function tcallnode.pass_1 : tnode;
  2120. {$ifdef m68k}
  2121. var
  2122. regi : tregister;
  2123. {$endif}
  2124. label
  2125. errorexit;
  2126. begin
  2127. result:=nil;
  2128. { work trough all parameters to get the register requirements }
  2129. if assigned(left) then
  2130. tcallparanode(left).det_registers;
  2131. { function result node }
  2132. if assigned(_funcretnode) then
  2133. firstpass(_funcretnode);
  2134. { procedure variable ? }
  2135. if assigned(right) then
  2136. begin
  2137. firstpass(right);
  2138. { procedure does a call }
  2139. if not (block_type in [bt_const,bt_type]) then
  2140. include(current_procinfo.flags,pi_do_call);
  2141. end
  2142. else
  2143. { not a procedure variable }
  2144. begin
  2145. { calc the correture value for the register }
  2146. { handle predefined procedures }
  2147. if (procdefinition.proccalloption=pocall_inline) then
  2148. begin
  2149. if assigned(methodpointer) then
  2150. CGMessage(cg_e_unable_inline_object_methods);
  2151. if assigned(right) then
  2152. CGMessage(cg_e_unable_inline_procvar);
  2153. if not assigned(inlinecode) then
  2154. begin
  2155. if assigned(tprocdef(procdefinition).code) then
  2156. inlinecode:=tprocdef(procdefinition).code.getcopy
  2157. else
  2158. CGMessage(cg_e_no_code_for_inline_stored);
  2159. if assigned(inlinecode) then
  2160. begin
  2161. { consider it has not inlined if called
  2162. again inside the args }
  2163. procdefinition.proccalloption:=pocall_default;
  2164. firstpass(inlinecode);
  2165. end;
  2166. end;
  2167. end
  2168. else
  2169. begin
  2170. if not (block_type in [bt_const,bt_type]) then
  2171. include(current_procinfo.flags,pi_do_call);
  2172. end;
  2173. end;
  2174. { get a register for the return value }
  2175. if (not is_void(resulttype.def)) then
  2176. begin
  2177. if paramanager.ret_in_param(resulttype.def,procdefinition.proccalloption) then
  2178. begin
  2179. expectloc:=LOC_REFERENCE;
  2180. end
  2181. else
  2182. { for win32 records returned in EDX:EAX, we
  2183. move them to memory after ... }
  2184. if (resulttype.def.deftype=recorddef) then
  2185. begin
  2186. expectloc:=LOC_CREFERENCE;
  2187. end
  2188. else
  2189. { ansi/widestrings must be registered, so we can dispose them }
  2190. if is_ansistring(resulttype.def) or
  2191. is_widestring(resulttype.def) then
  2192. begin
  2193. expectloc:=LOC_CREFERENCE;
  2194. registers32:=1;
  2195. end
  2196. else
  2197. { we have only to handle the result if it is used }
  2198. if (nf_return_value_used in flags) then
  2199. begin
  2200. case resulttype.def.deftype of
  2201. enumdef,
  2202. orddef :
  2203. begin
  2204. if (procdefinition.proctypeoption=potype_constructor) then
  2205. begin
  2206. expectloc:=LOC_REGISTER;
  2207. registers32:=1;
  2208. end
  2209. else
  2210. begin
  2211. expectloc:=LOC_REGISTER;
  2212. if is_64bit(resulttype.def) then
  2213. registers32:=2
  2214. else
  2215. registers32:=1;
  2216. end;
  2217. end;
  2218. floatdef :
  2219. begin
  2220. expectloc:=LOC_FPUREGISTER;
  2221. {$ifdef cpufpemu}
  2222. if (cs_fp_emulation in aktmoduleswitches) then
  2223. registers32:=1
  2224. else
  2225. {$endif cpufpemu}
  2226. {$ifdef m68k}
  2227. if (tfloatdef(resulttype.def).typ=s32real) then
  2228. registers32:=1
  2229. else
  2230. {$endif m68k}
  2231. registersfpu:=1;
  2232. end;
  2233. else
  2234. begin
  2235. expectloc:=LOC_REGISTER;
  2236. registers32:=1;
  2237. end;
  2238. end;
  2239. end
  2240. else
  2241. expectloc:=LOC_VOID;
  2242. end
  2243. else
  2244. expectloc:=LOC_VOID;
  2245. {$ifdef m68k}
  2246. { we need one more address register for virtual calls on m68k }
  2247. if (po_virtualmethod in procdefinition.procoptions) then
  2248. inc(registers32);
  2249. {$endif m68k}
  2250. { a fpu can be used in any procedure !! }
  2251. {$ifdef i386}
  2252. registersfpu:=procdefinition.fpu_used;
  2253. {$endif i386}
  2254. { if this is a call to a method calc the registers }
  2255. if (methodpointer<>nil) then
  2256. begin
  2257. if methodpointer.nodetype<>typen then
  2258. begin
  2259. firstpass(methodpointer);
  2260. registersfpu:=max(methodpointer.registersfpu,registersfpu);
  2261. registers32:=max(methodpointer.registers32,registers32);
  2262. {$ifdef SUPPORT_MMX }
  2263. registersmmx:=max(methodpointer.registersmmx,registersmmx);
  2264. {$endif SUPPORT_MMX}
  2265. end;
  2266. end;
  2267. { determine the registers of the procedure variable }
  2268. { is this OK for inlined procs also ?? (PM) }
  2269. if assigned(inlinecode) then
  2270. begin
  2271. registersfpu:=max(inlinecode.registersfpu,registersfpu);
  2272. registers32:=max(inlinecode.registers32,registers32);
  2273. {$ifdef SUPPORT_MMX}
  2274. registersmmx:=max(inlinecode.registersmmx,registersmmx);
  2275. {$endif SUPPORT_MMX}
  2276. end;
  2277. { determine the registers of the procedure variable }
  2278. { is this OK for inlined procs also ?? (PM) }
  2279. if assigned(right) then
  2280. begin
  2281. registersfpu:=max(right.registersfpu,registersfpu);
  2282. registers32:=max(right.registers32,registers32);
  2283. {$ifdef SUPPORT_MMX}
  2284. registersmmx:=max(right.registersmmx,registersmmx);
  2285. {$endif SUPPORT_MMX}
  2286. end;
  2287. { determine the registers of the procedure }
  2288. if assigned(left) then
  2289. begin
  2290. registersfpu:=max(left.registersfpu,registersfpu);
  2291. registers32:=max(left.registers32,registers32);
  2292. {$ifdef SUPPORT_MMX}
  2293. registersmmx:=max(left.registersmmx,registersmmx);
  2294. {$endif SUPPORT_MMX}
  2295. end;
  2296. errorexit:
  2297. if assigned(inlinecode) then
  2298. procdefinition.proccalloption:=pocall_inline;
  2299. end;
  2300. {$ifdef state_tracking}
  2301. function Tcallnode.track_state_pass(exec_known:boolean):boolean;
  2302. var hp:Tcallparanode;
  2303. value:Tnode;
  2304. begin
  2305. track_state_pass:=false;
  2306. hp:=Tcallparanode(left);
  2307. while assigned(hp) do
  2308. begin
  2309. if left.track_state_pass(exec_known) then
  2310. begin
  2311. left.resulttype.def:=nil;
  2312. do_resulttypepass(left);
  2313. end;
  2314. value:=aktstate.find_fact(hp.left);
  2315. if value<>nil then
  2316. begin
  2317. track_state_pass:=true;
  2318. hp.left.destroy;
  2319. hp.left:=value.getcopy;
  2320. do_resulttypepass(hp.left);
  2321. end;
  2322. hp:=Tcallparanode(hp.right);
  2323. end;
  2324. end;
  2325. {$endif}
  2326. function tcallnode.para_count:longint;
  2327. var
  2328. ppn : tcallparanode;
  2329. begin
  2330. result:=0;
  2331. ppn:=tcallparanode(left);
  2332. while assigned(ppn) do
  2333. begin
  2334. if not(assigned(ppn.paraitem) and
  2335. ppn.paraitem.is_hidden) then
  2336. inc(result);
  2337. ppn:=tcallparanode(ppn.right);
  2338. end;
  2339. end;
  2340. function tcallnode.docompare(p: tnode): boolean;
  2341. begin
  2342. docompare :=
  2343. inherited docompare(p) and
  2344. (symtableprocentry = tcallnode(p).symtableprocentry) and
  2345. (procdefinition = tcallnode(p).procdefinition) and
  2346. (methodpointer.isequal(tcallnode(p).methodpointer)) and
  2347. ((restypeset and tcallnode(p).restypeset and
  2348. (equal_defs(restype.def,tcallnode(p).restype.def))) or
  2349. (not restypeset and not tcallnode(p).restypeset));
  2350. end;
  2351. procedure tcallnode.printnodedata(var t:text);
  2352. begin
  2353. if assigned(procdefinition) and
  2354. (procdefinition.deftype=procdef) then
  2355. writeln(t,printnodeindention,'proc = ',tprocdef(procdefinition).fullprocname(true))
  2356. else
  2357. begin
  2358. if assigned(symtableprocentry) then
  2359. writeln(t,printnodeindention,'proc = ',symtableprocentry.name)
  2360. else
  2361. writeln(t,printnodeindention,'proc = <nil>');
  2362. end;
  2363. printnode(t,methodpointer);
  2364. printnode(t,right);
  2365. printnode(t,left);
  2366. end;
  2367. begin
  2368. ccallnode:=tcallnode;
  2369. ccallparanode:=tcallparanode;
  2370. end.
  2371. {
  2372. $Log$
  2373. Revision 1.203 2003-10-31 15:52:58 peter
  2374. * support creating classes using <class of tobject>.create
  2375. Revision 1.202 2003/10/30 16:23:13 peter
  2376. * don't search for overloads in parents for constructors
  2377. Revision 1.201 2003/10/29 22:01:20 florian
  2378. * fixed passing of dyn. arrays to open array parameters
  2379. Revision 1.200 2003/10/23 14:44:07 peter
  2380. * splitted buildderef and buildderefimpl to fix interface crc
  2381. calculation
  2382. Revision 1.199 2003/10/22 20:40:00 peter
  2383. * write derefdata in a separate ppu entry
  2384. Revision 1.198 2003/10/21 18:17:02 peter
  2385. * only search for overloaded constructors in classes
  2386. Revision 1.197 2003/10/21 15:14:55 peter
  2387. * also search in parents for overloads when calling a constructor
  2388. Revision 1.196 2003/10/13 14:05:12 peter
  2389. * removed is_visible_for_proc
  2390. * search also for class overloads when finding interface
  2391. implementations
  2392. Revision 1.195 2003/10/09 21:31:37 daniel
  2393. * Register allocator splitted, ans abstract now
  2394. Revision 1.194 2003/10/09 15:00:13 florian
  2395. * fixed constructor call in class methods
  2396. Revision 1.193 2003/10/08 19:19:45 peter
  2397. * set_varstate cleanup
  2398. Revision 1.192 2003/10/07 21:14:32 peter
  2399. * compare_paras() has a parameter to ignore hidden parameters
  2400. * cross unit overload searching ignores hidden parameters when
  2401. comparing parameter lists. Now function(string):string is
  2402. not overriden with procedure(string) which has the same visible
  2403. parameter list
  2404. Revision 1.191 2003/10/05 21:21:52 peter
  2405. * c style array of const generates callparanodes
  2406. * varargs paraloc fixes
  2407. Revision 1.190 2003/10/05 12:54:17 peter
  2408. * don't check for abstract methods when the constructor is called
  2409. by inherited
  2410. * fix private member error instead of wrong number of parameters
  2411. Revision 1.189 2003/10/04 19:00:52 florian
  2412. * fixed TP 6.0 styled inherited call; fixes IDE with 1.1
  2413. Revision 1.188 2003/10/03 22:00:33 peter
  2414. * parameter alignment fixes
  2415. Revision 1.187 2003/10/03 14:44:38 peter
  2416. * fix IE when callnode was firstpassed twice
  2417. Revision 1.186 2003/10/02 21:13:46 peter
  2418. * protected visibility fixes
  2419. Revision 1.185 2003/10/01 20:34:48 peter
  2420. * procinfo unit contains tprocinfo
  2421. * cginfo renamed to cgbase
  2422. * moved cgmessage to verbose
  2423. * fixed ppc and sparc compiles
  2424. Revision 1.184 2003/09/28 21:44:55 peter
  2425. * fix check that filedef needs var para
  2426. Revision 1.183 2003/09/28 17:55:03 peter
  2427. * parent framepointer changed to hidden parameter
  2428. * tloadparentfpnode added
  2429. Revision 1.182 2003/09/25 21:28:00 peter
  2430. * parameter fixes
  2431. Revision 1.181 2003/09/23 17:56:05 peter
  2432. * locals and paras are allocated in the code generation
  2433. * tvarsym.localloc contains the location of para/local when
  2434. generating code for the current procedure
  2435. Revision 1.180 2003/09/16 16:17:01 peter
  2436. * varspez in calls to push_addr_param
  2437. Revision 1.179 2003/09/07 22:09:35 peter
  2438. * preparations for different default calling conventions
  2439. * various RA fixes
  2440. Revision 1.178 2003/09/06 22:27:08 florian
  2441. * fixed web bug 2669
  2442. * cosmetic fix in printnode
  2443. * tobjectdef.gettypename implemented
  2444. Revision 1.177 2003/09/03 15:55:00 peter
  2445. * NEWRA branch merged
  2446. Revision 1.176.2.3 2003/08/31 21:07:44 daniel
  2447. * callparatemp ripped
  2448. Revision 1.176.2.2 2003/08/27 20:23:55 peter
  2449. * remove old ra code
  2450. Revision 1.176.2.1 2003/08/27 19:55:54 peter
  2451. * first tregister patch
  2452. Revision 1.176 2003/08/23 18:42:57 peter
  2453. * only check for size matches when parameter is enum,ord,float
  2454. Revision 1.175 2003/08/10 17:25:23 peter
  2455. * fixed some reported bugs
  2456. Revision 1.174 2003/07/25 09:54:57 jonas
  2457. * fixed bogus abstract method warnings
  2458. Revision 1.173 2003/06/25 18:31:23 peter
  2459. * sym,def resolving partly rewritten to support also parent objects
  2460. not directly available through the uses clause
  2461. Revision 1.172 2003/06/17 16:34:44 jonas
  2462. * lots of newra fixes (need getfuncretparaloc implementation for i386)!
  2463. * renamed all_intregisters to volatile_intregisters and made it
  2464. processor dependent
  2465. Revision 1.171 2003/06/15 16:47:33 jonas
  2466. * fixed revious commit
  2467. Revision 1.170 2003/06/15 15:10:57 jonas
  2468. * callparatemp fix: if a threadvar is a parameter, that paramter also
  2469. does a call
  2470. Revision 1.169 2003/06/13 21:19:30 peter
  2471. * current_procdef removed, use current_procinfo.procdef instead
  2472. Revision 1.168 2003/06/08 20:01:53 jonas
  2473. * optimized assignments with on the right side a function that returns
  2474. an ansi- or widestring
  2475. Revision 1.167 2003/06/08 18:27:15 jonas
  2476. + ability to change the location of a ttempref node with changelocation()
  2477. method. Useful to use instead of copying the contents from one temp to
  2478. another
  2479. + some shortstring optimizations in tassignmentnode that avoid some
  2480. copying (required some shortstring optimizations to be moved from
  2481. resulttype to firstpass, because they work on callnodes and string
  2482. addnodes are only changed to callnodes in the firstpass)
  2483. * allow setting/changing the funcretnode of callnodes after the
  2484. resulttypepass has been done, funcretnode is now a property
  2485. (all of the above should have a quite big effect on callparatemp)
  2486. Revision 1.166 2003/06/08 11:42:33 peter
  2487. * creating class with abstract call checking fixed
  2488. * there will be only one warning for each class, the methods
  2489. are listed as hint
  2490. Revision 1.165 2003/06/07 20:26:32 peter
  2491. * re-resolving added instead of reloading from ppu
  2492. * tderef object added to store deref info for resolving
  2493. Revision 1.164 2003/06/03 21:05:48 peter
  2494. * fix check for procedure without parameters
  2495. * calling constructor as member will not allocate memory
  2496. Revision 1.163 2003/06/03 13:01:59 daniel
  2497. * Register allocator finished
  2498. Revision 1.162 2003/05/26 21:17:17 peter
  2499. * procinlinenode removed
  2500. * aktexit2label removed, fast exit removed
  2501. + tcallnode.inlined_pass_2 added
  2502. Revision 1.161 2003/05/25 11:34:17 peter
  2503. * methodpointer self pushing fixed
  2504. Revision 1.160 2003/05/25 08:59:16 peter
  2505. * inline fixes
  2506. Revision 1.159 2003/05/24 17:16:37 jonas
  2507. * added missing firstpass for callparatemp code
  2508. Revision 1.158 2003/05/23 14:27:35 peter
  2509. * remove some unit dependencies
  2510. * current_procinfo changes to store more info
  2511. Revision 1.157 2003/05/17 14:05:58 jonas
  2512. * fixed callparatemp for ansi/widestring and interfacecoms
  2513. Revision 1.156 2003/05/17 13:30:08 jonas
  2514. * changed tt_persistant to tt_persistent :)
  2515. * tempcreatenode now doesn't accept a boolean anymore for persistent
  2516. temps, but a ttemptype, so you can also create ansistring temps etc
  2517. Revision 1.155 2003/05/16 14:33:31 peter
  2518. * regvar fixes
  2519. Revision 1.154 2003/05/14 19:35:50 jonas
  2520. * fixed callparatemp so it works with vs_var, vs_out and formal const
  2521. parameters
  2522. Revision 1.153 2003/05/13 20:53:41 peter
  2523. * constructors return in register
  2524. Revision 1.152 2003/05/13 15:18:49 peter
  2525. * fixed various crashes
  2526. Revision 1.151 2003/05/11 21:37:03 peter
  2527. * moved implicit exception frame from ncgutil to psub
  2528. * constructor/destructor helpers moved from cobj/ncgutil to psub
  2529. Revision 1.150 2003/05/11 14:45:12 peter
  2530. * tloadnode does not support objectsymtable,withsymtable anymore
  2531. * withnode cleanup
  2532. * direct with rewritten to use temprefnode
  2533. Revision 1.149 2003/05/09 17:47:02 peter
  2534. * self moved to hidden parameter
  2535. * removed hdisposen,hnewn,selfn
  2536. Revision 1.148 2003/05/05 14:53:16 peter
  2537. * vs_hidden replaced by is_hidden boolean
  2538. Revision 1.147 2003/04/27 11:21:33 peter
  2539. * aktprocdef renamed to current_procinfo.procdef
  2540. * procinfo renamed to current_procinfo
  2541. * procinfo will now be stored in current_module so it can be
  2542. cleaned up properly
  2543. * gen_main_procsym changed to create_main_proc and release_main_proc
  2544. to also generate a tprocinfo structure
  2545. * fixed unit implicit initfinal
  2546. Revision 1.146 2003/04/27 09:08:44 jonas
  2547. * do callparatemp stuff only after the parameters have been firstpassed,
  2548. because some nodes are turned into calls during the firstpass
  2549. Revision 1.145 2003/04/27 07:29:50 peter
  2550. * current_procinfo.procdef cleanup, current_procdef is now always nil when parsing
  2551. a new procdef declaration
  2552. * aktprocsym removed
  2553. * lexlevel removed, use symtable.symtablelevel instead
  2554. * implicit init/final code uses the normal genentry/genexit
  2555. * funcret state checking updated for new funcret handling
  2556. Revision 1.144 2003/04/25 20:59:33 peter
  2557. * removed funcretn,funcretsym, function result is now in varsym
  2558. and aliases for result and function name are added using absolutesym
  2559. * vs_hidden parameter for funcret passed in parameter
  2560. * vs_hidden fixes
  2561. * writenode changed to printnode and released from extdebug
  2562. * -vp option added to generate a tree.log with the nodetree
  2563. * nicer printnode for statements, callnode
  2564. Revision 1.143 2002/04/25 20:15:39 florian
  2565. * block nodes within expressions shouldn't release the used registers,
  2566. fixed using a flag till the new rg is ready
  2567. Revision 1.142 2003/04/23 20:16:04 peter
  2568. + added currency support based on int64
  2569. + is_64bit for use in cg units instead of is_64bitint
  2570. * removed cgmessage from n386add, replace with internalerrors
  2571. Revision 1.141 2003/04/23 13:21:06 peter
  2572. * fix warning for calling constructor inside constructor
  2573. Revision 1.140 2003/04/23 12:35:34 florian
  2574. * fixed several issues with powerpc
  2575. + applied a patch from Jonas for nested function calls (PowerPC only)
  2576. * ...
  2577. Revision 1.139 2003/04/22 23:50:22 peter
  2578. * firstpass uses expectloc
  2579. * checks if there are differences between the expectloc and
  2580. location.loc from secondpass in EXTDEBUG
  2581. Revision 1.138 2003/04/22 09:53:33 peter
  2582. * fix insert_typeconv to handle new varargs which don't have a
  2583. paraitem set
  2584. Revision 1.137 2003/04/11 16:02:05 peter
  2585. * don't firstpass typen
  2586. Revision 1.136 2003/04/11 15:51:04 peter
  2587. * support subscript,vec for setting methodpointer varstate
  2588. Revision 1.135 2003/04/10 17:57:52 peter
  2589. * vs_hidden released
  2590. Revision 1.134 2003/04/07 11:58:22 jonas
  2591. * more vs_invisible fixes
  2592. Revision 1.133 2003/04/07 10:40:21 jonas
  2593. * fixed VS_HIDDEN for high parameter so it works again
  2594. Revision 1.132 2003/04/04 15:38:56 peter
  2595. * moved generic code from n386cal to ncgcal, i386 now also
  2596. uses the generic ncgcal
  2597. Revision 1.131 2003/03/17 18:54:23 peter
  2598. * fix missing self setting for method to procvar conversion in
  2599. tp_procvar mode
  2600. Revision 1.130 2003/03/17 16:54:41 peter
  2601. * support DefaultHandler and anonymous inheritance fixed
  2602. for message methods
  2603. Revision 1.129 2003/03/17 15:54:22 peter
  2604. * store symoptions also for procdef
  2605. * check symoptions (private,public) when calculating possible
  2606. overload candidates
  2607. Revision 1.128 2003/02/19 22:00:14 daniel
  2608. * Code generator converted to new register notation
  2609. - Horribily outdated todo.txt removed
  2610. Revision 1.127 2003/01/16 22:13:52 peter
  2611. * convert_l3 convertlevel added. This level is used for conversions
  2612. where information can be lost like converting widestring->ansistring
  2613. or dword->byte
  2614. Revision 1.126 2003/01/15 01:44:32 peter
  2615. * merged methodpointer fixes from 1.0.x
  2616. Revision 1.125 2003/01/12 17:52:07 peter
  2617. * only check for auto inherited in objectsymtable
  2618. Revision 1.124 2003/01/09 21:45:46 peter
  2619. * extended information about overloaded candidates when compiled
  2620. with EXTDEBUG
  2621. Revision 1.123 2002/12/26 18:24:33 jonas
  2622. * fixed check for whether or not a high parameter was already generated
  2623. * no type checking/conversions for invisible parameters
  2624. Revision 1.122 2002/12/15 22:50:00 florian
  2625. + some stuff for the new hidden parameter handling added
  2626. Revision 1.121 2002/12/15 21:34:15 peter
  2627. * give sign difference between ordinals a small penalty. This is
  2628. needed to get word->[longword|longint] working
  2629. Revision 1.120 2002/12/15 21:30:12 florian
  2630. * tcallnode.paraitem introduced, all references to defcoll removed
  2631. Revision 1.119 2002/12/15 20:59:58 peter
  2632. * fix crash with default parameters
  2633. Revision 1.118 2002/12/15 11:26:02 peter
  2634. * ignore vs_hidden parameters when choosing overloaded proc
  2635. Revision 1.117 2002/12/11 22:42:28 peter
  2636. * tcallnode.det_resulttype rewrite, merged code from nice_ncal and
  2637. the old code. The new code collects the information about possible
  2638. candidates only once resultting in much less calls to type compare
  2639. routines
  2640. Revision 1.116 2002/12/07 14:27:07 carl
  2641. * 3% memory optimization
  2642. * changed some types
  2643. + added type checking with different size for call node and for
  2644. parameters
  2645. Revision 1.115 2002/12/06 17:51:10 peter
  2646. * merged cdecl and array fixes
  2647. Revision 1.114 2002/12/06 16:56:58 peter
  2648. * only compile cs_fp_emulation support when cpufpuemu is defined
  2649. * define cpufpuemu for m68k only
  2650. Revision 1.113 2002/11/27 20:04:38 peter
  2651. * cdecl array of const fixes
  2652. Revision 1.112 2002/11/27 15:33:46 peter
  2653. * the never ending story of tp procvar hacks
  2654. Revision 1.111 2002/11/27 02:31:17 peter
  2655. * fixed inlinetree parsing in det_resulttype
  2656. Revision 1.110 2002/11/25 18:43:32 carl
  2657. - removed the invalid if <> checking (Delphi is strange on this)
  2658. + implemented abstract warning on instance creation of class with
  2659. abstract methods.
  2660. * some error message cleanups
  2661. Revision 1.109 2002/11/25 17:43:17 peter
  2662. * splitted defbase in defutil,symutil,defcmp
  2663. * merged isconvertable and is_equal into compare_defs(_ext)
  2664. * made operator search faster by walking the list only once
  2665. Revision 1.108 2002/11/18 17:31:54 peter
  2666. * pass proccalloption to ret_in_xxx and push_xxx functions
  2667. Revision 1.107 2002/11/15 01:58:50 peter
  2668. * merged changes from 1.0.7 up to 04-11
  2669. - -V option for generating bug report tracing
  2670. - more tracing for option parsing
  2671. - errors for cdecl and high()
  2672. - win32 import stabs
  2673. - win32 records<=8 are returned in eax:edx (turned off by default)
  2674. - heaptrc update
  2675. - more info for temp management in .s file with EXTDEBUG
  2676. Revision 1.106 2002/10/14 18:20:30 carl
  2677. * var parameter checking for classes and interfaces in Delphi mode
  2678. Revision 1.105 2002/10/06 21:02:17 peter
  2679. * fixed limit checking for qword
  2680. Revision 1.104 2002/10/05 15:15:45 peter
  2681. * Write unknwon compiler proc using Comment and only in Extdebug
  2682. Revision 1.103 2002/10/05 12:43:25 carl
  2683. * fixes for Delphi 6 compilation
  2684. (warning : Some features do not work under Delphi)
  2685. Revision 1.102 2002/10/05 00:48:57 peter
  2686. * support inherited; support for overload as it is handled by
  2687. delphi. This is only for delphi mode as it is working is
  2688. undocumented and hard to predict what is done
  2689. Revision 1.101 2002/09/16 14:11:12 peter
  2690. * add argument to equal_paras() to support default values or not
  2691. Revision 1.100 2002/09/15 17:49:59 peter
  2692. * don't have strict var parameter checking for procedures in the
  2693. system unit
  2694. Revision 1.99 2002/09/09 19:30:34 peter
  2695. * don't allow convertable parameters for var and out parameters in
  2696. delphi and tp mode
  2697. Revision 1.98 2002/09/07 15:25:02 peter
  2698. * old logs removed and tabs fixed
  2699. Revision 1.97 2002/09/07 12:16:05 carl
  2700. * second part bug report 1996 fix, testrange in cordconstnode
  2701. only called if option is set (also make parsing a tiny faster)
  2702. Revision 1.96 2002/09/05 14:53:41 peter
  2703. * fixed old callnode.det_resulttype code
  2704. * old ncal code is default again
  2705. Revision 1.95 2002/09/03 21:32:49 daniel
  2706. * Small bugfix for procdef selection
  2707. Revision 1.94 2002/09/03 19:27:22 daniel
  2708. * Activated new ncal code
  2709. Revision 1.93 2002/09/03 16:26:26 daniel
  2710. * Make Tprocdef.defs protected
  2711. Revision 1.92 2002/09/01 13:28:37 daniel
  2712. - write_access fields removed in favor of a flag
  2713. Revision 1.91 2002/09/01 12:14:15 peter
  2714. * remove debug line
  2715. * containself methods can be called directly
  2716. Revision 1.90 2002/09/01 08:01:16 daniel
  2717. * Removed sets from Tcallnode.det_resulttype
  2718. + Added read/write notifications of variables. These will be usefull
  2719. for providing information for several optimizations. For example
  2720. the value of the loop variable of a for loop does matter is the
  2721. variable is read after the for loop, but if it's no longer used
  2722. or written, it doesn't matter and this can be used to optimize
  2723. the loop code generation.
  2724. Revision 1.89 2002/08/23 16:13:16 peter
  2725. * also firstpass funcretrefnode if available. This was breaking the
  2726. asnode compilerproc code
  2727. Revision 1.88 2002/08/20 10:31:26 daniel
  2728. * Tcallnode.det_resulttype rewritten
  2729. Revision 1.87 2002/08/19 19:36:42 peter
  2730. * More fixes for cross unit inlining, all tnodes are now implemented
  2731. * Moved pocall_internconst to po_internconst because it is not a
  2732. calling type at all and it conflicted when inlining of these small
  2733. functions was requested
  2734. Revision 1.86 2002/08/17 22:09:44 florian
  2735. * result type handling in tcgcal.pass_2 overhauled
  2736. * better tnode.dowrite
  2737. * some ppc stuff fixed
  2738. Revision 1.85 2002/08/17 09:23:34 florian
  2739. * first part of current_procinfo rewrite
  2740. Revision 1.84 2002/08/16 14:24:57 carl
  2741. * issameref() to test if two references are the same (then emit no opcodes)
  2742. + ret_in_reg to replace ret_in_acc
  2743. (fix some register allocation bugs at the same time)
  2744. + save_std_register now has an extra parameter which is the
  2745. usedinproc registers
  2746. Revision 1.83 2002/07/20 11:57:53 florian
  2747. * types.pas renamed to defbase.pas because D6 contains a types
  2748. unit so this would conflicts if D6 programms are compiled
  2749. + Willamette/SSE2 instructions to assembler added
  2750. Revision 1.82 2002/07/19 11:41:35 daniel
  2751. * State tracker work
  2752. * The whilen and repeatn are now completely unified into whilerepeatn. This
  2753. allows the state tracker to change while nodes automatically into
  2754. repeat nodes.
  2755. * Resulttypepass improvements to the notn. 'not not a' is optimized away and
  2756. 'not(a>b)' is optimized into 'a<=b'.
  2757. * Resulttypepass improvements to the whilerepeatn. 'while not a' is optimized
  2758. by removing the notn and later switchting the true and falselabels. The
  2759. same is done with 'repeat until not a'.
  2760. Revision 1.81 2002/07/15 18:03:14 florian
  2761. * readded removed changes
  2762. Revision 1.79 2002/07/11 14:41:27 florian
  2763. * start of the new generic parameter handling
  2764. Revision 1.80 2002/07/14 18:00:43 daniel
  2765. + Added the beginning of a state tracker. This will track the values of
  2766. variables through procedures and optimize things away.
  2767. Revision 1.78 2002/07/04 20:43:00 florian
  2768. * first x86-64 patches
  2769. }