htypechk.pas 77 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. This unit exports some help routines for the type checking
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit htypechk;
  18. {$i fpcdefs.inc}
  19. interface
  20. uses
  21. tokens,cpuinfo,
  22. node,
  23. symconst,symtype,symdef,symsym,symbase;
  24. type
  25. Ttok2nodeRec=record
  26. tok : ttoken;
  27. nod : tnodetype;
  28. op_overloading_supported : boolean;
  29. end;
  30. pcandidate = ^tcandidate;
  31. tcandidate = record
  32. next : pcandidate;
  33. data : tprocdef;
  34. wrongparaidx,
  35. firstparaidx : integer;
  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. tcallcandidates = class
  47. private
  48. FProcSym : tprocsym;
  49. FProcs : pcandidate;
  50. FProcVisibleCnt,
  51. FProcCnt : integer;
  52. FParaNode : tnode;
  53. FParaLength : smallint;
  54. FAllowVariant : boolean;
  55. function proc_add(pd:tprocdef):pcandidate;
  56. public
  57. constructor create(sym:tprocsym;st:tsymtable;ppn:tnode;isprop,ignorevis : boolean);
  58. constructor create_operator(op:ttoken;ppn:tnode);
  59. destructor destroy;override;
  60. procedure list(all:boolean);
  61. {$ifdef EXTDEBUG}
  62. procedure dump_info(lvl:longint);
  63. {$endif EXTDEBUG}
  64. procedure get_information;
  65. function choose_best(var bestpd:tabstractprocdef):integer;
  66. procedure find_wrong_para;
  67. property Count:integer read FProcCnt;
  68. property VisibleCount:integer read FProcVisibleCnt;
  69. end;
  70. const
  71. tok2nodes=25;
  72. tok2node:array[1..tok2nodes] of ttok2noderec=(
  73. (tok:_PLUS ;nod:addn;op_overloading_supported:true), { binary overloading supported }
  74. (tok:_MINUS ;nod:subn;op_overloading_supported:true), { binary and unary overloading supported }
  75. (tok:_STAR ;nod:muln;op_overloading_supported:true), { binary overloading supported }
  76. (tok:_SLASH ;nod:slashn;op_overloading_supported:true), { binary overloading supported }
  77. (tok:_EQUAL ;nod:equaln;op_overloading_supported:true), { binary overloading supported }
  78. (tok:_GT ;nod:gtn;op_overloading_supported:true), { binary overloading supported }
  79. (tok:_LT ;nod:ltn;op_overloading_supported:true), { binary overloading supported }
  80. (tok:_GTE ;nod:gten;op_overloading_supported:true), { binary overloading supported }
  81. (tok:_LTE ;nod:lten;op_overloading_supported:true), { binary overloading supported }
  82. (tok:_SYMDIF ;nod:symdifn;op_overloading_supported:true), { binary overloading supported }
  83. (tok:_STARSTAR;nod:starstarn;op_overloading_supported:true), { binary overloading supported }
  84. (tok:_OP_AS ;nod:asn;op_overloading_supported:false), { binary overloading NOT supported }
  85. (tok:_OP_IN ;nod:inn;op_overloading_supported:false), { binary overloading NOT supported }
  86. (tok:_OP_IS ;nod:isn;op_overloading_supported:false), { binary overloading NOT supported }
  87. (tok:_OP_OR ;nod:orn;op_overloading_supported:true), { binary overloading supported }
  88. (tok:_OP_AND ;nod:andn;op_overloading_supported:true), { binary overloading supported }
  89. (tok:_OP_DIV ;nod:divn;op_overloading_supported:true), { binary overloading supported }
  90. (tok:_OP_NOT ;nod:notn;op_overloading_supported:true), { unary overloading supported }
  91. (tok:_OP_MOD ;nod:modn;op_overloading_supported:true), { binary overloading supported }
  92. (tok:_OP_SHL ;nod:shln;op_overloading_supported:true), { binary overloading supported }
  93. (tok:_OP_SHR ;nod:shrn;op_overloading_supported:true), { binary overloading supported }
  94. (tok:_OP_XOR ;nod:xorn;op_overloading_supported:true), { binary overloading supported }
  95. (tok:_ASSIGNMENT;nod:assignn;op_overloading_supported:true), { unary overloading supported }
  96. (tok:_CARET ;nod:caretn;op_overloading_supported:false), { binary overloading NOT supported }
  97. (tok:_UNEQUAL ;nod:unequaln;op_overloading_supported:false) { binary overloading NOT supported overload = instead }
  98. );
  99. const
  100. { firstcallparan without varspez we don't count the ref }
  101. {$ifdef extdebug}
  102. count_ref : boolean = true;
  103. {$endif def extdebug}
  104. allow_array_constructor : boolean = false;
  105. function node2opstr(nt:tnodetype):string;
  106. { check operator args and result type }
  107. function isbinaryoperatoroverloadable(treetyp:tnodetype;ld:tdef;lt:tnodetype;rd:tdef;rt:tnodetype) : boolean;
  108. function isoperatoracceptable(pf : tprocdef; optoken : ttoken) : boolean;
  109. function isunaryoverloaded(var t : tnode) : boolean;
  110. function isbinaryoverloaded(var t : tnode) : boolean;
  111. { Register Allocation }
  112. procedure make_not_regable(p : tnode);
  113. procedure calcregisters(p : tbinarynode;r32,fpu,mmx : word);
  114. { procvar handling }
  115. function is_procvar_load(p:tnode):boolean;
  116. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  117. { sets varsym varstate field correctly }
  118. type
  119. tvarstateflag = (vsf_must_be_valid,vsf_use_hints);
  120. tvarstateflags = set of tvarstateflag;
  121. procedure set_varstate(p:tnode;newstate:tvarstate;varstateflags:tvarstateflags);
  122. { sets the callunique flag, if the node is a vecn, }
  123. { takes care of type casts etc. }
  124. procedure set_unique(p : tnode);
  125. function valid_for_formal_var(p : tnode) : boolean;
  126. function valid_for_formal_const(p : tnode) : boolean;
  127. function valid_for_var(p:tnode):boolean;
  128. function valid_for_assignment(p:tnode):boolean;
  129. function valid_for_addr(p : tnode) : boolean;
  130. implementation
  131. uses
  132. globtype,systems,
  133. cutils,verbose,globals,
  134. symtable,
  135. defutil,defcmp,
  136. nbas,ncnv,nld,nmem,ncal,nmat,ninl,nutils,
  137. cgbase,procinfo
  138. ;
  139. type
  140. TValidAssign=(Valid_Property,Valid_Void,Valid_Const,Valid_Addr);
  141. TValidAssigns=set of TValidAssign;
  142. function node2opstr(nt:tnodetype):string;
  143. var
  144. i : integer;
  145. begin
  146. result:='<unknown>';
  147. for i:=1 to tok2nodes do
  148. if tok2node[i].nod=nt then
  149. begin
  150. result:=tokeninfo^[tok2node[i].tok].str;
  151. break;
  152. end;
  153. end;
  154. function isbinaryoperatoroverloadable(treetyp:tnodetype;ld:tdef;lt:tnodetype;rd:tdef;rt:tnodetype) : boolean;
  155. function internal_check(treetyp:tnodetype;ld:tdef;lt:tnodetype;rd:tdef;rt:tnodetype;var allowed:boolean):boolean;
  156. begin
  157. internal_check:=true;
  158. case ld.deftype of
  159. formaldef,
  160. recorddef,
  161. variantdef :
  162. begin
  163. allowed:=true;
  164. end;
  165. procvardef :
  166. begin
  167. if (rd.deftype in [pointerdef,procdef,procvardef]) then
  168. begin
  169. allowed:=false;
  170. exit;
  171. end;
  172. allowed:=true;
  173. end;
  174. pointerdef :
  175. begin
  176. if ((rd.deftype in [orddef,enumdef,pointerdef,classrefdef,procvardef]) or
  177. is_class_or_interface(rd)) then
  178. begin
  179. allowed:=false;
  180. exit;
  181. end;
  182. { don't allow pchar+string }
  183. if (is_pchar(ld) or is_pwidechar(ld)) and
  184. ((rd.deftype=stringdef) or
  185. is_pchar(rd) or
  186. is_pwidechar(rd) or
  187. is_chararray(rd) or
  188. is_widechararray(rd)) then
  189. begin
  190. allowed:=false;
  191. exit;
  192. end;
  193. allowed:=true;
  194. end;
  195. arraydef :
  196. begin
  197. { not mmx }
  198. if (cs_mmx in aktlocalswitches) and
  199. is_mmx_able_array(ld) then
  200. begin
  201. allowed:=false;
  202. exit;
  203. end;
  204. { not chararray+[(wide)char,(wide)string,(wide)chararray] }
  205. if (is_chararray(ld) or is_widechararray(ld) or
  206. is_open_chararray(ld) or is_open_widechararray(ld))
  207. and
  208. ((rd.deftype in [stringdef,orddef,enumdef]) or
  209. is_pchar(rd) or
  210. is_pwidechar(rd) or
  211. is_chararray(rd) or
  212. is_widechararray(rd) or
  213. is_open_chararray(rd) or
  214. is_open_widechararray(rd) or
  215. (rt=niln)) then
  216. begin
  217. allowed:=false;
  218. exit;
  219. end;
  220. { dynamic array compare with niln }
  221. if ((is_dynamic_array(ld) and
  222. (rt=niln)) or
  223. (is_dynamic_array(ld) and is_dynamic_array(rd)))
  224. and
  225. (treetyp in [equaln,unequaln]) then
  226. begin
  227. allowed:=false;
  228. exit;
  229. end;
  230. allowed:=true;
  231. end;
  232. objectdef :
  233. begin
  234. { <> and = are defined for classes }
  235. if (treetyp in [equaln,unequaln]) and
  236. is_class_or_interface(ld) then
  237. begin
  238. allowed:=false;
  239. exit;
  240. end;
  241. allowed:=true;
  242. end;
  243. stringdef :
  244. begin
  245. if (rd.deftype in [orddef,enumdef,stringdef]) or
  246. is_pchar(rd) or
  247. is_pwidechar(rd) or
  248. is_chararray(rd) or
  249. is_widechararray(rd) or
  250. is_open_chararray(rd) or
  251. is_open_widechararray(rd) then
  252. begin
  253. allowed:=false;
  254. exit;
  255. end;
  256. allowed:=true;
  257. end;
  258. else
  259. internal_check:=false;
  260. end;
  261. end;
  262. var
  263. allowed : boolean;
  264. begin
  265. { power ** is always possible }
  266. if (treetyp=starstarn) then
  267. begin
  268. isbinaryoperatoroverloadable:=true;
  269. exit;
  270. end;
  271. { order of arguments does not matter so we have to check also
  272. the reversed order }
  273. allowed:=false;
  274. if not internal_check(treetyp,ld,lt,rd,rt,allowed) then
  275. internal_check(treetyp,rd,rt,ld,lt,allowed);
  276. isbinaryoperatoroverloadable:=allowed;
  277. end;
  278. function isunaryoperatoroverloadable(treetyp : tnodetype;ld : tdef) : boolean;
  279. begin
  280. result:=false;
  281. case treetyp of
  282. subn,
  283. unaryminusn :
  284. begin
  285. if (ld.deftype in [orddef,enumdef,floatdef]) then
  286. exit;
  287. {$ifdef SUPPORT_MMX}
  288. if (cs_mmx in aktlocalswitches) and
  289. is_mmx_able_array(ld) then
  290. exit;
  291. {$endif SUPPORT_MMX}
  292. result:=true;
  293. end;
  294. notn :
  295. begin
  296. if (ld.deftype in [orddef,enumdef,floatdef]) then
  297. exit;
  298. {$ifdef SUPPORT_MMX}
  299. if (cs_mmx in aktlocalswitches) and
  300. is_mmx_able_array(ld) then
  301. exit;
  302. {$endif SUPPORT_MMX}
  303. result:=true;
  304. end;
  305. end;
  306. end;
  307. function isoperatoracceptable(pf : tprocdef; optoken : ttoken) : boolean;
  308. var
  309. ld,rd : tdef;
  310. i : longint;
  311. eq : tequaltype;
  312. conv : tconverttype;
  313. pd : tprocdef;
  314. begin
  315. result:=false;
  316. case pf.parast.symindex.count of
  317. 1 : begin
  318. ld:=tparavarsym(pf.parast.symindex.first).vartype.def;
  319. { assignment is a special case }
  320. if optoken=_ASSIGNMENT then
  321. begin
  322. eq:=compare_defs_ext(ld,pf.rettype.def,nothingn,conv,pd,[cdo_explicit]);
  323. result:=(eq=te_incompatible);
  324. end
  325. else
  326. begin
  327. for i:=1 to tok2nodes do
  328. if tok2node[i].tok=optoken then
  329. begin
  330. result:=
  331. tok2node[i].op_overloading_supported and
  332. isunaryoperatoroverloadable(tok2node[i].nod,ld);
  333. break;
  334. end;
  335. end;
  336. end;
  337. 2 : begin
  338. for i:=1 to tok2nodes do
  339. if tok2node[i].tok=optoken then
  340. begin
  341. ld:=tparavarsym(pf.parast.symindex.first).vartype.def;
  342. rd:=tparavarsym(pf.parast.symindex.first.indexnext).vartype.def;
  343. result:=
  344. tok2node[i].op_overloading_supported and
  345. isbinaryoperatoroverloadable(tok2node[i].nod,ld,nothingn,rd,nothingn);
  346. break;
  347. end;
  348. end;
  349. end;
  350. end;
  351. function isunaryoverloaded(var t : tnode) : boolean;
  352. var
  353. ld : tdef;
  354. optoken : ttoken;
  355. operpd : tprocdef;
  356. ppn : tcallparanode;
  357. candidates : tcallcandidates;
  358. cand_cnt : integer;
  359. begin
  360. result:=false;
  361. operpd:=nil;
  362. { load easier access variables }
  363. ld:=tunarynode(t).left.resulttype.def;
  364. if not isunaryoperatoroverloadable(t.nodetype,ld) then
  365. exit;
  366. { operator overload is possible }
  367. result:=true;
  368. case t.nodetype of
  369. notn:
  370. optoken:=_OP_NOT;
  371. unaryminusn:
  372. optoken:=_MINUS;
  373. else
  374. begin
  375. CGMessage(parser_e_operator_not_overloaded);
  376. t:=cnothingnode.create;
  377. exit;
  378. end;
  379. end;
  380. { generate parameter nodes }
  381. ppn:=ccallparanode.create(tunarynode(t).left.getcopy,nil);
  382. ppn.get_paratype;
  383. candidates:=tcallcandidates.create_operator(optoken,ppn);
  384. { stop when there are no operators found }
  385. if candidates.count=0 then
  386. begin
  387. CGMessage(parser_e_operator_not_overloaded);
  388. candidates.free;
  389. ppn.free;
  390. t:=cnothingnode.create;
  391. exit;
  392. end;
  393. { Retrieve information about the candidates }
  394. candidates.get_information;
  395. {$ifdef EXTDEBUG}
  396. { Display info when multiple candidates are found }
  397. candidates.dump_info(V_Debug);
  398. {$endif EXTDEBUG}
  399. cand_cnt:=candidates.choose_best(operpd);
  400. { exit when no overloads are found }
  401. if cand_cnt=0 then
  402. begin
  403. CGMessage(parser_e_operator_not_overloaded);
  404. candidates.free;
  405. ppn.free;
  406. t:=cnothingnode.create;
  407. exit;
  408. end;
  409. { Multiple candidates left? }
  410. if cand_cnt>1 then
  411. begin
  412. CGMessage(type_e_cant_choose_overload_function);
  413. {$ifdef EXTDEBUG}
  414. candidates.dump_info(V_Hint);
  415. {$else EXTDEBUG}
  416. candidates.list(false);
  417. {$endif EXTDEBUG}
  418. { we'll just use the first candidate to make the
  419. call }
  420. end;
  421. candidates.free;
  422. inc(operpd.procsym.refs);
  423. { the nil as symtable signs firstcalln that this is
  424. an overloaded operator }
  425. t:=ccallnode.create(ppn,Tprocsym(operpd.procsym),nil,nil,[]);
  426. { we already know the procdef to use, so it can
  427. skip the overload choosing in callnode.det_resulttype }
  428. tcallnode(t).procdefinition:=operpd;
  429. end;
  430. function isbinaryoverloaded(var t : tnode) : boolean;
  431. var
  432. rd,ld : tdef;
  433. optoken : ttoken;
  434. operpd : tprocdef;
  435. ht : tnode;
  436. ppn : tcallparanode;
  437. candidates : tcallcandidates;
  438. cand_cnt : integer;
  439. begin
  440. isbinaryoverloaded:=false;
  441. operpd:=nil;
  442. { load easier access variables }
  443. ld:=tbinarynode(t).left.resulttype.def;
  444. rd:=tbinarynode(t).right.resulttype.def;
  445. if not isbinaryoperatoroverloadable(t.nodetype,ld,tbinarynode(t).left.nodetype,rd,tbinarynode(t).right.nodetype) then
  446. exit;
  447. { operator overload is possible }
  448. result:=true;
  449. case t.nodetype of
  450. equaln,
  451. unequaln :
  452. optoken:=_EQUAL;
  453. addn:
  454. optoken:=_PLUS;
  455. subn:
  456. optoken:=_MINUS;
  457. muln:
  458. optoken:=_STAR;
  459. starstarn:
  460. optoken:=_STARSTAR;
  461. slashn:
  462. optoken:=_SLASH;
  463. ltn:
  464. optoken:=_LT;
  465. gtn:
  466. optoken:=_GT;
  467. lten:
  468. optoken:=_LTE;
  469. gten:
  470. optoken:=_GTE;
  471. symdifn :
  472. optoken:=_SYMDIF;
  473. modn :
  474. optoken:=_OP_MOD;
  475. orn :
  476. optoken:=_OP_OR;
  477. xorn :
  478. optoken:=_OP_XOR;
  479. andn :
  480. optoken:=_OP_AND;
  481. divn :
  482. optoken:=_OP_DIV;
  483. shln :
  484. optoken:=_OP_SHL;
  485. shrn :
  486. optoken:=_OP_SHR;
  487. else
  488. begin
  489. CGMessage(parser_e_operator_not_overloaded);
  490. t:=cnothingnode.create;
  491. exit;
  492. end;
  493. end;
  494. { generate parameter nodes }
  495. ppn:=ccallparanode.create(tbinarynode(t).right.getcopy,ccallparanode.create(tbinarynode(t).left.getcopy,nil));
  496. ppn.get_paratype;
  497. candidates:=tcallcandidates.create_operator(optoken,ppn);
  498. { for commutative operators we can swap arguments and try again }
  499. if (candidates.count=0) and
  500. not(optoken in [_OP_SHL,_OP_SHR,_OP_DIV,_OP_MOD,_STARSTAR,_SLASH,_MINUS]) then
  501. begin
  502. candidates.free;
  503. reverseparameters(ppn);
  504. { reverse compare operators }
  505. case optoken of
  506. _LT:
  507. optoken:=_GTE;
  508. _GT:
  509. optoken:=_LTE;
  510. _LTE:
  511. optoken:=_GT;
  512. _GTE:
  513. optoken:=_LT;
  514. end;
  515. candidates:=tcallcandidates.create_operator(optoken,ppn);
  516. end;
  517. { stop when there are no operators found }
  518. if candidates.count=0 then
  519. begin
  520. CGMessage(parser_e_operator_not_overloaded);
  521. candidates.free;
  522. ppn.free;
  523. t:=cnothingnode.create;
  524. exit;
  525. end;
  526. { Retrieve information about the candidates }
  527. candidates.get_information;
  528. {$ifdef EXTDEBUG}
  529. { Display info when multiple candidates are found }
  530. candidates.dump_info(V_Debug);
  531. {$endif EXTDEBUG}
  532. cand_cnt:=candidates.choose_best(operpd);
  533. { exit when no overloads are found }
  534. if cand_cnt=0 then
  535. begin
  536. CGMessage(parser_e_operator_not_overloaded);
  537. candidates.free;
  538. ppn.free;
  539. t:=cnothingnode.create;
  540. exit;
  541. end;
  542. { Multiple candidates left? }
  543. if cand_cnt>1 then
  544. begin
  545. CGMessage(type_e_cant_choose_overload_function);
  546. {$ifdef EXTDEBUG}
  547. candidates.dump_info(V_Hint);
  548. {$else EXTDEBUG}
  549. candidates.list(false);
  550. {$endif EXTDEBUG}
  551. { we'll just use the first candidate to make the
  552. call }
  553. end;
  554. candidates.free;
  555. inc(operpd.procsym.refs);
  556. { the nil as symtable signs firstcalln that this is
  557. an overloaded operator }
  558. ht:=ccallnode.create(ppn,Tprocsym(operpd.procsym),nil,nil,[]);
  559. { we already know the procdef to use, so it can
  560. skip the overload choosing in callnode.det_resulttype }
  561. tcallnode(ht).procdefinition:=operpd;
  562. if t.nodetype=unequaln then
  563. ht:=cnotnode.create(ht);
  564. t:=ht;
  565. end;
  566. {****************************************************************************
  567. Register Calculation
  568. ****************************************************************************}
  569. { marks an lvalue as "unregable" }
  570. procedure make_not_regable(p : tnode);
  571. begin
  572. case p.nodetype of
  573. typeconvn :
  574. make_not_regable(ttypeconvnode(p).left);
  575. loadn :
  576. if tloadnode(p).symtableentry.typ in [globalvarsym,localvarsym,paravarsym] then
  577. tabstractvarsym(tloadnode(p).symtableentry).varregable:=vr_none;
  578. end;
  579. end;
  580. { calculates the needed registers for a binary operator }
  581. procedure calcregisters(p : tbinarynode;r32,fpu,mmx : word);
  582. begin
  583. p.left_right_max;
  584. { Only when the difference between the left and right registers < the
  585. wanted registers allocate the amount of registers }
  586. if assigned(p.left) then
  587. begin
  588. if assigned(p.right) then
  589. begin
  590. { the location must be already filled in because we need it to }
  591. { calculate the necessary number of registers (JM) }
  592. if p.expectloc = LOC_INVALID then
  593. internalerror(200110101);
  594. if (abs(p.left.registersint-p.right.registersint)<r32) or
  595. ((p.expectloc = LOC_FPUREGISTER) and
  596. (p.right.registersfpu <= p.left.registersfpu) and
  597. ((p.right.registersfpu <> 0) or (p.left.registersfpu <> 0)) and
  598. (p.left.registersint < p.right.registersint)) then
  599. inc(p.registersint,r32);
  600. if (abs(p.left.registersfpu-p.right.registersfpu)<fpu) then
  601. inc(p.registersfpu,fpu);
  602. {$ifdef SUPPORT_MMX}
  603. if (abs(p.left.registersmmx-p.right.registersmmx)<mmx) then
  604. inc(p.registersmmx,mmx);
  605. {$endif SUPPORT_MMX}
  606. { the following is a little bit guessing but I think }
  607. { it's the only way to solve same internalerrors: }
  608. { if the left and right node both uses registers }
  609. { and return a mem location, but the current node }
  610. { doesn't use an integer register we get probably }
  611. { trouble when restoring a node }
  612. if (p.left.registersint=p.right.registersint) and
  613. (p.registersint=p.left.registersint) and
  614. (p.registersint>0) and
  615. (p.left.expectloc in [LOC_REFERENCE,LOC_CREFERENCE]) and
  616. (p.right.expectloc in [LOC_REFERENCE,LOC_CREFERENCE]) then
  617. inc(p.registersint);
  618. end
  619. else
  620. begin
  621. if (p.left.registersint<r32) then
  622. inc(p.registersint,r32);
  623. if (p.left.registersfpu<fpu) then
  624. inc(p.registersfpu,fpu);
  625. {$ifdef SUPPORT_MMX}
  626. if (p.left.registersmmx<mmx) then
  627. inc(p.registersmmx,mmx);
  628. {$endif SUPPORT_MMX}
  629. end;
  630. end;
  631. end;
  632. {****************************************************************************
  633. Subroutine Handling
  634. ****************************************************************************}
  635. function is_procvar_load(p:tnode):boolean;
  636. begin
  637. result:=false;
  638. { remove voidpointer typecast for tp procvars }
  639. if ((m_tp_procvar in aktmodeswitches) or
  640. (m_mac_procvar in aktmodeswitches)) and
  641. (p.nodetype=typeconvn) and
  642. is_voidpointer(p.resulttype.def) then
  643. p:=tunarynode(p).left;
  644. result:=(p.nodetype=typeconvn) and
  645. (ttypeconvnode(p).convtype=tc_proc_2_procvar);
  646. end;
  647. { local routines can't be assigned to procvars }
  648. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  649. begin
  650. if (from_def.parast.symtablelevel>normal_function_level) and
  651. (to_def.deftype=procvardef) then
  652. CGMessage(type_e_cannot_local_proc_to_procvar);
  653. end;
  654. procedure set_varstate(p:tnode;newstate:tvarstate;varstateflags:tvarstateflags);
  655. var
  656. hsym : tabstractvarsym;
  657. begin
  658. while assigned(p) do
  659. begin
  660. case p.nodetype of
  661. typeconvn :
  662. begin
  663. case ttypeconvnode(p).convtype of
  664. tc_cchar_2_pchar,
  665. tc_cstring_2_pchar,
  666. tc_array_2_pointer :
  667. exclude(varstateflags,vsf_must_be_valid);
  668. tc_pchar_2_string,
  669. tc_pointer_2_array :
  670. include(varstateflags,vsf_must_be_valid);
  671. end;
  672. p:=tunarynode(p).left;
  673. end;
  674. subscriptn :
  675. p:=tunarynode(p).left;
  676. vecn:
  677. begin
  678. set_varstate(tbinarynode(p).right,vs_used,[vsf_must_be_valid]);
  679. if not(tunarynode(p).left.resulttype.def.deftype in [stringdef,arraydef]) then
  680. include(varstateflags,vsf_must_be_valid);
  681. p:=tunarynode(p).left;
  682. end;
  683. { do not parse calln }
  684. calln :
  685. break;
  686. loadn :
  687. begin
  688. if (tloadnode(p).symtableentry.typ in [localvarsym,paravarsym,globalvarsym]) then
  689. begin
  690. hsym:=tabstractvarsym(tloadnode(p).symtableentry);
  691. if (vsf_must_be_valid in varstateflags) and (hsym.varstate=vs_declared) then
  692. begin
  693. { Give warning/note for uninitialized locals }
  694. if assigned(hsym.owner) and
  695. not(vo_is_external in hsym.varoptions) and
  696. (hsym.owner.symtabletype in [localsymtable,staticsymtable]) and
  697. (hsym.owner=current_procinfo.procdef.localst) then
  698. begin
  699. if (vo_is_funcret in hsym.varoptions) then
  700. CGMessage(sym_w_function_result_not_set)
  701. else
  702. begin
  703. if tloadnode(p).symtable.symtabletype=localsymtable then
  704. begin
  705. if (vsf_use_hints in varstateflags) then
  706. CGMessage1(sym_h_uninitialized_local_variable,hsym.realname)
  707. else
  708. CGMessage1(sym_w_uninitialized_local_variable,hsym.realname);
  709. end
  710. else
  711. begin
  712. if (vsf_use_hints in varstateflags) then
  713. CGMessage1(sym_h_uninitialized_variable,hsym.realname)
  714. else
  715. CGMessage1(sym_w_uninitialized_variable,hsym.realname);
  716. end;
  717. end;
  718. end;
  719. end;
  720. { don't override vs_used with vs_assigned }
  721. if hsym.varstate<>vs_used then
  722. hsym.varstate:=newstate;
  723. end;
  724. break;
  725. end;
  726. callparan :
  727. internalerror(200310081);
  728. else
  729. break;
  730. end;{case }
  731. end;
  732. end;
  733. procedure set_unique(p : tnode);
  734. begin
  735. while assigned(p) do
  736. begin
  737. case p.nodetype of
  738. vecn:
  739. begin
  740. include(p.flags,nf_callunique);
  741. break;
  742. end;
  743. typeconvn,
  744. subscriptn,
  745. derefn:
  746. p:=tunarynode(p).left;
  747. else
  748. break;
  749. end;
  750. end;
  751. end;
  752. function valid_for_assign(p:tnode;opts:TValidAssigns):boolean;
  753. var
  754. hp : tnode;
  755. gotstring,
  756. gotwith,
  757. gotsubscript,
  758. gotrecord,
  759. gotpointer,
  760. gotvec,
  761. gotclass,
  762. gotdynarray,
  763. gotderef : boolean;
  764. fromdef,
  765. todef : tdef;
  766. errmsg : longint;
  767. begin
  768. if valid_const in opts then
  769. errmsg:=type_e_variable_id_expected
  770. else
  771. errmsg:=type_e_argument_cant_be_assigned;
  772. result:=false;
  773. gotsubscript:=false;
  774. gotvec:=false;
  775. gotderef:=false;
  776. gotrecord:=false;
  777. gotclass:=false;
  778. gotpointer:=false;
  779. gotwith:=false;
  780. gotdynarray:=false;
  781. gotstring:=false;
  782. hp:=p;
  783. if not(valid_void in opts) and
  784. is_void(hp.resulttype.def) then
  785. begin
  786. CGMessagePos(hp.fileinfo,errmsg);
  787. exit;
  788. end;
  789. while assigned(hp) do
  790. begin
  791. { property allowed? calln has a property check itself }
  792. if (nf_isproperty in hp.flags) then
  793. begin
  794. if (hp.nodetype=calln) then
  795. begin
  796. { check return type }
  797. case hp.resulttype.def.deftype of
  798. pointerdef :
  799. gotpointer:=true;
  800. objectdef :
  801. gotclass:=is_class_or_interface(hp.resulttype.def);
  802. recorddef :
  803. gotrecord:=true;
  804. classrefdef :
  805. gotclass:=true;
  806. stringdef :
  807. gotstring:=true;
  808. end;
  809. if (valid_property in opts) then
  810. begin
  811. { don't allow writing to calls that will create
  812. temps like calls that return a structure and we
  813. are assigning to a member }
  814. if (valid_const in opts) or
  815. not(
  816. (gotsubscript and gotrecord) or
  817. (gotstring and gotvec)
  818. ) then
  819. result:=true
  820. else
  821. CGMessagePos(hp.fileinfo,errmsg);
  822. end
  823. else
  824. begin
  825. { 1. if it returns a pointer and we've found a deref,
  826. 2. if it returns a class or record and a subscription or with is found
  827. 3. if the address is needed of a field (subscriptn) }
  828. if (gotpointer and gotderef) or
  829. (gotstring and gotvec) or
  830. (
  831. (gotclass or gotrecord) and
  832. (gotsubscript or gotwith)
  833. ) or
  834. (
  835. (gotvec and gotdynarray)
  836. ) or
  837. (
  838. (Valid_Addr in opts) and
  839. (hp.nodetype=subscriptn)
  840. ) then
  841. result:=true
  842. else
  843. CGMessagePos(hp.fileinfo,errmsg);
  844. end;
  845. end
  846. else
  847. result:=true;
  848. exit;
  849. end;
  850. if (Valid_Const in opts) and is_constnode(hp) then
  851. begin
  852. result:=true;
  853. exit;
  854. end;
  855. case hp.nodetype of
  856. temprefn :
  857. begin
  858. valid_for_assign := true;
  859. exit;
  860. end;
  861. derefn :
  862. begin
  863. gotderef:=true;
  864. hp:=tderefnode(hp).left;
  865. end;
  866. typeconvn :
  867. begin
  868. { typecast sizes must match, exceptions:
  869. - implicit typecast made by absolute
  870. - from formaldef
  871. - from void
  872. - from/to open array
  873. - typecast from pointer to array }
  874. fromdef:=ttypeconvnode(hp).left.resulttype.def;
  875. todef:=hp.resulttype.def;
  876. if not((nf_absolute in ttypeconvnode(hp).flags) or
  877. (fromdef.deftype=formaldef) or
  878. is_void(fromdef) or
  879. is_open_array(fromdef) or
  880. is_open_array(todef) or
  881. ((fromdef.deftype=pointerdef) and (todef.deftype=arraydef)) or
  882. ((fromdef.deftype = objectdef) and (todef.deftype = objectdef) and
  883. (tobjectdef(fromdef).is_related(tobjectdef(todef))))) and
  884. (fromdef.size<>todef.size) then
  885. begin
  886. { in TP it is allowed to typecast to smaller types. But the variable can't
  887. be in a register }
  888. if (m_tp7 in aktmodeswitches) or
  889. (todef.size<fromdef.size) then
  890. make_not_regable(hp)
  891. else
  892. CGMessagePos2(hp.fileinfo,type_e_typecast_wrong_size_for_assignment,tostr(fromdef.size),tostr(todef.size));
  893. end;
  894. { don't allow assignments to typeconvs that need special code }
  895. if not(gotsubscript or gotvec or gotderef) and
  896. not(ttypeconvnode(hp).assign_allowed) then
  897. begin
  898. CGMessagePos(hp.fileinfo,errmsg);
  899. exit;
  900. end;
  901. case hp.resulttype.def.deftype of
  902. pointerdef :
  903. gotpointer:=true;
  904. objectdef :
  905. gotclass:=is_class_or_interface(hp.resulttype.def);
  906. classrefdef :
  907. gotclass:=true;
  908. arraydef :
  909. begin
  910. { pointer -> array conversion is done then we need to see it
  911. as a deref, because a ^ is then not required anymore }
  912. if (ttypeconvnode(hp).left.resulttype.def.deftype=pointerdef) then
  913. gotderef:=true;
  914. end;
  915. end;
  916. hp:=ttypeconvnode(hp).left;
  917. end;
  918. vecn :
  919. begin
  920. gotvec:=true;
  921. { accesses to dyn. arrays override read only access in delphi }
  922. if (m_delphi in aktmodeswitches) and is_dynamic_array(tunarynode(hp).left.resulttype.def) then
  923. gotdynarray:=true;
  924. hp:=tunarynode(hp).left;
  925. end;
  926. asn :
  927. begin
  928. { asn can't be assigned directly, it returns the value in a register instead
  929. of reference. }
  930. if not(gotsubscript or gotderef or gotvec) then
  931. begin
  932. CGMessagePos(hp.fileinfo,errmsg);
  933. exit;
  934. end;
  935. hp:=tunarynode(hp).left;
  936. end;
  937. subscriptn :
  938. begin
  939. gotsubscript:=true;
  940. { loop counter? }
  941. if not(Valid_Const in opts) and
  942. (vo_is_loop_counter in tsubscriptnode(hp).vs.varoptions) then
  943. CGMessage1(parser_e_illegal_assignment_to_count_var,tsubscriptnode(hp).vs.realname);
  944. { a class/interface access is an implicit }
  945. { dereferencing }
  946. hp:=tsubscriptnode(hp).left;
  947. if is_class_or_interface(hp.resulttype.def) then
  948. gotderef:=true;
  949. end;
  950. muln,
  951. divn,
  952. andn,
  953. xorn,
  954. orn,
  955. notn,
  956. subn,
  957. addn :
  958. begin
  959. { Allow operators on a pointer, or an integer
  960. and a pointer typecast and deref has been found }
  961. if ((hp.resulttype.def.deftype=pointerdef) or
  962. (is_integer(hp.resulttype.def) and gotpointer)) and
  963. gotderef then
  964. result:=true
  965. else
  966. { Temp strings are stored in memory, for compatibility with
  967. delphi only }
  968. if (m_delphi in aktmodeswitches) and
  969. ((valid_addr in opts) or
  970. (valid_const in opts)) and
  971. (hp.resulttype.def.deftype=stringdef) then
  972. result:=true
  973. else
  974. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  975. exit;
  976. end;
  977. niln,
  978. pointerconstn :
  979. begin
  980. { to support e.g. @tmypointer(0)^.data; see tests/tbs/tb0481 }
  981. if gotderef then
  982. result:=true
  983. else
  984. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  985. exit;
  986. end;
  987. addrn :
  988. begin
  989. if gotderef then
  990. result:=true
  991. else
  992. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  993. exit;
  994. end;
  995. calln :
  996. begin
  997. { check return type }
  998. case hp.resulttype.def.deftype of
  999. arraydef :
  1000. begin
  1001. { dynamic arrays are allowed when there is also a
  1002. vec node }
  1003. if is_dynamic_array(hp.resulttype.def) and
  1004. gotvec then
  1005. begin
  1006. gotderef:=true;
  1007. gotpointer:=true;
  1008. end;
  1009. end;
  1010. pointerdef :
  1011. gotpointer:=true;
  1012. objectdef :
  1013. gotclass:=is_class_or_interface(hp.resulttype.def);
  1014. recorddef, { handle record like class it needs a subscription }
  1015. classrefdef :
  1016. gotclass:=true;
  1017. stringdef :
  1018. gotstring:=true;
  1019. end;
  1020. { 1. if it returns a pointer and we've found a deref,
  1021. 2. if it returns a class or record and a subscription or with is found
  1022. 3. string is returned }
  1023. if (gotstring and gotvec) or
  1024. (gotpointer and gotderef) or
  1025. (gotclass and (gotsubscript or gotwith)) then
  1026. result:=true
  1027. else
  1028. { Temp strings are stored in memory, for compatibility with
  1029. delphi only }
  1030. if (m_delphi in aktmodeswitches) and
  1031. (valid_addr in opts) and
  1032. (hp.resulttype.def.deftype=stringdef) then
  1033. result:=true
  1034. else
  1035. if ([valid_const,valid_addr] * opts = [valid_const]) then
  1036. result:=true
  1037. else
  1038. CGMessagePos(hp.fileinfo,errmsg);
  1039. exit;
  1040. end;
  1041. inlinen :
  1042. begin
  1043. if (valid_const in opts) and
  1044. (tinlinenode(hp).inlinenumber in [in_typeof_x]) then
  1045. result:=true
  1046. else
  1047. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1048. exit;
  1049. end;
  1050. loadn :
  1051. begin
  1052. case tloadnode(hp).symtableentry.typ of
  1053. absolutevarsym,
  1054. globalvarsym,
  1055. localvarsym,
  1056. paravarsym :
  1057. begin
  1058. { loop counter? }
  1059. if not(Valid_Const in opts) and
  1060. not gotderef and
  1061. (vo_is_loop_counter in tabstractvarsym(tloadnode(hp).symtableentry).varoptions) then
  1062. CGMessage1(parser_e_illegal_assignment_to_count_var,tloadnode(hp).symtableentry.realname);
  1063. { derefed pointer }
  1064. if (tabstractvarsym(tloadnode(hp).symtableentry).varspez=vs_const) then
  1065. begin
  1066. { allow p^:= constructions with p is const parameter }
  1067. if gotderef or gotdynarray or (Valid_Const in opts) then
  1068. result:=true
  1069. else
  1070. CGMessagePos(tloadnode(hp).fileinfo,type_e_no_assign_to_const);
  1071. exit;
  1072. end;
  1073. { Are we at a with symtable, then we need to process the
  1074. withrefnode also to check for maybe a const load }
  1075. if (tloadnode(hp).symtable.symtabletype=withsymtable) then
  1076. begin
  1077. { continue with processing the withref node }
  1078. hp:=tnode(twithsymtable(tloadnode(hp).symtable).withrefnode);
  1079. gotwith:=true;
  1080. end
  1081. else
  1082. begin
  1083. result:=true;
  1084. exit;
  1085. end;
  1086. end;
  1087. typedconstsym :
  1088. begin
  1089. if ttypedconstsym(tloadnode(hp).symtableentry).is_writable or
  1090. (valid_addr in opts) or
  1091. (valid_const in opts) then
  1092. result:=true
  1093. else
  1094. CGMessagePos(hp.fileinfo,type_e_no_assign_to_const);
  1095. exit;
  1096. end;
  1097. procsym :
  1098. begin
  1099. if (Valid_Const in opts) then
  1100. result:=true
  1101. else
  1102. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1103. exit;
  1104. end;
  1105. labelsym :
  1106. begin
  1107. if (Valid_Addr in opts) then
  1108. result:=true
  1109. else
  1110. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1111. exit;
  1112. end;
  1113. constsym:
  1114. begin
  1115. if (tconstsym(tloadnode(hp).symtableentry).consttyp=constresourcestring) and
  1116. (valid_addr in opts) then
  1117. result:=true
  1118. else
  1119. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1120. exit;
  1121. end;
  1122. else
  1123. begin
  1124. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1125. exit;
  1126. end;
  1127. end;
  1128. end;
  1129. else
  1130. begin
  1131. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1132. exit;
  1133. end;
  1134. end;
  1135. end;
  1136. end;
  1137. function valid_for_var(p:tnode):boolean;
  1138. begin
  1139. valid_for_var:=valid_for_assign(p,[]);
  1140. end;
  1141. function valid_for_formal_var(p : tnode) : boolean;
  1142. begin
  1143. valid_for_formal_var:=valid_for_assign(p,[valid_void]);
  1144. end;
  1145. function valid_for_formal_const(p : tnode) : boolean;
  1146. begin
  1147. valid_for_formal_const:=(p.resulttype.def.deftype=formaldef) or
  1148. valid_for_assign(p,[valid_void,valid_const]);
  1149. end;
  1150. function valid_for_assignment(p:tnode):boolean;
  1151. begin
  1152. valid_for_assignment:=valid_for_assign(p,[valid_property]);
  1153. end;
  1154. function valid_for_addr(p : tnode) : boolean;
  1155. begin
  1156. result:=valid_for_assign(p,[valid_const,valid_addr,valid_void]);
  1157. end;
  1158. procedure var_para_allowed(var eq:tequaltype;def_from,def_to:Tdef);
  1159. begin
  1160. { Note: eq must be already valid, it will only be updated! }
  1161. case def_to.deftype of
  1162. formaldef :
  1163. begin
  1164. { all types can be passed to a formaldef }
  1165. eq:=te_equal;
  1166. end;
  1167. orddef :
  1168. begin
  1169. { allows conversion from word to integer and
  1170. byte to shortint, but only for TP7 compatibility }
  1171. if (m_tp7 in aktmodeswitches) and
  1172. (def_from.deftype=orddef) and
  1173. (def_from.size=def_to.size) then
  1174. eq:=te_convert_l1;
  1175. end;
  1176. arraydef :
  1177. begin
  1178. if is_open_array(def_to) and
  1179. is_dynamic_array(def_from) and
  1180. equal_defs(tarraydef(def_from).elementtype.def,tarraydef(def_to).elementtype.def) then
  1181. eq:=te_convert_l2;
  1182. end;
  1183. pointerdef :
  1184. begin
  1185. { an implicit pointer conversion is allowed }
  1186. if (def_from.deftype=pointerdef) then
  1187. eq:=te_convert_l1;
  1188. end;
  1189. stringdef :
  1190. begin
  1191. { all shortstrings are allowed, size is not important }
  1192. if is_shortstring(def_from) and
  1193. is_shortstring(def_to) then
  1194. eq:=te_equal;
  1195. end;
  1196. objectdef :
  1197. begin
  1198. { child objects can be also passed }
  1199. { in non-delphi mode, otherwise }
  1200. { they must match exactly, except }
  1201. { if they are objects }
  1202. if (def_from.deftype=objectdef) and
  1203. (
  1204. not(m_delphi in aktmodeswitches) or
  1205. (
  1206. (tobjectdef(def_from).objecttype=odt_object) and
  1207. (tobjectdef(def_to).objecttype=odt_object)
  1208. )
  1209. ) and
  1210. (tobjectdef(def_from).is_related(tobjectdef(def_to))) then
  1211. eq:=te_convert_l1;
  1212. end;
  1213. filedef :
  1214. begin
  1215. { an implicit file conversion is also allowed }
  1216. { from a typed file to an untyped one }
  1217. if (def_from.deftype=filedef) and
  1218. (tfiledef(def_from).filetyp = ft_typed) and
  1219. (tfiledef(def_to).filetyp = ft_untyped) then
  1220. eq:=te_convert_l1;
  1221. end;
  1222. end;
  1223. end;
  1224. procedure para_allowed(var eq:tequaltype;p:tcallparanode;def_to:tdef);
  1225. begin
  1226. { Note: eq must be already valid, it will only be updated! }
  1227. case def_to.deftype of
  1228. formaldef :
  1229. begin
  1230. { all types can be passed to a formaldef }
  1231. eq:=te_equal;
  1232. end;
  1233. stringdef :
  1234. begin
  1235. { to support ansi/long/wide strings in a proper way }
  1236. { string and string[10] are assumed as equal }
  1237. { when searching the correct overloaded procedure }
  1238. if (p.resulttype.def.deftype=stringdef) and
  1239. (tstringdef(def_to).string_typ=tstringdef(p.resulttype.def).string_typ) then
  1240. eq:=te_equal
  1241. else
  1242. { Passing a constant char to ansistring or shortstring or
  1243. a widechar to widestring then handle it as equal. }
  1244. if (p.left.nodetype=ordconstn) and
  1245. (
  1246. is_char(p.resulttype.def) and
  1247. (is_shortstring(def_to) or is_ansistring(def_to))
  1248. ) or
  1249. (
  1250. is_widechar(p.resulttype.def) and
  1251. is_widestring(def_to)
  1252. ) then
  1253. eq:=te_equal
  1254. end;
  1255. setdef :
  1256. begin
  1257. { set can also be a not yet converted array constructor }
  1258. if (p.resulttype.def.deftype=arraydef) and
  1259. (tarraydef(p.resulttype.def).IsConstructor) and
  1260. not(tarraydef(p.resulttype.def).IsVariant) then
  1261. eq:=te_equal;
  1262. end;
  1263. procvardef :
  1264. begin
  1265. { in tp7 mode proc -> procvar is allowed }
  1266. if ((m_tp_procvar in aktmodeswitches) or
  1267. (m_mac_procvar in aktmodeswitches)) and
  1268. (p.left.nodetype=calln) and
  1269. (proc_to_procvar_equal(tprocdef(tcallnode(p.left).procdefinition),tprocvardef(def_to),true)>=te_equal) then
  1270. eq:=te_equal
  1271. else
  1272. if (m_mac_procvar in aktmodeswitches) and
  1273. is_procvar_load(p.left) then
  1274. eq:=te_convert_l2;
  1275. end;
  1276. end;
  1277. end;
  1278. {****************************************************************************
  1279. TCallCandidates
  1280. ****************************************************************************}
  1281. constructor tcallcandidates.create(sym:tprocsym;st:tsymtable;ppn:tnode;isprop,ignorevis : boolean);
  1282. var
  1283. j : integer;
  1284. pd : tprocdef;
  1285. hp : pcandidate;
  1286. found,
  1287. has_overload_directive : boolean;
  1288. topclassh : tobjectdef;
  1289. srsymtable : tsymtable;
  1290. srprocsym : tprocsym;
  1291. pt : tcallparanode;
  1292. begin
  1293. if not assigned(sym) then
  1294. internalerror(200411015);
  1295. FProcSym:=sym;
  1296. FProcs:=nil;
  1297. FProccnt:=0;
  1298. FProcvisiblecnt:=0;
  1299. FParanode:=ppn;
  1300. FAllowVariant:=true;
  1301. { determine length of parameter list }
  1302. pt:=tcallparanode(ppn);
  1303. FParalength:=0;
  1304. while assigned(pt) do
  1305. begin
  1306. inc(FParalength);
  1307. pt:=tcallparanode(pt.right);
  1308. end;
  1309. { when the definition has overload directive set, we search for
  1310. overloaded definitions in the class, this only needs to be done once
  1311. for class entries as the tree keeps always the same }
  1312. if (not sym.overloadchecked) and
  1313. (sym.owner.symtabletype=objectsymtable) and
  1314. (po_overload in sym.first_procdef.procoptions) then
  1315. search_class_overloads(sym);
  1316. { when the class passed is defined in this unit we
  1317. need to use the scope of that class. This is a trick
  1318. that can be used to access protected members in other
  1319. units. At least kylix supports it this way (PFV) }
  1320. if assigned(st) and
  1321. (
  1322. (st.symtabletype=objectsymtable) or
  1323. ((st.symtabletype=withsymtable) and
  1324. (st.defowner.deftype=objectdef))
  1325. ) and
  1326. (st.defowner.owner.symtabletype in [globalsymtable,staticsymtable]) and
  1327. st.defowner.owner.iscurrentunit then
  1328. topclassh:=tobjectdef(st.defowner)
  1329. else
  1330. begin
  1331. if assigned(current_procinfo) then
  1332. topclassh:=current_procinfo.procdef._class
  1333. else
  1334. topclassh:=nil;
  1335. end;
  1336. { link all procedures which have the same # of parameters }
  1337. for j:=1 to sym.procdef_count do
  1338. begin
  1339. pd:=sym.procdef[j];
  1340. { Is the procdef visible? This needs to be checked on
  1341. procdef level since a symbol can contain both private and
  1342. public declarations. But the check should not be done
  1343. when the callnode is generated by a property
  1344. inherited overrides invisible anonymous inherited (FK) }
  1345. if isprop or ignorevis or
  1346. (pd.owner.symtabletype<>objectsymtable) or
  1347. pd.is_visible_for_object(topclassh) then
  1348. begin
  1349. { we have at least one procedure that is visible }
  1350. inc(FProcvisiblecnt);
  1351. { only when the # of parameter are supported by the
  1352. procedure }
  1353. if (FParalength>=pd.minparacount) and
  1354. ((po_varargs in pd.procoptions) or { varargs }
  1355. (FParalength<=pd.maxparacount)) then
  1356. proc_add(pd);
  1357. end;
  1358. end;
  1359. { remember if the procedure is declared with the overload directive,
  1360. it's information is still needed also after all procs are removed }
  1361. has_overload_directive:=(po_overload in sym.first_procdef.procoptions);
  1362. { when the definition has overload directive set, we search for
  1363. overloaded definitions in the symtablestack. The found
  1364. entries are only added to the procs list and not the procsym, because
  1365. the list can change in every situation }
  1366. if has_overload_directive and
  1367. (sym.owner.symtabletype<>objectsymtable) then
  1368. begin
  1369. srsymtable:=sym.owner.next;
  1370. while assigned(srsymtable) do
  1371. begin
  1372. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1373. begin
  1374. srprocsym:=tprocsym(srsymtable.speedsearch(sym.name,sym.speedvalue));
  1375. if assigned(srprocsym) and
  1376. (srprocsym.typ=procsym) then
  1377. begin
  1378. { if this visible procedure doesn't have overload we can stop
  1379. searching }
  1380. if not(po_overload in srprocsym.first_procdef.procoptions) and
  1381. srprocsym.first_procdef.is_visible_for_object(topclassh) then
  1382. break;
  1383. { process all overloaded definitions }
  1384. for j:=1 to srprocsym.procdef_count do
  1385. begin
  1386. pd:=srprocsym.procdef[j];
  1387. { only visible procedures need to be added }
  1388. if pd.is_visible_for_object(topclassh) then
  1389. begin
  1390. { only when the # of parameter are supported by the
  1391. procedure }
  1392. if (FParalength>=pd.minparacount) and
  1393. ((po_varargs in pd.procoptions) or { varargs }
  1394. (FParalength<=pd.maxparacount)) then
  1395. begin
  1396. found:=false;
  1397. hp:=FProcs;
  1398. while assigned(hp) do
  1399. begin
  1400. { Only compare visible parameters for the user }
  1401. if compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1402. begin
  1403. found:=true;
  1404. break;
  1405. end;
  1406. hp:=hp^.next;
  1407. end;
  1408. if not found then
  1409. proc_add(pd);
  1410. end;
  1411. end;
  1412. end;
  1413. end;
  1414. end;
  1415. srsymtable:=srsymtable.next;
  1416. end;
  1417. end;
  1418. end;
  1419. constructor tcallcandidates.create_operator(op:ttoken;ppn:tnode);
  1420. var
  1421. j : integer;
  1422. pd : tprocdef;
  1423. hp : pcandidate;
  1424. found : boolean;
  1425. srsymtable : tsymtable;
  1426. srprocsym : tprocsym;
  1427. pt : tcallparanode;
  1428. sv : cardinal;
  1429. begin
  1430. FProcSym:=nil;
  1431. FProcs:=nil;
  1432. FProccnt:=0;
  1433. FProcvisiblecnt:=0;
  1434. FParanode:=ppn;
  1435. FAllowVariant:=false;
  1436. { determine length of parameter list }
  1437. pt:=tcallparanode(ppn);
  1438. FParalength:=0;
  1439. while assigned(pt) do
  1440. begin
  1441. if pt.resulttype.def.deftype=variantdef then
  1442. FAllowVariant:=true;
  1443. inc(FParalength);
  1444. pt:=tcallparanode(pt.right);
  1445. end;
  1446. { we search all overloaded operator definitions in the symtablestack. The found
  1447. entries are only added to the procs list and not the procsym, because
  1448. the list can change in every situation }
  1449. sv:=getspeedvalue(overloaded_names[op]);
  1450. srsymtable:=symtablestack;
  1451. while assigned(srsymtable) do
  1452. begin
  1453. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1454. begin
  1455. srprocsym:=tprocsym(srsymtable.speedsearch(overloaded_names[op],sv));
  1456. if assigned(srprocsym) and
  1457. (srprocsym.typ=procsym) then
  1458. begin
  1459. { Store first procsym found }
  1460. if not assigned(FProcsym) then
  1461. FProcsym:=srprocsym;
  1462. { process all overloaded definitions }
  1463. for j:=1 to srprocsym.procdef_count do
  1464. begin
  1465. pd:=srprocsym.procdef[j];
  1466. { only when the # of parameter are supported by the
  1467. procedure }
  1468. if (FParalength>=pd.minparacount) and
  1469. (FParalength<=pd.maxparacount) then
  1470. begin
  1471. found:=false;
  1472. hp:=FProcs;
  1473. while assigned(hp) do
  1474. begin
  1475. { Only compare visible parameters for the user }
  1476. if compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1477. begin
  1478. found:=true;
  1479. break;
  1480. end;
  1481. hp:=hp^.next;
  1482. end;
  1483. if not found then
  1484. proc_add(pd);
  1485. end;
  1486. end;
  1487. end;
  1488. end;
  1489. srsymtable:=srsymtable.next;
  1490. end;
  1491. end;
  1492. destructor tcallcandidates.destroy;
  1493. var
  1494. hpnext,
  1495. hp : pcandidate;
  1496. begin
  1497. hp:=FProcs;
  1498. while assigned(hp) do
  1499. begin
  1500. hpnext:=hp^.next;
  1501. dispose(hp);
  1502. hp:=hpnext;
  1503. end;
  1504. end;
  1505. function tcallcandidates.proc_add(pd:tprocdef):pcandidate;
  1506. var
  1507. defaultparacnt : integer;
  1508. begin
  1509. { generate new candidate entry }
  1510. new(result);
  1511. fillchar(result^,sizeof(tcandidate),0);
  1512. result^.data:=pd;
  1513. result^.next:=FProcs;
  1514. FProcs:=result;
  1515. inc(FProccnt);
  1516. { Find last parameter, skip all default parameters
  1517. that are not passed. Ignore this skipping for varargs }
  1518. result^.firstparaidx:=pd.paras.count-1;
  1519. if not(po_varargs in pd.procoptions) then
  1520. begin
  1521. { ignore hidden parameters }
  1522. while (result^.firstparaidx>=0) and (vo_is_hidden_para in tparavarsym(pd.paras[result^.firstparaidx]).varoptions) do
  1523. dec(result^.firstparaidx);
  1524. defaultparacnt:=pd.maxparacount-FParalength;
  1525. if defaultparacnt>0 then
  1526. begin
  1527. if defaultparacnt>result^.firstparaidx+1 then
  1528. internalerror(200401141);
  1529. dec(result^.firstparaidx,defaultparacnt);
  1530. end;
  1531. end;
  1532. end;
  1533. procedure tcallcandidates.list(all:boolean);
  1534. var
  1535. hp : pcandidate;
  1536. begin
  1537. hp:=FProcs;
  1538. while assigned(hp) do
  1539. begin
  1540. if all or
  1541. (not hp^.invalid) then
  1542. MessagePos1(hp^.data.fileinfo,sym_h_param_list,hp^.data.fullprocname(false));
  1543. hp:=hp^.next;
  1544. end;
  1545. end;
  1546. {$ifdef EXTDEBUG}
  1547. procedure tcallcandidates.dump_info(lvl:longint);
  1548. function ParaTreeStr(p:tcallparanode):string;
  1549. begin
  1550. result:='';
  1551. while assigned(p) do
  1552. begin
  1553. if result<>'' then
  1554. result:=','+result;
  1555. result:=p.resulttype.def.typename+result;
  1556. p:=tcallparanode(p.right);
  1557. end;
  1558. end;
  1559. var
  1560. hp : pcandidate;
  1561. i : integer;
  1562. currpara : tparavarsym;
  1563. begin
  1564. if not CheckVerbosity(lvl) then
  1565. exit;
  1566. Comment(lvl+V_LineInfo,'Overloaded callnode: '+FProcSym.name+'('+ParaTreeStr(tcallparanode(FParaNode))+')');
  1567. hp:=FProcs;
  1568. while assigned(hp) do
  1569. begin
  1570. Comment(lvl,' '+hp^.data.fullprocname(false));
  1571. if (hp^.invalid) then
  1572. Comment(lvl,' invalid')
  1573. else
  1574. begin
  1575. Comment(lvl,' ex: '+tostr(hp^.exact_count)+
  1576. ' eq: '+tostr(hp^.equal_count)+
  1577. ' l1: '+tostr(hp^.cl1_count)+
  1578. ' l2: '+tostr(hp^.cl2_count)+
  1579. ' l3: '+tostr(hp^.cl3_count)+
  1580. ' oper: '+tostr(hp^.coper_count)+
  1581. ' ord: '+realtostr(hp^.ordinal_distance));
  1582. { Print parameters in left-right order }
  1583. for i:=0 to hp^.data.paras.count-1 do
  1584. begin
  1585. currpara:=tparavarsym(hp^.data.paras[i]);
  1586. if (vo_is_hidden_para in currpara.varoptions) then
  1587. Comment(lvl,' - '+currpara.vartype.def.typename+' : '+EqualTypeName[currpara.eqval]);
  1588. end;
  1589. end;
  1590. hp:=hp^.next;
  1591. end;
  1592. end;
  1593. {$endif EXTDEBUG}
  1594. procedure tcallcandidates.get_information;
  1595. var
  1596. hp : pcandidate;
  1597. currpara : tparavarsym;
  1598. paraidx : integer;
  1599. currparanr : byte;
  1600. rfh,rth : bestreal;
  1601. def_from,
  1602. def_to : tdef;
  1603. currpt,
  1604. pt : tcallparanode;
  1605. eq : tequaltype;
  1606. convtype : tconverttype;
  1607. pdoper : tprocdef;
  1608. releasecurrpt : boolean;
  1609. cdoptions : tcompare_defs_options;
  1610. begin
  1611. cdoptions:=[cdo_check_operator];
  1612. if FAllowVariant then
  1613. include(cdoptions,cdo_allow_variant);
  1614. { process all procs }
  1615. hp:=FProcs;
  1616. while assigned(hp) do
  1617. begin
  1618. { We compare parameters in reverse order (right to left),
  1619. the firstpara is already pointing to the last parameter
  1620. were we need to start comparing }
  1621. currparanr:=FParalength;
  1622. paraidx:=hp^.firstparaidx;
  1623. while (paraidx>=0) and (vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions) do
  1624. dec(paraidx);
  1625. pt:=tcallparanode(FParaNode);
  1626. while assigned(pt) and (paraidx>=0) do
  1627. begin
  1628. currpara:=tparavarsym(hp^.data.paras[paraidx]);
  1629. { currpt can be changed from loadn to calln when a procvar
  1630. is passed. This is to prevent that the change is permanent }
  1631. currpt:=pt;
  1632. releasecurrpt:=false;
  1633. { retrieve current parameter definitions to compares }
  1634. eq:=te_incompatible;
  1635. def_from:=currpt.resulttype.def;
  1636. def_to:=currpara.vartype.def;
  1637. if not(assigned(def_from)) then
  1638. internalerror(200212091);
  1639. if not(
  1640. assigned(def_to) or
  1641. ((po_varargs in hp^.data.procoptions) and
  1642. (currparanr>hp^.data.minparacount))
  1643. ) then
  1644. internalerror(200212092);
  1645. { Convert tp procvars when not expecting a procvar }
  1646. if (def_to.deftype<>procvardef) and
  1647. (currpt.left.resulttype.def.deftype=procvardef) then
  1648. begin
  1649. releasecurrpt:=true;
  1650. currpt:=tcallparanode(pt.getcopy);
  1651. if maybe_call_procvar(currpt.left,true) then
  1652. begin
  1653. currpt.resulttype:=currpt.left.resulttype;
  1654. def_from:=currpt.left.resulttype.def;
  1655. end;
  1656. end;
  1657. { varargs are always equal, but not exact }
  1658. if (po_varargs in hp^.data.procoptions) and
  1659. (currparanr>hp^.data.minparacount) then
  1660. begin
  1661. eq:=te_equal;
  1662. end
  1663. else
  1664. { same definition -> exact }
  1665. if (def_from=def_to) then
  1666. begin
  1667. eq:=te_exact;
  1668. end
  1669. else
  1670. { for value and const parameters check if a integer is constant or
  1671. included in other integer -> equal and calc ordinal_distance }
  1672. if not(currpara.varspez in [vs_var,vs_out]) and
  1673. is_integer(def_from) and
  1674. is_integer(def_to) and
  1675. is_in_limit(def_from,def_to) then
  1676. begin
  1677. eq:=te_equal;
  1678. hp^.ordinal_distance:=hp^.ordinal_distance+
  1679. abs(bestreal(torddef(def_from).low)-bestreal(torddef(def_to).low));
  1680. if (torddef(def_to).typ=u64bit) then
  1681. rth:=bestreal(qword(torddef(def_to).high))
  1682. else
  1683. rth:=bestreal(torddef(def_to).high);
  1684. if (torddef(def_from).typ=u64bit) then
  1685. rfh:=bestreal(qword(torddef(def_from).high))
  1686. else
  1687. rfh:=bestreal(torddef(def_from).high);
  1688. hp^.ordinal_distance:=hp^.ordinal_distance+abs(rth-rfh);
  1689. { Give wrong sign a small penalty, this is need to get a diffrence
  1690. from word->[longword,longint] }
  1691. if is_signed(def_from)<>is_signed(def_to) then
  1692. hp^.ordinal_distance:=hp^.ordinal_distance+1.0;
  1693. end
  1694. else
  1695. { for value and const parameters check precision of real, give
  1696. penalty for loosing of precision }
  1697. if not(currpara.varspez in [vs_var,vs_out]) and
  1698. is_real(def_from) and
  1699. is_real(def_to) then
  1700. begin
  1701. eq:=te_equal;
  1702. if is_extended(def_to) then
  1703. rth:=bestreal(4)
  1704. else
  1705. if is_double (def_to) then
  1706. rth:=bestreal(2)
  1707. else
  1708. rth:=bestreal(1);
  1709. if is_extended(def_from) then
  1710. rfh:=bestreal(4)
  1711. else
  1712. if is_double (def_from) then
  1713. rfh:=bestreal(2)
  1714. else
  1715. rfh:=bestreal(1);
  1716. { penalty for shrinking of precision }
  1717. if rth<rfh then
  1718. rfh:=(rfh-rth)*16
  1719. else
  1720. rfh:=rth-rfh;
  1721. hp^.ordinal_distance:=hp^.ordinal_distance+rfh;
  1722. end
  1723. else
  1724. { generic type comparision }
  1725. begin
  1726. eq:=compare_defs_ext(def_from,def_to,currpt.left.nodetype,convtype,pdoper,cdoptions);
  1727. { when the types are not equal we need to check
  1728. some special case for parameter passing }
  1729. if (eq<te_equal) then
  1730. begin
  1731. if currpara.varspez in [vs_var,vs_out] then
  1732. begin
  1733. { para requires an equal type so the previous found
  1734. match was not good enough, reset to incompatible }
  1735. eq:=te_incompatible;
  1736. { var_para_allowed will return te_equal and te_convert_l1 to
  1737. make a difference for best matching }
  1738. var_para_allowed(eq,currpt.resulttype.def,currpara.vartype.def)
  1739. end
  1740. else
  1741. para_allowed(eq,currpt,def_to);
  1742. end;
  1743. end;
  1744. { when a procvar was changed to a call an exact much is
  1745. downgraded to equal. This way an overload call with the
  1746. procvar is choosen. See tb0471 (PFV) }
  1747. if (pt<>currpt) and (eq=te_exact) then
  1748. eq:=te_equal;
  1749. { increase correct counter }
  1750. case eq of
  1751. te_exact :
  1752. inc(hp^.exact_count);
  1753. te_equal :
  1754. inc(hp^.equal_count);
  1755. te_convert_l1 :
  1756. inc(hp^.cl1_count);
  1757. te_convert_l2 :
  1758. inc(hp^.cl2_count);
  1759. te_convert_l3 :
  1760. inc(hp^.cl3_count);
  1761. te_convert_operator :
  1762. inc(hp^.coper_count);
  1763. te_incompatible :
  1764. hp^.invalid:=true;
  1765. else
  1766. internalerror(200212072);
  1767. end;
  1768. { stop checking when an incompatible parameter is found }
  1769. if hp^.invalid then
  1770. begin
  1771. { store the current parameter info for
  1772. a nice error message when no procedure is found }
  1773. hp^.wrongparaidx:=paraidx;
  1774. hp^.wrongparanr:=currparanr;
  1775. break;
  1776. end;
  1777. {$ifdef EXTDEBUG}
  1778. { store equal in node tree for dump }
  1779. currpara.eqval:=eq;
  1780. {$endif EXTDEBUG}
  1781. { maybe release temp currpt }
  1782. if releasecurrpt then
  1783. currpt.free;
  1784. { next parameter in the call tree }
  1785. pt:=tcallparanode(pt.right);
  1786. { next parameter for definition, only goto next para
  1787. if we're out of the varargs }
  1788. if not(po_varargs in hp^.data.procoptions) or
  1789. (currparanr<=hp^.data.maxparacount) then
  1790. begin
  1791. { Ignore vs_hidden parameters }
  1792. repeat
  1793. dec(paraidx);
  1794. until (paraidx<0) or not(vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions);
  1795. end;
  1796. dec(currparanr);
  1797. end;
  1798. if not(hp^.invalid) and
  1799. (assigned(pt) or (paraidx>=0) or (currparanr<>0)) then
  1800. internalerror(200212141);
  1801. { next candidate }
  1802. hp:=hp^.next;
  1803. end;
  1804. end;
  1805. function is_better_candidate(currpd,bestpd:pcandidate):integer;
  1806. var
  1807. res : integer;
  1808. begin
  1809. {
  1810. Return values:
  1811. > 0 when currpd is better than bestpd
  1812. < 0 when bestpd is better than currpd
  1813. = 0 when both are equal
  1814. To choose the best candidate we use the following order:
  1815. - Incompatible flag
  1816. - (Smaller) Number of convert operator parameters.
  1817. - (Smaller) Number of convertlevel 2 parameters.
  1818. - (Smaller) Number of convertlevel 1 parameters.
  1819. - (Bigger) Number of exact parameters.
  1820. - (Smaller) Number of equal parameters.
  1821. - (Smaller) Total of ordinal distance. For example, the distance of a word
  1822. to a byte is 65535-255=65280.
  1823. }
  1824. if bestpd^.invalid then
  1825. begin
  1826. if currpd^.invalid then
  1827. res:=0
  1828. else
  1829. res:=1;
  1830. end
  1831. else
  1832. if currpd^.invalid then
  1833. res:=-1
  1834. else
  1835. begin
  1836. { less operator parameters? }
  1837. res:=(bestpd^.coper_count-currpd^.coper_count);
  1838. if (res=0) then
  1839. begin
  1840. { less cl3 parameters? }
  1841. res:=(bestpd^.cl3_count-currpd^.cl3_count);
  1842. if (res=0) then
  1843. begin
  1844. { less cl2 parameters? }
  1845. res:=(bestpd^.cl2_count-currpd^.cl2_count);
  1846. if (res=0) then
  1847. begin
  1848. { less cl1 parameters? }
  1849. res:=(bestpd^.cl1_count-currpd^.cl1_count);
  1850. if (res=0) then
  1851. begin
  1852. { more exact parameters? }
  1853. res:=(currpd^.exact_count-bestpd^.exact_count);
  1854. if (res=0) then
  1855. begin
  1856. { less equal parameters? }
  1857. res:=(bestpd^.equal_count-currpd^.equal_count);
  1858. if (res=0) then
  1859. begin
  1860. { smaller ordinal distance? }
  1861. if (currpd^.ordinal_distance<bestpd^.ordinal_distance) then
  1862. res:=1
  1863. else
  1864. if (currpd^.ordinal_distance>bestpd^.ordinal_distance) then
  1865. res:=-1
  1866. else
  1867. res:=0;
  1868. end;
  1869. end;
  1870. end;
  1871. end;
  1872. end;
  1873. end;
  1874. end;
  1875. is_better_candidate:=res;
  1876. end;
  1877. function tcallcandidates.choose_best(var bestpd:tabstractprocdef):integer;
  1878. var
  1879. besthpstart,
  1880. hp : pcandidate;
  1881. cntpd,
  1882. res : integer;
  1883. begin
  1884. {
  1885. Returns the number of candidates left and the
  1886. first candidate is returned in pdbest
  1887. }
  1888. { Setup the first procdef as best, only count it as a result
  1889. when it is valid }
  1890. bestpd:=FProcs^.data;
  1891. if FProcs^.invalid then
  1892. cntpd:=0
  1893. else
  1894. cntpd:=1;
  1895. if assigned(FProcs^.next) then
  1896. begin
  1897. besthpstart:=FProcs;
  1898. hp:=FProcs^.next;
  1899. while assigned(hp) do
  1900. begin
  1901. res:=is_better_candidate(hp,besthpstart);
  1902. if (res>0) then
  1903. begin
  1904. { hp is better, flag all procs to be incompatible }
  1905. while (besthpstart<>hp) do
  1906. begin
  1907. besthpstart^.invalid:=true;
  1908. besthpstart:=besthpstart^.next;
  1909. end;
  1910. { besthpstart is already set to hp }
  1911. bestpd:=besthpstart^.data;
  1912. cntpd:=1;
  1913. end
  1914. else
  1915. if (res<0) then
  1916. begin
  1917. { besthpstart is better, flag current hp to be incompatible }
  1918. hp^.invalid:=true;
  1919. end
  1920. else
  1921. begin
  1922. { res=0, both are valid }
  1923. if not hp^.invalid then
  1924. inc(cntpd);
  1925. end;
  1926. hp:=hp^.next;
  1927. end;
  1928. end;
  1929. result:=cntpd;
  1930. end;
  1931. procedure tcallcandidates.find_wrong_para;
  1932. var
  1933. currparanr : smallint;
  1934. hp : pcandidate;
  1935. pt : tcallparanode;
  1936. wrongpara : tparavarsym;
  1937. begin
  1938. { Only process the first overloaded procdef }
  1939. hp:=FProcs;
  1940. { Find callparanode corresponding to the argument }
  1941. pt:=tcallparanode(FParanode);
  1942. currparanr:=FParalength;
  1943. while assigned(pt) and
  1944. (currparanr>hp^.wrongparanr) do
  1945. begin
  1946. pt:=tcallparanode(pt.right);
  1947. dec(currparanr);
  1948. end;
  1949. if (currparanr<>hp^.wrongparanr) or
  1950. not assigned(pt) then
  1951. internalerror(200212094);
  1952. { Show error message, when it was a var or out parameter
  1953. guess that it is a missing typeconv }
  1954. wrongpara:=tparavarsym(hp^.data.paras[hp^.wrongparaidx]);
  1955. if wrongpara.varspez in [vs_var,vs_out] then
  1956. begin
  1957. { Maybe passing the correct type but passing a const to var parameter }
  1958. if (compare_defs(pt.resulttype.def,wrongpara.vartype.def,pt.nodetype)<>te_incompatible) and
  1959. not valid_for_var(pt.left) then
  1960. CGMessagePos(pt.left.fileinfo,type_e_variable_id_expected)
  1961. else
  1962. CGMessagePos2(pt.left.fileinfo,parser_e_call_by_ref_without_typeconv,
  1963. FullTypeName(pt.left.resulttype.def,wrongpara.vartype.def),
  1964. FullTypeName(wrongpara.vartype.def,pt.left.resulttype.def))
  1965. end
  1966. else
  1967. CGMessagePos3(pt.left.fileinfo,type_e_wrong_parameter_type,tostr(hp^.wrongparanr),
  1968. FullTypeName(pt.left.resulttype.def,wrongpara.vartype.def),
  1969. FullTypeName(wrongpara.vartype.def,pt.left.resulttype.def));
  1970. end;
  1971. end.