May 2015 - ghc-tickets

error in 7.10.1 ?
by Sergei Meshveliani 22 May '15

22 May '15

Dear GHC developers, The confirmation token letter from the bug tracker travels too long, I do not know, why. Meanwhile I cannot report there. So, I report it in the below way: http://www.botik.ru/pub/local/Mechveliani/ghcQuest/7.10.1-errReport-may22-2… Make it, please, with ghc-7.10.1 as it is written there in install.txt, including making demotest/Main. Then ./Main breaks in the middle reporting a DoCon application error ---------------------------------------------------------------------------- Factorization in K1[x], K1 a generic finite extension of a prime field K = Z/(p) .. factor f, f = (x^10 + x^7 + x^5 + x^3 + x^2 + (2)*x+ (2)) <- K[x] = ((Z/<5>)["t"]/<(t^3 + 4*t + 3)>)["x"] Domain term of K must contain a Finite field description. --------------------------------------------------------------------------- I obtain this for ghc-7.10.1 made from source by ghc-7.8.2 on Debian Linux, x-86, 64 bit. The story is as follows. docon-2.12 http://www.botik.ru/pub/local/Mechveliani/docon/2.12/ has been tested under ghc-7.8.2, and it works. Now I am trying to port it to ghc-7.10.1. This needs inserting certain pragmas for OVERLAPPING/OVERLAPPABLE into some instance declarations. So I call this port docon-2.12.1. 7.10.1-errReport-may22-2015.zip is the error report of docon-2.12.1 to ghc-7.10.1. This application has the OVERLAPPABLE pragma set to one instance and the OVERLAPPING pragma set to many instances. GHC itself warns of overlaps. Then I 1) set the pragma to the reported instance (pair), 2) recompile the corresponding module 3) rerun make configure; make build. This process has finished in `making' the application. Then, > cd demotest > ghc $doconCpOpt -O --make -rtsopts Main > ./Main produces the above error instead of the test success report. I suspect that the reason is in treating the instance overlaps (but there may be another source). Comparing docon-2.12 + ghc-7.8.2 to 7.10.1-errReport-may22-201 + ghc-7.10.1, can you, please, find: how to fix the latter version? Is this a bug in ghc-7.10.1 ? Regards, -------- Sergei

1 0

[GHC] #10315: ApiAnnotations : Empty context loses annotations
by GHC 21 May '15

21 May '15

#10315: ApiAnnotations : Empty context loses annotations -------------------------------------+------------------------------------- Reporter: alanz | Owner: alanz Type: bug | Status: new Priority: normal | Milestone: 7.10.2 Component: Compiler | Version: 7.10.1 Keywords: | Operating System: Unknown/Multiple ApiAnnotations | Type of failure: None/Unknown Architecture: | Blocked By: Unknown/Multiple | Related Tickets: Test Case: | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- A type signature of the form {{{#!hs bar :: ( ) => a-> Bool }}} generates annotations for the `( ) =>` but the SrcSpan they are attached to is discarded so the annotations are not attached to the AST. The discarding process happens in {{{#!hs mkHsForAllTy exp tvs (L _ []) ty = mk_forall_ty exp tvs ty }}} where the empty located context is discarded. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/10315> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 8

[GHC] #10363: ApiAnnotations : HsForAllTy discards parens
by GHC 21 May '15

21 May '15

#10363: ApiAnnotations : HsForAllTy discards parens -------------------------------------+------------------------------------- Reporter: alanz | Owner: alanz Type: bug | Status: new Priority: normal | Milestone: 7.10.2 Component: Compiler | Version: 7.10.1 Keywords: | Operating System: Unknown/Multiple ApiAnnotations | Type of failure: None/Unknown Architecture: | Blocked By: Unknown/Multiple | Related Tickets: Test Case: | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- The annotations for the following code {{{#!hs pTokenCostStr :: forall a .((Show a) => [a] -> Int -> String) }}} have detached annotations for the parens around `(Show a)... String`. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/10363> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 3

Re: [GHC] #4879: Deprecate exports
by GHC 20 May '15

20 May '15

