daopt386.pas 90 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422
  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
  25. GlobType,
  26. CObjects,Aasm,
  27. cpubase,cpuasm;
  28. Type
  29. TRegArray = Array[R_EAX..R_BL] of TRegister;
  30. TRegSet = Set of R_EAX..R_BL;
  31. TRegInfo = Record
  32. NewRegsEncountered, OldRegsEncountered: TRegSet;
  33. RegsLoadedForRef: TRegSet;
  34. New2OldReg: TRegArray;
  35. End;
  36. {possible actions on an operand: read, write or modify (= read & write)}
  37. TOpAction = (OpAct_Read, OpAct_Write, OpAct_Modify, OpAct_Unknown);
  38. {*********************** Procedures and Functions ************************}
  39. Procedure InsertLLItem(AsmL: PAasmOutput; prev, foll, new_one: PLinkedList_Item);
  40. Function Reg32(Reg: TRegister): TRegister;
  41. Function RefsEquivalent(Const R1, R2: TReference; Var RegInfo: TRegInfo; OpAct: TOpAction): Boolean;
  42. Function RefsEqual(Const R1, R2: TReference): Boolean;
  43. Function IsGP32Reg(Reg: TRegister): Boolean;
  44. Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  45. Function RegInInstruction(Reg: TRegister; p1: Pai): Boolean;
  46. Function RegModifiedByInstruction(Reg: TRegister; p1: Pai): Boolean;
  47. Function GetNextInstruction(Current: Pai; Var Next: Pai): Boolean;
  48. Function GetLastInstruction(Current: Pai; Var Last: Pai): Boolean;
  49. Procedure SkipHead(var P: Pai);
  50. Procedure UpdateUsedRegs(Var UsedRegs: TRegSet; p: Pai);
  51. Function RegsEquivalent(OldReg, NewReg: TRegister; Var RegInfo: TRegInfo; OpAct: TopAction): Boolean;
  52. Function InstructionsEquivalent(p1, p2: Pai; Var RegInfo: TRegInfo): Boolean;
  53. Function OpsEqual(const o1,o2:toper): Boolean;
  54. Function DFAPass1(AsmL: PAasmOutput; BlockStart: Pai): Pai;
  55. Function DFAPass2(
  56. {$ifdef statedebug}
  57. AsmL: PAasmOutPut;
  58. {$endif statedebug}
  59. BlockStart, BlockEnd: Pai): Boolean;
  60. Procedure ShutDownDFA;
  61. Function FindLabel(L: PasmLabel; Var hp: Pai): Boolean;
  62. {******************************* Constants *******************************}
  63. Const
  64. {ait_* types which don't result in executable code or which don't influence
  65. the way the program runs/behaves}
  66. SkipInstr = [ait_comment, ait_align, ait_symbol
  67. {$ifdef GDB}
  68. ,ait_stabs, ait_stabn, ait_stab_function_name
  69. {$endif GDB}
  70. ,ait_regalloc, ait_tempalloc
  71. ];
  72. {the maximum number of things (registers, memory, ...) a single instruction
  73. changes}
  74. MaxCh = 3;
  75. {Possible register content types}
  76. con_Unknown = 0;
  77. con_ref = 1;
  78. con_const = 2;
  79. {********************************* Types *********************************}
  80. Type
  81. {What an instruction can change}
  82. TChange = (C_None,
  83. {Read from a register}
  84. C_REAX, C_RECX, C_REDX, C_REBX, C_RESP, C_REBP, C_RESI, C_REDI,
  85. {write from a register}
  86. C_WEAX, C_WECX, C_WEDX, C_WEBX, C_WESP, C_WEBP, C_WESI, C_WEDI,
  87. {read and write from/to a register}
  88. C_RWEAX, C_RWECX, C_RWEDX, C_RWEBX, C_RWESP, C_RWEBP, C_RWESI, C_RWEDI,
  89. {modify the contents of a register with the purpose of using
  90. this changed content afterwards (add/sub/..., but e.g. not rep
  91. or movsd)}
  92. {$ifdef arithopt}
  93. C_MEAX, C_MECX, C_MEDX, C_MEBX, C_MESP, C_MEBP, C_MESI, C_MEDI,
  94. {$endif arithopt}
  95. C_CDirFlag {clear direction flag}, C_SDirFlag {set dir flag},
  96. C_RFlags, C_WFlags, C_RWFlags, C_FPU,
  97. C_Rop1, C_Wop1, C_RWop1,
  98. C_Rop2, C_Wop2, C_RWop2,
  99. C_Rop3, C_WOp3, C_RWOp3,
  100. {$ifdef arithopt}
  101. C_Mop1, C_Mop2, C_Mop3,
  102. {$endif arithopt}
  103. C_WMemEDI,
  104. C_All);
  105. {$ifndef arithopt}
  106. Const
  107. C_MEAX = C_RWEAX;
  108. C_MECX = C_RWECX;
  109. C_MEDX = C_RWEDX;
  110. C_MEBX = C_RWEBX;
  111. C_MESP = C_RWESP;
  112. C_MEBP = C_RWEBP;
  113. C_MESI = C_RWESI;
  114. C_MEDI = C_RWEDI;
  115. C_Mop1 = C_RWOp1;
  116. C_Mop2 = C_RWOp2;
  117. C_Mop3 = C_RWOp3;
  118. Type
  119. {$endif arithopt}
  120. {the possible states of a flag}
  121. TFlagContents = (F_Unknown, F_NotSet, F_Set);
  122. {the properties of a cpu instruction}
  123. TAsmInstrucProp = Record
  124. {how many things it changes}
  125. { NCh: Byte;}
  126. {and what it changes}
  127. Ch: Array[1..MaxCh] of TChange;
  128. End;
  129. TContent = Packed Record
  130. {start and end of block instructions that defines the
  131. content of this register. If Typ = con_const, then
  132. Longint(StartMod) = value of the constant)}
  133. StartMod: pai;
  134. {starts at 0, gets increased everytime the register is written to}
  135. WState: Byte;
  136. {starts at 0, gets increased everytime the register is read from}
  137. RState: Byte;
  138. {how many instructions starting with StarMod does the block consist of}
  139. NrOfMods: Byte;
  140. {the type of the content of the register: unknown, memory, constant}
  141. Typ: Byte;
  142. End;
  143. {Contents of the integer registers}
  144. TRegContent = Array[R_EAX..R_EDI] Of TContent;
  145. {contents of the FPU registers}
  146. TRegFPUContent = Array[R_ST..R_ST7] Of TContent;
  147. {information record with the contents of every register. Every Pai object
  148. gets one of these assigned: a pointer to it is stored in the OptInfo field}
  149. TPaiProp = Record
  150. Regs: TRegContent;
  151. { FPURegs: TRegFPUContent;} {currently not yet used}
  152. {allocated Registers}
  153. UsedRegs: TRegSet;
  154. {status of the direction flag}
  155. DirFlag: TFlagContents;
  156. {can this instruction be removed?}
  157. CanBeRemoved: Boolean;
  158. End;
  159. PPaiProp = ^TPaiProp;
  160. {$IfNDef TP}
  161. TPaiPropBlock = Array[1..250000] Of TPaiProp;
  162. PPaiPropBlock = ^TPaiPropBlock;
  163. {$EndIf TP}
  164. TInstrSinceLastMod = Array[R_EAX..R_EDI] Of Byte;
  165. TLabelTableItem = Record
  166. PaiObj: Pai;
  167. {$IfDef JumpAnal}
  168. InstrNr: Longint;
  169. RefsFound: Word;
  170. JmpsProcessed: Word
  171. {$EndIf JumpAnal}
  172. End;
  173. {$IfDef tp}
  174. TLabelTable = Array[0..10000] Of TLabelTableItem;
  175. {$Else tp}
  176. TLabelTable = Array[0..2500000] Of TLabelTableItem;
  177. {$Endif tp}
  178. PLabelTable = ^TLabelTable;
  179. {******************************* Variables *******************************}
  180. Var
  181. {the amount of PaiObjects in the current assembler list}
  182. NrOfPaiObjs: Longint;
  183. {$IfNDef TP}
  184. {Array which holds all TPaiProps}
  185. PaiPropBlock: PPaiPropBlock;
  186. {$EndIf TP}
  187. LoLab, HiLab, LabDif: Longint;
  188. LTable: PLabelTable;
  189. {*********************** End of Interface section ************************}
  190. Implementation
  191. Uses
  192. globals, systems, strings, verbose, hcodegen;
  193. Const AsmInstr: Array[tasmop] Of TAsmInstrucProp = (
  194. {A_<NONE>} (Ch: (C_All, C_None, C_None)), { new }
  195. {A_LOCK} (Ch: (C_None, C_None, C_None)),
  196. {A_REP} (Ch: (C_RWECX, C_RFlags, C_None)),
  197. {A_REPE} (Ch: (C_RWECX, C_RFlags, C_None)),
  198. {A_REPNE} (Ch: (C_RWECX, C_RFlags, C_None)),
  199. {A_REPNZ} (Ch: (C_WECX, C_RWFLAGS, C_None)), { new }
  200. {A_REPZ} (Ch: (C_WECX, C_RWFLAGS, C_None)), { new }
  201. {A_SEGCS} (Ch: (C_None, C_None, C_None)), { new }
  202. {A_SEGES} (Ch: (C_None, C_None, C_None)), { new }
  203. {A_SEGDS} (Ch: (C_None, C_None, C_None)), { new }
  204. {A_SEGFS} (Ch: (C_None, C_None, C_None)), { new }
  205. {A_SEGGS} (Ch: (C_None, C_None, C_None)), { new }
  206. {A_SEGSS} (Ch: (C_None, C_None, C_None)), { new }
  207. {A_AAA} (Ch: (C_MEAX, C_WFlags, C_None)),
  208. {A_AAD} (Ch: (C_MEAX, C_WFlags, C_None)),
  209. {A_AAM} (Ch: (C_MEAX, C_WFlags, C_None)),
  210. {A_AAS} (Ch: (C_MEAX, C_WFlags, C_None)),
  211. {A_ADC} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  212. {A_ADD} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  213. {A_AND} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  214. {A_ARPL} (Ch: (C_WFlags, C_None, C_None)),
  215. {A_BOUND} (Ch: (C_Rop1, C_None, C_None)),
  216. {A_BSF} (Ch: (C_Wop2, C_WFlags, C_Rop1)),
  217. {A_BSR} (Ch: (C_Wop2, C_WFlags, C_Rop1)),
  218. {A_BSWAP} (Ch: (C_MOp1, C_None, C_None)), { new }
  219. {A_BT} (Ch: (C_WFlags, C_Rop1, C_None)),
  220. {A_BTC} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  221. {A_BTR} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  222. {A_BTS} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  223. {A_CALL} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  224. {A_CBW} (Ch: (C_MEAX, C_None, C_None)),
  225. {A_CDQ} (Ch: (C_MEAX, C_WEDX, C_None)),
  226. {A_CLC} (Ch: (C_WFlags, C_None, C_None)),
  227. {A_CLD} (Ch: (C_CDirFlag, C_None, C_None)),
  228. {A_CLI} (Ch: (C_WFlags, C_None, C_None)),
  229. {A_CLTS} (Ch: (C_None, C_None, C_None)),
  230. {A_CMC} (Ch: (C_WFlags, C_None, C_None)),
  231. {A_CMP} (Ch: (C_WFlags, C_None, C_None)),
  232. {A_CMPSB} (Ch: (C_All, C_None, C_None)), { new }
  233. {A_CMPSD} (Ch: (C_All, C_None, C_None)), { new }
  234. {A_CMPSW} (Ch: (C_All, C_None, C_None)), { new }
  235. {A_CMPXCHG} (Ch: (C_All, C_None, C_None)), { new }
  236. {A_CMPXCHG486} (Ch: (C_All, C_None, C_None)), { new }
  237. {A_CMPXCHG8B} (Ch: (C_All, C_None, C_None)), { new }
  238. {A_CPUID} (Ch: (C_All, C_None, C_none)),
  239. {A_CWD} (Ch: (C_MEAX, C_WEDX, C_None)),
  240. {A_CWDE} (Ch: (C_MEAX, C_None, C_None)),
  241. {A_DAA} (Ch: (C_MEAX, C_None, C_None)),
  242. {A_DAS} (Ch: (C_MEAX, C_None, C_None)),
  243. {A_DEC} (Ch: (C_Mop1, C_WFlags, C_None)),
  244. {A_DIV} (Ch: (C_RWEAX, C_WEDX, C_WFlags)),
  245. {A_EMMS} (Ch: (C_FPU, C_None, C_None)), { new }
  246. {A_ENTER} (Ch: (C_RWESP, C_None, C_None)),
  247. {A_EQU} (Ch: (C_None, C_None, C_None)), { new }
  248. {A_F2XM1} (Ch: (C_FPU, C_None, C_None)),
  249. {A_FABS} (Ch: (C_FPU, C_None, C_None)),
  250. {A_FADD} (Ch: (C_FPU, C_None, C_None)),
  251. {A_FADDP} (Ch: (C_FPU, C_None, C_None)),
  252. {A_FBLD} (Ch: (C_Rop1, C_FPU, C_None)),
  253. {A_FBSTP} (Ch: (C_Wop1, C_FPU, C_None)),
  254. {A_FCHS} (Ch: (C_FPU, C_None, C_None)),
  255. {A_FCLEX} (Ch: (C_FPU, C_None, C_None)),
  256. {A_FCMOVB} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  257. {A_FCMOVBE} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  258. {A_FCMOVE} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  259. {A_FCMOVNB} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  260. {A_FCMOVNBE} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  261. {A_FCMOVNE} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  262. {A_FCMOVNU} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  263. {A_FCMOVU} (Ch: (C_FPU, C_RFLAGS, C_None)), { new }
  264. {A_FCOM} (Ch: (C_FPU, C_None, C_None)),
  265. {A_FCOMI} (Ch: (C_WFLAGS, C_None, C_None)), { new }
  266. {A_FCOMIP} (Ch: (C_FPU, C_WFLAGS, C_None)), { new }
  267. {A_FCOMP} (Ch: (C_FPU, C_None, C_None)),
  268. {A_FCOMPP} (Ch: (C_FPU, C_None, C_None)),
  269. {A_FCOS} (Ch: (C_FPU, C_None, C_None)),
  270. {A_FDECSTP} (Ch: (C_FPU, C_None, C_None)),
  271. {A_FDISI} (Ch: (C_FPU, C_None, C_None)),
  272. {A_FDIV} (Ch: (C_FPU, C_None, C_None)),
  273. {A_FDIVP} (Ch: (C_FPU, C_None, C_None)),
  274. {A_FDIVR} (Ch: (C_FPU, C_None, C_None)),
  275. {A_FDIVRP} (Ch: (C_FPU, C_None, C_None)),
  276. {A_FEMMS} (Ch: (C_All, C_None, C_None)), { new }
  277. {A_FENI} (Ch: (C_FPU, C_None, C_None)),
  278. {A_FFREE} (Ch: (C_FPU, C_None, C_None)),
  279. {A_FIADD} (Ch: (C_FPU, C_None, C_None)),
  280. {A_FICOM} (Ch: (C_FPU, C_None, C_None)),
  281. {A_FICOMP} (Ch: (C_FPU, C_None, C_None)),
  282. {A_FIDIV} (Ch: (C_FPU, C_None, C_None)),
  283. {A_FIDIVR} (Ch: (C_FPU, C_None, C_None)),
  284. {A_FILD} (Ch: (C_FPU, C_None, C_None)),
  285. {A_FIMUL} (Ch: (C_FPU, C_None, C_None)),
  286. {A_FINCSTP} (Ch: (C_FPU, C_None, C_None)),
  287. {A_FINIT} (Ch: (C_FPU, C_None, C_None)),
  288. {A_FIST} (Ch: (C_Wop1, C_None, C_None)),
  289. {A_FISTP} (Ch: (C_Wop1, C_None, C_None)),
  290. {A_FISUB} (Ch: (C_FPU, C_None, C_None)),
  291. {A_FISUBR} (Ch: (C_FPU, C_None, C_None)), { new }
  292. {A_FLD} (Ch: (C_Rop1, C_FPU, C_None)),
  293. {A_FLD1} (Ch: (C_FPU, C_None, C_None)),
  294. {A_FLDCW} (Ch: (C_FPU, C_None, C_None)),
  295. {A_FLDENV} (Ch: (C_FPU, C_None, C_None)),
  296. {A_FLDL2E} (Ch: (C_FPU, C_None, C_None)),
  297. {A_FLDL2T} (Ch: (C_FPU, C_None, C_None)),
  298. {A_FLDLG2} (Ch: (C_FPU, C_None, C_None)),
  299. {A_FLDLN2} (Ch: (C_FPU, C_None, C_None)),
  300. {A_FLDPI} (Ch: (C_FPU, C_None, C_None)),
  301. {A_FLDZ} (Ch: (C_FPU, C_None, C_None)),
  302. {A_FMUL} (Ch: (C_FPU, C_None, C_None)),
  303. {A_FMULP} (Ch: (C_FPU, C_None, C_None)),
  304. {A_FNCLEX} (Ch: (C_FPU, C_None, C_None)),
  305. {A_FNDISI} (Ch: (C_FPU, C_None, C_None)),
  306. {A_FNENI} (Ch: (C_FPU, C_None, C_None)),
  307. {A_FNINIT} (Ch: (C_FPU, C_None, C_None)),
  308. {A_FNOP} (Ch: (C_FPU, C_None, C_None)),
  309. {A_FNSAVE} (Ch: (C_FPU, C_None, C_None)),
  310. {A_FNSTCW} (Ch: (C_Wop1, C_None, C_None)),
  311. {A_FNSTENV} (Ch: (C_Wop1, C_None, C_None)),
  312. {A_FNSTSW} (Ch: (C_Wop1, C_None, C_None)),
  313. {A_FPATAN} (Ch: (C_FPU, C_None, C_None)),
  314. {A_FPREM} (Ch: (C_FPU, C_None, C_None)),
  315. {A_FPREM1} (Ch: (C_FPU, C_None, C_None)),
  316. {A_FPTAN} (Ch: (C_FPU, C_None, C_None)),
  317. {A_FRNDINT} (Ch: (C_FPU, C_None, C_None)),
  318. {A_FRSTOR} (Ch: (C_FPU, C_None, C_None)),
  319. {A_FSAVE} (Ch: (C_Wop1, C_None, C_None)),
  320. {A_FSCALE} (Ch: (C_FPU, C_None, C_None)),
  321. {A_FSETPM} (Ch: (C_FPU, C_None, C_None)),
  322. {A_FSIN} (Ch: (C_FPU, C_None, C_None)),
  323. {A_FSINCOS} (Ch: (C_FPU, C_None, C_None)),
  324. {A_FSQRT} (Ch: (C_FPU, C_None, C_None)),
  325. {A_FST} (Ch: (C_Wop1, C_None, C_None)),
  326. {A_FSTCW} (Ch: (C_Wop1, C_None, C_None)),
  327. {A_FSTENV} (Ch: (C_Wop1, C_None, C_None)),
  328. {A_FSTP} (Ch: (C_Wop1, C_FPU, C_None)),
  329. {A_FSTSW} (Ch: (C_Wop1, C_None, C_None)),
  330. {A_FSUB} (Ch: (C_FPU, C_None, C_None)),
  331. {A_FSUBP} (Ch: (C_FPU, C_None, C_None)),
  332. {A_FSUBR} (Ch: (C_FPU, C_None, C_None)),
  333. {A_FSUBRP} (Ch: (C_FPU, C_None, C_None)),
  334. {A_FTST} (Ch: (C_FPU, C_None, C_None)),
  335. {A_FUCOM} (Ch: (C_None, C_None, C_None)), {changes fpu status word}
  336. {A_FUCOMI} (Ch: (C_WFLAGS, C_None, C_None)), { new }
  337. {A_FUCOMIP} (Ch: (C_FPU, C_WFLAGS, C_None)), { new }
  338. {A_FUCOMP} (Ch: (C_FPU, C_None, C_None)),
  339. {A_FUCOMPP} (Ch: (C_FPU, C_None, C_None)),
  340. {A_FWAIT} (Ch: (C_FPU, C_None, C_None)),
  341. {A_FXAM} (Ch: (C_FPU, C_None, C_None)),
  342. {A_FXCH} (Ch: (C_FPU, C_None, C_None)),
  343. {A_FXTRACT} (Ch: (C_FPU, C_None, C_None)),
  344. {A_FYL2X} (Ch: (C_FPU, C_None, C_None)),
  345. {A_FYL2XP1} (Ch: (C_FPU, C_None, C_None)),
  346. {A_HLT} (Ch: (C_None, C_None, C_None)),
  347. {A_IBTS} (Ch: (C_All, C_None, C_None)), { new }
  348. {A_ICEBP} (Ch: (C_All, C_None, C_None)), { new }
  349. {A_IDIV} (Ch: (C_RWEAX, C_WEDX, C_WFlags)),
  350. {A_IMUL} (Ch: (C_RWEAX, C_WEDX, C_WFlags)), {handled separately, because several forms exist}
  351. {A_IN} (Ch: (C_Wop2, C_Rop1, C_None)),
  352. {A_INC} (Ch: (C_Mop1, C_WFlags, C_None)),
  353. {A_INSB} (Ch: (C_WMemEDI, C_RWEDI, C_None)), { new }
  354. {A_INSD} (Ch: (C_WMemEDI, C_RWEDI, C_None)), { new }
  355. {A_INSW} (Ch: (C_WMemEDI, C_RWEDI, C_None)), { new }
  356. {A_INT} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  357. {A_INT01} (Ch: (C_All, C_None, C_None)), { new }
  358. {A_INT1} (Ch: (C_All, C_None, C_None)), { new }
  359. {A_INT3} (Ch: (C_None, C_None, C_None)),
  360. {A_INTO} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  361. {A_INVD} (Ch: (C_All, C_None, C_None)), { new }
  362. {A_INVLPG} (Ch: (C_All, C_None, C_None)), { new }
  363. {A_IRET} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  364. {A_IRETD} (Ch: (C_All, C_None, C_None)), { new }
  365. {A_IRETW} (Ch: (C_All, C_None, C_None)), { new }
  366. {A_JCXZ} (Ch: (C_RECX, C_None, C_None)),
  367. {A_JECXZ} (Ch: (C_RECX, C_None, C_None)),
  368. {A_JMP} (Ch: (C_None, C_None, C_None)),
  369. {A_LAHF} (Ch: (C_WEAX, C_RFlags, C_None)),
  370. {A_LAR} (Ch: (C_Wop2, C_None, C_None)),
  371. {A_LDS} (Ch: (C_Wop2, C_None, C_None)),
  372. {A_LEA} (Ch: (C_Wop2, C_Rop1, C_None)),
  373. {A_LEAVE} (Ch: (C_RWESP, C_None, C_None)),
  374. {A_LES} (Ch: (C_Wop2, C_None, C_None)),
  375. {A_LFS} (Ch: (C_Wop2, C_None, C_None)),
  376. {A_LGDT} (Ch: (C_None, C_None, C_None)),
  377. {A_LGS} (Ch: (C_Wop2, C_None, C_None)),
  378. {A_LIDT} (Ch: (C_None, C_None, C_None)),
  379. {A_LLDT} (Ch: (C_None, C_None, C_None)),
  380. {A_LMSW} (Ch: (C_None, C_None, C_None)),
  381. {A_LOADALL} (Ch: (C_All, C_None, C_None)), { new }
  382. {A_LOADALL286} (Ch: (C_All, C_None, C_None)), { new }
  383. {A_LODSB} (Ch: (C_WEAX, C_RWESI, C_None)), { new }
  384. {A_LODSD} (Ch: (C_WEAX, C_RWESI, C_None)), { new }
  385. {A_LODSW} (Ch: (C_WEAX, C_RWESI, C_None)), { new }
  386. {A_LOOP} (Ch: (C_RWECX, C_None, C_None)),
  387. {A_LOOPE} (Ch: (C_RWECX, C_RFlags, C_None)),
  388. {A_LOOPNE} (Ch: (C_RWECX, C_RFlags, C_None)),
  389. {A_LOOPNZ} (Ch: (C_RWECX, C_RFlags, C_None)),
  390. {A_LOOPZ} (Ch: (C_RWECX, C_RFlags, C_None)),
  391. {A_LSL} (Ch: (C_Wop2, C_WFlags, C_None)),
  392. {A_LSS} (Ch: (C_Wop2, C_None, C_None)),
  393. {A_LTR} (Ch: (C_None, C_None, C_None)),
  394. {A_MOV} (Ch: (C_Wop2, C_Rop1, C_None)),
  395. {A_MOVD} (Ch: (C_All, C_None, C_None)), { new }
  396. {A_MOVQ} (Ch: (C_All, C_None, C_None)), { new }
  397. {A_MOVSB} (Ch: (C_All, C_Rop1, C_None)),
  398. {A_MOVSD} (Ch: (C_All, C_None, C_None)), { new }
  399. {A_MOVSW} (Ch: (C_All, C_None, C_None)), { new }
  400. {A_MOVSX} (Ch: (C_Wop2, C_Rop1, C_None)),
  401. {A_MOVZX} (Ch: (C_Wop2, C_Rop1, C_None)),
  402. {A_MUL} (Ch: (C_RWEAX, C_WEDX, C_WFlags)),
  403. {A_NEG} (Ch: (C_Mop1, C_None, C_None)),
  404. {A_NOP} (Ch: (C_None, C_None, C_None)),
  405. {A_NOT} (Ch: (C_Mop1, C_WFlags, C_None)),
  406. {A_OR} (Ch: (C_Mop2, C_WFlags, C_None)),
  407. {A_OUT} (Ch: (C_Rop1, C_Rop2, C_None)),
  408. {A_OUTSB} (Ch: (C_All, C_None, C_None)), { new }
  409. {A_OUTSD} (Ch: (C_All, C_None, C_None)), { new }
  410. {A_OUTSW} (Ch: (C_All, C_None, C_None)), { new }
  411. {A_PACKSSDW} (Ch: (C_All, C_None, C_None)), { new }
  412. {A_PACKSSWB} (Ch: (C_All, C_None, C_None)), { new }
  413. {A_PACKUSWB} (Ch: (C_All, C_None, C_None)), { new }
  414. {A_PADDB} (Ch: (C_All, C_None, C_None)), { new }
  415. {A_PADDD} (Ch: (C_All, C_None, C_None)), { new }
  416. {A_PADDSB} (Ch: (C_All, C_None, C_None)), { new }
  417. {A_PADDSIW} (Ch: (C_All, C_None, C_None)), { new }
  418. {A_PADDSW} (Ch: (C_All, C_None, C_None)), { new }
  419. {A_PADDUSB} (Ch: (C_All, C_None, C_None)), { new }
  420. {A_PADDUSW} (Ch: (C_All, C_None, C_None)), { new }
  421. {A_PADDW} (Ch: (C_All, C_None, C_None)), { new }
  422. {A_PAND} (Ch: (C_All, C_None, C_None)), { new }
  423. {A_PANDN} (Ch: (C_All, C_None, C_None)), { new }
  424. {A_PAVEB} (Ch: (C_All, C_None, C_None)), { new }
  425. {A_PAVGUSB} (Ch: (C_All, C_None, C_None)), { new }
  426. {A_PCMPEQB} (Ch: (C_All, C_None, C_None)), { new }
  427. {A_PCMPEQD} (Ch: (C_All, C_None, C_None)), { new }
  428. {A_PCMPEQW} (Ch: (C_All, C_None, C_None)), { new }
  429. {A_PCMPGTB} (Ch: (C_All, C_None, C_None)), { new }
  430. {A_PCMPGTD} (Ch: (C_All, C_None, C_None)), { new }
  431. {A_PCMPGTW} (Ch: (C_All, C_None, C_None)), { new }
  432. {A_PDISTIB} (Ch: (C_All, C_None, C_None)), { new }
  433. {A_PF2ID} (Ch: (C_All, C_None, C_None)), { new }
  434. {A_PFACC} (Ch: (C_All, C_None, C_None)), { new }
  435. {A_PFADD} (Ch: (C_All, C_None, C_None)), { new }
  436. {A_PFCMPEQ} (Ch: (C_All, C_None, C_None)), { new }
  437. {A_PFCMPGE} (Ch: (C_All, C_None, C_None)), { new }
  438. {A_PFCMPGT} (Ch: (C_All, C_None, C_None)), { new }
  439. {A_PFMAX} (Ch: (C_All, C_None, C_None)), { new }
  440. {A_PFMIN} (Ch: (C_All, C_None, C_None)), { new }
  441. {A_PFMUL} (Ch: (C_All, C_None, C_None)), { new }
  442. {A_PFRCP} (Ch: (C_All, C_None, C_None)), { new }
  443. {A_PFRCPIT1} (Ch: (C_All, C_None, C_None)), { new }
  444. {A_PFRCPIT2} (Ch: (C_All, C_None, C_None)), { new }
  445. {A_PFRSQIT1} (Ch: (C_All, C_None, C_None)), { new }
  446. {A_PFRSQRT} (Ch: (C_All, C_None, C_None)), { new }
  447. {A_PFSUB} (Ch: (C_All, C_None, C_None)), { new }
  448. {A_PFSUBR} (Ch: (C_All, C_None, C_None)), { new }
  449. {A_PI2FD} (Ch: (C_All, C_None, C_None)), { new }
  450. {A_PMACHRIW} (Ch: (C_All, C_None, C_None)), { new }
  451. {A_PMADDWD} (Ch: (C_All, C_None, C_None)), { new }
  452. {A_PMAGW} (Ch: (C_All, C_None, C_None)), { new }
  453. {A_PMULHRIW} (Ch: (C_All, C_None, C_None)), { new }
  454. {A_PMULHRWA} (Ch: (C_All, C_None, C_None)), { new }
  455. {A_PMULHRWC} (Ch: (C_All, C_None, C_None)), { new }
  456. {A_PMULHW} (Ch: (C_All, C_None, C_None)), { new }
  457. {A_PMULLW} (Ch: (C_All, C_None, C_None)), { new }
  458. {A_PMVGEZB} (Ch: (C_All, C_None, C_None)), { new }
  459. {A_PMVLZB} (Ch: (C_All, C_None, C_None)), { new }
  460. {A_PMVNZB} (Ch: (C_All, C_None, C_None)), { new }
  461. {A_PMVZB} (Ch: (C_All, C_None, C_None)), { new }
  462. {A_POP} (Ch: (C_Wop1, C_RWESP, C_None)),
  463. {A_POPA} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  464. {A_POPAD} (Ch: (C_All, C_None, C_None)), {don't know value of any register}
  465. {A_POPAW} (Ch: (C_All, C_None, C_None)), { new }
  466. {A_POPF} (Ch: (C_RWESP, C_WFlags, C_None)),
  467. {A_POPFD} (Ch: (C_RWESP, C_WFlags, C_None)),
  468. {A_POPFW} (Ch: (C_RWESP, C_WFLAGS, C_None)), { new }
  469. {A_POR} (Ch: (C_All, C_None, C_None)), { new }
  470. {A_PREFETCH} (Ch: (C_All, C_None, C_None)), { new }
  471. {A_PREFETCHW} (Ch: (C_All, C_None, C_None)), { new }
  472. {A_PSLLD} (Ch: (C_All, C_None, C_None)), { new }
  473. {A_PSLLQ} (Ch: (C_All, C_None, C_None)), { new }
  474. {A_PSLLW} (Ch: (C_All, C_None, C_None)), { new }
  475. {A_PSRAD} (Ch: (C_All, C_None, C_None)), { new }
  476. {A_PSRAW} (Ch: (C_All, C_None, C_None)), { new }
  477. {A_PSRLD} (Ch: (C_All, C_None, C_None)), { new }
  478. {A_PSRLQ} (Ch: (C_All, C_None, C_None)), { new }
  479. {A_PSRLW} (Ch: (C_All, C_None, C_None)), { new }
  480. {A_PSUBB} (Ch: (C_All, C_None, C_None)), { new }
  481. {A_PSUBD} (Ch: (C_All, C_None, C_None)), { new }
  482. {A_PSUBSB} (Ch: (C_All, C_None, C_None)), { new }
  483. {A_PSUBSIW} (Ch: (C_All, C_None, C_None)), { new }
  484. {A_PSUBSW} (Ch: (C_All, C_None, C_None)), { new }
  485. {A_PSUBUSB} (Ch: (C_All, C_None, C_None)), { new }
  486. {A_PSUBUSW} (Ch: (C_All, C_None, C_None)), { new }
  487. {A_PSUBW} (Ch: (C_All, C_None, C_None)), { new }
  488. {A_PUNPCKHBW} (Ch: (C_All, C_None, C_None)), { new }
  489. {A_PUNPCKHDQ} (Ch: (C_All, C_None, C_None)), { new }
  490. {A_PUNPCKHWD} (Ch: (C_All, C_None, C_None)), { new }
  491. {A_PUNPCKLBW} (Ch: (C_All, C_None, C_None)), { new }
  492. {A_PUNPCKLDQ} (Ch: (C_All, C_None, C_None)), { new }
  493. {A_PUNPCKLWD} (Ch: (C_All, C_None, C_None)), { new }
  494. {A_PUSH} (Ch: (C_Rop1, C_RWESP, C_None)),
  495. {A_PUSHA} (Ch: (C_All, C_None, C_None)),
  496. {A_PUSHAD} (Ch: (C_All, C_None, C_None)),
  497. {A_PUSHAW} (Ch: (C_All, C_None, C_None)), { new }
  498. {A_PUSHF} (Ch: (C_RWESP, C_RFlags, C_None)),
  499. {A_PUSHFD} (Ch: (C_RWESP, C_RFlags, C_None)),
  500. {A_PUSHFW} (Ch: (C_RWESP, C_RFLAGS, C_None)), { new }
  501. {A_PXOR} (Ch: (C_All, C_None, C_None)), { new }
  502. {A_RCL} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  503. {A_RCR} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  504. {A_RDMSR} (Ch: (C_WEAX, C_WEDX, C_None)), { new }
  505. {A_RDPMC} (Ch: (C_WEAX, C_WEDX, C_None)), { new }
  506. {A_RDTSC} (Ch: (C_WEAX, C_WEDX, C_None)), { new }
  507. {A_RESB} (Ch: (C_All, C_None, C_None)), { new }
  508. {A_RET} (Ch: (C_All, C_None, C_None)),
  509. {A_RETF} (Ch: (C_All, C_None, C_None)), { new }
  510. {A_RETN} (Ch: (C_All, C_None, C_None)), { new }
  511. {A_ROL} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  512. {A_ROR} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  513. {A_RSM} (Ch: (C_All, C_None, C_None)), { new }
  514. {A_SAHF} (Ch: (C_WFlags, C_REAX, C_None)),
  515. {A_SAL} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  516. {A_SALC} (Ch: (C_WEAX, C_RFLAGS, C_None)), { new }
  517. {A_SAR} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  518. {A_SBB} (Ch: (C_Mop2, C_Rop1, C_RWFlags)),
  519. {A_SCASB} (Ch: (C_All, C_None, C_None)), { new }
  520. {A_SCASD} (Ch: (C_All, C_None, C_None)), { new }
  521. {A_SCASW} (Ch: (C_All, C_None, C_None)), { new }
  522. {A_SGDT} (Ch: (C_Wop1, C_None, C_None)),
  523. {A_SHL} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  524. {A_SHLD} (Ch: (C_MOp3, C_RWFlags, C_Rop2)),
  525. {A_SHR} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  526. {A_SHRD} (Ch: (C_MOp3, C_RWFlags, C_Rop2)),
  527. {A_SIDT} (Ch: (C_Wop1, C_None, C_None)),
  528. {A_SLDT} (Ch: (C_Wop1, C_None, C_None)),
  529. {A_SMI} (Ch: (C_All, C_None, C_None)), { new }
  530. {A_SMSW} (Ch: (C_Wop1, C_None, C_None)),
  531. {A_STC} (Ch: (C_WFlags, C_None, C_None)),
  532. {A_STD} (Ch: (C_SDirFlag, C_None, C_None)),
  533. {A_STI} (Ch: (C_WFlags, C_None, C_None)),
  534. {A_STOSB} (Ch: (C_REAX, C_WMemEDI, C_RWEDI)), { new }
  535. {A_STOSD} (Ch: (C_REAX, C_WMemEDI, C_RWEDI)), { new }
  536. {A_STOSW} (Ch: (C_REAX, C_WMemEDI, C_RWEDI)), { new }
  537. {A_STR} (Ch: (C_Wop1, C_None, C_None)),
  538. {A_SUB} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  539. {A_TEST} (Ch: (C_WFlags, C_Rop1, C_Rop2)),
  540. {A_UMOV} (Ch: (C_All, C_None, C_None)), { new }
  541. {A_VERR} (Ch: (C_WFlags, C_None, C_None)),
  542. {A_VERW} (Ch: (C_WFlags, C_None, C_None)),
  543. {A_WAIT} (Ch: (C_None, C_None, C_None)),
  544. {A_WBINVD} (Ch: (C_None, C_None, C_None)), { new }
  545. {A_WRMSR} (Ch: (C_All, C_None, C_None)), { new }
  546. {A_XADD} (Ch: (C_All, C_None, C_None)), { new }
  547. {A_XBTS} (Ch: (C_All, C_None, C_None)), { new }
  548. {A_XCHG} (Ch: (C_RWop1, C_RWop2, C_None)), {(might be) handled seperately}
  549. {A_XLAT} (Ch: (C_WEAX, C_REBX, C_None)),
  550. {A_XLATB} (Ch: (C_WEAX, C_REBX, C_None)),
  551. {A_XOR} (Ch: (C_Mop2, C_Rop1, C_WFlags)),
  552. {A_CMOV} (Ch: (C_ROp1, C_WOp2, C_RFLAGS)), { new }
  553. {A_J} (Ch: (C_None, C_None, C_None)), { new }
  554. {A_SET} (Ch: (C_WEAX, C_RFLAGS, C_None)) { new }
  555. );
  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. Function FindLoHiLabels(Var LowLabel, HighLabel, LabelDif: Longint; BlockStart: Pai): Pai;
  562. {Walks through the paasmlist to find the lowest and highest label number}
  563. Var LabelFound: Boolean;
  564. P: Pai;
  565. Begin
  566. LabelFound := False;
  567. LowLabel := MaxLongint;
  568. HighLabel := 0;
  569. P := BlockStart;
  570. While Assigned(P) And
  571. ((P^.typ <> Ait_Marker) Or
  572. (Pai_Marker(P)^.Kind <> AsmBlockStart)) Do
  573. Begin
  574. If (Pai(p)^.typ = ait_label) Then
  575. If (Pai_Label(p)^.l^.is_used)
  576. Then
  577. Begin
  578. LabelFound := True;
  579. If (Pai_Label(p)^.l^.labelnr < LowLabel) Then
  580. LowLabel := Pai_Label(p)^.l^.labelnr;
  581. If (Pai_Label(p)^.l^.labelnr > HighLabel) Then
  582. HighLabel := Pai_Label(p)^.l^.labelnr;
  583. End;
  584. GetNextInstruction(p, p);
  585. End;
  586. FindLoHiLabels := p;
  587. If LabelFound
  588. Then LabelDif := HighLabel+1-LowLabel
  589. Else LabelDif := 0;
  590. End;
  591. Function FindRegAlloc(Reg: TRegister; StartPai: Pai): Boolean;
  592. {Returns true if a ait_alloc object for Reg is found in the block of Pai's
  593. starting with StartPai and ending with the next "real" instruction}
  594. Begin
  595. FindRegAlloc:=False;
  596. Repeat
  597. While Assigned(StartPai) And
  598. ((StartPai^.typ in (SkipInstr - [ait_regAlloc])) Or
  599. ((StartPai^.typ = ait_label) and
  600. Not(Pai_Label(StartPai)^.l^.Is_Used))) Do
  601. StartPai := Pai(StartPai^.Next);
  602. If Assigned(StartPai) And
  603. (StartPai^.typ = ait_regAlloc) and (PairegAlloc(StartPai)^.allocation) Then
  604. Begin
  605. if PairegAlloc(StartPai)^.Reg = Reg then
  606. begin
  607. FindRegAlloc:=true;
  608. exit;
  609. end;
  610. StartPai := Pai(StartPai^.Next);
  611. End
  612. else
  613. exit;
  614. Until false;
  615. End;
  616. Procedure BuildLabelTableAndFixRegAlloc(AsmL: PAasmOutput; Var LabelTable: PLabelTable; LowLabel: Longint;
  617. Var LabelDif: Longint; BlockStart, BlockEnd: Pai);
  618. {Builds a table with the locations of the labels in the paasmoutput.
  619. Also fixes some RegDeallocs like "# %eax released; push (%eax)"}
  620. Var p, hp1, hp2: Pai;
  621. UsedRegs: TRegSet;
  622. Begin
  623. UsedRegs := [];
  624. If (LabelDif <> 0) Then
  625. Begin
  626. {$IfDef TP}
  627. If (MaxAvail >= LabelDif*SizeOf(Pai))
  628. Then
  629. Begin
  630. {$EndIf TP}
  631. GetMem(LabelTable, LabelDif*SizeOf(TLabelTableItem));
  632. FillChar(LabelTable^, LabelDif*SizeOf(TLabelTableItem), 0);
  633. p := BlockStart;
  634. While (P <> BlockEnd) Do
  635. Begin
  636. Case p^.typ Of
  637. ait_Label:
  638. If Pai_Label(p)^.l^.is_used Then
  639. LabelTable^[Pai_Label(p)^.l^.labelnr-LowLabel].PaiObj := p;
  640. ait_regAlloc:
  641. begin
  642. if PairegAlloc(p)^.Allocation then
  643. Begin
  644. If Not(PaiRegAlloc(p)^.Reg in UsedRegs) Then
  645. UsedRegs := UsedRegs + [PaiRegAlloc(p)^.Reg]
  646. Else
  647. Begin
  648. hp1 := p;
  649. hp2 := nil;
  650. While GetLastInstruction(hp1, hp1) And
  651. Not(RegInInstruction(PaiRegAlloc(p)^.Reg, hp1)) Do
  652. hp2 := hp1;
  653. If hp2 <> nil Then
  654. Begin
  655. hp1 := New(PaiRegAlloc, DeAlloc(PaiRegAlloc(p)^.Reg));
  656. InsertLLItem(AsmL, Pai(hp2^.previous), hp2, hp1);
  657. End;
  658. End;
  659. End
  660. else
  661. Begin
  662. UsedRegs := UsedRegs - [PaiRegAlloc(p)^.Reg];
  663. hp1 := p;
  664. hp2 := nil;
  665. While Not(FindRegAlloc(PaiRegAlloc(p)^.Reg, Pai(hp1^.Next))) And
  666. GetNextInstruction(hp1, hp1) And
  667. RegInInstruction(PaiRegAlloc(p)^.Reg, hp1) Do
  668. hp2 := hp1;
  669. If hp2 <> nil Then
  670. Begin
  671. hp1 := Pai(p^.previous);
  672. AsmL^.Remove(p);
  673. InsertLLItem(AsmL, hp2, Pai(hp2^.Next), p);
  674. p := hp1;
  675. End;
  676. End;
  677. end;
  678. End;
  679. P := Pai(p^.Next);
  680. While Assigned(p) And
  681. (p^.typ in (SkipInstr - [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: PasmLabel; 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 ???2???Reg 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. NewRegsEncountered := NewRegsEncountered + [NewReg];
  767. OldRegsEncountered := OldRegsEncountered + [OldReg];
  768. New2OldReg[NewReg] := OldReg;
  769. Case OldReg Of
  770. R_EAX..R_EDI:
  771. Begin
  772. NewRegsEncountered := NewRegsEncountered + [Reg32toReg16(NewReg)];
  773. OldRegsEncountered := OldRegsEncountered + [Reg32toReg16(OldReg)];
  774. New2OldReg[Reg32toReg16(NewReg)] := Reg32toReg16(OldReg);
  775. If (NewReg in [R_EAX..R_EBX]) And
  776. (OldReg in [R_EAX..R_EBX]) Then
  777. Begin
  778. NewRegsEncountered := NewRegsEncountered + [Reg32toReg8(NewReg)];
  779. OldRegsEncountered := OldRegsEncountered + [Reg32toReg8(OldReg)];
  780. New2OldReg[Reg32toReg8(NewReg)] := Reg32toReg8(OldReg);
  781. End;
  782. End;
  783. R_AX..R_DI:
  784. Begin
  785. NewRegsEncountered := NewRegsEncountered + [Reg16toReg32(NewReg)];
  786. OldRegsEncountered := OldRegsEncountered + [Reg16toReg32(OldReg)];
  787. New2OldReg[Reg16toReg32(NewReg)] := Reg16toReg32(OldReg);
  788. If (NewReg in [R_AX..R_BX]) And
  789. (OldReg in [R_AX..R_BX]) Then
  790. Begin
  791. NewRegsEncountered := NewRegsEncountered + [Reg16toReg8(NewReg)];
  792. OldRegsEncountered := OldRegsEncountered + [Reg16toReg8(OldReg)];
  793. New2OldReg[Reg16toReg8(NewReg)] := Reg16toReg8(OldReg);
  794. End;
  795. End;
  796. R_AL..R_BL:
  797. Begin
  798. NewRegsEncountered := NewRegsEncountered + [Reg8toReg32(NewReg)]
  799. + [Reg8toReg16(NewReg)];
  800. OldRegsEncountered := OldRegsEncountered + [Reg8toReg32(OldReg)]
  801. + [Reg8toReg16(OldReg)];
  802. New2OldReg[Reg8toReg32(NewReg)] := Reg8toReg32(OldReg);
  803. End;
  804. End;
  805. End;
  806. End;
  807. Procedure AddOp2RegInfo(const o:Toper; Var RegInfo: TRegInfo);
  808. Begin
  809. Case o.typ Of
  810. Top_Reg:
  811. If (o.reg <> R_NO) Then
  812. AddReg2RegInfo(o.reg, o.reg, RegInfo);
  813. Top_Ref:
  814. Begin
  815. If o.ref^.base <> R_NO Then
  816. AddReg2RegInfo(o.ref^.base, o.ref^.base, RegInfo);
  817. If o.ref^.index <> R_NO Then
  818. AddReg2RegInfo(o.ref^.index, o.ref^.index, RegInfo);
  819. End;
  820. End;
  821. End;
  822. Function RegsEquivalent(OldReg, NewReg: TRegister; Var RegInfo: TRegInfo; OPAct: TOpAction): Boolean;
  823. Begin
  824. If Not((OldReg = R_NO) Or (NewReg = R_NO)) Then
  825. If RegsSameSize(OldReg, NewReg) Then
  826. With RegInfo Do
  827. {here we always check for the 32 bit component, because it is possible that
  828. the 8 bit component has not been set, event though NewReg already has been
  829. processed. This happens if it has been compared with a register that doesn't
  830. have an 8 bit component (such as EDI). In that case the 8 bit component is
  831. still set to R_NO and the comparison in the Else-part will fail}
  832. If (Reg32(OldReg) in OldRegsEncountered) Then
  833. If (Reg32(NewReg) in NewRegsEncountered) Then
  834. RegsEquivalent := (OldReg = New2OldReg[NewReg])
  835. { If we haven't encountered the new register yet, but we have encountered the
  836. old one already, the new one can only be correct if it's being written to
  837. (and consequently the old one is also being written to), otherwise
  838. movl -8(%ebp), %eax and movl -8(%ebp), %eax
  839. movl (%eax), %eax movl (%edx), %edx
  840. are considered equivalent}
  841. Else
  842. If (OpAct = OpAct_Write) Then
  843. Begin
  844. AddReg2RegInfo(OldReg, NewReg, RegInfo);
  845. RegsEquivalent := True
  846. End
  847. Else Regsequivalent := False
  848. Else
  849. If Not(Reg32(NewReg) in NewRegsEncountered) Then
  850. Begin
  851. AddReg2RegInfo(OldReg, NewReg, RegInfo);
  852. RegsEquivalent := True
  853. End
  854. Else RegsEquivalent := False
  855. Else RegsEquivalent := False
  856. Else RegsEquivalent := OldReg = NewReg
  857. End;
  858. Function RefsEquivalent(Const R1, R2: TReference; var RegInfo: TRegInfo; OpAct: TOpAction): Boolean;
  859. Begin
  860. If R1.is_immediate Then
  861. RefsEquivalent := R2.is_immediate and (R1.Offset = R2.Offset)
  862. Else
  863. RefsEquivalent := (R1.Offset+R1.OffsetFixup = R2.Offset+R2.OffsetFixup) And
  864. RegsEquivalent(R1.Base, R2.Base, RegInfo, OpAct) And
  865. RegsEquivalent(R1.Index, R2.Index, RegInfo, OpAct) And
  866. (R1.Segment = R2.Segment) And (R1.ScaleFactor = R2.ScaleFactor) And
  867. (R1.Symbol = R2.Symbol);
  868. End;
  869. Function RefsEqual(Const R1, R2: TReference): Boolean;
  870. Begin
  871. If R1.is_immediate Then
  872. RefsEqual := R2.is_immediate and (R1.Offset = R2.Offset)
  873. Else
  874. RefsEqual := (R1.Offset+R1.OffsetFixup = R2.Offset+R2.OffsetFixup) And
  875. (R1.Segment = R2.Segment) And (R1.Base = R2.Base) And
  876. (R1.Index = R2.Index) And (R1.ScaleFactor = R2.ScaleFactor) And
  877. (R1.Symbol=R2.Symbol);
  878. End;
  879. Function IsGP32Reg(Reg: TRegister): Boolean;
  880. {Checks if the register is a 32 bit general purpose register}
  881. Begin
  882. If (Reg >= R_EAX) and (Reg <= R_EBX)
  883. Then IsGP32Reg := True
  884. Else IsGP32reg := False
  885. End;
  886. Function RegInRef(Reg: TRegister; Const Ref: TReference): Boolean;
  887. Begin {checks whether Ref contains a reference to Reg}
  888. Reg := Reg32(Reg);
  889. RegInRef := (Ref.Base = Reg) Or (Ref.Index = Reg)
  890. End;
  891. Function RegInInstruction(Reg: TRegister; p1: Pai): Boolean;
  892. {checks if Reg is used by the instruction p1}
  893. Var Counter: Longint;
  894. TmpResult: Boolean;
  895. Begin
  896. TmpResult := False;
  897. If (Pai(p1)^.typ = ait_instruction) Then
  898. Begin
  899. Reg := Reg32(Reg);
  900. Counter := 0;
  901. Repeat
  902. Case Pai386(p1)^.oper[Counter].typ Of
  903. Top_Reg: TmpResult := Reg = Reg32(Pai386(p1)^.oper[Counter].reg);
  904. Top_Ref: TmpResult := RegInRef(Reg, Pai386(p1)^.oper[Counter].ref^);
  905. End;
  906. Inc(Counter)
  907. Until (Counter = 3) or TmpResult;
  908. End;
  909. RegInInstruction := TmpResult
  910. End;
  911. {Function RegInOp(Reg: TRegister; const o:toper): Boolean;
  912. Begin
  913. RegInOp := False;
  914. Case opt Of
  915. top_reg: RegInOp := Reg = o.reg;
  916. top_ref: RegInOp := (Reg = o.ref^.Base) Or
  917. (Reg = o.ref^.Index);
  918. End;
  919. End;}
  920. Function RegModifiedByInstruction(Reg: TRegister; p1: Pai): Boolean;
  921. {returns true if Reg is modified by the instruction p1. P1 is assumed to be
  922. of the type ait_instruction}
  923. Var hp: Pai;
  924. Begin
  925. If GetLastInstruction(p1, hp)
  926. Then
  927. RegModifiedByInstruction :=
  928. PPAiProp(p1^.OptInfo)^.Regs[Reg].WState <>
  929. PPAiProp(hp^.OptInfo)^.Regs[Reg].WState
  930. Else RegModifiedByInstruction := True;
  931. End;
  932. {********************* GetNext and GetLastInstruction *********************}
  933. Function GetNextInstruction(Current: Pai; Var Next: Pai): Boolean;
  934. {skips ait_regalloc, ait_regdealloc and ait_stab* objects and puts the
  935. next pai object in Next. Returns false if there isn't any}
  936. Begin
  937. Repeat
  938. Current := Pai(Current^.Next);
  939. While Assigned(Current) And
  940. ((Current^.typ In SkipInstr) or
  941. ((Current^.typ = ait_label) And
  942. Not(Pai_Label(Current)^.l^.is_used))) Do
  943. Current := Pai(Current^.Next);
  944. If Assigned(Current) And
  945. (Current^.typ = ait_Marker) And
  946. (Pai_Marker(Current)^.Kind = NoPropInfoStart) Then
  947. Begin
  948. While Assigned(Current) And
  949. ((Current^.typ <> ait_Marker) Or
  950. (Pai_Marker(Current)^.Kind <> NoPropInfoEnd)) Do
  951. Current := Pai(Current^.Next);
  952. End;
  953. Until Not(Assigned(Current)) Or
  954. (Current^.typ <> ait_Marker) Or
  955. (Pai_Marker(Current)^.Kind <> NoPropInfoEnd);
  956. Next := Current;
  957. If Assigned(Current) And
  958. Not((Current^.typ In SkipInstr) or
  959. ((Current^.typ = ait_label) And
  960. Not(Pai_Label(Current)^.l^.is_used)))
  961. Then GetNextInstruction := True
  962. Else
  963. Begin
  964. Next := Nil;
  965. GetNextInstruction := False;
  966. End;
  967. End;
  968. Function GetLastInstruction(Current: Pai; Var Last: Pai): Boolean;
  969. {skips the ait-types in SkipInstr puts the previous pai object in
  970. Last. Returns false if there isn't any}
  971. Begin
  972. Repeat
  973. Current := Pai(Current^.previous);
  974. While Assigned(Current) And
  975. (((Current^.typ = ait_Marker) And
  976. Not(Pai_Marker(Current)^.Kind in [AsmBlockEnd,NoPropInfoEnd])) or
  977. (Current^.typ In SkipInstr) or
  978. ((Current^.typ = ait_label) And
  979. Not(Pai_Label(Current)^.l^.is_used))) Do
  980. Current := Pai(Current^.previous);
  981. If Assigned(Current) And
  982. (Current^.typ = ait_Marker) And
  983. (Pai_Marker(Current)^.Kind = NoPropInfoEnd) Then
  984. Begin
  985. While Assigned(Current) And
  986. ((Current^.typ <> ait_Marker) Or
  987. (Pai_Marker(Current)^.Kind <> NoPropInfoStart)) Do
  988. Current := Pai(Current^.previous);
  989. End;
  990. Until Not(Assigned(Current)) Or
  991. (Current^.typ <> ait_Marker) Or
  992. (Pai_Marker(Current)^.Kind <> NoPropInfoStart);
  993. If Not(Assigned(Current)) or
  994. (Current^.typ In SkipInstr) or
  995. ((Current^.typ = ait_label) And
  996. Not(Pai_Label(Current)^.l^.is_used)) or
  997. ((Current^.typ = ait_Marker) And
  998. (Pai_Marker(Current)^.Kind = AsmBlockEnd))
  999. Then
  1000. Begin
  1001. Last := Nil;
  1002. GetLastInstruction := False
  1003. End
  1004. Else
  1005. Begin
  1006. Last := Current;
  1007. GetLastInstruction := True;
  1008. End;
  1009. End;
  1010. Procedure SkipHead(var P: Pai);
  1011. Var OldP: Pai;
  1012. Begin
  1013. Repeat
  1014. OldP := P;
  1015. If (P^.typ in SkipInstr) Or
  1016. ((P^.typ = ait_marker) And
  1017. (Pai_Marker(P)^.Kind = AsmBlockEnd)) Then
  1018. GetNextInstruction(P, P)
  1019. Else If ((P^.Typ = Ait_Marker) And
  1020. (Pai_Marker(P)^.Kind = NoPropInfoStart)) Then
  1021. {a marker of the NoPropInfoStart can't be the first instruction of a
  1022. paasmoutput list}
  1023. GetNextInstruction(Pai(P^.Previous),P);
  1024. If (P^.Typ = Ait_Marker) And
  1025. (Pai_Marker(P)^.Kind = AsmBlockStart) Then
  1026. Begin
  1027. P := Pai(P^.Next);
  1028. While (P^.typ <> Ait_Marker) Or
  1029. (Pai_Marker(P)^.Kind <> AsmBlockEnd) Do
  1030. P := Pai(P^.Next)
  1031. End;
  1032. Until P = OldP
  1033. End;
  1034. {******************* The Data Flow Analyzer functions ********************}
  1035. Procedure UpdateUsedRegs(Var UsedRegs: TRegSet; p: Pai);
  1036. {updates UsedRegs with the RegAlloc Information coming after P}
  1037. Begin
  1038. Repeat
  1039. While Assigned(p) And
  1040. ((p^.typ in (SkipInstr - [ait_RegAlloc])) or
  1041. ((p^.typ = ait_label) And
  1042. Not(Pai_Label(p)^.l^.is_used))) Do
  1043. p := Pai(p^.next);
  1044. While Assigned(p) And
  1045. (p^.typ=ait_RegAlloc) Do
  1046. Begin
  1047. if pairegalloc(p)^.allocation then
  1048. UsedRegs := UsedRegs + [PaiRegAlloc(p)^.Reg]
  1049. else
  1050. UsedRegs := UsedRegs - [PaiRegAlloc(p)^.Reg];
  1051. p := pai(p^.next);
  1052. End;
  1053. Until Not(Assigned(p)) Or
  1054. (Not(p^.typ in SkipInstr) And
  1055. Not((p^.typ = ait_label) And
  1056. Not(Pai_Label(p)^.l^.is_used)));
  1057. End;
  1058. (*Function FindZeroreg(p: Pai; Var Result: TRegister): Boolean;
  1059. {Finds a register which contains the constant zero}
  1060. Var Counter: TRegister;
  1061. Begin
  1062. Counter := R_EAX;
  1063. FindZeroReg := True;
  1064. While (Counter <= R_EDI) And
  1065. ((PPaiProp(p^.OptInfo)^.Regs[Counter].Typ <> Con_Const) or
  1066. (PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod <> Pointer(0))) Do
  1067. Inc(Byte(Counter));
  1068. If (PPaiProp(p^.OptInfo)^.Regs[Counter].Typ = Con_Const) And
  1069. (PPaiProp(p^.OptInfo)^.Regs[Counter].StartMod = Pointer(0))
  1070. Then Result := Counter
  1071. Else FindZeroReg := False;
  1072. End;*)
  1073. Function TCh2Reg(Ch: TChange): TRegister;
  1074. {converts a TChange variable to a TRegister}
  1075. Begin
  1076. If (Ch <= C_REDI) Then
  1077. TCh2Reg := TRegister(Byte(Ch))
  1078. Else
  1079. If (Ch <= C_WEDI) Then
  1080. TCh2Reg := TRegister(Byte(Ch) - Byte(C_REDI))
  1081. Else
  1082. If (Ch <= C_RWEDI) Then
  1083. TCh2Reg := TRegister(Byte(Ch) - Byte(C_WEDI))
  1084. Else
  1085. If (Ch <= C_MEDI) Then
  1086. TCh2Reg := TRegister(Byte(Ch) - Byte(C_RWEDI))
  1087. Else InternalError($db)
  1088. End;
  1089. Procedure IncState(Var S: Byte);
  1090. {Increases S by 1, wraps around at $ffff to 0 (so we won't get overflow
  1091. errors}
  1092. Begin
  1093. If (s <> $ff)
  1094. Then Inc(s)
  1095. Else s := 0
  1096. End;
  1097. Function RegInSequence(Reg: TRegister; Const Content: TContent): Boolean;
  1098. {checks the whole sequence of Content (so StartMod and and the next NrOfMods
  1099. Pai objects) to see whether Reg is used somewhere, without it being loaded
  1100. with something else first}
  1101. Var p: Pai;
  1102. Counter: Byte;
  1103. TmpResult: Boolean;
  1104. RegsChecked: TRegSet;
  1105. Begin
  1106. RegsChecked := [];
  1107. p := Content.StartMod;
  1108. TmpResult := False;
  1109. Counter := 1;
  1110. While Not(TmpResult) And
  1111. (Counter <= Content.NrOfMods) Do
  1112. Begin
  1113. If (p^.typ = ait_instruction) and
  1114. ((Pai386(p)^.opcode = A_MOV) or
  1115. (Pai386(p)^.opcode = A_MOVZX) or
  1116. (Pai386(p)^.opcode = A_MOVSX))
  1117. Then
  1118. Begin
  1119. If (Pai386(p)^.oper[0].typ = top_ref) Then
  1120. With Pai386(p)^.oper[0].ref^ Do
  1121. If (Base = ProcInfo.FramePointer) And
  1122. (Index = R_NO)
  1123. Then
  1124. Begin
  1125. RegsChecked := RegsChecked + [Reg32(Pai386(p)^.oper[1].reg)];
  1126. If Reg = Reg32(Pai386(p)^.oper[1].reg) Then
  1127. Break;
  1128. End
  1129. Else
  1130. Begin
  1131. If (Base = Reg) And
  1132. Not(Base In RegsChecked)
  1133. Then TmpResult := True;
  1134. If Not(TmpResult) And
  1135. (Index = Reg) And
  1136. Not(Index In RegsChecked)
  1137. Then TmpResult := True;
  1138. End
  1139. End
  1140. Else TmpResult := RegInInstruction(Reg, p);
  1141. Inc(Counter);
  1142. GetNextInstruction(p,p)
  1143. End;
  1144. RegInSequence := TmpResult
  1145. End;
  1146. Procedure DestroyReg(p1: PPaiProp; Reg: TRegister);
  1147. {Destroys the contents of the register Reg in the PPaiProp p1, as well as the
  1148. contents of registers are loaded with a memory location based on Reg}
  1149. Var TmpWState, TmpRState: Byte;
  1150. Counter: TRegister;
  1151. Begin
  1152. Reg := Reg32(Reg);
  1153. NrOfInstrSinceLastMod[Reg] := 0;
  1154. If (Reg >= R_EAX) And (Reg <= R_EDI)
  1155. Then
  1156. Begin
  1157. With p1^.Regs[Reg] Do
  1158. Begin
  1159. IncState(WState);
  1160. TmpWState := WState;
  1161. TmpRState := RState;
  1162. FillChar(p1^.Regs[Reg], SizeOf(TContent), 0);
  1163. WState := TmpWState;
  1164. RState := TmpRState;
  1165. End;
  1166. For Counter := R_EAX to R_EDI Do
  1167. With p1^.Regs[Counter] Do
  1168. If (Typ = Con_Ref) And
  1169. RegInSequence(Reg, p1^.Regs[Counter])
  1170. Then
  1171. Begin
  1172. IncState(WState);
  1173. TmpWState := WState;
  1174. TmpRState := RState;
  1175. FillChar(p1^.Regs[Counter], SizeOf(TContent), 0);
  1176. WState := TmpWState;
  1177. RState := TmpRState;
  1178. End;
  1179. End;
  1180. End;
  1181. {Procedure AddRegsToSet(p: Pai; Var RegSet: TRegSet);
  1182. Begin
  1183. If (p^.typ = ait_instruction) Then
  1184. Begin
  1185. Case Pai386(p)^.oper[0].typ Of
  1186. top_reg:
  1187. If Not(Pai386(p)^.oper[0].reg in [R_NO,R_ESP,ProcInfo.FramePointer]) Then
  1188. RegSet := RegSet + [Pai386(p)^.oper[0].reg];
  1189. top_ref:
  1190. With TReference(Pai386(p)^.oper[0]^) Do
  1191. Begin
  1192. If Not(Base in [ProcInfo.FramePointer,R_NO,R_ESP])
  1193. Then RegSet := RegSet + [Base];
  1194. If Not(Index in [ProcInfo.FramePointer,R_NO,R_ESP])
  1195. Then RegSet := RegSet + [Index];
  1196. End;
  1197. End;
  1198. Case Pai386(p)^.oper[1].typ Of
  1199. top_reg:
  1200. If Not(Pai386(p)^.oper[1].reg in [R_NO,R_ESP,ProcInfo.FramePointer]) Then
  1201. If RegSet := RegSet + [TRegister(TwoWords(Pai386(p)^.oper[1]).Word1];
  1202. top_ref:
  1203. With TReference(Pai386(p)^.oper[1]^) Do
  1204. Begin
  1205. If Not(Base in [ProcInfo.FramePointer,R_NO,R_ESP])
  1206. Then RegSet := RegSet + [Base];
  1207. If Not(Index in [ProcInfo.FramePointer,R_NO,R_ESP])
  1208. Then RegSet := RegSet + [Index];
  1209. End;
  1210. End;
  1211. End;
  1212. End;}
  1213. Function OpsEquivalent(const o1, o2: toper; Var RegInfo: TRegInfo; OpAct: TopAction): Boolean;
  1214. Begin {checks whether the two ops are equivalent}
  1215. OpsEquivalent := False;
  1216. if o1.typ=o2.typ then
  1217. Case o1.typ Of
  1218. Top_Reg:
  1219. OpsEquivalent :=RegsEquivalent(o1.reg,o2.reg, RegInfo, OpAct);
  1220. Top_Ref:
  1221. OpsEquivalent := RefsEquivalent(o1.ref^, o2.ref^, RegInfo, OpAct);
  1222. Top_Const:
  1223. OpsEquivalent := o1.val = o2.val;
  1224. Top_None:
  1225. OpsEquivalent := True
  1226. End;
  1227. End;
  1228. Function OpsEqual(const o1,o2:toper): Boolean;
  1229. Begin {checks whether the two ops are equal}
  1230. OpsEqual := False;
  1231. if o1.typ=o2.typ then
  1232. Case o1.typ Of
  1233. Top_Reg :
  1234. OpsEqual:=o1.reg=o2.reg;
  1235. Top_Ref :
  1236. OpsEqual := RefsEqual(o1.ref^, o2.ref^);
  1237. Top_Const :
  1238. OpsEqual:=o1.val=o2.val;
  1239. Top_Symbol :
  1240. OpsEqual:=(o1.sym=o2.sym) and (o1.symofs=o2.symofs);
  1241. Top_None :
  1242. OpsEqual := True
  1243. End;
  1244. End;
  1245. Function InstructionsEquivalent(p1, p2: Pai; Var RegInfo: TRegInfo): Boolean;
  1246. {$ifdef csdebug}
  1247. var hp: pai;
  1248. {$endif csdebug}
  1249. Begin {checks whether two Pai386 instructions are equal}
  1250. If Assigned(p1) And Assigned(p2) And
  1251. (Pai(p1)^.typ = ait_instruction) And
  1252. (Pai(p1)^.typ = ait_instruction) And
  1253. (Pai386(p1)^.opcode = Pai386(p2)^.opcode) And
  1254. (Pai386(p1)^.oper[0].typ = Pai386(p2)^.oper[0].typ) And
  1255. (Pai386(p1)^.oper[1].typ = Pai386(p2)^.oper[1].typ) And
  1256. (Pai386(p1)^.oper[2].typ = Pai386(p2)^.oper[2].typ)
  1257. Then
  1258. {both instructions have the same structure:
  1259. "<operator> <operand of type1>, <operand of type 2>"}
  1260. If ((Pai386(p1)^.opcode = A_MOV) or
  1261. (Pai386(p1)^.opcode = A_MOVZX) or
  1262. (Pai386(p1)^.opcode = A_MOVSX)) And
  1263. (Pai386(p1)^.oper[0].typ = top_ref) {then .oper[1]t = top_reg} Then
  1264. If Not(RegInRef(Pai386(p1)^.oper[1].reg, Pai386(p1)^.oper[0].ref^)) Then
  1265. {the "old" instruction is a load of a register with a new value, not with
  1266. a value based on the contents of this register (so no "mov (reg), reg")}
  1267. If Not(RegInRef(Pai386(p2)^.oper[1].reg, Pai386(p2)^.oper[0].ref^)) And
  1268. RefsEqual(Pai386(p1)^.oper[0].ref^, Pai386(p2)^.oper[0].ref^)
  1269. Then
  1270. {the "new" instruction is also a load of a register with a new value, and
  1271. this value is fetched from the same memory location}
  1272. Begin
  1273. With Pai386(p2)^.oper[0].ref^ Do
  1274. Begin
  1275. If Not(Base in [ProcInfo.FramePointer, R_NO, R_ESP])
  1276. {it won't do any harm if the register is already in RegsLoadedForRef}
  1277. Then RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Base];
  1278. If Not(Index in [ProcInfo.FramePointer, R_NO, R_ESP])
  1279. Then RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Index];
  1280. End;
  1281. {add the registers from the reference (.oper[0]) to the RegInfo, all registers
  1282. from the reference are the same in the old and in the new instruction
  1283. sequence}
  1284. AddOp2RegInfo(Pai386(p1)^.oper[0], RegInfo);
  1285. {the registers from .oper[1] have to be equivalent, but not necessarily equal}
  1286. InstructionsEquivalent :=
  1287. RegsEquivalent(Pai386(p1)^.oper[1].reg, Pai386(p2)^.oper[1].reg, RegInfo, OpAct_Write);
  1288. End
  1289. {the registers are loaded with values from different memory locations. If
  1290. this was allowed, the instructions "mov -4(esi),eax" and "mov -4(ebp),eax"
  1291. would be considered equivalent}
  1292. Else InstructionsEquivalent := False
  1293. Else
  1294. {load register with a value based on the current value of this register}
  1295. Begin
  1296. With Pai386(p2)^.oper[0].ref^ Do
  1297. Begin
  1298. If Not(Base in [ProcInfo.FramePointer,
  1299. Reg32(Pai386(p2)^.oper[1].reg),R_NO,R_ESP])
  1300. {it won't do any harm if the register is already in RegsLoadedForRef}
  1301. Then
  1302. Begin
  1303. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Base];
  1304. {$ifdef csdebug}
  1305. Writeln(att_reg2str[base], ' added');
  1306. {$endif csdebug}
  1307. end;
  1308. If Not(Index in [ProcInfo.FramePointer,
  1309. Reg32(Pai386(p2)^.oper[1].reg),R_NO,R_ESP])
  1310. Then
  1311. Begin
  1312. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef + [Index];
  1313. {$ifdef csdebug}
  1314. Writeln(att_reg2str[index], ' added');
  1315. {$endif csdebug}
  1316. end;
  1317. End;
  1318. If Not(Reg32(Pai386(p2)^.oper[1].reg) In [ProcInfo.FramePointer,R_NO,R_ESP])
  1319. Then
  1320. Begin
  1321. RegInfo.RegsLoadedForRef := RegInfo.RegsLoadedForRef -
  1322. [Reg32(Pai386(p2)^.oper[1].reg)];
  1323. {$ifdef csdebug}
  1324. Writeln(att_reg2str[Reg32(Pai386(p2)^.oper[1].reg)], ' removed');
  1325. {$endif csdebug}
  1326. end;
  1327. InstructionsEquivalent :=
  1328. OpsEquivalent(Pai386(p1)^.oper[0], Pai386(p2)^.oper[0], RegInfo, OpAct_Read) And
  1329. OpsEquivalent(Pai386(p1)^.oper[1], Pai386(p2)^.oper[1], RegInfo, OpAct_Write)
  1330. End
  1331. Else
  1332. {an instruction <> mov, movzx, movsx}
  1333. begin
  1334. {$ifdef csdebug}
  1335. hp := new(pai_asm_comment,init(strpnew('checking if equivalent')));
  1336. hp^.previous := p2;
  1337. hp^.next := p2^.next;
  1338. p2^.next^.previous := hp;
  1339. p2^.next := hp;
  1340. {$endif csdebug}
  1341. InstructionsEquivalent :=
  1342. OpsEquivalent(Pai386(p1)^.oper[0], Pai386(p2)^.oper[0], RegInfo, OpAct_Unknown) And
  1343. OpsEquivalent(Pai386(p1)^.oper[1], Pai386(p2)^.oper[1], RegInfo, OpAct_Unknown) And
  1344. OpsEquivalent(Pai386(p1)^.oper[2], Pai386(p2)^.oper[2], RegInfo, OpAct_Unknown)
  1345. end
  1346. {the instructions haven't even got the same structure, so they're certainly
  1347. not equivalent}
  1348. Else
  1349. begin
  1350. {$ifdef csdebug}
  1351. hp := new(pai_asm_comment,init(strpnew('different opcodes/format')));
  1352. hp^.previous := p2;
  1353. hp^.next := p2^.next;
  1354. p2^.next^.previous := hp;
  1355. p2^.next := hp;
  1356. {$endif csdebug}
  1357. InstructionsEquivalent := False;
  1358. end;
  1359. {$ifdef csdebug}
  1360. hp := new(pai_asm_comment,init(strpnew('instreq: '+tostr(byte(instructionsequivalent)))));
  1361. hp^.previous := p2;
  1362. hp^.next := p2^.next;
  1363. p2^.next^.previous := hp;
  1364. p2^.next := hp;
  1365. {$endif csdebug}
  1366. End;
  1367. (*
  1368. Function InstructionsEqual(p1, p2: Pai): Boolean;
  1369. Begin {checks whether two Pai386 instructions are equal}
  1370. InstructionsEqual :=
  1371. Assigned(p1) And Assigned(p2) And
  1372. ((Pai(p1)^.typ = ait_instruction) And
  1373. (Pai(p1)^.typ = ait_instruction) And
  1374. (Pai386(p1)^.opcode = Pai386(p2)^.opcode) And
  1375. (Pai386(p1)^.oper[0].typ = Pai386(p2)^.oper[0].typ) And
  1376. (Pai386(p1)^.oper[1].typ = Pai386(p2)^.oper[1].typ) And
  1377. OpsEqual(Pai386(p1)^.oper[0].typ, Pai386(p1)^.oper[0], Pai386(p2)^.oper[0]) And
  1378. OpsEqual(Pai386(p1)^.oper[1].typ, Pai386(p1)^.oper[1], Pai386(p2)^.oper[1]))
  1379. End;
  1380. *)
  1381. Function RefInInstruction(Const Ref: TReference; p: Pai): Boolean;
  1382. {checks whehter Ref is used in P}
  1383. Var TmpResult: Boolean;
  1384. Begin
  1385. TmpResult := False;
  1386. If (p^.typ = ait_instruction) Then
  1387. Begin
  1388. If (Pai386(p)^.oper[0].typ = Top_Ref) Then
  1389. TmpResult := RefsEqual(Ref, Pai386(p)^.oper[0].ref^);
  1390. If Not(TmpResult) And (Pai386(p)^.oper[1].typ = Top_Ref) Then
  1391. TmpResult := RefsEqual(Ref, Pai386(p)^.oper[1].ref^);
  1392. End;
  1393. RefInInstruction := TmpResult;
  1394. End;
  1395. Function RefInSequence(Const Ref: TReference; Content: TContent): Boolean;
  1396. {checks the whole sequence of Content (so StartMod and and the next NrOfMods
  1397. Pai objects) to see whether Ref is used somewhere}
  1398. Var p: Pai;
  1399. Counter: Byte;
  1400. TmpResult: Boolean;
  1401. Begin
  1402. p := Content.StartMod;
  1403. TmpResult := False;
  1404. Counter := 1;
  1405. While Not(TmpResult) And
  1406. (Counter <= Content.NrOfMods) Do
  1407. Begin
  1408. If (p^.typ = ait_instruction) And
  1409. RefInInstruction(Ref, p)
  1410. Then TmpResult := True;
  1411. Inc(Counter);
  1412. GetNextInstruction(p,p)
  1413. End;
  1414. RefInSequence := TmpResult
  1415. End;
  1416. Procedure DestroyRefs(p: pai; Const Ref: TReference; WhichReg: TRegister);
  1417. {destroys all registers which possibly contain a reference to Ref, WhichReg
  1418. is the register whose contents are being written to memory (if this proc
  1419. is called because of a "mov?? %reg, (mem)" instruction)}
  1420. Var Counter: TRegister;
  1421. Begin
  1422. WhichReg := Reg32(WhichReg);
  1423. If ((Ref.base = ProcInfo.FramePointer) And
  1424. (Ref.Index = R_NO)) Or
  1425. Assigned(Ref.Symbol)
  1426. Then
  1427. {write something to a parameter, a local or global variable, so
  1428. * with uncertzain optimizations on:
  1429. - destroy the contents of registers whose contents have somewhere a
  1430. "mov?? (Ref), %reg". WhichReg (this is the register whose contents
  1431. are being written to memory) is not destroyed if it's StartMod is
  1432. of that form and NrOfMods = 1 (so if it holds ref, but is not a
  1433. pointer based on Ref)
  1434. * with uncertain optimizations off:
  1435. - also destroy registers that contain any pointer}
  1436. For Counter := R_EAX to R_EDI Do
  1437. With PPaiProp(p^.OptInfo)^.Regs[Counter] Do
  1438. Begin
  1439. If (typ = Con_Ref) And
  1440. ((Not(cs_UncertainOpts in aktglobalswitches) And
  1441. (NrOfMods <> 1)
  1442. ) Or
  1443. (RefInSequence(Ref,PPaiProp(p^.OptInfo)^.Regs[Counter]) And
  1444. ((Counter <> WhichReg) Or
  1445. ((NrOfMods <> 1) And
  1446. {StarMod is always of the type ait_instruction}
  1447. (Pai386(StartMod)^.oper[0].typ = top_ref) And
  1448. RefsEqual(Pai386(StartMod)^.oper[0].ref^, Ref)
  1449. )
  1450. )
  1451. )
  1452. )
  1453. Then
  1454. DestroyReg(PPaiProp(p^.OptInfo), Counter)
  1455. End
  1456. Else
  1457. {write something to a pointer location, so
  1458. * with uncertain optimzations on:
  1459. - do not destroy registers which contain a local/global variable or a
  1460. parameter, except if DestroyRefs is called because of a "movsl"
  1461. * with uncertain optimzations off:
  1462. - destroy every register which contains a memory location
  1463. }
  1464. For Counter := R_EAX to R_EDI Do
  1465. With PPaiProp(p^.OptInfo)^.Regs[Counter] Do
  1466. If (typ = Con_Ref) And
  1467. (Not(cs_UncertainOpts in aktglobalswitches) Or
  1468. {for movsl}
  1469. (Ref.Base = R_EDI) Or
  1470. {don't destroy if reg contains a parameter, local or global variable}
  1471. Not((NrOfMods = 1) And
  1472. (Pai386(StartMod)^.oper[0].typ = top_ref) And
  1473. ((Pai386(StartMod)^.oper[0].ref^.base = ProcInfo.FramePointer) Or
  1474. Assigned(Pai386(StartMod)^.oper[0].ref^.Symbol)
  1475. )
  1476. )
  1477. )
  1478. Then DestroyReg(PPaiProp(p^.OptInfo), Counter)
  1479. End;
  1480. Procedure DestroyAllRegs(p: PPaiProp);
  1481. Var Counter: TRegister;
  1482. Begin {initializes/desrtoys all registers}
  1483. For Counter := R_EAX To R_EDI Do
  1484. DestroyReg(p, Counter);
  1485. p^.DirFlag := F_Unknown;
  1486. End;
  1487. Procedure DestroyOp(PaiObj: Pai; const o:Toper);
  1488. Begin
  1489. Case o.typ Of
  1490. top_reg: DestroyReg(PPaiProp(PaiObj^.OptInfo), o.reg);
  1491. top_ref: DestroyRefs(PaiObj, o.ref^, R_NO);
  1492. top_symbol:;
  1493. End;
  1494. End;
  1495. Procedure ReadReg(p: PPaiProp; Reg: TRegister);
  1496. Begin
  1497. Reg := Reg32(Reg);
  1498. If Reg in [R_EAX..R_EDI] Then
  1499. IncState(p^.Regs[Reg32(Reg)].RState)
  1500. End;
  1501. Procedure ReadRef(p: PPaiProp; Ref: PReference);
  1502. Begin
  1503. If Ref^.Base <> R_NO Then
  1504. ReadReg(p, Ref^.Base);
  1505. If Ref^.Index <> R_NO Then
  1506. ReadReg(p, Ref^.Index);
  1507. End;
  1508. Procedure ReadOp(P: PPaiProp;const o:toper);
  1509. Begin
  1510. Case o.typ Of
  1511. top_reg: ReadReg(P, o.reg);
  1512. top_ref: ReadRef(P, o.ref);
  1513. top_symbol : ;
  1514. End;
  1515. End;
  1516. Function DFAPass1(AsmL: PAasmOutput; BlockStart: Pai): Pai;
  1517. {gathers the RegAlloc data... still need to think about where to store it to
  1518. avoid global vars}
  1519. Var BlockEnd: Pai;
  1520. Begin
  1521. BlockEnd := FindLoHiLabels(LoLab, HiLab, LabDif, BlockStart);
  1522. BuildLabelTableAndFixRegAlloc(AsmL, LTable, LoLab, LabDif, BlockStart, BlockEnd);
  1523. DFAPass1 := BlockEnd;
  1524. End;
  1525. {$ifdef arithopt}
  1526. Procedure AddInstr2RegContents({$ifdef statedebug} asml: paasmoutput; {$endif}
  1527. p: pai386; reg: TRegister);
  1528. {$ifdef statedebug}
  1529. var hp: pai;
  1530. {$endif statedebug}
  1531. Begin
  1532. With PPaiProp(p^.optinfo)^.Regs[reg] Do
  1533. If (Typ = Con_Ref)
  1534. Then
  1535. Begin
  1536. IncState(WState);
  1537. {also store how many instructions are part of the sequence in the first
  1538. instructions PPaiProp, so it can be easily accessed from within
  1539. CheckSequence}
  1540. Inc(NrOfMods, NrOfInstrSinceLastMod[Reg]);
  1541. PPaiProp(Pai(StartMod)^.OptInfo)^.Regs[Reg].NrOfMods := NrOfMods;
  1542. NrOfInstrSinceLastMod[Reg] := 0;
  1543. {$ifdef StateDebug}
  1544. hp := new(pai_asm_comment,init(strpnew(att_reg2str[reg]+': '+tostr(PPaiProp(p^.optinfo)^.Regs[reg].WState)
  1545. + ' -- ' + tostr(PPaiProp(p^.optinfo)^.Regs[reg].nrofmods))));
  1546. InsertLLItem(AsmL, p, p^.next, hp);
  1547. {$endif StateDebug}
  1548. End
  1549. Else
  1550. Begin
  1551. DestroyReg(PPaiProp(p^.optinfo), Reg);
  1552. {$ifdef StateDebug}
  1553. hp := new(pai_asm_comment,init(strpnew(att_reg2str[reg]+': '+tostr(PPaiProp(p^.optinfo)^.Regs[reg].WState))));
  1554. InsertLLItem(AsmL, p, p^.next, hp);
  1555. {$endif StateDebug}
  1556. End
  1557. End;
  1558. Procedure AddInstr2OpContents({$ifdef statedebug} asml: paasmoutput; {$endif}
  1559. p: pai386; const oper: TOper);
  1560. Begin
  1561. If oper.typ = top_reg Then
  1562. AddInstr2RegContents({$ifdef statedebug} asml, {$endif}p, oper.reg)
  1563. Else
  1564. Begin
  1565. ReadOp(PPaiProp(p^.optinfo), oper);
  1566. DestroyOp(p, oper);
  1567. End
  1568. End;
  1569. {$endif arithopt}
  1570. Procedure DoDFAPass2(
  1571. {$Ifdef StateDebug}
  1572. AsmL: PAasmOutput;
  1573. {$endif statedebug}
  1574. BlockStart, BlockEnd: Pai);
  1575. {Analyzes the Data Flow of an assembler list. Starts creating the reg
  1576. contents for the instructions starting with p. Returns the last pai which has
  1577. been processed}
  1578. Var
  1579. CurProp: PPaiProp;
  1580. {$ifdef AnalyzeLoops}
  1581. TmpState: Byte;
  1582. {$endif AnalyzeLoops}
  1583. Cnt, InstrCnt : Longint;
  1584. InstrProp: TAsmInstrucProp;
  1585. UsedRegs: TRegSet;
  1586. p, hp : Pai;
  1587. TmpRef: TReference;
  1588. TmpReg: TRegister;
  1589. Begin
  1590. p := BlockStart;
  1591. UsedRegs := [];
  1592. UpdateUsedregs(UsedRegs, p);
  1593. SkipHead(P);
  1594. BlockStart := p;
  1595. InstrCnt := 1;
  1596. FillChar(NrOfInstrSinceLastMod, SizeOf(NrOfInstrSinceLastMod), 0);
  1597. While (P <> BlockEnd) Do
  1598. Begin
  1599. {$IfDef TP}
  1600. New(CurProp);
  1601. {$Else TP}
  1602. CurProp := @PaiPropBlock^[InstrCnt];
  1603. {$EndIf TP}
  1604. If (p <> BlockStart)
  1605. Then
  1606. Begin
  1607. {$ifdef JumpAnal}
  1608. If (p^.Typ <> ait_label) Then
  1609. {$endif JumpAnal}
  1610. Begin
  1611. GetLastInstruction(p, hp);
  1612. CurProp^.Regs := PPaiProp(hp^.OptInfo)^.Regs;
  1613. CurProp^.DirFlag := PPaiProp(hp^.OptInfo)^.DirFlag;
  1614. End
  1615. End
  1616. Else
  1617. Begin
  1618. FillChar(CurProp^, SizeOf(CurProp^), 0);
  1619. { For TmpReg := R_EAX to R_EDI Do
  1620. CurProp^.Regs[TmpReg].WState := 1;}
  1621. End;
  1622. CurProp^.UsedRegs := UsedRegs;
  1623. CurProp^.CanBeRemoved := False;
  1624. UpdateUsedRegs(UsedRegs, Pai(p^.Next));
  1625. {$ifdef TP}
  1626. PPaiProp(p^.OptInfo) := CurProp;
  1627. {$Endif TP}
  1628. For TmpReg := R_EAX To R_EDI Do
  1629. Inc(NrOfInstrSinceLastMod[TmpReg]);
  1630. Case p^.typ Of
  1631. ait_label:
  1632. {$Ifndef JumpAnal}
  1633. If (Pai_label(p)^.l^.is_used) Then
  1634. DestroyAllRegs(CurProp);
  1635. {$Else JumpAnal}
  1636. Begin
  1637. If (Pai_Label(p)^.is_used) Then
  1638. With LTable^[Pai_Label(p)^.l^.labelnr-LoLab] Do
  1639. {$IfDef AnalyzeLoops}
  1640. If (RefsFound = Pai_Label(p)^.l^.RefCount)
  1641. {$Else AnalyzeLoops}
  1642. If (JmpsProcessed = Pai_Label(p)^.l^.RefCount)
  1643. {$EndIf AnalyzeLoops}
  1644. Then
  1645. {all jumps to this label have been found}
  1646. {$IfDef AnalyzeLoops}
  1647. If (JmpsProcessed > 0)
  1648. Then
  1649. {$EndIf AnalyzeLoops}
  1650. {we've processed at least one jump to this label}
  1651. Begin
  1652. If (GetLastInstruction(p, hp) And
  1653. Not(((hp^.typ = ait_instruction)) And
  1654. (pai386_labeled(hp)^.is_jmp))
  1655. Then
  1656. {previous instruction not a JMP -> the contents of the registers after the
  1657. previous intruction has been executed have to be taken into account as well}
  1658. For TmpReg := R_EAX to R_EDI Do
  1659. Begin
  1660. If (CurProp^.Regs[TmpReg].WState <>
  1661. PPaiProp(hp^.OptInfo)^.Regs[TmpReg].WState)
  1662. Then DestroyReg(CurProp, TmpReg)
  1663. End
  1664. End
  1665. {$IfDef AnalyzeLoops}
  1666. Else
  1667. {a label from a backward jump (e.g. a loop), no jump to this label has
  1668. already been processed}
  1669. If GetLastInstruction(p, hp) And
  1670. Not(hp^.typ = ait_instruction) And
  1671. (pai386_labeled(hp)^.opcode = A_JMP))
  1672. Then
  1673. {previous instruction not a jmp, so keep all the registers' contents from the
  1674. previous instruction}
  1675. Begin
  1676. CurProp^.Regs := PPaiProp(hp^.OptInfo)^.Regs;
  1677. CurProp^.DirFlag := PPaiProp(hp^.OptInfo)^.DirFlag;
  1678. End
  1679. Else
  1680. {previous instruction a jmp and no jump to this label processed yet}
  1681. Begin
  1682. hp := p;
  1683. Cnt := InstrCnt;
  1684. {continue until we find a jump to the label or a label which has already
  1685. been processed}
  1686. While GetNextInstruction(hp, hp) And
  1687. Not((hp^.typ = ait_instruction) And
  1688. (pai386(hp)^.is_jmp) and
  1689. (pasmlabel(pai386(hp)^.oper[0].sym)^.labelnr = Pai_Label(p)^.l^.labelnr)) And
  1690. Not((hp^.typ = ait_label) And
  1691. (LTable^[Pai_Label(hp)^.l^.labelnr-LoLab].RefsFound
  1692. = Pai_Label(hp)^.l^.RefCount) And
  1693. (LTable^[Pai_Label(hp)^.l^.labelnr-LoLab].JmpsProcessed > 0)) Do
  1694. Inc(Cnt);
  1695. If (hp^.typ = ait_label)
  1696. Then
  1697. {there's a processed label after the current one}
  1698. Begin
  1699. CurProp^.Regs := PaiPropBlock^[Cnt].Regs;
  1700. CurProp^.DirFlag := PaiPropBlock^[Cnt].DirFlag;
  1701. End
  1702. Else
  1703. {there's no label anymore after the current one, or they haven't been
  1704. processed yet}
  1705. Begin
  1706. GetLastInstruction(p, hp);
  1707. CurProp^.Regs := PPaiProp(hp^.OptInfo)^.Regs;
  1708. CurProp^.DirFlag := PPaiProp(hp^.OptInfo)^.DirFlag;
  1709. DestroyAllRegs(PPaiProp(hp^.OptInfo))
  1710. End
  1711. End
  1712. {$EndIf AnalyzeLoops}
  1713. Else
  1714. {not all references to this label have been found, so destroy all registers}
  1715. Begin
  1716. GetLastInstruction(p, hp);
  1717. CurProp^.Regs := PPaiProp(hp^.OptInfo)^.Regs;
  1718. CurProp^.DirFlag := PPaiProp(hp^.OptInfo)^.DirFlag;
  1719. DestroyAllRegs(CurProp)
  1720. End;
  1721. End;
  1722. {$EndIf JumpAnal}
  1723. {$ifdef GDB}
  1724. ait_stabs, ait_stabn, ait_stab_function_name:;
  1725. {$endif GDB}
  1726. ait_instruction:
  1727. Begin
  1728. if pai386(p)^.is_jmp then
  1729. begin
  1730. {$IfNDef JumpAnal}
  1731. ;
  1732. {$Else JumpAnal}
  1733. With LTable^[pasmlabel(pai386(p)^.oper[0].sym)^.labelnr-LoLab] Do
  1734. If (RefsFound = pasmlabel(pai386(p)^.oper[0].sym)^.RefCount) Then
  1735. Begin
  1736. If (InstrCnt < InstrNr)
  1737. Then
  1738. {forward jump}
  1739. If (JmpsProcessed = 0) Then
  1740. {no jump to this label has been processed yet}
  1741. Begin
  1742. PaiPropBlock^[InstrNr].Regs := CurProp^.Regs;
  1743. PaiPropBlock^[InstrNr].DirFlag := CurProp^.DirFlag;
  1744. Inc(JmpsProcessed);
  1745. End
  1746. Else
  1747. Begin
  1748. For TmpReg := R_EAX to R_EDI Do
  1749. If (PaiPropBlock^[InstrNr].Regs[TmpReg].WState <>
  1750. CurProp^.Regs[TmpReg].WState) Then
  1751. DestroyReg(@PaiPropBlock^[InstrNr], TmpReg);
  1752. Inc(JmpsProcessed);
  1753. End
  1754. {$ifdef AnalyzeLoops}
  1755. Else
  1756. { backward jump, a loop for example}
  1757. { If (JmpsProcessed > 0) Or
  1758. Not(GetLastInstruction(PaiObj, hp) And
  1759. (hp^.typ = ait_labeled_instruction) And
  1760. (pai386_labeled(hp)^.opcode = A_JMP))
  1761. Then}
  1762. {instruction prior to label is not a jmp, or at least one jump to the label
  1763. has yet been processed}
  1764. Begin
  1765. Inc(JmpsProcessed);
  1766. For TmpReg := R_EAX to R_EDI Do
  1767. If (PaiPropBlock^[InstrNr].Regs[TmpReg].WState <>
  1768. CurProp^.Regs[TmpReg].WState)
  1769. Then
  1770. Begin
  1771. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1772. Cnt := InstrNr;
  1773. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1774. Begin
  1775. DestroyReg(@PaiPropBlock^[Cnt], TmpReg);
  1776. Inc(Cnt);
  1777. End;
  1778. While (Cnt <= InstrCnt) Do
  1779. Begin
  1780. Inc(PaiPropBlock^[Cnt].Regs[TmpReg].WState);
  1781. Inc(Cnt)
  1782. End
  1783. End;
  1784. End
  1785. { Else }
  1786. {instruction prior to label is a jmp and no jumps to the label have yet been
  1787. processed}
  1788. { Begin
  1789. Inc(JmpsProcessed);
  1790. For TmpReg := R_EAX to R_EDI Do
  1791. Begin
  1792. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1793. Cnt := InstrNr;
  1794. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1795. Begin
  1796. PaiPropBlock^[Cnt].Regs[TmpReg] := CurProp^.Regs[TmpReg];
  1797. Inc(Cnt);
  1798. End;
  1799. TmpState := PaiPropBlock^[InstrNr].Regs[TmpReg].WState;
  1800. While (TmpState = PaiPropBlock^[Cnt].Regs[TmpReg].WState) Do
  1801. Begin
  1802. DestroyReg(@PaiPropBlock^[Cnt], TmpReg);
  1803. Inc(Cnt);
  1804. End;
  1805. While (Cnt <= InstrCnt) Do
  1806. Begin
  1807. Inc(PaiPropBlock^[Cnt].Regs[TmpReg].WState);
  1808. Inc(Cnt)
  1809. End
  1810. End
  1811. End}
  1812. {$endif AnalyzeLoops}
  1813. End;
  1814. {$EndIf JumpAnal}
  1815. end
  1816. else
  1817. begin
  1818. InstrProp := AsmInstr[Pai386(p)^.opcode];
  1819. Case Pai386(p)^.opcode Of
  1820. A_MOV, A_MOVZX, A_MOVSX:
  1821. Begin
  1822. Case Pai386(p)^.oper[0].typ Of
  1823. Top_Reg:
  1824. Case Pai386(p)^.oper[1].typ Of
  1825. Top_Reg:
  1826. Begin
  1827. DestroyReg(CurProp, Pai386(p)^.oper[1].reg);
  1828. ReadReg(CurProp, Pai386(p)^.oper[0].reg);
  1829. { CurProp^.Regs[Pai386(p)^.oper[1].reg] :=
  1830. CurProp^.Regs[Pai386(p)^.oper[0].reg];
  1831. If (CurProp^.Regs[Pai386(p)^.oper[1].reg].ModReg = R_NO) Then
  1832. CurProp^.Regs[Pai386(p)^.oper[1].reg].ModReg :=
  1833. Pai386(p)^.oper[0].reg;}
  1834. End;
  1835. Top_Ref:
  1836. Begin
  1837. ReadReg(CurProp, Pai386(p)^.oper[0].reg);
  1838. ReadRef(CurProp, Pai386(p)^.oper[1].ref);
  1839. DestroyRefs(p, Pai386(p)^.oper[1].ref^, Pai386(p)^.oper[0].reg);
  1840. End;
  1841. End;
  1842. Top_Ref:
  1843. Begin {destination is always a register in this case}
  1844. ReadRef(CurProp, Pai386(p)^.oper[0].ref);
  1845. ReadReg(CurProp, Pai386(p)^.oper[1].reg);
  1846. TmpReg := Reg32(Pai386(p)^.oper[1].reg);
  1847. If RegInRef(TmpReg, Pai386(p)^.oper[0].ref^) And
  1848. (CurProp^.Regs[TmpReg].Typ = Con_Ref)
  1849. Then
  1850. Begin
  1851. With CurProp^.Regs[TmpReg] Do
  1852. Begin
  1853. IncState(WState);
  1854. {also store how many instructions are part of the sequence in the first
  1855. instructions PPaiProp, so it can be easily accessed from within
  1856. CheckSequence}
  1857. Inc(NrOfMods, NrOfInstrSinceLastMod[TmpReg]);
  1858. PPaiProp(Pai(StartMod)^.OptInfo)^.Regs[TmpReg].NrOfMods := NrOfMods;
  1859. NrOfInstrSinceLastMod[TmpReg] := 0;
  1860. End;
  1861. End
  1862. Else
  1863. Begin
  1864. DestroyReg(CurProp, TmpReg);
  1865. If Not(RegInRef(TmpReg, Pai386(p)^.oper[0].ref^)) Then
  1866. With CurProp^.Regs[TmpReg] Do
  1867. Begin
  1868. Typ := Con_Ref;
  1869. StartMod := p;
  1870. NrOfMods := 1;
  1871. End
  1872. End;
  1873. {$ifdef StateDebug}
  1874. hp := new(pai_asm_comment,init(strpnew(att_reg2str[TmpReg]+': '+tostr(CurProp^.Regs[TmpReg].WState))));
  1875. InsertLLItem(AsmL, p, p^.next, hp);
  1876. {$endif StateDebug}
  1877. End;
  1878. Top_Const:
  1879. Begin
  1880. Case Pai386(p)^.oper[1].typ Of
  1881. Top_Reg:
  1882. Begin
  1883. TmpReg := Reg32(Pai386(p)^.oper[1].reg);
  1884. With CurProp^.Regs[TmpReg] Do
  1885. Begin
  1886. DestroyReg(CurProp, TmpReg);
  1887. typ := Con_Const;
  1888. StartMod := p;
  1889. End
  1890. End;
  1891. Top_Ref:
  1892. Begin
  1893. ReadRef(CurProp, Pai386(p)^.oper[1].ref);
  1894. DestroyRefs(P, Pai386(p)^.oper[1].ref^, R_NO);
  1895. End;
  1896. End;
  1897. End;
  1898. End;
  1899. End;
  1900. A_IMUL:
  1901. Begin
  1902. ReadOp(CurProp, Pai386(p)^.oper[0]);
  1903. ReadOp(CurProp, Pai386(p)^.oper[1]);
  1904. If (Pai386(p)^.oper[2].typ = top_none) Then
  1905. If (Pai386(p)^.oper[1].typ = top_none) Then
  1906. Begin
  1907. DestroyReg(CurProp, R_EAX);
  1908. DestroyReg(CurProp, R_EDX)
  1909. End
  1910. Else
  1911. {$ifdef arithopt}
  1912. AddInstr2OpContents(Pai386(p), Pai386(p)^.oper[1])
  1913. {$else arithopt}
  1914. DestroyOp(p, Pai386(p)^.oper[1])
  1915. {$endif arithopt}
  1916. Else
  1917. {$ifdef arithopt}
  1918. AddInstr2OpContents(Pai386(p), Pai386(p)^.oper[2]);
  1919. {$else arithopt}
  1920. DestroyOp(p, Pai386(p)^.oper[2]);
  1921. {$endif arithopt}
  1922. End;
  1923. A_XOR:
  1924. Begin
  1925. ReadOp(CurProp, Pai386(p)^.oper[0]);
  1926. ReadOp(CurProp, Pai386(p)^.oper[1]);
  1927. If (Pai386(p)^.oper[0].typ = top_reg) And
  1928. (Pai386(p)^.oper[1].typ = top_reg) And
  1929. (Pai386(p)^.oper[0].reg = Pai386(p)^.oper[1].reg)
  1930. Then
  1931. Begin
  1932. DestroyReg(CurProp, Pai386(p)^.oper[0].reg);
  1933. CurProp^.Regs[Reg32(Pai386(p)^.oper[0].reg)].typ := Con_Const;
  1934. CurProp^.Regs[Reg32(Pai386(p)^.oper[0].reg)].StartMod := Pointer(0)
  1935. End
  1936. Else
  1937. DestroyOp(p, Pai386(p)^.oper[1]);
  1938. End
  1939. Else
  1940. Begin
  1941. Cnt := 1;
  1942. While (Cnt <= MaxCh) And
  1943. (InstrProp.Ch[Cnt] <> C_None) Do
  1944. Begin
  1945. Case InstrProp.Ch[Cnt] Of
  1946. C_REAX..C_REDI: ReadReg(CurProp,TCh2Reg(InstrProp.Ch[Cnt]));
  1947. C_WEAX..C_RWEDI:
  1948. Begin
  1949. If (InstrProp.Ch[Cnt] >= C_RWEAX) Then
  1950. ReadReg(CurProp, TCh2Reg(InstrProp.Ch[Cnt]));
  1951. DestroyReg(CurProp, TCh2Reg(InstrProp.Ch[Cnt]));
  1952. End;
  1953. {$ifdef arithopt}
  1954. C_MEAX..C_MEDI:
  1955. AddInstr2RegContents({$ifdef statedebug} asml, {$endif}
  1956. Pai386(p),
  1957. TCh2Reg(InstrProp.Ch[Cnt]));
  1958. {$endif arithopt}
  1959. C_CDirFlag: CurProp^.DirFlag := F_NotSet;
  1960. C_SDirFlag: CurProp^.DirFlag := F_Set;
  1961. C_Rop1: ReadOp(CurProp, Pai386(p)^.oper[0]);
  1962. C_Rop2: ReadOp(CurProp, Pai386(p)^.oper[1]);
  1963. C_ROp3: ReadOp(CurProp, Pai386(p)^.oper[2]);
  1964. C_Wop1..C_RWop1:
  1965. Begin
  1966. If (InstrProp.Ch[Cnt] in [C_RWop1]) Then
  1967. ReadOp(CurProp, Pai386(p)^.oper[0]);
  1968. DestroyOp(p, Pai386(p)^.oper[0]);
  1969. End;
  1970. {$ifdef arithopt}
  1971. C_Mop1:
  1972. AddInstr2OpContents({$ifdef statedebug} asml, {$endif}
  1973. Pai386(p), Pai386(p)^.oper[0]);
  1974. {$endif arithopt}
  1975. C_Wop2..C_RWop2:
  1976. Begin
  1977. If (InstrProp.Ch[Cnt] = C_RWop2) Then
  1978. ReadOp(CurProp, Pai386(p)^.oper[1]);
  1979. DestroyOp(p, Pai386(p)^.oper[1]);
  1980. End;
  1981. {$ifdef arithopt}
  1982. C_Mop2:
  1983. AddInstr2OpContents({$ifdef statedebug} asml, {$endif}
  1984. Pai386(p), Pai386(p)^.oper[1]);
  1985. {$endif arithopt}
  1986. C_WOp3..C_RWOp3:
  1987. Begin
  1988. If (InstrProp.Ch[Cnt] = C_RWOp3) Then
  1989. ReadOp(CurProp, Pai386(p)^.oper[2]);
  1990. DestroyOp(p, Pai386(p)^.oper[2]);
  1991. End;
  1992. {$ifdef arithopt}
  1993. C_Mop3:
  1994. AddInstr2OpContents({$ifdef statedebug} asml, {$endif}
  1995. Pai386(p), Pai386(p)^.oper[2]);
  1996. {$endif arithopt}
  1997. C_WMemEDI:
  1998. Begin
  1999. ReadReg(CurProp, R_EDI);
  2000. FillChar(TmpRef, SizeOf(TmpRef), 0);
  2001. TmpRef.Base := R_EDI;
  2002. DestroyRefs(p, TmpRef, R_NO)
  2003. End;
  2004. C_RFlags, C_WFlags, C_RWFlags, C_FPU:
  2005. Else
  2006. Begin
  2007. DestroyAllRegs(CurProp);
  2008. End;
  2009. End;
  2010. Inc(Cnt);
  2011. End
  2012. End;
  2013. end;
  2014. End;
  2015. End
  2016. Else
  2017. Begin
  2018. DestroyAllRegs(CurProp);
  2019. End;
  2020. End;
  2021. Inc(InstrCnt);
  2022. GetNextInstruction(p, p);
  2023. End;
  2024. End;
  2025. Function InitDFAPass2(BlockStart, BlockEnd: Pai): Boolean;
  2026. {reserves memory for the PPaiProps in one big memory block when not using
  2027. TP, returns False if not enough memory is available for the optimizer in all
  2028. cases}
  2029. Var p: Pai;
  2030. Count: Longint;
  2031. { TmpStr: String; }
  2032. Begin
  2033. P := BlockStart;
  2034. SkipHead(P);
  2035. NrOfPaiObjs := 0;
  2036. While (P <> BlockEnd) Do
  2037. Begin
  2038. {$IfDef JumpAnal}
  2039. Case P^.Typ Of
  2040. ait_label:
  2041. Begin
  2042. If (Pai_Label(p)^.l^.is_used) Then
  2043. LTable^[Pai_Label(P)^.l^.labelnr-LoLab].InstrNr := NrOfPaiObjs
  2044. End;
  2045. ait_instruction:
  2046. begin
  2047. if pai386(p)^.is_jmp then
  2048. begin
  2049. If (pasmlabel(pai386(P)^.oper[0].sym)^.labelnr >= LoLab) And
  2050. (pasmlabel(pai386(P)^.oper[0].sym)^.labelnr <= HiLab) Then
  2051. Inc(LTable^[pasmlabel(pai386(P)^.oper[0].sym)^.labelnr-LoLab].RefsFound);
  2052. end;
  2053. end;
  2054. { ait_instruction:
  2055. Begin
  2056. If (Pai386(p)^.opcode = A_PUSH) And
  2057. (Pai386(p)^.oper[0].typ = top_symbol) And
  2058. (PCSymbol(Pai386(p)^.oper[0])^.offset = 0) Then
  2059. Begin
  2060. TmpStr := StrPas(PCSymbol(Pai386(p)^.oper[0])^.symbol);
  2061. If}
  2062. End;
  2063. {$EndIf JumpAnal}
  2064. Inc(NrOfPaiObjs);
  2065. GetNextInstruction(p, p);
  2066. End;
  2067. {$IfDef TP}
  2068. If (MemAvail < (SizeOf(TPaiProp)*NrOfPaiObjs))
  2069. Or (NrOfPaiObjs = 0)
  2070. {this doesn't have to be one contiguous block}
  2071. Then InitDFAPass2 := False
  2072. Else InitDFAPass2 := True;
  2073. {$Else}
  2074. {Uncomment the next line to see how much memory the reloading optimizer needs}
  2075. { Writeln((NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4)));}
  2076. {no need to check mem/maxavail, we've got as much virtual memory as we want}
  2077. If NrOfPaiObjs <> 0 Then
  2078. Begin
  2079. InitDFAPass2 := True;
  2080. GetMem(PaiPropBlock, NrOfPaiObjs*(((SizeOf(TPaiProp)+3)div 4)*4));
  2081. p := BlockStart;
  2082. SkipHead(p);
  2083. For Count := 1 To NrOfPaiObjs Do
  2084. Begin
  2085. PPaiProp(p^.OptInfo) := @PaiPropBlock^[Count];
  2086. GetNextInstruction(p, p);
  2087. End;
  2088. End
  2089. Else InitDFAPass2 := False;
  2090. {$EndIf TP}
  2091. End;
  2092. Function DFAPass2(
  2093. {$ifdef statedebug}
  2094. AsmL: PAasmOutPut;
  2095. {$endif statedebug}
  2096. BlockStart, BlockEnd: Pai): Boolean;
  2097. Begin
  2098. If InitDFAPass2(BlockStart, BlockEnd) Then
  2099. Begin
  2100. DoDFAPass2(
  2101. {$ifdef statedebug}
  2102. asml,
  2103. {$endif statedebug}
  2104. BlockStart, BlockEnd);
  2105. DFAPass2 := True
  2106. End
  2107. Else DFAPass2 := False;
  2108. End;
  2109. Procedure ShutDownDFA;
  2110. Begin
  2111. If LabDif <> 0 Then
  2112. FreeMem(LTable, LabDif*SizeOf(TLabelTableItem));
  2113. End;
  2114. End.
  2115. {
  2116. $Log$
  2117. Revision 1.53 1999-08-04 00:22:59 florian
  2118. * renamed i386asm and i386base to cpuasm and cpubase
  2119. Revision 1.52 1999/08/02 14:35:21 jonas
  2120. * bugfix in DestroyRefs
  2121. Revision 1.51 1999/08/02 12:12:53 jonas
  2122. * also add arithmetic operations to instruction sequences contained in registers
  2123. (compile with -darithopt, very nice!)
  2124. Revision 1.50 1999/07/30 18:18:51 jonas
  2125. * small bugfix in instructionsequal
  2126. * small bugfix in reginsequence
  2127. * made regininstruction a bit more logical
  2128. Revision 1.48 1999/07/01 18:21:21 jonas
  2129. * removed unused AsmL parameter from FindLoHiLabels
  2130. Revision 1.47 1999/05/27 19:44:24 peter
  2131. * removed oldasm
  2132. * plabel -> pasmlabel
  2133. * -a switches to source writing automaticly
  2134. * assembler readers OOPed
  2135. * asmsymbol automaticly external
  2136. * jumptables and other label fixes for asm readers
  2137. Revision 1.46 1999/05/08 20:40:02 jonas
  2138. * seperate OPTimizer INFO pointer field in tai object
  2139. * fix to GetLastInstruction that sometimes caused a crash
  2140. Revision 1.45 1999/05/01 13:48:37 peter
  2141. * merged nasm compiler
  2142. Revision 1.6 1999/04/18 17:57:21 jonas
  2143. * fix for crash when the first instruction of a sequence that gets
  2144. optimized is removed (this situation can't occur aymore now)
  2145. Revision 1.5 1999/04/16 11:49:50 peter
  2146. + tempalloc
  2147. + -at to show temp alloc info in .s file
  2148. Revision 1.4 1999/04/14 09:07:42 peter
  2149. * asm reader improvements
  2150. Revision 1.3 1999/03/31 13:55:29 peter
  2151. * assembler inlining working for ag386bin
  2152. Revision 1.2 1999/03/29 16:05:46 peter
  2153. * optimizer working for ag386bin
  2154. Revision 1.1 1999/03/26 00:01:10 peter
  2155. * first things for optimizer (compiles but cycle crashes)
  2156. Revision 1.39 1999/02/26 00:48:18 peter
  2157. * assembler writers fixed for ag386bin
  2158. Revision 1.38 1999/02/25 21:02:34 peter
  2159. * ag386bin updates
  2160. + coff writer
  2161. Revision 1.37 1999/02/22 02:15:20 peter
  2162. * updates for ag386bin
  2163. Revision 1.36 1999/01/20 17:41:26 jonas
  2164. * small bugfix (memory corruption could occur when certain fpu instructions
  2165. were encountered)
  2166. Revision 1.35 1999/01/08 12:39:22 florian
  2167. Changes of Alexander Stohr integrated:
  2168. + added KNI opcodes
  2169. + added KNI registers
  2170. + added 3DNow! opcodes
  2171. + added 64 bit and 128 bit register flags
  2172. * translated a few comments into english
  2173. Revision 1.34 1998/12/29 18:48:19 jonas
  2174. + optimize pascal code surrounding assembler blocks
  2175. Revision 1.33 1998/12/17 16:37:38 jonas
  2176. + extra checks in RegsEquivalent so some more optimizations can be done (which
  2177. where disabled by the second fix from revision 1.22)
  2178. Revision 1.32 1998/12/15 19:33:58 jonas
  2179. * uncommented OpsEqual & added to interface because popt386 uses it now
  2180. Revision 1.31 1998/12/11 00:03:13 peter
  2181. + globtype,tokens,version unit splitted from globals
  2182. Revision 1.30 1998/12/02 16:23:39 jonas
  2183. * changed "if longintvar in set" to case or "if () or () .." statements
  2184. * tree.pas: changed inlinenumber (and associated constructor/vars) to a byte
  2185. Revision 1.29 1998/11/26 21:45:31 jonas
  2186. - removed A_CLTD opcode (use A_CDQ instead)
  2187. * changed cbw, cwde and cwd to cbtw, cwtl and cwtd in att_.oper[1]str array
  2188. * in daopt386: adapted AsmInstr array to reflect changes + fixed line too long
  2189. Revision 1.27 1998/11/24 19:47:22 jonas
  2190. * fixed problems posible with 3 operand instructions
  2191. Revision 1.26 1998/11/24 12:50:09 peter
  2192. * fixed crash
  2193. Revision 1.25 1998/11/18 17:58:22 jonas
  2194. + gathering of register reading data, nowhere used yet (necessary for instruction scheduling)
  2195. Revision 1.24 1998/11/13 10:13:44 peter
  2196. + cpuid,emms support for asm readers
  2197. Revision 1.23 1998/11/09 19:40:46 jonas
  2198. * fixed comments from last commit (apparently there's still a 255 char limit :( )
  2199. Revision 1.22 1998/11/09 19:33:40 jonas
  2200. * changed specific bugfix (which was actually wrong implemented, but
  2201. did the right thing in most cases nevertheless) to general bugfix
  2202. * fixed bug that caused
  2203. mov (ebp), edx mov (ebp), edx
  2204. mov (edx), edx mov (edx), edx
  2205. ... being changed to ...
  2206. mov (ebp), edx mov edx, eax
  2207. mov (eax), eax
  2208. but this disabled another small correct optimization...
  2209. Revision 1.21 1998/11/02 23:17:49 jonas
  2210. * fixed bug shown in sortbug program from fpc-devel list
  2211. Revision 1.20 1998/10/22 13:24:51 jonas
  2212. * changed TRegSet to a small set
  2213. Revision 1.19 1998/10/20 09:29:24 peter
  2214. * bugfix so that code like
  2215. movl 48(%esi),%esi movl 48(%esi),%esi
  2216. pushl %esi doesn't get changed to pushl %esi
  2217. movl 48(%esi),%edi movl %esi,%edi
  2218. Revision 1.18 1998/10/07 16:27:02 jonas
  2219. * changed state to WState (WriteState), added RState for future use in
  2220. instruction scheduling
  2221. * RegAlloc data from the CG is now completely being patched and corrected (I
  2222. think)
  2223. Revision 1.17 1998/10/02 17:30:20 jonas
  2224. * small patches to regdealloc data
  2225. Revision 1.16 1998/10/01 20:21:47 jonas
  2226. * inter-register CSE, still requires some tweaks (peepholeoptpass2, better RegAlloc)
  2227. Revision 1.15 1998/09/20 18:00:20 florian
  2228. * small compiling problems fixed
  2229. Revision 1.14 1998/09/20 17:12:36 jonas
  2230. * small fix for uncertain optimizations & more cleaning up
  2231. Revision 1.12 1998/09/16 18:00:01 jonas
  2232. * optimizer now completely dependant on GetNext/GetLast instruction, works again with -dRegAlloc
  2233. Revision 1.11 1998/09/15 14:05:27 jonas
  2234. * fixed optimizer incompatibilities with freelabel code in psub
  2235. Revision 1.10 1998/09/09 15:33:58 peter
  2236. * removed warnings
  2237. Revision 1.9 1998/09/03 16:24:51 florian
  2238. * bug of type conversation from dword to real fixed
  2239. * bug fix of Jonas applied
  2240. Revision 1.8 1998/08/28 10:56:59 peter
  2241. * removed warnings
  2242. Revision 1.7 1998/08/19 16:07:44 jonas
  2243. * changed optimizer switches + cleanup of DestroyRefs in daopt386.pas
  2244. Revision 1.6 1998/08/10 14:49:57 peter
  2245. + localswitches, moduleswitches, globalswitches splitting
  2246. Revision 1.5 1998/08/09 13:56:24 jonas
  2247. * small bugfix for uncertain optimizations in DestroyRefs
  2248. Revision 1.4 1998/08/06 19:40:25 jonas
  2249. * removed $ before and after Log in comment
  2250. Revision 1.3 1998/08/05 16:00:14 florian
  2251. * some fixes for ansi strings
  2252. * log to Log changed
  2253. }