nadd.pas 109 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769
  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 : 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;
  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,0,1,5);
  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 : 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 := genintconstnode(v)
  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 := genintconstnode(v)
  265. end
  266. else
  267. t := cpointerconstnode.create(qword(v),resultdef)
  268. else
  269. if is_integer(ld) then
  270. t:=genintconstnode(v)
  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:=genintconstnode(v)
  285. end;
  286. xorn :
  287. if is_integer(ld) then
  288. t:=genintconstnode(lv xor rv)
  289. else
  290. t:=cordconstnode.create(lv xor rv,resultdef,true);
  291. orn :
  292. if is_integer(ld) then
  293. t:=genintconstnode(lv or rv)
  294. else
  295. t:=cordconstnode.create(lv or rv,resultdef,true);
  296. andn :
  297. if is_integer(ld) then
  298. t:=genintconstnode(lv and rv)
  299. else
  300. t:=cordconstnode.create(lv and rv,resultdef,true);
  301. ltn :
  302. t:=cordconstnode.create(ord(lv<rv),booltype,true);
  303. lten :
  304. t:=cordconstnode.create(ord(lv<=rv),booltype,true);
  305. gtn :
  306. t:=cordconstnode.create(ord(lv>rv),booltype,true);
  307. gten :
  308. t:=cordconstnode.create(ord(lv>=rv),booltype,true);
  309. equaln :
  310. t:=cordconstnode.create(ord(lv=rv),booltype,true);
  311. unequaln :
  312. t:=cordconstnode.create(ord(lv<>rv),booltype,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,booltype,true)
  356. else if lv>=high then
  357. t:=Cordconstnode.create(0,booltype,true);
  358. lten:
  359. if lv<=low then
  360. t:=Cordconstnode.create(1,booltype,true)
  361. else if lv>high then
  362. t:=Cordconstnode.create(0,booltype,true);
  363. gtn:
  364. if lv<=low then
  365. t:=Cordconstnode.create(0,booltype,true)
  366. else if lv>high then
  367. t:=Cordconstnode.create(1,booltype,true);
  368. gten :
  369. if lv<low then
  370. t:=Cordconstnode.create(0,booltype,true)
  371. else if lv>=high then
  372. t:=Cordconstnode.create(1,booltype,true);
  373. equaln:
  374. if (lv<low) or (lv>high) then
  375. t:=Cordconstnode.create(0,booltype,true);
  376. unequaln:
  377. if (lv<low) or (lv>high) then
  378. t:=Cordconstnode.create(1,booltype,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,booltype,true)
  405. else if low>=rv then
  406. t:=Cordconstnode.create(0,booltype,true);
  407. lten:
  408. if high<=rv then
  409. t:=Cordconstnode.create(1,booltype,true)
  410. else if low>rv then
  411. t:=Cordconstnode.create(0,booltype,true);
  412. gtn:
  413. if high<=rv then
  414. t:=Cordconstnode.create(0,booltype,true)
  415. else if low>rv then
  416. t:=Cordconstnode.create(1,booltype,true);
  417. gten:
  418. if high<rv then
  419. t:=Cordconstnode.create(0,booltype,true)
  420. else if low>=rv then
  421. t:=Cordconstnode.create(1,booltype,true);
  422. equaln:
  423. if (rv<low) or (rv>high) then
  424. t:=Cordconstnode.create(0,booltype,true);
  425. unequaln:
  426. if (rv<low) or (rv>high) then
  427. t:=Cordconstnode.create(1,booltype,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),booltype,true);
  530. lten :
  531. t:=cordconstnode.create(ord(lvd<=rvd),booltype,true);
  532. gtn :
  533. t:=cordconstnode.create(ord(lvd>rvd),booltype,true);
  534. gten :
  535. t:=cordconstnode.create(ord(lvd>=rvd),booltype,true);
  536. equaln :
  537. t:=cordconstnode.create(ord(lvd=rvd),booltype,true);
  538. unequaln :
  539. t:=cordconstnode.create(ord(lvd<>rvd),booltype,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),booltype,true);
  567. lten :
  568. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)<=0),booltype,true);
  569. gtn :
  570. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)>0),booltype,true);
  571. gten :
  572. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)>=0),booltype,true);
  573. equaln :
  574. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)=0),booltype,true);
  575. unequaln :
  576. t:=cordconstnode.create(byte(comparewidestrings(ws1,ws2)<>0),booltype,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),booltype,true);
  639. lten :
  640. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)<=0),booltype,true);
  641. gtn :
  642. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)>0),booltype,true);
  643. gten :
  644. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)>=0),booltype,true);
  645. equaln :
  646. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)=0),booltype,true);
  647. unequaln :
  648. t:=cordconstnode.create(byte(compareansistrings(s1,s2,l1,l2)<>0),booltype,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),booltype,true);
  686. end;
  687. equaln :
  688. begin
  689. b:=tsetconstnode(right).value_set^ = tsetconstnode(left).value_set^;
  690. t:=cordconstnode.create(byte(b),booltype,true);
  691. end;
  692. lten :
  693. begin
  694. b:=tsetconstnode(left).value_set^ <= tsetconstnode(right).value_set^;
  695. t:=cordconstnode.create(byte(b),booltype,true);
  696. end;
  697. gten :
  698. begin
  699. b:=tsetconstnode(left).value_set^ >= tsetconstnode(right).value_set^;
  700. t:=cordconstnode.create(byte(b),booltype,true);
  701. end;
  702. else
  703. internalerror(2008022105);
  704. end;
  705. result:=t;
  706. exit;
  707. end;
  708. end;
  709. function taddnode.dogetcopy: tnode;
  710. var
  711. n: taddnode;
  712. begin
  713. n:=taddnode(inherited dogetcopy);
  714. n.resultrealdef:=resultrealdef;
  715. result:=n;
  716. end;
  717. function taddnode.docompare(p: tnode): boolean;
  718. begin
  719. result:=
  720. inherited docompare(p) and
  721. equal_defs(taddnode(p).resultrealdef,resultrealdef);
  722. end;
  723. function taddnode.pass_typecheck:tnode;
  724. begin
  725. { This function is small to keep the stack small for recursive of
  726. large + operations }
  727. typecheckpass(left);
  728. typecheckpass(right);
  729. result:=pass_typecheck_internal;
  730. end;
  731. function taddnode.pass_typecheck_internal:tnode;
  732. var
  733. hp : tnode;
  734. rd,ld,nd : tdef;
  735. hsym : tfieldvarsym;
  736. llow,lhigh,
  737. rlow,rhigh : tconstexprint;
  738. strtype : tstringtype;
  739. b : boolean;
  740. lt,rt : tnodetype;
  741. ot : tnodetype;
  742. {$ifdef state_tracking}
  743. factval : Tnode;
  744. change : boolean;
  745. {$endif}
  746. begin
  747. result:=nil;
  748. { both left and right need to be valid }
  749. set_varstate(left,vs_read,[vsf_must_be_valid]);
  750. set_varstate(right,vs_read,[vsf_must_be_valid]);
  751. if codegenerror then
  752. exit;
  753. { tp procvar support }
  754. maybe_call_procvar(left,true);
  755. maybe_call_procvar(right,true);
  756. { convert array constructors to sets, because there is no other operator
  757. possible for array constructors }
  758. if is_array_constructor(left.resultdef) then
  759. begin
  760. arrayconstructor_to_set(left);
  761. typecheckpass(left);
  762. end;
  763. if is_array_constructor(right.resultdef) then
  764. begin
  765. arrayconstructor_to_set(right);
  766. typecheckpass(right);
  767. end;
  768. { allow operator overloading }
  769. hp:=self;
  770. if isbinaryoverloaded(hp) then
  771. begin
  772. result:=hp;
  773. exit;
  774. end;
  775. { Stop checking when an error was found in the operator checking }
  776. if codegenerror then
  777. begin
  778. result:=cerrornode.create;
  779. exit;
  780. end;
  781. { Kylix allows enum+ordconstn in an enum type declaration, we need to do
  782. the conversion here before the constant folding }
  783. if (m_delphi in current_settings.modeswitches) and
  784. (blocktype in [bt_type,bt_const_type,bt_var_type]) then
  785. begin
  786. if (left.resultdef.typ=enumdef) and
  787. (right.resultdef.typ=orddef) then
  788. begin
  789. { insert explicit typecast to default signed int }
  790. left:=ctypeconvnode.create_internal(left,sinttype);
  791. typecheckpass(left);
  792. end
  793. else
  794. if (left.resultdef.typ=orddef) and
  795. (right.resultdef.typ=enumdef) then
  796. begin
  797. { insert explicit typecast to default signed int }
  798. right:=ctypeconvnode.create_internal(right,sinttype);
  799. typecheckpass(right);
  800. end;
  801. end;
  802. { is one a real float, then both need to be floats, this
  803. need to be done before the constant folding so constant
  804. operation on a float and int are also handled }
  805. resultrealdef:=pbestrealtype^;
  806. if (right.resultdef.typ=floatdef) or (left.resultdef.typ=floatdef) then
  807. begin
  808. { when both floattypes are already equal then use that
  809. floattype for results }
  810. if (right.resultdef.typ=floatdef) and
  811. (left.resultdef.typ=floatdef) and
  812. (tfloatdef(left.resultdef).floattype=tfloatdef(right.resultdef).floattype) then
  813. resultrealdef:=left.resultdef
  814. { when there is a currency type then use currency, but
  815. only when currency is defined as float }
  816. else
  817. if (is_currency(right.resultdef) or
  818. is_currency(left.resultdef)) and
  819. ((s64currencytype.typ = floatdef) or
  820. (nodetype <> slashn)) then
  821. begin
  822. resultrealdef:=s64currencytype;
  823. inserttypeconv(right,resultrealdef);
  824. inserttypeconv(left,resultrealdef);
  825. end
  826. else
  827. begin
  828. resultrealdef:=getbestreal(left.resultdef,right.resultdef);
  829. inserttypeconv(right,resultrealdef);
  830. inserttypeconv(left,resultrealdef);
  831. end;
  832. end;
  833. { If both operands are constant and there is a unicodestring
  834. or unicodestring then convert everything to unicodestring }
  835. if is_constnode(right) and is_constnode(left) and
  836. (is_unicodestring(right.resultdef) or
  837. is_unicodestring(left.resultdef)) then
  838. begin
  839. inserttypeconv(right,cunicodestringtype);
  840. inserttypeconv(left,cunicodestringtype);
  841. end;
  842. { If both operands are constant and there is a widechar
  843. or widestring then convert everything to widestring. This
  844. allows constant folding like char+widechar }
  845. if is_constnode(right) and is_constnode(left) and
  846. (is_widestring(right.resultdef) or
  847. is_widestring(left.resultdef) or
  848. is_widechar(right.resultdef) or
  849. is_widechar(left.resultdef)) then
  850. begin
  851. inserttypeconv(right,cwidestringtype);
  852. inserttypeconv(left,cwidestringtype);
  853. end;
  854. { load easier access variables }
  855. rd:=right.resultdef;
  856. ld:=left.resultdef;
  857. rt:=right.nodetype;
  858. lt:=left.nodetype;
  859. { 4 character constant strings are compatible with orddef }
  860. { in macpas mode (become cardinals) }
  861. if (m_mac in current_settings.modeswitches) and
  862. { only allow for comparisons, additions etc are }
  863. { normally program errors }
  864. (nodetype in [ltn,lten,gtn,gten,unequaln,equaln]) and
  865. (((lt=stringconstn) and
  866. (tstringconstnode(left).len=4) and
  867. (rd.typ=orddef)) or
  868. ((rt=stringconstn) and
  869. (tstringconstnode(right).len=4) and
  870. (ld.typ=orddef))) then
  871. begin
  872. if (rt=stringconstn) then
  873. begin
  874. inserttypeconv(right,u32inttype);
  875. rt:=right.nodetype;
  876. rd:=right.resultdef;
  877. end
  878. else
  879. begin
  880. inserttypeconv(left,u32inttype);
  881. lt:=left.nodetype;
  882. ld:=left.resultdef;
  883. end;
  884. end;
  885. { but an int/int gives real/real! }
  886. if (nodetype=slashn) and not(is_vector(left.resultdef)) and not(is_vector(right.resultdef)) then
  887. begin
  888. if is_currency(left.resultdef) and
  889. is_currency(right.resultdef) then
  890. { In case of currency, converting to float means dividing by 10000 }
  891. { However, since this is already a division, both divisions by }
  892. { 10000 are eliminated when we divide the results -> we can skip }
  893. { them. }
  894. if s64currencytype.typ = floatdef then
  895. begin
  896. { there's no s64comptype or so, how do we avoid the type conversion?
  897. left.resultdef := s64comptype;
  898. right.resultdef := s64comptype; }
  899. end
  900. else
  901. begin
  902. left.resultdef := s64inttype;
  903. right.resultdef := s64inttype;
  904. end;
  905. inserttypeconv(right,resultrealdef);
  906. inserttypeconv(left,resultrealdef);
  907. end
  908. { if both are orddefs then check sub types }
  909. else if (ld.typ=orddef) and (rd.typ=orddef) then
  910. begin
  911. { set for & and | operations in macpas mode: they only work on }
  912. { booleans, and always short circuit evaluation }
  913. if (nf_short_bool in flags) then
  914. begin
  915. if not is_boolean(ld) then
  916. begin
  917. inserttypeconv(left,booltype);
  918. ld := left.resultdef;
  919. end;
  920. if not is_boolean(rd) then
  921. begin
  922. inserttypeconv(right,booltype);
  923. rd := right.resultdef;
  924. end;
  925. end;
  926. { 2 booleans? Make them equal to the largest boolean }
  927. if (is_boolean(ld) and is_boolean(rd)) or
  928. (nf_short_bool in flags) then
  929. begin
  930. if (torddef(left.resultdef).size>torddef(right.resultdef).size) or
  931. (is_cbool(left.resultdef) and not is_cbool(right.resultdef)) then
  932. begin
  933. right:=ctypeconvnode.create_internal(right,left.resultdef);
  934. ttypeconvnode(right).convtype:=tc_bool_2_bool;
  935. typecheckpass(right);
  936. end
  937. else if (torddef(left.resultdef).size<torddef(right.resultdef).size) or
  938. (not is_cbool(left.resultdef) and is_cbool(right.resultdef)) then
  939. begin
  940. left:=ctypeconvnode.create_internal(left,right.resultdef);
  941. ttypeconvnode(left).convtype:=tc_bool_2_bool;
  942. typecheckpass(left);
  943. end;
  944. case nodetype of
  945. xorn,
  946. ltn,
  947. lten,
  948. gtn,
  949. gten,
  950. andn,
  951. orn:
  952. begin
  953. end;
  954. unequaln,
  955. equaln:
  956. begin
  957. if not(cs_full_boolean_eval in current_settings.localswitches) or
  958. (nf_short_bool in flags) then
  959. begin
  960. { Remove any compares with constants }
  961. if (left.nodetype=ordconstn) then
  962. begin
  963. hp:=right;
  964. b:=(tordconstnode(left).value<>0);
  965. ot:=nodetype;
  966. left.free;
  967. left:=nil;
  968. right:=nil;
  969. if (not(b) and (ot=equaln)) or
  970. (b and (ot=unequaln)) then
  971. begin
  972. hp:=cnotnode.create(hp);
  973. end;
  974. result:=hp;
  975. exit;
  976. end;
  977. if (right.nodetype=ordconstn) then
  978. begin
  979. hp:=left;
  980. b:=(tordconstnode(right).value<>0);
  981. ot:=nodetype;
  982. right.free;
  983. right:=nil;
  984. left:=nil;
  985. if (not(b) and (ot=equaln)) or
  986. (b and (ot=unequaln)) then
  987. begin
  988. hp:=cnotnode.create(hp);
  989. end;
  990. result:=hp;
  991. exit;
  992. end;
  993. end;
  994. end;
  995. else
  996. begin
  997. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  998. result:=cnothingnode.create;
  999. exit;
  1000. end;
  1001. end;
  1002. end
  1003. { Both are chars? }
  1004. else if is_char(rd) and is_char(ld) then
  1005. begin
  1006. if nodetype=addn then
  1007. begin
  1008. resultdef:=cshortstringtype;
  1009. if not(is_constcharnode(left) and is_constcharnode(right)) then
  1010. begin
  1011. inserttypeconv(left,cshortstringtype);
  1012. {$ifdef addstringopt}
  1013. hp := genaddsstringcharoptnode(self);
  1014. result := hp;
  1015. exit;
  1016. {$endif addstringopt}
  1017. end
  1018. end
  1019. else if not(nodetype in [ltn,lten,gtn,gten,unequaln,equaln]) then
  1020. begin
  1021. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1022. result:=cnothingnode.create;
  1023. exit;
  1024. end;
  1025. end
  1026. { There is a widechar? }
  1027. else if is_widechar(rd) or is_widechar(ld) then
  1028. begin
  1029. { widechar+widechar gives widestring }
  1030. if nodetype=addn then
  1031. begin
  1032. inserttypeconv(left,cwidestringtype);
  1033. if (torddef(rd).ordtype<>uwidechar) then
  1034. inserttypeconv(right,cwidechartype);
  1035. resultdef:=cwidestringtype;
  1036. end
  1037. else
  1038. begin
  1039. if (torddef(ld).ordtype<>uwidechar) then
  1040. inserttypeconv(left,cwidechartype);
  1041. if (torddef(rd).ordtype<>uwidechar) then
  1042. inserttypeconv(right,cwidechartype);
  1043. end;
  1044. end
  1045. { is there a currency type ? }
  1046. else if ((torddef(rd).ordtype=scurrency) or (torddef(ld).ordtype=scurrency)) then
  1047. begin
  1048. if (torddef(ld).ordtype<>scurrency) then
  1049. inserttypeconv(left,s64currencytype);
  1050. if (torddef(rd).ordtype<>scurrency) then
  1051. inserttypeconv(right,s64currencytype);
  1052. end
  1053. { "and" does't care about the sign of integers }
  1054. { "xor", "or" and compares don't need extension to native int }
  1055. { size either as long as both values are signed or unsigned }
  1056. { "xor" and "or" also don't care about the sign if the values }
  1057. { occupy an entire register }
  1058. { don't do it if either type is 64 bit, since in that case we }
  1059. { can't safely find a "common" type }
  1060. else if is_integer(ld) and is_integer(rd) and
  1061. not is_64bitint(ld) and not is_64bitint(rd) and
  1062. ((nodetype=andn) or
  1063. ((nodetype in [orn,xorn,equaln,unequaln,gtn,gten,ltn,lten]) and
  1064. not(is_signed(ld) xor is_signed(rd)))) then
  1065. begin
  1066. if (rd.size>ld.size) or
  1067. { Delphi-compatible: prefer unsigned type for "and" with equal size }
  1068. ((rd.size=ld.size) and
  1069. not is_signed(rd)) then
  1070. begin
  1071. if (rd.size=ld.size) and
  1072. is_signed(ld) then
  1073. inserttypeconv_internal(left,rd)
  1074. else
  1075. begin
  1076. { not to left right.resultdef, because that may
  1077. cause a range error if left and right's def don't
  1078. completely overlap }
  1079. nd:=get_common_intdef(torddef(ld),torddef(rd),true);
  1080. inserttypeconv(left,nd);
  1081. inserttypeconv(right,nd);
  1082. end;
  1083. end
  1084. else
  1085. begin
  1086. if (rd.size=ld.size) and
  1087. is_signed(rd) then
  1088. inserttypeconv_internal(right,ld)
  1089. else
  1090. begin
  1091. nd:=get_common_intdef(torddef(ld),torddef(rd),true);
  1092. inserttypeconv(left,nd);
  1093. inserttypeconv(right,nd);
  1094. end;
  1095. end
  1096. end
  1097. { is there a signed 64 bit type ? }
  1098. else if ((torddef(rd).ordtype=s64bit) or (torddef(ld).ordtype=s64bit)) then
  1099. begin
  1100. if (torddef(ld).ordtype<>s64bit) then
  1101. inserttypeconv(left,s64inttype);
  1102. if (torddef(rd).ordtype<>s64bit) then
  1103. inserttypeconv(right,s64inttype);
  1104. end
  1105. { is there a unsigned 64 bit type ? }
  1106. else if ((torddef(rd).ordtype=u64bit) or (torddef(ld).ordtype=u64bit)) then
  1107. begin
  1108. if (torddef(ld).ordtype<>u64bit) then
  1109. inserttypeconv(left,u64inttype);
  1110. if (torddef(rd).ordtype<>u64bit) then
  1111. inserttypeconv(right,u64inttype);
  1112. end
  1113. { 64 bit cpus do calculations always in 64 bit }
  1114. {$ifndef cpu64bitaddr}
  1115. { is there a cardinal? }
  1116. else if ((torddef(rd).ordtype=u32bit) or (torddef(ld).ordtype=u32bit)) then
  1117. begin
  1118. { convert positive constants to u32bit }
  1119. if (torddef(ld).ordtype<>u32bit) and
  1120. is_constintnode(left) and
  1121. (tordconstnode(left).value >= 0) then
  1122. inserttypeconv(left,u32inttype);
  1123. if (torddef(rd).ordtype<>u32bit) and
  1124. is_constintnode(right) and
  1125. (tordconstnode(right).value >= 0) then
  1126. inserttypeconv(right,u32inttype);
  1127. { when one of the operand is signed or the operation is subn then perform
  1128. the operation in 64bit, can't use rd/ld here because there
  1129. could be already typeconvs inserted.
  1130. This is compatible with the code below for other unsigned types (PFV) }
  1131. if is_signed(left.resultdef) or
  1132. is_signed(right.resultdef) or
  1133. (nodetype=subn) then
  1134. begin
  1135. if nodetype<>subn then
  1136. CGMessage(type_h_mixed_signed_unsigned);
  1137. { mark as internal in case added for a subn, so }
  1138. { ttypeconvnode.simplify can remove the 64 bit }
  1139. { typecast again if semantically correct. Even }
  1140. { if we could detect that here already, we }
  1141. { mustn't do it here because that would change }
  1142. { overload choosing behaviour etc. The code in }
  1143. { ncnv.pas is run after that is already decided }
  1144. if (not is_signed(left.resultdef) and
  1145. not is_signed(right.resultdef)) or
  1146. (nodetype in [orn,xorn]) then
  1147. include(flags,nf_internal);
  1148. inserttypeconv(left,s64inttype);
  1149. inserttypeconv(right,s64inttype);
  1150. end
  1151. else
  1152. begin
  1153. if (torddef(left.resultdef).ordtype<>u32bit) then
  1154. inserttypeconv(left,u32inttype);
  1155. if (torddef(right.resultdef).ordtype<>u32bit) then
  1156. inserttypeconv(right,u32inttype);
  1157. end;
  1158. end
  1159. {$endif cpu64bitaddr}
  1160. { generic ord conversion is sinttype }
  1161. else
  1162. begin
  1163. { if the left or right value is smaller than the normal
  1164. type sinttype and is unsigned, and the other value
  1165. is a constant < 0, the result will always be false/true
  1166. for equal / unequal nodes.
  1167. }
  1168. if (
  1169. { left : unsigned ordinal var, right : < 0 constant }
  1170. (
  1171. ((is_signed(ld)=false) and (is_constintnode(left) =false)) and
  1172. ((is_constintnode(right)) and (tordconstnode(right).value < 0))
  1173. ) or
  1174. { right : unsigned ordinal var, left : < 0 constant }
  1175. (
  1176. ((is_signed(rd)=false) and (is_constintnode(right) =false)) and
  1177. ((is_constintnode(left)) and (tordconstnode(left).value < 0))
  1178. )
  1179. ) then
  1180. begin
  1181. if nodetype = equaln then
  1182. CGMessage(type_w_signed_unsigned_always_false)
  1183. else
  1184. if nodetype = unequaln then
  1185. CGMessage(type_w_signed_unsigned_always_true)
  1186. else
  1187. if (is_constintnode(left) and (nodetype in [ltn,lten])) or
  1188. (is_constintnode(right) and (nodetype in [gtn,gten])) then
  1189. CGMessage(type_w_signed_unsigned_always_true)
  1190. else
  1191. if (is_constintnode(right) and (nodetype in [ltn,lten])) or
  1192. (is_constintnode(left) and (nodetype in [gtn,gten])) then
  1193. CGMessage(type_w_signed_unsigned_always_false);
  1194. end;
  1195. { When there is a signed type or there is a minus operation
  1196. we convert to signed int. Otherwise (both are unsigned) we keep
  1197. the result also unsigned. This is compatible with Delphi (PFV) }
  1198. if is_signed(ld) or
  1199. is_signed(rd) or
  1200. (nodetype=subn) then
  1201. begin
  1202. {$ifdef cpunodefaultint}
  1203. { for small cpus we use the smallest common type }
  1204. nd:=get_common_intdef(torddef(ld),torddef(rd),false);
  1205. inserttypeconv(right,nd);
  1206. inserttypeconv(left,nd);
  1207. {$else cpunodefaultint}
  1208. inserttypeconv(right,sinttype);
  1209. inserttypeconv(left,sinttype);
  1210. {$endif cpunodefaultint}
  1211. end
  1212. else
  1213. begin
  1214. inserttypeconv(right,uinttype);
  1215. inserttypeconv(left,uinttype);
  1216. end;
  1217. end;
  1218. end
  1219. { if both are floatdefs, conversion is already done before constant folding }
  1220. else if (ld.typ=floatdef) then
  1221. begin
  1222. if not(nodetype in [addn,subn,muln,slashn,equaln,unequaln,ltn,lten,gtn,gten]) then
  1223. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1224. end
  1225. { left side a setdef, must be before string processing,
  1226. else array constructor can be seen as array of char (PFV) }
  1227. else if (ld.typ=setdef) then
  1228. begin
  1229. if not(nodetype in [addn,subn,symdifn,muln,equaln,unequaln,lten,gten]) then
  1230. CGMessage(type_e_set_operation_unknown);
  1231. { right must either be a set or a set element }
  1232. if (rd.typ<>setdef) and
  1233. (rt<>setelementn) then
  1234. CGMessage(type_e_mismatch)
  1235. { Make operands the same setdef. If one's elementtype fits }
  1236. { entirely inside the other's, pick the one with the largest }
  1237. { range. Otherwise create a new setdef with a range which }
  1238. { can contain both. }
  1239. else if not(equal_defs(ld,rd)) then
  1240. begin
  1241. { note: ld cannot be an empty set with elementdef=nil in }
  1242. { case right is not a set, arrayconstructor_to_set takes }
  1243. { care of that }
  1244. { 1: rd is a set with an assigned elementdef, and ld is }
  1245. { either an empty set without elementdef or a set whose }
  1246. { elementdef fits in rd's elementdef -> convert to rd }
  1247. if ((rd.typ=setdef) and
  1248. assigned(tsetdef(rd).elementdef) and
  1249. (not assigned(tsetdef(ld).elementdef) or
  1250. is_in_limit(ld,rd))) then
  1251. inserttypeconv(left,rd)
  1252. { 2: rd is either an empty set without elementdef or a set }
  1253. { whose elementdef fits in ld's elementdef, or a set }
  1254. { element whose def fits in ld's elementdef -> convert }
  1255. { to ld. ld's elementdef can't be nil here, is caught }
  1256. { previous case and "note:" above }
  1257. else if ((rd.typ=setdef) and
  1258. (not assigned(tsetdef(rd).elementdef) or
  1259. is_in_limit(rd,ld))) or
  1260. ((rd.typ<>setdef) and
  1261. is_in_limit(rd,tsetdef(ld).elementdef)) then
  1262. if (rd.typ=setdef) then
  1263. inserttypeconv(right,ld)
  1264. else
  1265. inserttypeconv(right,tsetdef(ld).elementdef)
  1266. { 3: otherwise create setdef which encompasses both, taking }
  1267. { into account empty sets without elementdef }
  1268. else
  1269. begin
  1270. if assigned(tsetdef(ld).elementdef) then
  1271. begin
  1272. llow:=tsetdef(ld).setbase;
  1273. lhigh:=tsetdef(ld).setmax;
  1274. end;
  1275. if (rd.typ=setdef) then
  1276. if assigned(tsetdef(rd).elementdef) then
  1277. begin
  1278. rlow:=tsetdef(rd).setbase;
  1279. rhigh:=tsetdef(rd).setmax;
  1280. end
  1281. else
  1282. begin
  1283. { ld's elementdef must have been valid }
  1284. rlow:=llow;
  1285. rhigh:=lhigh;
  1286. end
  1287. else
  1288. getrange(rd,rlow,rhigh);
  1289. if not assigned(tsetdef(ld).elementdef) then
  1290. begin
  1291. llow:=rlow;
  1292. lhigh:=rhigh;
  1293. end;
  1294. nd:=tsetdef.create(tsetdef(ld).elementdef,min(llow,rlow),max(lhigh,rhigh));
  1295. inserttypeconv(left,nd);
  1296. if (rd.typ=setdef) then
  1297. inserttypeconv(right,nd)
  1298. else
  1299. inserttypeconv(right,tsetdef(nd).elementdef);
  1300. end;
  1301. end;
  1302. end
  1303. { pointer comparision and subtraction }
  1304. else if (
  1305. (rd.typ=pointerdef) and (ld.typ=pointerdef)
  1306. ) or
  1307. { compare/add pchar to variable (not stringconst) char arrays
  1308. by addresses like BP/Delphi }
  1309. (
  1310. (nodetype in [equaln,unequaln,subn,addn]) and
  1311. (
  1312. ((is_pchar(ld) or (lt=niln)) and is_chararray(rd) and (rt<>stringconstn)) or
  1313. ((is_pchar(rd) or (rt=niln)) and is_chararray(ld) and (lt<>stringconstn))
  1314. )
  1315. ) then
  1316. begin
  1317. { convert char array to pointer }
  1318. if is_chararray(rd) then
  1319. begin
  1320. inserttypeconv(right,charpointertype);
  1321. rd:=right.resultdef;
  1322. end
  1323. else if is_chararray(ld) then
  1324. begin
  1325. inserttypeconv(left,charpointertype);
  1326. ld:=left.resultdef;
  1327. end;
  1328. case nodetype of
  1329. equaln,unequaln :
  1330. begin
  1331. if is_voidpointer(right.resultdef) then
  1332. inserttypeconv(right,left.resultdef)
  1333. else if is_voidpointer(left.resultdef) then
  1334. inserttypeconv(left,right.resultdef)
  1335. else if not(equal_defs(ld,rd)) then
  1336. IncompatibleTypes(ld,rd);
  1337. { now that the type checking is done, convert both to charpointer, }
  1338. { because methodpointers are 8 bytes even though only the first 4 }
  1339. { bytes must be compared. This can happen here if we are in }
  1340. { TP/Delphi mode, because there @methodpointer = voidpointer (but }
  1341. { a voidpointer of 8 bytes). A conversion to voidpointer would be }
  1342. { optimized away, since the result already was a voidpointer, so }
  1343. { use a charpointer instead (JM) }
  1344. inserttypeconv_internal(left,charpointertype);
  1345. inserttypeconv_internal(right,charpointertype);
  1346. end;
  1347. ltn,lten,gtn,gten:
  1348. begin
  1349. if (cs_extsyntax in current_settings.moduleswitches) then
  1350. begin
  1351. if is_voidpointer(right.resultdef) then
  1352. inserttypeconv(right,left.resultdef)
  1353. else if is_voidpointer(left.resultdef) then
  1354. inserttypeconv(left,right.resultdef)
  1355. else if not(equal_defs(ld,rd)) then
  1356. IncompatibleTypes(ld,rd);
  1357. end
  1358. else
  1359. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1360. end;
  1361. subn:
  1362. begin
  1363. if (cs_extsyntax in current_settings.moduleswitches) then
  1364. begin
  1365. if is_voidpointer(right.resultdef) then
  1366. begin
  1367. if is_big_untyped_addrnode(right) then
  1368. CGMessage1(type_w_untyped_arithmetic_unportable,node2opstr(nodetype));
  1369. inserttypeconv(right,left.resultdef)
  1370. end
  1371. else if is_voidpointer(left.resultdef) then
  1372. inserttypeconv(left,right.resultdef)
  1373. else if not(equal_defs(ld,rd)) then
  1374. IncompatibleTypes(ld,rd);
  1375. end
  1376. else
  1377. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1378. if not(nf_has_pointerdiv in flags) and
  1379. (tpointerdef(rd).pointeddef.size>1) then
  1380. begin
  1381. hp:=getcopy;
  1382. include(hp.flags,nf_has_pointerdiv);
  1383. result:=cmoddivnode.create(divn,hp,cordconstnode.create(tpointerdef(rd).pointeddef.size,sinttype,false));
  1384. end;
  1385. resultdef:=sinttype;
  1386. exit;
  1387. end;
  1388. else
  1389. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1390. end;
  1391. end
  1392. { is one of the operands a string?,
  1393. chararrays are also handled as strings (after conversion), also take
  1394. care of chararray+chararray and chararray+char.
  1395. Note: Must be done after pointerdef+pointerdef has been checked, else
  1396. pchar is converted to string }
  1397. else if (rd.typ=stringdef) or
  1398. (ld.typ=stringdef) or
  1399. { stringconstn's can be arraydefs }
  1400. (lt=stringconstn) or
  1401. (rt=stringconstn) or
  1402. ((is_pchar(rd) or is_chararray(rd) or is_char(rd) or is_open_chararray(rd) or
  1403. is_pwidechar(rd) or is_widechararray(rd) or is_widechar(rd) or is_open_widechararray(rd)) and
  1404. (is_pchar(ld) or is_chararray(ld) or is_char(ld) or is_open_chararray(ld) or
  1405. is_pwidechar(ld) or is_widechararray(ld) or is_widechar(ld) or is_open_widechararray(ld))) then
  1406. begin
  1407. if (nodetype in [addn,equaln,unequaln,lten,gten,ltn,gtn]) then
  1408. begin
  1409. { Is there a unicodestring? }
  1410. if is_unicodestring(rd) or is_unicodestring(ld) then
  1411. strtype:=st_unicodestring
  1412. else
  1413. { Is there a widestring? }
  1414. if is_widestring(rd) or is_widestring(ld) or
  1415. is_pwidechar(rd) or is_widechararray(rd) or is_widechar(rd) or is_open_widechararray(rd) or
  1416. is_pwidechar(ld) or is_widechararray(ld) or is_widechar(ld) or is_open_widechararray(ld) then
  1417. strtype:=st_widestring
  1418. else
  1419. if is_ansistring(rd) or is_ansistring(ld) or
  1420. ((cs_ansistrings in current_settings.localswitches) and
  1421. //todo: Move some of this to longstring's then they are implemented?
  1422. (
  1423. is_pchar(rd) or (is_chararray(rd) and (rd.size > 255)) or is_open_chararray(rd) or (lt = stringconstn) or
  1424. is_pchar(ld) or (is_chararray(ld) and (ld.size > 255)) or is_open_chararray(ld) or (rt = stringconstn)
  1425. )
  1426. ) then
  1427. strtype:=st_ansistring
  1428. else
  1429. if is_longstring(rd) or is_longstring(ld) then
  1430. strtype:=st_longstring
  1431. else
  1432. begin
  1433. { TODO: todo: add a warning/hint here if one converting a too large array}
  1434. { nodes is PChar, array [with size > 255] or OpenArrayOfChar.
  1435. Note: Delphi halts with error if "array [0..xx] of char"
  1436. is assigned to ShortString and string length is less
  1437. then array size }
  1438. strtype:= st_shortstring;
  1439. end;
  1440. // Now convert nodes to common string type
  1441. case strtype of
  1442. st_widestring :
  1443. begin
  1444. if not(is_widestring(rd)) then
  1445. inserttypeconv(right,cwidestringtype);
  1446. if not(is_widestring(ld)) then
  1447. inserttypeconv(left,cwidestringtype);
  1448. end;
  1449. st_unicodestring :
  1450. begin
  1451. if not(is_unicodestring(rd)) then
  1452. inserttypeconv(right,cunicodestringtype);
  1453. if not(is_unicodestring(ld)) then
  1454. inserttypeconv(left,cunicodestringtype);
  1455. end;
  1456. st_ansistring :
  1457. begin
  1458. if not(is_ansistring(rd)) then
  1459. inserttypeconv(right,cansistringtype);
  1460. if not(is_ansistring(ld)) then
  1461. inserttypeconv(left,cansistringtype);
  1462. end;
  1463. st_longstring :
  1464. begin
  1465. if not(is_longstring(rd)) then
  1466. inserttypeconv(right,clongstringtype);
  1467. if not(is_longstring(ld)) then
  1468. inserttypeconv(left,clongstringtype);
  1469. end;
  1470. st_shortstring :
  1471. begin
  1472. if not(is_shortstring(ld)) then
  1473. inserttypeconv(left,cshortstringtype);
  1474. { don't convert char, that can be handled by the optimized node }
  1475. if not(is_shortstring(rd) or is_char(rd)) then
  1476. inserttypeconv(right,cshortstringtype);
  1477. end;
  1478. else
  1479. internalerror(2005101);
  1480. end;
  1481. end
  1482. else
  1483. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1484. end
  1485. { class or interface equation }
  1486. else if is_class_or_interface(rd) or is_class_or_interface(ld) then
  1487. begin
  1488. if (nodetype in [equaln,unequaln]) then
  1489. begin
  1490. if is_class_or_interface(rd) and is_class_or_interface(ld) then
  1491. begin
  1492. if tobjectdef(rd).is_related(tobjectdef(ld)) then
  1493. inserttypeconv(right,left.resultdef)
  1494. else
  1495. inserttypeconv(left,right.resultdef);
  1496. end
  1497. else if is_class_or_interface(rd) then
  1498. inserttypeconv(left,right.resultdef)
  1499. else
  1500. inserttypeconv(right,left.resultdef);
  1501. end
  1502. else
  1503. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1504. end
  1505. else if (rd.typ=classrefdef) and (ld.typ=classrefdef) then
  1506. begin
  1507. if (nodetype in [equaln,unequaln]) then
  1508. begin
  1509. if tobjectdef(tclassrefdef(rd).pointeddef).is_related(
  1510. tobjectdef(tclassrefdef(ld).pointeddef)) then
  1511. inserttypeconv(right,left.resultdef)
  1512. else
  1513. inserttypeconv(left,right.resultdef);
  1514. end
  1515. else
  1516. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1517. end
  1518. { allows comperasion with nil pointer }
  1519. else if is_class_or_interface(rd) or (rd.typ=classrefdef) then
  1520. begin
  1521. if (nodetype in [equaln,unequaln]) then
  1522. inserttypeconv(left,right.resultdef)
  1523. else
  1524. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1525. end
  1526. else if is_class_or_interface(ld) or (ld.typ=classrefdef) then
  1527. begin
  1528. if (nodetype in [equaln,unequaln]) then
  1529. inserttypeconv(right,left.resultdef)
  1530. else
  1531. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1532. end
  1533. { support procvar=nil,procvar<>nil }
  1534. else if ((ld.typ=procvardef) and (rt=niln)) or
  1535. ((rd.typ=procvardef) and (lt=niln)) then
  1536. begin
  1537. if not(nodetype in [equaln,unequaln]) then
  1538. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1539. { find proc field in methodpointer record }
  1540. hsym:=tfieldvarsym(trecorddef(methodpointertype).symtable.Find('proc'));
  1541. if not assigned(hsym) then
  1542. internalerror(200412043);
  1543. { For methodpointers compare only tmethodpointer.proc }
  1544. if (rd.typ=procvardef) and
  1545. (not tprocvardef(rd).is_addressonly) then
  1546. begin
  1547. right:=csubscriptnode.create(
  1548. hsym,
  1549. ctypeconvnode.create_internal(right,methodpointertype));
  1550. typecheckpass(right);
  1551. end;
  1552. if (ld.typ=procvardef) and
  1553. (not tprocvardef(ld).is_addressonly) then
  1554. begin
  1555. left:=csubscriptnode.create(
  1556. hsym,
  1557. ctypeconvnode.create_internal(left,methodpointertype));
  1558. typecheckpass(left);
  1559. end;
  1560. end
  1561. { support dynamicarray=nil,dynamicarray<>nil }
  1562. else if (is_dynamic_array(ld) and (rt=niln)) or
  1563. (is_dynamic_array(rd) and (lt=niln)) or
  1564. (is_dynamic_array(ld) and is_dynamic_array(rd)) then
  1565. begin
  1566. if not(nodetype in [equaln,unequaln]) then
  1567. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1568. end
  1569. {$ifdef SUPPORT_MMX}
  1570. { mmx support, this must be before the zero based array
  1571. check }
  1572. else if (cs_mmx in current_settings.localswitches) and
  1573. is_mmx_able_array(ld) and
  1574. is_mmx_able_array(rd) and
  1575. equal_defs(ld,rd) then
  1576. begin
  1577. case nodetype of
  1578. addn,subn,xorn,orn,andn:
  1579. ;
  1580. { mul is a little bit restricted }
  1581. muln:
  1582. if not(mmx_type(ld) in [mmxu16bit,mmxs16bit,mmxfixed16]) then
  1583. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1584. else
  1585. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1586. end;
  1587. end
  1588. {$endif SUPPORT_MMX}
  1589. { vector support, this must be before the zero based array
  1590. check }
  1591. else if (cs_support_vectors in current_settings.globalswitches) and
  1592. is_vector(ld) and
  1593. is_vector(rd) and
  1594. equal_defs(ld,rd) then
  1595. begin
  1596. if not(nodetype in [addn,subn,xorn,orn,andn,muln,slashn]) then
  1597. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1598. { both defs must be equal, so taking left or right as resultdef doesn't matter }
  1599. resultdef:=left.resultdef;
  1600. end
  1601. { this is a little bit dangerous, also the left type }
  1602. { pointer to should be checked! This broke the mmx support }
  1603. else if (rd.typ=pointerdef) or
  1604. (is_zero_based_array(rd) and (rt<>stringconstn)) then
  1605. begin
  1606. if is_zero_based_array(rd) then
  1607. begin
  1608. resultdef:=tpointerdef.create(tarraydef(rd).elementdef);
  1609. inserttypeconv(right,resultdef);
  1610. end
  1611. else
  1612. resultdef:=right.resultdef;
  1613. inserttypeconv(left,sinttype);
  1614. if nodetype=addn then
  1615. begin
  1616. if not(cs_extsyntax in current_settings.moduleswitches) or
  1617. (not(is_pchar(ld)) and not(m_add_pointer in current_settings.modeswitches)) then
  1618. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1619. if (rd.typ=pointerdef) and
  1620. (tpointerdef(rd).pointeddef.size>1) then
  1621. begin
  1622. left:=caddnode.create(muln,left,
  1623. cordconstnode.create(tpointerdef(rd).pointeddef.size,sinttype,true));
  1624. typecheckpass(left);
  1625. end;
  1626. end
  1627. else
  1628. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1629. end
  1630. else if (ld.typ=pointerdef) or
  1631. (is_zero_based_array(ld) and (lt<>stringconstn)) then
  1632. begin
  1633. if is_zero_based_array(ld) then
  1634. begin
  1635. resultdef:=tpointerdef.create(tarraydef(ld).elementdef);
  1636. inserttypeconv(left,resultdef);
  1637. end
  1638. else
  1639. resultdef:=left.resultdef;
  1640. inserttypeconv(right,sinttype);
  1641. if nodetype in [addn,subn] then
  1642. begin
  1643. if (lt=niln) then
  1644. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),'NIL',rd.typename);
  1645. if not(cs_extsyntax in current_settings.moduleswitches) or
  1646. (not(is_pchar(ld)) and not(m_add_pointer in current_settings.modeswitches)) then
  1647. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1648. if (ld.typ=pointerdef) then
  1649. begin
  1650. if is_big_untyped_addrnode(left) then
  1651. CGMessage1(type_w_untyped_arithmetic_unportable,node2opstr(nodetype));
  1652. if (tpointerdef(ld).pointeddef.size>1) then
  1653. begin
  1654. right:=caddnode.create(muln,right,
  1655. cordconstnode.create(tpointerdef(ld).pointeddef.size,sinttype,true));
  1656. typecheckpass(right);
  1657. end
  1658. end else
  1659. if is_zero_based_array(ld) and
  1660. (tarraydef(ld).elementdef.size>1) then
  1661. begin
  1662. right:=caddnode.create(muln,right,
  1663. cordconstnode.create(tarraydef(ld).elementdef.size,sinttype,true));
  1664. typecheckpass(right);
  1665. end;
  1666. end
  1667. else
  1668. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1669. end
  1670. else if (rd.typ=procvardef) and
  1671. (ld.typ=procvardef) and
  1672. equal_defs(rd,ld) then
  1673. begin
  1674. if (nodetype in [equaln,unequaln]) then
  1675. begin
  1676. if tprocvardef(rd).is_addressonly then
  1677. begin
  1678. inserttypeconv_internal(right,voidpointertype);
  1679. inserttypeconv_internal(left,voidpointertype);
  1680. end
  1681. else
  1682. begin
  1683. { find proc field in methodpointer record }
  1684. hsym:=tfieldvarsym(trecorddef(methodpointertype).symtable.Find('proc'));
  1685. if not assigned(hsym) then
  1686. internalerror(200412043);
  1687. { Compare tmehodpointer(left).proc }
  1688. right:=csubscriptnode.create(
  1689. hsym,
  1690. ctypeconvnode.create_internal(right,methodpointertype));
  1691. typecheckpass(right);
  1692. left:=csubscriptnode.create(
  1693. hsym,
  1694. ctypeconvnode.create_internal(left,methodpointertype));
  1695. typecheckpass(left);
  1696. end;
  1697. end
  1698. else
  1699. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1700. end
  1701. { enums }
  1702. else if (ld.typ=enumdef) and (rd.typ=enumdef) then
  1703. begin
  1704. if allowenumop(nodetype) then
  1705. inserttypeconv(right,left.resultdef)
  1706. else
  1707. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1708. end
  1709. { generic conversion, this is for error recovery }
  1710. else
  1711. begin
  1712. inserttypeconv(left,sinttype);
  1713. inserttypeconv(right,sinttype);
  1714. end;
  1715. { set resultdef if not already done }
  1716. if not assigned(resultdef) then
  1717. begin
  1718. case nodetype of
  1719. ltn,lten,gtn,gten,equaln,unequaln :
  1720. resultdef:=booltype;
  1721. slashn :
  1722. resultdef:=resultrealdef;
  1723. addn:
  1724. begin
  1725. { for strings, return is always a 255 char string }
  1726. if is_shortstring(left.resultdef) then
  1727. resultdef:=cshortstringtype
  1728. else
  1729. resultdef:=left.resultdef;
  1730. end;
  1731. else
  1732. resultdef:=left.resultdef;
  1733. end;
  1734. end;
  1735. { when the result is currency we need some extra code for
  1736. multiplication and division. this should not be done when
  1737. the muln or slashn node is created internally }
  1738. if not(nf_is_currency in flags) and
  1739. is_currency(resultdef) then
  1740. begin
  1741. case nodetype of
  1742. slashn :
  1743. begin
  1744. { slashn will only work with floats }
  1745. hp:=caddnode.create(muln,getcopy,crealconstnode.create(10000.0,s64currencytype));
  1746. include(hp.flags,nf_is_currency);
  1747. result:=hp;
  1748. end;
  1749. muln :
  1750. begin
  1751. if s64currencytype.typ=floatdef then
  1752. hp:=caddnode.create(slashn,getcopy,crealconstnode.create(10000.0,s64currencytype))
  1753. else
  1754. hp:=cmoddivnode.create(divn,getcopy,cordconstnode.create(10000,s64currencytype,false));
  1755. include(hp.flags,nf_is_currency);
  1756. result:=hp
  1757. end;
  1758. end;
  1759. end;
  1760. if not codegenerror and
  1761. not assigned(result) then
  1762. result:=simplify;
  1763. end;
  1764. function taddnode.first_addstring: tnode;
  1765. const
  1766. swap_relation: array [ltn..unequaln] of Tnodetype=(gtn, gten, ltn, lten, equaln, unequaln);
  1767. var
  1768. p: tnode;
  1769. newstatement : tstatementnode;
  1770. tempnode (*,tempnode2*) : ttempcreatenode;
  1771. cmpfuncname: string;
  1772. begin
  1773. { when we get here, we are sure that both the left and the right }
  1774. { node are both strings of the same stringtype (JM) }
  1775. case nodetype of
  1776. addn:
  1777. begin
  1778. if (left.nodetype=stringconstn) and (tstringconstnode(left).len=0) then
  1779. begin
  1780. result:=right;
  1781. left.free;
  1782. left:=nil;
  1783. right:=nil;
  1784. exit;
  1785. end;
  1786. if (right.nodetype=stringconstn) and (tstringconstnode(right).len=0) then
  1787. begin
  1788. result:=left;
  1789. left:=nil;
  1790. right.free;
  1791. right:=nil;
  1792. exit;
  1793. end;
  1794. { create the call to the concat routine both strings as arguments }
  1795. if assigned(aktassignmentnode) and
  1796. (aktassignmentnode.right=self) and
  1797. (aktassignmentnode.left.resultdef=resultdef) and
  1798. valid_for_var(aktassignmentnode.left,false) then
  1799. begin
  1800. result:=ccallnode.createintern('fpc_'+
  1801. tstringdef(resultdef).stringtypname+'_concat',
  1802. ccallparanode.create(right,
  1803. ccallparanode.create(left,
  1804. ccallparanode.create(aktassignmentnode.left.getcopy,nil))));
  1805. include(aktassignmentnode.flags,nf_assign_done_in_right);
  1806. firstpass(result);
  1807. end
  1808. else
  1809. begin
  1810. result:=internalstatements(newstatement);
  1811. tempnode:=ctempcreatenode.create(resultdef,resultdef.size,tt_persistent,true);
  1812. addstatement(newstatement,tempnode);
  1813. addstatement(newstatement,ccallnode.createintern('fpc_'+
  1814. tstringdef(resultdef).stringtypname+'_concat',
  1815. ccallparanode.create(right,
  1816. ccallparanode.create(left,
  1817. ccallparanode.create(ctemprefnode.create(tempnode),nil)))));
  1818. addstatement(newstatement,ctempdeletenode.create_normal_temp(tempnode));
  1819. addstatement(newstatement,ctemprefnode.create(tempnode));
  1820. end;
  1821. { we reused the arguments }
  1822. left := nil;
  1823. right := nil;
  1824. end;
  1825. ltn,lten,gtn,gten,equaln,unequaln :
  1826. begin
  1827. { generate better code for comparison with empty string, we
  1828. only need to compare the length with 0 }
  1829. if (nodetype in [equaln,unequaln,gtn,gten,ltn,lten]) and
  1830. { windows widestrings are too complicated to be handled optimized }
  1831. not(is_widestring(left.resultdef) and (target_info.system in system_windows)) and
  1832. (((left.nodetype=stringconstn) and (tstringconstnode(left).len=0)) or
  1833. ((right.nodetype=stringconstn) and (tstringconstnode(right).len=0))) then
  1834. begin
  1835. { switch so that the constant is always on the right }
  1836. if left.nodetype = stringconstn then
  1837. begin
  1838. p := left;
  1839. left := right;
  1840. right := p;
  1841. nodetype:=swap_relation[nodetype];
  1842. end;
  1843. if is_shortstring(left.resultdef) or
  1844. (nodetype in [gtn,gten,ltn,lten]) then
  1845. { compare the length with 0 }
  1846. result := caddnode.create(nodetype,
  1847. cinlinenode.create(in_length_x,false,left),
  1848. cordconstnode.create(0,s32inttype,false))
  1849. else
  1850. begin
  1851. (*
  1852. if is_widestring(left.resultdef) and
  1853. (target_info.system in system_windows) then
  1854. begin
  1855. { windows like widestrings requires that we also check the length }
  1856. result:=internalstatements(newstatement);
  1857. tempnode:=ctempcreatenode.create(voidpointertype,voidpointertype.size,tt_persistent,true);
  1858. tempnode2:=ctempcreatenode.create(resultdef,resultdef.size,tt_persistent,true);
  1859. addstatement(newstatement,tempnode);
  1860. addstatement(newstatement,tempnode2);
  1861. { poor man's cse }
  1862. addstatement(newstatement,cassignmentnode.create(ctemprefnode.create(tempnode),
  1863. ctypeconvnode.create_internal(left,voidpointertype))
  1864. );
  1865. addstatement(newstatement,cassignmentnode.create(ctemprefnode.create(tempnode2),
  1866. caddnode.create(orn,
  1867. caddnode.create(nodetype,
  1868. ctemprefnode.create(tempnode),
  1869. cpointerconstnode.create(0,voidpointertype)
  1870. ),
  1871. caddnode.create(nodetype,
  1872. ctypeconvnode.create_internal(cderefnode.create(ctemprefnode.create(tempnode)),s32inttype),
  1873. cordconstnode.create(0,s32inttype,false)
  1874. )
  1875. )
  1876. ));
  1877. addstatement(newstatement,ctempdeletenode.create_normal_temp(tempnode));
  1878. addstatement(newstatement,ctempdeletenode.create_normal_temp(tempnode2));
  1879. addstatement(newstatement,ctemprefnode.create(tempnode2));
  1880. end
  1881. else
  1882. *)
  1883. begin
  1884. { compare the pointer with nil (for ansistrings etc), }
  1885. { faster than getting the length (JM) }
  1886. result:= caddnode.create(nodetype,
  1887. ctypeconvnode.create_internal(left,voidpointertype),
  1888. cpointerconstnode.create(0,voidpointertype));
  1889. end;
  1890. end;
  1891. { left is reused }
  1892. left := nil;
  1893. { right isn't }
  1894. right.free;
  1895. right := nil;
  1896. exit;
  1897. end;
  1898. { no string constant -> call compare routine }
  1899. cmpfuncname := 'fpc_'+tstringdef(left.resultdef).stringtypname+'_compare';
  1900. { for equality checks use optimized version }
  1901. if nodetype in [equaln,unequaln] then
  1902. cmpfuncname := cmpfuncname + '_equal';
  1903. result := ccallnode.createintern(cmpfuncname,
  1904. ccallparanode.create(right,ccallparanode.create(left,nil)));
  1905. { and compare its result with 0 according to the original operator }
  1906. result := caddnode.create(nodetype,result,
  1907. cordconstnode.create(0,s32inttype,false));
  1908. left := nil;
  1909. right := nil;
  1910. end;
  1911. end;
  1912. end;
  1913. function taddnode.first_addset : tnode;
  1914. procedure call_varset_helper(const n : string);
  1915. var
  1916. newstatement : tstatementnode;
  1917. temp : ttempcreatenode;
  1918. begin
  1919. { add two var sets }
  1920. result:=internalstatements(newstatement);
  1921. { create temp for result }
  1922. temp:=ctempcreatenode.create(resultdef,resultdef.size,tt_persistent,true);
  1923. addstatement(newstatement,temp);
  1924. addstatement(newstatement,ccallnode.createintern(n,
  1925. ccallparanode.create(cordconstnode.create(resultdef.size,sinttype,false),
  1926. ccallparanode.create(ctemprefnode.create(temp),
  1927. ccallparanode.create(right,
  1928. ccallparanode.create(left,nil)))))
  1929. );
  1930. { remove reused parts from original node }
  1931. left:=nil;
  1932. right:=nil;
  1933. { the last statement should return the value as
  1934. location and type, this is done be referencing the
  1935. temp and converting it first from a persistent temp to
  1936. normal temp }
  1937. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  1938. addstatement(newstatement,ctemprefnode.create(temp));
  1939. end;
  1940. var
  1941. procname: string[31];
  1942. tempn: tnode;
  1943. newstatement : tstatementnode;
  1944. temp : ttempcreatenode;
  1945. begin
  1946. result:=nil;
  1947. case nodetype of
  1948. equaln,unequaln,lten,gten:
  1949. begin
  1950. case nodetype of
  1951. equaln,unequaln:
  1952. procname := 'fpc_varset_comp_sets';
  1953. lten,gten:
  1954. begin
  1955. procname := 'fpc_varset_contains_sets';
  1956. { (left >= right) = (right <= left) }
  1957. if nodetype = gten then
  1958. begin
  1959. tempn := left;
  1960. left := right;
  1961. right := tempn;
  1962. end;
  1963. end;
  1964. end;
  1965. result := ccallnode.createinternres(procname,
  1966. ccallparanode.create(cordconstnode.create(left.resultdef.size,sinttype,false),
  1967. ccallparanode.create(right,
  1968. ccallparanode.create(left,nil))),resultdef);
  1969. { left and right are reused as parameters }
  1970. left := nil;
  1971. right := nil;
  1972. { for an unequaln, we have to negate the result of comp_sets }
  1973. if nodetype = unequaln then
  1974. result := cnotnode.create(result);
  1975. end;
  1976. addn:
  1977. begin
  1978. { optimize first loading of a set }
  1979. if (right.nodetype=setelementn) and
  1980. not(assigned(tsetelementnode(right).right)) and
  1981. is_emptyset(left) then
  1982. begin
  1983. result:=internalstatements(newstatement);
  1984. { create temp for result }
  1985. temp:=ctempcreatenode.create(resultdef,resultdef.size,tt_persistent,true);
  1986. addstatement(newstatement,temp);
  1987. { adjust for set base }
  1988. tsetelementnode(right).left:=caddnode.create(subn,
  1989. ctypeconvnode.create_internal(tsetelementnode(right).left,sinttype),
  1990. cordconstnode.create(tsetdef(resultdef).setbase,sinttype,false));
  1991. addstatement(newstatement,ccallnode.createintern('fpc_varset_create_element',
  1992. ccallparanode.create(ctemprefnode.create(temp),
  1993. ccallparanode.create(cordconstnode.create(resultdef.size,sinttype,false),
  1994. ccallparanode.create(tsetelementnode(right).left,nil))))
  1995. );
  1996. { the last statement should return the value as
  1997. location and type, this is done be referencing the
  1998. temp and converting it first from a persistent temp to
  1999. normal temp }
  2000. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  2001. addstatement(newstatement,ctemprefnode.create(temp));
  2002. tsetelementnode(right).left := nil;
  2003. end
  2004. else
  2005. begin
  2006. if right.nodetype=setelementn then
  2007. begin
  2008. result:=internalstatements(newstatement);
  2009. { create temp for result }
  2010. temp:=ctempcreatenode.create(resultdef,resultdef.size,tt_persistent,true);
  2011. addstatement(newstatement,temp);
  2012. { adjust for set base }
  2013. tsetelementnode(right).left:=caddnode.create(subn,
  2014. ctypeconvnode.create_internal(tsetelementnode(right).left,sinttype),
  2015. cordconstnode.create(tsetdef(resultdef).setbase,sinttype,false));
  2016. { add a range or a single element? }
  2017. if assigned(tsetelementnode(right).right) then
  2018. begin
  2019. { adjust for set base }
  2020. tsetelementnode(right).right:=caddnode.create(subn,
  2021. ctypeconvnode.create_internal(tsetelementnode(right).right,sinttype),
  2022. cordconstnode.create(tsetdef(resultdef).setbase,sinttype,false));
  2023. addstatement(newstatement,ccallnode.createintern('fpc_varset_set_range',
  2024. ccallparanode.create(cordconstnode.create(resultdef.size,sinttype,false),
  2025. ccallparanode.create(tsetelementnode(right).right,
  2026. ccallparanode.create(tsetelementnode(right).left,
  2027. ccallparanode.create(ctemprefnode.create(temp),
  2028. ccallparanode.create(left,nil))))))
  2029. );
  2030. end
  2031. else
  2032. addstatement(newstatement,ccallnode.createintern('fpc_varset_set',
  2033. ccallparanode.create(cordconstnode.create(resultdef.size,sinttype,false),
  2034. ccallparanode.create(ctypeconvnode.create_internal(tsetelementnode(right).left,sinttype),
  2035. ccallparanode.create(ctemprefnode.create(temp),
  2036. ccallparanode.create(left,nil)))))
  2037. );
  2038. { remove reused parts from original node }
  2039. tsetelementnode(right).right:=nil;
  2040. tsetelementnode(right).left:=nil;
  2041. left:=nil;
  2042. { the last statement should return the value as
  2043. location and type, this is done be referencing the
  2044. temp and converting it first from a persistent temp to
  2045. normal temp }
  2046. addstatement(newstatement,ctempdeletenode.create_normal_temp(temp));
  2047. addstatement(newstatement,ctemprefnode.create(temp));
  2048. end
  2049. else
  2050. call_varset_helper('fpc_varset_add_sets');
  2051. end
  2052. end;
  2053. subn:
  2054. call_varset_helper('fpc_varset_sub_sets');
  2055. symdifn:
  2056. call_varset_helper('fpc_varset_symdif_sets');
  2057. muln:
  2058. call_varset_helper('fpc_varset_mul_sets');
  2059. else
  2060. internalerror(200609241);
  2061. end;
  2062. end;
  2063. function taddnode.use_generic_mul32to64: boolean;
  2064. begin
  2065. result := true;
  2066. end;
  2067. function taddnode.try_make_mul32to64: boolean;
  2068. function canbe32bitint(v: tconstexprint): boolean;
  2069. begin
  2070. result := ((v >= int64(low(longint))) and (v <= int64(high(longint)))) or
  2071. ((v >= qword(low(cardinal))) and (v <= qword(high(cardinal))))
  2072. end;
  2073. var
  2074. temp: tnode;
  2075. begin
  2076. result := false;
  2077. if ((left.nodetype = typeconvn) and
  2078. is_integer(ttypeconvnode(left).left.resultdef) and
  2079. (not(torddef(ttypeconvnode(left).left.resultdef).ordtype in [u64bit,s64bit])) and
  2080. (((right.nodetype = ordconstn) and canbe32bitint(tordconstnode(right).value)) or
  2081. ((right.nodetype = typeconvn) and
  2082. is_integer(ttypeconvnode(right).left.resultdef) and
  2083. not(torddef(ttypeconvnode(right).left.resultdef).ordtype in [u64bit,s64bit])) and
  2084. ((is_signed(ttypeconvnode(left).left.resultdef) =
  2085. is_signed(ttypeconvnode(right).left.resultdef)) or
  2086. (is_signed(ttypeconvnode(left).left.resultdef) and
  2087. (torddef(ttypeconvnode(right).left.resultdef).ordtype in [u8bit,u16bit]))))) then
  2088. begin
  2089. temp := ttypeconvnode(left).left;
  2090. ttypeconvnode(left).left := nil;
  2091. left.free;
  2092. left := temp;
  2093. if (right.nodetype = typeconvn) then
  2094. begin
  2095. temp := ttypeconvnode(right).left;
  2096. ttypeconvnode(right).left := nil;
  2097. right.free;
  2098. right := temp;
  2099. end;
  2100. if (is_signed(left.resultdef)) then
  2101. begin
  2102. inserttypeconv(left,s32inttype);
  2103. inserttypeconv(right,s32inttype);
  2104. end
  2105. else
  2106. begin
  2107. inserttypeconv(left,u32inttype);
  2108. inserttypeconv(right,u32inttype);
  2109. end;
  2110. firstpass(left);
  2111. firstpass(right);
  2112. result := true;
  2113. end;
  2114. end;
  2115. function taddnode.first_add64bitint: tnode;
  2116. var
  2117. procname: string[31];
  2118. temp: tnode;
  2119. power: longint;
  2120. begin
  2121. result := nil;
  2122. { create helper calls mul }
  2123. if nodetype <> muln then
  2124. exit;
  2125. { make sure that if there is a constant, that it's on the right }
  2126. if left.nodetype = ordconstn then
  2127. begin
  2128. temp := right;
  2129. right := left;
  2130. left := temp;
  2131. end;
  2132. { can we use a shift instead of a mul? }
  2133. if not (cs_check_overflow in current_settings.localswitches) and
  2134. (right.nodetype = ordconstn) and
  2135. ispowerof2(tordconstnode(right).value,power) then
  2136. begin
  2137. tordconstnode(right).value := power;
  2138. result := cshlshrnode.create(shln,left,right);
  2139. { left and right are reused }
  2140. left := nil;
  2141. right := nil;
  2142. { return firstpassed new node }
  2143. exit;
  2144. end;
  2145. if not(use_generic_mul32to64) and
  2146. try_make_mul32to64 then
  2147. exit;
  2148. { when currency is used set the result of the
  2149. parameters to s64bit, so they are not converted }
  2150. if is_currency(resultdef) then
  2151. begin
  2152. left.resultdef:=s64inttype;
  2153. right.resultdef:=s64inttype;
  2154. end;
  2155. { otherwise, create the parameters for the helper }
  2156. right := ccallparanode.create(
  2157. cordconstnode.create(ord(cs_check_overflow in current_settings.localswitches),booltype,true),
  2158. ccallparanode.create(right,ccallparanode.create(left,nil)));
  2159. left := nil;
  2160. { only qword needs the unsigned code, the
  2161. signed code is also used for currency }
  2162. if is_signed(resultdef) then
  2163. procname := 'fpc_mul_int64'
  2164. else
  2165. procname := 'fpc_mul_qword';
  2166. result := ccallnode.createintern(procname,right);
  2167. right := nil;
  2168. end;
  2169. function taddnode.first_addfloat : tnode;
  2170. var
  2171. procname: string[31];
  2172. { do we need to reverse the result ? }
  2173. notnode : boolean;
  2174. fdef : tdef;
  2175. begin
  2176. result := nil;
  2177. notnode := false;
  2178. { In non-emulation mode, real opcodes are
  2179. emitted for floating point values.
  2180. }
  2181. if not (cs_fp_emulation in current_settings.moduleswitches) then
  2182. exit;
  2183. if not(target_info.system in system_wince) then
  2184. begin
  2185. case tfloatdef(left.resultdef).floattype of
  2186. s32real:
  2187. begin
  2188. fdef:=search_system_type('FLOAT32REC').typedef;
  2189. procname:='float32';
  2190. end;
  2191. s64real:
  2192. begin
  2193. fdef:=search_system_type('FLOAT64').typedef;
  2194. procname:='float64';
  2195. end;
  2196. {!!! not yet implemented
  2197. s128real:
  2198. }
  2199. else
  2200. internalerror(2005082601);
  2201. end;
  2202. case nodetype of
  2203. addn:
  2204. procname:=procname+'_add';
  2205. muln:
  2206. procname:=procname+'_mul';
  2207. subn:
  2208. procname:=procname+'_sub';
  2209. slashn:
  2210. procname:=procname+'_div';
  2211. ltn:
  2212. procname:=procname+'_lt';
  2213. lten:
  2214. procname:=procname+'_le';
  2215. gtn:
  2216. begin
  2217. procname:=procname+'_le';
  2218. notnode:=true;
  2219. end;
  2220. gten:
  2221. begin
  2222. procname:=procname+'_lt';
  2223. notnode:=true;
  2224. end;
  2225. equaln:
  2226. procname:=procname+'_eq';
  2227. unequaln:
  2228. begin
  2229. procname:=procname+'_eq';
  2230. notnode:=true;
  2231. end;
  2232. else
  2233. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),left.resultdef.typename,right.resultdef.typename);
  2234. end;
  2235. end
  2236. else
  2237. begin
  2238. case nodetype of
  2239. addn:
  2240. procname:='ADD';
  2241. muln:
  2242. procname:='MUL';
  2243. subn:
  2244. procname:='SUB';
  2245. slashn:
  2246. procname:='DIV';
  2247. ltn:
  2248. procname:='LT';
  2249. lten:
  2250. procname:='LE';
  2251. gtn:
  2252. procname:='GT';
  2253. gten:
  2254. procname:='GE';
  2255. equaln:
  2256. procname:='EQ';
  2257. unequaln:
  2258. procname:='NE';
  2259. else
  2260. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),left.resultdef.typename,right.resultdef.typename);
  2261. end;
  2262. case tfloatdef(left.resultdef).floattype of
  2263. s32real:
  2264. begin
  2265. procname:=procname+'S';
  2266. if nodetype in [addn,muln,subn,slashn] then
  2267. procname:=lower(procname);
  2268. end;
  2269. s64real:
  2270. procname:=procname+'D';
  2271. {!!! not yet implemented
  2272. s128real:
  2273. }
  2274. else
  2275. internalerror(2005082602);
  2276. end;
  2277. end;
  2278. { cast softfpu result? }
  2279. if not(target_info.system in system_wince) then
  2280. begin
  2281. if nodetype in [ltn,lten,gtn,gten,equaln,unequaln] then
  2282. resultdef:=booltype;
  2283. result:=ctypeconvnode.create_internal(ccallnode.createintern(procname,ccallparanode.create(
  2284. ctypeconvnode.create_internal(right,fdef),
  2285. ccallparanode.create(
  2286. ctypeconvnode.create_internal(left,fdef),nil))),resultdef);
  2287. end
  2288. else
  2289. result:=ccallnode.createintern(procname,ccallparanode.create(right,
  2290. ccallparanode.create(left,nil)));
  2291. left:=nil;
  2292. right:=nil;
  2293. { do we need to reverse the result }
  2294. if notnode then
  2295. result:=cnotnode.create(result);
  2296. end;
  2297. function taddnode.pass_1 : tnode;
  2298. var
  2299. {$ifdef addstringopt}
  2300. hp : tnode;
  2301. {$endif addstringopt}
  2302. rd,ld : tdef;
  2303. i : longint;
  2304. lt,rt : tnodetype;
  2305. begin
  2306. result:=nil;
  2307. { Can we optimize multiple string additions into a single call?
  2308. This need to be done on a complete tree to detect the multiple
  2309. add nodes and is therefor done before the subtrees are processed }
  2310. if canbemultistringadd(self) then
  2311. begin
  2312. result := genmultistringadd(self);
  2313. exit;
  2314. end;
  2315. { first do the two subtrees }
  2316. firstpass(left);
  2317. firstpass(right);
  2318. if codegenerror then
  2319. exit;
  2320. { load easier access variables }
  2321. rd:=right.resultdef;
  2322. ld:=left.resultdef;
  2323. rt:=right.nodetype;
  2324. lt:=left.nodetype;
  2325. { int/int gives real/real! }
  2326. if nodetype=slashn then
  2327. begin
  2328. {$ifdef cpufpemu}
  2329. if (current_settings.fputype=fpu_soft) or (cs_fp_emulation in current_settings.moduleswitches) then
  2330. begin
  2331. result:=first_addfloat;
  2332. if assigned(result) then
  2333. exit;
  2334. end;
  2335. {$endif cpufpemu}
  2336. expectloc:=LOC_FPUREGISTER;
  2337. end
  2338. { if both are orddefs then check sub types }
  2339. else if (ld.typ=orddef) and (rd.typ=orddef) then
  2340. begin
  2341. { optimize multiplacation by a power of 2 }
  2342. if not(cs_check_overflow in current_settings.localswitches) and
  2343. (nodetype = muln) and
  2344. (((left.nodetype = ordconstn) and
  2345. ispowerof2(tordconstnode(left).value,i)) or
  2346. ((right.nodetype = ordconstn) and
  2347. ispowerof2(tordconstnode(right).value,i))) then
  2348. begin
  2349. if left.nodetype = ordconstn then
  2350. begin
  2351. tordconstnode(left).value := i;
  2352. result := cshlshrnode.create(shln,right,left);
  2353. end
  2354. else
  2355. begin
  2356. tordconstnode(right).value := i;
  2357. result := cshlshrnode.create(shln,left,right);
  2358. end;
  2359. left := nil;
  2360. right := nil;
  2361. exit;
  2362. end;
  2363. { 2 booleans ? }
  2364. if is_boolean(ld) and is_boolean(rd) then
  2365. begin
  2366. if (not(cs_full_boolean_eval in current_settings.localswitches) or
  2367. (nf_short_bool in flags)) and
  2368. (nodetype in [andn,orn]) then
  2369. expectloc:=LOC_JUMP
  2370. else
  2371. begin
  2372. if nodetype in [ltn,lten,gtn,gten,equaln,unequaln] then
  2373. expectloc:=LOC_FLAGS
  2374. else
  2375. expectloc:=LOC_REGISTER;
  2376. end;
  2377. end
  2378. else
  2379. { Both are chars? only convert to shortstrings for addn }
  2380. if is_char(ld) then
  2381. begin
  2382. if nodetype=addn then
  2383. internalerror(200103291);
  2384. expectloc:=LOC_FLAGS;
  2385. end
  2386. {$ifndef cpu64bitaddr}
  2387. { is there a 64 bit type ? }
  2388. else if (torddef(ld).ordtype in [s64bit,u64bit,scurrency]) then
  2389. begin
  2390. result := first_add64bitint;
  2391. if assigned(result) then
  2392. exit;
  2393. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2394. expectloc:=LOC_REGISTER
  2395. else
  2396. expectloc:=LOC_JUMP;
  2397. end
  2398. {$endif cpu64bitaddr}
  2399. { is there a cardinal? }
  2400. else if (torddef(ld).ordtype=u32bit) then
  2401. begin
  2402. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2403. expectloc:=LOC_REGISTER
  2404. else
  2405. expectloc:=LOC_FLAGS;
  2406. end
  2407. { generic s32bit conversion }
  2408. else
  2409. begin
  2410. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2411. expectloc:=LOC_REGISTER
  2412. else
  2413. expectloc:=LOC_FLAGS;
  2414. end;
  2415. end
  2416. { left side a setdef, must be before string processing,
  2417. else array constructor can be seen as array of char (PFV) }
  2418. else if (ld.typ=setdef) then
  2419. begin
  2420. { small sets are handled inline by the compiler.
  2421. small set doesn't have support for adding ranges }
  2422. if is_smallset(ld) and
  2423. not(
  2424. (right.nodetype=setelementn) and
  2425. assigned(tsetelementnode(right).right)
  2426. ) then
  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. else
  2434. begin
  2435. result := first_addset;
  2436. if assigned(result) then
  2437. exit;
  2438. expectloc:=LOC_CREFERENCE;
  2439. end;
  2440. end
  2441. { compare pchar by addresses like BP/Delphi }
  2442. else if is_pchar(ld) then
  2443. begin
  2444. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2445. expectloc:=LOC_REGISTER
  2446. else
  2447. expectloc:=LOC_FLAGS;
  2448. end
  2449. { is one of the operands a string }
  2450. else if (ld.typ=stringdef) then
  2451. begin
  2452. if is_widestring(ld) then
  2453. begin
  2454. { this is only for add, the comparisaion is handled later }
  2455. expectloc:=LOC_REGISTER;
  2456. end
  2457. else if is_unicodestring(ld) then
  2458. begin
  2459. { this is only for add, the comparisaion is handled later }
  2460. expectloc:=LOC_REGISTER;
  2461. end
  2462. else if is_ansistring(ld) then
  2463. begin
  2464. { this is only for add, the comparisaion is handled later }
  2465. expectloc:=LOC_REGISTER;
  2466. end
  2467. else if is_longstring(ld) then
  2468. begin
  2469. { this is only for add, the comparisaion is handled later }
  2470. expectloc:=LOC_REFERENCE;
  2471. end
  2472. else
  2473. begin
  2474. {$ifdef addstringopt}
  2475. { can create a call which isn't handled by callparatemp }
  2476. if canbeaddsstringcharoptnode(self) then
  2477. begin
  2478. hp := genaddsstringcharoptnode(self);
  2479. pass_1 := hp;
  2480. exit;
  2481. end
  2482. else
  2483. {$endif addstringopt}
  2484. begin
  2485. { Fix right to be shortstring }
  2486. if is_char(right.resultdef) then
  2487. begin
  2488. inserttypeconv(right,cshortstringtype);
  2489. firstpass(right);
  2490. end;
  2491. end;
  2492. {$ifdef addstringopt}
  2493. { can create a call which isn't handled by callparatemp }
  2494. if canbeaddsstringcsstringoptnode(self) then
  2495. begin
  2496. hp := genaddsstringcsstringoptnode(self);
  2497. pass_1 := hp;
  2498. exit;
  2499. end;
  2500. {$endif addstringopt}
  2501. end;
  2502. { otherwise, let addstring convert everything }
  2503. result := first_addstring;
  2504. exit;
  2505. end
  2506. { is one a real float ? }
  2507. else if (rd.typ=floatdef) or (ld.typ=floatdef) then
  2508. begin
  2509. {$ifdef cpufpemu}
  2510. if (current_settings.fputype=fpu_soft) or (cs_fp_emulation in current_settings.moduleswitches) then
  2511. begin
  2512. result:=first_addfloat;
  2513. if assigned(result) then
  2514. exit;
  2515. end;
  2516. {$endif cpufpemu}
  2517. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2518. expectloc:=LOC_FPUREGISTER
  2519. else
  2520. expectloc:=LOC_FLAGS;
  2521. end
  2522. { pointer comperation and subtraction }
  2523. else if (ld.typ=pointerdef) then
  2524. begin
  2525. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2526. expectloc:=LOC_REGISTER
  2527. else
  2528. expectloc:=LOC_FLAGS;
  2529. end
  2530. else if is_class_or_interface(ld) then
  2531. begin
  2532. expectloc:=LOC_FLAGS;
  2533. end
  2534. else if (ld.typ=classrefdef) then
  2535. begin
  2536. expectloc:=LOC_FLAGS;
  2537. end
  2538. { support procvar=nil,procvar<>nil }
  2539. else if ((ld.typ=procvardef) and (rt=niln)) or
  2540. ((rd.typ=procvardef) and (lt=niln)) then
  2541. begin
  2542. expectloc:=LOC_FLAGS;
  2543. end
  2544. {$ifdef SUPPORT_MMX}
  2545. { mmx support, this must be before the zero based array
  2546. check }
  2547. else if (cs_mmx in current_settings.localswitches) and is_mmx_able_array(ld) and
  2548. is_mmx_able_array(rd) then
  2549. begin
  2550. expectloc:=LOC_MMXREGISTER;
  2551. end
  2552. {$endif SUPPORT_MMX}
  2553. else if (rd.typ=pointerdef) or (ld.typ=pointerdef) then
  2554. begin
  2555. expectloc:=LOC_REGISTER;
  2556. end
  2557. else if (rd.typ=procvardef) and
  2558. (ld.typ=procvardef) and
  2559. equal_defs(rd,ld) then
  2560. begin
  2561. expectloc:=LOC_FLAGS;
  2562. end
  2563. else if (ld.typ=enumdef) then
  2564. begin
  2565. expectloc:=LOC_FLAGS;
  2566. end
  2567. {$ifdef SUPPORT_MMX}
  2568. else if (cs_mmx in current_settings.localswitches) and
  2569. is_mmx_able_array(ld) and
  2570. is_mmx_able_array(rd) then
  2571. begin
  2572. expectloc:=LOC_MMXREGISTER;
  2573. end
  2574. {$endif SUPPORT_MMX}
  2575. { the general solution is to convert to 32 bit int }
  2576. else
  2577. begin
  2578. expectloc:=LOC_REGISTER;
  2579. end;
  2580. end;
  2581. {$ifdef state_tracking}
  2582. function Taddnode.track_state_pass(exec_known:boolean):boolean;
  2583. var factval:Tnode;
  2584. begin
  2585. track_state_pass:=false;
  2586. if left.track_state_pass(exec_known) then
  2587. begin
  2588. track_state_pass:=true;
  2589. left.resultdef:=nil;
  2590. do_typecheckpass(left);
  2591. end;
  2592. factval:=aktstate.find_fact(left);
  2593. if factval<>nil then
  2594. begin
  2595. track_state_pass:=true;
  2596. left.destroy;
  2597. left:=factval.getcopy;
  2598. end;
  2599. if right.track_state_pass(exec_known) then
  2600. begin
  2601. track_state_pass:=true;
  2602. right.resultdef:=nil;
  2603. do_typecheckpass(right);
  2604. end;
  2605. factval:=aktstate.find_fact(right);
  2606. if factval<>nil then
  2607. begin
  2608. track_state_pass:=true;
  2609. right.destroy;
  2610. right:=factval.getcopy;
  2611. end;
  2612. end;
  2613. {$endif}
  2614. begin
  2615. caddnode:=taddnode;
  2616. end.