csopt386.pas 88 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227
  1. {
  2. Copyright (c) 1998-2002 by Jonas Maebe, member of the Free Pascal
  3. development team
  4. This unit contains the common subexpression elimination procedure.
  5. This program is free software; you can redistribute it and/or modify
  6. it under the terms of the GNU General Public License as published by
  7. the Free Software Foundation; either version 2 of the License, or
  8. (at your option) any later version.
  9. This program is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS for A PARTICULAR PURPOSE. See the
  12. GNU General Public License for more details.
  13. You should have received a copy of the GNU General Public License
  14. along with this program; if not, write to the Free Software
  15. Foundation, inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  16. ****************************************************************************
  17. }
  18. unit CSOpt386;
  19. {$i fpcdefs.inc}
  20. interface
  21. uses aasmbase,aasmtai,aasmcpu, cpuinfo, cpubase, optbase, cgbase;
  22. function CSE(asml: TAAsmoutput; first, last: tai; pass: longint): boolean;
  23. function doReplaceReg(hp: taicpu; newReg, orgReg: tsuperregister): boolean;
  24. function changeOp(var o: toper; newReg, orgReg: tsuperregister): boolean;
  25. function storeBack(start, current: tai; orgReg, newReg: tsuperregister): boolean;
  26. function NoHardCodedRegs(p: taicpu; orgReg, newReg: tsuperregister): boolean;
  27. function RegSizesOK(oldReg,newReg: tsuperregister; p: taicpu): boolean;
  28. implementation
  29. uses
  30. {$ifdef csdebug}
  31. cutils,
  32. {$else}
  33. {$ifdef replaceregdebug}cutils,{$endif}
  34. {$endif}
  35. globtype, verbose, procinfo, globals, daopt386, rgobj, rropt386,cgutils;
  36. {
  37. function TaiInSequence(P: tai; Const Seq: TContent): Boolean;
  38. var P1: tai;
  39. Counter: Byte;
  40. TmpResult: Boolean;
  41. begin
  42. TmpResult := False;
  43. P1 := Seq.StartMod;
  44. Counter := 1;
  45. while not(TmpResult) and
  46. (Counter <= Seq.NrofMods) do
  47. begin
  48. if (P = P1) then TmpResult := True;
  49. inc(Counter);
  50. p1 := tai(p1.Next);
  51. end;
  52. TaiInSequence := TmpResult;
  53. end;
  54. }
  55. function modifiesConflictingMemLocation(p1: tai; supreg: tsuperregister; c: tregContent;
  56. var regsStillValid: tregset; onlymem: boolean; var invalsmemwrite: boolean): boolean;
  57. var
  58. p, hp: taicpu;
  59. tmpRef: treference;
  60. r,regCounter: tsuperregister;
  61. opCount: longint;
  62. dummy: boolean;
  63. begin
  64. modifiesConflictingMemLocation := false;
  65. invalsmemwrite := false;
  66. if p1.typ <> ait_instruction then
  67. exit;
  68. p := taicpu(p1);
  69. case p.opcode of
  70. A_MOV,A_MOVSX,A_MOVZX:
  71. if p.oper[1]^.typ = top_ref then
  72. for regCounter := RS_EAX to RS_EDI do
  73. begin
  74. if p.oper[0]^.typ<>top_reg then
  75. break;
  76. if writeToMemDestroysContents(getsupreg(p.oper[0]^.reg),p.oper[1]^.ref^,
  77. regCounter,topsize2tcgsize[p.opsize],c[regCounter],dummy) then
  78. begin
  79. exclude(regsStillValid,regCounter);
  80. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  81. end;
  82. if (regcounter = supreg) then
  83. invalsmemwrite := invalsmemwrite or dummy;
  84. end
  85. else
  86. { if is_reg_var[getsupreg(p.oper[1]^.reg)] then }
  87. if not onlymem then
  88. for regCounter := RS_EAX to RS_EDI do
  89. begin
  90. if writeDestroysContents(p.oper[1]^,regCounter,topsize2tcgsize[p.opsize],c[regCounter],dummy) then
  91. begin
  92. exclude(regsStillValid,regCounter);
  93. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  94. end
  95. end;
  96. A_DIV, A_IDIV, A_MUL, A_IMUL:
  97. begin
  98. if not onlymem then
  99. if (p.ops = 1) then
  100. begin
  101. for regCounter := RS_EAX to RS_EDI do
  102. begin
  103. if writeToRegDestroysContents(RS_EDX,regCounter,c[regCounter]) then
  104. begin
  105. exclude(regsStillValid,RS_EDX);
  106. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  107. end;
  108. if writeToRegDestroysContents(RS_EAX,regCounter,c[regCounter]) then
  109. begin
  110. exclude(regsStillValid,RS_EAX);
  111. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  112. end;
  113. end
  114. end
  115. else
  116. { only possible for imul }
  117. { last operand is always destination }
  118. for regCounter := RS_EAX to RS_EDI do
  119. begin
  120. if writeDestroysContents(p.oper[p.ops-1]^,regCounter,topsize2tcgsize[p.opsize],c[regCounter],dummy) then
  121. begin
  122. exclude(regsStillValid,regCounter);
  123. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  124. end
  125. end
  126. end;
  127. else
  128. for opCount := 1 to maxinschanges do
  129. case InsProp[p.opcode].Ch[opCount] of
  130. Ch_MOp1,CH_WOp1,CH_RWOp1:
  131. if not(onlymem) or
  132. (p.oper[0]^.typ = top_ref) then
  133. { or ((p.oper[0]^.typ = top_reg) and }
  134. { is_reg_var[getsupreg(p.oper[0]^.reg)]) then }
  135. for regCounter := RS_EAX to RS_EDI do
  136. begin
  137. if writeDestroysContents(p.oper[0]^,regCounter,topsize2tcgsize[p.opsize],c[regCounter],dummy) then
  138. begin
  139. exclude(regsStillValid,regCounter);
  140. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  141. end;
  142. if (regcounter = supreg) then
  143. invalsmemwrite := invalsmemwrite or dummy;
  144. end;
  145. Ch_MOp2,CH_WOp2,CH_RWOp2:
  146. if not(onlymem) or
  147. (p.oper[1]^.typ = top_ref) then
  148. { or ((p.oper[1]^.typ = top_reg) and }
  149. { is_reg_var[getsupreg(p.oper[1]^.reg)]) then }
  150. for regCounter := RS_EAX to RS_EDI do
  151. begin
  152. if writeDestroysContents(p.oper[1]^,regCounter,topsize2tcgsize[p.opsize],c[regCounter],dummy) then
  153. begin
  154. exclude(regsStillValid,regCounter);
  155. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  156. end;
  157. if (regcounter = supreg) then
  158. invalsmemwrite := invalsmemwrite or dummy;
  159. end;
  160. Ch_MOp3,CH_WOp3,CH_RWOp3:
  161. if not(onlymem) or
  162. (p.oper[2]^.typ = top_ref) then
  163. { or ((p.oper[2]^.typ = top_reg) and }
  164. { is_reg_var[getsupreg(p.oper[2]^.reg)]) then }
  165. for regCounter := RS_EAX to RS_EDI do
  166. begin
  167. if writeDestroysContents(p.oper[2]^,regCounter,topsize2tcgsize[p.opsize],c[regCounter],dummy) then
  168. begin
  169. exclude(regsStillValid,regCounter);
  170. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  171. end;
  172. if (regcounter = supreg) then
  173. invalsmemwrite := invalsmemwrite or dummy;
  174. end;
  175. Ch_WMemEDI:
  176. begin
  177. fillchar(tmpref,sizeof(tmpref),0);
  178. tmpRef.base := NR_EDI;
  179. tmpRef.index := NR_EDI;
  180. for regCounter := RS_EAX to RS_EDI do
  181. if writeToMemDestroysContents(RS_INVALID,tmpRef,regCounter,OS_32,c[regCounter],dummy) then
  182. begin
  183. exclude(regsStillValid,regCounter);
  184. modifiesConflictingMemLocation := not(supreg in regsStillValid);
  185. end;
  186. if (regcounter = supreg) then
  187. invalsmemwrite := invalsmemwrite or dummy;
  188. end;
  189. end;
  190. end;
  191. end;
  192. function isSimpleMemLoc(const ref: treference): boolean;
  193. begin
  194. { isSimpleMemLoc :=
  195. (ref.index = RS_NO) and
  196. not(ref.base in (rg.usableregsint+[RS_EDI]));}
  197. isSimpleMemLoc :=
  198. (ref.index = NR_NO) and
  199. ((ref.base = NR_NO) or
  200. not(getsupreg(ref.base) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]));
  201. end;
  202. {checks whether the current instruction sequence (starting with p) and the
  203. one between StartMod and EndMod of Reg are the same. if so, the number of
  204. instructions that match is stored in Found and true is returned, otherwise
  205. Found holds the number of instructions between StartMod and EndMod and false
  206. is returned}
  207. function CheckSequence(p: tai; var prev: tai; supreg: tsuperregister; var Found: Longint;
  208. var reginfo: toptreginfo; findPrevSeqs: boolean): Boolean;
  209. var
  210. regsNotRead, regsStillValid : tregset;
  211. checkingPrevSequences,
  212. passedFlagsModifyingInstr,
  213. invalsmemwrite : boolean;
  214. function getPrevSequence(p: tai; supreg: tsuperregister; currentPrev: tai; var newPrev: tai): tsuperregister;
  215. const
  216. current_reg: tsuperregister = RS_INVALID;
  217. function stillValid(p: tai): boolean;
  218. var
  219. hp: tai;
  220. begin
  221. { only regvars are still used at jump instructions }
  222. if (cs_regvars in aktglobalswitches) and
  223. (p.typ = ait_instruction) and
  224. taicpu(p).is_jmp then
  225. regsstillvalid := regsstillvalid - ptaiprop(p.optinfo)^.usedregs;
  226. stillValid :=
  227. (p.typ = ait_instruction) and
  228. (taicpu(p).opcode <> a_jmp) and
  229. (ptaiprop(p.optinfo)^.regs[supreg].wstate =
  230. ptaiprop(currentPrev.optinfo)^.regs[supreg].wstate) and
  231. { in case destroyreg is called with doIncState = false }
  232. (ptaiprop(p.optinfo)^.regs[supreg].typ =
  233. ptaiprop(currentPrev.optinfo)^.regs[supreg].typ) and
  234. (supreg in (regsNotRead * regsStillValid));
  235. { stop if the register was still used right before a (conditional) }
  236. { jump, since in that case its current contents could still be }
  237. { used in the other path of the jump) }
  238. if (p.typ = ait_instruction) and
  239. (taicpu(p).is_jmp) and
  240. getlastinstruction(p,hp) then
  241. stillValid := stillValid and
  242. not(supreg in ptaiprop(hp.optinfo)^.usedregs);
  243. passedFlagsModifyingInstr := passedFlagsModifyingInstr or
  244. instrWritesFlags(currentPrev);
  245. end;
  246. function findChangedRegister(p: tai): tsuperregister;
  247. var
  248. regCounter, loopstart: tsuperregister;
  249. begin
  250. if (current_reg <> RS_INVALID) then
  251. loopstart := succ(current_reg)
  252. else
  253. loopstart := RS_EAX;
  254. for regCounter := loopstart to RS_EDI do
  255. with ptaiprop(p.optinfo)^.regs[regCounter] do
  256. if ((startmod <>
  257. ptaiprop(currentPrev.optinfo)^.regs[regCounter].startmod) or
  258. (nrofMods <>
  259. ptaiprop(currentPrev.optinfo)^.regs[regCounter].nrofMods)) and
  260. (ptaiprop(p.optinfo)^.regs[regCounter].typ in [con_ref,con_noRemoveRef]) then
  261. begin
  262. findChangedRegister := regCounter;
  263. current_reg := regCounter;
  264. exit;
  265. end;
  266. current_reg := RS_INVALID;
  267. findChangedRegister := RS_INVALID;
  268. end;
  269. var
  270. hp, prevFound: tai;
  271. tmpResult, regCounter: tsuperregister;
  272. invalsmemwrite: boolean;
  273. begin
  274. if (current_reg <> RS_EDI) and
  275. (current_reg <> RS_INVALID) then
  276. begin
  277. tmpResult := findChangedRegister(currentPrev);
  278. if tmpResult <> RS_INVALID then
  279. begin
  280. getPrevSequence := tmpResult;
  281. exit;
  282. end;
  283. end;
  284. getPrevSequence := RS_INVALID;
  285. passedFlagsModifyingInstr := passedFlagsModifyingInstr or
  286. instrWritesFlags(currentPrev);
  287. if (cs_regvars in aktglobalswitches) and
  288. (currentprev.typ = ait_instruction) and
  289. taicpu(currentprev).is_jmp then
  290. regsstillvalid := regsstillvalid - ptaiprop(currentprev.optinfo)^.usedregs;
  291. if not getLastInstruction(currentPrev,hp) then
  292. exit;
  293. prevFound := currentPrev;
  294. tmpResult := RS_INVALID;
  295. while (tmpResult = RS_INVALID) and
  296. stillValid(hp) and
  297. (ptaiprop(prevFound.optinfo)^.canBeRemoved or
  298. not(modifiesConflictingMemLocation(prevFound,supreg,
  299. ptaiprop(p.optinfo)^.regs,regsStillValid,false, invalsmemwrite))) do
  300. begin
  301. { only update the regsread for the instructions we already passed }
  302. if not(ptaiprop(prevFound.optinfo)^.canBeRemoved) then
  303. for regCounter := RS_EAX to RS_EDI do
  304. if regReadByInstruction(regCounter,prevFound) then
  305. exclude(regsNotRead,regCounter);
  306. { in case getPreviousInstruction fails and sets hp to nil in the }
  307. { next iteration }
  308. prevFound := hp;
  309. if not(ptaiprop(hp.optinfo)^.canBeRemoved) then
  310. tmpResult := findChangedRegister(hp);
  311. if not getLastInstruction(hp,hp) then
  312. break;
  313. end;
  314. getPrevSequence := tmpResult;
  315. if tmpResult <> RS_INVALID then
  316. newPrev := prevFound;
  317. end;
  318. function getNextRegToTest(var prev: tai; currentReg: tsuperregister): tsuperregister;
  319. begin
  320. if not checkingPrevSequences then
  321. begin
  322. if (currentreg = RS_INVALID) then
  323. currentreg := RS_EAX
  324. else
  325. inc(currentreg);
  326. while (currentReg <= RS_EDI) and
  327. not(ptaiprop(prev.optinfo)^.regs[currentReg].typ in [con_ref,con_noRemoveRef]) do
  328. inc(currentReg);
  329. if currentReg > RS_EDI then
  330. begin
  331. if (taicpu(p).oper[0]^.typ <> top_ref) or
  332. isSimpleMemLoc(taicpu(p).oper[0]^.ref^) then
  333. begin
  334. checkingPrevSequences := true;
  335. end
  336. else
  337. getNextRegToTest := RS_INVALID;
  338. end
  339. else
  340. getNextRegToTest := currentReg;
  341. end;
  342. if checkingPrevSequences then
  343. if findPrevSeqs then
  344. getNextRegToTest :=
  345. getPrevSequence(p,supreg,prev,prev)
  346. else
  347. getNextRegToTest := RS_INVALID;
  348. end;
  349. function changedreginvalidatedbetween(const oldreginfo: toptreginfo; var newreginfo: toptreginfo; startp,endp,current: tai): boolean;
  350. var
  351. orgdiffregs,diffregs: tregset;
  352. runner: tai;
  353. invalsmemwrite: boolean;
  354. begin
  355. diffregs := newreginfo.newregsencountered - oldreginfo.newregsencountered;
  356. orgdiffregs := diffregs;
  357. if diffregs <> [] then
  358. begin
  359. runner := startp;
  360. repeat
  361. modifiesConflictingMemLocation(runner,RS_EAX { dummy },ptaiprop(current.optinfo)^.regs,diffregs,true,invalsmemwrite);
  362. if orgdiffregs <> diffregs then
  363. begin
  364. changedreginvalidatedbetween := true;
  365. newreginfo := oldreginfo;
  366. exit;
  367. end;
  368. getnextinstruction(runner,runner);
  369. until (runner = endp);
  370. end;
  371. changedreginvalidatedbetween := false;
  372. end;
  373. var
  374. prevreginfo: toptreginfo;
  375. hp2, hp3{, EndMod}, prevhp3, highPrev, orgPrev, pprev: tai;
  376. {Cnt,} OldNrofMods: Longint;
  377. startRegInfo, OrgRegInfo, HighRegInfo: toptreginfo;
  378. regModified, lastregloadremoved: array[RS_EAX..RS_ESP] of boolean;
  379. HighFound, OrgRegFound: longint;
  380. regcounter, regCounter2, tmpreg, base, index: tsuperregister;
  381. OrgRegResult: Boolean;
  382. TmpResult, flagResultsNeeded, stopchecking: Boolean;
  383. begin {CheckSequence}
  384. TmpResult := False;
  385. FillChar(OrgRegInfo, Sizeof(OrgRegInfo), 0);
  386. FillChar(startRegInfo, sizeof(startRegInfo), 0);
  387. OrgRegFound := 0;
  388. HighFound := 0;
  389. OrgRegResult := False;
  390. with startRegInfo do
  391. begin
  392. newRegsEncountered := [RS_EBP, RS_ESP];
  393. fillword(new2oldreg,sizeof(new2oldreg),RS_INVALID);
  394. new2OldReg[RS_EBP] := RS_EBP;
  395. new2OldReg[RS_ESP] := RS_ESP;
  396. oldRegsEncountered := newRegsEncountered;
  397. end;
  398. checkingPrevSequences := false;
  399. passedFlagsModifyingInstr := false;
  400. flagResultsNeeded := false;
  401. regsNotRead := [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESP,RS_EBP,RS_EDI,RS_ESI];
  402. regsStillValid := regsNotRead;
  403. GetLastInstruction(p, prev);
  404. pprev := prev;
  405. tmpreg:=RS_INVALID;
  406. regCounter := getNextRegToTest(prev,tmpreg);
  407. while (regcounter <> RS_INVALID) do
  408. begin
  409. fillchar(regModified,sizeof(regModified),0);
  410. fillchar(lastregloadremoved,sizeof(lastregloadremoved),0);
  411. reginfo := startRegInfo;
  412. Found := 0;
  413. hp2 := ptaiprop(prev.optinfo)^.Regs[regcounter].StartMod;
  414. if (prev <> ptaiprop(prev.optinfo)^.Regs[regcounter].StartMod) then
  415. OldNrofMods := ptaiprop(prev.optinfo)^.Regs[regcounter].NrofMods
  416. else
  417. OldNrofMods := 1;
  418. hp3 := p;
  419. if checkingprevsequences then
  420. prevreginfo := reginfo;
  421. stopchecking := false;
  422. while (Found <> OldNrofMods) and
  423. { old new }
  424. InstructionsEquivalent(hp2, hp3, reginfo) and
  425. (not(checkingprevsequences) or
  426. not(changedreginvalidatedbetween(prevreginfo,reginfo,prev,p,hp3))) do
  427. begin
  428. if checkingprevsequences then
  429. begin
  430. prevreginfo := reginfo;
  431. end;
  432. if (hp3.typ = ait_instruction) and
  433. ((taicpu(hp3).opcode = A_MOV) or
  434. (taicpu(hp3).opcode = A_MOVZX) or
  435. (taicpu(hp3).opcode = A_LEA) or
  436. (taicpu(hp3).opcode = A_MOVSX)) and
  437. (taicpu(hp3).oper[1]^.typ = top_reg) and
  438. not(regInOp(getsupreg(taicpu(hp3).oper[1]^.reg),taicpu(hp3).oper[0]^)) then
  439. begin
  440. tmpreg := getsupreg(taicpu(hp3).oper[1]^.reg);
  441. lastregloadremoved[tmpreg] := ptaiprop(hp2.optinfo)^.canberemoved;
  442. reginfo.lastReload[tmpreg] := hp3;
  443. case taicpu(hp3).oper[0]^.typ of
  444. top_ref:
  445. begin
  446. base := getsupreg(taicpu(hp3).oper[0]^.ref^.base);
  447. index := getsupreg(taicpu(hp3).oper[0]^.ref^.index);
  448. if (found <> 0) and
  449. ((taicpu(hp3).oper[0]^.ref^.base = NR_NO) or
  450. regModified[base] or
  451. (base = getsupreg(current_procinfo.framepointer))) and
  452. ((taicpu(hp3).oper[0]^.ref^.index = NR_NO) or
  453. regModified[index]) and
  454. not(regInRef(tmpReg,taicpu(hp3).oper[0]^.ref^)) then
  455. begin
  456. with ptaiprop(hp3.optinfo)^.regs[tmpreg] do
  457. if nrofMods > (oldNrofMods - found) then
  458. oldNrofMods := found + nrofMods;
  459. { next is safe because instructions are equivalent }
  460. with ptaiprop(hp2.optinfo)^.regs[getsupreg(taicpu(hp2).oper[1]^.reg)] do
  461. if nrofMods > (oldNrofMods - found) then
  462. oldNrofMods := found + nrofMods;
  463. end;
  464. end;
  465. top_reg:
  466. if regModified[getsupreg(taicpu(hp3).oper[0]^.reg)] then
  467. begin
  468. with ptaiprop(hp3.optinfo)^.regs[tmpreg] do
  469. if nrofMods > (oldNrofMods - found) then
  470. oldNrofMods := found + nrofMods;
  471. with ptaiprop(hp2.optinfo)^.regs[getsupreg(taicpu(hp2).oper[1]^.reg)] do
  472. if nrofMods > (oldNrofMods - found) then
  473. oldNrofMods := found + nrofMods;
  474. end;
  475. end;
  476. end;
  477. for regCounter2 := RS_EAX to RS_EDI do
  478. regModified[regCounter2] := regModified[regCounter2] or
  479. regModifiedByInstruction(regCounter2,hp3);
  480. if flagResultsNeeded then
  481. flagResultsNeeded := not instrReadsFlags(hp3);
  482. if not flagResultsNeeded then
  483. flagResultsNeeded := ptaiprop(hp3.optinfo)^.FlagsUsed;
  484. inc(Found);
  485. prevhp3 := hp3;
  486. if (Found <> OldNrofMods) then
  487. if not GetNextInstruction(hp2, hp2) or
  488. not GetNextInstruction(hp3, hp3) then
  489. break;
  490. end;
  491. if assigned(hp3) then
  492. begin
  493. prevhp3 := hp3;
  494. getnextinstruction(hp3,hp3);
  495. end;
  496. if not assigned(hp3) or
  497. { a marker has no optinfo, which is used below }
  498. (hp3.typ = ait_marker) then
  499. hp3 := prevhp3;
  500. {
  501. a) movl -4(%ebp),%edx
  502. movl -12(%ebp),%ecx
  503. ...
  504. movl -8(%ebp),%eax
  505. movl -12(%ebp),%edx (marked as removable)
  506. movl (%eax,%edx),%eax (replaced by "movl (%eax,%ecx),%eax")
  507. ...
  508. movl -8(%ebp),%eax
  509. movl -12(%ebp),%edx
  510. movl (%eax,%edx),%eax
  511. movl (%edx),%edx
  512. -> the "movl -12(ebp),%edx" can't be removed in the last sequence, because
  513. edx has not been replaced with ecx there, and edx is still used after the
  514. sequence
  515. b) tests/webtbs/tw4266.pp
  516. }
  517. for regCounter2 := RS_EAX to RS_EDI do
  518. if (reginfo.new2OldReg[regCounter2] <> RS_INVALID) and
  519. (regCounter2 in ptaiprop(hp3.optinfo)^.usedRegs) and
  520. { case a) above }
  521. ((not regLoadedWithNewValue(regCounter2,false,hp3) and
  522. lastregloadremoved[regcounter2]) or
  523. { case b) above }
  524. ((ptaiprop(pprev.optinfo)^.regs[regcounter2].wstate <>
  525. ptaiprop(hp2.optinfo)^.regs[regcounter2].wstate))) then
  526. begin
  527. found := 0;
  528. end;
  529. if checkingPrevSequences then
  530. begin
  531. for regCounter2 := RS_EAX to RS_EDI do
  532. if (reginfo.new2OldReg[regCounter2] <> RS_INVALID) and
  533. (reginfo.new2OldReg[regCounter2] <> regCounter2) and
  534. (not(regCounter2 in (regsNotRead * regsStillValid)) or
  535. not(reginfo.new2OldReg[regCounter2] in regsStillValid)) then
  536. begin
  537. found := 0;
  538. break;
  539. end;
  540. if passedFlagsModifyingInstr and flagResultsNeeded then
  541. found := 0;
  542. end;
  543. TmpResult := true;
  544. if (found <> OldNrofMods) then
  545. TmpResult := false
  546. else if assigned(hp3) then
  547. for regcounter2 := RS_EAX to RS_EDI do
  548. if (regcounter2 in reginfo.regsLoadedforRef) and
  549. regModified[regcounter2] and
  550. (regcounter2 in ptaiprop(hp3.optinfo)^.usedRegs) and
  551. not regLoadedWithNewValue(regcounter2,false,hp3) then
  552. begin
  553. TmpResult := False;
  554. if (found > 0) then
  555. {this is correct because we only need to turn off the CanBeRemoved flag
  556. when an instruction has already been processed by CheckSequence
  557. (otherwise CanBeRemoved can't be true and thus can't have to be turned off).
  558. if it has already been processed by CheckSequence and flagged to be
  559. removed, it means that it has been checked against a previous sequence
  560. and that it was equal (otherwise CheckSequence would have returned false
  561. and the instruction wouldn't have been removed). if this "if found > 0"
  562. check is left out, incorrect optimizations are performed.}
  563. Found := ptaiprop(tai(p).optinfo)^.Regs[supreg].NrofMods;
  564. break;
  565. end;
  566. if TmpResult and
  567. (Found > HighFound) then
  568. begin
  569. highPrev := prev;
  570. HighFound := Found;
  571. HighRegInfo := reginfo;
  572. end;
  573. if (regcounter = supreg) then
  574. begin
  575. orgPrev := prev;
  576. OrgRegFound := Found;
  577. OrgRegResult := TmpResult;
  578. OrgRegInfo := reginfo
  579. end;
  580. regCounter := getNextRegToTest(prev,regCounter);
  581. end;
  582. if (HighFound > 0) and
  583. (not(OrgRegResult) Or
  584. (HighFound > OrgRegFound))
  585. then
  586. begin
  587. {$ifndef fpc}
  588. TmpResult := True;
  589. {$else fpc}
  590. CheckSequence := True;
  591. {$endif fpc}
  592. prev := highPrev;
  593. reginfo := HighRegInfo;
  594. Found := HighFound
  595. end
  596. else
  597. begin
  598. {$ifndef fpc}
  599. TmpResult := OrgRegResult;
  600. {$else fpc}
  601. CheckSequence := OrgRegResult;
  602. {$endif fpc}
  603. prev := orgPrev;
  604. Found := OrgRegFound;
  605. reginfo := OrgRegInfo;
  606. end;
  607. {$ifndef fpc}
  608. CheckSequence := TmpResult;
  609. {$endif fpc}
  610. end; {CheckSequence}
  611. procedure SetAlignReg(p: tai);
  612. Const alignSearch = 12;
  613. var regsUsable: TRegSet;
  614. prevInstrCount, nextInstrCount: Longint;
  615. prevState, nextWState,nextRState: Array[RS_EAX..RS_EDI] of byte;
  616. regCounter, lastRemoved: tsuperregister;
  617. prev, next: tai;
  618. {$ifdef alignregdebug}
  619. temp: tai;
  620. {$endif alignregdebug}
  621. begin
  622. regsUsable := [RS_EAX,RS_ECX,RS_EDX,RS_EBX,{R_ESP,RS_EBP,}RS_ESI,RS_EDI];
  623. for regCounter := RS_EAX to RS_EDI do
  624. begin
  625. prevState[regCounter] := ptaiprop(p.optinfo)^.Regs[regCounter].wState;
  626. nextWState[regCounter] := ptaiprop(p.optinfo)^.Regs[regCounter].wState;
  627. nextRState[regCounter] := ptaiprop(p.optinfo)^.Regs[regCounter].rState;
  628. end;
  629. getLastInstruction(p,prev);
  630. getNextInstruction(p,next);
  631. lastRemoved := getsupreg(tai_align(p).reg);
  632. nextInstrCount := 0;
  633. prevInstrCount := 0;
  634. while ((assigned(prev) and
  635. assigned(prev.optinfo) and
  636. (prevInstrCount < alignSearch)) or
  637. (assigned(next) and
  638. assigned(next.optinfo) and
  639. (nextInstrCount < alignSearch))) and
  640. (regsUsable <> []) do
  641. begin
  642. {$ifdef alignregdebug}
  643. if assigned(prev) then
  644. begin
  645. temp := tai_comment.Create(strpnew('got here'));
  646. temp.next := prev.next;
  647. temp.previous := prev;
  648. prev.next := temp;
  649. if assigned(temp.next) then
  650. temp.next.previous := temp;
  651. end;
  652. {$endif alignregdebug}
  653. if assigned(prev) and assigned(prev.optinfo) and
  654. (prevInstrCount < alignSearch) then
  655. begin
  656. if (prev.typ = ait_instruction) and
  657. (insProp[taicpu(prev).opcode].ch[1] <> Ch_ALL) and
  658. (taicpu(prev).opcode <> A_JMP) then
  659. begin
  660. inc(prevInstrCount);
  661. for regCounter := RS_EAX to RS_EDI do
  662. begin
  663. if (regCounter in regsUsable) and
  664. (ptaiprop(prev.optinfo)^.Regs[regCounter].wState <>
  665. prevState[regCounter]) then
  666. begin
  667. lastRemoved := regCounter;
  668. exclude(regsUsable,regCounter);
  669. {$ifdef alignregdebug}
  670. temp := tai_comment.Create(strpnew(
  671. std_regname(newreg(R_INTREGISTER,regCounter,R_SUBWHOLE))+' removed')));
  672. temp.next := prev.next;
  673. temp.previous := prev;
  674. prev.next := temp;
  675. if assigned(temp.next) then
  676. temp.next.previous := temp;
  677. if regsUsable = [] then
  678. begin
  679. temp := tai_comment.Create(strpnew(
  680. 'regsUsable empty here')));
  681. temp.next := prev.next;
  682. temp.previous := prev;
  683. prev.next := temp;
  684. if assigned(temp.next) then
  685. temp.next.previous := temp;
  686. end;
  687. {$endif alignregdebug}
  688. end;
  689. prevState[regCounter] :=
  690. ptaiprop(prev.optinfo)^.Regs[regCounter].wState;
  691. end;
  692. getLastInstruction(prev,prev);
  693. end
  694. else
  695. if GetLastInstruction(prev,prev) and
  696. assigned(prev.optinfo) then
  697. for regCounter := RS_EAX to RS_EDI do
  698. prevState[regCounter] :=
  699. ptaiprop(prev.optinfo)^.Regs[regCounter].wState
  700. end;
  701. if assigned(next) and assigned(next.optinfo) and
  702. (nextInstrCount < alignSearch) then
  703. begin
  704. if (next.typ = ait_instruction) and
  705. (insProp[taicpu(next).opcode].ch[1] <> Ch_ALL) and
  706. (taicpu(next).opcode <> A_JMP) then
  707. begin
  708. inc(nextInstrCount);
  709. for regCounter := RS_EAX to RS_EDI do
  710. begin
  711. if (regCounter in regsUsable) and
  712. ((ptaiprop(next.optinfo)^.Regs[regCounter].wState <>
  713. nextWState[regCounter]) or
  714. (ptaiprop(next.optinfo)^.Regs[regCounter].rState <>
  715. nextRState[regCounter])) then
  716. begin
  717. lastRemoved := regCounter;
  718. exclude(regsUsable,regCounter);
  719. {$ifdef alignregdebug}
  720. temp := tai_comment.Create(strpnew(
  721. std_regname(newreg(R_INTREGISTER,regCounter,R_SUBWHOLE))+' removed')));
  722. temp.next := next.next;
  723. temp.previous := next;
  724. next.next := temp;
  725. if assigned(temp.next) then
  726. temp.next.previous := temp;
  727. if regsUsable = [] then
  728. begin
  729. temp := tai_comment.Create(strpnew(
  730. 'regsUsable empty here')));
  731. temp.next := next.next;
  732. temp.previous := next;
  733. next.next := temp;
  734. if assigned(temp.next) then
  735. temp.next.previous := temp;
  736. end;
  737. {$endif alignregdebug}
  738. end;
  739. nextWState[regCounter] :=
  740. ptaiprop(next.optinfo)^.Regs[regCounter].wState;
  741. nextRState[regCounter] :=
  742. ptaiprop(next.optinfo)^.Regs[regCounter].rState;
  743. end
  744. end
  745. else
  746. for regCounter := RS_EAX to RS_EDI do
  747. begin
  748. nextWState[regCounter] :=
  749. ptaiprop(next.optinfo)^.Regs[regCounter].wState;
  750. nextRState[regCounter] :=
  751. ptaiprop(next.optinfo)^.Regs[regCounter].rState;
  752. end;
  753. getNextInstruction(next,next);
  754. end;
  755. end;
  756. if regsUsable <> [] then
  757. for regCounter := RS_EAX to RS_EDI do
  758. if regCounter in regsUsable then
  759. begin
  760. lastRemoved := regCounter;
  761. break
  762. end;
  763. {$ifdef alignregdebug}
  764. next := tai_comment.Create(strpnew(std_regname(newreg(R_INTREGISTER,lastremoved,R_SUBWHOLE))+
  765. ' chosen as alignment register')));
  766. next.next := p.next;
  767. next.previous := p;
  768. p.next := next;
  769. if assigned(next.next) then
  770. next.next.previous := next;
  771. {$endif alignregdebug}
  772. tai_align(p).reg := newreg(R_INTREGISTER,lastRemoved,R_SUBWHOLE);
  773. end;
  774. procedure clearmemwrites(p: tai; supreg: tsuperregister);
  775. var
  776. beginmemwrite: tai;
  777. begin
  778. beginmemwrite := ptaiprop(p.optinfo)^.regs[supreg].memwrite;
  779. repeat
  780. ptaiprop(p.optinfo)^.regs[supreg].memwrite := nil;
  781. until not getnextinstruction(p,p) or
  782. (ptaiprop(p.optinfo)^.regs[supreg].memwrite <> beginmemwrite);
  783. end;
  784. procedure ClearRegContentsFrom(supreg: tsuperregister; p, endP: tai);
  785. { first clears the contents of reg from p till endP. then the contents are }
  786. { cleared until the first instruction that changes reg }
  787. var
  788. {$ifdef replaceregdebug}
  789. hp: tai;
  790. l: longint;
  791. {$endif replaceregdebug}
  792. regcounter: tsuperregister;
  793. oldStartmod: tai;
  794. begin
  795. {$ifdef replaceregdebug}
  796. l := random(1000);
  797. hp := tai_comment.Create(strpnew(
  798. 'cleared '+std_regname(newreg(R_INTREGISTER,supreg,R_SUBWHOLE))+' from here... '+tostr(l)));
  799. hp.next := p;
  800. hp.previous := p.previous;
  801. p.previous := hp;
  802. if assigned(hp.previous) then
  803. hp.previous.next := hp;
  804. {$endif replaceregdebug}
  805. ptaiprop(p.optinfo)^.Regs[supreg].typ := con_unknown;
  806. while (p <> endP) do
  807. begin
  808. for regcounter := RS_EAX to RS_EDI do
  809. if (regcounter <> supreg) and
  810. assigned(ptaiprop(p.optinfo)^.regs[supreg].memwrite) and
  811. reginref(regcounter,ptaiprop(p.optinfo)^.regs[supreg].memwrite.oper[1]^.ref^) then
  812. clearmemwrites(p,regcounter);
  813. with ptaiprop(p.optinfo)^.Regs[supreg] do
  814. begin
  815. typ := con_unknown;
  816. memwrite := nil;
  817. end;
  818. getNextInstruction(p,p);
  819. end;
  820. oldStartmod := ptaiprop(p.optinfo)^.Regs[supreg].startmod;
  821. repeat
  822. with ptaiprop(p.optinfo)^.Regs[supreg] do
  823. begin
  824. typ := con_unknown;
  825. memwrite := nil;
  826. end;
  827. until not getNextInstruction(p,p) or
  828. (ptaiprop(p.optinfo)^.Regs[supreg].startmod <> oldStartmod);
  829. {$ifdef replaceregdebug}
  830. if assigned(p) then
  831. begin
  832. hp := tai_comment.Create(strpnew(
  833. 'cleared '+std_regname(newreg(R_INTREGISTER,supreg,R_SUBWHOLE))+' till here... '+tostr(l)));
  834. hp.next := p;
  835. hp.previous := p.previous;
  836. p.previous := hp;
  837. if assigned(hp.previous) then
  838. hp.previous.next := hp;
  839. end;
  840. {$endif replaceregdebug}
  841. end;
  842. procedure RestoreRegContentsTo(supreg: tsuperregister; const c: TContent; p, endP: tai);
  843. var
  844. {$ifdef replaceregdebug}
  845. l: longint;
  846. {$endif replaceregdebug}
  847. hp: tai;
  848. dummyregs: tregset;
  849. tmpState, newrstate: byte;
  850. prevcontenttyp: byte;
  851. memconflict: boolean;
  852. invalsmemwrite: boolean;
  853. begin
  854. {$ifdef replaceregdebug}
  855. l := random(1000);
  856. hp := tai_comment.Create(strpnew(
  857. 'restored '+std_regname(newreg(R_INTREGISTER,supreg,R_SUBWHOLE))+' with data from here... '+tostr(l)));
  858. hp.next := p;
  859. hp.previous := p.previous;
  860. p.previous := hp;
  861. if assigned(hp.previous) then
  862. hp.previous.next := hp;
  863. {$endif replaceregdebug}
  864. { ptaiprop(p.optinfo)^.Regs[reg] := c;}
  865. newrstate := c.rstate;
  866. incstate(newrstate,$7f);
  867. while (p <> endP) do
  868. begin
  869. if not(ptaiprop(p.optinfo)^.canberemoved) and
  870. regreadbyinstruction(supreg,p) then
  871. incstate(newrstate,1);
  872. ptaiprop(p.optinfo)^.Regs[supreg] := c;
  873. ptaiprop(p.optinfo)^.Regs[supreg].rstate := newrstate;
  874. getNextInstruction(p,p);
  875. end;
  876. tmpState := ptaiprop(p.optinfo)^.Regs[supreg].wState;
  877. if (newrstate = ptaiprop(p.optinfo)^.Regs[supreg].rState) then
  878. begin
  879. incstate(ptaiprop(p.optinfo)^.regs[supreg].rstate,63);
  880. if not getnextinstruction(p,hp) then
  881. exit;
  882. if (ptaiprop(hp.optinfo)^.regs[supreg].rstate = ptaiprop(p.optinfo)^.regs[supreg].rstate) then
  883. internalerror(2004122710);
  884. end;
  885. dummyregs := [supreg];
  886. repeat
  887. newrstate := ptaiprop(p.optinfo)^.Regs[supreg].rState;
  888. prevcontenttyp := ptaiprop(p.optinfo)^.Regs[supreg].typ;
  889. // is this a write to memory that destroys the contents we are restoring?
  890. memconflict := modifiesConflictingMemLocation(p,supreg,ptaiprop(p.optinfo)^.regs,dummyregs,true,invalsmemwrite);
  891. if not memconflict and not invalsmemwrite then
  892. begin
  893. ptaiprop(p.optinfo)^.Regs[supreg] := c;
  894. ptaiprop(p.optinfo)^.Regs[supreg].rstate := newrstate;
  895. end;
  896. until invalsmemwrite or
  897. memconflict or
  898. not getNextInstruction(p,p) or
  899. (ptaiprop(p.optinfo)^.Regs[supreg].wState <> tmpState) or
  900. (p.typ = ait_label) or
  901. ((prevcontenttyp <> con_invalid) and
  902. (ptaiprop(p.optinfo)^.Regs[supreg].typ = con_invalid));
  903. if assigned(p) and
  904. (p.typ <> ait_marker) then
  905. if ((p.typ = ait_label) or
  906. memconflict or
  907. invalsmemwrite) then
  908. clearRegContentsFrom(supreg,p,p)
  909. else if (ptaiprop(p.optinfo)^.Regs[supreg].rstate = newrstate) then
  910. incstate(ptaiprop(p.optinfo)^.Regs[supreg].rstate,20);
  911. {$ifdef replaceregdebug}
  912. if assigned(p) then
  913. begin
  914. hp := tai_comment.Create(strpnew(
  915. 'restored '+std_regname(newreg(R_INTREGISTER,supreg,R_SUBWHOLE))+' till here... '+tostr(l)));
  916. hp.next := p;
  917. hp.previous := p.previous;
  918. p.previous := hp;
  919. if assigned(hp.previous) then
  920. hp.previous.next := hp;
  921. end;
  922. {$endif replaceregdebug}
  923. end;
  924. function NoHardCodedRegs(p: taicpu; orgReg, newReg: tsuperregister): boolean;
  925. var
  926. chCount: byte;
  927. begin
  928. case p.opcode of
  929. A_IMUL: noHardCodedRegs := p.ops <> 1;
  930. A_SHL,A_SHR,A_SHLD,A_SHRD: noHardCodedRegs :=
  931. (p.oper[0]^.typ <> top_reg) or
  932. ((orgReg <> RS_ECX) and (newReg <> RS_ECX));
  933. else
  934. begin
  935. NoHardCodedRegs := true;
  936. with InsProp[p.opcode] do
  937. for chCount := 1 to maxinschanges do
  938. if Ch[chCount] in ([Ch_REAX..Ch_MEDI,Ch_WMemEDI,Ch_All]-[Ch_RESP,Ch_WESP,Ch_RWESP]) then
  939. begin
  940. NoHardCodedRegs := false;
  941. break
  942. end;
  943. end;
  944. end;
  945. end;
  946. function ChangeReg(var Reg: TRegister; newReg, orgReg: tsuperregister): boolean;
  947. begin
  948. changereg := false;
  949. if (reg <> NR_NO) and
  950. (getregtype(reg) = R_INTREGISTER) and
  951. (getsupreg(reg) = newreg) then
  952. begin
  953. changereg := true;
  954. setsupreg(reg,orgreg);
  955. end;
  956. end;
  957. function changeOp(var o: toper; newReg, orgReg: tsuperregister): boolean;
  958. var
  959. tmpresult: boolean;
  960. begin
  961. changeOp := false;
  962. case o.typ of
  963. top_reg: changeOp := changeReg(o.reg,newReg,orgReg);
  964. top_ref:
  965. begin
  966. tmpresult := changeReg(o.ref^.base,newReg,orgReg);
  967. changeop := changeReg(o.ref^.index,newReg,orgReg) or tmpresult;
  968. end;
  969. end;
  970. end;
  971. procedure updateStates(orgReg,newReg: tsuperregister; hp: tai; writeStateToo: boolean);
  972. var
  973. prev: tai;
  974. newOrgRegRState, newOrgRegWState: byte;
  975. begin
  976. if getLastInstruction(hp,prev) then
  977. with ptaiprop(prev.optinfo)^ do
  978. begin
  979. newOrgRegRState := byte(longint(regs[orgReg].rState) +
  980. longint(ptaiprop(hp.optinfo)^.regs[newReg].rState) - regs[newReg].rstate);
  981. if writeStateToo then
  982. newOrgRegWState := byte(longint(regs[orgReg].wState) +
  983. longint(ptaiprop(hp.optinfo)^.regs[newReg].wState) - regs[newReg].wstate);
  984. end
  985. else
  986. with ptaiprop(hp.optinfo)^.regs[newReg] do
  987. begin
  988. newOrgRegRState := rState;
  989. if writeStateToo then
  990. newOrgRegWState := wState;
  991. end;
  992. with ptaiprop(hp.optinfo)^.regs[orgReg] do
  993. begin
  994. rState := newOrgRegRState;
  995. if writeStateToo then
  996. wState := newOrgRegwState;
  997. end;
  998. end;
  999. function doReplaceReg(hp: taicpu; newReg, orgReg: tsuperregister): boolean;
  1000. var
  1001. opCount: longint;
  1002. tmpResult: boolean;
  1003. begin
  1004. tmpresult := false;
  1005. for opCount := 0 to hp.ops-1 do
  1006. tmpResult :=
  1007. changeOp(hp.oper[opCount]^,newReg,orgReg) or tmpResult;
  1008. doReplaceReg := tmpResult;
  1009. end;
  1010. function RegSizesOK(oldReg,newReg: tsuperregister; p: taicpu): boolean;
  1011. { oldreg and newreg must be 32bit components }
  1012. var
  1013. opCount: longint;
  1014. tmpreg: tsuperregister;
  1015. begin
  1016. RegSizesOK := true;
  1017. { if only one of them is a general purpose register ... }
  1018. if (IsGP32reg(oldReg) xor IsGP32Reg(newReg)) then
  1019. begin
  1020. for opCount := 0 to p.ops-1 do
  1021. if (p.oper[opCount]^.typ = top_reg) and
  1022. (getsubreg(p.oper[opCount]^.reg) in [R_SUBL,R_SUBH]) then
  1023. begin
  1024. tmpreg := getsupreg(p.oper[opCount]^.reg);
  1025. if (tmpreg = oldreg) or
  1026. (tmpreg = newreg) then
  1027. begin
  1028. RegSizesOK := false;
  1029. break
  1030. end
  1031. end;
  1032. end;
  1033. end;
  1034. function doReplaceReadReg(p: taicpu; newReg,orgReg: tsuperregister): boolean;
  1035. var
  1036. opCount: longint;
  1037. begin
  1038. doReplaceReadReg := false;
  1039. { handle special case }
  1040. case p.opcode of
  1041. A_IMUL:
  1042. begin
  1043. case p.ops of
  1044. 1: internalerror(1301001);
  1045. 2,3:
  1046. begin
  1047. if changeOp(p.oper[0]^,newReg,orgReg) then
  1048. begin
  1049. { updateStates(orgReg,newReg,p,false);}
  1050. doReplaceReadReg := true;
  1051. end;
  1052. if p.ops = 3 then
  1053. if changeOp(p.oper[1]^,newReg,orgReg) then
  1054. begin
  1055. { updateStates(orgReg,newReg,p,false);}
  1056. doReplaceReadReg := true;
  1057. end;
  1058. end;
  1059. end;
  1060. end;
  1061. A_DIV,A_IDIV,A_MUL: internalerror(1301002);
  1062. else
  1063. begin
  1064. for opCount := 0 to p.ops-1 do
  1065. if p.oper[opCount]^.typ = top_ref then
  1066. if changeOp(p.oper[opCount]^,newReg,orgReg) then
  1067. begin
  1068. { updateStates(orgReg,newReg,p,false);}
  1069. doReplaceReadReg := true;
  1070. end;
  1071. for opCount := 1 to maxinschanges do
  1072. case InsProp[p.opcode].Ch[opCount] of
  1073. Ch_ROp1:
  1074. if p.oper[0]^.typ = top_reg then
  1075. if changeReg(p.oper[0]^.reg,newReg,orgReg) then
  1076. begin
  1077. { updateStates(orgReg,newReg,p,false);}
  1078. doReplaceReadReg := true;
  1079. end;
  1080. Ch_ROp2:
  1081. if p.oper[1]^.typ = top_reg then
  1082. if changeReg(p.oper[1]^.reg,newReg,orgReg) then
  1083. begin
  1084. { updateStates(orgReg,newReg,p,false);}
  1085. doReplaceReadReg := true;
  1086. end;
  1087. Ch_ROp3:
  1088. if p.oper[2]^.typ = top_reg then
  1089. if changeReg(p.oper[2]^.reg,newReg,orgReg) then
  1090. begin
  1091. { updateStates(orgReg,newReg,p,false);}
  1092. doReplaceReadReg := true;
  1093. end;
  1094. end;
  1095. end;
  1096. end;
  1097. end;
  1098. procedure updateState(supreg: tsuperregister; p: tai);
  1099. { this procedure updates the read and write states of the instructions }
  1100. { coming after p. It's called when the read/write state of p has been }
  1101. { changed and this change has to be propagated to the following }
  1102. { instructions as well }
  1103. var
  1104. newRState, newWState: byte;
  1105. prevRState, prevWState: byte;
  1106. doRState, doWState: boolean;
  1107. begin
  1108. { get the new read/write states from p }
  1109. with ptaiprop(p.optinfo)^.regs[supreg] do
  1110. begin
  1111. newRState := rState;
  1112. newWState := wState;
  1113. end;
  1114. if not GetNextInstruction(p,p) then
  1115. exit;
  1116. { get the old read/write states from the next instruction, to know }
  1117. { when we can stop updating }
  1118. with ptaiprop(p.optinfo)^.regs[supreg] do
  1119. begin
  1120. prevRState := rState;
  1121. prevWState := wState;
  1122. end;
  1123. { adjust the states if this next instruction reads/writes the register }
  1124. if regReadByInstruction(supreg,p) then
  1125. incState(newRState,1);
  1126. if regModifiedByInstruction(supreg,p) then
  1127. incState(newWState,1);
  1128. { do we still have to update the read and/or write states? }
  1129. doRState := true;
  1130. doWState := true;
  1131. repeat
  1132. { update the states }
  1133. with ptaiprop(p.optinfo)^.regs[supreg] do
  1134. begin
  1135. if doRState then
  1136. rState := newRState;
  1137. if doWState then
  1138. wState := newWState;
  1139. end;
  1140. if not getNextInstruction(p,p) then
  1141. break;
  1142. with ptaiprop(p.optinfo)^.regs[supreg] do
  1143. begin
  1144. { stop updating the read state if it changes }
  1145. doRState :=
  1146. doRState and (rState = prevRState);
  1147. { if, by accident, this changed state is the same as the one }
  1148. { we've been using, change it to a value that's definitely }
  1149. { different from the previous and next state }
  1150. if not doRState and
  1151. (rState = newRState) then
  1152. begin
  1153. incState(newRState,1);
  1154. prevRState := rState;
  1155. doRState := true;
  1156. end;
  1157. { ditto for the write state }
  1158. doWState :=
  1159. doWState and (WState = prevWState);
  1160. if not doWState and
  1161. (wState = newWState) then
  1162. begin
  1163. incState(newWState,1);
  1164. prevWState := wState;
  1165. doWState := true;
  1166. end;
  1167. end;
  1168. { stop when we don't have to update either state anymore }
  1169. until not(doRState or doWState);
  1170. end;
  1171. function storeBack(start, current: tai; orgReg, newReg: tsuperregister): boolean;
  1172. { returns true if p1 contains an instruction that stores the contents }
  1173. { of newReg back to orgReg }
  1174. begin
  1175. storeback := false;
  1176. if (current.typ = ait_instruction) and
  1177. (taicpu(current).opcode = A_MOV) and
  1178. (taicpu(current).oper[0]^.typ = top_reg) and
  1179. (getsupreg(taicpu(current).oper[0]^.reg) = newReg) and
  1180. (taicpu(current).oper[1]^.typ = top_reg) and
  1181. (getsupreg(taicpu(current).oper[1]^.reg) = orgReg) then
  1182. case taicpu(current).opsize of
  1183. S_B:
  1184. storeback := true;
  1185. S_W:
  1186. storeback := taicpu(start).opsize <> S_B;
  1187. S_L:
  1188. storeback := taicpu(start).opsize = S_L;
  1189. else
  1190. internalerror(2003121501);
  1191. end;
  1192. end;
  1193. function canreplacereg(orgsupreg, newsupreg: tsuperregister; p: tai;
  1194. orgRegCanBeModified: boolean; var resnewregmodified, resorgregread, resremovelast: boolean; var returnendp: tai): boolean;
  1195. var
  1196. endP, hp: tai;
  1197. removeLast, sequenceEnd, tmpResult, newRegModified, orgRegRead: boolean;
  1198. begin
  1199. canreplacereg := false;
  1200. tmpResult := true;
  1201. sequenceEnd := false;
  1202. newRegModified := false;
  1203. orgRegRead := false;
  1204. removeLast := false;
  1205. endP := p;
  1206. while tmpResult and not sequenceEnd do
  1207. begin
  1208. tmpResult :=
  1209. getNextInstruction(endP,endP) and
  1210. (endp.typ = ait_instruction) and
  1211. not(taicpu(endp).is_jmp);
  1212. if tmpresult and not assigned(endp.optinfo) then
  1213. begin
  1214. { hp := tai_comment.Create(strpnew('next no optinfo'));
  1215. hp.next := endp;
  1216. hp.previous := endp.previous;
  1217. endp.previous := hp;
  1218. if assigned(hp.previous) then
  1219. hp.previous.next := hp;}
  1220. exit;
  1221. end;
  1222. if tmpResult and
  1223. { don't take into account instructions that will be removed }
  1224. not (ptaiprop(endp.optinfo)^.canBeRemoved) then
  1225. begin
  1226. { if the newsupreg gets stored back to the oldReg, we can change }
  1227. { "mov %oldReg,%newReg; <operations on %newReg>; mov %newReg, }
  1228. { %oldReg" to "<operations on %oldReg>" }
  1229. removeLast := storeBack(p,endP, orgsupreg, newsupreg);
  1230. sequenceEnd :=
  1231. { no support for (i)div, mul and imul with hardcoded operands }
  1232. noHardCodedRegs(taicpu(endP),orgsupreg,newsupreg) and
  1233. { if newsupreg gets loaded with a new value, we can stop }
  1234. { replacing newsupreg with oldReg here (possibly keeping }
  1235. { the original contents of oldReg so we still know them }
  1236. { afterwards) }
  1237. (RegLoadedWithNewValue(newsupreg,true,taicpu(endP)) or
  1238. { we can also stop if we reached the end of the use of }
  1239. { newReg's current contents }
  1240. (GetNextInstruction(endp,hp) and
  1241. FindRegDealloc(newsupreg,hp)));
  1242. { to be able to remove the first and last instruction of }
  1243. { movl %reg1, %reg2 }
  1244. { <operations on %reg2> (replacing reg2 with reg1 here) }
  1245. { movl %reg2, %reg1 }
  1246. { %reg2 must not be use afterwards (it can be as the }
  1247. { result of a peepholeoptimization) }
  1248. removeLast := removeLast and sequenceEnd;
  1249. newRegModified :=
  1250. newRegModified or
  1251. (not(regLoadedWithNewValue(newsupreg,true,taicpu(endP))) and
  1252. RegModifiedByInstruction(newsupreg,endP));
  1253. orgRegRead := newRegModified and RegReadByInstruction(orgsupreg,endP);
  1254. sequenceEnd := SequenceEnd and
  1255. (removeLast or
  1256. { since newsupreg will be replaced by orgsupreg, we can't allow that newsupreg }
  1257. { gets modified if orgsupreg is still read afterwards (since after }
  1258. { replacing, this would mean that orgsupreg first gets modified and then }
  1259. { gets read in the assumption it still contains the unmodified value) }
  1260. not(newRegModified and orgRegRead)) (* and
  1261. { since newsupreg will be replaced by orgsupreg, we can't allow that newsupreg }
  1262. { gets modified if orgRegCanBeModified = false }
  1263. { this now gets checked after the loop (JM) }
  1264. (orgRegCanBeModified or not(newRegModified)) *);
  1265. tmpResult :=
  1266. not(removeLast) and
  1267. not(newRegModified and orgRegRead) and
  1268. (* (orgRegCanBeModified or not(newRegModified)) and *)
  1269. (* already checked at the top
  1270. (endp.typ = ait_instruction) and *)
  1271. NoHardCodedRegs(taicpu(endP),orgsupreg,newsupreg) and
  1272. RegSizesOk(orgsupreg,newsupreg,taicpu(endP)) and
  1273. not RegModifiedByInstruction(orgsupreg,endP);
  1274. end;
  1275. end;
  1276. canreplacereg := sequenceEnd and
  1277. (removeLast or
  1278. (orgRegCanBeModified or not(newRegModified))) and
  1279. (not(assigned(endp)) or
  1280. not(endp.typ = ait_instruction) or
  1281. (noHardCodedRegs(taicpu(endP),orgsupreg,newsupreg) and
  1282. RegSizesOk(orgsupreg,newsupreg,taicpu(endP)) and
  1283. not(newRegModified and
  1284. (orgsupreg in ptaiprop(endp.optinfo)^.usedRegs) and
  1285. not(RegLoadedWithNewValue(orgsupreg,true,taicpu(endP))))));
  1286. if canreplacereg then
  1287. begin
  1288. resnewregmodified := newregmodified;
  1289. resorgregread := orgregread;
  1290. resremovelast := removelast;
  1291. returnendp := endp;
  1292. end;
  1293. end;
  1294. function ReplaceReg(asml: TAAsmOutput; orgsupreg, newsupreg: tsuperregister; p,
  1295. seqstart: tai; const c: TContent; orgRegCanBeModified: Boolean;
  1296. var returnEndP: tai): Boolean;
  1297. { Tries to replace orgsupreg with newsupreg in all instructions coming after p }
  1298. { until orgsupreg gets loaded with a new value. Returns true if successful, }
  1299. { false otherwise. if successful, the contents of newsupreg are set to c, }
  1300. { which should hold the contents of newsupreg before the current sequence }
  1301. { started }
  1302. { if the function returns true, returnEndP holds the last instruction }
  1303. { where newsupreg was replaced by orgsupreg }
  1304. var
  1305. endP, hp: tai;
  1306. removeLast, sequenceEnd, newRegModified, orgRegRead,
  1307. stateChanged, readStateChanged: Boolean;
  1308. begin
  1309. replacereg := false;
  1310. if canreplacereg(orgsupreg,newsupreg,p,orgregcanbemodified,newregmodified, orgregread, removelast,endp) then
  1311. begin
  1312. {$ifdef replaceregdebug}
  1313. hp := tai_comment.Create(strpnew(
  1314. 'replacing '+std_regname(newreg(R_INTREGISTER,newsupreg,R_SUBWHOLE))+' with '+std_regname(newreg(R_INTREGISTER,orgsupreg,R_SUBWHOLE))+
  1315. ' from here...'));
  1316. hp.next := p;
  1317. hp.previous := p.previous;
  1318. p.previous := hp;
  1319. if assigned(hp.previous) then
  1320. hp.previous.next := hp;
  1321. hp := tai_comment.Create(strpnew(
  1322. 'replaced '+std_regname(newreg(R_INTREGISTER,newsupreg,R_SUBWHOLE))+' with '+std_regname(newreg(R_INTREGISTER,orgsupreg,R_SUBWHOLE))+
  1323. ' till here'));
  1324. hp.next := endp.next;
  1325. hp.previous := endp;
  1326. endp.next := hp;
  1327. if assigned(hp.next) then
  1328. hp.next.previous := hp;
  1329. {$endif replaceregdebug}
  1330. replaceReg := true;
  1331. returnEndP := endP;
  1332. if not getNextInstruction(p,hp) then
  1333. exit;
  1334. stateChanged := false;
  1335. while hp <> endP do
  1336. begin
  1337. if {not(ptaiprop(hp.optinfo)^.canBeRemoved) and }
  1338. (hp.typ = ait_instruction) then
  1339. stateChanged :=
  1340. doReplaceReg(taicpu(hp),newsupreg,orgsupreg) or stateChanged;
  1341. if stateChanged then
  1342. updateStates(orgsupreg,newsupreg,hp,true);
  1343. getNextInstruction(hp,hp)
  1344. end;
  1345. if assigned(endp) and (endp.typ = ait_instruction) then
  1346. readStateChanged :=
  1347. doReplaceReadReg(taicpu(endP),newsupreg,orgsupreg);
  1348. if stateChanged or readStateChanged then
  1349. updateStates(orgsupreg,newsupreg,endP,stateChanged);
  1350. if stateChanged or readStateChanged then
  1351. updateState(orgsupreg,endP);
  1352. { We replaced newreg with oldreg between p and endp, so restore the contents }
  1353. { of newreg there with its contents from before the sequence. }
  1354. if removeLast or
  1355. RegLoadedWithNewValue(newsupreg,true,endP) then
  1356. GetLastInstruction(endP,hp)
  1357. else hp := endP;
  1358. RestoreRegContentsTo(newsupreg,c,seqstart,hp);
  1359. { Ot is possible that the new register was modified (e.g. an add/sub), so if }
  1360. { it was replaced by oldreg in that instruction, oldreg's contents have been }
  1361. { changed. To take this into account, we simply set the contents of orgsupreg }
  1362. { to "unknown" after this sequence }
  1363. if newRegModified then
  1364. ClearRegContentsFrom(orgsupreg,p,hp);
  1365. if removeLast then
  1366. ptaiprop(endp.optinfo)^.canBeRemoved := true;
  1367. allocRegBetween(asml,newreg(R_INTREGISTER,orgsupreg,R_SUBWHOLE),p,endP,ptaiprop(p.optinfo)^.usedregs);
  1368. end
  1369. {$ifdef replaceregdebug}
  1370. else
  1371. begin
  1372. hp := tai_comment.Create(strpnew(
  1373. 'replacing '+std_regname(newreg(R_INTREGISTER,newsupreg,R_SUBWHOLE))+' with '+std_regname(newreg(R_INTREGISTER,orgsupreg,R_SUBWHOLE))+
  1374. ' from here...'));
  1375. hp.previous := p.previous;
  1376. hp.next := p;
  1377. p.previous := hp;
  1378. if assigned(hp.previous) then
  1379. hp.previous.next := hp;
  1380. hp := tai_comment.Create(strpnew(
  1381. 'replacing '+std_regname(newreg(R_INTREGISTER,newsupreg,R_SUBWHOLE))+' with '+std_regname(newreg(R_INTREGISTER,orgsupreg,R_SUBWHOLE))+
  1382. ' failed here'));
  1383. hp.next := endp.next;
  1384. hp.previous := endp;
  1385. endp.next := hp;
  1386. if assigned(hp.next) then
  1387. hp.next.previous := hp;
  1388. end;
  1389. {$endif replaceregdebug}
  1390. end;
  1391. function FindRegWithConst(p: tai; size: topsize; l: aint; var Res: TRegister): Boolean;
  1392. {Finds a register which contains the constant l}
  1393. var
  1394. Counter: tsuperregister;
  1395. {$ifdef testing}
  1396. hp: tai;
  1397. {$endif testing}
  1398. begin
  1399. Result:=false;
  1400. Counter := RS_EAX;
  1401. repeat
  1402. {$ifdef testing}
  1403. if (ptaiprop(p.optinfo)^.regs[counter].typ in [con_const,con_noRemoveConst]) then
  1404. begin
  1405. hp := tai_comment.Create(strpnew(
  1406. 'checking const load of '+tostr(l)+' here...'));
  1407. hp.next := ptaiprop(p.optinfo)^.Regs[Counter].StartMod;
  1408. hp.previous := ptaiprop(p.optinfo)^.Regs[Counter].StartMod^.previous;
  1409. ptaiprop(p.optinfo)^.Regs[Counter].StartMod^.previous := hp;
  1410. if assigned(hp.previous) then
  1411. hp.previous.next := hp;
  1412. end;
  1413. {$endif testing}
  1414. if (ptaiprop(p.optinfo)^.regs[counter].typ in [con_const,con_noRemoveConst]) and
  1415. (taicpu(ptaiprop(p.optinfo)^.Regs[Counter].StartMod).opsize = size) and
  1416. (taicpu(ptaiprop(p.optinfo)^.Regs[Counter].StartMod).oper[0]^.typ = top_const) and
  1417. (taicpu(ptaiprop(p.optinfo)^.Regs[Counter].StartMod).oper[0]^.val = l) then
  1418. begin
  1419. res:=taicpu(ptaiprop(p.optinfo)^.Regs[Counter].StartMod).oper[1]^.reg;
  1420. result:=true;
  1421. exit;
  1422. end;
  1423. inc(counter);
  1424. until (Counter > RS_EDI);
  1425. end;
  1426. procedure removePrevNotUsedLoad(p: tai; supreg: tsuperregister; check: boolean);
  1427. { if check = true, it means the procedure has to check whether it isn't }
  1428. { possible that the contents are still used after p (used when removing }
  1429. { instructions because of a "call"), otherwise this is not necessary }
  1430. { (e.g. when you have a "mov 8(%ebp),%eax", you can be sure the previous }
  1431. { value of %eax isn't used anymore later on) }
  1432. var
  1433. hp1, next, beforestartmod: tai;
  1434. begin
  1435. if getLastInstruction(p,hp1) then
  1436. with ptaiprop(hp1.optinfo)^.regs[supreg] do
  1437. if (typ in [con_ref,con_invalid,con_const]) and
  1438. (nrofMods = 1) and
  1439. (rState = ptaiprop(startmod.optinfo)^.regs[supreg].rState) and
  1440. (not(check) or
  1441. (not(regInInstruction(supreg,p)) and
  1442. (not(supreg in ptaiprop(hp1.optinfo)^.usedRegs) or
  1443. findRegDealloc(supreg,p)))) then
  1444. begin
  1445. ptaiprop(startMod.optinfo)^.canBeRemoved := true;
  1446. getnextinstruction(p,next);
  1447. { give the register that was modified by this instruction again }
  1448. { the contents it had before this instruction }
  1449. if getlastinstruction(startmod,beforestartmod) then
  1450. RestoreRegContentsTo(supreg,ptaiprop(beforestartmod.optinfo)^.regs[supreg],
  1451. startmod,hp1)
  1452. else
  1453. ClearRegContentsFrom(supreg,startmod,hp1);
  1454. end;
  1455. end;
  1456. {$ifdef notused}
  1457. function is_mov_for_div(p: taicpu): boolean;
  1458. begin
  1459. is_mov_for_div :=
  1460. (p.opcode = A_MOV) and
  1461. (p.oper[0]^.typ = top_const) and
  1462. (p.oper[1]^.typ = top_reg) and
  1463. (p.oper[1]^.reg = RS_EDX) and
  1464. getNextInstruction(p,p) and
  1465. (p.typ = ait_instruction) and
  1466. ((p.opcode = A_DIV) or
  1467. (p.opcode = A_IDIV));
  1468. end;
  1469. {$endif notused}
  1470. function memtoreg(t: taicpu; const ref: treference; var startp: tai): tregister;
  1471. var
  1472. hp: tai;
  1473. p: ptaiprop;
  1474. regcounter: tsuperregister;
  1475. optimizable: boolean;
  1476. begin
  1477. if not getlastinstruction(t,hp) or
  1478. not issimplememloc(ref) then
  1479. begin
  1480. memtoreg := NR_NO;
  1481. exit;
  1482. end;
  1483. p := ptaiprop(hp.optinfo);
  1484. optimizable := false;
  1485. for regcounter := RS_EAX to RS_EDI do
  1486. begin
  1487. if (assigned(p^.regs[regcounter].memwrite) and
  1488. refsequal(ref,p^.regs[regcounter].memwrite.oper[1]^.ref^)) then
  1489. begin
  1490. optimizable := true;
  1491. hp := p^.regs[regcounter].memwrite;
  1492. end
  1493. else if ((p^.regs[regcounter].typ in [CON_REF,CON_NOREMOVEREF]) and
  1494. (p^.regs[regcounter].nrofmods = 1) and
  1495. ((taicpu(p^.regs[regcounter].startmod).opcode = A_MOV) or
  1496. (taicpu(p^.regs[regcounter].startmod).opcode = A_MOVZX) or
  1497. (taicpu(p^.regs[regcounter].startmod).opcode = A_MOVSX)) and
  1498. (taicpu(p^.regs[regcounter].startmod).oper[0]^.typ = top_ref) and
  1499. refsequal(ref,taicpu(p^.regs[regcounter].startmod).oper[0]^.ref^)) then
  1500. begin
  1501. optimizable := true;
  1502. hp := p^.regs[regcounter].startmod;
  1503. end;
  1504. if optimizable then
  1505. if ((t.opsize <> S_B) or
  1506. not(regcounter in [RS_ESI,RS_EDI])) and
  1507. sizescompatible(taicpu(hp).opsize,t.opsize) then
  1508. begin
  1509. case t.opsize of
  1510. S_B:
  1511. begin
  1512. memtoreg := newreg(R_INTREGISTER,regcounter,R_SUBL)
  1513. end;
  1514. S_W,S_BW:
  1515. begin
  1516. memtoreg := newreg(R_INTREGISTER,regcounter,R_SUBW);
  1517. if (t.opsize = S_BW) then
  1518. begin
  1519. t.opcode := A_MOV;
  1520. t.opsize := S_W;
  1521. end;
  1522. end;
  1523. S_L,S_BL,S_WL:
  1524. begin
  1525. memtoreg := newreg(R_INTREGISTER,regcounter,R_SUBWHOLE);
  1526. if (t.opsize <> S_L) then
  1527. begin
  1528. t.opcode := A_MOV;
  1529. t.opsize := S_L;
  1530. end;
  1531. end;
  1532. end;
  1533. startp := hp;
  1534. exit;
  1535. end;
  1536. end;
  1537. memtoreg := NR_NO;
  1538. end;
  1539. procedure removeLocalStores(const t1: tai);
  1540. {var
  1541. p: tai;
  1542. regcount: tregister; }
  1543. begin
  1544. {
  1545. for regcount := LoGPReg to HiGPReg do
  1546. if assigned(pTaiProp(t1.optinfo)^.regs[regcount].memwrite) and
  1547. (taicpu(pTaiProp(t1.optinfo)^.regs[regcount].memwrite).oper[1]^.ref^.base
  1548. = current_procinfo.framepointer) then
  1549. begin
  1550. pTaiProp(pTaiProp(t1.optinfo)^.regs[regcount].memwrite.optinfo)^.canberemoved := true;
  1551. clearmemwrites(pTaiProp(t1.optinfo)^.regs[regcount].memwrite,regcount);
  1552. end;
  1553. }
  1554. end;
  1555. procedure loadcseregs(asml: taasmoutput; const reginfo: toptreginfo; curseqend, prevseqstart, curseqstart, curprev: tai; cnt: longint);
  1556. var
  1557. regsloaded: tregset;
  1558. regloads, reguses: array[RS_EAX..RS_EDI] of tai;
  1559. regcounter, substreg: tsuperregister;
  1560. hp, hp2: tai;
  1561. insertpos, prevseq_next: tai;
  1562. i: longint;
  1563. opc: tasmop;
  1564. begin
  1565. regsloaded := [];
  1566. fillchar(regloads,sizeof(regloads),0);
  1567. fillchar(reguses,sizeof(reguses),0);
  1568. getnextinstruction(prevseqstart,prevseq_next);
  1569. for regcounter := RS_EAX To RS_EDI do
  1570. if (reginfo.new2oldreg[regcounter] <> RS_INVALID) Then
  1571. begin
  1572. include(regsloaded,regcounter);
  1573. if assigned(ptaiprop(prevseqstart.optinfo)^.Regs[reginfo.new2oldreg[regcounter]].StartMod) then
  1574. AllocRegBetween(asml,newreg(R_INTREGISTER,reginfo.new2oldreg[regcounter],R_SUBWHOLE),
  1575. ptaiprop(prevseqstart.optinfo)^.Regs[reginfo.new2oldreg[regcounter]].StartMod,curseqstart,
  1576. ptaiprop(ptaiprop(prevseqstart.optinfo)^.Regs[reginfo.new2oldreg[regcounter]].StartMod.optinfo)^.usedregs)
  1577. else
  1578. AllocRegBetween(asml,newreg(R_INTREGISTER,reginfo.new2oldreg[regcounter],R_SUBWHOLE),
  1579. prevseqstart,curseqstart,ptaiprop(prevseqstart.optinfo)^.usedregs);
  1580. if curprev <> prevseqstart then
  1581. begin
  1582. if assigned(reginfo.lastReload[regCounter]) then
  1583. getLastInstruction(reginfo.lastReload[regCounter],hp)
  1584. else if assigned(reginfo.lastReload[reginfo.new2oldreg[regCounter]]) then
  1585. getLastInstruction(reginfo.lastReload[reginfo.new2OldReg[regCounter]],hp)
  1586. else
  1587. hp := curprev;
  1588. clearRegContentsFrom(regCounter,prevSeq_next,hp);
  1589. getnextInstruction(hp,hp);
  1590. allocRegBetween(asml,newreg(R_INTREGISTER,regCounter,R_SUBWHOLE),prevseqstart,hp,
  1591. ptaiprop(prevseqstart.optinfo)^.usedregs);
  1592. end;
  1593. if not(regcounter in reginfo.RegsLoadedforRef) and
  1594. {old reg new reg}
  1595. (reginfo.new2oldreg[regcounter] <> regcounter) then
  1596. begin
  1597. getLastInstruction(curseqend,hp);
  1598. if (curprev <> prevseqstart) or
  1599. {not(regCounter in rg.usableregsint + [RS_EDI,RS_ESI]) or}
  1600. not(regCounter in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_EDI,RS_ESI]) or
  1601. not ReplaceReg(asml,reginfo.new2oldreg[regcounter],
  1602. regCounter,hp,curseqstart,
  1603. ptaiprop(prevseqstart.optinfo)^.Regs[regCounter],true,hp2) then
  1604. begin
  1605. opc := A_MOV;
  1606. insertpos := prevseq_next;
  1607. if assigned(reguses[regcounter]) then
  1608. if assigned(regloads[reginfo.new2oldreg[regcounter]]) then
  1609. opc := A_XCHG
  1610. else
  1611. insertpos := tai(reguses[regcounter].next)
  1612. else
  1613. if assigned(regloads[reginfo.new2oldreg[regcounter]]) then
  1614. insertpos := regloads[reginfo.new2oldreg[regcounter]];
  1615. hp := Tai_Marker.Create(NoPropInfoStart);
  1616. InsertLLItem(asml, insertpos.previous,insertpos, hp);
  1617. hp2 := taicpu.Op_Reg_Reg(opc, S_L,
  1618. {old reg new reg}
  1619. newreg(R_INTREGISTER,reginfo.new2oldreg[regcounter],R_SUBWHOLE), newreg(R_INTREGISTER,regcounter,R_SUBWHOLE));
  1620. regloads[regcounter] := hp2;
  1621. reguses[reginfo.new2oldreg[regcounter]] := hp2;
  1622. new(ptaiprop(hp2.optinfo));
  1623. ptaiprop(hp2.optinfo)^ := ptaiprop(insertpos.optinfo)^;
  1624. ptaiprop(hp2.optinfo)^.canBeRemoved := false;
  1625. InsertLLItem(asml, insertpos.previous, insertpos, hp2);
  1626. hp := Tai_Marker.Create(NoPropInfoEnd);
  1627. InsertLLItem(asml, insertpos.previous, insertpos, hp);
  1628. { adjusts states in previous instruction so that it will }
  1629. { definitely be different from the previous or next state }
  1630. incstate(ptaiprop(hp2.optinfo)^.
  1631. regs[reginfo.new2oldreg[regcounter]].rstate,20);
  1632. incstate(ptaiprop(hp2.optinfo)^.
  1633. regs[regCounter].wstate,20);
  1634. updateState(reginfo.new2oldreg[regcounter],hp2);
  1635. updateState(regcounter,hp2);
  1636. end
  1637. else
  1638. begin
  1639. // replace the new register with the old register in the
  1640. // sequence itself as well so later comparisons get the
  1641. // correct knowledge about which registers are used
  1642. hp2 := curseqstart;
  1643. // curseqend = instruction following last instruction of this
  1644. // sequence
  1645. while hp2 <> curseqend do
  1646. begin
  1647. doreplacereg(taicpu(hp2),regcounter,reginfo.new2oldreg[regcounter]);
  1648. getnextinstruction(hp2,hp2);
  1649. end;
  1650. end;
  1651. end
  1652. else
  1653. { imagine the following code: }
  1654. { normal wrong optimized }
  1655. { movl 8(%ebp), %eax movl 8(%ebp), %eax }
  1656. { movl (%eax), %eax movl (%eax), %eax }
  1657. { cmpl 8(%ebp), %eax cmpl 8(%ebp), %eax }
  1658. { jne l1 jne l1 }
  1659. { movl 8(%ebp), %eax }
  1660. { movl (%eax), %edi movl %eax, %edi }
  1661. { movl %edi, -4(%ebp) movl %edi, -4(%ebp) }
  1662. { movl 8(%ebp), %eax }
  1663. { pushl 70(%eax) pushl 70(%eax) }
  1664. { }
  1665. { The error is that at the moment that the last instruction is executed, }
  1666. { %eax doesn't contain 8(%ebp) anymore. Solution: the contents of }
  1667. { registers that are completely removed from a sequence (= registers in }
  1668. { RegLoadedforRef), have to be changed to their contents from before the }
  1669. { sequence. }
  1670. { if regcounter in reginfo.RegsLoadedforRef then }
  1671. begin
  1672. hp := curseqstart;
  1673. { cnt still holds the number of instructions }
  1674. { of the sequence, so go to the end of it }
  1675. for i := 1 to pred(cnt) do
  1676. getNextInstruction(hp,hp);
  1677. { curprev = instruction prior to start of sequence }
  1678. restoreRegContentsTo(regCounter,
  1679. ptaiprop(curprev.optinfo)^.Regs[regcounter],
  1680. curseqstart,hp);
  1681. end;
  1682. end;
  1683. end;
  1684. procedure replaceoperandwithreg(asml: taasmoutput; p: tai; opnr: byte; reg: tregister);
  1685. var
  1686. hp: tai;
  1687. begin
  1688. { new instruction -> it's info block is not in the big one allocated at the start }
  1689. hp := Tai_Marker.Create(NoPropInfoStart);
  1690. InsertLLItem(asml, p.previous,p, hp);
  1691. { duplicate the original instruction and replace it's designated operant with the register }
  1692. hp := tai(p.getcopy);
  1693. taicpu(hp).loadreg(opnr,reg);
  1694. { add optimizer state info }
  1695. new(ptaiprop(hp.optinfo));
  1696. ptaiprop(hp.optinfo)^ := ptaiprop(p.optinfo)^;
  1697. { new instruction can not be removed }
  1698. ptaiprop(hp.optinfo)^.canBeRemoved := false;
  1699. { but the old one can }
  1700. ptaiprop(p.optinfo)^.canBeRemoved := true;
  1701. { insert end marker }
  1702. InsertLLItem(asml, p.previous, p, hp);
  1703. hp := Tai_Marker.Create(NoPropInfoEnd);
  1704. InsertLLItem(asml, p.previous, p, hp);
  1705. end;
  1706. procedure doCSE(asml: TAAsmOutput; First, Last: tai; findPrevSeqs, doSubOpts: boolean);
  1707. {marks the instructions that can be removed by RemoveInstructs. They're not
  1708. removed immediately because sometimes an instruction needs to be checked in
  1709. two different sequences}
  1710. var cnt, cnt2, {cnt3,} orgNrofMods: longint;
  1711. p, hp1, hp2, prevSeq: tai;
  1712. hp3, hp4: tai;
  1713. hp5 : tai;
  1714. reginfo: toptreginfo;
  1715. memreg: tregister;
  1716. regcounter: tsuperregister;
  1717. begin
  1718. p := First;
  1719. SkipHead(p);
  1720. while (p <> Last) do
  1721. begin
  1722. case p.typ of
  1723. ait_align:
  1724. if not(tai_align(p).use_op) then
  1725. SetAlignReg(p);
  1726. ait_instruction:
  1727. begin
  1728. case taicpu(p).opcode of
  1729. {
  1730. Does not work anymore with register calling because the registers are
  1731. released before the call
  1732. A_CALL:
  1733. for regCounter := RS_EAX to RS_EBX do
  1734. removePrevNotUsedLoad(p,regCounter,true);
  1735. }
  1736. A_CLD: if GetLastInstruction(p, hp1) and
  1737. (ptaiprop(hp1.optinfo)^.DirFlag = F_NotSet) then
  1738. ptaiprop(tai(p).optinfo)^.CanBeRemoved := True;
  1739. A_LEA, A_MOV, A_MOVZX, A_MOVSX:
  1740. begin
  1741. hp2 := p;
  1742. case taicpu(p).oper[0]^.typ of
  1743. top_ref, top_reg:
  1744. if (taicpu(p).oper[1]^.typ = top_reg) then
  1745. begin
  1746. With ptaiprop(p.optinfo)^.Regs[getsupreg(taicpu(p).oper[1]^.reg)] do
  1747. begin
  1748. if (startmod = p) then
  1749. orgNrofMods := nrofMods
  1750. else
  1751. orgNrofMods := 0;
  1752. if (p = StartMod) and
  1753. GetLastInstruction (p, hp1) and
  1754. not(hp1.typ in [ait_marker,ait_label]) then
  1755. {so we don't try to check a sequence when p is the first instruction of the block}
  1756. begin
  1757. {$ifdef csdebug}
  1758. hp5 := tai_comment.Create(strpnew(
  1759. 'cse checking '+std_regname(taicpu(p).oper[1]^.reg)));
  1760. insertLLItem(asml,p,p.next,hp5);
  1761. {$endif csdebug}
  1762. if CheckSequence(p,prevSeq,getsupreg(taicpu(p).oper[1]^.reg), Cnt, reginfo, findPrevSeqs) and
  1763. (Cnt > 0) then
  1764. begin
  1765. (*
  1766. hp1 := nil;
  1767. { although it's perfectly ok to remove an instruction which doesn't contain }
  1768. { the register that we've just checked (CheckSequence takes care of that), }
  1769. { the sequence containing this other register should also be completely }
  1770. { checked and removed, otherwise we may get situations like this: }
  1771. { }
  1772. { movl 12(%ebp), %edx movl 12(%ebp), %edx }
  1773. { movl 16(%ebp), %eax movl 16(%ebp), %eax }
  1774. { movl 8(%edx), %edx movl 8(%edx), %edx }
  1775. { movl (%eax), eax movl (%eax), eax }
  1776. { cmpl %eax, %edx cmpl %eax, %edx }
  1777. { jnz l123 getting converted to jnz l123 }
  1778. { movl 12(%ebp), %edx movl 4(%eax), eax }
  1779. { movl 16(%ebp), %eax }
  1780. { movl 8(%edx), %edx }
  1781. { movl 4(%eax), eax }
  1782. *)
  1783. { not anymore: if the start of a new sequence is found while checking (e.g. }
  1784. { above that of eax while checking edx, this new sequence is automatically }
  1785. { also checked }
  1786. Cnt2 := 1;
  1787. while Cnt2 <= Cnt do
  1788. begin
  1789. {$ifndef noremove}
  1790. ptaiprop(p.optinfo)^.CanBeRemoved := True
  1791. {$endif noremove}
  1792. ; inc(Cnt2);
  1793. GetNextInstruction(p, p);
  1794. end;
  1795. {hp4 is used to get the contents of the registers before the sequence}
  1796. GetLastInstruction(hp2, hp4);
  1797. {$IfDef CSDebug}
  1798. for regcounter := RS_EAX To RS_EDI do
  1799. if (regcounter in reginfo.RegsLoadedforRef) then
  1800. begin
  1801. hp5 := tai_comment.Create(strpnew('New: '+std_regname(newreg(R_INTREGISTER,regcounter,R_SUBNONE))+', Old: '+
  1802. std_regname(newreg(R_INTREGISTER,reginfo.new2oldreg[regcounter],R_SUBNONE))));
  1803. InsertLLItem(asml, tai(hp2.previous), hp2, hp5);
  1804. end;
  1805. {$EndIf CSDebug}
  1806. { if some registers were different in the old and the new sequence, move }
  1807. { the contents of those old registers to the new ones }
  1808. loadcseregs(asml,reginfo,p,prevseq,hp2,hp4,cnt);
  1809. continue;
  1810. end
  1811. end;
  1812. end;
  1813. { try to replace the new reg with the old reg }
  1814. if not(ptaiprop(p.optinfo)^.canBeRemoved) then
  1815. if (taicpu(p).oper[0]^.typ = top_reg) and
  1816. (taicpu(p).oper[1]^.typ = top_reg) and
  1817. { only remove if we're not storing something in a regvar }
  1818. (getsupreg(taicpu(p).oper[1]^.reg) in [RS_EAX,RS_EBX,RS_ECX,RS_EDX,RS_ESI,RS_EDI]) and
  1819. { (taicpu(p).oper[1]^.reg in (rg.usableregsint+[RS_EDI])) and}
  1820. (taicpu(p).opcode = A_MOV) and
  1821. getLastInstruction(p,hp4) and
  1822. { we only have to start replacing from the instruction after the mov, }
  1823. { but replacereg only starts with getnextinstruction(p,p) }
  1824. replaceReg(asml,getsupreg(taicpu(p).oper[0]^.reg),
  1825. getsupreg(taicpu(p).oper[1]^.reg),p,p,
  1826. ptaiprop(hp4.optinfo)^.regs[getsupreg(taicpu(p).oper[1]^.reg)],false,hp1) then
  1827. begin
  1828. ptaiprop(p.optinfo)^.canBeRemoved := true;
  1829. { this is just a regular move that was here, so the source register should be }
  1830. { allocated already at this point -> only allocate from here onwards }
  1831. if not(getsupreg(taicpu(p).oper[0]^.reg) in pTaiProp(p.optinfo)^.usedregs) then
  1832. internalerror(2004101011);
  1833. allocRegBetween(asml,taicpu(p).oper[0]^.reg,
  1834. p,hp1,pTaiProp(p.optinfo)^.usedregs)
  1835. end
  1836. else
  1837. begin
  1838. if (taicpu(p).oper[1]^.typ = top_reg) and
  1839. not regInOp(getsupreg(taicpu(p).oper[1]^.reg),taicpu(p).oper[0]^) then
  1840. removePrevNotUsedLoad(p,getsupreg(taicpu(p).oper[1]^.reg),false);
  1841. if doSubOpts and
  1842. (taicpu(p).opcode <> A_LEA) and
  1843. (taicpu(p).oper[0]^.typ = top_ref) then
  1844. begin
  1845. memreg :=
  1846. memtoreg(taicpu(p),
  1847. taicpu(p).oper[0]^.ref^,hp5);
  1848. if memreg <> NR_NO then
  1849. if (taicpu(p).opcode = A_MOV) and
  1850. (taicpu(p).oper[1]^.typ = top_reg) and
  1851. (taicpu(p).oper[1]^.reg = memreg) then
  1852. begin
  1853. pTaiProp(p.optinfo)^.canberemoved := true;
  1854. allocregbetween(asml,memreg,hp5,p,ptaiprop(hp5.optinfo)^.usedregs);
  1855. end
  1856. else
  1857. begin
  1858. replaceoperandwithreg(asml,p,0,memreg);
  1859. allocregbetween(asml,memreg,hp5,p,ptaiprop(hp5.optinfo)^.usedregs);
  1860. regcounter := getsupreg(memreg);
  1861. incstate(pTaiProp(p.optinfo)^.regs[regcounter].rstate,1);
  1862. updatestate(regcounter,p);
  1863. end;
  1864. end;
  1865. end;
  1866. { at first, only try optimizations of large blocks, because doing }
  1867. { doing smaller ones may prevent bigger ones from completing in }
  1868. { in the next pass }
  1869. if not doSubOpts and (orgNrofMods <> 0) then
  1870. begin
  1871. p := hp2;
  1872. for cnt := 1 to pred(orgNrofMods) do
  1873. getNextInstruction(p,p);
  1874. end;
  1875. end;
  1876. top_Const:
  1877. begin
  1878. case taicpu(p).oper[1]^.typ of
  1879. Top_Reg:
  1880. begin
  1881. regCounter := getsupreg(taicpu(p).oper[1]^.reg);
  1882. if GetLastInstruction(p, hp1) then
  1883. With ptaiprop(hp1.optinfo)^.Regs[regCounter] do
  1884. if (typ in [con_const,con_noRemoveConst]) and
  1885. (taicpu(startMod).opsize >= taicpu(p).opsize) and
  1886. opsequal(taicpu(StartMod).oper[0]^,taicpu(p).oper[0]^) then
  1887. begin
  1888. ptaiprop(p.optinfo)^.CanBeRemoved := True;
  1889. allocRegBetween(asml,taicpu(p).oper[1]^.reg,startmod,p,
  1890. ptaiprop(startmod.optinfo)^.usedregs);
  1891. end
  1892. else
  1893. removePrevNotUsedLoad(p,getsupreg(taicpu(p).oper[1]^.reg),false);
  1894. end;
  1895. Top_Ref:
  1896. if (taicpu(p).oper[0]^.typ = top_const) and
  1897. getLastInstruction(p,hp1) and
  1898. findRegWithConst(hp1,taicpu(p).opsize,taicpu(p).oper[0]^.val,memreg) then
  1899. begin
  1900. taicpu(p).loadreg(0,memreg);
  1901. allocRegBetween(asml,memreg,
  1902. ptaiprop(hp1.optinfo)^.regs[getsupreg(memreg)].startMod,p,
  1903. ptaiprop(ptaiprop(hp1.optinfo)^.regs[getsupreg(memreg)].startMod.optinfo)^.usedregs);
  1904. end;
  1905. end;
  1906. end;
  1907. end;
  1908. end;
  1909. A_LEAVE:
  1910. begin
  1911. if getlastinstruction(p,hp1) then
  1912. removeLocalStores(hp1);
  1913. end;
  1914. A_STD: if GetLastInstruction(p, hp1) and
  1915. (ptaiprop(hp1.optinfo)^.DirFlag = F_Set) then
  1916. ptaiprop(tai(p).optinfo)^.CanBeRemoved := True;
  1917. else
  1918. begin
  1919. for cnt := 1 to maxinschanges do
  1920. begin
  1921. case InsProp[taicpu(p).opcode].Ch[cnt] of
  1922. Ch_ROp1:
  1923. if (taicpu(p).oper[0]^.typ = top_ref) and
  1924. ((taicpu(p).opcode < A_F2XM1) or
  1925. ((taicpu(p).opcode > A_IN) and
  1926. (taicpu(p).opcode < A_OUT)) or
  1927. (taicpu(p).opcode = A_PUSH) or
  1928. ((taicpu(p).opcode >= A_RCL) and
  1929. (taicpu(p).opcode <= A_XOR))) then
  1930. begin
  1931. memreg :=
  1932. memtoreg(taicpu(p),
  1933. taicpu(p).oper[0]^.ref^,hp5);
  1934. if memreg <> NR_NO then
  1935. begin
  1936. replaceoperandwithreg(asml,p,0,memreg);
  1937. allocregbetween(asml,memreg,hp5,p,ptaiprop(hp5.optinfo)^.usedregs);
  1938. regcounter := getsupreg(memreg);
  1939. incstate(pTaiProp(p.optinfo)^.regs[regcounter].rstate,1);
  1940. updatestate(regcounter,p);
  1941. end;
  1942. end;
  1943. Ch_MOp1:
  1944. if not(CS_LittleSize in aktglobalswitches) and
  1945. (taicpu(p).oper[0]^.typ = top_ref) then
  1946. begin
  1947. memreg :=
  1948. memtoreg(taicpu(p),
  1949. taicpu(p).oper[0]^.ref^,hp5);
  1950. if (memreg <> NR_NO) and
  1951. (not getNextInstruction(p,hp1) or
  1952. (RegLoadedWithNewValue(getsupreg(memreg),false,hp1) or
  1953. FindRegDealloc(getsupreg(memreg),hp1))) then
  1954. begin
  1955. hp1 := Tai_Marker.Create(NoPropInfoEnd);
  1956. insertllitem(asml,p,p.next,hp1);
  1957. hp1 := taicpu.op_reg_ref(A_MOV,reg2opsize(memreg),
  1958. memreg,taicpu(p).oper[0]^.ref^);
  1959. new(ptaiprop(hp1.optinfo));
  1960. pTaiProp(hp1.optinfo)^ := pTaiProp(p.optinfo)^;
  1961. insertllitem(asml,p,p.next,hp1);
  1962. regcounter := getsupreg(memreg);
  1963. incstate(pTaiProp(hp1.optinfo)^.regs[regcounter].rstate,1);
  1964. updatestate(regcounter,hp1);
  1965. hp1 := Tai_Marker.Create(NoPropInfoStart);
  1966. insertllitem(asml,p,p.next,hp1);
  1967. replaceoperandwithreg(asml,p,0,memreg);
  1968. allocregbetween(asml,memreg,hp5,
  1969. tai(p.next.next),ptaiprop(hp5.optinfo)^.usedregs);
  1970. ClearRegContentsFrom(regcounter,hp5,p);
  1971. end;
  1972. end;
  1973. Ch_ROp2:
  1974. if ((taicpu(p).opcode = A_CMP) or
  1975. (taicpu(p).opcode = A_TEST)) and
  1976. (taicpu(p).oper[1]^.typ = top_ref) then
  1977. begin
  1978. memreg :=
  1979. memtoreg(taicpu(p),
  1980. taicpu(p).oper[1]^.ref^,hp5);
  1981. if memreg <> NR_NO then
  1982. begin
  1983. replaceoperandwithreg(asml,p,1,memreg);
  1984. allocregbetween(asml,memreg,hp5,p,ptaiprop(hp5.optinfo)^.usedregs);
  1985. regcounter := getsupreg(memreg);
  1986. incstate(pTaiProp(p.optinfo)^.regs[regcounter].rstate,1);
  1987. updatestate(regcounter,p);
  1988. end;
  1989. end;
  1990. Ch_MOp2:
  1991. if not(cs_littlesize in aktglobalswitches) and
  1992. (taicpu(p).oper[1]^.typ = top_ref) and
  1993. ((taicpu(p).opcode < A_BT) or
  1994. ((taicpu(p).opcode > A_IN) and
  1995. (taicpu(p).opcode < A_OUT)) or
  1996. (taicpu(p).opcode = A_PUSH) or
  1997. ((taicpu(p).opcode >= A_RCL) and
  1998. (taicpu(p).opcode <= A_XOR))) then
  1999. begin
  2000. memreg :=
  2001. memtoreg(taicpu(p),
  2002. taicpu(p).oper[1]^.ref^,hp5);
  2003. if (memreg <> NR_NO) and
  2004. (not getNextInstruction(p,hp1) or
  2005. (RegLoadedWithNewValue(getsupreg(memreg),false,hp1) or
  2006. FindRegDealloc(getsupreg(memreg),hp1))) then
  2007. begin
  2008. hp1 := Tai_Marker.Create(NoPropInfoEnd);
  2009. insertllitem(asml,p,p.next,hp1);
  2010. hp1 := taicpu.op_reg_ref(A_MOV,reg2opsize(memreg),
  2011. memreg,taicpu(p).oper[1]^.ref^);
  2012. new(ptaiprop(hp1.optinfo));
  2013. pTaiProp(hp1.optinfo)^ := pTaiProp(p.optinfo)^;
  2014. insertllitem(asml,p,p.next,hp1);
  2015. regcounter := getsupreg(memreg);
  2016. incstate(pTaiProp(hp1.optinfo)^.regs[regcounter].rstate,1);
  2017. updatestate(regcounter,hp1);
  2018. hp1 := Tai_Marker.Create(NoPropInfoStart);
  2019. insertllitem(asml,p,p.next,hp1);
  2020. replaceoperandwithreg(asml,p,1,memreg);
  2021. allocregbetween(asml,memreg,hp5,
  2022. tai(p.next.next),ptaiprop(hp5.optinfo)^.usedregs);
  2023. ClearRegContentsFrom(regcounter,hp5,p);
  2024. end;
  2025. end;
  2026. end;
  2027. end;
  2028. end;
  2029. end
  2030. end;
  2031. end;
  2032. GetNextInstruction(p, p);
  2033. end;
  2034. end;
  2035. function removeInstructs(asml: TAAsmoutput; first, last: tai): boolean;
  2036. { Removes the marked instructions and disposes the PTaiProps of the other }
  2037. { instructions }
  2038. var
  2039. p, hp1: tai;
  2040. nopropinfolevel: longint;
  2041. begin
  2042. removeInstructs := false;
  2043. p := First;
  2044. nopropinfolevel := 0;
  2045. while (p <> Last) do
  2046. begin
  2047. if (p.typ = ait_marker) and
  2048. (Tai_marker(p).kind = noPropInfoStart) then
  2049. begin
  2050. hp1 := tai(p.next);
  2051. asml.remove(p);
  2052. p.free;
  2053. nopropinfolevel := 1;
  2054. while (nopropinfolevel <> 0) do
  2055. begin
  2056. p := tai(hp1.next);
  2057. {$ifndef noinstremove}
  2058. { allocregbetween can insert new ait_regalloc objects }
  2059. { without optinfo }
  2060. if (hp1.typ = ait_marker) then
  2061. begin
  2062. case Tai_marker(hp1).kind of
  2063. { they can be nested! }
  2064. noPropInfoStart: inc(nopropinfolevel);
  2065. noPropInfoEnd: dec(nopropinfolevel);
  2066. else
  2067. begin
  2068. hp1 := p;
  2069. continue;
  2070. end;
  2071. end;
  2072. asml.remove(hp1);
  2073. hp1.free;
  2074. end
  2075. else if assigned(hp1.optinfo) then
  2076. if ptaiprop(hp1.optinfo)^.canBeRemoved then
  2077. begin
  2078. dispose(ptaiprop(hp1.optinfo));
  2079. hp1.optinfo := nil;
  2080. asml.remove(hp1);
  2081. hp1.free;
  2082. end
  2083. else
  2084. {$endif noinstremove}
  2085. begin
  2086. dispose(ptaiprop(hp1.optinfo));
  2087. hp1.optinfo := nil;
  2088. end;
  2089. hp1 := p;
  2090. end;
  2091. end
  2092. else
  2093. {$ifndef noinstremove}
  2094. if assigned(p.optinfo) and
  2095. ptaiprop(p.optinfo)^.canBeRemoved then
  2096. begin
  2097. hp1 := tai(p.next);
  2098. asml.Remove(p);
  2099. p.free;
  2100. p := hp1;
  2101. removeInstructs := true;
  2102. end
  2103. else
  2104. {$endif noinstremove}
  2105. begin
  2106. p.optinfo := nil;
  2107. p := tai(p.next);;
  2108. end;
  2109. end;
  2110. end;
  2111. function CSE(asml: TAAsmOutput; First, Last: tai; pass: longint): boolean;
  2112. begin
  2113. doCSE(asml, First, Last, not(cs_slowoptimize in aktglobalswitches) or (pass >= 2),
  2114. not(cs_slowoptimize in aktglobalswitches) or (pass >= 1));
  2115. { register renaming }
  2116. if not(cs_slowoptimize in aktglobalswitches) or (pass > 0) then
  2117. doRenaming(asml, first, last);
  2118. cse := removeInstructs(asml, first, last);
  2119. end;
  2120. end.