2
0

nadd.pas 103 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl
  3. Type checking and register allocation for add nodes
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit nadd;
  18. {$i fpcdefs.inc}
  19. { define addstringopt}
  20. interface
  21. uses
  22. node,symtype;
  23. type
  24. taddnode = class(tbinopnode)
  25. resultrealtype : ttype;
  26. constructor create(tt : tnodetype;l,r : tnode);override;
  27. function pass_1 : tnode;override;
  28. function det_resulttype:tnode;override;
  29. function simplify : tnode;override;
  30. {$ifdef state_tracking}
  31. function track_state_pass(exec_known:boolean):boolean;override;
  32. {$endif}
  33. protected
  34. { override the following if you want to implement }
  35. { parts explicitely in the code generator (JM) }
  36. function first_addstring: tnode; virtual;
  37. function first_addset: tnode; virtual;
  38. { only implements "muln" nodes, the rest always has to be done in }
  39. { the code generator for performance reasons (JM) }
  40. function first_add64bitint: tnode; virtual;
  41. { override and return false if you can handle 32x32->64 }
  42. { bit multiplies directly in your code generator. If }
  43. { this function is overridden to return false, you can }
  44. { get multiplies with left/right both s32bit or u32bit, }
  45. { and resulttype of the muln s64bit or u64bit }
  46. function use_generic_mul32to64: boolean; virtual;
  47. { This routine calls internal runtime library helpers
  48. for all floating point arithmetic in the case
  49. where the emulation switches is on. Otherwise
  50. returns nil, and everything must be done in
  51. the code generation phase.
  52. }
  53. function first_addfloat : tnode; virtual;
  54. private
  55. { checks whether a muln can be calculated as a 32bit }
  56. { * 32bit -> 64 bit }
  57. function try_make_mul32to64: boolean;
  58. end;
  59. taddnodeclass = class of taddnode;
  60. var
  61. { caddnode is used to create nodes of the add type }
  62. { the virtual constructor allows to assign }
  63. { another class type to caddnode => processor }
  64. { specific node types can be created }
  65. caddnode : taddnodeclass;
  66. implementation
  67. uses
  68. {$IFNDEF USE_FAKE_SYSUTILS}
  69. sysutils,
  70. {$ELSE}
  71. fksysutl,
  72. {$ENDIF}
  73. globtype,systems,
  74. cutils,verbose,globals,widestr,
  75. symconst,symdef,symsym,symtable,defutil,defcmp,
  76. cgbase,
  77. htypechk,pass_1,
  78. nld,nbas,nmat,ncnv,ncon,nset,nopt,ncal,ninl,nmem,nutils,
  79. {$ifdef state_tracking}
  80. nstate,
  81. {$endif}
  82. cpuinfo,procinfo;
  83. {*****************************************************************************
  84. TADDNODE
  85. *****************************************************************************}
  86. {$maxfpuregisters 0}
  87. function getbestreal(const t1,t2 : ttype) : ttype;
  88. const
  89. floatweight : array[tfloattype] of byte =
  90. (2,3,4,0,1,5);
  91. begin
  92. if t1.def.deftype=floatdef then
  93. begin
  94. result:=t1;
  95. if t2.def.deftype=floatdef then
  96. begin
  97. { when a comp or currency is used, use always the
  98. best float type to calculate the result }
  99. if (tfloatdef(t2.def).typ in [s64comp,s64currency]) or
  100. (tfloatdef(t2.def).typ in [s64comp,s64currency]) then
  101. result:=pbestrealtype^
  102. else
  103. if floatweight[tfloatdef(t2.def).typ]>floatweight[tfloatdef(t1.def).typ] then
  104. result:=t2;
  105. end;
  106. end
  107. else if t2.def.deftype=floatdef then
  108. result:=t2
  109. else internalerror(200508061);
  110. end;
  111. constructor taddnode.create(tt : tnodetype;l,r : tnode);
  112. begin
  113. inherited create(tt,l,r);
  114. end;
  115. function taddnode.simplify : tnode;
  116. var
  117. t : tnode;
  118. lt,rt : tnodetype;
  119. rd,ld : tdef;
  120. rv,lv : tconstexprint;
  121. rvd,lvd : bestreal;
  122. ws1,ws2 : pcompilerwidestring;
  123. concatstrings : boolean;
  124. c1,c2 : array[0..1] of char;
  125. s1,s2 : pchar;
  126. l1,l2 : longint;
  127. resultset : Tconstset;
  128. b : boolean;
  129. begin
  130. result:=nil;
  131. { is one a real float, then both need to be floats, this
  132. need to be done before the constant folding so constant
  133. operation on a float and int are also handled }
  134. resultrealtype:=pbestrealtype^;
  135. if (right.resulttype.def.deftype=floatdef) or (left.resulttype.def.deftype=floatdef) then
  136. begin
  137. { when both floattypes are already equal then use that
  138. floattype for results }
  139. if (right.resulttype.def.deftype=floatdef) and
  140. (left.resulttype.def.deftype=floatdef) and
  141. (tfloatdef(left.resulttype.def).typ=tfloatdef(right.resulttype.def).typ) then
  142. resultrealtype:=left.resulttype
  143. { when there is a currency type then use currency, but
  144. only when currency is defined as float }
  145. else
  146. if (is_currency(right.resulttype.def) or
  147. is_currency(left.resulttype.def)) and
  148. ((s64currencytype.def.deftype = floatdef) or
  149. (nodetype <> slashn)) then
  150. begin
  151. resultrealtype:=s64currencytype;
  152. inserttypeconv(right,resultrealtype);
  153. inserttypeconv(left,resultrealtype);
  154. end
  155. else
  156. begin
  157. resultrealtype:=getbestreal(left.resulttype,right.resulttype);
  158. inserttypeconv(right,resultrealtype);
  159. inserttypeconv(left,resultrealtype);
  160. end;
  161. end;
  162. { If both operands are constant and there is a widechar
  163. or widestring then convert everything to widestring. This
  164. allows constant folding like char+widechar }
  165. if is_constnode(right) and is_constnode(left) and
  166. (is_widestring(right.resulttype.def) or
  167. is_widestring(left.resulttype.def) or
  168. is_widechar(right.resulttype.def) or
  169. is_widechar(left.resulttype.def)) then
  170. begin
  171. inserttypeconv(right,cwidestringtype);
  172. inserttypeconv(left,cwidestringtype);
  173. end;
  174. { load easier access variables }
  175. rd:=right.resulttype.def;
  176. ld:=left.resulttype.def;
  177. rt:=right.nodetype;
  178. lt:=left.nodetype;
  179. if (nodetype = slashn) and
  180. (((rt = ordconstn) and
  181. (tordconstnode(right).value = 0)) or
  182. ((rt = realconstn) and
  183. (trealconstnode(right).value_real = 0.0))) then
  184. begin
  185. if (cs_check_range in aktlocalswitches) or
  186. (cs_check_overflow in aktlocalswitches) then
  187. begin
  188. result:=crealconstnode.create(1,pbestrealtype^);
  189. Message(parser_e_division_by_zero);
  190. exit;
  191. end;
  192. end;
  193. { both are int constants }
  194. if (
  195. (
  196. is_constintnode(left) and
  197. is_constintnode(right)
  198. ) or
  199. (
  200. is_constboolnode(left) and
  201. is_constboolnode(right) and
  202. (nodetype in [slashn,ltn,lten,gtn,gten,equaln,unequaln,andn,xorn,orn])
  203. ) or
  204. (
  205. is_constenumnode(left) and
  206. is_constenumnode(right) and
  207. allowenumop(nodetype))
  208. ) or
  209. (
  210. (lt = pointerconstn) and
  211. is_constintnode(right) and
  212. (nodetype in [addn,subn])
  213. ) or
  214. (
  215. (lt in [pointerconstn,niln]) and
  216. (rt in [pointerconstn,niln]) and
  217. (nodetype in [ltn,lten,gtn,gten,equaln,unequaln,subn])
  218. ) then
  219. begin
  220. t:=nil;
  221. { when comparing/substracting pointers, make sure they are }
  222. { of the same type (JM) }
  223. if (lt = pointerconstn) and (rt = pointerconstn) then
  224. begin
  225. if not(cs_extsyntax in aktmoduleswitches) and
  226. not(nodetype in [equaln,unequaln]) then
  227. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename)
  228. else
  229. if (nodetype <> subn) and
  230. is_voidpointer(rd) then
  231. inserttypeconv(right,left.resulttype)
  232. else if (nodetype <> subn) and
  233. is_voidpointer(ld) then
  234. inserttypeconv(left,right.resulttype)
  235. else if not(equal_defs(ld,rd)) then
  236. IncompatibleTypes(ld,rd);
  237. end
  238. else if (ld.deftype=enumdef) and (rd.deftype=enumdef) then
  239. begin
  240. if not(equal_defs(ld,rd)) then
  241. inserttypeconv(right,left.resulttype);
  242. end;
  243. { load values }
  244. case lt of
  245. ordconstn:
  246. lv:=tordconstnode(left).value;
  247. pointerconstn:
  248. lv:=tpointerconstnode(left).value;
  249. niln:
  250. lv:=0;
  251. else
  252. internalerror(2002080202);
  253. end;
  254. case rt of
  255. ordconstn:
  256. rv:=tordconstnode(right).value;
  257. pointerconstn:
  258. rv:=tpointerconstnode(right).value;
  259. niln:
  260. rv:=0;
  261. else
  262. internalerror(2002080203);
  263. end;
  264. if (lt = pointerconstn) and
  265. (rt <> pointerconstn) then
  266. rv := rv * tpointerdef(left.resulttype.def).pointertype.def.size;
  267. if (rt = pointerconstn) and
  268. (lt <> pointerconstn) then
  269. lv := lv * tpointerdef(right.resulttype.def).pointertype.def.size;
  270. case nodetype of
  271. addn :
  272. begin
  273. {$ifopt Q-}
  274. {$define OVERFLOW_OFF}
  275. {$Q+}
  276. {$endif}
  277. try
  278. if (lt=pointerconstn) then
  279. t := cpointerconstnode.create(lv+rv,left.resulttype)
  280. else
  281. if is_integer(ld) then
  282. t := genintconstnode(lv+rv)
  283. else
  284. t := cordconstnode.create(lv+rv,left.resulttype,(ld.deftype<>enumdef));
  285. except
  286. on E:EIntOverflow do
  287. begin
  288. Message(parser_e_arithmetic_operation_overflow);
  289. { Recover }
  290. t:=genintconstnode(0)
  291. end;
  292. end;
  293. {$ifdef OVERFLOW_OFF}
  294. {$Q-}
  295. {$undef OVERFLOW_OFF}
  296. {$endif}
  297. end;
  298. subn :
  299. begin
  300. {$ifopt Q-}
  301. {$define OVERFLOW_OFF}
  302. {$Q+}
  303. {$endif}
  304. try
  305. if (lt=pointerconstn) then
  306. begin
  307. { pointer-pointer results in an integer }
  308. if (rt=pointerconstn) then
  309. t := genintconstnode((lv-rv) div tpointerdef(ld).pointertype.def.size)
  310. else
  311. t := cpointerconstnode.create(lv-rv,left.resulttype);
  312. end
  313. else
  314. begin
  315. if is_integer(ld) then
  316. t:=genintconstnode(lv-rv)
  317. else
  318. t:=cordconstnode.create(lv-rv,left.resulttype,(ld.deftype<>enumdef));
  319. end;
  320. except
  321. on E:EIntOverflow do
  322. begin
  323. Message(parser_e_arithmetic_operation_overflow);
  324. { Recover }
  325. t:=genintconstnode(0)
  326. end;
  327. end;
  328. {$ifdef OVERFLOW_OFF}
  329. {$Q-}
  330. {$undef OVERFLOW_OFF}
  331. {$endif}
  332. end;
  333. muln :
  334. begin
  335. {$ifopt Q-}
  336. {$define OVERFLOW_OFF}
  337. {$Q+}
  338. {$endif}
  339. try
  340. if (torddef(ld).typ <> u64bit) or
  341. (torddef(rd).typ <> u64bit) then
  342. t:=genintconstnode(lv*rv)
  343. else
  344. t:=genintconstnode(int64(qword(lv)*qword(rv)));
  345. except
  346. on E:EIntOverflow do
  347. begin
  348. Message(parser_e_arithmetic_operation_overflow);
  349. { Recover }
  350. t:=genintconstnode(0)
  351. end;
  352. end;
  353. {$ifdef OVERFLOW_OFF}
  354. {$Q-}
  355. {$undef OVERFLOW_OFF}
  356. {$endif}
  357. end;
  358. xorn :
  359. if is_integer(ld) then
  360. t:=genintconstnode(lv xor rv)
  361. else
  362. t:=cordconstnode.create(lv xor rv,left.resulttype,true);
  363. orn :
  364. if is_integer(ld) then
  365. t:=genintconstnode(lv or rv)
  366. else
  367. t:=cordconstnode.create(lv or rv,left.resulttype,true);
  368. andn :
  369. if is_integer(ld) then
  370. t:=genintconstnode(lv and rv)
  371. else
  372. t:=cordconstnode.create(lv and rv,left.resulttype,true);
  373. ltn :
  374. t:=cordconstnode.create(ord(lv<rv),booltype,true);
  375. lten :
  376. t:=cordconstnode.create(ord(lv<=rv),booltype,true);
  377. gtn :
  378. t:=cordconstnode.create(ord(lv>rv),booltype,true);
  379. gten :
  380. t:=cordconstnode.create(ord(lv>=rv),booltype,true);
  381. equaln :
  382. t:=cordconstnode.create(ord(lv=rv),booltype,true);
  383. unequaln :
  384. t:=cordconstnode.create(ord(lv<>rv),booltype,true);
  385. slashn :
  386. begin
  387. { int/int becomes a real }
  388. rvd:=rv;
  389. lvd:=lv;
  390. t:=crealconstnode.create(lvd/rvd,resultrealtype);
  391. end;
  392. else
  393. begin
  394. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  395. t:=cnothingnode.create;
  396. end;
  397. end;
  398. result:=t;
  399. exit;
  400. end;
  401. { both real constants ? }
  402. if (lt=realconstn) and (rt=realconstn) then
  403. begin
  404. lvd:=trealconstnode(left).value_real;
  405. rvd:=trealconstnode(right).value_real;
  406. case nodetype of
  407. addn :
  408. t:=crealconstnode.create(lvd+rvd,resultrealtype);
  409. subn :
  410. t:=crealconstnode.create(lvd-rvd,resultrealtype);
  411. muln :
  412. t:=crealconstnode.create(lvd*rvd,resultrealtype);
  413. starstarn,
  414. caretn :
  415. begin
  416. if lvd<0 then
  417. begin
  418. Message(parser_e_invalid_float_operation);
  419. t:=crealconstnode.create(0,resultrealtype);
  420. end
  421. else if lvd=0 then
  422. t:=crealconstnode.create(1.0,resultrealtype)
  423. else
  424. t:=crealconstnode.create(exp(ln(lvd)*rvd),resultrealtype);
  425. end;
  426. slashn :
  427. t:=crealconstnode.create(lvd/rvd,resultrealtype);
  428. ltn :
  429. t:=cordconstnode.create(ord(lvd<rvd),booltype,true);
  430. lten :
  431. t:=cordconstnode.create(ord(lvd<=rvd),booltype,true);
  432. gtn :
  433. t:=cordconstnode.create(ord(lvd>rvd),booltype,true);
  434. gten :
  435. t:=cordconstnode.create(ord(lvd>=rvd),booltype,true);
  436. equaln :
  437. t:=cordconstnode.create(ord(lvd=rvd),booltype,true);
  438. unequaln :
  439. t:=cordconstnode.create(ord(lvd<>rvd),booltype,true);
  440. else
  441. begin
  442. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  443. t:=cnothingnode.create;
  444. end;
  445. end;
  446. result:=t;
  447. exit;
  448. end;
  449. { first, we handle widestrings, so we can check later for }
  450. { stringconstn only }
  451. { widechars are converted above to widestrings too }
  452. { this isn't veryy efficient, but I don't think }
  453. { that it does matter that much (FK) }
  454. if (lt=stringconstn) and (rt=stringconstn) and
  455. (tstringconstnode(left).cst_type=cst_widestring) and
  456. (tstringconstnode(right).cst_type=cst_widestring) then
  457. begin
  458. initwidestring(ws1);
  459. initwidestring(ws2);
  460. copywidestring(pcompilerwidestring(tstringconstnode(left).value_str),ws1);
  461. copywidestring(pcompilerwidestring(tstringconstnode(right).value_str),ws2);
  462. case nodetype of
  463. addn :
  464. begin
  465. concatwidestrings(ws1,ws2);
  466. t:=cstringconstnode.createwstr(ws1);
  467. end;
  468. ltn :
  469. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)<0),booltype,true);
  470. lten :
  471. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)<=0),booltype,true);
  472. gtn :
  473. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)>0),booltype,true);
  474. gten :
  475. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)>=0),booltype,true);
  476. equaln :
  477. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)=0),booltype,true);
  478. unequaln :
  479. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)<>0),booltype,true);
  480. else
  481. begin
  482. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  483. t:=cnothingnode.create;
  484. end;
  485. end;
  486. donewidestring(ws1);
  487. donewidestring(ws2);
  488. result:=t;
  489. exit;
  490. end;
  491. { concating strings ? }
  492. concatstrings:=false;
  493. if (lt=ordconstn) and (rt=ordconstn) and
  494. is_char(ld) and is_char(rd) then
  495. begin
  496. c1[0]:=char(byte(tordconstnode(left).value));
  497. c1[1]:=#0;
  498. l1:=1;
  499. c2[0]:=char(byte(tordconstnode(right).value));
  500. c2[1]:=#0;
  501. l2:=1;
  502. s1:=@c1[0];
  503. s2:=@c2[0];
  504. concatstrings:=true;
  505. end
  506. else if (lt=stringconstn) and (rt=ordconstn) and is_char(rd) then
  507. begin
  508. s1:=tstringconstnode(left).value_str;
  509. l1:=tstringconstnode(left).len;
  510. c2[0]:=char(byte(tordconstnode(right).value));
  511. c2[1]:=#0;
  512. s2:=@c2[0];
  513. l2:=1;
  514. concatstrings:=true;
  515. end
  516. else if (lt=ordconstn) and (rt=stringconstn) and is_char(ld) then
  517. begin
  518. c1[0]:=char(byte(tordconstnode(left).value));
  519. c1[1]:=#0;
  520. l1:=1;
  521. s1:=@c1[0];
  522. s2:=tstringconstnode(right).value_str;
  523. l2:=tstringconstnode(right).len;
  524. concatstrings:=true;
  525. end
  526. else if (lt=stringconstn) and (rt=stringconstn) then
  527. begin
  528. s1:=tstringconstnode(left).value_str;
  529. l1:=tstringconstnode(left).len;
  530. s2:=tstringconstnode(right).value_str;
  531. l2:=tstringconstnode(right).len;
  532. concatstrings:=true;
  533. end;
  534. if concatstrings then
  535. begin
  536. case nodetype of
  537. addn :
  538. t:=cstringconstnode.createpchar(concatansistrings(s1,s2,l1,l2),l1+l2);
  539. ltn :
  540. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)<0),booltype,true);
  541. lten :
  542. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)<=0),booltype,true);
  543. gtn :
  544. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)>0),booltype,true);
  545. gten :
  546. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)>=0),booltype,true);
  547. equaln :
  548. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)=0),booltype,true);
  549. unequaln :
  550. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)<>0),booltype,true);
  551. else
  552. begin
  553. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  554. t:=cnothingnode.create;
  555. end;
  556. end;
  557. result:=t;
  558. exit;
  559. end;
  560. { set constant evaluation }
  561. if (right.nodetype=setconstn) and
  562. not assigned(tsetconstnode(right).left) and
  563. (left.nodetype=setconstn) and
  564. not assigned(tsetconstnode(left).left) then
  565. begin
  566. { check if size adjusting is needed, only for left
  567. to right as the other way is checked in the typeconv }
  568. if (tsetdef(right.resulttype.def).settype=smallset) and
  569. (tsetdef(left.resulttype.def).settype<>smallset) then
  570. right.resulttype.setdef(tsetdef.create(tsetdef(right.resulttype.def).elementtype,255));
  571. { check base types }
  572. inserttypeconv(left,right.resulttype);
  573. if codegenerror then
  574. begin
  575. { recover by only returning the left part }
  576. result:=left;
  577. left:=nil;
  578. exit;
  579. end;
  580. case nodetype of
  581. addn :
  582. begin
  583. resultset:=tsetconstnode(right).value_set^ + tsetconstnode(left).value_set^;
  584. t:=csetconstnode.create(@resultset,left.resulttype);
  585. end;
  586. muln :
  587. begin
  588. resultset:=tsetconstnode(right).value_set^ * tsetconstnode(left).value_set^;
  589. t:=csetconstnode.create(@resultset,left.resulttype);
  590. end;
  591. subn :
  592. begin
  593. resultset:=tsetconstnode(left).value_set^ - tsetconstnode(right).value_set^;
  594. t:=csetconstnode.create(@resultset,left.resulttype);
  595. end;
  596. symdifn :
  597. begin
  598. resultset:=tsetconstnode(right).value_set^ >< tsetconstnode(left).value_set^;
  599. t:=csetconstnode.create(@resultset,left.resulttype);
  600. end;
  601. unequaln :
  602. begin
  603. b:=tsetconstnode(right).value_set^ <> tsetconstnode(left).value_set^;
  604. t:=cordconstnode.create(byte(b),booltype,true);
  605. end;
  606. equaln :
  607. begin
  608. b:=tsetconstnode(right).value_set^ = tsetconstnode(left).value_set^;
  609. t:=cordconstnode.create(byte(b),booltype,true);
  610. end;
  611. lten :
  612. begin
  613. b:=tsetconstnode(left).value_set^ <= tsetconstnode(right).value_set^;
  614. t:=cordconstnode.create(byte(b),booltype,true);
  615. end;
  616. gten :
  617. begin
  618. b:=tsetconstnode(left).value_set^ >= tsetconstnode(right).value_set^;
  619. t:=cordconstnode.create(byte(b),booltype,true);
  620. end;
  621. else
  622. begin
  623. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  624. t:=cnothingnode.create;
  625. end;
  626. end;
  627. result:=t;
  628. exit;
  629. end;
  630. end;
  631. function taddnode.det_resulttype:tnode;
  632. var
  633. hp : tnode;
  634. lt,rt : tnodetype;
  635. rd,ld : tdef;
  636. htype : ttype;
  637. ot : tnodetype;
  638. hsym : tfieldvarsym;
  639. i : longint;
  640. strtype : tstringtype;
  641. b : boolean;
  642. {$ifdef state_tracking}
  643. factval : Tnode;
  644. change : boolean;
  645. {$endif}
  646. begin
  647. result:=nil;
  648. { first do the two subtrees }
  649. resulttypepass(left);
  650. resulttypepass(right);
  651. { both left and right need to be valid }
  652. set_varstate(left,vs_read,[vsf_must_be_valid]);
  653. set_varstate(right,vs_read,[vsf_must_be_valid]);
  654. if codegenerror then
  655. exit;
  656. { tp procvar support }
  657. maybe_call_procvar(left,true);
  658. maybe_call_procvar(right,true);
  659. { convert array constructors to sets, because there is no other operator
  660. possible for array constructors }
  661. if is_array_constructor(left.resulttype.def) then
  662. begin
  663. arrayconstructor_to_set(left);
  664. resulttypepass(left);
  665. end;
  666. if is_array_constructor(right.resulttype.def) then
  667. begin
  668. arrayconstructor_to_set(right);
  669. resulttypepass(right);
  670. end;
  671. { allow operator overloading }
  672. hp:=self;
  673. if isbinaryoverloaded(hp) then
  674. begin
  675. result:=hp;
  676. exit;
  677. end;
  678. { Stop checking when an error was found in the operator checking }
  679. if codegenerror then
  680. begin
  681. result:=cerrornode.create;
  682. exit;
  683. end;
  684. { Kylix allows enum+ordconstn in an enum declaration (blocktype
  685. is bt_type), we need to do the conversion here before the
  686. constant folding }
  687. if (m_delphi in aktmodeswitches) and
  688. (blocktype=bt_type) then
  689. begin
  690. if (left.resulttype.def.deftype=enumdef) and
  691. (right.resulttype.def.deftype=orddef) then
  692. begin
  693. { insert explicit typecast to default signed int }
  694. left:=ctypeconvnode.create_internal(left,sinttype);
  695. resulttypepass(left);
  696. end
  697. else
  698. if (left.resulttype.def.deftype=orddef) and
  699. (right.resulttype.def.deftype=enumdef) then
  700. begin
  701. { insert explicit typecast to default signed int }
  702. right:=ctypeconvnode.create_internal(right,sinttype);
  703. resulttypepass(right);
  704. end;
  705. end;
  706. result:=simplify;
  707. if assigned(result) then
  708. exit;
  709. { load easier access variables }
  710. rd:=right.resulttype.def;
  711. ld:=left.resulttype.def;
  712. rt:=right.nodetype;
  713. lt:=left.nodetype;
  714. { but an int/int gives real/real! }
  715. if nodetype=slashn then
  716. begin
  717. if is_currency(left.resulttype.def) and
  718. is_currency(right.resulttype.def) then
  719. { In case of currency, converting to float means dividing by 10000 }
  720. { However, since this is already a division, both divisions by }
  721. { 10000 are eliminated when we divide the results -> we can skip }
  722. { them. }
  723. if s64currencytype.def.deftype = floatdef then
  724. begin
  725. { there's no s64comptype or so, how do we avoid the type conversion?
  726. left.resulttype := s64comptype;
  727. right.resulttype := s64comptype; }
  728. end
  729. else
  730. begin
  731. left.resulttype := s64inttype;
  732. right.resulttype := s64inttype;
  733. end
  734. else if (left.resulttype.def.deftype <> floatdef) and
  735. (right.resulttype.def.deftype <> floatdef) then
  736. CGMessage(type_h_use_div_for_int);
  737. inserttypeconv(right,resultrealtype);
  738. inserttypeconv(left,resultrealtype);
  739. end
  740. { if both are orddefs then check sub types }
  741. else if (ld.deftype=orddef) and (rd.deftype=orddef) then
  742. begin
  743. { optimize multiplacation by a power of 2 }
  744. if not(cs_check_overflow in aktlocalswitches) and
  745. (nodetype = muln) and
  746. (((left.nodetype = ordconstn) and
  747. ispowerof2(tordconstnode(left).value,i)) or
  748. ((right.nodetype = ordconstn) and
  749. ispowerof2(tordconstnode(right).value,i))) then
  750. begin
  751. if left.nodetype = ordconstn then
  752. begin
  753. tordconstnode(left).value := i;
  754. result := cshlshrnode.create(shln,right,left);
  755. end
  756. else
  757. begin
  758. tordconstnode(right).value := i;
  759. result := cshlshrnode.create(shln,left,right);
  760. end;
  761. left := nil;
  762. right := nil;
  763. exit;
  764. end;
  765. { set for & and | operations in macpas mode: they only work on }
  766. { booleans, and always short circuit evaluation }
  767. if (nf_short_bool in flags) then
  768. begin
  769. if not is_boolean(ld) then
  770. begin
  771. inserttypeconv(left,booltype);
  772. ld := left.resulttype.def;
  773. end;
  774. if not is_boolean(rd) then
  775. begin
  776. inserttypeconv(right,booltype);
  777. rd := right.resulttype.def;
  778. end;
  779. end;
  780. { 2 booleans? Make them equal to the largest boolean }
  781. if (is_boolean(ld) and is_boolean(rd)) or
  782. (nf_short_bool in flags) then
  783. begin
  784. if torddef(left.resulttype.def).size>torddef(right.resulttype.def).size then
  785. begin
  786. right:=ctypeconvnode.create_internal(right,left.resulttype);
  787. ttypeconvnode(right).convtype:=tc_bool_2_bool;
  788. resulttypepass(right);
  789. end
  790. else if torddef(left.resulttype.def).size<torddef(right.resulttype.def).size then
  791. begin
  792. left:=ctypeconvnode.create_internal(left,right.resulttype);
  793. ttypeconvnode(left).convtype:=tc_bool_2_bool;
  794. resulttypepass(left);
  795. end;
  796. case nodetype of
  797. xorn,
  798. ltn,
  799. lten,
  800. gtn,
  801. gten,
  802. andn,
  803. orn:
  804. begin
  805. end;
  806. unequaln,
  807. equaln:
  808. begin
  809. if not(cs_full_boolean_eval in aktlocalswitches) or
  810. (nf_short_bool in flags) then
  811. begin
  812. { Remove any compares with constants }
  813. if (left.nodetype=ordconstn) then
  814. begin
  815. hp:=right;
  816. b:=(tordconstnode(left).value<>0);
  817. ot:=nodetype;
  818. left.free;
  819. left:=nil;
  820. right:=nil;
  821. if (not(b) and (ot=equaln)) or
  822. (b and (ot=unequaln)) then
  823. begin
  824. hp:=cnotnode.create(hp);
  825. end;
  826. result:=hp;
  827. exit;
  828. end;
  829. if (right.nodetype=ordconstn) then
  830. begin
  831. hp:=left;
  832. b:=(tordconstnode(right).value<>0);
  833. ot:=nodetype;
  834. right.free;
  835. right:=nil;
  836. left:=nil;
  837. if (not(b) and (ot=equaln)) or
  838. (b and (ot=unequaln)) then
  839. begin
  840. hp:=cnotnode.create(hp);
  841. end;
  842. result:=hp;
  843. exit;
  844. end;
  845. end;
  846. end;
  847. else
  848. begin
  849. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  850. result:=cnothingnode.create;
  851. exit;
  852. end;
  853. end;
  854. end
  855. { Both are chars? }
  856. else if is_char(rd) and is_char(ld) then
  857. begin
  858. if nodetype=addn then
  859. begin
  860. resulttype:=cshortstringtype;
  861. if not(is_constcharnode(left) and is_constcharnode(right)) then
  862. begin
  863. inserttypeconv(left,cshortstringtype);
  864. {$ifdef addstringopt}
  865. hp := genaddsstringcharoptnode(self);
  866. result := hp;
  867. exit;
  868. {$endif addstringopt}
  869. end;
  870. end;
  871. end
  872. { There is a widechar? }
  873. else if is_widechar(rd) or is_widechar(ld) then
  874. begin
  875. { widechar+widechar gives widestring }
  876. if nodetype=addn then
  877. begin
  878. inserttypeconv(left,cwidestringtype);
  879. if (torddef(rd).typ<>uwidechar) then
  880. inserttypeconv(right,cwidechartype);
  881. resulttype:=cwidestringtype;
  882. end
  883. else
  884. begin
  885. if (torddef(ld).typ<>uwidechar) then
  886. inserttypeconv(left,cwidechartype);
  887. if (torddef(rd).typ<>uwidechar) then
  888. inserttypeconv(right,cwidechartype);
  889. end;
  890. end
  891. { is there a currency type ? }
  892. else if ((torddef(rd).typ=scurrency) or (torddef(ld).typ=scurrency)) then
  893. begin
  894. if (torddef(ld).typ<>scurrency) then
  895. inserttypeconv(left,s64currencytype);
  896. if (torddef(rd).typ<>scurrency) then
  897. inserttypeconv(right,s64currencytype);
  898. end
  899. { and,or,xor work on bit patterns and don't care
  900. about the sign of integers }
  901. { compares don't need extension to native int size either }
  902. { as long as both values are signed or unsigned }
  903. else if is_integer(ld) and is_integer(rd) and
  904. ((nodetype in [andn,orn,xorn]) or
  905. ((nodetype in [equaln,unequaln,gtn,gten,ltn,lten]) and
  906. not(is_signed(ld) xor is_signed(rd)))) then
  907. begin
  908. if rd.size>ld.size then
  909. inserttypeconv_internal(left,right.resulttype)
  910. else
  911. inserttypeconv_internal(right,left.resulttype);
  912. end
  913. { is there a signed 64 bit type ? }
  914. else if ((torddef(rd).typ=s64bit) or (torddef(ld).typ=s64bit)) then
  915. begin
  916. if (torddef(ld).typ<>s64bit) then
  917. inserttypeconv(left,s64inttype);
  918. if (torddef(rd).typ<>s64bit) then
  919. inserttypeconv(right,s64inttype);
  920. end
  921. { is there a unsigned 64 bit type ? }
  922. else if ((torddef(rd).typ=u64bit) or (torddef(ld).typ=u64bit)) then
  923. begin
  924. if (torddef(ld).typ<>u64bit) then
  925. inserttypeconv(left,u64inttype);
  926. if (torddef(rd).typ<>u64bit) then
  927. inserttypeconv(right,u64inttype);
  928. end
  929. { 64 bit cpus do calculations always in 64 bit }
  930. {$ifndef cpu64bit}
  931. { is there a cardinal? }
  932. else if ((torddef(rd).typ=u32bit) or (torddef(ld).typ=u32bit)) then
  933. begin
  934. { convert positive constants to u32bit }
  935. if (torddef(ld).typ<>u32bit) and
  936. is_constintnode(left) and
  937. (tordconstnode(left).value >= 0) then
  938. inserttypeconv(left,u32inttype);
  939. if (torddef(rd).typ<>u32bit) and
  940. is_constintnode(right) and
  941. (tordconstnode(right).value >= 0) then
  942. inserttypeconv(right,u32inttype);
  943. { when one of the operand is signed perform
  944. the operation in 64bit, can't use rd/ld here because there
  945. could be already typeconvs inserted }
  946. if is_signed(left.resulttype.def) or
  947. is_signed(right.resulttype.def) then
  948. begin
  949. CGMessage(type_w_mixed_signed_unsigned);
  950. inserttypeconv(left,s64inttype);
  951. inserttypeconv(right,s64inttype);
  952. end
  953. else
  954. begin
  955. if (torddef(left.resulttype.def).typ<>u32bit) then
  956. inserttypeconv(left,u32inttype);
  957. if (torddef(right.resulttype.def).typ<>u32bit) then
  958. inserttypeconv(right,u32inttype);
  959. end;
  960. end
  961. {$endif cpu64bit}
  962. { generic ord conversion is sinttype }
  963. else
  964. begin
  965. { if the left or right value is smaller than the normal
  966. type sinttype and is unsigned, and the other value
  967. is a constant < 0, the result will always be false/true
  968. for equal / unequal nodes.
  969. }
  970. if (
  971. { left : unsigned ordinal var, right : < 0 constant }
  972. (
  973. ((is_signed(ld)=false) and (is_constintnode(left) =false)) and
  974. ((is_constintnode(right)) and (tordconstnode(right).value < 0))
  975. ) or
  976. { right : unsigned ordinal var, left : < 0 constant }
  977. (
  978. ((is_signed(rd)=false) and (is_constintnode(right) =false)) and
  979. ((is_constintnode(left)) and (tordconstnode(left).value < 0))
  980. )
  981. ) then
  982. begin
  983. if nodetype = equaln then
  984. CGMessage(type_w_signed_unsigned_always_false)
  985. else
  986. if nodetype = unequaln then
  987. CGMessage(type_w_signed_unsigned_always_true)
  988. else
  989. if (is_constintnode(left) and (nodetype in [ltn,lten])) or
  990. (is_constintnode(right) and (nodetype in [gtn,gten])) then
  991. CGMessage(type_w_signed_unsigned_always_true)
  992. else
  993. if (is_constintnode(right) and (nodetype in [ltn,lten])) or
  994. (is_constintnode(left) and (nodetype in [gtn,gten])) then
  995. CGMessage(type_w_signed_unsigned_always_false);
  996. end;
  997. { When there is a signed type or there is a minus operation
  998. we convert to signed int. Otherwise (both are unsigned) we keep
  999. the result also unsigned. This is compatible with Delphi (PFV) }
  1000. if is_signed(ld) or
  1001. is_signed(rd) or
  1002. (nodetype=subn) then
  1003. begin
  1004. inserttypeconv(right,sinttype);
  1005. inserttypeconv(left,sinttype);
  1006. end
  1007. else
  1008. begin
  1009. inserttypeconv(right,uinttype);
  1010. inserttypeconv(left,uinttype);
  1011. end;
  1012. end;
  1013. end
  1014. { if both are floatdefs, conversion is already done before constant folding }
  1015. else if (ld.deftype=floatdef) then
  1016. begin
  1017. if not(nodetype in [addn,subn,muln,slashn,equaln,unequaln,ltn,lten,gtn,gten]) then
  1018. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1019. end
  1020. { left side a setdef, must be before string processing,
  1021. else array constructor can be seen as array of char (PFV) }
  1022. else if (ld.deftype=setdef) then
  1023. begin
  1024. { trying to add a set element? }
  1025. if (nodetype=addn) and (rd.deftype<>setdef) then
  1026. begin
  1027. if (rt=setelementn) then
  1028. begin
  1029. if not(equal_defs(tsetdef(ld).elementtype.def,rd)) then
  1030. CGMessage(type_e_set_element_are_not_comp);
  1031. end
  1032. else
  1033. CGMessage(type_e_mismatch)
  1034. end
  1035. else
  1036. begin
  1037. if not(nodetype in [addn,subn,symdifn,muln,equaln,unequaln,lten,gten]) then
  1038. CGMessage(type_e_set_operation_unknown);
  1039. { right def must be a also be set }
  1040. if (rd.deftype<>setdef) or not(equal_defs(rd,ld)) then
  1041. CGMessage(type_e_set_element_are_not_comp);
  1042. end;
  1043. { ranges require normsets }
  1044. if (tsetdef(ld).settype=smallset) and
  1045. (rt=setelementn) and
  1046. assigned(tsetelementnode(right).right) then
  1047. begin
  1048. { generate a temporary normset def, it'll be destroyed
  1049. when the symtable is unloaded }
  1050. htype.setdef(tsetdef.create(tsetdef(ld).elementtype,255));
  1051. inserttypeconv(left,htype);
  1052. end;
  1053. { if the right side is also a setdef then the settype must
  1054. be the same as the left setdef }
  1055. if (rd.deftype=setdef) and
  1056. (tsetdef(ld).settype<>tsetdef(rd).settype) then
  1057. begin
  1058. { when right is a normset we need to typecast both
  1059. to normsets }
  1060. if (tsetdef(rd).settype=normset) then
  1061. inserttypeconv(left,right.resulttype)
  1062. else
  1063. inserttypeconv(right,left.resulttype);
  1064. end;
  1065. end
  1066. { pointer comparision and subtraction }
  1067. else if (
  1068. (rd.deftype=pointerdef) and (ld.deftype=pointerdef)
  1069. ) or
  1070. { compare/add pchar to variable (not stringconst) char arrays
  1071. by addresses like BP/Delphi }
  1072. (
  1073. (nodetype in [equaln,unequaln,subn,addn]) and
  1074. (
  1075. ((is_pchar(ld) or (lt=niln)) and is_chararray(rd) and (rt<>stringconstn)) or
  1076. ((is_pchar(rd) or (rt=niln)) and is_chararray(ld) and (lt<>stringconstn))
  1077. )
  1078. ) then
  1079. begin
  1080. { convert char array to pointer }
  1081. if is_chararray(rd) then
  1082. begin
  1083. inserttypeconv(right,charpointertype);
  1084. rd:=right.resulttype.def;
  1085. end
  1086. else if is_chararray(ld) then
  1087. begin
  1088. inserttypeconv(left,charpointertype);
  1089. ld:=left.resulttype.def;
  1090. end;
  1091. case nodetype of
  1092. equaln,unequaln :
  1093. begin
  1094. if is_voidpointer(right.resulttype.def) then
  1095. inserttypeconv(right,left.resulttype)
  1096. else if is_voidpointer(left.resulttype.def) then
  1097. inserttypeconv(left,right.resulttype)
  1098. else if not(equal_defs(ld,rd)) then
  1099. IncompatibleTypes(ld,rd);
  1100. { now that the type checking is done, convert both to charpointer, }
  1101. { because methodpointers are 8 bytes even though only the first 4 }
  1102. { bytes must be compared. This can happen here if we are in }
  1103. { TP/Delphi mode, because there @methodpointer = voidpointer (but }
  1104. { a voidpointer of 8 bytes). A conversion to voidpointer would be }
  1105. { optimized away, since the result already was a voidpointer, so }
  1106. { use a charpointer instead (JM) }
  1107. inserttypeconv_internal(left,charpointertype);
  1108. inserttypeconv_internal(right,charpointertype);
  1109. end;
  1110. ltn,lten,gtn,gten:
  1111. begin
  1112. if (cs_extsyntax in aktmoduleswitches) then
  1113. begin
  1114. if is_voidpointer(right.resulttype.def) then
  1115. inserttypeconv(right,left.resulttype)
  1116. else if is_voidpointer(left.resulttype.def) then
  1117. inserttypeconv(left,right.resulttype)
  1118. else if not(equal_defs(ld,rd)) then
  1119. IncompatibleTypes(ld,rd);
  1120. end
  1121. else
  1122. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1123. end;
  1124. subn:
  1125. begin
  1126. if (cs_extsyntax in aktmoduleswitches) then
  1127. begin
  1128. if is_voidpointer(right.resulttype.def) then
  1129. inserttypeconv(right,left.resulttype)
  1130. else if is_voidpointer(left.resulttype.def) then
  1131. inserttypeconv(left,right.resulttype)
  1132. else if not(equal_defs(ld,rd)) then
  1133. IncompatibleTypes(ld,rd);
  1134. end
  1135. else
  1136. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1137. if not(nf_has_pointerdiv in flags) and
  1138. (tpointerdef(rd).pointertype.def.size>1) then
  1139. begin
  1140. hp:=getcopy;
  1141. include(hp.flags,nf_has_pointerdiv);
  1142. result:=cmoddivnode.create(divn,hp,cordconstnode.create(tpointerdef(rd).pointertype.def.size,sinttype,false));
  1143. end;
  1144. resulttype:=sinttype;
  1145. exit;
  1146. end;
  1147. addn:
  1148. begin
  1149. if (cs_extsyntax in aktmoduleswitches) then
  1150. begin
  1151. if is_voidpointer(right.resulttype.def) then
  1152. inserttypeconv(right,left.resulttype)
  1153. else if is_voidpointer(left.resulttype.def) then
  1154. inserttypeconv(left,right.resulttype)
  1155. else if not(equal_defs(ld,rd)) then
  1156. IncompatibleTypes(ld,rd);
  1157. end
  1158. else
  1159. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1160. resulttype:=sinttype;
  1161. exit;
  1162. end;
  1163. else
  1164. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1165. end;
  1166. end
  1167. { is one of the operands a string?,
  1168. chararrays are also handled as strings (after conversion), also take
  1169. care of chararray+chararray and chararray+char.
  1170. Note: Must be done after pointerdef+pointerdef has been checked, else
  1171. pchar is converted to string }
  1172. else if (rd.deftype=stringdef) or
  1173. (ld.deftype=stringdef) or
  1174. ((is_pchar(rd) or is_chararray(rd) or is_char(rd) or is_open_chararray(rd) or
  1175. is_pwidechar(rd) or is_widechararray(rd) or is_widechar(rd) or is_open_widechararray(rd)) and
  1176. (is_pchar(ld) or is_chararray(ld) or is_char(ld) or is_open_chararray(ld) or
  1177. is_pwidechar(ld) or is_widechararray(ld) or is_widechar(ld) or is_open_widechararray(ld))) then
  1178. begin
  1179. if (nodetype in [addn,equaln,unequaln,lten,gten,ltn,gtn]) then
  1180. begin
  1181. { Is there a widestring? }
  1182. if is_widestring(rd) or is_widestring(ld) or
  1183. is_pwidechar(rd) or is_widechararray(rd) or is_widechar(rd) or is_open_widechararray(rd) or
  1184. is_pwidechar(ld) or is_widechararray(ld) or is_widechar(ld) or is_open_widechararray(ld) then
  1185. strtype:= st_widestring
  1186. else
  1187. if is_ansistring(rd) or is_ansistring(ld) or
  1188. ((cs_ansistrings in aktlocalswitches) and
  1189. //todo: Move some of this to longstring's then they are implemented?
  1190. (
  1191. is_pchar(rd) or (is_chararray(rd) and (rd.size > 255)) or is_open_chararray(rd) or
  1192. is_pchar(ld) or (is_chararray(ld) and (ld.size > 255)) or is_open_chararray(ld)
  1193. )
  1194. ) then
  1195. strtype:= st_ansistring
  1196. else
  1197. if is_longstring(rd) or is_longstring(ld) then
  1198. strtype:= st_longstring
  1199. else
  1200. begin
  1201. {$warning todo: add a warning/hint here if one converting a too large array}
  1202. { nodes is PChar, array [with size > 255] or OpenArrayOfChar.
  1203. Note: Delphi halts with error if "array [0..xx] of char"
  1204. is assigned to ShortString and string length is less
  1205. then array size }
  1206. strtype:= st_shortstring;
  1207. end;
  1208. // Now convert nodes to common string type
  1209. case strtype of
  1210. st_widestring :
  1211. begin
  1212. if not(is_widestring(rd)) then
  1213. inserttypeconv(right,cwidestringtype);
  1214. if not(is_widestring(ld)) then
  1215. inserttypeconv(left,cwidestringtype);
  1216. end;
  1217. st_ansistring :
  1218. begin
  1219. if not(is_ansistring(rd)) then
  1220. inserttypeconv(right,cansistringtype);
  1221. if not(is_ansistring(ld)) then
  1222. inserttypeconv(left,cansistringtype);
  1223. end;
  1224. st_longstring :
  1225. begin
  1226. if not(is_longstring(rd)) then
  1227. inserttypeconv(right,clongstringtype);
  1228. if not(is_longstring(ld)) then
  1229. inserttypeconv(left,clongstringtype);
  1230. end;
  1231. st_shortstring :
  1232. begin
  1233. if not(is_shortstring(ld)) then
  1234. inserttypeconv(left,cshortstringtype);
  1235. { don't convert char, that can be handled by the optimized node }
  1236. if not(is_shortstring(rd) or is_char(rd)) then
  1237. inserttypeconv(right,cshortstringtype);
  1238. end;
  1239. else
  1240. internalerror(2005101);
  1241. end;
  1242. end
  1243. else
  1244. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1245. end
  1246. { class or interface equation }
  1247. else if is_class_or_interface(rd) or is_class_or_interface(ld) then
  1248. begin
  1249. if (nodetype in [equaln,unequaln]) then
  1250. begin
  1251. if is_class_or_interface(rd) and is_class_or_interface(ld) then
  1252. begin
  1253. if tobjectdef(rd).is_related(tobjectdef(ld)) then
  1254. inserttypeconv(right,left.resulttype)
  1255. else
  1256. inserttypeconv(left,right.resulttype);
  1257. end
  1258. else if is_class_or_interface(rd) then
  1259. inserttypeconv(left,right.resulttype)
  1260. else
  1261. inserttypeconv(right,left.resulttype);
  1262. end
  1263. else
  1264. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1265. end
  1266. else if (rd.deftype=classrefdef) and (ld.deftype=classrefdef) then
  1267. begin
  1268. if (nodetype in [equaln,unequaln]) then
  1269. begin
  1270. if tobjectdef(tclassrefdef(rd).pointertype.def).is_related(
  1271. tobjectdef(tclassrefdef(ld).pointertype.def)) then
  1272. inserttypeconv(right,left.resulttype)
  1273. else
  1274. inserttypeconv(left,right.resulttype);
  1275. end
  1276. else
  1277. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1278. end
  1279. { allows comperasion with nil pointer }
  1280. else if is_class_or_interface(rd) or (rd.deftype=classrefdef) then
  1281. begin
  1282. if (nodetype in [equaln,unequaln]) then
  1283. inserttypeconv(left,right.resulttype)
  1284. else
  1285. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1286. end
  1287. else if is_class_or_interface(ld) or (ld.deftype=classrefdef) then
  1288. begin
  1289. if (nodetype in [equaln,unequaln]) then
  1290. inserttypeconv(right,left.resulttype)
  1291. else
  1292. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1293. end
  1294. { support procvar=nil,procvar<>nil }
  1295. else if ((ld.deftype=procvardef) and (rt=niln)) or
  1296. ((rd.deftype=procvardef) and (lt=niln)) then
  1297. begin
  1298. if not(nodetype in [equaln,unequaln]) then
  1299. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1300. { find proc field in methodpointer record }
  1301. hsym:=tfieldvarsym(trecorddef(methodpointertype.def).symtable.search('proc'));
  1302. if not assigned(hsym) then
  1303. internalerror(200412043);
  1304. { For methodpointers compare only tmethodpointer.proc }
  1305. if (rd.deftype=procvardef) and
  1306. (not tprocvardef(rd).is_addressonly) then
  1307. begin
  1308. right:=csubscriptnode.create(
  1309. hsym,
  1310. ctypeconvnode.create_internal(right,methodpointertype));
  1311. end;
  1312. if (ld.deftype=procvardef) and
  1313. (not tprocvardef(ld).is_addressonly) then
  1314. begin
  1315. left:=csubscriptnode.create(
  1316. hsym,
  1317. ctypeconvnode.create_internal(left,methodpointertype));
  1318. end;
  1319. end
  1320. { support dynamicarray=nil,dynamicarray<>nil }
  1321. else if (is_dynamic_array(ld) and (rt=niln)) or
  1322. (is_dynamic_array(rd) and (lt=niln)) or
  1323. (is_dynamic_array(ld) and is_dynamic_array(rd)) then
  1324. begin
  1325. if not(nodetype in [equaln,unequaln]) then
  1326. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1327. end
  1328. {$ifdef SUPPORT_MMX}
  1329. { mmx support, this must be before the zero based array
  1330. check }
  1331. else if (cs_mmx in aktlocalswitches) and
  1332. is_mmx_able_array(ld) and
  1333. is_mmx_able_array(rd) and
  1334. equal_defs(ld,rd) then
  1335. begin
  1336. case nodetype of
  1337. addn,subn,xorn,orn,andn:
  1338. ;
  1339. { mul is a little bit restricted }
  1340. muln:
  1341. if not(mmx_type(ld) in [mmxu16bit,mmxs16bit,mmxfixed16]) then
  1342. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1343. else
  1344. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1345. end;
  1346. end
  1347. {$endif SUPPORT_MMX}
  1348. { this is a little bit dangerous, also the left type }
  1349. { pointer to should be checked! This broke the mmx support }
  1350. else if (rd.deftype=pointerdef) or
  1351. (is_zero_based_array(rd) and (rt<>stringconstn)) then
  1352. begin
  1353. if is_zero_based_array(rd) then
  1354. begin
  1355. resulttype.setdef(tpointerdef.create(tarraydef(rd).elementtype));
  1356. inserttypeconv(right,resulttype);
  1357. end
  1358. else
  1359. resulttype:=right.resulttype;
  1360. inserttypeconv(left,sinttype);
  1361. if nodetype=addn then
  1362. begin
  1363. if not(cs_extsyntax in aktmoduleswitches) or
  1364. (not(is_pchar(ld)) and not(m_add_pointer in aktmodeswitches)) then
  1365. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1366. if (rd.deftype=pointerdef) and
  1367. (tpointerdef(rd).pointertype.def.size>1) then
  1368. begin
  1369. left:=caddnode.create(muln,left,
  1370. cordconstnode.create(tpointerdef(rd).pointertype.def.size,sinttype,true));
  1371. end;
  1372. end
  1373. else
  1374. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1375. end
  1376. else if (ld.deftype=pointerdef) or
  1377. (is_zero_based_array(ld) and (lt<>stringconstn)) then
  1378. begin
  1379. if is_zero_based_array(ld) then
  1380. begin
  1381. resulttype.setdef(tpointerdef.create(tarraydef(ld).elementtype));
  1382. inserttypeconv(left,resulttype);
  1383. end
  1384. else
  1385. resulttype:=left.resulttype;
  1386. inserttypeconv(right,sinttype);
  1387. if nodetype in [addn,subn] then
  1388. begin
  1389. if not(cs_extsyntax in aktmoduleswitches) or
  1390. (not(is_pchar(ld)) and not(m_add_pointer in aktmodeswitches)) then
  1391. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1392. if (ld.deftype=pointerdef) and
  1393. (tpointerdef(ld).pointertype.def.size>1) then
  1394. begin
  1395. right:=caddnode.create(muln,right,
  1396. cordconstnode.create(tpointerdef(ld).pointertype.def.size,sinttype,true));
  1397. end
  1398. else
  1399. if is_zero_based_array(ld) and
  1400. (tarraydef(ld).elementtype.def.size>1) then
  1401. begin
  1402. right:=caddnode.create(muln,right,
  1403. cordconstnode.create(tarraydef(ld).elementtype.def.size,sinttype,true));
  1404. end;
  1405. end
  1406. else
  1407. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1408. end
  1409. else if (rd.deftype=procvardef) and
  1410. (ld.deftype=procvardef) and
  1411. equal_defs(rd,ld) then
  1412. begin
  1413. if (nodetype in [equaln,unequaln]) then
  1414. begin
  1415. if tprocvardef(rd).is_addressonly then
  1416. begin
  1417. inserttypeconv_internal(right,voidpointertype);
  1418. inserttypeconv_internal(left,voidpointertype);
  1419. end
  1420. else
  1421. begin
  1422. { find proc field in methodpointer record }
  1423. hsym:=tfieldvarsym(trecorddef(methodpointertype.def).symtable.search('proc'));
  1424. if not assigned(hsym) then
  1425. internalerror(200412043);
  1426. { Compare tmehodpointer(left).proc }
  1427. right:=csubscriptnode.create(
  1428. hsym,
  1429. ctypeconvnode.create_internal(right,methodpointertype));
  1430. left:=csubscriptnode.create(
  1431. hsym,
  1432. ctypeconvnode.create_internal(left,methodpointertype));
  1433. end;
  1434. end
  1435. else
  1436. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1437. end
  1438. { enums }
  1439. else if (ld.deftype=enumdef) and (rd.deftype=enumdef) then
  1440. begin
  1441. if allowenumop(nodetype) then
  1442. inserttypeconv(right,left.resulttype)
  1443. else
  1444. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1445. end
  1446. { generic conversion, this is for error recovery }
  1447. else
  1448. begin
  1449. inserttypeconv(left,sinttype);
  1450. inserttypeconv(right,sinttype);
  1451. end;
  1452. { set resulttype if not already done }
  1453. if not assigned(resulttype.def) then
  1454. begin
  1455. case nodetype of
  1456. ltn,lten,gtn,gten,equaln,unequaln :
  1457. resulttype:=booltype;
  1458. slashn :
  1459. resulttype:=resultrealtype;
  1460. addn:
  1461. begin
  1462. { for strings, return is always a 255 char string }
  1463. if is_shortstring(left.resulttype.def) then
  1464. resulttype:=cshortstringtype
  1465. else
  1466. resulttype:=left.resulttype;
  1467. end;
  1468. else
  1469. resulttype:=left.resulttype;
  1470. end;
  1471. end;
  1472. { when the result is currency we need some extra code for
  1473. multiplication and division. this should not be done when
  1474. the muln or slashn node is created internally }
  1475. if not(nf_is_currency in flags) and
  1476. is_currency(resulttype.def) then
  1477. begin
  1478. case nodetype of
  1479. slashn :
  1480. begin
  1481. { slashn will only work with floats }
  1482. hp:=caddnode.create(muln,getcopy,crealconstnode.create(10000.0,s64currencytype));
  1483. include(hp.flags,nf_is_currency);
  1484. result:=hp;
  1485. end;
  1486. muln :
  1487. begin
  1488. if s64currencytype.def.deftype=floatdef then
  1489. hp:=caddnode.create(slashn,getcopy,crealconstnode.create(10000.0,s64currencytype))
  1490. else
  1491. hp:=cmoddivnode.create(divn,getcopy,cordconstnode.create(10000,s64currencytype,false));
  1492. include(hp.flags,nf_is_currency);
  1493. result:=hp
  1494. end;
  1495. end;
  1496. end;
  1497. end;
  1498. function taddnode.first_addstring: tnode;
  1499. const
  1500. swap_relation: array [ltn..unequaln] of Tnodetype=(gtn, gten, ltn, lten, equaln, unequaln);
  1501. var
  1502. p: tnode;
  1503. newstatement : tstatementnode;
  1504. tempnode : ttempcreatenode;
  1505. begin
  1506. { when we get here, we are sure that both the left and the right }
  1507. { node are both strings of the same stringtype (JM) }
  1508. case nodetype of
  1509. addn:
  1510. begin
  1511. if (left.nodetype=stringconstn) and (tstringconstnode(left).len=0) then
  1512. begin
  1513. result:=right;
  1514. left:=nil;
  1515. right:=nil;
  1516. exit;
  1517. end;
  1518. if (right.nodetype=stringconstn) and (tstringconstnode(right).len=0) then
  1519. begin
  1520. result:=left;
  1521. left:=nil;
  1522. right:=nil;
  1523. exit;
  1524. end;
  1525. { create the call to the concat routine both strings as arguments }
  1526. if assigned(aktassignmentnode) and
  1527. (aktassignmentnode.right=self) and
  1528. (aktassignmentnode.left.resulttype.def=resulttype.def) and
  1529. valid_for_var(aktassignmentnode.left,false) then
  1530. begin
  1531. result:=ccallnode.createintern('fpc_'+
  1532. tstringdef(resulttype.def).stringtypname+'_concat',
  1533. ccallparanode.create(right,
  1534. ccallparanode.create(left,
  1535. ccallparanode.create(aktassignmentnode.left.getcopy,nil))));
  1536. include(aktassignmentnode.flags,nf_assign_done_in_right);
  1537. firstpass(result);
  1538. end
  1539. else
  1540. begin
  1541. result:=internalstatements(newstatement);
  1542. tempnode:=ctempcreatenode.create(resulttype,resulttype.def.size,tt_persistent,true);
  1543. addstatement(newstatement,tempnode);
  1544. addstatement(newstatement,ccallnode.createintern('fpc_'+
  1545. tstringdef(resulttype.def).stringtypname+'_concat',
  1546. ccallparanode.create(right,
  1547. ccallparanode.create(left,
  1548. ccallparanode.create(ctemprefnode.create(tempnode),nil)))));
  1549. addstatement(newstatement,ctempdeletenode.create_normal_temp(tempnode));
  1550. addstatement(newstatement,ctemprefnode.create(tempnode));
  1551. end;
  1552. { we reused the arguments }
  1553. left := nil;
  1554. right := nil;
  1555. end;
  1556. ltn,lten,gtn,gten,equaln,unequaln :
  1557. begin
  1558. { generate better code for comparison with empty string, we
  1559. only need to compare the length with 0 }
  1560. if (nodetype in [equaln,unequaln,gtn,gten,ltn,lten]) and
  1561. (((left.nodetype=stringconstn) and (tstringconstnode(left).len=0)) or
  1562. ((right.nodetype=stringconstn) and (tstringconstnode(right).len=0))) then
  1563. begin
  1564. { switch so that the constant is always on the right }
  1565. if left.nodetype = stringconstn then
  1566. begin
  1567. p := left;
  1568. left := right;
  1569. right := p;
  1570. nodetype:=swap_relation[nodetype];
  1571. end;
  1572. if is_shortstring(left.resulttype.def) or
  1573. (nodetype in [gtn,gten,ltn,lten]) then
  1574. { compare the length with 0 }
  1575. result := caddnode.create(nodetype,
  1576. cinlinenode.create(in_length_x,false,left),
  1577. cordconstnode.create(0,s32inttype,false))
  1578. else
  1579. begin
  1580. { compare the pointer with nil (for ansistrings etc), }
  1581. { faster than getting the length (JM) }
  1582. result:= caddnode.create(nodetype,
  1583. ctypeconvnode.create_internal(left,voidpointertype),
  1584. cpointerconstnode.create(0,voidpointertype));
  1585. end;
  1586. { left is reused }
  1587. left := nil;
  1588. { right isn't }
  1589. right.free;
  1590. right := nil;
  1591. exit;
  1592. end;
  1593. { no string constant -> call compare routine }
  1594. result := ccallnode.createintern('fpc_'+
  1595. tstringdef(left.resulttype.def).stringtypname+'_compare',
  1596. ccallparanode.create(right,ccallparanode.create(left,nil)));
  1597. { and compare its result with 0 according to the original operator }
  1598. result := caddnode.create(nodetype,result,
  1599. cordconstnode.create(0,s32inttype,false));
  1600. left := nil;
  1601. right := nil;
  1602. end;
  1603. end;
  1604. end;
  1605. function taddnode.first_addset : tnode;
  1606. procedure call_varset_helper(const n : string);
  1607. var
  1608. newstatement : tstatementnode;
  1609. temp : ttempcreatenode;
  1610. begin
  1611. { add two var sets }
  1612. result:=internalstatements(newstatement);
  1613. { create temp for result }
  1614. temp:=ctempcreatenode.create(resulttype,resulttype.def.size,tt_persistent,true);
  1615. addstatement(newstatement,temp);
  1616. addstatement(newstatement,ccallnode.createintern(n,
  1617. ccallparanode.create(cordconstnode.create(resulttype.def.size,sinttype,false),
  1618. ccallparanode.create(ctemprefnode.create(temp),
  1619. ccallparanode.create(right,
  1620. ccallparanode.create(left,nil)))))
  1621. );
  1622. { remove reused parts from original node }
  1623. left:=nil;
  1624. right:=nil;
  1625. { the last statement should return the value as
  1626. location and type, this is done be referencing the
  1627. temp and converting it first from a persistent temp to
  1628. normal temp }
  1629. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  1630. addstatement(newstatement,ctemprefnode.create(temp));
  1631. end;
  1632. var
  1633. procname: string[31];
  1634. tempn: tnode;
  1635. paras: tcallparanode;
  1636. srsym: ttypesym;
  1637. newstatement : tstatementnode;
  1638. temp : ttempcreatenode;
  1639. begin
  1640. if is_varset(left.resulttype.def) then
  1641. begin
  1642. if not(is_varset(right.resulttype.def)) then
  1643. internalerror(2006091901);
  1644. case nodetype of
  1645. equaln,unequaln,lten,gten:
  1646. begin
  1647. case nodetype of
  1648. equaln,unequaln:
  1649. procname := 'fpc_varset_comp_sets';
  1650. lten,gten:
  1651. begin
  1652. procname := 'fpc_varset_contains_sets';
  1653. { (left >= right) = (right <= left) }
  1654. if nodetype = gten then
  1655. begin
  1656. tempn := left;
  1657. left := right;
  1658. right := tempn;
  1659. end;
  1660. end;
  1661. end;
  1662. result := ccallnode.createinternres(procname,
  1663. ccallparanode.create(cordconstnode.create(left.resulttype.def.size,sinttype,false),
  1664. ccallparanode.create(right,
  1665. ccallparanode.create(left,nil))),resulttype);
  1666. { left and right are reused as parameters }
  1667. left := nil;
  1668. right := nil;
  1669. { for an unequaln, we have to negate the result of comp_sets }
  1670. if nodetype = unequaln then
  1671. result := cnotnode.create(result);
  1672. end;
  1673. addn:
  1674. begin
  1675. { optimize first loading of a set }
  1676. if (right.nodetype=setelementn) and
  1677. not(assigned(tsetelementnode(right).right)) and
  1678. is_emptyset(left) then
  1679. begin
  1680. result:=internalstatements(newstatement);
  1681. { create temp for result }
  1682. temp:=ctempcreatenode.create(resulttype,resulttype.def.size,tt_persistent,true);
  1683. addstatement(newstatement,temp);
  1684. addstatement(newstatement,ccallnode.createintern('fpc_varset_create_element',
  1685. ccallparanode.create(ctemprefnode.create(temp),
  1686. ccallparanode.create(cordconstnode.create(resulttype.def.size,sinttype,false),
  1687. ccallparanode.create(tsetelementnode(right).left,nil))))
  1688. );
  1689. { the last statement should return the value as
  1690. location and type, this is done be referencing the
  1691. temp and converting it first from a persistent temp to
  1692. normal temp }
  1693. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  1694. addstatement(newstatement,ctemprefnode.create(temp));
  1695. tsetelementnode(right).left := nil;
  1696. end
  1697. else
  1698. begin
  1699. if right.nodetype=setelementn then
  1700. begin
  1701. result:=internalstatements(newstatement);
  1702. { create temp for result }
  1703. temp:=ctempcreatenode.create(resulttype,resulttype.def.size,tt_persistent,true);
  1704. addstatement(newstatement,temp);
  1705. { add a range or a single element? }
  1706. if assigned(tsetelementnode(right).right) then
  1707. addstatement(newstatement,ccallnode.createintern('fpc_varset_set_range',
  1708. ccallparanode.create(cordconstnode.create(resulttype.def.size,sinttype,false),
  1709. ccallparanode.create(tsetelementnode(right).right,
  1710. ccallparanode.create(tsetelementnode(right).left,
  1711. ccallparanode.create(ctemprefnode.create(temp),
  1712. ccallparanode.create(left,nil))))))
  1713. )
  1714. else
  1715. addstatement(newstatement,ccallnode.createintern('fpc_varset_set',
  1716. ccallparanode.create(cordconstnode.create(resulttype.def.size,sinttype,false),
  1717. ccallparanode.create(tsetelementnode(right).left,
  1718. ccallparanode.create(ctemprefnode.create(temp),
  1719. ccallparanode.create(left,nil)))))
  1720. );
  1721. { remove reused parts from original node }
  1722. tsetelementnode(right).right:=nil;
  1723. tsetelementnode(right).left:=nil;
  1724. left:=nil;
  1725. { the last statement should return the value as
  1726. location and type, this is done be referencing the
  1727. temp and converting it first from a persistent temp to
  1728. normal temp }
  1729. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  1730. addstatement(newstatement,ctemprefnode.create(temp));
  1731. end
  1732. else
  1733. call_varset_helper('fpc_varset_add_sets');
  1734. end
  1735. end;
  1736. subn:
  1737. call_varset_helper('fpc_varset_sub_sets');
  1738. symdifn:
  1739. call_varset_helper('fpc_varset_symdif_sets');
  1740. muln:
  1741. call_varset_helper('fpc_varset_mul_sets');
  1742. else
  1743. internalerror(200609241);
  1744. end;
  1745. end
  1746. else
  1747. begin
  1748. { get the sym that represents the fpc_normal_set type }
  1749. srsym:=search_system_type('FPC_NORMAL_SET');
  1750. case nodetype of
  1751. equaln,unequaln,lten,gten:
  1752. begin
  1753. case nodetype of
  1754. equaln,unequaln:
  1755. procname := 'fpc_set_comp_sets';
  1756. lten,gten:
  1757. begin
  1758. procname := 'fpc_set_contains_sets';
  1759. { (left >= right) = (right <= left) }
  1760. if nodetype = gten then
  1761. begin
  1762. tempn := left;
  1763. left := right;
  1764. right := tempn;
  1765. end;
  1766. end;
  1767. end;
  1768. { convert the arguments (explicitely) to fpc_normal_set's }
  1769. left := ctypeconvnode.create_internal(left,srsym.restype);
  1770. right := ctypeconvnode.create_internal(right,srsym.restype);
  1771. result := ccallnode.createintern(procname,ccallparanode.create(right,
  1772. ccallparanode.create(left,nil)));
  1773. { left and right are reused as parameters }
  1774. left := nil;
  1775. right := nil;
  1776. { for an unequaln, we have to negate the result of comp_sets }
  1777. if nodetype = unequaln then
  1778. result := cnotnode.create(result);
  1779. end;
  1780. addn:
  1781. begin
  1782. { optimize first loading of a set }
  1783. if (right.nodetype=setelementn) and
  1784. not(assigned(tsetelementnode(right).right)) and
  1785. is_emptyset(left) then
  1786. begin
  1787. { type cast the value to pass as argument to a byte, }
  1788. { since that's what the helper expects }
  1789. tsetelementnode(right).left :=
  1790. ctypeconvnode.create_internal(tsetelementnode(right).left,u8inttype);
  1791. { set the resulttype to the actual one (otherwise it's }
  1792. { "fpc_normal_set") }
  1793. result := ccallnode.createinternres('fpc_set_create_element',
  1794. ccallparanode.create(tsetelementnode(right).left,nil),
  1795. resulttype);
  1796. { reused }
  1797. tsetelementnode(right).left := nil;
  1798. end
  1799. else
  1800. begin
  1801. if right.nodetype=setelementn then
  1802. begin
  1803. { convert the arguments to bytes, since that's what }
  1804. { the helper expects }
  1805. tsetelementnode(right).left :=
  1806. ctypeconvnode.create_internal(tsetelementnode(right).left,
  1807. u8inttype);
  1808. { convert the original set (explicitely) to an }
  1809. { fpc_normal_set so we can pass it to the helper }
  1810. left := ctypeconvnode.create_internal(left,srsym.restype);
  1811. { add a range or a single element? }
  1812. if assigned(tsetelementnode(right).right) then
  1813. begin
  1814. tsetelementnode(right).right :=
  1815. ctypeconvnode.create_internal(tsetelementnode(right).right,
  1816. u8inttype);
  1817. { create the call }
  1818. result := ccallnode.createinternres('fpc_set_set_range',
  1819. ccallparanode.create(tsetelementnode(right).right,
  1820. ccallparanode.create(tsetelementnode(right).left,
  1821. ccallparanode.create(left,nil))),resulttype);
  1822. end
  1823. else
  1824. begin
  1825. result := ccallnode.createinternres('fpc_set_set_byte',
  1826. ccallparanode.create(tsetelementnode(right).left,
  1827. ccallparanode.create(left,nil)),resulttype);
  1828. end;
  1829. { remove reused parts from original node }
  1830. tsetelementnode(right).right := nil;
  1831. tsetelementnode(right).left := nil;
  1832. left := nil;
  1833. end
  1834. else
  1835. begin
  1836. { add two sets }
  1837. { convert the sets to fpc_normal_set's }
  1838. result := ccallnode.createinternres('fpc_set_add_sets',
  1839. ccallparanode.create(
  1840. ctypeconvnode.create_explicit(right,srsym.restype),
  1841. ccallparanode.create(
  1842. ctypeconvnode.create_internal(left,srsym.restype),nil)),resulttype);
  1843. { remove reused parts from original node }
  1844. left := nil;
  1845. right := nil;
  1846. end;
  1847. end
  1848. end;
  1849. subn,symdifn,muln:
  1850. begin
  1851. { convert the sets to fpc_normal_set's }
  1852. paras := ccallparanode.create(ctypeconvnode.create_internal(right,srsym.restype),
  1853. ccallparanode.create(ctypeconvnode.create_internal(left,srsym.restype),nil));
  1854. case nodetype of
  1855. subn:
  1856. result := ccallnode.createinternres('fpc_set_sub_sets',
  1857. paras,resulttype);
  1858. symdifn:
  1859. result := ccallnode.createinternres('fpc_set_symdif_sets',
  1860. paras,resulttype);
  1861. muln:
  1862. result := ccallnode.createinternres('fpc_set_mul_sets',
  1863. paras,resulttype);
  1864. end;
  1865. { remove reused parts from original node }
  1866. left := nil;
  1867. right := nil;
  1868. end;
  1869. else
  1870. internalerror(200108311);
  1871. end;
  1872. end;
  1873. end;
  1874. function taddnode.use_generic_mul32to64: boolean;
  1875. begin
  1876. result := true;
  1877. end;
  1878. function taddnode.try_make_mul32to64: boolean;
  1879. function canbe32bitint(v: tconstexprint; fromdef: torddef; todefsigned: boolean): boolean;
  1880. begin
  1881. if (fromdef.typ <> u64bit) then
  1882. result :=
  1883. ((v >= 0) or
  1884. todefsigned) and
  1885. (v >= low(longint)) and
  1886. (v <= high(longint))
  1887. else
  1888. result :=
  1889. (qword(v) >= low(cardinal)) and
  1890. (qword(v) <= high(cardinal))
  1891. end;
  1892. var
  1893. temp: tnode;
  1894. begin
  1895. result := false;
  1896. if ((left.nodetype = typeconvn) and
  1897. is_integer(ttypeconvnode(left).left.resulttype.def) and
  1898. (not(torddef(ttypeconvnode(left).left.resulttype.def).typ in [u64bit,s64bit])) and
  1899. (((right.nodetype = ordconstn) and
  1900. canbe32bitint(tordconstnode(right).value,torddef(right.resulttype.def),is_signed(left.resulttype.def))) or
  1901. ((right.nodetype = typeconvn) and
  1902. is_integer(ttypeconvnode(right).left.resulttype.def) and
  1903. not(torddef(ttypeconvnode(right).left.resulttype.def).typ in [u64bit,s64bit])) and
  1904. (is_signed(ttypeconvnode(left).left.resulttype.def) =
  1905. is_signed(ttypeconvnode(right).left.resulttype.def)))) then
  1906. begin
  1907. temp := ttypeconvnode(left).left;
  1908. ttypeconvnode(left).left := nil;
  1909. left.free;
  1910. left := temp;
  1911. if (right.nodetype = typeconvn) then
  1912. begin
  1913. temp := ttypeconvnode(right).left;
  1914. ttypeconvnode(right).left := nil;
  1915. right.free;
  1916. right := temp;
  1917. end;
  1918. if (is_signed(left.resulttype.def)) then
  1919. begin
  1920. inserttypeconv(left,s32inttype);
  1921. inserttypeconv(right,s32inttype);
  1922. end
  1923. else
  1924. begin
  1925. inserttypeconv(left,u32inttype);
  1926. inserttypeconv(right,u32inttype);
  1927. end;
  1928. firstpass(left);
  1929. firstpass(right);
  1930. result := true;
  1931. end;
  1932. end;
  1933. function taddnode.first_add64bitint: tnode;
  1934. var
  1935. procname: string[31];
  1936. temp: tnode;
  1937. power: longint;
  1938. begin
  1939. result := nil;
  1940. { create helper calls mul }
  1941. if nodetype <> muln then
  1942. exit;
  1943. { make sure that if there is a constant, that it's on the right }
  1944. if left.nodetype = ordconstn then
  1945. begin
  1946. temp := right;
  1947. right := left;
  1948. left := temp;
  1949. end;
  1950. { can we use a shift instead of a mul? }
  1951. if not (cs_check_overflow in aktlocalswitches) and
  1952. (right.nodetype = ordconstn) and
  1953. ispowerof2(tordconstnode(right).value,power) then
  1954. begin
  1955. tordconstnode(right).value := power;
  1956. result := cshlshrnode.create(shln,left,right);
  1957. { left and right are reused }
  1958. left := nil;
  1959. right := nil;
  1960. { return firstpassed new node }
  1961. exit;
  1962. end;
  1963. if not(use_generic_mul32to64) and
  1964. try_make_mul32to64 then
  1965. exit;
  1966. { when currency is used set the result of the
  1967. parameters to s64bit, so they are not converted }
  1968. if is_currency(resulttype.def) then
  1969. begin
  1970. left.resulttype:=s64inttype;
  1971. right.resulttype:=s64inttype;
  1972. end;
  1973. { otherwise, create the parameters for the helper }
  1974. right := ccallparanode.create(
  1975. cordconstnode.create(ord(cs_check_overflow in aktlocalswitches),booltype,true),
  1976. ccallparanode.create(right,ccallparanode.create(left,nil)));
  1977. left := nil;
  1978. { only qword needs the unsigned code, the
  1979. signed code is also used for currency }
  1980. if is_signed(resulttype.def) then
  1981. procname := 'fpc_mul_int64'
  1982. else
  1983. procname := 'fpc_mul_qword';
  1984. result := ccallnode.createintern(procname,right);
  1985. right := nil;
  1986. end;
  1987. function taddnode.first_addfloat : tnode;
  1988. var
  1989. procname: string[31];
  1990. { do we need to reverse the result ? }
  1991. notnode : boolean;
  1992. begin
  1993. result := nil;
  1994. notnode := false;
  1995. { In non-emulation mode, real opcodes are
  1996. emitted for floating point values.
  1997. }
  1998. if not (cs_fp_emulation in aktmoduleswitches) then
  1999. exit;
  2000. if not(target_info.system in system_wince) then
  2001. begin
  2002. case tfloatdef(left.resulttype.def).typ of
  2003. s32real:
  2004. procname:='float32';
  2005. s64real:
  2006. procname:='float64';
  2007. {!!! not yet implemented
  2008. s128real:
  2009. }
  2010. else
  2011. internalerror(2005082601);
  2012. end;
  2013. case nodetype of
  2014. addn:
  2015. procname:=procname+'_add';
  2016. muln:
  2017. procname:=procname+'_mul';
  2018. subn:
  2019. procname:=procname+'_sub';
  2020. slashn:
  2021. procname:=procname+'_div';
  2022. ltn:
  2023. procname:=procname+'_lt';
  2024. lten:
  2025. procname:=procname+'_le';
  2026. gtn:
  2027. begin
  2028. procname:=procname+'_le';
  2029. notnode:=true;
  2030. end;
  2031. gten:
  2032. begin
  2033. procname:=procname+'_lt';
  2034. notnode:=true;
  2035. end;
  2036. equaln:
  2037. procname:=procname+'_eq';
  2038. unequaln:
  2039. begin
  2040. procname:=procname+'_eq';
  2041. notnode:=true;
  2042. end;
  2043. else
  2044. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),left.resulttype.def.typename,right.resulttype.def.typename);
  2045. end;
  2046. end
  2047. else
  2048. begin
  2049. case nodetype of
  2050. addn:
  2051. procname:='ADD';
  2052. muln:
  2053. procname:='MUL';
  2054. subn:
  2055. procname:='SUB';
  2056. slashn:
  2057. procname:='DIV';
  2058. ltn:
  2059. procname:='LT';
  2060. lten:
  2061. procname:='LE';
  2062. gtn:
  2063. procname:='GT';
  2064. gten:
  2065. procname:='GE';
  2066. equaln:
  2067. procname:='EQ';
  2068. unequaln:
  2069. procname:='NE';
  2070. else
  2071. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),left.resulttype.def.typename,right.resulttype.def.typename);
  2072. end;
  2073. case tfloatdef(left.resulttype.def).typ of
  2074. s32real:
  2075. procname:=procname+'S';
  2076. s64real:
  2077. procname:=procname+'D';
  2078. {!!! not yet implemented
  2079. s128real:
  2080. }
  2081. else
  2082. internalerror(2005082602);
  2083. end;
  2084. end;
  2085. result:=ccallnode.createintern(procname,ccallparanode.create(right,
  2086. ccallparanode.create(left,nil)));
  2087. left:=nil;
  2088. right:=nil;
  2089. { do we need to reverse the result }
  2090. if notnode then
  2091. result:=cnotnode.create(result);
  2092. end;
  2093. function taddnode.pass_1 : tnode;
  2094. var
  2095. {$ifdef addstringopt}
  2096. hp : tnode;
  2097. {$endif addstringopt}
  2098. lt,rt : tnodetype;
  2099. rd,ld : tdef;
  2100. begin
  2101. result:=nil;
  2102. { Can we optimize multiple string additions into a single call?
  2103. This need to be done on a complete tree to detect the multiple
  2104. add nodes and is therefor done before the subtrees are processed }
  2105. if canbemultistringadd(self) then
  2106. begin
  2107. result := genmultistringadd(self);
  2108. exit;
  2109. end;
  2110. { first do the two subtrees }
  2111. firstpass(left);
  2112. firstpass(right);
  2113. if codegenerror then
  2114. exit;
  2115. { load easier access variables }
  2116. rd:=right.resulttype.def;
  2117. ld:=left.resulttype.def;
  2118. rt:=right.nodetype;
  2119. lt:=left.nodetype;
  2120. { int/int gives real/real! }
  2121. if nodetype=slashn then
  2122. begin
  2123. {$ifdef cpufpemu}
  2124. if (aktfputype=fpu_soft) or (cs_fp_emulation in aktmoduleswitches) then
  2125. begin
  2126. result:=first_addfloat;
  2127. if assigned(result) then
  2128. exit;
  2129. end;
  2130. {$endif cpufpemu}
  2131. expectloc:=LOC_FPUREGISTER;
  2132. { maybe we need an integer register to save }
  2133. { a reference }
  2134. if ((left.expectloc<>LOC_FPUREGISTER) or
  2135. (right.expectloc<>LOC_FPUREGISTER)) and
  2136. (left.registersint=right.registersint) then
  2137. calcregisters(self,1,1,0)
  2138. else
  2139. calcregisters(self,0,1,0);
  2140. { an add node always first loads both the left and the }
  2141. { right in the fpu before doing the calculation. However, }
  2142. { calcregisters(0,2,0) will overestimate the number of }
  2143. { necessary registers (it will make it 3 in case one of }
  2144. { the operands is already in the fpu) (JM) }
  2145. if ((left.expectloc<>LOC_FPUREGISTER) or
  2146. (right.expectloc<>LOC_FPUREGISTER)) and
  2147. (registersfpu < 2) then
  2148. inc(registersfpu);
  2149. end
  2150. { if both are orddefs then check sub types }
  2151. else if (ld.deftype=orddef) and (rd.deftype=orddef) then
  2152. begin
  2153. { 2 booleans ? }
  2154. if is_boolean(ld) and is_boolean(rd) then
  2155. begin
  2156. if (not(cs_full_boolean_eval in aktlocalswitches) or
  2157. (nf_short_bool in flags)) and
  2158. (nodetype in [andn,orn]) then
  2159. begin
  2160. expectloc:=LOC_JUMP;
  2161. calcregisters(self,0,0,0);
  2162. end
  2163. else
  2164. begin
  2165. if nodetype in [ltn,lten,gtn,gten,equaln,unequaln] then
  2166. begin
  2167. expectloc:=LOC_FLAGS;
  2168. if (left.expectloc in [LOC_JUMP,LOC_FLAGS]) and
  2169. (left.expectloc in [LOC_JUMP,LOC_FLAGS]) then
  2170. calcregisters(self,2,0,0)
  2171. else
  2172. calcregisters(self,1,0,0);
  2173. end
  2174. else
  2175. begin
  2176. expectloc:=LOC_REGISTER;
  2177. calcregisters(self,0,0,0);
  2178. end;
  2179. end;
  2180. end
  2181. else
  2182. { Both are chars? only convert to shortstrings for addn }
  2183. if is_char(ld) then
  2184. begin
  2185. if nodetype=addn then
  2186. internalerror(200103291);
  2187. expectloc:=LOC_FLAGS;
  2188. calcregisters(self,1,0,0);
  2189. end
  2190. {$ifndef cpu64bit}
  2191. { is there a 64 bit type ? }
  2192. else if (torddef(ld).typ in [s64bit,u64bit,scurrency]) then
  2193. begin
  2194. result := first_add64bitint;
  2195. if assigned(result) then
  2196. exit;
  2197. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2198. expectloc:=LOC_REGISTER
  2199. else
  2200. expectloc:=LOC_JUMP;
  2201. calcregisters(self,2,0,0)
  2202. end
  2203. {$endif cpu64bit}
  2204. { is there a cardinal? }
  2205. else if (torddef(ld).typ=u32bit) then
  2206. begin
  2207. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2208. expectloc:=LOC_REGISTER
  2209. else
  2210. expectloc:=LOC_FLAGS;
  2211. calcregisters(self,1,0,0);
  2212. { for unsigned mul we need an extra register }
  2213. if nodetype=muln then
  2214. inc(registersint);
  2215. end
  2216. { generic s32bit conversion }
  2217. else
  2218. begin
  2219. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2220. expectloc:=LOC_REGISTER
  2221. else
  2222. expectloc:=LOC_FLAGS;
  2223. calcregisters(self,1,0,0);
  2224. end;
  2225. end
  2226. { left side a setdef, must be before string processing,
  2227. else array constructor can be seen as array of char (PFV) }
  2228. else if (ld.deftype=setdef) then
  2229. begin
  2230. if tsetdef(ld).settype=smallset then
  2231. begin
  2232. if nodetype in [ltn,lten,gtn,gten,equaln,unequaln] then
  2233. expectloc:=LOC_FLAGS
  2234. else
  2235. expectloc:=LOC_REGISTER;
  2236. { are we adding set elements ? }
  2237. if right.nodetype=setelementn then
  2238. calcregisters(self,2,0,0)
  2239. else
  2240. calcregisters(self,1,0,0);
  2241. end
  2242. else
  2243. {$ifdef MMXSET}
  2244. {$ifdef i386}
  2245. if cs_mmx in aktlocalswitches then
  2246. begin
  2247. expectloc:=LOC_MMXREGISTER;
  2248. calcregisters(self,0,0,4);
  2249. end
  2250. else
  2251. {$endif}
  2252. {$endif MMXSET}
  2253. begin
  2254. result := first_addset;
  2255. if assigned(result) then
  2256. exit;
  2257. expectloc:=LOC_CREFERENCE;
  2258. calcregisters(self,0,0,0);
  2259. { here we call SET... }
  2260. include(current_procinfo.flags,pi_do_call);
  2261. end;
  2262. end
  2263. { compare pchar by addresses like BP/Delphi }
  2264. else if is_pchar(ld) then
  2265. begin
  2266. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2267. expectloc:=LOC_REGISTER
  2268. else
  2269. expectloc:=LOC_FLAGS;
  2270. calcregisters(self,1,0,0);
  2271. end
  2272. { is one of the operands a string }
  2273. else if (ld.deftype=stringdef) then
  2274. begin
  2275. if is_widestring(ld) then
  2276. begin
  2277. { this is only for add, the comparisaion is handled later }
  2278. expectloc:=LOC_REGISTER;
  2279. end
  2280. else if is_ansistring(ld) then
  2281. begin
  2282. { this is only for add, the comparisaion is handled later }
  2283. expectloc:=LOC_REGISTER;
  2284. end
  2285. else if is_longstring(ld) then
  2286. begin
  2287. { this is only for add, the comparisaion is handled later }
  2288. expectloc:=LOC_REFERENCE;
  2289. end
  2290. else
  2291. begin
  2292. {$ifdef addstringopt}
  2293. { can create a call which isn't handled by callparatemp }
  2294. if canbeaddsstringcharoptnode(self) then
  2295. begin
  2296. hp := genaddsstringcharoptnode(self);
  2297. pass_1 := hp;
  2298. exit;
  2299. end
  2300. else
  2301. {$endif addstringopt}
  2302. begin
  2303. { Fix right to be shortstring }
  2304. if is_char(right.resulttype.def) then
  2305. begin
  2306. inserttypeconv(right,cshortstringtype);
  2307. firstpass(right);
  2308. end;
  2309. end;
  2310. {$ifdef addstringopt}
  2311. { can create a call which isn't handled by callparatemp }
  2312. if canbeaddsstringcsstringoptnode(self) then
  2313. begin
  2314. hp := genaddsstringcsstringoptnode(self);
  2315. pass_1 := hp;
  2316. exit;
  2317. end;
  2318. {$endif addstringopt}
  2319. end;
  2320. { otherwise, let addstring convert everything }
  2321. result := first_addstring;
  2322. exit;
  2323. end
  2324. { is one a real float ? }
  2325. else if (rd.deftype=floatdef) or (ld.deftype=floatdef) then
  2326. begin
  2327. {$ifdef cpufpemu}
  2328. if (aktfputype=fpu_soft) or (cs_fp_emulation in aktmoduleswitches) then
  2329. begin
  2330. result:=first_addfloat;
  2331. if assigned(result) then
  2332. exit;
  2333. end;
  2334. {$endif cpufpemu}
  2335. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2336. expectloc:=LOC_FPUREGISTER
  2337. else
  2338. expectloc:=LOC_FLAGS;
  2339. calcregisters(self,0,1,0);
  2340. { an add node always first loads both the left and the }
  2341. { right in the fpu before doing the calculation. However, }
  2342. { calcregisters(0,2,0) will overestimate the number of }
  2343. { necessary registers (it will make it 3 in case one of }
  2344. { the operands is already in the fpu) (JM) }
  2345. if ((left.expectloc<>LOC_FPUREGISTER) or
  2346. (right.expectloc<>LOC_FPUREGISTER)) and
  2347. (registersfpu < 2) then
  2348. inc(registersfpu);
  2349. end
  2350. { pointer comperation and subtraction }
  2351. else if (ld.deftype=pointerdef) then
  2352. begin
  2353. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2354. expectloc:=LOC_REGISTER
  2355. else
  2356. expectloc:=LOC_FLAGS;
  2357. calcregisters(self,1,0,0);
  2358. end
  2359. else if is_class_or_interface(ld) then
  2360. begin
  2361. expectloc:=LOC_FLAGS;
  2362. calcregisters(self,1,0,0);
  2363. end
  2364. else if (ld.deftype=classrefdef) then
  2365. begin
  2366. expectloc:=LOC_FLAGS;
  2367. calcregisters(self,1,0,0);
  2368. end
  2369. { support procvar=nil,procvar<>nil }
  2370. else if ((ld.deftype=procvardef) and (rt=niln)) or
  2371. ((rd.deftype=procvardef) and (lt=niln)) then
  2372. begin
  2373. expectloc:=LOC_FLAGS;
  2374. calcregisters(self,1,0,0);
  2375. end
  2376. {$ifdef SUPPORT_MMX}
  2377. { mmx support, this must be before the zero based array
  2378. check }
  2379. else if (cs_mmx in aktlocalswitches) and is_mmx_able_array(ld) and
  2380. is_mmx_able_array(rd) then
  2381. begin
  2382. expectloc:=LOC_MMXREGISTER;
  2383. calcregisters(self,0,0,1);
  2384. end
  2385. {$endif SUPPORT_MMX}
  2386. else if (rd.deftype=pointerdef) or (ld.deftype=pointerdef) then
  2387. begin
  2388. expectloc:=LOC_REGISTER;
  2389. calcregisters(self,1,0,0);
  2390. end
  2391. else if (rd.deftype=procvardef) and
  2392. (ld.deftype=procvardef) and
  2393. equal_defs(rd,ld) then
  2394. begin
  2395. expectloc:=LOC_FLAGS;
  2396. calcregisters(self,1,0,0);
  2397. end
  2398. else if (ld.deftype=enumdef) then
  2399. begin
  2400. expectloc:=LOC_FLAGS;
  2401. calcregisters(self,1,0,0);
  2402. end
  2403. {$ifdef SUPPORT_MMX}
  2404. else if (cs_mmx in aktlocalswitches) and
  2405. is_mmx_able_array(ld) and
  2406. is_mmx_able_array(rd) then
  2407. begin
  2408. expectloc:=LOC_MMXREGISTER;
  2409. calcregisters(self,0,0,1);
  2410. end
  2411. {$endif SUPPORT_MMX}
  2412. { the general solution is to convert to 32 bit int }
  2413. else
  2414. begin
  2415. expectloc:=LOC_REGISTER;
  2416. calcregisters(self,1,0,0);
  2417. end;
  2418. end;
  2419. {$ifdef state_tracking}
  2420. function Taddnode.track_state_pass(exec_known:boolean):boolean;
  2421. var factval:Tnode;
  2422. begin
  2423. track_state_pass:=false;
  2424. if left.track_state_pass(exec_known) then
  2425. begin
  2426. track_state_pass:=true;
  2427. left.resulttype.def:=nil;
  2428. do_resulttypepass(left);
  2429. end;
  2430. factval:=aktstate.find_fact(left);
  2431. if factval<>nil then
  2432. begin
  2433. track_state_pass:=true;
  2434. left.destroy;
  2435. left:=factval.getcopy;
  2436. end;
  2437. if right.track_state_pass(exec_known) then
  2438. begin
  2439. track_state_pass:=true;
  2440. right.resulttype.def:=nil;
  2441. do_resulttypepass(right);
  2442. end;
  2443. factval:=aktstate.find_fact(right);
  2444. if factval<>nil then
  2445. begin
  2446. track_state_pass:=true;
  2447. right.destroy;
  2448. right:=factval.getcopy;
  2449. end;
  2450. end;
  2451. {$endif}
  2452. begin
  2453. caddnode:=taddnode;
  2454. end.