ncal.pas 109 KB

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