aoptcpu.pas 47 KB

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