2
0

nadd.pas 110 KB

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