cg386add.pas 60 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358
  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. uses
  21. tree;
  22. procedure secondadd(var p : ptree);
  23. implementation
  24. uses
  25. cobjects,verbose,globals,systems,
  26. symtable,aasm,types,
  27. hcodegen,temp_gen,pass_2,
  28. i386,cgai386,tgeni386;
  29. {*****************************************************************************
  30. Helpers
  31. *****************************************************************************}
  32. procedure SetResultLocation(cmpop,unsigned:boolean;var p :ptree);
  33. var
  34. flags : tresflags;
  35. begin
  36. { remove temporary location if not a set or string }
  37. if (p^.left^.resulttype^.deftype<>stringdef) and
  38. ((p^.left^.resulttype^.deftype<>setdef) or (psetdef(p^.left^.resulttype)^.settype=smallset)) and
  39. (p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  40. ungetiftemp(p^.left^.location.reference);
  41. if (p^.right^.resulttype^.deftype<>stringdef) and
  42. ((p^.right^.resulttype^.deftype<>setdef) or (psetdef(p^.right^.resulttype)^.settype=smallset)) and
  43. (p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE]) then
  44. ungetiftemp(p^.right^.location.reference);
  45. { in case of comparison operation the put result in the flags }
  46. if cmpop then
  47. begin
  48. if not(unsigned) then
  49. begin
  50. if p^.swaped then
  51. case p^.treetype of
  52. equaln : flags:=F_E;
  53. unequaln : flags:=F_NE;
  54. ltn : flags:=F_G;
  55. lten : flags:=F_GE;
  56. gtn : flags:=F_L;
  57. gten : flags:=F_LE;
  58. end
  59. else
  60. case p^.treetype of
  61. equaln : flags:=F_E;
  62. unequaln : flags:=F_NE;
  63. ltn : flags:=F_L;
  64. lten : flags:=F_LE;
  65. gtn : flags:=F_G;
  66. gten : flags:=F_GE;
  67. end;
  68. end
  69. else
  70. begin
  71. if p^.swaped then
  72. case p^.treetype of
  73. equaln : flags:=F_E;
  74. unequaln : flags:=F_NE;
  75. ltn : flags:=F_A;
  76. lten : flags:=F_AE;
  77. gtn : flags:=F_B;
  78. gten : flags:=F_BE;
  79. end
  80. else
  81. case p^.treetype of
  82. equaln : flags:=F_E;
  83. unequaln : flags:=F_NE;
  84. ltn : flags:=F_B;
  85. lten : flags:=F_BE;
  86. gtn : flags:=F_A;
  87. gten : flags:=F_AE;
  88. end;
  89. end;
  90. clear_location(p^.location);
  91. p^.location.loc:=LOC_FLAGS;
  92. p^.location.resflags:=flags;
  93. end;
  94. end;
  95. {*****************************************************************************
  96. Addstring
  97. *****************************************************************************}
  98. procedure addstring(var p : ptree);
  99. var
  100. pushedregs : tpushed;
  101. href : treference;
  102. pushed,
  103. cmpop : boolean;
  104. begin
  105. { string operations are not commutative }
  106. if p^.swaped then
  107. swaptree(p);
  108. {$ifdef UseAnsiString}
  109. if is_ansistring(p^.left^.resulttype) then
  110. begin
  111. case p^.treetype of
  112. addn :
  113. begin
  114. { we do not need destination anymore }
  115. del_reference(p^.left^.location.reference);
  116. del_reference(p^.right^.location.reference);
  117. { concatansistring(p); }
  118. end;
  119. ltn,lten,gtn,gten,
  120. equaln,unequaln :
  121. begin
  122. pushusedregisters(pushedregs,$ff);
  123. secondpass(p^.left);
  124. del_reference(p^.left^.location.reference);
  125. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  126. secondpass(p^.right);
  127. del_reference(p^.right^.location.reference);
  128. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  129. emitcall('FPC_ANSISTRCMP',true);
  130. maybe_loadesi;
  131. popusedregisters(pushedregs);
  132. end;
  133. end;
  134. end
  135. else
  136. {$endif UseAnsiString}
  137. case p^.treetype of
  138. addn :
  139. begin
  140. cmpop:=false;
  141. secondpass(p^.left);
  142. { if str_concat is set in expr
  143. s:=s+ ... no need to create a temp string (PM) }
  144. if (p^.left^.treetype<>addn) and not (p^.use_strconcat) then
  145. begin
  146. { can only reference be }
  147. { string in register would be funny }
  148. { therefore produce a temporary string }
  149. { release the registers }
  150. del_reference(p^.left^.location.reference);
  151. gettempofsizereference(256,href);
  152. copystring(href,p^.left^.location.reference,255);
  153. ungetiftemp(p^.left^.location.reference);
  154. { does not hurt: }
  155. clear_location(p^.left^.location);
  156. p^.left^.location.loc:=LOC_MEM;
  157. p^.left^.location.reference:=href;
  158. end;
  159. secondpass(p^.right);
  160. { on the right we do not need the register anymore too }
  161. del_reference(p^.right^.location.reference);
  162. { if p^.right^.resulttype^.deftype=orddef then
  163. begin
  164. pushusedregisters(pushedregs,$ff);
  165. exprasmlist^.concat(new(pai386,op_ref_reg(
  166. A_LEA,S_L,newreference(p^.left^.location.reference),R_EDI)));
  167. exprasmlist^.concat(new(pai386,op_reg_reg(
  168. A_XOR,S_L,R_EBX,R_EBX)));
  169. reset_reference(href);
  170. href.base:=R_EDI;
  171. exprasmlist^.concat(new(pai386,op_ref_reg(
  172. A_MOV,S_B,newreference(href),R_BL)));
  173. exprasmlist^.concat(new(pai386,op_reg(
  174. A_INC,S_L,R_EBX)));
  175. exprasmlist^.concat(new(pai386,op_reg_ref(
  176. A_MOV,S_B,R_BL,newreference(href))));
  177. href.index:=R_EBX;
  178. if p^.right^.treetype=ordconstn then
  179. exprasmlist^.concat(new(pai386,op_const_ref(
  180. A_MOV,S_L,p^.right^.value,newreference(href))))
  181. else
  182. begin
  183. if p^.right^.location.loc in [LOC_CREGISTER,LOC_REGISTER] then
  184. exprasmlist^.concat(new(pai386,op_reg_ref(
  185. A_MOV,S_B,p^.right^.location.register,newreference(href))))
  186. else
  187. begin
  188. exprasmlist^.concat(new(pai386,op_ref_reg(
  189. A_MOV,S_L,newreference(p^.right^.location.reference),R_EAX)));
  190. exprasmlist^.concat(new(pai386,op_reg_ref(
  191. A_MOV,S_B,R_AL,newreference(href))));
  192. end;
  193. end;
  194. popusedregisters(pushedregs);
  195. end
  196. else }
  197. begin
  198. pushusedregisters(pushedregs,$ff);
  199. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  200. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  201. emitcall('FPC_STRCONCAT',true);
  202. maybe_loadesi;
  203. popusedregisters(pushedregs);
  204. end;
  205. set_location(p^.location,p^.left^.location);
  206. ungetiftemp(p^.right^.location.reference);
  207. end;
  208. ltn,lten,gtn,gten,
  209. equaln,unequaln :
  210. begin
  211. cmpop:=true;
  212. { generate better code for s='' and s<>'' }
  213. if (p^.treetype in [equaln,unequaln]) and
  214. (((p^.left^.treetype=stringconstn) and (str_length(p^.left)=0)) or
  215. ((p^.right^.treetype=stringconstn) and (str_length(p^.right)=0))) then
  216. begin
  217. secondpass(p^.left);
  218. { are too few registers free? }
  219. pushed:=maybe_push(p^.right^.registers32,p);
  220. secondpass(p^.right);
  221. if pushed then restore(p);
  222. del_reference(p^.right^.location.reference);
  223. del_reference(p^.left^.location.reference);
  224. { only one node can be stringconstn }
  225. { else pass 1 would have evaluted }
  226. { this node }
  227. if p^.left^.treetype=stringconstn then
  228. exprasmlist^.concat(new(pai386,op_const_ref(
  229. A_CMP,S_B,0,newreference(p^.right^.location.reference))))
  230. else
  231. exprasmlist^.concat(new(pai386,op_const_ref(
  232. A_CMP,S_B,0,newreference(p^.left^.location.reference))));
  233. end
  234. else
  235. begin
  236. pushusedregisters(pushedregs,$ff);
  237. secondpass(p^.left);
  238. del_reference(p^.left^.location.reference);
  239. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  240. secondpass(p^.right);
  241. del_reference(p^.right^.location.reference);
  242. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  243. emitcall('FPC_STRCMP',true);
  244. maybe_loadesi;
  245. popusedregisters(pushedregs);
  246. end;
  247. ungetiftemp(p^.left^.location.reference);
  248. ungetiftemp(p^.right^.location.reference);
  249. end;
  250. else CGMessage(type_e_mismatch);
  251. end;
  252. SetResultLocation(cmpop,true,p);
  253. end;
  254. {*****************************************************************************
  255. Addset
  256. *****************************************************************************}
  257. procedure addset(var p : ptree);
  258. var
  259. cmpop,
  260. pushed : boolean;
  261. href : treference;
  262. pushedregs : tpushed;
  263. begin
  264. cmpop:=false;
  265. { not commutative }
  266. if p^.swaped then
  267. swaptree(p);
  268. secondpass(p^.left);
  269. { are too few registers free? }
  270. pushed:=maybe_push(p^.right^.registers32,p);
  271. secondpass(p^.right);
  272. if codegenerror then
  273. exit;
  274. if pushed then
  275. restore(p);
  276. set_location(p^.location,p^.left^.location);
  277. { handle operations }
  278. case p^.treetype of
  279. equaln,
  280. unequaln : begin
  281. cmpop:=true;
  282. del_reference(p^.left^.location.reference);
  283. del_reference(p^.right^.location.reference);
  284. pushusedregisters(pushedregs,$ff);
  285. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  286. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  287. emitcall('FPC_SET_COMP_SETS',true);
  288. maybe_loadesi;
  289. popusedregisters(pushedregs);
  290. ungetiftemp(p^.left^.location.reference);
  291. ungetiftemp(p^.right^.location.reference);
  292. end;
  293. addn : begin
  294. { add can be an other SET or Range or Element ! }
  295. del_reference(p^.left^.location.reference);
  296. del_reference(p^.right^.location.reference);
  297. pushusedregisters(pushedregs,$ff);
  298. href.symbol:=nil;
  299. gettempofsizereference(32,href);
  300. { add a range or a single element? }
  301. if p^.right^.treetype=setelementn then
  302. begin
  303. concatcopy(p^.left^.location.reference,href,32,false);
  304. if assigned(p^.right^.right) then
  305. begin
  306. pushsetelement(p^.right^.right);
  307. pushsetelement(p^.right^.left);
  308. emitpushreferenceaddr(exprasmlist,href);
  309. emitcall('FPC_SET_SET_RANGE',true);
  310. end
  311. else
  312. begin
  313. pushsetelement(p^.right^.left);
  314. emitpushreferenceaddr(exprasmlist,href);
  315. emitcall('FPC_SET_SET_BYTE',true);
  316. end;
  317. end
  318. else
  319. begin
  320. { must be an other set }
  321. emitpushreferenceaddr(exprasmlist,href);
  322. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  323. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  324. emitcall('FPC_SET_ADD_SETS',true);
  325. end;
  326. maybe_loadesi;
  327. popusedregisters(pushedregs);
  328. ungetiftemp(p^.left^.location.reference);
  329. ungetiftemp(p^.right^.location.reference);
  330. p^.location.loc:=LOC_MEM;
  331. stringdispose(p^.location.reference.symbol);
  332. p^.location.reference:=href;
  333. end;
  334. subn,
  335. symdifn,
  336. muln : begin
  337. del_reference(p^.left^.location.reference);
  338. del_reference(p^.right^.location.reference);
  339. href.symbol:=nil;
  340. pushusedregisters(pushedregs,$ff);
  341. gettempofsizereference(32,href);
  342. emitpushreferenceaddr(exprasmlist,href);
  343. emitpushreferenceaddr(exprasmlist,p^.right^.location.reference);
  344. emitpushreferenceaddr(exprasmlist,p^.left^.location.reference);
  345. case p^.treetype of
  346. subn : emitcall('FPC_SET_SUB_SETS',true);
  347. symdifn : emitcall('FPC_SET_SYMDIF_SETS',true);
  348. muln : emitcall('FPC_SET_MUL_SETS',true);
  349. end;
  350. maybe_loadesi;
  351. popusedregisters(pushedregs);
  352. ungetiftemp(p^.left^.location.reference);
  353. ungetiftemp(p^.right^.location.reference);
  354. p^.location.loc:=LOC_MEM;
  355. stringdispose(p^.location.reference.symbol);
  356. p^.location.reference:=href;
  357. end;
  358. else
  359. CGMessage(type_e_mismatch);
  360. end;
  361. SetResultLocation(cmpop,true,p);
  362. end;
  363. {*****************************************************************************
  364. SecondAdd
  365. *****************************************************************************}
  366. procedure secondadd(var p : ptree);
  367. { is also being used for xor, and "mul", "sub, or and comparative }
  368. { operators }
  369. label do_normal;
  370. var
  371. hregister : tregister;
  372. noswap,
  373. pushed,mboverflow,cmpop : boolean;
  374. op : tasmop;
  375. flags : tresflags;
  376. otl,ofl : plabel;
  377. power : longint;
  378. opsize : topsize;
  379. hl4: plabel;
  380. { true, if unsigned types are compared }
  381. unsigned : boolean;
  382. { true, if a small set is handled with the longint code }
  383. is_set : boolean;
  384. { is_in_dest if the result is put directly into }
  385. { the resulting refernce or varregister }
  386. is_in_dest : boolean;
  387. { true, if for sets subtractions the extra not should generated }
  388. extra_not : boolean;
  389. {$ifdef SUPPORT_MMX}
  390. mmxbase : tmmxtype;
  391. {$endif SUPPORT_MMX}
  392. begin
  393. { to make it more readable, string and set (not smallset!) have their
  394. own procedures }
  395. case p^.left^.resulttype^.deftype of
  396. stringdef : begin
  397. addstring(p);
  398. exit;
  399. end;
  400. setdef : begin
  401. { normalsets are handled separate }
  402. if not(psetdef(p^.left^.resulttype)^.settype=smallset) then
  403. begin
  404. addset(p);
  405. exit;
  406. end;
  407. end;
  408. end;
  409. { defaults }
  410. unsigned:=false;
  411. is_in_dest:=false;
  412. extra_not:=false;
  413. noswap:=false;
  414. opsize:=S_L;
  415. { are we a (small)set, must be set here because the side can be
  416. swapped ! (PFV) }
  417. is_set:=(p^.left^.resulttype^.deftype=setdef);
  418. { calculate the operator which is more difficult }
  419. firstcomplex(p);
  420. { handling boolean expressions extra: }
  421. if ((p^.left^.resulttype^.deftype=orddef) and
  422. (porddef(p^.left^.resulttype)^.typ in [bool8bit,bool16bit,bool32bit])) or
  423. ((p^.right^.resulttype^.deftype=orddef) and
  424. (porddef(p^.right^.resulttype)^.typ in [bool8bit,bool16bit,bool32bit])) then
  425. begin
  426. if (porddef(p^.left^.resulttype)^.typ=bool8bit) or
  427. (porddef(p^.right^.resulttype)^.typ=bool8bit) then
  428. opsize:=S_B
  429. else
  430. if (porddef(p^.left^.resulttype)^.typ=bool16bit) or
  431. (porddef(p^.right^.resulttype)^.typ=bool16bit) then
  432. opsize:=S_W
  433. else
  434. opsize:=S_L;
  435. case p^.treetype of
  436. andn,
  437. orn : begin
  438. clear_location(p^.location);
  439. p^.location.loc:=LOC_JUMP;
  440. cmpop:=false;
  441. case p^.treetype of
  442. andn : begin
  443. otl:=truelabel;
  444. getlabel(truelabel);
  445. secondpass(p^.left);
  446. maketojumpbool(p^.left);
  447. emitl(A_LABEL,truelabel);
  448. truelabel:=otl;
  449. end;
  450. orn : begin
  451. ofl:=falselabel;
  452. getlabel(falselabel);
  453. secondpass(p^.left);
  454. maketojumpbool(p^.left);
  455. emitl(A_LABEL,falselabel);
  456. falselabel:=ofl;
  457. end;
  458. else
  459. CGMessage(type_e_mismatch);
  460. end;
  461. secondpass(p^.right);
  462. maketojumpbool(p^.right);
  463. end;
  464. unequaln,
  465. equaln,xorn : begin
  466. if p^.left^.treetype=ordconstn then
  467. swaptree(p);
  468. secondpass(p^.left);
  469. p^.location:=p^.left^.location;
  470. { are enough registers free ? }
  471. pushed:=maybe_push(p^.right^.registers32,p);
  472. secondpass(p^.right);
  473. if pushed then restore(p);
  474. goto do_normal;
  475. end
  476. else
  477. CGMessage(type_e_mismatch);
  478. end
  479. end
  480. else
  481. begin
  482. { in case of constant put it to the left }
  483. if (p^.left^.treetype=ordconstn) then
  484. swaptree(p);
  485. secondpass(p^.left);
  486. { this will be complicated as
  487. a lot of code below assumes that
  488. p^.location and p^.left^.location are the same }
  489. {$ifdef test_dest_loc}
  490. if dest_loc_known and (dest_loc_tree=p) and
  491. ((dest_loc.loc=LOC_REGISTER) or (dest_loc.loc=LOC_CREGISTER)) then
  492. begin
  493. set_location(p^.location,dest_loc);
  494. in_dest_loc:=true;
  495. is_in_dest:=true;
  496. end
  497. else
  498. {$endif test_dest_loc}
  499. set_location(p^.location,p^.left^.location);
  500. { are too few registers free? }
  501. pushed:=maybe_push(p^.right^.registers32,p);
  502. secondpass(p^.right);
  503. if pushed then
  504. restore(p);
  505. if (p^.left^.resulttype^.deftype=pointerdef) or
  506. (p^.right^.resulttype^.deftype=pointerdef) or
  507. ((p^.right^.resulttype^.deftype=objectdef) and
  508. pobjectdef(p^.right^.resulttype)^.isclass and
  509. (p^.left^.resulttype^.deftype=objectdef) and
  510. pobjectdef(p^.left^.resulttype)^.isclass
  511. ) or
  512. (p^.left^.resulttype^.deftype=classrefdef) or
  513. (p^.left^.resulttype^.deftype=procvardef) or
  514. (p^.left^.resulttype^.deftype=enumdef) or
  515. ((p^.left^.resulttype^.deftype=orddef) and
  516. (porddef(p^.left^.resulttype)^.typ=s32bit)) or
  517. ((p^.right^.resulttype^.deftype=orddef) and
  518. (porddef(p^.right^.resulttype)^.typ=s32bit)) or
  519. ((p^.left^.resulttype^.deftype=orddef) and
  520. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  521. ((p^.right^.resulttype^.deftype=orddef) and
  522. (porddef(p^.right^.resulttype)^.typ=u32bit)) or
  523. { as well as small sets }
  524. is_set then
  525. begin
  526. do_normal:
  527. mboverflow:=false;
  528. cmpop:=false;
  529. if (p^.left^.resulttype^.deftype=pointerdef) or
  530. (p^.right^.resulttype^.deftype=pointerdef) or
  531. ((p^.left^.resulttype^.deftype=orddef) and
  532. (porddef(p^.left^.resulttype)^.typ=u32bit)) or
  533. ((p^.right^.resulttype^.deftype=orddef) and
  534. (porddef(p^.right^.resulttype)^.typ=u32bit)) then
  535. unsigned:=true;
  536. case p^.treetype of
  537. addn : begin
  538. if is_set then
  539. begin
  540. { adding elements is not commutative }
  541. if p^.swaped and (p^.left^.treetype=setelementn) then
  542. swaptree(p);
  543. { are we adding set elements ? }
  544. if p^.right^.treetype=setelementn then
  545. begin
  546. { no range support for smallsets! }
  547. if assigned(p^.right^.right) then
  548. internalerror(43244);
  549. { bts requires both elements to be registers }
  550. if p^.left^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  551. begin
  552. del_reference(p^.left^.location.reference);
  553. hregister:=getregister32;
  554. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  555. newreference(p^.left^.location.reference),hregister)));
  556. clear_location(p^.left^.location);
  557. p^.left^.location.loc:=LOC_REGISTER;
  558. p^.left^.location.register:=hregister;
  559. set_location(p^.location,p^.left^.location);
  560. end;
  561. if p^.right^.location.loc in [LOC_MEM,LOC_REFERENCE] then
  562. begin
  563. del_reference(p^.right^.location.reference);
  564. hregister:=getregister32;
  565. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  566. newreference(p^.right^.location.reference),hregister)));
  567. clear_location(p^.right^.location);
  568. p^.right^.location.loc:=LOC_REGISTER;
  569. p^.right^.location.register:=hregister;
  570. end;
  571. op:=A_BTS;
  572. noswap:=true;
  573. end
  574. else
  575. op:=A_OR;
  576. mboverflow:=false;
  577. unsigned:=false;
  578. end
  579. else
  580. begin
  581. op:=A_ADD;
  582. mboverflow:=true;
  583. end;
  584. end;
  585. symdifn : begin
  586. { the symetric diff is only for sets }
  587. if is_set then
  588. begin
  589. op:=A_XOR;
  590. mboverflow:=false;
  591. unsigned:=false;
  592. end
  593. else
  594. CGMessage(type_e_mismatch);
  595. end;
  596. muln : begin
  597. if is_set then
  598. begin
  599. op:=A_AND;
  600. mboverflow:=false;
  601. unsigned:=false;
  602. end
  603. else
  604. begin
  605. if unsigned then
  606. op:=A_MUL
  607. else
  608. op:=A_IMUL;
  609. mboverflow:=true;
  610. end;
  611. end;
  612. subn : begin
  613. if is_set then
  614. begin
  615. op:=A_AND;
  616. mboverflow:=false;
  617. unsigned:=false;
  618. extra_not:=true;
  619. end
  620. else
  621. begin
  622. op:=A_SUB;
  623. mboverflow:=true;
  624. end;
  625. end;
  626. ltn,lten,
  627. gtn,gten,
  628. equaln,unequaln : begin
  629. op:=A_CMP;
  630. cmpop:=true;
  631. end;
  632. xorn : op:=A_XOR;
  633. orn : op:=A_OR;
  634. andn : op:=A_AND;
  635. else
  636. CGMessage(type_e_mismatch);
  637. end;
  638. { left and right no register? }
  639. { then one must be demanded }
  640. if (p^.left^.location.loc<>LOC_REGISTER) and
  641. (p^.right^.location.loc<>LOC_REGISTER) then
  642. begin
  643. { register variable ? }
  644. if (p^.left^.location.loc=LOC_CREGISTER) then
  645. begin
  646. { it is OK if this is the destination }
  647. if is_in_dest then
  648. begin
  649. hregister:=p^.location.register;
  650. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  651. hregister);
  652. end
  653. else
  654. if cmpop then
  655. begin
  656. { do not disturb the register }
  657. hregister:=p^.location.register;
  658. end
  659. else
  660. begin
  661. case opsize of
  662. S_L : hregister:=getregister32;
  663. S_B : hregister:=reg32toreg8(getregister32);
  664. end;
  665. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,
  666. hregister);
  667. end
  668. end
  669. else
  670. begin
  671. del_reference(p^.left^.location.reference);
  672. if is_in_dest then
  673. begin
  674. hregister:=p^.location.register;
  675. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  676. newreference(p^.left^.location.reference),hregister)));
  677. end
  678. else
  679. begin
  680. { first give free, then demand new register }
  681. case opsize of
  682. S_L : hregister:=getregister32;
  683. S_W : hregister:=reg32toreg16(getregister32);
  684. S_B : hregister:=reg32toreg8(getregister32);
  685. end;
  686. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  687. newreference(p^.left^.location.reference),hregister)));
  688. end;
  689. end;
  690. clear_location(p^.location);
  691. p^.location.loc:=LOC_REGISTER;
  692. p^.location.register:=hregister;
  693. end
  694. else
  695. { if on the right the register then swap }
  696. if not(noswap) and (p^.right^.location.loc=LOC_REGISTER) then
  697. begin
  698. swap_location(p^.location,p^.right^.location);
  699. { newly swapped also set swapped flag }
  700. p^.swaped:=not(p^.swaped);
  701. end;
  702. { at this point, p^.location.loc should be LOC_REGISTER }
  703. { and p^.location.register should be a valid register }
  704. { containing the left result }
  705. if p^.right^.location.loc<>LOC_REGISTER then
  706. begin
  707. if (p^.treetype=subn) and p^.swaped then
  708. begin
  709. if p^.right^.location.loc=LOC_CREGISTER then
  710. begin
  711. if extra_not then
  712. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  713. emit_reg_reg(A_MOV,opsize,p^.right^.location.register,R_EDI);
  714. emit_reg_reg(op,opsize,p^.location.register,R_EDI);
  715. emit_reg_reg(A_MOV,opsize,R_EDI,p^.location.register);
  716. end
  717. else
  718. begin
  719. if extra_not then
  720. exprasmlist^.concat(new(pai386,op_reg(A_NOT,opsize,p^.location.register)));
  721. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,opsize,
  722. newreference(p^.right^.location.reference),R_EDI)));
  723. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,p^.location.register,R_EDI)));
  724. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOV,opsize,R_EDI,p^.location.register)));
  725. del_reference(p^.right^.location.reference);
  726. end;
  727. end
  728. else
  729. begin
  730. if (p^.right^.treetype=ordconstn) and
  731. (op=A_CMP) and
  732. (p^.right^.value=0) then
  733. begin
  734. exprasmlist^.concat(new(pai386,op_reg_reg(A_TEST,opsize,p^.location.register,
  735. p^.location.register)));
  736. end
  737. else if (p^.right^.treetype=ordconstn) and
  738. (op=A_ADD) and
  739. (p^.right^.value=1) then
  740. begin
  741. exprasmlist^.concat(new(pai386,op_reg(A_INC,opsize,
  742. p^.location.register)));
  743. end
  744. else if (p^.right^.treetype=ordconstn) and
  745. (op=A_SUB) and
  746. (p^.right^.value=1) then
  747. begin
  748. exprasmlist^.concat(new(pai386,op_reg(A_DEC,opsize,
  749. p^.location.register)));
  750. end
  751. else if (p^.right^.treetype=ordconstn) and
  752. (op=A_IMUL) and
  753. (ispowerof2(p^.right^.value,power)) then
  754. begin
  755. exprasmlist^.concat(new(pai386,op_const_reg(A_SHL,opsize,power,
  756. p^.location.register)));
  757. end
  758. else
  759. begin
  760. if (p^.right^.location.loc=LOC_CREGISTER) then
  761. begin
  762. if extra_not then
  763. begin
  764. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,R_EDI);
  765. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  766. emit_reg_reg(A_AND,S_L,R_EDI,
  767. p^.location.register);
  768. end
  769. else
  770. begin
  771. emit_reg_reg(op,opsize,p^.right^.location.register,
  772. p^.location.register);
  773. end;
  774. end
  775. else
  776. begin
  777. if extra_not then
  778. begin
  779. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_L,newreference(
  780. p^.right^.location.reference),R_EDI)));
  781. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,R_EDI)));
  782. emit_reg_reg(A_AND,S_L,R_EDI,
  783. p^.location.register);
  784. end
  785. else
  786. begin
  787. exprasmlist^.concat(new(pai386,op_ref_reg(op,opsize,newreference(
  788. p^.right^.location.reference),p^.location.register)));
  789. end;
  790. del_reference(p^.right^.location.reference);
  791. end;
  792. end;
  793. end;
  794. end
  795. else
  796. begin
  797. { when swapped another result register }
  798. if (p^.treetype=subn) and p^.swaped then
  799. begin
  800. if extra_not then
  801. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.location.register)));
  802. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  803. p^.location.register,p^.right^.location.register)));
  804. swap_location(p^.location,p^.right^.location);
  805. { newly swapped also set swapped flag }
  806. { just to maintain ordering }
  807. p^.swaped:=not(p^.swaped);
  808. end
  809. else
  810. begin
  811. if extra_not then
  812. exprasmlist^.concat(new(pai386,op_reg(A_NOT,S_L,p^.right^.location.register)));
  813. exprasmlist^.concat(new(pai386,op_reg_reg(op,opsize,
  814. p^.right^.location.register,
  815. p^.location.register)));
  816. end;
  817. case opsize of
  818. S_L : ungetregister32(p^.right^.location.register);
  819. S_B : ungetregister32(reg8toreg32(p^.right^.location.register));
  820. end;
  821. end;
  822. if cmpop then
  823. case opsize of
  824. S_L : ungetregister32(p^.location.register);
  825. S_B : ungetregister32(reg8toreg32(p^.location.register));
  826. end;
  827. { only in case of overflow operations }
  828. { produce overflow code }
  829. { we must put it here directly, because sign of operation }
  830. { is in unsigned VAR!! }
  831. if mboverflow then
  832. begin
  833. if cs_check_overflow in aktlocalswitches then
  834. begin
  835. getlabel(hl4);
  836. if unsigned then
  837. emitl(A_JNB,hl4)
  838. else
  839. emitl(A_JNO,hl4);
  840. emitcall('FPC_OVERFLOW',true);
  841. emitl(A_LABEL,hl4);
  842. end;
  843. end;
  844. end
  845. else
  846. { Char type }
  847. if ((p^.left^.resulttype^.deftype=orddef) and
  848. (porddef(p^.left^.resulttype)^.typ=uchar)) then
  849. begin
  850. case p^.treetype of
  851. ltn,lten,gtn,gten,
  852. equaln,unequaln :
  853. cmpop:=true;
  854. else CGMessage(type_e_mismatch);
  855. end;
  856. unsigned:=true;
  857. { left and right no register? }
  858. { the one must be demanded }
  859. if (p^.location.loc<>LOC_REGISTER) and
  860. (p^.right^.location.loc<>LOC_REGISTER) then
  861. begin
  862. if p^.location.loc=LOC_CREGISTER then
  863. begin
  864. if cmpop then
  865. { do not disturb register }
  866. hregister:=p^.location.register
  867. else
  868. begin
  869. hregister:=reg32toreg8(getregister32);
  870. emit_reg_reg(A_MOV,S_B,p^.location.register,
  871. hregister);
  872. end;
  873. end
  874. else
  875. begin
  876. del_reference(p^.location.reference);
  877. { first give free then demand new register }
  878. hregister:=reg32toreg8(getregister32);
  879. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOV,S_B,newreference(p^.location.reference),
  880. hregister)));
  881. end;
  882. clear_location(p^.location);
  883. p^.location.loc:=LOC_REGISTER;
  884. p^.location.register:=hregister;
  885. end;
  886. { now p always a register }
  887. if (p^.right^.location.loc=LOC_REGISTER) and
  888. (p^.location.loc<>LOC_REGISTER) then
  889. begin
  890. swap_location(p^.location,p^.right^.location);
  891. { newly swapped also set swapped flag }
  892. p^.swaped:=not(p^.swaped);
  893. end;
  894. if p^.right^.location.loc<>LOC_REGISTER then
  895. begin
  896. if p^.right^.location.loc=LOC_CREGISTER then
  897. begin
  898. emit_reg_reg(A_CMP,S_B,
  899. p^.right^.location.register,p^.location.register);
  900. end
  901. else
  902. begin
  903. exprasmlist^.concat(new(pai386,op_ref_reg(A_CMP,S_B,newreference(
  904. p^.right^.location.reference),p^.location.register)));
  905. del_reference(p^.right^.location.reference);
  906. end;
  907. end
  908. else
  909. begin
  910. emit_reg_reg(A_CMP,S_B,p^.right^.location.register,
  911. p^.location.register);
  912. ungetregister32(reg8toreg32(p^.right^.location.register));
  913. end;
  914. ungetregister32(reg8toreg32(p^.location.register));
  915. end
  916. else
  917. { Floating point }
  918. if (p^.left^.resulttype^.deftype=floatdef) and
  919. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  920. begin
  921. { real constants to the left }
  922. if p^.left^.treetype=realconstn then
  923. swaptree(p);
  924. cmpop:=false;
  925. case p^.treetype of
  926. addn : op:=A_FADDP;
  927. muln : op:=A_FMULP;
  928. subn : op:=A_FSUBP;
  929. slashn : op:=A_FDIVP;
  930. ltn,lten,gtn,gten,
  931. equaln,unequaln : begin
  932. op:=A_FCOMPP;
  933. cmpop:=true;
  934. end;
  935. else CGMessage(type_e_mismatch);
  936. end;
  937. if (p^.right^.location.loc<>LOC_FPU) then
  938. begin
  939. floatload(pfloatdef(p^.right^.resulttype)^.typ,p^.right^.location.reference);
  940. if (p^.left^.location.loc<>LOC_FPU) then
  941. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  942. { left was on the stack => swap }
  943. else
  944. p^.swaped:=not(p^.swaped);
  945. { releases the right reference }
  946. del_reference(p^.right^.location.reference);
  947. end
  948. { the nominator in st0 }
  949. else if (p^.left^.location.loc<>LOC_FPU) then
  950. floatload(pfloatdef(p^.left^.resulttype)^.typ,p^.left^.location.reference)
  951. { fpu operands are always in the wrong order on the stack }
  952. else
  953. p^.swaped:=not(p^.swaped);
  954. { releases the left reference }
  955. if (p^.left^.location.loc<>LOC_FPU) then
  956. del_reference(p^.left^.location.reference);
  957. { if we swaped the tree nodes, then use the reverse operator }
  958. if p^.swaped then
  959. begin
  960. if (p^.treetype=slashn) then
  961. op:=A_FDIVRP
  962. else if (p^.treetype=subn) then
  963. op:=A_FSUBRP;
  964. end;
  965. { to avoid the pentium bug
  966. if (op=FDIVP) and (opt_processors=pentium) then
  967. exprasmlist^.concat(new(pai386,op_CALL,S_NO,'EMUL_FDIVP')
  968. else
  969. }
  970. { the Intel assemblers want operands }
  971. if op<>A_FCOMPP then
  972. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,R_ST,R_ST1)))
  973. else
  974. exprasmlist^.concat(new(pai386,op_none(op,S_NO)));
  975. { on comparison load flags }
  976. if cmpop then
  977. begin
  978. if not(R_EAX in unused) then
  979. emit_reg_reg(A_MOV,S_L,R_EAX,R_EDI);
  980. exprasmlist^.concat(new(pai386,op_reg(A_FNSTSW,S_NO,R_AX)));
  981. exprasmlist^.concat(new(pai386,op_none(A_SAHF,S_NO)));
  982. if not(R_EAX in unused) then
  983. emit_reg_reg(A_MOV,S_L,R_EDI,R_EAX);
  984. if p^.swaped then
  985. begin
  986. case p^.treetype of
  987. equaln : flags:=F_E;
  988. unequaln : flags:=F_NE;
  989. ltn : flags:=F_A;
  990. lten : flags:=F_AE;
  991. gtn : flags:=F_B;
  992. gten : flags:=F_BE;
  993. end;
  994. end
  995. else
  996. begin
  997. case p^.treetype of
  998. equaln : flags:=F_E;
  999. unequaln : flags:=F_NE;
  1000. ltn : flags:=F_B;
  1001. lten : flags:=F_BE;
  1002. gtn : flags:=F_A;
  1003. gten : flags:=F_AE;
  1004. end;
  1005. end;
  1006. clear_location(p^.location);
  1007. p^.location.loc:=LOC_FLAGS;
  1008. p^.location.resflags:=flags;
  1009. cmpop:=false;
  1010. end
  1011. else
  1012. begin
  1013. clear_location(p^.location);
  1014. p^.location.loc:=LOC_FPU;
  1015. end;
  1016. end
  1017. {$ifdef SUPPORT_MMX}
  1018. else
  1019. { MMX Arrays }
  1020. if is_mmx_able_array(p^.left^.resulttype) then
  1021. begin
  1022. cmpop:=false;
  1023. mmxbase:=mmx_type(p^.left^.resulttype);
  1024. case p^.treetype of
  1025. addn : begin
  1026. if (cs_mmx_saturation in aktlocalswitches) then
  1027. begin
  1028. case mmxbase of
  1029. mmxs8bit:
  1030. op:=A_PADDSB;
  1031. mmxu8bit:
  1032. op:=A_PADDUSB;
  1033. mmxs16bit,mmxfixed16:
  1034. op:=A_PADDSB;
  1035. mmxu16bit:
  1036. op:=A_PADDUSW;
  1037. end;
  1038. end
  1039. else
  1040. begin
  1041. case mmxbase of
  1042. mmxs8bit,mmxu8bit:
  1043. op:=A_PADDB;
  1044. mmxs16bit,mmxu16bit,mmxfixed16:
  1045. op:=A_PADDW;
  1046. mmxs32bit,mmxu32bit:
  1047. op:=A_PADDD;
  1048. end;
  1049. end;
  1050. end;
  1051. muln : begin
  1052. case mmxbase of
  1053. mmxs16bit,mmxu16bit:
  1054. op:=A_PMULLW;
  1055. mmxfixed16:
  1056. op:=A_PMULHW;
  1057. end;
  1058. end;
  1059. subn : begin
  1060. if (cs_mmx_saturation in aktlocalswitches) then
  1061. begin
  1062. case mmxbase of
  1063. mmxs8bit:
  1064. op:=A_PSUBSB;
  1065. mmxu8bit:
  1066. op:=A_PSUBUSB;
  1067. mmxs16bit,mmxfixed16:
  1068. op:=A_PSUBSB;
  1069. mmxu16bit:
  1070. op:=A_PSUBUSW;
  1071. end;
  1072. end
  1073. else
  1074. begin
  1075. case mmxbase of
  1076. mmxs8bit,mmxu8bit:
  1077. op:=A_PSUBB;
  1078. mmxs16bit,mmxu16bit,mmxfixed16:
  1079. op:=A_PSUBW;
  1080. mmxs32bit,mmxu32bit:
  1081. op:=A_PSUBD;
  1082. end;
  1083. end;
  1084. end;
  1085. {
  1086. ltn,lten,gtn,gten,
  1087. equaln,unequaln :
  1088. begin
  1089. op:=A_CMP;
  1090. cmpop:=true;
  1091. end;
  1092. }
  1093. xorn:
  1094. op:=A_PXOR;
  1095. orn:
  1096. op:=A_POR;
  1097. andn:
  1098. op:=A_PAND;
  1099. else CGMessage(type_e_mismatch);
  1100. end;
  1101. { left and right no register? }
  1102. { then one must be demanded }
  1103. if (p^.left^.location.loc<>LOC_MMXREGISTER) and
  1104. (p^.right^.location.loc<>LOC_MMXREGISTER) then
  1105. begin
  1106. { register variable ? }
  1107. if (p^.left^.location.loc=LOC_CMMXREGISTER) then
  1108. begin
  1109. { it is OK if this is the destination }
  1110. if is_in_dest then
  1111. begin
  1112. hregister:=p^.location.register;
  1113. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1114. hregister);
  1115. end
  1116. else
  1117. begin
  1118. hregister:=getregistermmx;
  1119. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  1120. hregister);
  1121. end
  1122. end
  1123. else
  1124. begin
  1125. del_reference(p^.left^.location.reference);
  1126. if is_in_dest then
  1127. begin
  1128. hregister:=p^.location.register;
  1129. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1130. newreference(p^.left^.location.reference),hregister)));
  1131. end
  1132. else
  1133. begin
  1134. hregister:=getregistermmx;
  1135. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1136. newreference(p^.left^.location.reference),hregister)));
  1137. end;
  1138. end;
  1139. clear_location(p^.location);
  1140. p^.location.loc:=LOC_MMXREGISTER;
  1141. p^.location.register:=hregister;
  1142. end
  1143. else
  1144. { if on the right the register then swap }
  1145. if (p^.right^.location.loc=LOC_MMXREGISTER) then
  1146. begin
  1147. swap_location(p^.location,p^.right^.location);
  1148. { newly swapped also set swapped flag }
  1149. p^.swaped:=not(p^.swaped);
  1150. end;
  1151. { at this point, p^.location.loc should be LOC_MMXREGISTER }
  1152. { and p^.location.register should be a valid register }
  1153. { containing the left result }
  1154. if p^.right^.location.loc<>LOC_MMXREGISTER then
  1155. begin
  1156. if (p^.treetype=subn) and p^.swaped then
  1157. begin
  1158. if p^.right^.location.loc=LOC_CMMXREGISTER then
  1159. begin
  1160. emit_reg_reg(A_MOVQ,S_NO,p^.right^.location.register,R_MM7);
  1161. emit_reg_reg(op,S_NO,p^.location.register,R_EDI);
  1162. emit_reg_reg(A_MOVQ,S_NO,R_MM7,p^.location.register);
  1163. end
  1164. else
  1165. begin
  1166. exprasmlist^.concat(new(pai386,op_ref_reg(A_MOVQ,S_NO,
  1167. newreference(p^.right^.location.reference),R_MM7)));
  1168. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,p^.location.register,
  1169. R_MM7)));
  1170. exprasmlist^.concat(new(pai386,op_reg_reg(A_MOVQ,S_NO,
  1171. R_MM7,p^.location.register)));
  1172. del_reference(p^.right^.location.reference);
  1173. end;
  1174. end
  1175. else
  1176. begin
  1177. if (p^.right^.location.loc=LOC_CREGISTER) then
  1178. begin
  1179. emit_reg_reg(op,S_NO,p^.right^.location.register,
  1180. p^.location.register);
  1181. end
  1182. else
  1183. begin
  1184. exprasmlist^.concat(new(pai386,op_ref_reg(op,S_NO,newreference(
  1185. p^.right^.location.reference),p^.location.register)));
  1186. del_reference(p^.right^.location.reference);
  1187. end;
  1188. end;
  1189. end
  1190. else
  1191. begin
  1192. { when swapped another result register }
  1193. if (p^.treetype=subn) and p^.swaped then
  1194. begin
  1195. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1196. p^.location.register,p^.right^.location.register)));
  1197. swap_location(p^.location,p^.right^.location);
  1198. { newly swapped also set swapped flag }
  1199. { just to maintain ordering }
  1200. p^.swaped:=not(p^.swaped);
  1201. end
  1202. else
  1203. begin
  1204. exprasmlist^.concat(new(pai386,op_reg_reg(op,S_NO,
  1205. p^.right^.location.register,
  1206. p^.location.register)));
  1207. end;
  1208. ungetregistermmx(p^.right^.location.register);
  1209. end;
  1210. end
  1211. {$endif SUPPORT_MMX}
  1212. else CGMessage(type_e_mismatch);
  1213. end;
  1214. SetResultLocation(cmpop,unsigned,p);
  1215. end;
  1216. end.
  1217. {
  1218. $Log$
  1219. Revision 1.17 1998-10-09 11:47:45 pierre
  1220. * still more memory leaks fixes !!
  1221. Revision 1.16 1998/10/09 08:56:21 pierre
  1222. * several memory leaks fixed
  1223. Revision 1.15 1998/10/08 17:17:10 pierre
  1224. * current_module old scanner tagged as invalid if unit is recompiled
  1225. + added ppheap for better info on tracegetmem of heaptrc
  1226. (adds line column and file index)
  1227. * several memory leaks removed ith help of heaptrc !!
  1228. Revision 1.14 1998/09/28 16:57:13 pierre
  1229. * changed all length(p^.value_str^) into str_length(p)
  1230. to get it work with and without ansistrings
  1231. * changed sourcefiles field of tmodule to a pointer
  1232. Revision 1.13 1998/09/17 09:42:09 peter
  1233. + pass_2 for cg386
  1234. * Message() -> CGMessage() for pass_1/pass_2
  1235. Revision 1.12 1998/09/14 10:43:44 peter
  1236. * all internal RTL functions start with FPC_
  1237. Revision 1.11 1998/09/07 18:45:52 peter
  1238. * update smartlinking, uses getdatalabel
  1239. * renamed ptree.value vars to value_str,value_real,value_set
  1240. Revision 1.10 1998/09/04 10:05:04 florian
  1241. * ugly fix for STRCAT, nevertheless it needs more fixing !!!!!!!
  1242. we need an new version of STRCAT which takes a length parameter
  1243. Revision 1.9 1998/09/04 08:41:36 peter
  1244. * updated some error CGMessages
  1245. Revision 1.8 1998/08/28 10:54:18 peter
  1246. * fixed smallset generation from elements, it has never worked before!
  1247. Revision 1.7 1998/08/19 14:56:59 peter
  1248. * forgot to removed some unused code in addset for set<>set
  1249. Revision 1.6 1998/08/18 09:24:35 pierre
  1250. * small warning position bug fixed
  1251. * support_mmx switches splitting was missing
  1252. * rhide error and warning output corrected
  1253. Revision 1.5 1998/08/14 18:18:37 peter
  1254. + dynamic set contruction
  1255. * smallsets are now working (always longint size)
  1256. Revision 1.4 1998/08/10 14:49:42 peter
  1257. + localswitches, moduleswitches, globalswitches splitting
  1258. Revision 1.3 1998/06/25 08:48:04 florian
  1259. * first version of rtti support
  1260. Revision 1.2 1998/06/08 13:13:28 pierre
  1261. + temporary variables now in temp_gen.pas unit
  1262. because it is processor independent
  1263. * mppc68k.bat modified to undefine i386 and support_mmx
  1264. (which are defaults for i386)
  1265. Revision 1.1 1998/06/05 17:44:10 peter
  1266. * splitted cgi386
  1267. }