#4879: Deprecate exports -------------------------------------+------------------------------------- Reporter: basvandijk | Owner: Type: feature request | Status: new Priority: high | Milestone: 7.12.1 Component: Compiler | Version: 7.0.1 Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: Type of failure: None/Unknown | Unknown/Multiple Blocked By: | Test Case: Related Tickets: | Blocking: | Differential Revisions: Phab:D638 -------------------------------------+------------------------------------- Changes (by rodlogic): * cc: rodlogic (added) -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/4879#comment:22> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] #10244: "memory barriers unimplemented on this architecture" on ARM pre-ARMv7
by GHC 19 May '15

19 May '15

#10244: "memory barriers unimplemented on this architecture" on ARM pre-ARMv7 -------------------------------------+------------------------------------- Reporter: rwbarton | Owner: simonmar Type: bug | Status: new Priority: normal | Milestone: Component: Runtime | Version: 7.10.1 System | Operating System: Unknown/Multiple Keywords: | Type of failure: Building GHC Architecture: arm | failed Test Case: | Blocked By: Blocking: | Related Tickets: Differential Revisions: | -------------------------------------+------------------------------------- Phab:D33 broke the build on ARM pre-ARMv7, because there is no definition of `store_load_barrier` or `load_load_barrier` for those platforms. (Granted, the old fall-back behavior of doing nothing was almost certainly incorrect.) I don't know whether we need CPU-level barriers here, or whether they are available. At a minimum, we need a compiler-level barrier. If we need a CPU-level barrier and it isn't provided by the instruction set, then I guess we should disable SMP for these platforms in `mk/config.mk.in`. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/10244> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 10

[GHC] #10434: SPECIALISE instance does not specialize as far as SPECIALISE for type signatures
by GHC 19 May '15

19 May '15

