ncnv.pas 73 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132
  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. {$ifdef var_notification}
  43. procedure mark_write;override;
  44. {$endif}
  45. function docompare(p: tnode) : boolean; override;
  46. private
  47. function resulttype_cord_to_pointer : tnode;
  48. function resulttype_chararray_to_string : tnode;
  49. function resulttype_string_to_chararray : tnode;
  50. function resulttype_string_to_string : tnode;
  51. function resulttype_char_to_string : tnode;
  52. function resulttype_char_to_chararray : tnode;
  53. function resulttype_int_to_real : tnode;
  54. function resulttype_real_to_real : tnode;
  55. function resulttype_cchar_to_pchar : tnode;
  56. function resulttype_cstring_to_pchar : tnode;
  57. function resulttype_char_to_char : tnode;
  58. function resulttype_arrayconstructor_to_set : tnode;
  59. function resulttype_pchar_to_string : tnode;
  60. function resulttype_interface_to_guid : tnode;
  61. function resulttype_dynarray_to_openarray : tnode;
  62. function resulttype_pwchar_to_string : 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_call_helper(c : tconverttype) : tnode;
  794. {$ifdef fpc}
  795. const
  796. resulttypeconvert : array[tconverttype] of pointer = (
  797. {equal} nil,
  798. {not_possible} nil,
  799. { string_2_string } @ttypeconvnode.resulttype_string_to_string,
  800. { char_2_string } @ttypeconvnode.resulttype_char_to_string,
  801. { char_2_chararray } @ttypeconvnode.resulttype_char_to_chararray,
  802. { pchar_2_string } @ttypeconvnode.resulttype_pchar_to_string,
  803. { cchar_2_pchar } @ttypeconvnode.resulttype_cchar_to_pchar,
  804. { cstring_2_pchar } @ttypeconvnode.resulttype_cstring_to_pchar,
  805. { ansistring_2_pchar } nil,
  806. { string_2_chararray } @ttypeconvnode.resulttype_string_to_chararray,
  807. { chararray_2_string } @ttypeconvnode.resulttype_chararray_to_string,
  808. { array_2_pointer } nil,
  809. { pointer_2_array } nil,
  810. { int_2_int } nil,
  811. { int_2_bool } nil,
  812. { bool_2_bool } nil,
  813. { bool_2_int } nil,
  814. { real_2_real } @ttypeconvnode.resulttype_real_to_real,
  815. { int_2_real } @ttypeconvnode.resulttype_int_to_real,
  816. { proc_2_procvar } nil,
  817. { arrayconstructor_2_set } @ttypeconvnode.resulttype_arrayconstructor_to_set,
  818. { load_smallset } nil,
  819. { cord_2_pointer } @ttypeconvnode.resulttype_cord_to_pointer,
  820. { intf_2_string } nil,
  821. { intf_2_guid } @ttypeconvnode.resulttype_interface_to_guid,
  822. { class_2_intf } nil,
  823. { char_2_char } @ttypeconvnode.resulttype_char_to_char,
  824. { normal_2_smallset} nil,
  825. { dynarray_2_openarray} @resulttype_dynarray_to_openarray,
  826. { pwchar_2_string} @resulttype_pwchar_to_string
  827. );
  828. type
  829. tprocedureofobject = function : tnode of object;
  830. var
  831. r : packed record
  832. proc : pointer;
  833. obj : pointer;
  834. end;
  835. begin
  836. result:=nil;
  837. { this is a little bit dirty but it works }
  838. { and should be quite portable too }
  839. r.proc:=resulttypeconvert[c];
  840. r.obj:=self;
  841. if assigned(r.proc) then
  842. result:=tprocedureofobject(r){$ifdef FPC}();{$endif FPC}
  843. end;
  844. {$else}
  845. begin
  846. case c of
  847. tc_string_2_string: resulttype_string_to_string;
  848. tc_char_2_string : resulttype_char_to_string;
  849. tc_char_2_chararray: resulttype_char_to_chararray;
  850. tc_pchar_2_string : resulttype_pchar_to_string;
  851. tc_cchar_2_pchar : resulttype_cchar_to_pchar;
  852. tc_cstring_2_pchar : resulttype_cstring_to_pchar;
  853. tc_string_2_chararray : resulttype_string_to_chararray;
  854. tc_chararray_2_string : resulttype_chararray_to_string;
  855. tc_real_2_real : resulttype_real_to_real;
  856. tc_int_2_real : resulttype_int_to_real;
  857. tc_arrayconstructor_2_set : resulttype_arrayconstructor_to_set;
  858. tc_cord_2_pointer : resulttype_cord_to_pointer;
  859. tc_intf_2_guid : resulttype_interface_to_guid;
  860. tc_char_2_char : resulttype_char_to_char;
  861. tc_dynarray_2_openarray : resulttype_dynarray_to_openarray;
  862. tc_pwchar_2_string : resulttype_pwchar_to_string;
  863. end;
  864. end;
  865. {$Endif fpc}
  866. function ttypeconvnode.det_resulttype:tnode;
  867. var
  868. hp : tnode;
  869. currprocdef,
  870. aprocdef : tprocdef;
  871. eq : tequaltype;
  872. begin
  873. result:=nil;
  874. resulttype:=totype;
  875. resulttypepass(left);
  876. if codegenerror then
  877. exit;
  878. eq:=compare_defs_ext(left.resulttype.def,resulttype.def,left.nodetype,
  879. nf_explizit in flags,true,convtype,aprocdef);
  880. case eq of
  881. te_exact,
  882. te_equal :
  883. begin
  884. { because is_equal only checks the basetype for sets we need to
  885. check here if we are loading a smallset into a normalset }
  886. if (resulttype.def.deftype=setdef) and
  887. (left.resulttype.def.deftype=setdef) and
  888. ((tsetdef(resulttype.def).settype = smallset) xor
  889. (tsetdef(left.resulttype.def).settype = smallset)) then
  890. begin
  891. { constant sets can be converted by changing the type only }
  892. if (left.nodetype=setconstn) then
  893. begin
  894. tsetdef(left.resulttype.def).changesettype(tsetdef(resulttype.def).settype);
  895. result:=left;
  896. left:=nil;
  897. exit;
  898. end;
  899. if (tsetdef(resulttype.def).settype <> smallset) then
  900. convtype:=tc_load_smallset
  901. else
  902. convtype := tc_normal_2_smallset;
  903. exit;
  904. end
  905. else
  906. begin
  907. left.resulttype:=resulttype;
  908. result:=left;
  909. left:=nil;
  910. exit;
  911. end;
  912. end;
  913. te_convert_l1,
  914. te_convert_l2 :
  915. begin
  916. { nothing to do }
  917. end;
  918. te_convert_operator :
  919. begin
  920. procinfo.flags:=procinfo.flags or pi_do_call;
  921. hp:=ccallnode.create(ccallparanode.create(left,nil),
  922. overloaded_operators[_assignment],nil,nil);
  923. { tell explicitly which def we must use !! (PM) }
  924. tcallnode(hp).procdefinition:=aprocdef;
  925. left:=nil;
  926. result:=hp;
  927. exit;
  928. end;
  929. te_incompatible :
  930. begin
  931. { Procedures have a resulttype.def of voiddef and functions of their
  932. own resulttype.def. They will therefore always be incompatible with
  933. a procvar. Because isconvertable cannot check for procedures we
  934. use an extra check for them.}
  935. if (m_tp_procvar in aktmodeswitches) then
  936. begin
  937. if (resulttype.def.deftype=procvardef) and
  938. (is_procsym_load(left) or is_procsym_call(left)) then
  939. begin
  940. if is_procsym_call(left) then
  941. begin
  942. currprocdef:=Tprocsym(Tcallnode(left).symtableprocentry).search_procdef_byprocvardef(Tprocvardef(resulttype.def));
  943. hp:=cloadnode.create_procvar(tprocsym(tcallnode(left).symtableprocentry),
  944. currprocdef,tcallnode(left).symtableproc);
  945. if (tcallnode(left).symtableprocentry.owner.symtabletype=objectsymtable) and
  946. assigned(tcallnode(left).methodpointer) then
  947. tloadnode(hp).set_mp(tcallnode(left).methodpointer.getcopy);
  948. resulttypepass(hp);
  949. left.free;
  950. left:=hp;
  951. aprocdef:=tprocdef(left.resulttype.def);
  952. end
  953. else
  954. begin
  955. if (left.nodetype<>addrn) then
  956. aprocdef:=tprocsym(tloadnode(left).symtableentry).first_procdef;
  957. end;
  958. convtype:=tc_proc_2_procvar;
  959. { Now check if the procedure we are going to assign to
  960. the procvar, is compatible with the procvar's type }
  961. if assigned(aprocdef) then
  962. begin
  963. if proc_to_procvar_equal(aprocdef,tprocvardef(resulttype.def))=te_incompatible then
  964. CGMessage2(type_e_incompatible_types,aprocdef.typename,resulttype.def.typename);
  965. end
  966. else
  967. CGMessage2(type_e_incompatible_types,left.resulttype.def.typename,resulttype.def.typename);
  968. exit;
  969. end;
  970. end;
  971. { Handle explicit type conversions }
  972. if nf_explizit in flags then
  973. begin
  974. { do common tc_equal cast }
  975. convtype:=tc_equal;
  976. { check if the result could be in a register }
  977. if not(tstoreddef(resulttype.def).is_intregable) and
  978. not(tstoreddef(resulttype.def).is_fpuregable) then
  979. make_not_regable(left);
  980. { class to class or object to object, with checkobject support }
  981. if (resulttype.def.deftype=objectdef) and
  982. (left.resulttype.def.deftype=objectdef) then
  983. begin
  984. if (cs_check_object in aktlocalswitches) then
  985. begin
  986. if is_class_or_interface(resulttype.def) then
  987. begin
  988. { we can translate the typeconvnode to 'as' when
  989. typecasting to a class or interface }
  990. hp:=casnode.create(left,cloadvmtnode.create(ctypenode.create(resulttype)));
  991. left:=nil;
  992. result:=hp;
  993. exit;
  994. end;
  995. end
  996. else
  997. begin
  998. { check if the types are related }
  999. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(resulttype.def)))) and
  1000. (not(tobjectdef(resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1001. CGMessage2(type_w_classes_not_related,left.resulttype.def.typename,resulttype.def.typename);
  1002. end;
  1003. end
  1004. { only if the same size or formal def }
  1005. { why do we allow typecasting of voiddef ?? (PM) }
  1006. else
  1007. begin
  1008. if not(
  1009. (left.resulttype.def.deftype=formaldef) or
  1010. (not(is_open_array(left.resulttype.def)) and
  1011. (left.resulttype.def.size=resulttype.def.size)) or
  1012. (is_void(left.resulttype.def) and
  1013. (left.nodetype=derefn))
  1014. ) then
  1015. CGMessage(cg_e_illegal_type_conversion);
  1016. if ((left.resulttype.def.deftype=orddef) and
  1017. (resulttype.def.deftype=pointerdef)) or
  1018. ((resulttype.def.deftype=orddef) and
  1019. (left.resulttype.def.deftype=pointerdef)) then
  1020. CGMessage(cg_h_pointer_to_longint_conv_not_portable);
  1021. end;
  1022. { the conversion into a strutured type is only }
  1023. { possible, if the source is not a register }
  1024. if (
  1025. (resulttype.def.deftype in [recorddef,stringdef,arraydef]) or
  1026. ((resulttype.def.deftype=objectdef) and
  1027. not(is_class(resulttype.def)))
  1028. ) and
  1029. (left.location.loc in [LOC_REGISTER,LOC_CREGISTER]) then
  1030. CGMessage(cg_e_illegal_type_conversion);
  1031. end
  1032. else
  1033. CGMessage2(type_e_incompatible_types,left.resulttype.def.typename,resulttype.def.typename);
  1034. end;
  1035. else
  1036. internalerror(200211231);
  1037. end;
  1038. { Constant folding and other node transitions to
  1039. remove the typeconv node }
  1040. case left.nodetype of
  1041. loadn :
  1042. begin
  1043. { tp7 procvar support, when right is not a procvardef and we got a
  1044. loadn of a procvar then convert to a calln, the check for the
  1045. result is already done in is_convertible, also no conflict with
  1046. @procvar is here because that has an extra addrn }
  1047. if (m_tp_procvar in aktmodeswitches) and
  1048. (resulttype.def.deftype<>procvardef) and
  1049. (left.resulttype.def.deftype=procvardef) then
  1050. begin
  1051. hp:=ccallnode.create(nil,nil,nil,nil);
  1052. tcallnode(hp).set_procvar(left);
  1053. resulttypepass(hp);
  1054. left:=hp;
  1055. end;
  1056. end;
  1057. niln :
  1058. begin
  1059. { nil to ordinal node }
  1060. if (resulttype.def.deftype=orddef) then
  1061. begin
  1062. hp:=cordconstnode.create(0,resulttype,true);
  1063. result:=hp;
  1064. exit;
  1065. end
  1066. else
  1067. { fold nil to any pointer type }
  1068. if (resulttype.def.deftype=pointerdef) then
  1069. begin
  1070. hp:=cnilnode.create;
  1071. hp.resulttype:=resulttype;
  1072. result:=hp;
  1073. exit;
  1074. end
  1075. else
  1076. { remove typeconv after niln, but not when the result is a
  1077. methodpointer. The typeconv of the methodpointer will then
  1078. take care of updateing size of niln to OS_64 }
  1079. if not((resulttype.def.deftype=procvardef) and
  1080. (po_methodpointer in tprocvardef(resulttype.def).procoptions)) then
  1081. begin
  1082. left.resulttype:=resulttype;
  1083. result:=left;
  1084. left:=nil;
  1085. exit;
  1086. end;
  1087. end;
  1088. ordconstn :
  1089. begin
  1090. { ordinal contants can be directly converted }
  1091. { but not char to char because it is a widechar to char or via versa }
  1092. { which needs extra code to do the code page transistion }
  1093. if is_ordinal(resulttype.def) and
  1094. not(convtype=tc_char_2_char) then
  1095. begin
  1096. { replace the resulttype and recheck the range }
  1097. left.resulttype:=resulttype;
  1098. testrange(left.resulttype.def,tordconstnode(left).value,(nf_explizit in flags));
  1099. result:=left;
  1100. left:=nil;
  1101. exit;
  1102. end;
  1103. end;
  1104. pointerconstn :
  1105. begin
  1106. { pointerconstn to any pointer is folded too }
  1107. if (resulttype.def.deftype=pointerdef) then
  1108. begin
  1109. left.resulttype:=resulttype;
  1110. result:=left;
  1111. left:=nil;
  1112. exit;
  1113. end
  1114. { constant pointer to ordinal }
  1115. else if is_ordinal(resulttype.def) then
  1116. begin
  1117. hp:=cordconstnode.create(tpointerconstnode(left).value,
  1118. resulttype,true);
  1119. result:=hp;
  1120. exit;
  1121. end;
  1122. end;
  1123. end;
  1124. { now call the resulttype helper to do constant folding }
  1125. result:=resulttype_call_helper(convtype);
  1126. end;
  1127. {$ifdef var_notification}
  1128. procedure Ttypeconvnode.mark_write;
  1129. begin
  1130. left.mark_write;
  1131. end;
  1132. {$endif}
  1133. function ttypeconvnode.first_cord_to_pointer : tnode;
  1134. begin
  1135. result:=nil;
  1136. internalerror(200104043);
  1137. end;
  1138. function ttypeconvnode.first_int_to_int : tnode;
  1139. begin
  1140. first_int_to_int:=nil;
  1141. if (left.location.loc<>LOC_REGISTER) and
  1142. (resulttype.def.size>left.resulttype.def.size) then
  1143. location.loc:=LOC_REGISTER;
  1144. if is_64bitint(resulttype.def) then
  1145. registers32:=max(registers32,2)
  1146. else
  1147. registers32:=max(registers32,1);
  1148. end;
  1149. function ttypeconvnode.first_cstring_to_pchar : tnode;
  1150. begin
  1151. first_cstring_to_pchar:=nil;
  1152. registers32:=1;
  1153. location.loc:=LOC_REGISTER;
  1154. end;
  1155. function ttypeconvnode.first_string_to_chararray : tnode;
  1156. begin
  1157. first_string_to_chararray:=nil;
  1158. registers32:=1;
  1159. location.loc:=LOC_REGISTER;
  1160. end;
  1161. function ttypeconvnode.first_char_to_string : tnode;
  1162. begin
  1163. first_char_to_string:=nil;
  1164. location.loc:=LOC_CREFERENCE;
  1165. end;
  1166. function ttypeconvnode.first_nothing : tnode;
  1167. begin
  1168. first_nothing:=nil;
  1169. end;
  1170. function ttypeconvnode.first_array_to_pointer : tnode;
  1171. begin
  1172. first_array_to_pointer:=nil;
  1173. if registers32<1 then
  1174. registers32:=1;
  1175. location.loc:=LOC_REGISTER;
  1176. end;
  1177. function ttypeconvnode.first_int_to_real: tnode;
  1178. var
  1179. fname: string[19];
  1180. typname : string[12];
  1181. begin
  1182. { Get the type name }
  1183. { Normally the typename should be one of the following:
  1184. single, double - carl
  1185. }
  1186. typname := lower(pbestrealtype^.def.gettypename);
  1187. { converting a 64bit integer to a float requires a helper }
  1188. if is_64bitint(left.resulttype.def) then
  1189. begin
  1190. if is_signed(left.resulttype.def) then
  1191. fname := 'fpc_int64_to_'+typname
  1192. else
  1193. fname := 'fpc_qword_to_'+typname;
  1194. result := ccallnode.createintern(fname,ccallparanode.create(
  1195. left,nil));
  1196. left:=nil;
  1197. firstpass(result);
  1198. exit;
  1199. end
  1200. else
  1201. { other integers are supposed to be 32 bit }
  1202. begin
  1203. if is_signed(left.resulttype.def) then
  1204. fname := 'fpc_longint_to_'+typname
  1205. else
  1206. fname := 'fpc_longword_to_'+typname;
  1207. result := ccallnode.createintern(fname,ccallparanode.create(
  1208. left,nil));
  1209. left:=nil;
  1210. firstpass(result);
  1211. exit;
  1212. end;
  1213. end;
  1214. function ttypeconvnode.first_real_to_real : tnode;
  1215. begin
  1216. first_real_to_real:=nil;
  1217. { comp isn't a floating type }
  1218. {$ifdef i386}
  1219. if (tfloatdef(resulttype.def).typ=s64comp) and
  1220. (tfloatdef(left.resulttype.def).typ<>s64comp) and
  1221. not (nf_explizit in flags) then
  1222. CGMessage(type_w_convert_real_2_comp);
  1223. {$endif}
  1224. if registersfpu<1 then
  1225. registersfpu:=1;
  1226. location.loc:=LOC_FPUREGISTER;
  1227. end;
  1228. function ttypeconvnode.first_pointer_to_array : tnode;
  1229. begin
  1230. first_pointer_to_array:=nil;
  1231. if registers32<1 then
  1232. registers32:=1;
  1233. location.loc:=LOC_REFERENCE;
  1234. end;
  1235. function ttypeconvnode.first_cchar_to_pchar : tnode;
  1236. begin
  1237. first_cchar_to_pchar:=nil;
  1238. internalerror(200104021);
  1239. end;
  1240. function ttypeconvnode.first_bool_to_int : tnode;
  1241. begin
  1242. first_bool_to_int:=nil;
  1243. { byte(boolean) or word(wordbool) or longint(longbool) must
  1244. be accepted for var parameters }
  1245. if (nf_explizit in flags) and
  1246. (left.resulttype.def.size=resulttype.def.size) and
  1247. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  1248. exit;
  1249. { when converting to 64bit, first convert to a 32bit int and then }
  1250. { convert to a 64bit int (only necessary for 32bit processors) (JM) }
  1251. if resulttype.def.size > sizeof(aword) then
  1252. begin
  1253. result := ctypeconvnode.create(left,u32bittype);
  1254. result.toggleflag(nf_explizit);
  1255. result := ctypeconvnode.create(result,resulttype);
  1256. left := nil;
  1257. firstpass(result);
  1258. exit;
  1259. end;
  1260. location.loc:=LOC_REGISTER;
  1261. if registers32<1 then
  1262. registers32:=1;
  1263. end;
  1264. function ttypeconvnode.first_int_to_bool : tnode;
  1265. begin
  1266. first_int_to_bool:=nil;
  1267. { byte(boolean) or word(wordbool) or longint(longbool) must
  1268. be accepted for var parameters }
  1269. if (nf_explizit in flags) and
  1270. (left.resulttype.def.size=resulttype.def.size) and
  1271. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  1272. exit;
  1273. location.loc:=LOC_REGISTER;
  1274. { need if bool to bool !!
  1275. not very nice !!
  1276. insertypeconv(left,s32bittype);
  1277. left.explizit:=true;
  1278. firstpass(left); }
  1279. if registers32<1 then
  1280. registers32:=1;
  1281. end;
  1282. function ttypeconvnode.first_bool_to_bool : tnode;
  1283. begin
  1284. first_bool_to_bool:=nil;
  1285. location.loc:=LOC_REGISTER;
  1286. if registers32<1 then
  1287. registers32:=1;
  1288. end;
  1289. function ttypeconvnode.first_char_to_char : tnode;
  1290. begin
  1291. first_char_to_char:=nil;
  1292. location.loc:=LOC_REGISTER;
  1293. if registers32<1 then
  1294. registers32:=1;
  1295. end;
  1296. function ttypeconvnode.first_proc_to_procvar : tnode;
  1297. begin
  1298. first_proc_to_procvar:=nil;
  1299. if (left.location.loc<>LOC_REFERENCE) then
  1300. CGMessage(cg_e_illegal_expression);
  1301. registers32:=left.registers32;
  1302. if registers32<1 then
  1303. registers32:=1;
  1304. location.loc:=LOC_REGISTER;
  1305. end;
  1306. function ttypeconvnode.first_load_smallset : tnode;
  1307. var
  1308. srsym: ttypesym;
  1309. p: tcallparanode;
  1310. begin
  1311. if not searchsystype('FPC_SMALL_SET',srsym) then
  1312. internalerror(200108313);
  1313. p := ccallparanode.create(left,nil);
  1314. { reused }
  1315. left := nil;
  1316. { convert parameter explicitely to fpc_small_set }
  1317. p.left := ctypeconvnode.create(p.left,srsym.restype);
  1318. p.left.toggleflag(nf_explizit);
  1319. { create call, adjust resulttype }
  1320. result :=
  1321. ccallnode.createinternres('fpc_set_load_small',p,resulttype);
  1322. firstpass(result);
  1323. end;
  1324. function ttypeconvnode.first_ansistring_to_pchar : tnode;
  1325. begin
  1326. first_ansistring_to_pchar:=nil;
  1327. location.loc:=LOC_REGISTER;
  1328. if registers32<1 then
  1329. registers32:=1;
  1330. end;
  1331. function ttypeconvnode.first_arrayconstructor_to_set : tnode;
  1332. begin
  1333. first_arrayconstructor_to_set:=nil;
  1334. internalerror(200104022);
  1335. end;
  1336. function ttypeconvnode.first_class_to_intf : tnode;
  1337. begin
  1338. first_class_to_intf:=nil;
  1339. location.loc:=LOC_REFERENCE;
  1340. if registers32<1 then
  1341. registers32:=1;
  1342. end;
  1343. function ttypeconvnode._first_int_to_int : tnode;
  1344. begin
  1345. result:=first_int_to_int;
  1346. end;
  1347. function ttypeconvnode._first_cstring_to_pchar : tnode;
  1348. begin
  1349. result:=first_cstring_to_pchar;
  1350. end;
  1351. function ttypeconvnode._first_string_to_chararray : tnode;
  1352. begin
  1353. result:=first_string_to_chararray;
  1354. end;
  1355. function ttypeconvnode._first_char_to_string : tnode;
  1356. begin
  1357. result:=first_char_to_string;
  1358. end;
  1359. function ttypeconvnode._first_nothing : tnode;
  1360. begin
  1361. result:=first_nothing;
  1362. end;
  1363. function ttypeconvnode._first_array_to_pointer : tnode;
  1364. begin
  1365. result:=first_array_to_pointer;
  1366. end;
  1367. function ttypeconvnode._first_int_to_real : tnode;
  1368. begin
  1369. result:=first_int_to_real;
  1370. end;
  1371. function ttypeconvnode._first_real_to_real : tnode;
  1372. begin
  1373. result:=first_real_to_real;
  1374. end;
  1375. function ttypeconvnode._first_pointer_to_array : tnode;
  1376. begin
  1377. result:=first_pointer_to_array;
  1378. end;
  1379. function ttypeconvnode._first_cchar_to_pchar : tnode;
  1380. begin
  1381. result:=first_cchar_to_pchar;
  1382. end;
  1383. function ttypeconvnode._first_bool_to_int : tnode;
  1384. begin
  1385. result:=first_bool_to_int;
  1386. end;
  1387. function ttypeconvnode._first_int_to_bool : tnode;
  1388. begin
  1389. result:=first_int_to_bool;
  1390. end;
  1391. function ttypeconvnode._first_bool_to_bool : tnode;
  1392. begin
  1393. result:=first_bool_to_bool;
  1394. end;
  1395. function ttypeconvnode._first_proc_to_procvar : tnode;
  1396. begin
  1397. result:=first_proc_to_procvar;
  1398. end;
  1399. function ttypeconvnode._first_load_smallset : tnode;
  1400. begin
  1401. result:=first_load_smallset;
  1402. end;
  1403. function ttypeconvnode._first_cord_to_pointer : tnode;
  1404. begin
  1405. result:=first_cord_to_pointer;
  1406. end;
  1407. function ttypeconvnode._first_ansistring_to_pchar : tnode;
  1408. begin
  1409. result:=first_ansistring_to_pchar;
  1410. end;
  1411. function ttypeconvnode._first_arrayconstructor_to_set : tnode;
  1412. begin
  1413. result:=first_arrayconstructor_to_set;
  1414. end;
  1415. function ttypeconvnode._first_class_to_intf : tnode;
  1416. begin
  1417. result:=first_class_to_intf;
  1418. end;
  1419. function ttypeconvnode._first_char_to_char : tnode;
  1420. begin
  1421. result:=first_char_to_char;
  1422. end;
  1423. function ttypeconvnode.first_call_helper(c : tconverttype) : tnode;
  1424. const
  1425. firstconvert : array[tconverttype] of pointer = (
  1426. @ttypeconvnode._first_nothing, {equal}
  1427. @ttypeconvnode._first_nothing, {not_possible}
  1428. nil, { removed in resulttype_string_to_string }
  1429. @ttypeconvnode._first_char_to_string,
  1430. @ttypeconvnode._first_nothing, { char_2_chararray, needs nothing extra }
  1431. nil, { removed in resulttype_chararray_to_string }
  1432. @ttypeconvnode._first_cchar_to_pchar,
  1433. @ttypeconvnode._first_cstring_to_pchar,
  1434. @ttypeconvnode._first_ansistring_to_pchar,
  1435. @ttypeconvnode._first_string_to_chararray,
  1436. nil, { removed in resulttype_chararray_to_string }
  1437. @ttypeconvnode._first_array_to_pointer,
  1438. @ttypeconvnode._first_pointer_to_array,
  1439. @ttypeconvnode._first_int_to_int,
  1440. @ttypeconvnode._first_int_to_bool,
  1441. @ttypeconvnode._first_bool_to_bool,
  1442. @ttypeconvnode._first_bool_to_int,
  1443. @ttypeconvnode._first_real_to_real,
  1444. @ttypeconvnode._first_int_to_real,
  1445. @ttypeconvnode._first_proc_to_procvar,
  1446. @ttypeconvnode._first_arrayconstructor_to_set,
  1447. @ttypeconvnode._first_load_smallset,
  1448. @ttypeconvnode._first_cord_to_pointer,
  1449. @ttypeconvnode._first_nothing,
  1450. @ttypeconvnode._first_nothing,
  1451. @ttypeconvnode._first_class_to_intf,
  1452. @ttypeconvnode._first_char_to_char,
  1453. @ttypeconvnode._first_nothing,
  1454. @ttypeconvnode._first_nothing,
  1455. nil
  1456. );
  1457. type
  1458. tprocedureofobject = function : tnode of object;
  1459. var
  1460. r : packed record
  1461. proc : pointer;
  1462. obj : pointer;
  1463. end;
  1464. begin
  1465. { this is a little bit dirty but it works }
  1466. { and should be quite portable too }
  1467. r.proc:=firstconvert[c];
  1468. r.obj:=self;
  1469. first_call_helper:=tprocedureofobject(r){$ifdef FPC}();{$endif FPC}
  1470. end;
  1471. function ttypeconvnode.pass_1 : tnode;
  1472. begin
  1473. result:=nil;
  1474. firstpass(left);
  1475. if codegenerror then
  1476. exit;
  1477. { load the value_str from the left part }
  1478. registers32:=left.registers32;
  1479. registersfpu:=left.registersfpu;
  1480. {$ifdef SUPPORT_MMX}
  1481. registersmmx:=left.registersmmx;
  1482. {$endif}
  1483. location.loc:=left.location.loc;
  1484. if nf_explizit in flags then
  1485. begin
  1486. { check if the result could be in a register }
  1487. if not(tstoreddef(resulttype.def).is_intregable) and
  1488. not(tstoreddef(resulttype.def).is_fpuregable) then
  1489. make_not_regable(left);
  1490. end;
  1491. result:=first_call_helper(convtype);
  1492. end;
  1493. function ttypeconvnode.docompare(p: tnode) : boolean;
  1494. begin
  1495. docompare :=
  1496. inherited docompare(p) and
  1497. (convtype = ttypeconvnode(p).convtype);
  1498. end;
  1499. {*****************************************************************************
  1500. TISNODE
  1501. *****************************************************************************}
  1502. constructor tisnode.create(l,r : tnode);
  1503. begin
  1504. inherited create(isn,l,r);
  1505. end;
  1506. function tisnode.det_resulttype:tnode;
  1507. var
  1508. paras: tcallparanode;
  1509. begin
  1510. result:=nil;
  1511. resulttypepass(left);
  1512. resulttypepass(right);
  1513. set_varstate(left,true);
  1514. set_varstate(right,true);
  1515. if codegenerror then
  1516. exit;
  1517. if (right.resulttype.def.deftype=classrefdef) then
  1518. begin
  1519. { left must be a class }
  1520. if is_class(left.resulttype.def) then
  1521. begin
  1522. { the operands must be related }
  1523. if (not(tobjectdef(left.resulttype.def).is_related(
  1524. tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def)))) and
  1525. (not(tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def).is_related(
  1526. tobjectdef(left.resulttype.def)))) then
  1527. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,
  1528. tclassrefdef(right.resulttype.def).pointertype.def.typename);
  1529. end
  1530. else
  1531. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1532. { call fpc_do_is helper }
  1533. paras := ccallparanode.create(
  1534. left,
  1535. ccallparanode.create(
  1536. right,nil));
  1537. result := ccallnode.createintern('fpc_do_is',paras);
  1538. left := nil;
  1539. right := nil;
  1540. end
  1541. else if is_interface(right.resulttype.def) then
  1542. begin
  1543. { left is a class }
  1544. if is_class(left.resulttype.def) then
  1545. begin
  1546. { the operands must be related }
  1547. if not(assigned(tobjectdef(left.resulttype.def).implementedinterfaces) and
  1548. (tobjectdef(left.resulttype.def).implementedinterfaces.searchintf(right.resulttype.def)<>-1)) then
  1549. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1550. end
  1551. { left is an interface }
  1552. else if is_interface(left.resulttype.def) then
  1553. begin
  1554. { the operands must be related }
  1555. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(right.resulttype.def)))) and
  1556. (not(tobjectdef(right.resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1557. CGMessage(type_e_mismatch);
  1558. end
  1559. else
  1560. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1561. { call fpc_do_is helper }
  1562. paras := ccallparanode.create(
  1563. left,
  1564. ccallparanode.create(
  1565. right,nil));
  1566. result := ccallnode.createintern('fpc_do_is',paras);
  1567. left := nil;
  1568. right := nil;
  1569. end
  1570. else
  1571. CGMessage1(type_e_class_or_interface_type_expected,right.resulttype.def.typename);
  1572. resulttype:=booltype;
  1573. end;
  1574. function tisnode.pass_1 : tnode;
  1575. begin
  1576. internalerror(200204254);
  1577. result:=nil;
  1578. end;
  1579. { dummy pass_2, it will never be called, but we need one since }
  1580. { you can't instantiate an abstract class }
  1581. procedure tisnode.pass_2;
  1582. begin
  1583. end;
  1584. {*****************************************************************************
  1585. TASNODE
  1586. *****************************************************************************}
  1587. constructor tasnode.create(l,r : tnode);
  1588. begin
  1589. inherited create(asn,l,r);
  1590. call := nil;
  1591. end;
  1592. destructor tasnode.destroy;
  1593. begin
  1594. call.free;
  1595. inherited destroy;
  1596. end;
  1597. function tasnode.det_resulttype:tnode;
  1598. var
  1599. hp : tnode;
  1600. b : boolean;
  1601. o : tobjectdef;
  1602. begin
  1603. result:=nil;
  1604. resulttypepass(right);
  1605. resulttypepass(left);
  1606. set_varstate(right,true);
  1607. set_varstate(left,true);
  1608. if codegenerror then
  1609. exit;
  1610. if (right.resulttype.def.deftype=classrefdef) then
  1611. begin
  1612. { left must be a class }
  1613. if is_class(left.resulttype.def) then
  1614. begin
  1615. { the operands must be related }
  1616. if (not(tobjectdef(left.resulttype.def).is_related(
  1617. tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def)))) and
  1618. (not(tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def).is_related(
  1619. tobjectdef(left.resulttype.def)))) then
  1620. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,
  1621. tclassrefdef(right.resulttype.def).pointertype.def.typename);
  1622. end
  1623. else
  1624. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1625. resulttype:=tclassrefdef(right.resulttype.def).pointertype;
  1626. end
  1627. else if is_interface(right.resulttype.def) then
  1628. begin
  1629. { left is a class }
  1630. if is_class(left.resulttype.def) then
  1631. begin
  1632. { the operands must be related
  1633. no, because the class instance could be a child class of the current one which
  1634. implements additional interfaces (FK)
  1635. b:=false;
  1636. o:=tobjectdef(left.resulttype.def);
  1637. while assigned(o) do
  1638. begin
  1639. if assigned(o.implementedinterfaces) and
  1640. (o.implementedinterfaces.searchintf(right.resulttype.def)<>-1) then
  1641. begin
  1642. b:=true;
  1643. break;
  1644. end;
  1645. o:=o.childof;
  1646. end;
  1647. if not(b) then
  1648. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1649. }
  1650. end
  1651. { left is an interface }
  1652. else if is_interface(left.resulttype.def) then
  1653. begin
  1654. { the operands must be related
  1655. we don't necessarily know how the both interfaces are implemented, so we can't do this check (FK)
  1656. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(right.resulttype.def)))) and
  1657. (not(tobjectdef(right.resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1658. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1659. }
  1660. end
  1661. else
  1662. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1663. resulttype:=right.resulttype;
  1664. { load the GUID of the interface }
  1665. if (right.nodetype=typen) then
  1666. begin
  1667. if assigned(tobjectdef(right.resulttype.def).iidguid) then
  1668. begin
  1669. hp:=cguidconstnode.create(tobjectdef(right.resulttype.def).iidguid^);
  1670. right.free;
  1671. right:=hp;
  1672. end
  1673. else
  1674. internalerror(200206282);
  1675. resulttypepass(right);
  1676. end;
  1677. end
  1678. else
  1679. CGMessage1(type_e_class_or_interface_type_expected,right.resulttype.def.typename);
  1680. end;
  1681. function tasnode.getcopy: tnode;
  1682. begin
  1683. result := inherited getcopy;
  1684. if assigned(call) then
  1685. tasnode(result).call := call.getcopy
  1686. else
  1687. tasnode(result).call := nil;
  1688. end;
  1689. function tasnode.pass_1 : tnode;
  1690. var
  1691. procname: string;
  1692. begin
  1693. result:=nil;
  1694. if not assigned(call) then
  1695. begin
  1696. if is_class(left.resulttype.def) and
  1697. (right.resulttype.def.deftype=classrefdef) then
  1698. call := ccallnode.createinternres('fpc_do_as',
  1699. ccallparanode.create(left,ccallparanode.create(right,nil)),
  1700. resulttype)
  1701. else
  1702. begin
  1703. if is_class(left.resulttype.def) then
  1704. procname := 'fpc_class_as_intf'
  1705. else
  1706. procname := 'fpc_intf_as';
  1707. call := ccallnode.createinternres(procname,
  1708. ccallparanode.create(right,ccallparanode.create(left,nil)),
  1709. resulttype);
  1710. end;
  1711. left := nil;
  1712. right := nil;
  1713. firstpass(call);
  1714. if codegenerror then
  1715. exit;
  1716. location.loc:=call.location.loc;
  1717. registers32:=call.registers32;
  1718. registersfpu:=call.registersfpu;
  1719. {$ifdef SUPPORT_MMX}
  1720. registersmmx:=call.registersmmx;
  1721. {$endif SUPPORT_MMX}
  1722. end;
  1723. end;
  1724. begin
  1725. ctypeconvnode:=ttypeconvnode;
  1726. casnode:=tasnode;
  1727. cisnode:=tisnode;
  1728. end.
  1729. {
  1730. $Log$
  1731. Revision 1.93 2002-11-30 10:45:14 carl
  1732. * fix bug with checking of duplicated items in sets (new sets bug only)
  1733. Revision 1.92 2002/11/27 19:43:21 carl
  1734. * updated notes and hints
  1735. Revision 1.91 2002/11/27 13:11:38 peter
  1736. * more currency fixes, taddcurr runs now successfull
  1737. Revision 1.90 2002/11/27 11:29:21 peter
  1738. * when converting from and to currency divide or multiple the
  1739. result by 10000
  1740. Revision 1.89 2002/11/25 17:43:18 peter
  1741. * splitted defbase in defutil,symutil,defcmp
  1742. * merged isconvertable and is_equal into compare_defs(_ext)
  1743. * made operator search faster by walking the list only once
  1744. Revision 1.88 2002/11/17 16:31:56 carl
  1745. * memory optimization (3-4%) : cleanup of tai fields,
  1746. cleanup of tdef and tsym fields.
  1747. * make it work for m68k
  1748. Revision 1.87 2002/10/10 16:07:57 florian
  1749. + several widestring/pwidechar related stuff added
  1750. Revision 1.86 2002/10/06 16:10:23 florian
  1751. * when compiling <interface> as <interface> we can't assume
  1752. anything about relation
  1753. Revision 1.85 2002/10/05 12:43:25 carl
  1754. * fixes for Delphi 6 compilation
  1755. (warning : Some features do not work under Delphi)
  1756. Revision 1.84 2002/10/02 20:23:50 florian
  1757. - removed the relation check for <class> as <interface> because we don't
  1758. know the runtime type of <class>! It could be a child class of the given type
  1759. which implements additional interfaces
  1760. Revision 1.83 2002/10/02 20:17:14 florian
  1761. + the as operator for <class> as <interface> has to check the parent classes as well
  1762. Revision 1.82 2002/09/30 07:00:47 florian
  1763. * fixes to common code to get the alpha compiler compiled applied
  1764. Revision 1.81 2002/09/16 14:11:13 peter
  1765. * add argument to equal_paras() to support default values or not
  1766. Revision 1.80 2002/09/07 20:40:23 carl
  1767. * cardinal -> longword
  1768. Revision 1.79 2002/09/07 15:25:03 peter
  1769. * old logs removed and tabs fixed
  1770. Revision 1.78 2002/09/07 12:16:04 carl
  1771. * second part bug report 1996 fix, testrange in cordconstnode
  1772. only called if option is set (also make parsing a tiny faster)
  1773. Revision 1.77 2002/09/05 05:56:07 jonas
  1774. - reverted my last commit, it was completely bogus :(
  1775. Revision 1.75 2002/09/02 19:24:42 peter
  1776. * array of char support for Str()
  1777. Revision 1.74 2002/09/01 08:01:16 daniel
  1778. * Removed sets from Tcallnode.det_resulttype
  1779. + Added read/write notifications of variables. These will be usefull
  1780. for providing information for several optimizations. For example
  1781. the value of the loop variable of a for loop does matter is the
  1782. variable is read after the for loop, but if it's no longer used
  1783. or written, it doesn't matter and this can be used to optimize
  1784. the loop code generation.
  1785. Revision 1.73 2002/08/23 16:14:49 peter
  1786. * tempgen cleanup
  1787. * tt_noreuse temp type added that will be used in genentrycode
  1788. Revision 1.72 2002/08/20 18:23:33 jonas
  1789. * the as node again uses a compilerproc
  1790. + (untested) support for interface "as" statements
  1791. Revision 1.71 2002/08/19 19:36:43 peter
  1792. * More fixes for cross unit inlining, all tnodes are now implemented
  1793. * Moved pocall_internconst to po_internconst because it is not a
  1794. calling type at all and it conflicted when inlining of these small
  1795. functions was requested
  1796. Revision 1.70 2002/08/17 09:23:36 florian
  1797. * first part of procinfo rewrite
  1798. Revision 1.69 2002/08/14 19:26:55 carl
  1799. + generic int_to_real type conversion
  1800. + generic unaryminus node
  1801. Revision 1.68 2002/08/11 16:08:55 florian
  1802. + support of explicit type case boolean->char
  1803. Revision 1.67 2002/08/11 15:28:00 florian
  1804. + support of explicit type case <any ordinal type>->pointer
  1805. (delphi mode only)
  1806. Revision 1.66 2002/08/09 07:33:01 florian
  1807. * a couple of interface related fixes
  1808. Revision 1.65 2002/07/29 21:23:42 florian
  1809. * more fixes for the ppc
  1810. + wrappers for the tcnvnode.first_* stuff introduced
  1811. Revision 1.64 2002/07/23 12:34:30 daniel
  1812. * Readded old set code. To use it define 'oldset'. Activated by default
  1813. for ppc.
  1814. Revision 1.63 2002/07/23 09:51:22 daniel
  1815. * Tried to make Tprocsym.defs protected. I didn't succeed but the cleanups
  1816. are worth comitting.
  1817. Revision 1.62 2002/07/22 11:48:04 daniel
  1818. * Sets are now internally sets.
  1819. Revision 1.61 2002/07/20 17:16:02 florian
  1820. + source code page support
  1821. Revision 1.60 2002/07/20 11:57:54 florian
  1822. * types.pas renamed to defbase.pas because D6 contains a types
  1823. unit so this would conflicts if D6 programms are compiled
  1824. + Willamette/SSE2 instructions to assembler added
  1825. Revision 1.59 2002/07/01 16:23:53 peter
  1826. * cg64 patch
  1827. * basics for currency
  1828. * asnode updates for class and interface (not finished)
  1829. Revision 1.58 2002/05/18 13:34:09 peter
  1830. * readded missing revisions
  1831. }