nadd.pas 92 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378
  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. resultrealtype : ttype;
  26. constructor create(tt : tnodetype;l,r : tnode);override;
  27. function pass_1 : tnode;override;
  28. function det_resulttype: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 resulttype 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 MACOS_USE_FAKE_SYSUTILS}
  69. sysutils,
  70. {$ENDIF MACOS_USE_FAKE_SYSUTILS}
  71. globtype,systems,
  72. cutils,verbose,globals,widestr,
  73. symconst,symdef,symsym,symtable,defutil,defcmp,
  74. cgbase,
  75. htypechk,pass_1,
  76. nbas,nmat,ncnv,ncon,nset,nopt,ncal,ninl,nmem,nutils,
  77. {$ifdef state_tracking}
  78. nstate,
  79. {$endif}
  80. cpuinfo,procinfo;
  81. {*****************************************************************************
  82. TADDNODE
  83. *****************************************************************************}
  84. {$ifdef fpc}
  85. {$maxfpuregisters 0}
  86. {$endif fpc}
  87. function getbestreal(const t1,t2 : ttype) : ttype;
  88. const
  89. floatweight : array[tfloattype] of byte =
  90. (2,3,4,0,1,5);
  91. begin
  92. if t1.def.deftype=floatdef then
  93. begin
  94. result:=t1;
  95. if t2.def.deftype=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.def).typ in [s64comp,s64currency]) or
  100. (tfloatdef(t2.def).typ in [s64comp,s64currency]) then
  101. result:=pbestrealtype^
  102. else
  103. if floatweight[tfloatdef(t2.def).typ]>floatweight[tfloatdef(t1.def).typ] then
  104. result:=t2;
  105. end;
  106. end
  107. else if t2.def.deftype=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. resultrealtype:=pbestrealtype^;
  135. if (right.resulttype.def.deftype=floatdef) or (left.resulttype.def.deftype=floatdef) then
  136. begin
  137. { when both floattypes are already equal then use that
  138. floattype for results }
  139. if (right.resulttype.def.deftype=floatdef) and
  140. (left.resulttype.def.deftype=floatdef) and
  141. (tfloatdef(left.resulttype.def).typ=tfloatdef(right.resulttype.def).typ) then
  142. resultrealtype:=left.resulttype
  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.resulttype.def) or
  147. is_currency(left.resulttype.def)) and
  148. ((s64currencytype.def.deftype = floatdef) or
  149. (nodetype <> slashn)) then
  150. begin
  151. resultrealtype:=s64currencytype;
  152. inserttypeconv(right,resultrealtype);
  153. inserttypeconv(left,resultrealtype);
  154. end
  155. else
  156. begin
  157. resultrealtype:=getbestreal(left.resulttype,right.resulttype);
  158. inserttypeconv(right,resultrealtype);
  159. inserttypeconv(left,resultrealtype);
  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.resulttype.def) or
  167. is_widestring(left.resulttype.def) or
  168. is_widechar(right.resulttype.def) or
  169. is_widechar(left.resulttype.def)) then
  170. begin
  171. inserttypeconv(right,cwidestringtype);
  172. inserttypeconv(left,cwidestringtype);
  173. end;
  174. { load easier access variables }
  175. rd:=right.resulttype.def;
  176. ld:=left.resulttype.def;
  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 aktlocalswitches) or
  186. (cs_check_overflow in aktlocalswitches) 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 aktmoduleswitches) 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.resulttype)
  232. else if (nodetype <> subn) and
  233. is_voidpointer(ld) then
  234. inserttypeconv(left,right.resulttype)
  235. else if not(equal_defs(ld,rd)) then
  236. IncompatibleTypes(ld,rd);
  237. end
  238. else if (ld.deftype=enumdef) and (rd.deftype=enumdef) then
  239. begin
  240. if not(equal_defs(ld,rd)) then
  241. inserttypeconv(right,left.resulttype);
  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.resulttype.def).pointertype.def.size;
  267. if (rt = pointerconstn) and
  268. (lt <> pointerconstn) then
  269. lv := lv * tpointerdef(right.resulttype.def).pointertype.def.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.resulttype)
  280. else
  281. if is_integer(ld) then
  282. t := genintconstnode(lv+rv)
  283. else
  284. t := cordconstnode.create(lv+rv,left.resulttype,(ld.deftype<>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).pointertype.def.size)
  310. else
  311. t := cpointerconstnode.create(lv-rv,left.resulttype);
  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.resulttype,(ld.deftype<>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).typ <> u64bit) or
  341. (torddef(rd).typ <> 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.resulttype,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.resulttype,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.resulttype,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,resultrealtype);
  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,resultrealtype);
  409. subn :
  410. t:=crealconstnode.create(lvd-rvd,resultrealtype);
  411. muln :
  412. t:=crealconstnode.create(lvd*rvd,resultrealtype);
  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,resultrealtype);
  420. end
  421. else if lvd=0 then
  422. t:=crealconstnode.create(1.0,resultrealtype)
  423. else
  424. t:=crealconstnode.create(exp(ln(lvd)*rvd),resultrealtype);
  425. end;
  426. slashn :
  427. t:=crealconstnode.create(lvd/rvd,resultrealtype);
  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;
  503. s2:=@c2;
  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;
  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;
  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.resulttype.def).settype=smallset) and
  569. (tsetdef(left.resulttype.def).settype<>smallset) then
  570. right.resulttype.setdef(tsetdef.create(tsetdef(right.resulttype.def).elementtype,255));
  571. { check base types }
  572. inserttypeconv(left,right.resulttype);
  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.resulttype);
  585. end;
  586. muln :
  587. begin
  588. resultset:=tsetconstnode(right).value_set^ * tsetconstnode(left).value_set^;
  589. t:=csetconstnode.create(@resultset,left.resulttype);
  590. end;
  591. subn :
  592. begin
  593. resultset:=tsetconstnode(left).value_set^ - tsetconstnode(right).value_set^;
  594. t:=csetconstnode.create(@resultset,left.resulttype);
  595. end;
  596. symdifn :
  597. begin
  598. resultset:=tsetconstnode(right).value_set^ >< tsetconstnode(left).value_set^;
  599. t:=csetconstnode.create(@resultset,left.resulttype);
  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.det_resulttype:tnode;
  632. var
  633. hp : tnode;
  634. lt,rt : tnodetype;
  635. rd,ld : tdef;
  636. htype : ttype;
  637. ot : tnodetype;
  638. hsym : tfieldvarsym;
  639. i : longint;
  640. strtype : tstringtype;
  641. b : boolean;
  642. {$ifdef state_tracking}
  643. factval : Tnode;
  644. change : boolean;
  645. {$endif}
  646. begin
  647. result:=nil;
  648. { first do the two subtrees }
  649. resulttypepass(left);
  650. resulttypepass(right);
  651. { both left and right need to be valid }
  652. set_varstate(left,vs_read,[vsf_must_be_valid]);
  653. set_varstate(right,vs_read,[vsf_must_be_valid]);
  654. if codegenerror then
  655. exit;
  656. { tp procvar support }
  657. maybe_call_procvar(left,true);
  658. maybe_call_procvar(right,true);
  659. { convert array constructors to sets, because there is no other operator
  660. possible for array constructors }
  661. if is_array_constructor(left.resulttype.def) then
  662. begin
  663. arrayconstructor_to_set(left);
  664. resulttypepass(left);
  665. end;
  666. if is_array_constructor(right.resulttype.def) then
  667. begin
  668. arrayconstructor_to_set(right);
  669. resulttypepass(right);
  670. end;
  671. { allow operator overloading }
  672. hp:=self;
  673. if isbinaryoverloaded(hp) then
  674. begin
  675. result:=hp;
  676. exit;
  677. end;
  678. { Stop checking when an error was found in the operator checking }
  679. if codegenerror then
  680. begin
  681. result:=cerrornode.create;
  682. exit;
  683. end;
  684. { Kylix allows enum+ordconstn in an enum declaration (blocktype
  685. is bt_type), we need to do the conversion here before the
  686. constant folding }
  687. if (m_delphi in aktmodeswitches) and
  688. (blocktype=bt_type) then
  689. begin
  690. if (left.resulttype.def.deftype=enumdef) and
  691. (right.resulttype.def.deftype=orddef) then
  692. begin
  693. { insert explicit typecast to default signed int }
  694. left:=ctypeconvnode.create_internal(left,sinttype);
  695. resulttypepass(left);
  696. end
  697. else
  698. if (left.resulttype.def.deftype=orddef) and
  699. (right.resulttype.def.deftype=enumdef) then
  700. begin
  701. { insert explicit typecast to default signed int }
  702. right:=ctypeconvnode.create_internal(right,sinttype);
  703. resulttypepass(right);
  704. end;
  705. end;
  706. result:=simplify;
  707. if assigned(result) then
  708. exit;
  709. { load easier access variables }
  710. rd:=right.resulttype.def;
  711. ld:=left.resulttype.def;
  712. rt:=right.nodetype;
  713. lt:=left.nodetype;
  714. { but an int/int gives real/real! }
  715. if nodetype=slashn then
  716. begin
  717. if is_currency(left.resulttype.def) and
  718. is_currency(right.resulttype.def) then
  719. { In case of currency, converting to float means dividing by 10000 }
  720. { However, since this is already a division, both divisions by }
  721. { 10000 are eliminated when we divide the results -> we can skip }
  722. { them. }
  723. if s64currencytype.def.deftype = floatdef then
  724. begin
  725. { there's no s64comptype or so, how do we avoid the type conversion?
  726. left.resulttype := s64comptype;
  727. right.resulttype := s64comptype; }
  728. end
  729. else
  730. begin
  731. left.resulttype := s64inttype;
  732. right.resulttype := s64inttype;
  733. end
  734. else if (left.resulttype.def.deftype <> floatdef) and
  735. (right.resulttype.def.deftype <> floatdef) then
  736. CGMessage(type_h_use_div_for_int);
  737. inserttypeconv(right,resultrealtype);
  738. inserttypeconv(left,resultrealtype);
  739. end
  740. { if both are orddefs then check sub types }
  741. else if (ld.deftype=orddef) and (rd.deftype=orddef) then
  742. begin
  743. { optimize multiplacation by a power of 2 }
  744. if not(cs_check_overflow in aktlocalswitches) and
  745. (nodetype = muln) and
  746. (((left.nodetype = ordconstn) and
  747. ispowerof2(tordconstnode(left).value,i)) or
  748. ((right.nodetype = ordconstn) and
  749. ispowerof2(tordconstnode(right).value,i))) then
  750. begin
  751. if left.nodetype = ordconstn then
  752. begin
  753. tordconstnode(left).value := i;
  754. result := cshlshrnode.create(shln,right,left);
  755. end
  756. else
  757. begin
  758. tordconstnode(right).value := i;
  759. result := cshlshrnode.create(shln,left,right);
  760. end;
  761. left := nil;
  762. right := nil;
  763. exit;
  764. end;
  765. { 2 booleans? Make them equal to the largest boolean }
  766. if is_boolean(ld) and is_boolean(rd) then
  767. begin
  768. if torddef(left.resulttype.def).size>torddef(right.resulttype.def).size then
  769. begin
  770. right:=ctypeconvnode.create_internal(right,left.resulttype);
  771. ttypeconvnode(right).convtype:=tc_bool_2_int;
  772. resulttypepass(right);
  773. end
  774. else if torddef(left.resulttype.def).size<torddef(right.resulttype.def).size then
  775. begin
  776. left:=ctypeconvnode.create_internal(left,right.resulttype);
  777. ttypeconvnode(left).convtype:=tc_bool_2_int;
  778. resulttypepass(left);
  779. end;
  780. case nodetype of
  781. xorn,
  782. ltn,
  783. lten,
  784. gtn,
  785. gten,
  786. andn,
  787. orn:
  788. begin
  789. end;
  790. unequaln,
  791. equaln:
  792. begin
  793. if not(cs_full_boolean_eval in aktlocalswitches) then
  794. begin
  795. { Remove any compares with constants }
  796. if (left.nodetype=ordconstn) then
  797. begin
  798. hp:=right;
  799. b:=(tordconstnode(left).value<>0);
  800. ot:=nodetype;
  801. left.free;
  802. left:=nil;
  803. right:=nil;
  804. if (not(b) and (ot=equaln)) or
  805. (b and (ot=unequaln)) then
  806. begin
  807. hp:=cnotnode.create(hp);
  808. end;
  809. result:=hp;
  810. exit;
  811. end;
  812. if (right.nodetype=ordconstn) then
  813. begin
  814. hp:=left;
  815. b:=(tordconstnode(right).value<>0);
  816. ot:=nodetype;
  817. right.free;
  818. right:=nil;
  819. left:=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. end;
  829. end;
  830. else
  831. begin
  832. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  833. result:=cnothingnode.create;
  834. exit;
  835. end;
  836. end;
  837. end
  838. { Both are chars? }
  839. else if is_char(rd) and is_char(ld) then
  840. begin
  841. if nodetype=addn then
  842. begin
  843. resulttype:=cshortstringtype;
  844. if not(is_constcharnode(left) and is_constcharnode(right)) then
  845. begin
  846. inserttypeconv(left,cshortstringtype);
  847. {$ifdef addstringopt}
  848. hp := genaddsstringcharoptnode(self);
  849. result := hp;
  850. exit;
  851. {$endif addstringopt}
  852. end;
  853. end;
  854. end
  855. { There is a widechar? }
  856. else if is_widechar(rd) or is_widechar(ld) then
  857. begin
  858. { widechar+widechar gives widestring }
  859. if nodetype=addn then
  860. begin
  861. inserttypeconv(left,cwidestringtype);
  862. if (torddef(rd).typ<>uwidechar) then
  863. inserttypeconv(right,cwidechartype);
  864. resulttype:=cwidestringtype;
  865. end
  866. else
  867. begin
  868. if (torddef(ld).typ<>uwidechar) then
  869. inserttypeconv(left,cwidechartype);
  870. if (torddef(rd).typ<>uwidechar) then
  871. inserttypeconv(right,cwidechartype);
  872. end;
  873. end
  874. { is there a currency type ? }
  875. else if ((torddef(rd).typ=scurrency) or (torddef(ld).typ=scurrency)) then
  876. begin
  877. if (torddef(ld).typ<>scurrency) then
  878. inserttypeconv(left,s64currencytype);
  879. if (torddef(rd).typ<>scurrency) then
  880. inserttypeconv(right,s64currencytype);
  881. end
  882. { and,or,xor work on bit patterns and don't care
  883. about the sign of integers }
  884. else if (nodetype in [andn,orn,xorn]) and
  885. is_integer(ld) and is_integer(rd) then
  886. begin
  887. if rd.size>ld.size then
  888. inserttypeconv_internal(left,right.resulttype)
  889. else
  890. inserttypeconv_internal(right,left.resulttype);
  891. end
  892. { is there a signed 64 bit type ? }
  893. else if ((torddef(rd).typ=s64bit) or (torddef(ld).typ=s64bit)) then
  894. begin
  895. if (torddef(ld).typ<>s64bit) then
  896. inserttypeconv(left,s64inttype);
  897. if (torddef(rd).typ<>s64bit) then
  898. inserttypeconv(right,s64inttype);
  899. end
  900. { is there a unsigned 64 bit type ? }
  901. else if ((torddef(rd).typ=u64bit) or (torddef(ld).typ=u64bit)) then
  902. begin
  903. if (torddef(ld).typ<>u64bit) then
  904. inserttypeconv(left,u64inttype);
  905. if (torddef(rd).typ<>u64bit) then
  906. inserttypeconv(right,u64inttype);
  907. end
  908. { 64 bit cpus do calculations always in 64 bit }
  909. {$ifndef cpu64bit}
  910. { is there a cardinal? }
  911. else if ((torddef(rd).typ=u32bit) or (torddef(ld).typ=u32bit)) then
  912. begin
  913. { convert positive constants to u32bit }
  914. if (torddef(ld).typ<>u32bit) and
  915. is_constintnode(left) and
  916. (tordconstnode(left).value >= 0) then
  917. inserttypeconv(left,u32inttype);
  918. if (torddef(rd).typ<>u32bit) and
  919. is_constintnode(right) and
  920. (tordconstnode(right).value >= 0) then
  921. inserttypeconv(right,u32inttype);
  922. { when one of the operand is signed perform
  923. the operation in 64bit, can't use rd/ld here because there
  924. could be already typeconvs inserted }
  925. if is_signed(left.resulttype.def) or
  926. is_signed(right.resulttype.def) then
  927. begin
  928. CGMessage(type_w_mixed_signed_unsigned);
  929. inserttypeconv(left,s64inttype);
  930. inserttypeconv(right,s64inttype);
  931. end
  932. else
  933. begin
  934. if (torddef(left.resulttype.def).typ<>u32bit) then
  935. inserttypeconv(left,u32inttype);
  936. if (torddef(right.resulttype.def).typ<>u32bit) then
  937. inserttypeconv(right,u32inttype);
  938. end;
  939. end
  940. {$endif cpu64bit}
  941. { generic ord conversion is sinttype }
  942. else
  943. begin
  944. { if the left or right value is smaller than the normal
  945. type sinttype and is unsigned, and the other value
  946. is a constant < 0, the result will always be false/true
  947. for equal / unequal nodes.
  948. }
  949. if (
  950. { left : unsigned ordinal var, right : < 0 constant }
  951. (
  952. ((is_signed(ld)=false) and (is_constintnode(left) =false)) and
  953. ((is_constintnode(right)) and (tordconstnode(right).value < 0))
  954. ) or
  955. { right : unsigned ordinal var, left : < 0 constant }
  956. (
  957. ((is_signed(rd)=false) and (is_constintnode(right) =false)) and
  958. ((is_constintnode(left)) and (tordconstnode(left).value < 0))
  959. )
  960. ) then
  961. begin
  962. if nodetype = equaln then
  963. CGMessage(type_w_signed_unsigned_always_false)
  964. else
  965. if nodetype = unequaln then
  966. CGMessage(type_w_signed_unsigned_always_true)
  967. else
  968. if (is_constintnode(left) and (nodetype in [ltn,lten])) or
  969. (is_constintnode(right) and (nodetype in [gtn,gten])) then
  970. CGMessage(type_w_signed_unsigned_always_true)
  971. else
  972. if (is_constintnode(right) and (nodetype in [ltn,lten])) or
  973. (is_constintnode(left) and (nodetype in [gtn,gten])) then
  974. CGMessage(type_w_signed_unsigned_always_false);
  975. end;
  976. { When there is a signed type or there is a minus operation
  977. we convert to signed int. Otherwise (both are unsigned) we keep
  978. the result also unsigned. This is compatible with Delphi (PFV) }
  979. if is_signed(ld) or
  980. is_signed(rd) or
  981. (nodetype=subn) then
  982. begin
  983. inserttypeconv(right,sinttype);
  984. inserttypeconv(left,sinttype);
  985. end
  986. else
  987. begin
  988. inserttypeconv(right,uinttype);
  989. inserttypeconv(left,uinttype);
  990. end;
  991. end;
  992. end
  993. { if both are floatdefs, conversion is already done before constant folding }
  994. else if (ld.deftype=floatdef) then
  995. begin
  996. if not(nodetype in [addn,subn,muln,slashn,equaln,unequaln,ltn,lten,gtn,gten]) then
  997. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  998. end
  999. { left side a setdef, must be before string processing,
  1000. else array constructor can be seen as array of char (PFV) }
  1001. else if (ld.deftype=setdef) then
  1002. begin
  1003. { trying to add a set element? }
  1004. if (nodetype=addn) and (rd.deftype<>setdef) then
  1005. begin
  1006. if (rt=setelementn) then
  1007. begin
  1008. if not(equal_defs(tsetdef(ld).elementtype.def,rd)) then
  1009. CGMessage(type_e_set_element_are_not_comp);
  1010. end
  1011. else
  1012. CGMessage(type_e_mismatch)
  1013. end
  1014. else
  1015. begin
  1016. if not(nodetype in [addn,subn,symdifn,muln,equaln,unequaln,lten,gten]) then
  1017. CGMessage(type_e_set_operation_unknown);
  1018. { right def must be a also be set }
  1019. if (rd.deftype<>setdef) or not(equal_defs(rd,ld)) then
  1020. CGMessage(type_e_set_element_are_not_comp);
  1021. end;
  1022. { ranges require normsets }
  1023. if (tsetdef(ld).settype=smallset) and
  1024. (rt=setelementn) and
  1025. assigned(tsetelementnode(right).right) then
  1026. begin
  1027. { generate a temporary normset def, it'll be destroyed
  1028. when the symtable is unloaded }
  1029. htype.setdef(tsetdef.create(tsetdef(ld).elementtype,255));
  1030. inserttypeconv(left,htype);
  1031. end;
  1032. { if the right side is also a setdef then the settype must
  1033. be the same as the left setdef }
  1034. if (rd.deftype=setdef) and
  1035. (tsetdef(ld).settype<>tsetdef(rd).settype) then
  1036. begin
  1037. { when right is a normset we need to typecast both
  1038. to normsets }
  1039. if (tsetdef(rd).settype=normset) then
  1040. inserttypeconv(left,right.resulttype)
  1041. else
  1042. inserttypeconv(right,left.resulttype);
  1043. end;
  1044. end
  1045. { pointer comparision and subtraction }
  1046. else if (
  1047. (rd.deftype=pointerdef) and (ld.deftype=pointerdef)
  1048. ) or
  1049. { compare/add pchar to variable (not stringconst) char arrays
  1050. by addresses like BP/Delphi }
  1051. (
  1052. (nodetype in [equaln,unequaln,subn,addn]) and
  1053. (
  1054. ((is_pchar(ld) or (lt=niln)) and is_chararray(rd) and (rt<>stringconstn)) or
  1055. ((is_pchar(rd) or (rt=niln)) and is_chararray(ld) and (lt<>stringconstn))
  1056. )
  1057. ) then
  1058. begin
  1059. { convert char array to pointer }
  1060. if is_chararray(rd) then
  1061. begin
  1062. inserttypeconv(right,charpointertype);
  1063. rd:=right.resulttype.def;
  1064. end
  1065. else if is_chararray(ld) then
  1066. begin
  1067. inserttypeconv(left,charpointertype);
  1068. ld:=left.resulttype.def;
  1069. end;
  1070. case nodetype of
  1071. equaln,unequaln :
  1072. begin
  1073. if is_voidpointer(right.resulttype.def) then
  1074. inserttypeconv(right,left.resulttype)
  1075. else if is_voidpointer(left.resulttype.def) then
  1076. inserttypeconv(left,right.resulttype)
  1077. else if not(equal_defs(ld,rd)) then
  1078. IncompatibleTypes(ld,rd);
  1079. { now that the type checking is done, convert both to charpointer, }
  1080. { because methodpointers are 8 bytes even though only the first 4 }
  1081. { bytes must be compared. This can happen here if we are in }
  1082. { TP/Delphi mode, because there @methodpointer = voidpointer (but }
  1083. { a voidpointer of 8 bytes). A conversion to voidpointer would be }
  1084. { optimized away, since the result already was a voidpointer, so }
  1085. { use a charpointer instead (JM) }
  1086. inserttypeconv_internal(left,charpointertype);
  1087. inserttypeconv_internal(right,charpointertype);
  1088. end;
  1089. ltn,lten,gtn,gten:
  1090. begin
  1091. if (cs_extsyntax in aktmoduleswitches) then
  1092. begin
  1093. if is_voidpointer(right.resulttype.def) then
  1094. inserttypeconv(right,left.resulttype)
  1095. else if is_voidpointer(left.resulttype.def) then
  1096. inserttypeconv(left,right.resulttype)
  1097. else if not(equal_defs(ld,rd)) then
  1098. IncompatibleTypes(ld,rd);
  1099. end
  1100. else
  1101. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1102. end;
  1103. subn:
  1104. begin
  1105. if (cs_extsyntax in aktmoduleswitches) then
  1106. begin
  1107. if is_voidpointer(right.resulttype.def) then
  1108. inserttypeconv(right,left.resulttype)
  1109. else if is_voidpointer(left.resulttype.def) then
  1110. inserttypeconv(left,right.resulttype)
  1111. else if not(equal_defs(ld,rd)) then
  1112. IncompatibleTypes(ld,rd);
  1113. end
  1114. else
  1115. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1116. if not(nf_has_pointerdiv in flags) and
  1117. (tpointerdef(rd).pointertype.def.size>1) then
  1118. begin
  1119. hp:=getcopy;
  1120. include(hp.flags,nf_has_pointerdiv);
  1121. result:=cmoddivnode.create(divn,hp,cordconstnode.create(tpointerdef(rd).pointertype.def.size,sinttype,false));
  1122. end;
  1123. resulttype:=sinttype;
  1124. exit;
  1125. end;
  1126. addn:
  1127. begin
  1128. if (cs_extsyntax in aktmoduleswitches) then
  1129. begin
  1130. if is_voidpointer(right.resulttype.def) then
  1131. inserttypeconv(right,left.resulttype)
  1132. else if is_voidpointer(left.resulttype.def) then
  1133. inserttypeconv(left,right.resulttype)
  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. resulttype:=sinttype;
  1140. exit;
  1141. end;
  1142. else
  1143. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1144. end;
  1145. end
  1146. { is one of the operands a string?,
  1147. chararrays are also handled as strings (after conversion), also take
  1148. care of chararray+chararray and chararray+char.
  1149. Note: Must be done after pointerdef+pointerdef has been checked, else
  1150. pchar is converted to string }
  1151. else if (rd.deftype=stringdef) or
  1152. (ld.deftype=stringdef) or
  1153. ((is_pchar(rd) or is_chararray(rd) or is_char(rd) or is_open_chararray(rd) or
  1154. is_pwidechar(rd) or is_widechararray(rd) or is_widechar(rd) or is_open_widechararray(rd)) and
  1155. (is_pchar(ld) or is_chararray(ld) or is_char(ld) or is_open_chararray(ld) or
  1156. is_pwidechar(ld) or is_widechararray(ld) or is_widechar(ld) or is_open_widechararray(ld))) then
  1157. begin
  1158. if (nodetype in [addn,equaln,unequaln,lten,gten,ltn,gtn]) then
  1159. begin
  1160. { Is there a widestring? }
  1161. if is_widestring(rd) or is_widestring(ld) or
  1162. is_pwidechar(rd) or is_widechararray(rd) or is_widechar(rd) or is_open_widechararray(rd) or
  1163. is_pwidechar(ld) or is_widechararray(ld) or is_widechar(ld) or is_open_widechararray(ld) then
  1164. strtype:= st_widestring
  1165. else
  1166. if is_ansistring(rd) or is_ansistring(ld) or
  1167. ((cs_ansistrings in aktlocalswitches) and
  1168. //todo: Move some of this to longstring's then they are implemented?
  1169. (
  1170. is_pchar(rd) or (is_chararray(rd) and (rd.size > 255)) or is_open_chararray(rd) or
  1171. is_pchar(ld) or (is_chararray(ld) and (ld.size > 255)) or is_open_chararray(ld)
  1172. )
  1173. ) then
  1174. strtype:= st_ansistring
  1175. else
  1176. if is_longstring(rd) or is_longstring(ld) then
  1177. strtype:= st_longstring
  1178. else
  1179. begin
  1180. {$warning todo: add a warning/hint here if one converting a too large array}
  1181. { nodes is PChar, array [with size > 255] or OpenArrayOfChar.
  1182. Note: Delphi halts with error if "array [0..xx] of char"
  1183. is assigned to ShortString and string length is less
  1184. then array size }
  1185. strtype:= st_shortstring;
  1186. end;
  1187. // Now convert nodes to common string type
  1188. case strtype of
  1189. st_widestring :
  1190. begin
  1191. if not(is_widestring(rd)) then
  1192. inserttypeconv(right,cwidestringtype);
  1193. if not(is_widestring(ld)) then
  1194. inserttypeconv(left,cwidestringtype);
  1195. end;
  1196. st_ansistring :
  1197. begin
  1198. if not(is_ansistring(rd)) then
  1199. inserttypeconv(right,cansistringtype);
  1200. if not(is_ansistring(ld)) then
  1201. inserttypeconv(left,cansistringtype);
  1202. end;
  1203. st_longstring :
  1204. begin
  1205. if not(is_longstring(rd)) then
  1206. inserttypeconv(right,clongstringtype);
  1207. if not(is_longstring(ld)) then
  1208. inserttypeconv(left,clongstringtype);
  1209. end;
  1210. st_shortstring :
  1211. begin
  1212. if not(is_shortstring(ld)) then
  1213. inserttypeconv(left,cshortstringtype);
  1214. { don't convert char, that can be handled by the optimized node }
  1215. if not(is_shortstring(rd) or is_char(rd)) then
  1216. inserttypeconv(right,cshortstringtype);
  1217. end;
  1218. else
  1219. internalerror(2005101);
  1220. end;
  1221. end
  1222. else
  1223. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1224. end
  1225. { class or interface equation }
  1226. else if is_class_or_interface(rd) or is_class_or_interface(ld) then
  1227. begin
  1228. if (nodetype in [equaln,unequaln]) then
  1229. begin
  1230. if is_class_or_interface(rd) and is_class_or_interface(ld) then
  1231. begin
  1232. if tobjectdef(rd).is_related(tobjectdef(ld)) then
  1233. inserttypeconv(right,left.resulttype)
  1234. else
  1235. inserttypeconv(left,right.resulttype);
  1236. end
  1237. else if is_class_or_interface(rd) then
  1238. inserttypeconv(left,right.resulttype)
  1239. else
  1240. inserttypeconv(right,left.resulttype);
  1241. end
  1242. else
  1243. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1244. end
  1245. else if (rd.deftype=classrefdef) and (ld.deftype=classrefdef) then
  1246. begin
  1247. if (nodetype in [equaln,unequaln]) then
  1248. begin
  1249. if tobjectdef(tclassrefdef(rd).pointertype.def).is_related(
  1250. tobjectdef(tclassrefdef(ld).pointertype.def)) then
  1251. inserttypeconv(right,left.resulttype)
  1252. else
  1253. inserttypeconv(left,right.resulttype);
  1254. end
  1255. else
  1256. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1257. end
  1258. { allows comperasion with nil pointer }
  1259. else if is_class_or_interface(rd) or (rd.deftype=classrefdef) then
  1260. begin
  1261. if (nodetype in [equaln,unequaln]) then
  1262. inserttypeconv(left,right.resulttype)
  1263. else
  1264. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1265. end
  1266. else if is_class_or_interface(ld) or (ld.deftype=classrefdef) then
  1267. begin
  1268. if (nodetype in [equaln,unequaln]) then
  1269. inserttypeconv(right,left.resulttype)
  1270. else
  1271. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1272. end
  1273. { support procvar=nil,procvar<>nil }
  1274. else if ((ld.deftype=procvardef) and (rt=niln)) or
  1275. ((rd.deftype=procvardef) and (lt=niln)) then
  1276. begin
  1277. if not(nodetype in [equaln,unequaln]) then
  1278. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1279. { find proc field in methodpointer record }
  1280. hsym:=tfieldvarsym(trecorddef(methodpointertype.def).symtable.search('proc'));
  1281. if not assigned(hsym) then
  1282. internalerror(200412043);
  1283. { For methodpointers compare only tmethodpointer.proc }
  1284. if (rd.deftype=procvardef) and
  1285. (not tprocvardef(rd).is_addressonly) then
  1286. begin
  1287. right:=csubscriptnode.create(
  1288. hsym,
  1289. ctypeconvnode.create_internal(right,methodpointertype));
  1290. end;
  1291. if (ld.deftype=procvardef) and
  1292. (not tprocvardef(ld).is_addressonly) then
  1293. begin
  1294. left:=csubscriptnode.create(
  1295. hsym,
  1296. ctypeconvnode.create_internal(left,methodpointertype));
  1297. end;
  1298. end
  1299. { support dynamicarray=nil,dynamicarray<>nil }
  1300. else if (is_dynamic_array(ld) and (rt=niln)) or
  1301. (is_dynamic_array(rd) and (lt=niln)) or
  1302. (is_dynamic_array(ld) and is_dynamic_array(rd)) then
  1303. begin
  1304. if not(nodetype in [equaln,unequaln]) then
  1305. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1306. end
  1307. {$ifdef SUPPORT_MMX}
  1308. { mmx support, this must be before the zero based array
  1309. check }
  1310. else if (cs_mmx in aktlocalswitches) and
  1311. is_mmx_able_array(ld) and
  1312. is_mmx_able_array(rd) and
  1313. equal_defs(ld,rd) then
  1314. begin
  1315. case nodetype of
  1316. addn,subn,xorn,orn,andn:
  1317. ;
  1318. { mul is a little bit restricted }
  1319. muln:
  1320. if not(mmx_type(ld) in [mmxu16bit,mmxs16bit,mmxfixed16]) then
  1321. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1322. else
  1323. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1324. end;
  1325. end
  1326. {$endif SUPPORT_MMX}
  1327. { this is a little bit dangerous, also the left type }
  1328. { pointer to should be checked! This broke the mmx support }
  1329. else if (rd.deftype=pointerdef) or is_zero_based_array(rd) then
  1330. begin
  1331. if is_zero_based_array(rd) then
  1332. begin
  1333. resulttype.setdef(tpointerdef.create(tarraydef(rd).elementtype));
  1334. inserttypeconv(right,resulttype);
  1335. end
  1336. else
  1337. resulttype:=right.resulttype;
  1338. inserttypeconv(left,sinttype);
  1339. if nodetype=addn then
  1340. begin
  1341. if not(cs_extsyntax in aktmoduleswitches) or
  1342. (not(is_pchar(ld)) and not(m_add_pointer in aktmodeswitches)) then
  1343. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1344. if (rd.deftype=pointerdef) and
  1345. (tpointerdef(rd).pointertype.def.size>1) then
  1346. begin
  1347. left:=caddnode.create(muln,left,
  1348. cordconstnode.create(tpointerdef(rd).pointertype.def.size,sinttype,true));
  1349. end;
  1350. end
  1351. else
  1352. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1353. end
  1354. else if (ld.deftype=pointerdef) or is_zero_based_array(ld) then
  1355. begin
  1356. if is_zero_based_array(ld) then
  1357. begin
  1358. resulttype.setdef(tpointerdef.create(tarraydef(ld).elementtype));
  1359. inserttypeconv(left,resulttype);
  1360. end
  1361. else
  1362. resulttype:=left.resulttype;
  1363. inserttypeconv(right,sinttype);
  1364. if nodetype in [addn,subn] then
  1365. begin
  1366. if not(cs_extsyntax in aktmoduleswitches) or
  1367. (not(is_pchar(ld)) and not(m_add_pointer in aktmodeswitches)) then
  1368. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1369. if (ld.deftype=pointerdef) and
  1370. (tpointerdef(ld).pointertype.def.size>1) then
  1371. begin
  1372. right:=caddnode.create(muln,right,
  1373. cordconstnode.create(tpointerdef(ld).pointertype.def.size,sinttype,true));
  1374. end
  1375. else
  1376. if is_zero_based_array(ld) and
  1377. (tarraydef(ld).elementtype.def.size>1) then
  1378. begin
  1379. right:=caddnode.create(muln,right,
  1380. cordconstnode.create(tarraydef(ld).elementtype.def.size,sinttype,true));
  1381. end;
  1382. end
  1383. else
  1384. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1385. end
  1386. else if (rd.deftype=procvardef) and
  1387. (ld.deftype=procvardef) and
  1388. equal_defs(rd,ld) then
  1389. begin
  1390. if (nodetype in [equaln,unequaln]) then
  1391. begin
  1392. if tprocvardef(rd).is_addressonly then
  1393. begin
  1394. inserttypeconv_internal(right,voidpointertype);
  1395. inserttypeconv_internal(left,voidpointertype);
  1396. end
  1397. else
  1398. begin
  1399. { find proc field in methodpointer record }
  1400. hsym:=tfieldvarsym(trecorddef(methodpointertype.def).symtable.search('proc'));
  1401. if not assigned(hsym) then
  1402. internalerror(200412043);
  1403. { Compare tmehodpointer(left).proc }
  1404. right:=csubscriptnode.create(
  1405. hsym,
  1406. ctypeconvnode.create_internal(right,methodpointertype));
  1407. left:=csubscriptnode.create(
  1408. hsym,
  1409. ctypeconvnode.create_internal(left,methodpointertype));
  1410. end;
  1411. end
  1412. else
  1413. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1414. end
  1415. { enums }
  1416. else if (ld.deftype=enumdef) and (rd.deftype=enumdef) then
  1417. begin
  1418. if allowenumop(nodetype) then
  1419. inserttypeconv(right,left.resulttype)
  1420. else
  1421. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),ld.typename,rd.typename);
  1422. end
  1423. { generic conversion, this is for error recovery }
  1424. else
  1425. begin
  1426. inserttypeconv(left,sinttype);
  1427. inserttypeconv(right,sinttype);
  1428. end;
  1429. { set resulttype if not already done }
  1430. if not assigned(resulttype.def) then
  1431. begin
  1432. case nodetype of
  1433. ltn,lten,gtn,gten,equaln,unequaln :
  1434. resulttype:=booltype;
  1435. slashn :
  1436. resulttype:=resultrealtype;
  1437. addn:
  1438. begin
  1439. { for strings, return is always a 255 char string }
  1440. if is_shortstring(left.resulttype.def) then
  1441. resulttype:=cshortstringtype
  1442. else
  1443. resulttype:=left.resulttype;
  1444. end;
  1445. else
  1446. resulttype:=left.resulttype;
  1447. end;
  1448. end;
  1449. { when the result is currency we need some extra code for
  1450. multiplication and division. this should not be done when
  1451. the muln or slashn node is created internally }
  1452. if not(nf_is_currency in flags) and
  1453. is_currency(resulttype.def) then
  1454. begin
  1455. case nodetype of
  1456. slashn :
  1457. begin
  1458. { slashn will only work with floats }
  1459. hp:=caddnode.create(muln,getcopy,crealconstnode.create(10000.0,s64currencytype));
  1460. include(hp.flags,nf_is_currency);
  1461. result:=hp;
  1462. end;
  1463. muln :
  1464. begin
  1465. if s64currencytype.def.deftype=floatdef then
  1466. hp:=caddnode.create(slashn,getcopy,crealconstnode.create(10000.0,s64currencytype))
  1467. else
  1468. hp:=cmoddivnode.create(divn,getcopy,cordconstnode.create(10000,s64currencytype,false));
  1469. include(hp.flags,nf_is_currency);
  1470. result:=hp
  1471. end;
  1472. end;
  1473. end;
  1474. end;
  1475. function taddnode.first_addstring: tnode;
  1476. var
  1477. p: tnode;
  1478. begin
  1479. { when we get here, we are sure that both the left and the right }
  1480. { node are both strings of the same stringtype (JM) }
  1481. case nodetype of
  1482. addn:
  1483. begin
  1484. { create the call to the concat routine both strings as arguments }
  1485. result := ccallnode.createintern('fpc_'+
  1486. tstringdef(resulttype.def).stringtypname+'_concat',
  1487. ccallparanode.create(right,ccallparanode.create(left,nil)));
  1488. { we reused the arguments }
  1489. left := nil;
  1490. right := nil;
  1491. end;
  1492. ltn,lten,gtn,gten,equaln,unequaln :
  1493. begin
  1494. { generate better code for comparison with empty string, we
  1495. only need to compare the length with 0 }
  1496. if (nodetype in [equaln,unequaln,gtn,gten,ltn,lten]) and
  1497. (((left.nodetype=stringconstn) and (tstringconstnode(left).len=0)) or
  1498. ((right.nodetype=stringconstn) and (tstringconstnode(right).len=0))) then
  1499. begin
  1500. { switch so that the constant is always on the right }
  1501. if left.nodetype = stringconstn then
  1502. begin
  1503. p := left;
  1504. left := right;
  1505. right := p;
  1506. end;
  1507. if is_shortstring(left.resulttype.def) or
  1508. (nodetype in [gtn,gten,ltn,lten]) then
  1509. { compare the length with 0 }
  1510. result := caddnode.create(nodetype,
  1511. cinlinenode.create(in_length_x,false,left),
  1512. cordconstnode.create(0,s32inttype,false))
  1513. else
  1514. begin
  1515. { compare the pointer with nil (for ansistrings etc), }
  1516. { faster than getting the length (JM) }
  1517. result:= caddnode.create(nodetype,
  1518. ctypeconvnode.create_internal(left,voidpointertype),
  1519. cpointerconstnode.create(0,voidpointertype));
  1520. end;
  1521. { left is reused }
  1522. left := nil;
  1523. { right isn't }
  1524. right.free;
  1525. right := nil;
  1526. exit;
  1527. end;
  1528. { no string constant -> call compare routine }
  1529. result := ccallnode.createintern('fpc_'+
  1530. tstringdef(left.resulttype.def).stringtypname+'_compare',
  1531. ccallparanode.create(right,ccallparanode.create(left,nil)));
  1532. { and compare its result with 0 according to the original operator }
  1533. result := caddnode.create(nodetype,result,
  1534. cordconstnode.create(0,s32inttype,false));
  1535. left := nil;
  1536. right := nil;
  1537. end;
  1538. end;
  1539. end;
  1540. function taddnode.first_addset: tnode;
  1541. var
  1542. procname: string[31];
  1543. tempn: tnode;
  1544. paras: tcallparanode;
  1545. srsym: ttypesym;
  1546. begin
  1547. { get the sym that represents the fpc_normal_set type }
  1548. srsym:=search_system_type('FPC_NORMAL_SET');
  1549. case nodetype of
  1550. equaln,unequaln,lten,gten:
  1551. begin
  1552. case nodetype of
  1553. equaln,unequaln:
  1554. procname := 'fpc_set_comp_sets';
  1555. lten,gten:
  1556. begin
  1557. procname := 'fpc_set_contains_sets';
  1558. { (left >= right) = (right <= left) }
  1559. if nodetype = gten then
  1560. begin
  1561. tempn := left;
  1562. left := right;
  1563. right := tempn;
  1564. end;
  1565. end;
  1566. end;
  1567. { convert the arguments (explicitely) to fpc_normal_set's }
  1568. left := ctypeconvnode.create_internal(left,srsym.restype);
  1569. right := ctypeconvnode.create_internal(right,srsym.restype);
  1570. result := ccallnode.createintern(procname,ccallparanode.create(right,
  1571. ccallparanode.create(left,nil)));
  1572. { left and right are reused as parameters }
  1573. left := nil;
  1574. right := nil;
  1575. { for an unequaln, we have to negate the result of comp_sets }
  1576. if nodetype = unequaln then
  1577. result := cnotnode.create(result);
  1578. end;
  1579. addn:
  1580. begin
  1581. { optimize first loading of a set }
  1582. if (right.nodetype=setelementn) and
  1583. not(assigned(tsetelementnode(right).right)) and
  1584. is_emptyset(left) then
  1585. begin
  1586. { type cast the value to pass as argument to a byte, }
  1587. { since that's what the helper expects }
  1588. tsetelementnode(right).left :=
  1589. ctypeconvnode.create_internal(tsetelementnode(right).left,u8inttype);
  1590. { set the resulttype to the actual one (otherwise it's }
  1591. { "fpc_normal_set") }
  1592. result := ccallnode.createinternres('fpc_set_create_element',
  1593. ccallparanode.create(tsetelementnode(right).left,nil),
  1594. resulttype);
  1595. { reused }
  1596. tsetelementnode(right).left := nil;
  1597. end
  1598. else
  1599. begin
  1600. if right.nodetype=setelementn then
  1601. begin
  1602. { convert the arguments to bytes, since that's what }
  1603. { the helper expects }
  1604. tsetelementnode(right).left :=
  1605. ctypeconvnode.create_internal(tsetelementnode(right).left,
  1606. u8inttype);
  1607. { convert the original set (explicitely) to an }
  1608. { fpc_normal_set so we can pass it to the helper }
  1609. left := ctypeconvnode.create_internal(left,srsym.restype);
  1610. { add a range or a single element? }
  1611. if assigned(tsetelementnode(right).right) then
  1612. begin
  1613. tsetelementnode(right).right :=
  1614. ctypeconvnode.create_internal(tsetelementnode(right).right,
  1615. u8inttype);
  1616. { create the call }
  1617. result := ccallnode.createinternres('fpc_set_set_range',
  1618. ccallparanode.create(tsetelementnode(right).right,
  1619. ccallparanode.create(tsetelementnode(right).left,
  1620. ccallparanode.create(left,nil))),resulttype);
  1621. end
  1622. else
  1623. begin
  1624. result := ccallnode.createinternres('fpc_set_set_byte',
  1625. ccallparanode.create(tsetelementnode(right).left,
  1626. ccallparanode.create(left,nil)),resulttype);
  1627. end;
  1628. { remove reused parts from original node }
  1629. tsetelementnode(right).right := nil;
  1630. tsetelementnode(right).left := nil;
  1631. left := nil;
  1632. end
  1633. else
  1634. begin
  1635. { add two sets }
  1636. { convert the sets to fpc_normal_set's }
  1637. result := ccallnode.createinternres('fpc_set_add_sets',
  1638. ccallparanode.create(
  1639. ctypeconvnode.create_explicit(right,srsym.restype),
  1640. ccallparanode.create(
  1641. ctypeconvnode.create_internal(left,srsym.restype),nil)),resulttype);
  1642. { remove reused parts from original node }
  1643. left := nil;
  1644. right := nil;
  1645. end;
  1646. end
  1647. end;
  1648. subn,symdifn,muln:
  1649. begin
  1650. { convert the sets to fpc_normal_set's }
  1651. paras := ccallparanode.create(ctypeconvnode.create_internal(right,srsym.restype),
  1652. ccallparanode.create(ctypeconvnode.create_internal(left,srsym.restype),nil));
  1653. case nodetype of
  1654. subn:
  1655. result := ccallnode.createinternres('fpc_set_sub_sets',
  1656. paras,resulttype);
  1657. symdifn:
  1658. result := ccallnode.createinternres('fpc_set_symdif_sets',
  1659. paras,resulttype);
  1660. muln:
  1661. result := ccallnode.createinternres('fpc_set_mul_sets',
  1662. paras,resulttype);
  1663. end;
  1664. { remove reused parts from original node }
  1665. left := nil;
  1666. right := nil;
  1667. end;
  1668. else
  1669. internalerror(200108311);
  1670. end;
  1671. end;
  1672. function taddnode.use_generic_mul32to64: boolean;
  1673. begin
  1674. result := true;
  1675. end;
  1676. function taddnode.try_make_mul32to64: boolean;
  1677. function canbe32bitint(v: tconstexprint; fromdef: torddef; todefsigned: boolean): boolean;
  1678. begin
  1679. if (fromdef.typ <> u64bit) then
  1680. result :=
  1681. ((v >= 0) or
  1682. todefsigned) and
  1683. (v >= low(longint)) and
  1684. (v <= high(longint))
  1685. else
  1686. result :=
  1687. (qword(v) >= low(cardinal)) and
  1688. (qword(v) <= high(cardinal))
  1689. end;
  1690. var
  1691. temp: tnode;
  1692. begin
  1693. result := false;
  1694. if ((left.nodetype = typeconvn) and
  1695. is_integer(ttypeconvnode(left).left.resulttype.def) and
  1696. (not(torddef(ttypeconvnode(left).left.resulttype.def).typ in [u64bit,s64bit])) and
  1697. (((right.nodetype = ordconstn) and
  1698. canbe32bitint(tordconstnode(right).value,torddef(right.resulttype.def),is_signed(left.resulttype.def))) or
  1699. ((right.nodetype = typeconvn) and
  1700. is_integer(ttypeconvnode(right).left.resulttype.def) and
  1701. not(torddef(ttypeconvnode(right).left.resulttype.def).typ in [u64bit,s64bit])) and
  1702. (is_signed(ttypeconvnode(left).left.resulttype.def) =
  1703. is_signed(ttypeconvnode(right).left.resulttype.def)))) then
  1704. begin
  1705. temp := ttypeconvnode(left).left;
  1706. ttypeconvnode(left).left := nil;
  1707. left.free;
  1708. left := temp;
  1709. if (right.nodetype = typeconvn) then
  1710. begin
  1711. temp := ttypeconvnode(right).left;
  1712. ttypeconvnode(right).left := nil;
  1713. right.free;
  1714. right := temp;
  1715. end;
  1716. if (is_signed(left.resulttype.def)) then
  1717. begin
  1718. inserttypeconv(left,s32inttype);
  1719. inserttypeconv(right,s32inttype);
  1720. end
  1721. else
  1722. begin
  1723. inserttypeconv(left,u32inttype);
  1724. inserttypeconv(right,u32inttype);
  1725. end;
  1726. firstpass(left);
  1727. firstpass(right);
  1728. result := true;
  1729. end;
  1730. end;
  1731. function taddnode.first_add64bitint: tnode;
  1732. var
  1733. procname: string[31];
  1734. temp: tnode;
  1735. power: longint;
  1736. begin
  1737. result := nil;
  1738. { create helper calls mul }
  1739. if nodetype <> muln then
  1740. exit;
  1741. { make sure that if there is a constant, that it's on the right }
  1742. if left.nodetype = ordconstn then
  1743. begin
  1744. temp := right;
  1745. right := left;
  1746. left := temp;
  1747. end;
  1748. { can we use a shift instead of a mul? }
  1749. if not (cs_check_overflow in aktlocalswitches) and
  1750. (right.nodetype = ordconstn) and
  1751. ispowerof2(tordconstnode(right).value,power) then
  1752. begin
  1753. tordconstnode(right).value := power;
  1754. result := cshlshrnode.create(shln,left,right);
  1755. { left and right are reused }
  1756. left := nil;
  1757. right := nil;
  1758. { return firstpassed new node }
  1759. exit;
  1760. end;
  1761. if not(use_generic_mul32to64) and
  1762. try_make_mul32to64 then
  1763. exit;
  1764. { when currency is used set the result of the
  1765. parameters to s64bit, so they are not converted }
  1766. if is_currency(resulttype.def) then
  1767. begin
  1768. left.resulttype:=s64inttype;
  1769. right.resulttype:=s64inttype;
  1770. end;
  1771. { otherwise, create the parameters for the helper }
  1772. right := ccallparanode.create(
  1773. cordconstnode.create(ord(cs_check_overflow in aktlocalswitches),booltype,true),
  1774. ccallparanode.create(right,ccallparanode.create(left,nil)));
  1775. left := nil;
  1776. { only qword needs the unsigned code, the
  1777. signed code is also used for currency }
  1778. if is_signed(resulttype.def) then
  1779. procname := 'fpc_mul_int64'
  1780. else
  1781. procname := 'fpc_mul_qword';
  1782. result := ccallnode.createintern(procname,right);
  1783. right := nil;
  1784. end;
  1785. function taddnode.first_addfloat : tnode;
  1786. var
  1787. procname: string[31];
  1788. { do we need to reverse the result ? }
  1789. notnode : boolean;
  1790. begin
  1791. result := nil;
  1792. notnode := false;
  1793. { In non-emulation mode, real opcodes are
  1794. emitted for floating point values.
  1795. }
  1796. if not (cs_fp_emulation in aktmoduleswitches) then
  1797. exit;
  1798. if not(target_info.system in system_wince) then
  1799. begin
  1800. case tfloatdef(left.resulttype.def).typ of
  1801. s32real:
  1802. procname:='float32';
  1803. s64real:
  1804. procname:='float64';
  1805. {!!! not yet implemented
  1806. s128real:
  1807. }
  1808. else
  1809. internalerror(2005082601);
  1810. end;
  1811. case nodetype of
  1812. addn:
  1813. procname:=procname+'_add';
  1814. muln:
  1815. procname:=procname+'_mul';
  1816. subn:
  1817. procname:=procname+'_sub';
  1818. slashn:
  1819. procname:=procname+'_div';
  1820. ltn:
  1821. procname:=procname+'_lt';
  1822. lten:
  1823. procname:=procname+'_le';
  1824. gtn:
  1825. begin
  1826. procname:=procname+'_le';
  1827. notnode:=true;
  1828. end;
  1829. gten:
  1830. begin
  1831. procname:=procname+'_lt';
  1832. notnode:=true;
  1833. end;
  1834. equaln:
  1835. procname:=procname+'_eq';
  1836. unequaln:
  1837. begin
  1838. procname:=procname+'_eq';
  1839. notnode:=true;
  1840. end;
  1841. else
  1842. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),left.resulttype.def.typename,right.resulttype.def.typename);
  1843. end;
  1844. end
  1845. else
  1846. begin
  1847. case nodetype of
  1848. addn:
  1849. procname:='ADD';
  1850. muln:
  1851. procname:='MUL';
  1852. subn:
  1853. procname:='SUB';
  1854. slashn:
  1855. procname:='DIV';
  1856. ltn:
  1857. procname:='LT';
  1858. lten:
  1859. procname:='LE';
  1860. gtn:
  1861. procname:='GT';
  1862. gten:
  1863. procname:='GE';
  1864. equaln:
  1865. procname:='EQ';
  1866. unequaln:
  1867. procname:='NE';
  1868. else
  1869. CGMessage3(type_e_operator_not_supported_for_types,node2opstr(nodetype),left.resulttype.def.typename,right.resulttype.def.typename);
  1870. end;
  1871. case tfloatdef(left.resulttype.def).typ of
  1872. s32real:
  1873. procname:=procname+'S';
  1874. s64real:
  1875. procname:=procname+'D';
  1876. {!!! not yet implemented
  1877. s128real:
  1878. }
  1879. else
  1880. internalerror(2005082602);
  1881. end;
  1882. end;
  1883. result:=ccallnode.createintern(procname,ccallparanode.create(right,
  1884. ccallparanode.create(left,nil)));
  1885. left:=nil;
  1886. right:=nil;
  1887. { do we need to reverse the result }
  1888. if notnode then
  1889. result:=cnotnode.create(result);
  1890. end;
  1891. function taddnode.pass_1 : tnode;
  1892. var
  1893. {$ifdef addstringopt}
  1894. hp : tnode;
  1895. {$endif addstringopt}
  1896. lt,rt : tnodetype;
  1897. rd,ld : tdef;
  1898. begin
  1899. result:=nil;
  1900. { Can we optimize multiple string additions into a single call?
  1901. This need to be done on a complete tree to detect the multiple
  1902. add nodes and is therefor done before the subtrees are processed }
  1903. if canbemultistringadd(self) then
  1904. begin
  1905. result := genmultistringadd(self);
  1906. exit;
  1907. end;
  1908. { first do the two subtrees }
  1909. firstpass(left);
  1910. firstpass(right);
  1911. if codegenerror then
  1912. exit;
  1913. { load easier access variables }
  1914. rd:=right.resulttype.def;
  1915. ld:=left.resulttype.def;
  1916. rt:=right.nodetype;
  1917. lt:=left.nodetype;
  1918. { int/int gives real/real! }
  1919. if nodetype=slashn then
  1920. begin
  1921. {$ifdef cpufpemu}
  1922. if (aktfputype=fpu_soft) or (cs_fp_emulation in aktmoduleswitches) then
  1923. begin
  1924. result:=first_addfloat;
  1925. if assigned(result) then
  1926. exit;
  1927. end;
  1928. {$endif cpufpemu}
  1929. expectloc:=LOC_FPUREGISTER;
  1930. { maybe we need an integer register to save }
  1931. { a reference }
  1932. if ((left.expectloc<>LOC_FPUREGISTER) or
  1933. (right.expectloc<>LOC_FPUREGISTER)) and
  1934. (left.registersint=right.registersint) then
  1935. calcregisters(self,1,1,0)
  1936. else
  1937. calcregisters(self,0,1,0);
  1938. { an add node always first loads both the left and the }
  1939. { right in the fpu before doing the calculation. However, }
  1940. { calcregisters(0,2,0) will overestimate the number of }
  1941. { necessary registers (it will make it 3 in case one of }
  1942. { the operands is already in the fpu) (JM) }
  1943. if ((left.expectloc<>LOC_FPUREGISTER) or
  1944. (right.expectloc<>LOC_FPUREGISTER)) and
  1945. (registersfpu < 2) then
  1946. inc(registersfpu);
  1947. end
  1948. { if both are orddefs then check sub types }
  1949. else if (ld.deftype=orddef) and (rd.deftype=orddef) then
  1950. begin
  1951. { 2 booleans ? }
  1952. if is_boolean(ld) and is_boolean(rd) then
  1953. begin
  1954. if not(cs_full_boolean_eval in aktlocalswitches) and
  1955. (nodetype in [andn,orn]) then
  1956. begin
  1957. expectloc:=LOC_JUMP;
  1958. calcregisters(self,0,0,0);
  1959. end
  1960. else
  1961. begin
  1962. if nodetype in [ltn,lten,gtn,gten,equaln,unequaln] then
  1963. begin
  1964. expectloc:=LOC_FLAGS;
  1965. if (left.expectloc in [LOC_JUMP,LOC_FLAGS]) and
  1966. (left.expectloc in [LOC_JUMP,LOC_FLAGS]) then
  1967. calcregisters(self,2,0,0)
  1968. else
  1969. calcregisters(self,1,0,0);
  1970. end
  1971. else
  1972. begin
  1973. expectloc:=LOC_REGISTER;
  1974. calcregisters(self,0,0,0);
  1975. end;
  1976. end;
  1977. end
  1978. else
  1979. { Both are chars? only convert to shortstrings for addn }
  1980. if is_char(ld) then
  1981. begin
  1982. if nodetype=addn then
  1983. internalerror(200103291);
  1984. expectloc:=LOC_FLAGS;
  1985. calcregisters(self,1,0,0);
  1986. end
  1987. {$ifndef cpu64bit}
  1988. { is there a 64 bit type ? }
  1989. else if (torddef(ld).typ in [s64bit,u64bit,scurrency]) then
  1990. begin
  1991. result := first_add64bitint;
  1992. if assigned(result) then
  1993. exit;
  1994. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  1995. expectloc:=LOC_REGISTER
  1996. else
  1997. expectloc:=LOC_JUMP;
  1998. calcregisters(self,2,0,0)
  1999. end
  2000. {$endif cpu64bit}
  2001. { is there a cardinal? }
  2002. else if (torddef(ld).typ=u32bit) then
  2003. begin
  2004. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2005. expectloc:=LOC_REGISTER
  2006. else
  2007. expectloc:=LOC_FLAGS;
  2008. calcregisters(self,1,0,0);
  2009. { for unsigned mul we need an extra register }
  2010. if nodetype=muln then
  2011. inc(registersint);
  2012. end
  2013. { generic s32bit conversion }
  2014. else
  2015. begin
  2016. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2017. expectloc:=LOC_REGISTER
  2018. else
  2019. expectloc:=LOC_FLAGS;
  2020. calcregisters(self,1,0,0);
  2021. end;
  2022. end
  2023. { left side a setdef, must be before string processing,
  2024. else array constructor can be seen as array of char (PFV) }
  2025. else if (ld.deftype=setdef) then
  2026. begin
  2027. if tsetdef(ld).settype=smallset then
  2028. begin
  2029. if nodetype in [ltn,lten,gtn,gten,equaln,unequaln] then
  2030. expectloc:=LOC_FLAGS
  2031. else
  2032. expectloc:=LOC_REGISTER;
  2033. { are we adding set elements ? }
  2034. if right.nodetype=setelementn then
  2035. calcregisters(self,2,0,0)
  2036. else
  2037. calcregisters(self,1,0,0);
  2038. end
  2039. else
  2040. {$ifdef MMXSET}
  2041. {$ifdef i386}
  2042. if cs_mmx in aktlocalswitches then
  2043. begin
  2044. expectloc:=LOC_MMXREGISTER;
  2045. calcregisters(self,0,0,4);
  2046. end
  2047. else
  2048. {$endif}
  2049. {$endif MMXSET}
  2050. begin
  2051. result := first_addset;
  2052. if assigned(result) then
  2053. exit;
  2054. expectloc:=LOC_CREFERENCE;
  2055. calcregisters(self,0,0,0);
  2056. { here we call SET... }
  2057. include(current_procinfo.flags,pi_do_call);
  2058. end;
  2059. end
  2060. { compare pchar by addresses like BP/Delphi }
  2061. else if is_pchar(ld) then
  2062. begin
  2063. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2064. expectloc:=LOC_REGISTER
  2065. else
  2066. expectloc:=LOC_FLAGS;
  2067. calcregisters(self,1,0,0);
  2068. end
  2069. { is one of the operands a string }
  2070. else if (ld.deftype=stringdef) then
  2071. begin
  2072. if is_widestring(ld) then
  2073. begin
  2074. { this is only for add, the comparisaion is handled later }
  2075. expectloc:=LOC_REGISTER;
  2076. end
  2077. else if is_ansistring(ld) then
  2078. begin
  2079. { this is only for add, the comparisaion is handled later }
  2080. expectloc:=LOC_REGISTER;
  2081. end
  2082. else if is_longstring(ld) then
  2083. begin
  2084. { this is only for add, the comparisaion is handled later }
  2085. expectloc:=LOC_REFERENCE;
  2086. end
  2087. else
  2088. begin
  2089. {$ifdef addstringopt}
  2090. { can create a call which isn't handled by callparatemp }
  2091. if canbeaddsstringcharoptnode(self) then
  2092. begin
  2093. hp := genaddsstringcharoptnode(self);
  2094. pass_1 := hp;
  2095. exit;
  2096. end
  2097. else
  2098. {$endif addstringopt}
  2099. begin
  2100. { Fix right to be shortstring }
  2101. if is_char(right.resulttype.def) then
  2102. begin
  2103. inserttypeconv(right,cshortstringtype);
  2104. firstpass(right);
  2105. end;
  2106. end;
  2107. {$ifdef addstringopt}
  2108. { can create a call which isn't handled by callparatemp }
  2109. if canbeaddsstringcsstringoptnode(self) then
  2110. begin
  2111. hp := genaddsstringcsstringoptnode(self);
  2112. pass_1 := hp;
  2113. exit;
  2114. end;
  2115. {$endif addstringopt}
  2116. end;
  2117. { otherwise, let addstring convert everything }
  2118. result := first_addstring;
  2119. exit;
  2120. end
  2121. { is one a real float ? }
  2122. else if (rd.deftype=floatdef) or (ld.deftype=floatdef) then
  2123. begin
  2124. {$ifdef cpufpemu}
  2125. if (aktfputype=fpu_soft) or (cs_fp_emulation in aktmoduleswitches) then
  2126. begin
  2127. result:=first_addfloat;
  2128. if assigned(result) then
  2129. exit;
  2130. end;
  2131. {$endif cpufpemu}
  2132. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2133. expectloc:=LOC_FPUREGISTER
  2134. else
  2135. expectloc:=LOC_FLAGS;
  2136. calcregisters(self,0,1,0);
  2137. { an add node always first loads both the left and the }
  2138. { right in the fpu before doing the calculation. However, }
  2139. { calcregisters(0,2,0) will overestimate the number of }
  2140. { necessary registers (it will make it 3 in case one of }
  2141. { the operands is already in the fpu) (JM) }
  2142. if ((left.expectloc<>LOC_FPUREGISTER) or
  2143. (right.expectloc<>LOC_FPUREGISTER)) and
  2144. (registersfpu < 2) then
  2145. inc(registersfpu);
  2146. end
  2147. { pointer comperation and subtraction }
  2148. else if (ld.deftype=pointerdef) then
  2149. begin
  2150. if nodetype in [addn,subn,muln,andn,orn,xorn] then
  2151. expectloc:=LOC_REGISTER
  2152. else
  2153. expectloc:=LOC_FLAGS;
  2154. calcregisters(self,1,0,0);
  2155. end
  2156. else if is_class_or_interface(ld) then
  2157. begin
  2158. expectloc:=LOC_FLAGS;
  2159. calcregisters(self,1,0,0);
  2160. end
  2161. else if (ld.deftype=classrefdef) then
  2162. begin
  2163. expectloc:=LOC_FLAGS;
  2164. calcregisters(self,1,0,0);
  2165. end
  2166. { support procvar=nil,procvar<>nil }
  2167. else if ((ld.deftype=procvardef) and (rt=niln)) or
  2168. ((rd.deftype=procvardef) and (lt=niln)) then
  2169. begin
  2170. expectloc:=LOC_FLAGS;
  2171. calcregisters(self,1,0,0);
  2172. end
  2173. {$ifdef SUPPORT_MMX}
  2174. { mmx support, this must be before the zero based array
  2175. check }
  2176. else if (cs_mmx in aktlocalswitches) and is_mmx_able_array(ld) and
  2177. is_mmx_able_array(rd) then
  2178. begin
  2179. expectloc:=LOC_MMXREGISTER;
  2180. calcregisters(self,0,0,1);
  2181. end
  2182. {$endif SUPPORT_MMX}
  2183. else if (rd.deftype=pointerdef) or (ld.deftype=pointerdef) then
  2184. begin
  2185. expectloc:=LOC_REGISTER;
  2186. calcregisters(self,1,0,0);
  2187. end
  2188. else if (rd.deftype=procvardef) and
  2189. (ld.deftype=procvardef) and
  2190. equal_defs(rd,ld) then
  2191. begin
  2192. expectloc:=LOC_FLAGS;
  2193. calcregisters(self,1,0,0);
  2194. end
  2195. else if (ld.deftype=enumdef) then
  2196. begin
  2197. expectloc:=LOC_FLAGS;
  2198. calcregisters(self,1,0,0);
  2199. end
  2200. {$ifdef SUPPORT_MMX}
  2201. else if (cs_mmx in aktlocalswitches) and
  2202. is_mmx_able_array(ld) and
  2203. is_mmx_able_array(rd) then
  2204. begin
  2205. expectloc:=LOC_MMXREGISTER;
  2206. calcregisters(self,0,0,1);
  2207. end
  2208. {$endif SUPPORT_MMX}
  2209. { the general solution is to convert to 32 bit int }
  2210. else
  2211. begin
  2212. expectloc:=LOC_REGISTER;
  2213. calcregisters(self,1,0,0);
  2214. end;
  2215. end;
  2216. {$ifdef state_tracking}
  2217. function Taddnode.track_state_pass(exec_known:boolean):boolean;
  2218. var factval:Tnode;
  2219. begin
  2220. track_state_pass:=false;
  2221. if left.track_state_pass(exec_known) then
  2222. begin
  2223. track_state_pass:=true;
  2224. left.resulttype.def:=nil;
  2225. do_resulttypepass(left);
  2226. end;
  2227. factval:=aktstate.find_fact(left);
  2228. if factval<>nil then
  2229. begin
  2230. track_state_pass:=true;
  2231. left.destroy;
  2232. left:=factval.getcopy;
  2233. end;
  2234. if right.track_state_pass(exec_known) then
  2235. begin
  2236. track_state_pass:=true;
  2237. right.resulttype.def:=nil;
  2238. do_resulttypepass(right);
  2239. end;
  2240. factval:=aktstate.find_fact(right);
  2241. if factval<>nil then
  2242. begin
  2243. track_state_pass:=true;
  2244. right.destroy;
  2245. right:=factval.getcopy;
  2246. end;
  2247. end;
  2248. {$endif}
  2249. begin
  2250. caddnode:=taddnode;
  2251. end.