nadd.pas 122 KB

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