cg386add.pas 108 KB

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