daopt386.pas 76 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061
  1. {
  2. $Id$
  3. Copyright (c) 1997-98 by the Free Pascal Development Team
  4. This unit contains the data flow analyzer and several helper procedures
  5. and functions.
  6. This program is free software; you can redistribute it and/or modify
  7. it under the terms of the GNU General Public License as published by
  8. the Free Software Foundation; either version 2 of the License, or
  9. (at your option) any later version.
  10. This program is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. GNU General Public License for more details.
  14. You should have received a copy of the GNU General Public License
  15. along with this program; if not, write to the Free Software
  16. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17. ****************************************************************************
  18. }
  19. {$ifDef TP}
  20. {$UnDef JumpAnal}
  21. {$Endif TP}
  22. Unit DAOpt386;
  23. Interface
  24. Uses AAsm, CObjects
  25. {$ifdef i386}
  26. ,i386
  27. {$endif}
  28. ;
  29. Type
  30. TRegArray = Array[R_EAX..R_BL] of TRegister;
  31. TRegSet = Set of R_EAX..R_BL;
  32. TRegInfo = Record
  33. RegsEncountered: TRegSet;
  34. RegsLoadedForRef: TRegSet;
  35. SubstRegs: TRegArray;
  36. End;
  37. {*********************** Procedures and Functions ************************}
  38. Procedure InsertLLItem(AsmL: PAasmOutput; prev, foll, new_one: PLinkedList_Item);
  39. Function Reg32(Reg: TRegister): TRegister;
  40. Function RefsEquivalent(Const R1, R2: TReference; Var RegInfo: TRegInfo): Boolean;
  41. Function RefsEqual(Const R1, R2: TReference): Boolean;
  42. Function IsGP32Reg(Reg: TRegister): Boolean;
  43. Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  44. Function RegInInstruction(Reg: TRegister; p1: Pai): Boolean;
  45. Function RegModifiedByInstruction(Reg: TRegister; p1: Pai): Boolean;
  46. Function GetNextInstruction(Current: Pai; Var Next: Pai): Boolean;
  47. Function GetLastInstruction(Current: Pai; Var Last: Pai): Boolean;
  48. Procedure UpdateUsedRegs(Var UsedRegs: TRegSet; p: Pai);
  49. Function RegsEquivalent(OldReg, NewReg: TRegister; Var RegInfo: TRegInfo): Boolean;
  50. Function InstructionsEquivalent(p1, p2: Pai; Var RegInfo: TRegInfo): Boolean;
  51. Procedure DFAPass1(AsmL: PAasmOutput);
  52. Function DFAPass2(AsmL: PAasmOutput): Pai;
  53. Procedure ShutDownDFA;
  54. Function FindLabel(L: PLabel; Var hp: Pai): Boolean;
  55. {Procedure FindLoHiLabels(AsmL: PAasmOutput; Var LoLab, HiLab, LabDif: Longint);}
  56. {******************************* Constants *******************************}
  57. Const
  58. {ait_* types which don't result in executable code or which don't influence
  59. the way the program runs/behaves}
  60. SkipInstr = [ait_comment, ait_align, ait_symbol
  61. {$ifdef GDB}
  62. ,ait_stabs, ait_stabn, ait_stab_function_name
  63. {$endif GDB}
  64. ,ait_regalloc, ait_regdealloc
  65. ];
  66. {the maximum number of things (registers, memory, ...) a single instruction
  67. changes}
  68. MaxCh = 3;
  69. {Possible register content types}
  70. con_Unknown = 0;
  71. con_ref = 1;
  72. con_const = 2;
  73. {********************************* Types *********************************}
  74. Type
  75. {What an instruction can change}
  76. TChange = (C_None,
  77. {Read from a register}
  78. C_REAX, C_RECX, C_REDX, C_REBX, C_RESP, C_REBP, C_RESI, C_REDI,
  79. {write from a register}
  80. C_WEAX, C_WECX, C_WEDX, C_WEBX, C_WESP, C_WEBP, C_WESI, C_WEDI,
  81. {read and write from/to a register}
  82. C_RWEAX, C_RWECX, C_RWEDX, C_RWEBX, C_RWESP, C_RWEBP, C_RWESI, C_RWEDI,
  83. C_CDirFlag {clear direction flag}, C_SDirFlag {set dir flag},
  84. C_RFlags, C_WFlags, C_RWFlags, C_FPU,
  85. C_ROp1, C_WOp1, C_RWOp1,
  86. C_ROp2, C_WOp2, C_RWOp2,
  87. C_ROp3, C_WOp3, C_RWOp3,
  88. C_MemEDI, C_All);
  89. {the possible states of a flag}
  90. TFlagContents = (F_Unknown, F_NotSet, F_Set);
  91. {the properties of a cpu instruction}
  92. TAsmInstrucProp = Record
  93. {how many things it changes}
  94. { NCh: Byte;}
  95. {and what it changes}
  96. Ch: Array[1..MaxCh] of TChange;
  97. End;
  98. TContent = Record
  99. {start and end of block instructions that defines the
  100. content of this register. If Typ = con_const, then
  101. Longint(StartMod) = value of the constant)}
  102. StartMod: Pointer;
  103. {starts at 0, gets increased everytime the register is modified}
  104. WState: Byte;
  105. {starts at 0, gets increased everytime the register is read from}
  106. RState: Byte;
  107. {how many instructions starting with StarMod does the block consist of}
  108. NrOfMods: Byte;
  109. {if one register gets a block assigned from an other register,
  110. this variable holds the name of that register (so it can be
  111. substituted when checking the block afterwards)}
  112. { ModReg: TRegister; }
  113. {the type of the content of the register: constant, ...}
  114. Typ: Byte;
  115. End;
  116. {Contents of the integer registers}
  117. TRegContent = Array[R_EAX..R_EDI] Of TContent;
  118. {contents of the FPU registers}
  119. TRegFPUContent = Array[R_ST..R_ST7] Of TContent;
  120. {information record with the contents of every register. Every Pai object
  121. gets one of these assigned: a pointer to it is stored in the Line field and
  122. the original line number is stored in LineSave}
  123. TPaiProp = Record
  124. Regs: TRegContent;
  125. { FPURegs: TRegFPUContent;} {currently not yet used}
  126. LineSave: Longint;
  127. {allocated Registers}
  128. UsedRegs: TRegSet;
  129. {status of the direction flag}
  130. DirFlag: TFlagContents;
  131. {can this instruction be removed?}
  132. CanBeRemoved: Boolean;
  133. End;
  134. PPaiProp = ^TPaiProp;
  135. {$IfNDef TP}
  136. TPaiPropBlock = Array[1..250000] Of TPaiProp;
  137. PPaiPropBlock = ^TPaiPropBlock;
  138. {$EndIf TP}
  139. TInstrSinceLastMod = Array[R_EAX..R_EDI] Of Byte;
  140. TLabelTableItem = Record
  141. PaiObj: Pai;
  142. {$IfDef JumpAnal}
  143. InstrNr: Longint;
  144. RefsFound: Word;
  145. JmpsProcessed: Word
  146. {$EndIf JumpAnal}
  147. End;
  148. {$IfDef tp}
  149. TLabelTable = Array[0..10000] Of TLabelTableItem;
  150. {$Else tp}
  151. TLabelTable = Array[0..2500000] Of TLabelTableItem;
  152. {$Endif tp}
  153. PLabelTable = ^TLabelTable;
  154. TwoWords = Record
  155. Word1, Word2: Word;
  156. End;
  157. {******************************* Variables *******************************}
  158. Var
  159. {the amount of PaiObjects in the current assembler list}
  160. NrOfPaiObjs: Longint;
  161. {$IfNDef TP}
  162. {Array which holds all TPaiProps}
  163. PaiPropBlock: PPaiPropBlock;
  164. {$EndIf TP}
  165. LoLab, HiLab, LabDif: Longint;
  166. LTable: PLabelTable;
  167. {*********************** End of Interface section ************************}
  168. Implementation
  169. Uses globals, systems, strings, verbose, hcodegen,
  170. {$ifdef i386}
  171. pass_2;
  172. {$endif i386}
  173. Const AsmInstr: Array[tasmop] Of TAsmInstrucProp = (
  174. {MOV} (Ch: (C_WOp2, C_ROp1, C_None)),
  175. {MOVZX} (Ch: (C_WOp2, C_ROp1, C_None)),
  176. {MOVSX} (Ch: (C_WOp2, C_ROp1, C_None)),
  177. {LABEL} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  178. {ADD} (Ch: (C_RWOp2, C_ROp1, C_WFlags)),
  179. {CALL} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  180. {IDIV} (Ch: (C_RWEAX, C_WEDX, C_WFlags)),
  181. {IMUL} (Ch: (C_RWEAX, C_WEDX, C_WFlags)), {handled separately, because several forms exist}
  182. {JMP} (Ch: (C_None, C_None, C_None)),
  183. {LEA} (Ch: (C_WOp2, C_ROp1, C_None)),
  184. {MUL} (Ch: (C_RWEAX, C_WEDX, C_WFlags)),
  185. {NEG} (Ch: (C_RWOp1, C_None, C_None)),
  186. {NOT} (Ch: (C_RWOp1, C_WFlags, C_None)),
  187. {POP} (Ch: (C_WOp1, C_RWESP, C_None)),
  188. {POPAD} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  189. {PUSH} (Ch: (C_RWESP, C_None, C_None)),
  190. {PUSHAD} (Ch: (C_RWESP, C_None, C_None)),
  191. {RET} (Ch: (C_None, C_None, C_None)),
  192. {SUB} (Ch: (C_RWOp2, C_ROp1, C_WFlags)),
  193. {XCHG} (Ch: (C_RWOp1, C_RWOp2, C_None)), {(will be) handled seperately}
  194. {XOR} (Ch: (C_RWOp2, C_ROp1, C_WFlags)),
  195. {FILD} (Ch: (C_FPU, C_None, C_None)),
  196. {CMP} (Ch: (C_RFlags, C_None, C_None)),
  197. {JZ} (Ch: (C_None, C_None, C_None)),
  198. {INC} (Ch: (C_RWOp1, C_RFlags, C_None)),
  199. {DEC} (Ch: (C_RWOp1, C_WFlags, C_None)),
  200. {SETE} (Ch: (C_WOp1, C_RFlags, C_None)),
  201. {SETNE} (Ch: (C_WOp1, C_RFlags, C_None)),
  202. {SETL} (Ch: (C_WOp1, C_RFlags, C_None)),
  203. {SETG} (Ch: (C_WOp1, C_RFlags, C_None)),
  204. {SETLE} (Ch: (C_WOp1, C_RFlags, C_None)),
  205. {SETGE} (Ch: (C_WOp1, C_RFlags, C_None)),
  206. {JE} (Ch: (C_RFlags, C_None, C_None)),
  207. {JNE} (Ch: (C_RFlags, C_None, C_None)),
  208. {JL} (Ch: (C_RFlags, C_None, C_None)),
  209. {JG} (Ch: (C_RFlags, C_None, C_None)),
  210. {JLE} (Ch: (C_RFlags, C_None, C_None)),
  211. {JGE} (Ch: (C_RFlags, C_None, C_None)),
  212. {OR} (Ch: (C_RWOp2, C_WFlags, C_None)),
  213. {FLD} (Ch: (C_FPU, C_None, C_None)),
  214. {FADD} (Ch: (C_FPU, C_None, C_None)),
  215. {FMUL} (Ch: (C_FPU, C_None, C_None)),
  216. {FSUB} (Ch: (C_FPU, C_None, C_None)),
  217. {FDIV} (Ch: (C_FPU, C_None, C_None)),
  218. {FCHS} (Ch: (C_FPU, C_None, C_None)),
  219. {FLD1} (Ch: (C_FPU, C_None, C_None)),
  220. {FIDIV} (Ch: (C_FPU, C_None, C_None)),
  221. {CLTD} (Ch: (C_WEDX, C_REAX, C_None)),
  222. {JNZ} (Ch: (C_RFlags, C_None, C_None)),
  223. {FSTP} (Ch: (C_WOp1, C_None, C_None)),
  224. {AND} (Ch: (C_RWOp2, C_WFlags, C_None)),
  225. {JNO} (Ch: (C_RFlags, C_None, C_None)),
  226. {NOTH} (Ch: (C_None, C_None, C_None)), {***???***}
  227. {NONE} (Ch: (C_None, C_None, C_None)),
  228. {ENTER} (Ch: (C_RWESP, C_None, C_None)),
  229. {LEAVE} (Ch: (C_RWESP, C_None, C_None)),
  230. {CLD} (Ch: (C_CDirFlag, C_None, C_None)),
  231. {MOVS} (Ch: (C_RWESI, C_RWEDI, C_MemEDI)),
  232. {REP} (Ch: (C_RWECX, C_RFlags, C_None)),
  233. {SHL} (Ch: (C_RWOp2, C_WFlags, C_None)),
  234. {SHR} (Ch: (C_RWOp2, C_WFlags, C_None)),
  235. {BOUND} (Ch: (C_ROp1, C_None, C_None)),
  236. {JNS} (Ch: (C_RFlags, C_None, C_None)),
  237. {JS} (Ch: (C_RFlags, C_None, C_None)),
  238. {JO} (Ch: (C_RFlags, C_None, C_None)),
  239. {SAR} (Ch: (C_RWOp2, C_WFlags, C_None)),
  240. {TEST} (Ch: (C_WFlags, C_ROp1, C_ROp2)),
  241. {FCOM} (Ch: (C_FPU, C_None, C_None)),
  242. {FCOMP} (Ch: (C_FPU, C_None, C_None)),
  243. {FCOMPP} (Ch: (C_FPU, C_None, C_None)),
  244. {FXCH} (Ch: (C_FPU, C_None, C_None)),
  245. {FADDP} (Ch: (C_FPU, C_None, C_None)),
  246. {FMULP} (Ch: (C_FPU, C_None, C_None)),
  247. {FSUBP} (Ch: (C_FPU, C_None, C_None)),
  248. {FDIVP} (Ch: (C_FPU, C_None, C_None)),
  249. {FNSTS} (Ch: (C_WOp1, C_None, C_None)),
  250. {SAHF} (Ch: (C_WFlags, C_REAX, C_None)),
  251. {FDIVRP} (Ch: (C_FPU, C_None, C_None)),
  252. {FSUBRP} (Ch: (C_FPU, C_None, C_None)),
  253. {SETC} (Ch: (C_WOp1, C_RFlags, C_None)),
  254. {SETNC} (Ch: (C_WOp1, C_RFlags, C_None)),
  255. {JC} (Ch: (C_None, C_RFlags, C_None)),
  256. {JNC} (Ch: (C_None, C_RFlags, C_None)),
  257. {JA} (Ch: (C_None, C_RFlags, C_None)),
  258. {JAE} (Ch: (C_None, C_RFlags, C_None)),
  259. {JB} (Ch: (C_None, C_RFlags, C_None)),
  260. {JBE} (Ch: (C_None, C_RFlags, C_None)),
  261. {SETA} (Ch: (C_WOp1, C_RFlags, C_None)),
  262. {SETAE} (Ch: (C_WOp1, C_RFlags, C_None)),
  263. {SETB} (Ch: (C_WOp1, C_RFlags, C_None)),
  264. {SETBE} (Ch: (C_WOp1, C_RFlags, C_None)),
  265. {AAA} (Ch: (C_RWEAX, C_WFlags, C_None)),
  266. {AAD} (Ch: (C_RWEAX, C_WFlags, C_None)),
  267. {AAM} (Ch: (C_RWEAX, C_WFlags, C_None)),
  268. {AAS} (Ch: (C_RWEAX, C_WFlags, C_None)),
  269. {CBW} (Ch: (C_RWEAX, C_None, C_None)),
  270. {CDQ} (Ch: (C_RWEAX, C_WEDX, C_None)),
  271. {CLC} (Ch: (C_WFlags, C_None, C_None)),
  272. {CLI} (Ch: (C_WFlags, C_None, C_None)),
  273. {CLTS} (Ch: (C_None, C_None, C_None)),
  274. {CMC} (Ch: (C_WFlags, C_None, C_None)),
  275. {CWD} (Ch: (C_RWEAX, C_WEDX, C_None)),
  276. {CWDE} (Ch: (C_RWEAX, C_None, C_None)),
  277. {DAA} (Ch: (C_RWEAX, C_None, C_None)),
  278. {DAS} (Ch: (C_RWEAX, C_None, C_None)),
  279. {HLT} (Ch: (C_None, C_None, C_None)),
  280. {IRET} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  281. {LAHF} (Ch: (C_WEAX, C_None, C_None)),
  282. {LODS} (Ch: (C_WEAX, C_RWESI, C_None)),
  283. {LOCK} (Ch: (C_None, C_None, C_None)),
  284. {NOP} (Ch: (C_None, C_None, C_None)),
  285. {PUSHA} (Ch: (C_RWESP, C_None, C_None)),
  286. {PUSHF} (Ch: (C_RWESP, C_None, C_None)),
  287. {PUSHFD} (Ch: (C_RWESP, C_None, C_None)),
  288. {STC} (Ch: (C_WFlags, C_None, C_None)),
  289. {STD} (Ch: (C_SDirFlag, C_None, C_None)),
  290. {STI} (Ch: (C_WFlags, C_None, C_None)),
  291. {STOS} (Ch: (C_MemEDI, C_RWEDI, C_None)),
  292. {WAIT} (Ch: (C_None, C_None, C_None)),
  293. {XLAT} (Ch: (C_WEAX, C_None, C_None)),
  294. {XLATB} (Ch: (C_WEAX, C_None, C_None)),
  295. {MOVSB} (Ch: (C_WOp2, C_ROp1, C_None)),
  296. {MOVSBL} (Ch: (C_WOp2, C_ROp1, C_None)),
  297. {MOVSBW} (Ch: (C_WOp2, C_ROp1, C_None)),
  298. {MOVSWL} (Ch: (C_WOp2, C_ROp1, C_None)),
  299. {MOVZB} (Ch: (C_WOp2, C_ROp1, C_None)),
  300. {MOVZWL} (Ch: (C_WOp2, C_ROp1, C_None)),
  301. {POPA} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  302. {IN} (Ch: (C_WOp2, C_ROp1, C_None)),
  303. {OUT} (Ch: (C_ROp1, C_ROp2, C_None)),
  304. {LDS} (Ch: (C_WOp2, C_None, C_None)),
  305. {LCS} (Ch: (C_WOp2, C_None, C_None)),
  306. {LES} (Ch: (C_WOp2, C_None, C_None)),
  307. {LFS} (Ch: (C_WOp2, C_None, C_None)),
  308. {LGS} (Ch: (C_WOp2, C_None, C_None)),
  309. {LSS} (Ch: (C_WOp2, C_None, C_None)),
  310. {POPF} (Ch: (C_RWESP, C_WFlags, C_None)),
  311. {SBB} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  312. {ADC} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  313. {DIV} (Ch: (C_RWEAX, C_WEDX, C_WFlags)),
  314. {ROR} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  315. {ROL} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  316. {RCL} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  317. {RCR} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  318. {SAL} (Ch: (C_RWOp2, C_ROp1, C_RWFlags)),
  319. {SHLD} (Ch: (C_RWOp3, C_RWFlags, C_ROp2)),
  320. {SHRD} (Ch: (C_RWOp3, C_RWFlags, C_ROp1)),
  321. {LCALL} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  322. {LJMP} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  323. {LRET} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  324. {JNAE} (Ch: (C_RFlags, C_None, C_None)),
  325. {JNB} (Ch: (C_RFlags, C_None, C_None)),
  326. {JNA} (Ch: (C_RFlags, C_None, C_None)),
  327. {JNBE} (Ch: (C_RFlags, C_None, C_None)),
  328. {JP} (Ch: (C_RFlags, C_None, C_None)),
  329. {JNP} (Ch: (C_RFlags, C_None, C_None)),
  330. {JPE} (Ch: (C_RFlags, C_None, C_None)),
  331. {JPO} (Ch: (C_RFlags, C_None, C_None)),
  332. {JNGE} (Ch: (C_RFlags, C_None, C_None)),
  333. {JNG} (Ch: (C_RFlags, C_None, C_None)),
  334. {JNL} (Ch: (C_RFlags, C_None, C_None)),
  335. {JNLE} (Ch: (C_RFlags, C_None, C_None)),
  336. {JCXZ} (Ch: (C_RECX, C_None, C_None)),
  337. {JECXZ} (Ch: (C_RECX, C_None, C_None)),
  338. {LOOP} (Ch: (C_RWECX, C_None, C_None)),
  339. {CMPS} (Ch: (C_RWESI, C_RWEDI, C_WFlags)),
  340. {INS} (Ch: (C_RWEDI, C_MemEDI, C_None)),
  341. {OUTS} (Ch: (C_RWESI, C_None, C_None)),
  342. {SCAS} (Ch: (C_RWEDI, C_WFlags, C_None)),
  343. {BSF} (Ch: (C_WOp2, C_WFlags, C_ROp1)),
  344. {BSR} (Ch: (C_WOp2, C_WFlags, C_ROp1)),
  345. {BT} (Ch: (C_WFlags, C_ROp1, C_None)),
  346. {BTC} (Ch: (C_RWOp2, C_ROp1, C_WFlags)),
  347. {BTR} (Ch: (C_RWOp2, C_ROp1, C_WFlags)),
  348. {BTS} (Ch: (C_RWOp2, C_ROp1, C_WFlags)),
  349. {INT} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  350. {INT3} (Ch: (C_None, C_None, C_None)),
  351. {INTO} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  352. {BOUNDL} (Ch: (C_ROp1, C_None, C_None)),
  353. {BOUNDW} (Ch: (C_ROp1, C_None, C_None)),
  354. {LOOPZ} (Ch: (C_RWECX, C_RFlags, C_None)),
  355. {LOOPE} (Ch: (C_RWECX, C_RFlags, C_None)),
  356. {LOOPNZ} (Ch: (C_RWECX, C_RFlags, C_None)),
  357. {LOOPNE} (Ch: (C_RWECX, C_RFlags, C_None)),
  358. {SETO} (Ch: (C_WOp1, C_RFlags, C_None)),
  359. {SETNO} (Ch: (C_WOp1, C_RFlags, C_None)),
  360. {SETNAE} (Ch: (C_WOp1, C_RFlags, C_None)),
  361. {SETNB} (Ch: (C_WOp1, C_RFlags, C_None)),
  362. {SETZ} (Ch: (C_WOp1, C_RFlags, C_None)),
  363. {SETNZ} (Ch: (C_WOp1, C_RFlags, C_None)),
  364. {SETNA} (Ch: (C_WOp1, C_RFlags, C_None)),
  365. {SETNBE} (Ch: (C_WOp1, C_RFlags, C_None)),
  366. {SETS} (Ch: (C_WOp1, C_RFlags, C_None)),
  367. {SETNS} (Ch: (C_WOp1, C_RFlags, C_None)),
  368. {SETP} (Ch: (C_WOp1, C_RFlags, C_None)),
  369. {SETPE} (Ch: (C_WOp1, C_RFlags, C_None)),
  370. {SETNP} (Ch: (C_WOp1, C_RFlags, C_None)),
  371. {SETPO} (Ch: (C_WOp1, C_RFlags, C_None)),
  372. {SETNGE} (Ch: (C_WOp1, C_RFlags, C_None)),
  373. {SETNL} (Ch: (C_WOp1, C_RFlags, C_None)),
  374. {SETNG} (Ch: (C_WOp1, C_RFlags, C_None)),
  375. {SETNLE} (Ch: (C_WOp1, C_RFlags, C_None)),
  376. {ARPL} (Ch: (C_WFlags, C_None, C_None)),
  377. {LAR} (Ch: (C_WOp2, C_None, C_None)),
  378. {LGDT} (Ch: (C_None, C_None, C_None)),
  379. {LIDT} (Ch: (C_None, C_None, C_None)),
  380. {LLDT} (Ch: (C_None, C_None, C_None)),
  381. {LMSW} (Ch: (C_None, C_None, C_None)),
  382. {LSL} (Ch: (C_WOp2, C_WFlags, C_None)),
  383. {LTR} (Ch: (C_None, C_None, C_None)),
  384. {SGDT} (Ch: (C_WOp1, C_None, C_None)),
  385. {SIDT} (Ch: (C_WOp1, C_None, C_None)),
  386. {SLDT} (Ch: (C_WOp1, C_None, C_None)),
  387. {SMSW} (Ch: (C_WOp1, C_None, C_None)),
  388. {STR} (Ch: (C_WOp1, C_None, C_None)),
  389. {VERR} (Ch: (C_WFlags, C_None, C_None)),
  390. {VERW} (Ch: (C_WFlags, C_None, C_None)),
  391. {FABS} (Ch: (C_FPU, C_None, C_None)),
  392. {FBLD} (Ch: (C_FPU, C_None, C_None)),
  393. {FBSTP} (Ch: (C_WOp1, C_None, C_None)),
  394. {FCLEX} (Ch: (C_FPU, C_None, C_None)),
  395. {FNCLEX} (Ch: (C_FPU, C_None, C_None)),
  396. {FCOS} (Ch: (C_FPU, C_None, C_None)),
  397. {FDECSTP}(Ch: (C_FPU, C_None, C_None)),
  398. {FDISI} (Ch: (C_FPU, C_None, C_None)),
  399. {FNDISI} (Ch: (C_FPU, C_None, C_None)),
  400. {FDIVR} (Ch: (C_FPU, C_None, C_None)),
  401. {FENI} (Ch: (C_FPU, C_None, C_None)),
  402. {FNENI} (Ch: (C_FPU, C_None, C_None)),
  403. {FFREE} (Ch: (C_FPU, C_None, C_None)),
  404. {FIADD} (Ch: (C_FPU, C_None, C_None)),
  405. {FICOM} (Ch: (C_FPU, C_None, C_None)),
  406. {FICOMP} (Ch: (C_FPU, C_None, C_None)),
  407. {FIDIVR} (Ch: (C_FPU, C_None, C_None)),
  408. {FIMUL} (Ch: (C_FPU, C_None, C_None)),
  409. {FINCSTP}(Ch: (C_FPU, C_None, C_None)),
  410. {FINIT} (Ch: (C_FPU, C_None, C_None)),
  411. {FNINIT} (Ch: (C_FPU, C_None, C_None)),
  412. {FIST} (Ch: (C_WOp1, C_None, C_None)),
  413. {FISTP} (Ch: (C_WOp1, C_None, C_None)),
  414. {FISUB} (Ch: (C_FPU, C_None, C_None)),
  415. {FSUBR} (Ch: (C_FPU, C_None, C_None)),
  416. {FLDCW} (Ch: (C_FPU, C_None, C_None)),
  417. {FLDENV} (Ch: (C_FPU, C_None, C_None)),
  418. {FLDLG2} (Ch: (C_FPU, C_None, C_None)),
  419. {FLDLN2} (Ch: (C_FPU, C_None, C_None)),
  420. {FLDL2E} (Ch: (C_FPU, C_None, C_None)),
  421. {FLDL2T} (Ch: (C_FPU, C_None, C_None)),
  422. {FLDPI} (Ch: (C_FPU, C_None, C_None)),
  423. {FLDS} (Ch: (C_FPU, C_None, C_None)),
  424. {FLDZ} (Ch: (C_FPU, C_None, C_None)),
  425. {FNOP} (Ch: (C_FPU, C_None, C_None)),
  426. {FPATAN} (Ch: (C_FPU, C_None, C_None)),
  427. {FPREM} (Ch: (C_FPU, C_None, C_None)),
  428. {FPREM1} (Ch: (C_FPU, C_None, C_None)),
  429. {FPTAN} (Ch: (C_FPU, C_None, C_None)),
  430. {FRNDINT}(Ch: (C_FPU, C_None, C_None)),
  431. {FRSTOR} (Ch: (C_FPU, C_None, C_None)),
  432. {FSAVE} (Ch: (C_WOp1, C_None, C_None)),
  433. {FNSAVE} (Ch: (C_FPU, C_None, C_None)),
  434. {FSCALE} (Ch: (C_FPU, C_None, C_None)),
  435. {FSETPM} (Ch: (C_FPU, C_None, C_None)),
  436. {FSIN} (Ch: (C_FPU, C_None, C_None)),
  437. {FSINCOS}(Ch: (C_FPU, C_None, C_None)),
  438. {FSQRT} (Ch: (C_FPU, C_None, C_None)),
  439. {FST} (Ch: (C_WOp1, C_None, C_None)),
  440. {FSTCW} (Ch: (C_WOp1, C_None, C_None)),
  441. {FNSTCW} (Ch: (C_WOp1, C_None, C_None)),
  442. {FSTENV} (Ch: (C_WOp1, C_None, C_None)),
  443. {FNSTENV}(Ch: (C_WOp1, C_None, C_None)),
  444. {FSTSW} (Ch: (C_WOp1, C_None, C_None)),
  445. {FNSTSW} (Ch: (C_WOp1, C_None, C_None)),
  446. {FTST} (Ch: (C_FPU, C_None, C_None)),
  447. {FUCOM} (Ch: (C_FPU, C_None, C_None)),
  448. {FUCOMP} (Ch: (C_FPU, C_None, C_None)),
  449. {FUCOMPP}(Ch: (C_FPU, C_None, C_None)),
  450. {FWAIT} (Ch: (C_FPU, C_None, C_None)),
  451. {FXAM} (Ch: (C_FPU, C_None, C_None)),
  452. {FXTRACT}(Ch: (C_FPU, C_None, C_None)),
  453. {FYL2X} (Ch: (C_FPU, C_None, C_None)),
  454. {FYL2XP1}(Ch: (C_FPU, C_None, C_None)),
  455. {F2XM1} (Ch: (C_FPU, C_None, C_None)),
  456. {FILDQ} (Ch: (C_FPU, C_None, C_None)),
  457. {FILDS} (Ch: (C_FPU, C_None, C_None)),
  458. {FILDL} (Ch: (C_FPU, C_None, C_None)),
  459. {FLDL} (Ch: (C_FPU, C_None, C_None)),
  460. {FLDT} (Ch: (C_FPU, C_None, C_None)),
  461. {FISTQ} (Ch: (C_WOp1, C_None, C_None)),
  462. {FISTS} (Ch: (C_WOp1, C_None, C_None)),
  463. {FISTL} (Ch: (C_WOp1, C_None, C_None)),
  464. {FSTL} (Ch: (C_WOp1, C_None, C_None)),
  465. {FSTS} (Ch: (C_WOp1, C_None, C_None)),
  466. {FSTPS} (Ch: (C_WOp1, C_None, C_None)),
  467. {FISTPL} (Ch: (C_WOp1, C_None, C_None)),
  468. {FSTPL} (Ch: (C_WOp1, C_None, C_None)),
  469. {FISTPS} (Ch: (C_WOp1, C_None, C_None)),
  470. {FISTPQ} (Ch: (C_WOp1, C_None, C_None)),
  471. {FSTPT} (Ch: (C_WOp1, C_None, C_None)),
  472. {FCOMPS} (Ch: (C_FPU, C_None, C_None)),
  473. {FICOMPL}(Ch: (C_FPU, C_None, C_None)),
  474. {FCOMPL} (Ch: (C_FPU, C_None, C_None)),
  475. {FICOMPS}(Ch: (C_FPU, C_None, C_None)),
  476. {FCOMS} (Ch: (C_FPU, C_None, C_None)),
  477. {FICOML} (Ch: (C_FPU, C_None, C_None)),
  478. {FCOML} (Ch: (C_FPU, C_None, C_None)),
  479. {FICOMS} (Ch: (C_FPU, C_None, C_None)),
  480. {FIADDL} (Ch: (C_FPU, C_None, C_None)),
  481. {FADDL} (Ch: (C_FPU, C_None, C_None)),
  482. {FIADDS} (Ch: (C_FPU, C_None, C_None)),
  483. {FISUBL} (Ch: (C_FPU, C_None, C_None)),
  484. {FSUBL} (Ch: (C_FPU, C_None, C_None)),
  485. {FISUBS} (Ch: (C_FPU, C_None, C_None)),
  486. {FSUBS} (Ch: (C_FPU, C_None, C_None)),
  487. {FSUBR} (Ch: (C_FPU, C_None, C_None)),
  488. {FSUBRS} (Ch: (C_FPU, C_None, C_None)),
  489. {FISUBRL}(Ch: (C_FPU, C_None, C_None)),
  490. {FSUBRL} (Ch: (C_FPU, C_None, C_None)),
  491. {FISUBRS}(Ch: (C_FPU, C_None, C_None)),
  492. {FMULS} (Ch: (C_FPU, C_None, C_None)),
  493. {FIMUL} (Ch: (C_FPU, C_None, C_None)),
  494. {FMULL} (Ch: (C_FPU, C_None, C_None)),
  495. {FIMULS} (Ch: (C_FPU, C_None, C_None)),
  496. {FIDIVS} (Ch: (C_FPU, C_None, C_None)),
  497. {FIDIVL} (Ch: (C_FPU, C_None, C_None)),
  498. {FDIVL} (Ch: (C_FPU, C_None, C_None)),
  499. {FIDIVS} (Ch: (C_FPU, C_None, C_None)),
  500. {FDIVRS} (Ch: (C_FPU, C_None, C_None)),
  501. {FIDIVRL}(Ch: (C_FPU, C_None, C_None)),
  502. {FDIVRL} (Ch: (C_FPU, C_None, C_None)),
  503. {FIDIVRS}(Ch: (C_FPU, C_None, C_None)),
  504. {REPE} (Ch: (C_RWECX, C_RFlags, C_None)),
  505. {REPNE} (Ch: (C_RWECX, C_RFlags, C_None)),
  506. {FADDS} (Ch: (C_FPU, C_None, C_None)),
  507. {POPFD} (Ch: (C_RWESP, C_WFlags, C_None)),
  508. {below are the MMX instructions}
  509. {A_EMMS} (Ch: (C_FPU, C_None, C_None)),
  510. {A_MOVD} (Ch: (C_WOp2, C_None, C_None)),
  511. {A_MOVQ} (Ch: (C_WOp2, C_None, C_None)),
  512. {A_PACKSSDW} (Ch: (C_All, C_None, C_None)),
  513. {A_PACKSSWB} (Ch: (C_All, C_None, C_None)),
  514. {A_PACKUSWB} (Ch: (C_All, C_None, C_None)),
  515. {A_PADDB} (Ch: (C_RWOp2, C_None, C_None)),
  516. {A_PADDD} (Ch: (C_RWOp2, C_None, C_None)),
  517. {A_PADDSB} (Ch: (C_RWOp2, C_None, C_None)),
  518. {A_PADDSW} (Ch: (C_RWOp2, C_None, C_None)),
  519. {A_PADDUSB} (Ch: (C_RWOp2, C_None, C_None)),
  520. {A_PADDUSW} (Ch: (C_RWOp2, C_None, C_None)),
  521. {A_PADDW} (Ch: (C_RWOp2, C_None, C_None)),
  522. {A_PAND} (Ch: (C_RWOp2, C_None, C_None)),
  523. {A_PANDN} (Ch: (C_RWOp2, C_None, C_None)),
  524. {A_PCMPEQB} (Ch: (C_All, C_None, C_None)),
  525. {A_PCMPEQD} (Ch: (C_All, C_None, C_None)),
  526. {A_PCMPEQW} (Ch: (C_All, C_None, C_None)),
  527. {A_PCMPGTB} (Ch: (C_All, C_None, C_None)),
  528. {A_PCMPGTD} (Ch: (C_All, C_None, C_None)),
  529. {A_PCMPGTW} (Ch: (C_All, C_None, C_None)),
  530. {A_PMADDWD} (Ch: (C_RWOp2, C_None, C_None)),
  531. {A_PMULHW} (Ch: (C_All, C_None, C_None)),
  532. {A_PMULLW} (Ch: (C_All, C_None, C_None)),
  533. {A_POR} (Ch: (C_RWOp2, C_None, C_None)),
  534. {A_PSLLD} (Ch: (C_RWOp2, C_None, C_None)),
  535. {A_PSLLQ} (Ch: (C_RWOp2, C_None, C_None)),
  536. {A_PSLLW} (Ch: (C_RWOp2, C_None, C_None)),
  537. {A_PSRAD} (Ch: (C_RWOp2, C_None, C_None)),
  538. {A_PSRAW} (Ch: (C_RWOp2, C_None, C_None)),
  539. {A_PSRLD} (Ch: (C_RWOp2, C_None, C_None)),
  540. {A_PSRLQ} (Ch: (C_RWOp2, C_None, C_None)),
  541. {A_PSRLW} (Ch: (C_RWOp2, C_None, C_None)),
  542. {A_PSUBB} (Ch: (C_RWOp2, C_None, C_None)),
  543. {A_PSUBD} (Ch: (C_RWOp2, C_None, C_None)),
  544. {A_PSUBSB} (Ch: (C_RWOp2, C_None, C_None)),
  545. {A_PSUBSW} (Ch: (C_RWOp2, C_None, C_None)),
  546. {A_PSUBUSB} (Ch: (C_RWOp2, C_None, C_None)),
  547. {A_PSUBUSW} (Ch: (C_RWOp2, C_None, C_None)),
  548. {A_PSUBW} (Ch: (C_RWOp2, C_None, C_None)),
  549. {A_PUNPCKHBW} (Ch: (C_All, C_None, C_None)),
  550. {A_PUNPCKHDQ} (Ch: (C_All, C_None, C_None)),
  551. {A_PUNPCKHWD} (Ch: (C_All, C_None, C_None)),
  552. {A_PUNPCKLBW} (Ch: (C_All, C_None, C_None)),
  553. {A_PUNPCKLDQ} (Ch: (C_All, C_None, C_None)),
  554. {A_PUNPCKLWD} (Ch: (C_All, C_None, C_None)),
  555. {A_PXOR} (Ch: (C_RWOp2, C_None, C_None)));
  556. Var
  557. {How many instructions are between the current instruction and the last one
  558. that modified the register}
  559. NrOfInstrSinceLastMod: TInstrSinceLastMod;
  560. {************************ Create the Label table ************************}
  561. Procedure FindLoHiLabels(AsmL: PAasmOutput; Var LowLabel, HighLabel, LabelDif: Longint);
  562. {Walks through the paasmlist to find the lowest and highest label number;
  563. Since 0.9.3: also removes unused labels}
  564. Var LabelFound: Boolean;
  565. P{, hp1}: Pai;
  566. Begin
  567. LabelFound := False;
  568. LowLabel := MaxLongint;
  569. HighLabel := 0;
  570. P := Pai(AsmL^.first);
  571. While Assigned(p) Do
  572. Begin
  573. If (Pai(p)^.typ = ait_label) Then
  574. If (Pai_Label(p)^.l^.is_used)
  575. Then
  576. Begin
  577. LabelFound := True;
  578. If (Pai_Label(p)^.l^.nb < LowLabel) Then
  579. LowLabel := Pai_Label(p)^.l^.nb;
  580. If (Pai_Label(p)^.l^.nb > HighLabel) Then
  581. HighLabel := Pai_Label(p)^.l^.nb;
  582. End
  583. { Else
  584. Begin
  585. hp1 := pai(p^.next);
  586. AsmL^.Remove(p);
  587. Dispose(p, Done);
  588. p := hp1;
  589. continue;
  590. End};
  591. GetNextInstruction(p, p);
  592. End;
  593. If LabelFound
  594. Then LabelDif := HighLabel+1-LowLabel
  595. Else LabelDif := 0;
  596. End;
  597. Function FindRegAlloc(Reg: TRegister; StartPai: Pai): Boolean;
  598. {Returns true if a ait_regalloc object for Reg is found in the block of Pai's
  599. starting with StartPai and ending with the next "real" instruction}
  600. Var TmpResult: Boolean;
  601. Begin
  602. TmpResult := False;
  603. Repeat
  604. While Assigned(StartPai) And
  605. ((StartPai^.typ in (SkipInstr - [ait_RegAlloc])) Or
  606. ((StartPai^.typ = ait_label) and
  607. Not(Pai_Label(StartPai)^.l^.Is_Used))) Do
  608. StartPai := Pai(StartPai^.Next);
  609. If Assigned(StartPai) And
  610. (StartPai^.typ = ait_RegAlloc) Then
  611. Begin
  612. TmpResult := (PaiRegAlloc(StartPai)^.Reg = Reg);
  613. StartPai := Pai(StartPai^.Next);
  614. End;
  615. Until Not(Assigned(StartPai)) Or
  616. Not(StartPai^.typ in SkipInstr) or TmpResult;
  617. FindRegAlloc := TmpResult;
  618. End;
  619. Procedure BuildLabelTableAndFixRegAlloc(AsmL: PAasmOutput; Var LabelTable: PLabelTable; LowLabel: Longint;
  620. Var LabelDif: Longint);
  621. {Builds a table with the locations of the labels in the paasmoutput.
  622. Also fixes some RegDeallocs like "# %eax released; push (%eax)"}
  623. Var p, hp1, hp2: Pai;
  624. UsedRegs: TRegSet;
  625. Begin
  626. UsedRegs := [];
  627. If (LabelDif <> 0) Then
  628. Begin
  629. {$IfDef TP}
  630. If (MaxAvail >= LabelDif*SizeOf(Pai))
  631. Then
  632. Begin
  633. {$EndIf TP}
  634. GetMem(LabelTable, LabelDif*SizeOf(TLabelTableItem));
  635. FillChar(LabelTable^, LabelDif*SizeOf(TLabelTableItem), 0);
  636. p := pai(AsmL^.first);
  637. While Assigned(p) Do
  638. Begin
  639. Case p^.typ Of
  640. ait_Label:
  641. If Pai_Label(p)^.l^.is_used Then
  642. LabelTable^[Pai_Label(p)^.l^.nb-LowLabel].PaiObj := p;
  643. ait_RegAlloc:
  644. Begin
  645. If Not(PaiRegAlloc(p)^.Reg in UsedRegs) Then
  646. UsedRegs := UsedRegs + [PaiRegAlloc(p)^.Reg]
  647. Else
  648. Begin
  649. hp1 := p;
  650. hp2 := nil;
  651. While GetLastInstruction(hp1, hp1) And
  652. Not(RegInInstruction(PaiRegAlloc(p)^.Reg, hp1)) Do
  653. hp2 := hp1;
  654. If hp2 <> nil Then
  655. Begin
  656. hp1 := New(PaiRegDeAlloc, Init(PaiRegAlloc(p)^.Reg));
  657. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp1);
  658. End;
  659. End;
  660. End;
  661. ait_RegDeAlloc:
  662. Begin
  663. UsedRegs := UsedRegs - [PaiRegDeAlloc(p)^.Reg];
  664. hp1 := p;
  665. hp2 := nil;
  666. While Not(FindRegAlloc(PaiRegDeAlloc(p)^.Reg, Pai(hp1^.Next))) And
  667. GetNextInstruction(hp1, hp1) And
  668. RegInInstruction(PaiRegDeAlloc(p)^.Reg, hp1) Do
  669. hp2 := hp1;
  670. If hp2 <> nil Then
  671. Begin
  672. hp1 := Pai(p^.previous);
  673. AsmL^.Remove(p);
  674. InsertLLItem(AsmL, hp2, Pai(hp2^.Next), p);
  675. p := hp1;
  676. End;
  677. End;
  678. End;
  679. P := Pai(p^.Next);
  680. While Assigned(p) And
  681. (p^.typ in (SkipInstr - [ait_regdealloc,ait_regalloc])) Do
  682. P := Pai(P^.Next);
  683. End;
  684. {$IfDef TP}
  685. End
  686. Else LabelDif := 0;
  687. {$EndIf TP}
  688. End;
  689. End;
  690. {************************ Search the Label table ************************}
  691. Function FindLabel(L: PLabel; Var hp: Pai): Boolean;
  692. {searches for the specified label starting from hp as long as the
  693. encountered instructions are labels, to be able to optimize constructs like
  694. jne l2 jmp l2
  695. jmp l3 and l1:
  696. l1: l2:
  697. l2:}
  698. Var TempP: Pai;
  699. Begin
  700. TempP := hp;
  701. While Assigned(TempP) and
  702. (TempP^.typ In SkipInstr + [ait_label]) Do
  703. If (TempP^.typ <> ait_Label) Or
  704. (pai_label(TempP)^.l <> L)
  705. Then GetNextInstruction(TempP, TempP)
  706. Else
  707. Begin
  708. hp := TempP;
  709. FindLabel := True;
  710. exit
  711. End;
  712. FindLabel := False;
  713. End;
  714. {************************ Some general functions ************************}
  715. Function Reg32(Reg: TRegister): TRegister;
  716. {Returns the 32 bit component of Reg if it exists, otherwise Reg is returned}
  717. Begin
  718. Reg32 := Reg;
  719. If (Reg >= R_AX)
  720. Then
  721. If (Reg <= R_DI)
  722. Then Reg32 := Reg16ToReg32(Reg)
  723. Else
  724. If (Reg <= R_BL)
  725. Then Reg32 := Reg8toReg32(Reg);
  726. End;
  727. { inserts new_one between prev and foll }
  728. Procedure InsertLLItem(AsmL: PAasmOutput; prev, foll, new_one: PLinkedList_Item);
  729. Begin
  730. If Assigned(prev) Then
  731. If Assigned(foll) Then
  732. Begin
  733. If Assigned(new_one) Then
  734. Begin
  735. new_one^.previous := prev;
  736. new_one^.next := foll;
  737. prev^.next := new_one;
  738. foll^.previous := new_one;
  739. End;
  740. End
  741. Else AsmL^.Concat(new_one)
  742. Else If Assigned(Foll) Then AsmL^.Insert(new_one)
  743. End;
  744. {********************* Compare parts of Pai objects *********************}
  745. Function RegsSameSize(Reg1, Reg2: TRegister): Boolean;
  746. {returns true if Reg1 and Reg2 are of the same size (so if they're both
  747. 8bit, 16bit or 32bit)}
  748. Begin
  749. If (Reg1 <= R_EDI)
  750. Then RegsSameSize := (Reg2 <= R_EDI)
  751. Else
  752. If (Reg1 <= R_DI)
  753. Then RegsSameSize := (Reg2 in [R_AX..R_DI])
  754. Else
  755. If (Reg1 <= R_BL)
  756. Then RegsSameSize := (Reg2 in [R_AL..R_BL])
  757. Else RegsSameSize := False
  758. End;
  759. Procedure AddReg2RegInfo(OldReg, NewReg: TRegister; Var RegInfo: TRegInfo);
  760. {updates the RegsEncountered and SubstRegs fields of RegInfo. Assumes that
  761. OldReg and NewReg have the same size (has to be chcked in advance with
  762. RegsSameSize) and that neither equals R_NO}
  763. Begin
  764. With RegInfo Do
  765. Begin
  766. RegsEncountered := RegsEncountered + [NewReg];
  767. SubstRegs[NewReg] := OldReg;
  768. Case OldReg Of
  769. R_EAX..R_EDI:
  770. Begin
  771. RegsEncountered := RegsEncountered + [Reg32toReg16(NewReg)];
  772. SubstRegs[Reg32toReg16(NewReg)] := Reg32toReg16(OldReg);
  773. If (NewReg in [R_EAX..R_EBX]) And
  774. (OldReg in [R_EAX..R_EBX]) Then
  775. Begin
  776. RegsEncountered := RegsEncountered + [Reg32toReg8(NewReg)];
  777. SubstRegs[Reg32toReg8(NewReg)] := Reg32toReg8(OldReg);
  778. End;
  779. End;
  780. R_AX..R_DI:
  781. Begin
  782. RegsEncountered := RegsEncountered + [Reg16toReg32(NewReg)];
  783. SubstRegs[Reg16toReg32(NewReg)] := Reg16toReg32(OldReg);
  784. If (NewReg in [R_AX..R_BX]) And
  785. (OldReg in [R_AX..R_BX]) Then
  786. Begin
  787. RegsEncountered := RegsEncountered + [Reg16toReg8(NewReg)];
  788. SubstRegs[Reg16toReg8(NewReg)] := Reg16toReg8(OldReg);
  789. End;
  790. End;
  791. R_AL..R_BL:
  792. Begin
  793. RegsEncountered := RegsEncountered + [Reg8toReg32(NewReg)]
  794. + [Reg8toReg16(NewReg)];
  795. SubstRegs[Reg8toReg32(NewReg)] := Reg8toReg32(OldReg);
  796. SubstRegs[Reg8toReg16(NewReg)] := Reg8toReg16(OldReg);
  797. End;
  798. End;
  799. End;
  800. End;
  801. Procedure AddOp2RegInfo(typ: Longint; Op: Pointer; Var RegInfo: TRegInfo);
  802. Begin
  803. Case typ Of
  804. Top_Reg:
  805. If (TRegister(op) <> R_NO) Then
  806. AddReg2RegInfo(TRegister(op), TRegister(op), RegInfo);
  807. Top_Ref:
  808. Begin
  809. If TReference(op^).base <> R_NO Then
  810. AddReg2RegInfo(TReference(op^).base, TReference(op^).base, RegInfo);
  811. If TReference(op^).index <> R_NO Then
  812. AddReg2RegInfo(TReference(op^).index, TReference(op^).index, RegInfo);
  813. End;
  814. End;
  815. End;
  816. Function RegsEquivalent(OldReg, NewReg: TRegister; Var RegInfo: TRegInfo): Boolean;
  817. Begin
  818. If Not((OldReg = R_NO) Or (NewReg = R_NO)) Then
  819. If RegsSameSize(OldReg, NewReg) Then
  820. With RegInfo Do
  821. {here we always check for the 32 bit component, because it is possible that
  822. the 8 bit component has not been set, event though NewReg already has been
  823. processed. This happens if it has been compared with a register that doesn't
  824. have an 8 bit component (such as EDI). In that case the 8 bit component is
  825. still set to R_NO and the comparison in the Else-part will fail}
  826. If Not(Reg32(NewReg) in RegsEncountered) Then
  827. Begin
  828. AddReg2RegInfo(OldReg, NewReg, RegInfo);
  829. RegsEquivalent := True
  830. End
  831. Else RegsEquivalent := OldReg = SubstRegs[NewReg]
  832. Else RegsEquivalent := False
  833. Else RegsEquivalent := OldReg = NewReg
  834. End;
  835. Function RefsEquivalent(Const R1, R2: TReference; var RegInfo: TRegInfo): Boolean;
  836. Begin
  837. If R1.IsIntValue
  838. Then RefsEquivalent := R2.IsIntValue and (R1.Offset = R2.Offset)
  839. Else If (R1.Offset = R2.Offset) And
  840. RegsEquivalent(R1.Base, R2.Base, RegInfo) And
  841. RegsEquivalent(R1.Index, R2.Index, RegInfo) And
  842. (R1.Segment = R2.Segment) And (R1.ScaleFactor = R2.ScaleFactor)
  843. Then
  844. Begin
  845. If Assigned(R1.Symbol)
  846. Then RefsEquivalent := Assigned(R2.Symbol) And (R1.Symbol^=R2.Symbol^)
  847. Else RefsEquivalent := Not(Assigned(R2.Symbol));
  848. End
  849. Else RefsEquivalent := False;
  850. End;
  851. Function RefsEqual(Const R1, R2: TReference): Boolean;
  852. Begin
  853. If R1.IsIntValue
  854. Then RefsEqual := R2.IsIntValue and (R1.Offset = R2.Offset)
  855. Else If (R1.Offset = R2.Offset) And (R1.Base = R2.Base) And
  856. (R1.Index = R2.Index) And (R1.Segment = R2.Segment) And
  857. (R1.ScaleFactor = R2.ScaleFactor)
  858. Then
  859. Begin
  860. If Assigned(R1.Symbol)
  861. Then RefsEqual := Assigned(R2.Symbol) And (R1.Symbol^=R2.Symbol^)
  862. Else RefsEqual := Not(Assigned(R2.Symbol));
  863. End
  864. Else RefsEqual := False;
  865. End;
  866. Function IsGP32Reg(Reg: TRegister): Boolean;
  867. {Checks if the register is a 32 bit general purpose register}
  868. Begin
  869. If (Reg >= R_EAX) and (Reg <= R_EBX)
  870. Then IsGP32Reg := True
  871. Else IsGP32reg := False
  872. End;
  873. Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  874. Begin {checks whether Ref contains a reference to Reg}
  875. Reg := Reg32(Reg);
  876. RegInRef := (Ref.Base = Reg) Or (Ref.Index = Reg)
  877. End;
  878. Function RegInInstruction(Reg: TRegister; p1: Pai): Boolean;
  879. {checks if Reg is used by the instruction p1}
  880. Var TmpResult: Boolean;
  881. Begin
  882. TmpResult := False;
  883. If (Pai(p1)^.typ = ait_instruction) Then
  884. Begin
  885. Case Pai386(p1)^.op1t Of
  886. Top_Reg: TmpResult := Reg = TRegister(Pai386(p1)^.op1);
  887. Top_Ref: TmpResult := RegInRef(Reg, TReference(Pai386(p1)^.op1^))
  888. End;
  889. If Not(TmpResult) Then
  890. Case Pai386(p1)^.op2t Of
  891. Top_Reg:
  892. if Pai386(p1)^.op3t<>Top_reg
  893. then TmpResult := Reg = TRegister(Pai386(p1)^.op2)
  894. else TmpResult := longint(Reg) = twowords(Pai386(p1)^.op2).word1;
  895. Top_Ref: TmpResult := RegInRef(Reg, TReference(Pai386(p1)^.op2^))
  896. End;
  897. If Not(TmpResult) Then
  898. Case Pai386(p1)^.op3t Of
  899. Top_Reg: TmpResult := longint(Reg) =twowords(Pai386(p1)^.op2).word2;
  900. Top_none:;
  901. else
  902. internalerror($Da);
  903. End
  904. End;
  905. RegInInstruction := TmpResult
  906. End;
  907. {Function RegInOp(Reg: TRegister; opt: Longint; op: Pointer): Boolean;
  908. Begin
  909. RegInOp := False;
  910. Case opt Of
  911. top_reg: RegInOp := Reg = TRegister(Pointer);
  912. top_ref: RegInOp := (Reg = TReference(op^).Base) Or
  913. (Reg = TReference(op^).Index);
  914. End;
  915. End;}
  916. Function RegModifiedByInstruction(Reg: TRegister; p1: Pai): Boolean;
  917. {returns true if Reg is modified by the instruction p1. P1 is assumed to be
  918. of the type ait_instruction}
  919. Var hp: Pai;
  920. Begin
  921. If GetLastInstruction(p1, hp)
  922. Then
  923. RegModifiedByInstruction :=
  924. PPAiProp(p1^.fileinfo.line)^.Regs[Reg].WState <>
  925. PPAiProp(hp^.fileinfo.line)^.Regs[Reg].WState
  926. Else RegModifiedByInstruction := True;
  927. End;
  928. {********************* GetNext and GetLastInstruction *********************}
  929. Function GetNextInstruction(Current: Pai; Var Next: Pai): Boolean;
  930. {skips ait_regalloc, ait_regdealloc and ait_stab* objects and puts the
  931. next pai object in Next. Returns false if there isn't any}
  932. Begin
  933. Repeat
  934. Current := Pai(Current^.Next);
  935. While Assigned(Current) And
  936. ((Current^.typ In SkipInstr) or
  937. ((Current^.typ = ait_label) And
  938. Not(Pai_Label(Current)^.l^.is_used))) Do
  939. Current := Pai(Current^.Next);
  940. If Assigned(Current) And
  941. (Current^.typ = ait_Marker) And
  942. (Pai_Marker(Current)^.Kind = NoPropInfoStart) Then
  943. Begin
  944. While Assigned(Current) And
  945. Not((Current^.typ = ait_Marker) And
  946. (Pai_Marker(Current)^.Kind = NoPropInfoEnd)) Do
  947. Current := Pai(Current^.Next)
  948. End;
  949. Until Not(Assigned(Current)) Or
  950. (Current^.typ <> ait_Marker);
  951. Next := Current;
  952. If Assigned(Current) And
  953. Not((Current^.typ In SkipInstr) or
  954. ((Current^.typ = ait_label) And
  955. Not(Pai_Label(Current)^.l^.is_used)))
  956. Then GetNextInstruction := True
  957. Else
  958. Begin
  959. Next := Nil;
  960. GetNextInstruction := False;
  961. End;
  962. End;
  963. Function GetLastInstruction(Current: Pai; Var Last: Pai): Boolean;
  964. {skips the ait-types in SkipInstr puts the previous pai object in
  965. Last. Returns false if there isn't any}
  966. Begin
  967. Repeat
  968. Current := Pai(Current^.previous);
  969. While Assigned(Current) And
  970. ((Pai(Current)^.typ In SkipInstr) or
  971. ((Pai(Current)^.typ = ait_label) And
  972. Not(Pai_Label(Current)^.l^.is_used))) Do
  973. Current := Pai(Current^.previous);
  974. If Assigned(Current) And
  975. (Current^.typ = ait_Marker) And
  976. (Pai_Marker(Current)^.Kind = NoPropInfoEnd) Then
  977. Begin
  978. While Assigned(Current) And
  979. Not((Current^.typ = ait_Marker) And
  980. (Pai_Marker(Current)^.Kind = NoPropInfoStart)) Do
  981. Current := Pai(Current^.previous);
  982. End;
  983. Until Not(Assigned(Current)) Or
  984. (Current^.typ <> ait_Marker);
  985. Last := Current;
  986. If Assigned(Current) And
  987. Not((Current^.typ In SkipInstr) or
  988. ((Current^.typ = ait_label) And
  989. Not(Pai_Label(Current)^.l^.is_used)))
  990. Then GetLastInstruction := True
  991. Else
  992. Begin
  993. Last := Nil;
  994. GetLastInstruction := False
  995. End;
  996. End;
  997. {******************* The Data Flow Analyzer functions ********************}
  998. Procedure UpdateUsedRegs(Var UsedRegs: TRegSet; p: Pai);
  999. {updates UsedRegs with the RegAlloc Information coming after P}
  1000. Begin
  1001. Repeat
  1002. While Assigned(p) And
  1003. ((p^.typ in (SkipInstr - [ait_RegAlloc, ait_RegDealloc])) or
  1004. ((p^.typ = ait_label) And
  1005. Not(Pai_Label(p)^.l^.is_used))) Do
  1006. p := Pai(p^.next);
  1007. While Assigned(p) And
  1008. (p^.typ in [ait_RegAlloc, ait_RegDealloc]) Do
  1009. Begin
  1010. Case p^.typ Of
  1011. ait_RegAlloc: UsedRegs := UsedRegs + [PaiRegAlloc(p)^.Reg];
  1012. ait_regdealloc: UsedRegs := UsedRegs - [PaiRegDeAlloc(p)^.Reg];
  1013. End;
  1014. p := pai(p^.next);
  1015. End;
  1016. Until Not(Assigned(p)) Or
  1017. (Not(p^.typ in SkipInstr) And
  1018. Not((p^.typ = ait_label) And
  1019. Not(Pai_Label(p)^.l^.is_used)));
  1020. End;
  1021. (*Function FindZeroreg(p: Pai; Var Result: TRegister): Boolean;
  1022. {Finds a register which contains the constant zero}
  1023. Var Counter: TRegister;
  1024. Begin
  1025. Counter := R_EAX;
  1026. FindZeroReg := True;
  1027. While (Counter <= R_EDI) And
  1028. ((PPaiProp(p^.fileinfo.line)^.Regs[Counter].Typ <> Con_Const) or
  1029. (PPaiProp(p^.fileinfo.line)^.Regs[Counter].StartMod <> Pointer(0))) Do
  1030. Inc(Byte(Counter));
  1031. If (PPaiProp(p^.fileinfo.line)^.Regs[Counter].Typ = Con_Const) And
  1032. (PPaiProp(p^.fileinfo.line)^.Regs[Counter].StartMod = Pointer(0))
  1033. Then Result := Counter
  1034. Else FindZeroReg := False;
  1035. End;*)
  1036. Function TCh2Reg(Ch: TChange): TRegister;
  1037. {converts a TChange variable to a TRegister}
  1038. Begin
  1039. If (Ch <= C_REDI) Then
  1040. TCh2Reg := TRegister(Byte(Ch))
  1041. Else
  1042. If (Ch <= C_WEDI) Then
  1043. TCh2Reg := TRegister(Byte(Ch) - Byte(C_REDI))
  1044. Else
  1045. If (Ch <= C_RWEDI) Then
  1046. TCh2Reg := TRegister(Byte(Ch) - Byte(C_WEDI))
  1047. Else InternalError($db)
  1048. End;
  1049. Procedure IncState(Var S: Byte);
  1050. {Increases S by 1, wraps around at $ffff to 0 (so we won't get overflow
  1051. errors}
  1052. Begin
  1053. If (s <> $ff)
  1054. Then Inc(s)
  1055. Else s := 0
  1056. End;
  1057. Function RegInSequence(Reg: TRegister; Const Content: TContent): Boolean;
  1058. {checks the whole sequence of Content (so StartMod and and the next NrOfMods
  1059. Pai objects) to see whether Reg is used somewhere, without it being loaded
  1060. with something else first}
  1061. Var p: Pai;
  1062. Counter: Byte;
  1063. TmpResult: Boolean;
  1064. RegsChecked: TRegSet;
  1065. Begin
  1066. RegsChecked := [];
  1067. p := Content.StartMod;
  1068. TmpResult := False;
  1069. Counter := 1;
  1070. While Not(TmpResult) And
  1071. (Counter <= Content.NrOfMods) Do
  1072. Begin
  1073. If (p^.typ = ait_instruction) and
  1074. (Pai386(p)^._operator in [A_MOV, A_MOVZX, A_MOVSX])
  1075. Then
  1076. If (Pai386(p)^.op1t = top_ref)
  1077. Then
  1078. With TReference(Pai386(p)^.op1^) Do
  1079. If (Base = ProcInfo.FramePointer) And
  1080. (Index = R_NO)
  1081. Then RegsChecked := RegsChecked + [Reg32(TRegister(Pai386(p)^.op2))]
  1082. Else
  1083. Begin
  1084. If (Base = Reg) And
  1085. Not(Base In RegsChecked)
  1086. Then TmpResult := True;
  1087. If Not(TmpResult) And
  1088. (Index = Reg) And
  1089. Not(Index In RegsChecked)
  1090. Then TmpResult := True;
  1091. End;
  1092. Inc(Counter);
  1093. GetNextInstruction(p,p)
  1094. End;
  1095. RegInSequence := TmpResult
  1096. End;
  1097. Procedure DestroyReg(p1: PPaiProp; Reg: TRegister);
  1098. {Destroys the contents of the register Reg in the PPaiProp p1, as well as the
  1099. contents of registers are loaded with a memory location based on Reg}
  1100. Var TmpState: Byte;
  1101. Counter: TRegister;
  1102. Begin
  1103. Reg := Reg32(Reg);
  1104. NrOfInstrSinceLastMod[Reg] := 0;
  1105. If (Reg >= R_EAX) And (Reg <= R_EDI)
  1106. Then
  1107. Begin
  1108. With p1^.Regs[Reg] Do
  1109. Begin
  1110. IncState(WState);
  1111. TmpState := WState;
  1112. FillChar(p1^.Regs[Reg], SizeOf(TContent), 0);
  1113. WState := TmpState;
  1114. End;
  1115. For Counter := R_EAX to R_EDI Do
  1116. With p1^.Regs[Counter] Do
  1117. If (Typ = Con_Ref) And
  1118. RegInSequence(Reg, p1^.Regs[Counter])
  1119. Then
  1120. Begin
  1121. IncState(WState);
  1122. TmpState := WState;
  1123. FillChar(p1^.Regs[Counter], SizeOf(TContent), 0);
  1124. WState := TmpState;
  1125. End;
  1126. End;
  1127. End;
  1128. {Procedure AddRegsToSet(p: Pai; Var RegSet: TRegSet);
  1129. Begin
  1130. If (p^.typ = ait_instruction) Then
  1131. Begin
  1132. Case Pai386(p)^.op1t Of
  1133. top_reg:
  1134. If Not(TRegister(Pai386(p)^.op1) in [R_NO,R_ESP,ProcInfo.FramePointer]) Then
  1135. RegSet := RegSet + [TRegister(Pai386(p)^.op1)];
  1136. top_ref:
  1137. With TReference(Pai386(p)^.op1^) Do
  1138. Begin
  1139. If Not(Base in [ProcInfo.FramePointer,R_NO,R_ESP])
  1140. Then RegSet := RegSet + [Base];
  1141. If Not(Index in [ProcInfo.FramePointer,R_NO,R_ESP])
  1142. Then RegSet := RegSet + [Index];
  1143. End;
  1144. End;
  1145. Case Pai386(p)^.op2t Of
  1146. top_reg:
  1147. If Not(TRegister(Pai386(p)^.op2) in [R_NO,R_ESP,ProcInfo.FramePointer]) Then
  1148. RegSet := RegSet + [TRegister(Pai386(p)^.op2)];
  1149. top_ref:
  1150. With TReference(Pai386(p)^.op2^) Do
  1151. Begin
  1152. If Not(Base in [ProcInfo.FramePointer,R_NO,R_ESP])
  1153. Then RegSet := RegSet + [Base];
  1154. If Not(Index in [ProcInfo.FramePointer,R_NO,R_ESP])
  1155. Then RegSet := RegSet + [Index];
  1156. End;
  1157. End;
  1158. End;
  1159. End;}
  1160. Function OpsEquivalent(typ: Longint; OldOp, NewOp: Pointer; Var RegInfo: TRegInfo): Boolean;
  1161. Begin {checks whether the two ops are equivalent}
  1162. Case typ Of
  1163. Top_Reg: OpsEquivalent := RegsEquivalent(TRegister(OldOp), TRegister(NewOp), RegInfo);
  1164. Top_Const: OpsEquivalent := OldOp = NewOp;
  1165. Top_Ref: OpsEquivalent := RefsEquivalent(TReference(OldOp^), TReference(NewOp^), RegInfo);
  1166. Top_None: OpsEquivalent := True
  1167. Else OpsEquivalent := False
  1168. End;
  1169. End;
  1170. (*Function OpsEqual(typ: Longint; op1, op2: Pointer): Boolean;
  1171. Begin {checks whether the two ops are equal}
  1172. Case typ Of
  1173. Top_Reg, Top_Const: OpsEqual := op1 = op2;
  1174. Top_Ref: OpsEqual := RefsEqual(TReference(op1^), TReference(op2^));
  1175. Top_None: OpsEqual := True
  1176. Else OpsEqual := False
  1177. End;
  1178. End; *)
  1179. Function InstructionsEquivalent(p1, p2: Pai; Var RegInfo: TRegInfo): Boolean;
  1180. Begin {checks whether two Pai386 instructions are equal}
  1181. If Assigned(p1) And Assigned(p2) And
  1182. (Pai(p1)^.typ = ait_instruction) And
  1183. (Pai(p1)^.typ = ait_instruction) And
  1184. (Pai386(p1)^._operator = Pai386(p2)^._operator) And
  1185. (Pai386(p1)^.op1t = Pai386(p2)^.op1t) And
  1186. (Pai386(p1)^.op2t = Pai386(p2)^.op2t)
  1187. Then
  1188. {both instructions have the same structure:
  1189. "<operator> <operand of type1>, <operand of type 2>"}
  1190. If (Pai386(p1)^._operator in [A_MOV, A_MOVZX, A_MOVSX]) And
  1191. (Pai386(p1)^.op1t = top_ref) {then op2t = top_reg} Then
  1192. If Not(RegInRef(TRegister(Pai386(p1)^.op2), TReference(Pai386(p1)^.op1^))) Then
  1193. {the "old" instruction is a load of a register with a new value, not with
  1194. a value based on the contents of this register (so no "mov (reg), reg")}
  1195. If Not(RegInRef(TRegister(Pai386(p2)^.op2), TReference(Pai386(p2)^.op1^))) And
  1196. RefsEqual(TReference(Pai386(p1)^.op1^), TReference(Pai386(p2)^.op1^))
  1197. Then
  1198. {the "new" instruction is also a load of a register with a new value, and
  1199. this value is fetched from the same memory location}
  1200. Begin
  1201. With TReference(Pai386(p2)^.op1^) Do
  1202. Begin
  1203. If Not(Base in [ProcInfo.FramePointer, R_NO, R_ESP])
  1204. {it won't do any harm if the register is already in RegsLoadedForRef}
  1205. Then RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Base];
  1206. If Not(Index in [ProcInfo.FramePointer, R_NO, R_ESP])
  1207. Then RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Index];
  1208. End;
  1209. {add the registers from the reference (op1) to the RegInfo, all registers
  1210. from the reference are the same in the old and in the new instruction
  1211. sequence}
  1212. AddOp2RegInfo(Pai386(p1)^.op1t, Pai386(p1)^.op1, RegInfo);
  1213. {the registers from op2 have to be equivalent, but not necessarily equal}
  1214. InstructionsEquivalent :=
  1215. RegsEquivalent(TRegister(Pai386(p1)^.op2), TRegister(Pai386(p2)^.op2),
  1216. RegInfo);
  1217. End
  1218. {the registers are loaded with values from different memory locations. If
  1219. this was allowed, the instructions "mov -4(esi),eax" and "mov -4(ebp),eax"
  1220. would be considered equivalent}
  1221. Else InstructionsEquivalent := False
  1222. Else
  1223. {load register with a value based on the current value of this register}
  1224. Begin
  1225. With TReference(Pai386(p2)^.op1^) Do
  1226. Begin
  1227. If Not(Base in [ProcInfo.FramePointer,
  1228. Reg32(TRegister(Pai386(p2)^.op2)),R_NO,R_ESP])
  1229. {it won't do any harm if the register is already in RegsLoadedForRef}
  1230. Then
  1231. {$ifdef csdebug}
  1232. Begin
  1233. {$endif csdebug}
  1234. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Base];
  1235. {$ifdef csdebug}
  1236. Writeln(att_reg2str[base], ' added');
  1237. end;
  1238. {$endif csdebug}
  1239. If Not(Index in [ProcInfo.FramePointer,
  1240. Reg32(TRegister(Pai386(p2)^.op2)),R_NO,R_ESP])
  1241. Then
  1242. {$ifdef csdebug}
  1243. Begin
  1244. {$endif csdebug}
  1245. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Index];
  1246. {$ifdef csdebug}
  1247. Writeln(att_reg2str[index], ' added');
  1248. end;
  1249. {$endif csdebug}
  1250. End;
  1251. If Not(Reg32(TRegister(Pai386(p2)^.op2)) In [ProcInfo.FramePointer,
  1252. R_NO,R_ESP])
  1253. Then
  1254. {$ifdef csdebug}
  1255. Begin
  1256. {$endif csdebug}
  1257. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef -
  1258. [Reg32(TRegister(Pai386(p2)^.op2))];
  1259. {$ifdef csdebug}
  1260. Writeln(att_reg2str[Reg32(TRegister(Pai386(p2)^.op2))], ' removed');
  1261. end;
  1262. {$endif csdebug}
  1263. If (TRegister(Pai386(p1)^.op2) In RegInfo.RegsEncountered) Or
  1264. Not(RegInRef(TRegister(Pai386(p1)^.op2), TReference(Pai386(p2)^.op1^))) Then
  1265. { To avoid
  1266. movl 48(%esi), %esi movl 48(%esi), %esi
  1267. pushl %esi getting changed to pushl %esi
  1268. movl 48(%esi), %edi movl %esi, %edi }
  1269. InstructionsEquivalent :=
  1270. OpsEquivalent(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1, RegInfo) And
  1271. OpsEquivalent(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2, RegInfo)
  1272. Else InstructionsEquivalent := False
  1273. End
  1274. Else
  1275. {an instruction <> mov, movzx, movsx}
  1276. InstructionsEquivalent :=
  1277. OpsEquivalent(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1, RegInfo) And
  1278. OpsEquivalent(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2, RegInfo)
  1279. {the instructions haven't even got the same structure, so they're certainly
  1280. not equivalent}
  1281. Else InstructionsEquivalent := False;
  1282. End;
  1283. (*
  1284. Function InstructionsEqual(p1, p2: Pai): Boolean;
  1285. Begin {checks whether two Pai386 instructions are equal}
  1286. InstructionsEqual :=
  1287. Assigned(p1) And Assigned(p2) And
  1288. ((Pai(p1)^.typ = ait_instruction) And
  1289. (Pai(p1)^.typ = ait_instruction) And
  1290. (Pai386(p1)^._operator = Pai386(p2)^._operator) And
  1291. (Pai386(p1)^.op1t = Pai386(p2)^.op1t) And
  1292. (Pai386(p1)^.op2t = Pai386(p2)^.op2t) And
  1293. OpsEqual(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1) And
  1294. OpsEqual(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2))
  1295. End;
  1296. *)
  1297. Function RefInInstruction(Const Ref: TReference; p: Pai): Boolean;
  1298. {checks whehter Ref is used in P}
  1299. Var TmpResult: Boolean;
  1300. Begin
  1301. TmpResult := False;
  1302. If (p^.typ = ait_instruction) Then
  1303. Begin
  1304. If (Pai386(p)^.op1t = Top_Ref)
  1305. Then TmpResult := RefsEqual(Ref, TReference(Pai386(p)^.op1^));
  1306. If Not(TmpResult) And
  1307. (Pai386(p)^.op2t = Top_Ref)
  1308. Then TmpResult := RefsEqual(Ref, TReference(Pai386(p)^.op2^));
  1309. End;
  1310. RefInInstruction := TmpResult;
  1311. End;
  1312. Function RefInSequence(Const Ref: TReference; Content: TContent): Boolean;
  1313. {checks the whole sequence of Content (so StartMod and and the next NrOfMods
  1314. Pai objects) to see whether Ref is used somewhere}
  1315. Var p: Pai;
  1316. Counter: Byte;
  1317. TmpResult: Boolean;
  1318. Begin
  1319. p := Content.StartMod;
  1320. TmpResult := False;
  1321. Counter := 1;
  1322. While Not(TmpResult) And
  1323. (Counter <= Content.NrOfMods) Do
  1324. Begin
  1325. If (p^.typ = ait_instruction) And
  1326. RefInInstruction(Ref, p)
  1327. Then TmpResult := True;
  1328. Inc(Counter);
  1329. GetNextInstruction(p,p)
  1330. End;
  1331. RefInSequence := TmpResult
  1332. End;
  1333. Procedure DestroyRefs(p: pai; Const Ref: TReference; WhichReg: TRegister);
  1334. {destroys all registers which possibly contain a reference to Ref, WhichReg
  1335. is the register whose contents are being written to memory (if this proc
  1336. is called because of a "mov?? %reg, (mem)" instruction)}
  1337. Var Counter: TRegister;
  1338. Begin
  1339. WhichReg := Reg32(WhichReg);
  1340. If ((Ref.base = ProcInfo.FramePointer) And
  1341. (Ref.Index = R_NO)) Or
  1342. Assigned(Ref.Symbol)
  1343. Then
  1344. {write something to a parameter, a local or global variable, so
  1345. * with uncertzain optimizations on:
  1346. - destroy the contents of registers whose contents have somewhere a
  1347. "mov?? (Ref), %reg". WhichReg (this is the register whose contents
  1348. are being written to memory) is not destroyed if it's StartMod is
  1349. of that form and NrOfMods = 1 (so if it holds ref, but is not a
  1350. pointer based on Ref)
  1351. * with uncertain optimizations off:
  1352. - also destroy registers that contain any pointer}
  1353. For Counter := R_EAX to R_EDI Do
  1354. With PPaiProp(p^.fileinfo.line)^.Regs[Counter] Do
  1355. Begin
  1356. If (typ = Con_Ref) And
  1357. (Not(cs_UncertainOpts in aktglobalswitches) And
  1358. (NrOfMods <> 1)
  1359. ) Or
  1360. (RefInSequence(Ref,PPaiProp(p^.fileinfo.line)^.Regs[Counter]) And
  1361. ((Counter <> WhichReg) Or
  1362. ((NrOfMods = 1) And
  1363. {StarMod is always of the type ait_instruction}
  1364. (Pai386(StartMod)^.op1t = top_ref) And
  1365. RefsEqual(TReference(Pai386(StartMod)^.op1^), Ref)
  1366. )
  1367. )
  1368. )
  1369. Then DestroyReg(PPaiProp(p^.fileinfo.line), Counter)
  1370. End
  1371. Else
  1372. {write something to a pointer location, so
  1373. * with uncertain optimzations on:
  1374. - do not destroy registers which contain a local/global variable or a
  1375. parameter, except if DestroyRefs is called because of a "movsl"
  1376. * with uncertain optimzations off:
  1377. - destroy every register which contains a memory location
  1378. }
  1379. For Counter := R_EAX to R_EDI Do
  1380. With PPaiProp(p^.fileinfo.line)^.Regs[Counter] Do
  1381. If (typ = Con_Ref) And
  1382. (Not(cs_UncertainOpts in aktglobalswitches) Or
  1383. {for movsl}
  1384. (Ref.Base = R_EDI) Or
  1385. {don't destroy if reg contains a parameter, local or global variable}
  1386. Not((NrOfMods = 1) And
  1387. (Pai386(StartMod)^.op1t = top_ref) And
  1388. ((PReference(Pai386(StartMod)^.op1)^.base = ProcInfo.FramePointer) Or
  1389. Assigned(PReference(Pai386(StartMod)^.op1)^.Symbol)
  1390. )
  1391. )
  1392. )
  1393. Then DestroyReg(PPaiProp(p^.FileInfo.Line), Counter)
  1394. End;
  1395. Procedure DestroyAllRegs(p: PPaiProp);
  1396. Var Counter: TRegister;
  1397. Begin {initializes/desrtoys all registers}
  1398. For Counter := R_EAX To R_EDI Do
  1399. DestroyReg(p, Counter);
  1400. p^.DirFlag := F_Unknown;
  1401. End;
  1402. Procedure Destroy(PaiObj: Pai; opt: Longint; Op: Pointer);
  1403. Begin
  1404. Case opt Of
  1405. top_reg: DestroyReg(PPaiProp(PaiObj^.fileinfo.line), TRegister(Op));
  1406. top_ref: DestroyRefs(PaiObj, TReference(Op^), R_NO);
  1407. top_symbol:;
  1408. End;
  1409. End;
  1410. Procedure DFAPass1(AsmL: PAasmOutput);
  1411. {gathers the RegAlloc data... still need to think about where to store it}
  1412. Begin
  1413. FindLoHiLabels(AsmL, LoLab, HiLab, LabDif);
  1414. BuildLabelTableAndFixRegAlloc(AsmL, LTable, LoLab, LabDif);
  1415. End;
  1416. Function DoDFAPass2(
  1417. {$Ifdef StateDebug}
  1418. AsmL: PAasmOutput;
  1419. {$endif statedebug}
  1420. First: Pai): Pai;
  1421. {Analyzes the Data Flow of an assembler list. Starts creating the reg
  1422. contents for the instructions starting with p. Returns the last pai which has
  1423. been processed}
  1424. Var
  1425. CurProp: PPaiProp;
  1426. {$ifdef AnalyzeLoops}
  1427. TmpState: Byte;
  1428. {$endif AnalyzeLoops}
  1429. Cnt, InstrCnt : Longint;
  1430. InstrProp: TAsmInstrucProp;
  1431. UsedRegs: TRegSet;
  1432. p, hp : Pai;
  1433. TmpRef: TReference;
  1434. TmpReg: TRegister;
  1435. Begin
  1436. p := First;
  1437. UsedRegs := [];
  1438. UpdateUsedregs(UsedRegs, p);
  1439. If (First^.typ in SkipInstr) Then
  1440. GetNextInstruction(p, p);
  1441. First := p;
  1442. InstrCnt := 1;
  1443. FillChar(NrOfInstrSinceLastMod, SizeOf(NrOfInstrSinceLastMod), 0);
  1444. While Assigned(p) Do
  1445. Begin
  1446. DoDFAPass2 := p;
  1447. {$IfDef TP}
  1448. New(CurProp);
  1449. {$Else TP}
  1450. CurProp := @PaiPropBlock^[InstrCnt];
  1451. {$EndIf TP}
  1452. If (p <> First)
  1453. Then
  1454. Begin
  1455. {$ifdef JumpAnal}
  1456. If (p^.Typ <> ait_label) Then
  1457. {$endif JumpAnal}
  1458. Begin
  1459. GetLastInstruction(p, hp);
  1460. CurProp^.Regs := PPaiProp(hp^.fileinfo.line)^.Regs;
  1461. CurProp^.DirFlag := PPaiProp(hp^.fileinfo.line)^.DirFlag;
  1462. End
  1463. End
  1464. Else
  1465. Begin
  1466. FillChar(CurProp^, SizeOf(CurProp^), 0);
  1467. { For TmpReg := R_EAX to R_EDI Do
  1468. CurProp^.Regs[TmpReg].WState := 1;}
  1469. End;
  1470. CurProp^.UsedRegs := UsedRegs;
  1471. CurProp^.CanBeRemoved := False;
  1472. UpdateUsedRegs(UsedRegs, Pai(p^.Next));
  1473. {$ifdef TP}
  1474. CurProp^.linesave := p^.fileinfo.line;
  1475. PPaiProp(p^.fileinfo.line) := CurProp;
  1476. {$Endif TP}
  1477. For TmpReg := R_EAX To R_EDI Do
  1478. Inc(NrOfInstrSinceLastMod[TmpReg]);
  1479. Case p^.typ Of
  1480. ait_label:
  1481. {$Ifndef JumpAnal}
  1482. If (Pai_label(p)^.l^.is_used) Then
  1483. DestroyAllRegs(CurProp);
  1484. {$Else JumpAnal}
  1485. Begin
  1486. If (Pai_Label(p)^.is_used) Then
  1487. With LTable^[Pai_Label(p)^.l^.nb-LoLab] Do
  1488. {$IfDef AnalyzeLoops}
  1489. If (RefsFound = Pai_Label(p)^.l^.RefCount)
  1490. {$Else AnalyzeLoops}
  1491. If (JmpsProcessed = Pai_Label(p)^.l^.RefCount)
  1492. {$EndIf AnalyzeLoops}
  1493. Then
  1494. {all jumps to this label have been found}
  1495. {$IfDef AnalyzeLoops}
  1496. If (JmpsProcessed > 0)
  1497. Then
  1498. {$EndIf AnalyzeLoops}
  1499. {we've processed at least one jump to this label}
  1500. Begin
  1501. If (GetLastInstruction(p, hp) And
  1502. Not(((hp^.typ = ait_labeled_instruction) or
  1503. (hp^.typ = ait_instruction)) And
  1504. (Pai_Labeled(hp)^._operator = A_JMP))
  1505. Then
  1506. {previous instruction not a JMP -> the contents of the registers after the
  1507. previous intruction has been executed have to be taken into account as well}
  1508. For TmpReg := R_EAX to R_EDI Do
  1509. Begin
  1510. If (CurProp^.Regs[TmpReg].WState <>
  1511. PPaiProp(hp^.FileInfo.Line)^.Regs[TmpReg].WState)
  1512. Then DestroyReg(CurProp, TmpReg)
  1513. End
  1514. End
  1515. {$IfDef AnalyzeLoops}
  1516. Else
  1517. {a label from a backward jump (e.g. a loop), no jump to this label has
  1518. already been processed}
  1519. If GetLastInstruction(p, hp) And
  1520. Not(hp^.typ = ait_labeled_instruction) And
  1521. (Pai_Labeled(hp)^._operator = A_JMP))
  1522. Then
  1523. {previous instruction not a jmp, so keep all the registers' contents from the
  1524. previous instruction}
  1525. Begin
  1526. CurProp^.Regs := PPaiProp(hp^.FileInfo.Line)^.Regs;
  1527. CurProp^.DirFlag := PPaiProp(hp^.FileInfo.Line)^.DirFlag;
  1528. End
  1529. Else
  1530. {previous instruction a jmp and no jump to this label processed yet}
  1531. Begin
  1532. hp := p;
  1533. Cnt := InstrCnt;
  1534. {continue until we find a jump to the label or a label which has already
  1535. been processed}
  1536. While GetNextInstruction(hp, hp) And
  1537. Not((hp^.typ = ait_labeled_instruction) And
  1538. (Pai_Labeled(hp)^.lab^.nb = Pai_Label(p)^.l^.nb)) And
  1539. Not((hp^.typ = ait_label) And
  1540. (LTable^[Pai_Label(hp)^.l^.nb-LoLab].RefsFound
  1541. = Pai_Label(hp)^.l^.RefCount) And
  1542. (LTable^[Pai_Label(hp)^.l^.nb-LoLab].JmpsProcessed > 0)) Do
  1543. Inc(Cnt);
  1544. If (hp^.typ = ait_label)
  1545. Then
  1546. {there's a processed label after the current one}
  1547. Begin
  1548. CurProp^.Regs := PaiPropBlock^[Cnt].Regs;
  1549. CurProp^.DirFlag := PaiPropBlock^[Cnt].DirFlag;
  1550. End
  1551. Else
  1552. {there's no label anymore after the current one, or they haven't been
  1553. processed yet}
  1554. Begin
  1555. GetLastInstruction(p, hp);
  1556. CurProp^.Regs := PPaiProp(hp^.FileInfo.Line)^.Regs;
  1557. CurProp^.DirFlag := PPaiProp(hp^.FileInfo.Line)^.DirFlag;
  1558. DestroyAllRegs(PPaiProp(hp^.FileInfo.Line))
  1559. End
  1560. End
  1561. {$EndIf AnalyzeLoops}
  1562. Else
  1563. {not all references to this label have been found, so destroy all registers}
  1564. Begin
  1565. GetLastInstruction(p, hp);
  1566. CurProp^.Regs := PPaiProp(hp^.FileInfo.Line)^.Regs;
  1567. CurProp^.DirFlag := PPaiProp(hp^.FileInfo.Line)^.DirFlag;
  1568. DestroyAllRegs(CurProp)
  1569. End;
  1570. End;
  1571. {$EndIf JumpAnal}
  1572. ait_labeled_instruction:
  1573. {$IfNDef JumpAnal}
  1574. ;
  1575. {$Else JumpAnal}
  1576. With LTable^[Pai_Labeled(p)^.lab^.nb-LoLab] Do
  1577. If (RefsFound = Pai_Labeled(p)^.lab^.RefCount) Then
  1578. Begin
  1579. If (InstrCnt < InstrNr)
  1580. Then
  1581. {forward jump}
  1582. If (JmpsProcessed = 0) Then
  1583. {no jump to this label has been processed yet}
  1584. Begin
  1585. PaiPropBlock^[InstrNr].Regs := CurProp^.Regs;
  1586. PaiPropBlock^[InstrNr].DirFlag := CurProp^.DirFlag;
  1587. Inc(JmpsProcessed);
  1588. End
  1589. Else
  1590. Begin
  1591. For TmpReg := R_EAX to R_EDI Do
  1592. If (PaiPropBlock^[InstrNr].Regs[TmpReg].WState <>
  1593. CurProp^.Regs[TmpReg].WState) Then
  1594. DestroyReg(@PaiPropBlock^[InstrNr], TmpReg);
  1595. Inc(JmpsProcessed);
  1596. End
  1597. {$ifdef AnalyzeLoops}
  1598. Else
  1599. { backward jump, a loop for example}
  1600. { If (JmpsProcessed > 0) Or
  1601. Not(GetLastInstruction(PaiObj, hp) And
  1602. (hp^.typ = ait_labeled_instruction) And
  1603. (Pai_Labeled(hp)^._operator = A_JMP))
  1604. Then}
  1605. {instruction prior to label is not a jmp, or at least one jump to the label
  1606. has yet been processed}
  1607. Begin
  1608. Inc(JmpsProcessed);
  1609. For TmpReg := R_EAX to R_EDI Do
  1610. If (PaiPropBlock^[InstrNr].Regs[TmpReg].WState <>
  1611. CurProp^.Regs[TmpReg].WState)
  1612. Then
  1613. Begin
  1614. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1615. Cnt := InstrNr;
  1616. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1617. Begin
  1618. DestroyReg(@PaiPropBlock^[Cnt], TmpReg);
  1619. Inc(Cnt);
  1620. End;
  1621. While (Cnt <= InstrCnt) Do
  1622. Begin
  1623. Inc(PaiPropBlock^[Cnt].Regs[TmpReg].WState);
  1624. Inc(Cnt)
  1625. End
  1626. End;
  1627. End
  1628. { Else }
  1629. {instruction prior to label is a jmp and no jumps to the label have yet been
  1630. processed}
  1631. { Begin
  1632. Inc(JmpsProcessed);
  1633. For TmpReg := R_EAX to R_EDI Do
  1634. Begin
  1635. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1636. Cnt := InstrNr;
  1637. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1638. Begin
  1639. PaiPropBlock^[Cnt].Regs[TmpReg] := CurProp^.Regs[TmpReg];
  1640. Inc(Cnt);
  1641. End;
  1642. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1643. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1644. Begin
  1645. DestroyReg(@PaiPropBlock^[Cnt], TmpReg);
  1646. Inc(Cnt);
  1647. End;
  1648. While (Cnt <= InstrCnt) Do
  1649. Begin
  1650. Inc(PaiPropBlock^[Cnt].Regs[TmpReg].WState);
  1651. Inc(Cnt)
  1652. End
  1653. End
  1654. End}
  1655. {$endif AnalyzeLoops}
  1656. End;
  1657. {$EndIf JumpAnal}
  1658. {$ifdef GDB}
  1659. ait_stabs, ait_stabn, ait_stab_function_name:;
  1660. {$endif GDB}
  1661. ait_instruction:
  1662. Begin
  1663. InstrProp := AsmInstr[Pai386(p)^._operator];
  1664. Case Pai386(p)^._operator Of
  1665. A_MOV, A_MOVZX, A_MOVSX:
  1666. Begin
  1667. Case Pai386(p)^.op1t Of
  1668. Top_Reg:
  1669. Case Pai386(p)^.op2t Of
  1670. Top_Reg:
  1671. Begin
  1672. DestroyReg(CurProp, TRegister(Pai386(p)^.op2));
  1673. { CurProp^.Regs[TRegister(Pai386(p)^.op2)] :=
  1674. CurProp^.Regs[TRegister(Pai386(p)^.op1)];
  1675. If (CurProp^.Regs[TRegister(Pai386(p)^.op2)].ModReg = R_NO) Then
  1676. CurProp^.Regs[TRegister(Pai386(p)^.op2)].ModReg :=
  1677. Tregister(Pai386(p)^.op1);}
  1678. End;
  1679. Top_Ref: DestroyRefs(p, TReference(Pai386(p)^.op2^), TRegister(Pai386(p)^.op1));
  1680. End;
  1681. Top_Ref:
  1682. Begin {destination is always a register in this case}
  1683. TmpReg := Reg32(TRegister(Pai386(p)^.op2));
  1684. If RegInRef(TmpReg, TReference(Pai386(p)^.op1^)) And
  1685. (CurProp^.Regs[TmpReg].Typ = Con_Ref)
  1686. Then
  1687. Begin
  1688. With CurProp^.Regs[TmpReg] Do
  1689. Begin
  1690. IncState(WState);
  1691. {also store how many instructions are part of the sequence in the first
  1692. instructions PPaiProp, so it can be easily accessed from within
  1693. CheckSequence}
  1694. Inc(NrOfMods, NrOfInstrSinceLastMod[TmpReg]);
  1695. PPaiProp(Pai(StartMod)^.fileinfo.line)^.Regs[TmpReg].NrOfMods := NrOfMods;
  1696. NrOfInstrSinceLastMod[TmpReg] := 0;
  1697. End;
  1698. End
  1699. Else
  1700. Begin
  1701. DestroyReg(CurProp, TmpReg);
  1702. With CurProp^.Regs[TmpReg] Do
  1703. Begin
  1704. Typ := Con_Ref;
  1705. StartMod := p;
  1706. NrOfMods := 1;
  1707. End;
  1708. End;
  1709. {$ifdef StateDebug}
  1710. hp := new(pai_asm_comment,init(strpnew(att_reg2str[TmpReg]+': '+tostr(CurProp^.Regs[TmpReg].WState))));
  1711. InsertLLItem(AsmL, p, p^.next, hp);
  1712. {$endif StateDebug}
  1713. End;
  1714. Top_Const:
  1715. Begin
  1716. Case Pai386(p)^.op2t Of
  1717. Top_Reg:
  1718. Begin
  1719. TmpReg := Reg32(TRegister(Pai386(p)^.op2));
  1720. With CurProp^.Regs[TmpReg] Do
  1721. Begin
  1722. DestroyReg(CurProp, TmpReg);
  1723. typ := Con_Const;
  1724. StartMod := Pai386(p)^.op1;
  1725. End
  1726. End;
  1727. Top_Ref: DestroyRefs(P, TReference(Pai386(p)^.op2^), R_NO);
  1728. End;
  1729. End;
  1730. End;
  1731. End;
  1732. A_IMUL:
  1733. Begin
  1734. If (Pai386(p)^.Op3t = top_none)
  1735. Then
  1736. If (Pai386(p)^.Op2t = top_none)
  1737. Then
  1738. Begin
  1739. DestroyReg(CurProp, R_EAX);
  1740. DestroyReg(CurProp, R_EDX)
  1741. End
  1742. Else
  1743. Begin
  1744. If (Pai386(p)^.Op2t = top_reg) Then
  1745. DestroyReg(CurProp, TRegister(Pai386(p)^.Op2));
  1746. End
  1747. Else If (Pai386(p)^.Op3t = top_reg) Then
  1748. DestroyReg(CurProp, TRegister(longint(twowords(Pai386(p)^.Op2).word2)));
  1749. End;
  1750. A_XOR:
  1751. Begin
  1752. If (Pai386(p)^.op1t = top_reg) And
  1753. (Pai386(p)^.op2t = top_reg) And
  1754. (Pai386(p)^.op1 = Pai386(p)^.op2)
  1755. Then
  1756. Begin
  1757. DestroyReg(CurProp, Tregister(Pai386(p)^.op1));
  1758. CurProp^.Regs[Reg32(Tregister(Pai386(p)^.op1))].typ := Con_Const;
  1759. CurProp^.Regs[Reg32(Tregister(Pai386(p)^.op1))].StartMod := Pointer(0)
  1760. End
  1761. Else Destroy(p, Pai386(p)^.op2t, Pai386(p)^.op2);
  1762. End
  1763. Else
  1764. Begin
  1765. Cnt := 1;
  1766. While (Cnt <= MaxCh) And
  1767. (InstrProp.Ch[Cnt] <> C_None) Do
  1768. Begin
  1769. Case InstrProp.Ch[Cnt] Of
  1770. C_REAX..C_REDI: ;
  1771. C_WEAX..C_RWEDI: DestroyReg(CurProp, TCh2Reg(InstrProp.Ch[Cnt]));
  1772. C_CDirFlag: CurProp^.DirFlag := F_NotSet;
  1773. C_SDirFlag: CurProp^.DirFlag := F_Set;
  1774. C_ROp1:;
  1775. C_ROp2:;
  1776. C_ROp3:;
  1777. C_WOp1..C_RWOp1: Destroy(p, Pai386(p)^.op1t, Pai386(p)^.op1);
  1778. C_WOp2..C_RWOp2: Destroy(p, Pai386(p)^.op2t, Pai386(p)^.op2);
  1779. C_WOp3..C_RWOp3: Destroy(p, Pai386(p)^.op3t, Pointer(Longint(TwoWords(Pai386(p)^.op2).word2)));
  1780. C_MemEDI:
  1781. Begin
  1782. FillChar(TmpRef, SizeOf(TmpRef), 0);
  1783. TmpRef.Base := R_EDI;
  1784. DestroyRefs(p, TmpRef, R_NO)
  1785. End;
  1786. C_RFlags, C_WFlags, C_RWFlags, C_FPU:
  1787. Else
  1788. Begin
  1789. DestroyAllRegs(CurProp);
  1790. End;
  1791. End;
  1792. Inc(Cnt);
  1793. End
  1794. End;
  1795. End;
  1796. End
  1797. Else
  1798. Begin
  1799. DestroyAllRegs(CurProp);
  1800. End;
  1801. End;
  1802. Inc(InstrCnt);
  1803. GetNextInstruction(p, p);
  1804. End;
  1805. End;
  1806. Function InitDFAPass2(AsmL: PAasmOutput): Boolean;
  1807. {reserves memory for the PPaiProps in one big memory block when not using
  1808. TP, returns False if not enough memory is available for the optimizer in all
  1809. cases}
  1810. Var p: Pai;
  1811. Count: Longint;
  1812. { TmpStr: String; }
  1813. Begin
  1814. P := Pai(AsmL^.First);
  1815. If (p^.typ in SkipInstr) Then
  1816. GetNextInstruction(p, p);
  1817. NrOfPaiObjs := 0;
  1818. While Assigned(P) Do
  1819. Begin
  1820. {$IfDef JumpAnal}
  1821. Case P^.Typ Of
  1822. ait_labeled_instruction:
  1823. begin
  1824. If (Pai_Labeled(P)^.lab^.nb >= LoLab) And
  1825. (Pai_Labeled(P)^.lab^.nb <= HiLab) Then
  1826. Inc(LTable^[Pai_Labeled(P)^.lab^.nb-LoLab].RefsFound);
  1827. end;
  1828. ait_label:
  1829. Begin
  1830. If (Pai_Label(p)^.l^.is_used) Then
  1831. LTable^[Pai_Label(P)^.l^.nb-LoLab].InstrNr := NrOfPaiObjs
  1832. End;
  1833. { ait_instruction:
  1834. Begin
  1835. If (Pai386(p)^._operator = A_PUSH) And
  1836. (Pai386(p)^.op1t = top_symbol) And
  1837. (PCSymbol(Pai386(p)^.op1)^.offset = 0) Then
  1838. Begin
  1839. TmpStr := StrPas(PCSymbol(Pai386(p)^.op1)^.symbol);
  1840. If}
  1841. End;
  1842. {$EndIf JumpAnal}
  1843. Inc(NrOfPaiObjs);
  1844. GetNextInstruction(p, p);
  1845. End;
  1846. {$IfDef TP}
  1847. If (MemAvail < (SizeOf(TPaiProp)*NrOfPaiObjs))
  1848. Or (NrOfPaiObjs = 0)
  1849. {this doesn't have to be one contiguous block}
  1850. Then InitDFAPass2 := False
  1851. Else InitDFAPass2 := True;
  1852. {$Else}
  1853. {Uncomment the next line to see how much memory the reloading optimizer needs}
  1854. { Writeln((NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4)));}
  1855. {no need to check mem/maxavail, we've got as much virtual memory as we want}
  1856. If NrOfPaiObjs <> 0 Then
  1857. Begin
  1858. InitDFAPass2 := True;
  1859. GetMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4));
  1860. p := Pai(AsmL^.First);
  1861. If (p^.typ in SkipInstr) Then
  1862. GetNextInstruction(p, p);
  1863. For Count := 1 To NrOfPaiObjs Do
  1864. Begin
  1865. PaiPropBlock^[Count].LineSave := p^.fileinfo.line;
  1866. PPaiProp(p^.fileinfo.line) := @PaiPropBlock^[Count];
  1867. GetNextInstruction(p, p);
  1868. End;
  1869. End
  1870. Else InitDFAPass2 := False;
  1871. {$EndIf TP}
  1872. End;
  1873. Function DFAPass2(AsmL: PAasmOutPut): Pai;
  1874. Begin
  1875. If InitDFAPass2(AsmL)
  1876. Then DFAPass2 := DoDFAPass2(
  1877. {$ifdef statedebug}
  1878. asml,
  1879. {$endif statedebug}
  1880. Pai(AsmL^.First))
  1881. Else DFAPass2 := Nil;
  1882. End;
  1883. Procedure ShutDownDFA;
  1884. Begin
  1885. If LabDif <> 0 Then
  1886. FreeMem(LTable, LabDif*SizeOf(TLabelTableItem));
  1887. End;
  1888. End.
  1889. {
  1890. $Log$
  1891. Revision 1.20 1998-10-22 13:24:51 jonas
  1892. * changed TRegSet to a small set
  1893. Revision 1.19 1998/10/20 09:29:24 peter
  1894. * bugfix so that code like
  1895. movl 48(%esi),%esi movl 48(%esi),%esi
  1896. pushl %esi doesn't get changed to pushl %esi
  1897. movl 48(%esi),%edi movl %esi,%edi
  1898. Revision 1.18 1998/10/07 16:27:02 jonas
  1899. * changed state to WState (WriteState), added RState for future use in
  1900. instruction scheduling
  1901. * RegAlloc data from the CG is now completely being patched and corrected (I
  1902. think)
  1903. Revision 1.17 1998/10/02 17:30:20 jonas
  1904. * small patches to regdealloc data
  1905. Revision 1.16 1998/10/01 20:21:47 jonas
  1906. * inter-register CSE, still requires some tweaks (peepholeoptpass2, better RegAlloc)
  1907. Revision 1.15 1998/09/20 18:00:20 florian
  1908. * small compiling problems fixed
  1909. Revision 1.14 1998/09/20 17:12:36 jonas
  1910. * small fix for uncertain optimizations & more cleaning up
  1911. Revision 1.12 1998/09/16 18:00:01 jonas
  1912. * optimizer now completely dependant on GetNext/GetLast instruction, works again with -dRegAlloc
  1913. Revision 1.11 1998/09/15 14:05:27 jonas
  1914. * fixed optimizer incompatibilities with freelabel code in psub
  1915. Revision 1.10 1998/09/09 15:33:58 peter
  1916. * removed warnings
  1917. Revision 1.9 1998/09/03 16:24:51 florian
  1918. * bug of type conversation from dword to real fixed
  1919. * bug fix of Jonas applied
  1920. Revision 1.8 1998/08/28 10:56:59 peter
  1921. * removed warnings
  1922. Revision 1.7 1998/08/19 16:07:44 jonas
  1923. * changed optimizer switches + cleanup of DestroyRefs in daopt386.pas
  1924. Revision 1.6 1998/08/10 14:49:57 peter
  1925. + localswitches, moduleswitches, globalswitches splitting
  1926. Revision 1.5 1998/08/09 13:56:24 jonas
  1927. * small bugfix for uncertain optimizations in DestroyRefs
  1928. Revision 1.4 1998/08/06 19:40:25 jonas
  1929. * removed $ before and after Log in comment
  1930. Revision 1.3 1998/08/05 16:00:14 florian
  1931. * some fixes for ansi strings
  1932. * log to Log changed
  1933. }