ncnv.pas 75 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192
  1. {
  2. $Id$
  3. Copyright (c) 2000-2002 by Florian Klaempfl
  4. Type checking and register allocation for type converting nodes
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit ncnv;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. node,
  23. symtype,symppu,
  24. defutil,defcmp,
  25. nld
  26. {$ifdef Delphi}
  27. ,dmisc
  28. {$endif}
  29. ;
  30. type
  31. ttypeconvnode = class(tunarynode)
  32. totype : ttype;
  33. convtype : tconverttype;
  34. constructor create(node : tnode;const t : ttype);virtual;
  35. constructor create_explicit(node : tnode;const t : ttype);
  36. constructor ppuload(t:tnodetype;ppufile:tcompilerppufile);override;
  37. procedure ppuwrite(ppufile:tcompilerppufile);override;
  38. procedure derefimpl;override;
  39. function getcopy : tnode;override;
  40. function pass_1 : tnode;override;
  41. function det_resulttype:tnode;override;
  42. procedure mark_write;override;
  43. function docompare(p: tnode) : boolean; override;
  44. private
  45. function resulttype_cord_to_pointer : tnode;
  46. function resulttype_chararray_to_string : tnode;
  47. function resulttype_string_to_chararray : tnode;
  48. function resulttype_string_to_string : tnode;
  49. function resulttype_char_to_string : tnode;
  50. function resulttype_char_to_chararray : tnode;
  51. function resulttype_int_to_real : tnode;
  52. function resulttype_real_to_real : tnode;
  53. function resulttype_cchar_to_pchar : tnode;
  54. function resulttype_cstring_to_pchar : tnode;
  55. function resulttype_char_to_char : tnode;
  56. function resulttype_arrayconstructor_to_set : tnode;
  57. function resulttype_pchar_to_string : tnode;
  58. function resulttype_interface_to_guid : tnode;
  59. function resulttype_dynarray_to_openarray : tnode;
  60. function resulttype_pwchar_to_string : tnode;
  61. function resulttype_variant_to_dynarray : tnode;
  62. function resulttype_dynarray_to_variant : tnode;
  63. function resulttype_call_helper(c : tconverttype) : tnode;
  64. protected
  65. function first_int_to_int : tnode;virtual;
  66. function first_cstring_to_pchar : tnode;virtual;
  67. function first_string_to_chararray : tnode;virtual;
  68. function first_char_to_string : tnode;virtual;
  69. function first_nothing : tnode;virtual;
  70. function first_array_to_pointer : tnode;virtual;
  71. function first_int_to_real : tnode;virtual;
  72. function first_real_to_real : tnode;virtual;
  73. function first_pointer_to_array : tnode;virtual;
  74. function first_cchar_to_pchar : tnode;virtual;
  75. function first_bool_to_int : tnode;virtual;
  76. function first_int_to_bool : tnode;virtual;
  77. function first_bool_to_bool : tnode;virtual;
  78. function first_proc_to_procvar : tnode;virtual;
  79. function first_load_smallset : tnode;virtual;
  80. function first_cord_to_pointer : tnode;virtual;
  81. function first_ansistring_to_pchar : tnode;virtual;
  82. function first_arrayconstructor_to_set : tnode;virtual;
  83. function first_class_to_intf : tnode;virtual;
  84. function first_char_to_char : tnode;virtual;
  85. function first_call_helper(c : tconverttype) : tnode;
  86. { these wrapper are necessary, because the first_* stuff is called }
  87. { through a table. Without the wrappers override wouldn't have }
  88. { any effect }
  89. function _first_int_to_int : tnode;
  90. function _first_cstring_to_pchar : tnode;
  91. function _first_string_to_chararray : tnode;
  92. function _first_char_to_string : tnode;
  93. function _first_nothing : tnode;
  94. function _first_array_to_pointer : tnode;
  95. function _first_int_to_real : tnode;
  96. function _first_real_to_real : tnode;
  97. function _first_pointer_to_array : tnode;
  98. function _first_cchar_to_pchar : tnode;
  99. function _first_bool_to_int : tnode;
  100. function _first_int_to_bool : tnode;
  101. function _first_bool_to_bool : tnode;
  102. function _first_proc_to_procvar : tnode;
  103. function _first_load_smallset : tnode;
  104. function _first_cord_to_pointer : tnode;
  105. function _first_ansistring_to_pchar : tnode;
  106. function _first_arrayconstructor_to_set : tnode;
  107. function _first_class_to_intf : tnode;
  108. function _first_char_to_char : tnode;
  109. procedure second_int_to_int;virtual;abstract;
  110. procedure second_string_to_string;virtual;abstract;
  111. procedure second_cstring_to_pchar;virtual;abstract;
  112. procedure second_string_to_chararray;virtual;abstract;
  113. procedure second_array_to_pointer;virtual;abstract;
  114. procedure second_pointer_to_array;virtual;abstract;
  115. procedure second_chararray_to_string;virtual;abstract;
  116. procedure second_char_to_string;virtual;abstract;
  117. procedure second_int_to_real;virtual;abstract;
  118. procedure second_real_to_real;virtual;abstract;
  119. procedure second_cord_to_pointer;virtual;abstract;
  120. procedure second_proc_to_procvar;virtual;abstract;
  121. procedure second_bool_to_int;virtual;abstract;
  122. procedure second_int_to_bool;virtual;abstract;
  123. procedure second_bool_to_bool;virtual;abstract;
  124. procedure second_load_smallset;virtual;abstract;
  125. procedure second_ansistring_to_pchar;virtual;abstract;
  126. procedure second_class_to_intf;virtual;abstract;
  127. procedure second_char_to_char;virtual;abstract;
  128. procedure second_nothing; virtual;abstract;
  129. end;
  130. ttypeconvnodeclass = class of ttypeconvnode;
  131. tasnode = class(tbinarynode)
  132. constructor create(l,r : tnode);virtual;
  133. function pass_1 : tnode;override;
  134. function det_resulttype:tnode;override;
  135. function getcopy: tnode;override;
  136. destructor destroy; override;
  137. protected
  138. call: tnode;
  139. end;
  140. tasnodeclass = class of tasnode;
  141. tisnode = class(tbinarynode)
  142. constructor create(l,r : tnode);virtual;
  143. function pass_1 : tnode;override;
  144. function det_resulttype:tnode;override;
  145. procedure pass_2;override;
  146. end;
  147. tisnodeclass = class of tisnode;
  148. var
  149. ctypeconvnode : ttypeconvnodeclass;
  150. casnode : tasnodeclass;
  151. cisnode : tisnodeclass;
  152. procedure inserttypeconv(var p:tnode;const t:ttype);
  153. procedure inserttypeconv_explicit(var p:tnode;const t:ttype);
  154. procedure arrayconstructor_to_set(var p : tnode);
  155. implementation
  156. uses
  157. globtype,systems,tokens,
  158. cutils,verbose,globals,widestr,
  159. symconst,symdef,symsym,symtable,
  160. ncon,ncal,nset,nadd,ninl,nmem,nmat,
  161. cgbase,
  162. htypechk,pass_1,cpubase,cpuinfo;
  163. {*****************************************************************************
  164. Helpers
  165. *****************************************************************************}
  166. procedure inserttypeconv(var p:tnode;const t:ttype);
  167. begin
  168. if not assigned(p.resulttype.def) then
  169. begin
  170. resulttypepass(p);
  171. if codegenerror then
  172. exit;
  173. end;
  174. { don't insert obsolete type conversions }
  175. if equal_defs(p.resulttype.def,t.def) and
  176. not ((p.resulttype.def.deftype=setdef) and
  177. (tsetdef(p.resulttype.def).settype <>
  178. tsetdef(t.def).settype)) then
  179. begin
  180. p.resulttype:=t;
  181. end
  182. else
  183. begin
  184. p:=ctypeconvnode.create(p,t);
  185. resulttypepass(p);
  186. end;
  187. end;
  188. procedure inserttypeconv_explicit(var p:tnode;const t:ttype);
  189. begin
  190. if not assigned(p.resulttype.def) then
  191. begin
  192. resulttypepass(p);
  193. if codegenerror then
  194. exit;
  195. end;
  196. { don't insert obsolete type conversions }
  197. if equal_defs(p.resulttype.def,t.def) and
  198. not ((p.resulttype.def.deftype=setdef) and
  199. (tsetdef(p.resulttype.def).settype <>
  200. tsetdef(t.def).settype)) then
  201. begin
  202. p.resulttype:=t;
  203. end
  204. else
  205. begin
  206. p:=ctypeconvnode.create_explicit(p,t);
  207. resulttypepass(p);
  208. end;
  209. end;
  210. {*****************************************************************************
  211. Array constructor to Set Conversion
  212. *****************************************************************************}
  213. procedure arrayconstructor_to_set(var p : tnode);
  214. var
  215. constp : tsetconstnode;
  216. buildp,
  217. p2,p3,p4 : tnode;
  218. htype : ttype;
  219. constset : Pconstset;
  220. constsetlo,
  221. constsethi : longint;
  222. procedure update_constsethi(t:ttype);
  223. begin
  224. if ((t.def.deftype=orddef) and
  225. (torddef(t.def).high>=constsethi)) then
  226. begin
  227. constsethi:=torddef(t.def).high;
  228. if htype.def=nil then
  229. begin
  230. if (constsethi>255) or
  231. (torddef(t.def).low<0) then
  232. htype:=u8bittype
  233. else
  234. htype:=t;
  235. end;
  236. if constsethi>255 then
  237. constsethi:=255;
  238. end
  239. else if ((t.def.deftype=enumdef) and
  240. (tenumdef(t.def).max>=constsethi)) then
  241. begin
  242. if htype.def=nil then
  243. htype:=t;
  244. constsethi:=tenumdef(t.def).max;
  245. end;
  246. end;
  247. procedure do_set(pos : longint);
  248. {$ifdef oldset}
  249. var
  250. mask,l : longint;
  251. {$endif}
  252. begin
  253. if (pos and not $ff)<>0 then
  254. Message(parser_e_illegal_set_expr);
  255. if pos>constsethi then
  256. constsethi:=pos;
  257. if pos<constsetlo then
  258. constsetlo:=pos;
  259. {$ifdef oldset}
  260. { to do this correctly we use the 32bit array }
  261. l:=pos shr 5;
  262. mask:=1 shl (pos mod 32);
  263. { do we allow the same twice }
  264. if (pconst32bitset(constset)^[l] and mask)<>0 then
  265. Message(parser_e_illegal_set_expr);
  266. pconst32bitset(constset)^[l]:=pconst32bitset(constset)^[l] or mask;
  267. {$else}
  268. if pos in constset^ then
  269. Message(parser_e_illegal_set_expr);
  270. include(constset^,pos);
  271. {$endif}
  272. end;
  273. var
  274. l : Longint;
  275. lr,hr : TConstExprInt;
  276. hp : tarrayconstructornode;
  277. begin
  278. if p.nodetype<>arrayconstructorn then
  279. internalerror(200205105);
  280. new(constset);
  281. {$ifdef oldset}
  282. FillChar(constset^,sizeof(constset^),0);
  283. {$else}
  284. constset^:=[];
  285. {$endif}
  286. htype.reset;
  287. constsetlo:=0;
  288. constsethi:=0;
  289. constp:=csetconstnode.create(nil,htype);
  290. constp.value_set:=constset;
  291. buildp:=constp;
  292. hp:=tarrayconstructornode(p);
  293. if assigned(hp.left) then
  294. begin
  295. while assigned(hp) do
  296. begin
  297. p4:=nil; { will contain the tree to create the set }
  298. {split a range into p2 and p3 }
  299. if hp.left.nodetype=arrayconstructorrangen then
  300. begin
  301. p2:=tarrayconstructorrangenode(hp.left).left;
  302. p3:=tarrayconstructorrangenode(hp.left).right;
  303. tarrayconstructorrangenode(hp.left).left:=nil;
  304. tarrayconstructorrangenode(hp.left).right:=nil;
  305. end
  306. else
  307. begin
  308. p2:=hp.left;
  309. hp.left:=nil;
  310. p3:=nil;
  311. end;
  312. resulttypepass(p2);
  313. if assigned(p3) then
  314. resulttypepass(p3);
  315. if codegenerror then
  316. break;
  317. case p2.resulttype.def.deftype of
  318. enumdef,
  319. orddef:
  320. begin
  321. getrange(p2.resulttype.def,lr,hr);
  322. if assigned(p3) then
  323. begin
  324. { this isn't good, you'll get problems with
  325. type t010 = 0..10;
  326. ts = set of t010;
  327. var s : ts;b : t010
  328. begin s:=[1,2,b]; end.
  329. if is_integer(p3^.resulttype.def) then
  330. begin
  331. inserttypeconv(p3,u8bitdef);
  332. end;
  333. }
  334. if assigned(htype.def) and not(equal_defs(htype.def,p3.resulttype.def)) then
  335. begin
  336. aktfilepos:=p3.fileinfo;
  337. CGMessage(type_e_typeconflict_in_set);
  338. end
  339. else
  340. begin
  341. if (p2.nodetype=ordconstn) and (p3.nodetype=ordconstn) then
  342. begin
  343. if not(is_integer(p3.resulttype.def)) then
  344. htype:=p3.resulttype
  345. else
  346. begin
  347. inserttypeconv(p3,u8bittype);
  348. inserttypeconv(p2,u8bittype);
  349. end;
  350. for l:=tordconstnode(p2).value to tordconstnode(p3).value do
  351. do_set(l);
  352. p2.free;
  353. p3.free;
  354. end
  355. else
  356. begin
  357. update_constsethi(p2.resulttype);
  358. inserttypeconv(p2,htype);
  359. update_constsethi(p3.resulttype);
  360. inserttypeconv(p3,htype);
  361. if assigned(htype.def) then
  362. inserttypeconv(p3,htype)
  363. else
  364. inserttypeconv(p3,u8bittype);
  365. p4:=csetelementnode.create(p2,p3);
  366. end;
  367. end;
  368. end
  369. else
  370. begin
  371. { Single value }
  372. if p2.nodetype=ordconstn then
  373. begin
  374. if not(is_integer(p2.resulttype.def)) then
  375. update_constsethi(p2.resulttype)
  376. else
  377. inserttypeconv(p2,u8bittype);
  378. do_set(tordconstnode(p2).value);
  379. p2.free;
  380. end
  381. else
  382. begin
  383. update_constsethi(p2.resulttype);
  384. if assigned(htype.def) then
  385. inserttypeconv(p2,htype)
  386. else
  387. inserttypeconv(p2,u8bittype);
  388. p4:=csetelementnode.create(p2,nil);
  389. end;
  390. end;
  391. end;
  392. stringdef :
  393. begin
  394. { if we've already set elements which are constants }
  395. { throw an error }
  396. if ((htype.def=nil) and assigned(buildp)) or
  397. not(is_char(htype.def)) then
  398. CGMessage(type_e_typeconflict_in_set)
  399. else
  400. for l:=1 to length(pstring(tstringconstnode(p2).value_str)^) do
  401. do_set(ord(pstring(tstringconstnode(p2).value_str)^[l]));
  402. if htype.def=nil then
  403. htype:=cchartype;
  404. p2.free;
  405. end;
  406. else
  407. CGMessage(type_e_ordinal_expr_expected);
  408. end;
  409. { insert the set creation tree }
  410. if assigned(p4) then
  411. buildp:=caddnode.create(addn,buildp,p4);
  412. { load next and dispose current node }
  413. p2:=hp;
  414. hp:=tarrayconstructornode(tarrayconstructornode(p2).right);
  415. tarrayconstructornode(p2).right:=nil;
  416. p2.free;
  417. end;
  418. if (htype.def=nil) then
  419. htype:=u8bittype;
  420. end
  421. else
  422. begin
  423. { empty set [], only remove node }
  424. p.free;
  425. end;
  426. { set the initial set type }
  427. constp.resulttype.setdef(tsetdef.create(htype,constsethi));
  428. { determine the resulttype for the tree }
  429. resulttypepass(buildp);
  430. { set the new tree }
  431. p:=buildp;
  432. end;
  433. {*****************************************************************************
  434. TTYPECONVNODE
  435. *****************************************************************************}
  436. constructor ttypeconvnode.create(node : tnode;const t:ttype);
  437. begin
  438. inherited create(typeconvn,node);
  439. convtype:=tc_not_possible;
  440. totype:=t;
  441. if t.def=nil then
  442. internalerror(200103281);
  443. set_file_line(node);
  444. end;
  445. constructor ttypeconvnode.create_explicit(node : tnode;const t:ttype);
  446. begin
  447. self.create(node,t);
  448. toggleflag(nf_explizit);
  449. end;
  450. constructor ttypeconvnode.ppuload(t:tnodetype;ppufile:tcompilerppufile);
  451. begin
  452. inherited ppuload(t,ppufile);
  453. ppufile.gettype(totype);
  454. convtype:=tconverttype(ppufile.getbyte);
  455. end;
  456. procedure ttypeconvnode.ppuwrite(ppufile:tcompilerppufile);
  457. begin
  458. inherited ppuwrite(ppufile);
  459. ppufile.puttype(totype);
  460. ppufile.putbyte(byte(convtype));
  461. end;
  462. procedure ttypeconvnode.derefimpl;
  463. begin
  464. inherited derefimpl;
  465. totype.resolve;
  466. end;
  467. function ttypeconvnode.getcopy : tnode;
  468. var
  469. n : ttypeconvnode;
  470. begin
  471. n:=ttypeconvnode(inherited getcopy);
  472. n.convtype:=convtype;
  473. getcopy:=n;
  474. end;
  475. function ttypeconvnode.resulttype_cord_to_pointer : tnode;
  476. var
  477. t : tnode;
  478. begin
  479. result:=nil;
  480. if left.nodetype=ordconstn then
  481. begin
  482. { check if we have a valid pointer constant (JM) }
  483. if (sizeof(pointer) > sizeof(TConstPtrUInt)) then
  484. if (sizeof(TConstPtrUInt) = 4) then
  485. begin
  486. if (tordconstnode(left).value < low(longint)) or
  487. (tordconstnode(left).value > high(cardinal)) then
  488. CGMessage(parser_e_range_check_error);
  489. end
  490. else if (sizeof(TConstPtrUInt) = 8) then
  491. begin
  492. if (tordconstnode(left).value < low(int64)) or
  493. (tordconstnode(left).value > high(qword)) then
  494. CGMessage(parser_e_range_check_error);
  495. end
  496. else
  497. internalerror(2001020801);
  498. t:=cpointerconstnode.create(TConstPtrUInt(tordconstnode(left).value),resulttype);
  499. result:=t;
  500. end
  501. else
  502. internalerror(200104023);
  503. end;
  504. function ttypeconvnode.resulttype_chararray_to_string : tnode;
  505. begin
  506. result := ccallnode.createinternres(
  507. 'fpc_chararray_to_'+tstringdef(resulttype.def).stringtypname,
  508. ccallparanode.create(left,nil),resulttype);
  509. left := nil;
  510. end;
  511. function ttypeconvnode.resulttype_string_to_chararray : tnode;
  512. var
  513. arrsize: longint;
  514. begin
  515. with tarraydef(resulttype.def) do
  516. begin
  517. if highrange<lowrange then
  518. internalerror(75432653);
  519. arrsize := highrange-lowrange+1;
  520. end;
  521. if (left.nodetype = stringconstn) and
  522. { left.length+1 since there's always a terminating #0 character (JM) }
  523. (tstringconstnode(left).len+1 >= arrsize) and
  524. (tstringdef(left.resulttype.def).string_typ=st_shortstring) then
  525. begin
  526. { handled separately }
  527. result := nil;
  528. exit;
  529. end;
  530. result := ccallnode.createinternres(
  531. 'fpc_'+tstringdef(left.resulttype.def).stringtypname+
  532. '_to_chararray',ccallparanode.create(left,ccallparanode.create(
  533. cordconstnode.create(arrsize,s32bittype,true),nil)),resulttype);
  534. left := nil;
  535. end;
  536. function ttypeconvnode.resulttype_string_to_string : tnode;
  537. var
  538. procname: string[31];
  539. stringpara : tcallparanode;
  540. pw : pcompilerwidestring;
  541. pc : pchar;
  542. begin
  543. result:=nil;
  544. if left.nodetype=stringconstn then
  545. begin
  546. { convert ascii 2 unicode }
  547. if (tstringdef(resulttype.def).string_typ=st_widestring) and
  548. (tstringconstnode(left).st_type in [st_ansistring,st_shortstring,st_longstring]) then
  549. begin
  550. initwidestring(pw);
  551. ascii2unicode(tstringconstnode(left).value_str,tstringconstnode(left).len,pw);
  552. ansistringdispose(tstringconstnode(left).value_str,tstringconstnode(left).len);
  553. pcompilerwidestring(tstringconstnode(left).value_str):=pw;
  554. end
  555. else
  556. { convert unicode 2 ascii }
  557. if (tstringconstnode(left).st_type=st_widestring) and
  558. (tstringdef(resulttype.def).string_typ in [st_ansistring,st_shortstring,st_longstring]) then
  559. begin
  560. pw:=pcompilerwidestring(tstringconstnode(left).value_str);
  561. getmem(pc,getlengthwidestring(pw)+1);
  562. unicode2ascii(pw,pc);
  563. donewidestring(pw);
  564. tstringconstnode(left).value_str:=pc;
  565. end;
  566. tstringconstnode(left).st_type:=tstringdef(resulttype.def).string_typ;
  567. tstringconstnode(left).resulttype:=resulttype;
  568. result:=left;
  569. left:=nil;
  570. end
  571. else
  572. begin
  573. { get the correct procedure name }
  574. procname := 'fpc_'+tstringdef(left.resulttype.def).stringtypname+
  575. '_to_'+tstringdef(resulttype.def).stringtypname;
  576. { create parameter (and remove left node from typeconvnode }
  577. { since it's reused as parameter) }
  578. stringpara := ccallparanode.create(left,nil);
  579. left := nil;
  580. { when converting to shortstrings, we have to pass high(destination) too }
  581. if (tstringdef(resulttype.def).string_typ = st_shortstring) then
  582. stringpara.right := ccallparanode.create(cinlinenode.create(
  583. in_high_x,false,self.getcopy),nil);
  584. { and create the callnode }
  585. result := ccallnode.createinternres(procname,stringpara,resulttype);
  586. end;
  587. end;
  588. function ttypeconvnode.resulttype_char_to_string : tnode;
  589. var
  590. procname: string[31];
  591. para : tcallparanode;
  592. hp : tstringconstnode;
  593. ws : pcompilerwidestring;
  594. begin
  595. result:=nil;
  596. if left.nodetype=ordconstn then
  597. begin
  598. if tstringdef(resulttype.def).string_typ=st_widestring then
  599. begin
  600. initwidestring(ws);
  601. concatwidestringchar(ws,tcompilerwidechar(chr(tordconstnode(left).value)));
  602. hp:=cstringconstnode.createwstr(ws);
  603. donewidestring(ws);
  604. end
  605. else
  606. hp:=cstringconstnode.createstr(chr(tordconstnode(left).value),tstringdef(resulttype.def).string_typ);
  607. result:=hp;
  608. end
  609. else
  610. { shortstrings are handled 'inline' }
  611. if tstringdef(resulttype.def).string_typ <> st_shortstring then
  612. begin
  613. { create the parameter }
  614. para := ccallparanode.create(left,nil);
  615. left := nil;
  616. { and the procname }
  617. procname := 'fpc_char_to_' +tstringdef(resulttype.def).stringtypname;
  618. { and finally the call }
  619. result := ccallnode.createinternres(procname,para,resulttype);
  620. end
  621. else
  622. begin
  623. { create word(byte(char) shl 8 or 1) for litte endian machines }
  624. { and word(byte(char) or 256) for big endian machines }
  625. left := ctypeconvnode.create(left,u8bittype);
  626. left.toggleflag(nf_explizit);
  627. if (target_info.endian = endian_little) then
  628. left := caddnode.create(orn,
  629. cshlshrnode.create(shln,left,cordconstnode.create(8,s32bittype,false)),
  630. cordconstnode.create(1,s32bittype,false))
  631. else
  632. left := caddnode.create(orn,left,
  633. cordconstnode.create(1 shl 8,s32bittype,false));
  634. left := ctypeconvnode.create(left,u16bittype);
  635. left.toggleflag(nf_explizit);
  636. resulttypepass(left);
  637. end;
  638. end;
  639. function ttypeconvnode.resulttype_char_to_chararray : tnode;
  640. begin
  641. if resulttype.def.size <> 1 then
  642. begin
  643. { convert first to string, then to chararray }
  644. inserttypeconv(left,cshortstringtype);
  645. inserttypeconv(left,resulttype);
  646. result:=left;
  647. left := nil;
  648. exit;
  649. end;
  650. result := nil;
  651. end;
  652. function ttypeconvnode.resulttype_char_to_char : tnode;
  653. var
  654. hp : tordconstnode;
  655. begin
  656. result:=nil;
  657. if left.nodetype=ordconstn then
  658. begin
  659. if (torddef(resulttype.def).typ=uchar) and
  660. (torddef(left.resulttype.def).typ=uwidechar) then
  661. begin
  662. hp:=cordconstnode.create(
  663. ord(unicode2asciichar(tcompilerwidechar(tordconstnode(left).value))),
  664. cchartype,true);
  665. result:=hp;
  666. end
  667. else if (torddef(resulttype.def).typ=uwidechar) and
  668. (torddef(left.resulttype.def).typ=uchar) then
  669. begin
  670. hp:=cordconstnode.create(
  671. asciichar2unicode(chr(tordconstnode(left).value)),
  672. cwidechartype,true);
  673. result:=hp;
  674. end
  675. else
  676. internalerror(200105131);
  677. exit;
  678. end;
  679. end;
  680. function ttypeconvnode.resulttype_int_to_real : tnode;
  681. var
  682. t : trealconstnode;
  683. rv : bestreal;
  684. begin
  685. result:=nil;
  686. if left.nodetype=ordconstn then
  687. begin
  688. rv:=tordconstnode(left).value;
  689. if is_currency(resulttype.def) then
  690. rv:=rv*10000.0;
  691. t:=crealconstnode.create(rv,resulttype);
  692. result:=t;
  693. end
  694. else
  695. begin
  696. { multiply by 10000 for currency. We need to use getcopy to pass
  697. the argument because the current node is always disposed. Only
  698. inserting the multiply in the left node is not possible because
  699. it'll get in an infinite loop to convert int->currency }
  700. if is_currency(resulttype.def) then
  701. begin
  702. result:=caddnode.create(muln,getcopy,crealconstnode.create(10000.0,resulttype));
  703. include(result.flags,nf_explizit);
  704. end;
  705. end;
  706. end;
  707. function ttypeconvnode.resulttype_real_to_real : tnode;
  708. var
  709. t : tnode;
  710. begin
  711. result:=nil;
  712. if is_currency(left.resulttype.def) and not(is_currency(resulttype.def)) then
  713. begin
  714. left:=caddnode.create(slashn,left,crealconstnode.create(10000.0,left.resulttype));
  715. include(left.flags,nf_explizit);
  716. resulttypepass(left);
  717. end
  718. else
  719. if is_currency(resulttype.def) and not(is_currency(left.resulttype.def)) then
  720. begin
  721. left:=caddnode.create(muln,left,crealconstnode.create(10000.0,left.resulttype));
  722. include(left.flags,nf_explizit);
  723. resulttypepass(left);
  724. end;
  725. if left.nodetype=realconstn then
  726. begin
  727. t:=crealconstnode.create(trealconstnode(left).value_real,resulttype);
  728. result:=t;
  729. end;
  730. end;
  731. function ttypeconvnode.resulttype_cchar_to_pchar : tnode;
  732. begin
  733. result:=nil;
  734. if is_pwidechar(resulttype.def) then
  735. inserttypeconv(left,cwidestringtype)
  736. else
  737. inserttypeconv(left,cshortstringtype);
  738. { evaluate again, reset resulttype so the convert_typ
  739. will be calculated again and cstring_to_pchar will
  740. be used for futher conversion }
  741. result:=det_resulttype;
  742. end;
  743. function ttypeconvnode.resulttype_cstring_to_pchar : tnode;
  744. begin
  745. result:=nil;
  746. if is_pwidechar(resulttype.def) then
  747. inserttypeconv(left,cwidestringtype);
  748. end;
  749. function ttypeconvnode.resulttype_arrayconstructor_to_set : tnode;
  750. var
  751. hp : tnode;
  752. begin
  753. result:=nil;
  754. if left.nodetype<>arrayconstructorn then
  755. internalerror(5546);
  756. { remove typeconv node }
  757. hp:=left;
  758. left:=nil;
  759. { create a set constructor tree }
  760. arrayconstructor_to_set(hp);
  761. result:=hp;
  762. end;
  763. function ttypeconvnode.resulttype_pchar_to_string : tnode;
  764. begin
  765. result := ccallnode.createinternres(
  766. 'fpc_pchar_to_'+tstringdef(resulttype.def).stringtypname,
  767. ccallparanode.create(left,nil),resulttype);
  768. left := nil;
  769. end;
  770. function ttypeconvnode.resulttype_interface_to_guid : tnode;
  771. begin
  772. if assigned(tobjectdef(left.resulttype.def).iidguid) then
  773. result:=cguidconstnode.create(tobjectdef(left.resulttype.def).iidguid^);
  774. end;
  775. function ttypeconvnode.resulttype_dynarray_to_openarray : tnode;
  776. begin
  777. { a dynamic array is a pointer to an array, so to convert it to }
  778. { an open array, we have to dereference it (JM) }
  779. result := ctypeconvnode.create(left,voidpointertype);
  780. { left is reused }
  781. left := nil;
  782. result.toggleflag(nf_explizit);
  783. result := cderefnode.create(result);
  784. result.resulttype := resulttype;
  785. end;
  786. function ttypeconvnode.resulttype_pwchar_to_string : tnode;
  787. begin
  788. result := ccallnode.createinternres(
  789. 'fpc_pwidechar_to_'+tstringdef(resulttype.def).stringtypname,
  790. ccallparanode.create(left,nil),resulttype);
  791. left := nil;
  792. end;
  793. function ttypeconvnode.resulttype_variant_to_dynarray : tnode;
  794. begin
  795. result := ccallnode.createinternres(
  796. 'fpc_variant_to_dynarray',
  797. ccallparanode.create(caddrnode.create(crttinode.create(tstoreddef(resulttype.def),initrtti)),
  798. ccallparanode.create(left,nil)
  799. ),resulttype);
  800. left := nil;
  801. end;
  802. function ttypeconvnode.resulttype_dynarray_to_variant : tnode;
  803. begin
  804. result:=nil;
  805. end;
  806. function ttypeconvnode.resulttype_call_helper(c : tconverttype) : tnode;
  807. {$ifdef fpc}
  808. const
  809. resulttypeconvert : array[tconverttype] of pointer = (
  810. {equal} nil,
  811. {not_possible} nil,
  812. { string_2_string } @ttypeconvnode.resulttype_string_to_string,
  813. { char_2_string } @ttypeconvnode.resulttype_char_to_string,
  814. { char_2_chararray } @ttypeconvnode.resulttype_char_to_chararray,
  815. { pchar_2_string } @ttypeconvnode.resulttype_pchar_to_string,
  816. { cchar_2_pchar } @ttypeconvnode.resulttype_cchar_to_pchar,
  817. { cstring_2_pchar } @ttypeconvnode.resulttype_cstring_to_pchar,
  818. { ansistring_2_pchar } nil,
  819. { string_2_chararray } @ttypeconvnode.resulttype_string_to_chararray,
  820. { chararray_2_string } @ttypeconvnode.resulttype_chararray_to_string,
  821. { array_2_pointer } nil,
  822. { pointer_2_array } nil,
  823. { int_2_int } nil,
  824. { int_2_bool } nil,
  825. { bool_2_bool } nil,
  826. { bool_2_int } nil,
  827. { real_2_real } @ttypeconvnode.resulttype_real_to_real,
  828. { int_2_real } @ttypeconvnode.resulttype_int_to_real,
  829. { proc_2_procvar } nil,
  830. { arrayconstructor_2_set } @ttypeconvnode.resulttype_arrayconstructor_to_set,
  831. { load_smallset } nil,
  832. { cord_2_pointer } @ttypeconvnode.resulttype_cord_to_pointer,
  833. { intf_2_string } nil,
  834. { intf_2_guid } @ttypeconvnode.resulttype_interface_to_guid,
  835. { class_2_intf } nil,
  836. { char_2_char } @ttypeconvnode.resulttype_char_to_char,
  837. { normal_2_smallset} nil,
  838. { dynarray_2_openarray} @resulttype_dynarray_to_openarray,
  839. { pwchar_2_string} @resulttype_pwchar_to_string,
  840. { variant_2_dynarray} @resulttype_variant_to_dynarray,
  841. { dynarray_2_variant} @resulttype_dynarray_to_variant
  842. );
  843. type
  844. tprocedureofobject = function : tnode of object;
  845. var
  846. r : packed record
  847. proc : pointer;
  848. obj : pointer;
  849. end;
  850. begin
  851. result:=nil;
  852. { this is a little bit dirty but it works }
  853. { and should be quite portable too }
  854. r.proc:=resulttypeconvert[c];
  855. r.obj:=self;
  856. if assigned(r.proc) then
  857. result:=tprocedureofobject(r){$ifdef FPC}();{$endif FPC}
  858. end;
  859. {$else}
  860. begin
  861. case c of
  862. tc_string_2_string: resulttype_string_to_string;
  863. tc_char_2_string : resulttype_char_to_string;
  864. tc_char_2_chararray: resulttype_char_to_chararray;
  865. tc_pchar_2_string : resulttype_pchar_to_string;
  866. tc_cchar_2_pchar : resulttype_cchar_to_pchar;
  867. tc_cstring_2_pchar : resulttype_cstring_to_pchar;
  868. tc_string_2_chararray : resulttype_string_to_chararray;
  869. tc_chararray_2_string : resulttype_chararray_to_string;
  870. tc_real_2_real : resulttype_real_to_real;
  871. tc_int_2_real : resulttype_int_to_real;
  872. tc_arrayconstructor_2_set : resulttype_arrayconstructor_to_set;
  873. tc_cord_2_pointer : resulttype_cord_to_pointer;
  874. tc_intf_2_guid : resulttype_interface_to_guid;
  875. tc_char_2_char : resulttype_char_to_char;
  876. tc_dynarray_2_openarray : resulttype_dynarray_to_openarray;
  877. tc_pwchar_2_string : resulttype_pwchar_to_string;
  878. tc_variant_2_dynarray : resulttype_variant_to_dynarray;
  879. tc_dynarray_2_variant : resulttype_dynarray_to_variant;
  880. end;
  881. end;
  882. {$Endif fpc}
  883. function ttypeconvnode.det_resulttype:tnode;
  884. var
  885. hp : tnode;
  886. currprocdef,
  887. aprocdef : tprocdef;
  888. eq : tequaltype;
  889. begin
  890. result:=nil;
  891. resulttype:=totype;
  892. resulttypepass(left);
  893. if codegenerror then
  894. exit;
  895. eq:=compare_defs_ext(left.resulttype.def,resulttype.def,left.nodetype,
  896. nf_explizit in flags,true,convtype,aprocdef);
  897. case eq of
  898. te_exact,
  899. te_equal :
  900. begin
  901. { because is_equal only checks the basetype for sets we need to
  902. check here if we are loading a smallset into a normalset }
  903. if (resulttype.def.deftype=setdef) and
  904. (left.resulttype.def.deftype=setdef) and
  905. ((tsetdef(resulttype.def).settype = smallset) xor
  906. (tsetdef(left.resulttype.def).settype = smallset)) then
  907. begin
  908. { constant sets can be converted by changing the type only }
  909. if (left.nodetype=setconstn) then
  910. begin
  911. tsetdef(left.resulttype.def).changesettype(tsetdef(resulttype.def).settype);
  912. result:=left;
  913. left:=nil;
  914. exit;
  915. end;
  916. if (tsetdef(resulttype.def).settype <> smallset) then
  917. convtype:=tc_load_smallset
  918. else
  919. convtype := tc_normal_2_smallset;
  920. exit;
  921. end
  922. else
  923. begin
  924. { Only leave when there is no conversion to do.
  925. We can still need to call a conversion routine,
  926. like the routine to convert a stringconstnode }
  927. if convtype in [tc_equal,tc_not_possible] then
  928. begin
  929. left.resulttype:=resulttype;
  930. result:=left;
  931. left:=nil;
  932. exit;
  933. end;
  934. end;
  935. end;
  936. te_convert_l1,
  937. te_convert_l2,
  938. te_convert_l3 :
  939. begin
  940. { nothing to do }
  941. end;
  942. te_convert_operator :
  943. begin
  944. procinfo.flags:=procinfo.flags or pi_do_call;
  945. hp:=ccallnode.create(ccallparanode.create(left,nil),
  946. overloaded_operators[_assignment],nil,nil);
  947. { tell explicitly which def we must use !! (PM) }
  948. tcallnode(hp).procdefinition:=aprocdef;
  949. left:=nil;
  950. result:=hp;
  951. exit;
  952. end;
  953. te_incompatible :
  954. begin
  955. { Procedures have a resulttype.def of voiddef and functions of their
  956. own resulttype.def. They will therefore always be incompatible with
  957. a procvar. Because isconvertable cannot check for procedures we
  958. use an extra check for them.}
  959. if (m_tp_procvar in aktmodeswitches) and
  960. (resulttype.def.deftype=procvardef) then
  961. begin
  962. if is_procsym_load(left) then
  963. begin
  964. if (left.nodetype<>addrn) then
  965. begin
  966. convtype:=tc_proc_2_procvar;
  967. { Now check if the procedure we are going to assign to
  968. the procvar, is compatible with the procvar's type }
  969. if proc_to_procvar_equal(tprocsym(tloadnode(left).symtableentry).first_procdef,
  970. tprocvardef(resulttype.def),true)=te_incompatible then
  971. CGMessage2(type_e_incompatible_types,tprocsym(tloadnode(left).symtableentry).first_procdef.typename,resulttype.def.typename);
  972. exit;
  973. end;
  974. end
  975. else
  976. if (left.nodetype=calln) and
  977. not assigned(tcallnode(left).left) then
  978. begin
  979. if assigned(tcallnode(left).right) then
  980. hp:=tcallnode(left).right.getcopy
  981. else
  982. begin
  983. currprocdef:=Tprocsym(Tcallnode(left).symtableprocentry).search_procdef_byprocvardef(Tprocvardef(resulttype.def));
  984. hp:=cloadnode.create_procvar(tprocsym(tcallnode(left).symtableprocentry),
  985. currprocdef,tcallnode(left).symtableproc);
  986. if (tcallnode(left).symtableprocentry.owner.symtabletype=objectsymtable) and
  987. assigned(tcallnode(left).methodpointer) then
  988. tloadnode(hp).set_mp(tcallnode(left).methodpointer.getcopy);
  989. end;
  990. resulttypepass(hp);
  991. left.free;
  992. left:=hp;
  993. convtype:=tc_proc_2_procvar;
  994. { Now check if the procedure we are going to assign to
  995. the procvar, is compatible with the procvar's type }
  996. if proc_to_procvar_equal(tprocdef(left.resulttype.def),
  997. tprocvardef(resulttype.def),true)=te_incompatible then
  998. CGMessage2(type_e_incompatible_types,tprocdef(left.resulttype.def).typename,resulttype.def.typename);
  999. exit;
  1000. end;
  1001. end;
  1002. { Handle explicit type conversions }
  1003. if nf_explizit in flags then
  1004. begin
  1005. { do common tc_equal cast }
  1006. convtype:=tc_equal;
  1007. { check if the result could be in a register }
  1008. if not(tstoreddef(resulttype.def).is_intregable) and
  1009. not(tstoreddef(resulttype.def).is_fpuregable) then
  1010. make_not_regable(left);
  1011. { class to class or object to object, with checkobject support }
  1012. if (resulttype.def.deftype=objectdef) and
  1013. (left.resulttype.def.deftype=objectdef) then
  1014. begin
  1015. if (cs_check_object in aktlocalswitches) then
  1016. begin
  1017. if is_class_or_interface(resulttype.def) then
  1018. begin
  1019. { we can translate the typeconvnode to 'as' when
  1020. typecasting to a class or interface }
  1021. hp:=casnode.create(left,cloadvmtnode.create(ctypenode.create(resulttype)));
  1022. left:=nil;
  1023. result:=hp;
  1024. exit;
  1025. end;
  1026. end
  1027. else
  1028. begin
  1029. { check if the types are related }
  1030. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(resulttype.def)))) and
  1031. (not(tobjectdef(resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1032. CGMessage2(type_w_classes_not_related,left.resulttype.def.typename,resulttype.def.typename);
  1033. end;
  1034. end
  1035. else
  1036. begin
  1037. { only if the same size or formal def }
  1038. if not(
  1039. (left.resulttype.def.deftype=formaldef) or
  1040. (
  1041. not(is_open_array(left.resulttype.def)) and
  1042. (left.resulttype.def.size=resulttype.def.size)
  1043. ) or
  1044. (
  1045. is_void(left.resulttype.def) and
  1046. (left.nodetype=derefn)
  1047. )
  1048. ) or
  1049. (left.resulttype.def.deftype=classrefdef) then
  1050. CGMessage(cg_e_illegal_type_conversion);
  1051. end;
  1052. end
  1053. else
  1054. CGMessage2(type_e_incompatible_types,left.resulttype.def.typename,resulttype.def.typename);
  1055. end;
  1056. else
  1057. internalerror(200211231);
  1058. end;
  1059. { Give hint for unportable code }
  1060. if ((left.resulttype.def.deftype=orddef) and
  1061. (resulttype.def.deftype in [pointerdef,procvardef,classrefdef])) or
  1062. ((resulttype.def.deftype=orddef) and
  1063. (left.resulttype.def.deftype in [pointerdef,procvardef,classrefdef])) then
  1064. CGMessage(cg_h_pointer_to_longint_conv_not_portable);
  1065. { Constant folding and other node transitions to
  1066. remove the typeconv node }
  1067. case left.nodetype of
  1068. loadn :
  1069. begin
  1070. { tp7 procvar support, when right is not a procvardef and we got a
  1071. loadn of a procvar then convert to a calln, the check for the
  1072. result is already done in is_convertible, also no conflict with
  1073. @procvar is here because that has an extra addrn }
  1074. if (m_tp_procvar in aktmodeswitches) and
  1075. (resulttype.def.deftype<>procvardef) and
  1076. (left.resulttype.def.deftype=procvardef) then
  1077. begin
  1078. hp:=ccallnode.create(nil,nil,nil,nil);
  1079. tcallnode(hp).set_procvar(left);
  1080. resulttypepass(hp);
  1081. left:=hp;
  1082. end;
  1083. end;
  1084. niln :
  1085. begin
  1086. { nil to ordinal node }
  1087. if (resulttype.def.deftype=orddef) then
  1088. begin
  1089. hp:=cordconstnode.create(0,resulttype,true);
  1090. result:=hp;
  1091. exit;
  1092. end
  1093. else
  1094. { fold nil to any pointer type }
  1095. if (resulttype.def.deftype=pointerdef) then
  1096. begin
  1097. hp:=cnilnode.create;
  1098. hp.resulttype:=resulttype;
  1099. result:=hp;
  1100. exit;
  1101. end
  1102. else
  1103. { remove typeconv after niln, but not when the result is a
  1104. methodpointer. The typeconv of the methodpointer will then
  1105. take care of updateing size of niln to OS_64 }
  1106. if not((resulttype.def.deftype=procvardef) and
  1107. (po_methodpointer in tprocvardef(resulttype.def).procoptions)) then
  1108. begin
  1109. left.resulttype:=resulttype;
  1110. result:=left;
  1111. left:=nil;
  1112. exit;
  1113. end;
  1114. end;
  1115. ordconstn :
  1116. begin
  1117. { ordinal contants can be directly converted }
  1118. { but not char to char because it is a widechar to char or via versa }
  1119. { which needs extra code to do the code page transistion }
  1120. if is_ordinal(resulttype.def) and
  1121. not(convtype=tc_char_2_char) then
  1122. begin
  1123. { replace the resulttype and recheck the range }
  1124. left.resulttype:=resulttype;
  1125. testrange(left.resulttype.def,tordconstnode(left).value,(nf_explizit in flags));
  1126. result:=left;
  1127. left:=nil;
  1128. exit;
  1129. end;
  1130. end;
  1131. pointerconstn :
  1132. begin
  1133. { pointerconstn to any pointer is folded too }
  1134. if (resulttype.def.deftype=pointerdef) then
  1135. begin
  1136. left.resulttype:=resulttype;
  1137. result:=left;
  1138. left:=nil;
  1139. exit;
  1140. end
  1141. { constant pointer to ordinal }
  1142. else if is_ordinal(resulttype.def) then
  1143. begin
  1144. hp:=cordconstnode.create(tpointerconstnode(left).value,
  1145. resulttype,true);
  1146. result:=hp;
  1147. exit;
  1148. end;
  1149. end;
  1150. end;
  1151. { now call the resulttype helper to do constant folding }
  1152. result:=resulttype_call_helper(convtype);
  1153. end;
  1154. procedure Ttypeconvnode.mark_write;
  1155. begin
  1156. left.mark_write;
  1157. end;
  1158. function ttypeconvnode.first_cord_to_pointer : tnode;
  1159. begin
  1160. result:=nil;
  1161. internalerror(200104043);
  1162. end;
  1163. function ttypeconvnode.first_int_to_int : tnode;
  1164. begin
  1165. first_int_to_int:=nil;
  1166. if (left.location.loc<>LOC_REGISTER) and
  1167. (resulttype.def.size>left.resulttype.def.size) then
  1168. location.loc:=LOC_REGISTER;
  1169. if is_64bitint(resulttype.def) then
  1170. registers32:=max(registers32,2)
  1171. else
  1172. registers32:=max(registers32,1);
  1173. end;
  1174. function ttypeconvnode.first_cstring_to_pchar : tnode;
  1175. begin
  1176. first_cstring_to_pchar:=nil;
  1177. registers32:=1;
  1178. location.loc:=LOC_REGISTER;
  1179. end;
  1180. function ttypeconvnode.first_string_to_chararray : tnode;
  1181. begin
  1182. first_string_to_chararray:=nil;
  1183. registers32:=1;
  1184. location.loc:=LOC_REGISTER;
  1185. end;
  1186. function ttypeconvnode.first_char_to_string : tnode;
  1187. begin
  1188. first_char_to_string:=nil;
  1189. location.loc:=LOC_CREFERENCE;
  1190. end;
  1191. function ttypeconvnode.first_nothing : tnode;
  1192. begin
  1193. first_nothing:=nil;
  1194. end;
  1195. function ttypeconvnode.first_array_to_pointer : tnode;
  1196. begin
  1197. first_array_to_pointer:=nil;
  1198. if registers32<1 then
  1199. registers32:=1;
  1200. location.loc:=LOC_REGISTER;
  1201. end;
  1202. function ttypeconvnode.first_int_to_real: tnode;
  1203. var
  1204. fname: string[19];
  1205. typname : string[12];
  1206. begin
  1207. { Get the type name }
  1208. { Normally the typename should be one of the following:
  1209. single, double - carl
  1210. }
  1211. typname := lower(pbestrealtype^.def.gettypename);
  1212. { converting a 64bit integer to a float requires a helper }
  1213. if is_64bitint(left.resulttype.def) then
  1214. begin
  1215. if is_signed(left.resulttype.def) then
  1216. fname := 'fpc_int64_to_'+typname
  1217. else
  1218. fname := 'fpc_qword_to_'+typname;
  1219. result := ccallnode.createintern(fname,ccallparanode.create(
  1220. left,nil));
  1221. left:=nil;
  1222. firstpass(result);
  1223. exit;
  1224. end
  1225. else
  1226. { other integers are supposed to be 32 bit }
  1227. begin
  1228. if is_signed(left.resulttype.def) then
  1229. fname := 'fpc_longint_to_'+typname
  1230. else
  1231. fname := 'fpc_longword_to_'+typname;
  1232. result := ccallnode.createintern(fname,ccallparanode.create(
  1233. left,nil));
  1234. left:=nil;
  1235. firstpass(result);
  1236. exit;
  1237. end;
  1238. end;
  1239. function ttypeconvnode.first_real_to_real : tnode;
  1240. begin
  1241. first_real_to_real:=nil;
  1242. { comp isn't a floating type }
  1243. {$ifdef i386}
  1244. if (tfloatdef(resulttype.def).typ=s64comp) and
  1245. (tfloatdef(left.resulttype.def).typ<>s64comp) and
  1246. not (nf_explizit in flags) then
  1247. CGMessage(type_w_convert_real_2_comp);
  1248. {$endif}
  1249. if registersfpu<1 then
  1250. registersfpu:=1;
  1251. location.loc:=LOC_FPUREGISTER;
  1252. end;
  1253. function ttypeconvnode.first_pointer_to_array : tnode;
  1254. begin
  1255. first_pointer_to_array:=nil;
  1256. if registers32<1 then
  1257. registers32:=1;
  1258. location.loc:=LOC_REFERENCE;
  1259. end;
  1260. function ttypeconvnode.first_cchar_to_pchar : tnode;
  1261. begin
  1262. first_cchar_to_pchar:=nil;
  1263. internalerror(200104021);
  1264. end;
  1265. function ttypeconvnode.first_bool_to_int : tnode;
  1266. begin
  1267. first_bool_to_int:=nil;
  1268. { byte(boolean) or word(wordbool) or longint(longbool) must
  1269. be accepted for var parameters }
  1270. if (nf_explizit in flags) and
  1271. (left.resulttype.def.size=resulttype.def.size) and
  1272. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  1273. exit;
  1274. { when converting to 64bit, first convert to a 32bit int and then }
  1275. { convert to a 64bit int (only necessary for 32bit processors) (JM) }
  1276. if resulttype.def.size > sizeof(aword) then
  1277. begin
  1278. result := ctypeconvnode.create(left,u32bittype);
  1279. result.toggleflag(nf_explizit);
  1280. result := ctypeconvnode.create(result,resulttype);
  1281. left := nil;
  1282. firstpass(result);
  1283. exit;
  1284. end;
  1285. location.loc:=LOC_REGISTER;
  1286. if registers32<1 then
  1287. registers32:=1;
  1288. end;
  1289. function ttypeconvnode.first_int_to_bool : tnode;
  1290. begin
  1291. first_int_to_bool:=nil;
  1292. { byte(boolean) or word(wordbool) or longint(longbool) must
  1293. be accepted for var parameters }
  1294. if (nf_explizit in flags) and
  1295. (left.resulttype.def.size=resulttype.def.size) and
  1296. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  1297. exit;
  1298. location.loc:=LOC_REGISTER;
  1299. { need if bool to bool !!
  1300. not very nice !!
  1301. insertypeconv(left,s32bittype);
  1302. left.explizit:=true;
  1303. firstpass(left); }
  1304. if registers32<1 then
  1305. registers32:=1;
  1306. end;
  1307. function ttypeconvnode.first_bool_to_bool : tnode;
  1308. begin
  1309. first_bool_to_bool:=nil;
  1310. location.loc:=LOC_REGISTER;
  1311. if registers32<1 then
  1312. registers32:=1;
  1313. end;
  1314. function ttypeconvnode.first_char_to_char : tnode;
  1315. begin
  1316. first_char_to_char:=nil;
  1317. location.loc:=LOC_REGISTER;
  1318. if registers32<1 then
  1319. registers32:=1;
  1320. end;
  1321. function ttypeconvnode.first_proc_to_procvar : tnode;
  1322. begin
  1323. first_proc_to_procvar:=nil;
  1324. if (left.location.loc<>LOC_REFERENCE) then
  1325. CGMessage(cg_e_illegal_expression);
  1326. registers32:=left.registers32;
  1327. if registers32<1 then
  1328. registers32:=1;
  1329. location.loc:=LOC_REGISTER;
  1330. end;
  1331. function ttypeconvnode.first_load_smallset : tnode;
  1332. var
  1333. srsym: ttypesym;
  1334. p: tcallparanode;
  1335. begin
  1336. if not searchsystype('FPC_SMALL_SET',srsym) then
  1337. internalerror(200108313);
  1338. p := ccallparanode.create(left,nil);
  1339. { reused }
  1340. left := nil;
  1341. { convert parameter explicitely to fpc_small_set }
  1342. p.left := ctypeconvnode.create(p.left,srsym.restype);
  1343. p.left.toggleflag(nf_explizit);
  1344. { create call, adjust resulttype }
  1345. result :=
  1346. ccallnode.createinternres('fpc_set_load_small',p,resulttype);
  1347. firstpass(result);
  1348. end;
  1349. function ttypeconvnode.first_ansistring_to_pchar : tnode;
  1350. begin
  1351. first_ansistring_to_pchar:=nil;
  1352. location.loc:=LOC_REGISTER;
  1353. if registers32<1 then
  1354. registers32:=1;
  1355. end;
  1356. function ttypeconvnode.first_arrayconstructor_to_set : tnode;
  1357. begin
  1358. first_arrayconstructor_to_set:=nil;
  1359. internalerror(200104022);
  1360. end;
  1361. function ttypeconvnode.first_class_to_intf : tnode;
  1362. begin
  1363. first_class_to_intf:=nil;
  1364. location.loc:=LOC_REFERENCE;
  1365. if registers32<1 then
  1366. registers32:=1;
  1367. end;
  1368. function ttypeconvnode._first_int_to_int : tnode;
  1369. begin
  1370. result:=first_int_to_int;
  1371. end;
  1372. function ttypeconvnode._first_cstring_to_pchar : tnode;
  1373. begin
  1374. result:=first_cstring_to_pchar;
  1375. end;
  1376. function ttypeconvnode._first_string_to_chararray : tnode;
  1377. begin
  1378. result:=first_string_to_chararray;
  1379. end;
  1380. function ttypeconvnode._first_char_to_string : tnode;
  1381. begin
  1382. result:=first_char_to_string;
  1383. end;
  1384. function ttypeconvnode._first_nothing : tnode;
  1385. begin
  1386. result:=first_nothing;
  1387. end;
  1388. function ttypeconvnode._first_array_to_pointer : tnode;
  1389. begin
  1390. result:=first_array_to_pointer;
  1391. end;
  1392. function ttypeconvnode._first_int_to_real : tnode;
  1393. begin
  1394. result:=first_int_to_real;
  1395. end;
  1396. function ttypeconvnode._first_real_to_real : tnode;
  1397. begin
  1398. result:=first_real_to_real;
  1399. end;
  1400. function ttypeconvnode._first_pointer_to_array : tnode;
  1401. begin
  1402. result:=first_pointer_to_array;
  1403. end;
  1404. function ttypeconvnode._first_cchar_to_pchar : tnode;
  1405. begin
  1406. result:=first_cchar_to_pchar;
  1407. end;
  1408. function ttypeconvnode._first_bool_to_int : tnode;
  1409. begin
  1410. result:=first_bool_to_int;
  1411. end;
  1412. function ttypeconvnode._first_int_to_bool : tnode;
  1413. begin
  1414. result:=first_int_to_bool;
  1415. end;
  1416. function ttypeconvnode._first_bool_to_bool : tnode;
  1417. begin
  1418. result:=first_bool_to_bool;
  1419. end;
  1420. function ttypeconvnode._first_proc_to_procvar : tnode;
  1421. begin
  1422. result:=first_proc_to_procvar;
  1423. end;
  1424. function ttypeconvnode._first_load_smallset : tnode;
  1425. begin
  1426. result:=first_load_smallset;
  1427. end;
  1428. function ttypeconvnode._first_cord_to_pointer : tnode;
  1429. begin
  1430. result:=first_cord_to_pointer;
  1431. end;
  1432. function ttypeconvnode._first_ansistring_to_pchar : tnode;
  1433. begin
  1434. result:=first_ansistring_to_pchar;
  1435. end;
  1436. function ttypeconvnode._first_arrayconstructor_to_set : tnode;
  1437. begin
  1438. result:=first_arrayconstructor_to_set;
  1439. end;
  1440. function ttypeconvnode._first_class_to_intf : tnode;
  1441. begin
  1442. result:=first_class_to_intf;
  1443. end;
  1444. function ttypeconvnode._first_char_to_char : tnode;
  1445. begin
  1446. result:=first_char_to_char;
  1447. end;
  1448. function ttypeconvnode.first_call_helper(c : tconverttype) : tnode;
  1449. const
  1450. firstconvert : array[tconverttype] of pointer = (
  1451. @ttypeconvnode._first_nothing, {equal}
  1452. @ttypeconvnode._first_nothing, {not_possible}
  1453. nil, { removed in resulttype_string_to_string }
  1454. @ttypeconvnode._first_char_to_string,
  1455. @ttypeconvnode._first_nothing, { char_2_chararray, needs nothing extra }
  1456. nil, { removed in resulttype_chararray_to_string }
  1457. @ttypeconvnode._first_cchar_to_pchar,
  1458. @ttypeconvnode._first_cstring_to_pchar,
  1459. @ttypeconvnode._first_ansistring_to_pchar,
  1460. @ttypeconvnode._first_string_to_chararray,
  1461. nil, { removed in resulttype_chararray_to_string }
  1462. @ttypeconvnode._first_array_to_pointer,
  1463. @ttypeconvnode._first_pointer_to_array,
  1464. @ttypeconvnode._first_int_to_int,
  1465. @ttypeconvnode._first_int_to_bool,
  1466. @ttypeconvnode._first_bool_to_bool,
  1467. @ttypeconvnode._first_bool_to_int,
  1468. @ttypeconvnode._first_real_to_real,
  1469. @ttypeconvnode._first_int_to_real,
  1470. @ttypeconvnode._first_proc_to_procvar,
  1471. @ttypeconvnode._first_arrayconstructor_to_set,
  1472. @ttypeconvnode._first_load_smallset,
  1473. @ttypeconvnode._first_cord_to_pointer,
  1474. @ttypeconvnode._first_nothing,
  1475. @ttypeconvnode._first_nothing,
  1476. @ttypeconvnode._first_class_to_intf,
  1477. @ttypeconvnode._first_char_to_char,
  1478. @ttypeconvnode._first_nothing,
  1479. @ttypeconvnode._first_nothing,
  1480. nil,
  1481. nil,
  1482. nil
  1483. );
  1484. type
  1485. tprocedureofobject = function : tnode of object;
  1486. var
  1487. r : packed record
  1488. proc : pointer;
  1489. obj : pointer;
  1490. end;
  1491. begin
  1492. { this is a little bit dirty but it works }
  1493. { and should be quite portable too }
  1494. r.proc:=firstconvert[c];
  1495. r.obj:=self;
  1496. first_call_helper:=tprocedureofobject(r){$ifdef FPC}();{$endif FPC}
  1497. end;
  1498. function ttypeconvnode.pass_1 : tnode;
  1499. begin
  1500. result:=nil;
  1501. firstpass(left);
  1502. if codegenerror then
  1503. exit;
  1504. { load the value_str from the left part }
  1505. registers32:=left.registers32;
  1506. registersfpu:=left.registersfpu;
  1507. {$ifdef SUPPORT_MMX}
  1508. registersmmx:=left.registersmmx;
  1509. {$endif}
  1510. location.loc:=left.location.loc;
  1511. if nf_explizit in flags then
  1512. begin
  1513. { check if the result could be in a register }
  1514. if not(tstoreddef(resulttype.def).is_intregable) and
  1515. not(tstoreddef(resulttype.def).is_fpuregable) then
  1516. make_not_regable(left);
  1517. end;
  1518. result:=first_call_helper(convtype);
  1519. end;
  1520. function ttypeconvnode.docompare(p: tnode) : boolean;
  1521. begin
  1522. docompare :=
  1523. inherited docompare(p) and
  1524. (convtype = ttypeconvnode(p).convtype);
  1525. end;
  1526. {*****************************************************************************
  1527. TISNODE
  1528. *****************************************************************************}
  1529. constructor tisnode.create(l,r : tnode);
  1530. begin
  1531. inherited create(isn,l,r);
  1532. end;
  1533. function tisnode.det_resulttype:tnode;
  1534. var
  1535. paras: tcallparanode;
  1536. begin
  1537. result:=nil;
  1538. resulttypepass(left);
  1539. resulttypepass(right);
  1540. set_varstate(left,true);
  1541. set_varstate(right,true);
  1542. if codegenerror then
  1543. exit;
  1544. if (right.resulttype.def.deftype=classrefdef) then
  1545. begin
  1546. { left must be a class }
  1547. if is_class(left.resulttype.def) then
  1548. begin
  1549. { the operands must be related }
  1550. if (not(tobjectdef(left.resulttype.def).is_related(
  1551. tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def)))) and
  1552. (not(tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def).is_related(
  1553. tobjectdef(left.resulttype.def)))) then
  1554. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,
  1555. tclassrefdef(right.resulttype.def).pointertype.def.typename);
  1556. end
  1557. else
  1558. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1559. { call fpc_do_is helper }
  1560. paras := ccallparanode.create(
  1561. left,
  1562. ccallparanode.create(
  1563. right,nil));
  1564. result := ccallnode.createintern('fpc_do_is',paras);
  1565. left := nil;
  1566. right := nil;
  1567. end
  1568. else if is_interface(right.resulttype.def) then
  1569. begin
  1570. { left is a class }
  1571. if is_class(left.resulttype.def) then
  1572. begin
  1573. { the operands must be related }
  1574. if not(assigned(tobjectdef(left.resulttype.def).implementedinterfaces) and
  1575. (tobjectdef(left.resulttype.def).implementedinterfaces.searchintf(right.resulttype.def)<>-1)) then
  1576. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1577. end
  1578. { left is an interface }
  1579. else if is_interface(left.resulttype.def) then
  1580. begin
  1581. { the operands must be related }
  1582. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(right.resulttype.def)))) and
  1583. (not(tobjectdef(right.resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1584. CGMessage(type_e_mismatch);
  1585. end
  1586. else
  1587. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1588. { call fpc_do_is helper }
  1589. paras := ccallparanode.create(
  1590. left,
  1591. ccallparanode.create(
  1592. right,nil));
  1593. result := ccallnode.createintern('fpc_do_is',paras);
  1594. left := nil;
  1595. right := nil;
  1596. end
  1597. else
  1598. CGMessage1(type_e_class_or_interface_type_expected,right.resulttype.def.typename);
  1599. resulttype:=booltype;
  1600. end;
  1601. function tisnode.pass_1 : tnode;
  1602. begin
  1603. internalerror(200204254);
  1604. result:=nil;
  1605. end;
  1606. { dummy pass_2, it will never be called, but we need one since }
  1607. { you can't instantiate an abstract class }
  1608. procedure tisnode.pass_2;
  1609. begin
  1610. end;
  1611. {*****************************************************************************
  1612. TASNODE
  1613. *****************************************************************************}
  1614. constructor tasnode.create(l,r : tnode);
  1615. begin
  1616. inherited create(asn,l,r);
  1617. call := nil;
  1618. end;
  1619. destructor tasnode.destroy;
  1620. begin
  1621. call.free;
  1622. inherited destroy;
  1623. end;
  1624. function tasnode.det_resulttype:tnode;
  1625. var
  1626. hp : tnode;
  1627. begin
  1628. result:=nil;
  1629. resulttypepass(right);
  1630. resulttypepass(left);
  1631. set_varstate(right,true);
  1632. set_varstate(left,true);
  1633. if codegenerror then
  1634. exit;
  1635. if (right.resulttype.def.deftype=classrefdef) then
  1636. begin
  1637. { left must be a class }
  1638. if is_class(left.resulttype.def) then
  1639. begin
  1640. { the operands must be related }
  1641. if (not(tobjectdef(left.resulttype.def).is_related(
  1642. tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def)))) and
  1643. (not(tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def).is_related(
  1644. tobjectdef(left.resulttype.def)))) then
  1645. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,
  1646. tclassrefdef(right.resulttype.def).pointertype.def.typename);
  1647. end
  1648. else
  1649. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1650. resulttype:=tclassrefdef(right.resulttype.def).pointertype;
  1651. end
  1652. else if is_interface(right.resulttype.def) then
  1653. begin
  1654. { left is a class }
  1655. if is_class(left.resulttype.def) then
  1656. begin
  1657. { the operands must be related
  1658. no, because the class instance could be a child class of the current one which
  1659. implements additional interfaces (FK)
  1660. b:=false;
  1661. o:=tobjectdef(left.resulttype.def);
  1662. while assigned(o) do
  1663. begin
  1664. if assigned(o.implementedinterfaces) and
  1665. (o.implementedinterfaces.searchintf(right.resulttype.def)<>-1) then
  1666. begin
  1667. b:=true;
  1668. break;
  1669. end;
  1670. o:=o.childof;
  1671. end;
  1672. if not(b) then
  1673. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1674. }
  1675. end
  1676. { left is an interface }
  1677. else if is_interface(left.resulttype.def) then
  1678. begin
  1679. { the operands must be related
  1680. we don't necessarily know how the both interfaces are implemented, so we can't do this check (FK)
  1681. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(right.resulttype.def)))) and
  1682. (not(tobjectdef(right.resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1683. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1684. }
  1685. end
  1686. else
  1687. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1688. resulttype:=right.resulttype;
  1689. { load the GUID of the interface }
  1690. if (right.nodetype=typen) then
  1691. begin
  1692. if assigned(tobjectdef(right.resulttype.def).iidguid) then
  1693. begin
  1694. hp:=cguidconstnode.create(tobjectdef(right.resulttype.def).iidguid^);
  1695. right.free;
  1696. right:=hp;
  1697. end
  1698. else
  1699. internalerror(200206282);
  1700. resulttypepass(right);
  1701. end;
  1702. end
  1703. else
  1704. CGMessage1(type_e_class_or_interface_type_expected,right.resulttype.def.typename);
  1705. end;
  1706. function tasnode.getcopy: tnode;
  1707. begin
  1708. result := inherited getcopy;
  1709. if assigned(call) then
  1710. tasnode(result).call := call.getcopy
  1711. else
  1712. tasnode(result).call := nil;
  1713. end;
  1714. function tasnode.pass_1 : tnode;
  1715. var
  1716. procname: string;
  1717. begin
  1718. result:=nil;
  1719. if not assigned(call) then
  1720. begin
  1721. if is_class(left.resulttype.def) and
  1722. (right.resulttype.def.deftype=classrefdef) then
  1723. call := ccallnode.createinternres('fpc_do_as',
  1724. ccallparanode.create(left,ccallparanode.create(right,nil)),
  1725. resulttype)
  1726. else
  1727. begin
  1728. if is_class(left.resulttype.def) then
  1729. procname := 'fpc_class_as_intf'
  1730. else
  1731. procname := 'fpc_intf_as';
  1732. call := ccallnode.createinternres(procname,
  1733. ccallparanode.create(right,ccallparanode.create(left,nil)),
  1734. resulttype);
  1735. end;
  1736. left := nil;
  1737. right := nil;
  1738. firstpass(call);
  1739. if codegenerror then
  1740. exit;
  1741. location.loc:=call.location.loc;
  1742. registers32:=call.registers32;
  1743. registersfpu:=call.registersfpu;
  1744. {$ifdef SUPPORT_MMX}
  1745. registersmmx:=call.registersmmx;
  1746. {$endif SUPPORT_MMX}
  1747. end;
  1748. end;
  1749. begin
  1750. ctypeconvnode:=ttypeconvnode;
  1751. casnode:=tasnode;
  1752. cisnode:=tisnode;
  1753. end.
  1754. {
  1755. $Log$
  1756. Revision 1.101 2003-01-16 22:13:52 peter
  1757. * convert_l3 convertlevel added. This level is used for conversions
  1758. where information can be lost like converting widestring->ansistring
  1759. or dword->byte
  1760. Revision 1.100 2003/01/15 01:44:32 peter
  1761. * merged methodpointer fixes from 1.0.x
  1762. Revision 1.99 2003/01/09 21:43:39 peter
  1763. * constant string conversion fixed, it's now equal to both
  1764. shortstring, ansistring and the typeconvnode will return
  1765. te_equal but still return convtype to change the constnode
  1766. Revision 1.98 2003/01/05 22:41:40 peter
  1767. * move code that checks for longint-pointer conversion hint
  1768. Revision 1.97 2003/01/03 12:15:56 daniel
  1769. * Removed ifdefs around notifications
  1770. ifdefs around for loop optimizations remain
  1771. Revision 1.96 2002/12/22 16:34:49 peter
  1772. * proc-procvar crash fixed (tw2277)
  1773. Revision 1.95 2002/12/20 16:01:26 peter
  1774. * don't allow class(classref) conversion
  1775. Revision 1.94 2002/12/05 14:27:26 florian
  1776. * some variant <-> dyn. array stuff
  1777. Revision 1.93 2002/11/30 10:45:14 carl
  1778. * fix bug with checking of duplicated items in sets (new sets bug only)
  1779. Revision 1.92 2002/11/27 19:43:21 carl
  1780. * updated notes and hints
  1781. Revision 1.91 2002/11/27 13:11:38 peter
  1782. * more currency fixes, taddcurr runs now successfull
  1783. Revision 1.90 2002/11/27 11:29:21 peter
  1784. * when converting from and to currency divide or multiple the
  1785. result by 10000
  1786. Revision 1.89 2002/11/25 17:43:18 peter
  1787. * splitted defbase in defutil,symutil,defcmp
  1788. * merged isconvertable and is_equal into compare_defs(_ext)
  1789. * made operator search faster by walking the list only once
  1790. Revision 1.88 2002/11/17 16:31:56 carl
  1791. * memory optimization (3-4%) : cleanup of tai fields,
  1792. cleanup of tdef and tsym fields.
  1793. * make it work for m68k
  1794. Revision 1.87 2002/10/10 16:07:57 florian
  1795. + several widestring/pwidechar related stuff added
  1796. Revision 1.86 2002/10/06 16:10:23 florian
  1797. * when compiling <interface> as <interface> we can't assume
  1798. anything about relation
  1799. Revision 1.85 2002/10/05 12:43:25 carl
  1800. * fixes for Delphi 6 compilation
  1801. (warning : Some features do not work under Delphi)
  1802. Revision 1.84 2002/10/02 20:23:50 florian
  1803. - removed the relation check for <class> as <interface> because we don't
  1804. know the runtime type of <class>! It could be a child class of the given type
  1805. which implements additional interfaces
  1806. Revision 1.83 2002/10/02 20:17:14 florian
  1807. + the as operator for <class> as <interface> has to check the parent classes as well
  1808. Revision 1.82 2002/09/30 07:00:47 florian
  1809. * fixes to common code to get the alpha compiler compiled applied
  1810. Revision 1.81 2002/09/16 14:11:13 peter
  1811. * add argument to equal_paras() to support default values or not
  1812. Revision 1.80 2002/09/07 20:40:23 carl
  1813. * cardinal -> longword
  1814. Revision 1.79 2002/09/07 15:25:03 peter
  1815. * old logs removed and tabs fixed
  1816. Revision 1.78 2002/09/07 12:16:04 carl
  1817. * second part bug report 1996 fix, testrange in cordconstnode
  1818. only called if option is set (also make parsing a tiny faster)
  1819. Revision 1.77 2002/09/05 05:56:07 jonas
  1820. - reverted my last commit, it was completely bogus :(
  1821. Revision 1.75 2002/09/02 19:24:42 peter
  1822. * array of char support for Str()
  1823. Revision 1.74 2002/09/01 08:01:16 daniel
  1824. * Removed sets from Tcallnode.det_resulttype
  1825. + Added read/write notifications of variables. These will be usefull
  1826. for providing information for several optimizations. For example
  1827. the value of the loop variable of a for loop does matter is the
  1828. variable is read after the for loop, but if it's no longer used
  1829. or written, it doesn't matter and this can be used to optimize
  1830. the loop code generation.
  1831. Revision 1.73 2002/08/23 16:14:49 peter
  1832. * tempgen cleanup
  1833. * tt_noreuse temp type added that will be used in genentrycode
  1834. Revision 1.72 2002/08/20 18:23:33 jonas
  1835. * the as node again uses a compilerproc
  1836. + (untested) support for interface "as" statements
  1837. Revision 1.71 2002/08/19 19:36:43 peter
  1838. * More fixes for cross unit inlining, all tnodes are now implemented
  1839. * Moved pocall_internconst to po_internconst because it is not a
  1840. calling type at all and it conflicted when inlining of these small
  1841. functions was requested
  1842. Revision 1.70 2002/08/17 09:23:36 florian
  1843. * first part of procinfo rewrite
  1844. Revision 1.69 2002/08/14 19:26:55 carl
  1845. + generic int_to_real type conversion
  1846. + generic unaryminus node
  1847. Revision 1.68 2002/08/11 16:08:55 florian
  1848. + support of explicit type case boolean->char
  1849. Revision 1.67 2002/08/11 15:28:00 florian
  1850. + support of explicit type case <any ordinal type>->pointer
  1851. (delphi mode only)
  1852. Revision 1.66 2002/08/09 07:33:01 florian
  1853. * a couple of interface related fixes
  1854. Revision 1.65 2002/07/29 21:23:42 florian
  1855. * more fixes for the ppc
  1856. + wrappers for the tcnvnode.first_* stuff introduced
  1857. Revision 1.64 2002/07/23 12:34:30 daniel
  1858. * Readded old set code. To use it define 'oldset'. Activated by default
  1859. for ppc.
  1860. Revision 1.63 2002/07/23 09:51:22 daniel
  1861. * Tried to make Tprocsym.defs protected. I didn't succeed but the cleanups
  1862. are worth comitting.
  1863. Revision 1.62 2002/07/22 11:48:04 daniel
  1864. * Sets are now internally sets.
  1865. Revision 1.61 2002/07/20 17:16:02 florian
  1866. + source code page support
  1867. Revision 1.60 2002/07/20 11:57:54 florian
  1868. * types.pas renamed to defbase.pas because D6 contains a types
  1869. unit so this would conflicts if D6 programms are compiled
  1870. + Willamette/SSE2 instructions to assembler added
  1871. Revision 1.59 2002/07/01 16:23:53 peter
  1872. * cg64 patch
  1873. * basics for currency
  1874. * asnode updates for class and interface (not finished)
  1875. Revision 1.58 2002/05/18 13:34:09 peter
  1876. * readded missing revisions
  1877. }