htypechk.pas 80 KB

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