rgobj.pas 71 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219
  1. {
  2. $Id$
  3. Copyright (c) 1998-2002 by Florian Klaempfl
  4. This unit implements the base class for the register allocator
  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. {$i fpcdefs.inc}
  19. {# @abstract(Abstract register allocator unit)
  20. This unit contains services to allocate, free
  21. references and registers which are used by
  22. the code generator.
  23. }
  24. {*******************************************************************************
  25. (applies to new register allocator)
  26. Register allocator introduction.
  27. Free Pascal uses a Chaitin style register allocator similair to the one
  28. described in the book "Modern compiler implementation in C" by Andrew W. Appel.,
  29. published by Cambridge University Press.
  30. Reading this book is recommended for a complete understanding. Here is a small
  31. introduction.
  32. The code generator thinks it has an infinite amount of registers. Our processorhas a limited amount of registers. Therefore we must reduce the amount of
  33. registers until there are less enough to fit into the processors registers.
  34. Registers can interfere or not interfere. If two imaginary registers interfere
  35. they cannot be placed into the same psysical register. Reduction of registers
  36. is done by:
  37. - "coalescing" Two registers that do not interfere are combined
  38. into one register.
  39. - "spilling" A register is changed into a memory location and the generated
  40. code is modified to use the memory location instead of the register.
  41. Register allocation is a graph colouring problem. Each register is a colour, and
  42. if two registers interfere there is a connection between them in the graph.
  43. In addition to the imaginary registers in the code generator, the psysical
  44. CPU registers are also present in this graph. This allows us to make
  45. interferences between imaginary registers and cpu registers. This is very
  46. usefull for describing archtectural constraints, like for example that
  47. the div instruction modifies edx, so variables that are in use at that time
  48. cannot be stored into edx. This can be modelled by making edx interfere
  49. with those variables.
  50. Graph colouring is an NP complete problem. Therefore we use an approximation
  51. that pushes registers to colour on to a stack. This is done in the "simplify"
  52. procedure.
  53. *******************************************************************************}
  54. unit rgobj;
  55. interface
  56. uses
  57. cutils, cpubase,
  58. cpuinfo,
  59. aasmbase,aasmtai,aasmcpu,
  60. cclasses,globtype,cginfo,cgbase,node
  61. {$ifdef delphi}
  62. ,dmisc
  63. {$endif}
  64. ;
  65. type
  66. regvar_longintarray = array[firstreg..lastreg] of longint;
  67. regvarint_longintarray = array[first_supreg..last_supreg] of longint;
  68. regvar_booleanarray = array[firstreg..lastreg] of boolean;
  69. regvar_ptreearray = array[firstreg..lastreg] of tnode;
  70. tpushedsavedloc = record
  71. case byte of
  72. 0: (pushed: boolean);
  73. 1: (ofs: longint);
  74. end;
  75. tpushedsaved = array[firstreg..lastreg] of tpushedsavedloc;
  76. Tpushedsavedint = array[first_supreg..last_supreg] of Tpushedsavedloc;
  77. Tinterferencebitmap=array[Tsuperregister] of set of Tsuperregister;
  78. Tinterferenceadjlist=array[Tsuperregister] of Pstring;
  79. Tinterferencegraph=record
  80. bitmap:Tinterferencebitmap;
  81. adjlist:Tinterferenceadjlist;
  82. end;
  83. Pinterferencegraph=^Tinterferencegraph;
  84. Tmovelist=record
  85. count:cardinal;
  86. data:array[0..$ffff] of Tlinkedlistitem;
  87. end;
  88. Pmovelist=^Tmovelist;
  89. {In the register allocator we keep track of move instructions.
  90. These instructions are moved between five linked lists. There
  91. is also a linked list per register to keep track about the moves
  92. it is associated with. Because we need to determine quickly in
  93. which of the five lists it is we add anu enumeradtion to each
  94. move instruction.}
  95. Tmoveset=(ms_coalesced_moves,ms_constrained_moves,ms_frozen_moves,
  96. ms_worklist_moves,ms_active_moves);
  97. Tmoveins=class(Tlinkedlistitem)
  98. moveset:Tmoveset;
  99. instruction:Taicpu;
  100. end;
  101. {#
  102. This class implements the abstract register allocator
  103. It is used by the code generator to allocate and free
  104. registers which might be valid across nodes. It also
  105. contains utility routines related to registers.
  106. Some of the methods in this class should be overriden
  107. by cpu-specific implementations.
  108. }
  109. trgobj = class
  110. { The "usableregsxxx" contain all registers of type "xxx" that }
  111. { aren't currently allocated to a regvar. The "unusedregsxxx" }
  112. { contain all registers of type "xxx" that aren't currenly }
  113. { allocated }
  114. lastintreg,maxintreg:Tsuperregister;
  115. unusedregsint,usableregsint:Tsupregset;
  116. unusedregsaddr,usableregsaddr:Tsupregset;
  117. unusedregsfpu,usableregsfpu : tregisterset;
  118. unusedregsmm,usableregsmm : tregisterset;
  119. { these counters contain the number of elements in the }
  120. { unusedregsxxx/usableregsxxx sets }
  121. {$ifndef newra}
  122. countunusedregsint,
  123. countunusedregsaddr,
  124. {$endif}
  125. countunusedregsfpu,
  126. countunusedregsmm : byte;
  127. countusableregsint,
  128. countusableregsaddr,
  129. countusableregsfpu,
  130. countusableregsmm : byte;
  131. { Contains the registers which are really used by the proc itself.
  132. It doesn't take care of registers used by called procedures
  133. }
  134. usedbyproc,
  135. usedinproc : tregisterset;
  136. usedintbyproc,
  137. usedaddrbyproc,
  138. usedintinproc,
  139. usedaddrinproc:Tsupregset;
  140. reg_pushes : regvar_longintarray;
  141. reg_pushes_int : regvarint_longintarray;
  142. is_reg_var : regvar_booleanarray;
  143. is_reg_var_int:Tsupregset;
  144. regvar_loaded: regvar_booleanarray;
  145. regvar_loaded_int: Tsupregset;
  146. {$ifdef newra}
  147. colour:array[Tsuperregister] of Tsuperregister;
  148. spillednodes:string;
  149. {$endif}
  150. { tries to hold the amount of times which the current tree is processed }
  151. t_times: longint;
  152. constructor create(Acpu_registers:byte);
  153. {# Allocate a general purpose register
  154. An internalerror will be generated if there
  155. is no more free registers which can be allocated
  156. }
  157. function getregisterint(list:Taasmoutput;size:Tcgsize):Tregister;virtual;
  158. {# Free a general purpose register
  159. @param(r register to free)
  160. }
  161. procedure ungetregisterint(list: taasmoutput; r : tregister); virtual;
  162. {# Allocate a floating point register
  163. An internalerror will be generated if there
  164. is no more free registers which can be allocated
  165. }
  166. function getregisterfpu(list: taasmoutput) : tregister; virtual;
  167. {# Free a floating point register
  168. @param(r register to free)
  169. }
  170. procedure ungetregisterfpu(list: taasmoutput; r : tregister); virtual;
  171. function getregistermm(list: taasmoutput) : tregister; virtual;
  172. procedure ungetregistermm(list: taasmoutput; r : tregister); virtual;
  173. {# Allocate an address register.
  174. Address registers are the only registers which can
  175. be used as a base register in references (treference).
  176. On most cpu's this is the same as a general purpose
  177. register.
  178. An internalerror will be generated if there
  179. is no more free registers which can be allocated
  180. }
  181. function getaddressregister(list:Taasmoutput):Tregister;virtual;
  182. procedure ungetaddressregister(list: taasmoutput; r: tregister); virtual;
  183. {# Verify if the specified register is an address or
  184. general purpose register. Returns TRUE if @var(reg)
  185. is an adress register.
  186. This routine should only be used to check on
  187. general purpose or address register. It will
  188. not work on multimedia or floating point
  189. registers
  190. @param(reg register to verify)
  191. }
  192. function isaddressregister(reg: tregister): boolean; virtual;
  193. {# Tries to allocate the passed register, if possible
  194. @param(r specific register to allocate)
  195. }
  196. function getexplicitregisterint(list:Taasmoutput;r:Tnewregister):Tregister;virtual;
  197. {# Tries to allocate the passed fpu register, if possible
  198. @param(r specific register to allocate)
  199. }
  200. function getexplicitregisterfpu(list : taasmoutput; r : Toldregister) : tregister;
  201. {# Deallocate any kind of register }
  202. procedure ungetregister(list: taasmoutput; r : tregister); virtual;
  203. {# Deallocate all registers which are allocated
  204. in the specified reference. On most systems,
  205. this will free the base and index registers
  206. of the specified reference.
  207. @param(ref reference which must have its registers freed)
  208. }
  209. procedure ungetreference(list: taasmoutput; const ref : treference); virtual;
  210. {# Reset the register allocator information (usable registers etc).
  211. Please note that it is mortal sins to call cleartempgen during
  212. graph colouring (that is between prepare_colouring and
  213. epilogue_colouring).
  214. }
  215. procedure cleartempgen;virtual;
  216. {# Convert a register to a specified register size, and return that register size }
  217. function makeregsize(reg: tregister; size: tcgsize): tregister; virtual;
  218. {# saves register variables (restoring happens automatically) }
  219. procedure saveintregvars(list:Taasmoutput;const s:Tsupregset);
  220. procedure saveotherregvars(list:Taasmoutput;const s:Tregisterset);
  221. {# Saves in temporary references (allocated via the temp. allocator)
  222. the registers defined in @var(s). The registers are only saved
  223. if they are currently in use, otherwise they are left as is.
  224. On processors which have instructions which manipulate the stack,
  225. this routine should be overriden for performance reasons.
  226. @param(list) List to add the instruction to
  227. @param(saved) Array of saved register information
  228. @param(s) Registers which might require saving
  229. }
  230. procedure saveusedintregisters(list:Taasmoutput;
  231. var saved:Tpushedsavedint;
  232. const s:Tsupregset);virtual;
  233. procedure saveusedotherregisters(list:Taasmoutput;
  234. var saved:Tpushedsaved;
  235. const s:Tregisterset);virtual;
  236. {# Restores the registers which were saved with a call
  237. to @var(saveusedregisters).
  238. On processors which have instructions which manipulate the stack,
  239. this routine should be overriden for performance reasons.
  240. }
  241. procedure restoreusedintregisters(list:Taasmoutput;
  242. const saved:Tpushedsavedint);virtual;
  243. procedure restoreusedotherregisters(list:Taasmoutput;
  244. const saved:Tpushedsaved);virtual;
  245. { used when deciding which registers to use for regvars }
  246. procedure incrementintregisterpushed(const s:Tsupregset);
  247. procedure incrementotherregisterpushed(const s: tregisterset);
  248. procedure clearregistercount;
  249. procedure resetusableregisters;virtual;
  250. procedure makeregvarint(reg:Tnewregister);
  251. procedure makeregvarother(reg:Tregister);
  252. procedure saveStateForInline(var state: pointer);virtual;
  253. procedure restoreStateAfterInline(var state: pointer);virtual;
  254. procedure saveUnusedState(var state: pointer);virtual;
  255. procedure restoreUnusedState(var state: pointer);virtual;
  256. {$ifdef newra}
  257. {$ifdef ra_debug}
  258. procedure writegraph;
  259. {$endif}
  260. procedure add_move_instruction(instr:Taicpu);
  261. procedure prepare_colouring;
  262. procedure epilogue_colouring;
  263. procedure colour_registers;
  264. {$endif newra}
  265. protected
  266. cpu_registers:byte;
  267. {$ifdef newra}
  268. igraph:Tinterferencegraph;
  269. degree:array[0..255] of byte;
  270. alias:array[Tsuperregister] of Tsuperregister;
  271. simplifyworklist,freezeworklist,spillworklist:string;
  272. coalescednodes:string;
  273. selectstack:string;
  274. movelist:array[Tsuperregister] of Pmovelist;
  275. worklist_moves,active_moves,frozen_moves,
  276. coalesced_moves,constrained_moves:Tlinkedlist;
  277. {$endif}
  278. { the following two contain the common (generic) code for all }
  279. { get- and ungetregisterxxx functions/procedures }
  280. function getregistergen(list: taasmoutput; const lowreg, highreg: Toldregister;
  281. var unusedregs:Tregisterset;var countunusedregs:byte): tregister;
  282. function getregistergenint(list:Taasmoutput;subreg:Tsubregister;
  283. const lowreg,highreg:Tsuperregister;
  284. var fusedinproc,fusedbyproc,unusedregs:Tsupregset
  285. {$ifndef newra};var countunusedregs:byte{$endif}):Tregister;
  286. procedure ungetregistergen(list: taasmoutput; const r: tregister;
  287. const usableregs:tregisterset;var unusedregs: tregisterset; var countunusedregs: byte);
  288. procedure ungetregistergenint(list:taasmoutput;const r:Tregister;
  289. const usableregs:Tsupregset;
  290. var unusedregs:Tsupregset
  291. {$ifndef newra};var countunusedregs:byte{$endif});
  292. {$ifdef TEMPREGDEBUG}
  293. reg_user : regvar_ptreearray;
  294. reg_releaser : regvar_ptreearray;
  295. {$endif TEMPREGDEBUG}
  296. {$ifdef TEMPREGDEBUG}
  297. procedure testregisters;
  298. {$endif TEMPREGDEBUGx}
  299. {$ifdef newra}
  300. procedure add_edge(u,v:Tsuperregister);
  301. procedure add_edges_used(u:Tsuperregister);
  302. procedure add_to_movelist(u:Tsuperregister;data:Tlinkedlistitem);
  303. function move_related(n:Tsuperregister):boolean;
  304. procedure make_work_list;
  305. procedure enable_moves(n:Tsuperregister);
  306. procedure decrement_degree(m:Tsuperregister);
  307. procedure simplify;
  308. function get_alias(n:Tsuperregister):Tsuperregister;
  309. procedure add_worklist(u:Tsuperregister);
  310. function adjacent_ok(u,v:Tsuperregister):boolean;
  311. function conservative(u,v:Tsuperregister):boolean;
  312. procedure combine(u,v:Tsuperregister);
  313. procedure coalesce;
  314. procedure freeze_moves(u:Tsuperregister);
  315. procedure freeze;
  316. procedure select_spill;
  317. procedure assign_colours;
  318. {$endif}
  319. end;
  320. const
  321. {# This value is used in tsaved. If the array value is equal
  322. to this, then this means that this register is not used.
  323. }
  324. reg_not_saved = $7fffffff;
  325. var
  326. {# This is the class instance used to access the register allocator class }
  327. rg: trgobj;
  328. { trerefence handling }
  329. {# Clear to zero a treference }
  330. procedure reference_reset(var ref : treference);
  331. procedure reference_reset_old(var ref : treference);
  332. {# Clear to zero a treference, and set is base address
  333. to base register.
  334. }
  335. procedure reference_reset_base(var ref : treference;base : tregister;offset : longint);
  336. procedure reference_reset_symbol(var ref : treference;sym : tasmsymbol;offset : longint);
  337. procedure reference_release(list: taasmoutput; const ref : treference);
  338. { This routine verifies if two references are the same, and
  339. if so, returns TRUE, otherwise returns false.
  340. }
  341. function references_equal(sref : treference;dref : treference) : boolean;
  342. { tlocation handling }
  343. procedure location_reset(var l : tlocation;lt:TCGLoc;lsize:TCGSize);
  344. procedure location_release(list: taasmoutput; const l : tlocation);
  345. procedure location_freetemp(list: taasmoutput; const l : tlocation);
  346. procedure location_copy(var destloc,sourceloc : tlocation);
  347. procedure location_swap(var destloc,sourceloc : tlocation);
  348. type
  349. psavedstate = ^tsavedstate;
  350. tsavedstate = record
  351. unusedregsint,usableregsint : Tsupregset;
  352. unusedregsaddr,usableregsaddr : Tsupregset;
  353. unusedregsfpu,usableregsfpu : tregisterset;
  354. unusedregsmm,usableregsmm : tregisterset;
  355. {$ifndef newra}
  356. countunusedregsint,
  357. countunusedregsaddr,
  358. {$endif}
  359. countunusedregsfpu,
  360. countunusedregsmm : byte;
  361. countusableregsint,
  362. countusableregsfpu,
  363. countusableregsmm : byte;
  364. { contains the registers which are really used by the proc itself }
  365. usedbyproc,
  366. usedinproc : tregisterset;
  367. reg_pushes : regvar_longintarray;
  368. is_reg_var : regvar_booleanarray;
  369. is_reg_var_int : Tsupregset;
  370. regvar_loaded: regvar_booleanarray;
  371. regvar_loaded_int: Tsupregset;
  372. {$ifdef TEMPREGDEBUG}
  373. reg_user : regvar_ptreearray;
  374. reg_releaser : regvar_ptreearray;
  375. {$endif TEMPREGDEBUG}
  376. end;
  377. punusedstate = ^tunusedstate;
  378. tunusedstate = record
  379. unusedregsint : Tsupregset;
  380. unusedregsaddr : Tsupregset;
  381. unusedregsfpu : tregisterset;
  382. unusedregsmm : tregisterset;
  383. {$ifndef newra}
  384. countunusedregsint,
  385. countunusedregsaddr,
  386. {$endif}
  387. countunusedregsfpu,
  388. countunusedregsmm : byte;
  389. end;
  390. implementation
  391. uses
  392. systems,
  393. globals,verbose,
  394. cgobj,tgobj,regvars;
  395. constructor Trgobj.create(Acpu_registers:byte);
  396. begin
  397. usedinproc := [];
  398. usedbyproc:=[];
  399. t_times := 0;
  400. resetusableregisters;
  401. lastintreg:=0;
  402. maxintreg:=first_imreg;
  403. cpu_registers:=Acpu_registers;
  404. {$ifdef TEMPREGDEBUG}
  405. fillchar(reg_user,sizeof(reg_user),0);
  406. fillchar(reg_releaser,sizeof(reg_releaser),0);
  407. {$endif TEMPREGDEBUG}
  408. {$ifdef newra}
  409. fillchar(igraph,sizeof(igraph),0);
  410. fillchar(degree,sizeof(degree),0);
  411. fillchar(movelist,sizeof(movelist),0);
  412. worklist_moves:=Tlinkedlist.create;
  413. {$endif}
  414. end;
  415. function trgobj.getregistergen(list: taasmoutput; const lowreg, highreg: Toldregister;
  416. var unusedregs: tregisterset; var countunusedregs: byte): tregister;
  417. var
  418. i: Toldregister;
  419. r: Tregister;
  420. begin
  421. for i:=lowreg to highreg do
  422. begin
  423. if i in unusedregs then
  424. begin
  425. exclude(unusedregs,i);
  426. include(usedinproc,i);
  427. include(usedbyproc,i);
  428. dec(countunusedregs);
  429. r.enum:=i;
  430. list.concat(tai_regalloc.alloc(r));
  431. result := r;
  432. exit;
  433. end;
  434. end;
  435. internalerror(10);
  436. end;
  437. function Trgobj.getregistergenint(list:Taasmoutput;
  438. subreg:Tsubregister;
  439. const lowreg,highreg:Tsuperregister;
  440. var fusedinproc,fusedbyproc,unusedregs:Tsupregset
  441. {$ifndef newra};var countunusedregs:byte{$endif}):Tregister;
  442. var i:Tsuperregister;
  443. r:Tregister;
  444. begin
  445. if not (lastintreg in [lowreg..highreg]) then
  446. lastintreg:=lowreg;
  447. i:=lastintreg;
  448. repeat
  449. if i=highreg then
  450. i:=lowreg
  451. else
  452. inc(i);
  453. if i in unusedregs then
  454. begin
  455. exclude(unusedregs,i);
  456. include(fusedinproc,i);
  457. include(fusedbyproc,i);
  458. {$ifndef newra}
  459. dec(countunusedregs);
  460. {$endif}
  461. r.enum:=R_INTREGISTER;
  462. r.number:=i shl 8 or subreg;
  463. list.concat(Tai_regalloc.alloc(r));
  464. result:=r;
  465. lastintreg:=i;
  466. if i>maxintreg then
  467. maxintreg:=i;
  468. {$ifdef newra}
  469. add_edges_used(i);
  470. {$endif}
  471. exit;
  472. end;
  473. until i=lastintreg;
  474. internalerror(10);
  475. end;
  476. procedure trgobj.ungetregistergen(list: taasmoutput; const r: tregister;
  477. const usableregs: tregisterset; var unusedregs: tregisterset; var countunusedregs: byte);
  478. begin
  479. if r.enum>lastreg then
  480. internalerror(2003010801);
  481. { takes much time }
  482. if not(r.enum in usableregs) then
  483. exit;
  484. {$ifdef TEMPREGDEBUG}
  485. if (r.enum in unusedregs) then
  486. {$ifdef EXTTEMPREGDEBUG}
  487. begin
  488. Comment(V_Debug,'register freed twice '+std_reg2str[r.enum]);
  489. testregisters32;
  490. exit;
  491. end
  492. {$else EXTTEMPREGDEBUG}
  493. exit
  494. {$endif EXTTEMPREGDEBUG}
  495. else
  496. {$endif TEMPREGDEBUG}
  497. inc(countunusedregs);
  498. include(unusedregs,r.enum);
  499. list.concat(tai_regalloc.dealloc(r));
  500. end;
  501. procedure trgobj.ungetregistergenint(list:taasmoutput;const r:Tregister;
  502. const usableregs:Tsupregset;
  503. var unusedregs:Tsupregset
  504. {$ifndef newra};var countunusedregs:byte{$endif});
  505. var supreg:Tsuperregister;
  506. begin
  507. if r.enum<=lastreg then
  508. internalerror(2003010803);
  509. supreg:=r.number shr 8;
  510. { takes much time }
  511. {$ifndef newra}
  512. if not(supreg in usableregs) then
  513. exit;
  514. {$endif}
  515. {$ifdef TEMPREGDEBUG}
  516. if (supreg in unusedregs) then
  517. {$ifdef EXTTEMPREGDEBUG}
  518. begin
  519. comment(v_debug,'register freed twice '+supreg_name(supreg));
  520. testregisters32;
  521. exit;
  522. end
  523. {$else EXTTEMPREGDEBUG}
  524. exit
  525. {$endif EXTTEMPREGDEBUG}
  526. else
  527. {$endif TEMPREGDEBUG}
  528. {$ifndef newra}inc(countunusedregs){$endif};
  529. include(unusedregs,supreg);
  530. list.concat(tai_regalloc.dealloc(r));
  531. {$ifdef newra}
  532. add_edges_used(supreg);
  533. {$endif newra}
  534. end;
  535. function trgobj.getregisterint(list:taasmoutput;size:Tcgsize):Tregister;
  536. var subreg:Tsubregister;
  537. begin
  538. {$ifndef newra}
  539. if countunusedregsint=0 then
  540. internalerror(10);
  541. {$ifdef TEMPREGDEBUG}
  542. if curptree^^.usableregs-countunusedregsint>curptree^^.registers32 then
  543. internalerror(10);
  544. {$endif TEMPREGDEBUG}
  545. {$ifdef EXTTEMPREGDEBUG}
  546. if curptree^^.usableregs-countunusedregsint>curptree^^.reallyusedregs then
  547. curptree^^.reallyusedregs:=curptree^^.usableregs-countunusedregsint;
  548. {$endif EXTTEMPREGDEBUG}
  549. {$endif}
  550. subreg:=cgsize2subreg(size);
  551. result:=getregistergenint(list,
  552. subreg,
  553. {$ifdef newra}
  554. first_imreg,
  555. last_imreg,
  556. {$else}
  557. first_supreg,
  558. last_supreg,
  559. {$endif}
  560. usedintbyproc,
  561. usedintinproc,
  562. unusedregsint{$ifndef newra},
  563. countunusedregsint{$endif});
  564. {$ifdef TEMPREGDEBUG}
  565. reg_user[result]:=curptree^;
  566. testregisters32;
  567. {$endif TEMPREGDEBUG}
  568. end;
  569. procedure trgobj.ungetregisterint(list : taasmoutput; r : tregister);
  570. begin
  571. ungetregistergenint(list,r,usableregsint,unusedregsint{$ifndef newra},
  572. countunusedregsint{$endif});
  573. {$ifdef TEMPREGDEBUG}
  574. reg_releaser[r]:=curptree^;
  575. testregisters32;
  576. {$endif TEMPREGDEBUG}
  577. end;
  578. { tries to allocate the passed register, if possible }
  579. function trgobj.getexplicitregisterint(list:Taasmoutput;r:Tnewregister):Tregister;
  580. var r2:Tregister;
  581. begin
  582. if (r shr 8) in unusedregsint then
  583. begin
  584. {$ifndef newra}
  585. dec(countunusedregsint);
  586. {$ifdef TEMPREGDEBUG}
  587. if curptree^^.usableregs-countunusedregsint>curptree^^.registers32 then
  588. internalerror(10);
  589. reg_user[r shr 8]:=curptree^;
  590. {$endif TEMPREGDEBUG}
  591. {$endif newra}
  592. exclude(unusedregsint,r shr 8);
  593. include(usedintinproc,r shr 8);
  594. include(usedintbyproc,r shr 8);
  595. r2.enum:=R_INTREGISTER;
  596. r2.number:=r;
  597. list.concat(tai_regalloc.alloc(r2));
  598. {$ifdef TEMPREGDEBUG}
  599. testregisters32;
  600. {$endif TEMPREGDEBUG}
  601. end
  602. else
  603. internalerror(200301103);
  604. getexplicitregisterint:=r2;
  605. end;
  606. { tries to allocate the passed register, if possible }
  607. function trgobj.getexplicitregisterfpu(list : taasmoutput; r : Toldregister) : tregister;
  608. var r2:Tregister;
  609. begin
  610. if r in unusedregsfpu then
  611. begin
  612. dec(countunusedregsfpu);
  613. {$ifdef TEMPREGDEBUG}
  614. if curptree^^.usableregs-countunusedregsint>curptree^^.registers32 then
  615. internalerror(10);
  616. reg_user[r]:=curptree^;
  617. {$endif TEMPREGDEBUG}
  618. exclude(unusedregsfpu,r);
  619. include(usedinproc,r);
  620. include(usedbyproc,r);
  621. r2.enum:=r;
  622. list.concat(tai_regalloc.alloc(r2));
  623. getexplicitregisterfpu:=r2;
  624. {$ifdef TEMPREGDEBUG}
  625. testregisters32;
  626. {$endif TEMPREGDEBUG}
  627. end
  628. else
  629. getexplicitregisterfpu:=getregisterfpu(list);
  630. end;
  631. function trgobj.getregisterfpu(list: taasmoutput) : tregister;
  632. begin
  633. if countunusedregsfpu=0 then
  634. internalerror(10);
  635. result := getregistergen(list,firstsavefpureg,lastsavefpureg,
  636. unusedregsfpu,countunusedregsfpu);
  637. end;
  638. procedure trgobj.ungetregisterfpu(list : taasmoutput; r : tregister);
  639. begin
  640. ungetregistergen(list,r,usableregsfpu,unusedregsfpu,
  641. countunusedregsfpu);
  642. end;
  643. function trgobj.getregistermm(list: taasmoutput) : tregister;
  644. begin
  645. if countunusedregsmm=0 then
  646. internalerror(10);
  647. result := getregistergen(list,firstsavemmreg,lastsavemmreg,
  648. unusedregsmm,countunusedregsmm);
  649. end;
  650. procedure trgobj.ungetregistermm(list: taasmoutput; r: tregister);
  651. begin
  652. ungetregistergen(list,r,usableregsmm,unusedregsmm,
  653. countunusedregsmm);
  654. end;
  655. function trgobj.getaddressregister(list:Taasmoutput): tregister;
  656. begin
  657. {An address register is OS_INT per definition.}
  658. result := getregisterint(list,OS_INT);
  659. end;
  660. procedure trgobj.ungetaddressregister(list: taasmoutput; r: tregister);
  661. begin
  662. ungetregisterint(list,r);
  663. end;
  664. function trgobj.isaddressregister(reg: tregister): boolean;
  665. begin
  666. result := true;
  667. end;
  668. procedure trgobj.ungetregister(list: taasmoutput; r : tregister);
  669. begin
  670. if r.enum=R_NO then
  671. exit;
  672. if r.enum>lastreg then
  673. internalerror(200301081);
  674. if r.enum in intregs then
  675. ungetregisterint(list,r)
  676. else if r.enum in fpuregs then
  677. ungetregisterfpu(list,r)
  678. else if r.enum in mmregs then
  679. ungetregistermm(list,r)
  680. else if r.enum in addrregs then
  681. ungetaddressregister(list,r)
  682. else internalerror(2002070602);
  683. end;
  684. procedure Trgobj.cleartempgen;
  685. {$ifdef newra}
  686. var i:Tsuperregister;
  687. {$endif newra}
  688. begin
  689. {$ifndef newra}
  690. countunusedregsint:=countusableregsint;
  691. {$endif}
  692. countunusedregsfpu:=countusableregsfpu;
  693. countunusedregsmm:=countusableregsmm;
  694. lastintreg:=0;
  695. maxintreg:=first_imreg;
  696. {$ifdef newra}
  697. unusedregsint:=[0..255];
  698. {$else}
  699. unusedregsint:=usableregsint;
  700. {$endif}
  701. unusedregsfpu:=usableregsfpu;
  702. unusedregsmm:=usableregsmm;
  703. {$ifdef newra}
  704. for i:=low(Tsuperregister) to high(Tsuperregister) do
  705. begin
  706. if igraph.adjlist[i]<>nil then
  707. dispose(igraph.adjlist[i]);
  708. if movelist[i]<>nil then
  709. dispose(movelist[i]);
  710. end;
  711. fillchar(movelist,sizeof(movelist),0);
  712. fillchar(igraph,sizeof(igraph),0);
  713. fillchar(degree,sizeof(degree),0);
  714. worklist_moves.clear;
  715. {$endif}
  716. end;
  717. procedure trgobj.ungetreference(list : taasmoutput; const ref : treference);
  718. begin
  719. if ref.base.number<>NR_NO then
  720. ungetregisterint(list,ref.base);
  721. if ref.index.number<>NR_NO then
  722. ungetregisterint(list,ref.index);
  723. end;
  724. procedure trgobj.saveintregvars(list:Taasmoutput;const s:Tsupregset);
  725. var r:Tsuperregister;
  726. begin
  727. if not(cs_regalloc in aktglobalswitches) then
  728. exit;
  729. for r:=firstsaveintreg to lastsaveintreg do
  730. if (r in is_reg_var_int) and
  731. (r in s) then
  732. store_regvar_int(list,r);
  733. end;
  734. procedure trgobj.saveotherregvars(list: taasmoutput; const s: tregisterset);
  735. var
  736. r: Tregister;
  737. begin
  738. if not(cs_regalloc in aktglobalswitches) then
  739. exit;
  740. if firstsavefpureg <> R_NO then
  741. for r.enum := firstsavefpureg to lastsavefpureg do
  742. if is_reg_var[r.enum] and
  743. (r.enum in s) then
  744. store_regvar(list,r);
  745. if firstsavemmreg <> R_NO then
  746. for r.enum := firstsavemmreg to lastsavemmreg do
  747. if is_reg_var[r.enum] and
  748. (r.enum in s) then
  749. store_regvar(list,r);
  750. end;
  751. procedure trgobj.saveusedintregisters(list:Taasmoutput;
  752. var saved:Tpushedsavedint;
  753. const s:Tsupregset);
  754. var r:Tsuperregister;
  755. r2:Tregister;
  756. hr : treference;
  757. begin
  758. usedintinproc:=usedintinproc+s;
  759. for r:=firstsaveintreg to lastsaveintreg do
  760. begin
  761. saved[r].ofs:=reg_not_saved;
  762. { if the register is used by the calling subroutine and if }
  763. { it's not a regvar (those are handled separately) }
  764. if not (r in is_reg_var_int) and
  765. (r in s) and
  766. { and is present in use }
  767. not(r in unusedregsint) then
  768. begin
  769. { then save it }
  770. tg.GetTemp(list,sizeof(aword),tt_persistant,hr);
  771. saved[r].ofs:=hr.offset;
  772. r2.enum:=R_INTREGISTER;
  773. r2.number:=r shl 8 or R_SUBWHOLE;
  774. cg.a_load_reg_ref(list,OS_INT,r2,hr);
  775. cg.a_reg_dealloc(list,r2);
  776. include(unusedregsint,r);
  777. {$ifndef newra}
  778. inc(countunusedregsint);
  779. {$endif}
  780. end;
  781. end;
  782. {$ifdef TEMPREGDEBUG}
  783. testregisters32;
  784. {$endif TEMPREGDEBUG}
  785. end;
  786. procedure trgobj.saveusedotherregisters(list: taasmoutput;
  787. var saved : tpushedsaved; const s: tregisterset);
  788. var
  789. r : tregister;
  790. hr : treference;
  791. begin
  792. usedinproc:=usedinproc + s;
  793. { don't try to save the fpu registers if not desired (e.g. for }
  794. { the 80x86) }
  795. if firstsavefpureg <> R_NO then
  796. for r.enum:=firstsavefpureg to lastsavefpureg do
  797. begin
  798. saved[r.enum].ofs:=reg_not_saved;
  799. { if the register is used by the calling subroutine and if }
  800. { it's not a regvar (those are handled separately) }
  801. if not is_reg_var[r.enum] and
  802. (r.enum in s) and
  803. { and is present in use }
  804. not(r.enum in unusedregsfpu) then
  805. begin
  806. { then save it }
  807. tg.GetTemp(list,extended_size,tt_persistant,hr);
  808. saved[r.enum].ofs:=hr.offset;
  809. cg.a_loadfpu_reg_ref(list,OS_FLOAT,r,hr);
  810. cg.a_reg_dealloc(list,r);
  811. include(unusedregsfpu,r.enum);
  812. inc(countunusedregsfpu);
  813. end;
  814. end;
  815. { don't save the vector registers if there's no support for them }
  816. if firstsavemmreg <> R_NO then
  817. for r.enum:=firstsavemmreg to lastsavemmreg do
  818. begin
  819. saved[r.enum].ofs:=reg_not_saved;
  820. { if the register is in use and if it's not a regvar (those }
  821. { are handled separately), save it }
  822. if not is_reg_var[r.enum] and
  823. (r.enum in s) and
  824. { and is present in use }
  825. not(r.enum in unusedregsmm) then
  826. begin
  827. { then save it }
  828. tg.GetTemp(list,mmreg_size,tt_persistant,hr);
  829. saved[r.enum].ofs:=hr.offset;
  830. cg.a_loadmm_reg_ref(list,r,hr);
  831. cg.a_reg_dealloc(list,r);
  832. include(unusedregsmm,r.enum);
  833. inc(countunusedregsmm);
  834. end;
  835. end;
  836. {$ifdef TEMPREGDEBUG}
  837. testregisters32;
  838. {$endif TEMPREGDEBUG}
  839. end;
  840. procedure trgobj.restoreusedintregisters(list:Taasmoutput;
  841. const saved:Tpushedsavedint);
  842. var r:Tsuperregister;
  843. r2:Tregister;
  844. hr:Treference;
  845. begin
  846. for r:=lastsaveintreg downto firstsaveintreg do
  847. begin
  848. if saved[r].ofs <> reg_not_saved then
  849. begin
  850. r2.enum:=R_INTREGISTER;
  851. r2.number:=NR_FRAME_POINTER_REG;
  852. reference_reset_base(hr,r2,saved[r].ofs);
  853. r2.enum:=R_INTREGISTER;
  854. r2.number:=r shl 8 or R_SUBWHOLE;
  855. cg.a_reg_alloc(list,r2);
  856. cg.a_load_ref_reg(list,OS_INT,hr,r2);
  857. if not (r in unusedregsint) then
  858. { internalerror(10)
  859. in n386cal we always save/restore the reg *state*
  860. using save/restoreunusedstate -> the current state
  861. may not be real (JM) }
  862. else
  863. begin
  864. {$ifndef newra}
  865. dec(countunusedregsint);
  866. {$endif}
  867. exclude(unusedregsint,r);
  868. end;
  869. tg.UnGetTemp(list,hr);
  870. end;
  871. end;
  872. {$ifdef TEMPREGDEBUG}
  873. testregisters32;
  874. {$endif TEMPREGDEBUG}
  875. end;
  876. procedure trgobj.restoreusedotherregisters(list : taasmoutput;
  877. const saved : tpushedsaved);
  878. var
  879. r,r2 : tregister;
  880. hr : treference;
  881. begin
  882. if firstsavemmreg <> R_NO then
  883. for r.enum:=lastsavemmreg downto firstsavemmreg do
  884. begin
  885. if saved[r.enum].ofs <> reg_not_saved then
  886. begin
  887. r2.enum:=R_INTREGISTER;
  888. r2.number:=NR_FRAME_POINTER_REG;
  889. reference_reset_base(hr,r2,saved[r.enum].ofs);
  890. cg.a_reg_alloc(list,r);
  891. cg.a_loadmm_ref_reg(list,hr,r);
  892. if not (r.enum in unusedregsmm) then
  893. { internalerror(10)
  894. in n386cal we always save/restore the reg *state*
  895. using save/restoreunusedstate -> the current state
  896. may not be real (JM) }
  897. else
  898. begin
  899. dec(countunusedregsmm);
  900. exclude(unusedregsmm,r.enum);
  901. end;
  902. tg.UnGetTemp(list,hr);
  903. end;
  904. end;
  905. if firstsavefpureg <> R_NO then
  906. for r.enum:=lastsavefpureg downto firstsavefpureg do
  907. begin
  908. if saved[r.enum].ofs <> reg_not_saved then
  909. begin
  910. r2.enum:=R_INTREGISTER;
  911. r2.number:=NR_FRAME_POINTER_REG;
  912. reference_reset_base(hr,r2,saved[r.enum].ofs);
  913. cg.a_reg_alloc(list,r);
  914. cg.a_loadfpu_ref_reg(list,OS_FLOAT,hr,r);
  915. if not (r.enum in unusedregsfpu) then
  916. { internalerror(10)
  917. in n386cal we always save/restore the reg *state*
  918. using save/restoreunusedstate -> the current state
  919. may not be real (JM) }
  920. else
  921. begin
  922. dec(countunusedregsfpu);
  923. exclude(unusedregsfpu,r.enum);
  924. end;
  925. tg.UnGetTemp(list,hr);
  926. end;
  927. end;
  928. {$ifdef TEMPREGDEBUG}
  929. testregisters32;
  930. {$endif TEMPREGDEBUG}
  931. end;
  932. procedure trgobj.incrementintregisterpushed(const s:Tsupregset);
  933. var regi:Tsuperregister;
  934. begin
  935. for regi:=firstsaveintreg to lastsaveintreg do
  936. begin
  937. if (regi in s) then
  938. inc(reg_pushes_int[regi],t_times*2);
  939. end;
  940. end;
  941. procedure trgobj.incrementotherregisterpushed(const s:Tregisterset);
  942. var
  943. regi : Toldregister;
  944. begin
  945. if firstsavefpureg <> R_NO then
  946. for regi:=firstsavefpureg to lastsavefpureg do
  947. begin
  948. if (regi in s) then
  949. inc(reg_pushes[regi],t_times*2);
  950. end;
  951. if firstsavemmreg <> R_NO then
  952. for regi:=firstsavemmreg to lastsavemmreg do
  953. begin
  954. if (regi in s) then
  955. inc(reg_pushes[regi],t_times*2);
  956. end;
  957. end;
  958. procedure trgobj.clearregistercount;
  959. begin
  960. fillchar(reg_pushes,sizeof(reg_pushes),0);
  961. fillchar(is_reg_var,sizeof(is_reg_var),false);
  962. is_reg_var_int:=[];
  963. fillchar(regvar_loaded,sizeof(regvar_loaded),false);
  964. regvar_loaded_int:=[];
  965. end;
  966. procedure trgobj.resetusableregisters;
  967. begin
  968. { initialize fields with constant values from cpubase }
  969. countusableregsint := cpubase.c_countusableregsint;
  970. countusableregsfpu := cpubase.c_countusableregsfpu;
  971. countusableregsmm := cpubase.c_countusableregsmm;
  972. usableregsint := cpubase.usableregsint;
  973. usableregsfpu := cpubase.usableregsfpu;
  974. usableregsmm := cpubase.usableregsmm;
  975. clearregistercount;
  976. end;
  977. procedure trgobj.makeregvarint(reg:Tnewregister);
  978. var supreg:Tsuperregister;
  979. begin
  980. supreg:=reg shr 8;
  981. dec(countusableregsint);
  982. {$ifndef newra}
  983. dec(countunusedregsint);
  984. {$endif}
  985. exclude(usableregsint,reg);
  986. exclude(unusedregsint,reg);
  987. include(is_reg_var_int,supreg);
  988. end;
  989. procedure trgobj.makeregvarother(reg: tregister);
  990. begin
  991. if reg.enum>lastreg then
  992. internalerror(200301081);
  993. if reg.enum in intregs then
  994. internalerror(200301151)
  995. else if reg.enum in fpuregs then
  996. begin
  997. dec(countusableregsfpu);
  998. dec(countunusedregsfpu);
  999. exclude(usableregsfpu,reg.enum);
  1000. exclude(unusedregsfpu,reg.enum);
  1001. end
  1002. else if reg.enum in mmregs then
  1003. begin
  1004. dec(countusableregsmm);
  1005. dec(countunusedregsmm);
  1006. exclude(usableregsmm,reg.enum);
  1007. exclude(unusedregsmm,reg.enum);
  1008. end;
  1009. is_reg_var[reg.enum]:=true;
  1010. end;
  1011. {$ifdef TEMPREGDEBUG}
  1012. procedure trgobj.testregisters;
  1013. var
  1014. r: tregister;
  1015. test : byte;
  1016. begin
  1017. test:=0;
  1018. for r := firstsaveintreg to lastsaveintreg do
  1019. inc(test,ord(r in unusedregsint));
  1020. if test<>countunusedregsint then
  1021. internalerror(10);
  1022. end;
  1023. {$endif TEMPREGDEBUG}
  1024. procedure trgobj.saveStateForInline(var state: pointer);
  1025. begin
  1026. new(psavedstate(state));
  1027. psavedstate(state)^.unusedregsint := unusedregsint;
  1028. psavedstate(state)^.usableregsint := usableregsint;
  1029. psavedstate(state)^.unusedregsfpu := unusedregsfpu;
  1030. psavedstate(state)^.usableregsfpu := usableregsfpu;
  1031. psavedstate(state)^.unusedregsmm := unusedregsmm;
  1032. psavedstate(state)^.usableregsmm := usableregsmm;
  1033. {$ifndef newra}
  1034. psavedstate(state)^.countunusedregsint := countunusedregsint;
  1035. {$endif}
  1036. psavedstate(state)^.countunusedregsfpu := countunusedregsfpu;
  1037. psavedstate(state)^.countunusedregsmm := countunusedregsmm;
  1038. psavedstate(state)^.countusableregsint := countusableregsint;
  1039. psavedstate(state)^.countusableregsfpu := countusableregsfpu;
  1040. psavedstate(state)^.countusableregsmm := countusableregsmm;
  1041. psavedstate(state)^.usedinproc := usedinproc;
  1042. psavedstate(state)^.usedbyproc := usedbyproc;
  1043. psavedstate(state)^.reg_pushes := reg_pushes;
  1044. psavedstate(state)^.is_reg_var := is_reg_var;
  1045. psavedstate(state)^.is_reg_var_int := is_reg_var_int;
  1046. psavedstate(state)^.regvar_loaded := regvar_loaded;
  1047. psavedstate(state)^.regvar_loaded_int := regvar_loaded_int;
  1048. {$ifdef TEMPREGDEBUG}
  1049. psavedstate(state)^.reg_user := reg_user;
  1050. psavedstate(state)^.reg_releaser := reg_releaser;
  1051. {$endif TEMPREGDEBUG}
  1052. end;
  1053. procedure trgobj.restoreStateAfterInline(var state: pointer);
  1054. begin
  1055. unusedregsint := psavedstate(state)^.unusedregsint;
  1056. usableregsint := psavedstate(state)^.usableregsint;
  1057. unusedregsfpu := psavedstate(state)^.unusedregsfpu;
  1058. usableregsfpu := psavedstate(state)^.usableregsfpu;
  1059. unusedregsmm := psavedstate(state)^.unusedregsmm;
  1060. usableregsmm := psavedstate(state)^.usableregsmm;
  1061. {$ifndef newra}
  1062. countunusedregsint := psavedstate(state)^.countunusedregsint;
  1063. {$endif}
  1064. countunusedregsfpu := psavedstate(state)^.countunusedregsfpu;
  1065. countunusedregsmm := psavedstate(state)^.countunusedregsmm;
  1066. countusableregsint := psavedstate(state)^.countusableregsint;
  1067. countusableregsfpu := psavedstate(state)^.countusableregsfpu;
  1068. countusableregsmm := psavedstate(state)^.countusableregsmm;
  1069. usedinproc := psavedstate(state)^.usedinproc;
  1070. usedbyproc := psavedstate(state)^.usedbyproc;
  1071. reg_pushes := psavedstate(state)^.reg_pushes;
  1072. is_reg_var := psavedstate(state)^.is_reg_var;
  1073. is_reg_var_int := psavedstate(state)^.is_reg_var_int;
  1074. regvar_loaded := psavedstate(state)^.regvar_loaded;
  1075. regvar_loaded_int := psavedstate(state)^.regvar_loaded_int;
  1076. {$ifdef TEMPREGDEBUG}
  1077. reg_user := psavedstate(state)^.reg_user;
  1078. reg_releaser := psavedstate(state)^.reg_releaser;
  1079. {$endif TEMPREGDEBUG}
  1080. dispose(psavedstate(state));
  1081. state := nil;
  1082. end;
  1083. procedure trgobj.saveUnusedState(var state: pointer);
  1084. begin
  1085. new(punusedstate(state));
  1086. punusedstate(state)^.unusedregsint := unusedregsint;
  1087. punusedstate(state)^.unusedregsfpu := unusedregsfpu;
  1088. punusedstate(state)^.unusedregsmm := unusedregsmm;
  1089. {$ifndef newra}
  1090. punusedstate(state)^.countunusedregsint := countunusedregsint;
  1091. {$endif}
  1092. punusedstate(state)^.countunusedregsfpu := countunusedregsfpu;
  1093. punusedstate(state)^.countunusedregsmm := countunusedregsmm;
  1094. end;
  1095. procedure trgobj.restoreUnusedState(var state: pointer);
  1096. begin
  1097. unusedregsint := punusedstate(state)^.unusedregsint;
  1098. unusedregsfpu := punusedstate(state)^.unusedregsfpu;
  1099. unusedregsmm := punusedstate(state)^.unusedregsmm;
  1100. {$ifndef newra}
  1101. countunusedregsint := punusedstate(state)^.countunusedregsint;
  1102. {$endif}
  1103. countunusedregsfpu := punusedstate(state)^.countunusedregsfpu;
  1104. countunusedregsmm := punusedstate(state)^.countunusedregsmm;
  1105. dispose(punusedstate(state));
  1106. state := nil;
  1107. end;
  1108. {$ifdef newra}
  1109. procedure Trgobj.add_edge(u,v:Tsuperregister);
  1110. {This procedure will add an edge to the virtual interference graph.}
  1111. procedure addadj(u,v:Tsuperregister);
  1112. begin
  1113. if igraph.adjlist[u]=nil then
  1114. begin
  1115. getmem(igraph.adjlist[u],16);
  1116. igraph.adjlist[u]^:='';
  1117. end
  1118. else if (length(igraph.adjlist[u]^) and 15)=15 then
  1119. reallocmem(igraph.adjlist[u],length(igraph.adjlist[u]^)+16);
  1120. igraph.adjlist[u]^:=igraph.adjlist[u]^+char(v);
  1121. end;
  1122. begin
  1123. if (u<>v) and not(v in igraph.bitmap[u]) then
  1124. begin
  1125. include(igraph.bitmap[u],v);
  1126. include(igraph.bitmap[v],u);
  1127. {Precoloured nodes are not stored in the interference graph.}
  1128. if not(u in [first_supreg..last_supreg]) then
  1129. begin
  1130. addadj(u,v);
  1131. inc(degree[u]);
  1132. end;
  1133. if not(v in [first_supreg..last_supreg]) then
  1134. begin
  1135. addadj(v,u);
  1136. inc(degree[v]);
  1137. end;
  1138. end;
  1139. end;
  1140. procedure Trgobj.add_edges_used(u:Tsuperregister);
  1141. var i:Tsuperregister;
  1142. begin
  1143. for i:=1 to 255 do
  1144. if not(i in unusedregsint) then
  1145. add_edge(u,i);
  1146. end;
  1147. {$ifdef ra_debug}
  1148. procedure Trgobj.writegraph;
  1149. {This procedure writes out the current interference graph in the
  1150. register allocator.}
  1151. var f:text;
  1152. i,j:Tsuperregister;
  1153. begin
  1154. assign(f,'igraph'+char(48+random(10))+char(48+random(10)));
  1155. rewrite(f);
  1156. writeln(f,'Interference graph');
  1157. writeln(f);
  1158. write(f,' ');
  1159. for i:=0 to 15 do
  1160. for j:=0 to 15 do
  1161. write(f,hexstr(i,1));
  1162. writeln(f);
  1163. write(f,' ');
  1164. for i:=0 to 15 do
  1165. write(f,'0123456789ABCDEF');
  1166. writeln(f);
  1167. for i:=0 to 255 do
  1168. begin
  1169. write(f,hexstr(i,2):4);
  1170. for j:=0 to 255 do
  1171. if j in igraph.bitmap[i] then
  1172. write(f,'*')
  1173. else
  1174. write(f,'-');
  1175. writeln(f);
  1176. end;
  1177. close(f);
  1178. end;
  1179. {$endif}
  1180. procedure Trgobj.add_to_movelist(u:Tsuperregister;data:Tlinkedlistitem);
  1181. begin
  1182. if movelist[u]=nil then
  1183. begin
  1184. getmem(movelist[u],64);
  1185. movelist[u]^.count:=0;
  1186. end
  1187. else if (movelist[u]^.count and 15)=15 then
  1188. reallocmem(movelist[u],(movelist[u]^.count+1)*4+64);
  1189. movelist[u]^.data[movelist[u]^.count]:=data;
  1190. inc(movelist[u]^.count);
  1191. end;
  1192. procedure Trgobj.add_move_instruction(instr:Taicpu);
  1193. {This procedure notifies a certain as a move instruction so the
  1194. register allocator can try to eliminate it.}
  1195. var i:Tmoveins;
  1196. ssupreg,dsupreg:Tsuperregister;
  1197. begin
  1198. i:=Tmoveins.create;
  1199. i.moveset:=ms_worklist_moves;
  1200. i.instruction:=instr;
  1201. worklist_moves.insert(i);
  1202. ssupreg:=instr.oper[0].reg.number shr 8;
  1203. add_to_movelist(ssupreg,i);
  1204. dsupreg:=instr.oper[1].reg.number shr 8;
  1205. add_to_movelist(dsupreg,i);
  1206. end;
  1207. function Trgobj.move_related(n:Tsuperregister):boolean;
  1208. var i:cardinal;
  1209. begin
  1210. move_related:=false;
  1211. if movelist[n]<>nil then
  1212. begin
  1213. for i:=0 to movelist[n]^.count-1 do
  1214. if Tmoveins(movelist[n]^.data[i]).moveset in
  1215. [ms_worklist_moves,ms_active_moves] then
  1216. begin
  1217. move_related:=true;
  1218. break;
  1219. end;
  1220. end;
  1221. end;
  1222. procedure Trgobj.make_work_list;
  1223. var n:Tsuperregister;
  1224. begin
  1225. for n:=first_imreg to maxintreg do
  1226. if degree[n]>cpu_registers then
  1227. spillworklist:=spillworklist+char(n)
  1228. else if move_related(n) then
  1229. freezeworklist:=freezeworklist+char(n)
  1230. else
  1231. simplifyworklist:=simplifyworklist+char(n);
  1232. end;
  1233. procedure Trgobj.prepare_colouring;
  1234. begin
  1235. make_work_list;
  1236. active_moves:=Tlinkedlist.create;
  1237. frozen_moves:=Tlinkedlist.create;
  1238. coalesced_moves:=Tlinkedlist.create;
  1239. constrained_moves:=Tlinkedlist.create;
  1240. fillchar(alias,sizeof(alias),0);
  1241. coalescednodes:='';
  1242. selectstack:='';
  1243. end;
  1244. procedure Trgobj.enable_moves(n:Tsuperregister);
  1245. var m:Tlinkedlistitem;
  1246. i:cardinal;
  1247. begin
  1248. if movelist[n]<>nil then
  1249. for i:=0 to movelist[n]^.count-1 do
  1250. begin
  1251. m:=movelist[n]^.data[i];
  1252. if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then
  1253. begin
  1254. if Tmoveins(m).moveset=ms_active_moves then
  1255. begin
  1256. {Move m from the set active_moves to the set worklist_moves.}
  1257. active_moves.remove(m);
  1258. Tmoveins(m).moveset:=ms_worklist_moves;
  1259. worklist_moves.concat(m);
  1260. end;
  1261. end;
  1262. end;
  1263. end;
  1264. procedure Trgobj.decrement_degree(m:Tsuperregister);
  1265. var adj:Pstring;
  1266. d:byte;
  1267. i:byte;
  1268. n:char;
  1269. begin
  1270. d:=degree[m];
  1271. dec(degree[m]);
  1272. if d=cpu_registers then
  1273. begin
  1274. {Enable moves for m.}
  1275. enable_moves(m);
  1276. {Enable moves for adjacent.}
  1277. adj:=igraph.adjlist[m];
  1278. if adj<>nil then
  1279. for i:=1 to length(adj^) do
  1280. begin
  1281. n:=adj^[i];
  1282. if (pos(n,selectstack) or pos(n,coalescednodes))=0 then
  1283. enable_moves(Tsuperregister(n));
  1284. end;
  1285. {In case the node is in the spillworklist, delete it.}
  1286. delete(spillworklist,pos(char(m),spillworklist),1);
  1287. if move_related(m) then
  1288. freezeworklist:=freezeworklist+char(m)
  1289. else
  1290. simplifyworklist:=simplifyworklist+char(m);
  1291. end;
  1292. end;
  1293. procedure Trgobj.simplify;
  1294. var adj:Pstring;
  1295. i,min,p:byte;
  1296. m:char;
  1297. n:Tsuperregister;
  1298. begin
  1299. {We the element with the least interferences out of the
  1300. simplifyworklist.}
  1301. min:=$ff;
  1302. p:=1;
  1303. for i:=1 to length(simplifyworklist) do
  1304. begin
  1305. adj:=igraph.adjlist[Tsuperregister(simplifyworklist[i])];
  1306. if adj=nil then
  1307. begin
  1308. min:=0;
  1309. break; {We won't find smaller ones.}
  1310. end
  1311. else
  1312. if length(adj^)<min then
  1313. begin
  1314. min:=length(adj^);
  1315. if min=0 then
  1316. break; {We won't find smaller ones.}
  1317. p:=i;
  1318. end;
  1319. end;
  1320. n:=Tsuperregister(simplifyworklist[p]);
  1321. delete(simplifyworklist,p,1);
  1322. {Push it on the selectstack.}
  1323. selectstack:=selectstack+char(n);
  1324. adj:=igraph.adjlist[n];
  1325. if adj<>nil then
  1326. for i:=1 to length(adj^) do
  1327. begin
  1328. m:=adj^[i];
  1329. if (pos(m,selectstack) or pos(m,coalescednodes))=0 then
  1330. decrement_degree(Tsuperregister(m));
  1331. end;
  1332. end;
  1333. function Trgobj.get_alias(n:Tsuperregister):Tsuperregister;
  1334. begin
  1335. while pos(char(n),coalescednodes)<>0 do
  1336. n:=alias[n];
  1337. get_alias:=n;
  1338. end;
  1339. procedure Trgobj.add_worklist(u:Tsuperregister);
  1340. begin
  1341. if not(u in [first_supreg..last_supreg]) and not move_related(u) and
  1342. (degree[u]<cpu_registers) then
  1343. begin
  1344. delete(freezeworklist,pos(char(u),freezeworklist),1);
  1345. simplifyworklist:=simplifyworklist+char(u);
  1346. end;
  1347. end;
  1348. function Trgobj.adjacent_ok(u,v:Tsuperregister):boolean;
  1349. {Check wether u and v should be coalesced. u is precoloured.}
  1350. function ok(t,r:Tsuperregister):boolean;
  1351. begin
  1352. ok:=(degree[t]<cpu_registers) or
  1353. (t in [first_supreg..last_supreg]) or
  1354. (r in igraph.bitmap[t]);
  1355. end;
  1356. var adj:Pstring;
  1357. i:byte;
  1358. t:char;
  1359. begin
  1360. adjacent_ok:=true;
  1361. adj:=igraph.adjlist[v];
  1362. if adj<>nil then
  1363. for i:=1 to length(adj^) do
  1364. begin
  1365. t:=adj^[i];
  1366. if (pos(t,selectstack) or pos(t,coalescednodes))=0 then
  1367. if not ok(Tsuperregister(t),u) then
  1368. begin
  1369. adjacent_ok:=false;
  1370. break;
  1371. end;
  1372. end;
  1373. end;
  1374. function Trgobj.conservative(u,v:Tsuperregister):boolean;
  1375. var adj:Pstring;
  1376. done:set of char; {To prevent that we count nodes twice.}
  1377. i,k:byte;
  1378. n:char;
  1379. begin
  1380. k:=0;
  1381. done:=[];
  1382. adj:=igraph.adjlist[u];
  1383. if adj<>nil then
  1384. for i:=1 to length(adj^) do
  1385. begin
  1386. n:=adj^[i];
  1387. if (pos(n,selectstack) or pos(n,coalescednodes))=0 then
  1388. begin
  1389. include(done,n);
  1390. if degree[Tsuperregister(n)]>=cpu_registers then
  1391. inc(k);
  1392. end;
  1393. end;
  1394. adj:=igraph.adjlist[v];
  1395. if adj<>nil then
  1396. for i:=1 to length(adj^) do
  1397. begin
  1398. n:=adj^[i];
  1399. if ((pos(n,selectstack) or pos(n,coalescednodes))=0) and
  1400. not (n in done) and
  1401. (degree[Tsuperregister(n)]>=cpu_registers) then
  1402. inc(k);
  1403. end;
  1404. conservative:=(k<cpu_registers);
  1405. end;
  1406. procedure Trgobj.combine(u,v:Tsuperregister);
  1407. var add:boolean;
  1408. adj:Pstring;
  1409. i,p:byte;
  1410. n,o:cardinal;
  1411. t:char;
  1412. begin
  1413. p:=pos(char(v),freezeworklist);
  1414. if p<>0 then
  1415. delete(freezeworklist,p,1)
  1416. else
  1417. delete(spillworklist,pos(char(v),spillworklist),1);
  1418. coalescednodes:=coalescednodes+char(v);
  1419. alias[v]:=u;
  1420. {Combine both movelists. Since the movelists are sets, only add
  1421. elements that are not already present.}
  1422. for n:=0 to movelist[v]^.count-1 do
  1423. begin
  1424. add:=true;
  1425. for o:=0 to movelist[u]^.count-1 do
  1426. if movelist[u]^.data[o]=movelist[v]^.data[n] then
  1427. begin
  1428. add:=false;
  1429. break;
  1430. end;
  1431. if add then
  1432. add_to_movelist(u,movelist[v]^.data[n]);
  1433. end;
  1434. enable_moves(v);
  1435. adj:=igraph.adjlist[v];
  1436. if adj<>nil then
  1437. for i:=1 to length(adj^) do
  1438. begin
  1439. t:=adj^[i];
  1440. if (pos(t,selectstack) or pos(t,coalescednodes))=0 then
  1441. begin
  1442. add_edge(Tsuperregister(t),u);
  1443. decrement_degree(Tsuperregister(t));
  1444. end;
  1445. end;
  1446. p:=pos(char(u),freezeworklist);
  1447. if (degree[u]>=cpu_registers) and (p<>0) then
  1448. begin
  1449. delete(freezeworklist,p,1);
  1450. spillworklist:=spillworklist+char(u);
  1451. end;
  1452. end;
  1453. procedure Trgobj.coalesce;
  1454. var m:Tmoveins;
  1455. x,y,u,v:Tsuperregister;
  1456. begin
  1457. m:=Tmoveins(worklist_moves.getfirst);
  1458. x:=get_alias(m.instruction.oper[0].reg.number shr 8);
  1459. y:=get_alias(m.instruction.oper[1].reg.number shr 8);
  1460. if y in [first_supreg..last_supreg] then
  1461. begin
  1462. u:=y;
  1463. v:=x;
  1464. end
  1465. else
  1466. begin
  1467. u:=x;
  1468. v:=y;
  1469. end;
  1470. if (u=v) then
  1471. begin
  1472. m.moveset:=ms_coalesced_moves; {Already coalesced.}
  1473. coalesced_moves.insert(m);
  1474. add_worklist(u);
  1475. end
  1476. {Do u and v interfere? In that case the move is constrained. Two
  1477. precoloured nodes interfere allways. If v is precoloured, by the above
  1478. code u is precoloured, thus interference...}
  1479. else if (v in [first_supreg..last_supreg]) or (u in igraph.bitmap[v]) then
  1480. begin
  1481. m.moveset:=ms_constrained_moves; {Cannot coalesce yet...}
  1482. constrained_moves.insert(m);
  1483. add_worklist(u);
  1484. add_worklist(v);
  1485. end
  1486. {Next test: is it possible and a good idea to coalesce??}
  1487. else if ((u in [first_supreg..last_supreg]) and adjacent_ok(u,v)) or
  1488. (not(u in [first_supreg..last_supreg]) and conservative(u,v)) then
  1489. begin
  1490. m.moveset:=ms_coalesced_moves; {Move coalesced!}
  1491. coalesced_moves.insert(m);
  1492. combine(u,v);
  1493. add_worklist(u);
  1494. end
  1495. else
  1496. begin
  1497. m.moveset:=ms_active_moves;
  1498. active_moves.insert(m);
  1499. end;
  1500. end;
  1501. procedure Trgobj.freeze_moves(u:Tsuperregister);
  1502. var i:cardinal;
  1503. m:Tlinkedlistitem;
  1504. v,x,y:Tsuperregister;
  1505. begin
  1506. if movelist[u]<>nil then
  1507. for i:=0 to movelist[u]^.count-1 do
  1508. begin
  1509. m:=movelist[u]^.data[i];
  1510. if Tmoveins(m).moveset in [ms_worklist_moves,ms_active_moves] then
  1511. begin
  1512. x:=Tmoveins(m).instruction.oper[0].reg.number shr 8;
  1513. y:=Tmoveins(m).instruction.oper[1].reg.number shr 8;
  1514. if get_alias(y)=get_alias(u) then
  1515. v:=get_alias(x)
  1516. else
  1517. v:=get_alias(y);
  1518. {Move m from active_moves/worklist_moves to frozen_moves.}
  1519. if Tmoveins(m).moveset=ms_active_moves then
  1520. active_moves.remove(m)
  1521. else
  1522. worklist_moves.remove(m);
  1523. Tmoveins(m).moveset:=ms_frozen_moves;
  1524. frozen_moves.insert(m);
  1525. if not(move_related(v)) and (degree[v]<cpu_registers) then
  1526. begin
  1527. delete(freezeworklist,pos(char(v),freezeworklist),1);
  1528. simplifyworklist:=simplifyworklist+char(v);
  1529. end;
  1530. end;
  1531. end;
  1532. end;
  1533. procedure Trgobj.freeze;
  1534. var n:Tsuperregister;
  1535. begin
  1536. {We need to take a random element out of the freezeworklist. We take
  1537. the last element. Dirty code!}
  1538. n:=Tsuperregister(freezeworklist[byte(freezeworklist[0])]);
  1539. dec(freezeworklist[0]);
  1540. {Add it to the simplifyworklist.}
  1541. simplifyworklist:=simplifyworklist+char(n);
  1542. freeze_moves(n);
  1543. end;
  1544. procedure Trgobj.select_spill;
  1545. var n:char;
  1546. begin
  1547. {This code is WAY too naive. We need not to select just a register, but
  1548. the register that is used the least...}
  1549. n:=spillworklist[byte(spillworklist[0])];
  1550. dec(spillworklist[0]);
  1551. simplifyworklist:=simplifyworklist+n;
  1552. freeze_moves(Tsuperregister(n));
  1553. end;
  1554. procedure Trgobj.assign_colours;
  1555. {Assign_colours assigns the actual colours to the registers.}
  1556. var adj:Pstring;
  1557. i,j,k:byte;
  1558. n,a:Tsuperregister;
  1559. adj_colours,colourednodes:set of Tsuperregister;
  1560. w:char;
  1561. begin
  1562. spillednodes:='';
  1563. {Colour the cpu registers...}
  1564. colourednodes:=[first_supreg..last_supreg];
  1565. for i:=first_supreg to last_supreg do
  1566. colour[i]:=i;
  1567. {Now colour the imaginary registers on the select-stack.}
  1568. for i:=length(selectstack) downto 1 do
  1569. begin
  1570. n:=Tsuperregister(selectstack[i]);
  1571. {Create a list of colours that we cannot assign to n.}
  1572. adj_colours:=[];
  1573. adj:=igraph.adjlist[n];
  1574. if adj<>nil then
  1575. for j:=1 to length(adj^) do
  1576. begin
  1577. w:=adj^[j];
  1578. a:=get_alias(Tsuperregister(w));
  1579. if a in colourednodes then
  1580. include(adj_colours,colour[a]);
  1581. end;
  1582. {Assume a spill by default...}
  1583. spillednodes:=spillednodes+char(n);
  1584. {Search for a colour not in this list.}
  1585. for k:=1 to cpu_registers do
  1586. if not(k in adj_colours) then
  1587. begin
  1588. colour[n]:=k;
  1589. dec(spillednodes[0]); {Colour found: no spill.}
  1590. include(colourednodes,n);
  1591. break;
  1592. end;
  1593. end;
  1594. {Finally colour the nodes that were coalesced.}
  1595. for i:=1 to length(coalescednodes) do
  1596. begin
  1597. n:=Tsuperregister(coalescednodes[i]);
  1598. colour[n]:=colour[get_alias(n)];
  1599. end;
  1600. for i:=first_imreg to maxintreg do
  1601. writeln(i:4,' ',colour[i]:4)
  1602. end;
  1603. procedure Trgobj.colour_registers;
  1604. begin
  1605. repeat
  1606. if length(simplifyworklist)<>0 then
  1607. simplify
  1608. else if not(worklist_moves.empty) then
  1609. coalesce
  1610. else if length(freezeworklist)<>0 then
  1611. freeze
  1612. else if length(spillworklist)<>0 then
  1613. select_spill;
  1614. until (length(simplifyworklist) or
  1615. byte(not(worklist_moves.empty)) or
  1616. length(freezeworklist) or
  1617. length(spillworklist)
  1618. )=0;
  1619. assign_colours;
  1620. end;
  1621. procedure Trgobj.epilogue_colouring;
  1622. begin
  1623. active_moves.destroy;
  1624. active_moves:=nil;
  1625. frozen_moves.destroy;
  1626. frozen_moves:=nil;
  1627. coalesced_moves.destroy;
  1628. coalesced_moves:=nil;
  1629. constrained_moves.destroy;
  1630. constrained_moves:=nil;
  1631. end;
  1632. {$endif newra}
  1633. {****************************************************************************
  1634. TReference
  1635. ****************************************************************************}
  1636. procedure reference_reset(var ref : treference);
  1637. begin
  1638. FillChar(ref,sizeof(treference),0);
  1639. ref.base.enum:=R_INTREGISTER;
  1640. ref.index.enum:=R_INTREGISTER;
  1641. {$ifdef i386}
  1642. ref.segment.enum:=R_INTREGISTER;
  1643. {$endif}
  1644. end;
  1645. procedure reference_reset_old(var ref : treference);
  1646. begin
  1647. FillChar(ref,sizeof(treference),0);
  1648. end;
  1649. procedure reference_reset_base(var ref : treference;base : tregister;offset : longint);
  1650. begin
  1651. reference_reset(ref);
  1652. ref.base:=base;
  1653. ref.offset:=offset;
  1654. end;
  1655. procedure reference_reset_symbol(var ref : treference;sym : tasmsymbol;offset : longint);
  1656. begin
  1657. reference_reset(ref);
  1658. ref.symbol:=sym;
  1659. ref.offset:=offset;
  1660. end;
  1661. procedure reference_release(list: taasmoutput; const ref : treference);
  1662. begin
  1663. rg.ungetreference(list,ref);
  1664. end;
  1665. function references_equal(sref : treference;dref : treference):boolean;
  1666. begin
  1667. references_equal:=CompareByte(sref,dref,sizeof(treference))=0;
  1668. end;
  1669. { on most processors , this routine does nothing, overriden currently }
  1670. { only by 80x86 processor. }
  1671. function trgobj.makeregsize(reg: tregister; size: tcgsize): tregister;
  1672. begin
  1673. makeregsize := reg;
  1674. end;
  1675. {****************************************************************************
  1676. TLocation
  1677. ****************************************************************************}
  1678. procedure location_reset(var l : tlocation;lt:TCGLoc;lsize:TCGSize);
  1679. begin
  1680. FillChar(l,sizeof(tlocation),0);
  1681. l.loc:=lt;
  1682. l.size:=lsize;
  1683. case l.loc of
  1684. LOC_REGISTER,LOC_CREGISTER:
  1685. begin
  1686. l.register.enum:=R_INTREGISTER;
  1687. l.registerhigh.enum:=R_INTREGISTER;
  1688. end;
  1689. LOC_REFERENCE,LOC_CREFERENCE:
  1690. begin
  1691. l.reference.base.enum:=R_INTREGISTER;
  1692. l.reference.index.enum:=R_INTREGISTER;
  1693. {$ifdef i386}
  1694. l.reference.segment.enum:=R_INTREGISTER;
  1695. {$endif}
  1696. end;
  1697. end;
  1698. end;
  1699. procedure location_release(list: taasmoutput; const l : tlocation);
  1700. begin
  1701. case l.loc of
  1702. LOC_REGISTER,LOC_CREGISTER :
  1703. begin
  1704. rg.ungetregisterint(list,l.register);
  1705. if l.size in [OS_64,OS_S64] then
  1706. rg.ungetregisterint(list,l.registerhigh);
  1707. end;
  1708. LOC_CREFERENCE,LOC_REFERENCE :
  1709. rg.ungetreference(list, l.reference);
  1710. end;
  1711. end;
  1712. procedure location_freetemp(list:taasmoutput; const l : tlocation);
  1713. begin
  1714. if (l.loc in [LOC_REFERENCE,LOC_CREFERENCE]) then
  1715. tg.ungetiftemp(list,l.reference);
  1716. end;
  1717. procedure location_copy(var destloc,sourceloc : tlocation);
  1718. begin
  1719. destloc:=sourceloc;
  1720. end;
  1721. procedure location_swap(var destloc,sourceloc : tlocation);
  1722. var
  1723. swapl : tlocation;
  1724. begin
  1725. swapl := destloc;
  1726. destloc := sourceloc;
  1727. sourceloc := swapl;
  1728. end;
  1729. initialization
  1730. ;
  1731. finalization
  1732. rg.free;
  1733. end.
  1734. {
  1735. $Log$
  1736. Revision 1.42 2003-04-26 20:03:49 daniel
  1737. * Bug fix in simplify
  1738. Revision 1.41 2003/04/25 20:59:35 peter
  1739. * removed funcretn,funcretsym, function result is now in varsym
  1740. and aliases for result and function name are added using absolutesym
  1741. * vs_hidden parameter for funcret passed in parameter
  1742. * vs_hidden fixes
  1743. * writenode changed to printnode and released from extdebug
  1744. * -vp option added to generate a tree.log with the nodetree
  1745. * nicer printnode for statements, callnode
  1746. Revision 1.40 2003/04/25 08:25:26 daniel
  1747. * Ifdefs around a lot of calls to cleartempgen
  1748. * Fixed registers that are allocated but not freed in several nodes
  1749. * Tweak to register allocator to cause less spills
  1750. * 8-bit registers now interfere with esi,edi and ebp
  1751. Compiler can now compile rtl successfully when using new register
  1752. allocator
  1753. Revision 1.39 2003/04/23 20:23:06 peter
  1754. * compile fix for no-newra
  1755. Revision 1.38 2003/04/23 14:42:07 daniel
  1756. * Further register allocator work. Compiler now smaller with new
  1757. allocator than without.
  1758. * Somebody forgot to adjust ppu version number
  1759. Revision 1.37 2003/04/22 23:50:23 peter
  1760. * firstpass uses expectloc
  1761. * checks if there are differences between the expectloc and
  1762. location.loc from secondpass in EXTDEBUG
  1763. Revision 1.36 2003/04/22 10:09:35 daniel
  1764. + Implemented the actual register allocator
  1765. + Scratch registers unavailable when new register allocator used
  1766. + maybe_save/maybe_restore unavailable when new register allocator used
  1767. Revision 1.35 2003/04/21 19:16:49 peter
  1768. * count address regs separate
  1769. Revision 1.34 2003/04/17 16:48:21 daniel
  1770. * Added some code to keep track of move instructions in register
  1771. allocator
  1772. Revision 1.33 2003/04/17 07:50:24 daniel
  1773. * Some work on interference graph construction
  1774. Revision 1.32 2003/03/28 19:16:57 peter
  1775. * generic constructor working for i386
  1776. * remove fixed self register
  1777. * esi added as address register for i386
  1778. Revision 1.31 2003/03/11 21:46:24 jonas
  1779. * lots of new regallocator fixes, both in generic and ppc-specific code
  1780. (ppc compiler still can't compile the linux system unit though)
  1781. Revision 1.30 2003/03/09 21:18:59 olle
  1782. + added cutils to the uses clause
  1783. Revision 1.29 2003/03/08 20:36:41 daniel
  1784. + Added newra version of Ti386shlshrnode
  1785. + Added interference graph construction code
  1786. Revision 1.28 2003/03/08 13:59:16 daniel
  1787. * Work to handle new register notation in ag386nsm
  1788. + Added newra version of Ti386moddivnode
  1789. Revision 1.27 2003/03/08 10:53:48 daniel
  1790. * Created newra version of secondmul in n386add.pas
  1791. Revision 1.26 2003/03/08 08:59:07 daniel
  1792. + $define newra will enable new register allocator
  1793. + getregisterint will return imaginary registers with $newra
  1794. + -sr switch added, will skip register allocation so you can see
  1795. the direct output of the code generator before register allocation
  1796. Revision 1.25 2003/02/26 20:50:45 daniel
  1797. * Fixed ungetreference
  1798. Revision 1.24 2003/02/19 22:39:56 daniel
  1799. * Fixed a few issues
  1800. Revision 1.23 2003/02/19 22:00:14 daniel
  1801. * Code generator converted to new register notation
  1802. - Horribily outdated todo.txt removed
  1803. Revision 1.22 2003/02/02 19:25:54 carl
  1804. * Several bugfixes for m68k target (register alloc., opcode emission)
  1805. + VIS target
  1806. + Generic add more complete (still not verified)
  1807. Revision 1.21 2003/01/08 18:43:57 daniel
  1808. * Tregister changed into a record
  1809. Revision 1.20 2002/10/05 12:43:28 carl
  1810. * fixes for Delphi 6 compilation
  1811. (warning : Some features do not work under Delphi)
  1812. Revision 1.19 2002/08/23 16:14:49 peter
  1813. * tempgen cleanup
  1814. * tt_noreuse temp type added that will be used in genentrycode
  1815. Revision 1.18 2002/08/17 22:09:47 florian
  1816. * result type handling in tcgcal.pass_2 overhauled
  1817. * better tnode.dowrite
  1818. * some ppc stuff fixed
  1819. Revision 1.17 2002/08/17 09:23:42 florian
  1820. * first part of procinfo rewrite
  1821. Revision 1.16 2002/08/06 20:55:23 florian
  1822. * first part of ppc calling conventions fix
  1823. Revision 1.15 2002/08/05 18:27:48 carl
  1824. + more more more documentation
  1825. + first version include/exclude (can't test though, not enough scratch for i386 :()...
  1826. Revision 1.14 2002/08/04 19:06:41 carl
  1827. + added generic exception support (still does not work!)
  1828. + more documentation
  1829. Revision 1.13 2002/07/07 09:52:32 florian
  1830. * powerpc target fixed, very simple units can be compiled
  1831. * some basic stuff for better callparanode handling, far from being finished
  1832. Revision 1.12 2002/07/01 18:46:26 peter
  1833. * internal linker
  1834. * reorganized aasm layer
  1835. Revision 1.11 2002/05/18 13:34:17 peter
  1836. * readded missing revisions
  1837. Revision 1.10 2002/05/16 19:46:44 carl
  1838. + defines.inc -> fpcdefs.inc to avoid conflicts if compiling by hand
  1839. + try to fix temp allocation (still in ifdef)
  1840. + generic constructor calls
  1841. + start of tassembler / tmodulebase class cleanup
  1842. Revision 1.8 2002/04/21 15:23:03 carl
  1843. + makeregsize
  1844. + changeregsize is now a local routine
  1845. Revision 1.7 2002/04/20 21:32:25 carl
  1846. + generic FPC_CHECKPOINTER
  1847. + first parameter offset in stack now portable
  1848. * rename some constants
  1849. + move some cpu stuff to other units
  1850. - remove unused constents
  1851. * fix stacksize for some targets
  1852. * fix generic size problems which depend now on EXTEND_SIZE constant
  1853. Revision 1.6 2002/04/15 19:03:31 carl
  1854. + reg2str -> std_reg2str()
  1855. Revision 1.5 2002/04/06 18:13:01 jonas
  1856. * several powerpc-related additions and fixes
  1857. Revision 1.4 2002/04/04 19:06:04 peter
  1858. * removed unused units
  1859. * use tlocation.size in cg.a_*loc*() routines
  1860. Revision 1.3 2002/04/02 17:11:29 peter
  1861. * tlocation,treference update
  1862. * LOC_CONSTANT added for better constant handling
  1863. * secondadd splitted in multiple routines
  1864. * location_force_reg added for loading a location to a register
  1865. of a specified size
  1866. * secondassignment parses now first the right and then the left node
  1867. (this is compatible with Kylix). This saves a lot of push/pop especially
  1868. with string operations
  1869. * adapted some routines to use the new cg methods
  1870. Revision 1.2 2002/04/01 19:24:25 jonas
  1871. * fixed different parameter name in interface and implementation
  1872. declaration of a method (only 1.0.x detected this)
  1873. Revision 1.1 2002/03/31 20:26:36 jonas
  1874. + a_loadfpu_* and a_loadmm_* methods in tcg
  1875. * register allocation is now handled by a class and is mostly processor
  1876. independent (+rgobj.pas and i386/rgcpu.pas)
  1877. * temp allocation is now handled by a class (+tgobj.pas, -i386\tgcpu.pas)
  1878. * some small improvements and fixes to the optimizer
  1879. * some register allocation fixes
  1880. * some fpuvaroffset fixes in the unary minus node
  1881. * push/popusedregisters is now called rg.save/restoreusedregisters and
  1882. (for i386) uses temps instead of push/pop's when using -Op3 (that code is
  1883. also better optimizable)
  1884. * fixed and optimized register saving/restoring for new/dispose nodes
  1885. * LOC_FPU locations now also require their "register" field to be set to
  1886. R_ST, not R_ST0 (the latter is used for LOC_CFPUREGISTER locations only)
  1887. - list field removed of the tnode class because it's not used currently
  1888. and can cause hard-to-find bugs
  1889. }