daopt386.pas 74 KB

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