#6135: Unboxed Booleans -------------------------------+-------------------------------------------- Reporter: benl | Owner: jstolarek Type: feature request | Status: patch Priority: normal | Milestone: 7.8.1 Component: Compiler | Version: 7.4.1 Resolution: | Keywords: Os: Unknown/Multiple | Architecture: Unknown/Multiple Failure: None/Unknown | Difficulty: Unknown Testcase: | Blockedby: Blocking: | Related: #605 -------------------------------+-------------------------------------------- Changes (by jstolarek): * status: new => patch Comment: Patches submitted. Some remarks: * I updated the wiki page. It describes motivation for changes, design decisions (why return Int#) and an example benchmark that shows how new primops can be used to write faster algorithms. * This is my first serious change to the compiler so I think this patch should be carefully reviewed. Most of all, someone with more knowledge than me should probably take a look at functions `isComparisonMachOp` and `maybeInvertComparison` in `cmm/CmmMachOp.hs` and decide whether they are still necessary or not. I think they are, but I am not certain. * I remind that constant folding for Integer works for primop wrappers and not primops themselves. I think it will be much easier to deal with this when it is considered as a separate issue. Ones the patches get accepted I'll fill a ticket for this. * I noticed that the testsuite is not adapted to work with integer- simple library. Running validation with `INTEGER_LIBRARY=integer-simple` results with many tests failing because they have an explicit dependency on integer-gmp package or one of its internal modules. Should I create a ticket for this? -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/6135#comment:55 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler