From: amker.cheng@gmail.com   
      
   Hi,   
   I found following intermediate codes are generated in gcc   
      
   rx <- 0   
   ...   
   use rx   
   ...   
   ry <- 0   
   use ry   
   ...   
      
   It's normally a result of const propagation.   
   After register allocation, It is likely rx/ry get allocated into   
   different hard registers.   
   Thus in final codes, there would be a redundant "move 0" instruction.   
      
   The story even stands for Os compiling, so the question is:   
   Is there any optimization technique dedicates to this kind of case?   
   Or is it normally handled by other optimizations as sub task?   
      
   Thanks very much.   
   --   
   Best Regards.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)