diff options
author | 2004-10-21 14:09:36 +0000 | |
---|---|---|
committer | 2004-10-21 14:09:36 +0000 | |
commit | 8403299edbd21b02e1b78370e0b0d8de60c3187e (patch) | |
tree | 200ed303721e07cd9ad33eacc60115f46d6bfbf2 /dev-haskell/haddock/files | |
parent | new version on cpan (diff) | |
download | historical-8403299edbd21b02e1b78370e0b0d8de60c3187e.tar.gz historical-8403299edbd21b02e1b78370e0b0d8de60c3187e.tar.bz2 historical-8403299edbd21b02e1b78370e0b0d8de60c3187e.zip |
patched for gcc-3.4
Diffstat (limited to 'dev-haskell/haddock/files')
-rw-r--r-- | dev-haskell/haddock/files/digest-haddock-0.4 | 1 | ||||
-rw-r--r-- | dev-haskell/haddock/files/digest-haddock-0.5 | 1 | ||||
-rw-r--r-- | dev-haskell/haddock/files/digest-haddock-0.6-r1 | 1 | ||||
-rw-r--r-- | dev-haskell/haddock/files/digest-haddock-0.6-r3 (renamed from dev-haskell/haddock/files/digest-haddock-0.6) | 0 | ||||
-rw-r--r-- | dev-haskell/haddock/files/haddock-0.4-ghc6.patch | 203 | ||||
-rw-r--r-- | dev-haskell/haddock/files/haddock-0.6-gcc3.4.patch | 46 |
6 files changed, 46 insertions, 206 deletions
diff --git a/dev-haskell/haddock/files/digest-haddock-0.4 b/dev-haskell/haddock/files/digest-haddock-0.4 deleted file mode 100644 index 01ae36b36df6..000000000000 --- a/dev-haskell/haddock/files/digest-haddock-0.4 +++ /dev/null @@ -1 +0,0 @@ -MD5 919e38378b91a223cb1e48178f1a85bd haddock-0.4-src.tar.gz 381200 diff --git a/dev-haskell/haddock/files/digest-haddock-0.5 b/dev-haskell/haddock/files/digest-haddock-0.5 deleted file mode 100644 index 2177a42ef0e7..000000000000 --- a/dev-haskell/haddock/files/digest-haddock-0.5 +++ /dev/null @@ -1 +0,0 @@ -MD5 c103855f8e1643034b3df02e9b8ae247 haddock-0.5-src.tar.gz 427144 diff --git a/dev-haskell/haddock/files/digest-haddock-0.6-r1 b/dev-haskell/haddock/files/digest-haddock-0.6-r1 deleted file mode 100644 index fc424528e86b..000000000000 --- a/dev-haskell/haddock/files/digest-haddock-0.6-r1 +++ /dev/null @@ -1 +0,0 @@ -MD5 6f15d15a3e4352f77f003fb133b1d9b2 haddock-0.6-src.tar.gz 429708 diff --git a/dev-haskell/haddock/files/digest-haddock-0.6 b/dev-haskell/haddock/files/digest-haddock-0.6-r3 index fc424528e86b..fc424528e86b 100644 --- a/dev-haskell/haddock/files/digest-haddock-0.6 +++ b/dev-haskell/haddock/files/digest-haddock-0.6-r3 diff --git a/dev-haskell/haddock/files/haddock-0.4-ghc6.patch b/dev-haskell/haddock/files/haddock-0.4-ghc6.patch deleted file mode 100644 index d5192c49aaf8..000000000000 --- a/dev-haskell/haddock/files/haddock-0.4-ghc6.patch +++ /dev/null @@ -1,203 +0,0 @@ -diff -Naur haddock-0.4-orig/haddock/src/Binary.hs haddock-0.4/haddock/src/Binary.hs ---- haddock-0.4-orig/haddock/src/Binary.hs 2002-06-23 14:54:00.000000000 +0000 -+++ haddock-0.4/haddock/src/Binary.hs 2003-07-28 12:29:09.000000000 +0000 -@@ -64,7 +64,6 @@ - import Monad - import Exception - import GlaExts hiding (ByteArray, newByteArray, freezeByteArray) --import Array - import IO - #if __GLASGOW_HASKELL__ < 503 - import PrelIOBase -- ( IOError(..), IOErrorType(..) ) -@@ -77,11 +76,19 @@ - #endif - - type BinArray = MutableByteArray RealWorld Int -+newArray_ :: Ix ix => (ix, ix) -> IO (MutableByteArray RealWorld ix) - newArray_ bounds = stToIO (newCharArray bounds) -+ -+unsafeWrite :: Ix ix => MutableByteArray RealWorld ix -> ix -> Word8 -> IO () - unsafeWrite arr ix e = stToIO (writeWord8Array arr ix e) -+ -+unsafeRead :: Ix ix => MutableByteArray RealWorld ix -> ix -> IO Word8 - unsafeRead arr ix = stToIO (readWord8Array arr ix) - -+hPutArray :: Handle -> MutableByteArray RealWorld a -> Int -> IO () - hPutArray h arr sz = hPutBufBA h arr sz -+ -+hGetArray :: Handle -> MutableByteArray RealWorld a -> Int -> IO Int - hGetArray h sz = hGetBufBA h sz - - #if __GLASGOW_HASKELL__ < 503 -@@ -160,14 +167,15 @@ - | size <= 0 = error "Data.Binary.openBinMem: size must be >= 0" - | otherwise = do - arr <- newArray_ (0,size-1) -- arr_r <- newIORef arr -+ arr_r0 <- newIORef arr - ix_r <- newFastMutInt - writeFastMutInt ix_r 0 -- sz_r <- newFastMutInt -- writeFastMutInt sz_r size -- return (BinMem undefined ix_r sz_r arr_r) -+ sz_r0 <- newFastMutInt -+ writeFastMutInt sz_r0 size -+ return (BinMem undefined ix_r sz_r0 arr_r0) - --noBinHandleUserData = error "Binary.BinHandle: no user data" -+--noBinHandleUserData :: a -+--noBinHandleUserData = error "Binary.BinHandle: no user data" - - --getUserData :: BinHandle -> BinHandleState - --getUserData bh = state bh -@@ -180,24 +188,24 @@ - seekBin (BinIO _ ix_r h) (BinPtr p) = do - writeFastMutInt ix_r p - hSeek h AbsoluteSeek (fromIntegral p) --seekBin h@(BinMem _ ix_r sz_r a) (BinPtr p) = do -- sz <- readFastMutInt sz_r -+seekBin h@(BinMem _ ix_r sz_r0 _) (BinPtr p) = do -+ sz <- readFastMutInt sz_r0 - if (p >= sz) - then do expandBin h p; writeFastMutInt ix_r p - else writeFastMutInt ix_r p - - isEOFBin :: BinHandle -> IO Bool --isEOFBin (BinMem _ ix_r sz_r a) = do -+isEOFBin (BinMem _ ix_r sz_r0 _) = do - ix <- readFastMutInt ix_r -- sz <- readFastMutInt sz_r -+ sz <- readFastMutInt sz_r0 - return (ix >= sz) --isEOFBin (BinIO _ ix_r h) = hIsEOF h -+isEOFBin (BinIO _ _ h) = hIsEOF h - - writeBinMem :: BinHandle -> FilePath -> IO () - writeBinMem (BinIO _ _ _) _ = error "Data.Binary.writeBinMem: not a memory handle" --writeBinMem (BinMem _ ix_r sz_r arr_r) fn = do -+writeBinMem (BinMem _ ix_r _ arr_r0) fn = do - h <- openFileEx fn (BinaryMode WriteMode) -- arr <- readIORef arr_r -+ arr <- readIORef arr_r0 - ix <- readFastMutInt ix_r - hPutArray h arr ix - hClose h -@@ -212,24 +220,24 @@ - when (count /= filesize) - (error ("Binary.readBinMem: only read " ++ show count ++ " bytes")) - hClose h -- arr_r <- newIORef arr -+ arr_r0 <- newIORef arr - ix_r <- newFastMutInt - writeFastMutInt ix_r 0 -- sz_r <- newFastMutInt -- writeFastMutInt sz_r filesize -- return (BinMem undefined {-initReadState-} ix_r sz_r arr_r) -+ sz_r0 <- newFastMutInt -+ writeFastMutInt sz_r0 filesize -+ return (BinMem undefined {-initReadState-} ix_r sz_r0 arr_r0) - - -- expand the size of the array to include a specified offset - expandBin :: BinHandle -> Int -> IO () --expandBin (BinMem _ ix_r sz_r arr_r) off = do -- sz <- readFastMutInt sz_r -+expandBin (BinMem _ _ sz_r0 arr_r0) off = do -+ sz <- readFastMutInt sz_r0 - let sz' = head (dropWhile (<= off) (iterate (* 2) sz)) -- arr <- readIORef arr_r -+ arr <- readIORef arr_r0 - arr' <- newArray_ (0,sz'-1) - sequence_ [ unsafeRead arr i >>= unsafeWrite arr' i - | i <- [ 0 .. sz-1 ] ] -- writeFastMutInt sz_r sz' -- writeIORef arr_r arr' -+ writeFastMutInt sz_r0 sz' -+ writeIORef arr_r0 arr' - hPutStrLn stderr ("expanding to size: " ++ show sz') - return () - expandBin (BinIO _ _ _) _ = return () -@@ -239,14 +247,14 @@ - -- Low-level reading/writing of bytes - - putWord8 :: BinHandle -> Word8 -> IO () --putWord8 h@(BinMem _ ix_r sz_r arr_r) w = do -+putWord8 h@(BinMem _ ix_r sz_r0 arr_r0) w = do - ix <- readFastMutInt ix_r -- sz <- readFastMutInt sz_r -+ sz <- readFastMutInt sz_r0 - -- double the size of the array if it overflows - if (ix >= sz) - then do expandBin h ix - putWord8 h w -- else do arr <- readIORef arr_r -+ else do arr <- readIORef arr_r0 - unsafeWrite arr ix w - writeFastMutInt ix_r (ix+1) - return () -@@ -257,12 +265,12 @@ - return () - - getWord8 :: BinHandle -> IO Word8 --getWord8 (BinMem _ ix_r sz_r arr_r) = do -+getWord8 (BinMem _ ix_r sz_r0 arr_r0) = do - ix <- readFastMutInt ix_r -- sz <- readFastMutInt sz_r -+ sz <- readFastMutInt sz_r0 - when (ix >= sz) $ -- throw (mkIOError eofErrorType "Data.Binary.getWord8" Nothing Nothing) -- arr <- readIORef arr_r -+ ioError (mkIOError eofErrorType "Data.Binary.getWord8" Nothing Nothing) -+ arr <- readIORef arr_r0 - w <- unsafeRead arr ix - writeFastMutInt ix_r (ix+1) - return w -@@ -363,8 +371,8 @@ - -- Instances for standard types - - instance Binary () where -- put_ bh () = return () -- get _ = return () -+ put_ _ () = return () -+ get _ = return () - -- getF bh p = case getBitsF bh 0 p of (_,b) -> ((),b) - - instance Binary Bool where -@@ -494,22 +502,23 @@ - data MBA = MBA (MutableByteArray# RealWorld) - - newByteArray :: Int# -> IO MBA --newByteArray sz = IO $ \s -> -- case newByteArray# sz s of { (# s, arr #) -> -+newByteArray sz = IO $ \s0 -> -+ case newByteArray# sz s0 of { (# s, arr #) -> - (# s, MBA arr #) } - - freezeByteArray :: MutableByteArray# RealWorld -> IO ByteArray --freezeByteArray arr = IO $ \s -> -- case unsafeFreezeByteArray# arr s of { (# s, arr #) -> -+freezeByteArray arr0 = IO $ \s0 -> -+ case unsafeFreezeByteArray# arr0 s0 of { (# s, arr #) -> - (# s, BA arr #) } - - writeByteArray :: MutableByteArray# RealWorld -> Int# -> Word8 -> IO () - --writeByteArray arr i w8 = IO $ \s -> -- case word8ToWord w8 of { W# w# -> -- case writeCharArray# arr i (chr# (word2Int# w#)) s of { s -> -+writeByteArray arr i w8 = IO $ \s0 -> -+ case fromIntegral w8 of { W# w# -> -+ case writeCharArray# arr i (chr# (word2Int# w#)) s0 of { s -> - (# s , () #) }} - -+indexByteArray :: ByteArray# -> Int# -> Word8 - indexByteArray a# n# = fromIntegral (I# (ord# (indexCharArray# a# n#))) - - instance (Integral a, Binary a) => Binary (Ratio a) where -@@ -530,6 +539,7 @@ - word8s :: [Word8] - word8s = map (fromIntegral.ord) str - -+getString :: BinHandle -> IO String - getString bh = do - word8s <- get bh - return (map (chr.fromIntegral) (word8s :: [Word8])) diff --git a/dev-haskell/haddock/files/haddock-0.6-gcc3.4.patch b/dev-haskell/haddock/files/haddock-0.6-gcc3.4.patch new file mode 100644 index 000000000000..81de6bb12dfc --- /dev/null +++ b/dev-haskell/haddock/files/haddock-0.6-gcc3.4.patch @@ -0,0 +1,46 @@ +diff -Naur haddock-0.6.orig/haddock/src/HaddockUtil.hs haddock-0.6/haddock/src/HaddockUtil.hs +--- haddock-0.6.orig/haddock/src/HaddockUtil.hs 2004-10-21 15:00:16.000000000 +0200 ++++ haddock-0.6/haddock/src/HaddockUtil.hs 2004-10-21 15:51:10.211521360 +0200 +@@ -188,12 +188,12 @@ + + moduleHeaderRE :: Regex + moduleHeaderRE = mkRegexWithOpts +- "^([ \t\n]*Module[ \t]*:.*\n)?\ +- \([ \t\n]*Copyright[ \t]*:.*\n)?\ +- \([ \t\n]*License[ \t]*:.*\n)?\ +- \[ \t\n]*Maintainer[ \t]*:(.*)\n\ +- \[ \t\n]*Stability[ \t]*:(.*)\n\ +- \[ \t\n]*Portability[ \t]*:([^\n]*)\n" ++ ( "^([ \t\n]*Module[ \t]*:.*\n)?" ++ ++ "([ \t\n]*Copyright[ \t]*:.*\n)?" ++ ++ "([ \t\n]*License[ \t]*:.*\n)?" ++ ++ "[ \t\n]*Maintainer[ \t]*:(.*)\n" ++ ++ "[ \t\n]*Stability[ \t]*:(.*)\n" ++ ++ "[ \t\n]*Portability[ \t]*:([^\n]*)\n" ) + True -- match "\n" with "." + False -- not case sensitive + -- All fields except the last (Portability) may be multi-line. +diff -Naur haddock-0.6.orig/haddock/src/HaddockVersion.hs haddock-0.6/haddock/src/HaddockVersion.hs +--- haddock-0.6.orig/haddock/src/HaddockVersion.hs 2004-10-21 15:00:16.000000000 +0200 ++++ haddock-0.6/haddock/src/HaddockVersion.hs 2004-10-21 15:51:13.734985712 +0200 +@@ -14,5 +14,4 @@ + + -- The version comes in via CPP from mk/version.mk + projectVersion :: String +-projectVersion = tail "\ +- \ HADDOCK_VERSION" ++projectVersion = "0.6" +diff -Naur haddock-0.6.orig/haddock/src/Main.hs haddock-0.6/haddock/src/Main.hs +--- haddock-0.6.orig/haddock/src/Main.hs 2004-10-21 15:00:16.000000000 +0200 ++++ haddock-0.6/haddock/src/Main.hs 2004-10-21 15:51:19.185157160 +0200 +@@ -460,8 +460,8 @@ + + when (not (null name_strings)) $ + tell ["Warning: " ++ show mdl ++ +- ": the following names could not be resolved:\n\ +- \ " ++ concat (map (' ':) name_strings) ++ ": the following names could not be resolved:\n" ++ ++ " " ++ concat (map (' ':) name_strings) + ] + + return (mdl, Interface { |