nadd.pas 113 KB

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