1. 24 Feb, 2012 1 commit
  2. 23 Feb, 2012 1 commit
  3. 17 Feb, 2012 1 commit
  4. 14 Feb, 2012 1 commit
  5. 06 Jan, 2012 1 commit
  6. 07 Dec, 2011 1 commit
    • chak@cse.unsw.edu.au.'s avatar
      Add new primtypes 'ArrayArray#' and 'MutableArrayArray#' · 021a0dd2
      chak@cse.unsw.edu.au. authored
      The primitive array types, such as 'ByteArray#', have kind #, but are represented by pointers. They are boxed, but unpointed types (i.e., they cannot be 'undefined').
      The two categories of array types —[Mutable]Array# and [Mutable]ByteArray#— are containers for unboxed (and unpointed) as well as for boxed and pointed types.  So far, we lacked support for containers for boxed, unpointed types (i.e., containers for the primitive arrays themselves).  This is what the new primtypes provide.
      Containers for boxed, unpointed types are crucial for the efficient implementation of scattered nested arrays, which are central to the new DPH backend library dph-lifted-vseg.  Without such containers, we cannot eliminate all unboxing from the inner loops of traversals processing scattered nested arrays.
  7. 06 Dec, 2011 1 commit
  8. 30 Nov, 2011 1 commit
    • Simon Marlow's avatar
      Further tweaks to the ccs primops · 1fc25dfd
      Simon Marlow authored
       - add getCCSOf# :: a -> State# s -> (# State# s, Addr# #)
         (returns the CCS attached to the supplied object)
       - remove traceCcs# (obsoleted by getCCSOf#)
       - rename getCCCS# to getCurrentCCS#
  9. 29 Nov, 2011 1 commit
  10. 14 Nov, 2011 1 commit
  11. 04 Nov, 2011 1 commit
  12. 03 Oct, 2011 1 commit
    • Ian Lynagh's avatar
      Handle HValues slightly nicer · aff9d690
      Ian Lynagh authored
      We now have addrToAny# rather than addrToHValue#, and both addrToAny#
      and mkApUpd0# return "Any" rather than "a". This makes it a little
      easier to see what's going on, and fixes a warning in ByteCodeLink.
  13. 16 Aug, 2011 1 commit
  14. 28 Jun, 2011 1 commit
    • Simon Marlow's avatar
      Add two new primops: · be544179
      Simon Marlow authored
        seq#   :: a -> State# s -> (# State# s, a #)
        spark# :: a -> State# s -> (# State# s, a #)
      seq# is a version of seq that can be used in a State#-passing
      context.  We will use it to implement Control.Exception.evaluate and
      thus fix #5129.  Also we have plans to use it to fix #5262.
      spark# is to seq# as par is to pseq.  That is, it creates a spark in a
      State#-passing context.  We will use spark# and seq# to implement rpar
      and rseq respectively in an improved implementation of the Eval monad.
  15. 17 Jun, 2011 2 commits
  16. 14 Jun, 2011 1 commit
  17. 13 Jun, 2011 2 commits
  18. 07 Jun, 2011 1 commit
  19. 19 May, 2011 1 commit
  20. 01 Feb, 2011 1 commit
  21. 26 Jan, 2011 1 commit
  22. 24 Jan, 2011 1 commit
    • Simon Marlow's avatar
      Merge in new code generator branch. · 889c084e
      Simon Marlow authored
      This changes the new code generator to make use of the Hoopl package
      for dataflow analysis.  Hoopl is a new boot package, and is maintained
      in a separate upstream git repository (as usual, GHC has its own
      lagging darcs mirror in http://darcs.haskell.org/packages/hoopl).
      During this merge I squashed recent history into one patch.  I tried
      to rebase, but the history had some internal conflicts of its own
      which made rebase extremely confusing, so I gave up. The history I
      squashed was:
        - Update new codegen to work with latest Hoopl
        - Add some notes on new code gen to cmm-notes
        - Enable Hoopl lag package.
        - Add SPJ note to cmm-notes
        - Improve GC calls on new code generator.
      Work in this branch was done by:
         - Milan Straka <fox@ucw.cz>
         - John Dias <dias@cs.tufts.edu>
         - David Terei <davidterei@gmail.com>
      Edward Z. Yang <ezyang@mit.edu> merged in further changes from GHC HEAD
      and fixed a few bugs.
  23. 01 Jan, 2010 1 commit
  24. 17 Dec, 2009 1 commit
    • Simon Marlow's avatar
      Fix #650: use a card table to mark dirty sections of mutable arrays · 0417404f
      Simon Marlow authored
      The card table is an array of bytes, placed directly following the
      actual array data.  This means that array reading is unaffected, but
      array writing needs to read the array size from the header in order to
      find the card table.
      We use a bytemap rather than a bitmap, because updating the card table
      must be multi-thread safe.  Each byte refers to 128 entries of the
      array, but this is tunable by changing the constant
      MUT_ARR_PTRS_CARD_BITS in includes/Constants.h.
  25. 06 Nov, 2009 1 commit
    • Ben.Lippmeier@anu.edu.au's avatar
      * Refactor CLabel.RtsLabel to CLabel.CmmLabel · a02e7f40
      Ben.Lippmeier@anu.edu.au authored
      The type of the CmmLabel ctor is now
        CmmLabel :: PackageId -> FastString -> CmmLabelInfo -> CLabel
       - When you construct a CmmLabel you have to explicitly say what
         package it is in. Many of these will just use rtsPackageId, but
         I've left it this way to remind people not to pretend labels are
         in the RTS package when they're not. 
       - When parsing a Cmm file, labels that are not defined in the 
         current file are assumed to be in the RTS package. 
         Labels imported like
            import label
         are assumed to be in a generic "foreign" package, which is different
         from the current one.
         Labels imported like
            import "package-name" label
         are marked as coming from the named package.
         This last one is needed for the integer-gmp library as we want to
         refer to labels that are not in the same compilation unit, but
         are in the same non-rts package.
         This should help remove the nasty #ifdef __PIC__ stuff from
  26. 18 Oct, 2009 1 commit
  27. 17 Dec, 2008 1 commit
  28. 14 Aug, 2008 1 commit
    • dias@eecs.harvard.edu's avatar
      Merging in the new codegen branch · 176fa33f
      dias@eecs.harvard.edu authored
      This merge does not turn on the new codegen (which only compiles
      a select few programs at this point),
      but it does introduce some changes to the old code generator.
      The high bits:
      1. The Rep Swamp patch is finally here.
         The highlight is that the representation of types at the
         machine level has changed.
         Consequently, this patch contains updates across several back ends.
      2. The new Stg -> Cmm path is here, although it appears to have a
         fair number of bugs lurking.
      3. Many improvements along the CmmCPSZ path, including:
         o stack layout
         o some code for infotables, half of which is right and half wrong
         o proc-point splitting
  29. 03 May, 2008 1 commit
  30. 12 Apr, 2008 1 commit
  31. 29 Mar, 2008 1 commit
  32. 04 Jan, 2008 1 commit
  33. 21 Sep, 2007 1 commit
  34. 07 Sep, 2007 1 commit
    • nr@eecs.harvard.edu's avatar
      a good deal of salutory renaming · fd8d0411
      nr@eecs.harvard.edu authored
      I've renamed a number of type and data constructors within Cmm so that
      the names used in the compiler may more closely reflect the C--
      specification 2.1.  I've done a bit of other renaming as well.
        CmmFormal and CmmActual now bear a CmmKind (which for now is a
                                                    MachHint as before)
        CmmFormals = [CmmFormal] and CmmActuals = [CmmActual]
        suitable changes have been made to both code and nonterminals in the
        Cmm parser (which is as yet untested)
        For reasons I don't understand, parts of the code generator use a
        sequence of 'formal parameters' with no C-- kinds.  For these we now
        have the types
          type CmmFormalWithoutKind   = LocalReg
          type CmmFormalsWithoutKinds = [CmmFormalWithoutKind]
        A great many appearances of (Tau, MachHint) have been simplified to
        the appropriate CmmFormal or CmmActual, though I'm sure there are
        more opportunities.
        Kind and its data constructors are now renamed to
  35. 04 Sep, 2007 1 commit
  36. 03 Sep, 2007 1 commit
  37. 01 Sep, 2007 1 commit
  38. 20 Aug, 2007 1 commit