[commit: ghc] newcg: Delete some done items (8fb67a2)

[Simon Marlow]

Repository : ssh://darcs.haskell.org//srv/darcs/ghc

On branch  : newcg

http://hackage.haskell.org/trac/ghc/changeset/8fb67a2a9c798976cefecb8d69d73fde5383c4f1

>---------------------------------------------------------------

commit 8fb67a2a9c798976cefecb8d69d73fde5383c4f1
Author: Simon Marlow <marlowsd at gmail.com>
Date:   Tue Feb 14 11:46:33 2012 +0000

    Delete some done items

>---------------------------------------------------------------

 compiler/cmm/cmm-notes |   17 -----------------
 1 files changed, 0 insertions(+), 17 deletions(-)

diff --git a/compiler/cmm/cmm-notes b/compiler/cmm/cmm-notes
index bbad34c..1a6d1fe 100644
--- a/compiler/cmm/cmm-notes
+++ b/compiler/cmm/cmm-notes
@@ -24,27 +24,10 @@ More notes (June 11)
 * Check in ClosureInfo:
      -- NB: Results here should line up with the results of SMRep.rtsClosureType
 
-* Possible refactoring: Nuke AGraph in favour of 
-      mkIfThenElse :: Expr -> Graph -> Graph -> FCode Graph
-  or even
-      mkIfThenElse :: HasUniques m => Expr -> Graph -> Graph -> m Graph
-  (Remmber that the .cmm file parser must use this function)
-
-  or parameterise FCode over its envt; the CgState part seem useful for both
-
 * "Remove redundant reloads" in CmmSpillReload should be redundant; since
   insertLateReloads is now gone, every reload is reloading a live variable.
   Test and nuke.
 
-* Stack layout is very like register assignment: find non-conflicting assigments.
-  In particular we can use colouring or linear scan (etc).
-
-  We'd fine-grain interference (on a word by word basis) to get maximum overlap.
-  But that may make very big interference graphs.  So linear scan might be
-  more attactive.
-
-  NB: linear scan does on-the-fly live range splitting.
-
 * When stubbing dead slots be careful not to write into an area that
   overlaps with an area that's in use.  So stubbing needs to *follow* 
   stack layout.