July 2014 - ghc-tickets

Re: [GHC] #311: gmp's memory management
by GHC 23 Jul '14

23 Jul '14

#311: gmp's memory management -------------------------------------+------------------------------------- Reporter: as49 | Owner: Type: bug | Status: closed Priority: low | Milestone: 6.12 branch Component: Compiler | Version: 6.4 (FFI) | Keywords: Resolution: fixed | Architecture: Unknown/Multiple Operating System: | Difficulty: Unknown Unknown/Multiple | Blocked By: Type of failure: | Related Tickets: #9281 None/Unknown | Test Case: | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- Changes (by hvr): * failure: => None/Unknown * related: => #9281 Comment: See #9281 for a new attempt to improve the situation for the `integer-gmp` -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/311#comment:14> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] Password reset for user: hvr
by GHC 23 Jul '14

23 Jul '14

Password reset for user for user hvr -- GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] Password reset for user: hvr
by GHC 23 Jul '14

23 Jul '14

Password reset for user for user hvr -- GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] Password reset for user: hvr
by GHC 23 Jul '14

23 Jul '14

Password reset for user for user hvr -- GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] Password reset for user: hvr
by GHC 23 Jul '14

23 Jul '14

Password reset for user for user hvr -- GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] #9339: last is not a good consumer
by GHC 22 Jul '14

22 Jul '14

#9339: last is not a good consumer -------------------------------------+------------------------------------- Reporter: dfeuer | Owner: Type: bug | Status: new Priority: normal | Milestone: Component: libraries/base | Version: 7.8.3 Keywords: | Differential Revisions: Operating System: Unknown/Multiple | Architecture: Type of failure: Runtime | Unknown/Multiple performance bug | Difficulty: Unknown Test Case: | Blocked By: Blocking: | Related Tickets: -------------------------------------+------------------------------------- The profiler indicates that `print $ last [(1::Int)..10^7]` (compiled with -O2) allocates around 8*10^8 bytes. Using the Henning Thienemann-inspired {{{ myLast = fromJust . foldr (\x -> Just . maybe x id) Nothing }}} (based on his code for viewR/unsnoc) reduces allocation by about half at the cost of some extra work. What we really want, I believe, is for `last` to fuse with the producer in a fashion that allows the Ints to be unboxed, eliminating all the allocation. I have no idea if this will fall out of the general fusion work planned for 7.9. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9339> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 11

[GHC] #9327: possibly incorrect indentation or mismatched brackets
by GHC 22 Jul '14

22 Jul '14

#9327: possibly incorrect indentation or mismatched brackets -------------------------------------+------------------------------------- Reporter: Jefffrey | Owner: Type: bug | Status: new Priority: low | Milestone: Component: Compiler | Version: 7.6.3 Keywords: | Differential Revisions: Operating System: MacOS X | Architecture: Type of failure: Incorrect | Unknown/Multiple warning at compile-time | Difficulty: Unknown Test Case: | Blocked By: Blocking: | Related Tickets: -------------------------------------+------------------------------------- I'm having a weird problem. This code compiles: {{{ fetchSomething :: IO String fetchSomething = return "Something" main :: IO () main = do if True then do l <- fetchSomething let fn s = do let rs = s ++ ": " l <- fetchSomething return $ rs ++ l n <- fn "Prefix" putStr n else return () }}} but the following doesn't: {{{ let ep = Bridge.destination b </> e ed <- doesDirectoryExist ep if ed then do ds <- listDirs ep let fn p = do let t = readUTC p lt <- toLocalTime t <-- parse error (possibly incorrect indentation or mismatched brackets) return $ Snapshot t lt e b l <- mapM fn ds let r = sortBy (compare `on` time) l let ri = Prelude.take m $ assignIDs 1 r if o == Oldest then return $ ri else return $ reverse ri else return [] }}} Here's a live demo of the former: http://coliru.stacked- crooked.com/a/0305f546c8566683 To test the second, the only way I could find is by downloading this repository: https://github.com/Jefffrey/Kopia/commit/9ec9eb93183c4ceed6d324f7fc726584de… and running `cabal test`. Someone on the #haskell channel reproduced it on his machine too. This seems like a bug. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9327> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 3

[GHC] #9241: Add a"same" function to Data.Eq
by GHC 22 Jul '14

22 Jul '14

#9241: Add a"same" function to Data.Eq ------------------------------------+------------------------------------- Reporter: mhwombat | Owner: Type: feature request | Status: new Priority: low | Milestone: Component: Prelude | Version: 7.8.2 Keywords: | Operating System: Unknown/Multiple Architecture: Unknown/Multiple | Type of failure: None/Unknown Difficulty: Unknown | Test Case: Blocked By: | Blocking: Related Tickets: | ------------------------------------+------------------------------------- Add a"same" function to Data.Eq that parallels the "comparing" function in Data.Ord. For example: -- | -- > same p x y = (p x) == (p y) -- -- Useful combinator for use in conjunction with the @xxxBy@ family -- of functions from "Data.List", for example: -- -- > ... groupBy (same fst) ... same :: (Eq a) => (b -> a) -> b -> b -> Bool same p x y = (p x) == (p y) For a closer parallel, I suppose "same" could return "Equality" (similar to "Ordering"), and the functions "nubBy", "deleteBy", "deleteFirstsBy", "unionBy", "intersectBy" and "groupBy" should take (a -> a -> Equality) (a -> a -> Bool). But I don't know if there's any benefit to that. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9241> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 4

[GHC] #9343: foldl' is not a good consumer
by GHC 21 Jul '14

21 Jul '14

#9343: foldl' is not a good consumer -------------------------------------+------------------------------------- Reporter: dfeuer | Owner: Type: bug | Status: new Priority: normal | Milestone: Component: libraries/base | Version: 7.8.3 Keywords: | Differential Revisions: Operating System: Unknown/Multiple | Architecture: Type of failure: Runtime | Unknown/Multiple performance bug | Difficulty: Unknown Test Case: | Blocked By: Blocking: | Related Tickets: -------------------------------------+------------------------------------- Some fancy footwork went into making length a good consumer. Since `length = foldl' (\n _ -> n + 1) 0`, I was wondering if a trick similar to the one used for length might work for more general strict left folds. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9343> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 1

Re: [GHC] #7452: [GNU gold] ld: error: cannot find [...]/Types__1.o
by GHC 21 Jul '14

21 Jul '14

#7452: [GNU gold] ld: error: cannot find [...]/Types__1.o -------------------------------------+------------------------------------- Reporter: mrothe | Owner: Type: bug | Status: closed Priority: normal | Milestone: 7.10.1 Component: Build | Version: 7.6.1 System | Keywords: Resolution: fixed | Operating System: Linux Differential Revisions: | Type of failure: Building GHC Architecture: x86_64 | failed (amd64) | Test Case: Difficulty: Unknown | Blocking: Blocked By: | Related Tickets: | -------------------------------------+------------------------------------- Changes (by thoughtpolice): * status: patch => closed * resolution: => fixed -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/7452#comment:11> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0