htypechk.pas 114 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930
  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. cclasses,tokens,cpuinfo,
  22. node,globtype,
  23. symconst,symtype,symdef,symsym,symbase;
  24. type
  25. Ttok2nodeRec=record
  26. tok : ttoken;
  27. nod : tnodetype;
  28. inr : integer; // inline number
  29. op_overloading_supported : boolean;
  30. end;
  31. pcandidate = ^tcandidate;
  32. tcandidate = record
  33. next : pcandidate;
  34. data : tprocdef;
  35. wrongparaidx,
  36. firstparaidx : integer;
  37. exact_count,
  38. equal_count,
  39. cl1_count,
  40. cl2_count,
  41. cl3_count,
  42. cl4_count,
  43. cl5_count,
  44. coper_count : integer; { should be signed }
  45. ordinal_distance : double;
  46. invalid : boolean;
  47. wrongparanr : byte;
  48. end;
  49. tcallcandidates = class
  50. private
  51. FProcsym : tprocsym;
  52. FProcsymtable : tsymtable;
  53. FOperator : ttoken;
  54. FCandidateProcs : pcandidate;
  55. FProcCnt : integer;
  56. FParaNode : tnode;
  57. FParaLength : smallint;
  58. FAllowVariant : boolean;
  59. procedure collect_overloads_in_struct(structdef:tabstractrecorddef;ProcdefOverloadList:TFPObjectList;searchhelpers:boolean);
  60. procedure collect_overloads_in_units(ProcdefOverloadList:TFPObjectList; objcidcall,explicitunit: boolean);
  61. procedure create_candidate_list(ignorevisibility,allowdefaultparas,objcidcall,explicitunit,searchhelpers:boolean);
  62. function proc_add(st:tsymtable;pd:tprocdef;objcidcall: boolean):pcandidate;
  63. public
  64. constructor create(sym:tprocsym;st:TSymtable;ppn:tnode;ignorevisibility,allowdefaultparas,objcidcall,explicitunit,searchhelpers:boolean);
  65. constructor create_operator(op:ttoken;ppn:tnode);
  66. destructor destroy;override;
  67. procedure list(all:boolean);
  68. {$ifdef EXTDEBUG}
  69. procedure dump_info(lvl:longint);
  70. {$endif EXTDEBUG}
  71. procedure get_information;
  72. function choose_best(var bestpd:tabstractprocdef; singlevariant: boolean):integer;
  73. procedure find_wrong_para;
  74. property Count:integer read FProcCnt;
  75. end;
  76. type
  77. tregableinfoflag = (
  78. // can be put in a register if it's the address of a var/out/const parameter
  79. ra_addr_regable,
  80. // orthogonal to above flag: the address of the node is taken and may
  81. // possibly escape the block in which this node is declared (e.g. a
  82. // local variable is passed as var parameter to another procedure)
  83. ra_addr_taken);
  84. tregableinfoflags = set of tregableinfoflag;
  85. {$i compinnr.inc}
  86. const
  87. tok2nodes=27;
  88. tok2node:array[1..tok2nodes] of ttok2noderec=(
  89. (tok:_PLUS ;nod:addn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  90. (tok:_MINUS ;nod:subn;inr:-1;op_overloading_supported:true), { binary and unary overloading supported }
  91. (tok:_STAR ;nod:muln;inr:-1;op_overloading_supported:true), { binary overloading supported }
  92. (tok:_SLASH ;nod:slashn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  93. (tok:_EQ ;nod:equaln;inr:-1;op_overloading_supported:true), { binary overloading supported }
  94. (tok:_GT ;nod:gtn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  95. (tok:_LT ;nod:ltn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  96. (tok:_GTE ;nod:gten;inr:-1;op_overloading_supported:true), { binary overloading supported }
  97. (tok:_LTE ;nod:lten;inr:-1;op_overloading_supported:true), { binary overloading supported }
  98. (tok:_SYMDIF ;nod:symdifn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  99. (tok:_STARSTAR ;nod:starstarn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  100. (tok:_OP_AS ;nod:asn;inr:-1;op_overloading_supported:false), { binary overloading NOT supported }
  101. (tok:_OP_IN ;nod:inn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  102. (tok:_OP_IS ;nod:isn;inr:-1;op_overloading_supported:false), { binary overloading NOT supported }
  103. (tok:_OP_OR ;nod:orn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  104. (tok:_OP_AND ;nod:andn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  105. (tok:_OP_DIV ;nod:divn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  106. (tok:_OP_NOT ;nod:notn;inr:-1;op_overloading_supported:true), { unary overloading supported }
  107. (tok:_OP_MOD ;nod:modn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  108. (tok:_OP_SHL ;nod:shln;inr:-1;op_overloading_supported:true), { binary overloading supported }
  109. (tok:_OP_SHR ;nod:shrn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  110. (tok:_OP_XOR ;nod:xorn;inr:-1;op_overloading_supported:true), { binary overloading supported }
  111. (tok:_ASSIGNMENT ;nod:assignn;inr:-1;op_overloading_supported:true), { unary overloading supported }
  112. (tok:_OP_EXPLICIT;nod:assignn;inr:-1;op_overloading_supported:true), { unary overloading supported }
  113. (tok:_NE ;nod:unequaln;inr:-1;op_overloading_supported:true), { binary overloading supported }
  114. (tok:_OP_INC ;nod:inlinen;inr:in_inc_x;op_overloading_supported:true),{ unary overloading supported }
  115. (tok:_OP_DEC ;nod:inlinen;inr:in_dec_x;op_overloading_supported:true) { unary overloading supported }
  116. );
  117. { true, if we are parsing stuff which allows array constructors }
  118. allow_array_constructor : boolean = false;
  119. function node2opstr(nt:tnodetype):string;
  120. { check operator args and result type }
  121. function isbinaryoperatoroverloadable(treetyp:tnodetype;ld:tdef;lt:tnodetype;rd:tdef;rt:tnodetype) : boolean;
  122. function isoperatoracceptable(pf : tprocdef; optoken : ttoken) : boolean;
  123. function isunaryoverloaded(var t : tnode) : boolean;
  124. function isbinaryoverloaded(var t : tnode) : boolean;
  125. { Register Allocation }
  126. procedure make_not_regable(p : tnode; how: tregableinfoflags);
  127. { procvar handling }
  128. function is_proc2procvar_load(p:tnode;out realprocdef:tprocdef):boolean;
  129. { returns whether a node represents a load of the function result node via
  130. the function name (so it could also be a recursive call to the function
  131. in case there or no parameters, or the function could be passed as
  132. procvar }
  133. function is_ambiguous_funcret_load(p: tnode; out owningprocdef: tprocdef): boolean;
  134. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  135. { sets varsym varstate field correctly }
  136. type
  137. tvarstateflag = (vsf_must_be_valid,vsf_use_hints);
  138. tvarstateflags = set of tvarstateflag;
  139. procedure set_varstate(p:tnode;newstate:tvarstate;varstateflags:tvarstateflags);
  140. { sets the callunique flag, if the node is a vecn, }
  141. { takes care of type casts etc. }
  142. procedure set_unique(p : tnode);
  143. function valid_for_formal_var(p : tnode; report_errors: boolean) : boolean;
  144. function valid_for_formal_const(p : tnode; report_errors: boolean) : boolean;
  145. function valid_for_var(p:tnode; report_errors: boolean):boolean;
  146. function valid_for_assignment(p:tnode; report_errors: boolean):boolean;
  147. function valid_for_loopvar(p:tnode; report_errors: boolean):boolean;
  148. function valid_for_addr(p : tnode; report_errors: boolean) : boolean;
  149. function allowenumop(nt:tnodetype):boolean;
  150. procedure check_hints(const srsym: tsym; const symoptions: tsymoptions; const deprecatedmsg : pshortstring);
  151. procedure check_ranges(const location: tfileposinfo; source: tnode; destdef: tdef);
  152. implementation
  153. uses
  154. sysutils,
  155. systems,constexp,globals,
  156. cutils,verbose,
  157. symtable,
  158. defutil,defcmp,
  159. nbas,ncnv,nld,nmem,ncal,nmat,ninl,nutils,ncon,
  160. cgbase,procinfo
  161. ;
  162. type
  163. TValidAssign=(Valid_Property,Valid_Void,Valid_Const,Valid_Addr,Valid_Packed);
  164. TValidAssigns=set of TValidAssign;
  165. function node2opstr(nt:tnodetype):string;
  166. var
  167. i : integer;
  168. begin
  169. result:='<unknown>';
  170. for i:=1 to tok2nodes do
  171. if tok2node[i].nod=nt then
  172. begin
  173. result:=tokeninfo^[tok2node[i].tok].str;
  174. break;
  175. end;
  176. end;
  177. function isbinaryoperatoroverloadable(treetyp:tnodetype;ld:tdef;lt:tnodetype;rd:tdef;rt:tnodetype) : boolean;
  178. function internal_check(treetyp:tnodetype;ld:tdef;lt:tnodetype;rd:tdef;rt:tnodetype;var allowed:boolean):boolean;
  179. begin
  180. internal_check:=true;
  181. case ld.typ of
  182. formaldef,
  183. recorddef,
  184. variantdef :
  185. begin
  186. allowed:=true;
  187. end;
  188. procvardef :
  189. begin
  190. if (rd.typ in [pointerdef,procdef,procvardef]) then
  191. begin
  192. allowed:=false;
  193. exit;
  194. end;
  195. allowed:=true;
  196. end;
  197. pointerdef :
  198. begin
  199. if ((rd.typ in [orddef,enumdef,pointerdef,classrefdef,procvardef]) or
  200. is_implicit_pointer_object_type(rd)) then
  201. begin
  202. allowed:=false;
  203. exit;
  204. end;
  205. { don't allow pchar+string }
  206. if (is_pchar(ld) or is_pwidechar(ld)) and
  207. ((rd.typ=stringdef) or
  208. is_pchar(rd) or
  209. is_pwidechar(rd) or
  210. is_chararray(rd) or
  211. is_widechararray(rd)) then
  212. begin
  213. allowed:=false;
  214. exit;
  215. end;
  216. allowed:=true;
  217. end;
  218. arraydef :
  219. begin
  220. { not vector/mmx }
  221. if ((cs_mmx in current_settings.localswitches) and
  222. is_mmx_able_array(ld)) or
  223. ((cs_support_vectors in current_settings.globalswitches) and
  224. is_vector(ld)) then
  225. begin
  226. allowed:=false;
  227. exit;
  228. end;
  229. { not chararray+[(wide)char,(wide)string,(wide)chararray] }
  230. if (is_chararray(ld) or is_widechararray(ld) or
  231. is_open_chararray(ld) or is_open_widechararray(ld))
  232. and
  233. ((rd.typ in [stringdef,orddef,enumdef]) or
  234. is_pchar(rd) or
  235. is_pwidechar(rd) or
  236. is_chararray(rd) or
  237. is_widechararray(rd) or
  238. is_open_chararray(rd) or
  239. is_open_widechararray(rd) or
  240. (rt=niln)) then
  241. begin
  242. allowed:=false;
  243. exit;
  244. end;
  245. { dynamic array compare with niln }
  246. if ((is_dynamic_array(ld) and
  247. (rt=niln)) or
  248. (is_dynamic_array(ld) and is_dynamic_array(rd)))
  249. and
  250. (treetyp in [equaln,unequaln]) then
  251. begin
  252. allowed:=false;
  253. exit;
  254. end;
  255. allowed:=true;
  256. end;
  257. objectdef :
  258. begin
  259. { <> and = are defined for implicit pointer object types }
  260. if (treetyp in [equaln,unequaln]) and
  261. is_implicit_pointer_object_type(ld) then
  262. begin
  263. allowed:=false;
  264. exit;
  265. end;
  266. allowed:=true;
  267. end;
  268. stringdef :
  269. begin
  270. if (rd.typ in [orddef,enumdef,stringdef]) or
  271. is_pchar(rd) or
  272. is_pwidechar(rd) or
  273. is_chararray(rd) or
  274. is_widechararray(rd) or
  275. is_open_chararray(rd) or
  276. is_open_widechararray(rd) then
  277. begin
  278. allowed:=false;
  279. exit;
  280. end;
  281. allowed:=true;
  282. end;
  283. else
  284. internal_check:=false;
  285. end;
  286. end;
  287. var
  288. allowed : boolean;
  289. begin
  290. { power ** is always possible }
  291. if (treetyp=starstarn) then
  292. begin
  293. isbinaryoperatoroverloadable:=true;
  294. exit;
  295. end;
  296. { order of arguments does not matter so we have to check also
  297. the reversed order }
  298. allowed:=false;
  299. if not internal_check(treetyp,ld,lt,rd,rt,allowed) then
  300. internal_check(treetyp,rd,rt,ld,lt,allowed);
  301. isbinaryoperatoroverloadable:=allowed;
  302. end;
  303. function isunaryoperatoroverloadable(treetyp:tnodetype;inlinenumber:integer;ld:tdef) : boolean;
  304. begin
  305. result:=false;
  306. case treetyp of
  307. subn,
  308. addn,
  309. unaryminusn,
  310. unaryplusn,
  311. inlinen:
  312. begin
  313. { only Inc, Dec inline functions are supported for now, so skip check inlinenumber }
  314. if (ld.typ in [orddef,enumdef,floatdef]) then
  315. exit;
  316. {$ifdef SUPPORT_MMX}
  317. if (cs_mmx in current_settings.localswitches) and
  318. is_mmx_able_array(ld) then
  319. exit;
  320. {$endif SUPPORT_MMX}
  321. result:=true;
  322. end;
  323. notn :
  324. begin
  325. if (ld.typ in [orddef,enumdef,floatdef]) then
  326. exit;
  327. {$ifdef SUPPORT_MMX}
  328. if (cs_mmx in current_settings.localswitches) and
  329. is_mmx_able_array(ld) then
  330. exit;
  331. {$endif SUPPORT_MMX}
  332. result:=true;
  333. end;
  334. end;
  335. end;
  336. function isoperatoracceptable(pf : tprocdef; optoken : ttoken) : boolean;
  337. var
  338. ld,rd : tdef;
  339. i : longint;
  340. eq : tequaltype;
  341. conv : tconverttype;
  342. pd : tprocdef;
  343. oldcount,
  344. count: longint;
  345. parasym : tparavarsym;
  346. begin
  347. result:=false;
  348. count := pf.parast.SymList.count;
  349. oldcount:=count;
  350. while count > 0 do
  351. begin
  352. parasym:=tparavarsym(pf.parast.SymList[count-1]);
  353. if is_boolean(parasym.vardef) then
  354. begin
  355. if parasym.name='RANGECHECK' then
  356. begin
  357. Include(parasym.varoptions, vo_is_hidden_para);
  358. Include(parasym.varoptions, vo_is_range_check);
  359. Dec(count);
  360. end
  361. else if parasym.name='OVERFLOWCHECK' then
  362. begin
  363. Include(parasym.varoptions, vo_is_hidden_para);
  364. Include(parasym.varoptions, vo_is_overflow_check);
  365. Dec(count);
  366. end
  367. else
  368. break;
  369. end
  370. else
  371. break;
  372. end;
  373. if count<>oldcount then
  374. pf.calcparas;
  375. case count of
  376. 1 : begin
  377. ld:=tparavarsym(pf.parast.SymList[0]).vardef;
  378. { assignment is a special case }
  379. if optoken in [_ASSIGNMENT,_OP_EXPLICIT] then
  380. begin
  381. eq:=compare_defs_ext(ld,pf.returndef,nothingn,conv,pd,[cdo_explicit]);
  382. result:=
  383. (eq=te_exact) or
  384. (
  385. (eq=te_incompatible) and
  386. { don't allow overloading assigning to custom shortstring
  387. types, because we also don't want to differentiate based
  388. on different shortstring types (e.g.,
  389. "operator :=(const v: variant) res: shorstring" also
  390. has to work for assigning a variant to a string[80])
  391. }
  392. (not is_shortstring(pf.returndef) or
  393. (tstringdef(pf.returndef).len=255))
  394. );
  395. end
  396. else
  397. { enumerator is a special case too }
  398. if optoken=_OP_ENUMERATOR then
  399. begin
  400. result:=
  401. is_class_or_interface_or_object(pf.returndef) or
  402. is_record(pf.returndef);
  403. if result then
  404. begin
  405. if not assigned(tabstractrecorddef(pf.returndef).search_enumerator_move) then
  406. begin
  407. Message1(sym_e_no_enumerator_move, pf.returndef.typename);
  408. result:=false;
  409. end;
  410. if not assigned(tabstractrecorddef(pf.returndef).search_enumerator_current) then
  411. begin
  412. Message1(sym_e_no_enumerator_current,pf.returndef.typename);
  413. result:=false;
  414. end;
  415. end;
  416. end
  417. else
  418. begin
  419. for i:=1 to tok2nodes do
  420. if tok2node[i].tok=optoken then
  421. begin
  422. result:=
  423. tok2node[i].op_overloading_supported and
  424. isunaryoperatoroverloadable(tok2node[i].nod,tok2node[i].inr,ld);
  425. break;
  426. end;
  427. { Inc, Dec operators are valid if only result type is the same as argument type }
  428. if result and (optoken in [_OP_INC,_OP_DEC]) then
  429. result:=pf.returndef=ld;
  430. end;
  431. end;
  432. 2 : begin
  433. for i:=1 to tok2nodes do
  434. if tok2node[i].tok=optoken then
  435. begin
  436. ld:=tparavarsym(pf.parast.SymList[0]).vardef;
  437. rd:=tparavarsym(pf.parast.SymList[1]).vardef;
  438. result:=
  439. tok2node[i].op_overloading_supported and
  440. isbinaryoperatoroverloadable(tok2node[i].nod,ld,nothingn,rd,nothingn);
  441. break;
  442. end;
  443. end;
  444. end;
  445. end;
  446. function isunaryoverloaded(var t : tnode) : boolean;
  447. var
  448. ld : tdef;
  449. optoken : ttoken;
  450. operpd : tprocdef;
  451. ppn : tcallparanode;
  452. candidates : tcallcandidates;
  453. cand_cnt,
  454. inlinenumber: integer;
  455. begin
  456. result:=false;
  457. operpd:=nil;
  458. { load easier access variables }
  459. ld:=tunarynode(t).left.resultdef;
  460. { if we are dealing with inline function then get the function }
  461. if t.nodetype=inlinen then
  462. inlinenumber:=tinlinenode(t).inlinenumber
  463. else
  464. inlinenumber:=-1;
  465. if not isunaryoperatoroverloadable(t.nodetype,inlinenumber,ld) then
  466. exit;
  467. { operator overload is possible }
  468. result:=true;
  469. optoken:=NOTOKEN;
  470. case t.nodetype of
  471. notn:
  472. optoken:=_OP_NOT;
  473. unaryminusn:
  474. optoken:=_MINUS;
  475. unaryplusn:
  476. optoken:=_PLUS;
  477. inlinen:
  478. case inlinenumber of
  479. in_inc_x:
  480. optoken:=_OP_INC;
  481. in_dec_x:
  482. optoken:=_OP_DEC;
  483. end;
  484. end;
  485. if (optoken=NOTOKEN) then
  486. begin
  487. CGMessage(parser_e_operator_not_overloaded);
  488. t:=cnothingnode.create;
  489. exit;
  490. end;
  491. { generate parameter nodes }
  492. { for inline nodes just copy existent callparanode }
  493. if (t.nodetype=inlinen) and (tinlinenode(t).left.nodetype=callparan) then
  494. ppn:=tcallparanode(tinlinenode(t).left.getcopy)
  495. else
  496. begin
  497. ppn:=ccallparanode.create(tunarynode(t).left.getcopy,nil);
  498. ppn.get_paratype;
  499. end;
  500. candidates:=tcallcandidates.create_operator(optoken,ppn);
  501. { stop when there are no operators found }
  502. if candidates.count=0 then
  503. begin
  504. CGMessage2(parser_e_operator_not_overloaded_2,ld.typename,arraytokeninfo[optoken].str);
  505. candidates.free;
  506. ppn.free;
  507. t:=cnothingnode.create;
  508. exit;
  509. end;
  510. { Retrieve information about the candidates }
  511. candidates.get_information;
  512. {$ifdef EXTDEBUG}
  513. { Display info when multiple candidates are found }
  514. candidates.dump_info(V_Debug);
  515. {$endif EXTDEBUG}
  516. cand_cnt:=candidates.choose_best(tabstractprocdef(operpd),false);
  517. { exit when no overloads are found }
  518. if cand_cnt=0 then
  519. begin
  520. CGMessage2(parser_e_operator_not_overloaded_2,ld.typename,arraytokeninfo[optoken].str);
  521. candidates.free;
  522. ppn.free;
  523. t:=cnothingnode.create;
  524. exit;
  525. end;
  526. { Multiple candidates left? }
  527. if cand_cnt>1 then
  528. begin
  529. CGMessage(type_e_cant_choose_overload_function);
  530. {$ifdef EXTDEBUG}
  531. candidates.dump_info(V_Hint);
  532. {$else EXTDEBUG}
  533. candidates.list(false);
  534. {$endif EXTDEBUG}
  535. { we'll just use the first candidate to make the
  536. call }
  537. end;
  538. candidates.free;
  539. addsymref(operpd.procsym);
  540. { the nil as symtable signs firstcalln that this is
  541. an overloaded operator }
  542. t:=ccallnode.create(ppn,Tprocsym(operpd.procsym),nil,nil,[]);
  543. { we already know the procdef to use, so it can
  544. skip the overload choosing in callnode.pass_typecheck }
  545. tcallnode(t).procdefinition:=operpd;
  546. end;
  547. function isbinaryoverloaded(var t : tnode) : boolean;
  548. var
  549. rd,ld : tdef;
  550. optoken : ttoken;
  551. operpd : tprocdef;
  552. ht : tnode;
  553. ppn : tcallparanode;
  554. cand_cnt : integer;
  555. function search_operator(optoken:ttoken;generror:boolean): integer;
  556. var
  557. candidates : tcallcandidates;
  558. begin
  559. { generate parameter nodes }
  560. ppn:=ccallparanode.create(tbinarynode(t).right.getcopy,ccallparanode.create(tbinarynode(t).left.getcopy,nil));
  561. ppn.get_paratype;
  562. candidates:=tcallcandidates.create_operator(optoken,ppn);
  563. { for commutative operators we can swap arguments and try again }
  564. if (candidates.count=0) and
  565. not(optoken in [_OP_SHL,_OP_SHR,_OP_DIV,_OP_MOD,_STARSTAR,_SLASH,_MINUS]) then
  566. begin
  567. candidates.free;
  568. reverseparameters(ppn);
  569. { reverse compare operators }
  570. case optoken of
  571. _LT:
  572. optoken:=_GTE;
  573. _GT:
  574. optoken:=_LTE;
  575. _LTE:
  576. optoken:=_GT;
  577. _GTE:
  578. optoken:=_LT;
  579. end;
  580. candidates:=tcallcandidates.create_operator(optoken,ppn);
  581. end;
  582. { stop when there are no operators found }
  583. result:=candidates.count;
  584. if (result=0) and generror then
  585. begin
  586. CGMessage(parser_e_operator_not_overloaded);
  587. candidates.free;
  588. exit;
  589. end;
  590. if (result>0) then
  591. begin
  592. { Retrieve information about the candidates }
  593. candidates.get_information;
  594. {$ifdef EXTDEBUG}
  595. { Display info when multiple candidates are found }
  596. candidates.dump_info(V_Debug);
  597. {$endif EXTDEBUG}
  598. result:=candidates.choose_best(tabstractprocdef(operpd),false);
  599. end;
  600. { exit when no overloads are found }
  601. if (result=0) and generror then
  602. begin
  603. CGMessage3(parser_e_operator_not_overloaded_3,ld.typename,arraytokeninfo[optoken].str,rd.typename);
  604. candidates.free;
  605. exit;
  606. end;
  607. { Multiple candidates left? }
  608. if result>1 then
  609. begin
  610. CGMessage(type_e_cant_choose_overload_function);
  611. {$ifdef EXTDEBUG}
  612. candidates.dump_info(V_Hint);
  613. {$else EXTDEBUG}
  614. candidates.list(false);
  615. {$endif EXTDEBUG}
  616. { we'll just use the first candidate to make the
  617. call }
  618. end;
  619. candidates.free;
  620. end;
  621. begin
  622. isbinaryoverloaded:=false;
  623. operpd:=nil;
  624. { load easier access variables }
  625. ld:=tbinarynode(t).left.resultdef;
  626. rd:=tbinarynode(t).right.resultdef;
  627. if not isbinaryoperatoroverloadable(t.nodetype,ld,tbinarynode(t).left.nodetype,rd,tbinarynode(t).right.nodetype) then
  628. exit;
  629. { operator overload is possible }
  630. result:=true;
  631. case t.nodetype of
  632. equaln:
  633. optoken:=_EQ;
  634. unequaln:
  635. optoken:=_NE;
  636. addn:
  637. optoken:=_PLUS;
  638. subn:
  639. optoken:=_MINUS;
  640. muln:
  641. optoken:=_STAR;
  642. starstarn:
  643. optoken:=_STARSTAR;
  644. slashn:
  645. optoken:=_SLASH;
  646. ltn:
  647. optoken:=_LT;
  648. gtn:
  649. optoken:=_GT;
  650. lten:
  651. optoken:=_LTE;
  652. gten:
  653. optoken:=_GTE;
  654. symdifn :
  655. optoken:=_SYMDIF;
  656. modn :
  657. optoken:=_OP_MOD;
  658. orn :
  659. optoken:=_OP_OR;
  660. xorn :
  661. optoken:=_OP_XOR;
  662. andn :
  663. optoken:=_OP_AND;
  664. divn :
  665. optoken:=_OP_DIV;
  666. shln :
  667. optoken:=_OP_SHL;
  668. shrn :
  669. optoken:=_OP_SHR;
  670. inn :
  671. optoken:=_OP_IN;
  672. else
  673. begin
  674. CGMessage(parser_e_operator_not_overloaded);
  675. t:=cnothingnode.create;
  676. exit;
  677. end;
  678. end;
  679. cand_cnt:=search_operator(optoken,optoken<>_NE);
  680. { no operator found for "<>" then search for "=" operator }
  681. if (cand_cnt=0) and (optoken=_NE) then
  682. begin
  683. ppn.free;
  684. operpd:=nil;
  685. optoken:=_EQ;
  686. cand_cnt:=search_operator(optoken,true);
  687. end;
  688. if (cand_cnt=0) then
  689. begin
  690. ppn.free;
  691. t:=cnothingnode.create;
  692. exit;
  693. end;
  694. addsymref(operpd.procsym);
  695. { the nil as symtable signs firstcalln that this is
  696. an overloaded operator }
  697. ht:=ccallnode.create(ppn,Tprocsym(operpd.procsym),nil,nil,[]);
  698. { we already know the procdef to use, so it can
  699. skip the overload choosing in callnode.pass_typecheck }
  700. tcallnode(ht).procdefinition:=operpd;
  701. { if we found "=" operator for "<>" expression then use it
  702. together with "not" }
  703. if (t.nodetype=unequaln) and (optoken=_EQ) then
  704. ht:=cnotnode.create(ht);
  705. t:=ht;
  706. end;
  707. {****************************************************************************
  708. Register Calculation
  709. ****************************************************************************}
  710. { marks an lvalue as "unregable" }
  711. procedure make_not_regable_intern(p : tnode; how: tregableinfoflags; records_only: boolean);
  712. begin
  713. repeat
  714. case p.nodetype of
  715. subscriptn:
  716. begin
  717. records_only:=true;
  718. p:=tsubscriptnode(p).left;
  719. end;
  720. vecn:
  721. begin
  722. { if there's an implicit dereference, we can stop (just like
  723. when there is an actual derefn) }
  724. if ((tvecnode(p).left.resultdef.typ=arraydef) and
  725. not is_special_array(tvecnode(p).left.resultdef)) or
  726. ((tvecnode(p).left.resultdef.typ=stringdef) and
  727. (tstringdef(tvecnode(p).left.resultdef).stringtype in [st_shortstring,st_longstring])) then
  728. p:=tvecnode(p).left
  729. else
  730. break;
  731. end;
  732. typeconvn :
  733. begin
  734. { implicit dereference -> stop }
  735. if (ttypeconvnode(p).convtype=tc_pointer_2_array) then
  736. break;
  737. if (ttypeconvnode(p).resultdef.typ=recorddef) then
  738. records_only:=false;
  739. p:=ttypeconvnode(p).left;
  740. end;
  741. loadn :
  742. begin
  743. if (tloadnode(p).symtableentry.typ in [staticvarsym,localvarsym,paravarsym]) then
  744. begin
  745. if (ra_addr_taken in how) then
  746. tabstractvarsym(tloadnode(p).symtableentry).addr_taken:=true;
  747. if (tabstractvarsym(tloadnode(p).symtableentry).varregable <> vr_none) and
  748. ((not records_only) or
  749. (tabstractvarsym(tloadnode(p).symtableentry).vardef.typ = recorddef)) then
  750. if (tloadnode(p).symtableentry.typ = paravarsym) and
  751. (ra_addr_regable in how) then
  752. tabstractvarsym(tloadnode(p).symtableentry).varregable:=vr_addr
  753. else
  754. tabstractvarsym(tloadnode(p).symtableentry).varregable:=vr_none;
  755. end;
  756. break;
  757. end;
  758. temprefn :
  759. begin
  760. if (ra_addr_taken in how) then
  761. include(ttemprefnode(p).tempinfo^.flags,ti_addr_taken);
  762. if (ti_may_be_in_reg in ttemprefnode(p).tempinfo^.flags) and
  763. ((not records_only) or
  764. (ttemprefnode(p).tempinfo^.typedef.typ = recorddef)) then
  765. exclude(ttemprefnode(p).tempinfo^.flags,ti_may_be_in_reg);
  766. break;
  767. end;
  768. else
  769. break;
  770. end;
  771. until false;
  772. end;
  773. procedure make_not_regable(p : tnode; how: tregableinfoflags);
  774. begin
  775. make_not_regable_intern(p,how,false);
  776. end;
  777. {****************************************************************************
  778. Subroutine Handling
  779. ****************************************************************************}
  780. function is_proc2procvar_load(p:tnode;out realprocdef:tprocdef):boolean;
  781. begin
  782. result:=false;
  783. { remove voidpointer typecast for tp procvars }
  784. if ((m_tp_procvar in current_settings.modeswitches) or
  785. (m_mac_procvar in current_settings.modeswitches)) and
  786. (p.nodetype=typeconvn) and
  787. is_voidpointer(p.resultdef) then
  788. p:=tunarynode(p).left;
  789. result:=(p.nodetype=typeconvn) and
  790. (ttypeconvnode(p).convtype=tc_proc_2_procvar);
  791. if result then
  792. realprocdef:=tprocdef(ttypeconvnode(p).left.resultdef);
  793. end;
  794. function is_ambiguous_funcret_load(p: tnode; out owningprocdef: tprocdef): boolean;
  795. begin
  796. result:=false;
  797. { the funcret is an absolutevarsym, which gets converted into a type
  798. conversion node of the loadnode of the actual function result. Its
  799. resulttype is obviously the same as that of the real function result }
  800. if (p.nodetype=typeconvn) and
  801. (p.resultdef=ttypeconvnode(p).left.resultdef) then
  802. p:=ttypeconvnode(p).left;
  803. if (p.nodetype=loadn) and
  804. (tloadnode(p).symtableentry.typ in [absolutevarsym,localvarsym,paravarsym]) and
  805. ([vo_is_funcret,vo_is_result] * tabstractvarsym(tloadnode(p).symtableentry).varoptions = [vo_is_funcret]) then
  806. begin
  807. owningprocdef:=tprocdef(tloadnode(p).symtableentry.owner.defowner);
  808. result:=true;
  809. end;
  810. end;
  811. { local routines can't be assigned to procvars }
  812. procedure test_local_to_procvar(from_def:tprocvardef;to_def:tdef);
  813. begin
  814. if not(m_nested_procvars in current_settings.modeswitches) and
  815. (from_def.parast.symtablelevel>normal_function_level) and
  816. (to_def.typ=procvardef) then
  817. CGMessage(type_e_cannot_local_proc_to_procvar);
  818. end;
  819. procedure set_varstate(p:tnode;newstate:tvarstate;varstateflags:tvarstateflags);
  820. const
  821. vstrans: array[tvarstate,tvarstate] of tvarstate = (
  822. { vs_none -> ... }
  823. (vs_none,vs_declared,vs_initialised,vs_read,vs_read_not_warned,vs_referred_not_inited,vs_written,vs_readwritten),
  824. { vs_declared -> ... }
  825. (vs_none,vs_declared,vs_initialised,vs_read,vs_read_not_warned,vs_referred_not_inited,vs_written,vs_readwritten),
  826. { vs_initialised -> ... }
  827. (vs_none,vs_initialised,vs_initialised,vs_read,vs_read,vs_read,vs_written,vs_readwritten),
  828. { vs_read -> ... }
  829. (vs_none,vs_read,vs_read,vs_read,vs_read,vs_read,vs_readwritten,vs_readwritten),
  830. { vs_read_not_warned -> ... }
  831. (vs_none,vs_read_not_warned,vs_read,vs_read,vs_read_not_warned,vs_read_not_warned,vs_readwritten,vs_readwritten),
  832. { vs_referred_not_inited }
  833. (vs_none,vs_referred_not_inited,vs_read,vs_read,vs_read_not_warned,vs_referred_not_inited,vs_written,vs_readwritten),
  834. { vs_written -> ... }
  835. (vs_none,vs_written,vs_written,vs_readwritten,vs_readwritten,vs_written,vs_written,vs_readwritten),
  836. { vs_readwritten -> ... }
  837. (vs_none,vs_readwritten,vs_readwritten,vs_readwritten,vs_readwritten,vs_readwritten,vs_readwritten,vs_readwritten));
  838. var
  839. hsym : tabstractvarsym;
  840. begin
  841. { make sure we can still warn about uninitialised use after high(v), @v etc }
  842. if (newstate = vs_read) and
  843. not(vsf_must_be_valid in varstateflags) then
  844. newstate := vs_referred_not_inited;
  845. while assigned(p) do
  846. begin
  847. case p.nodetype of
  848. derefn:
  849. begin
  850. if (tderefnode(p).left.nodetype=temprefn) and
  851. assigned(ttemprefnode(tderefnode(p).left).tempinfo^.withnode) then
  852. p:=ttemprefnode(tderefnode(p).left).tempinfo^.withnode
  853. else
  854. break;
  855. end;
  856. typeconvn :
  857. begin
  858. case ttypeconvnode(p).convtype of
  859. tc_cchar_2_pchar,
  860. tc_cstring_2_pchar,
  861. tc_array_2_pointer :
  862. exclude(varstateflags,vsf_must_be_valid);
  863. tc_pchar_2_string,
  864. tc_pointer_2_array :
  865. include(varstateflags,vsf_must_be_valid);
  866. end;
  867. p:=tunarynode(p).left;
  868. end;
  869. subscriptn :
  870. begin
  871. if is_implicit_pointer_object_type(tunarynode(p).left.resultdef) then
  872. newstate := vs_read;
  873. p:=tunarynode(p).left;
  874. end;
  875. vecn:
  876. begin
  877. set_varstate(tbinarynode(p).right,vs_read,[vsf_must_be_valid]);
  878. if (newstate in [vs_read,vs_readwritten]) or
  879. not(tunarynode(p).left.resultdef.typ in [stringdef,arraydef]) then
  880. include(varstateflags,vsf_must_be_valid)
  881. else if (newstate = vs_written) then
  882. exclude(varstateflags,vsf_must_be_valid);
  883. p:=tunarynode(p).left;
  884. end;
  885. { do not parse calln }
  886. calln :
  887. break;
  888. loadn :
  889. begin
  890. if (tloadnode(p).symtableentry.typ in [localvarsym,paravarsym,staticvarsym]) then
  891. begin
  892. hsym:=tabstractvarsym(tloadnode(p).symtableentry);
  893. if (vsf_must_be_valid in varstateflags) and
  894. (hsym.varstate in [vs_declared,vs_read_not_warned,vs_referred_not_inited]) then
  895. begin
  896. { Give warning/note for uninitialized locals }
  897. if assigned(hsym.owner) and
  898. not(cs_opt_nodedfa in current_settings.optimizerswitches) and
  899. not(vo_is_external in hsym.varoptions) and
  900. (hsym.owner.symtabletype in [parasymtable,localsymtable,staticsymtable]) and
  901. ((hsym.owner=current_procinfo.procdef.localst) or
  902. (hsym.owner=current_procinfo.procdef.parast)) then
  903. begin
  904. if (vo_is_funcret in hsym.varoptions) then
  905. begin
  906. if (vsf_use_hints in varstateflags) then
  907. CGMessagePos(p.fileinfo,sym_h_function_result_uninitialized)
  908. else
  909. CGMessagePos(p.fileinfo,sym_w_function_result_uninitialized)
  910. end
  911. else
  912. begin
  913. if tloadnode(p).symtable.symtabletype=localsymtable then
  914. begin
  915. if (vsf_use_hints in varstateflags) then
  916. CGMessagePos1(p.fileinfo,sym_h_uninitialized_local_variable,hsym.realname)
  917. else
  918. CGMessagePos1(p.fileinfo,sym_w_uninitialized_local_variable,hsym.realname);
  919. end
  920. else
  921. begin
  922. if (vsf_use_hints in varstateflags) then
  923. CGMessagePos1(p.fileinfo,sym_h_uninitialized_variable,hsym.realname)
  924. else
  925. CGMessagePos1(p.fileinfo,sym_w_uninitialized_variable,hsym.realname);
  926. end;
  927. end;
  928. end
  929. else if (newstate = vs_read) then
  930. newstate := vs_read_not_warned;
  931. end;
  932. hsym.varstate := vstrans[hsym.varstate,newstate];
  933. end;
  934. case newstate of
  935. vs_written:
  936. include(tloadnode(p).flags,nf_write);
  937. vs_readwritten:
  938. if not(nf_write in tloadnode(p).flags) then
  939. include(tloadnode(p).flags,nf_modify);
  940. end;
  941. break;
  942. end;
  943. callparan :
  944. internalerror(200310081);
  945. else
  946. break;
  947. end;{case }
  948. end;
  949. end;
  950. procedure set_unique(p : tnode);
  951. begin
  952. while assigned(p) do
  953. begin
  954. case p.nodetype of
  955. vecn:
  956. begin
  957. include(p.flags,nf_callunique);
  958. break;
  959. end;
  960. typeconvn,
  961. subscriptn,
  962. derefn:
  963. p:=tunarynode(p).left;
  964. else
  965. break;
  966. end;
  967. end;
  968. end;
  969. function valid_for_assign(p:tnode;opts:TValidAssigns; report_errors: boolean):boolean;
  970. var
  971. hp2,
  972. hp : tnode;
  973. gotstring,
  974. gotsubscript,
  975. gotrecord,
  976. gotpointer,
  977. gotvec,
  978. gotclass,
  979. gotdynarray,
  980. gotderef,
  981. gottypeconv : boolean;
  982. fromdef,
  983. todef : tdef;
  984. errmsg,
  985. temp : longint;
  986. begin
  987. if valid_const in opts then
  988. errmsg:=type_e_variable_id_expected
  989. else if valid_property in opts then
  990. errmsg:=type_e_argument_cant_be_assigned
  991. else
  992. errmsg:=type_e_no_addr_of_constant;
  993. result:=false;
  994. gotsubscript:=false;
  995. gotvec:=false;
  996. gotderef:=false;
  997. gotrecord:=false;
  998. gotclass:=false;
  999. gotpointer:=false;
  1000. gotdynarray:=false;
  1001. gotstring:=false;
  1002. gottypeconv:=false;
  1003. hp:=p;
  1004. if not(valid_void in opts) and
  1005. is_void(hp.resultdef) then
  1006. begin
  1007. if report_errors then
  1008. CGMessagePos(hp.fileinfo,errmsg);
  1009. exit;
  1010. end;
  1011. while assigned(hp) do
  1012. begin
  1013. { property allowed? calln has a property check itself }
  1014. if (nf_isproperty in hp.flags) then
  1015. begin
  1016. { check return type }
  1017. case hp.resultdef.typ of
  1018. pointerdef :
  1019. gotpointer:=true;
  1020. objectdef :
  1021. gotclass:=is_implicit_pointer_object_type(hp.resultdef);
  1022. recorddef :
  1023. gotrecord:=true;
  1024. classrefdef :
  1025. gotclass:=true;
  1026. stringdef :
  1027. gotstring:=true;
  1028. end;
  1029. if (valid_property in opts) then
  1030. begin
  1031. { don't allow writing to calls that will create
  1032. temps like calls that return a structure and we
  1033. are assigning to a member }
  1034. if (valid_const in opts) or
  1035. { if we got a deref, we won't modify the property itself }
  1036. (gotderef) or
  1037. { same when we got a class and subscript (= deref) }
  1038. (gotclass and gotsubscript) or
  1039. (
  1040. { allowing assignments to typecasted properties
  1041. a) is Delphi-incompatible
  1042. b) causes problems in case the getter is a function
  1043. (because then the result of the getter is
  1044. typecasted to this type, and then we "assign" to
  1045. this typecasted function result) -> always
  1046. disallow, since property accessors should be
  1047. transparantly changeable to functions at all
  1048. times
  1049. }
  1050. not(gottypeconv) and
  1051. not(gotsubscript and gotrecord) and
  1052. not(gotstring and gotvec)
  1053. ) then
  1054. result:=true
  1055. else
  1056. if report_errors then
  1057. CGMessagePos(hp.fileinfo,errmsg);
  1058. end
  1059. else
  1060. begin
  1061. { 1. if it returns a pointer and we've found a deref,
  1062. 2. if it returns a class or record and a subscription or with is found
  1063. 3. if the address is needed of a field (subscriptn, vecn) }
  1064. if (gotpointer and gotderef) or
  1065. (gotstring and gotvec) or
  1066. (
  1067. (gotclass or gotrecord) and
  1068. (gotsubscript)
  1069. ) or
  1070. (
  1071. (gotvec and gotdynarray)
  1072. ) or
  1073. (
  1074. (Valid_Addr in opts) and
  1075. (hp.nodetype in [subscriptn,vecn])
  1076. ) then
  1077. result:=true
  1078. else
  1079. if report_errors then
  1080. CGMessagePos(hp.fileinfo,errmsg);
  1081. end;
  1082. exit;
  1083. end;
  1084. case hp.nodetype of
  1085. temprefn :
  1086. begin
  1087. valid_for_assign := true;
  1088. exit;
  1089. end;
  1090. derefn :
  1091. begin
  1092. gotderef:=true;
  1093. hp:=tderefnode(hp).left;
  1094. end;
  1095. typeconvn :
  1096. begin
  1097. gottypeconv:=true;
  1098. { typecast sizes must match, exceptions:
  1099. - implicit typecast made by absolute
  1100. - from formaldef
  1101. - from void
  1102. - from/to open array
  1103. - typecast from pointer to array }
  1104. fromdef:=ttypeconvnode(hp).left.resultdef;
  1105. todef:=hp.resultdef;
  1106. if not((nf_absolute in ttypeconvnode(hp).flags) or
  1107. (fromdef.typ=formaldef) or
  1108. is_void(fromdef) or
  1109. is_open_array(fromdef) or
  1110. is_open_array(todef) or
  1111. ((fromdef.typ=pointerdef) and (todef.typ=arraydef)) or
  1112. ((fromdef.typ = objectdef) and (todef.typ = objectdef) and
  1113. (tobjectdef(fromdef).is_related(tobjectdef(todef))))) and
  1114. (fromdef.size<>todef.size) then
  1115. begin
  1116. { in TP it is allowed to typecast to smaller types. But the variable can't
  1117. be in a register }
  1118. if (m_tp7 in current_settings.modeswitches) or
  1119. (todef.size<fromdef.size) then
  1120. make_not_regable(hp,[ra_addr_regable])
  1121. else
  1122. if report_errors then
  1123. CGMessagePos2(hp.fileinfo,type_e_typecast_wrong_size_for_assignment,tostr(fromdef.size),tostr(todef.size));
  1124. end;
  1125. { don't allow assignments to typeconvs that need special code }
  1126. if not(gotsubscript or gotvec or gotderef) and
  1127. not(ttypeconvnode(hp).assign_allowed) then
  1128. begin
  1129. if report_errors then
  1130. CGMessagePos(hp.fileinfo,errmsg);
  1131. exit;
  1132. end;
  1133. case hp.resultdef.typ of
  1134. pointerdef :
  1135. gotpointer:=true;
  1136. objectdef :
  1137. gotclass:=is_implicit_pointer_object_type(hp.resultdef);
  1138. classrefdef :
  1139. gotclass:=true;
  1140. arraydef :
  1141. begin
  1142. { pointer -> array conversion is done then we need to see it
  1143. as a deref, because a ^ is then not required anymore }
  1144. if (ttypeconvnode(hp).left.resultdef.typ=pointerdef) then
  1145. gotderef:=true;
  1146. end;
  1147. end;
  1148. hp:=ttypeconvnode(hp).left;
  1149. end;
  1150. vecn :
  1151. begin
  1152. if { only check for first (= outermost) vec node }
  1153. not gotvec and
  1154. not(valid_packed in opts) and
  1155. (tvecnode(hp).left.resultdef.typ = arraydef) and
  1156. (ado_IsBitPacked in tarraydef(tvecnode(hp).left.resultdef).arrayoptions) and
  1157. ((tarraydef(tvecnode(hp).left.resultdef).elepackedbitsize mod 8 <> 0) or
  1158. (is_ordinal(tarraydef(tvecnode(hp).left.resultdef).elementdef) and
  1159. not ispowerof2(tarraydef(tvecnode(hp).left.resultdef).elepackedbitsize div 8,temp))) then
  1160. begin
  1161. if report_errors then
  1162. if (valid_property in opts) then
  1163. CGMessagePos(hp.fileinfo,parser_e_packed_element_no_loop)
  1164. else
  1165. CGMessagePos(hp.fileinfo,parser_e_packed_element_no_var_addr);
  1166. exit;
  1167. end;
  1168. gotvec:=true;
  1169. { accesses to dyn. arrays override read only access in delphi }
  1170. if (m_delphi in current_settings.modeswitches) and is_dynamic_array(tunarynode(hp).left.resultdef) then
  1171. gotdynarray:=true;
  1172. hp:=tunarynode(hp).left;
  1173. end;
  1174. blockn :
  1175. begin
  1176. hp2:=tblocknode(hp).statements;
  1177. if assigned(hp2) then
  1178. begin
  1179. if hp2.nodetype<>statementn then
  1180. internalerror(2006110801);
  1181. while assigned(tstatementnode(hp2).next) do
  1182. hp2:=tstatementnode(hp2).next;
  1183. hp:=tstatementnode(hp2).statement;
  1184. end
  1185. else
  1186. begin
  1187. if report_errors then
  1188. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1189. exit;
  1190. end;
  1191. end;
  1192. asn :
  1193. begin
  1194. { asn can't be assigned directly, it returns the value in a register instead
  1195. of reference. }
  1196. if not(gotsubscript or gotderef or gotvec) then
  1197. begin
  1198. if report_errors then
  1199. CGMessagePos(hp.fileinfo,errmsg);
  1200. exit;
  1201. end;
  1202. hp:=tunarynode(hp).left;
  1203. end;
  1204. subscriptn :
  1205. begin
  1206. { only check first (= outermost) subscriptn }
  1207. if not gotsubscript and
  1208. not(valid_packed in opts) and
  1209. is_packed_record_or_object(tsubscriptnode(hp).left.resultdef) and
  1210. ((tsubscriptnode(hp).vs.fieldoffset mod 8 <> 0) or
  1211. (is_ordinal(tsubscriptnode(hp).resultdef) and
  1212. not ispowerof2(tsubscriptnode(hp).resultdef.packedbitsize div 8,temp))) then
  1213. begin
  1214. if report_errors then
  1215. if (valid_property in opts) then
  1216. CGMessagePos(hp.fileinfo,parser_e_packed_element_no_loop)
  1217. else
  1218. CGMessagePos(hp.fileinfo,parser_e_packed_element_no_var_addr);
  1219. exit;
  1220. end;
  1221. gotsubscript:=true;
  1222. { loop counter? }
  1223. if not(Valid_Const in opts) and
  1224. (vo_is_loop_counter in tsubscriptnode(hp).vs.varoptions) then
  1225. begin
  1226. if report_errors then
  1227. CGMessage1(parser_e_illegal_assignment_to_count_var,tsubscriptnode(hp).vs.realname);
  1228. exit;
  1229. end;
  1230. { implicit pointer object types result in dereferencing }
  1231. hp:=tsubscriptnode(hp).left;
  1232. if is_implicit_pointer_object_type(hp.resultdef) then
  1233. gotderef:=true;
  1234. end;
  1235. muln,
  1236. divn,
  1237. andn,
  1238. xorn,
  1239. orn,
  1240. notn,
  1241. subn,
  1242. addn :
  1243. begin
  1244. { Allow operators on a pointer, or an integer
  1245. and a pointer typecast and deref has been found }
  1246. if ((hp.resultdef.typ=pointerdef) or
  1247. (is_integer(hp.resultdef) and gotpointer)) and
  1248. gotderef then
  1249. result:=true
  1250. else
  1251. { Temp strings are stored in memory, for compatibility with
  1252. delphi only }
  1253. if (m_delphi in current_settings.modeswitches) and
  1254. ((valid_addr in opts) or
  1255. (valid_const in opts)) and
  1256. (hp.resultdef.typ=stringdef) then
  1257. result:=true
  1258. else
  1259. if report_errors then
  1260. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1261. exit;
  1262. end;
  1263. niln,
  1264. pointerconstn :
  1265. begin
  1266. { to support e.g. @tmypointer(0)^.data; see tests/tbs/tb0481 }
  1267. if gotderef then
  1268. result:=true
  1269. else
  1270. if report_errors then
  1271. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  1272. exit;
  1273. end;
  1274. ordconstn,
  1275. realconstn :
  1276. begin
  1277. { these constants will be passed by value }
  1278. if report_errors then
  1279. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1280. exit;
  1281. end;
  1282. setconstn,
  1283. stringconstn,
  1284. guidconstn :
  1285. begin
  1286. { these constants will be passed by reference }
  1287. if valid_const in opts then
  1288. result:=true
  1289. else
  1290. if report_errors then
  1291. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1292. exit;
  1293. end;
  1294. addrn :
  1295. begin
  1296. if gotderef then
  1297. result:=true
  1298. else
  1299. if report_errors then
  1300. CGMessagePos(hp.fileinfo,type_e_no_assign_to_addr);
  1301. exit;
  1302. end;
  1303. calln :
  1304. begin
  1305. { check return type }
  1306. case hp.resultdef.typ of
  1307. arraydef :
  1308. begin
  1309. { dynamic arrays are allowed when there is also a
  1310. vec node }
  1311. if is_dynamic_array(hp.resultdef) and
  1312. gotvec then
  1313. begin
  1314. gotderef:=true;
  1315. gotpointer:=true;
  1316. end;
  1317. end;
  1318. pointerdef :
  1319. gotpointer:=true;
  1320. objectdef :
  1321. gotclass:=is_implicit_pointer_object_type(hp.resultdef);
  1322. recorddef, { handle record like class it needs a subscription }
  1323. classrefdef :
  1324. gotclass:=true;
  1325. stringdef :
  1326. gotstring:=true;
  1327. end;
  1328. { 1. if it returns a pointer and we've found a deref,
  1329. 2. if it returns a class or record and a subscription or with is found
  1330. 3. string is returned }
  1331. if (gotstring and gotvec) or
  1332. (gotpointer and gotderef) or
  1333. (gotclass and gotsubscript) then
  1334. result:=true
  1335. else
  1336. { Temp strings are stored in memory, for compatibility with
  1337. delphi only }
  1338. if (m_delphi in current_settings.modeswitches) and
  1339. (valid_addr in opts) and
  1340. (hp.resultdef.typ=stringdef) then
  1341. result:=true
  1342. else
  1343. if ([valid_const,valid_addr] * opts = [valid_const]) then
  1344. result:=true
  1345. else
  1346. if report_errors then
  1347. CGMessagePos(hp.fileinfo,errmsg);
  1348. exit;
  1349. end;
  1350. inlinen :
  1351. begin
  1352. if ((valid_const in opts) and
  1353. (tinlinenode(hp).inlinenumber in [in_typeof_x])) or
  1354. (tinlinenode(hp).inlinenumber in [in_unaligned_x]) then
  1355. result:=true
  1356. else
  1357. if report_errors then
  1358. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1359. exit;
  1360. end;
  1361. dataconstn:
  1362. begin
  1363. { only created internally, so no additional checks necessary }
  1364. result:=true;
  1365. exit;
  1366. end;
  1367. loadn :
  1368. begin
  1369. case tloadnode(hp).symtableentry.typ of
  1370. absolutevarsym,
  1371. staticvarsym,
  1372. localvarsym,
  1373. paravarsym :
  1374. begin
  1375. { loop counter? }
  1376. if not(Valid_Const in opts) and
  1377. not gotderef and
  1378. (vo_is_loop_counter in tabstractvarsym(tloadnode(hp).symtableentry).varoptions) then
  1379. begin
  1380. if report_errors then
  1381. CGMessage1(parser_e_illegal_assignment_to_count_var,tloadnode(hp).symtableentry.realname);
  1382. exit;
  1383. end;
  1384. { read-only variable? }
  1385. if (tabstractvarsym(tloadnode(hp).symtableentry).varspez in [vs_const,vs_constref]) then
  1386. begin
  1387. { allow p^:= constructions with p is const parameter }
  1388. if gotderef or gotdynarray or (Valid_Const in opts) or
  1389. (nf_isinternal_ignoreconst in tloadnode(hp).flags) then
  1390. result:=true
  1391. else
  1392. if report_errors then
  1393. CGMessagePos(tloadnode(hp).fileinfo,type_e_no_assign_to_const);
  1394. exit;
  1395. end;
  1396. result:=true;
  1397. exit;
  1398. end;
  1399. procsym :
  1400. begin
  1401. if (Valid_Const in opts) then
  1402. result:=true
  1403. else
  1404. if report_errors then
  1405. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1406. exit;
  1407. end;
  1408. labelsym :
  1409. begin
  1410. if (Valid_Addr in opts) then
  1411. result:=true
  1412. else
  1413. if report_errors then
  1414. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1415. exit;
  1416. end;
  1417. constsym:
  1418. begin
  1419. if (tconstsym(tloadnode(hp).symtableentry).consttyp=constresourcestring) and
  1420. (valid_addr in opts) then
  1421. result:=true
  1422. else
  1423. if report_errors then
  1424. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1425. exit;
  1426. end;
  1427. else
  1428. begin
  1429. if report_errors then
  1430. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1431. exit;
  1432. end;
  1433. end;
  1434. end;
  1435. else
  1436. begin
  1437. if report_errors then
  1438. CGMessagePos(hp.fileinfo,type_e_variable_id_expected);
  1439. exit;
  1440. end;
  1441. end;
  1442. end;
  1443. end;
  1444. function valid_for_var(p:tnode; report_errors: boolean):boolean;
  1445. begin
  1446. valid_for_var:=valid_for_assign(p,[],report_errors);
  1447. end;
  1448. function valid_for_formal_var(p : tnode; report_errors: boolean) : boolean;
  1449. begin
  1450. valid_for_formal_var:=valid_for_assign(p,[valid_void],report_errors);
  1451. end;
  1452. function valid_for_formal_const(p : tnode; report_errors: boolean) : boolean;
  1453. begin
  1454. valid_for_formal_const:=(p.resultdef.typ=formaldef) or
  1455. valid_for_assign(p,[valid_void,valid_const,valid_property],report_errors);
  1456. end;
  1457. function valid_for_assignment(p:tnode; report_errors: boolean):boolean;
  1458. begin
  1459. valid_for_assignment:=valid_for_assign(p,[valid_property,valid_packed],report_errors);
  1460. end;
  1461. function valid_for_loopvar(p:tnode; report_errors: boolean):boolean;
  1462. begin
  1463. valid_for_loopvar:=valid_for_assign(p,[valid_property],report_errors);
  1464. end;
  1465. function valid_for_addr(p : tnode; report_errors: boolean) : boolean;
  1466. begin
  1467. result:=valid_for_assign(p,[valid_const,valid_addr,valid_void],report_errors);
  1468. end;
  1469. procedure var_para_allowed(var eq:tequaltype;def_from,def_to:Tdef; fromnode: tnode);
  1470. begin
  1471. { Note: eq must be already valid, it will only be updated! }
  1472. case def_to.typ of
  1473. formaldef :
  1474. begin
  1475. { all types can be passed to a formaldef,
  1476. but it is not the prefered way }
  1477. if not is_constnode(fromnode) then
  1478. eq:=te_convert_l2
  1479. else
  1480. eq:=te_incompatible;
  1481. end;
  1482. orddef :
  1483. begin
  1484. { allows conversion from word to integer and
  1485. byte to shortint, but only for TP7 compatibility }
  1486. if (m_tp7 in current_settings.modeswitches) and
  1487. (def_from.typ=orddef) and
  1488. (def_from.size=def_to.size) then
  1489. eq:=te_convert_l1;
  1490. end;
  1491. arraydef :
  1492. begin
  1493. if is_open_array(def_to) then
  1494. begin
  1495. if is_dynamic_array(def_from) and
  1496. equal_defs(tarraydef(def_from).elementdef,tarraydef(def_to).elementdef) then
  1497. eq:=te_convert_l2
  1498. else
  1499. if equal_defs(def_from,tarraydef(def_to).elementdef) then
  1500. eq:=te_convert_l3;
  1501. end;
  1502. end;
  1503. pointerdef :
  1504. begin
  1505. { an implicit pointer conversion is allowed }
  1506. if (def_from.typ=pointerdef) then
  1507. eq:=te_convert_l1;
  1508. end;
  1509. stringdef :
  1510. begin
  1511. { all shortstrings are allowed, size is not important }
  1512. if is_shortstring(def_from) and
  1513. is_shortstring(def_to) then
  1514. eq:=te_equal;
  1515. end;
  1516. objectdef :
  1517. begin
  1518. { child objects can be also passed }
  1519. { in non-delphi mode, otherwise }
  1520. { they must match exactly, except }
  1521. { if they are objects }
  1522. if (def_from.typ=objectdef) and
  1523. (
  1524. (tobjectdef(def_from).objecttype=odt_object) and
  1525. (tobjectdef(def_to).objecttype=odt_object)
  1526. ) and
  1527. (tobjectdef(def_from).is_related(tobjectdef(def_to))) then
  1528. eq:=te_convert_l1;
  1529. end;
  1530. filedef :
  1531. begin
  1532. { an implicit file conversion is also allowed }
  1533. { from a typed file to an untyped one }
  1534. if (def_from.typ=filedef) and
  1535. (tfiledef(def_from).filetyp = ft_typed) and
  1536. (tfiledef(def_to).filetyp = ft_untyped) then
  1537. eq:=te_convert_l1;
  1538. end;
  1539. end;
  1540. end;
  1541. procedure para_allowed(var eq:tequaltype;p:tcallparanode;def_to:tdef);
  1542. var
  1543. acn: tarrayconstructornode;
  1544. realprocdef: tprocdef;
  1545. tmpeq: tequaltype;
  1546. begin
  1547. { Note: eq must be already valid, it will only be updated! }
  1548. case def_to.typ of
  1549. formaldef :
  1550. begin
  1551. { all types can be passed to a formaldef }
  1552. eq:=te_equal;
  1553. end;
  1554. stringdef :
  1555. begin
  1556. { to support ansi/long/wide strings in a proper way }
  1557. { string and string[10] are assumed as equal }
  1558. { when searching the correct overloaded procedure }
  1559. if (p.resultdef.typ=stringdef) and
  1560. (tstringdef(def_to).stringtype=tstringdef(p.resultdef).stringtype) then
  1561. eq:=te_equal
  1562. else
  1563. { Passing a constant char to ansistring or shortstring or
  1564. a widechar to widestring then handle it as equal. }
  1565. if (p.left.nodetype=ordconstn) and
  1566. (
  1567. is_char(p.resultdef) and
  1568. (is_shortstring(def_to) or is_ansistring(def_to))
  1569. ) or
  1570. (
  1571. is_widechar(p.resultdef) and
  1572. (is_widestring(def_to) or is_unicodestring(def_to))
  1573. ) then
  1574. eq:=te_equal
  1575. end;
  1576. setdef :
  1577. begin
  1578. { set can also be a not yet converted array constructor }
  1579. if (p.resultdef.typ=arraydef) and
  1580. is_array_constructor(p.resultdef) and
  1581. not is_variant_array(p.resultdef) then
  1582. eq:=te_equal;
  1583. end;
  1584. procvardef :
  1585. begin
  1586. tmpeq:=te_incompatible;
  1587. { in tp/macpas mode proc -> procvar is allowed }
  1588. if ((m_tp_procvar in current_settings.modeswitches) or
  1589. (m_mac_procvar in current_settings.modeswitches)) and
  1590. (p.left.nodetype=calln) then
  1591. tmpeq:=proc_to_procvar_equal(tprocdef(tcallnode(p.left).procdefinition),tprocvardef(def_to),false);
  1592. if (tmpeq=te_incompatible) and
  1593. (m_nested_procvars in current_settings.modeswitches) and
  1594. is_proc2procvar_load(p.left,realprocdef) then
  1595. tmpeq:=proc_to_procvar_equal(realprocdef,tprocvardef(def_to),false);
  1596. if (tmpeq=te_incompatible) and
  1597. (m_mac in current_settings.modeswitches) and
  1598. is_ambiguous_funcret_load(p.left,realprocdef) then
  1599. tmpeq:=proc_to_procvar_equal(realprocdef,tprocvardef(def_to),false);
  1600. if tmpeq<>te_incompatible then
  1601. eq:=tmpeq;
  1602. end;
  1603. arraydef :
  1604. begin
  1605. { an arrayconstructor of proccalls may have to be converted to
  1606. an array of procvars }
  1607. if ((m_tp_procvar in current_settings.modeswitches) or
  1608. (m_mac_procvar in current_settings.modeswitches)) and
  1609. (tarraydef(def_to).elementdef.typ=procvardef) and
  1610. is_array_constructor(p.resultdef) and
  1611. not is_variant_array(p.resultdef) then
  1612. begin
  1613. acn:=tarrayconstructornode(p.left);
  1614. if assigned(acn.left) then
  1615. begin
  1616. eq:=te_exact;
  1617. while assigned(acn) and
  1618. (eq<>te_incompatible) do
  1619. begin
  1620. if (acn.left.nodetype=calln) then
  1621. tmpeq:=proc_to_procvar_equal(tprocdef(tcallnode(acn.left).procdefinition),tprocvardef(tarraydef(def_to).elementdef),false)
  1622. else
  1623. tmpeq:=compare_defs(acn.left.resultdef,tarraydef(def_to).elementdef,acn.left.nodetype);
  1624. if tmpeq<eq then
  1625. eq:=tmpeq;
  1626. acn:=tarrayconstructornode(acn.right);
  1627. end;
  1628. end
  1629. end;
  1630. end;
  1631. end;
  1632. end;
  1633. function allowenumop(nt:tnodetype):boolean;
  1634. begin
  1635. result:=(nt in [equaln,unequaln,ltn,lten,gtn,gten]) or
  1636. ((cs_allow_enum_calc in current_settings.localswitches) and
  1637. (nt in [addn,subn]));
  1638. end;
  1639. {****************************************************************************
  1640. TCallCandidates
  1641. ****************************************************************************}
  1642. constructor tcallcandidates.create(sym:tprocsym;st:TSymtable;ppn:tnode;ignorevisibility,allowdefaultparas,objcidcall,explicitunit,searchhelpers:boolean);
  1643. begin
  1644. if not assigned(sym) then
  1645. internalerror(200411015);
  1646. FOperator:=NOTOKEN;
  1647. FProcsym:=sym;
  1648. FProcsymtable:=st;
  1649. FParanode:=ppn;
  1650. create_candidate_list(ignorevisibility,allowdefaultparas,objcidcall,explicitunit,searchhelpers);
  1651. end;
  1652. constructor tcallcandidates.create_operator(op:ttoken;ppn:tnode);
  1653. begin
  1654. FOperator:=op;
  1655. FProcsym:=nil;
  1656. FProcsymtable:=nil;
  1657. FParanode:=ppn;
  1658. create_candidate_list(false,false,false,false,false);
  1659. end;
  1660. destructor tcallcandidates.destroy;
  1661. var
  1662. hpnext,
  1663. hp : pcandidate;
  1664. begin
  1665. hp:=FCandidateProcs;
  1666. while assigned(hp) do
  1667. begin
  1668. hpnext:=hp^.next;
  1669. dispose(hp);
  1670. hp:=hpnext;
  1671. end;
  1672. end;
  1673. procedure tcallcandidates.collect_overloads_in_struct(structdef:tabstractrecorddef;ProcdefOverloadList:TFPObjectList;searchhelpers:boolean);
  1674. function processprocsym(srsym:tprocsym):boolean;
  1675. var
  1676. j : integer;
  1677. pd : tprocdef;
  1678. begin
  1679. { Store first procsym found }
  1680. if not assigned(FProcsym) then
  1681. FProcsym:=srsym;
  1682. { add all definitions }
  1683. result:=false;
  1684. for j:=0 to srsym.ProcdefList.Count-1 do
  1685. begin
  1686. pd:=tprocdef(srsym.ProcdefList[j]);
  1687. if po_overload in pd.procoptions then
  1688. result:=true;
  1689. ProcdefOverloadList.Add(srsym.ProcdefList[j]);
  1690. end;
  1691. end;
  1692. var
  1693. srsym : tsym;
  1694. hashedid : THashedIDString;
  1695. hasoverload : boolean;
  1696. helperdef : tobjectdef;
  1697. begin
  1698. if FOperator=NOTOKEN then
  1699. hashedid.id:=FProcsym.name
  1700. else
  1701. hashedid.id:=overloaded_names[FOperator];
  1702. hasoverload:=false;
  1703. while assigned(structdef) do
  1704. begin
  1705. { first search in helpers for this type }
  1706. if (is_class(structdef) or is_record(structdef))
  1707. and searchhelpers then
  1708. begin
  1709. if search_last_objectpascal_helper(structdef,nil,helperdef) then
  1710. begin
  1711. srsym:=nil;
  1712. while assigned(helperdef) do
  1713. begin
  1714. srsym:=tsym(helperdef.symtable.FindWithHash(hashedid));
  1715. if assigned(srsym) and
  1716. { Delphi allows hiding a property by a procedure with the same name }
  1717. (srsym.typ=procsym) then
  1718. begin
  1719. hasoverload := processprocsym(tprocsym(srsym));
  1720. { when there is no explicit overload we stop searching }
  1721. if not hasoverload then
  1722. break;
  1723. end;
  1724. helperdef:=helperdef.childof;
  1725. end;
  1726. if not hasoverload and assigned(srsym) then
  1727. exit;
  1728. end;
  1729. end;
  1730. { now search in the type itself }
  1731. srsym:=tprocsym(structdef.symtable.FindWithHash(hashedid));
  1732. if assigned(srsym) and
  1733. { Delphi allows hiding a property by a procedure with the same name }
  1734. (srsym.typ=procsym) then
  1735. begin
  1736. hasoverload:=processprocsym(tprocsym(srsym));
  1737. { when there is no explicit overload we stop searching }
  1738. if not hasoverload then
  1739. break;
  1740. end;
  1741. if is_objectpascal_helper(structdef) and
  1742. (tobjectdef(structdef).typ in [recorddef,objectdef]) then
  1743. begin
  1744. { search methods in the extended type as well }
  1745. srsym:=tprocsym(tabstractrecorddef(tobjectdef(structdef).extendeddef).symtable.FindWithHash(hashedid));
  1746. if assigned(srsym) and
  1747. { Delphi allows hiding a property by a procedure with the same name }
  1748. (srsym.typ=procsym) then
  1749. begin
  1750. hasoverload:=processprocsym(tprocsym(srsym));
  1751. { when there is no explicit overload we stop searching }
  1752. if not hasoverload then
  1753. break;
  1754. end;
  1755. end;
  1756. { next parent }
  1757. if (structdef.typ=objectdef) then
  1758. structdef:=tobjectdef(structdef).childof
  1759. else
  1760. structdef:=nil;
  1761. end;
  1762. end;
  1763. procedure tcallcandidates.collect_overloads_in_units(ProcdefOverloadList:TFPObjectList; objcidcall,explicitunit: boolean);
  1764. var
  1765. j : integer;
  1766. pd : tprocdef;
  1767. srsymtable : TSymtable;
  1768. srsym : tsym;
  1769. checkstack : psymtablestackitem;
  1770. hashedid : THashedIDString;
  1771. hasoverload : boolean;
  1772. begin
  1773. { we search all overloaded operator definitions in the symtablestack. The found
  1774. entries are only added to the procs list and not the procsym, because
  1775. the list can change in every situation }
  1776. if FOperator=NOTOKEN then
  1777. begin
  1778. if not objcidcall then
  1779. hashedid.id:=FProcsym.name
  1780. else
  1781. hashedid.id:=class_helper_prefix+FProcsym.name;
  1782. end
  1783. else
  1784. hashedid.id:=overloaded_names[FOperator];
  1785. checkstack:=symtablestack.stack;
  1786. if assigned(FProcsymtable) then
  1787. begin
  1788. while assigned(checkstack) and
  1789. (checkstack^.symtable<>FProcsymtable) do
  1790. checkstack:=checkstack^.next;
  1791. end;
  1792. while assigned(checkstack) do
  1793. begin
  1794. srsymtable:=checkstack^.symtable;
  1795. { if the unit in which the routine has to be searched has been
  1796. specified explicitly, stop searching after its symtable(s) have
  1797. been checked (can be both the static and the global symtable
  1798. in case it's the current unit itself) }
  1799. if explicitunit and
  1800. (FProcsymtable.symtabletype in [globalsymtable,staticsymtable]) and
  1801. (srsymtable.moduleid<>FProcsymtable.moduleid) then
  1802. break;
  1803. if srsymtable.symtabletype in [localsymtable,staticsymtable,globalsymtable] then
  1804. begin
  1805. srsym:=tsym(srsymtable.FindWithHash(hashedid));
  1806. if assigned(srsym) and
  1807. (srsym.typ=procsym) then
  1808. begin
  1809. { Store first procsym found }
  1810. if not assigned(FProcsym) then
  1811. FProcsym:=tprocsym(srsym);
  1812. { add all definitions }
  1813. hasoverload:=false;
  1814. for j:=0 to tprocsym(srsym).ProcdefList.Count-1 do
  1815. begin
  1816. pd:=tprocdef(tprocsym(srsym).ProcdefList[j]);
  1817. if po_overload in pd.procoptions then
  1818. hasoverload:=true;
  1819. ProcdefOverloadList.Add(tprocsym(srsym).ProcdefList[j]);
  1820. end;
  1821. { when there is no explicit overload we stop searching,
  1822. except for Objective-C methods called via id }
  1823. if not hasoverload and
  1824. not objcidcall then
  1825. break;
  1826. end;
  1827. end;
  1828. checkstack:=checkstack^.next
  1829. end;
  1830. end;
  1831. procedure tcallcandidates.create_candidate_list(ignorevisibility,allowdefaultparas,objcidcall,explicitunit,searchhelpers:boolean);
  1832. var
  1833. j : integer;
  1834. pd : tprocdef;
  1835. hp : pcandidate;
  1836. pt : tcallparanode;
  1837. found : boolean;
  1838. st : TSymtable;
  1839. contextstructdef : tabstractrecorddef;
  1840. ProcdefOverloadList : TFPObjectList;
  1841. begin
  1842. FCandidateProcs:=nil;
  1843. { Find all available overloads for this procsym }
  1844. ProcdefOverloadList:=TFPObjectList.Create(false);
  1845. if not objcidcall and
  1846. (FOperator=NOTOKEN) and
  1847. (FProcsym.owner.symtabletype in [objectsymtable,recordsymtable]) then
  1848. collect_overloads_in_struct(tabstractrecorddef(FProcsym.owner.defowner),ProcdefOverloadList,searchhelpers)
  1849. else
  1850. if (FOperator<>NOTOKEN) then
  1851. begin
  1852. { check operands and if they contain records then search in records,
  1853. then search in unit }
  1854. pt:=tcallparanode(FParaNode);
  1855. while assigned(pt) do
  1856. begin
  1857. if (pt.resultdef.typ=recorddef) then
  1858. collect_overloads_in_struct(tabstractrecorddef(pt.resultdef),ProcdefOverloadList,searchhelpers);
  1859. pt:=tcallparanode(pt.right);
  1860. end;
  1861. collect_overloads_in_units(ProcdefOverloadList,objcidcall,explicitunit);
  1862. end
  1863. else
  1864. collect_overloads_in_units(ProcdefOverloadList,objcidcall,explicitunit);
  1865. { determine length of parameter list.
  1866. for operators also enable the variant-operators if
  1867. a variant parameter is passed }
  1868. FParalength:=0;
  1869. FAllowVariant:=(FOperator=NOTOKEN);
  1870. pt:=tcallparanode(FParaNode);
  1871. while assigned(pt) do
  1872. begin
  1873. if (pt.resultdef.typ=variantdef) then
  1874. FAllowVariant:=true;
  1875. inc(FParalength);
  1876. pt:=tcallparanode(pt.right);
  1877. end;
  1878. { when the class passed is defined in this unit we
  1879. need to use the scope of that class. This is a trick
  1880. that can be used to access protected members in other
  1881. units. At least kylix supports it this way (PFV) }
  1882. if assigned(FProcSymtable) and
  1883. (
  1884. (FProcSymtable.symtabletype in [ObjectSymtable,recordsymtable]) or
  1885. ((FProcSymtable.symtabletype=withsymtable) and
  1886. (FProcSymtable.defowner.typ in [objectdef,recorddef]))
  1887. ) and
  1888. (FProcSymtable.defowner.owner.symtabletype in [globalsymtable,staticsymtable]) and
  1889. FProcSymtable.defowner.owner.iscurrentunit then
  1890. contextstructdef:=tabstractrecorddef(FProcSymtable.defowner)
  1891. else
  1892. contextstructdef:=current_structdef;
  1893. { symtable is needed later to calculate the distance }
  1894. if assigned(FProcsym) then
  1895. st:=FProcsym.Owner
  1896. else
  1897. st:=nil;
  1898. { Process all found overloads }
  1899. for j:=0 to ProcdefOverloadList.Count-1 do
  1900. begin
  1901. pd:=tprocdef(ProcdefOverloadList[j]);
  1902. { only when the # of parameter are supported by the procedure and
  1903. it is visible }
  1904. if (FParalength>=pd.minparacount) and
  1905. (
  1906. (
  1907. allowdefaultparas and
  1908. (
  1909. (FParalength<=pd.maxparacount) or
  1910. (po_varargs in pd.procoptions)
  1911. )
  1912. ) or
  1913. (
  1914. not allowdefaultparas and
  1915. (FParalength=pd.maxparacount)
  1916. )
  1917. ) and
  1918. (
  1919. ignorevisibility or
  1920. not (pd.owner.symtabletype in [objectsymtable,recordsymtable]) or
  1921. is_visible_for_object(pd,contextstructdef)
  1922. ) then
  1923. begin
  1924. { don't add duplicates, only compare visible parameters for the user }
  1925. found:=false;
  1926. hp:=FCandidateProcs;
  1927. while assigned(hp) do
  1928. begin
  1929. if (compare_paras(hp^.data.paras,pd.paras,cp_value_equal_const,[cpo_ignorehidden])>=te_equal) and
  1930. (not(po_objc in pd.procoptions) or
  1931. (pd.messageinf.str^=hp^.data.messageinf.str^)) then
  1932. begin
  1933. found:=true;
  1934. break;
  1935. end;
  1936. hp:=hp^.next;
  1937. end;
  1938. if not found then
  1939. proc_add(st,pd,objcidcall);
  1940. end;
  1941. end;
  1942. ProcdefOverloadList.Free;
  1943. end;
  1944. function tcallcandidates.proc_add(st:tsymtable;pd:tprocdef;objcidcall: boolean):pcandidate;
  1945. var
  1946. defaultparacnt : integer;
  1947. begin
  1948. { generate new candidate entry }
  1949. new(result);
  1950. fillchar(result^,sizeof(tcandidate),0);
  1951. result^.data:=pd;
  1952. result^.next:=FCandidateProcs;
  1953. FCandidateProcs:=result;
  1954. inc(FProccnt);
  1955. { Find last parameter, skip all default parameters
  1956. that are not passed. Ignore this skipping for varargs }
  1957. result^.firstparaidx:=pd.paras.count-1;
  1958. if not(po_varargs in pd.procoptions) then
  1959. begin
  1960. { ignore hidden parameters }
  1961. while (result^.firstparaidx>=0) and (vo_is_hidden_para in tparavarsym(pd.paras[result^.firstparaidx]).varoptions) do
  1962. dec(result^.firstparaidx);
  1963. defaultparacnt:=pd.maxparacount-FParalength;
  1964. if defaultparacnt>0 then
  1965. begin
  1966. if defaultparacnt>result^.firstparaidx+1 then
  1967. internalerror(200401141);
  1968. dec(result^.firstparaidx,defaultparacnt);
  1969. end;
  1970. end;
  1971. { Give a small penalty for overloaded methods not in
  1972. defined the current class/unit }
  1973. { when calling Objective-C methods via id.method, then the found
  1974. procsym will be inside an arbitrary ObjectSymtable, and we don't
  1975. want togive the methods of that particular objcclass precedence over
  1976. other methods, so instead check against the symtable in which this
  1977. objcclass is defined }
  1978. if objcidcall then
  1979. st:=st.defowner.owner;
  1980. if (st<>pd.owner) then
  1981. result^.ordinal_distance:=result^.ordinal_distance+1.0;
  1982. end;
  1983. procedure tcallcandidates.list(all:boolean);
  1984. var
  1985. hp : pcandidate;
  1986. begin
  1987. hp:=FCandidateProcs;
  1988. while assigned(hp) do
  1989. begin
  1990. if all or
  1991. (not hp^.invalid) then
  1992. MessagePos1(hp^.data.fileinfo,sym_h_param_list,hp^.data.fullprocname(false));
  1993. hp:=hp^.next;
  1994. end;
  1995. end;
  1996. {$ifdef EXTDEBUG}
  1997. procedure tcallcandidates.dump_info(lvl:longint);
  1998. function ParaTreeStr(p:tcallparanode):string;
  1999. begin
  2000. result:='';
  2001. while assigned(p) do
  2002. begin
  2003. if result<>'' then
  2004. result:=','+result;
  2005. result:=p.resultdef.typename+result;
  2006. p:=tcallparanode(p.right);
  2007. end;
  2008. end;
  2009. var
  2010. hp : pcandidate;
  2011. i : integer;
  2012. currpara : tparavarsym;
  2013. begin
  2014. if not CheckVerbosity(lvl) then
  2015. exit;
  2016. Comment(lvl+V_LineInfo,'Overloaded callnode: '+FProcsym.name+'('+ParaTreeStr(tcallparanode(FParaNode))+')');
  2017. hp:=FCandidateProcs;
  2018. while assigned(hp) do
  2019. begin
  2020. Comment(lvl,' '+hp^.data.fullprocname(false));
  2021. if (hp^.invalid) then
  2022. Comment(lvl,' invalid')
  2023. else
  2024. begin
  2025. Comment(lvl,' ex: '+tostr(hp^.exact_count)+
  2026. ' eq: '+tostr(hp^.equal_count)+
  2027. ' l1: '+tostr(hp^.cl1_count)+
  2028. ' l2: '+tostr(hp^.cl2_count)+
  2029. ' l3: '+tostr(hp^.cl3_count)+
  2030. ' l4: '+tostr(hp^.cl4_count)+
  2031. ' l5: '+tostr(hp^.cl5_count)+
  2032. ' oper: '+tostr(hp^.coper_count)+
  2033. ' ord: '+realtostr(hp^.ordinal_distance));
  2034. { Print parameters in left-right order }
  2035. for i:=0 to hp^.data.paras.count-1 do
  2036. begin
  2037. currpara:=tparavarsym(hp^.data.paras[i]);
  2038. if not(vo_is_hidden_para in currpara.varoptions) then
  2039. Comment(lvl,' - '+currpara.vardef.typename+' : '+EqualTypeName[currpara.eqval]);
  2040. end;
  2041. end;
  2042. hp:=hp^.next;
  2043. end;
  2044. end;
  2045. {$endif EXTDEBUG}
  2046. procedure tcallcandidates.get_information;
  2047. var
  2048. hp : pcandidate;
  2049. currpara : tparavarsym;
  2050. paraidx : integer;
  2051. currparanr : byte;
  2052. rfh,rth : double;
  2053. objdef : tobjectdef;
  2054. def_from,
  2055. def_to : tdef;
  2056. currpt,
  2057. pt : tcallparanode;
  2058. eq : tequaltype;
  2059. convtype : tconverttype;
  2060. pdtemp,
  2061. pdoper : tprocdef;
  2062. releasecurrpt : boolean;
  2063. cdoptions : tcompare_defs_options;
  2064. n : tnode;
  2065. {$ifopt r+}{$define ena_r}{$r-}{$endif}
  2066. {$ifopt q+}{$define ena_q}{$q-}{$endif}
  2067. const
  2068. inf=1.0/0.0;
  2069. {$ifdef ena_r}{$r+}{$endif}
  2070. {$ifdef ena_q}{$q+}{$endif}
  2071. begin
  2072. cdoptions:=[cdo_check_operator];
  2073. if FAllowVariant then
  2074. include(cdoptions,cdo_allow_variant);
  2075. { process all procs }
  2076. hp:=FCandidateProcs;
  2077. while assigned(hp) do
  2078. begin
  2079. { We compare parameters in reverse order (right to left),
  2080. the firstpara is already pointing to the last parameter
  2081. were we need to start comparing }
  2082. currparanr:=FParalength;
  2083. paraidx:=hp^.firstparaidx;
  2084. while (paraidx>=0) and (vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions) do
  2085. dec(paraidx);
  2086. pt:=tcallparanode(FParaNode);
  2087. while assigned(pt) and (paraidx>=0) do
  2088. begin
  2089. currpara:=tparavarsym(hp^.data.paras[paraidx]);
  2090. { currpt can be changed from loadn to calln when a procvar
  2091. is passed. This is to prevent that the change is permanent }
  2092. currpt:=pt;
  2093. releasecurrpt:=false;
  2094. { retrieve current parameter definitions to compares }
  2095. eq:=te_incompatible;
  2096. def_from:=currpt.resultdef;
  2097. def_to:=currpara.vardef;
  2098. if not(assigned(def_from)) then
  2099. internalerror(200212091);
  2100. if not(
  2101. assigned(def_to) or
  2102. ((po_varargs in hp^.data.procoptions) and
  2103. (currparanr>hp^.data.minparacount))
  2104. ) then
  2105. internalerror(200212092);
  2106. { Convert tp procvars when not expecting a procvar }
  2107. if (currpt.left.resultdef.typ=procvardef) and
  2108. not(def_to.typ in [procvardef,formaldef]) and
  2109. { Only convert to call when there is no overload or the return type
  2110. is equal to the expected type. }
  2111. (
  2112. (count=1) or
  2113. equal_defs(tprocvardef(currpt.left.resultdef).returndef,def_to)
  2114. ) then
  2115. begin
  2116. releasecurrpt:=true;
  2117. currpt:=tcallparanode(pt.getcopy);
  2118. if maybe_call_procvar(currpt.left,true) then
  2119. begin
  2120. currpt.resultdef:=currpt.left.resultdef;
  2121. def_from:=currpt.left.resultdef;
  2122. end;
  2123. end;
  2124. { If we expect a procvar and the left is loadnode that
  2125. returns a procdef we need to find the correct overloaded
  2126. procdef that matches the expected procvar. The loadnode
  2127. temporary returned the first procdef (PFV) }
  2128. if (def_to.typ=procvardef) and
  2129. (currpt.left.nodetype=loadn) and
  2130. (currpt.left.resultdef.typ=procdef) then
  2131. begin
  2132. pdtemp:=tprocsym(Tloadnode(currpt.left).symtableentry).Find_procdef_byprocvardef(Tprocvardef(def_to));
  2133. if assigned(pdtemp) then
  2134. begin
  2135. tloadnode(currpt.left).setprocdef(pdtemp);
  2136. currpt.resultdef:=currpt.left.resultdef;
  2137. def_from:=currpt.left.resultdef;
  2138. end;
  2139. end;
  2140. { varargs are always equal, but not exact }
  2141. if (po_varargs in hp^.data.procoptions) and
  2142. (currparanr>hp^.data.minparacount) and
  2143. not is_array_of_const(def_from) and
  2144. not is_array_constructor(def_from) then
  2145. eq:=te_equal
  2146. else
  2147. { same definition -> exact }
  2148. if (def_from=def_to) then
  2149. eq:=te_exact
  2150. else
  2151. { for value and const parameters check if a integer is constant or
  2152. included in other integer -> equal and calc ordinal_distance }
  2153. if not(currpara.varspez in [vs_var,vs_out]) and
  2154. is_integer(def_from) and
  2155. is_integer(def_to) and
  2156. is_in_limit(def_from,def_to) then
  2157. begin
  2158. eq:=te_equal;
  2159. hp^.ordinal_distance:=hp^.ordinal_distance+
  2160. abs(bestreal(torddef(def_from).low)-bestreal(torddef(def_to).low));
  2161. rth:=bestreal(torddef(def_to).high);
  2162. rfh:=bestreal(torddef(def_from).high);
  2163. hp^.ordinal_distance:=hp^.ordinal_distance+abs(rth-rfh);
  2164. { Give wrong sign a small penalty, this is need to get a diffrence
  2165. from word->[longword,longint] }
  2166. if is_signed(def_from)<>is_signed(def_to) then
  2167. {$push}
  2168. {$r-}
  2169. {$q-}
  2170. hp^.ordinal_distance:=nextafter(hp^.ordinal_distance,inf);
  2171. {$pop}
  2172. end
  2173. else
  2174. { for value and const parameters check precision of real, give
  2175. penalty for loosing of precision. var and out parameters must match exactly }
  2176. if not(currpara.varspez in [vs_var,vs_out]) and
  2177. is_real(def_from) and
  2178. is_real(def_to) then
  2179. begin
  2180. eq:=te_equal;
  2181. if is_extended(def_to) then
  2182. rth:=4
  2183. else
  2184. if is_double (def_to) then
  2185. rth:=2
  2186. else
  2187. rth:=1;
  2188. if is_extended(def_from) then
  2189. rfh:=4
  2190. else
  2191. if is_double (def_from) then
  2192. rfh:=2
  2193. else
  2194. rfh:=1;
  2195. { penalty for shrinking of precision }
  2196. if rth<rfh then
  2197. rfh:=(rfh-rth)*16
  2198. else
  2199. rfh:=rth-rfh;
  2200. hp^.ordinal_distance:=hp^.ordinal_distance+rfh;
  2201. end
  2202. else
  2203. { related object parameters also need to determine the distance between the current
  2204. object and the object we are comparing with. var and out parameters must match exactly }
  2205. if not(currpara.varspez in [vs_var,vs_out]) and
  2206. (def_from.typ=objectdef) and
  2207. (def_to.typ=objectdef) and
  2208. (tobjectdef(def_from).objecttype=tobjectdef(def_to).objecttype) and
  2209. tobjectdef(def_from).is_related(tobjectdef(def_to)) then
  2210. begin
  2211. eq:=te_convert_l1;
  2212. objdef:=tobjectdef(def_from);
  2213. while assigned(objdef) do
  2214. begin
  2215. if objdef=def_to then
  2216. break;
  2217. hp^.ordinal_distance:=hp^.ordinal_distance+1;
  2218. objdef:=objdef.childof;
  2219. end;
  2220. end
  2221. { compare_defs_ext compares sets and array constructors very poorly because
  2222. it has too little information. So we do explicitly a detailed comparisation,
  2223. see also bug #11288 (FK)
  2224. }
  2225. else if (def_to.typ=setdef) and is_array_constructor(currpt.left.resultdef) then
  2226. begin
  2227. n:=currpt.left.getcopy;
  2228. arrayconstructor_to_set(n);
  2229. eq:=compare_defs_ext(n.resultdef,def_to,n.nodetype,convtype,pdoper,cdoptions);
  2230. n.free;
  2231. end
  2232. else
  2233. { generic type comparision }
  2234. begin
  2235. eq:=compare_defs_ext(def_from,def_to,currpt.left.nodetype,convtype,pdoper,cdoptions);
  2236. { when the types are not equal we need to check
  2237. some special case for parameter passing }
  2238. if (eq<te_equal) then
  2239. begin
  2240. if currpara.varspez in [vs_var,vs_out] then
  2241. begin
  2242. { para requires an equal type so the previous found
  2243. match was not good enough, reset to incompatible }
  2244. eq:=te_incompatible;
  2245. { var_para_allowed will return te_equal and te_convert_l1 to
  2246. make a difference for best matching }
  2247. var_para_allowed(eq,currpt.resultdef,currpara.vardef,currpt.left)
  2248. end
  2249. else
  2250. para_allowed(eq,currpt,def_to);
  2251. end;
  2252. end;
  2253. { univ parameters match if the size matches (don't override the
  2254. comparison result if it was ok, since a match based on the
  2255. "univ" character is the lowest possible match) }
  2256. if (eq=te_incompatible) and
  2257. currpara.univpara and
  2258. is_valid_univ_para_type(def_from) and
  2259. (def_from.size=def_to.size) then
  2260. eq:=te_convert_l5;
  2261. { when a procvar was changed to a call an exact match is
  2262. downgraded to equal. This way an overload call with the
  2263. procvar is choosen. See tb0471 (PFV) }
  2264. if (pt<>currpt) and (eq=te_exact) then
  2265. eq:=te_equal;
  2266. { increase correct counter }
  2267. case eq of
  2268. te_exact :
  2269. inc(hp^.exact_count);
  2270. te_equal :
  2271. inc(hp^.equal_count);
  2272. te_convert_l1 :
  2273. inc(hp^.cl1_count);
  2274. te_convert_l2 :
  2275. inc(hp^.cl2_count);
  2276. te_convert_l3 :
  2277. inc(hp^.cl3_count);
  2278. te_convert_l4 :
  2279. inc(hp^.cl4_count);
  2280. te_convert_l5 :
  2281. inc(hp^.cl5_count);
  2282. te_convert_operator :
  2283. inc(hp^.coper_count);
  2284. te_incompatible :
  2285. hp^.invalid:=true;
  2286. else
  2287. internalerror(200212072);
  2288. end;
  2289. { stop checking when an incompatible parameter is found }
  2290. if hp^.invalid then
  2291. begin
  2292. { store the current parameter info for
  2293. a nice error message when no procedure is found }
  2294. hp^.wrongparaidx:=paraidx;
  2295. hp^.wrongparanr:=currparanr;
  2296. break;
  2297. end;
  2298. {$ifdef EXTDEBUG}
  2299. { store equal in node tree for dump }
  2300. currpara.eqval:=eq;
  2301. {$endif EXTDEBUG}
  2302. { maybe release temp currpt }
  2303. if releasecurrpt then
  2304. currpt.free;
  2305. { next parameter in the call tree }
  2306. pt:=tcallparanode(pt.right);
  2307. { next parameter for definition, only goto next para
  2308. if we're out of the varargs }
  2309. if not(po_varargs in hp^.data.procoptions) or
  2310. (currparanr<=hp^.data.maxparacount) then
  2311. begin
  2312. { Ignore vs_hidden parameters }
  2313. repeat
  2314. dec(paraidx);
  2315. until (paraidx<0) or not(vo_is_hidden_para in tparavarsym(hp^.data.paras[paraidx]).varoptions);
  2316. end;
  2317. dec(currparanr);
  2318. end;
  2319. if not(hp^.invalid) and
  2320. (assigned(pt) or (paraidx>=0) or (currparanr<>0)) then
  2321. internalerror(200212141);
  2322. { next candidate }
  2323. hp:=hp^.next;
  2324. end;
  2325. end;
  2326. function get_variantequaltype(def: tdef): tvariantequaltype;
  2327. const
  2328. variantorddef_cl: array[tordtype] of tvariantequaltype =
  2329. (tve_incompatible,tve_byte,tve_word,tve_cardinal,tve_chari64,
  2330. tve_shortint,tve_smallint,tve_longint,tve_chari64,
  2331. tve_boolformal,tve_boolformal,tve_boolformal,tve_boolformal,
  2332. tve_boolformal,tve_boolformal,tve_boolformal,tve_boolformal,
  2333. tve_chari64,tve_chari64,tve_dblcurrency);
  2334. { TODO: fixme for 128 bit floats }
  2335. variantfloatdef_cl: array[tfloattype] of tvariantequaltype =
  2336. (tve_single,tve_dblcurrency,tve_extended,tve_extended,
  2337. tve_dblcurrency,tve_dblcurrency,tve_extended);
  2338. variantstringdef_cl: array[tstringtype] of tvariantequaltype =
  2339. (tve_sstring,tve_astring,tve_astring,tve_wstring,tve_ustring);
  2340. begin
  2341. case def.typ of
  2342. orddef:
  2343. begin
  2344. result:=variantorddef_cl[torddef(def).ordtype];
  2345. end;
  2346. floatdef:
  2347. begin
  2348. result:=variantfloatdef_cl[tfloatdef(def).floattype];
  2349. end;
  2350. stringdef:
  2351. begin
  2352. result:=variantstringdef_cl[tstringdef(def).stringtype];
  2353. end;
  2354. formaldef:
  2355. begin
  2356. result:=tve_boolformal;
  2357. end;
  2358. else
  2359. begin
  2360. result:=tve_incompatible;
  2361. end;
  2362. end
  2363. end;
  2364. function is_better_candidate(currpd,bestpd:pcandidate):integer;
  2365. var
  2366. res : integer;
  2367. begin
  2368. {
  2369. Return values:
  2370. > 0 when currpd is better than bestpd
  2371. < 0 when bestpd is better than currpd
  2372. = 0 when both are equal
  2373. To choose the best candidate we use the following order:
  2374. - Incompatible flag
  2375. - (Smaller) Number of convert operator parameters.
  2376. - (Smaller) Number of convertlevel 2 parameters.
  2377. - (Smaller) Number of convertlevel 1 parameters.
  2378. - (Bigger) Number of exact parameters.
  2379. - (Smaller) Number of equal parameters.
  2380. - (Smaller) Total of ordinal distance. For example, the distance of a word
  2381. to a byte is 65535-255=65280.
  2382. }
  2383. if bestpd^.invalid then
  2384. begin
  2385. if currpd^.invalid then
  2386. res:=0
  2387. else
  2388. res:=1;
  2389. end
  2390. else
  2391. if currpd^.invalid then
  2392. res:=-1
  2393. else
  2394. begin
  2395. { less operator parameters? }
  2396. res:=(bestpd^.coper_count-currpd^.coper_count);
  2397. if (res=0) then
  2398. begin
  2399. { less cl5 parameters? }
  2400. res:=(bestpd^.cl5_count-currpd^.cl5_count);
  2401. if (res=0) then
  2402. begin
  2403. { less cl4 parameters? }
  2404. res:=(bestpd^.cl4_count-currpd^.cl4_count);
  2405. if (res=0) then
  2406. begin
  2407. { less cl3 parameters? }
  2408. res:=(bestpd^.cl3_count-currpd^.cl3_count);
  2409. if (res=0) then
  2410. begin
  2411. { less cl2 parameters? }
  2412. res:=(bestpd^.cl2_count-currpd^.cl2_count);
  2413. if (res=0) then
  2414. begin
  2415. { less cl1 parameters? }
  2416. res:=(bestpd^.cl1_count-currpd^.cl1_count);
  2417. if (res=0) then
  2418. begin
  2419. { more exact parameters? }
  2420. res:=(currpd^.exact_count-bestpd^.exact_count);
  2421. if (res=0) then
  2422. begin
  2423. { less equal parameters? }
  2424. res:=(bestpd^.equal_count-currpd^.equal_count);
  2425. if (res=0) then
  2426. begin
  2427. { smaller ordinal distance? }
  2428. if (currpd^.ordinal_distance<bestpd^.ordinal_distance) then
  2429. res:=1
  2430. else
  2431. if (currpd^.ordinal_distance>bestpd^.ordinal_distance) then
  2432. res:=-1
  2433. else
  2434. res:=0;
  2435. end;
  2436. end;
  2437. end;
  2438. end;
  2439. end;
  2440. end;
  2441. end;
  2442. end;
  2443. end;
  2444. is_better_candidate:=res;
  2445. end;
  2446. { Delphi precedence rules extracted from test programs. Only valid if passing
  2447. a variant parameter to overloaded procedures expecting exactly one parameter.
  2448. single > (char, currency, int64, shortstring, ansistring, widestring, extended, double)
  2449. double/currency > (char, int64, shortstring, ansistring, widestring, extended)
  2450. extended > (char, int64, shortstring, ansistring, widestring)
  2451. longint/cardinal > (int64, shortstring, ansistring, widestring, extended, double, single, char, currency)
  2452. smallint > (longint, int64, shortstring, ansistring, widestring, extended, double single, char, currency);
  2453. word > (longint, cardinal, int64, shortstring, ansistring, widestring, extended, double single, char, currency);
  2454. shortint > (longint, smallint, int64, shortstring, ansistring, widestring, extended, double, single, char, currency)
  2455. byte > (longint, cardinal, word, smallint, int64, shortstring, ansistring, widestring, extended, double, single, char, currency);
  2456. boolean/formal > (char, int64, shortstring, ansistring, widestring)
  2457. shortstring > (char, int64, ansistring, widestring)
  2458. ansistring > (char, int64, widestring)
  2459. widestring > (char, int64)
  2460. Relations not mentioned mean that they conflict: no decision possible }
  2461. function is_better_candidate_single_variant(currpd,bestpd:pcandidate):integer;
  2462. function calculate_relation(const currvcl, bestvcl, testvcl:
  2463. tvariantequaltype; const conflictvcls: tvariantequaltypes):integer;
  2464. begin
  2465. { if (bestvcl=conflictvcl) or
  2466. (currvcl=conflictvcl) then
  2467. result:=0
  2468. else if (bestvcl=testvcl) then
  2469. result:=-1
  2470. else result:=1 }
  2471. result:=1-2*ord(bestvcl=testvcl)+
  2472. ord(currvcl in conflictvcls)-ord(bestvcl in conflictvcls);
  2473. end;
  2474. function getfirstrealparaidx(pd: pcandidate): integer;
  2475. begin
  2476. { can be different for currpd and bestpd in case of overloaded }
  2477. { functions, e.g. lowercase():char and lowercase():shortstring }
  2478. { (depending on the calling convention and parameter order) }
  2479. result:=pd^.firstparaidx;
  2480. while (result>=0) and (vo_is_hidden_para in tparavarsym(pd^.data.paras[result]).varoptions) do
  2481. dec(result);
  2482. if (vo_is_hidden_para in tparavarsym(pd^.data.paras[result]).varoptions) then
  2483. internalerror(2006122803);
  2484. end;
  2485. var
  2486. currpara, bestpara: tparavarsym;
  2487. currvcl, bestvcl: tvariantequaltype;
  2488. begin
  2489. {
  2490. Return values:
  2491. > 0 when currpd is better than bestpd
  2492. < 0 when bestpd is better than currpd
  2493. = 0 when both are equal
  2494. }
  2495. currpara:=tparavarsym(currpd^.data.paras[getfirstrealparaidx(currpd)]);
  2496. bestpara:=tparavarsym(bestpd^.data.paras[getfirstrealparaidx(bestpd)]);
  2497. { if one of the parameters is a regular variant, fall back to the }
  2498. { default algorithm }
  2499. if (currpara.vardef.typ = variantdef) or
  2500. (bestpara.vardef.typ = variantdef) then
  2501. begin
  2502. result:=is_better_candidate(currpd,bestpd);
  2503. exit;
  2504. end;
  2505. currvcl:=get_variantequaltype(currpara.vardef);
  2506. bestvcl:=get_variantequaltype(bestpara.vardef);
  2507. { sanity check }
  2508. result:=-5;
  2509. { if both are the same, there is a conflict }
  2510. if (currvcl=bestvcl) then
  2511. result:=0
  2512. { if one of the two cannot be used as variant, the other is better }
  2513. else if (bestvcl=tve_incompatible) then
  2514. result:=1
  2515. else if (currvcl=tve_incompatible) then
  2516. result:=-1
  2517. { boolean and formal are better than chari64str, but conflict with }
  2518. { everything else }
  2519. else if (currvcl=tve_boolformal) or
  2520. (bestvcl=tve_boolformal) then
  2521. if (currvcl=tve_boolformal) then
  2522. result:=ord(bestvcl in [tve_chari64,tve_sstring,tve_astring,tve_wstring,tve_ustring])
  2523. else
  2524. result:=-ord(currvcl in [tve_chari64,tve_sstring,tve_astring,tve_wstring,tve_ustring])
  2525. { byte is better than everything else (we assume both aren't byte, }
  2526. { since there's only one parameter and that one can't be the same) }
  2527. else if (currvcl=tve_byte) or
  2528. (bestvcl=tve_byte) then
  2529. result:=calculate_relation(currvcl,bestvcl,tve_byte,[tve_shortint])
  2530. { shortint conflicts with word and cardinal, but is better than }
  2531. { everything else but byte (which has already been handled) }
  2532. else if (currvcl=tve_shortint) or
  2533. (bestvcl=tve_shortint) then
  2534. result:=calculate_relation(currvcl,bestvcl,tve_shortint,[tve_word, tve_cardinal])
  2535. { word conflicts with smallint, but is better than everything else }
  2536. { but shortint and byte (which has already been handled) }
  2537. else if (currvcl=tve_word) or
  2538. (bestvcl=tve_word) then
  2539. result:=calculate_relation(currvcl,bestvcl,tve_word,[tve_smallint])
  2540. { smallint conflicts with cardinal, but is better than everything }
  2541. { which has not yet been tested }
  2542. else if (currvcl=tve_smallint) or
  2543. (bestvcl=tve_smallint) then
  2544. result:=calculate_relation(currvcl,bestvcl,tve_smallint,[tve_cardinal])
  2545. { cardinal conflicts with each longint and is better than everything }
  2546. { which has not yet been tested }
  2547. else if (currvcl=tve_cardinal) or
  2548. (bestvcl=tve_cardinal) then
  2549. result:=calculate_relation(currvcl,bestvcl,tve_cardinal,[tve_longint])
  2550. { longint is better than everything which has not yet been tested }
  2551. else if (currvcl=tve_longint) or
  2552. (bestvcl=tve_longint) then
  2553. { if bestvcl=tve_longint then
  2554. result:=-1
  2555. else
  2556. result:=1 }
  2557. result:=1-2*ord(bestvcl=tve_longint)
  2558. { single is better than everything left }
  2559. else if (currvcl=tve_single) or
  2560. (bestvcl=tve_single) then
  2561. result:=1-2*ord(bestvcl=tve_single)
  2562. { double/comp/currency are better than everything left, and conflict }
  2563. { with each other (but that's already tested) }
  2564. else if (currvcl=tve_dblcurrency) or
  2565. (bestvcl=tve_dblcurrency) then
  2566. result:=1-2*ord(bestvcl=tve_dblcurrency)
  2567. { extended is better than everything left }
  2568. else if (currvcl=tve_extended) or
  2569. (bestvcl=tve_extended) then
  2570. result:=1-2*ord(bestvcl=tve_extended)
  2571. { shortstring is better than everything left }
  2572. else if (currvcl=tve_sstring) or
  2573. (bestvcl=tve_sstring) then
  2574. result:=1-2*ord(bestvcl=tve_sstring)
  2575. { ansistring is better than everything left }
  2576. else if (currvcl=tve_astring) or
  2577. (bestvcl=tve_astring) then
  2578. result:=1-2*ord(bestvcl=tve_astring)
  2579. { widestring is better than everything left }
  2580. else if (currvcl=tve_wstring) or
  2581. (bestvcl=tve_wstring) then
  2582. result:=1-2*ord(bestvcl=tve_wstring)
  2583. { unicodestring is better than everything left }
  2584. else if (currvcl=tve_ustring) or
  2585. (bestvcl=tve_ustring) then
  2586. result:=1-2*ord(bestvcl=tve_ustring);
  2587. { all possibilities should have been checked now }
  2588. if (result=-5) then
  2589. internalerror(2006122805);
  2590. end;
  2591. function tcallcandidates.choose_best(var bestpd:tabstractprocdef; singlevariant: boolean):integer;
  2592. var
  2593. besthpstart,
  2594. hp : pcandidate;
  2595. cntpd,
  2596. res : integer;
  2597. begin
  2598. {
  2599. Returns the number of candidates left and the
  2600. first candidate is returned in pdbest
  2601. }
  2602. { Setup the first procdef as best, only count it as a result
  2603. when it is valid }
  2604. bestpd:=FCandidateProcs^.data;
  2605. if FCandidateProcs^.invalid then
  2606. cntpd:=0
  2607. else
  2608. cntpd:=1;
  2609. if assigned(FCandidateProcs^.next) then
  2610. begin
  2611. besthpstart:=FCandidateProcs;
  2612. hp:=FCandidateProcs^.next;
  2613. while assigned(hp) do
  2614. begin
  2615. if not singlevariant then
  2616. res:=is_better_candidate(hp,besthpstart)
  2617. else
  2618. res:=is_better_candidate_single_variant(hp,besthpstart);
  2619. if (res>0) then
  2620. begin
  2621. { hp is better, flag all procs to be incompatible }
  2622. while (besthpstart<>hp) do
  2623. begin
  2624. besthpstart^.invalid:=true;
  2625. besthpstart:=besthpstart^.next;
  2626. end;
  2627. { besthpstart is already set to hp }
  2628. bestpd:=besthpstart^.data;
  2629. cntpd:=1;
  2630. end
  2631. else
  2632. if (res<0) then
  2633. begin
  2634. { besthpstart is better, flag current hp to be incompatible }
  2635. hp^.invalid:=true;
  2636. end
  2637. else
  2638. begin
  2639. { res=0, both are valid }
  2640. if not hp^.invalid then
  2641. inc(cntpd);
  2642. end;
  2643. hp:=hp^.next;
  2644. end;
  2645. end;
  2646. result:=cntpd;
  2647. end;
  2648. procedure tcallcandidates.find_wrong_para;
  2649. var
  2650. currparanr : smallint;
  2651. hp : pcandidate;
  2652. pt : tcallparanode;
  2653. wrongpara : tparavarsym;
  2654. begin
  2655. { Only process the first overloaded procdef }
  2656. hp:=FCandidateProcs;
  2657. { Find callparanode corresponding to the argument }
  2658. pt:=tcallparanode(FParanode);
  2659. currparanr:=FParalength;
  2660. while assigned(pt) and
  2661. (currparanr>hp^.wrongparanr) do
  2662. begin
  2663. pt:=tcallparanode(pt.right);
  2664. dec(currparanr);
  2665. end;
  2666. if (currparanr<>hp^.wrongparanr) or
  2667. not assigned(pt) then
  2668. internalerror(200212094);
  2669. { Show error message, when it was a var or out parameter
  2670. guess that it is a missing typeconv }
  2671. wrongpara:=tparavarsym(hp^.data.paras[hp^.wrongparaidx]);
  2672. if wrongpara.varspez in [vs_var,vs_out] then
  2673. begin
  2674. { Maybe passing the correct type but passing a const to var parameter }
  2675. if (compare_defs(pt.resultdef,wrongpara.vardef,pt.nodetype)<>te_incompatible) and
  2676. not valid_for_var(pt.left,true) then
  2677. CGMessagePos(pt.left.fileinfo,type_e_variable_id_expected)
  2678. else
  2679. CGMessagePos3(pt.left.fileinfo,parser_e_call_by_ref_without_typeconv,tostr(hp^.wrongparanr),
  2680. FullTypeName(pt.left.resultdef,wrongpara.vardef),
  2681. FullTypeName(wrongpara.vardef,pt.left.resultdef))
  2682. end
  2683. else
  2684. CGMessagePos3(pt.left.fileinfo,type_e_wrong_parameter_type,tostr(hp^.wrongparanr),
  2685. FullTypeName(pt.left.resultdef,wrongpara.vardef),
  2686. FullTypeName(wrongpara.vardef,pt.left.resultdef));
  2687. end;
  2688. procedure check_hints(const srsym: tsym; const symoptions: tsymoptions; const deprecatedmsg : pshortstring);
  2689. begin
  2690. if not assigned(srsym) then
  2691. internalerror(200602051);
  2692. if sp_hint_deprecated in symoptions then
  2693. if (sp_has_deprecated_msg in symoptions) and (deprecatedmsg <> nil) then
  2694. Message2(sym_w_deprecated_symbol_with_msg,srsym.realname,deprecatedmsg^)
  2695. else
  2696. Message1(sym_w_deprecated_symbol,srsym.realname);
  2697. if sp_hint_experimental in symoptions then
  2698. Message1(sym_w_experimental_symbol,srsym.realname);
  2699. if sp_hint_platform in symoptions then
  2700. Message1(sym_w_non_portable_symbol,srsym.realname);
  2701. if sp_hint_library in symoptions then
  2702. Message1(sym_w_library_symbol,srsym.realname);
  2703. if sp_hint_unimplemented in symoptions then
  2704. Message1(sym_w_non_implemented_symbol,srsym.realname);
  2705. end;
  2706. procedure check_ranges(const location: tfileposinfo; source: tnode; destdef: tdef);
  2707. begin
  2708. if not(cs_check_ordinal_size in current_settings.localswitches) then
  2709. exit;
  2710. { check if the assignment may cause a range check error }
  2711. { if its not explicit, and only if the values are }
  2712. { ordinals, enumdef and floatdef }
  2713. if assigned(destdef) and
  2714. (destdef.typ in [enumdef,orddef,floatdef]) and
  2715. not is_boolean(destdef) and
  2716. assigned(source.resultdef) and
  2717. (source.resultdef.typ in [enumdef,orddef,floatdef]) and
  2718. not is_boolean(source.resultdef) and
  2719. not is_constrealnode(source) then
  2720. begin
  2721. if ((destdef.size < source.resultdef.size) and
  2722. { s80real and sc80real have a different size but the same precision }
  2723. not((destdef.typ=floatdef) and
  2724. (source.resultdef.typ=floatdef) and
  2725. (tfloatdef(source.resultdef).floattype in [s80real,sc80real]) and
  2726. (tfloatdef(destdef).floattype in [s80real,sc80real]))) or
  2727. ((destdef.typ<>floatdef) and
  2728. (source.resultdef.typ<>floatdef) and
  2729. not is_in_limit(source.resultdef,destdef)) then
  2730. begin
  2731. if (cs_check_range in current_settings.localswitches) then
  2732. MessagePos(location,type_w_smaller_possible_range_check)
  2733. else
  2734. MessagePos(location,type_h_smaller_possible_range_check);
  2735. end;
  2736. end;
  2737. end;
  2738. end.