1. 02 Dec, 2008 3 commits
  2. 28 Nov, 2008 2 commits
  3. 02 Dec, 2008 1 commit
  4. 28 Nov, 2008 1 commit
  5. 01 Dec, 2008 1 commit
  6. 29 Nov, 2008 1 commit
  7. 30 Nov, 2008 2 commits
  8. 28 Nov, 2008 9 commits
  9. 27 Nov, 2008 1 commit
    • Thomas Schilling's avatar
      Improve error message for #2739 (but no fix). · 41fd4136
      Thomas Schilling authored
      This patch changes 'loadModule' to define a fake linkable.  The
      previous implementation of providing no linkable at all violated a
      pre-condition in the ByteCode linker.  This doesn't fix #2739, but it
      improves the error message a bit.
      41fd4136
  10. 28 Nov, 2008 1 commit
  11. 27 Nov, 2008 2 commits
  12. 26 Nov, 2008 10 commits
  13. 17 Oct, 2008 1 commit
  14. 16 Oct, 2008 1 commit
    • dias@eecs.harvard.edu's avatar
      Fixed linear regalloc bug, dropped some tracing code · c62b824e
      dias@eecs.harvard.edu authored
      o The linear-scan register allocator sometimes allocated a block
        before allocating one of its predecessors, which could lead
        to inconsistent allocations. Now, we allocate a block only
        if a predecessor has set the "incoming" assignments for the block
        (or if it's the procedure's entry block).
      o Also commented out some tracing code on the new codegen path.
      c62b824e
  15. 14 Oct, 2008 4 commits
    • dias@eecs.harvard.edu's avatar
      Keep update frames live even in functions that never return · 41f7ea2f
      dias@eecs.harvard.edu authored
      An unusual case, but without it:
      (a) we had an assertion failure
      (b) we can overwrite the caller's infotable, which might cause
          the garbage collector to collect live data.
      Better to keep the update frame live at all call sites,
      not just at returns.
      41f7ea2f
    • dias@eecs.harvard.edu's avatar
      Removed space and time inefficiency in procpoint splitting · e13a12b7
      dias@eecs.harvard.edu authored
      I was adding extra jumps to every procpoint, even when the split-off graph
      referred to only some of the procpoints. No effect on correctness,
      but a big effect on space/time efficiency when there are lots of procpoints...
      e13a12b7
    • dias@eecs.harvard.edu's avatar
      Clarify the SRT building process · e367ebeb
      dias@eecs.harvard.edu authored
      Before: building a closure that would build an SRT given the top-level
      SRT. It was somewhat difficult to understand the control flow, and it
      may have had held onto some data structures long after they should be dead.
      Now, I just bundle the info we need about CAFs along with the procedure
      and directly call a new top-level function to build the SRTs later.
      e367ebeb
    • dias@eecs.harvard.edu's avatar
      Don't adjust hp up when the case scrutinee won't allocate · 309f64a0
      dias@eecs.harvard.edu authored
      If the case scrutinee can't allocate, we don't need to do a heap
      check in the case alternatives. (A previous patch got that right.)
      In that case, we had better not adjust the heap pointer to recover
      unused stack space before evaluating the scrutinee -- because we
      aren't going to reallocate for the case alternative.
      309f64a0