cg386add.pas 104 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate i386 assembler for in add node
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit cg386add;
  19. interface
  20. {$define usecreateset}
  21. uses
  22. tree;
  23. procedure secondadd(var p : ptree);
  24. implementation
  25. uses
  26. globtype,systems,
  27. cobjects,verbose,globals,
  28. symtable,aasm,types,
  29. hcodegen,temp_gen,pass_2,
  30. {$ifndef OLDASM}
  31. i386base,i386asm,
  32. {$else}
  33. i386,
  34. {$endif}
  35. cgai386,tgeni386;
  36. {*****************************************************************************
  37. Helpers
  38. *****************************************************************************}
  39. procedure locflags2reg(var l:tlocation;opsize:topsize);
  40. var
  41. hregister : tregister;
  42. begin
  43. if (l.loc=LOC_FLAGS) then
  44. begin
  45. case opsize of
  46. S_L : hregister:=getregister32;
  47. S_W : hregister:=reg32toreg16(getregister32);
  48. S_B : hregister:=reg32toreg8(getregister32);
  49. end;
  50. emit_flag2reg(l.resflags,hregister);
  51. l.loc:=LOC_REGISTER;
  52. l.register:=hregister;
  53. end;
  54. end;
  55. function getresflags(p : ptree;unsigned : boolean) : tresflags;
  56. begin
  57. if not(unsigned) then
  58. begin
  59. if p^.swaped then
  60. case p^.treetype of
  61. equaln : getresflags:=F_E;
  62. unequaln : getresflags:=F_NE;
  63. ltn : getresflags:=F_G;
  64. lten : getresflags:=F_GE;
  65. gtn : getresflags:=F_L;
  66. gten : getresflags:=F_LE;
  67. end
  68. else
  69. case p^.treetype of
  70. equaln : getresflags:=F_E;
  71. unequaln : getresflags:=F_NE;
  72. ltn : getresflags:=F_L;
  73. lten : getresflags:=F_LE;
  74. gtn : getresflags:=F_G;
  75. gten : getresflags:=F_GE;
  76. end;
  77. end
  78. else
  79. begin
  80. if p^.swaped then
  81. case p^.treetype of
  82. equaln : getresflags:=F_E;
  83. unequaln : getresflags:=F_NE;
  84. ltn : getresflags:=F_A;
  85. lten : getresflags:=F_AE;
  86. gtn : getresflags:=F_B;
  87. gten : getresflags:=F_BE;
  88. end
  89. else
  90. case p^.treetype of
  91. equaln : getresflags:=F_E;
  92. unequaln : getresflags:=F_NE;
  93. ltn : getresflags:=F_B;
  94. lten : getresflags:=F_BE;
  95. gtn : getresflags:=F_A;
  96. gten : getresflags:=F_AE;
  97. end;
  98. end;
  99. end;
  100. procedure SetResultLocation(cmpop,unsigned:boolean;var p :ptree);
  101. begin
  102. { remove temporary location if not a set or string }
  103. { that's a bad hack (FK) who did this ? }
  104. if (p^.left^.resulttype^.deftype<>stringdef) and
  105. ((p^.left^.resulttype^.deftype<>setdef) or (psetdef(p^.left^.resulttype)^.settype=smallset)) and
  106. (p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  107. ungetiftemp(p^.left^.location.reference);
  108. if (p^.right^.resulttype^.deftype<>stringdef) and
  109. ((p^.right^.resulttype^.deftype<>setdef) or (psetdef(p^.right^.resulttype)^.settype=smallset)) and
  110. (p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  111. ungetiftemp(p^.right^.location.reference);
  112. { in case of comparison operation the put result in the flags }
  113. if cmpop then
  114. begin
  115. clear_location(p^.location);
  116. p^.location.loc:=LOC_FLAGS;
  117. p^.location.resflags:=getresflags(p,unsigned);
  118. end;
  119. end;
  120. {*****************************************************************************
  121. Addstring
  122. *****************************************************************************}
  123. procedure addstring(var p : ptree);
  124. var
  125. pushedregs : tpushed;
  126. href : treference;
  127. pushed,
  128. cmpop : boolean;
  129. begin
  130. { string operations are not commutative }
  131. if p^.swaped then
  132. swaptree(p);
  133. case pstringdef(p^.left^.resulttype)^.string_typ of
  134. st_ansistring:
  135. begin
  136. case p^.treetype of
  137. addn:
  138. begin
  139. cmpop:=false;
  140. secondpass(p^.left);
  141. { to avoid problem with maybe_push and restore }
  142. set_location(p^.location,p^.left^.location);
  143. pushed:=maybe_push(p^.right^.registers32,p);
  144. secondpass(p^.right);
  145. if pushed then restore(p);
  146. { release used registers }
  147. case p^.right^.location.loc of
  148. LOC_REFERENCE,LOC_MEM:
  149. del_reference(p^.right^.location.reference);
  150. LOC_REGISTER,LOC_CREGISTER:
  151. ungetregister32(p^.right^.location.register);
  152. end;
  153. case p^.left^.location.loc of
  154. LOC_REFERENCE,LOC_MEM:
  155. del_reference(p^.left^.location.reference);
  156. LOC_REGISTER,LOC_CREGISTER:
  157. ungetregister32(p^.left^.location.register);
  158. end;
  159. { push the still used registers }
  160. pushusedregisters(exprasmlist,pushedregs,$ff);
  161. { push data }
  162. clear_location(p^.location);
  163. p^.location.loc:=LOC_MEM;
  164. gettempansistringreference(p^.location.reference);
  165. emitpushreferenceaddr(exprasmlist,p^.location.reference);
  166. emit_push_loc(p^.right^.location);
  167. emit_push_loc(p^.left^.location);
  168. emitcall('FPC_ANSISTR_CONCAT',true);
  169. popusedregisters(exprasmlist,pushedregs);
  170. maybe_loadesi;
  171. ungetiftempansi(p^.left^.location.reference);
  172. ungetiftempansi(p^.right^.location.reference);
  173. end;
  174. ltn,lten,gtn,gten,
  175. equaln,unequaln:
  176. begin
  177. cmpop:=true;
  178. secondpass(p^.left);
  179. pushed:=maybe_push(p^.right^.registers32,p);
  180. secondpass(p^.right);
  181. if pushed then restore(p);
  182. { release used registers }
  183. case p^.right^.location.loc of
  184. LOC_REFERENCE,LOC_MEM:
  185. del_reference(p^.right^.location.reference);
  186. LOC_REGISTER,LOC_CREGISTER:
  187. ungetregister32(p^.right^.location.register);
  188. end;
  189. case p^.left^.location.loc of
  190. LOC_REFERENCE,LOC_MEM:
  191. del_reference(p^.left^.location.reference);
  192. LOC_REGISTER,LOC_CREGISTER:
  193. ungetregister32(p^.left^.location.register);
  194. end;
  195. { push the still used registers }
  196. pushusedregisters(exprasmlist,pushedregs,$ff);
  197. { push data }
  198. case p^.right^.location.loc of
  199. LOC_REFERENCE,LOC_MEM:
  200. emit_push_mem(p^.right^.location.reference);
  201. LOC_REGISTER,LOC_CREGISTER:
  202. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,p^.right^.location.register)));
  203. end;
  204. case p^.left^.location.loc of
  205. LOC_REFERENCE,LOC_MEM:
  206. emit_push_mem(p^.left^.location.reference);
  207. LOC_REGISTER,LOC_CREGISTER:
  208. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,p^.left^.location.register)));
  209. end;
  210. emitcall('FPC_ANSISTR_COMPARE',true);
  211. emit_reg_reg(A_OR,S_L,R_EAX,R_EAX);
  212. popusedregisters(exprasmlist,pushedregs);
  213. maybe_loadesi;
  214. { done in temptoremove (PM)
  215. ungetiftemp(p^.left^.location.reference);
  216. ungetiftemp(p^.right^.location.reference); }
  217. end;
  218. end;
  219. { the result of ansicompare is signed }
  220. SetResultLocation(cmpop,false,p);
  221. end;
  222. st_shortstring:
  223. begin
  224. case p^.treetype of
  225. addn:
  226. begin
  227. cmpop:=false;
  228. secondpass(p^.left);
  229. { if str_concat is set in expr
  230. s:=s+ ... no need to create a temp string (PM) }
  231. if (p^.left^.treetype<>addn) and not (p^.use_strconcat) then
  232. begin
  233. { can only reference be }
  234. { string in register would be funny }
  235. { therefore produce a temporary string }
  236. { release the registers }
  237. del_reference(p^.left^.location.reference);
  238. gettempofsizereference(256,href);
  239. copyshortstring(href,p^.left^.location.reference,255,false);
  240. ungetiftemp(p^.left^.location.reference);
  241. { does not hurt: }
  242. clear_location(p^.left^.location);
  243. p^.left^.location.loc:=LOC_MEM;
  244. p^.left^.location.reference:=href;
  245. end;
  246. secondpass(p^.right);
  247. { on the right we do not need the register anymore too }
  248. {$IfNDef regallocfix}
  249. del_reference(p^.right^.location.reference);
  250. pushusedregisters(exprasmlist,pushedregs,$ff);
  251. {$Else regallocfix}
  252. pushusedregisters(pushedregs,$ff
  253. xor ($80 shr byte(p^.right^.location.reference.base))
  254. xor ($80 shr byte(p^.right^.location.reference.index)));
  255. {$EndIf regallocfix}
  256. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  257. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  258. {$IfDef regallocfix}
  259. del_reference(p^.right^.location.reference);
  260. {$EndIf regallocfix}
  261. emitcall('FPC_SHORTSTR_CONCAT',true);
  262. maybe_loadesi;
  263. popusedregisters(exprasmlist,pushedregs);
  264. set_location(p^.location,p^.left^.location);
  265. ungetiftemp(p^.right^.location.reference);
  266. end;
  267. ltn,lten,gtn,gten,
  268. equaln,unequaln :
  269. begin
  270. cmpop:=true;
  271. { generate better code for s='' and s<>'' }
  272. if (p^.treetype in [equaln,unequaln]) and
  273. (((p^.left^.treetype=stringconstn) and (str_length(p^.left)=0)) or
  274. ((p^.right^.treetype=stringconstn) and (str_length(p^.right)=0))) then
  275. begin
  276. secondpass(p^.left);
  277. { are too few registers free? }
  278. pushed:=maybe_push(p^.right^.registers32,p);
  279. secondpass(p^.right);
  280. if pushed then restore(p);
  281. { only one node can be stringconstn }
  282. { else pass 1 would have evaluted }
  283. { this node }
  284. if p^.left^.treetype=stringconstn then
  285. exprasmlist^.concat(new(pai386,op_const_ref(
  286. A_CMP,S_B,0,newreference(p^.right^.location.reference))))
  287. else
  288. exprasmlist^.concat(new(pai386,op_const_ref(
  289. A_CMP,S_B,0,newreference(p^.left^.location.reference))));
  290. del_reference(p^.right^.location.reference);
  291. del_reference(p^.left^.location.reference);
  292. end
  293. else
  294. begin
  295. pushusedregisters(exprasmlist,pushedregs,$ff);
  296. secondpass(p^.left);
  297. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  298. del_reference(p^.left^.location.reference);
  299. secondpass(p^.right);
  300. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  301. del_reference(p^.right^.location.reference);
  302. emitcall('FPC_SHORTSTR_COMPARE',true);
  303. maybe_loadesi;
  304. popusedregisters(exprasmlist,pushedregs);
  305. end;
  306. ungetiftemp(p^.left^.location.reference);
  307. ungetiftemp(p^.right^.location.reference);
  308. end;
  309. else CGMessage(type_e_mismatch);
  310. end;
  311. SetResultLocation(cmpop,true,p);
  312. end;
  313. end;
  314. end;
  315. {*****************************************************************************
  316. Addset
  317. *****************************************************************************}
  318. procedure addset(var p : ptree);
  319. var
  320. createset,
  321. cmpop,
  322. pushed : boolean;
  323. href : treference;
  324. pushedregs : tpushed;
  325. begin
  326. cmpop:=false;
  327. { not commutative }
  328. if p^.swaped then
  329. swaptree(p);
  330. { optimize first loading of a set }
  331. {$ifdef usecreateset}
  332. if (p^.right^.treetype=setelementn) and
  333. not(assigned(p^.right^.right)) and
  334. is_emptyset(p^.left) then
  335. createset:=true
  336. else
  337. {$endif}
  338. begin
  339. createset:=false;
  340. secondpass(p^.left);
  341. end;
  342. { are too few registers free? }
  343. pushed:=maybe_push(p^.right^.registers32,p);
  344. secondpass(p^.right);
  345. if codegenerror then
  346. exit;
  347. if pushed then
  348. restore(p);
  349. set_location(p^.location,p^.left^.location);
  350. { handle operations }
  351. {$IfDef regallocfix}
  352. pushusedregisters(pushedregs,$ff
  353. xor ($80 shr byte(p^.left^.location.reference.base))
  354. xor ($80 shr byte(p^.left^.location.reference.index))
  355. xor ($80 shr byte(p^.right^.location.reference.base))
  356. xor ($80 shr byte(p^.right^.location.reference.index)));
  357. {$EndIf regallocfix}
  358. case p^.treetype of
  359. equaln,
  360. unequaln
  361. {$IfNDef NoSetInclusion}
  362. ,lten, gten
  363. {$EndIf NoSetInclusion}
  364. : begin
  365. cmpop:=true;
  366. {$IfNDef regallocfix}
  367. del_reference(p^.left^.location.reference);
  368. del_reference(p^.right^.location.reference);
  369. pushusedregisters(exprasmlist,pushedregs,$ff);
  370. {$EndIf regallocfix}
  371. {$IfNDef NoSetInclusion}
  372. If (p^.treetype in [equaln, unequaln, lten]) Then
  373. Begin
  374. {$EndIf NoSetInclusion}
  375. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  376. {$IfDef regallocfix}
  377. del_reference(p^.right^.location.reference);
  378. {$EndIf regallocfix}
  379. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  380. {$IfDef regallocfix}
  381. del_reference(p^.left^.location.reference);
  382. {$EndIf regallocfix}
  383. {$IfNDef NoSetInclusion}
  384. End
  385. Else {gten = lten, if the arguments are reversed}
  386. Begin
  387. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  388. {$IfDef regallocfix}
  389. del_reference(p^.left^.location.reference);
  390. {$EndIf regallocfix}
  391. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  392. {$IfDef regallocfix}
  393. del_reference(p^.right^.location.reference);
  394. {$EndIf regallocfix}
  395. End;
  396. Case p^.treetype of
  397. equaln, unequaln:
  398. {$EndIf NoSetInclusion}
  399. emitcall('FPC_SET_COMP_SETS',true);
  400. {$IfNDef NoSetInclusion}
  401. lten, gten: emitcall('FPC_SET_CONTAINS_SETS',true)
  402. End;
  403. {$EndIf NoSetInclusion}
  404. maybe_loadesi;
  405. popusedregisters(exprasmlist,pushedregs);
  406. ungetiftemp(p^.left^.location.reference);
  407. ungetiftemp(p^.right^.location.reference);
  408. end;
  409. addn : begin
  410. { add can be an other SET or Range or Element ! }
  411. {$IfNDef regallocfix}
  412. del_reference(p^.left^.location.reference);
  413. del_reference(p^.right^.location.reference);
  414. pushusedregisters(exprasmlist,pushedregs,$ff);
  415. {$EndIf regallocfix}
  416. href.symbol:=nil;
  417. gettempofsizereference(32,href);
  418. if createset then
  419. begin
  420. {$IfDef regallocfix}
  421. del_reference(p^.left^.location.reference);
  422. del_reference(p^.right^.location.reference);
  423. {$EndIf regallocfix}
  424. pushsetelement(p^.right^.left);
  425. emitpushreferenceaddr(exprasmlist,href);
  426. emitcall('FPC_SET_CREATE_ELEMENT',true);
  427. end
  428. else
  429. begin
  430. { add a range or a single element? }
  431. if p^.right^.treetype=setelementn then
  432. begin
  433. {$IfNDef regallocfix}
  434. concatcopy(p^.left^.location.reference,href,32,false,false);
  435. {$Else regallocfix}
  436. concatcopy(p^.left^.location.reference,href,32,true,false);
  437. {$EndIf regallocfix}
  438. if assigned(p^.right^.right) then
  439. begin
  440. pushsetelement(p^.right^.right);
  441. pushsetelement(p^.right^.left);
  442. emitpushreferenceaddr(exprasmlist,href);
  443. emitcall('FPC_SET_SET_RANGE',true);
  444. end
  445. else
  446. begin
  447. pushsetelement(p^.right^.left);
  448. emitpushreferenceaddr(exprasmlist,href);
  449. emitcall('FPC_SET_SET_BYTE',true);
  450. end;
  451. end
  452. else
  453. begin
  454. { must be an other set }
  455. emitpushreferenceaddr(exprasmlist,href);
  456. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  457. {$IfDef regallocfix}
  458. del_reference(p^.right^.location.reference);
  459. {$EndIf regallocfix}
  460. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  461. {$IfDef regallocfix}
  462. del_reference(p^.left^.location.reference);
  463. {$EndIf regallocfix}
  464. emitcall('FPC_SET_ADD_SETS',true);
  465. end;
  466. end;
  467. maybe_loadesi;
  468. popusedregisters(exprasmlist,pushedregs);
  469. ungetiftemp(p^.left^.location.reference);
  470. ungetiftemp(p^.right^.location.reference);
  471. p^.location.loc:=LOC_MEM;
  472. p^.location.reference:=href;
  473. end;
  474. subn,
  475. symdifn,
  476. muln : begin
  477. {$IfNDef regallocfix}
  478. del_reference(p^.left^.location.reference);
  479. del_reference(p^.right^.location.reference);
  480. pushusedregisters(exprasmlist,pushedregs,$ff);
  481. {$EndIf regallocfix}
  482. href.symbol:=nil;
  483. gettempofsizereference(32,href);
  484. emitpushreferenceaddr(exprasmlist,href);
  485. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  486. {$IfDef regallocfix}
  487. del_reference(p^.right^.location.reference);
  488. {$EndIf regallocfix}
  489. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  490. {$IfDef regallocfix}
  491. del_reference(p^.left^.location.reference);
  492. {$EndIf regallocfix}
  493. case p^.treetype of
  494. subn : emitcall('FPC_SET_SUB_SETS',true);
  495. symdifn : emitcall('FPC_SET_SYMDIF_SETS',true);
  496. muln : emitcall('FPC_SET_MUL_SETS',true);
  497. end;
  498. maybe_loadesi;
  499. popusedregisters(exprasmlist,pushedregs);
  500. ungetiftemp(p^.left^.location.reference);
  501. ungetiftemp(p^.right^.location.reference);
  502. p^.location.loc:=LOC_MEM;
  503. p^.location.reference:=href;
  504. end;
  505. else
  506. CGMessage(type_e_mismatch);
  507. end;
  508. SetResultLocation(cmpop,true,p);
  509. end;
  510. {*****************************************************************************
  511. SecondAdd
  512. *****************************************************************************}
  513. procedure secondadd(var p : ptree);
  514. { is also being used for xor, and "mul", "sub, or and comparative }
  515. { operators }
  516. label do_normal;
  517. var
  518. hregister,hregister2 : tregister;
  519. noswap,popeax,popedx,
  520. pushed,mboverflow,cmpop : boolean;
  521. op,op2 : tasmop;
  522. flags : tresflags;
  523. otl,ofl,hl : plabel;
  524. power : longint;
  525. opsize : topsize;
  526. hl4: plabel;
  527. hr : preference;
  528. { true, if unsigned types are compared }
  529. unsigned : boolean;
  530. { true, if a small set is handled with the longint code }
  531. is_set : boolean;
  532. { is_in_dest if the result is put directly into }
  533. { the resulting refernce or varregister }
  534. is_in_dest : boolean;
  535. { true, if for sets subtractions the extra not should generated }
  536. extra_not : boolean;
  537. {$ifdef SUPPORT_MMX}
  538. mmxbase : tmmxtype;
  539. {$endif SUPPORT_MMX}
  540. pushedreg : tpushed;
  541. begin
  542. { to make it more readable, string and set (not smallset!) have their
  543. own procedures }
  544. case p^.left^.resulttype^.deftype of
  545. stringdef : begin
  546. addstring(p);
  547. exit;
  548. end;
  549. setdef : begin
  550. { normalsets are handled separate }
  551. if not(psetdef(p^.left^.resulttype)^.settype=smallset) then
  552. begin
  553. addset(p);
  554. exit;
  555. end;
  556. end;
  557. end;
  558. { defaults }
  559. unsigned:=false;
  560. is_in_dest:=false;
  561. extra_not:=false;
  562. noswap:=false;
  563. opsize:=S_L;
  564. { are we a (small)set, must be set here because the side can be
  565. swapped ! (PFV) }
  566. is_set:=(p^.left^.resulttype^.deftype=setdef);
  567. { calculate the operator which is more difficult }
  568. firstcomplex(p);
  569. { handling boolean expressions extra: }
  570. if is_boolean(p^.left^.resulttype) and
  571. is_boolean(p^.right^.resulttype) then
  572. begin
  573. if (porddef(p^.left^.resulttype)^.typ=bool8bit) or
  574. (porddef(p^.right^.resulttype)^.typ=bool8bit) then
  575. opsize:=S_B
  576. else
  577. if (porddef(p^.left^.resulttype)^.typ=bool16bit) or
  578. (porddef(p^.right^.resulttype)^.typ=bool16bit) then
  579. opsize:=S_W
  580. else
  581. opsize:=S_L;
  582. case p^.treetype of
  583. andn,
  584. orn : begin
  585. clear_location(p^.location);
  586. p^.location.loc:=LOC_JUMP;
  587. cmpop:=false;
  588. case p^.treetype of
  589. andn : begin
  590. otl:=truelabel;
  591. getlabel(truelabel);
  592. secondpass(p^.left);
  593. maketojumpbool(p^.left);
  594. emitlab(truelabel);
  595. truelabel:=otl;
  596. end;
  597. orn : begin
  598. ofl:=falselabel;
  599. getlabel(falselabel);
  600. secondpass(p^.left);
  601. maketojumpbool(p^.left);
  602. emitlab(falselabel);
  603. falselabel:=ofl;
  604. end;
  605. else
  606. CGMessage(type_e_mismatch);
  607. end;
  608. secondpass(p^.right);
  609. maketojumpbool(p^.right);
  610. end;
  611. unequaln,
  612. equaln,xorn : begin
  613. if p^.left^.treetype=ordconstn then
  614. swaptree(p);
  615. if p^.left^.location.loc=LOC_JUMP then
  616. begin
  617. otl:=truelabel;
  618. getlabel(truelabel);
  619. ofl:=falselabel;
  620. getlabel(falselabel);
  621. end;
  622. secondpass(p^.left);
  623. { if in flags then copy first to register, because the
  624. flags can be destroyed }
  625. case p^.left^.location.loc of
  626. LOC_FLAGS:
  627. locflags2reg(p^.left^.location,opsize);
  628. LOC_JUMP:
  629. begin
  630. case opsize of
  631. S_L : hregister:=getregister32;
  632. S_W : hregister:=reg32toreg16(getregister32);
  633. S_B : hregister:=reg32toreg8(getregister32);
  634. end;
  635. p^.left^.location.loc:=LOC_REGISTER;
  636. p^.left^.location.register:=hregister;
  637. emitlab(truelabel);
  638. truelabel:=otl;
  639. exprasmlist^.concat(new(pai386,op_const_reg(A_MOV,opsize,1,
  640. hregister)));
  641. getlabel(hl);
  642. emitjmp(C_None,hl);
  643. emitlab(falselabel);
  644. falselabel:=ofl;
  645. exprasmlist^.concat(new(pai386,op_reg_reg(A_XOR,S_L,makereg32(hregister),
  646. makereg32(hregister))));
  647. emitlab(hl);
  648. end;
  649. end;
  650. set_location(p^.location,p^.left^.location);
  651. pushed:=maybe_push(p^.right^.registers32,p);
  652. if p^.right^.location.loc=LOC_JUMP then
  653. begin
  654. otl:=truelabel;
  655. getlabel(truelabel);
  656. ofl:=falselabel;
  657. getlabel(falselabel);
  658. end;
  659. secondpass(p^.right);
  660. if pushed then restore(p);
  661. case p^.right^.location.loc of
  662. LOC_FLAGS:
  663. locflags2reg(p^.right^.location,opsize);
  664. LOC_JUMP:
  665. begin
  666. case opsize of
  667. S_L : hregister:=getregister32;
  668. S_W : hregister:=reg32toreg16(getregister32);
  669. S_B : hregister:=reg32toreg8(getregister32);
  670. end;
  671. p^.right^.location.loc:=LOC_REGISTER;
  672. p^.right^.location.register:=hregister;
  673. emitlab(truelabel);
  674. truelabel:=otl;
  675. exprasmlist^.concat(new(pai386,op_const_reg(A_MOV,opsize,1,
  676. hregister)));
  677. getlabel(hl);
  678. emitjmp(C_None,hl);
  679. emitlab(falselabel);
  680. falselabel:=ofl;
  681. exprasmlist^.concat(new(pai386,op_reg_reg(A_XOR,S_L,makereg32(hregister),
  682. makereg32(hregister))));
  683. emitlab(hl);
  684. end;
  685. end;
  686. goto do_normal;
  687. end
  688. else
  689. CGMessage(type_e_mismatch);
  690. end
  691. end
  692. else
  693. begin
  694. { in case of constant put it to the left }
  695. if (p^.left^.treetype=ordconstn) then
  696. swaptree(p);
  697. secondpass(p^.left);
  698. { this will be complicated as
  699. a lot of code below assumes that
  700. p^.location and p^.left^.location are the same }
  701. {$ifdef test_dest_loc}
  702. if dest_loc_known and (dest_loc_tree=p) and
  703. ((dest_loc.loc=LOC_REGISTER) or (dest_loc.loc=LOC_CREGISTER)) then
  704. begin
  705. set_location(p^.location,dest_loc);
  706. in_dest_loc:=true;
  707. is_in_dest:=true;
  708. end
  709. else
  710. {$endif test_dest_loc}
  711. set_location(p^.location,p^.left^.location);
  712. { are too few registers free? }
  713. pushed:=maybe_push(p^.right^.registers32,p);
  714. secondpass(p^.right);
  715. if pushed then
  716. restore(p);
  717. if (p^.left^.resulttype^.deftype=pointerdef) or
  718. (p^.right^.resulttype^.deftype=pointerdef) or
  719. ((p^.right^.resulttype^.deftype=objectdef) and
  720. pobjectdef(p^.right^.resulttype)^.isclass and
  721. (p^.left^.resulttype^.deftype=objectdef) and
  722. pobjectdef(p^.left^.resulttype)^.isclass
  723. ) or
  724. (p^.left^.resulttype^.deftype=classrefdef) or
  725. (p^.left^.resulttype^.deftype=procvardef) or
  726. ((p^.left^.resulttype^.deftype=enumdef) and
  727. (p^.left^.resulttype^.size=4)) or
  728. ((p^.left^.resulttype^.deftype=orddef) and
  729. (porddef(p^.left^.resulttype)^.typ=s32bit)) or
  730. ((p^.right^.resulttype^.deftype=orddef) and
  731. (porddef(p^.right^.resulttype)^.typ=s32bit)) or
  732. ((p^.left^.resulttype^.deftype=orddef) and
  733. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  734. ((p^.right^.resulttype^.deftype=orddef) and
  735. (porddef(p^.right^.resulttype)^.typ=u32bit)) or
  736. { as well as small sets }
  737. is_set then
  738. begin
  739. do_normal:
  740. mboverflow:=false;
  741. cmpop:=false;
  742. if (p^.left^.resulttype^.deftype=pointerdef) or
  743. (p^.right^.resulttype^.deftype=pointerdef) or
  744. ((p^.left^.resulttype^.deftype=orddef) and
  745. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  746. ((p^.right^.resulttype^.deftype=orddef) and
  747. (porddef(p^.right^.resulttype)^.typ=u32bit)) then
  748. unsigned:=true;
  749. case p^.treetype of
  750. addn : begin
  751. if is_set then
  752. begin
  753. { adding elements is not commutative }
  754. if p^.swaped and (p^.left^.treetype=setelementn) then
  755. swaptree(p);
  756. { are we adding set elements ? }
  757. if p^.right^.treetype=setelementn then
  758. begin
  759. { no range support for smallsets! }
  760. if assigned(p^.right^.right) then
  761. internalerror(43244);
  762. { bts requires both elements to be registers }
  763. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  764. begin
  765. ungetiftemp(p^.left^.location.reference);
  766. del_reference(p^.left^.location.reference);
  767. {!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!}
  768. hregister:=getregister32;
  769. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  770. newreference(p^.left^.location.reference),hregister)));
  771. clear_location(p^.left^.location);
  772. p^.left^.location.loc:=LOC_REGISTER;
  773. p^.left^.location.register:=hregister;
  774. set_location(p^.location,p^.left^.location);
  775. end;
  776. if p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  777. begin
  778. ungetiftemp(p^.right^.location.reference);
  779. del_reference(p^.right^.location.reference);
  780. hregister:=getregister32;
  781. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  782. newreference(p^.right^.location.reference),hregister)));
  783. clear_location(p^.right^.location);
  784. p^.right^.location.loc:=LOC_REGISTER;
  785. p^.right^.location.register:=hregister;
  786. end;
  787. op:=A_BTS;
  788. noswap:=true;
  789. end
  790. else
  791. op:=A_OR;
  792. mboverflow:=false;
  793. unsigned:=false;
  794. end
  795. else
  796. begin
  797. op:=A_ADD;
  798. mboverflow:=true;
  799. end;
  800. end;
  801. symdifn : begin
  802. { the symetric diff is only for sets }
  803. if is_set then
  804. begin
  805. op:=A_XOR;
  806. mboverflow:=false;
  807. unsigned:=false;
  808. end
  809. else
  810. CGMessage(type_e_mismatch);
  811. end;
  812. muln : begin
  813. if is_set then
  814. begin
  815. op:=A_AND;
  816. mboverflow:=false;
  817. unsigned:=false;
  818. end
  819. else
  820. begin
  821. if unsigned then
  822. op:=A_MUL
  823. else
  824. op:=A_IMUL;
  825. mboverflow:=true;
  826. end;
  827. end;
  828. subn : begin
  829. if is_set then
  830. begin
  831. op:=A_AND;
  832. mboverflow:=false;
  833. unsigned:=false;
  834. {$IfDef setConstNot}
  835. If (p^.right^.treetype = setconstn) then
  836. p^.right^.location.reference.offset := not(p^.right^.location.reference.offset)
  837. Else
  838. {$EndIf setConstNot}
  839. extra_not:=true;
  840. end
  841. else
  842. begin
  843. op:=A_SUB;
  844. mboverflow:=true;
  845. end;
  846. end;
  847. ltn,lten,
  848. gtn,gten,
  849. equaln,unequaln : begin
  850. {$IfNDef NoSetInclusion}
  851. If is_set Then
  852. Case p^.treetype of
  853. lten,gten:
  854. Begin
  855. If p^.treetype = gten then
  856. swaptree(p);
  857. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  858. begin
  859. ungetiftemp(p^.left^.location.reference);
  860. del_reference(p^.left^.location.reference);
  861. hregister:=getregister32;
  862. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  863. newreference(p^.left^.location.reference),hregister)));
  864. clear_location(p^.left^.location);
  865. p^.left^.location.loc:=LOC_REGISTER;
  866. p^.left^.location.register:=hregister;
  867. set_location(p^.location,p^.left^.location);
  868. end
  869. else
  870. if p^.left^.location.loc = LOC_CREGISTER Then
  871. {save the register var in a temp register, because
  872. its value is going to be modified}
  873. begin
  874. hregister := getregister32;
  875. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,
  876. p^.left^.location.register,hregister)));
  877. clear_location(p^.left^.location);
  878. p^.left^.location.loc:=LOC_REGISTER;
  879. p^.left^.location.register:=hregister;
  880. set_location(p^.location,p^.left^.location);
  881. end;
  882. {here, p^.left^.location should be LOC_REGISTER}
  883. If p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] Then
  884. exprasmlist^.concat(new(pai386,op_ref_reg(A_AND,opsize,
  885. newreference(p^.right^.location.reference),p^.left^.location.register)))
  886. Else
  887. exprasmlist^.concat(new(pai386,op_reg_reg(A_AND,opsize,
  888. p^.right^.location.register,p^.left^.location.register)));
  889. {warning: ugly hack ahead: we need a "jne" after the cmp, so
  890. change the treetype from lten/gten to equaln}
  891. p^.treetype := equaln
  892. End;
  893. {no < or > support for sets}
  894. ltn,gtn: CGMessage(type_e_mismatch);
  895. End;
  896. {$EndIf NoSetInclusion}
  897. op:=A_CMP;
  898. cmpop:=true;
  899. end;
  900. xorn : op:=A_XOR;
  901. orn : op:=A_OR;
  902. andn : op:=A_AND;
  903. else
  904. CGMessage(type_e_mismatch);
  905. end;
  906. { filter MUL, which requires special handling }
  907. if op=A_MUL then
  908. begin
  909. popeax:=false;
  910. popedx:=false;
  911. { here you need to free the symbol first }
  912. clear_location(p^.location);
  913. p^.location.register:=getregister32;
  914. p^.location.loc:=LOC_REGISTER;
  915. {$IfDef ShlMul}
  916. if p^.right^.treetype=ordconstn then
  917. swaptree(p);
  918. If (p^.left^.treetype = ordconstn) and
  919. ispowerof2(p^.left^.value, power) and
  920. not(cs_check_overflow in aktlocalswitches) then
  921. Begin
  922. emitloadord2reg(p^.right^.location,u32bitdef,p^.location.register,true);
  923. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,S_L,power,p^.location.register)))
  924. End
  925. Else
  926. Begin
  927. {$EndIf ShlMul}
  928. if not(R_EAX in unused) and (p^.location.register<>R_EAX) then
  929. begin
  930. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,R_EAX)));
  931. popeax:=true;
  932. end;
  933. if not(R_EDX in unused) and (p^.location.register<>R_EDX) then
  934. begin
  935. exprasmlist^.concat(new(pai386,op_reg(A_PUSH,S_L,R_EDX)));
  936. popedx:=true;
  937. end;
  938. { p^.left^.location can be R_EAX !!! }
  939. emitloadord2reg(p^.left^.location,u32bitdef,R_EDI,true);
  940. emitloadord2reg(p^.right^.location,u32bitdef,R_EAX,true);
  941. exprasmlist^.concat(new(pai386,op_reg(A_MUL,S_L,R_EDI)));
  942. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.register);
  943. if popedx then
  944. exprasmlist^.concat(new(pai386,op_reg(A_POP,S_L,R_EDX)));
  945. if popeax then
  946. exprasmlist^.concat(new(pai386,op_reg(A_POP,S_L,R_EAX)));
  947. {$IfDef ShlMul}
  948. End;
  949. {$endif ShlMul}
  950. SetResultLocation(false,true,p);
  951. exit;
  952. end;
  953. { Convert flags to register first }
  954. if (p^.left^.location.loc=LOC_FLAGS) then
  955. locflags2reg(p^.left^.location,opsize);
  956. if (p^.right^.location.loc=LOC_FLAGS) then
  957. locflags2reg(p^.right^.location,opsize);
  958. { left and right no register? }
  959. { then one must be demanded }
  960. if (p^.left^.location.loc<>LOC_REGISTER) and
  961. (p^.right^.location.loc<>LOC_REGISTER) then
  962. begin
  963. { register variable ? }
  964. if (p^.left^.location.loc=LOC_CREGISTER) then
  965. begin
  966. { it is OK if this is the destination }
  967. if is_in_dest then
  968. begin
  969. hregister:=p^.location.register;
  970. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  971. hregister);
  972. end
  973. else
  974. if cmpop then
  975. begin
  976. { do not disturb the register }
  977. hregister:=p^.location.register;
  978. end
  979. else
  980. begin
  981. case opsize of
  982. S_L : hregister:=getregister32;
  983. S_B : hregister:=reg32toreg8(getregister32);
  984. end;
  985. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  986. hregister);
  987. end
  988. end
  989. else
  990. begin
  991. ungetiftemp(p^.left^.location.reference);
  992. del_reference(p^.left^.location.reference);
  993. if is_in_dest then
  994. begin
  995. hregister:=p^.location.register;
  996. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  997. newreference(p^.left^.location.reference),hregister)));
  998. end
  999. else
  1000. begin
  1001. { first give free, then demand new register }
  1002. case opsize of
  1003. S_L : hregister:=getregister32;
  1004. S_W : hregister:=reg32toreg16(getregister32);
  1005. S_B : hregister:=reg32toreg8(getregister32);
  1006. end;
  1007. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  1008. newreference(p^.left^.location.reference),hregister)));
  1009. end;
  1010. end;
  1011. clear_location(p^.location);
  1012. p^.location.loc:=LOC_REGISTER;
  1013. p^.location.register:=hregister;
  1014. end
  1015. else
  1016. { if on the right the register then swap }
  1017. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  1018. begin
  1019. swap_location(p^.location,p^.right^.location);
  1020. { newly swapped also set swapped flag }
  1021. p^.swaped:=not(p^.swaped);
  1022. end;
  1023. { at this point, p^.location.loc should be LOC_REGISTER }
  1024. { and p^.location.register should be a valid register }
  1025. { containing the left result }
  1026. if p^.right^.location.loc<>LOC_REGISTER then
  1027. begin
  1028. if (p^.treetype=subn) and p^.swaped then
  1029. begin
  1030. if p^.right^.location.loc=LOC_CREGISTER then
  1031. begin
  1032. if extra_not then
  1033. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  1034. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  1035. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  1036. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  1037. end
  1038. else
  1039. begin
  1040. if extra_not then
  1041. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  1042. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  1043. newreference(p^.right^.location.reference),R_EDI)));
  1044. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  1045. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  1046. ungetiftemp(p^.right^.location.reference);
  1047. del_reference(p^.right^.location.reference);
  1048. end;
  1049. end
  1050. else
  1051. begin
  1052. if (p^.right^.treetype=ordconstn) and
  1053. (op=A_CMP) and
  1054. (p^.right^.value=0) then
  1055. begin
  1056. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  1057. p^.location.register)));
  1058. end
  1059. else if (p^.right^.treetype=ordconstn) and
  1060. (op=A_ADD) and
  1061. (p^.right^.value=1) and
  1062. not(cs_check_overflow in aktlocalswitches) then
  1063. begin
  1064. exprasmlist^.concat(new(pai386,op_reg(A_INC,opsize,
  1065. p^.location.register)));
  1066. end
  1067. else if (p^.right^.treetype=ordconstn) and
  1068. (op=A_SUB) and
  1069. (p^.right^.value=1) and
  1070. not(cs_check_overflow in aktlocalswitches) then
  1071. begin
  1072. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,
  1073. p^.location.register)));
  1074. end
  1075. else if (p^.right^.treetype=ordconstn) and
  1076. (op=A_IMUL) and
  1077. (ispowerof2(p^.right^.value,power)) and
  1078. not(cs_check_overflow in aktlocalswitches) then
  1079. begin
  1080. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  1081. p^.location.register)));
  1082. end
  1083. else
  1084. begin
  1085. if (p^.right^.location.loc=LOC_CREGISTER) then
  1086. begin
  1087. if extra_not then
  1088. begin
  1089. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,R_EDI);
  1090. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  1091. emit_reg_reg(A_AND,S_L,R_EDI,
  1092. p^.location.register);
  1093. end
  1094. else
  1095. begin
  1096. emit_reg_reg(op,opsize,p^.right^.location.register,
  1097. p^.location.register);
  1098. end;
  1099. end
  1100. else
  1101. begin
  1102. if extra_not then
  1103. begin
  1104. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(
  1105. p^.right^.location.reference),R_EDI)));
  1106. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  1107. emit_reg_reg(A_AND,S_L,R_EDI,
  1108. p^.location.register);
  1109. end
  1110. else
  1111. begin
  1112. exprasmlist^.concat(new(pai386,op_ref_reg(op,opsize,newreference(
  1113. p^.right^.location.reference),p^.location.register)));
  1114. end;
  1115. ungetiftemp(p^.right^.location.reference);
  1116. del_reference(p^.right^.location.reference);
  1117. end;
  1118. end;
  1119. end;
  1120. end
  1121. else
  1122. begin
  1123. { when swapped another result register }
  1124. if (p^.treetype=subn) and p^.swaped then
  1125. begin
  1126. if extra_not then
  1127. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.location.register)));
  1128. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1129. p^.location.register,p^.right^.location.register)));
  1130. swap_location(p^.location,p^.right^.location);
  1131. { newly swapped also set swapped flag }
  1132. { just to maintain ordering }
  1133. p^.swaped:=not(p^.swaped);
  1134. end
  1135. else
  1136. begin
  1137. if extra_not then
  1138. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.right^.location.register)));
  1139. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1140. p^.right^.location.register,
  1141. p^.location.register)));
  1142. end;
  1143. case opsize of
  1144. S_L : ungetregister32(p^.right^.location.register);
  1145. S_B : ungetregister32(reg8toreg32(p^.right^.location.register));
  1146. end;
  1147. end;
  1148. if cmpop then
  1149. case opsize of
  1150. S_L : ungetregister32(p^.location.register);
  1151. S_B : ungetregister32(reg8toreg32(p^.location.register));
  1152. end;
  1153. { only in case of overflow operations }
  1154. { produce overflow code }
  1155. { we must put it here directly, because sign of operation }
  1156. { is in unsigned VAR!! }
  1157. if mboverflow then
  1158. begin
  1159. if cs_check_overflow in aktlocalswitches then
  1160. begin
  1161. getlabel(hl4);
  1162. if unsigned then
  1163. emitjmp(C_NB,hl4)
  1164. else
  1165. emitjmp(C_NO,hl4);
  1166. emitcall('FPC_OVERFLOW',true);
  1167. emitlab(hl4);
  1168. end;
  1169. end;
  1170. end
  1171. else
  1172. { Char type }
  1173. if ((p^.left^.resulttype^.deftype=orddef) and
  1174. (porddef(p^.left^.resulttype)^.typ=uchar)) or
  1175. { enumeration type 16 bit }
  1176. ((p^.left^.resulttype^.deftype=enumdef) and
  1177. (p^.left^.resulttype^.size=1)) then
  1178. begin
  1179. case p^.treetype of
  1180. ltn,lten,gtn,gten,
  1181. equaln,unequaln :
  1182. cmpop:=true;
  1183. else CGMessage(type_e_mismatch);
  1184. end;
  1185. unsigned:=true;
  1186. { left and right no register? }
  1187. { the one must be demanded }
  1188. if (p^.location.loc<>LOC_REGISTER) and
  1189. (p^.right^.location.loc<>LOC_REGISTER) then
  1190. begin
  1191. if p^.location.loc=LOC_CREGISTER then
  1192. begin
  1193. if cmpop then
  1194. { do not disturb register }
  1195. hregister:=p^.location.register
  1196. else
  1197. begin
  1198. hregister:=reg32toreg8(getregister32);
  1199. emit_reg_reg(A_MOV,S_B,p^.location.register,
  1200. hregister);
  1201. end;
  1202. end
  1203. else
  1204. begin
  1205. del_reference(p^.location.reference);
  1206. { first give free then demand new register }
  1207. hregister:=reg32toreg8(getregister32);
  1208. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_B,newreference(p^.location.reference),
  1209. hregister)));
  1210. end;
  1211. clear_location(p^.location);
  1212. p^.location.loc:=LOC_REGISTER;
  1213. p^.location.register:=hregister;
  1214. end;
  1215. { now p always a register }
  1216. if (p^.right^.location.loc=LOC_REGISTER) and
  1217. (p^.location.loc<>LOC_REGISTER) then
  1218. begin
  1219. swap_location(p^.location,p^.right^.location);
  1220. { newly swapped also set swapped flag }
  1221. p^.swaped:=not(p^.swaped);
  1222. end;
  1223. if p^.right^.location.loc<>LOC_REGISTER then
  1224. begin
  1225. if p^.right^.location.loc=LOC_CREGISTER then
  1226. begin
  1227. emit_reg_reg(A_CMP,S_B,
  1228. p^.right^.location.register,p^.location.register);
  1229. end
  1230. else
  1231. begin
  1232. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_B,newreference(
  1233. p^.right^.location.reference),p^.location.register)));
  1234. del_reference(p^.right^.location.reference);
  1235. end;
  1236. end
  1237. else
  1238. begin
  1239. emit_reg_reg(A_CMP,S_B,p^.right^.location.register,
  1240. p^.location.register);
  1241. ungetregister32(reg8toreg32(p^.right^.location.register));
  1242. end;
  1243. ungetregister32(reg8toreg32(p^.location.register));
  1244. end
  1245. else
  1246. { 16 bit enumeration type }
  1247. if ((p^.left^.resulttype^.deftype=enumdef) and
  1248. (p^.left^.resulttype^.size=2)) then
  1249. begin
  1250. case p^.treetype of
  1251. ltn,lten,gtn,gten,
  1252. equaln,unequaln :
  1253. cmpop:=true;
  1254. else CGMessage(type_e_mismatch);
  1255. end;
  1256. unsigned:=true;
  1257. { left and right no register? }
  1258. { the one must be demanded }
  1259. if (p^.location.loc<>LOC_REGISTER) and
  1260. (p^.right^.location.loc<>LOC_REGISTER) then
  1261. begin
  1262. if p^.location.loc=LOC_CREGISTER then
  1263. begin
  1264. if cmpop then
  1265. { do not disturb register }
  1266. hregister:=p^.location.register
  1267. else
  1268. begin
  1269. hregister:=reg32toreg16(getregister32);
  1270. emit_reg_reg(A_MOV,S_W,p^.location.register,
  1271. hregister);
  1272. end;
  1273. end
  1274. else
  1275. begin
  1276. del_reference(p^.location.reference);
  1277. { first give free then demand new register }
  1278. hregister:=reg32toreg16(getregister32);
  1279. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_W,newreference(p^.location.reference),
  1280. hregister)));
  1281. end;
  1282. clear_location(p^.location);
  1283. p^.location.loc:=LOC_REGISTER;
  1284. p^.location.register:=hregister;
  1285. end;
  1286. { now p always a register }
  1287. if (p^.right^.location.loc=LOC_REGISTER) and
  1288. (p^.location.loc<>LOC_REGISTER) then
  1289. begin
  1290. swap_location(p^.location,p^.right^.location);
  1291. { newly swapped also set swapped flag }
  1292. p^.swaped:=not(p^.swaped);
  1293. end;
  1294. if p^.right^.location.loc<>LOC_REGISTER then
  1295. begin
  1296. if p^.right^.location.loc=LOC_CREGISTER then
  1297. begin
  1298. emit_reg_reg(A_CMP,S_W,
  1299. p^.right^.location.register,p^.location.register);
  1300. end
  1301. else
  1302. begin
  1303. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_W,newreference(
  1304. p^.right^.location.reference),p^.location.register)));
  1305. del_reference(p^.right^.location.reference);
  1306. end;
  1307. end
  1308. else
  1309. begin
  1310. emit_reg_reg(A_CMP,S_W,p^.right^.location.register,
  1311. p^.location.register);
  1312. ungetregister32(reg16toreg32(p^.right^.location.register));
  1313. end;
  1314. ungetregister32(reg16toreg32(p^.location.register));
  1315. end
  1316. else
  1317. { 64 bit types }
  1318. if is_64bitint(p^.left^.resulttype) then
  1319. begin
  1320. mboverflow:=false;
  1321. cmpop:=false;
  1322. unsigned:=((p^.left^.resulttype^.deftype=orddef) and
  1323. (porddef(p^.left^.resulttype)^.typ=u64bit)) or
  1324. ((p^.right^.resulttype^.deftype=orddef) and
  1325. (porddef(p^.right^.resulttype)^.typ=u64bit));
  1326. case p^.treetype of
  1327. addn : begin
  1328. begin
  1329. op:=A_ADD;
  1330. op2:=A_ADC;
  1331. mboverflow:=true;
  1332. end;
  1333. end;
  1334. subn : begin
  1335. op:=A_SUB;
  1336. op2:=A_SBB;
  1337. mboverflow:=true;
  1338. end;
  1339. ltn,lten,
  1340. gtn,gten,
  1341. equaln,unequaln:
  1342. begin
  1343. op:=A_CMP;
  1344. op2:=A_CMP;
  1345. cmpop:=true;
  1346. end;
  1347. xorn:
  1348. begin
  1349. op:=A_XOR;
  1350. op2:=A_XOR;
  1351. end;
  1352. orn:
  1353. begin
  1354. op:=A_OR;
  1355. op2:=A_OR;
  1356. end;
  1357. andn:
  1358. begin
  1359. op:=A_AND;
  1360. op2:=A_AND;
  1361. end;
  1362. muln:
  1363. ;
  1364. else
  1365. CGMessage(type_e_mismatch);
  1366. end;
  1367. if p^.treetype=muln then
  1368. begin
  1369. release_qword_loc(p^.left^.location);
  1370. release_qword_loc(p^.right^.location);
  1371. p^.location.registerlow:=getexplicitregister32(R_EAX);
  1372. p^.location.registerhigh:=getexplicitregister32(R_EDX);
  1373. pushusedregisters(exprasmlist,pushedreg,$ff
  1374. and not($80 shr byte(p^.location.registerlow))
  1375. and not($80 shr byte(p^.location.registerhigh)));
  1376. if cs_check_overflow in aktlocalswitches then
  1377. push_int(1)
  1378. else
  1379. push_int(0);
  1380. emit_pushq_loc(p^.left^.location);
  1381. emit_pushq_loc(p^.right^.location);
  1382. if porddef(p^.resulttype)^.typ=u64bit then
  1383. emitcall('FPC_MUL_QWORD',true)
  1384. else
  1385. emitcall('FPC_MUL_INT64',true);
  1386. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.registerlow);
  1387. emit_reg_reg(A_MOV,S_L,R_EDX,p^.location.registerhigh);
  1388. popusedregisters(exprasmlist,pushedreg);
  1389. p^.location.loc:=LOC_REGISTER;
  1390. end
  1391. else
  1392. begin
  1393. { left and right no register? }
  1394. { then one must be demanded }
  1395. if (p^.left^.location.loc<>LOC_REGISTER) and
  1396. (p^.right^.location.loc<>LOC_REGISTER) then
  1397. begin
  1398. { register variable ? }
  1399. if (p^.left^.location.loc=LOC_CREGISTER) then
  1400. begin
  1401. { it is OK if this is the destination }
  1402. if is_in_dest then
  1403. begin
  1404. hregister:=p^.location.registerlow;
  1405. hregister2:=p^.location.registerhigh;
  1406. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1407. hregister);
  1408. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1409. hregister2);
  1410. end
  1411. else
  1412. if cmpop then
  1413. begin
  1414. { do not disturb the register }
  1415. hregister:=p^.location.registerlow;
  1416. hregister2:=p^.location.registerhigh;
  1417. end
  1418. else
  1419. begin
  1420. hregister:=getregister32;
  1421. hregister2:=getregister32;
  1422. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  1423. hregister);
  1424. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerhigh,
  1425. hregister2);
  1426. end
  1427. end
  1428. else
  1429. begin
  1430. ungetiftemp(p^.left^.location.reference);
  1431. del_reference(p^.left^.location.reference);
  1432. if is_in_dest then
  1433. begin
  1434. hregister:=p^.location.registerlow;
  1435. hregister2:=p^.location.registerhigh;
  1436. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1437. newreference(p^.left^.location.reference),hregister)));
  1438. hr:=newreference(p^.left^.location.reference);
  1439. inc(hr^.offset,4);
  1440. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1441. hr,hregister2)));
  1442. end
  1443. else
  1444. begin
  1445. hregister:=getregister32;
  1446. hregister2:=getregister32;
  1447. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1448. newreference(p^.left^.location.reference),hregister)));
  1449. hr:=newreference(p^.left^.location.reference);
  1450. inc(hr^.offset,4);
  1451. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,
  1452. hr,hregister2)));
  1453. end;
  1454. end;
  1455. clear_location(p^.location);
  1456. p^.location.loc:=LOC_REGISTER;
  1457. p^.location.registerlow:=hregister;
  1458. p^.location.registerhigh:=hregister2;
  1459. end
  1460. else
  1461. { if on the right the register then swap }
  1462. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  1463. begin
  1464. swap_location(p^.location,p^.right^.location);
  1465. { newly swapped also set swapped flag }
  1466. p^.swaped:=not(p^.swaped);
  1467. end;
  1468. { at this point, p^.location.loc should be LOC_REGISTER }
  1469. { and p^.location.register should be a valid register }
  1470. { containing the left result }
  1471. if p^.right^.location.loc<>LOC_REGISTER then
  1472. begin
  1473. if (p^.treetype=subn) and p^.swaped then
  1474. begin
  1475. if p^.right^.location.loc=LOC_CREGISTER then
  1476. begin
  1477. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  1478. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  1479. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  1480. end
  1481. else
  1482. begin
  1483. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  1484. newreference(p^.right^.location.reference),R_EDI)));
  1485. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  1486. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  1487. ungetiftemp(p^.right^.location.reference);
  1488. del_reference(p^.right^.location.reference);
  1489. end;
  1490. end
  1491. else if cmpop then
  1492. begin
  1493. if (p^.right^.location.loc=LOC_CREGISTER) then
  1494. begin
  1495. emit_reg_reg(A_CMP,S_L,p^.right^.location.registerhigh,
  1496. p^.location.registerhigh);
  1497. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1498. emit_reg_reg(A_CMP,S_L,p^.right^.location.registerlow,
  1499. p^.location.registerlow);
  1500. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1501. emitjmp(C_None,falselabel);
  1502. end
  1503. else
  1504. begin
  1505. hr:=newreference(p^.right^.location.reference);
  1506. inc(hr^.offset,4);
  1507. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_L,
  1508. hr,p^.location.registerhigh)));
  1509. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1510. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_L,newreference(
  1511. p^.right^.location.reference),p^.location.registerlow)));
  1512. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1513. emitjmp(C_None,falselabel);
  1514. ungetiftemp(p^.right^.location.reference);
  1515. del_reference(p^.right^.location.reference);
  1516. end;
  1517. end
  1518. else
  1519. begin
  1520. {
  1521. if (p^.right^.treetype=ordconstn) and
  1522. (op=A_CMP) and
  1523. (p^.right^.value=0) then
  1524. begin
  1525. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  1526. p^.location.register)));
  1527. end
  1528. else if (p^.right^.treetype=ordconstn) and
  1529. (op=A_IMUL) and
  1530. (ispowerof2(p^.right^.value,power)) then
  1531. begin
  1532. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  1533. p^.location.register)));
  1534. end
  1535. else
  1536. }
  1537. begin
  1538. if (p^.right^.location.loc=LOC_CREGISTER) then
  1539. begin
  1540. emit_reg_reg(op,S_L,p^.right^.location.registerlow,
  1541. p^.location.registerlow);
  1542. emit_reg_reg(op2,S_L,p^.right^.location.registerhigh,
  1543. p^.location.registerhigh);
  1544. end
  1545. else
  1546. begin
  1547. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_L,newreference(
  1548. p^.right^.location.reference),p^.location.registerlow)));
  1549. hr:=newreference(p^.right^.location.reference);
  1550. inc(hr^.offset,4);
  1551. exprasmlist^.concat(new(pai386,op_ref_reg(op2,S_L,
  1552. hr,p^.location.registerhigh)));
  1553. ungetiftemp(p^.right^.location.reference);
  1554. del_reference(p^.right^.location.reference);
  1555. end;
  1556. end;
  1557. end;
  1558. end
  1559. else
  1560. begin
  1561. { when swapped another result register }
  1562. if (p^.treetype=subn) and p^.swaped then
  1563. begin
  1564. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  1565. p^.location.register,p^.right^.location.register)));
  1566. swap_location(p^.location,p^.right^.location);
  1567. { newly swapped also set swapped flag }
  1568. { just to maintain ordering }
  1569. p^.swaped:=not(p^.swaped);
  1570. end
  1571. else if cmpop then
  1572. begin
  1573. exprasmlist^.concat(new(pai386,op_reg_reg(A_CMP,S_L,
  1574. p^.right^.location.registerhigh,
  1575. p^.location.registerhigh)));
  1576. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1577. exprasmlist^.concat(new(pai386,op_reg_reg(A_CMP,S_L,
  1578. p^.right^.location.registerlow,
  1579. p^.location.registerlow)));
  1580. emitjmp(flag_2_cond[getresflags(p,unsigned)],truelabel);
  1581. emitjmp(C_None,falselabel);
  1582. end
  1583. else
  1584. begin
  1585. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_L,
  1586. p^.right^.location.registerlow,
  1587. p^.location.registerlow)));
  1588. exprasmlist^.concat(new(pai386,op_reg_reg(op2,S_L,
  1589. p^.right^.location.registerhigh,
  1590. p^.location.registerhigh)));
  1591. end;
  1592. ungetregister32(p^.right^.location.registerlow);
  1593. ungetregister32(p^.right^.location.registerhigh);
  1594. end;
  1595. if cmpop then
  1596. begin
  1597. ungetregister32(p^.location.registerlow);
  1598. ungetregister32(p^.location.registerhigh);
  1599. end;
  1600. { only in case of overflow operations }
  1601. { produce overflow code }
  1602. { we must put it here directly, because sign of operation }
  1603. { is in unsigned VAR!! }
  1604. if mboverflow then
  1605. begin
  1606. if cs_check_overflow in aktlocalswitches then
  1607. begin
  1608. getlabel(hl4);
  1609. if unsigned then
  1610. emitjmp(C_NB,hl4)
  1611. else
  1612. emitjmp(C_NO,hl4);
  1613. emitcall('FPC_OVERFLOW',true);
  1614. emitlab(hl4);
  1615. end;
  1616. end;
  1617. { we have LOC_JUMP as result }
  1618. if cmpop then
  1619. begin
  1620. clear_location(p^.location);
  1621. p^.location.loc:=LOC_JUMP;
  1622. cmpop:=false;
  1623. end;
  1624. end;
  1625. end
  1626. else
  1627. { Floating point }
  1628. if (p^.left^.resulttype^.deftype=floatdef) and
  1629. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  1630. begin
  1631. { real constants to the left }
  1632. if p^.left^.treetype=realconstn then
  1633. swaptree(p);
  1634. cmpop:=false;
  1635. case p^.treetype of
  1636. addn : op:=A_FADDP;
  1637. muln : op:=A_FMULP;
  1638. subn : op:=A_FSUBP;
  1639. slashn : op:=A_FDIVP;
  1640. ltn,lten,gtn,gten,
  1641. equaln,unequaln : begin
  1642. op:=A_FCOMPP;
  1643. cmpop:=true;
  1644. end;
  1645. else CGMessage(type_e_mismatch);
  1646. end;
  1647. if (p^.right^.location.loc<>LOC_FPU) then
  1648. begin
  1649. floatload(pfloatdef(p^.right^.resulttype)^.typ,p^.right^.location.reference);
  1650. if (p^.left^.location.loc<>LOC_FPU) then
  1651. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  1652. { left was on the stack => swap }
  1653. else
  1654. p^.swaped:=not(p^.swaped);
  1655. { releases the right reference }
  1656. del_reference(p^.right^.location.reference);
  1657. end
  1658. { the nominator in st0 }
  1659. else if (p^.left^.location.loc<>LOC_FPU) then
  1660. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  1661. { fpu operands are always in the wrong order on the stack }
  1662. else
  1663. p^.swaped:=not(p^.swaped);
  1664. { releases the left reference }
  1665. if (p^.left^.location.loc<>LOC_FPU) then
  1666. del_reference(p^.left^.location.reference);
  1667. { if we swaped the tree nodes, then use the reverse operator }
  1668. if p^.swaped then
  1669. begin
  1670. if (p^.treetype=slashn) then
  1671. op:=A_FDIVRP
  1672. else if (p^.treetype=subn) then
  1673. op:=A_FSUBRP;
  1674. end;
  1675. { to avoid the pentium bug
  1676. if (op=FDIVP) and (opt_processors=pentium) then
  1677. exprasmlist^.concat(new(pai386,op_CALL,S_NO,'EMUL_FDIVP')
  1678. else
  1679. }
  1680. { the Intel assemblers want operands }
  1681. if op<>A_FCOMPP then
  1682. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,R_ST,R_ST1)))
  1683. else
  1684. exprasmlist^.concat(new(pai386,op_none(op,S_NO)));
  1685. { on comparison load flags }
  1686. if cmpop then
  1687. begin
  1688. if not(R_EAX in unused) then
  1689. emit_reg_reg(A_MOV,S_L,R_EAX,R_EDI);
  1690. exprasmlist^.concat(new(pai386,op_reg(A_FNSTSW,S_NO,R_AX)));
  1691. exprasmlist^.concat(new(pai386,op_none(A_SAHF,S_NO)));
  1692. if not(R_EAX in unused) then
  1693. emit_reg_reg(A_MOV,S_L,R_EDI,R_EAX);
  1694. if p^.swaped then
  1695. begin
  1696. case p^.treetype of
  1697. equaln : flags:=F_E;
  1698. unequaln : flags:=F_NE;
  1699. ltn : flags:=F_A;
  1700. lten : flags:=F_AE;
  1701. gtn : flags:=F_B;
  1702. gten : flags:=F_BE;
  1703. end;
  1704. end
  1705. else
  1706. begin
  1707. case p^.treetype of
  1708. equaln : flags:=F_E;
  1709. unequaln : flags:=F_NE;
  1710. ltn : flags:=F_B;
  1711. lten : flags:=F_BE;
  1712. gtn : flags:=F_A;
  1713. gten : flags:=F_AE;
  1714. end;
  1715. end;
  1716. clear_location(p^.location);
  1717. p^.location.loc:=LOC_FLAGS;
  1718. p^.location.resflags:=flags;
  1719. cmpop:=false;
  1720. end
  1721. else
  1722. begin
  1723. clear_location(p^.location);
  1724. p^.location.loc:=LOC_FPU;
  1725. end;
  1726. end
  1727. {$ifdef SUPPORT_MMX}
  1728. else
  1729. { MMX Arrays }
  1730. if is_mmx_able_array(p^.left^.resulttype) then
  1731. begin
  1732. cmpop:=false;
  1733. mmxbase:=mmx_type(p^.left^.resulttype);
  1734. case p^.treetype of
  1735. addn : begin
  1736. if (cs_mmx_saturation in aktlocalswitches) then
  1737. begin
  1738. case mmxbase of
  1739. mmxs8bit:
  1740. op:=A_PADDSB;
  1741. mmxu8bit:
  1742. op:=A_PADDUSB;
  1743. mmxs16bit,mmxfixed16:
  1744. op:=A_PADDSB;
  1745. mmxu16bit:
  1746. op:=A_PADDUSW;
  1747. end;
  1748. end
  1749. else
  1750. begin
  1751. case mmxbase of
  1752. mmxs8bit,mmxu8bit:
  1753. op:=A_PADDB;
  1754. mmxs16bit,mmxu16bit,mmxfixed16:
  1755. op:=A_PADDW;
  1756. mmxs32bit,mmxu32bit:
  1757. op:=A_PADDD;
  1758. end;
  1759. end;
  1760. end;
  1761. muln : begin
  1762. case mmxbase of
  1763. mmxs16bit,mmxu16bit:
  1764. op:=A_PMULLW;
  1765. mmxfixed16:
  1766. op:=A_PMULHW;
  1767. end;
  1768. end;
  1769. subn : begin
  1770. if (cs_mmx_saturation in aktlocalswitches) then
  1771. begin
  1772. case mmxbase of
  1773. mmxs8bit:
  1774. op:=A_PSUBSB;
  1775. mmxu8bit:
  1776. op:=A_PSUBUSB;
  1777. mmxs16bit,mmxfixed16:
  1778. op:=A_PSUBSB;
  1779. mmxu16bit:
  1780. op:=A_PSUBUSW;
  1781. end;
  1782. end
  1783. else
  1784. begin
  1785. case mmxbase of
  1786. mmxs8bit,mmxu8bit:
  1787. op:=A_PSUBB;
  1788. mmxs16bit,mmxu16bit,mmxfixed16:
  1789. op:=A_PSUBW;
  1790. mmxs32bit,mmxu32bit:
  1791. op:=A_PSUBD;
  1792. end;
  1793. end;
  1794. end;
  1795. {
  1796. ltn,lten,gtn,gten,
  1797. equaln,unequaln :
  1798. begin
  1799. op:=A_CMP;
  1800. cmpop:=true;
  1801. end;
  1802. }
  1803. xorn:
  1804. op:=A_PXOR;
  1805. orn:
  1806. op:=A_POR;
  1807. andn:
  1808. op:=A_PAND;
  1809. else CGMessage(type_e_mismatch);
  1810. end;
  1811. { left and right no register? }
  1812. { then one must be demanded }
  1813. if (p^.left^.location.loc<>LOC_MMXREGISTER) and
  1814. (p^.right^.location.loc<>LOC_MMXREGISTER) then
  1815. begin
  1816. { register variable ? }
  1817. if (p^.left^.location.loc=LOC_CMMXREGISTER) then
  1818. begin
  1819. { it is OK if this is the destination }
  1820. if is_in_dest then
  1821. begin
  1822. hregister:=p^.location.register;
  1823. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1824. hregister);
  1825. end
  1826. else
  1827. begin
  1828. hregister:=getregistermmx;
  1829. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1830. hregister);
  1831. end
  1832. end
  1833. else
  1834. begin
  1835. del_reference(p^.left^.location.reference);
  1836. if is_in_dest then
  1837. begin
  1838. hregister:=p^.location.register;
  1839. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1840. newreference(p^.left^.location.reference),hregister)));
  1841. end
  1842. else
  1843. begin
  1844. hregister:=getregistermmx;
  1845. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1846. newreference(p^.left^.location.reference),hregister)));
  1847. end;
  1848. end;
  1849. clear_location(p^.location);
  1850. p^.location.loc:=LOC_MMXREGISTER;
  1851. p^.location.register:=hregister;
  1852. end
  1853. else
  1854. { if on the right the register then swap }
  1855. if (p^.right^.location.loc=LOC_MMXREGISTER) then
  1856. begin
  1857. swap_location(p^.location,p^.right^.location);
  1858. { newly swapped also set swapped flag }
  1859. p^.swaped:=not(p^.swaped);
  1860. end;
  1861. { at this point, p^.location.loc should be LOC_MMXREGISTER }
  1862. { and p^.location.register should be a valid register }
  1863. { containing the left result }
  1864. if p^.right^.location.loc<>LOC_MMXREGISTER then
  1865. begin
  1866. if (p^.treetype=subn) and p^.swaped then
  1867. begin
  1868. if p^.right^.location.loc=LOC_CMMXREGISTER then
  1869. begin
  1870. emit_reg_reg(A_MOVQ,S_NO,p^.right^.location.register,R_MM7);
  1871. emit_reg_reg(op,S_NO,p^.location.register,R_EDI);
  1872. emit_reg_reg(A_MOVQ,S_NO,R_MM7,p^.location.register);
  1873. end
  1874. else
  1875. begin
  1876. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1877. newreference(p^.right^.location.reference),R_MM7)));
  1878. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,p^.location.register,
  1879. R_MM7)));
  1880. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVQ,S_NO,
  1881. R_MM7,p^.location.register)));
  1882. del_reference(p^.right^.location.reference);
  1883. end;
  1884. end
  1885. else
  1886. begin
  1887. if (p^.right^.location.loc=LOC_CREGISTER) then
  1888. begin
  1889. emit_reg_reg(op,S_NO,p^.right^.location.register,
  1890. p^.location.register);
  1891. end
  1892. else
  1893. begin
  1894. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_NO,newreference(
  1895. p^.right^.location.reference),p^.location.register)));
  1896. del_reference(p^.right^.location.reference);
  1897. end;
  1898. end;
  1899. end
  1900. else
  1901. begin
  1902. { when swapped another result register }
  1903. if (p^.treetype=subn) and p^.swaped then
  1904. begin
  1905. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1906. p^.location.register,p^.right^.location.register)));
  1907. swap_location(p^.location,p^.right^.location);
  1908. { newly swapped also set swapped flag }
  1909. { just to maintain ordering }
  1910. p^.swaped:=not(p^.swaped);
  1911. end
  1912. else
  1913. begin
  1914. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1915. p^.right^.location.register,
  1916. p^.location.register)));
  1917. end;
  1918. ungetregistermmx(p^.right^.location.register);
  1919. end;
  1920. end
  1921. {$endif SUPPORT_MMX}
  1922. else CGMessage(type_e_mismatch);
  1923. end;
  1924. SetResultLocation(cmpop,unsigned,p);
  1925. end;
  1926. end.
  1927. {
  1928. $Log$
  1929. Revision 1.59 1999-05-19 10:31:53 florian
  1930. * two bugs reported by Romio (bugs 13) are fixed:
  1931. - empty array constructors are now handled correctly (e.g. for sysutils.format)
  1932. - comparsion of ansistrings was sometimes coded wrong
  1933. Revision 1.58 1999/05/18 21:58:22 florian
  1934. * fixed some bugs related to temp. ansistrings and functions results
  1935. which return records/objects/arrays which need init/final.
  1936. Revision 1.57 1999/05/18 14:15:18 peter
  1937. * containsself fixes
  1938. * checktypes()
  1939. Revision 1.56 1999/05/17 21:56:58 florian
  1940. * new temporary ansistring handling
  1941. Revision 1.55 1999/05/10 14:37:49 pierre
  1942. problem with EAX being overwritten before used in A_MULL code fixed
  1943. Revision 1.54 1999/05/09 17:58:42 jonas
  1944. + change "MUL <power of 2>, reg" to SHL (-d ShlMul)
  1945. * do the NOT of a constant set when it's substracted internally
  1946. (-dsetconstnot)
  1947. Revision 1.53 1999/05/01 13:24:01 peter
  1948. * merged nasm compiler
  1949. * old asm moved to oldasm/
  1950. Revision 1.52 1999/04/19 09:39:01 pierre
  1951. * fixes for tempansi
  1952. Revision 1.51 1999/04/16 20:44:34 florian
  1953. * the boolean operators =;<>;xor with LOC_JUMP and LOC_FLAGS
  1954. operands fixed, small things for new ansistring management
  1955. Revision 1.50 1999/04/16 13:42:35 jonas
  1956. * more regalloc fixes (still not complete)
  1957. Revision 1.49 1999/04/16 11:44:24 peter
  1958. * better support for flags result
  1959. Revision 1.48 1999/04/14 09:14:45 peter
  1960. * first things to store the symbol/def number in the ppu
  1961. Revision 1.47 1999/04/12 19:09:08 florian
  1962. * comparsions for small enumerations type are now generated
  1963. correct
  1964. Revision 1.46 1999/03/02 18:21:36 peter
  1965. + flags support for add and case
  1966. Revision 1.45 1999/02/25 21:02:20 peter
  1967. * ag386bin updates
  1968. + coff writer
  1969. Revision 1.44 1999/02/22 02:15:02 peter
  1970. * updates for ag386bin
  1971. Revision 1.43 1999/02/16 00:46:30 peter
  1972. * fixed bug 206
  1973. Revision 1.42 1999/02/12 10:43:56 florian
  1974. * internal error 10 with ansistrings fixed
  1975. Revision 1.41 1999/01/20 19:23:10 jonas
  1976. * fixed set1 <= set2 for small sets
  1977. Revision 1.40 1999/01/20 17:39:22 jonas
  1978. + fixed bug0163 (set1 <= set2 support)
  1979. Revision 1.39 1999/01/19 10:18:58 florian
  1980. * bug with mul. of dwords fixed, reported by Alexander Stohr
  1981. * some changes to compile with TP
  1982. + small enhancements for the new code generator
  1983. Revision 1.38 1999/01/05 17:03:36 jonas
  1984. * don't output inc/dec if cs_check_overflow is on, because inc/dec don't change
  1985. the carry flag
  1986. Revision 1.37 1998/12/22 13:10:56 florian
  1987. * memory leaks for ansistring type casts fixed
  1988. Revision 1.36 1998/12/19 00:23:40 florian
  1989. * ansistring memory leaks fixed
  1990. Revision 1.35 1998/12/11 23:36:06 florian
  1991. + again more stuff for int64/qword:
  1992. - comparision operators
  1993. - code generation for: str, read(ln), write(ln)
  1994. Revision 1.34 1998/12/11 00:02:46 peter
  1995. + globtype,tokens,version unit splitted from globals
  1996. Revision 1.33 1998/12/10 11:16:00 florian
  1997. + some basic operations with qwords and int64 added: +, xor, and, or;
  1998. the register allocation works fine
  1999. Revision 1.32 1998/12/10 09:47:13 florian
  2000. + basic operations with int64/qord (compiler with -dint64)
  2001. + rtti of enumerations extended: names are now written
  2002. Revision 1.31 1998/11/30 09:42:59 pierre
  2003. * some range check bugs fixed (still not working !)
  2004. + added DLL writing support for win32 (also accepts variables)
  2005. + TempAnsi for code that could be used for Temporary ansi strings
  2006. handling
  2007. Revision 1.30 1998/11/24 12:52:40 peter
  2008. * sets are not written twice anymore
  2009. * optimize for emptyset+single element which uses a new routine from
  2010. set.inc FPC_SET_CREATE_ELEMENT
  2011. Revision 1.29 1998/11/18 15:44:05 peter
  2012. * VALUEPARA for tp7 compatible value parameters
  2013. Revision 1.28 1998/11/18 09:18:01 pierre
  2014. + automatic loading of profile unit with -pg option
  2015. in go32v2 mode (also defines FPC_PROFILE)
  2016. * some memory leaks removed
  2017. * unreleased temp problem with sets solved
  2018. Revision 1.27 1998/11/17 00:36:38 peter
  2019. * more ansistring fixes
  2020. Revision 1.26 1998/11/16 16:17:16 peter
  2021. * fixed ansistring temp which forgot a reset
  2022. Revision 1.25 1998/11/16 15:35:35 peter
  2023. * rename laod/copystring -> load/copyshortstring
  2024. * fixed int-bool cnv bug
  2025. + char-ansistring conversion
  2026. Revision 1.24 1998/11/07 12:49:30 peter
  2027. * fixed ansicompare which returns signed
  2028. Revision 1.23 1998/10/29 15:42:43 florian
  2029. + partial disposing of temp. ansistrings
  2030. Revision 1.22 1998/10/28 18:26:12 pierre
  2031. * removed some erros after other errors (introduced by useexcept)
  2032. * stabs works again correctly (for how long !)
  2033. Revision 1.21 1998/10/25 23:32:48 peter
  2034. * fixed unsigned mul
  2035. Revision 1.20 1998/10/21 08:39:56 florian
  2036. + ansistring operator +
  2037. + $h and string[n] for n>255 added
  2038. * small problem with TP fixed
  2039. Revision 1.19 1998/10/20 15:09:21 florian
  2040. + binary operators for ansi strings
  2041. Revision 1.18 1998/10/20 08:06:38 pierre
  2042. * several memory corruptions due to double freemem solved
  2043. => never use p^.loc.location:=p^.left^.loc.location;
  2044. + finally I added now by default
  2045. that ra386dir translates global and unit symbols
  2046. + added a first field in tsymtable and
  2047. a nextsym field in tsym
  2048. (this allows to obtain ordered type info for
  2049. records and objects in gdb !)
  2050. Revision 1.17 1998/10/09 11:47:45 pierre
  2051. * still more memory leaks fixes !!
  2052. Revision 1.16 1998/10/09 08:56:21 pierre
  2053. * several memory leaks fixed
  2054. Revision 1.15 1998/10/08 17:17:10 pierre
  2055. * current_module old scanner tagged as invalid if unit is recompiled
  2056. + added ppheap for better info on tracegetmem of heaptrc
  2057. (adds line column and file index)
  2058. * several memory leaks removed ith help of heaptrc !!
  2059. Revision 1.14 1998/09/28 16:57:13 pierre
  2060. * changed all length(p^.value_str^) into str_length(p)
  2061. to get it work with and without ansistrings
  2062. * changed sourcefiles field of tmodule to a pointer
  2063. Revision 1.13 1998/09/17 09:42:09 peter
  2064. + pass_2 for cg386
  2065. * Message() -> CGMessage() for pass_1/pass_2
  2066. Revision 1.12 1998/09/14 10:43:44 peter
  2067. * all internal RTL functions start with FPC_
  2068. Revision 1.11 1998/09/07 18:45:52 peter
  2069. * update smartlinking, uses getdatalabel
  2070. * renamed ptree.value vars to value_str,value_real,value_set
  2071. Revision 1.10 1998/09/04 10:05:04 florian
  2072. * ugly fix for STRCAT, nevertheless it needs more fixing !!!!!!!
  2073. we need an new version of STRCAT which takes a length parameter
  2074. Revision 1.9 1998/09/04 08:41:36 peter
  2075. * updated some error CGMessages
  2076. Revision 1.8 1998/08/28 10:54:18 peter
  2077. * fixed smallset generation from elements, it has never worked before!
  2078. Revision 1.7 1998/08/19 14:56:59 peter
  2079. * forgot to removed some unused code in addset for set<>set
  2080. Revision 1.6 1998/08/18 09:24:35 pierre
  2081. * small warning position bug fixed
  2082. * support_mmx switches splitting was missing
  2083. * rhide error and warning output corrected
  2084. Revision 1.5 1998/08/14 18:18:37 peter
  2085. + dynamic set contruction
  2086. * smallsets are now working (always longint size)
  2087. Revision 1.4 1998/08/10 14:49:42 peter
  2088. + localswitches, moduleswitches, globalswitches splitting
  2089. Revision 1.3 1998/06/25 08:48:04 florian
  2090. * first version of rtti support
  2091. Revision 1.2 1998/06/08 13:13:28 pierre
  2092. + temporary variables now in temp_gen.pas unit
  2093. because it is processor independent
  2094. * mppc68k.bat modified to undefine i386 and support_mmx
  2095. (which are defaults for i386)
  2096. Revision 1.1 1998/06/05 17:44:10 peter
  2097. * splitted cgi386
  2098. }