#10434: SPECIALISE instance does not specialize as far as SPECIALISE for type signatures -------------------------------------+------------------------------------- Reporter: | Owner: andreas.abel | Status: new Type: bug | Milestone: Priority: normal | Version: 7.8.3 Component: Compiler | Operating System: Unknown/Multiple Keywords: | Type of failure: None/Unknown Architecture: | Blocked By: Unknown/Multiple | Related Tickets: Test Case: | Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- {{{#!hs type FreeM c = Reader (FreeEnv c) c class Free' a c where freeVars' :: (Monoid c) => a -> FreeM c instance (Free' a c, Free' b c) => Free' (a,b) c where {-# SPECIALIZE instance (Free' a All, Free' b All) => Free' (a,b) All #-} {-# SPECIALIZE freeVars' :: (Free' a Any, Free' b Any) => (a,b) -> FreeM Any #-} freeVars' (x,y) = freeVars' x `mappend` freeVars' y }}} I would expect these two specialize pragmas to work similarily. However, the interface file shows that the mappend for Any has been inlined, but not the one for All. If you look at the .hi file dump below, you see {{{ Data.Monoid.mappend @ Data.Monoid.All $dMonoid }}} generated by the SPECIALIZE instance, and {{{ case (...) of wild1 { GHC.Types.False -> eta1 `cast` (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.Any>_N) eta2 GHC.Types.True -> GHC.Types.True }}} generated by the SPECIALIZE for the type signature. For All, mappend is called from the dictionary dMonoid, which is still passed around, whereas for Any, the disjunction has been inlined. {{{ $fFree'(,)c_$s$cfreeVars' :: Agda.TypeChecking.Free.Lazy.Free' a Data.Monoid.All -> Agda.TypeChecking.Free.Lazy.Free' b Data.Monoid.All -> Data.Monoid.Monoid Data.Monoid.All -> (a, b) -> Agda.TypeChecking.Free.Lazy.FreeM Data.Monoid.All {- Arity: 4, HasNoCafRefs, Strictness: <L,1*C1(C1(U))><L,1*C1(C1(U))><L,U(U,U,U)><S,1*U(U,U)>, Unfolding: InlineRule (4, True, False) (\ @ a @ b $dFree' :: Agda.TypeChecking.Free.Lazy.Free' a Data.Monoid.All $dFree'1 :: Agda.TypeChecking.Free.Lazy.Free' b Data.Monoid.All $dMonoid :: Data.Monoid.Monoid Data.Monoid.All ds :: (a, b) -> case ds of wild { (,) x y -> let { eta :: Control.Monad.Trans.Reader.ReaderT (Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All) Data.Functor.Identity.Identity Data.Monoid.All = $dFree' `cast` (Agda.TypeChecking.Free.Lazy.NTCo:Free'[0] <a>_N <Data.Monoid.All>_N) $dMonoid x } in let { eta1 :: Control.Monad.Trans.Reader.ReaderT (Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All) Data.Functor.Identity.Identity Data.Monoid.All = $dFree'1 `cast` (Agda.TypeChecking.Free.Lazy.NTCo:Free'[0] <b>_N <Data.Monoid.All>_N) $dMonoid y } in (\ eta2 :: Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All -> Data.Monoid.mappend @ Data.Monoid.All $dMonoid (eta `cast` (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.All>_N) eta2) `cast` (Data.Functor.Identity.NTCo:Identity[0] <Data.Monoid.All>_R) (eta1 `cast` (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.All>_N) eta2) `cast` (Data.Functor.Identity.NTCo:Identity[0] <Data.Monoid.All>_R)) `cast` (Trans (<Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All>_R ->_R Sym (Data.Functor.Identity.NTCo:Identity[0] <Data.Monoid.All>_R)) (Sym (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.All>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.All>_N))) }) -} 2292db791a93ca783c0315a38fa7d8f1 $fFree'(,)c_$s$cfreeVars'1 :: Agda.TypeChecking.Free.Lazy.Free' a Data.Monoid.Any -> Agda.TypeChecking.Free.Lazy.Free' b Data.Monoid.Any -> (a, b) -> Agda.TypeChecking.Free.Lazy.FreeM Data.Monoid.Any {- Arity: 3, HasNoCafRefs, Strictness: <L,1*C1(C1(U))><L,1*C1(C1(U))><S,1*U(U,U)>, Unfolding: InlineRule (3, True, False) (\ $dFree' :: Agda.TypeChecking.Free.Lazy.Free' a Data.Monoid.Any $dFree'1 :: Agda.TypeChecking.Free.Lazy.Free' b Data.Monoid.Any ds :: (a, b) -> case ds of wild { (,) x y -> let { eta :: Control.Monad.Trans.Reader.ReaderT (Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any) Data.Functor.Identity.Identity Data.Monoid.Any = $dFree' `cast` (Agda.TypeChecking.Free.Lazy.NTCo:Free'[0] <a>_N <Data.Monoid.Any>_N) Data.Monoid.$fMonoidAny x } in let { eta1 :: Control.Monad.Trans.Reader.ReaderT (Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any) Data.Functor.Identity.Identity Data.Monoid.Any = $dFree'1 `cast` (Agda.TypeChecking.Free.Lazy.NTCo:Free'[0] <b>_N <Data.Monoid.Any>_N) Data.Monoid.$fMonoidAny y } in (\ eta2 :: Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any -> case (eta `cast` (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.Any>_N) eta2) `cast` (Data.Functor.Identity.NTCo:Identity[0] (Data.Monoid.NTCo:Any[0])) of wild1 { GHC.Types.False -> eta1 `cast` (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.Any>_N) eta2 GHC.Types.True -> GHC.Types.True `cast` (Sym (Data.Functor.Identity.NTCo:Identity[0] (Data.Monoid.NTCo:Any[0]))) }) `cast` (Sym (Control.Monad.Trans.Reader.NTCo:ReaderT[0] <Agda.TypeChecking.Free.Lazy.FreeEnv Data.Monoid.Any>_R <Data.Functor.Identity.Identity>_R <Data.Monoid.Any>_N)) }) -} 2292db791a93ca783c0315a38fa7d8f1 }}} -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/10434> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] #8555: Simplify given `Coercible` constraints
by GHC 19 May '15

19 May '15

#8555: Simplify given `Coercible` constraints -------------------------------------+------------------------------------- Reporter: nomeata | Owner: Type: feature request | Status: new Priority: normal | Milestone: Component: Compiler (Type | Version: 7.7 checker) | Operating System: Unknown/Multiple Keywords: | Type of failure: GHC rejects Architecture: Unknown/Multiple | valid program Difficulty: Unknown | Test Case: Blocked By: | Blocking: Related Tickets: #8503 | -------------------------------------+------------------------------------- It would be feasible and possibly useful if {{{ foo :: Coercible [a] [b] => a -> b foo = coerce }}} would work. This involve simplifying `CtGiven`s similar to how given (nominal) equalities are simplified. I’ll defer working on this, as it is not strictly required, it seems. -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/8555> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 10

[GHC] #8799: Orientation of given `Coercible` constraints
by GHC 19 May '15

19 May '15

#8799: Orientation of given `Coercible` constraints -------------------------------------------+------------------------------- Reporter: nomeata | Owner: Type: feature request | Status: new Priority: normal | Milestone: Component: Compiler (Type checker) | Version: 7.6.3 Keywords: | Operating System: Architecture: Unknown/Multiple | Unknown/Multiple Difficulty: Unknown | Type of failure: Blocked By: | None/Unknown Related Tickets: #8555 | Test Case: | Blocking: -------------------------------------------+------------------------------- {{{ Prelude> :m + GHC.Exts Prelude GHC.Exts> let f :: Coercible a b => b -> a ; f = coerce <interactive>:3:40: Could not coerce from ‛b’ to ‛a’ because ‛b’ and ‛a’ are different types. arising from a use of ‛coerce’ from the context (Coercible a b) bound by the type signature for f :: Coercible a b => b -> a at <interactive>:3:10-32 In the expression: coerce In an equation for ‛f’: f = coerce }}} Something better could be done here (but its not clear what exactly, and to what general extend). -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/8799> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 5

Re: [GHC] #7695: Hang when locale-archive and gconv-modules are not there
by GHC 19 May '15

19 May '15

#7695: Hang when locale-archive and gconv-modules are not there -------------------------------------+------------------------------------- Reporter: hpd | Owner: Type: bug | Status: patch Priority: highest | Milestone: 7.10.2 Component: None | Version: 7.8.1 Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: Type of failure: Runtime crash | Unknown/Multiple Blocked By: | Test Case: Related Tickets: #8977, #10298 | Blocking: | Differential Revisions: Phab:D898 -------------------------------------+------------------------------------- Changes (by thoughtpolice): * status: new => patch * differential: => Phab:D898 -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/7695#comment:19> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 0

[GHC] #10349: ghc-7.10.1.20150414 fails to configure on aarch64 with ld.gold: cannot compute sizeof (long long)
by GHC 19 May '15

19 May '15

#10349: ghc-7.10.1.20150414 fails to configure on aarch64 with ld.gold: cannot compute sizeof (long long) -------------------------------------+------------------------------------- Reporter: | Owner: juhpetersen | Status: new Type: bug | Milestone: 7.10.2 Priority: normal | Version: 7.10.1 Component: Build | Operating System: Linux System | Type of failure: Building GHC Keywords: | failed Architecture: aarch64 | Blocked By: Test Case: | Related Tickets: Blocking: | Differential Revisions: | -------------------------------------+------------------------------------- On Fedora at least, the ghc-7.10 branch (as of yesterday) fails to configure on aarch64 when using ld.gold: {{{ checking size of long long... configure: error: in `/builddir/build/BUILD/ghc-7.10.1.20150414': configure: error: cannot compute sizeof (long long) }}} Gdb says: {{{ (gdb) r Starting program: /home/petersen/conftest During startup program terminated with signal SIGKILL, Killed. }}} Compiling the conftest.c attached with -fuse-ld=gold causes it to crash when run. {{{ $ gcc -o conftest conftest.c $ ./conftest $ gcc -o conftest -fuse-ld=gold conftest.c $ ./conftest Killed $ }}} -- Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/10349> GHC <http://www.haskell.org/ghc/> The Glasgow Haskell Compiler

1 3