Ticket #1835: dph.patch

1 patch for repository http://darcs.haskell.org/packages/dph:

Fri Aug  6 13:45:42 CDT 2010  amsay@amsay.net
  * fix for TH's new ClassI

New patches:

[fix for TH's new ClassI
amsay@amsay.net**20100806184542
 Ignore-this: 35a5edd57a5f036c316ab75b6c26c92a
] hunk ./dph-common/Data/Array/Parallel/Lifted/TH/Repr.hs 99
 genPR_methods :: (Name -> [ArgVal] -> Val -> DecQ) -> Q [Dec]
 genPR_methods mk_method
   = do
-      ClassI (ClassD _ _ _ _ decs) <- reify ''PR
+      ClassI (ClassD _ _ _ _ decs) _ <- reify ''PR
       inls <- sequence [inlineD $ mkName $ nameBase name | SigD name _ <- decs]
       defs <- mapM gen [(name, ty) | SigD name ty <- decs]
       return $ inls ++ defs

Context:

[Fix bug in last enumFromToUP patch
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100724092608
 Ignore-this: 119cfce68ef3cb068c48069ce430e623
] 
[Rewrite enumFromToUP to avoid creating join points too early
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100724090227
 Ignore-this: f01189afa600acffd98bf85408b6d8ed
] 
[Remove bang which got in the way of fusion
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100610100954
 Ignore-this: edd06629d17645124a17266f4208361f
] 
[Add bang to avoid triggering LiberateCase
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100610030902
 Ignore-this: 635b798cc3d619e69dc38c3f1d33ea
] 
[Moar inline
benl@ouroborus.net**20100724074755
 Ignore-this: 5d5bc5f5d506e16275ef13794277ded
] 
[Track changes in DPH
benl@ouroborus.net**20100724053309
 Ignore-this: becbd12c980cfbd9cab855a6dac4f426
] 
[Take account of ListT and TupleT in TH.Syntax
simonpj@microsoft.com**20100721150355
 Ignore-this: b4f0f2e623a3598510a8fc886a558f42
] 
[fix a multi-target rule causing failures for 'make -j'
Simon Marlow <marlowsd@gmail.com>**20100715124926
 Ignore-this: 6442989fbcc6427b2c1ac295d238b946
] 
[Remove the -haddock flag from GHC-Options in the Cabal files
Ian Lynagh <igloo@earth.li>**20100710135950
 Ignore-this: e453eb49e18a81d8161f94a16bf6cd90
 We don't know why it was put there before, but can't see a reason for it
 to be there now
] 
[Fix median computation in ListDelaunay
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100611015014
 Ignore-this: 8773286d8cf5a66b277423c7c216536e
] 
[Fix median in delaunay
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100611014055
 Ignore-this: 5804bb076f227ff89a79578a3c8488d1
] 
[Add fast random number generator for vectors, and wibbles to vector quickhull.
benl@ouroborus.net**20100610060610
 Ignore-this: 77459e49683082bd7ad3a299af197299
] 
[Pack each seg in parallel in vector quickhull
benl@ouroborus.net**20100610031805
 Ignore-this: 7e1a4a7e02339c891dccb6f550e373f6
] 
[Use -msse2 for building benchmarks
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609090752
 Ignore-this: d09a1d75843280351fc1da006eb01815
] 
[Add support for preallocation to benchmark driver
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609090652
 Ignore-this: 92f8fcd6736a3c2dbb88e4df0a4ea9ca
] 
[Run the strictness analyser during high-level fusion
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609075424
 Ignore-this: 500eed6ad145229708485641e763aea4
 
 This helps a bit with Quickhull and seems to be a good idea in general. There
 is no way to run the strictness analyser during a phase at the moment, so we
 add another high-level fusion phase and run the strictness analyser after it.
] 
[Prune DPH_FLAGS
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609075158
 Ignore-this: d1667492f14f180eed4c2cec1f65f3f8
 
 CPR doesn't seem to panic on type families any longer so we don't need
 -fcpr-off. We always use {-# UNPACK #-} pragmas so -funbox-strict-fields is
 redundant. I think we needed -funfolding-use-threshold30 for join points but
 they seem to work ok now.
] 
[Add a horribly hackish special-case rule for Quickhull
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609074857
 Ignore-this: 9a8ced66852ef23b702d21b613831423
 
 This allows us to avoid uselessly filtering the data array of packed in the
 lifter version of:
 
 hsplit :: [:Point:] -> [:Point:]
 hsplit ... | lengthP packed == 0 = ...
            | otherwise           = ...
   where
     packed = ...
 
 This is a very common case so we'll have to think of a nicer and more robust
 way of doing this.
] 
[Add a fold_s/replicate -> fold_r rule
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609074815
 Ignore-this: 9ede651a55bfd9213255b300472cd597
] 
[Replace strict pairs by normal lifted pairs in distributed types
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609074417
 Ignore-this: 376fe76366dff3401e052364f8d1f6cb
 
 We use (a,b) instead of (a :*: b) in distributed types now. We will get rid of
 (a :*: b) altogether once we move to vector so this is a change we'd have to
 make anyway but happily, it also helps with performance a bit. In particular,
 it allows us to trigger LiberateCase much less frequently.
] 
[Implement combineUP in terms of combine2UP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100609074305
 Ignore-this: 6e9408ec061447985eff1a1da49bce23
 
 combineUP isn't actually used anywhere, it's just a legacy function for
 hand-flattened code. We'll remove it eventually.
] 
[Introduce a rather baroque caching mechanism for parallel selectors
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100608050959
 Ignore-this: cba4f0754d525177dbbfdc0b842568ff
] 
[Cache distribution information in parallel selectors
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607121911
 Ignore-this: cd7310c018c346d1cbd4604111028958
] 
[Add optimisation rules
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607085200
 Ignore-this: ac6515f618b26c031ae994b5a4894a9b
] 
[Cache distributed segment descriptors
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607082614
 Ignore-this: 9775018aea6e407ce219c43dd00f81df
] 
[Make combine2 work with selectors
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607075714
 Ignore-this: 46305c36664aff6dbb167607e26addc8
] 
[Move selectors to the backend where they belong
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607052707
 Ignore-this: baf0b0b4d28af6b2dda90b1e62407dea
] 
[Fiddle with enum*Each functions
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607041040
 Ignore-this: c57f0f241560fb4f35ac31eb319a297a
] 
[Needs the -rtsopts
benl@ouroborus.net**20100609071854
 Ignore-this: fb21432af40adcd702e962bd706fc29c
] 
[Add vector version of quickhull to Makefile
benl@ouroborus.net**20100609071655
 Ignore-this: a970c5d6a06abbf7f01d923b08f5f94e
] 
[Add parallel vector version of quickhull
benl@ouroborus.net**20100609064546
 Ignore-this: a2914c34074e3a3cbe8b1db98deaa072
] 
[Don't measure time to create input vector in quickhull vector version (duh)
benl@ouroborus.net**20100608084248
 Ignore-this: d0afe59af1605bd7a366ab70b76958b3
] 
[Added Data.Seq version to QuickHull.hs benchmark
Manuel M T Chakravarty <chak@cse.unsw.edu.au>**20100607110533
 Ignore-this: 2ff80d8636535c4c9a82bfbdd0ea692a
] 
[More delaunay optimisations
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607030327
 Ignore-this: 296cabcc3d59be7ed9435c4e06c160f
] 
[Optimise delaunay a bit
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607012542
 Ignore-this: e999f9ec0cb021313072ccb583b08652
] 
[Remove repeatc*
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607011228
 Ignore-this: f2f31e4c667fd7e73fe1529bad19086e
] 
[Optimise vectorised versions of not, (||) and (&&)
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100607010413
 Ignore-this: 30d39b5c0894db22e7f55dd12d0e98d9
] 
[Add indexedP and friends
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604082849
 Ignore-this: 916379beab3e42393636b754eaeb33ea
] 
[Add inline pragmas
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604082833
 Ignore-this: e44096731d2a59092ac7be3b86d52fcd
] 
[Parallel list version using 'par'
Manuel M T Chakravarty <chak@cse.unsw.edu.au>**20100607015943
 Ignore-this: 844de6940859c2d8fbe05510c3ef1cc9
] 
[Start on Vector version of quickhull
benl@ouroborus.net**20100604080244
 Ignore-this: c18e5d0604dc2e4eebb90b88dc007300
] 
[Add benchmarking version of delaunay
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604045414
 Ignore-this: abb8c2ab312c0c2934cc7535816dcf14
] 
[Fix bug in delaunay
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604044850
 Ignore-this: b4a3a4352144c9d086ecfc0a09d1f79c
] 
[Add missing files and svg generation to list delaunay
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604020413
 Ignore-this: 6b8b136a5859887fbbdbc376cac5d3e0
] 
[First attempt at Delaunay triangulation (doesn't work correctly yet)
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005957
 Ignore-this: 3f293f2b1ec624ebf589d469f518c2a0
] 
[Add updateP and bpermuteP to the prelude
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005642
 Ignore-this: 774dccbcb8fe9407c5a95a530ed04419
] 
[Add updatePA and bpermutePA
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005632
 Ignore-this: ce947e6b7fcdea877b0c37d792470d1d
] 
[Add updatePR and friends
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005613
 Ignore-this: a9fc3831f3b679c694afd8edc5398f47
] 
[Optimise bpermutePR<PArray a> slightly
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005549
 Ignore-this: 7945acabf55dcd75dbd16c3ce769ff00
] 
[Fix strictness bug in replicateUP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005435
 Ignore-this: d230e36d41a37a9309d3b59b0e03407b
] 
[Add traces
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005405
 Ignore-this: b63a6a3fa39924c61664166ef9b9257
] 
[Implement slicePA_l
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604005318
 Ignore-this: da7f8a104a89dade3103a90f324ced4b
] 
[Fix bad bug in replicatePA_l
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604004842
 Ignore-this: cb9afecdd88e372cc28dfd71493bff8a
] 
[Add interleave{U|UP}
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604004647
 Ignore-this: d59c0898b920ca7568c6ab903a19b80f
] 
[Fiddle with tracing functions
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100604004633
 Ignore-this: 9356535eb00beb19c8249379b660121
] 
[Wibbles to C quickhull for Solaris
benl@ouroborus.net**20100603081658] 
[Add C version of quickhull
benl@ouroborus.net**20100603064530
 Ignore-this: a79f4930d69acc37cd6f0a25ab4c4b1f
] 
[Add some optimisation rules
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100601040824
 Ignore-this: 35e119ad0cf4327b145d98e26f2754cf
] 
[Add seq rules
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100601040737
 Ignore-this: 5eba7dd5cc8ec1d83cbc21b2445ef572
] 
[Add support for loading data from file to SVG QH
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102823
 Ignore-this: 6ec85062983415f86cc38a77c864d803
] 
[Fix test data generation for QH
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102759
 Ignore-this: 301137ef4da8e8859cdc19a4b2b0802
] 
[Add tracing support to TH generators
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102730
 Ignore-this: d6bbbaef3da7ca2e5f3b6b770cf82c66
] 
[Add a couple of traceFn
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102713
 Ignore-this: 54178ff6f4a7e55af390968e6d573cf7
] 
[Remove dead code
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102707
 Ignore-this: 938dd9a6a4098fcf8d4befb6c385941e
] 
[Fix applPR<PArray a>
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102650
 Ignore-this: 5837b3214cdd9b0e4b25bb3dfa3e69c
] 
[Add plusSegd
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102158
 Ignore-this: c86013c609fed7a36fe9c7b61bf4739b
] 
[Fix bug in bpermutePR<PArray a>
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531102058
 Ignore-this: ca480eb2274f1821ce2053c33da42f6
] 
[Add import
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531101912
 Ignore-this: 92d1c2558ee9d130b0cbcd1210f2f6dd
] 
[Derive Show for EitherS and MaybeS
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531101853
 Ignore-this: 38b1f8a2832290e5c26fea4cf30dd141
] 
[Test data generator for Quickhull
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100531030422
 Ignore-this: b1d0859102f10f605aaa669fa5a8047c
] 
[Slight optimisation in Quickhull
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527125017
 Ignore-this: 878607663b66ff6cf4ca4132d957ef66
] 
[Add rule for zipWith/replicate
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527113906
 Ignore-this: 288797d56cd021aab644321d68a29b93
] 
[Use -rtsopts when building test cases
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527090500
 Ignore-this: 4b12e9cdac3bc68d0a8d5ebd3fbc4957
] 
[Add a seq/sum rule
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527090449
 Ignore-this: 65262e8a3276e85f42e61bfac3904122
] 
[Fix strictness of various Lifted combinators
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527090425
 Ignore-this: b8202211abbf70b5172f1432405169c4
] 
[Remove unneeded parameters from indices_s
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527090348
 Ignore-this: 94c4787875cceec625194f55cbde113f
] 
[lengthsToSegd is no longer special
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527090308
 Ignore-this: ea25a030a950817b9c914da83df8512f
] 
[Sanitise zipU and unzipU
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527090040
 Ignore-this: 9a2ce34cb5ec4ab8ea7bd733ea754f93
 
   * unzipU now return a lazy pair instead of a strict one
 
   * There is an unzipU/zipU rule
 
   * zip3, zipWith3 and unzip3 are defined in DPH_Interface
] 
[Make packPA_l strict
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100527013343
 Ignore-this: 936a27213fe2d5a2d78305c5ef4212a
] 
[Fix load balancing issue with indices_s
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100526142534
 Ignore-this: 14ed7efd6f424bc278b6d394f677307f
] 
[Fix load balancing bug in segmented sums
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100526045732
 Ignore-this: 3c9a7c5503a6873ad83a3a9b457e5423
] 
[Add exports
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100526045730
 Ignore-this: 323c60203a8fbaf52838671398800c52
] 
[Add debugging function
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100526045241
 Ignore-this: d2ba0c5dc44ddaac5ca9a0c7f736d158
] 
[Rewrite test data generation in quickhull
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520033311
 Ignore-this: 27e4d3550ec5a325b2bcb43e2671c29b
] 
[Add a seq rule for scanlU (+) 0
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520033212
 Ignore-this: e88e2b5fc5e20e86f6d83104a160dce2
 
 This occurs quite frequently when calculating segment descriptors.
 Nevertheless, it is a hack.
] 
[Implement parallel lifted append
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520033109
 Ignore-this: 498daad20956c9ced333b5bfb2ee8b7
 
 This requires append_s and friends to take the segment descriptor of the
 result as an additional parameter. This change is also propagated to the
 Lifted stuff.
] 
[Implement fold1SUP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520033007
 Ignore-this: 1756f4381b6150b9b0e10ea805db9045
] 
[Make replicateSUP produce evenly distributed arrays
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032855
 Ignore-this: b6b59080fad8d2c26f7ea9d0e5481b57
] 
[Make enumFromStepLenUP more efficient
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032736
 Ignore-this: e2a79caa4610271804a8c188c13d64
] 
[Make foldUP more efficient at the cost of a slight change in semantics
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032504
 Ignore-this: 28d99d4dc1e3a91dbb947779de83c52
 
 We now make no guarantees about how often the neutral element will be used. It
 really has to be neutral.
] 
[Fix implementation of repeat_c
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032332
 Ignore-this: 5eb7b3b8478aed749636cef37591c130
] 
[Add a function for splitting a segment descriptor such that the data array will be evenly distributed
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032231
 Ignore-this: fef8b549c46c64ed37dc79578ab94184
] 
[Add export
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032216
 Ignore-this: d5cd228f9ba3bc50647b1a8c85710b30
] 
[Change various functions to use generateD/imapD
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520032036
 Ignore-this: a5d19040c329fd3577443888be08d819
] 
[Delay inlining unitD
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031941
 Ignore-this: 799c25103f3e947e2684a9c0515b57fe
] 
[Only inline zipD in phase 0 to give some rules a chance to match in phase 1
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031857
 Ignore-this: 8ef822b396aa22b9a300bd337b401f77
] 
[New combinators in DistST
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031820
 Ignore-this: b1f96a3bd9d42becf3b908fb325b782c
] 
[Add RULES for zipU/joinD and zipU/splitJoinD
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031627
 Ignore-this: 288ba16337bba307312fad390f1f593b
] 
[Completely change how mapD and friends are implemented
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031229
 Ignore-this: a4f65f5b0a89aeda43e43556ea1b6ccf
 
 The basic combinators are now
 
 generateD :: DT a => Gang -> (Int -> a) -> Dist a
 imapD :: (DT a, DT b) => Gang -> (Int -> a -> b) -> Dist a -> Dist b
 
 The Int argument is the index of the current thread. There is also
 
 generateD_cheap :: DT a => Gang -> (Int -> a) -> Dist a
 
 which is equivalent to generateD but just runs the computation sequentially.
] 
[Don't inline scanD
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031156
 Ignore-this: 783981ef0091002230c6f1768904d302
] 
[Make joinD CONLIKE
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520031029
 Ignore-this: 60b0377193574586a05c6540d6a44867
] 
[Manually eta-expand mapUP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030910
 Ignore-this: 1b8dcb9c5574fa8e8629c0a7e68db63c
] 
[Fix and use enumFromToEachUP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030805
 Ignore-this: 8e0f34bcbfb94d0be5aab19f0f06ded9
] 
[Export more stuff
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030641
 Ignore-this: 8f31ba50b3a3fadc280820e575f6e4e1
] 
[Add dependency
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030617
 Ignore-this: f233a2c849cf4f12598cf798d940ee71
] 
[Tracing for gangs
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030522
 Ignore-this: fff051a02b1703b961a0406bf5aaec42
] 
[Add tracing facilities to Dist
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030420
 Ignore-this: 356d1f2d3adbc02e5f53a9e2e7e5fb49
] 
[Use divInt, modInt etc.
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100520030118
 Ignore-this: 35b1d6929ba08e9489d815c723b944ac
] 
[Refactoring to avoid making splitJoinD a loop breaker
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100506101316
 Ignore-this: 10a3598c1283fe9b1b0baaaadb817456
] 
[Add bangs
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100506101112
 Ignore-this: 710e9c655b5d74cf8b8ab2b6ee05e89a
] 
[Remove sequential gangs
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329091103
 Ignore-this: 4963509259f6e3faf1cfe5bca29174fd
] 
[Build system: Fix use of "rm" variables
Ian Lynagh <igloo@earth.li>**20100508190442] 
[Add fftS to harness
benl@ouroborus.net**20100401114324
 Ignore-this: d5f4623e2088889830f507ba1a20284
] 
[Fix bugs in FFT benchmark
benl@ouroborus.net**20100401111846
 Ignore-this: c23095e3ebe421fa1830e4a572d90325
 
 You can also now say 
    seq/fft check
 
   and it will do a 1d transform of a step function,
   with both the FFT kernel and a DFT. 
] 
[Print checksums of resulting matrices in mmult examples
benl@ouroborus.net**20100401054701
 Ignore-this: c5bdd3e2b172c9b5d865e18e685dda54
] 
[Add to mmult C harness
benl@ouroborus.net**20100401041910
 Ignore-this: 4256f3b6e69322314093c5574241bebb
 You can generate random matrices with -random, then save them
 to file with -ddumpinput. Load them back up with the Haskell
 version and check the output is the same.
] 
[Hacks to C mmult
benl@ouroborus.net**20100401023501
 Ignore-this: bb57e9b7743d1bf3bb13f35b86195ac8
] 
[Faster generation of random matrices for mmult
benl@ouroborus.net**20100401020601
 Ignore-this: fedc04ef2cd513c269a42b111ded039e
] 
[Start on C ver of mmult
benl@ouroborus.net**20100401020117
 Ignore-this: 246ab7e37b5f9af789c95b3fd5fe0790
] 
[Split useful stuff out of C version of Laplace, and add to Makefile
benl@ouroborus.net**20100401012135
 Ignore-this: dca4454dc55aac292578d9e0cd5524bf
] 
[Add DArray versions of mmult
benl@ouroborus.net**20100401010209
 Ignore-this: 3920c035c2cd94c3763b45bd052b9471
] 
[Add version of mmMult using traverse
benl@ouroborus.net**20100401004314
 Ignore-this: 8910ad07bd5b8dd1a2381560ae350a7
] 
[Add to mmult harness
benl@ouroborus.net**20100401003102
 Ignore-this: 5c66680f99cc8cbb0215c584a84a0642
] 
[More fft
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331115020
 Ignore-this: 33708bbfb8cb1ef5e3d476913f6856e6
] 
[Added Any, test for fft
keller@cse.unsw.edu.au**20100331114358
 Ignore-this: 89c55ea6722b1e04ed0c10b0b36f03e5
] 
[Add to mmult harness, it'll read matrices from file but not write them back yet
benl@ouroborus.net**20100331105056
 Ignore-this: f7c7b03c35f25aadef1eea1243403528
] 
[CArray version of fft
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331102615
 Ignore-this: 426ce80b8aefbf06ac2368ce12d013e3
] 
[More CArray ops
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331102552
 Ignore-this: fe00b3afa18cabdd3e85e7aaaca40b14
] 
[Add a couple of CArray ops
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331100011
 Ignore-this: 67270a0d27112f1d33073a7a0d9d6679
] 
[Start on CArray mmult harness
benl@ouroborus.net**20100331085817
 Ignore-this: 1ea3995dbfae8b6774e4834f92937e23
] 
['port across more stuff from DArray into CArray
benl@ouroborus.net**20100331085530
 Ignore-this: b7bc5c68429ca81f4f87d4eb90b42057
] 
[Add replicateSlice
benl@ouroborus.net**20100331073634
 Ignore-this: 4c296dc59ba51973c59a3be162472f41
] 
[Add transpose and backpermute
benl@ouroborus.net**20100331073049
 Ignore-this: 3afc1b5af2f9f63f1fa3851f12678d88
] 
[Cleanup and nicer version of traverseCArray
benl@ouroborus.net**20100331072637
 Ignore-this: 7ab5e747fd4628f3565601a54b9d54c9
] 
[Fix traverseCArray
benl@ouroborus.net**20100331063841
 Ignore-this: bbee180c2dd50459d65e062c85fd9fc4
] 
[Hacks to SolveCArray (makes it slower, not finished)
benl@ouroborus.net**20100331062238
 Ignore-this: 91ded97981c918bbfd47e6564a381536
] 
[Moving to Slice def of paper
keller@cse.unsw.edu.au**20100331050927
 Ignore-this: 31a58e367d4eb91508424e5b5b2a0cba
] 
[Changing over to Slice type family from Index
keller@cse.unsw.edu.au**20100331040756
 Ignore-this: 3a107e50fd1a1ee794712e59c8925095
] 
[Add benchmarking code to C laplace solver
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331034942
 Ignore-this: bb02f3c49a079d34fbb6344a90e86474
] 
[Changed DArray, ArrayExamples, DArrayExamples to work with new shape type
keller@cse.unsw.edu.au**20100331030850
 Ignore-this: 86765616a16574862cad289b0eca5716
] 
[Use Int indexing instead of (Int, Int) in IOUArray version of Laplace benchmark
benl@ouroborus.net**20100331030021
 Ignore-this: 56637da63ec3b24119edf2f09af01965
 Makes it go about 2x faster.
] 
[Output compute time in laplace
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331014233
 Ignore-this: f3335aeedc446875321dfebe55716f13
] 
[Add deepSeqArray
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100331014220
 Ignore-this: 2f97016b12cf874ad6e63e3610431b49
] 
[formatting only
benl@ouroborus.net**20100330093458
 Ignore-this: 7f9ad629db498ae1a102d499a9804a4f
] 
[Add first cut version of Laplace solver using IOUArrays
benl@ouroborus.net**20100330070409
 Ignore-this: 86689321be2307a7f9a78adae1d81386
 It's about 3x slower than carrays atm, but I'm still working on it...
] 
[wibble to traverseCArray
benl@ouroborus.net**20100330040350
 Ignore-this: dd9d10f64782192ab1f8f082c2605a36
] 
[Add traverseCArray and use it in Laplace benchmark
benl@ouroborus.net**20100330034235
 Ignore-this: 5e60afd64015d1368bbb70551f616817
] 
[Add more laplace example data
benl@ouroborus.net**20100330023410
 Ignore-this: a54053da470b6b4ff100af1985df661b
] 
[Refactor C version of Laplace benchmark to allow non-square matrices
benl@ouroborus.net**20100329233732
 Ignore-this: 413717d26b68be2d538eb28bc278540f
] 
[Make Haskell version of Laplace benchmark take PPM file of boundary conditions
benl@ouroborus.net**20100329075017
 Ignore-this: c86f8aedcf93ae41bb223565030d0827
 
 New cmd line usage is like:
   laplace carray-stencil 10000 examples/laplace/data/pls-100x100.ppm out.ppm
 
 More example data is in regularArrays/examples/laplace/data
] 
[Refactor laplace solvers slightly
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329050620
 Ignore-this: 79bf60d804a73c62934e976844905183
] 
[Fix strictness of various functions in CArray
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329045057
 Ignore-this: 66ac2774b5b34dc00e35437cdc08f2c5
] 
[Save one remInt in fromIndex
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329045038
 Ignore-this: ce4f536d76d3bca3a4cd43a29b99c0be
] 
[seq/deepSeq stuff when constructing DArrays
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329040837
 Ignore-this: f0d164d6404cde1493f31f15cc252a6c
] 
[Give deepSeq a fixity
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329040823
 Ignore-this: ec74bc3a12d80e438920aad551ebe2fd
] 
[Fix typo
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329040214
 Ignore-this: cda74c593820ad124cbf275a00270954
] 
[Change shapes to use (.:) instead of (:*:)
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329031307
 Ignore-this: 5078841cec86654108161556915eaf2
] 
[Remove superclass constraints on Shape
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329025622
 Ignore-this: 9ddd70fa7aedb93bd2954d876abb22f7
] 
[Get rid of range
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329025149
 Ignore-this: c8a077c226dca6113b773f8c4fa355a4
] 
[Add deepSeq on Ranges
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329025137
 Ignore-this: 5e7c7388e5f19c7187595735489baad4
] 
[Use quotRemInt instead of divMod
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329023646
 Ignore-this: 4a32242ae06f562e25fd75c3dc5a28f2
] 
[Use regular folds
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100329023600
 Ignore-this: c5e35008ce3a30b91277eddb2ebc9cde
] 
[Add replicate_rs/replicate rule
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100302125335
 Ignore-this: c7e43a6b8eb32c549812b76c0172af24
] 
[Modify and export regular folds
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100302125248
 Ignore-this: d08eb16da95eab86295bfb838b5d330c
] 
[Add comments to SolveDArray
benl@ouroborus.net**20100326062422
 Ignore-this: 1adcd2792d90b9f3e013c1744884ba42
 Converting back and forth between DArray and Array allows
 the indexing function that reads the forced data at the start of 
 each iteration to be fused with the stencil function. 
 
 This achieves the same thing as CArray, but by using two
 different array types instead of an Either.
] 
[Cleanup and add more inline pragmas
benl@ouroborus.net**20100326051908
 Ignore-this: 111ae593b57d1b186c5095439510005e
] 
[Add Laplace benchmark to Makefile
benl@ouroborus.net**20100326043934
 Ignore-this: a51d3d8a613331977b00dcdfc1b0c443
] 
[Add version of CArray that uses a flat unboxed DIM type
benl@ouroborus.net**20100326040408
 Ignore-this: 837b7ffadda49ef3a3146ca0b15b8445
] 
[Add support for default to sequential execution if the gang is busy
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100325111057
 Ignore-this: ee508be96783a4e557ed829c4ac29adc
 
 To enable, uncomment the #define SEQ_IF_GANG_BUSY line in Gang.hs. Let's see
 if this works out before making it more convenient.
] 
[Fix comment
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100325110031
 Ignore-this: 36f3ddf2f7e8089c25b89151542d043
] 
[Change Gang representation slightly
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20100325110007
 Ignore-this: feda29fe618595236648994786207a12
] 
[Inline forcing function makes CArray about 40% faster than DArray for Laplace benchmark
benl@ouroborus.net**20100325231409
 Ignore-this: db682a96080f22544881216205992cf6
] 
[Start on Cached Array (CArray) version of Laplace example
benl@ouroborus.net**20100325065819
 Ignore-this: 9ef78479283cd8507a71f217a33c3cb7
] 
[Add boundary conditions back to specialised version
benl@ouroborus.net**20100325043932
 Ignore-this: ece952d3d0b3190a817cdb5a80f6acae
] 
[Add a version of Laplace with a specialised solver loop
benl@ouroborus.net**20100325040116
 Ignore-this: 39b526c16990e9ca22232d1705d37cbf
] 
[Formatting only
benl@ouroborus.net**20100325015116
 Ignore-this: d9db1353bc1afcdbdbbd956eaaa6c85c
] 
[Added proper impl of relaxMS
keller@cse.unsw.edu.au**20100325024252
 Ignore-this: 750c5985d3bb1d67812787d02531075e
] 
[Add DArray stencil version of Laplace example
benl@ouroborus.net**20100325014915
 Ignore-this: 924c9b200e86c3df460a20868f2d9cb3
] 
[Fix bugs in existing relaxation fns. ((/) 5) /= (/ 5)
benl@ouroborus.net**20100325004157
 Ignore-this: c90603933c822bc9bd8da2b87ab5e1e5
] 
[Add array-backpermute version to Laplace example
benl@ouroborus.net**20100325003910
 Ignore-this: 3a6903677782ffab695d720d2204a385
] 
[Make C and Haskell versions of Laplace example behave the same way, and give same result.
benl@ouroborus.net**20100324233224
 Ignore-this: 46ab573eda54cc7ff347d1437407e97b
] 
[Cleanup Laplace examples, and make them take the same cmd line args.
benl@ouroborus.net**20100324231021
 Ignore-this: cbd5d971e7b84b92162d3d10c229c37
] 
[Add C version of Laplace benchmark
benl@ouroborus.net**20100324075353
 Ignore-this: 485c6560a04f3fdf114b072d529013d6
] 
[Add DArray version of laplace solver
benl@ouroborus.net**20100324065749
 Ignore-this: 5a6f87085148a3c4ef80140510398f2a
] 
[Split out solver into its own module
benl@ouroborus.net**20100324062842
 Ignore-this: 7a08b57be9eea55aca3982b5b593987
] 
[Make laplace example take cmd line args, and don't use lists in PPM output.
benl@ouroborus.net**20100324060650
 Ignore-this: f985a88f31517d6cd7df097064d522b6
] 
[Add example solver for the Laplace equation
benl@ouroborus.net**20100324051729
 Ignore-this: cb782254639e65ba6f22c98d47a02f6f
] 
[Add words benchmark to Makefile
benl@ouroborus.net**20100324043403
 Ignore-this: e35fe4c65bf7a028dddf66286ec0ac06
] 
[Comment wibble
benl@ouroborus.net**20100316032138
 Ignore-this: 8719649c1fb8f1b5764c5e6c7a84db5d
] 
[Add helpful error messages
benl@ouroborus.net**20100316031259
 Ignore-this: 48920b021c6e60f2100bdf9f2daa66c9
 If fromPArrayP, toPArrayP and fromNestedPArrayP appears in non-vectorised
 code then say that's not possible, instead of just calling undefined. 
] 
[Add sliceP combinator
benl@ouroborus.net**20100316031240
 Ignore-this: 5072fc7fea42e1158028b3034bc2b60b
] 
[Comments only
benl@ouroborus.net**20100316031125
 Ignore-this: 5a2a052fff2397bd4544fd14260833eb
] 
[Comments only
benl@ouroborus.net**20100311044326
 Ignore-this: cf747e29995648e2bb0bdc401402a19e
] 
[Removed changes to circumvent core lint error (seems fixed in curr comp version)
keller@cse.unsw.edu.au**20100304015818
 Ignore-this: a0193f219a316d53c96aad608cb6fe39
] 
[Cleanup
keller@cse.unsw.edu.au**20100304012041
 Ignore-this: 444c456771942affc816d1da82186f88
] 
[Added snd FFT algorithm
keller@cse.unsw.edu.au**20100202034424
 Ignore-this: c83b5320e37064ab1a7102a88965c12f
] 
[Tested & Imporved examples
keller@cse.unsw.edu.au**20100201032008
 Ignore-this: 5d61494e203769ef36b324859d2ece44
] 
[Cleaned up code for reglib
keller@cse.unsw.edu.au**20100112012848
 Ignore-this: 459439da1535a045c454d8b80d2fc960
] 
[Fix warnings
benl@ouroborus.net**20100225015725] 
[Add version of quickhull that prints an SVG of the computed hull
benl@ouroborus.net**20100224063443
 Ignore-this: 174993a23be813c11f8d13d7551912e
] 
[Add missing export for 'toList'
benl@ouroborus.net**20100224052949
 Ignore-this: 5c128034b1d90f0b11092240d2c528
] 
[Fix typo in Makefile
Ben.Lippmeier@anu.edu.au**20100215060948] 
[Add GHC.Exts.traceEvent to delimit benchmark payload
Manuel M T Chakravarty <chak@cse.unsw.edu.au>**20100215030640
 Ignore-this: e416f76f0750e14b5797b19c08150e7a
] 
[add dependencies on the dph-prim GHCi lib for modules with TH/annotations
Simon Marlow <marlowsd@gmail.com>**20100103231102
 Ignore-this: 551dd8ff2bec4058120d6b34657229cb
 fixes failure with make -j
] 
[Remove packPR and friends
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091112070825
 Ignore-this: c91c8b3437a2f602a7f5bb59659aca3a
 
 We use packByTagPR instead
] 
[Fix a race in the build system
Ian Lynagh <igloo@earth.li>**20091119001415
 We could try to build
     Data/Array/Parallel/Lifted/Repr.dyn_o
 before
     Data/Array/Parallel/Lifted/TH/Repr.o
 is built, leading to a failure when trying to load the latter in order
 to run a TH splice.
] 
[Add seq rule for count
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091110150740
 Ignore-this: c3a2486033f7a6064cf0a6cb2a5d4caa
] 
[Move lengthsToSegd to the common interface file
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091110150715
 Ignore-this: 92829cacf1fe243b169235310efc74c9
] 
[Better handling of selectors
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091110150654
 Ignore-this: be5666dd6f64ef2449948d7c4c9323fb
] 
[Delete dead code
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091110150639
 Ignore-this: 47cc7893959e7b2799de20016258e644
] 
[Refactoring
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091110150345
 Ignore-this: ec7c2859ac7109b1deed6084038e579b
] 
[Add appBU
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091110145726
 Ignore-this: a8e291812e6dd27bdecb3b35a9c80a23
] 
[Use combine2ByTag instead of combine2
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109145345
 Ignore-this: f03031a30926a40cc9a4d1c7d6911edc
] 
[Add combine2ByTagUP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109145337
 Ignore-this: d4b842c282dee007a9617e57d2662293
] 
[Export combine2ByTag from backends
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109144119
 Ignore-this: c816541c3ffc78b0c5a052b28b45f9c5
] 
[Merge Prim with Scalar
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109131705
 Ignore-this: 7df2708a215e9f35789d9cd1857e85d2
] 
[Use TH to generate instance PR (Wrap a)
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109124422
 Ignore-this: acc9a1f40a99e6b2a1248669552bfe11
] 
[Use TH to generate instance PR ()
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109121211
 Ignore-this: 370a6880ef13fd48b3d59b2f53a418b6
] 
[Use TH to generate instance PR Void
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109115501
 Ignore-this: cd94f49d7d09b93da060ac37a9ee8337
] 
[Use TH to generate PR instances for tuples and primitive types
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109114425
 Ignore-this: 88f5e0293108126ebe006b8b73d9dd6e
 
 We now derive the implementation of every PR method from that method's type.
] 
[Class of primitive types with conversions PData a <-> UArr a
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109114141
 Ignore-this: 3a4f2faeea5a85e70dcbeef27803b265
] 
[Use TH to generate PR instances for tuples
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091106035255
 Ignore-this: bd68310e7d0ede9b8c18a35850a00571
] 
[Another module for Gabi
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109025123
 Ignore-this: e74e6c32f40accddd5df4554705843ee
] 
[Add hacky module for Gabi
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091109024833
 Ignore-this: e7c1e0ece9408b02248a27517245a77e
] 
[REDO: Annotation PData and PArray with NoSpecConstr
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091104115250
 Ignore-this: 7350462330f95139b3ab708c124f22e1
] 
[Make sure the build system picks up changes in dph-common.cabal
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091104012417
 Ignore-this: ee5d7e59b872472838bbb0f540d35af6
] 
[Don't define certain targets if we are cleaning
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091104005705
 Ignore-this: 7921dc27b27ba566bb766bf6f5671fea
] 
[Remove Makefile
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091104004921
 Ignore-this: 72beb7c2ab25e692fb571cfdbe9d34b
 
 This was an old file I forgot to remove, we have GNUMakefile instead.
] 
[Make fromBool and toBool monomorphic
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091102130032
 Ignore-this: 6ef4adc98548a2247bcb65dd3fa2fd0a
 
 They weren't getting inlined otherwise. Big performance ouch: this change
 makes sequential Quickhull about 30% faster.
] 
[Fiddle with strictness and reboxing
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091102125823
 Ignore-this: 5eaca6eba6d073876c0228afc1d0562
 
 This speeds up Quickhull by quite a bit
] 
[Move tracing functions from dph-common to dph-base
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091102125709
 Ignore-this: d4c14d1bc9744d053683662b107244a0
] 
[UNDO: Annotation PData and PArray with NoSpecConstr
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091030122015
 Ignore-this: 387e94c18a74a56767a23bdd8e718641
 
 I didn't mean to push this.
 
 rolling back:
 
 Fri Oct 30 11:13:16 EST 2009  Roman Leshchinskiy <rl@cse.unsw.edu.au>
   * Annotation PData and PArray with NoSpecConstr
 
     M ./dph-common/Data/Array/Parallel/Lifted/PArray.hs +3
     M ./dph-common/dph-common.cabal -1 +1
] 
[Annotation PData and PArray with NoSpecConstr
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091030001316
 Ignore-this: aab24cb629461b738d30f5328c81824
] 
[Use comprehensions but no new types in Quickhull
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091030014719
 Ignore-this: 76a11f5d5aa0c4d1a906fee18db44ce2
] 
[Add combine2ByTagU
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091029134950
 Ignore-this: c79264cf11711d3f66aa98adfd51a780
] 
[Trace all stream-based loops
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091029134356
 Ignore-this: a80c372f14b4ef0394aa7629df3d25c8
 
 We extend the stream data type with an additional String which says how the
 stream was produced:
 
   data Stream a = forall s. Stream ... String
 
 Now, whenever we create or transform a stream we record the function that did
 it:
 
   replicateS n x = Stream ... (sNoArgs "replicateS")
   mapS f (Stream ... c) = Stream ... ("mapS" `sArgs` c)
 
 Real loops that actually consume streams pass this string to dtrace. The
 somewhat funny sNoArgs/sArgs setup is because I want to use ByteStrings
 instead of Strings eventually and hope that GHC will be able to just create
 big string literals instead of concatenating lots of small ones.
] 
[Add dtrace lib
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091029134249
 Ignore-this: 23db7d80d1bb4a7c7d8b4fa71689782a
] 
[Add experimental support for dtrace-based profiling
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091029132913
 Ignore-this: e181d0b68515ae777541818bfcc25167
 
 This is rather hackish at the moment but here is how it works (on OS X only).
 We manually build libdph-trace.dylib, manually edit Extra-Lib-Dirs in
 dph-base.cabal to point to it, manually turn on the DTrace flag and rebuild
 DPH from scratch (as in rm */dist-install; make stage=2). Then, we build an
 example and run it as follows:
 
   sudo dtrace -c './seq/quickhull 100000' -s loop-profile.d
 
 This should produce a table which shows how much time is spent in which loops.
] 
[Evaluate tags in interface def
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091029001339
 Ignore-this: 2264848e7a55024cdf508d48f2a9d662
] 
[More tracing
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091029001254
 Ignore-this: b8179fb5c291d2384aa5b4b6472dc327
] 
[Fix bug in enumFromStepLenEachUP
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091028100020
 Ignore-this: e2509c652e31db729edf239006beffc8
] 
[Make lengthsToSegd CONLIKE for now
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091021020244
 Ignore-this: 3bf3adcfd94f697267960ac8539772f5
] 
[Add imports
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091021020227
 Ignore-this: a3390275cd94636fd1dae668e9e16f7
] 
[Add count_s
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091021020144
 Ignore-this: d5c06e295bfe5f4b718377230a11d8dd
] 
[Fiddle with inline phases
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091021020115
 Ignore-this: 83b85df26b66e457bb79306372d84c39
] 
[Add and use packByTag
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091021015927
 Ignore-this: f5b2e5e022fb8a7f38f8800786a987d0
] 
[Add INLINE pragma
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091020124906
 Ignore-this: ee7d8f4c569cb1f20a97faa0863ece82
] 
[Small optimisation
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091016025945
 Ignore-this: 89c60ec37742613b0946cf2986f709a1
] 
[Add some NOINLINE pragmas
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091016025207
 Ignore-this: 26d2fd0d48ec01108ee2bf494f573abf
] 
[Fix nasty bug in selector replication
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091016024510
 Ignore-this: fd0a03f7df97f450492bfcc51f8dedb
] 
[Move code and clean up
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091015055456
 Ignore-this: c33d837895709ce831b63673d6b7e375
] 
[Make PA and PR type classes instead of records
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091015030407
 Ignore-this: c926b32827ef987bf8935634f99d9041
 
 This is a big change in preparation for Simon's inline patch.
] 
[Use -dcore-lint when building examples
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20091015030344
 Ignore-this: 73bebf06860cb5600b9e6e5a3933294d
] 
[Added SAC examples
keller@cse.unsw.edu.au**20091013092832
 Ignore-this: e375b72f3b4528fafdc9bdbfb2524bbe
] 
[Turn off reboxing hack
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821053213
 Ignore-this: 2e9beb49d88a713c0465a7c3226503be
 
 It seems to expose a bug in the new inliner which I have to investigate. I
 suspect the hack isn't needed any more since SpecConstr has got significantly
 smarter since I implemented it.
] 
[Make sure GHC can figure out strictness of replicateSU
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821053154
 Ignore-this: ec85af7db4e44499c2d0e605339dee8b
] 
[Fix bug in reboxing code
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821052958
 Ignore-this: 3fde53f83574090c22593cac051fc13e
] 
[Add repeat/enumFromStepLen fusion rule
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821052538
 Ignore-this: a881c87ad32aeb09593e6e95bdfe8125
] 
[Fix strictness
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821052509
 Ignore-this: 86d636fc7040d6040e99c2c2a461350
] 
[Fix strictness of bpermuteUS
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821051629
 Ignore-this: 250b0b8b7aa585bc02d5a42401ad9410
] 
[Add regular segmented replicate
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090821024638
 Ignore-this: a1c917d35d7ec838296f779bfd1ece53
] 
[Fix "Cabal check" warnings
Ian Lynagh <igloo@earth.li>**20090811215901] 
[Added dummy module (Foo.hs) to circumvent buildsys problem
keller@cse.unsw.edu.au**20090811044615
 Ignore-this: 8aa7a31a6c1784db125e431e3180d89a
] 
[Fixed dependencies in makefile
keller@cse.unsw.edu.au**20090811044257
 Ignore-this: 615aa132febc0c08a29952181640ba58
] 
[Fixed hierarchical matrices
keller@cse.unsw.edu.au**20090811043349
 Ignore-this: da1d4665e09b5000670cde9baf09fda
] 
[Hierarchical array multiplication
keller@cse.unsw.edu.au**20090730031132
 Ignore-this: 612778dccfec36abe97626164a3d8012
] 
[Added delayed array evaluation
keller@cse.unsw.edu.au**20090730031051
 Ignore-this: 5abb7f95e492ffcce84b86ad5293fde
] 
[Generation of test values outside of benchmakr
keller@cse.unsw.edu.au**20090721055449
 Ignore-this: 909d3525aeac2499c3eed8de54a2c417
] 
[Added missing test file for regular arrays
keller@cse.unsw.edu.au**20090721045125
 Ignore-this: f13653e8df6cedd790e44ce15fc11c76
] 
[Added regular array operations & examples
keller@cse.unsw.edu.au**20090721012005
 Ignore-this: 5b7dd122773cf9e2c3a9df1e694f4963
] 
[Fix dotp and smvm
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090720044406
 Ignore-this: a949a03d42cdde21b6b21bc00ba880e5
] 
[Added default backpermute
keller@cse.unsw.edu.au**20090719112306
 Ignore-this: bbb50aef74759425a70135a4eb860d17
] 
[Add missing file
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090713044642
 Ignore-this: caf259867a8c209f830bb1e6137bf477
] 
[Separate length from data in array representation
Roman Leshchinskiy <rl@cse.unsw.edu.au>**20090713044435
 Ignore-this: fedf53fbfbcf9674dc2ccde262eb1579
] 
[TAG 2009-06-25
Ian Lynagh <igloo@earth.li>**20090625160239] 
Patch bundle hash:
2829a230713e99f0a471df70d276332b3eaf3490