1. 11 Mar, 2014 9 commits
    • tibbe's avatar
    • tibbe's avatar
      Add test for inline array allocation · 22e4bba2
      tibbe authored
    • tibbe's avatar
      Fix incorrect loop condition in inline array allocation · c1d74ab9
      tibbe authored
      Also make sure allocHeapClosure updates profiling counters with the
      memory allocated.
    • Simon Marlow's avatar
      Refactor inline array allocation · b684f27e
      Simon Marlow authored
      - Move array representation knowledge into SMRep
      - Separate out low-level heap-object allocation so that we can reuse
        it from doNewArrayOp
      - remove card-table initialisation, we can safely ignore the card
        table for newly allocated arrays.
    • Simon Marlow's avatar
      Represent offsets into heap objects with byte, not word, offsets · a70e7b47
      Simon Marlow authored
      I'd like to be able to pack together non-pointer fields that are less
      than a word in size, and this is a necessary prerequisite.
    • tibbe's avatar
      codeGen: allocate small arrays of statically known size inline · 22f010e0
      tibbe authored
      This results in a 46% runtime decrease when allocating an array of 16
      unit elements on a 64-bit machine.
      In order to allow newArray# to have both an inline and an out-of-line
      implementation, cgOpApp is refactored slightly. The new implementation
      of cgOpApp should make it easier to add other primops with both inline
      and out-of-line implementations in the future.
    • Simon Peyton Jones's avatar
      Fix last-minute typo in SetLevels commit ef44a4 · 41f80310
      Simon Peyton Jones authored
      Sorry about that...
    • Simon Peyton Jones's avatar
      Make SetLevels do substitution properly (fixes Trac #8714) · ef44a429
      Simon Peyton Jones authored
      Nowadays SetLevels floats case expressions as well as let-bindings,
      and case expressions bind type variables.  We need to clone all such
      floated binders, to avoid accidental name capture.  But I'd forgotten
      to substitute for the cloned type variables, causing #8714.  (In the
      olden days only Ids were cloned, from let-bindings.)
      This patch fixes the bug and does quite a bit of clean-up refactoring
      as well, by putting the context level in the LvlEnv.
      There is no effect on performance, except that nofib 'rewrite' improves
      allocations by 3%.  On investigation I think it was a fluke to do with
      loop-cutting in big letrec nests.  But at least it's a fluke in the
      right direction.
              Program           Size    Allocs   Runtime   Elapsed  TotalMem
                  Min          -0.4%     -3.0%    -19.4%    -19.4%    -26.7%
                  Max          -0.0%     +0.0%    +17.9%    +17.9%      0.0%
       Geometric Mean          -0.1%     -0.0%     -0.7%     -0.7%     -0.4%
    • Simon Peyton Jones's avatar
      Comments only · a10ed3e6
      Simon Peyton Jones authored
  2. 10 Mar, 2014 4 commits
  3. 08 Mar, 2014 1 commit
  4. 07 Mar, 2014 6 commits
  5. 06 Mar, 2014 5 commits
  6. 05 Mar, 2014 2 commits
    • Gabor Greif's avatar
      Typos in comments · 2d828460
      Gabor Greif authored
    • Joachim Breitner's avatar
      Major Call Arity rework · cb8a63cb
      Joachim Breitner authored
      This patch improves the call arity analysis in various ways.
      Most importantly, it enriches the analysis result information so that
      when looking at a call, we do not have to make a random choice about
      what side we want to take the information from. Instead we can combine
      the results in a way that does not lose valuable information.
      To do so, besides the incoming arities, we store remember "what can be
      called with what", i.e. an undirected graph between the (interesting)
      free variables of an expression. Of course it makes combining the
      results a bit more tricky (especially mutual recursion), but still
      The actually implemation of the graph structure is abstractly put away
      in a module of its own (UnVarGraph.hs)
      The implementation is geared towards efficiently representing the graphs
      that we need (which can contain large complete and large complete
      bipartite graphs, which would be huge in other representations). If
      someone feels like designing data structures: There is surely some
      speed-up to be obtained by improving that data structure.
      Additionally, the analysis now takes into account that if a RHS stays a
      thunk, then its calls happen only once, even if the variables the RHS is
      bound to is evaluated multiple times, or is part of a recursive group.
  7. 04 Mar, 2014 1 commit
  8. 03 Mar, 2014 1 commit
  9. 01 Mar, 2014 2 commits
  10. 28 Feb, 2014 6 commits
  11. 27 Feb, 2014 3 commits