daopt386.pas 75 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044
  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 TRegister;
  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. Var hp: Pai;
  1001. Begin
  1002. Repeat
  1003. While Assigned(p) And
  1004. ((p^.typ in (SkipInstr - [ait_RegAlloc, ait_RegDealloc])) or
  1005. ((p^.typ = ait_label) And
  1006. Not(Pai_Label(p)^.l^.is_used))) Do
  1007. p := Pai(p^.next);
  1008. While Assigned(p) And
  1009. (p^.typ in [ait_RegAlloc, ait_RegDealloc]) Do
  1010. Begin
  1011. Case p^.typ Of
  1012. ait_RegAlloc: UsedRegs := UsedRegs + [PaiRegAlloc(p)^.Reg];
  1013. ait_regdealloc: UsedRegs := UsedRegs - [PaiRegDeAlloc(p)^.Reg];
  1014. End;
  1015. p := pai(p^.next);
  1016. End;
  1017. Until Not(Assigned(p)) Or
  1018. (Not(p^.typ in SkipInstr) And
  1019. Not((p^.typ = ait_label) And
  1020. Not(Pai_Label(p)^.l^.is_used)));
  1021. End;
  1022. (*Function FindZeroreg(p: Pai; Var Result: TRegister): Boolean;
  1023. {Finds a register which contains the constant zero}
  1024. Var Counter: TRegister;
  1025. Begin
  1026. Counter := R_EAX;
  1027. FindZeroReg := True;
  1028. While (Counter <= R_EDI) And
  1029. ((PPaiProp(p^.fileinfo.line)^.Regs[Counter].Typ <> Con_Const) or
  1030. (PPaiProp(p^.fileinfo.line)^.Regs[Counter].StartMod <> Pointer(0))) Do
  1031. Inc(Byte(Counter));
  1032. If (PPaiProp(p^.fileinfo.line)^.Regs[Counter].Typ = Con_Const) And
  1033. (PPaiProp(p^.fileinfo.line)^.Regs[Counter].StartMod = Pointer(0))
  1034. Then Result := Counter
  1035. Else FindZeroReg := False;
  1036. End;*)
  1037. Function TCh2Reg(Ch: TChange): TRegister;
  1038. {converts a TChange variable to a TRegister}
  1039. Begin
  1040. If (Ch <= C_REDI) Then
  1041. TCh2Reg := TRegister(Byte(Ch))
  1042. Else
  1043. If (Ch <= C_WEDI) Then
  1044. TCh2Reg := TRegister(Byte(Ch) - Byte(C_REDI))
  1045. Else
  1046. If (Ch <= C_RWEDI) Then
  1047. TCh2Reg := TRegister(Byte(Ch) - Byte(C_WEDI))
  1048. Else InternalError($db)
  1049. End;
  1050. Procedure IncState(Var S: Byte);
  1051. {Increases S by 1, wraps around at $ffff to 0 (so we won't get overflow
  1052. errors}
  1053. Begin
  1054. If (s <> $ff)
  1055. Then Inc(s)
  1056. Else s := 0
  1057. End;
  1058. Function RegInSequence(Reg: TRegister; Const Content: TContent): Boolean;
  1059. {checks the whole sequence of Content (so StartMod and and the next NrOfMods
  1060. Pai objects) to see whether Reg is used somewhere, without it being loaded
  1061. with something else first}
  1062. Var p: Pai;
  1063. Counter: Byte;
  1064. TmpResult: Boolean;
  1065. RegsChecked: TRegSet;
  1066. Begin
  1067. RegsChecked := [];
  1068. p := Content.StartMod;
  1069. TmpResult := False;
  1070. Counter := 1;
  1071. While Not(TmpResult) And
  1072. (Counter <= Content.NrOfMods) Do
  1073. Begin
  1074. If (p^.typ = ait_instruction) and
  1075. (Pai386(p)^._operator in [A_MOV, A_MOVZX, A_MOVSX])
  1076. Then
  1077. If (Pai386(p)^.op1t = top_ref)
  1078. Then
  1079. With TReference(Pai386(p)^.op1^) Do
  1080. If (Base = ProcInfo.FramePointer) And
  1081. (Index = R_NO)
  1082. Then RegsChecked := RegsChecked + [Reg32(TRegister(Pai386(p)^.op2))]
  1083. Else
  1084. Begin
  1085. If (Base = Reg) And
  1086. Not(Base In RegsChecked)
  1087. Then TmpResult := True;
  1088. If Not(TmpResult) And
  1089. (Index = Reg) And
  1090. Not(Index In RegsChecked)
  1091. Then TmpResult := True;
  1092. End;
  1093. Inc(Counter);
  1094. GetNextInstruction(p,p)
  1095. End;
  1096. RegInSequence := TmpResult
  1097. End;
  1098. Procedure DestroyReg(p1: PPaiProp; Reg: TRegister);
  1099. {Destroys the contents of the register Reg in the PPaiProp p1, as well as the
  1100. contents of registers are loaded with a memory location based on Reg}
  1101. Var TmpState: Byte;
  1102. Counter: TRegister;
  1103. Begin
  1104. Reg := Reg32(Reg);
  1105. NrOfInstrSinceLastMod[Reg] := 0;
  1106. If (Reg >= R_EAX) And (Reg <= R_EDI)
  1107. Then
  1108. Begin
  1109. With p1^.Regs[Reg] Do
  1110. Begin
  1111. IncState(WState);
  1112. TmpState := WState;
  1113. FillChar(p1^.Regs[Reg], SizeOf(TContent), 0);
  1114. WState := TmpState;
  1115. End;
  1116. For Counter := R_EAX to R_EDI Do
  1117. With p1^.Regs[Counter] Do
  1118. If (Typ = Con_Ref) And
  1119. RegInSequence(Reg, p1^.Regs[Counter])
  1120. Then
  1121. Begin
  1122. IncState(WState);
  1123. TmpState := WState;
  1124. FillChar(p1^.Regs[Counter], SizeOf(TContent), 0);
  1125. WState := TmpState;
  1126. End;
  1127. End;
  1128. End;
  1129. {Procedure AddRegsToSet(p: Pai; Var RegSet: TRegSet);
  1130. Begin
  1131. If (p^.typ = ait_instruction) Then
  1132. Begin
  1133. Case Pai386(p)^.op1t Of
  1134. top_reg:
  1135. If Not(TRegister(Pai386(p)^.op1) in [R_NO,R_ESP,ProcInfo.FramePointer]) Then
  1136. RegSet := RegSet + [TRegister(Pai386(p)^.op1)];
  1137. top_ref:
  1138. With TReference(Pai386(p)^.op1^) Do
  1139. Begin
  1140. If Not(Base in [ProcInfo.FramePointer,R_NO,R_ESP])
  1141. Then RegSet := RegSet + [Base];
  1142. If Not(Index in [ProcInfo.FramePointer,R_NO,R_ESP])
  1143. Then RegSet := RegSet + [Index];
  1144. End;
  1145. End;
  1146. Case Pai386(p)^.op2t Of
  1147. top_reg:
  1148. If Not(TRegister(Pai386(p)^.op2) in [R_NO,R_ESP,ProcInfo.FramePointer]) Then
  1149. RegSet := RegSet + [TRegister(Pai386(p)^.op2)];
  1150. top_ref:
  1151. With TReference(Pai386(p)^.op2^) Do
  1152. Begin
  1153. If Not(Base in [ProcInfo.FramePointer,R_NO,R_ESP])
  1154. Then RegSet := RegSet + [Base];
  1155. If Not(Index in [ProcInfo.FramePointer,R_NO,R_ESP])
  1156. Then RegSet := RegSet + [Index];
  1157. End;
  1158. End;
  1159. End;
  1160. End;}
  1161. Function OpsEquivalent(typ: Longint; OldOp, NewOp: Pointer; Var RegInfo: TRegInfo): Boolean;
  1162. Begin {checks whether the two ops are equivalent}
  1163. Case typ Of
  1164. Top_Reg: OpsEquivalent := RegsEquivalent(TRegister(OldOp), TRegister(NewOp), RegInfo);
  1165. Top_Const: OpsEquivalent := OldOp = NewOp;
  1166. Top_Ref: OpsEquivalent := RefsEquivalent(TReference(OldOp^), TReference(NewOp^), RegInfo);
  1167. Top_None: OpsEquivalent := True
  1168. Else OpsEquivalent := False
  1169. End;
  1170. End;
  1171. (*Function OpsEqual(typ: Longint; op1, op2: Pointer): Boolean;
  1172. Begin {checks whether the two ops are equal}
  1173. Case typ Of
  1174. Top_Reg, Top_Const: OpsEqual := op1 = op2;
  1175. Top_Ref: OpsEqual := RefsEqual(TReference(op1^), TReference(op2^));
  1176. Top_None: OpsEqual := True
  1177. Else OpsEqual := False
  1178. End;
  1179. End; *)
  1180. Function InstructionsEquivalent(p1, p2: Pai; Var RegInfo: TRegInfo): Boolean;
  1181. Begin {checks whether two Pai386 instructions are equal}
  1182. If Assigned(p1) And Assigned(p2) And
  1183. (Pai(p1)^.typ = ait_instruction) And
  1184. (Pai(p1)^.typ = ait_instruction) And
  1185. (Pai386(p1)^._operator = Pai386(p2)^._operator) And
  1186. (Pai386(p1)^.op1t = Pai386(p2)^.op1t) And
  1187. (Pai386(p1)^.op2t = Pai386(p2)^.op2t)
  1188. Then
  1189. {both instructions have the same structure:
  1190. "<operator> <operand of type1>, <operand of type 2>"}
  1191. If (Pai386(p1)^._operator in [A_MOV, A_MOVZX, A_MOVSX]) And
  1192. (Pai386(p1)^.op1t = top_ref) {then op2t = top_reg} Then
  1193. If Not(RegInRef(TRegister(Pai386(p1)^.op2), TReference(Pai386(p1)^.op1^))) Then
  1194. {the "old" instruction is a load of a register with a new value, not with
  1195. a value based on the contents of this register (so no "mov (reg), reg")}
  1196. If Not(RegInRef(TRegister(Pai386(p2)^.op2), TReference(Pai386(p2)^.op1^))) And
  1197. RefsEqual(TReference(Pai386(p1)^.op1^), TReference(Pai386(p2)^.op1^))
  1198. Then
  1199. {the "new" instruction is also a load of a register with a new value, and
  1200. this value is fetched from the same memory location}
  1201. Begin
  1202. With TReference(Pai386(p2)^.op1^) Do
  1203. Begin
  1204. If Not(Base in [ProcInfo.FramePointer, R_NO, R_ESP])
  1205. {it won't do any harm if the register is already in RegsLoadedForRef}
  1206. Then RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Base];
  1207. If Not(Index in [ProcInfo.FramePointer, R_NO, R_ESP])
  1208. Then RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Index];
  1209. End;
  1210. {add the registers from the reference (op1) to the RegInfo, all registers
  1211. from the reference are the same in the old and in the new instruction
  1212. sequence}
  1213. AddOp2RegInfo(Pai386(p1)^.op1t, Pai386(p1)^.op1, RegInfo);
  1214. {the registers from op2 have to be equivalent, but not necessarily equal}
  1215. InstructionsEquivalent :=
  1216. RegsEquivalent(TRegister(Pai386(p1)^.op2), TRegister(Pai386(p2)^.op2),
  1217. RegInfo);
  1218. End
  1219. {the registers are loaded with values from different memory locations. If
  1220. this was allowed, the instructions "mov -4(esi),eax" and "mov -4(ebp),eax"
  1221. would be considered equivalent}
  1222. Else InstructionsEquivalent := False
  1223. Else
  1224. {load register with a value based on the current value of this register}
  1225. Begin
  1226. With TReference(Pai386(p2)^.op1^) Do
  1227. Begin
  1228. If Not(Base in [ProcInfo.FramePointer,
  1229. Reg32(TRegister(Pai386(p2)^.op2)),R_NO,R_ESP])
  1230. {it won't do any harm if the register is already in RegsLoadedForRef}
  1231. Then
  1232. {$ifdef csdebug}
  1233. Begin
  1234. {$endif csdebug}
  1235. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Base];
  1236. {$ifdef csdebug}
  1237. Writeln(att_reg2str[base], ' added');
  1238. end;
  1239. {$endif csdebug}
  1240. If Not(Index in [ProcInfo.FramePointer,
  1241. Reg32(TRegister(Pai386(p2)^.op2)),R_NO,R_ESP])
  1242. Then
  1243. {$ifdef csdebug}
  1244. Begin
  1245. {$endif csdebug}
  1246. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Index];
  1247. {$ifdef csdebug}
  1248. Writeln(att_reg2str[index], ' added');
  1249. end;
  1250. {$endif csdebug}
  1251. End;
  1252. If Not(Reg32(TRegister(Pai386(p2)^.op2)) In [ProcInfo.FramePointer,
  1253. R_NO,R_ESP])
  1254. Then
  1255. {$ifdef csdebug}
  1256. Begin
  1257. {$endif csdebug}
  1258. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef -
  1259. [Reg32(TRegister(Pai386(p2)^.op2))];
  1260. {$ifdef csdebug}
  1261. Writeln(att_reg2str[Reg32(TRegister(Pai386(p2)^.op2))], ' removed');
  1262. end;
  1263. {$endif csdebug}
  1264. InstructionsEquivalent :=
  1265. OpsEquivalent(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1, RegInfo) And
  1266. OpsEquivalent(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2, RegInfo)
  1267. End
  1268. Else
  1269. {an instruction <> mov, movzx, movsx}
  1270. InstructionsEquivalent :=
  1271. OpsEquivalent(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1, RegInfo) And
  1272. OpsEquivalent(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2, RegInfo)
  1273. {the instructions haven't even got the same structure, so they're certainly
  1274. not equivalent}
  1275. Else InstructionsEquivalent := False;
  1276. End;
  1277. (*
  1278. Function InstructionsEqual(p1, p2: Pai): Boolean;
  1279. Begin {checks whether two Pai386 instructions are equal}
  1280. InstructionsEqual :=
  1281. Assigned(p1) And Assigned(p2) And
  1282. ((Pai(p1)^.typ = ait_instruction) And
  1283. (Pai(p1)^.typ = ait_instruction) And
  1284. (Pai386(p1)^._operator = Pai386(p2)^._operator) And
  1285. (Pai386(p1)^.op1t = Pai386(p2)^.op1t) And
  1286. (Pai386(p1)^.op2t = Pai386(p2)^.op2t) And
  1287. OpsEqual(Pai386(p1)^.op1t, Pai386(p1)^.op1, Pai386(p2)^.op1) And
  1288. OpsEqual(Pai386(p1)^.op2t, Pai386(p1)^.op2, Pai386(p2)^.op2))
  1289. End;
  1290. *)
  1291. Function RefInInstruction(Const Ref: TReference; p: Pai): Boolean;
  1292. {checks whehter Ref is used in P}
  1293. Var TmpResult: Boolean;
  1294. Begin
  1295. TmpResult := False;
  1296. If (p^.typ = ait_instruction) Then
  1297. Begin
  1298. If (Pai386(p)^.op1t = Top_Ref)
  1299. Then TmpResult := RefsEqual(Ref, TReference(Pai386(p)^.op1^));
  1300. If Not(TmpResult) And
  1301. (Pai386(p)^.op2t = Top_Ref)
  1302. Then TmpResult := RefsEqual(Ref, TReference(Pai386(p)^.op2^));
  1303. End;
  1304. RefInInstruction := TmpResult;
  1305. End;
  1306. Function RefInSequence(Const Ref: TReference; Content: TContent): Boolean;
  1307. {checks the whole sequence of Content (so StartMod and and the next NrOfMods
  1308. Pai objects) to see whether Ref is used somewhere}
  1309. Var p: Pai;
  1310. Counter: Byte;
  1311. TmpResult: Boolean;
  1312. Begin
  1313. p := Content.StartMod;
  1314. TmpResult := False;
  1315. Counter := 1;
  1316. While Not(TmpResult) And
  1317. (Counter <= Content.NrOfMods) Do
  1318. Begin
  1319. If (p^.typ = ait_instruction) And
  1320. RefInInstruction(Ref, p)
  1321. Then TmpResult := True;
  1322. Inc(Counter);
  1323. GetNextInstruction(p,p)
  1324. End;
  1325. RefInSequence := TmpResult
  1326. End;
  1327. Procedure DestroyRefs(p: pai; Const Ref: TReference; WhichReg: TRegister);
  1328. {destroys all registers which possibly contain a reference to Ref, WhichReg
  1329. is the register whose contents are being written to memory (if this proc
  1330. is called because of a "mov?? %reg, (mem)" instruction)}
  1331. Var Counter: TRegister;
  1332. Begin
  1333. WhichReg := Reg32(WhichReg);
  1334. If ((Ref.base = ProcInfo.FramePointer) And
  1335. (Ref.Index = R_NO)) Or
  1336. Assigned(Ref.Symbol)
  1337. Then
  1338. {write something to a parameter, a local or global variable, so
  1339. * with uncertzain optimizations on:
  1340. - destroy the contents of registers whose contents have somewhere a
  1341. "mov?? (Ref), %reg". WhichReg (this is the register whose contents
  1342. are being written to memory) is not destroyed if it's StartMod is
  1343. of that form and NrOfMods = 1 (so if it holds ref, but is not a
  1344. pointer based on Ref)
  1345. * with uncertain optimizations off:
  1346. - also destroy registers that contain any pointer}
  1347. For Counter := R_EAX to R_EDI Do
  1348. With PPaiProp(p^.fileinfo.line)^.Regs[Counter] Do
  1349. Begin
  1350. If (typ = Con_Ref) And
  1351. (Not(cs_UncertainOpts in aktglobalswitches) And
  1352. (NrOfMods <> 1)
  1353. ) Or
  1354. (RefInSequence(Ref,PPaiProp(p^.fileinfo.line)^.Regs[Counter]) And
  1355. ((Counter <> WhichReg) Or
  1356. ((NrOfMods = 1) And
  1357. {StarMod is always of the type ait_instruction}
  1358. (Pai386(StartMod)^.op1t = top_ref) And
  1359. RefsEqual(TReference(Pai386(StartMod)^.op1^), Ref)
  1360. )
  1361. )
  1362. )
  1363. Then DestroyReg(PPaiProp(p^.fileinfo.line), Counter)
  1364. End
  1365. Else
  1366. {write something to a pointer location, so
  1367. * with uncertain optimzations on:
  1368. - do not destroy registers which contain a local/global variable or a
  1369. parameter, except if DestroyRefs is called because of a "movsl"
  1370. * with uncertain optimzations off:
  1371. - destroy every register which contains a memory location
  1372. }
  1373. For Counter := R_EAX to R_EDI Do
  1374. With PPaiProp(p^.fileinfo.line)^.Regs[Counter] Do
  1375. If (typ = Con_Ref) And
  1376. (Not(cs_UncertainOpts in aktglobalswitches) Or
  1377. {for movsl}
  1378. (Ref.Base = R_EDI) Or
  1379. {don't destroy if reg contains a parameter, local or global variable}
  1380. Not((NrOfMods = 1) And
  1381. (Pai386(StartMod)^.op1t = top_ref) And
  1382. ((PReference(Pai386(StartMod)^.op1)^.base = ProcInfo.FramePointer) Or
  1383. Assigned(PReference(Pai386(StartMod)^.op1)^.Symbol)
  1384. )
  1385. )
  1386. )
  1387. Then DestroyReg(PPaiProp(p^.FileInfo.Line), Counter)
  1388. End;
  1389. Procedure DestroyAllRegs(p: PPaiProp);
  1390. Var Counter: TRegister;
  1391. Begin {initializes/desrtoys all registers}
  1392. For Counter := R_EAX To R_EDI Do
  1393. DestroyReg(p, Counter);
  1394. p^.DirFlag := F_Unknown;
  1395. End;
  1396. Procedure Destroy(PaiObj: Pai; opt: Longint; Op: Pointer);
  1397. Begin
  1398. Case opt Of
  1399. top_reg: DestroyReg(PPaiProp(PaiObj^.fileinfo.line), TRegister(Op));
  1400. top_ref: DestroyRefs(PaiObj, TReference(Op^), R_NO);
  1401. top_symbol:;
  1402. End;
  1403. End;
  1404. Procedure DFAPass1(AsmL: PAasmOutput);
  1405. {gathers the RegAlloc data... still need to think about where to store it}
  1406. Begin
  1407. FindLoHiLabels(AsmL, LoLab, HiLab, LabDif);
  1408. BuildLabelTableAndFixRegAlloc(AsmL, LTable, LoLab, LabDif);
  1409. End;
  1410. Function DoDFAPass2(
  1411. {$Ifdef StateDebug}
  1412. AsmL: PAasmOutput;
  1413. {$endif statedebug}
  1414. First: Pai): Pai;
  1415. {Analyzes the Data Flow of an assembler list. Starts creating the reg
  1416. contents for the instructions starting with p. Returns the last pai which has
  1417. been processed}
  1418. Var
  1419. CurProp: PPaiProp;
  1420. {$ifdef AnalyzeLoops}
  1421. TmpState: Byte;
  1422. {$endif AnalyzeLoops}
  1423. Cnt, InstrCnt : Longint;
  1424. InstrProp: TAsmInstrucProp;
  1425. UsedRegs: TRegSet;
  1426. p, hp : Pai;
  1427. TmpRef: TReference;
  1428. TmpReg: TRegister;
  1429. Begin
  1430. p := First;
  1431. UsedRegs := [];
  1432. UpdateUsedregs(UsedRegs, p);
  1433. If (First^.typ in SkipInstr) Then
  1434. GetNextInstruction(p, p);
  1435. First := p;
  1436. InstrCnt := 1;
  1437. FillChar(NrOfInstrSinceLastMod, SizeOf(NrOfInstrSinceLastMod), 0);
  1438. While Assigned(p) Do
  1439. Begin
  1440. DoDFAPass2 := p;
  1441. {$IfDef TP}
  1442. New(CurProp);
  1443. {$Else TP}
  1444. CurProp := @PaiPropBlock^[InstrCnt];
  1445. {$EndIf TP}
  1446. If (p <> First)
  1447. Then
  1448. Begin
  1449. {$ifdef JumpAnal}
  1450. If (p^.Typ <> ait_label) Then
  1451. {$endif JumpAnal}
  1452. Begin
  1453. GetLastInstruction(p, hp);
  1454. CurProp^.Regs := PPaiProp(hp^.fileinfo.line)^.Regs;
  1455. CurProp^.DirFlag := PPaiProp(hp^.fileinfo.line)^.DirFlag;
  1456. End
  1457. End
  1458. Else
  1459. Begin
  1460. FillChar(CurProp^, SizeOf(CurProp^), 0);
  1461. { For TmpReg := R_EAX to R_EDI Do
  1462. CurProp^.Regs[TmpReg].WState := 1;}
  1463. End;
  1464. CurProp^.UsedRegs := UsedRegs;
  1465. CurProp^.CanBeRemoved := False;
  1466. UpdateUsedRegs(UsedRegs, Pai(p^.Next));
  1467. {$ifdef TP}
  1468. CurProp^.linesave := p^.fileinfo.line;
  1469. PPaiProp(p^.fileinfo.line) := CurProp;
  1470. {$Endif TP}
  1471. For TmpReg := R_EAX To R_EDI Do
  1472. Inc(NrOfInstrSinceLastMod[TmpReg]);
  1473. Case p^.typ Of
  1474. ait_label:
  1475. {$Ifndef JumpAnal}
  1476. If (Pai_label(p)^.l^.is_used) Then
  1477. DestroyAllRegs(CurProp);
  1478. {$Else JumpAnal}
  1479. Begin
  1480. If (Pai_Label(p)^.is_used) Then
  1481. With LTable^[Pai_Label(p)^.l^.nb-LoLab] Do
  1482. {$IfDef AnalyzeLoops}
  1483. If (RefsFound = Pai_Label(p)^.l^.RefCount)
  1484. {$Else AnalyzeLoops}
  1485. If (JmpsProcessed = Pai_Label(p)^.l^.RefCount)
  1486. {$EndIf AnalyzeLoops}
  1487. Then
  1488. {all jumps to this label have been found}
  1489. {$IfDef AnalyzeLoops}
  1490. If (JmpsProcessed > 0)
  1491. Then
  1492. {$EndIf AnalyzeLoops}
  1493. {we've processed at least one jump to this label}
  1494. Begin
  1495. If (GetLastInstruction(p, hp) And
  1496. Not(((hp^.typ = ait_labeled_instruction) or
  1497. (hp^.typ = ait_instruction)) And
  1498. (Pai_Labeled(hp)^._operator = A_JMP))
  1499. Then
  1500. {previous instruction not a JMP -> the contents of the registers after the
  1501. previous intruction has been executed have to be taken into account as well}
  1502. For TmpReg := R_EAX to R_EDI Do
  1503. Begin
  1504. If (CurProp^.Regs[TmpReg].WState <>
  1505. PPaiProp(hp^.FileInfo.Line)^.Regs[TmpReg].WState)
  1506. Then DestroyReg(CurProp, TmpReg)
  1507. End
  1508. End
  1509. {$IfDef AnalyzeLoops}
  1510. Else
  1511. {a label from a backward jump (e.g. a loop), no jump to this label has
  1512. already been processed}
  1513. If GetLastInstruction(p, hp) And
  1514. Not(hp^.typ = ait_labeled_instruction) And
  1515. (Pai_Labeled(hp)^._operator = A_JMP))
  1516. Then
  1517. {previous instruction not a jmp, so keep all the registers' contents from the
  1518. previous instruction}
  1519. Begin
  1520. CurProp^.Regs := PPaiProp(hp^.FileInfo.Line)^.Regs;
  1521. CurProp^.DirFlag := PPaiProp(hp^.FileInfo.Line)^.DirFlag;
  1522. End
  1523. Else
  1524. {previous instruction a jmp and no jump to this label processed yet}
  1525. Begin
  1526. hp := p;
  1527. Cnt := InstrCnt;
  1528. {continue until we find a jump to the label or a label which has already
  1529. been processed}
  1530. While GetNextInstruction(hp, hp) And
  1531. Not((hp^.typ = ait_labeled_instruction) And
  1532. (Pai_Labeled(hp)^.lab^.nb = Pai_Label(p)^.l^.nb)) And
  1533. Not((hp^.typ = ait_label) And
  1534. (LTable^[Pai_Label(hp)^.l^.nb-LoLab].RefsFound
  1535. = Pai_Label(hp)^.l^.RefCount) And
  1536. (LTable^[Pai_Label(hp)^.l^.nb-LoLab].JmpsProcessed > 0)) Do
  1537. Inc(Cnt);
  1538. If (hp^.typ = ait_label)
  1539. Then
  1540. {there's a processed label after the current one}
  1541. Begin
  1542. CurProp^.Regs := PaiPropBlock^[Cnt].Regs;
  1543. CurProp^.DirFlag := PaiPropBlock^[Cnt].DirFlag;
  1544. End
  1545. Else
  1546. {there's no label anymore after the current one, or they haven't been
  1547. processed yet}
  1548. Begin
  1549. GetLastInstruction(p, hp);
  1550. CurProp^.Regs := PPaiProp(hp^.FileInfo.Line)^.Regs;
  1551. CurProp^.DirFlag := PPaiProp(hp^.FileInfo.Line)^.DirFlag;
  1552. DestroyAllRegs(PPaiProp(hp^.FileInfo.Line))
  1553. End
  1554. End
  1555. {$EndIf AnalyzeLoops}
  1556. Else
  1557. {not all references to this label have been found, so destroy all registers}
  1558. Begin
  1559. GetLastInstruction(p, hp);
  1560. CurProp^.Regs := PPaiProp(hp^.FileInfo.Line)^.Regs;
  1561. CurProp^.DirFlag := PPaiProp(hp^.FileInfo.Line)^.DirFlag;
  1562. DestroyAllRegs(CurProp)
  1563. End;
  1564. End;
  1565. {$EndIf JumpAnal}
  1566. ait_labeled_instruction:
  1567. {$IfNDef JumpAnal}
  1568. ;
  1569. {$Else JumpAnal}
  1570. With LTable^[Pai_Labeled(p)^.lab^.nb-LoLab] Do
  1571. If (RefsFound = Pai_Labeled(p)^.lab^.RefCount) Then
  1572. Begin
  1573. If (InstrCnt < InstrNr)
  1574. Then
  1575. {forward jump}
  1576. If (JmpsProcessed = 0) Then
  1577. {no jump to this label has been processed yet}
  1578. Begin
  1579. PaiPropBlock^[InstrNr].Regs := CurProp^.Regs;
  1580. PaiPropBlock^[InstrNr].DirFlag := CurProp^.DirFlag;
  1581. Inc(JmpsProcessed);
  1582. End
  1583. Else
  1584. Begin
  1585. For TmpReg := R_EAX to R_EDI Do
  1586. If (PaiPropBlock^[InstrNr].Regs[TmpReg].WState <>
  1587. CurProp^.Regs[TmpReg].WState) Then
  1588. DestroyReg(@PaiPropBlock^[InstrNr], TmpReg);
  1589. Inc(JmpsProcessed);
  1590. End
  1591. {$ifdef AnalyzeLoops}
  1592. Else
  1593. { backward jump, a loop for example}
  1594. { If (JmpsProcessed > 0) Or
  1595. Not(GetLastInstruction(PaiObj, hp) And
  1596. (hp^.typ = ait_labeled_instruction) And
  1597. (Pai_Labeled(hp)^._operator = A_JMP))
  1598. Then}
  1599. {instruction prior to label is not a jmp, or at least one jump to the label
  1600. has yet been processed}
  1601. Begin
  1602. Inc(JmpsProcessed);
  1603. For TmpReg := R_EAX to R_EDI Do
  1604. If (PaiPropBlock^[InstrNr].Regs[TmpReg].WState <>
  1605. CurProp^.Regs[TmpReg].WState)
  1606. Then
  1607. Begin
  1608. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1609. Cnt := InstrNr;
  1610. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1611. Begin
  1612. DestroyReg(@PaiPropBlock^[Cnt], TmpReg);
  1613. Inc(Cnt);
  1614. End;
  1615. While (Cnt <= InstrCnt) Do
  1616. Begin
  1617. Inc(PaiPropBlock^[Cnt].Regs[TmpReg].WState);
  1618. Inc(Cnt)
  1619. End
  1620. End;
  1621. End
  1622. { Else }
  1623. {instruction prior to label is a jmp and no jumps to the label have yet been
  1624. processed}
  1625. { Begin
  1626. Inc(JmpsProcessed);
  1627. For TmpReg := R_EAX to R_EDI Do
  1628. Begin
  1629. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1630. Cnt := InstrNr;
  1631. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1632. Begin
  1633. PaiPropBlock^[Cnt].Regs[TmpReg] := CurProp^.Regs[TmpReg];
  1634. Inc(Cnt);
  1635. End;
  1636. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1637. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1638. Begin
  1639. DestroyReg(@PaiPropBlock^[Cnt], TmpReg);
  1640. Inc(Cnt);
  1641. End;
  1642. While (Cnt <= InstrCnt) Do
  1643. Begin
  1644. Inc(PaiPropBlock^[Cnt].Regs[TmpReg].WState);
  1645. Inc(Cnt)
  1646. End
  1647. End
  1648. End}
  1649. {$endif AnalyzeLoops}
  1650. End;
  1651. {$EndIf JumpAnal}
  1652. {$ifdef GDB}
  1653. ait_stabs, ait_stabn, ait_stab_function_name:;
  1654. {$endif GDB}
  1655. ait_instruction:
  1656. Begin
  1657. InstrProp := AsmInstr[Pai386(p)^._operator];
  1658. Case Pai386(p)^._operator Of
  1659. A_MOV, A_MOVZX, A_MOVSX:
  1660. Begin
  1661. Case Pai386(p)^.op1t Of
  1662. Top_Reg:
  1663. Case Pai386(p)^.op2t Of
  1664. Top_Reg:
  1665. Begin
  1666. DestroyReg(CurProp, TRegister(Pai386(p)^.op2));
  1667. { CurProp^.Regs[TRegister(Pai386(p)^.op2)] :=
  1668. CurProp^.Regs[TRegister(Pai386(p)^.op1)];
  1669. If (CurProp^.Regs[TRegister(Pai386(p)^.op2)].ModReg = R_NO) Then
  1670. CurProp^.Regs[TRegister(Pai386(p)^.op2)].ModReg :=
  1671. Tregister(Pai386(p)^.op1);}
  1672. End;
  1673. Top_Ref: DestroyRefs(p, TReference(Pai386(p)^.op2^), TRegister(Pai386(p)^.op1));
  1674. End;
  1675. Top_Ref:
  1676. Begin {destination is always a register in this case}
  1677. TmpReg := Reg32(TRegister(Pai386(p)^.op2));
  1678. If RegInRef(TmpReg, TReference(Pai386(p)^.op1^)) And
  1679. (CurProp^.Regs[TmpReg].Typ = Con_Ref)
  1680. Then
  1681. Begin
  1682. With CurProp^.Regs[TmpReg] Do
  1683. Begin
  1684. IncState(WState);
  1685. {also store how many instructions are part of the sequence in the first
  1686. instructions PPaiProp, so it can be easily accessed from within
  1687. CheckSequence}
  1688. Inc(NrOfMods, NrOfInstrSinceLastMod[TmpReg]);
  1689. PPaiProp(Pai(StartMod)^.fileinfo.line)^.Regs[TmpReg].NrOfMods := NrOfMods;
  1690. NrOfInstrSinceLastMod[TmpReg] := 0;
  1691. End;
  1692. End
  1693. Else
  1694. Begin
  1695. DestroyReg(CurProp, TmpReg);
  1696. With CurProp^.Regs[TmpReg] Do
  1697. Begin
  1698. Typ := Con_Ref;
  1699. StartMod := p;
  1700. NrOfMods := 1;
  1701. End;
  1702. End;
  1703. {$ifdef StateDebug}
  1704. hp := new(pai_asm_comment,init(strpnew(att_reg2str[TmpReg]+': '+tostr(CurProp^.Regs[TmpReg].WState))));
  1705. InsertLLItem(AsmL, p, p^.next, hp);
  1706. {$endif StateDebug}
  1707. End;
  1708. Top_Const:
  1709. Begin
  1710. Case Pai386(p)^.op2t Of
  1711. Top_Reg:
  1712. Begin
  1713. TmpReg := Reg32(TRegister(Pai386(p)^.op2));
  1714. With CurProp^.Regs[TmpReg] Do
  1715. Begin
  1716. DestroyReg(CurProp, TmpReg);
  1717. typ := Con_Const;
  1718. StartMod := Pai386(p)^.op1;
  1719. End
  1720. End;
  1721. Top_Ref: DestroyRefs(P, TReference(Pai386(p)^.op2^), R_NO);
  1722. End;
  1723. End;
  1724. End;
  1725. End;
  1726. A_IMUL:
  1727. Begin
  1728. If (Pai386(p)^.Op3t = top_none)
  1729. Then
  1730. If (Pai386(p)^.Op2t = top_none)
  1731. Then
  1732. Begin
  1733. DestroyReg(CurProp, R_EAX);
  1734. DestroyReg(CurProp, R_EDX)
  1735. End
  1736. Else
  1737. Begin
  1738. If (Pai386(p)^.Op2t = top_reg) Then
  1739. DestroyReg(CurProp, TRegister(Pai386(p)^.Op2));
  1740. End
  1741. Else If (Pai386(p)^.Op3t = top_reg) Then
  1742. DestroyReg(CurProp, TRegister(longint(twowords(Pai386(p)^.Op2).word2)));
  1743. End;
  1744. A_XOR:
  1745. Begin
  1746. If (Pai386(p)^.op1t = top_reg) And
  1747. (Pai386(p)^.op2t = top_reg) And
  1748. (Pai386(p)^.op1 = Pai386(p)^.op2)
  1749. Then
  1750. Begin
  1751. DestroyReg(CurProp, Tregister(Pai386(p)^.op1));
  1752. CurProp^.Regs[Reg32(Tregister(Pai386(p)^.op1))].typ := Con_Const;
  1753. CurProp^.Regs[Reg32(Tregister(Pai386(p)^.op1))].StartMod := Pointer(0)
  1754. End
  1755. Else Destroy(p, Pai386(p)^.op2t, Pai386(p)^.op2);
  1756. End
  1757. Else
  1758. Begin
  1759. Cnt := 1;
  1760. While (Cnt <= MaxCh) And
  1761. (InstrProp.Ch[Cnt] <> C_None) Do
  1762. Begin
  1763. Case InstrProp.Ch[Cnt] Of
  1764. C_REAX..C_REDI: ;
  1765. C_WEAX..C_RWEDI: DestroyReg(CurProp, TCh2Reg(InstrProp.Ch[Cnt]));
  1766. C_CDirFlag: CurProp^.DirFlag := F_NotSet;
  1767. C_SDirFlag: CurProp^.DirFlag := F_Set;
  1768. C_ROp1:;
  1769. C_ROp2:;
  1770. C_ROp3:;
  1771. C_WOp1..C_RWOp1: Destroy(p, Pai386(p)^.op1t, Pai386(p)^.op1);
  1772. C_WOp2..C_RWOp2: Destroy(p, Pai386(p)^.op2t, Pai386(p)^.op2);
  1773. C_WOp3..C_RWOp3: Destroy(p, Pai386(p)^.op3t, Pointer(Longint(TwoWords(Pai386(p)^.op2).word2)));
  1774. C_MemEDI:
  1775. Begin
  1776. FillChar(TmpRef, SizeOf(TmpRef), 0);
  1777. TmpRef.Base := R_EDI;
  1778. DestroyRefs(p, TmpRef, R_NO)
  1779. End;
  1780. C_RFlags, C_WFlags, C_RWFlags, C_FPU:
  1781. Else
  1782. Begin
  1783. DestroyAllRegs(CurProp);
  1784. End;
  1785. End;
  1786. Inc(Cnt);
  1787. End
  1788. End;
  1789. End;
  1790. End
  1791. Else
  1792. Begin
  1793. DestroyAllRegs(CurProp);
  1794. End;
  1795. End;
  1796. Inc(InstrCnt);
  1797. GetNextInstruction(p, p);
  1798. End;
  1799. End;
  1800. Function InitDFAPass2(AsmL: PAasmOutput): Boolean;
  1801. {reserves memory for the PPaiProps in one big memory block when not using
  1802. TP, returns False if not enough memory is available for the optimizer in all
  1803. cases}
  1804. Var p: Pai;
  1805. Count: Longint;
  1806. { TmpStr: String; }
  1807. Begin
  1808. P := Pai(AsmL^.First);
  1809. If (p^.typ in SkipInstr) Then
  1810. GetNextInstruction(p, p);
  1811. NrOfPaiObjs := 0;
  1812. While Assigned(P) Do
  1813. Begin
  1814. {$IfDef JumpAnal}
  1815. Case P^.Typ Of
  1816. ait_labeled_instruction:
  1817. begin
  1818. If (Pai_Labeled(P)^.lab^.nb >= LoLab) And
  1819. (Pai_Labeled(P)^.lab^.nb <= HiLab) Then
  1820. Inc(LTable^[Pai_Labeled(P)^.lab^.nb-LoLab].RefsFound);
  1821. end;
  1822. ait_label:
  1823. Begin
  1824. If (Pai_Label(p)^.l^.is_used) Then
  1825. LTable^[Pai_Label(P)^.l^.nb-LoLab].InstrNr := NrOfPaiObjs
  1826. End;
  1827. { ait_instruction:
  1828. Begin
  1829. If (Pai386(p)^._operator = A_PUSH) And
  1830. (Pai386(p)^.op1t = top_symbol) And
  1831. (PCSymbol(Pai386(p)^.op1)^.offset = 0) Then
  1832. Begin
  1833. TmpStr := StrPas(PCSymbol(Pai386(p)^.op1)^.symbol);
  1834. If}
  1835. End;
  1836. {$EndIf JumpAnal}
  1837. Inc(NrOfPaiObjs);
  1838. GetNextInstruction(p, p);
  1839. End;
  1840. {$IfDef TP}
  1841. If (MemAvail < (SizeOf(TPaiProp)*NrOfPaiObjs))
  1842. Or (NrOfPaiObjs = 0)
  1843. {this doesn't have to be one contiguous block}
  1844. Then InitDFAPass2 := False
  1845. Else InitDFAPass2 := True;
  1846. {$Else}
  1847. {Uncomment the next line to see how much memory the reloading optimizer needs}
  1848. { Writeln((NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4)));}
  1849. {no need to check mem/maxavail, we've got as much virtual memory as we want}
  1850. If NrOfPaiObjs <> 0 Then
  1851. Begin
  1852. InitDFAPass2 := True;
  1853. GetMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4));
  1854. p := Pai(AsmL^.First);
  1855. If (p^.typ in SkipInstr) Then
  1856. GetNextInstruction(p, p);
  1857. For Count := 1 To NrOfPaiObjs Do
  1858. Begin
  1859. PaiPropBlock^[Count].LineSave := p^.fileinfo.line;
  1860. PPaiProp(p^.fileinfo.line) := @PaiPropBlock^[Count];
  1861. GetNextInstruction(p, p);
  1862. End;
  1863. End
  1864. Else InitDFAPass2 := False;
  1865. {$EndIf TP}
  1866. End;
  1867. Function DFAPass2(AsmL: PAasmOutPut): Pai;
  1868. Begin
  1869. If InitDFAPass2(AsmL)
  1870. Then DFAPass2 := DoDFAPass2(
  1871. {$ifdef statedebug}
  1872. asml,
  1873. {$endif statedebug}
  1874. Pai(AsmL^.First))
  1875. Else DFAPass2 := Nil;
  1876. End;
  1877. Procedure ShutDownDFA;
  1878. Begin
  1879. If LabDif <> 0 Then
  1880. FreeMem(LTable, LabDif*SizeOf(TLabelTableItem));
  1881. End;
  1882. End.
  1883. {
  1884. $Log$
  1885. Revision 1.18 1998-10-07 16:27:02 jonas
  1886. * changed state to WState (WriteState), added RState for future use in
  1887. instruction scheduling
  1888. * RegAlloc data from the CG is now completely being patched and corrected (I
  1889. think)
  1890. Revision 1.17 1998/10/02 17:30:20 jonas
  1891. * small patches to regdealloc data
  1892. Revision 1.16 1998/10/01 20:21:47 jonas
  1893. * inter-register CSE, still requires some tweaks (peepholeoptpass2, better RegAlloc)
  1894. Revision 1.15 1998/09/20 18:00:20 florian
  1895. * small compiling problems fixed
  1896. Revision 1.14 1998/09/20 17:12:36 jonas
  1897. * small fix for uncertain optimizations & more cleaning up
  1898. Revision 1.12 1998/09/16 18:00:01 jonas
  1899. * optimizer now completely dependant on GetNext/GetLast instruction, works again with -dRegAlloc
  1900. Revision 1.11 1998/09/15 14:05:27 jonas
  1901. * fixed optimizer incompatibilities with freelabel code in psub
  1902. Revision 1.10 1998/09/09 15:33:58 peter
  1903. * removed warnings
  1904. Revision 1.9 1998/09/03 16:24:51 florian
  1905. * bug of type conversation from dword to real fixed
  1906. * bug fix of Jonas applied
  1907. Revision 1.8 1998/08/28 10:56:59 peter
  1908. * removed warnings
  1909. Revision 1.7 1998/08/19 16:07:44 jonas
  1910. * changed optimizer switches + cleanup of DestroyRefs in daopt386.pas
  1911. Revision 1.6 1998/08/10 14:49:57 peter
  1912. + localswitches, moduleswitches, globalswitches splitting
  1913. Revision 1.5 1998/08/09 13:56:24 jonas
  1914. * small bugfix for uncertain optimizations in DestroyRefs
  1915. Revision 1.4 1998/08/06 19:40:25 jonas
  1916. * removed $ before and after Log in comment
  1917. Revision 1.3 1998/08/05 16:00:14 florian
  1918. * some fixes for ansi strings
  1919. * log to Log changed
  1920. }