aoptcpu.pas 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897
  1. {
  2. Copyright (c) 1998-2002 by Jonas Maebe, member of the Free Pascal
  3. Development Team
  4. This unit implements the ARM optimizer object
  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 aoptcpu;
  19. {$i fpcdefs.inc}
  20. Interface
  21. uses cgbase, cpubase, aasmtai, aopt, aoptcpub, aoptobj;
  22. Type
  23. { TCpuAsmOptimizer }
  24. TCpuAsmOptimizer = class(TAsmOptimizer)
  25. { uses the same constructor as TAopObj }
  26. function PeepHoleOptPass1Cpu(var p: tai): boolean; override;
  27. procedure PeepHoleOptPass2;override;
  28. Function RegInInstruction(Reg: TRegister; p1: tai): Boolean;override;
  29. procedure RemoveSuperfluousMove(const p: tai; movp: tai; const optimizer: string);
  30. function RegUsedAfterInstruction(reg: Tregister; p: tai;
  31. var AllUsedRegs: TAllUsedRegs): Boolean;
  32. End;
  33. TCpuPreRegallocScheduler = class(TAsmOptimizer)
  34. function PeepHoleOptPass1Cpu(var p: tai): boolean;override;
  35. end;
  36. TCpuThumb2AsmOptimizer = class(TCpuAsmOptimizer)
  37. { uses the same constructor as TAopObj }
  38. procedure PeepHoleOptPass2;override;
  39. End;
  40. Implementation
  41. uses
  42. cutils,
  43. verbose,
  44. cgutils,
  45. aasmbase,aasmdata,aasmcpu;
  46. function CanBeCond(p : tai) : boolean;
  47. begin
  48. result:=
  49. (p.typ=ait_instruction) and
  50. (taicpu(p).condition=C_None) and
  51. ((taicpu(p).opcode<>A_BLX) or
  52. (taicpu(p).oper[0]^.typ=top_reg));
  53. end;
  54. function RefsEqual(const r1, r2: treference): boolean;
  55. begin
  56. refsequal :=
  57. (r1.offset = r2.offset) and
  58. (r1.base = r2.base) and
  59. (r1.index = r2.index) and (r1.scalefactor = r2.scalefactor) and
  60. (r1.symbol=r2.symbol) and (r1.refaddr = r2.refaddr) and
  61. (r1.relsymbol = r2.relsymbol) and
  62. (r1.signindex = r2.signindex) and
  63. (r1.shiftimm = r2.shiftimm) and
  64. (r1.addressmode = r2.addressmode) and
  65. (r1.shiftmode = r2.shiftmode);
  66. end;
  67. function MatchInstruction(const instr: tai; const op: TAsmOp; const cond: TAsmConds; const postfix: TOpPostfixes): boolean;
  68. begin
  69. result :=
  70. (instr.typ = ait_instruction) and
  71. (taicpu(instr).opcode = op) and
  72. ((cond = []) or (taicpu(instr).condition in cond)) and
  73. ((postfix = []) or (taicpu(instr).oppostfix in postfix));
  74. end;
  75. function MatchOperand(const oper1: TOper; const oper2: TOper): boolean; inline;
  76. begin
  77. result := (oper1.typ = oper2.typ) and
  78. (
  79. ((oper1.typ = top_const) and (oper1.val = oper2.val)) or
  80. ((oper1.typ = top_reg) and (oper1.reg = oper2.reg)) or
  81. ((oper1.typ = top_conditioncode) and (oper1.cc = oper2.cc))
  82. );
  83. end;
  84. function MatchOperand(const oper: TOper; const reg: TRegister): boolean; inline;
  85. begin
  86. result := (oper.typ = top_reg) and (oper.reg = reg);
  87. end;
  88. procedure RemoveRedundantMove(const cmpp: tai; movp: tai; asml: TAsmList);
  89. begin
  90. if (taicpu(movp).condition = C_EQ) and
  91. (taicpu(cmpp).oper[0]^.reg = taicpu(movp).oper[0]^.reg) and
  92. (taicpu(cmpp).oper[1]^.val = taicpu(movp).oper[1]^.val) then
  93. begin
  94. asml.insertafter(tai_comment.Create(strpnew('Peephole CmpMovMov - Removed redundant moveq')), movp);
  95. asml.remove(movp);
  96. movp.free;
  97. end;
  98. end;
  99. function regLoadedWithNewValue(reg: tregister; hp: tai): boolean;
  100. var
  101. p: taicpu;
  102. begin
  103. p := taicpu(hp);
  104. regLoadedWithNewValue := false;
  105. if not ((assigned(hp)) and (hp.typ = ait_instruction)) then
  106. exit;
  107. {These are not writing to their first oper}
  108. if p.opcode in [A_STR, A_STRB, A_STRH, A_CMP, A_CMN, A_TST, A_TEQ,
  109. A_B, A_BL, A_BX, A_BLX] then
  110. exit;
  111. { These four are writing into the first 2 register, UMLAL and SMLAL will also read from them }
  112. if (p.opcode in [A_UMLAL, A_UMULL, A_SMLAL, A_SMULL]) and
  113. (p.oper[1]^.typ = top_reg) and
  114. (p.oper[1]^.reg = reg) then
  115. begin
  116. regLoadedWithNewValue := true;
  117. exit
  118. end;
  119. {All other instructions use oper[0] as destination}
  120. regLoadedWithNewValue :=
  121. (p.oper[0]^.typ = top_reg) and
  122. (p.oper[0]^.reg = reg);
  123. end;
  124. function instructionLoadsFromReg(const reg: TRegister; const hp: tai): boolean;
  125. var
  126. p: taicpu;
  127. i: longint;
  128. begin
  129. instructionLoadsFromReg := false;
  130. if not (assigned(hp) and (hp.typ = ait_instruction)) then
  131. exit;
  132. p:=taicpu(hp);
  133. i:=1;
  134. {For these instructions we have to start on oper[0]}
  135. if (p.opcode in [A_STR, A_STRB, A_STRH, A_CMP, A_CMN, A_TST, A_TEQ,
  136. A_B, A_BL, A_BX, A_BLX,
  137. A_SMLAL, A_UMLAL]) then i:=0;
  138. while(i<p.ops) do
  139. begin
  140. case p.oper[I]^.typ of
  141. top_reg:
  142. instructionLoadsFromReg := p.oper[I]^.reg = reg;
  143. top_regset:
  144. instructionLoadsFromReg := (getsupreg(reg) in p.oper[I]^.regset^);
  145. top_shifterop:
  146. instructionLoadsFromReg := p.oper[I]^.shifterop^.rs = reg;
  147. top_ref:
  148. instructionLoadsFromReg :=
  149. (p.oper[I]^.ref^.base = reg) or
  150. (p.oper[I]^.ref^.index = reg);
  151. end;
  152. if instructionLoadsFromReg then exit; {Bailout if we found something}
  153. Inc(I);
  154. end;
  155. end;
  156. function TCpuAsmOptimizer.RegUsedAfterInstruction(reg: Tregister; p: tai;
  157. var AllUsedRegs: TAllUsedRegs): Boolean;
  158. begin
  159. AllUsedRegs[getregtype(reg)].Update(tai(p.Next));
  160. RegUsedAfterInstruction :=
  161. (AllUsedRegs[getregtype(reg)].IsUsed(reg)) and
  162. (not(getNextInstruction(p,p)) or
  163. instructionLoadsFromReg(reg,p) or
  164. not(regLoadedWithNewValue(reg,p)));
  165. end;
  166. procedure TCpuAsmOptimizer.RemoveSuperfluousMove(const p: tai; movp: tai; const optimizer: string);
  167. var
  168. TmpUsedRegs: TAllUsedRegs;
  169. begin
  170. if MatchInstruction(movp, A_MOV, [taicpu(p).condition], [PF_None]) and
  171. (taicpu(movp).ops=2) and {We can't optimize if there is a shiftop}
  172. MatchOperand(taicpu(movp).oper[1]^, taicpu(p).oper[0]^.reg) and
  173. {There is a special requirement for MUL and MLA, oper[0] and oper[1] are not allowed to be the same}
  174. not (
  175. (taicpu(p).opcode in [A_MLA, A_MUL]) and
  176. (taicpu(p).oper[1]^.reg = taicpu(movp).oper[0]^.reg)
  177. ) then
  178. begin
  179. CopyUsedRegs(TmpUsedRegs);
  180. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  181. if not(RegUsedAfterInstruction(taicpu(p).oper[0]^.reg,movp,TmpUsedRegs)) then
  182. begin
  183. asml.insertbefore(tai_comment.Create(strpnew('Peephole '+optimizer+' removed superfluous mov')), movp);
  184. taicpu(p).loadreg(0,taicpu(movp).oper[0]^.reg);
  185. asml.remove(movp);
  186. movp.free;
  187. end;
  188. ReleaseUsedRegs(TmpUsedRegs);
  189. end;
  190. end;
  191. function TCpuAsmOptimizer.PeepHoleOptPass1Cpu(var p: tai): boolean;
  192. var
  193. hp1,hp2: tai;
  194. i: longint;
  195. TmpUsedRegs: TAllUsedRegs;
  196. begin
  197. result := false;
  198. case p.typ of
  199. ait_instruction:
  200. begin
  201. (* optimization proved not to be safe, see tw4768.pp
  202. {
  203. change
  204. <op> reg,x,y
  205. cmp reg,#0
  206. into
  207. <op>s reg,x,y
  208. }
  209. { this optimization can applied only to the currently enabled operations because
  210. the other operations do not update all flags and FPC does not track flag usage }
  211. if (taicpu(p).opcode in [A_ADC,A_ADD,A_SUB {A_UDIV,A_SDIV,A_MUL,A_MVN,A_MOV,A_ORR,A_EOR,A_AND}]) and
  212. (taicpu(p).oppostfix = PF_None) and
  213. (taicpu(p).condition = C_None) and
  214. GetNextInstruction(p, hp1) and
  215. MatchInstruction(hp1, A_CMP, [C_None], [PF_None]) and
  216. (taicpu(hp1).oper[1]^.typ = top_const) and
  217. (taicpu(p).oper[0]^.reg = taicpu(hp1).oper[0]^.reg) and
  218. (taicpu(hp1).oper[1]^.val = 0) { and
  219. GetNextInstruction(hp1, hp2) and
  220. (tai(hp2).typ = ait_instruction) and
  221. // be careful here, following instructions could use other flags
  222. // however after a jump fpc never depends on the value of flags
  223. (taicpu(hp2).opcode = A_B) and
  224. (taicpu(hp2).condition in [C_EQ,C_NE,C_MI,C_PL])} then
  225. begin
  226. taicpu(p).oppostfix:=PF_S;
  227. asml.remove(hp1);
  228. hp1.free;
  229. end
  230. else
  231. *)
  232. case taicpu(p).opcode of
  233. A_STR {,
  234. A_STRH,
  235. A_STRB }:
  236. begin
  237. { change
  238. str reg1,ref
  239. ldr reg2,ref
  240. into
  241. str reg1,ref
  242. mov reg2,reg1
  243. }
  244. if (taicpu(p).oper[1]^.ref^.addressmode=AM_OFFSET) and
  245. (taicpu(p).oppostfix=PF_None) and
  246. GetNextInstruction(p,hp1) and
  247. (
  248. ( (taicpu(p).opcode = A_STR) and
  249. MatchInstruction(hp1, A_LDR, [taicpu(p).condition, C_None], [PF_None])
  250. ) or
  251. ( (taicpu(p).opcode = A_STRH) and
  252. MatchInstruction(hp1, A_LDRH, [taicpu(p).condition, C_None], [PF_None])
  253. ) or
  254. ( (taicpu(p).opcode = A_STRB) and
  255. MatchInstruction(hp1, A_LDRB, [taicpu(p).condition, C_None], [PF_None])
  256. )
  257. ) and
  258. RefsEqual(taicpu(p).oper[1]^.ref^,taicpu(hp1).oper[1]^.ref^) and
  259. (taicpu(hp1).oper[1]^.ref^.addressmode=AM_OFFSET) then
  260. begin
  261. if taicpu(hp1).oper[0]^.reg=taicpu(p).oper[0]^.reg then
  262. begin
  263. asml.remove(hp1);
  264. hp1.free;
  265. end
  266. else
  267. begin
  268. asml.insertbefore(tai_comment.Create(strpnew('Peephole StrLdr2StrMov done')), hp1);
  269. taicpu(hp1).opcode:=A_MOV;
  270. taicpu(hp1).oppostfix:=PF_None;
  271. taicpu(hp1).loadreg(1,taicpu(p).oper[0]^.reg);
  272. end;
  273. result := true;
  274. end;
  275. end;
  276. A_LDR,
  277. A_LDRH,
  278. A_LDRB,
  279. A_LDRSH,
  280. A_LDRSB:
  281. begin
  282. { change
  283. ldr reg1,ref
  284. ldr reg2,ref
  285. into
  286. ldr reg1,ref
  287. mov reg2,reg1
  288. }
  289. if (taicpu(p).oper[1]^.ref^.addressmode=AM_OFFSET) and
  290. GetNextInstruction(p,hp1) and
  291. MatchInstruction(hp1, taicpu(p).opcode, [taicpu(p).condition, C_None], [PF_None]) and
  292. RefsEqual(taicpu(p).oper[1]^.ref^,taicpu(hp1).oper[1]^.ref^) and
  293. (taicpu(p).oper[0]^.reg<>taicpu(hp1).oper[1]^.ref^.index) and
  294. (taicpu(p).oper[0]^.reg<>taicpu(hp1).oper[1]^.ref^.base) and
  295. (taicpu(hp1).oper[1]^.ref^.addressmode=AM_OFFSET) then
  296. begin
  297. if taicpu(hp1).oper[0]^.reg=taicpu(p).oper[0]^.reg then
  298. begin
  299. asml.insertbefore(tai_comment.Create(strpnew('Peephole LdrLdr2Ldr done')), hp1);
  300. asml.remove(hp1);
  301. hp1.free;
  302. end
  303. else
  304. begin
  305. asml.insertbefore(tai_comment.Create(strpnew('Peephole LdrLdr2LdrMov done')), hp1);
  306. taicpu(hp1).opcode:=A_MOV;
  307. taicpu(hp1).oppostfix:=PF_None;
  308. taicpu(hp1).loadreg(1,taicpu(p).oper[0]^.reg);
  309. end;
  310. result := true;
  311. end;
  312. { Remove superfluous mov after ldr
  313. changes
  314. ldr reg1, ref
  315. mov reg2, reg1
  316. to
  317. ldr reg2, ref
  318. conditions are:
  319. * reg1 must be released after mov
  320. * mov can not contain shifterops
  321. * ldr+mov have the same conditions
  322. * mov does not set flags
  323. }
  324. if GetNextInstruction(p, hp1) then
  325. RemoveSuperfluousMove(p, hp1, 'LdrMov2Ldr');
  326. end;
  327. A_MOV:
  328. begin
  329. { fold
  330. mov reg1,reg0, shift imm1
  331. mov reg1,reg1, shift imm2
  332. to
  333. mov reg1,reg0, shift imm1+imm2
  334. }
  335. if (taicpu(p).ops=3) and
  336. (taicpu(p).oper[2]^.typ = top_shifterop) and
  337. (taicpu(p).oper[2]^.shifterop^.rs = NR_NO) and
  338. getnextinstruction(p,hp1) and
  339. MatchInstruction(hp1, A_MOV, [taicpu(p).condition], [PF_None]) and
  340. (taicpu(hp1).ops=3) and
  341. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^.reg) and
  342. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[0]^.reg) and
  343. (taicpu(hp1).oper[2]^.typ = top_shifterop) and
  344. (taicpu(hp1).oper[2]^.shifterop^.rs = NR_NO) then
  345. begin
  346. { fold
  347. mov reg1,reg0, lsl 16
  348. mov reg1,reg1, lsr 16
  349. strh reg1, ...
  350. dealloc reg1
  351. to
  352. strh reg1, ...
  353. dealloc reg1
  354. }
  355. if (taicpu(p).oper[2]^.shifterop^.shiftmode=SM_LSL) and
  356. (taicpu(p).oper[2]^.shifterop^.shiftimm=16) and
  357. (taicpu(hp1).oper[2]^.shifterop^.shiftmode=SM_LSR) and
  358. (taicpu(hp1).oper[2]^.shifterop^.shiftimm=16) and
  359. getnextinstruction(hp1,hp2) and
  360. MatchInstruction(hp2, A_STR, [taicpu(p).condition], [PF_H]) and
  361. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[0]^.reg) then
  362. begin
  363. CopyUsedRegs(TmpUsedRegs);
  364. UpdateUsedRegs(TmpUsedRegs, tai(p.next));
  365. UpdateUsedRegs(TmpUsedRegs, tai(hp1.next));
  366. if not(RegUsedAfterInstruction(taicpu(p).oper[0]^.reg,hp2,TmpUsedRegs)) then
  367. begin
  368. asml.insertbefore(tai_comment.Create(strpnew('Peephole optimizer removed superfluous 16 Bit zero extension')), hp1);
  369. taicpu(hp2).loadreg(0,taicpu(p).oper[1]^.reg);
  370. asml.remove(p);
  371. asml.remove(hp1);
  372. p.free;
  373. hp1.free;
  374. p:=hp2;
  375. end;
  376. ReleaseUsedRegs(TmpUsedRegs);
  377. end
  378. { fold
  379. mov reg1,reg0, shift imm1
  380. mov reg1,reg1, shift imm2
  381. to
  382. mov reg1,reg0, shift imm1+imm2
  383. }
  384. else if (taicpu(p).oper[2]^.shifterop^.shiftmode=taicpu(hp1).oper[2]^.shifterop^.shiftmode) then
  385. begin
  386. inc(taicpu(p).oper[2]^.shifterop^.shiftimm,taicpu(hp1).oper[2]^.shifterop^.shiftimm);
  387. { avoid overflows }
  388. if taicpu(p).oper[2]^.shifterop^.shiftimm>31 then
  389. case taicpu(p).oper[2]^.shifterop^.shiftmode of
  390. SM_ROR:
  391. taicpu(p).oper[2]^.shifterop^.shiftimm:=taicpu(p).oper[2]^.shifterop^.shiftimm and 31;
  392. SM_ASR:
  393. taicpu(p).oper[2]^.shifterop^.shiftimm:=31;
  394. SM_LSR,
  395. SM_LSL:
  396. begin
  397. hp1:=taicpu.op_reg_const(A_MOV,taicpu(p).oper[0]^.reg,0);
  398. InsertLLItem(p.previous, p.next, hp1);
  399. p.free;
  400. p:=hp1;
  401. end;
  402. else
  403. internalerror(2008072803);
  404. end;
  405. asml.insertbefore(tai_comment.Create(strpnew('Peephole ShiftShift2Shift done')), p);
  406. asml.remove(hp1);
  407. hp1.free;
  408. result := true;
  409. end;
  410. end;
  411. {
  412. This changes the very common
  413. mov r0, #0
  414. str r0, [...]
  415. mov r0, #0
  416. str r0, [...]
  417. and removes all superfluous mov instructions
  418. }
  419. if (taicpu(p).ops = 2) and
  420. (taicpu(p).oper[1]^.typ = top_const) and
  421. GetNextInstruction(p,hp1) then
  422. begin
  423. while (tai(p).typ = ait_instruction) and
  424. (taicpu(p).opcode in [A_STR, A_STRH, A_STRB]) and
  425. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^) and
  426. GetNextInstruction(hp1, hp2) and
  427. MatchInstruction(hp2, A_MOV, [taicpu(p).condition], [taicpu(p).oppostfix]) and
  428. (taicpu(hp2).ops = 2) and
  429. MatchOperand(taicpu(hp2).oper[0]^, taicpu(p).oper[0]^) and
  430. MatchOperand(taicpu(hp2).oper[1]^, taicpu(p).oper[1]^) do
  431. begin
  432. asml.insertbefore(tai_comment.Create(strpnew('Peephole MovStrMov done')), hp2);
  433. GetNextInstruction(hp2,hp1);
  434. asml.remove(hp2);
  435. hp2.free;
  436. if not assigned(hp1) then break;
  437. end;
  438. end;
  439. {
  440. change
  441. mov r1, r0
  442. add r1, r1, #1
  443. to
  444. add r1, r0, #1
  445. Todo: Make it work for mov+cmp too
  446. }
  447. if (taicpu(p).ops = 2) and
  448. (taicpu(p).oper[1]^.typ = top_reg) and
  449. (taicpu(p).oppostfix = PF_NONE) and
  450. GetNextInstruction(p, hp1) and
  451. (tai(hp1).typ = ait_instruction) and
  452. (taicpu(hp1).opcode in [A_ADD, A_ADC, A_RSB, A_RSC, A_SUB, A_SBC,
  453. A_AND, A_BIC, A_EOR, A_ORR]) and
  454. (taicpu(hp1).condition in [C_NONE, taicpu(hp1).condition]) and
  455. MatchOperand(taicpu(p).oper[0]^, taicpu(hp1).oper[0]^.reg) and
  456. (taicpu(hp1).oper[1]^.typ = top_reg) and
  457. (taicpu(hp1).oper[2]^.typ in [top_reg, top_const]) then
  458. begin
  459. { When we get here we still don't know if the registers match}
  460. for I:=1 to 2 do
  461. {
  462. If the first loop was successful p will be replaced with hp1.
  463. The checks will still be ok, because all required information
  464. will also be in hp1 then.
  465. }
  466. if MatchOperand(taicpu(p).oper[0]^, taicpu(hp1).oper[I]^.reg) then
  467. begin
  468. asml.insertbefore(tai_comment.Create(strpnew('Peephole RedundantMovProcess done ')), hp1);
  469. taicpu(hp1).oper[I]^.reg := taicpu(p).oper[1]^.reg;
  470. if p<>hp1 then
  471. begin
  472. asml.remove(p);
  473. p.free;
  474. p:=hp1;
  475. end;
  476. end;
  477. end;
  478. end;
  479. A_ADD,
  480. A_ADC,
  481. A_RSB,
  482. A_RSC,
  483. A_SUB,
  484. A_SBC,
  485. A_AND,
  486. A_BIC,
  487. A_EOR,
  488. A_ORR,
  489. A_MLA,
  490. A_MUL:
  491. begin
  492. {
  493. change
  494. and reg2,reg1,const1
  495. and reg2,reg2,const2
  496. to
  497. and reg2,reg1,(const1 and const2)
  498. }
  499. if (taicpu(p).opcode = A_AND) and
  500. (taicpu(p).oper[1]^.typ = top_reg) and
  501. (taicpu(p).oper[2]^.typ = top_const) and
  502. GetNextInstruction(p, hp1) and
  503. MatchInstruction(hp1, A_AND, [taicpu(p).condition], [PF_None]) and
  504. MatchOperand(taicpu(hp1).oper[0]^, taicpu(p).oper[0]^.reg) and
  505. MatchOperand(taicpu(hp1).oper[1]^, taicpu(p).oper[0]^.reg) and
  506. (taicpu(hp1).oper[2]^.typ = top_const) then
  507. begin
  508. asml.insertbefore(tai_comment.Create(strpnew('Peephole AndAnd2And done')), p);
  509. taicpu(p).loadConst(2,taicpu(p).oper[2]^.val and taicpu(hp1).oper[2]^.val);
  510. taicpu(p).oppostfix:=taicpu(hp1).oppostfix;
  511. asml.remove(hp1);
  512. hp1.free;
  513. end;
  514. {
  515. change
  516. add reg1, ...
  517. mov reg2, reg1
  518. to
  519. add reg2, ...
  520. }
  521. if GetNextInstruction(p, hp1) then
  522. RemoveSuperfluousMove(p, hp1, 'DataMov2Data');
  523. end;
  524. A_CMP:
  525. begin
  526. {
  527. change
  528. cmp reg,const1
  529. moveq reg,const1
  530. movne reg,const2
  531. to
  532. cmp reg,const1
  533. movne reg,const2
  534. }
  535. if (taicpu(p).oper[1]^.typ = top_const) and
  536. GetNextInstruction(p, hp1) and
  537. MatchInstruction(hp1, A_MOV, [C_EQ, C_NE], [PF_NONE]) and
  538. (taicpu(hp1).oper[1]^.typ = top_const) and
  539. GetNextInstruction(hp1, hp2) and
  540. MatchInstruction(hp2, A_MOV, [C_EQ, C_NE], [PF_NONE]) and
  541. (taicpu(hp1).oper[1]^.typ = top_const) then
  542. begin
  543. RemoveRedundantMove(p, hp1, asml);
  544. RemoveRedundantMove(p, hp2, asml);
  545. end;
  546. end;
  547. end;
  548. end;
  549. end;
  550. end;
  551. { instructions modifying the CPSR can be only the last instruction }
  552. function MustBeLast(p : tai) : boolean;
  553. begin
  554. Result:=(p.typ=ait_instruction) and
  555. ((taicpu(p).opcode in [A_BL,A_BLX,A_CMP,A_CMN,A_SWI,A_TEQ,A_TST,A_CMF,A_CMFE {,A_MSR}]) or
  556. ((taicpu(p).ops>=1) and (taicpu(p).oper[0]^.typ=top_reg) and (taicpu(p).oper[0]^.reg=NR_PC)) or
  557. (taicpu(p).oppostfix=PF_S));
  558. end;
  559. procedure TCpuAsmOptimizer.PeepHoleOptPass2;
  560. var
  561. p,hp1,hp2: tai;
  562. l : longint;
  563. condition : tasmcond;
  564. hp3: tai;
  565. WasLast: boolean;
  566. { UsedRegs, TmpUsedRegs: TRegSet; }
  567. begin
  568. p := BlockStart;
  569. { UsedRegs := []; }
  570. while (p <> BlockEnd) Do
  571. begin
  572. { UpdateUsedRegs(UsedRegs, tai(p.next)); }
  573. case p.Typ Of
  574. Ait_Instruction:
  575. begin
  576. case taicpu(p).opcode Of
  577. A_B:
  578. if taicpu(p).condition<>C_None then
  579. begin
  580. { check for
  581. Bxx xxx
  582. <several instructions>
  583. xxx:
  584. }
  585. l:=0;
  586. WasLast:=False;
  587. GetNextInstruction(p, hp1);
  588. while assigned(hp1) and
  589. (l<=4) and
  590. CanBeCond(hp1) and
  591. { stop on labels }
  592. not(hp1.typ=ait_label) do
  593. begin
  594. inc(l);
  595. if MustBeLast(hp1) then
  596. begin
  597. WasLast:=True;
  598. GetNextInstruction(hp1,hp1);
  599. break;
  600. end
  601. else
  602. GetNextInstruction(hp1,hp1);
  603. end;
  604. if assigned(hp1) then
  605. begin
  606. if FindLabel(tasmlabel(taicpu(p).oper[0]^.ref^.symbol),hp1) then
  607. begin
  608. if (l<=4) and (l>0) then
  609. begin
  610. condition:=inverse_cond(taicpu(p).condition);
  611. hp2:=p;
  612. GetNextInstruction(p,hp1);
  613. p:=hp1;
  614. repeat
  615. if hp1.typ=ait_instruction then
  616. taicpu(hp1).condition:=condition;
  617. if MustBeLast(hp1) then
  618. begin
  619. GetNextInstruction(hp1,hp1);
  620. break;
  621. end
  622. else
  623. GetNextInstruction(hp1,hp1);
  624. until not(assigned(hp1)) or
  625. not(CanBeCond(hp1)) or
  626. (hp1.typ=ait_label);
  627. { wait with removing else GetNextInstruction could
  628. ignore the label if it was the only usage in the
  629. jump moved away }
  630. tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol).decrefs;
  631. asml.remove(hp2);
  632. hp2.free;
  633. continue;
  634. end;
  635. end
  636. else
  637. { do not perform further optimizations if there is inctructon
  638. in block #1 which can not be optimized.
  639. }
  640. if not WasLast then
  641. begin
  642. { check further for
  643. Bcc xxx
  644. <several instructions 1>
  645. B yyy
  646. xxx:
  647. <several instructions 2>
  648. yyy:
  649. }
  650. { hp2 points to jmp yyy }
  651. hp2:=hp1;
  652. { skip hp1 to xxx }
  653. GetNextInstruction(hp1, hp1);
  654. if assigned(hp2) and
  655. assigned(hp1) and
  656. (l<=3) and
  657. (hp2.typ=ait_instruction) and
  658. (taicpu(hp2).is_jmp) and
  659. (taicpu(hp2).condition=C_None) and
  660. { real label and jump, no further references to the
  661. label are allowed }
  662. (tasmlabel(taicpu(p).oper[0]^.ref^.symbol).getrefs=2) and
  663. FindLabel(tasmlabel(taicpu(p).oper[0]^.ref^.symbol),hp1) then
  664. begin
  665. l:=0;
  666. { skip hp1 to <several moves 2> }
  667. GetNextInstruction(hp1, hp1);
  668. while assigned(hp1) and
  669. CanBeCond(hp1) do
  670. begin
  671. inc(l);
  672. GetNextInstruction(hp1, hp1);
  673. end;
  674. { hp1 points to yyy: }
  675. if assigned(hp1) and
  676. FindLabel(tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol),hp1) then
  677. begin
  678. condition:=inverse_cond(taicpu(p).condition);
  679. GetNextInstruction(p,hp1);
  680. hp3:=p;
  681. p:=hp1;
  682. repeat
  683. if hp1.typ=ait_instruction then
  684. taicpu(hp1).condition:=condition;
  685. GetNextInstruction(hp1,hp1);
  686. until not(assigned(hp1)) or
  687. not(CanBeCond(hp1));
  688. { hp2 is still at jmp yyy }
  689. GetNextInstruction(hp2,hp1);
  690. { hp2 is now at xxx: }
  691. condition:=inverse_cond(condition);
  692. GetNextInstruction(hp1,hp1);
  693. { hp1 is now at <several movs 2> }
  694. repeat
  695. taicpu(hp1).condition:=condition;
  696. GetNextInstruction(hp1,hp1);
  697. until not(assigned(hp1)) or
  698. not(CanBeCond(hp1)) or
  699. (hp1.typ=ait_label);
  700. {
  701. asml.remove(hp1.next)
  702. hp1.next.free;
  703. asml.remove(hp1);
  704. hp1.free;
  705. }
  706. { remove Bcc }
  707. tasmlabel(taicpu(hp3).oper[0]^.ref^.symbol).decrefs;
  708. asml.remove(hp3);
  709. hp3.free;
  710. { remove jmp }
  711. tasmlabel(taicpu(hp2).oper[0]^.ref^.symbol).decrefs;
  712. asml.remove(hp2);
  713. hp2.free;
  714. continue;
  715. end;
  716. end;
  717. end;
  718. end;
  719. end;
  720. end;
  721. end;
  722. end;
  723. p := tai(p.next)
  724. end;
  725. end;
  726. function TCpuAsmOptimizer.RegInInstruction(Reg: TRegister; p1: tai): Boolean;
  727. begin
  728. If (p1.typ = ait_instruction) and (taicpu(p1).opcode=A_BL) then
  729. Result:=true
  730. else
  731. Result:=inherited RegInInstruction(Reg, p1);
  732. end;
  733. const
  734. { set of opcode which might or do write to memory }
  735. { TODO : extend armins.dat to contain r/w info }
  736. opcode_could_mem_write = [A_B,A_BL,A_BLX,A_BKPT,A_BX,A_STR,A_STRB,A_STRBT,
  737. A_STRH,A_STRT,A_STF,A_SFM,A_STM,A_FSTS,A_FSTD];
  738. function TCpuPreRegallocScheduler.PeepHoleOptPass1Cpu(var p: tai): boolean;
  739. { TODO : schedule also forward }
  740. { TODO : schedule distance > 1 }
  741. var
  742. hp1,hp2,hp3,hp4,hp5 : tai;
  743. list : TAsmList;
  744. begin
  745. result:=true;
  746. list:=TAsmList.Create;
  747. p := BlockStart;
  748. { UsedRegs := []; }
  749. while (p <> BlockEnd) Do
  750. begin
  751. if (p.typ=ait_instruction) and
  752. GetNextInstruction(p,hp1) and
  753. (hp1.typ=ait_instruction) and
  754. { for now we don't reschedule if the previous instruction changes potentially a memory location }
  755. ( (not(taicpu(p).opcode in opcode_could_mem_write) and
  756. not(RegModifiedByInstruction(NR_PC,p)) and
  757. (taicpu(hp1).opcode in [A_LDR,A_LDRB,A_LDRH,A_LDRSB,A_LDRSH])
  758. ) or
  759. ((taicpu(p).opcode in [A_STM,A_STRB,A_STRH,A_STR]) and
  760. (taicpu(hp1).opcode in [A_LDR,A_LDRB,A_LDRH,A_LDRSB,A_LDRSH]) and
  761. ((taicpu(hp1).oper[1]^.ref^.base=NR_PC) or
  762. (assigned(taicpu(hp1).oper[1]^.ref^.symboldata) and
  763. (taicpu(hp1).oper[1]^.ref^.offset=0)
  764. )
  765. ) or
  766. { try to prove that the memory accesses don't overlapp }
  767. ((taicpu(p).opcode in [A_STRB,A_STRH,A_STR]) and
  768. (taicpu(hp1).opcode in [A_LDR,A_LDRB,A_LDRH,A_LDRSB,A_LDRSH]) and
  769. (taicpu(p).oper[1]^.ref^.base=taicpu(hp1).oper[1]^.ref^.base) and
  770. (taicpu(p).oppostfix=PF_None) and
  771. (taicpu(hp1).oppostfix=PF_None) and
  772. (taicpu(p).oper[1]^.ref^.index=NR_NO) and
  773. (taicpu(hp1).oper[1]^.ref^.index=NR_NO) and
  774. { get operand sizes and check if the offset distance is large enough to ensure no overlapp }
  775. (abs(taicpu(p).oper[1]^.ref^.offset-taicpu(hp1).oper[1]^.ref^.offset)>=max(tcgsize2size[reg_cgsize(taicpu(p).oper[0]^.reg)],tcgsize2size[reg_cgsize(taicpu(hp1).oper[0]^.reg)]))
  776. )
  777. )
  778. ) and
  779. GetNextInstruction(hp1,hp2) and
  780. (hp2.typ=ait_instruction) and
  781. { loaded register used by next instruction? }
  782. (RegInInstruction(taicpu(hp1).oper[0]^.reg,hp2)) and
  783. { loaded register not used by previous instruction? }
  784. not(RegInInstruction(taicpu(hp1).oper[0]^.reg,p)) and
  785. { same condition? }
  786. (taicpu(p).condition=taicpu(hp1).condition) and
  787. { first instruction might not change the register used as base }
  788. ((taicpu(hp1).oper[1]^.ref^.base=NR_NO) or
  789. not(RegModifiedByInstruction(taicpu(hp1).oper[1]^.ref^.base,p))
  790. ) and
  791. { first instruction might not change the register used as index }
  792. ((taicpu(hp1).oper[1]^.ref^.index=NR_NO) or
  793. not(RegModifiedByInstruction(taicpu(hp1).oper[1]^.ref^.index,p))
  794. ) then
  795. begin
  796. hp3:=tai(p.Previous);
  797. hp5:=tai(p.next);
  798. asml.Remove(p);
  799. { if there is a reg. dealloc instruction associated with p, move it together with p }
  800. { before the instruction? }
  801. while assigned(hp3) and (hp3.typ<>ait_instruction) do
  802. begin
  803. if (hp3.typ=ait_regalloc) and (tai_regalloc(hp3).ratype in [ra_dealloc]) and
  804. RegInInstruction(tai_regalloc(hp3).reg,p) then
  805. begin
  806. hp4:=hp3;
  807. hp3:=tai(hp3.Previous);
  808. asml.Remove(hp4);
  809. list.Concat(hp4);
  810. end
  811. else
  812. hp3:=tai(hp3.Previous);
  813. end;
  814. list.Concat(p);
  815. { after the instruction? }
  816. while assigned(hp5) and (hp5.typ<>ait_instruction) do
  817. begin
  818. if (hp5.typ=ait_regalloc) and (tai_regalloc(hp5).ratype in [ra_dealloc]) and
  819. RegInInstruction(tai_regalloc(hp5).reg,p) then
  820. begin
  821. hp4:=hp5;
  822. hp5:=tai(hp5.next);
  823. asml.Remove(hp4);
  824. list.Concat(hp4);
  825. end
  826. else
  827. hp5:=tai(hp5.Next);
  828. end;
  829. asml.Remove(hp1);
  830. {$ifdef DEBUG_PREREGSCHEDULER}
  831. asml.InsertBefore(tai_comment.Create(strpnew('Rescheduled')),hp2);
  832. {$endif DEBUG_PREREGSCHEDULER}
  833. asml.InsertBefore(hp1,hp2);
  834. asml.InsertListBefore(hp2,list);
  835. end;
  836. p := tai(p.next)
  837. end;
  838. list.Free;
  839. end;
  840. procedure TCpuThumb2AsmOptimizer.PeepHoleOptPass2;
  841. begin
  842. { TODO: Add optimizer code }
  843. end;
  844. begin
  845. casmoptimizer:=TCpuAsmOptimizer;
  846. cpreregallocscheduler:=TCpuPreRegallocScheduler;
  847. End.