cg386mat.pas 42 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025
  1. {
  2. $Id$
  3. Copyright (c) 1993-98 by Florian Klaempfl
  4. Generate i386 assembler for math nodes
  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 cg386mat;
  19. interface
  20. uses
  21. tree;
  22. procedure secondmoddiv(var p : ptree);
  23. procedure secondshlshr(var p : ptree);
  24. procedure secondumminus(var p : ptree);
  25. procedure secondnot(var p : ptree);
  26. implementation
  27. uses
  28. globtype,systems,
  29. cobjects,verbose,globals,
  30. symconst,symtable,aasm,types,
  31. hcodegen,temp_gen,pass_2,
  32. cpubase,cpuasm,
  33. {$ifdef dummy}
  34. end { this overcomes the annoying highlighting problem in my TP IDE,
  35. the IDE assumes i386asm start a asm block (FK) }
  36. {$endif}
  37. cgai386,tgeni386;
  38. {*****************************************************************************
  39. SecondModDiv
  40. *****************************************************************************}
  41. procedure secondmoddiv(var p : ptree);
  42. var
  43. hreg1 : tregister;
  44. shrdiv, andmod, pushed,popeax,popedx : boolean;
  45. power : longint;
  46. hl : pasmlabel;
  47. hloc : tlocation;
  48. pushedreg : tpushed;
  49. typename,opname : string[6];
  50. begin
  51. shrdiv := false;
  52. andmod := false;
  53. secondpass(p^.left);
  54. pushed:=maybe_push(p^.right^.registers32,p^.left,is_64bitint(p^.left^.resulttype));
  55. secondpass(p^.right);
  56. if pushed then
  57. restore(p^.left,is_64bitint(p^.left^.resulttype));
  58. set_location(p^.location,p^.left^.location);
  59. if is_64bitint(p^.resulttype) then
  60. begin
  61. { save p^.lcoation, because we change it now }
  62. set_location(hloc,p^.location);
  63. release_qword_loc(p^.location);
  64. release_qword_loc(p^.right^.location);
  65. p^.location.registerlow:=getexplicitregister32(R_EAX);
  66. p^.location.registerhigh:=getexplicitregister32(R_EDX);
  67. pushusedregisters(pushedreg,$ff
  68. and not($80 shr byte(p^.location.registerlow))
  69. and not($80 shr byte(p^.location.registerhigh)));
  70. { the left operand is in hloc, because the
  71. location of left is p^.location but p^.location
  72. is already destroyed
  73. }
  74. emit_pushq_loc(hloc);
  75. clear_location(hloc);
  76. emit_pushq_loc(p^.right^.location);
  77. if porddef(p^.resulttype)^.typ=u64bit then
  78. typename:='QWORD'
  79. else
  80. typename:='INT64';
  81. if p^.treetype=divn then
  82. opname:='DIV_'
  83. else
  84. opname:='MOD_';
  85. emitcall('FPC_'+opname+typename);
  86. emit_reg_reg(A_MOV,S_L,R_EAX,p^.location.registerlow);
  87. emit_reg_reg(A_MOV,S_L,R_EDX,p^.location.registerhigh);
  88. popusedregisters(pushedreg);
  89. p^.location.loc:=LOC_REGISTER;
  90. end
  91. else
  92. begin
  93. { put numerator in register }
  94. if p^.left^.location.loc<>LOC_REGISTER then
  95. begin
  96. if p^.left^.location.loc=LOC_CREGISTER then
  97. begin
  98. hreg1:=getregister32;
  99. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,hreg1);
  100. end
  101. else
  102. begin
  103. del_reference(p^.left^.location.reference);
  104. hreg1:=getregister32;
  105. emit_ref_reg(A_MOV,S_L,newreference(p^.left^.location.reference),
  106. hreg1);
  107. end;
  108. clear_location(p^.left^.location);
  109. p^.left^.location.loc:=LOC_REGISTER;
  110. p^.left^.location.register:=hreg1;
  111. end
  112. else hreg1:=p^.left^.location.register;
  113. if (p^.treetype=divn) and (p^.right^.treetype=ordconstn) and
  114. ispowerof2(p^.right^.value,power) then
  115. Begin
  116. shrdiv := true;
  117. {for signed numbers, the numerator must be adjusted before the
  118. shift instruction, but not wih unsigned numbers! Otherwise,
  119. "Cardinal($ffffffff) div 16" overflows! (JM)}
  120. If is_signed(p^.left^.resulttype) Then
  121. Begin
  122. emit_reg_reg(A_OR,S_L,hreg1,hreg1);
  123. getlabel(hl);
  124. emitjmp(C_NS,hl);
  125. if power=1 then
  126. emit_reg(A_INC,S_L,hreg1)
  127. else
  128. emit_const_reg(A_ADD,S_L,p^.right^.value-1,hreg1);
  129. emitlab(hl);
  130. emit_const_reg(A_SAR,S_L,power,hreg1);
  131. End
  132. Else
  133. emit_const_reg(A_SHR,S_L,power,hreg1);
  134. End
  135. else
  136. if (p^.treetype=modn) and (p^.right^.treetype=ordconstn) and
  137. ispowerof2(p^.right^.value,power) and Not(is_signed(p^.left^.resulttype)) Then
  138. {is there a similar trick for MOD'ing signed numbers? (JM)}
  139. Begin
  140. emit_const_reg(A_AND,S_L,p^.right^.value-1,hreg1);
  141. andmod := true;
  142. End
  143. else
  144. begin
  145. { bring denominator to EDI }
  146. { EDI is always free, it's }
  147. { only used for temporary }
  148. { purposes }
  149. if (p^.right^.location.loc<>LOC_REGISTER) and
  150. (p^.right^.location.loc<>LOC_CREGISTER) then
  151. begin
  152. del_reference(p^.right^.location.reference);
  153. p^.left^.location.loc:=LOC_REGISTER;
  154. emit_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),R_EDI);
  155. end
  156. else
  157. begin
  158. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,R_EDI);
  159. ungetregister32(p^.right^.location.register);
  160. end;
  161. popedx:=false;
  162. popeax:=false;
  163. if hreg1=R_EDX then
  164. begin
  165. if not(R_EAX in unused) then
  166. begin
  167. emit_reg(A_PUSH,S_L,R_EAX);
  168. popeax:=true;
  169. end;
  170. emit_reg_reg(A_MOV,S_L,R_EDX,R_EAX);
  171. end
  172. else
  173. begin
  174. if not(R_EDX in unused) then
  175. begin
  176. emit_reg(A_PUSH,S_L,R_EDX);
  177. popedx:=true;
  178. end;
  179. if hreg1<>R_EAX then
  180. begin
  181. if not(R_EAX in unused) then
  182. begin
  183. emit_reg(A_PUSH,S_L,R_EAX);
  184. popeax:=true;
  185. end;
  186. emit_reg_reg(A_MOV,S_L,hreg1,R_EAX);
  187. end;
  188. end;
  189. { sign extension depends on the left type }
  190. if porddef(p^.left^.resulttype)^.typ=u32bit then
  191. emit_reg_reg(A_XOR,S_L,R_EDX,R_EDX)
  192. else
  193. emit_none(A_CDQ,S_NO);
  194. { division depends on the right type }
  195. if porddef(p^.right^.resulttype)^.typ=u32bit then
  196. emit_reg(A_DIV,S_L,R_EDI)
  197. else
  198. emit_reg(A_IDIV,S_L,R_EDI);
  199. if p^.treetype=divn then
  200. begin
  201. { if result register is busy then copy }
  202. if popeax then
  203. begin
  204. if hreg1=R_EAX then
  205. internalerror(112);
  206. emit_reg_reg(A_MOV,S_L,R_EAX,hreg1)
  207. end
  208. else
  209. if hreg1<>R_EAX then
  210. Begin
  211. ungetregister32(hreg1);
  212. hreg1 := getexplicitregister32(R_EAX);
  213. { I don't think it's possible that now hreg1 <> R_EAX
  214. since popeax is false, but for all certainty I do
  215. support that situation (JM)}
  216. if hreg1 <> R_EAX then
  217. emit_reg_reg(A_MOV,S_L,R_EAX,hreg1);
  218. end;
  219. end
  220. else
  221. {if we did the mod by an "and", the result is in hreg1 and
  222. EDX certainly hasn't been pushed (JM)}
  223. if not(andmod) Then
  224. if popedx then
  225. {the mod was done by an (i)div (so the result is now in
  226. edx), but edx was occupied prior to the division, so
  227. move the result into a safe place (JM)}
  228. emit_reg_reg(A_MOV,S_L,R_EDX,hreg1)
  229. else
  230. Begin
  231. {Get rid of the unnecessary hreg1 if possible (same as with
  232. EAX in divn) (JM)}
  233. ungetregister32(hreg1);
  234. hreg1 := getexplicitregister32(R_EDX);
  235. if hreg1 <> R_EDX then
  236. emit_reg_reg(A_MOV,S_L,R_EDX,hreg1);;
  237. End;
  238. if popeax then
  239. emit_reg(A_POP,S_L,R_EAX);
  240. if popedx then
  241. emit_reg(A_POP,S_L,R_EDX);
  242. end;
  243. If not(andmod or shrdiv) then
  244. {andmod and shrdiv only use hreg1 (which is already in usedinproc,
  245. since it was acquired with getregister), the others also use both
  246. EAX and EDX (JM)}
  247. Begin
  248. usedinproc:=usedinproc or ($80 shr byte(R_EAX));
  249. usedinproc:=usedinproc or ($80 shr byte(R_EDX));
  250. End;
  251. clear_location(p^.location);
  252. p^.location.loc:=LOC_REGISTER;
  253. p^.location.register:=hreg1;
  254. end;
  255. end;
  256. {*****************************************************************************
  257. SecondShlShr
  258. *****************************************************************************}
  259. procedure secondshlshr(var p : ptree);
  260. var
  261. hregister1,hregister2,hregister3,
  262. hregisterhigh,hregisterlow : tregister;
  263. pushed,popecx : boolean;
  264. op : tasmop;
  265. hr : preference;
  266. l1,l2,l3 : pasmlabel;
  267. begin
  268. popecx:=false;
  269. secondpass(p^.left);
  270. pushed:=maybe_push(p^.right^.registers32,p^.left,is_64bitint(p^.left^.resulttype));
  271. secondpass(p^.right);
  272. if pushed then
  273. restore(p^.left,is_64bitint(p^.left^.resulttype));
  274. if is_64bitint(p^.left^.resulttype) then
  275. begin
  276. { load left operator in a register }
  277. if p^.left^.location.loc<>LOC_REGISTER then
  278. begin
  279. if p^.left^.location.loc=LOC_CREGISTER then
  280. begin
  281. hregisterlow:=getregister32;
  282. hregisterhigh:=getregister32;
  283. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,
  284. hregisterlow);
  285. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerhigh,
  286. hregisterlow);
  287. end
  288. else
  289. begin
  290. del_reference(p^.left^.location.reference);
  291. hregisterlow:=getregister32;
  292. hregisterhigh:=getregister32;
  293. emit_ref_reg(A_MOV,S_L,newreference(p^.left^.location.reference),
  294. hregisterlow);
  295. hr:=newreference(p^.left^.location.reference);
  296. inc(hr^.offset,4);
  297. emit_ref_reg(A_MOV,S_L,hr,
  298. hregisterhigh);
  299. end;
  300. end
  301. else
  302. begin
  303. hregisterlow:=p^.left^.location.registerlow;
  304. hregisterhigh:=p^.left^.location.registerhigh;
  305. end;
  306. { shifting by a constant directly coded: }
  307. if (p^.right^.treetype=ordconstn) then
  308. begin
  309. { shrd/shl works only for values <=31 !! }
  310. if p^.right^.value>31 then
  311. begin
  312. if p^.treetype=shln then
  313. begin
  314. emit_reg_reg(A_XOR,S_L,hregisterhigh,
  315. hregisterhigh);
  316. emit_const_reg(A_SHL,S_L,p^.right^.value and 31,
  317. hregisterlow);
  318. end
  319. else
  320. begin
  321. emit_reg_reg(A_XOR,S_L,hregisterlow,
  322. hregisterlow);
  323. emit_const_reg(A_SHR,S_L,p^.right^.value and 31,
  324. hregisterhigh);
  325. end;
  326. p^.location.registerhigh:=hregisterlow;
  327. p^.location.registerlow:=hregisterhigh;
  328. end
  329. else
  330. begin
  331. if p^.treetype=shln then
  332. begin
  333. emit_const_reg_reg(A_SHLD,S_L,p^.right^.value and 31,
  334. hregisterlow,hregisterhigh);
  335. emit_const_reg(A_SHL,S_L,p^.right^.value and 31,
  336. hregisterlow);
  337. end
  338. else
  339. begin
  340. emit_const_reg_reg(A_SHRD,S_L,p^.right^.value and 31,
  341. hregisterhigh,hregisterlow);
  342. emit_const_reg(A_SHR,S_L,p^.right^.value and 31,
  343. hregisterhigh);
  344. end;
  345. p^.location.registerlow:=hregisterlow;
  346. p^.location.registerhigh:=hregisterhigh;
  347. end;
  348. p^.location.loc:=LOC_REGISTER;
  349. end
  350. else
  351. begin
  352. { load right operators in a register }
  353. if p^.right^.location.loc<>LOC_REGISTER then
  354. begin
  355. if p^.right^.location.loc=LOC_CREGISTER then
  356. begin
  357. hregister2:=getexplicitregister32(R_ECX);
  358. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,
  359. hregister2);
  360. end
  361. else
  362. begin
  363. del_reference(p^.right^.location.reference);
  364. hregister2:=getexplicitregister32(R_ECX);
  365. emit_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),
  366. hregister2);
  367. end;
  368. end
  369. else
  370. hregister2:=p^.right^.location.register;
  371. { left operator is already in a register }
  372. { hence are both in a register }
  373. { is it in the case ECX ? }
  374. if (hregisterlow=R_ECX) then
  375. begin
  376. { then only swap }
  377. emit_reg_reg(A_XCHG,S_L,hregisterlow,hregister2);
  378. hregister3:=hregisterlow;
  379. hregisterlow:=hregister2;
  380. hregister2:=hregister3;
  381. end
  382. else if (hregisterhigh=R_ECX) then
  383. begin
  384. { then only swap }
  385. emit_reg_reg(A_XCHG,S_L,hregisterhigh,hregister2);
  386. hregister3:=hregisterhigh;
  387. hregisterhigh:=hregister2;
  388. hregister2:=hregister3;
  389. end
  390. { if second operator not in ECX ? }
  391. else if (hregister2<>R_ECX) then
  392. begin
  393. { ECX occupied then push it }
  394. if not (R_ECX in unused) then
  395. begin
  396. popecx:=true;
  397. emit_reg(A_PUSH,S_L,R_ECX);
  398. end;
  399. emit_reg_reg(A_MOV,S_L,hregister2,R_ECX);
  400. end;
  401. ungetregister32(hregister2);
  402. { the damned shift instructions work only til a count of 32 }
  403. { so we've to do some tricks here }
  404. if p^.treetype=shln then
  405. begin
  406. getlabel(l1);
  407. getlabel(l2);
  408. getlabel(l3);
  409. emit_const_reg(A_CMP,S_L,64,R_ECX);
  410. emitjmp(C_L,l1);
  411. emit_reg_reg(A_XOR,S_L,hregisterlow,hregisterlow);
  412. emit_reg_reg(A_XOR,S_L,hregisterhigh,hregisterhigh);
  413. emitjmp(C_None,l3);
  414. emitlab(l1);
  415. emit_const_reg(A_CMP,S_L,32,R_ECX);
  416. emitjmp(C_L,l2);
  417. emit_const_reg(A_SUB,S_L,32,R_ECX);
  418. emit_reg_reg(A_SHL,S_L,R_CL,
  419. hregisterlow);
  420. emit_reg_reg(A_MOV,S_L,hregisterlow,hregisterhigh);
  421. emit_reg_reg(A_XOR,S_L,hregisterlow,hregisterlow);
  422. emitjmp(C_None,l3);
  423. emitlab(l2);
  424. emit_reg_reg_reg(A_SHLD,S_L,R_CL,
  425. hregisterlow,hregisterhigh);
  426. emit_reg_reg(A_SHL,S_L,R_CL,
  427. hregisterlow);
  428. emitlab(l3);
  429. end
  430. else
  431. begin
  432. getlabel(l1);
  433. getlabel(l2);
  434. getlabel(l3);
  435. emit_const_reg(A_CMP,S_L,64,R_ECX);
  436. emitjmp(C_L,l1);
  437. emit_reg_reg(A_XOR,S_L,hregisterlow,hregisterlow);
  438. emit_reg_reg(A_XOR,S_L,hregisterhigh,hregisterhigh);
  439. emitjmp(C_None,l3);
  440. emitlab(l1);
  441. emit_const_reg(A_CMP,S_L,32,R_ECX);
  442. emitjmp(C_L,l2);
  443. emit_const_reg(A_SUB,S_L,32,R_ECX);
  444. emit_reg_reg(A_SHR,S_L,R_CL,
  445. hregisterhigh);
  446. emit_reg_reg(A_MOV,S_L,hregisterhigh,hregisterlow);
  447. emit_reg_reg(A_XOR,S_L,hregisterhigh,hregisterhigh);
  448. emitjmp(C_None,l3);
  449. emitlab(l2);
  450. emit_reg_reg_reg(A_SHRD,S_L,R_CL,
  451. hregisterhigh,hregisterlow);
  452. emit_reg_reg(A_SHR,S_L,R_CL,
  453. hregisterhigh);
  454. emitlab(l3);
  455. end;
  456. { maybe put ECX back }
  457. if popecx then
  458. emit_reg(A_POP,S_L,R_ECX);
  459. p^.location.registerlow:=hregisterlow;
  460. p^.location.registerhigh:=hregisterhigh;
  461. end;
  462. end
  463. else
  464. begin
  465. { load left operators in a register }
  466. if p^.left^.location.loc<>LOC_REGISTER then
  467. begin
  468. if p^.left^.location.loc=LOC_CREGISTER then
  469. begin
  470. hregister1:=getregister32;
  471. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,
  472. hregister1);
  473. end
  474. else
  475. begin
  476. del_reference(p^.left^.location.reference);
  477. hregister1:=getregister32;
  478. emit_ref_reg(A_MOV,S_L,newreference(p^.left^.location.reference),
  479. hregister1);
  480. end;
  481. end
  482. else
  483. hregister1:=p^.left^.location.register;
  484. { determine operator }
  485. if p^.treetype=shln then
  486. op:=A_SHL
  487. else
  488. op:=A_SHR;
  489. { shifting by a constant directly coded: }
  490. if (p^.right^.treetype=ordconstn) then
  491. begin
  492. { l shl 32 should 0 imho, but neither TP nor Delphi do it in this way (FK)
  493. if p^.right^.value<=31 then
  494. }
  495. emit_const_reg(op,S_L,p^.right^.value and 31,
  496. hregister1);
  497. {
  498. else
  499. emit_reg_reg(A_XOR,S_L,hregister1,
  500. hregister1);
  501. }
  502. p^.location.loc:=LOC_REGISTER;
  503. p^.location.register:=hregister1;
  504. end
  505. else
  506. begin
  507. { load right operators in a register }
  508. if p^.right^.location.loc<>LOC_REGISTER then
  509. begin
  510. if p^.right^.location.loc=LOC_CREGISTER then
  511. begin
  512. hregister2:=getexplicitregister32(R_ECX);
  513. emit_reg_reg(A_MOV,S_L,p^.right^.location.register,
  514. hregister2);
  515. end
  516. else
  517. begin
  518. del_reference(p^.right^.location.reference);
  519. hregister2:=getexplicitregister32(R_ECX);
  520. emit_ref_reg(A_MOV,S_L,newreference(p^.right^.location.reference),
  521. hregister2);
  522. end;
  523. end
  524. else
  525. hregister2:=p^.right^.location.register;
  526. { left operator is already in a register }
  527. { hence are both in a register }
  528. { is it in the case ECX ? }
  529. if (hregister1=R_ECX) then
  530. begin
  531. { then only swap }
  532. emit_reg_reg(A_XCHG,S_L,hregister1,hregister2);
  533. hregister3:=hregister1;
  534. hregister1:=hregister2;
  535. hregister2:=hregister3;
  536. end
  537. { if second operator not in ECX ? }
  538. else if (hregister2<>R_ECX) then
  539. begin
  540. { ECX occupied then push it }
  541. if not (R_ECX in unused) then
  542. begin
  543. popecx:=true;
  544. emit_reg(A_PUSH,S_L,R_ECX);
  545. end;
  546. emit_reg_reg(A_MOV,S_L,hregister2,R_ECX);
  547. end;
  548. ungetregister32(hregister2);
  549. { right operand is in ECX }
  550. emit_reg_reg(op,S_L,R_CL,hregister1);
  551. { maybe ECX back }
  552. if popecx then
  553. emit_reg(A_POP,S_L,R_ECX);
  554. p^.location.register:=hregister1;
  555. end;
  556. end;
  557. end;
  558. {*****************************************************************************
  559. SecondUmMinus
  560. *****************************************************************************}
  561. procedure secondumminus(var p : ptree);
  562. {$ifdef SUPPORT_MMX}
  563. procedure do_mmx_neg;
  564. var
  565. op : tasmop;
  566. begin
  567. p^.location.loc:=LOC_MMXREGISTER;
  568. if cs_mmx_saturation in aktlocalswitches then
  569. case mmx_type(p^.resulttype) of
  570. mmxs8bit:
  571. op:=A_PSUBSB;
  572. mmxu8bit:
  573. op:=A_PSUBUSB;
  574. mmxs16bit,mmxfixed16:
  575. op:=A_PSUBSW;
  576. mmxu16bit:
  577. op:=A_PSUBUSW;
  578. end
  579. else
  580. case mmx_type(p^.resulttype) of
  581. mmxs8bit,mmxu8bit:
  582. op:=A_PSUBB;
  583. mmxs16bit,mmxu16bit,mmxfixed16:
  584. op:=A_PSUBW;
  585. mmxs32bit,mmxu32bit:
  586. op:=A_PSUBD;
  587. end;
  588. emit_reg_reg(op,S_NO,p^.location.register,R_MM7);
  589. emit_reg_reg(A_MOVQ,S_NO,R_MM7,p^.location.register);
  590. end;
  591. {$endif}
  592. var
  593. hr : preference;
  594. begin
  595. if is_64bitint(p^.left^.resulttype) then
  596. begin
  597. secondpass(p^.left);
  598. clear_location(p^.location);
  599. p^.location.loc:=LOC_REGISTER;
  600. case p^.left^.location.loc of
  601. LOC_REGISTER :
  602. begin
  603. p^.location.registerlow:=p^.left^.location.registerlow;
  604. p^.location.registerhigh:=p^.left^.location.registerhigh;
  605. end;
  606. LOC_CREGISTER :
  607. begin
  608. p^.location.registerlow:=getregister32;
  609. p^.location.registerhigh:=getregister32;
  610. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,p^.location.registerlow);
  611. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerhigh,p^.location.registerhigh);
  612. end;
  613. LOC_REFERENCE,LOC_MEM :
  614. begin
  615. del_reference(p^.left^.location.reference);
  616. p^.location.registerlow:=getregister32;
  617. p^.location.registerhigh:=getregister32;
  618. emit_ref_reg(A_MOV,S_L,
  619. newreference(p^.left^.location.reference),p^.location.registerlow);
  620. hr:=newreference(p^.left^.location.reference);
  621. inc(hr^.offset,4);
  622. emit_ref_reg(A_MOV,S_L,
  623. hr,p^.location.registerhigh);
  624. end;
  625. end;
  626. emit_reg(A_NEG,S_L,p^.location.registerlow);
  627. emit_const_reg(A_ADC,S_L,0,p^.location.registerhigh);
  628. emit_reg(A_NEG,S_L,p^.location.registerhigh);
  629. end
  630. else
  631. begin
  632. secondpass(p^.left);
  633. p^.location.loc:=LOC_REGISTER;
  634. case p^.left^.location.loc of
  635. LOC_REGISTER:
  636. begin
  637. p^.location.register:=p^.left^.location.register;
  638. emit_reg(A_NEG,S_L,p^.location.register);
  639. end;
  640. LOC_CREGISTER:
  641. begin
  642. p^.location.register:=getregister32;
  643. emit_reg_reg(A_MOV,S_L,p^.location.register,
  644. p^.location.register);
  645. emit_reg(A_NEG,S_L,p^.location.register);
  646. end;
  647. {$ifdef SUPPORT_MMX}
  648. LOC_MMXREGISTER:
  649. begin
  650. set_location(p^.location,p^.left^.location);
  651. emit_reg_reg(A_PXOR,S_NO,R_MM7,R_MM7);
  652. do_mmx_neg;
  653. end;
  654. LOC_CMMXREGISTER:
  655. begin
  656. p^.location.register:=getregistermmx;
  657. emit_reg_reg(A_PXOR,S_NO,R_MM7,R_MM7);
  658. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,
  659. p^.location.register);
  660. do_mmx_neg;
  661. end;
  662. {$endif SUPPORT_MMX}
  663. LOC_REFERENCE,LOC_MEM:
  664. begin
  665. del_reference(p^.left^.location.reference);
  666. if (p^.left^.resulttype^.deftype=floatdef) and
  667. (pfloatdef(p^.left^.resulttype)^.typ<>f32bit) then
  668. begin
  669. p^.location.loc:=LOC_FPU;
  670. floatload(pfloatdef(p^.left^.resulttype)^.typ,
  671. p^.left^.location.reference);
  672. emit_none(A_FCHS,S_NO);
  673. end
  674. {$ifdef SUPPORT_MMX}
  675. else if (cs_mmx in aktlocalswitches) and is_mmx_able_array(p^.left^.resulttype) then
  676. begin
  677. p^.location.register:=getregistermmx;
  678. emit_reg_reg(A_PXOR,S_NO,R_MM7,R_MM7);
  679. emit_ref_reg(A_MOVQ,S_NO,
  680. newreference(p^.left^.location.reference),
  681. p^.location.register);
  682. do_mmx_neg;
  683. end
  684. {$endif SUPPORT_MMX}
  685. else
  686. begin
  687. p^.location.register:=getregister32;
  688. emit_ref_reg(A_MOV,S_L,
  689. newreference(p^.left^.location.reference),
  690. p^.location.register);
  691. emit_reg(A_NEG,S_L,p^.location.register);
  692. end;
  693. end;
  694. LOC_FPU:
  695. begin
  696. p^.location.loc:=LOC_FPU;
  697. emit_none(A_FCHS,S_NO);
  698. end;
  699. LOC_CFPUREGISTER:
  700. begin
  701. emit_reg(A_FLD,S_NO,
  702. correct_fpuregister(p^.left^.location.register,fpuvaroffset));
  703. inc(fpuvaroffset);
  704. p^.location.loc:=LOC_FPU;
  705. emit_none(A_FCHS,S_NO);
  706. end;
  707. end;
  708. end;
  709. { Here was a problem... }
  710. { Operand to be negated always }
  711. { seems to be converted to signed }
  712. { 32-bit before doing neg!! }
  713. { So this is useless... }
  714. { that's not true: -2^31 gives an overflow error if it is negaded (FK) }
  715. { emitoverflowcheck(p);}
  716. end;
  717. {*****************************************************************************
  718. SecondNot
  719. *****************************************************************************}
  720. procedure secondnot(var p : ptree);
  721. const
  722. flagsinvers : array[F_E..F_BE] of tresflags =
  723. (F_NE,F_E,F_LE,F_GE,F_L,F_G,F_NC,F_C,
  724. F_A,F_AE,F_B,F_BE);
  725. var
  726. hl : pasmlabel;
  727. opsize : topsize;
  728. hr : preference;
  729. begin
  730. if is_boolean(p^.resulttype) then
  731. begin
  732. opsize:=def_opsize(p^.resulttype);
  733. case p^.left^.location.loc of
  734. LOC_JUMP :
  735. begin
  736. hl:=truelabel;
  737. truelabel:=falselabel;
  738. falselabel:=hl;
  739. secondpass(p^.left);
  740. maketojumpbool(p^.left);
  741. hl:=truelabel;
  742. truelabel:=falselabel;
  743. falselabel:=hl;
  744. end;
  745. LOC_FLAGS :
  746. begin
  747. secondpass(p^.left);
  748. p^.location.resflags:=flagsinvers[p^.left^.location.resflags];
  749. end;
  750. LOC_REGISTER :
  751. begin
  752. secondpass(p^.left);
  753. {p^.location.register:=p^.left^.location.register;
  754. emit_const_reg(A_XOR,opsize,1,p^.location.register);}
  755. p^.location.loc:=LOC_FLAGS;
  756. p^.location.resflags:=F_E;
  757. emit_reg_reg(A_TEST,opsize,
  758. p^.left^.location.register,p^.left^.location.register);
  759. ungetregister(p^.left^.location.register);
  760. end;
  761. LOC_CREGISTER :
  762. begin
  763. secondpass(p^.left);
  764. clear_location(p^.location);
  765. p^.location.loc:=LOC_REGISTER;
  766. p^.location.register:=def_getreg(p^.resulttype);
  767. emit_reg_reg(A_MOV,opsize,p^.left^.location.register,p^.location.register);
  768. emit_reg_reg(A_TEST,opsize,p^.location.register,p^.location.register);
  769. ungetregister(p^.location.register);
  770. p^.location.loc:=LOC_FLAGS;
  771. p^.location.resflags:=F_E;
  772. end;
  773. LOC_REFERENCE,
  774. LOC_MEM :
  775. begin
  776. secondpass(p^.left);
  777. clear_location(p^.location);
  778. p^.location.loc:=LOC_REGISTER;
  779. del_reference(p^.left^.location.reference);
  780. { this was placed before del_ref => internaalerror(10) }
  781. p^.location.register:=def_getreg(p^.resulttype);
  782. emit_ref_reg(A_MOV,opsize,
  783. newreference(p^.left^.location.reference),p^.location.register);
  784. emit_reg_reg(A_TEST,opsize,p^.location.register,p^.location.register);
  785. ungetregister(p^.location.register);
  786. p^.location.loc:=LOC_FLAGS;
  787. p^.location.resflags:=F_E;
  788. end;
  789. end;
  790. end
  791. {$ifdef SUPPORT_MMX}
  792. else
  793. if (cs_mmx in aktlocalswitches) and is_mmx_able_array(p^.left^.resulttype) then
  794. begin
  795. secondpass(p^.left);
  796. p^.location.loc:=LOC_MMXREGISTER;
  797. { prepare EDI }
  798. emit_const_reg(A_MOV,S_L,$ffffffff,R_EDI);
  799. { load operand }
  800. case p^.left^.location.loc of
  801. LOC_MMXREGISTER:
  802. set_location(p^.location,p^.left^.location);
  803. LOC_CMMXREGISTER:
  804. begin
  805. p^.location.register:=getregistermmx;
  806. emit_reg_reg(A_MOVQ,S_NO,p^.left^.location.register,p^.location.register);
  807. end;
  808. LOC_REFERENCE,LOC_MEM:
  809. begin
  810. del_reference(p^.left^.location.reference);
  811. p^.location.register:=getregistermmx;
  812. emit_ref_reg(A_MOVQ,S_NO,
  813. newreference(p^.left^.location.reference),p^.location.register);
  814. end;
  815. end;
  816. { load mask }
  817. emit_reg_reg(A_MOV,S_D,R_EDI,R_MM7);
  818. { lower 32 bit }
  819. emit_reg_reg(A_PXOR,S_D,R_MM7,p^.location.register);
  820. { shift mask }
  821. emit_const_reg(A_PSLLQ,S_NO,32,R_MM7);
  822. { higher 32 bit }
  823. emit_reg_reg(A_PXOR,S_D,R_MM7,p^.location.register);
  824. end
  825. {$endif SUPPORT_MMX}
  826. else if is_64bitint(p^.left^.resulttype) then
  827. begin
  828. secondpass(p^.left);
  829. clear_location(p^.location);
  830. p^.location.loc:=LOC_REGISTER;
  831. case p^.left^.location.loc of
  832. LOC_REGISTER :
  833. begin
  834. p^.location.registerlow:=p^.left^.location.registerlow;
  835. p^.location.registerhigh:=p^.left^.location.registerhigh;
  836. emit_reg(A_NOT,S_L,p^.location.registerlow);
  837. emit_reg(A_NOT,S_L,p^.location.registerhigh);
  838. end;
  839. LOC_CREGISTER :
  840. begin
  841. p^.location.registerlow:=getregister32;
  842. p^.location.registerhigh:=getregister32;
  843. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerlow,p^.location.registerlow);
  844. emit_reg_reg(A_MOV,S_L,p^.left^.location.registerhigh,p^.location.registerhigh);
  845. emit_reg(A_NOT,S_L,p^.location.registerlow);
  846. emit_reg(A_NOT,S_L,p^.location.registerhigh);
  847. end;
  848. LOC_REFERENCE,LOC_MEM :
  849. begin
  850. del_reference(p^.left^.location.reference);
  851. p^.location.registerlow:=getregister32;
  852. p^.location.registerhigh:=getregister32;
  853. emit_ref_reg(A_MOV,S_L,
  854. newreference(p^.left^.location.reference),p^.location.registerlow);
  855. hr:=newreference(p^.left^.location.reference);
  856. inc(hr^.offset,4);
  857. emit_ref_reg(A_MOV,S_L,
  858. hr,p^.location.registerhigh);
  859. emit_reg(A_NOT,S_L,p^.location.registerlow);
  860. emit_reg(A_NOT,S_L,p^.location.registerhigh);
  861. end;
  862. end;
  863. end
  864. else
  865. begin
  866. secondpass(p^.left);
  867. clear_location(p^.location);
  868. p^.location.loc:=LOC_REGISTER;
  869. case p^.left^.location.loc of
  870. LOC_REGISTER :
  871. begin
  872. p^.location.register:=p^.left^.location.register;
  873. emit_reg(A_NOT,S_L,p^.location.register);
  874. end;
  875. LOC_CREGISTER :
  876. begin
  877. p^.location.register:=getregister32;
  878. emit_reg_reg(A_MOV,S_L,p^.left^.location.register,p^.location.register);
  879. emit_reg(A_NOT,S_L,p^.location.register);
  880. end;
  881. LOC_REFERENCE,LOC_MEM :
  882. begin
  883. del_reference(p^.left^.location.reference);
  884. p^.location.register:=getregister32;
  885. emit_ref_reg(A_MOV,S_L,
  886. newreference(p^.left^.location.reference),p^.location.register);
  887. emit_reg(A_NOT,S_L,p^.location.register);
  888. end;
  889. end;
  890. end;
  891. end;
  892. end.
  893. {
  894. $Log$
  895. Revision 1.35 1999-11-06 14:34:18 peter
  896. * truncated log to 20 revs
  897. Revision 1.34 1999/09/28 19:43:47 florian
  898. * the maybe_push fix of Pierre wasn't 100%, the tree parameter
  899. must contain a valid location (which is saved if necessary)
  900. Revision 1.33 1999/09/27 23:37:26 peter
  901. * fixed push/restore bug in div/mod
  902. Revision 1.32 1999/09/02 17:07:38 florian
  903. * problems with -Or fixed: tdef.isfpuregable was wrong!
  904. Revision 1.31 1999/08/19 13:08:50 pierre
  905. * emit_??? used
  906. Revision 1.30 1999/08/04 13:45:23 florian
  907. + floating point register variables !!
  908. * pairegalloc is now generated for register variables
  909. Revision 1.29 1999/08/04 00:22:51 florian
  910. * renamed i386asm and i386base to cpuasm and cpubase
  911. Revision 1.28 1999/08/03 22:02:45 peter
  912. * moved bitmask constants to sets
  913. * some other type/const renamings
  914. Revision 1.27 1999/06/28 22:29:14 florian
  915. * qword division fixed
  916. + code for qword/int64 type casting added:
  917. range checking isn't implemented yet
  918. Revision 1.26 1999/06/02 10:11:44 florian
  919. * make cycle fixed i.e. compilation with 0.99.10
  920. * some fixes for qword
  921. * start of register calling conventions
  922. Revision 1.25 1999/05/27 19:44:16 peter
  923. * removed oldasm
  924. * plabel -> pasmlabel
  925. * -a switches to source writing automaticly
  926. * assembler readers OOPed
  927. * asmsymbol automaticly external
  928. * jumptables and other label fixes for asm readers
  929. Revision 1.24 1999/05/25 20:36:13 florian
  930. * some bugs in the qword code generation fixed
  931. Revision 1.23 1999/05/08 20:41:08 jonas
  932. + positive number MOD power of 2 now done with AND instruction
  933. * fix to division of positive numbers by power of 2
  934. * the result of a MOD is left in EDX if possible
  935. Revision 1.22 1999/05/01 13:24:11 peter
  936. * merged nasm compiler
  937. * old asm moved to oldasm/
  938. Revision 1.21 1999/04/16 13:42:27 jonas
  939. * more regalloc fixes (still not complete)
  940. Revision 1.20 1999/02/22 02:15:13 peter
  941. * updates for ag386bin
  942. Revision 1.19 1999/02/04 10:49:40 florian
  943. + range checking for ansi- and widestrings
  944. * made it compilable with TP
  945. Revision 1.18 1999/02/03 10:11:12 pierre
  946. * fix for bug0211 for i386
  947. Revision 1.17 1999/01/21 22:10:41 peter
  948. * fixed array of const
  949. * generic platform independent high() support
  950. Revision 1.16 1999/01/19 10:51:32 pierre
  951. * fix to bug0183 in secondnot
  952. Revision 1.15 1998/12/11 16:50:22 florian
  953. + typed const int64 and qword
  954. + unary minus-operator q1:=-q2;
  955. + not-operator
  956. }