daopt386.pas 96 KB

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