cg386add.pas 104 KB

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