From: baikaishiuc@gmail.com   
      
   In book  written by Anderw   
   W.Appel,   
   The chapter of Register Allocation taught me if the program have   
   actual spill, you must rewrite program,   
   Allocate memory space for every V included by spilledNode,   
   every V's def and use must create a new temp Vi. In program (instruct   
   sequence)   
   after  Def(Vi) insert a STORE instruct, Before Use(Vi) insert a LOAD   
   instruct.   
      
   My problem: how to speeded the find all Def(V) and Use (V)?   
   In my program every V in spilledNode lead a O(n) (n is the number of   
   instruct) search.   
      
      
   My english is poor, I try my best express in clearly.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)