aoptcpu.pas 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616
  1. {
  2. Copyright (c) 1998-2002 by Florian Klaempfl and Jonas Maebe
  3. This unit contains the peephole optimizer for i386
  4. This program is free software; you can redistribute it and/or modify
  5. it under the terms of the GNU General Public License as published by
  6. the Free Software Foundation; either version 2 of the License, or
  7. (at your option) any later version.
  8. This program is distributed in the hope that it will be useful,
  9. but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  11. GNU General Public License for more details.
  12. You should have received a copy of the GNU General Public License
  13. along with this program; if not, write to the Free Software
  14. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  15. ****************************************************************************
  16. }
  17. unit aoptcpu;
  18. {$i fpcdefs.inc}
  19. { $define DEBUG_AOPTCPU}
  20. Interface
  21. uses
  22. cgbase,
  23. cpubase, aopt, aoptx86,
  24. Aasmbase,aasmtai,aasmdata;
  25. Type
  26. TCpuAsmOptimizer = class(TX86AsmOptimizer)
  27. function PrePeepHoleOptsCpu(var p: tai): boolean; override;
  28. function PeepHoleOptPass1Cpu(var p: tai): boolean; override;
  29. function PeepHoleOptPass2Cpu(var p: tai): boolean; override;
  30. function PostPeepHoleOptsCpu(var p : tai) : boolean; override;
  31. procedure PostPeepHoleOpts; override;
  32. end;
  33. Var
  34. AsmOptimizer : TCpuAsmOptimizer;
  35. Implementation
  36. uses
  37. verbose,globtype,globals,
  38. cpuinfo,
  39. aasmcpu,
  40. aoptutils,
  41. aasmcfi,
  42. procinfo,
  43. cgutils,
  44. { units we should get rid off: }
  45. symsym,symconst;
  46. { Checks if the register is a 32 bit general purpose register }
  47. function isgp32reg(reg: TRegister): boolean;
  48. begin
  49. {$push}{$warnings off}
  50. isgp32reg:=(getregtype(reg)=R_INTREGISTER) and (getsupreg(reg)>=RS_EAX) and (getsupreg(reg)<=RS_EBX);
  51. {$pop}
  52. end;
  53. { returns true if p contains a memory operand with a segment set }
  54. function InsContainsSegRef(p: taicpu): boolean;
  55. var
  56. i: longint;
  57. begin
  58. result:=true;
  59. for i:=0 to p.opercnt-1 do
  60. if (p.oper[i]^.typ=top_ref) and
  61. (p.oper[i]^.ref^.segment<>NR_NO) then
  62. exit;
  63. result:=false;
  64. end;
  65. function TCPUAsmOPtimizer.PrePeepHoleOptsCpu(var p: tai): boolean;
  66. begin
  67. Result:=False;
  68. case p.typ of
  69. ait_instruction:
  70. begin
  71. if InsContainsSegRef(taicpu(p)) then
  72. begin
  73. p := tai(p.next);
  74. Result:=true;
  75. end;
  76. if not (p is taicpu) then
  77. exit;
  78. case taicpu(p).opcode Of
  79. A_IMUL:
  80. Result:=PrePeepholeOptIMUL(p);
  81. A_SAR,A_SHR:
  82. Result:=PrePeepholeOptSxx(p);
  83. A_XOR:
  84. begin
  85. if (taicpu(p).oper[0]^.typ = top_reg) and
  86. (taicpu(p).oper[1]^.typ = top_reg) and
  87. (taicpu(p).oper[0]^.reg = taicpu(p).oper[1]^.reg) then
  88. { temporarily change this to 'mov reg,0' to make it easier }
  89. { for the CSE. Will be changed back in pass 2 }
  90. begin
  91. taicpu(p).opcode := A_MOV;
  92. taicpu(p).loadConst(0,0);
  93. Result:=true;
  94. end;
  95. end;
  96. else
  97. ;
  98. end;
  99. end;
  100. else
  101. ;
  102. end;
  103. end;
  104. function TCPUAsmOPtimizer.PeepHoleOptPass1Cpu(var p: tai): boolean;
  105. function WriteOk : Boolean;
  106. begin
  107. writeln('Ok');
  108. Result:=True;
  109. end;
  110. var
  111. hp1,hp2 : tai;
  112. hp3,hp4: tai;
  113. v:aint;
  114. function GetFinalDestination(asml: TAsmList; hp: taicpu; level: longint): boolean;
  115. {traces sucessive jumps to their final destination and sets it, e.g.
  116. je l1 je l3
  117. <code> <code>
  118. l1: becomes l1:
  119. je l2 je l3
  120. <code> <code>
  121. l2: l2:
  122. jmp l3 jmp l3
  123. the level parameter denotes how deeep we have already followed the jump,
  124. to avoid endless loops with constructs such as "l5: ; jmp l5" }
  125. var p1, p2: tai;
  126. l: tasmlabel;
  127. function FindAnyLabel(hp: tai; var l: tasmlabel): Boolean;
  128. begin
  129. FindAnyLabel := false;
  130. while assigned(hp.next) and
  131. (tai(hp.next).typ in (SkipInstr+[ait_align])) Do
  132. hp := tai(hp.next);
  133. if assigned(hp.next) and
  134. (tai(hp.next).typ = ait_label) then
  135. begin
  136. FindAnyLabel := true;
  137. l := tai_label(hp.next).labsym;
  138. end
  139. end;
  140. begin
  141. GetfinalDestination := false;
  142. if level > 20 then
  143. exit;
  144. p1 := getlabelwithsym(tasmlabel(hp.oper[0]^.ref^.symbol));
  145. if assigned(p1) then
  146. begin
  147. SkipLabels(p1,p1);
  148. if (tai(p1).typ = ait_instruction) and
  149. (taicpu(p1).is_jmp) then
  150. if { the next instruction after the label where the jump hp arrives}
  151. { is unconditional or of the same type as hp, so continue }
  152. (taicpu(p1).condition in [C_None,hp.condition]) or
  153. { the next instruction after the label where the jump hp arrives}
  154. { is the opposite of hp (so this one is never taken), but after }
  155. { that one there is a branch that will be taken, so perform a }
  156. { little hack: set p1 equal to this instruction (that's what the}
  157. { last SkipLabels is for, only works with short bool evaluation)}
  158. ((taicpu(p1).condition = inverse_cond(hp.condition)) and
  159. SkipLabels(p1,p2) and
  160. (p2.typ = ait_instruction) and
  161. (taicpu(p2).is_jmp) and
  162. (taicpu(p2).condition in [C_None,hp.condition]) and
  163. SkipLabels(p1,p1)) then
  164. begin
  165. { quick check for loops of the form "l5: ; jmp l5 }
  166. if (tasmlabel(taicpu(p1).oper[0]^.ref^.symbol).labelnr =
  167. tasmlabel(hp.oper[0]^.ref^.symbol).labelnr) then
  168. exit;
  169. if not GetFinalDestination(asml, taicpu(p1),succ(level)) then
  170. exit;
  171. tasmlabel(hp.oper[0]^.ref^.symbol).decrefs;
  172. hp.oper[0]^.ref^.symbol:=taicpu(p1).oper[0]^.ref^.symbol;
  173. tasmlabel(hp.oper[0]^.ref^.symbol).increfs;
  174. end
  175. else
  176. if (taicpu(p1).condition = inverse_cond(hp.condition)) then
  177. if not FindAnyLabel(p1,l) then
  178. begin
  179. {$ifdef finaldestdebug}
  180. insertllitem(asml,p1,p1.next,tai_comment.Create(
  181. strpnew('previous label inserted'))));
  182. {$endif finaldestdebug}
  183. current_asmdata.getjumplabel(l);
  184. insertllitem(p1,p1.next,tai_label.Create(l));
  185. tasmlabel(taicpu(hp).oper[0]^.ref^.symbol).decrefs;
  186. hp.oper[0]^.ref^.symbol := l;
  187. l.increfs;
  188. { this won't work, since the new label isn't in the labeltable }
  189. { so it will fail the rangecheck. Labeltable should become a }
  190. { hashtable to support this: }
  191. { GetFinalDestination(asml, hp); }
  192. end
  193. else
  194. begin
  195. {$ifdef finaldestdebug}
  196. insertllitem(asml,p1,p1.next,tai_comment.Create(
  197. strpnew('next label reused'))));
  198. {$endif finaldestdebug}
  199. l.increfs;
  200. hp.oper[0]^.ref^.symbol := l;
  201. if not GetFinalDestination(asml, hp,succ(level)) then
  202. exit;
  203. end;
  204. end;
  205. GetFinalDestination := true;
  206. end;
  207. begin
  208. result:=False;
  209. case p.Typ Of
  210. ait_instruction:
  211. begin
  212. current_filepos:=taicpu(p).fileinfo;
  213. if InsContainsSegRef(taicpu(p)) then
  214. begin
  215. p:=tai(p.next);
  216. Result:=true;
  217. exit;
  218. end;
  219. case taicpu(p).opcode Of
  220. A_AND:
  221. Result:=OptPass1And(p);
  222. A_CMP:
  223. begin
  224. { cmp register,$8000 neg register
  225. je target --> jo target
  226. .... only if register is deallocated before jump.}
  227. case Taicpu(p).opsize of
  228. S_B: v:=$80;
  229. S_W: v:=$8000;
  230. S_L: v:=aint($80000000);
  231. else
  232. internalerror(2013112905);
  233. end;
  234. if (taicpu(p).oper[0]^.typ=Top_const) and
  235. (taicpu(p).oper[0]^.val=v) and
  236. (Taicpu(p).oper[1]^.typ=top_reg) and
  237. GetNextInstruction(p, hp1) and
  238. (hp1.typ=ait_instruction) and
  239. (taicpu(hp1).opcode=A_Jcc) and
  240. (Taicpu(hp1).condition in [C_E,C_NE]) and
  241. not(RegInUsedRegs(Taicpu(p).oper[1]^.reg, UsedRegs)) then
  242. begin
  243. Taicpu(p).opcode:=A_NEG;
  244. Taicpu(p).loadoper(0,Taicpu(p).oper[1]^);
  245. Taicpu(p).clearop(1);
  246. Taicpu(p).ops:=1;
  247. if Taicpu(hp1).condition=C_E then
  248. Taicpu(hp1).condition:=C_O
  249. else
  250. Taicpu(hp1).condition:=C_NO;
  251. Result:=true;
  252. end;
  253. {
  254. @@2: @@2:
  255. .... ....
  256. cmp operand1,0
  257. jle/jbe @@1
  258. dec operand1 --> sub operand1,1
  259. jmp @@2 jge/jae @@2
  260. @@1: @@1:
  261. ... ....}
  262. if (taicpu(p).oper[0]^.typ = top_const) and
  263. (taicpu(p).oper[1]^.typ in [top_reg,top_ref]) and
  264. (taicpu(p).oper[0]^.val = 0) and
  265. GetNextInstruction(p, hp1) and
  266. (hp1.typ = ait_instruction) and
  267. (taicpu(hp1).is_jmp) and
  268. (taicpu(hp1).opcode=A_Jcc) and
  269. (taicpu(hp1).condition in [C_LE,C_BE]) and
  270. GetNextInstruction(hp1,hp2) and
  271. (hp2.typ = ait_instruction) and
  272. (taicpu(hp2).opcode = A_DEC) and
  273. OpsEqual(taicpu(hp2).oper[0]^,taicpu(p).oper[1]^) and
  274. GetNextInstruction(hp2, hp3) and
  275. (hp3.typ = ait_instruction) and
  276. (taicpu(hp3).is_jmp) and
  277. (taicpu(hp3).opcode = A_JMP) and
  278. GetNextInstruction(hp3, hp4) and
  279. FindLabel(tasmlabel(taicpu(hp1).oper[0]^.ref^.symbol),hp4) then
  280. begin
  281. taicpu(hp2).Opcode := A_SUB;
  282. taicpu(hp2).loadoper(1,taicpu(hp2).oper[0]^);
  283. taicpu(hp2).loadConst(0,1);
  284. taicpu(hp2).ops:=2;
  285. taicpu(hp3).Opcode := A_Jcc;
  286. case taicpu(hp1).condition of
  287. C_LE: taicpu(hp3).condition := C_GE;
  288. C_BE: taicpu(hp3).condition := C_AE;
  289. else
  290. internalerror(2019050903);
  291. end;
  292. asml.remove(p);
  293. asml.remove(hp1);
  294. p.free;
  295. hp1.free;
  296. p := hp2;
  297. Result:=true;
  298. end
  299. end;
  300. A_FLD:
  301. Result:=OptPass1FLD(p);
  302. A_FSTP,A_FISTP:
  303. Result:=OptPass1FSTP(p);
  304. A_LEA:
  305. Result:=OptPass1LEA(p);
  306. A_MOV:
  307. Result:=OptPass1MOV(p);
  308. A_MOVSX,
  309. A_MOVZX :
  310. Result:=OptPass1Movx(p);
  311. (* should not be generated anymore by the current code generator
  312. A_POP:
  313. begin
  314. if target_info.system=system_i386_go32v2 then
  315. begin
  316. { Transform a series of pop/pop/pop/push/push/push to }
  317. { 'movl x(%esp),%reg' for go32v2 (not for the rest, }
  318. { because I'm not sure whether they can cope with }
  319. { 'movl x(%esp),%reg' with x > 0, I believe we had }
  320. { such a problem when using esp as frame pointer (JM) }
  321. if (taicpu(p).oper[0]^.typ = top_reg) then
  322. begin
  323. hp1 := p;
  324. hp2 := p;
  325. l := 0;
  326. while getNextInstruction(hp1,hp1) and
  327. (hp1.typ = ait_instruction) and
  328. (taicpu(hp1).opcode = A_POP) and
  329. (taicpu(hp1).oper[0]^.typ = top_reg) do
  330. begin
  331. hp2 := hp1;
  332. inc(l,4);
  333. end;
  334. getLastInstruction(p,hp3);
  335. l1 := 0;
  336. while (hp2 <> hp3) and
  337. assigned(hp1) and
  338. (hp1.typ = ait_instruction) and
  339. (taicpu(hp1).opcode = A_PUSH) and
  340. (taicpu(hp1).oper[0]^.typ = top_reg) and
  341. (taicpu(hp1).oper[0]^.reg.enum = taicpu(hp2).oper[0]^.reg.enum) do
  342. begin
  343. { change it to a two op operation }
  344. taicpu(hp2).oper[1]^.typ:=top_none;
  345. taicpu(hp2).ops:=2;
  346. taicpu(hp2).opcode := A_MOV;
  347. taicpu(hp2).loadoper(1,taicpu(hp1).oper[0]^);
  348. reference_reset(tmpref);
  349. tmpRef.base.enum:=R_INTREGISTER;
  350. tmpRef.base.number:=NR_STACK_POINTER_REG;
  351. convert_register_to_enum(tmpref.base);
  352. tmpRef.offset := l;
  353. taicpu(hp2).loadRef(0,tmpRef);
  354. hp4 := hp1;
  355. getNextInstruction(hp1,hp1);
  356. asml.remove(hp4);
  357. hp4.free;
  358. getLastInstruction(hp2,hp2);
  359. dec(l,4);
  360. inc(l1);
  361. end;
  362. if l <> -4 then
  363. begin
  364. inc(l,4);
  365. for l1 := l1 downto 1 do
  366. begin
  367. getNextInstruction(hp2,hp2);
  368. dec(taicpu(hp2).oper[0]^.ref^.offset,l);
  369. end
  370. end
  371. end
  372. end
  373. else
  374. begin
  375. if (taicpu(p).oper[0]^.typ = top_reg) and
  376. GetNextInstruction(p, hp1) and
  377. (tai(hp1).typ=ait_instruction) and
  378. (taicpu(hp1).opcode=A_PUSH) and
  379. (taicpu(hp1).oper[0]^.typ = top_reg) and
  380. (taicpu(hp1).oper[0]^.reg.enum=taicpu(p).oper[0]^.reg.enum) then
  381. begin
  382. { change it to a two op operation }
  383. taicpu(p).oper[1]^.typ:=top_none;
  384. taicpu(p).ops:=2;
  385. taicpu(p).opcode := A_MOV;
  386. taicpu(p).loadoper(1,taicpu(p).oper[0]^);
  387. reference_reset(tmpref);
  388. TmpRef.base.enum := R_ESP;
  389. taicpu(p).loadRef(0,TmpRef);
  390. asml.remove(hp1);
  391. hp1.free;
  392. end;
  393. end;
  394. end;
  395. *)
  396. A_PUSH:
  397. begin
  398. if (taicpu(p).opsize = S_W) and
  399. (taicpu(p).oper[0]^.typ = Top_Const) and
  400. GetNextInstruction(p, hp1) and
  401. (tai(hp1).typ = ait_instruction) and
  402. (taicpu(hp1).opcode = A_PUSH) and
  403. (taicpu(hp1).oper[0]^.typ = Top_Const) and
  404. (taicpu(hp1).opsize = S_W) then
  405. begin
  406. taicpu(p).changeopsize(S_L);
  407. taicpu(p).loadConst(0,taicpu(p).oper[0]^.val shl 16 + word(taicpu(hp1).oper[0]^.val));
  408. asml.remove(hp1);
  409. hp1.free;
  410. Result:=true;
  411. end;
  412. end;
  413. A_SHL, A_SAL:
  414. Result:=OptPass1SHLSAL(p);
  415. A_SUB:
  416. Result:=OptPass1Sub(p);
  417. A_MOVAPD,
  418. A_MOVAPS,
  419. A_MOVUPD,
  420. A_MOVUPS,
  421. A_VMOVAPS,
  422. A_VMOVAPD,
  423. A_VMOVUPS,
  424. A_VMOVUPD:
  425. Result:=OptPass1_V_MOVAP(p);
  426. A_VDIVSD,
  427. A_VDIVSS,
  428. A_VSUBSD,
  429. A_VSUBSS,
  430. A_VMULSD,
  431. A_VMULSS,
  432. A_VADDSD,
  433. A_VADDSS,
  434. A_VANDPD,
  435. A_VANDPS,
  436. A_VORPD,
  437. A_VORPS,
  438. A_VXORPD,
  439. A_VXORPS:
  440. Result:=OptPass1VOP(p);
  441. A_MULSD,
  442. A_MULSS,
  443. A_ADDSD,
  444. A_ADDSS:
  445. Result:=OptPass1OP(p);
  446. A_VMOVSD,
  447. A_VMOVSS,
  448. A_MOVSD,
  449. A_MOVSS:
  450. Result:=OptPass1MOVXX(p);
  451. A_SETcc:
  452. Result:=OptPass1SETcc(p);
  453. else
  454. ;
  455. end;
  456. end;
  457. else
  458. ;
  459. end;
  460. end;
  461. function TCPUAsmOptimizer.PeepHoleOptPass2Cpu(var p: tai): boolean;
  462. begin
  463. Result:=false;
  464. case p.Typ Of
  465. Ait_Instruction:
  466. begin
  467. if InsContainsSegRef(taicpu(p)) then
  468. exit;
  469. case taicpu(p).opcode Of
  470. A_Jcc:
  471. Result:=OptPass2Jcc(p);
  472. A_Lea:
  473. Result:=OptPass2Lea(p);
  474. A_FSTP,A_FISTP:
  475. Result:=OptPass1FSTP(p);
  476. A_IMUL:
  477. Result:=OptPass2Imul(p);
  478. A_JMP:
  479. Result:=OptPass2Jmp(p);
  480. A_MOV:
  481. Result:=OptPass2MOV(p);
  482. else
  483. ;
  484. end;
  485. end;
  486. else
  487. ;
  488. end;
  489. end;
  490. function TCPUAsmOptimizer.PostPeepHoleOptsCpu(var p : tai) : boolean;
  491. var
  492. hp1: tai;
  493. begin
  494. Result:=false;
  495. case p.Typ Of
  496. Ait_Instruction:
  497. begin
  498. if InsContainsSegRef(taicpu(p)) then
  499. Exit;
  500. case taicpu(p).opcode Of
  501. A_CALL:
  502. Result:=PostPeepHoleOptCall(p);
  503. A_LEA:
  504. Result:=PostPeepholeOptLea(p);
  505. A_CMP:
  506. Result:=PostPeepholeOptCmp(p);
  507. A_MOV:
  508. Result:=PostPeepholeOptMov(p);
  509. A_MOVZX:
  510. { if register vars are on, it's possible there is code like }
  511. { "cmpl $3,%eax; movzbl 8(%ebp),%ebx; je .Lxxx" }
  512. { so we can't safely replace the movzx then with xor/mov, }
  513. { since that would change the flags (JM) }
  514. if not(cs_opt_regvar in current_settings.optimizerswitches) then
  515. begin
  516. if (taicpu(p).oper[1]^.typ = top_reg) then
  517. if (taicpu(p).oper[0]^.typ = top_reg)
  518. then
  519. case taicpu(p).opsize of
  520. S_BL:
  521. begin
  522. if IsGP32Reg(taicpu(p).oper[1]^.reg) and
  523. not(cs_opt_size in current_settings.optimizerswitches) and
  524. (current_settings.optimizecputype = cpu_Pentium) then
  525. {Change "movzbl %reg1, %reg2" to
  526. "xorl %reg2, %reg2; movb %reg1, %reg2" for Pentium and
  527. PentiumMMX}
  528. begin
  529. hp1 := taicpu.op_reg_reg(A_XOR, S_L,
  530. taicpu(p).oper[1]^.reg, taicpu(p).oper[1]^.reg);
  531. InsertLLItem(p.previous, p, hp1);
  532. taicpu(p).opcode := A_MOV;
  533. taicpu(p).changeopsize(S_B);
  534. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  535. end;
  536. end;
  537. else
  538. ;
  539. end
  540. else if (taicpu(p).oper[0]^.typ = top_ref) and
  541. (taicpu(p).oper[0]^.ref^.base <> taicpu(p).oper[1]^.reg) and
  542. (taicpu(p).oper[0]^.ref^.index <> taicpu(p).oper[1]^.reg) and
  543. not(cs_opt_size in current_settings.optimizerswitches) and
  544. IsGP32Reg(taicpu(p).oper[1]^.reg) and
  545. (current_settings.optimizecputype = cpu_Pentium) and
  546. (taicpu(p).opsize = S_BL) then
  547. {changes "movzbl mem, %reg" to "xorl %reg, %reg; movb mem, %reg8" for
  548. Pentium and PentiumMMX}
  549. begin
  550. hp1 := taicpu.Op_reg_reg(A_XOR, S_L, taicpu(p).oper[1]^.reg,
  551. taicpu(p).oper[1]^.reg);
  552. taicpu(p).opcode := A_MOV;
  553. taicpu(p).changeopsize(S_B);
  554. setsubreg(taicpu(p).oper[1]^.reg,R_SUBL);
  555. InsertLLItem(p.previous, p, hp1);
  556. end;
  557. end;
  558. A_TEST, A_OR:
  559. Result:=PostPeepholeOptTestOr(p);
  560. else
  561. ;
  562. end;
  563. end;
  564. else
  565. ;
  566. end;
  567. end;
  568. procedure TCpuAsmOptimizer.PostPeepHoleOpts;
  569. begin
  570. inherited;
  571. OptReferences;
  572. end;
  573. begin
  574. casmoptimizer:=TCpuAsmOptimizer;
  575. end.