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