aoptbase.pas 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320
  1. {
  2. Copyright (c) 1998-2002 by Jonas Maebe, member of the Free Pascal
  3. Development Team
  4. This unit contains the base of all optimizer related objects
  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 aoptbase;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses
  22. aasmbase,aasmcpu,aasmtai,aasmdata,
  23. cpubase,
  24. cgbase,
  25. cgutils;
  26. Type
  27. { the number of tai objects processed by an optimizer object since the last
  28. time a register was modified }
  29. { size at each dimension depends on the registers of this type }
  30. TInstrSinceLastMod = Array[tregistertype] of pbyte;
  31. { the TAopBase object implements the basic methods that most other }
  32. { assembler optimizer objects require }
  33. Type
  34. TAoptBase = class
  35. { processor independent methods }
  36. constructor create; virtual;
  37. destructor destroy;override;
  38. { returns true if register Reg is used by instruction p1 }
  39. Function RegInInstruction(Reg: TRegister; p1: tai): Boolean;virtual;
  40. { returns true if register Reg occurs in operand op }
  41. Function RegInOp(Reg: TRegister; const op: toper): Boolean;
  42. { returns true if register Reg is used in the reference Ref }
  43. Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  44. function RegModifiedByInstruction(Reg: TRegister; p1: tai): boolean;virtual;
  45. { returns true if the references are completely equal }
  46. {Function RefsEqual(Const R1, R2: TReference): Boolean;}
  47. { gets the next tai object after current that contains info relevant }
  48. { to the optimizer in p1. If there is none, it returns false and }
  49. { sets p1 to nil }
  50. Function GetNextInstruction(Current: tai; Var Next: tai): Boolean;
  51. { gets the previous tai object after current that contains info }
  52. { relevant to the optimizer in last. If there is none, it retuns }
  53. { false and sets last to nil }
  54. Function GetLastInstruction(Current: tai; Var Last: tai): Boolean;
  55. function SkipEntryExitMarker(current: tai; var next: tai): boolean;
  56. { processor dependent methods }
  57. { returns the maximum width component of Reg. Only has to be }
  58. { overridden for the 80x86 (afaik) }
  59. Function RegMaxSize(Reg: TRegister): TRegister; Virtual;
  60. { returns true if Reg1 and Reg2 are of the samae width. Only has to }
  61. { overridden for the 80x86 (afaik) }
  62. Function RegsSameSize(Reg1, Reg2: TRegister): Boolean; Virtual;
  63. { returns whether P is a load instruction (load contents from a }
  64. { memory location or (register) variable into a register) }
  65. Function IsLoadMemReg(p: tai): Boolean; Virtual; Abstract;
  66. { returns whether P is a load constant instruction (load a constant }
  67. { into a register) }
  68. Function IsLoadConstReg(p: tai): Boolean; Virtual; Abstract;
  69. { returns whether P is a store instruction (store contents from a
  70. register to a memory location or to a (register) variable) }
  71. Function IsStoreRegMem(p: tai): Boolean; Virtual; Abstract;
  72. { create a paicpu Object that loads the contents of reg1 into reg2 }
  73. Function a_load_reg_reg(reg1, reg2: TRegister): taicpu; Virtual; Abstract;
  74. { returns true if reg is used by any instruction between p1 and p2 }
  75. Function RegUsedBetween(reg: TRegister; p1, p2: tai): Boolean;
  76. { returns true if reg is modified by any instruction between p1 and p2 }
  77. function RegModifiedBetween(reg: TRegister; p1, p2: tai): Boolean;
  78. { returns true if reg is loaded with a new value by hp }
  79. function RegLoadedWithNewValue(reg: tregister; hp: tai): boolean; Virtual;
  80. { returns true if hp loads a value from reg }
  81. function InstructionLoadsFromReg(const reg : TRegister; const hp : tai) : boolean; Virtual;
  82. end;
  83. function labelCanBeSkipped(p: tai_label): boolean;
  84. implementation
  85. uses
  86. verbose,globtype,globals,aoptcpub;
  87. constructor taoptbase.create;
  88. begin
  89. inherited create;
  90. end;
  91. destructor taoptbase.destroy;
  92. begin
  93. inherited destroy;
  94. end;
  95. Function TAOptBase.RegInInstruction(Reg: TRegister; p1: tai): Boolean;
  96. Var
  97. Count: longint;
  98. Begin
  99. result:=false;
  100. if p1.typ<>ait_instruction then
  101. exit;
  102. for Count:=0 to TInstr(p1).ops-1 do
  103. if RegInOp(Reg, TInstr(p1).oper[Count]^) then
  104. exit(true);
  105. result:=false;
  106. End;
  107. Function TAOptBase.RegInOp(Reg: TRegister; const op: toper): Boolean;
  108. Begin
  109. Case op.typ Of
  110. Top_Reg: RegInOp := Reg = op.reg;
  111. Top_Ref: RegInOp := RegInRef(Reg, op.ref^);
  112. {$ifdef arm}
  113. Top_Shifterop: RegInOp := op.shifterop^.rs = Reg;
  114. Top_RegSet: RegInOp := getsupreg(Reg) in op.regset^;
  115. {$endif arm}
  116. Else RegInOp := False
  117. End
  118. End;
  119. Function TAOptBase.RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  120. Begin
  121. Reg := RegMaxSize(Reg);
  122. RegInRef := (Ref.Base = Reg)
  123. {$ifdef cpurefshaveindexreg}
  124. Or (Ref.Index = Reg)
  125. {$endif cpurefshaveindexreg}
  126. End;
  127. Function TAOptBase.RegModifiedByInstruction(Reg: TRegister; p1: tai): Boolean;
  128. Begin
  129. Result:=true;
  130. End;
  131. function labelCanBeSkipped(p: tai_label): boolean;
  132. begin
  133. labelCanBeSkipped := not(p.labsym.is_used) or (p.labsym.labeltype<>alt_jump);
  134. end;
  135. Function TAOptBase.GetNextInstruction(Current: tai; Var Next: tai): Boolean;
  136. Begin
  137. Repeat
  138. Current := tai(Current.Next);
  139. While Assigned(Current) And
  140. ((Current.typ In SkipInstr) or
  141. {$if defined(SPARC) or defined(MIPS)}
  142. ((Current.typ=ait_instruction) and
  143. (taicpu(Current).opcode=A_NOP)
  144. ) or
  145. {$endif SPARC or MIPS}
  146. ((Current.typ = ait_label) And
  147. labelCanBeSkipped(Tai_Label(Current)))) Do
  148. Current := tai(Current.Next);
  149. If Assigned(Current) And
  150. (Current.typ = ait_Marker) And
  151. (Tai_Marker(Current).Kind = mark_NoPropInfoStart) Then
  152. Begin
  153. While Assigned(Current) And
  154. ((Current.typ <> ait_Marker) Or
  155. (Tai_Marker(Current).Kind <> mark_NoPropInfoEnd)) Do
  156. Current := Tai(Current.Next);
  157. End;
  158. Until Not(Assigned(Current)) Or
  159. (Current.typ <> ait_Marker) Or
  160. (Tai_Marker(Current).Kind <> mark_NoPropInfoEnd);
  161. Next := Current;
  162. If Assigned(Current) And
  163. Not((Current.typ In SkipInstr) or
  164. ((Current.typ = ait_label) And
  165. labelCanBeSkipped(Tai_Label(Current))))
  166. Then GetNextInstruction := True
  167. Else
  168. Begin
  169. Next := Nil;
  170. GetNextInstruction := False;
  171. End;
  172. End;
  173. Function TAOptBase.GetLastInstruction(Current: tai; Var Last: tai): Boolean;
  174. Begin
  175. Repeat
  176. Current := Tai(Current.previous);
  177. While Assigned(Current) And
  178. (((Current.typ = ait_Marker) And
  179. Not(Tai_Marker(Current).Kind in [mark_AsmBlockEnd{,mark_NoPropInfoEnd}])) or
  180. (Current.typ In SkipInstr) or
  181. ((Current.typ = ait_label) And
  182. labelCanBeSkipped(Tai_Label(Current)))) Do
  183. Current := Tai(Current.previous);
  184. { If Assigned(Current) And
  185. (Current.typ = ait_Marker) And
  186. (Tai_Marker(Current).Kind = mark_NoPropInfoEnd) Then
  187. Begin
  188. While Assigned(Current) And
  189. ((Current.typ <> ait_Marker) Or
  190. (Tai_Marker(Current).Kind <> mark_NoPropInfoStart)) Do
  191. Current := Tai(Current.previous);
  192. End; }
  193. Until Not(Assigned(Current)) Or
  194. (Current.typ <> ait_Marker) Or
  195. not(tai_Marker(current).Kind in [mark_NoPropInfoStart,mark_NoPropInfoEnd]);
  196. If Not(Assigned(Current)) or
  197. (Current.typ In SkipInstr) or
  198. ((Current.typ = ait_label) And
  199. labelCanBeSkipped(Tai_Label(Current))) or
  200. ((Current.typ = ait_Marker) And
  201. (Tai_Marker(Current).Kind = mark_AsmBlockEnd))
  202. Then
  203. Begin
  204. Last := Nil;
  205. GetLastInstruction := False
  206. End
  207. Else
  208. Begin
  209. Last := Current;
  210. GetLastInstruction := True;
  211. End;
  212. End;
  213. function TAOptBase.SkipEntryExitMarker(current: tai; var next: tai): boolean;
  214. begin
  215. result:=true;
  216. if current.typ<>ait_marker then
  217. exit;
  218. next:=current;
  219. while GetNextInstruction(next,next) do
  220. begin
  221. if (next.typ<>ait_marker) or not(tai_marker(next).Kind in [mark_Position,mark_BlockStart]) then
  222. exit;
  223. end;
  224. result:=false;
  225. end;
  226. Function TAOptBase.RegUsedBetween(reg : TRegister;p1,p2 : tai) : Boolean;
  227. Begin
  228. Result:=false;
  229. while assigned(p1) and assigned(p2) and GetNextInstruction(p1,p1) and (p1<>p2) do
  230. if RegInInstruction(reg,p1) then
  231. begin
  232. Result:=true;
  233. exit;
  234. end;
  235. end;
  236. Function TAOptBase.RegModifiedBetween(reg : TRegister;p1,p2 : tai) : Boolean;
  237. Begin
  238. Result:=false;
  239. while assigned(p1) and assigned(p2) and GetNextInstruction(p1,p1) and (p1<>p2) do
  240. if RegModifiedByInstruction(reg,p1) then
  241. begin
  242. Result:=true;
  243. exit;
  244. end;
  245. end;
  246. function TAoptBase.RegLoadedWithNewValue(reg : tregister; hp : tai) : boolean;
  247. begin
  248. result:=false;
  249. internalerror(2016012401);
  250. end;
  251. function TAoptBase.InstructionLoadsFromReg(const reg : TRegister; const hp : tai) : boolean;
  252. begin
  253. { save approximation }
  254. Result:=true;
  255. end;
  256. { ******************* Processor dependent stuff *************************** }
  257. Function TAOptBase.RegMaxSize(Reg: TRegister): TRegister;
  258. Begin
  259. RegMaxSize := Reg
  260. End;
  261. Function TAOptBase.RegsSameSize(Reg1, Reg2: TRegister): Boolean;
  262. Begin
  263. RegsSameSize := True
  264. End;
  265. end.