nadd.pas 113 KB

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