htypechk.pas 74 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062
  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) and
  640. (p.nodetype=typeconvn) and
  641. is_voidpointer(p.resulttype.def) then
  642. p:=tunarynode(p).left;
  643. result:=(p.nodetype=typeconvn) and
  644. (ttypeconvnode(p).convtype=tc_proc_2_procvar);
  645. end;
  646. { local routines can't be assigned to procvars }
  647. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  648. begin
  649. if (from_def.parast.symtablelevel>normal_function_level) and
  650. (to_def.deftype=procvardef) then
  651. CGMessage(type_e_cannot_local_proc_to_procvar);
  652. end;
  653. procedure set_varstate(p:tnode;newstate:tvarstate;varstateflags:tvarstateflags);
  654. var
  655. hsym : tabstractvarsym;
  656. begin
  657. while assigned(p) do
  658. begin
  659. case p.nodetype of
  660. typeconvn :
  661. begin
  662. case ttypeconvnode(p).convtype of
  663. tc_cchar_2_pchar,
  664. tc_cstring_2_pchar,
  665. tc_array_2_pointer :
  666. exclude(varstateflags,vsf_must_be_valid);
  667. tc_pchar_2_string,
  668. tc_pointer_2_array :
  669. include(varstateflags,vsf_must_be_valid);
  670. end;
  671. p:=tunarynode(p).left;
  672. end;
  673. subscriptn :
  674. p:=tunarynode(p).left;
  675. vecn:
  676. begin
  677. set_varstate(tbinarynode(p).right,vs_used,[vsf_must_be_valid]);
  678. if not(tunarynode(p).left.resulttype.def.deftype in [stringdef,arraydef]) then
  679. include(varstateflags,vsf_must_be_valid);
  680. p:=tunarynode(p).left;
  681. end;
  682. { do not parse calln }
  683. calln :
  684. break;
  685. loadn :
  686. begin
  687. if (tloadnode(p).symtableentry.typ in [localvarsym,paravarsym,globalvarsym]) then
  688. begin
  689. hsym:=tabstractvarsym(tloadnode(p).symtableentry);
  690. if (vsf_must_be_valid in varstateflags) and (hsym.varstate=vs_declared) then
  691. begin
  692. { Give warning/note for uninitialized locals }
  693. if assigned(hsym.owner) and
  694. not(vo_is_external in hsym.varoptions) and
  695. (hsym.owner.symtabletype in [localsymtable,staticsymtable]) and
  696. (hsym.owner=current_procinfo.procdef.localst) then
  697. begin
  698. if (vo_is_funcret in hsym.varoptions) then
  699. CGMessage(sym_w_function_result_not_set)
  700. else
  701. begin
  702. if tloadnode(p).symtable.symtabletype=localsymtable then
  703. begin
  704. if (vsf_use_hints in varstateflags) then
  705. CGMessage1(sym_h_uninitialized_local_variable,hsym.realname)
  706. else
  707. CGMessage1(sym_w_uninitialized_local_variable,hsym.realname);
  708. end
  709. else
  710. begin
  711. if (vsf_use_hints in varstateflags) then
  712. CGMessage1(sym_h_uninitialized_variable,hsym.realname)
  713. else
  714. CGMessage1(sym_w_uninitialized_variable,hsym.realname);
  715. end;
  716. end;
  717. end;
  718. end;
  719. { don't override vs_used with vs_assigned }
  720. if hsym.varstate<>vs_used then
  721. hsym.varstate:=newstate;
  722. end;
  723. break;
  724. end;
  725. callparan :
  726. internalerror(200310081);
  727. else
  728. break;
  729. end;{case }
  730. end;
  731. end;
  732. procedure set_unique(p : tnode);
  733. begin
  734. while assigned(p) do
  735. begin
  736. case p.nodetype of
  737. vecn:
  738. begin
  739. include(p.flags,nf_callunique);
  740. break;
  741. end;
  742. typeconvn,
  743. subscriptn,
  744. derefn:
  745. p:=tunarynode(p).left;
  746. else
  747. break;
  748. end;
  749. end;
  750. end;
  751. function valid_for_assign(p:tnode;opts:TValidAssigns):boolean;
  752. var
  753. hp : tnode;
  754. gotstring,
  755. gotwith,
  756. gotsubscript,
  757. gotpointer,
  758. gotvec,
  759. gotclass,
  760. gotdynarray,
  761. gotderef : boolean;
  762. fromdef,
  763. todef : tdef;
  764. errmsg : longint;
  765. begin
  766. if valid_const in opts then
  767. errmsg:=type_e_variable_id_expected
  768. else
  769. errmsg:=type_e_argument_cant_be_assigned;
  770. result:=false;
  771. gotsubscript:=false;
  772. gotvec:=false;
  773. gotderef:=false;
  774. gotclass:=false;
  775. gotpointer:=false;
  776. gotwith:=false;
  777. gotdynarray:=false;
  778. gotstring:=false;
  779. hp:=p;
  780. if not(valid_void in opts) and
  781. is_void(hp.resulttype.def) then
  782. begin
  783. CGMessagePos(hp.fileinfo,errmsg);
  784. exit;
  785. end;
  786. while assigned(hp) do
  787. begin
  788. { property allowed? calln has a property check itself }
  789. if (nf_isproperty in hp.flags) then
  790. begin
  791. if (hp.nodetype<>calln) or
  792. (valid_property in opts) then
  793. result:=true
  794. else
  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, { handle record like class it needs a subscription }
  803. classrefdef :
  804. gotclass:=true;
  805. stringdef :
  806. gotstring:=true;
  807. end;
  808. { 1. if it returns a pointer and we've found a deref,
  809. 2. if it returns a class or record and a subscription or with is found
  810. 3. if the address is needed of a field (subscriptn) }
  811. if (gotpointer and gotderef) or
  812. (gotstring and gotvec) or
  813. (
  814. gotclass and
  815. (gotsubscript or gotwith)
  816. ) or
  817. (
  818. (gotvec and gotdynarray)
  819. ) or
  820. (
  821. (Valid_Addr in opts) and
  822. (hp.nodetype=subscriptn)
  823. ) then
  824. result:=true
  825. else
  826. CGMessagePos(hp.fileinfo,errmsg);
  827. end;
  828. exit;
  829. end;
  830. if (Valid_Const in opts) and is_constnode(hp) then
  831. begin
  832. result:=true;
  833. exit;
  834. end;
  835. case hp.nodetype of
  836. temprefn :
  837. begin
  838. valid_for_assign := true;
  839. exit;
  840. end;
  841. derefn :
  842. begin
  843. gotderef:=true;
  844. hp:=tderefnode(hp).left;
  845. end;
  846. typeconvn :
  847. begin
  848. { typecast sizes must match, exceptions:
  849. - implicit typecast made by absolute
  850. - from formaldef
  851. - from void
  852. - from/to open array
  853. - typecast from pointer to array }
  854. fromdef:=ttypeconvnode(hp).left.resulttype.def;
  855. todef:=hp.resulttype.def;
  856. if not((nf_absolute in ttypeconvnode(hp).flags) or
  857. (fromdef.deftype=formaldef) or
  858. is_void(fromdef) or
  859. is_open_array(fromdef) or
  860. is_open_array(todef) or
  861. ((fromdef.deftype=pointerdef) and (todef.deftype=arraydef)) or
  862. ((fromdef.deftype = objectdef) and (todef.deftype = objectdef) and
  863. (tobjectdef(fromdef).is_related(tobjectdef(todef))))) and
  864. (fromdef.size<>todef.size) then
  865. begin
  866. { in TP it is allowed to typecast to smaller types. But the variable can't
  867. be in a register }
  868. if (m_tp7 in aktmodeswitches) or
  869. (todef.size<fromdef.size) then
  870. make_not_regable(hp)
  871. else
  872. CGMessagePos2(hp.fileinfo,type_e_typecast_wrong_size_for_assignment,tostr(fromdef.size),tostr(todef.size));
  873. end;
  874. { don't allow assignments to typeconvs that need special code }
  875. if not(gotsubscript or gotvec or gotderef) and
  876. not(ttypeconvnode(hp).assign_allowed) then
  877. begin
  878. CGMessagePos(hp.fileinfo,errmsg);
  879. exit;
  880. end;
  881. case hp.resulttype.def.deftype of
  882. pointerdef :
  883. gotpointer:=true;
  884. objectdef :
  885. gotclass:=is_class_or_interface(hp.resulttype.def);
  886. classrefdef :
  887. gotclass:=true;
  888. arraydef :
  889. begin
  890. { pointer -> array conversion is done then we need to see it
  891. as a deref, because a ^ is then not required anymore }
  892. if (ttypeconvnode(hp).left.resulttype.def.deftype=pointerdef) then
  893. gotderef:=true;
  894. end;
  895. end;
  896. hp:=ttypeconvnode(hp).left;
  897. end;
  898. vecn :
  899. begin
  900. gotvec:=true;
  901. { accesses to dyn. arrays override read only access in delphi }
  902. if (m_delphi in aktmodeswitches) and is_dynamic_array(tunarynode(hp).left.resulttype.def) then
  903. gotdynarray:=true;
  904. hp:=tunarynode(hp).left;
  905. end;
  906. asn :
  907. begin
  908. { asn can't be assigned directly, it returns the value in a register instead
  909. of reference. }
  910. if not(gotsubscript or gotderef or gotvec) then
  911. begin
  912. CGMessagePos(hp.fileinfo,errmsg);
  913. exit;
  914. end;
  915. hp:=tunarynode(hp).left;
  916. end;
  917. subscriptn :
  918. begin
  919. gotsubscript:=true;
  920. { loop counter? }
  921. if not(Valid_Const in opts) and
  922. (vo_is_loop_counter in tsubscriptnode(hp).vs.varoptions) then
  923. CGMessage1(parser_e_illegal_assignment_to_count_var,tsubscriptnode(hp).vs.realname);
  924. { a class/interface access is an implicit }
  925. { dereferencing }
  926. hp:=tsubscriptnode(hp).left;
  927. if is_class_or_interface(hp.resulttype.def) then
  928. gotderef:=true;
  929. end;
  930. muln,
  931. divn,
  932. andn,
  933. xorn,
  934. orn,
  935. notn,
  936. subn,
  937. addn :
  938. begin
  939. { Allow operators on a pointer, or an integer
  940. and a pointer typecast and deref has been found }
  941. if ((hp.resulttype.def.deftype=pointerdef) or
  942. (is_integer(hp.resulttype.def) and gotpointer)) and
  943. gotderef then
  944. result:=true
  945. else
  946. { Temp strings are stored in memory, for compatibility with
  947. delphi only }
  948. if (m_delphi in aktmodeswitches) and
  949. (valid_addr in opts) and
  950. (hp.resulttype.def.deftype=stringdef) then
  951. result:=true
  952. else
  953. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  954. exit;
  955. end;
  956. niln,
  957. pointerconstn :
  958. begin
  959. { to support e.g. @tmypointer(0)^.data; see tests/tbs/tb0481 }
  960. if gotderef then
  961. result:=true
  962. else
  963. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  964. exit;
  965. end;
  966. addrn :
  967. begin
  968. if gotderef then
  969. result:=true
  970. else
  971. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  972. exit;
  973. end;
  974. calln :
  975. begin
  976. { check return type }
  977. case hp.resulttype.def.deftype of
  978. arraydef :
  979. begin
  980. { dynamic arrays are allowed when there is also a
  981. vec node }
  982. if is_dynamic_array(hp.resulttype.def) and
  983. gotvec then
  984. begin
  985. gotderef:=true;
  986. gotpointer:=true;
  987. end;
  988. end;
  989. pointerdef :
  990. gotpointer:=true;
  991. objectdef :
  992. gotclass:=is_class_or_interface(hp.resulttype.def);
  993. recorddef, { handle record like class it needs a subscription }
  994. classrefdef :
  995. gotclass:=true;
  996. stringdef :
  997. gotstring:=true;
  998. end;
  999. { 1. if it returns a pointer and we've found a deref,
  1000. 2. if it returns a class or record and a subscription or with is found
  1001. 3. string is returned }
  1002. if (gotstring and gotvec) or
  1003. (gotpointer and gotderef) or
  1004. (gotclass and (gotsubscript or gotwith)) then
  1005. result:=true
  1006. else
  1007. { Temp strings are stored in memory, for compatibility with
  1008. delphi only }
  1009. if (m_delphi in aktmodeswitches) and
  1010. (valid_addr in opts) and
  1011. (hp.resulttype.def.deftype=stringdef) then
  1012. result:=true
  1013. else
  1014. CGMessagePos(hp.fileinfo,errmsg);
  1015. exit;
  1016. end;
  1017. inlinen :
  1018. begin
  1019. if (valid_const in opts) and
  1020. (tinlinenode(hp).inlinenumber in [in_typeof_x]) then
  1021. result:=true
  1022. else
  1023. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1024. exit;
  1025. end;
  1026. loadn :
  1027. begin
  1028. case tloadnode(hp).symtableentry.typ of
  1029. absolutevarsym,
  1030. globalvarsym,
  1031. localvarsym,
  1032. paravarsym :
  1033. begin
  1034. { loop counter? }
  1035. if not(Valid_Const in opts) and
  1036. (vo_is_loop_counter in tabstractvarsym(tloadnode(hp).symtableentry).varoptions) then
  1037. CGMessage1(parser_e_illegal_assignment_to_count_var,tloadnode(hp).symtableentry.realname);
  1038. { derefed pointer }
  1039. if (tabstractvarsym(tloadnode(hp).symtableentry).varspez=vs_const) then
  1040. begin
  1041. { allow p^:= constructions with p is const parameter }
  1042. if gotderef or gotdynarray or (Valid_Const in opts) then
  1043. result:=true
  1044. else
  1045. CGMessagePos(tloadnode(hp).fileinfo,type_e_no_assign_to_const);
  1046. exit;
  1047. end;
  1048. { Are we at a with symtable, then we need to process the
  1049. withrefnode also to check for maybe a const load }
  1050. if (tloadnode(hp).symtable.symtabletype=withsymtable) then
  1051. begin
  1052. { continue with processing the withref node }
  1053. hp:=tnode(twithsymtable(tloadnode(hp).symtable).withrefnode);
  1054. gotwith:=true;
  1055. end
  1056. else
  1057. begin
  1058. result:=true;
  1059. exit;
  1060. end;
  1061. end;
  1062. typedconstsym :
  1063. begin
  1064. if ttypedconstsym(tloadnode(hp).symtableentry).is_writable or
  1065. (valid_addr in opts) then
  1066. result:=true
  1067. else
  1068. CGMessagePos(hp.fileinfo,type_e_no_assign_to_const);
  1069. exit;
  1070. end;
  1071. procsym :
  1072. begin
  1073. if (Valid_Const in opts) then
  1074. result:=true
  1075. else
  1076. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1077. exit;
  1078. end;
  1079. labelsym :
  1080. begin
  1081. if (Valid_Addr in opts) then
  1082. result:=true
  1083. else
  1084. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1085. exit;
  1086. end;
  1087. constsym:
  1088. begin
  1089. if (tconstsym(tloadnode(hp).symtableentry).consttyp=constresourcestring) and
  1090. (valid_addr in opts) then
  1091. result:=true
  1092. else
  1093. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1094. exit;
  1095. end;
  1096. else
  1097. begin
  1098. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1099. exit;
  1100. end;
  1101. end;
  1102. end;
  1103. else
  1104. begin
  1105. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1106. exit;
  1107. end;
  1108. end;
  1109. end;
  1110. end;
  1111. function valid_for_var(p:tnode):boolean;
  1112. begin
  1113. valid_for_var:=valid_for_assign(p,[]);
  1114. end;
  1115. function valid_for_formal_var(p : tnode) : boolean;
  1116. begin
  1117. valid_for_formal_var:=valid_for_assign(p,[valid_void]);
  1118. end;
  1119. function valid_for_formal_const(p : tnode) : boolean;
  1120. begin
  1121. valid_for_formal_const:=(p.resulttype.def.deftype=formaldef) or
  1122. valid_for_assign(p,[valid_void,valid_const]);
  1123. end;
  1124. function valid_for_assignment(p:tnode):boolean;
  1125. begin
  1126. valid_for_assignment:=valid_for_assign(p,[valid_property]);
  1127. end;
  1128. function valid_for_addr(p : tnode) : boolean;
  1129. begin
  1130. result:=valid_for_assign(p,[valid_const,valid_addr,valid_void]);
  1131. end;
  1132. procedure var_para_allowed(var eq:tequaltype;def_from,def_to:Tdef);
  1133. begin
  1134. { Note: eq must be already valid, it will only be updated! }
  1135. case def_to.deftype of
  1136. formaldef :
  1137. begin
  1138. { all types can be passed to a formaldef }
  1139. eq:=te_equal;
  1140. end;
  1141. orddef :
  1142. begin
  1143. { allows conversion from word to integer and
  1144. byte to shortint, but only for TP7 compatibility }
  1145. if (m_tp7 in aktmodeswitches) and
  1146. (def_from.deftype=orddef) and
  1147. (def_from.size=def_to.size) then
  1148. eq:=te_convert_l1;
  1149. end;
  1150. arraydef :
  1151. begin
  1152. if is_open_array(def_to) and
  1153. is_dynamic_array(def_from) and
  1154. equal_defs(tarraydef(def_from).elementtype.def,tarraydef(def_to).elementtype.def) then
  1155. eq:=te_convert_l2;
  1156. end;
  1157. pointerdef :
  1158. begin
  1159. { an implicit pointer conversion is allowed }
  1160. if (def_from.deftype=pointerdef) then
  1161. eq:=te_convert_l1;
  1162. end;
  1163. stringdef :
  1164. begin
  1165. { all shortstrings are allowed, size is not important }
  1166. if is_shortstring(def_from) and
  1167. is_shortstring(def_to) then
  1168. eq:=te_equal;
  1169. end;
  1170. objectdef :
  1171. begin
  1172. { child objects can be also passed }
  1173. { in non-delphi mode, otherwise }
  1174. { they must match exactly, except }
  1175. { if they are objects }
  1176. if (def_from.deftype=objectdef) and
  1177. (
  1178. not(m_delphi in aktmodeswitches) or
  1179. (
  1180. (tobjectdef(def_from).objecttype=odt_object) and
  1181. (tobjectdef(def_to).objecttype=odt_object)
  1182. )
  1183. ) and
  1184. (tobjectdef(def_from).is_related(tobjectdef(def_to))) then
  1185. eq:=te_convert_l1;
  1186. end;
  1187. filedef :
  1188. begin
  1189. { an implicit file conversion is also allowed }
  1190. { from a typed file to an untyped one }
  1191. if (def_from.deftype=filedef) and
  1192. (tfiledef(def_from).filetyp = ft_typed) and
  1193. (tfiledef(def_to).filetyp = ft_untyped) then
  1194. eq:=te_convert_l1;
  1195. end;
  1196. end;
  1197. end;
  1198. procedure para_allowed(var eq:tequaltype;p:tcallparanode;def_to:tdef);
  1199. begin
  1200. { Note: eq must be already valid, it will only be updated! }
  1201. case def_to.deftype of
  1202. formaldef :
  1203. begin
  1204. { all types can be passed to a formaldef }
  1205. eq:=te_equal;
  1206. end;
  1207. stringdef :
  1208. begin
  1209. { to support ansi/long/wide strings in a proper way }
  1210. { string and string[10] are assumed as equal }
  1211. { when searching the correct overloaded procedure }
  1212. if (p.resulttype.def.deftype=stringdef) and
  1213. (tstringdef(def_to).string_typ=tstringdef(p.resulttype.def).string_typ) then
  1214. eq:=te_equal
  1215. else
  1216. { Passing a constant char to ansistring or shortstring or
  1217. a widechar to widestring then handle it as equal. }
  1218. if (p.left.nodetype=ordconstn) and
  1219. (
  1220. is_char(p.resulttype.def) and
  1221. (is_shortstring(def_to) or is_ansistring(def_to))
  1222. ) or
  1223. (
  1224. is_widechar(p.resulttype.def) and
  1225. is_widestring(def_to)
  1226. ) then
  1227. eq:=te_equal
  1228. end;
  1229. setdef :
  1230. begin
  1231. { set can also be a not yet converted array constructor }
  1232. if (p.resulttype.def.deftype=arraydef) and
  1233. (tarraydef(p.resulttype.def).IsConstructor) and
  1234. not(tarraydef(p.resulttype.def).IsVariant) then
  1235. eq:=te_equal;
  1236. end;
  1237. procvardef :
  1238. begin
  1239. { in tp7 mode proc -> procvar is allowed }
  1240. if (m_tp_procvar in aktmodeswitches) and
  1241. (p.left.nodetype=calln) and
  1242. (proc_to_procvar_equal(tprocdef(tcallnode(p.left).procdefinition),tprocvardef(def_to),true)>=te_equal) then
  1243. eq:=te_equal;
  1244. end;
  1245. end;
  1246. end;
  1247. {****************************************************************************
  1248. TCallCandidates
  1249. ****************************************************************************}
  1250. constructor tcallcandidates.create(sym:tprocsym;st:tsymtable;ppn:tnode;isprop,ignorevis : boolean);
  1251. var
  1252. j : integer;
  1253. pd : tprocdef;
  1254. hp : pcandidate;
  1255. found,
  1256. has_overload_directive : boolean;
  1257. topclassh : tobjectdef;
  1258. srsymtable : tsymtable;
  1259. srprocsym : tprocsym;
  1260. pt : tcallparanode;
  1261. begin
  1262. if not assigned(sym) then
  1263. internalerror(200411015);
  1264. FProcSym:=sym;
  1265. FProcs:=nil;
  1266. FProccnt:=0;
  1267. FProcvisiblecnt:=0;
  1268. FParanode:=ppn;
  1269. FAllowVariant:=true;
  1270. { determine length of parameter list }
  1271. pt:=tcallparanode(ppn);
  1272. FParalength:=0;
  1273. while assigned(pt) do
  1274. begin
  1275. inc(FParalength);
  1276. pt:=tcallparanode(pt.right);
  1277. end;
  1278. { when the definition has overload directive set, we search for
  1279. overloaded definitions in the class, this only needs to be done once
  1280. for class entries as the tree keeps always the same }
  1281. if (not sym.overloadchecked) and
  1282. (sym.owner.symtabletype=objectsymtable) and
  1283. (po_overload in sym.first_procdef.procoptions) then
  1284. search_class_overloads(sym);
  1285. { when the class passed is defined in this unit we
  1286. need to use the scope of that class. This is a trick
  1287. that can be used to access protected members in other
  1288. units. At least kylix supports it this way (PFV) }
  1289. if assigned(st) and
  1290. (
  1291. (st.symtabletype=objectsymtable) or
  1292. ((st.symtabletype=withsymtable) and
  1293. (st.defowner.deftype=objectdef))
  1294. ) and
  1295. (st.defowner.owner.symtabletype in [globalsymtable,staticsymtable]) and
  1296. st.defowner.owner.iscurrentunit then
  1297. topclassh:=tobjectdef(st.defowner)
  1298. else
  1299. begin
  1300. if assigned(current_procinfo) then
  1301. topclassh:=current_procinfo.procdef._class
  1302. else
  1303. topclassh:=nil;
  1304. end;
  1305. { link all procedures which have the same # of parameters }
  1306. for j:=1 to sym.procdef_count do
  1307. begin
  1308. pd:=sym.procdef[j];
  1309. { Is the procdef visible? This needs to be checked on
  1310. procdef level since a symbol can contain both private and
  1311. public declarations. But the check should not be done
  1312. when the callnode is generated by a property
  1313. inherited overrides invisible anonymous inherited (FK) }
  1314. if isprop or ignorevis or
  1315. (pd.owner.symtabletype<>objectsymtable) or
  1316. pd.is_visible_for_object(topclassh) then
  1317. begin
  1318. { we have at least one procedure that is visible }
  1319. inc(FProcvisiblecnt);
  1320. { only when the # of parameter are supported by the
  1321. procedure }
  1322. if (FParalength>=pd.minparacount) and
  1323. ((po_varargs in pd.procoptions) or { varargs }
  1324. (FParalength<=pd.maxparacount)) then
  1325. proc_add(pd);
  1326. end;
  1327. end;
  1328. { remember if the procedure is declared with the overload directive,
  1329. it's information is still needed also after all procs are removed }
  1330. has_overload_directive:=(po_overload in sym.first_procdef.procoptions);
  1331. { when the definition has overload directive set, we search for
  1332. overloaded definitions in the symtablestack. The found
  1333. entries are only added to the procs list and not the procsym, because
  1334. the list can change in every situation }
  1335. if has_overload_directive and
  1336. (sym.owner.symtabletype<>objectsymtable) then
  1337. begin
  1338. srsymtable:=sym.owner.next;
  1339. while assigned(srsymtable) do
  1340. begin
  1341. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1342. begin
  1343. srprocsym:=tprocsym(srsymtable.speedsearch(sym.name,sym.speedvalue));
  1344. if assigned(srprocsym) and
  1345. (srprocsym.typ=procsym) then
  1346. begin
  1347. { if this visible procedure doesn't have overload we can stop
  1348. searching }
  1349. if not(po_overload in srprocsym.first_procdef.procoptions) and
  1350. srprocsym.first_procdef.is_visible_for_object(topclassh) then
  1351. break;
  1352. { process all overloaded definitions }
  1353. for j:=1 to srprocsym.procdef_count do
  1354. begin
  1355. pd:=srprocsym.procdef[j];
  1356. { only visible procedures need to be added }
  1357. if pd.is_visible_for_object(topclassh) then
  1358. begin
  1359. { only when the # of parameter are supported by the
  1360. procedure }
  1361. if (FParalength>=pd.minparacount) and
  1362. ((po_varargs in pd.procoptions) or { varargs }
  1363. (FParalength<=pd.maxparacount)) then
  1364. begin
  1365. found:=false;
  1366. hp:=FProcs;
  1367. while assigned(hp) do
  1368. begin
  1369. { Only compare visible parameters for the user }
  1370. if compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1371. begin
  1372. found:=true;
  1373. break;
  1374. end;
  1375. hp:=hp^.next;
  1376. end;
  1377. if not found then
  1378. proc_add(pd);
  1379. end;
  1380. end;
  1381. end;
  1382. end;
  1383. end;
  1384. srsymtable:=srsymtable.next;
  1385. end;
  1386. end;
  1387. end;
  1388. constructor tcallcandidates.create_operator(op:ttoken;ppn:tnode);
  1389. var
  1390. j : integer;
  1391. pd : tprocdef;
  1392. hp : pcandidate;
  1393. found : boolean;
  1394. srsymtable : tsymtable;
  1395. srprocsym : tprocsym;
  1396. pt : tcallparanode;
  1397. sv : cardinal;
  1398. begin
  1399. FProcSym:=nil;
  1400. FProcs:=nil;
  1401. FProccnt:=0;
  1402. FProcvisiblecnt:=0;
  1403. FParanode:=ppn;
  1404. FAllowVariant:=false;
  1405. { determine length of parameter list }
  1406. pt:=tcallparanode(ppn);
  1407. FParalength:=0;
  1408. while assigned(pt) do
  1409. begin
  1410. if pt.resulttype.def.deftype=variantdef then
  1411. FAllowVariant:=true;
  1412. inc(FParalength);
  1413. pt:=tcallparanode(pt.right);
  1414. end;
  1415. { we search all overloaded operator definitions in the symtablestack. The found
  1416. entries are only added to the procs list and not the procsym, because
  1417. the list can change in every situation }
  1418. sv:=getspeedvalue(overloaded_names[op]);
  1419. srsymtable:=symtablestack;
  1420. while assigned(srsymtable) do
  1421. begin
  1422. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1423. begin
  1424. srprocsym:=tprocsym(srsymtable.speedsearch(overloaded_names[op],sv));
  1425. if assigned(srprocsym) and
  1426. (srprocsym.typ=procsym) then
  1427. begin
  1428. { Store first procsym found }
  1429. if not assigned(FProcsym) then
  1430. FProcsym:=srprocsym;
  1431. { process all overloaded definitions }
  1432. for j:=1 to srprocsym.procdef_count do
  1433. begin
  1434. pd:=srprocsym.procdef[j];
  1435. { only when the # of parameter are supported by the
  1436. procedure }
  1437. if (FParalength>=pd.minparacount) and
  1438. (FParalength<=pd.maxparacount) then
  1439. begin
  1440. found:=false;
  1441. hp:=FProcs;
  1442. while assigned(hp) do
  1443. begin
  1444. { Only compare visible parameters for the user }
  1445. if compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1446. begin
  1447. found:=true;
  1448. break;
  1449. end;
  1450. hp:=hp^.next;
  1451. end;
  1452. if not found then
  1453. proc_add(pd);
  1454. end;
  1455. end;
  1456. end;
  1457. end;
  1458. srsymtable:=srsymtable.next;
  1459. end;
  1460. end;
  1461. destructor tcallcandidates.destroy;
  1462. var
  1463. hpnext,
  1464. hp : pcandidate;
  1465. begin
  1466. hp:=FProcs;
  1467. while assigned(hp) do
  1468. begin
  1469. hpnext:=hp^.next;
  1470. dispose(hp);
  1471. hp:=hpnext;
  1472. end;
  1473. end;
  1474. function tcallcandidates.proc_add(pd:tprocdef):pcandidate;
  1475. var
  1476. defaultparacnt : integer;
  1477. begin
  1478. { generate new candidate entry }
  1479. new(result);
  1480. fillchar(result^,sizeof(tcandidate),0);
  1481. result^.data:=pd;
  1482. result^.next:=FProcs;
  1483. FProcs:=result;
  1484. inc(FProccnt);
  1485. { Find last parameter, skip all default parameters
  1486. that are not passed. Ignore this skipping for varargs }
  1487. result^.firstparaidx:=pd.paras.count-1;
  1488. if not(po_varargs in pd.procoptions) then
  1489. begin
  1490. { ignore hidden parameters }
  1491. while (result^.firstparaidx>=0) and (vo_is_hidden_para in tparavarsym(pd.paras[result^.firstparaidx]).varoptions) do
  1492. dec(result^.firstparaidx);
  1493. defaultparacnt:=pd.maxparacount-FParalength;
  1494. if defaultparacnt>0 then
  1495. begin
  1496. if defaultparacnt>result^.firstparaidx+1 then
  1497. internalerror(200401141);
  1498. dec(result^.firstparaidx,defaultparacnt);
  1499. end;
  1500. end;
  1501. end;
  1502. procedure tcallcandidates.list(all:boolean);
  1503. var
  1504. hp : pcandidate;
  1505. begin
  1506. hp:=FProcs;
  1507. while assigned(hp) do
  1508. begin
  1509. if all or
  1510. (not hp^.invalid) then
  1511. MessagePos1(hp^.data.fileinfo,sym_h_param_list,hp^.data.fullprocname(false));
  1512. hp:=hp^.next;
  1513. end;
  1514. end;
  1515. {$ifdef EXTDEBUG}
  1516. procedure tcallcandidates.dump_info(lvl:longint);
  1517. function ParaTreeStr(p:tcallparanode):string;
  1518. begin
  1519. result:='';
  1520. while assigned(p) do
  1521. begin
  1522. if result<>'' then
  1523. result:=result+',';
  1524. result:=result+p.resulttype.def.typename;
  1525. p:=tcallparanode(p.right);
  1526. end;
  1527. end;
  1528. var
  1529. hp : pcandidate;
  1530. i : integer;
  1531. currpara : tparavarsym;
  1532. begin
  1533. if not CheckVerbosity(lvl) then
  1534. exit;
  1535. Comment(lvl+V_LineInfo,'Overloaded callnode: '+FProcSym.name+'('+ParaTreeStr(tcallparanode(FParaNode))+')');
  1536. hp:=FProcs;
  1537. while assigned(hp) do
  1538. begin
  1539. Comment(lvl,' '+hp^.data.fullprocname(false));
  1540. if (hp^.invalid) then
  1541. Comment(lvl,' invalid')
  1542. else
  1543. begin
  1544. Comment(lvl,' ex: '+tostr(hp^.exact_count)+
  1545. ' eq: '+tostr(hp^.equal_count)+
  1546. ' l1: '+tostr(hp^.cl1_count)+
  1547. ' l2: '+tostr(hp^.cl2_count)+
  1548. ' l3: '+tostr(hp^.cl3_count)+
  1549. ' oper: '+tostr(hp^.coper_count)+
  1550. ' ord: '+realtostr(hp^.ordinal_distance));
  1551. { Print parameters in left-right order }
  1552. for i:=0 to hp^.data.paras.count-1 do
  1553. begin
  1554. currpara:=tparavarsym(hp^.data.paras[i]);
  1555. if (vo_is_hidden_para in currpara.varoptions) then
  1556. Comment(lvl,' - '+currpara.vartype.def.typename+' : '+EqualTypeName[currpara.eqval]);
  1557. end;
  1558. end;
  1559. hp:=hp^.next;
  1560. end;
  1561. end;
  1562. {$endif EXTDEBUG}
  1563. procedure tcallcandidates.get_information;
  1564. var
  1565. hp : pcandidate;
  1566. currpara : tparavarsym;
  1567. paraidx : integer;
  1568. currparanr : byte;
  1569. rfh,rth : bestreal;
  1570. def_from,
  1571. def_to : tdef;
  1572. currpt,
  1573. pt : tcallparanode;
  1574. eq : tequaltype;
  1575. convtype : tconverttype;
  1576. pdoper : tprocdef;
  1577. releasecurrpt : boolean;
  1578. cdoptions : tcompare_defs_options;
  1579. begin
  1580. cdoptions:=[cdo_check_operator];
  1581. if FAllowVariant then
  1582. include(cdoptions,cdo_allow_variant);
  1583. { process all procs }
  1584. hp:=FProcs;
  1585. while assigned(hp) do
  1586. begin
  1587. { We compare parameters in reverse order (right to left),
  1588. the firstpara is already pointing to the last parameter
  1589. were we need to start comparing }
  1590. currparanr:=FParalength;
  1591. paraidx:=hp^.firstparaidx;
  1592. while (paraidx>=0) and (vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions) do
  1593. dec(paraidx);
  1594. pt:=tcallparanode(FParaNode);
  1595. while assigned(pt) and (paraidx>=0) do
  1596. begin
  1597. currpara:=tparavarsym(hp^.data.paras[paraidx]);
  1598. { currpt can be changed from loadn to calln when a procvar
  1599. is passed. This is to prevent that the change is permanent }
  1600. currpt:=pt;
  1601. releasecurrpt:=false;
  1602. { retrieve current parameter definitions to compares }
  1603. eq:=te_incompatible;
  1604. def_from:=currpt.resulttype.def;
  1605. def_to:=currpara.vartype.def;
  1606. if not(assigned(def_from)) then
  1607. internalerror(200212091);
  1608. if not(
  1609. assigned(def_to) or
  1610. ((po_varargs in hp^.data.procoptions) and
  1611. (currparanr>hp^.data.minparacount))
  1612. ) then
  1613. internalerror(200212092);
  1614. { Convert tp procvars when not expecting a procvar }
  1615. if (def_to.deftype<>procvardef) and
  1616. (currpt.left.resulttype.def.deftype=procvardef) then
  1617. begin
  1618. releasecurrpt:=true;
  1619. currpt:=tcallparanode(pt.getcopy);
  1620. if maybe_call_procvar(currpt.left,true) then
  1621. begin
  1622. currpt.resulttype:=currpt.left.resulttype;
  1623. def_from:=currpt.left.resulttype.def;
  1624. end;
  1625. end;
  1626. { varargs are always equal, but not exact }
  1627. if (po_varargs in hp^.data.procoptions) and
  1628. (currparanr>hp^.data.minparacount) then
  1629. begin
  1630. eq:=te_equal;
  1631. end
  1632. else
  1633. { same definition -> exact }
  1634. if (def_from=def_to) then
  1635. begin
  1636. eq:=te_exact;
  1637. end
  1638. else
  1639. { for value and const parameters check if a integer is constant or
  1640. included in other integer -> equal and calc ordinal_distance }
  1641. if not(currpara.varspez in [vs_var,vs_out]) and
  1642. is_integer(def_from) and
  1643. is_integer(def_to) and
  1644. is_in_limit(def_from,def_to) then
  1645. begin
  1646. eq:=te_equal;
  1647. hp^.ordinal_distance:=hp^.ordinal_distance+
  1648. abs(bestreal(torddef(def_from).low)-bestreal(torddef(def_to).low));
  1649. if (torddef(def_to).typ=u64bit) then
  1650. rth:=bestreal(qword(torddef(def_to).high))
  1651. else
  1652. rth:=bestreal(torddef(def_to).high);
  1653. if (torddef(def_from).typ=u64bit) then
  1654. rfh:=bestreal(qword(torddef(def_from).high))
  1655. else
  1656. rfh:=bestreal(torddef(def_from).high);
  1657. hp^.ordinal_distance:=hp^.ordinal_distance+abs(rth-rfh);
  1658. { Give wrong sign a small penalty, this is need to get a diffrence
  1659. from word->[longword,longint] }
  1660. if is_signed(def_from)<>is_signed(def_to) then
  1661. hp^.ordinal_distance:=hp^.ordinal_distance+1.0;
  1662. end
  1663. else
  1664. { generic type comparision }
  1665. begin
  1666. eq:=compare_defs_ext(def_from,def_to,currpt.left.nodetype,convtype,pdoper,cdoptions);
  1667. { when the types are not equal we need to check
  1668. some special case for parameter passing }
  1669. if (eq<te_equal) then
  1670. begin
  1671. if currpara.varspez in [vs_var,vs_out] then
  1672. begin
  1673. { para requires an equal type so the previous found
  1674. match was not good enough, reset to incompatible }
  1675. eq:=te_incompatible;
  1676. { var_para_allowed will return te_equal and te_convert_l1 to
  1677. make a difference for best matching }
  1678. var_para_allowed(eq,currpt.resulttype.def,currpara.vartype.def)
  1679. end
  1680. else
  1681. para_allowed(eq,currpt,def_to);
  1682. end;
  1683. end;
  1684. { when a procvar was changed to a call an exact much is
  1685. downgraded to equal. This way an overload call with the
  1686. procvar is choosen. See tb0471 (PFV) }
  1687. if (pt<>currpt) and (eq=te_exact) then
  1688. eq:=te_equal;
  1689. { increase correct counter }
  1690. case eq of
  1691. te_exact :
  1692. inc(hp^.exact_count);
  1693. te_equal :
  1694. inc(hp^.equal_count);
  1695. te_convert_l1 :
  1696. inc(hp^.cl1_count);
  1697. te_convert_l2 :
  1698. inc(hp^.cl2_count);
  1699. te_convert_l3 :
  1700. inc(hp^.cl3_count);
  1701. te_convert_operator :
  1702. inc(hp^.coper_count);
  1703. te_incompatible :
  1704. hp^.invalid:=true;
  1705. else
  1706. internalerror(200212072);
  1707. end;
  1708. { stop checking when an incompatible parameter is found }
  1709. if hp^.invalid then
  1710. begin
  1711. { store the current parameter info for
  1712. a nice error message when no procedure is found }
  1713. hp^.wrongparaidx:=paraidx;
  1714. hp^.wrongparanr:=currparanr;
  1715. break;
  1716. end;
  1717. {$ifdef EXTDEBUG}
  1718. { store equal in node tree for dump }
  1719. currpara.eqval:=eq;
  1720. {$endif EXTDEBUG}
  1721. { maybe release temp currpt }
  1722. if releasecurrpt then
  1723. currpt.free;
  1724. { next parameter in the call tree }
  1725. pt:=tcallparanode(pt.right);
  1726. { next parameter for definition, only goto next para
  1727. if we're out of the varargs }
  1728. if not(po_varargs in hp^.data.procoptions) or
  1729. (currparanr<=hp^.data.maxparacount) then
  1730. begin
  1731. { Ignore vs_hidden parameters }
  1732. repeat
  1733. dec(paraidx);
  1734. until (paraidx<0) or not(vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions);
  1735. end;
  1736. dec(currparanr);
  1737. end;
  1738. if not(hp^.invalid) and
  1739. (assigned(pt) or (paraidx>=0) or (currparanr<>0)) then
  1740. internalerror(200212141);
  1741. { next candidate }
  1742. hp:=hp^.next;
  1743. end;
  1744. end;
  1745. function is_better_candidate(currpd,bestpd:pcandidate):integer;
  1746. var
  1747. res : integer;
  1748. begin
  1749. {
  1750. Return values:
  1751. > 0 when currpd is better than bestpd
  1752. < 0 when bestpd is better than currpd
  1753. = 0 when both are equal
  1754. To choose the best candidate we use the following order:
  1755. - Incompatible flag
  1756. - (Smaller) Number of convert operator parameters.
  1757. - (Smaller) Number of convertlevel 2 parameters.
  1758. - (Smaller) Number of convertlevel 1 parameters.
  1759. - (Bigger) Number of exact parameters.
  1760. - (Smaller) Number of equal parameters.
  1761. - (Smaller) Total of ordinal distance. For example, the distance of a word
  1762. to a byte is 65535-255=65280.
  1763. }
  1764. if bestpd^.invalid then
  1765. begin
  1766. if currpd^.invalid then
  1767. res:=0
  1768. else
  1769. res:=1;
  1770. end
  1771. else
  1772. if currpd^.invalid then
  1773. res:=-1
  1774. else
  1775. begin
  1776. { less operator parameters? }
  1777. res:=(bestpd^.coper_count-currpd^.coper_count);
  1778. if (res=0) then
  1779. begin
  1780. { less cl3 parameters? }
  1781. res:=(bestpd^.cl3_count-currpd^.cl3_count);
  1782. if (res=0) then
  1783. begin
  1784. { less cl2 parameters? }
  1785. res:=(bestpd^.cl2_count-currpd^.cl2_count);
  1786. if (res=0) then
  1787. begin
  1788. { less cl1 parameters? }
  1789. res:=(bestpd^.cl1_count-currpd^.cl1_count);
  1790. if (res=0) then
  1791. begin
  1792. { more exact parameters? }
  1793. res:=(currpd^.exact_count-bestpd^.exact_count);
  1794. if (res=0) then
  1795. begin
  1796. { less equal parameters? }
  1797. res:=(bestpd^.equal_count-currpd^.equal_count);
  1798. if (res=0) then
  1799. begin
  1800. { smaller ordinal distance? }
  1801. if (currpd^.ordinal_distance<bestpd^.ordinal_distance) then
  1802. res:=1
  1803. else
  1804. if (currpd^.ordinal_distance>bestpd^.ordinal_distance) then
  1805. res:=-1
  1806. else
  1807. res:=0;
  1808. end;
  1809. end;
  1810. end;
  1811. end;
  1812. end;
  1813. end;
  1814. end;
  1815. is_better_candidate:=res;
  1816. end;
  1817. function tcallcandidates.choose_best(var bestpd:tabstractprocdef):integer;
  1818. var
  1819. besthpstart,
  1820. hp : pcandidate;
  1821. cntpd,
  1822. res : integer;
  1823. begin
  1824. {
  1825. Returns the number of candidates left and the
  1826. first candidate is returned in pdbest
  1827. }
  1828. { Setup the first procdef as best, only count it as a result
  1829. when it is valid }
  1830. bestpd:=FProcs^.data;
  1831. if FProcs^.invalid then
  1832. cntpd:=0
  1833. else
  1834. cntpd:=1;
  1835. if assigned(FProcs^.next) then
  1836. begin
  1837. besthpstart:=FProcs;
  1838. hp:=FProcs^.next;
  1839. while assigned(hp) do
  1840. begin
  1841. res:=is_better_candidate(hp,besthpstart);
  1842. if (res>0) then
  1843. begin
  1844. { hp is better, flag all procs to be incompatible }
  1845. while (besthpstart<>hp) do
  1846. begin
  1847. besthpstart^.invalid:=true;
  1848. besthpstart:=besthpstart^.next;
  1849. end;
  1850. { besthpstart is already set to hp }
  1851. bestpd:=besthpstart^.data;
  1852. cntpd:=1;
  1853. end
  1854. else
  1855. if (res<0) then
  1856. begin
  1857. { besthpstart is better, flag current hp to be incompatible }
  1858. hp^.invalid:=true;
  1859. end
  1860. else
  1861. begin
  1862. { res=0, both are valid }
  1863. if not hp^.invalid then
  1864. inc(cntpd);
  1865. end;
  1866. hp:=hp^.next;
  1867. end;
  1868. end;
  1869. result:=cntpd;
  1870. end;
  1871. procedure tcallcandidates.find_wrong_para;
  1872. var
  1873. currparanr : smallint;
  1874. hp : pcandidate;
  1875. pt : tcallparanode;
  1876. wrongpara : tparavarsym;
  1877. begin
  1878. { Only process the first overloaded procdef }
  1879. hp:=FProcs;
  1880. { Find callparanode corresponding to the argument }
  1881. pt:=tcallparanode(FParanode);
  1882. currparanr:=FParalength;
  1883. while assigned(pt) and
  1884. (currparanr>hp^.wrongparanr) do
  1885. begin
  1886. pt:=tcallparanode(pt.right);
  1887. dec(currparanr);
  1888. end;
  1889. if (currparanr<>hp^.wrongparanr) or
  1890. not assigned(pt) then
  1891. internalerror(200212094);
  1892. { Show error message, when it was a var or out parameter
  1893. guess that it is a missing typeconv }
  1894. wrongpara:=tparavarsym(hp^.data.paras[hp^.wrongparaidx]);
  1895. if wrongpara.varspez in [vs_var,vs_out] then
  1896. begin
  1897. { Maybe passing the correct type but passing a const to var parameter }
  1898. if (compare_defs(pt.resulttype.def,wrongpara.vartype.def,pt.nodetype)<>te_incompatible) and
  1899. not valid_for_var(pt.left) then
  1900. CGMessagePos(pt.left.fileinfo,type_e_variable_id_expected)
  1901. else
  1902. CGMessagePos2(pt.left.fileinfo,parser_e_call_by_ref_without_typeconv,
  1903. FullTypeName(pt.left.resulttype.def,wrongpara.vartype.def),
  1904. FullTypeName(wrongpara.vartype.def,pt.left.resulttype.def))
  1905. end
  1906. else
  1907. CGMessagePos3(pt.left.fileinfo,type_e_wrong_parameter_type,tostr(hp^.wrongparanr),
  1908. FullTypeName(pt.left.resulttype.def,wrongpara.vartype.def),
  1909. FullTypeName(wrongpara.vartype.def,pt.left.resulttype.def));
  1910. end;
  1911. end.