htypechk.pas 76 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115
  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. (vo_is_loop_counter in tabstractvarsym(tloadnode(hp).symtableentry).varoptions) then
  1060. CGMessage1(parser_e_illegal_assignment_to_count_var,tloadnode(hp).symtableentry.realname);
  1061. { derefed pointer }
  1062. if (tabstractvarsym(tloadnode(hp).symtableentry).varspez=vs_const) then
  1063. begin
  1064. { allow p^:= constructions with p is const parameter }
  1065. if gotderef or gotdynarray or (Valid_Const in opts) then
  1066. result:=true
  1067. else
  1068. CGMessagePos(tloadnode(hp).fileinfo,type_e_no_assign_to_const);
  1069. exit;
  1070. end;
  1071. { Are we at a with symtable, then we need to process the
  1072. withrefnode also to check for maybe a const load }
  1073. if (tloadnode(hp).symtable.symtabletype=withsymtable) then
  1074. begin
  1075. { continue with processing the withref node }
  1076. hp:=tnode(twithsymtable(tloadnode(hp).symtable).withrefnode);
  1077. gotwith:=true;
  1078. end
  1079. else
  1080. begin
  1081. result:=true;
  1082. exit;
  1083. end;
  1084. end;
  1085. typedconstsym :
  1086. begin
  1087. if ttypedconstsym(tloadnode(hp).symtableentry).is_writable or
  1088. (valid_addr in opts) or
  1089. (valid_const in opts) then
  1090. result:=true
  1091. else
  1092. CGMessagePos(hp.fileinfo,type_e_no_assign_to_const);
  1093. exit;
  1094. end;
  1095. procsym :
  1096. begin
  1097. if (Valid_Const in opts) then
  1098. result:=true
  1099. else
  1100. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1101. exit;
  1102. end;
  1103. labelsym :
  1104. begin
  1105. if (Valid_Addr in opts) then
  1106. result:=true
  1107. else
  1108. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1109. exit;
  1110. end;
  1111. constsym:
  1112. begin
  1113. if (tconstsym(tloadnode(hp).symtableentry).consttyp=constresourcestring) and
  1114. (valid_addr in opts) then
  1115. result:=true
  1116. else
  1117. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1118. exit;
  1119. end;
  1120. else
  1121. begin
  1122. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1123. exit;
  1124. end;
  1125. end;
  1126. end;
  1127. else
  1128. begin
  1129. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1130. exit;
  1131. end;
  1132. end;
  1133. end;
  1134. end;
  1135. function valid_for_var(p:tnode):boolean;
  1136. begin
  1137. valid_for_var:=valid_for_assign(p,[]);
  1138. end;
  1139. function valid_for_formal_var(p : tnode) : boolean;
  1140. begin
  1141. valid_for_formal_var:=valid_for_assign(p,[valid_void]);
  1142. end;
  1143. function valid_for_formal_const(p : tnode) : boolean;
  1144. begin
  1145. valid_for_formal_const:=(p.resulttype.def.deftype=formaldef) or
  1146. valid_for_assign(p,[valid_void,valid_const]);
  1147. end;
  1148. function valid_for_assignment(p:tnode):boolean;
  1149. begin
  1150. valid_for_assignment:=valid_for_assign(p,[valid_property]);
  1151. end;
  1152. function valid_for_addr(p : tnode) : boolean;
  1153. begin
  1154. result:=valid_for_assign(p,[valid_const,valid_addr,valid_void]);
  1155. end;
  1156. procedure var_para_allowed(var eq:tequaltype;def_from,def_to:Tdef);
  1157. begin
  1158. { Note: eq must be already valid, it will only be updated! }
  1159. case def_to.deftype of
  1160. formaldef :
  1161. begin
  1162. { all types can be passed to a formaldef }
  1163. eq:=te_equal;
  1164. end;
  1165. orddef :
  1166. begin
  1167. { allows conversion from word to integer and
  1168. byte to shortint, but only for TP7 compatibility }
  1169. if (m_tp7 in aktmodeswitches) and
  1170. (def_from.deftype=orddef) and
  1171. (def_from.size=def_to.size) then
  1172. eq:=te_convert_l1;
  1173. end;
  1174. arraydef :
  1175. begin
  1176. if is_open_array(def_to) and
  1177. is_dynamic_array(def_from) and
  1178. equal_defs(tarraydef(def_from).elementtype.def,tarraydef(def_to).elementtype.def) then
  1179. eq:=te_convert_l2;
  1180. end;
  1181. pointerdef :
  1182. begin
  1183. { an implicit pointer conversion is allowed }
  1184. if (def_from.deftype=pointerdef) then
  1185. eq:=te_convert_l1;
  1186. end;
  1187. stringdef :
  1188. begin
  1189. { all shortstrings are allowed, size is not important }
  1190. if is_shortstring(def_from) and
  1191. is_shortstring(def_to) then
  1192. eq:=te_equal;
  1193. end;
  1194. objectdef :
  1195. begin
  1196. { child objects can be also passed }
  1197. { in non-delphi mode, otherwise }
  1198. { they must match exactly, except }
  1199. { if they are objects }
  1200. if (def_from.deftype=objectdef) and
  1201. (
  1202. not(m_delphi in aktmodeswitches) or
  1203. (
  1204. (tobjectdef(def_from).objecttype=odt_object) and
  1205. (tobjectdef(def_to).objecttype=odt_object)
  1206. )
  1207. ) and
  1208. (tobjectdef(def_from).is_related(tobjectdef(def_to))) then
  1209. eq:=te_convert_l1;
  1210. end;
  1211. filedef :
  1212. begin
  1213. { an implicit file conversion is also allowed }
  1214. { from a typed file to an untyped one }
  1215. if (def_from.deftype=filedef) and
  1216. (tfiledef(def_from).filetyp = ft_typed) and
  1217. (tfiledef(def_to).filetyp = ft_untyped) then
  1218. eq:=te_convert_l1;
  1219. end;
  1220. end;
  1221. end;
  1222. procedure para_allowed(var eq:tequaltype;p:tcallparanode;def_to:tdef);
  1223. begin
  1224. { Note: eq must be already valid, it will only be updated! }
  1225. case def_to.deftype of
  1226. formaldef :
  1227. begin
  1228. { all types can be passed to a formaldef }
  1229. eq:=te_equal;
  1230. end;
  1231. stringdef :
  1232. begin
  1233. { to support ansi/long/wide strings in a proper way }
  1234. { string and string[10] are assumed as equal }
  1235. { when searching the correct overloaded procedure }
  1236. if (p.resulttype.def.deftype=stringdef) and
  1237. (tstringdef(def_to).string_typ=tstringdef(p.resulttype.def).string_typ) then
  1238. eq:=te_equal
  1239. else
  1240. { Passing a constant char to ansistring or shortstring or
  1241. a widechar to widestring then handle it as equal. }
  1242. if (p.left.nodetype=ordconstn) and
  1243. (
  1244. is_char(p.resulttype.def) and
  1245. (is_shortstring(def_to) or is_ansistring(def_to))
  1246. ) or
  1247. (
  1248. is_widechar(p.resulttype.def) and
  1249. is_widestring(def_to)
  1250. ) then
  1251. eq:=te_equal
  1252. end;
  1253. setdef :
  1254. begin
  1255. { set can also be a not yet converted array constructor }
  1256. if (p.resulttype.def.deftype=arraydef) and
  1257. (tarraydef(p.resulttype.def).IsConstructor) and
  1258. not(tarraydef(p.resulttype.def).IsVariant) then
  1259. eq:=te_equal;
  1260. end;
  1261. procvardef :
  1262. begin
  1263. { in tp7 mode proc -> procvar is allowed }
  1264. if (m_tp_procvar in aktmodeswitches) and
  1265. (p.left.nodetype=calln) and
  1266. (proc_to_procvar_equal(tprocdef(tcallnode(p.left).procdefinition),tprocvardef(def_to),true)>=te_equal) then
  1267. eq:=te_equal;
  1268. end;
  1269. end;
  1270. end;
  1271. {****************************************************************************
  1272. TCallCandidates
  1273. ****************************************************************************}
  1274. constructor tcallcandidates.create(sym:tprocsym;st:tsymtable;ppn:tnode;isprop,ignorevis : boolean);
  1275. var
  1276. j : integer;
  1277. pd : tprocdef;
  1278. hp : pcandidate;
  1279. found,
  1280. has_overload_directive : boolean;
  1281. topclassh : tobjectdef;
  1282. srsymtable : tsymtable;
  1283. srprocsym : tprocsym;
  1284. pt : tcallparanode;
  1285. begin
  1286. if not assigned(sym) then
  1287. internalerror(200411015);
  1288. FProcSym:=sym;
  1289. FProcs:=nil;
  1290. FProccnt:=0;
  1291. FProcvisiblecnt:=0;
  1292. FParanode:=ppn;
  1293. FAllowVariant:=true;
  1294. { determine length of parameter list }
  1295. pt:=tcallparanode(ppn);
  1296. FParalength:=0;
  1297. while assigned(pt) do
  1298. begin
  1299. inc(FParalength);
  1300. pt:=tcallparanode(pt.right);
  1301. end;
  1302. { when the definition has overload directive set, we search for
  1303. overloaded definitions in the class, this only needs to be done once
  1304. for class entries as the tree keeps always the same }
  1305. if (not sym.overloadchecked) and
  1306. (sym.owner.symtabletype=objectsymtable) and
  1307. (po_overload in sym.first_procdef.procoptions) then
  1308. search_class_overloads(sym);
  1309. { when the class passed is defined in this unit we
  1310. need to use the scope of that class. This is a trick
  1311. that can be used to access protected members in other
  1312. units. At least kylix supports it this way (PFV) }
  1313. if assigned(st) and
  1314. (
  1315. (st.symtabletype=objectsymtable) or
  1316. ((st.symtabletype=withsymtable) and
  1317. (st.defowner.deftype=objectdef))
  1318. ) and
  1319. (st.defowner.owner.symtabletype in [globalsymtable,staticsymtable]) and
  1320. st.defowner.owner.iscurrentunit then
  1321. topclassh:=tobjectdef(st.defowner)
  1322. else
  1323. begin
  1324. if assigned(current_procinfo) then
  1325. topclassh:=current_procinfo.procdef._class
  1326. else
  1327. topclassh:=nil;
  1328. end;
  1329. { link all procedures which have the same # of parameters }
  1330. for j:=1 to sym.procdef_count do
  1331. begin
  1332. pd:=sym.procdef[j];
  1333. { Is the procdef visible? This needs to be checked on
  1334. procdef level since a symbol can contain both private and
  1335. public declarations. But the check should not be done
  1336. when the callnode is generated by a property
  1337. inherited overrides invisible anonymous inherited (FK) }
  1338. if isprop or ignorevis or
  1339. (pd.owner.symtabletype<>objectsymtable) or
  1340. pd.is_visible_for_object(topclassh) then
  1341. begin
  1342. { we have at least one procedure that is visible }
  1343. inc(FProcvisiblecnt);
  1344. { only when the # of parameter are supported by the
  1345. procedure }
  1346. if (FParalength>=pd.minparacount) and
  1347. ((po_varargs in pd.procoptions) or { varargs }
  1348. (FParalength<=pd.maxparacount)) then
  1349. proc_add(pd);
  1350. end;
  1351. end;
  1352. { remember if the procedure is declared with the overload directive,
  1353. it's information is still needed also after all procs are removed }
  1354. has_overload_directive:=(po_overload in sym.first_procdef.procoptions);
  1355. { when the definition has overload directive set, we search for
  1356. overloaded definitions in the symtablestack. The found
  1357. entries are only added to the procs list and not the procsym, because
  1358. the list can change in every situation }
  1359. if has_overload_directive and
  1360. (sym.owner.symtabletype<>objectsymtable) then
  1361. begin
  1362. srsymtable:=sym.owner.next;
  1363. while assigned(srsymtable) do
  1364. begin
  1365. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1366. begin
  1367. srprocsym:=tprocsym(srsymtable.speedsearch(sym.name,sym.speedvalue));
  1368. if assigned(srprocsym) and
  1369. (srprocsym.typ=procsym) then
  1370. begin
  1371. { if this visible procedure doesn't have overload we can stop
  1372. searching }
  1373. if not(po_overload in srprocsym.first_procdef.procoptions) and
  1374. srprocsym.first_procdef.is_visible_for_object(topclassh) then
  1375. break;
  1376. { process all overloaded definitions }
  1377. for j:=1 to srprocsym.procdef_count do
  1378. begin
  1379. pd:=srprocsym.procdef[j];
  1380. { only visible procedures need to be added }
  1381. if pd.is_visible_for_object(topclassh) then
  1382. begin
  1383. { only when the # of parameter are supported by the
  1384. procedure }
  1385. if (FParalength>=pd.minparacount) and
  1386. ((po_varargs in pd.procoptions) or { varargs }
  1387. (FParalength<=pd.maxparacount)) then
  1388. begin
  1389. found:=false;
  1390. hp:=FProcs;
  1391. while assigned(hp) do
  1392. begin
  1393. { Only compare visible parameters for the user }
  1394. if compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1395. begin
  1396. found:=true;
  1397. break;
  1398. end;
  1399. hp:=hp^.next;
  1400. end;
  1401. if not found then
  1402. proc_add(pd);
  1403. end;
  1404. end;
  1405. end;
  1406. end;
  1407. end;
  1408. srsymtable:=srsymtable.next;
  1409. end;
  1410. end;
  1411. end;
  1412. constructor tcallcandidates.create_operator(op:ttoken;ppn:tnode);
  1413. var
  1414. j : integer;
  1415. pd : tprocdef;
  1416. hp : pcandidate;
  1417. found : boolean;
  1418. srsymtable : tsymtable;
  1419. srprocsym : tprocsym;
  1420. pt : tcallparanode;
  1421. sv : cardinal;
  1422. begin
  1423. FProcSym:=nil;
  1424. FProcs:=nil;
  1425. FProccnt:=0;
  1426. FProcvisiblecnt:=0;
  1427. FParanode:=ppn;
  1428. FAllowVariant:=false;
  1429. { determine length of parameter list }
  1430. pt:=tcallparanode(ppn);
  1431. FParalength:=0;
  1432. while assigned(pt) do
  1433. begin
  1434. if pt.resulttype.def.deftype=variantdef then
  1435. FAllowVariant:=true;
  1436. inc(FParalength);
  1437. pt:=tcallparanode(pt.right);
  1438. end;
  1439. { we search all overloaded operator definitions in the symtablestack. The found
  1440. entries are only added to the procs list and not the procsym, because
  1441. the list can change in every situation }
  1442. sv:=getspeedvalue(overloaded_names[op]);
  1443. srsymtable:=symtablestack;
  1444. while assigned(srsymtable) do
  1445. begin
  1446. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1447. begin
  1448. srprocsym:=tprocsym(srsymtable.speedsearch(overloaded_names[op],sv));
  1449. if assigned(srprocsym) and
  1450. (srprocsym.typ=procsym) then
  1451. begin
  1452. { Store first procsym found }
  1453. if not assigned(FProcsym) then
  1454. FProcsym:=srprocsym;
  1455. { process all overloaded definitions }
  1456. for j:=1 to srprocsym.procdef_count do
  1457. begin
  1458. pd:=srprocsym.procdef[j];
  1459. { only when the # of parameter are supported by the
  1460. procedure }
  1461. if (FParalength>=pd.minparacount) and
  1462. (FParalength<=pd.maxparacount) then
  1463. begin
  1464. found:=false;
  1465. hp:=FProcs;
  1466. while assigned(hp) do
  1467. begin
  1468. { Only compare visible parameters for the user }
  1469. if compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal then
  1470. begin
  1471. found:=true;
  1472. break;
  1473. end;
  1474. hp:=hp^.next;
  1475. end;
  1476. if not found then
  1477. proc_add(pd);
  1478. end;
  1479. end;
  1480. end;
  1481. end;
  1482. srsymtable:=srsymtable.next;
  1483. end;
  1484. end;
  1485. destructor tcallcandidates.destroy;
  1486. var
  1487. hpnext,
  1488. hp : pcandidate;
  1489. begin
  1490. hp:=FProcs;
  1491. while assigned(hp) do
  1492. begin
  1493. hpnext:=hp^.next;
  1494. dispose(hp);
  1495. hp:=hpnext;
  1496. end;
  1497. end;
  1498. function tcallcandidates.proc_add(pd:tprocdef):pcandidate;
  1499. var
  1500. defaultparacnt : integer;
  1501. begin
  1502. { generate new candidate entry }
  1503. new(result);
  1504. fillchar(result^,sizeof(tcandidate),0);
  1505. result^.data:=pd;
  1506. result^.next:=FProcs;
  1507. FProcs:=result;
  1508. inc(FProccnt);
  1509. { Find last parameter, skip all default parameters
  1510. that are not passed. Ignore this skipping for varargs }
  1511. result^.firstparaidx:=pd.paras.count-1;
  1512. if not(po_varargs in pd.procoptions) then
  1513. begin
  1514. { ignore hidden parameters }
  1515. while (result^.firstparaidx>=0) and (vo_is_hidden_para in tparavarsym(pd.paras[result^.firstparaidx]).varoptions) do
  1516. dec(result^.firstparaidx);
  1517. defaultparacnt:=pd.maxparacount-FParalength;
  1518. if defaultparacnt>0 then
  1519. begin
  1520. if defaultparacnt>result^.firstparaidx+1 then
  1521. internalerror(200401141);
  1522. dec(result^.firstparaidx,defaultparacnt);
  1523. end;
  1524. end;
  1525. end;
  1526. procedure tcallcandidates.list(all:boolean);
  1527. var
  1528. hp : pcandidate;
  1529. begin
  1530. hp:=FProcs;
  1531. while assigned(hp) do
  1532. begin
  1533. if all or
  1534. (not hp^.invalid) then
  1535. MessagePos1(hp^.data.fileinfo,sym_h_param_list,hp^.data.fullprocname(false));
  1536. hp:=hp^.next;
  1537. end;
  1538. end;
  1539. {$ifdef EXTDEBUG}
  1540. procedure tcallcandidates.dump_info(lvl:longint);
  1541. function ParaTreeStr(p:tcallparanode):string;
  1542. begin
  1543. result:='';
  1544. while assigned(p) do
  1545. begin
  1546. if result<>'' then
  1547. result:=','+result;
  1548. result:=p.resulttype.def.typename+result;
  1549. p:=tcallparanode(p.right);
  1550. end;
  1551. end;
  1552. var
  1553. hp : pcandidate;
  1554. i : integer;
  1555. currpara : tparavarsym;
  1556. begin
  1557. if not CheckVerbosity(lvl) then
  1558. exit;
  1559. Comment(lvl+V_LineInfo,'Overloaded callnode: '+FProcSym.name+'('+ParaTreeStr(tcallparanode(FParaNode))+')');
  1560. hp:=FProcs;
  1561. while assigned(hp) do
  1562. begin
  1563. Comment(lvl,' '+hp^.data.fullprocname(false));
  1564. if (hp^.invalid) then
  1565. Comment(lvl,' invalid')
  1566. else
  1567. begin
  1568. Comment(lvl,' ex: '+tostr(hp^.exact_count)+
  1569. ' eq: '+tostr(hp^.equal_count)+
  1570. ' l1: '+tostr(hp^.cl1_count)+
  1571. ' l2: '+tostr(hp^.cl2_count)+
  1572. ' l3: '+tostr(hp^.cl3_count)+
  1573. ' oper: '+tostr(hp^.coper_count)+
  1574. ' ord: '+realtostr(hp^.ordinal_distance));
  1575. { Print parameters in left-right order }
  1576. for i:=0 to hp^.data.paras.count-1 do
  1577. begin
  1578. currpara:=tparavarsym(hp^.data.paras[i]);
  1579. if (vo_is_hidden_para in currpara.varoptions) then
  1580. Comment(lvl,' - '+currpara.vartype.def.typename+' : '+EqualTypeName[currpara.eqval]);
  1581. end;
  1582. end;
  1583. hp:=hp^.next;
  1584. end;
  1585. end;
  1586. {$endif EXTDEBUG}
  1587. procedure tcallcandidates.get_information;
  1588. var
  1589. hp : pcandidate;
  1590. currpara : tparavarsym;
  1591. paraidx : integer;
  1592. currparanr : byte;
  1593. rfh,rth : bestreal;
  1594. def_from,
  1595. def_to : tdef;
  1596. currpt,
  1597. pt : tcallparanode;
  1598. eq : tequaltype;
  1599. convtype : tconverttype;
  1600. pdoper : tprocdef;
  1601. releasecurrpt : boolean;
  1602. cdoptions : tcompare_defs_options;
  1603. begin
  1604. cdoptions:=[cdo_check_operator];
  1605. if FAllowVariant then
  1606. include(cdoptions,cdo_allow_variant);
  1607. { process all procs }
  1608. hp:=FProcs;
  1609. while assigned(hp) do
  1610. begin
  1611. { We compare parameters in reverse order (right to left),
  1612. the firstpara is already pointing to the last parameter
  1613. were we need to start comparing }
  1614. currparanr:=FParalength;
  1615. paraidx:=hp^.firstparaidx;
  1616. while (paraidx>=0) and (vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions) do
  1617. dec(paraidx);
  1618. pt:=tcallparanode(FParaNode);
  1619. while assigned(pt) and (paraidx>=0) do
  1620. begin
  1621. currpara:=tparavarsym(hp^.data.paras[paraidx]);
  1622. { currpt can be changed from loadn to calln when a procvar
  1623. is passed. This is to prevent that the change is permanent }
  1624. currpt:=pt;
  1625. releasecurrpt:=false;
  1626. { retrieve current parameter definitions to compares }
  1627. eq:=te_incompatible;
  1628. def_from:=currpt.resulttype.def;
  1629. def_to:=currpara.vartype.def;
  1630. if not(assigned(def_from)) then
  1631. internalerror(200212091);
  1632. if not(
  1633. assigned(def_to) or
  1634. ((po_varargs in hp^.data.procoptions) and
  1635. (currparanr>hp^.data.minparacount))
  1636. ) then
  1637. internalerror(200212092);
  1638. { Convert tp procvars when not expecting a procvar }
  1639. if (def_to.deftype<>procvardef) and
  1640. (currpt.left.resulttype.def.deftype=procvardef) then
  1641. begin
  1642. releasecurrpt:=true;
  1643. currpt:=tcallparanode(pt.getcopy);
  1644. if maybe_call_procvar(currpt.left,true) then
  1645. begin
  1646. currpt.resulttype:=currpt.left.resulttype;
  1647. def_from:=currpt.left.resulttype.def;
  1648. end;
  1649. end;
  1650. { varargs are always equal, but not exact }
  1651. if (po_varargs in hp^.data.procoptions) and
  1652. (currparanr>hp^.data.minparacount) then
  1653. begin
  1654. eq:=te_equal;
  1655. end
  1656. else
  1657. { same definition -> exact }
  1658. if (def_from=def_to) then
  1659. begin
  1660. eq:=te_exact;
  1661. end
  1662. else
  1663. { for value and const parameters check if a integer is constant or
  1664. included in other integer -> equal and calc ordinal_distance }
  1665. if not(currpara.varspez in [vs_var,vs_out]) and
  1666. is_integer(def_from) and
  1667. is_integer(def_to) and
  1668. is_in_limit(def_from,def_to) then
  1669. begin
  1670. eq:=te_equal;
  1671. hp^.ordinal_distance:=hp^.ordinal_distance+
  1672. abs(bestreal(torddef(def_from).low)-bestreal(torddef(def_to).low));
  1673. if (torddef(def_to).typ=u64bit) then
  1674. rth:=bestreal(qword(torddef(def_to).high))
  1675. else
  1676. rth:=bestreal(torddef(def_to).high);
  1677. if (torddef(def_from).typ=u64bit) then
  1678. rfh:=bestreal(qword(torddef(def_from).high))
  1679. else
  1680. rfh:=bestreal(torddef(def_from).high);
  1681. hp^.ordinal_distance:=hp^.ordinal_distance+abs(rth-rfh);
  1682. { Give wrong sign a small penalty, this is need to get a diffrence
  1683. from word->[longword,longint] }
  1684. if is_signed(def_from)<>is_signed(def_to) then
  1685. hp^.ordinal_distance:=hp^.ordinal_distance+1.0;
  1686. end
  1687. else
  1688. { for value and const parameters check precision of real, give
  1689. penalty for loosing of precision }
  1690. if not(currpara.varspez in [vs_var,vs_out]) and
  1691. is_real(def_from) and
  1692. is_real(def_to) then
  1693. begin
  1694. eq:=te_equal;
  1695. if is_extended(def_to) then
  1696. rth:=bestreal(4)
  1697. else
  1698. if is_double (def_to) then
  1699. rth:=bestreal(2)
  1700. else
  1701. rth:=bestreal(1);
  1702. if is_extended(def_from) then
  1703. rfh:=bestreal(4)
  1704. else
  1705. if is_double (def_from) then
  1706. rfh:=bestreal(2)
  1707. else
  1708. rfh:=bestreal(1);
  1709. { penalty for shrinking of precision }
  1710. if rth<rfh then
  1711. rfh:=(rfh-rth)*16
  1712. else
  1713. rfh:=rth-rfh;
  1714. hp^.ordinal_distance:=hp^.ordinal_distance+rfh;
  1715. end
  1716. else
  1717. { generic type comparision }
  1718. begin
  1719. eq:=compare_defs_ext(def_from,def_to,currpt.left.nodetype,convtype,pdoper,cdoptions);
  1720. { when the types are not equal we need to check
  1721. some special case for parameter passing }
  1722. if (eq<te_equal) then
  1723. begin
  1724. if currpara.varspez in [vs_var,vs_out] then
  1725. begin
  1726. { para requires an equal type so the previous found
  1727. match was not good enough, reset to incompatible }
  1728. eq:=te_incompatible;
  1729. { var_para_allowed will return te_equal and te_convert_l1 to
  1730. make a difference for best matching }
  1731. var_para_allowed(eq,currpt.resulttype.def,currpara.vartype.def)
  1732. end
  1733. else
  1734. para_allowed(eq,currpt,def_to);
  1735. end;
  1736. end;
  1737. { when a procvar was changed to a call an exact much is
  1738. downgraded to equal. This way an overload call with the
  1739. procvar is choosen. See tb0471 (PFV) }
  1740. if (pt<>currpt) and (eq=te_exact) then
  1741. eq:=te_equal;
  1742. { increase correct counter }
  1743. case eq of
  1744. te_exact :
  1745. inc(hp^.exact_count);
  1746. te_equal :
  1747. inc(hp^.equal_count);
  1748. te_convert_l1 :
  1749. inc(hp^.cl1_count);
  1750. te_convert_l2 :
  1751. inc(hp^.cl2_count);
  1752. te_convert_l3 :
  1753. inc(hp^.cl3_count);
  1754. te_convert_operator :
  1755. inc(hp^.coper_count);
  1756. te_incompatible :
  1757. hp^.invalid:=true;
  1758. else
  1759. internalerror(200212072);
  1760. end;
  1761. { stop checking when an incompatible parameter is found }
  1762. if hp^.invalid then
  1763. begin
  1764. { store the current parameter info for
  1765. a nice error message when no procedure is found }
  1766. hp^.wrongparaidx:=paraidx;
  1767. hp^.wrongparanr:=currparanr;
  1768. break;
  1769. end;
  1770. {$ifdef EXTDEBUG}
  1771. { store equal in node tree for dump }
  1772. currpara.eqval:=eq;
  1773. {$endif EXTDEBUG}
  1774. { maybe release temp currpt }
  1775. if releasecurrpt then
  1776. currpt.free;
  1777. { next parameter in the call tree }
  1778. pt:=tcallparanode(pt.right);
  1779. { next parameter for definition, only goto next para
  1780. if we're out of the varargs }
  1781. if not(po_varargs in hp^.data.procoptions) or
  1782. (currparanr<=hp^.data.maxparacount) then
  1783. begin
  1784. { Ignore vs_hidden parameters }
  1785. repeat
  1786. dec(paraidx);
  1787. until (paraidx<0) or not(vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions);
  1788. end;
  1789. dec(currparanr);
  1790. end;
  1791. if not(hp^.invalid) and
  1792. (assigned(pt) or (paraidx>=0) or (currparanr<>0)) then
  1793. internalerror(200212141);
  1794. { next candidate }
  1795. hp:=hp^.next;
  1796. end;
  1797. end;
  1798. function is_better_candidate(currpd,bestpd:pcandidate):integer;
  1799. var
  1800. res : integer;
  1801. begin
  1802. {
  1803. Return values:
  1804. > 0 when currpd is better than bestpd
  1805. < 0 when bestpd is better than currpd
  1806. = 0 when both are equal
  1807. To choose the best candidate we use the following order:
  1808. - Incompatible flag
  1809. - (Smaller) Number of convert operator parameters.
  1810. - (Smaller) Number of convertlevel 2 parameters.
  1811. - (Smaller) Number of convertlevel 1 parameters.
  1812. - (Bigger) Number of exact parameters.
  1813. - (Smaller) Number of equal parameters.
  1814. - (Smaller) Total of ordinal distance. For example, the distance of a word
  1815. to a byte is 65535-255=65280.
  1816. }
  1817. if bestpd^.invalid then
  1818. begin
  1819. if currpd^.invalid then
  1820. res:=0
  1821. else
  1822. res:=1;
  1823. end
  1824. else
  1825. if currpd^.invalid then
  1826. res:=-1
  1827. else
  1828. begin
  1829. { less operator parameters? }
  1830. res:=(bestpd^.coper_count-currpd^.coper_count);
  1831. if (res=0) then
  1832. begin
  1833. { less cl3 parameters? }
  1834. res:=(bestpd^.cl3_count-currpd^.cl3_count);
  1835. if (res=0) then
  1836. begin
  1837. { less cl2 parameters? }
  1838. res:=(bestpd^.cl2_count-currpd^.cl2_count);
  1839. if (res=0) then
  1840. begin
  1841. { less cl1 parameters? }
  1842. res:=(bestpd^.cl1_count-currpd^.cl1_count);
  1843. if (res=0) then
  1844. begin
  1845. { more exact parameters? }
  1846. res:=(currpd^.exact_count-bestpd^.exact_count);
  1847. if (res=0) then
  1848. begin
  1849. { less equal parameters? }
  1850. res:=(bestpd^.equal_count-currpd^.equal_count);
  1851. if (res=0) then
  1852. begin
  1853. { smaller ordinal distance? }
  1854. if (currpd^.ordinal_distance<bestpd^.ordinal_distance) then
  1855. res:=1
  1856. else
  1857. if (currpd^.ordinal_distance>bestpd^.ordinal_distance) then
  1858. res:=-1
  1859. else
  1860. res:=0;
  1861. end;
  1862. end;
  1863. end;
  1864. end;
  1865. end;
  1866. end;
  1867. end;
  1868. is_better_candidate:=res;
  1869. end;
  1870. function tcallcandidates.choose_best(var bestpd:tabstractprocdef):integer;
  1871. var
  1872. besthpstart,
  1873. hp : pcandidate;
  1874. cntpd,
  1875. res : integer;
  1876. begin
  1877. {
  1878. Returns the number of candidates left and the
  1879. first candidate is returned in pdbest
  1880. }
  1881. { Setup the first procdef as best, only count it as a result
  1882. when it is valid }
  1883. bestpd:=FProcs^.data;
  1884. if FProcs^.invalid then
  1885. cntpd:=0
  1886. else
  1887. cntpd:=1;
  1888. if assigned(FProcs^.next) then
  1889. begin
  1890. besthpstart:=FProcs;
  1891. hp:=FProcs^.next;
  1892. while assigned(hp) do
  1893. begin
  1894. res:=is_better_candidate(hp,besthpstart);
  1895. if (res>0) then
  1896. begin
  1897. { hp is better, flag all procs to be incompatible }
  1898. while (besthpstart<>hp) do
  1899. begin
  1900. besthpstart^.invalid:=true;
  1901. besthpstart:=besthpstart^.next;
  1902. end;
  1903. { besthpstart is already set to hp }
  1904. bestpd:=besthpstart^.data;
  1905. cntpd:=1;
  1906. end
  1907. else
  1908. if (res<0) then
  1909. begin
  1910. { besthpstart is better, flag current hp to be incompatible }
  1911. hp^.invalid:=true;
  1912. end
  1913. else
  1914. begin
  1915. { res=0, both are valid }
  1916. if not hp^.invalid then
  1917. inc(cntpd);
  1918. end;
  1919. hp:=hp^.next;
  1920. end;
  1921. end;
  1922. result:=cntpd;
  1923. end;
  1924. procedure tcallcandidates.find_wrong_para;
  1925. var
  1926. currparanr : smallint;
  1927. hp : pcandidate;
  1928. pt : tcallparanode;
  1929. wrongpara : tparavarsym;
  1930. begin
  1931. { Only process the first overloaded procdef }
  1932. hp:=FProcs;
  1933. { Find callparanode corresponding to the argument }
  1934. pt:=tcallparanode(FParanode);
  1935. currparanr:=FParalength;
  1936. while assigned(pt) and
  1937. (currparanr>hp^.wrongparanr) do
  1938. begin
  1939. pt:=tcallparanode(pt.right);
  1940. dec(currparanr);
  1941. end;
  1942. if (currparanr<>hp^.wrongparanr) or
  1943. not assigned(pt) then
  1944. internalerror(200212094);
  1945. { Show error message, when it was a var or out parameter
  1946. guess that it is a missing typeconv }
  1947. wrongpara:=tparavarsym(hp^.data.paras[hp^.wrongparaidx]);
  1948. if wrongpara.varspez in [vs_var,vs_out] then
  1949. begin
  1950. { Maybe passing the correct type but passing a const to var parameter }
  1951. if (compare_defs(pt.resulttype.def,wrongpara.vartype.def,pt.nodetype)<>te_incompatible) and
  1952. not valid_for_var(pt.left) then
  1953. CGMessagePos(pt.left.fileinfo,type_e_variable_id_expected)
  1954. else
  1955. CGMessagePos2(pt.left.fileinfo,parser_e_call_by_ref_without_typeconv,
  1956. FullTypeName(pt.left.resulttype.def,wrongpara.vartype.def),
  1957. FullTypeName(wrongpara.vartype.def,pt.left.resulttype.def))
  1958. end
  1959. else
  1960. CGMessagePos3(pt.left.fileinfo,type_e_wrong_parameter_type,tostr(hp^.wrongparanr),
  1961. FullTypeName(pt.left.resulttype.def,wrongpara.vartype.def),
  1962. FullTypeName(wrongpara.vartype.def,pt.left.resulttype.def));
  1963. end;
  1964. end.