Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 1,116 of 2,753    |
|    Mohamed Shafi to All    |
|    Register Spilling Heuristic ?    |
|    24 Oct 07 10:19:19    |
      From: shafitvm@gmail.com              Hello all,              I am trying to implement Briggs register allocator. While doing that i       came across documents indicating how to choose nodes for spilling. The       documents says to avoid choosing nodes that are the tiny live ranges       resulting from the fetches of previously spilled registers.              What does this mean? Does it mean that the definition points of a       spilled live range that have been stored to memory in a previous       spilling iteration do not need to be stored again and the definition       points of a spilled live range that begin with spill loads that were       inserted in a previous spilling iteration do not need to be stored.              Any help is appreciated.              Regards,       Shafi.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca