cg386mat.pas 43 KB

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