[commit: ghc] master: Update comment now that we have per-gen weak pointer lists. (2e03d86)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/ghc

On branch  : master
Link       : http://ghc.haskell.org/trac/ghc/changeset/2e03d8664bcf39c26537d6cdcb97c3bfe081bb94/ghc

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

commit 2e03d8664bcf39c26537d6cdcb97c3bfe081bb94
Author: Edward Z. Yang <ezyang at cs.stanford.edu>
Date:   Sun May 4 01:18:54 2014 -0700

    Update comment now that we have per-gen weak pointer lists.
    
    Signed-off-by: Edward Z. Yang <ezyang at cs.stanford.edu>


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

2e03d8664bcf39c26537d6cdcb97c3bfe081bb94
 rts/sm/MarkWeak.c |    6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/rts/sm/MarkWeak.c b/rts/sm/MarkWeak.c
index 4e0c136..af953cd 100644
--- a/rts/sm/MarkWeak.c
+++ b/rts/sm/MarkWeak.c
@@ -39,10 +39,8 @@
    new live weak pointers, then all the currently unreachable ones are
    dead.
 
-   For generational GC: we just don't try to finalize weak pointers in
-   older generations than the one we're collecting.  This could
-   probably be optimised by keeping per-generation lists of weak
-   pointers, but for a few weak pointers this scheme will work.
+   For generational GC: we don't try to finalize weak pointers in
+   older generations than the one we're collecting.
 
    There are three distinct stages to processing weak pointers: