aoptbase.pas 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376
  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. class function RegInOp(Reg: TRegister; const op: toper): Boolean; static;
  42. { returns true if register Reg is used in the reference Ref }
  43. class function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean; static;
  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. If AlsoStopOn is set, it will also stop on these }
  50. { object types that are normally skipped over. }
  51. class function GetNextInstruction(Current: tai; out Next: tai; AlsoStopOn: taitypes = []): Boolean; static;
  52. { gets the previous tai object after current that contains info }
  53. { relevant to the optimizer in last. If there is none, it returns }
  54. { false and sets last to nil. If AlsoStopOn is set, it will also }
  55. { stop on these object types that are normally skipped over. }
  56. class function GetLastInstruction(Current: tai; out Last: tai; AlsoStopOn: taitypes = []): Boolean; static;
  57. class function SkipEntryExitMarker(current: tai; out next: tai): boolean; static;
  58. { processor dependent methods }
  59. { returns the maximum width component of Reg. Only has to be }
  60. { overridden for the 80x86 (afaik) }
  61. Function RegMaxSize(Reg: TRegister): TRegister; Virtual;
  62. { returns true if Reg1 and Reg2 are of the samae width. Only has to }
  63. { overridden for the 80x86 (afaik) }
  64. Function RegsSameSize(Reg1, Reg2: TRegister): Boolean; Virtual;
  65. { returns whether P is a load instruction (load contents from a }
  66. { memory location or (register) variable into a register) }
  67. Function IsLoadMemReg(p: tai): Boolean; Virtual; Abstract;
  68. { returns whether P is a load constant instruction (load a constant }
  69. { into a register) }
  70. Function IsLoadConstReg(p: tai): Boolean; Virtual; Abstract;
  71. { returns whether P is a store instruction (store contents from a
  72. register to a memory location or to a (register) variable) }
  73. Function IsStoreRegMem(p: tai): Boolean; Virtual; Abstract;
  74. { create a paicpu Object that loads the contents of reg1 into reg2 }
  75. Function a_load_reg_reg(reg1, reg2: TRegister): taicpu; Virtual; Abstract;
  76. { returns true if reg is used by any instruction between p1 and p2 }
  77. Function RegUsedBetween(reg: TRegister; p1, p2: tai): Boolean;
  78. { returns true if reg is modified by any instruction between p1 and p2 }
  79. function RegModifiedBetween(reg: TRegister; p1, p2: tai): Boolean;
  80. { returns true if reg is loaded with a new value by hp }
  81. function RegLoadedWithNewValue(reg: tregister; hp: tai): boolean; Virtual;
  82. { returns true if hp loads a value from reg }
  83. function InstructionLoadsFromReg(const reg : TRegister; const hp : tai) : boolean; Virtual;
  84. { compares reg1 and reg2 having the same type and being the same super registers
  85. so the register size is neglected }
  86. class function SuperRegistersEqual(reg1,reg2 : TRegister) : Boolean; static; {$ifdef USEINLINE}inline;{$endif}
  87. { returns true if changing reg1 changes reg2 or vice versa }
  88. class function RegistersInterfere(reg1,reg2 : TRegister) : Boolean; static; {$ifdef USEINLINE}inline;{$endif}
  89. end;
  90. function labelCanBeSkipped(p: tai_label): boolean; {$ifdef USEINLINE}inline;{$endif}
  91. implementation
  92. uses
  93. verbose,globals,aoptcpub;
  94. constructor taoptbase.create;
  95. begin
  96. inherited create;
  97. end;
  98. destructor taoptbase.destroy;
  99. begin
  100. inherited destroy;
  101. end;
  102. Function TAOptBase.RegInInstruction(Reg: TRegister; p1: tai): Boolean;
  103. Var
  104. Count: longint;
  105. Begin
  106. result:=false;
  107. if p1.typ<>ait_instruction then
  108. exit;
  109. for Count:=0 to TInstr(p1).ops-1 do
  110. if RegInOp(Reg, TInstr(p1).oper[Count]^) then
  111. exit(true);
  112. result:=false;
  113. End;
  114. class function TAOptBase.RegInOp(Reg: TRegister; const op: toper): Boolean;
  115. Begin
  116. Case op.typ Of
  117. Top_Reg: RegInOp := RegistersInterfere(Reg,op.reg);
  118. Top_Ref: RegInOp := RegInRef(Reg, op.ref^);
  119. {$ifdef arm}
  120. Top_Shifterop: RegInOp := op.shifterop^.rs = Reg;
  121. Top_RegSet: RegInOp := getsupreg(Reg) in op.regset^;
  122. {$endif arm}
  123. Else RegInOp := False
  124. End
  125. End;
  126. class function TAOptBase.RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  127. Begin
  128. RegInRef := RegistersInterfere(Ref.Base,Reg)
  129. {$ifdef cpurefshaveindexreg}
  130. Or RegistersInterfere(Ref.Index,Reg)
  131. {$endif cpurefshaveindexreg}
  132. {$ifdef x86}
  133. or (Reg=Ref.segment)
  134. { if Ref.segment isn't set, the cpu uses implicitly ss or ds, depending on the base register }
  135. or ((Ref.segment=NR_NO) and (
  136. ((Reg=NR_SS) and (RegistersInterfere(Ref.base,NR_EBP) or RegistersInterfere(Ref.base,NR_ESP))) or
  137. ((Reg=NR_DS) and not(RegistersInterfere(Ref.base,NR_EBP) or RegistersInterfere(Ref.base,NR_ESP)))
  138. ))
  139. {$endif x86}
  140. End;
  141. Function TAOptBase.RegModifiedByInstruction(Reg: TRegister; p1: tai): Boolean;
  142. Begin
  143. Result:=true;
  144. End;
  145. function labelCanBeSkipped(p: tai_label): boolean; {$ifdef USEINLINE}inline;{$endif}
  146. begin
  147. labelCanBeSkipped := not(p.labsym.is_used) or (p.labsym.labeltype<>alt_jump);
  148. end;
  149. class function TAOptBase.GetNextInstruction(Current: tai; out Next: tai; AlsoStopOn: taitypes): Boolean;
  150. Begin
  151. Repeat
  152. Current := tai(Current.Next);
  153. While Assigned(Current) And
  154. ((Current.typ In SkipInstr - AlsoStopOn) or
  155. {$ifdef cpudelayslot}
  156. ((Current.typ=ait_instruction) and
  157. (taicpu(Current).opcode=A_NOP)
  158. ) or
  159. {$endif cpudelayslot}
  160. ((Current.typ = ait_label) And
  161. labelCanBeSkipped(Tai_Label(Current)))) Do
  162. begin
  163. { this won't help the current loop, but it helps when returning from GetNextInstruction
  164. as the next entry is probably already in the cache }
  165. prefetch(pointer(Current.Next)^);
  166. Current := Tai(Current.Next);
  167. end;
  168. If Assigned(Current) And
  169. (Current.typ = ait_Marker) And
  170. (Tai_Marker(Current).Kind = mark_NoPropInfoStart) Then
  171. Begin
  172. While Assigned(Current) And
  173. ((Current.typ <> ait_Marker) Or
  174. (Tai_Marker(Current).Kind <> mark_NoPropInfoEnd)) Do
  175. begin
  176. { this won't help the current loop, but it helps when returning from GetNextInstruction
  177. as the next entry is probably already in the cache }
  178. prefetch(pointer(Current.Next)^);
  179. Current := Tai(Current.Next);
  180. end;
  181. End;
  182. Until Not(Assigned(Current)) Or
  183. (Current.typ <> ait_Marker) Or
  184. (Tai_Marker(Current).Kind <> mark_NoPropInfoEnd);
  185. Next := Current;
  186. If Assigned(Current) And
  187. Not((Current.typ In SkipInstr - AlsoStopOn) or
  188. ((Current.typ = ait_label) And
  189. labelCanBeSkipped(Tai_Label(Current))))
  190. Then GetNextInstruction := True
  191. Else
  192. Begin
  193. Next := Nil;
  194. GetNextInstruction := False;
  195. End;
  196. End;
  197. class function TAOptBase.GetLastInstruction(Current: tai; out Last: tai; AlsoStopOn: taitypes): Boolean;
  198. Begin
  199. Repeat
  200. Current := Tai(Current.previous);
  201. While Assigned(Current) And
  202. (((Current.typ = ait_Marker) And
  203. Not(Tai_Marker(Current).Kind in [mark_AsmBlockEnd{,mark_NoPropInfoEnd}])) or
  204. (Current.typ In SkipInstr - AlsoStopOn) or
  205. ((Current.typ = ait_label) And
  206. labelCanBeSkipped(Tai_Label(Current)))) Do
  207. Current := Tai(Current.previous);
  208. { If Assigned(Current) And
  209. (Current.typ = ait_Marker) And
  210. (Tai_Marker(Current).Kind = mark_NoPropInfoEnd) Then
  211. Begin
  212. While Assigned(Current) And
  213. ((Current.typ <> ait_Marker) Or
  214. (Tai_Marker(Current).Kind <> mark_NoPropInfoStart)) Do
  215. Current := Tai(Current.previous);
  216. End; }
  217. Until Not(Assigned(Current)) Or
  218. (Current.typ <> ait_Marker) Or
  219. not(tai_Marker(current).Kind in [mark_NoPropInfoStart,mark_NoPropInfoEnd]);
  220. If Not(Assigned(Current)) or
  221. (Current.typ In SkipInstr - AlsoStopOn) or
  222. ((Current.typ = ait_label) And
  223. labelCanBeSkipped(Tai_Label(Current))) or
  224. ((Current.typ = ait_Marker) And
  225. (Tai_Marker(Current).Kind = mark_AsmBlockEnd))
  226. Then
  227. Begin
  228. Last := Nil;
  229. GetLastInstruction := False
  230. End
  231. Else
  232. Begin
  233. Last := Current;
  234. GetLastInstruction := True;
  235. End;
  236. End;
  237. class function TAOptBase.SkipEntryExitMarker(current: tai; out next: tai): boolean;
  238. begin
  239. result:=true;
  240. next:=current;
  241. if current.typ<>ait_marker then
  242. exit;
  243. while GetNextInstruction(next,next) do
  244. begin
  245. if (next.typ<>ait_marker) or not(tai_marker(next).Kind in [mark_Position,mark_BlockStart]) then
  246. exit;
  247. end;
  248. result:=false;
  249. end;
  250. Function TAOptBase.RegUsedBetween(reg : TRegister;p1,p2 : tai) : Boolean;
  251. Begin
  252. Result:=false;
  253. while assigned(p1) and assigned(p2) and GetNextInstruction(p1,p1) and (p1<>p2) do
  254. if RegInInstruction(reg,p1) then
  255. begin
  256. Result:=true;
  257. exit;
  258. end;
  259. end;
  260. Function TAOptBase.RegModifiedBetween(reg : TRegister;p1,p2 : tai) : Boolean;
  261. Begin
  262. Result:=false;
  263. while assigned(p1) and assigned(p2) and GetNextInstruction(p1,p1) and (p1<>p2) do
  264. if RegModifiedByInstruction(reg,p1) then
  265. begin
  266. Result:=true;
  267. exit;
  268. end;
  269. end;
  270. function TAoptBase.RegLoadedWithNewValue(reg : tregister; hp : tai) : boolean;
  271. begin
  272. result:=false;
  273. internalerror(2016012401);
  274. end;
  275. function TAoptBase.InstructionLoadsFromReg(const reg : TRegister; const hp : tai) : boolean;
  276. begin
  277. { save approximation }
  278. Result:=true;
  279. end;
  280. class function TAOptBase.SuperRegistersEqual(reg1,reg2 : TRegister) : Boolean;{$ifdef USEINLINE}inline;{$endif}
  281. Begin
  282. { Do an optimized version of
  283. Result:=(getregtype(reg1) = getregtype(reg2)) and
  284. (getsupreg(reg1) = getsupreg(Reg2));
  285. as SuperRegistersEqual is used a lot
  286. }
  287. {$ifdef Z80}
  288. { Z80 registers are indexed in an incompatible way (without R_SUBH), so it
  289. needs a special check. }
  290. Result:=super_registers_equal(reg1,reg2);
  291. {$else Z80}
  292. Result:=(DWord(reg1) and $ff00ffff)=(DWord(reg2) and $ff00ffff);
  293. {$endif Z80}
  294. end;
  295. class function TAOptBase.RegistersInterfere(reg1,reg2 : TRegister) : Boolean; static; {$ifdef USEINLINE}inline;{$endif}
  296. begin
  297. {$ifdef Z80}
  298. result:=registers_interfere(reg1,reg2);
  299. {$else Z80}
  300. result:=SuperRegistersEqual(reg1,reg2);
  301. {$endif Z80}
  302. end;
  303. { ******************* Processor dependent stuff *************************** }
  304. Function TAOptBase.RegMaxSize(Reg: TRegister): TRegister;
  305. Begin
  306. RegMaxSize := Reg
  307. End;
  308. Function TAOptBase.RegsSameSize(Reg1, Reg2: TRegister): Boolean;
  309. Begin
  310. RegsSameSize := True
  311. End;
  312. end.