#6135: Unboxed Booleans -------------------------------+-------------------------------------------- Reporter: benl | Owner: jstolarek Type: feature request | Status: new 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 -------------------------------+-------------------------------------------- Comment(by jstolarek): Performance: I think this patch shouldn't have any impact on performance of existing code. It will however allow to write branchless algorithms that can be faster than their branching counterparts. I'm not sure about the tests in the testsuite - do they allow to measure execution speed? I see only some memory stats. Integers: I'm afraid I don't understand how could I reproduce my problem using HEAD. Integer constant folding rules are built into the compiler and trigger based on function name, so not sure if writing fake primops and wrappers can be considered bug reproduction. I'm missing something, right? -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/6135#comment:54 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler