diff options
| author | Edward Z. Yang <ezyang@cs.stanford.edu> | 2014-05-04 01:18:54 -0700 |
|---|---|---|
| committer | Edward Z. Yang <ezyang@cs.stanford.edu> | 2014-05-04 01:18:54 -0700 |
| commit | 2e03d8664bcf39c26537d6cdcb97c3bfe081bb94 (patch) | |
| tree | 21e64c04828a399894f941d2cc7d8392a75a8f45 | |
| parent | 54b31f744848da872c7c6366dea840748e01b5cf (diff) | |
| download | haskell-2e03d8664bcf39c26537d6cdcb97c3bfe081bb94.tar.gz | |
Update comment now that we have per-gen weak pointer lists.
Signed-off-by: Edward Z. Yang <ezyang@cs.stanford.edu>
| -rw-r--r-- | rts/sm/MarkWeak.c | 6 |
1 files changed, 2 insertions, 4 deletions
diff --git a/rts/sm/MarkWeak.c b/rts/sm/MarkWeak.c index 4e0c1369a1..af953cd881 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: |