nadd.pas 104 KB

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