nadd.pas 109 KB

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