1. 19 Dec, 2010 1 commit
  2. 18 Dec, 2010 8 commits
  3. 17 Dec, 2010 6 commits
  4. 16 Dec, 2010 4 commits
  5. 15 Dec, 2010 2 commits
  6. 16 Dec, 2010 1 commit
  7. 09 Dec, 2010 3 commits
  8. 16 Dec, 2010 1 commit
  9. 15 Dec, 2010 1 commit
  10. 16 Dec, 2010 5 commits
  11. 15 Dec, 2010 3 commits
    • Ian Lynagh's avatar
      edc0bafd
    • Simon Marlow's avatar
      fix for large stack allocations · 4f376647
      Simon Marlow authored
      4f376647
    • Simon Marlow's avatar
      Implement stack chunks and separate TSO/STACK objects · f30d5273
      Simon Marlow authored
      This patch makes two changes to the way stacks are managed:
      
      1. The stack is now stored in a separate object from the TSO.
      
      This means that it is easier to replace the stack object for a thread
      when the stack overflows or underflows; we don't have to leave behind
      the old TSO as an indirection any more.  Consequently, we can remove
      ThreadRelocated and deRefTSO(), which were a pain.
      
      This is obviously the right thing, but the last time I tried to do it
      it made performance worse.  This time I seem to have cracked it.
      
      2. Stacks are now represented as a chain of chunks, rather than
         a single monolithic object.
      
      The big advantage here is that individual chunks are marked clean or
      dirty according to whether they contain pointers to the young
      generation, and the GC can avoid traversing clean stack chunks during
      a young-generation collection.  This means that programs with deep
      stacks will see a big saving in GC overhead when using the default GC
      settings.
      
      A secondary advantage is that there is much less copying involved as
      the stack grows.  Programs that quickly grow a deep stack will see big
      improvements.
      
      In some ways the implementation is simpler, as nothing special needs
      to be done to reclaim stack as the stack shrinks (the GC just recovers
      the dead stack chunks).  On the other hand, we have to manage stack
      underflow between chunks, so there's a new stack frame
      (UNDERFLOW_FRAME), and we now have separate TSO and STACK objects.
      The total amount of code is probably about the same as before.
      
      There are new RTS flags:
      
         -ki<size> Sets the initial thread stack size (default 1k)  Egs: -ki4k -ki2m
         -kc<size> Sets the stack chunk size (default 32k)
         -kb<size> Sets the stack chunk buffer size (default 1k)
      
      -ki was previously called just -k, and the old name is still accepted
      for backwards compatibility.  These new options are documented.
      f30d5273
  12. 14 Dec, 2010 1 commit
  13. 09 Dec, 2010 1 commit
  14. 15 Dec, 2010 3 commits