ncnv.pas 76 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205
  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) then
  987. begin
  988. if assigned(tcallnode(left).methodpointer) then
  989. tloadnode(hp).set_mp(tcallnode(left).methodpointer.getcopy)
  990. else
  991. tloadnode(hp).set_mp(cselfnode.create(tobjectdef(tcallnode(left).symtableprocentry.owner.defowner)));
  992. end;
  993. end;
  994. resulttypepass(hp);
  995. left.free;
  996. left:=hp;
  997. convtype:=tc_proc_2_procvar;
  998. { Now check if the procedure we are going to assign to
  999. the procvar, is compatible with the procvar's type }
  1000. if proc_to_procvar_equal(tprocdef(left.resulttype.def),
  1001. tprocvardef(resulttype.def),true)=te_incompatible then
  1002. CGMessage2(type_e_incompatible_types,tprocdef(left.resulttype.def).typename,resulttype.def.typename);
  1003. exit;
  1004. end;
  1005. end;
  1006. { Handle explicit type conversions }
  1007. if nf_explizit in flags then
  1008. begin
  1009. { do common tc_equal cast }
  1010. convtype:=tc_equal;
  1011. { check if the result could be in a register }
  1012. if not(tstoreddef(resulttype.def).is_intregable) and
  1013. not(tstoreddef(resulttype.def).is_fpuregable) then
  1014. make_not_regable(left);
  1015. { class to class or object to object, with checkobject support }
  1016. if (resulttype.def.deftype=objectdef) and
  1017. (left.resulttype.def.deftype=objectdef) then
  1018. begin
  1019. if (cs_check_object in aktlocalswitches) then
  1020. begin
  1021. if is_class_or_interface(resulttype.def) then
  1022. begin
  1023. { we can translate the typeconvnode to 'as' when
  1024. typecasting to a class or interface }
  1025. hp:=casnode.create(left,cloadvmtnode.create(ctypenode.create(resulttype)));
  1026. left:=nil;
  1027. result:=hp;
  1028. exit;
  1029. end;
  1030. end
  1031. else
  1032. begin
  1033. { check if the types are related }
  1034. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(resulttype.def)))) and
  1035. (not(tobjectdef(resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1036. CGMessage2(type_w_classes_not_related,left.resulttype.def.typename,resulttype.def.typename);
  1037. end;
  1038. end
  1039. else
  1040. begin
  1041. { only if the same size or formal def }
  1042. if not(
  1043. (left.resulttype.def.deftype=formaldef) or
  1044. (
  1045. not(is_open_array(left.resulttype.def)) and
  1046. (left.resulttype.def.size=resulttype.def.size)
  1047. ) or
  1048. (
  1049. is_void(left.resulttype.def) and
  1050. (left.nodetype=derefn)
  1051. )
  1052. ) or
  1053. (left.resulttype.def.deftype=classrefdef) then
  1054. CGMessage(cg_e_illegal_type_conversion);
  1055. end;
  1056. end
  1057. else
  1058. CGMessage2(type_e_incompatible_types,left.resulttype.def.typename,resulttype.def.typename);
  1059. end;
  1060. else
  1061. internalerror(200211231);
  1062. end;
  1063. { Give hint for unportable code }
  1064. if ((left.resulttype.def.deftype=orddef) and
  1065. (resulttype.def.deftype in [pointerdef,procvardef,classrefdef])) or
  1066. ((resulttype.def.deftype=orddef) and
  1067. (left.resulttype.def.deftype in [pointerdef,procvardef,classrefdef])) then
  1068. CGMessage(cg_h_pointer_to_longint_conv_not_portable);
  1069. { Constant folding and other node transitions to
  1070. remove the typeconv node }
  1071. case left.nodetype of
  1072. loadn :
  1073. begin
  1074. { tp7 procvar support, when right is not a procvardef and we got a
  1075. loadn of a procvar then convert to a calln, the check for the
  1076. result is already done in is_convertible, also no conflict with
  1077. @procvar is here because that has an extra addrn }
  1078. if (m_tp_procvar in aktmodeswitches) and
  1079. (resulttype.def.deftype<>procvardef) and
  1080. (left.resulttype.def.deftype=procvardef) then
  1081. begin
  1082. hp:=ccallnode.create(nil,nil,nil,nil);
  1083. tcallnode(hp).set_procvar(left);
  1084. resulttypepass(hp);
  1085. left:=hp;
  1086. end;
  1087. end;
  1088. niln :
  1089. begin
  1090. { nil to ordinal node }
  1091. if (resulttype.def.deftype=orddef) then
  1092. begin
  1093. hp:=cordconstnode.create(0,resulttype,true);
  1094. result:=hp;
  1095. exit;
  1096. end
  1097. else
  1098. { fold nil to any pointer type }
  1099. if (resulttype.def.deftype=pointerdef) then
  1100. begin
  1101. hp:=cnilnode.create;
  1102. hp.resulttype:=resulttype;
  1103. result:=hp;
  1104. exit;
  1105. end
  1106. else
  1107. { remove typeconv after niln, but not when the result is a
  1108. methodpointer. The typeconv of the methodpointer will then
  1109. take care of updateing size of niln to OS_64 }
  1110. if not((resulttype.def.deftype=procvardef) and
  1111. (po_methodpointer in tprocvardef(resulttype.def).procoptions)) then
  1112. begin
  1113. left.resulttype:=resulttype;
  1114. result:=left;
  1115. left:=nil;
  1116. exit;
  1117. end;
  1118. end;
  1119. ordconstn :
  1120. begin
  1121. { ordinal contants can be directly converted }
  1122. { but not char to char because it is a widechar to char or via versa }
  1123. { which needs extra code to do the code page transistion }
  1124. if is_ordinal(resulttype.def) and
  1125. not(convtype=tc_char_2_char) then
  1126. begin
  1127. { replace the resulttype and recheck the range }
  1128. left.resulttype:=resulttype;
  1129. testrange(left.resulttype.def,tordconstnode(left).value,(nf_explizit in flags));
  1130. result:=left;
  1131. left:=nil;
  1132. exit;
  1133. end;
  1134. end;
  1135. pointerconstn :
  1136. begin
  1137. { pointerconstn to any pointer is folded too }
  1138. if (resulttype.def.deftype=pointerdef) then
  1139. begin
  1140. left.resulttype:=resulttype;
  1141. result:=left;
  1142. left:=nil;
  1143. exit;
  1144. end
  1145. { constant pointer to ordinal }
  1146. else if is_ordinal(resulttype.def) then
  1147. begin
  1148. hp:=cordconstnode.create(tpointerconstnode(left).value,
  1149. resulttype,true);
  1150. result:=hp;
  1151. exit;
  1152. end;
  1153. end;
  1154. end;
  1155. { now call the resulttype helper to do constant folding }
  1156. result:=resulttype_call_helper(convtype);
  1157. end;
  1158. procedure Ttypeconvnode.mark_write;
  1159. begin
  1160. left.mark_write;
  1161. end;
  1162. function ttypeconvnode.first_cord_to_pointer : tnode;
  1163. begin
  1164. result:=nil;
  1165. internalerror(200104043);
  1166. end;
  1167. function ttypeconvnode.first_int_to_int : tnode;
  1168. begin
  1169. first_int_to_int:=nil;
  1170. if (left.location.loc<>LOC_REGISTER) and
  1171. (resulttype.def.size>left.resulttype.def.size) then
  1172. location.loc:=LOC_REGISTER;
  1173. if is_64bitint(resulttype.def) then
  1174. registers32:=max(registers32,2)
  1175. else
  1176. registers32:=max(registers32,1);
  1177. end;
  1178. function ttypeconvnode.first_cstring_to_pchar : tnode;
  1179. begin
  1180. first_cstring_to_pchar:=nil;
  1181. registers32:=1;
  1182. location.loc:=LOC_REGISTER;
  1183. end;
  1184. function ttypeconvnode.first_string_to_chararray : tnode;
  1185. begin
  1186. first_string_to_chararray:=nil;
  1187. registers32:=1;
  1188. location.loc:=LOC_REGISTER;
  1189. end;
  1190. function ttypeconvnode.first_char_to_string : tnode;
  1191. begin
  1192. first_char_to_string:=nil;
  1193. location.loc:=LOC_CREFERENCE;
  1194. end;
  1195. function ttypeconvnode.first_nothing : tnode;
  1196. begin
  1197. first_nothing:=nil;
  1198. end;
  1199. function ttypeconvnode.first_array_to_pointer : tnode;
  1200. begin
  1201. first_array_to_pointer:=nil;
  1202. if registers32<1 then
  1203. registers32:=1;
  1204. location.loc:=LOC_REGISTER;
  1205. end;
  1206. function ttypeconvnode.first_int_to_real: tnode;
  1207. var
  1208. fname: string[32];
  1209. typname : string[12];
  1210. begin
  1211. { Get the type name }
  1212. { Normally the typename should be one of the following:
  1213. single, double - carl
  1214. }
  1215. typname := lower(pbestrealtype^.def.gettypename);
  1216. { converting a 64bit integer to a float requires a helper }
  1217. if is_64bitint(left.resulttype.def) then
  1218. begin
  1219. if is_signed(left.resulttype.def) then
  1220. fname := 'fpc_int64_to_'+typname
  1221. else
  1222. {$warning generic conversion from int to float does not support unsigned integers}
  1223. fname := 'fpc_int64_to_'+typname;
  1224. result := ccallnode.createintern(fname,ccallparanode.create(
  1225. left,nil));
  1226. left:=nil;
  1227. firstpass(result);
  1228. exit;
  1229. end
  1230. else
  1231. { other integers are supposed to be 32 bit }
  1232. begin
  1233. {$warning generic conversion from int to float does not support unsigned integers}
  1234. if is_signed(left.resulttype.def) then
  1235. fname := 'fpc_longint_to_'+typname
  1236. else
  1237. fname := 'fpc_longint_to_'+typname;
  1238. result := ccallnode.createintern(fname,ccallparanode.create(
  1239. left,nil));
  1240. left:=nil;
  1241. firstpass(result);
  1242. exit;
  1243. end;
  1244. end;
  1245. function ttypeconvnode.first_real_to_real : tnode;
  1246. begin
  1247. first_real_to_real:=nil;
  1248. { comp isn't a floating type }
  1249. {$ifdef i386}
  1250. if (tfloatdef(resulttype.def).typ=s64comp) and
  1251. (tfloatdef(left.resulttype.def).typ<>s64comp) and
  1252. not (nf_explizit in flags) then
  1253. CGMessage(type_w_convert_real_2_comp);
  1254. {$endif}
  1255. if registersfpu<1 then
  1256. registersfpu:=1;
  1257. location.loc:=LOC_FPUREGISTER;
  1258. end;
  1259. function ttypeconvnode.first_pointer_to_array : tnode;
  1260. begin
  1261. first_pointer_to_array:=nil;
  1262. if registers32<1 then
  1263. registers32:=1;
  1264. location.loc:=LOC_REFERENCE;
  1265. end;
  1266. function ttypeconvnode.first_cchar_to_pchar : tnode;
  1267. begin
  1268. first_cchar_to_pchar:=nil;
  1269. internalerror(200104021);
  1270. end;
  1271. function ttypeconvnode.first_bool_to_int : tnode;
  1272. begin
  1273. first_bool_to_int:=nil;
  1274. { byte(boolean) or word(wordbool) or longint(longbool) must
  1275. be accepted for var parameters }
  1276. if (nf_explizit in flags) and
  1277. (left.resulttype.def.size=resulttype.def.size) and
  1278. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  1279. exit;
  1280. { when converting to 64bit, first convert to a 32bit int and then }
  1281. { convert to a 64bit int (only necessary for 32bit processors) (JM) }
  1282. if resulttype.def.size > sizeof(aword) then
  1283. begin
  1284. result := ctypeconvnode.create(left,u32bittype);
  1285. result.toggleflag(nf_explizit);
  1286. result := ctypeconvnode.create(result,resulttype);
  1287. left := nil;
  1288. firstpass(result);
  1289. exit;
  1290. end;
  1291. location.loc:=LOC_REGISTER;
  1292. if registers32<1 then
  1293. registers32:=1;
  1294. end;
  1295. function ttypeconvnode.first_int_to_bool : tnode;
  1296. begin
  1297. first_int_to_bool:=nil;
  1298. { byte(boolean) or word(wordbool) or longint(longbool) must
  1299. be accepted for var parameters }
  1300. if (nf_explizit in flags) and
  1301. (left.resulttype.def.size=resulttype.def.size) and
  1302. (left.location.loc in [LOC_REFERENCE,LOC_CREFERENCE,LOC_CREGISTER]) then
  1303. exit;
  1304. location.loc:=LOC_REGISTER;
  1305. { need if bool to bool !!
  1306. not very nice !!
  1307. insertypeconv(left,s32bittype);
  1308. left.explizit:=true;
  1309. firstpass(left); }
  1310. if registers32<1 then
  1311. registers32:=1;
  1312. end;
  1313. function ttypeconvnode.first_bool_to_bool : tnode;
  1314. begin
  1315. first_bool_to_bool:=nil;
  1316. location.loc:=LOC_REGISTER;
  1317. if registers32<1 then
  1318. registers32:=1;
  1319. end;
  1320. function ttypeconvnode.first_char_to_char : tnode;
  1321. begin
  1322. first_char_to_char:=nil;
  1323. location.loc:=LOC_REGISTER;
  1324. if registers32<1 then
  1325. registers32:=1;
  1326. end;
  1327. function ttypeconvnode.first_proc_to_procvar : tnode;
  1328. begin
  1329. first_proc_to_procvar:=nil;
  1330. if (left.location.loc<>LOC_REFERENCE) then
  1331. CGMessage(cg_e_illegal_expression);
  1332. registers32:=left.registers32;
  1333. if registers32<1 then
  1334. registers32:=1;
  1335. location.loc:=LOC_REGISTER;
  1336. end;
  1337. function ttypeconvnode.first_load_smallset : tnode;
  1338. var
  1339. srsym: ttypesym;
  1340. p: tcallparanode;
  1341. begin
  1342. if not searchsystype('FPC_SMALL_SET',srsym) then
  1343. internalerror(200108313);
  1344. p := ccallparanode.create(left,nil);
  1345. { reused }
  1346. left := nil;
  1347. { convert parameter explicitely to fpc_small_set }
  1348. p.left := ctypeconvnode.create(p.left,srsym.restype);
  1349. p.left.toggleflag(nf_explizit);
  1350. { create call, adjust resulttype }
  1351. result :=
  1352. ccallnode.createinternres('fpc_set_load_small',p,resulttype);
  1353. firstpass(result);
  1354. end;
  1355. function ttypeconvnode.first_ansistring_to_pchar : tnode;
  1356. begin
  1357. first_ansistring_to_pchar:=nil;
  1358. location.loc:=LOC_REGISTER;
  1359. if registers32<1 then
  1360. registers32:=1;
  1361. end;
  1362. function ttypeconvnode.first_arrayconstructor_to_set : tnode;
  1363. begin
  1364. first_arrayconstructor_to_set:=nil;
  1365. internalerror(200104022);
  1366. end;
  1367. function ttypeconvnode.first_class_to_intf : tnode;
  1368. begin
  1369. first_class_to_intf:=nil;
  1370. location.loc:=LOC_REFERENCE;
  1371. if registers32<1 then
  1372. registers32:=1;
  1373. end;
  1374. function ttypeconvnode._first_int_to_int : tnode;
  1375. begin
  1376. result:=first_int_to_int;
  1377. end;
  1378. function ttypeconvnode._first_cstring_to_pchar : tnode;
  1379. begin
  1380. result:=first_cstring_to_pchar;
  1381. end;
  1382. function ttypeconvnode._first_string_to_chararray : tnode;
  1383. begin
  1384. result:=first_string_to_chararray;
  1385. end;
  1386. function ttypeconvnode._first_char_to_string : tnode;
  1387. begin
  1388. result:=first_char_to_string;
  1389. end;
  1390. function ttypeconvnode._first_nothing : tnode;
  1391. begin
  1392. result:=first_nothing;
  1393. end;
  1394. function ttypeconvnode._first_array_to_pointer : tnode;
  1395. begin
  1396. result:=first_array_to_pointer;
  1397. end;
  1398. function ttypeconvnode._first_int_to_real : tnode;
  1399. begin
  1400. result:=first_int_to_real;
  1401. end;
  1402. function ttypeconvnode._first_real_to_real : tnode;
  1403. begin
  1404. result:=first_real_to_real;
  1405. end;
  1406. function ttypeconvnode._first_pointer_to_array : tnode;
  1407. begin
  1408. result:=first_pointer_to_array;
  1409. end;
  1410. function ttypeconvnode._first_cchar_to_pchar : tnode;
  1411. begin
  1412. result:=first_cchar_to_pchar;
  1413. end;
  1414. function ttypeconvnode._first_bool_to_int : tnode;
  1415. begin
  1416. result:=first_bool_to_int;
  1417. end;
  1418. function ttypeconvnode._first_int_to_bool : tnode;
  1419. begin
  1420. result:=first_int_to_bool;
  1421. end;
  1422. function ttypeconvnode._first_bool_to_bool : tnode;
  1423. begin
  1424. result:=first_bool_to_bool;
  1425. end;
  1426. function ttypeconvnode._first_proc_to_procvar : tnode;
  1427. begin
  1428. result:=first_proc_to_procvar;
  1429. end;
  1430. function ttypeconvnode._first_load_smallset : tnode;
  1431. begin
  1432. result:=first_load_smallset;
  1433. end;
  1434. function ttypeconvnode._first_cord_to_pointer : tnode;
  1435. begin
  1436. result:=first_cord_to_pointer;
  1437. end;
  1438. function ttypeconvnode._first_ansistring_to_pchar : tnode;
  1439. begin
  1440. result:=first_ansistring_to_pchar;
  1441. end;
  1442. function ttypeconvnode._first_arrayconstructor_to_set : tnode;
  1443. begin
  1444. result:=first_arrayconstructor_to_set;
  1445. end;
  1446. function ttypeconvnode._first_class_to_intf : tnode;
  1447. begin
  1448. result:=first_class_to_intf;
  1449. end;
  1450. function ttypeconvnode._first_char_to_char : tnode;
  1451. begin
  1452. result:=first_char_to_char;
  1453. end;
  1454. function ttypeconvnode.first_call_helper(c : tconverttype) : tnode;
  1455. const
  1456. firstconvert : array[tconverttype] of pointer = (
  1457. @ttypeconvnode._first_nothing, {equal}
  1458. @ttypeconvnode._first_nothing, {not_possible}
  1459. nil, { removed in resulttype_string_to_string }
  1460. @ttypeconvnode._first_char_to_string,
  1461. @ttypeconvnode._first_nothing, { char_2_chararray, needs nothing extra }
  1462. nil, { removed in resulttype_chararray_to_string }
  1463. @ttypeconvnode._first_cchar_to_pchar,
  1464. @ttypeconvnode._first_cstring_to_pchar,
  1465. @ttypeconvnode._first_ansistring_to_pchar,
  1466. @ttypeconvnode._first_string_to_chararray,
  1467. nil, { removed in resulttype_chararray_to_string }
  1468. @ttypeconvnode._first_array_to_pointer,
  1469. @ttypeconvnode._first_pointer_to_array,
  1470. @ttypeconvnode._first_int_to_int,
  1471. @ttypeconvnode._first_int_to_bool,
  1472. @ttypeconvnode._first_bool_to_bool,
  1473. @ttypeconvnode._first_bool_to_int,
  1474. @ttypeconvnode._first_real_to_real,
  1475. @ttypeconvnode._first_int_to_real,
  1476. @ttypeconvnode._first_proc_to_procvar,
  1477. @ttypeconvnode._first_arrayconstructor_to_set,
  1478. @ttypeconvnode._first_load_smallset,
  1479. @ttypeconvnode._first_cord_to_pointer,
  1480. @ttypeconvnode._first_nothing,
  1481. @ttypeconvnode._first_nothing,
  1482. @ttypeconvnode._first_class_to_intf,
  1483. @ttypeconvnode._first_char_to_char,
  1484. @ttypeconvnode._first_nothing,
  1485. @ttypeconvnode._first_nothing,
  1486. nil,
  1487. nil,
  1488. nil
  1489. );
  1490. type
  1491. tprocedureofobject = function : tnode of object;
  1492. var
  1493. r : packed record
  1494. proc : pointer;
  1495. obj : pointer;
  1496. end;
  1497. begin
  1498. { this is a little bit dirty but it works }
  1499. { and should be quite portable too }
  1500. r.proc:=firstconvert[c];
  1501. r.obj:=self;
  1502. first_call_helper:=tprocedureofobject(r){$ifdef FPC}();{$endif FPC}
  1503. end;
  1504. function ttypeconvnode.pass_1 : tnode;
  1505. begin
  1506. result:=nil;
  1507. firstpass(left);
  1508. if codegenerror then
  1509. exit;
  1510. { load the value_str from the left part }
  1511. registers32:=left.registers32;
  1512. registersfpu:=left.registersfpu;
  1513. {$ifdef SUPPORT_MMX}
  1514. registersmmx:=left.registersmmx;
  1515. {$endif}
  1516. location.loc:=left.location.loc;
  1517. if nf_explizit in flags then
  1518. begin
  1519. { check if the result could be in a register }
  1520. if not(tstoreddef(resulttype.def).is_intregable) and
  1521. not(tstoreddef(resulttype.def).is_fpuregable) then
  1522. make_not_regable(left);
  1523. end;
  1524. result:=first_call_helper(convtype);
  1525. end;
  1526. function ttypeconvnode.docompare(p: tnode) : boolean;
  1527. begin
  1528. docompare :=
  1529. inherited docompare(p) and
  1530. (convtype = ttypeconvnode(p).convtype);
  1531. end;
  1532. {*****************************************************************************
  1533. TISNODE
  1534. *****************************************************************************}
  1535. constructor tisnode.create(l,r : tnode);
  1536. begin
  1537. inherited create(isn,l,r);
  1538. end;
  1539. function tisnode.det_resulttype:tnode;
  1540. var
  1541. paras: tcallparanode;
  1542. begin
  1543. result:=nil;
  1544. resulttypepass(left);
  1545. resulttypepass(right);
  1546. set_varstate(left,true);
  1547. set_varstate(right,true);
  1548. if codegenerror then
  1549. exit;
  1550. if (right.resulttype.def.deftype=classrefdef) then
  1551. begin
  1552. { left must be a class }
  1553. if is_class(left.resulttype.def) then
  1554. begin
  1555. { the operands must be related }
  1556. if (not(tobjectdef(left.resulttype.def).is_related(
  1557. tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def)))) and
  1558. (not(tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def).is_related(
  1559. tobjectdef(left.resulttype.def)))) then
  1560. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,
  1561. tclassrefdef(right.resulttype.def).pointertype.def.typename);
  1562. end
  1563. else
  1564. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1565. { call fpc_do_is helper }
  1566. paras := ccallparanode.create(
  1567. left,
  1568. ccallparanode.create(
  1569. right,nil));
  1570. result := ccallnode.createintern('fpc_do_is',paras);
  1571. left := nil;
  1572. right := nil;
  1573. end
  1574. else if is_interface(right.resulttype.def) then
  1575. begin
  1576. { left is a class }
  1577. if is_class(left.resulttype.def) then
  1578. begin
  1579. { the operands must be related }
  1580. if not(assigned(tobjectdef(left.resulttype.def).implementedinterfaces) and
  1581. (tobjectdef(left.resulttype.def).implementedinterfaces.searchintf(right.resulttype.def)<>-1)) then
  1582. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1583. end
  1584. { left is an interface }
  1585. else if is_interface(left.resulttype.def) then
  1586. begin
  1587. { the operands must be related }
  1588. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(right.resulttype.def)))) and
  1589. (not(tobjectdef(right.resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1590. CGMessage(type_e_mismatch);
  1591. end
  1592. else
  1593. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1594. { call fpc_do_is helper }
  1595. paras := ccallparanode.create(
  1596. left,
  1597. ccallparanode.create(
  1598. right,nil));
  1599. result := ccallnode.createintern('fpc_do_is',paras);
  1600. left := nil;
  1601. right := nil;
  1602. end
  1603. else
  1604. CGMessage1(type_e_class_or_interface_type_expected,right.resulttype.def.typename);
  1605. resulttype:=booltype;
  1606. end;
  1607. function tisnode.pass_1 : tnode;
  1608. begin
  1609. internalerror(200204254);
  1610. result:=nil;
  1611. end;
  1612. { dummy pass_2, it will never be called, but we need one since }
  1613. { you can't instantiate an abstract class }
  1614. procedure tisnode.pass_2;
  1615. begin
  1616. end;
  1617. {*****************************************************************************
  1618. TASNODE
  1619. *****************************************************************************}
  1620. constructor tasnode.create(l,r : tnode);
  1621. begin
  1622. inherited create(asn,l,r);
  1623. call := nil;
  1624. end;
  1625. destructor tasnode.destroy;
  1626. begin
  1627. call.free;
  1628. inherited destroy;
  1629. end;
  1630. function tasnode.det_resulttype:tnode;
  1631. var
  1632. hp : tnode;
  1633. begin
  1634. result:=nil;
  1635. resulttypepass(right);
  1636. resulttypepass(left);
  1637. set_varstate(right,true);
  1638. set_varstate(left,true);
  1639. if codegenerror then
  1640. exit;
  1641. if (right.resulttype.def.deftype=classrefdef) then
  1642. begin
  1643. { left must be a class }
  1644. if is_class(left.resulttype.def) then
  1645. begin
  1646. { the operands must be related }
  1647. if (not(tobjectdef(left.resulttype.def).is_related(
  1648. tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def)))) and
  1649. (not(tobjectdef(tclassrefdef(right.resulttype.def).pointertype.def).is_related(
  1650. tobjectdef(left.resulttype.def)))) then
  1651. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,
  1652. tclassrefdef(right.resulttype.def).pointertype.def.typename);
  1653. end
  1654. else
  1655. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1656. resulttype:=tclassrefdef(right.resulttype.def).pointertype;
  1657. end
  1658. else if is_interface(right.resulttype.def) then
  1659. begin
  1660. { left is a class }
  1661. if is_class(left.resulttype.def) then
  1662. begin
  1663. { the operands must be related
  1664. no, because the class instance could be a child class of the current one which
  1665. implements additional interfaces (FK)
  1666. b:=false;
  1667. o:=tobjectdef(left.resulttype.def);
  1668. while assigned(o) do
  1669. begin
  1670. if assigned(o.implementedinterfaces) and
  1671. (o.implementedinterfaces.searchintf(right.resulttype.def)<>-1) then
  1672. begin
  1673. b:=true;
  1674. break;
  1675. end;
  1676. o:=o.childof;
  1677. end;
  1678. if not(b) then
  1679. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1680. }
  1681. end
  1682. { left is an interface }
  1683. else if is_interface(left.resulttype.def) then
  1684. begin
  1685. { the operands must be related
  1686. we don't necessarily know how the both interfaces are implemented, so we can't do this check (FK)
  1687. if (not(tobjectdef(left.resulttype.def).is_related(tobjectdef(right.resulttype.def)))) and
  1688. (not(tobjectdef(right.resulttype.def).is_related(tobjectdef(left.resulttype.def)))) then
  1689. CGMessage2(type_e_classes_not_related,left.resulttype.def.typename,right.resulttype.def.typename);
  1690. }
  1691. end
  1692. else
  1693. CGMessage1(type_e_class_type_expected,left.resulttype.def.typename);
  1694. resulttype:=right.resulttype;
  1695. { load the GUID of the interface }
  1696. if (right.nodetype=typen) then
  1697. begin
  1698. if assigned(tobjectdef(right.resulttype.def).iidguid) then
  1699. begin
  1700. hp:=cguidconstnode.create(tobjectdef(right.resulttype.def).iidguid^);
  1701. right.free;
  1702. right:=hp;
  1703. end
  1704. else
  1705. internalerror(200206282);
  1706. resulttypepass(right);
  1707. end;
  1708. end
  1709. else
  1710. CGMessage1(type_e_class_or_interface_type_expected,right.resulttype.def.typename);
  1711. end;
  1712. function tasnode.getcopy: tnode;
  1713. begin
  1714. result := inherited getcopy;
  1715. if assigned(call) then
  1716. tasnode(result).call := call.getcopy
  1717. else
  1718. tasnode(result).call := nil;
  1719. end;
  1720. function tasnode.pass_1 : tnode;
  1721. var
  1722. procname: string;
  1723. begin
  1724. result:=nil;
  1725. if not assigned(call) then
  1726. begin
  1727. if is_class(left.resulttype.def) and
  1728. (right.resulttype.def.deftype=classrefdef) then
  1729. call := ccallnode.createinternres('fpc_do_as',
  1730. ccallparanode.create(left,ccallparanode.create(right,nil)),
  1731. resulttype)
  1732. else
  1733. begin
  1734. if is_class(left.resulttype.def) then
  1735. procname := 'fpc_class_as_intf'
  1736. else
  1737. procname := 'fpc_intf_as';
  1738. call := ccallnode.createinternres(procname,
  1739. ccallparanode.create(right,ccallparanode.create(left,nil)),
  1740. resulttype);
  1741. end;
  1742. left := nil;
  1743. right := nil;
  1744. firstpass(call);
  1745. if codegenerror then
  1746. exit;
  1747. location.loc:=call.location.loc;
  1748. registers32:=call.registers32;
  1749. registersfpu:=call.registersfpu;
  1750. {$ifdef SUPPORT_MMX}
  1751. registersmmx:=call.registersmmx;
  1752. {$endif SUPPORT_MMX}
  1753. end;
  1754. end;
  1755. begin
  1756. ctypeconvnode:=ttypeconvnode;
  1757. casnode:=tasnode;
  1758. cisnode:=tisnode;
  1759. end.
  1760. {
  1761. $Log$
  1762. Revision 1.103 2003-03-17 18:54:23 peter
  1763. * fix missing self setting for method to procvar conversion in
  1764. tp_procvar mode
  1765. Revision 1.102 2003/02/15 22:15:57 carl
  1766. * generic conversaion routines only work on signed types
  1767. Revision 1.101 2003/01/16 22:13:52 peter
  1768. * convert_l3 convertlevel added. This level is used for conversions
  1769. where information can be lost like converting widestring->ansistring
  1770. or dword->byte
  1771. Revision 1.100 2003/01/15 01:44:32 peter
  1772. * merged methodpointer fixes from 1.0.x
  1773. Revision 1.99 2003/01/09 21:43:39 peter
  1774. * constant string conversion fixed, it's now equal to both
  1775. shortstring, ansistring and the typeconvnode will return
  1776. te_equal but still return convtype to change the constnode
  1777. Revision 1.98 2003/01/05 22:41:40 peter
  1778. * move code that checks for longint-pointer conversion hint
  1779. Revision 1.97 2003/01/03 12:15:56 daniel
  1780. * Removed ifdefs around notifications
  1781. ifdefs around for loop optimizations remain
  1782. Revision 1.96 2002/12/22 16:34:49 peter
  1783. * proc-procvar crash fixed (tw2277)
  1784. Revision 1.95 2002/12/20 16:01:26 peter
  1785. * don't allow class(classref) conversion
  1786. Revision 1.94 2002/12/05 14:27:26 florian
  1787. * some variant <-> dyn. array stuff
  1788. Revision 1.93 2002/11/30 10:45:14 carl
  1789. * fix bug with checking of duplicated items in sets (new sets bug only)
  1790. Revision 1.92 2002/11/27 19:43:21 carl
  1791. * updated notes and hints
  1792. Revision 1.91 2002/11/27 13:11:38 peter
  1793. * more currency fixes, taddcurr runs now successfull
  1794. Revision 1.90 2002/11/27 11:29:21 peter
  1795. * when converting from and to currency divide or multiple the
  1796. result by 10000
  1797. Revision 1.89 2002/11/25 17:43:18 peter
  1798. * splitted defbase in defutil,symutil,defcmp
  1799. * merged isconvertable and is_equal into compare_defs(_ext)
  1800. * made operator search faster by walking the list only once
  1801. Revision 1.88 2002/11/17 16:31:56 carl
  1802. * memory optimization (3-4%) : cleanup of tai fields,
  1803. cleanup of tdef and tsym fields.
  1804. * make it work for m68k
  1805. Revision 1.87 2002/10/10 16:07:57 florian
  1806. + several widestring/pwidechar related stuff added
  1807. Revision 1.86 2002/10/06 16:10:23 florian
  1808. * when compiling <interface> as <interface> we can't assume
  1809. anything about relation
  1810. Revision 1.85 2002/10/05 12:43:25 carl
  1811. * fixes for Delphi 6 compilation
  1812. (warning : Some features do not work under Delphi)
  1813. Revision 1.84 2002/10/02 20:23:50 florian
  1814. - removed the relation check for <class> as <interface> because we don't
  1815. know the runtime type of <class>! It could be a child class of the given type
  1816. which implements additional interfaces
  1817. Revision 1.83 2002/10/02 20:17:14 florian
  1818. + the as operator for <class> as <interface> has to check the parent classes as well
  1819. Revision 1.82 2002/09/30 07:00:47 florian
  1820. * fixes to common code to get the alpha compiler compiled applied
  1821. Revision 1.81 2002/09/16 14:11:13 peter
  1822. * add argument to equal_paras() to support default values or not
  1823. Revision 1.80 2002/09/07 20:40:23 carl
  1824. * cardinal -> longword
  1825. Revision 1.79 2002/09/07 15:25:03 peter
  1826. * old logs removed and tabs fixed
  1827. Revision 1.78 2002/09/07 12:16:04 carl
  1828. * second part bug report 1996 fix, testrange in cordconstnode
  1829. only called if option is set (also make parsing a tiny faster)
  1830. Revision 1.77 2002/09/05 05:56:07 jonas
  1831. - reverted my last commit, it was completely bogus :(
  1832. Revision 1.75 2002/09/02 19:24:42 peter
  1833. * array of char support for Str()
  1834. Revision 1.74 2002/09/01 08:01:16 daniel
  1835. * Removed sets from Tcallnode.det_resulttype
  1836. + Added read/write notifications of variables. These will be usefull
  1837. for providing information for several optimizations. For example
  1838. the value of the loop variable of a for loop does matter is the
  1839. variable is read after the for loop, but if it's no longer used
  1840. or written, it doesn't matter and this can be used to optimize
  1841. the loop code generation.
  1842. Revision 1.73 2002/08/23 16:14:49 peter
  1843. * tempgen cleanup
  1844. * tt_noreuse temp type added that will be used in genentrycode
  1845. Revision 1.72 2002/08/20 18:23:33 jonas
  1846. * the as node again uses a compilerproc
  1847. + (untested) support for interface "as" statements
  1848. Revision 1.71 2002/08/19 19:36:43 peter
  1849. * More fixes for cross unit inlining, all tnodes are now implemented
  1850. * Moved pocall_internconst to po_internconst because it is not a
  1851. calling type at all and it conflicted when inlining of these small
  1852. functions was requested
  1853. Revision 1.70 2002/08/17 09:23:36 florian
  1854. * first part of procinfo rewrite
  1855. Revision 1.69 2002/08/14 19:26:55 carl
  1856. + generic int_to_real type conversion
  1857. + generic unaryminus node
  1858. Revision 1.68 2002/08/11 16:08:55 florian
  1859. + support of explicit type case boolean->char
  1860. Revision 1.67 2002/08/11 15:28:00 florian
  1861. + support of explicit type case <any ordinal type>->pointer
  1862. (delphi mode only)
  1863. Revision 1.66 2002/08/09 07:33:01 florian
  1864. * a couple of interface related fixes
  1865. Revision 1.65 2002/07/29 21:23:42 florian
  1866. * more fixes for the ppc
  1867. + wrappers for the tcnvnode.first_* stuff introduced
  1868. Revision 1.64 2002/07/23 12:34:30 daniel
  1869. * Readded old set code. To use it define 'oldset'. Activated by default
  1870. for ppc.
  1871. Revision 1.63 2002/07/23 09:51:22 daniel
  1872. * Tried to make Tprocsym.defs protected. I didn't succeed but the cleanups
  1873. are worth comitting.
  1874. Revision 1.62 2002/07/22 11:48:04 daniel
  1875. * Sets are now internally sets.
  1876. Revision 1.61 2002/07/20 17:16:02 florian
  1877. + source code page support
  1878. Revision 1.60 2002/07/20 11:57:54 florian
  1879. * types.pas renamed to defbase.pas because D6 contains a types
  1880. unit so this would conflicts if D6 programms are compiled
  1881. + Willamette/SSE2 instructions to assembler added
  1882. Revision 1.59 2002/07/01 16:23:53 peter
  1883. * cg64 patch
  1884. * basics for currency
  1885. * asnode updates for class and interface (not finished)
  1886. Revision 1.58 2002/05/18 13:34:09 peter
  1887. * readded missing revisions
  1888. }