nadd.pas 115 KB

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