nadd.pas 94 KB

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