cg386add.pas 107 KB

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