aoptbase.pas 13 KB

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