htypechk.pas 77 KB

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