cg386add.pas 97 KB

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