 // Now schedule all codes as LATE as possible.  This is the LCA in the // dominator tree of all USES of a value.  Pick the block with the least // loop nesting depth that is lowest in the dominator tree. 