module Darcs.Repository.Repair ( replayRepository, checkIndex,
replayRepositoryInTemp,
RepositoryConsistency(..) )
where
import Control.Monad ( when, unless )
import Control.Monad.Trans ( liftIO )
import Control.Applicative( (<$>) )
import Control.Exception ( finally )
import Data.Maybe ( catMaybes )
import Data.List ( sort, (\\) )
import System.Directory ( createDirectoryIfMissing, getCurrentDirectory,
setCurrentDirectory )
import Darcs.Lock( rmRecursive )
import Darcs.RepoPath( AbsolutePath, ioAbsolute, toFilePath )
import Darcs.Patch.PatchInfoAnd ( PatchInfoAnd, info, winfo, WPatchInfo, unWPatchInfo, compareWPatchInfo )
import Darcs.Witnesses.Eq ( EqCheck(..) )
import Darcs.Witnesses.Ordered ( FL(..), RL(..), lengthFL, reverseFL,
mapRL, nullFL, (:||:)(..) )
import Darcs.Witnesses.Sealed ( Sealed2(..), Sealed(..), unFreeLeft )
import Darcs.Patch.Apply( ApplyState )
import Darcs.Patch.Repair ( Repair(applyAndTryToFix) )
import Darcs.Patch.PatchInfoAnd( hopefully )
import Darcs.Patch.Info ( humanFriendly )
import Darcs.Patch.Set ( PatchSet(..), newset2FL, newset2RL )
#ifdef GADT_WITNESSES
import Darcs.Patch.Set ( Origin )
#endif
import Darcs.Patch ( RepoPatch, PrimOf, isInconsistent )
import Darcs.Patch.Named ( patchcontents )
import Darcs.Repository.Format ( identifyRepoFormat,
RepoProperty ( HashedInventory ), formatHas )
import Darcs.Repository.Cache ( HashedDir( HashedPristineDir ) )
import Darcs.Repository.HashedIO ( cleanHashdir )
import Darcs.Repository.HashedRepo ( readHashedPristineRoot )
import Darcs.Repository.InternalTypes ( extractCache )
import Darcs.Repository.Prefs ( filetypeFunction )
import Darcs.Repository ( Repository, readRepo, makePatchLazy
, readRecorded, readIndex, readRecordedAndPending )
import Progress ( debugMessage, beginTedious, endTedious, tediousSize, finishedOneIO )
import Darcs.Utils ( catchall )
import Darcs.Global ( darcsdir )
import Darcs.Lock( withTempDir )
import Printer ( Doc, putDocLn, text )
import Darcs.Arguments ( DarcsFlag( Verbose, Quiet ) )
import Darcs.Diff( treeDiff )
import Storage.Hashed.Monad( TreeIO )
import Storage.Hashed.Darcs( hashedTreeIO )
import Storage.Hashed.Tree( Tree, emptyTree )
import Storage.Hashed.AnchoredPath( anchorPath )
import Storage.Hashed.Hash( Hash(NoHash), encodeBase16 )
import Storage.Hashed.Tree( list, restrict, expand, itemHash, zipTrees )
import Storage.Hashed.Darcs( darcsUpdateHashes )
import Storage.Hashed.Index( updateIndex )
import Storage.Hashed( readPlainTree )
import qualified Data.ByteString.Char8 as BS
#include "impossible.h"
#include "gadts.h"
replaceInFL :: FL (PatchInfoAnd a) C(x y)
-> [Sealed2 (WPatchInfo :||: PatchInfoAnd a)]
-> FL (PatchInfoAnd a) C(x y)
replaceInFL orig [] = orig
replaceInFL NilFL _ = impossible
replaceInFL (o:>:orig) ch@(Sealed2 (o':||:c):ch_rest)
| IsEq <- winfo o `compareWPatchInfo` o' = c:>:replaceInFL orig ch_rest
| otherwise = o:>:replaceInFL orig ch
applyAndFix :: forall p C(r u t). (RepoPatch p, ApplyState p ~ Tree)
=> Repository p C(r u t) -> FL (PatchInfoAnd p) C(Origin r)
-> TreeIO (FL (PatchInfoAnd p) C(Origin r), Bool)
applyAndFix _ NilFL = return (NilFL, True)
applyAndFix r psin =
do liftIO $ beginTedious k
liftIO $ tediousSize k $ lengthFL psin
(repaired, ok) <- aaf psin
liftIO $ endTedious k
orig <- liftIO $ newset2FL `fmap` readRepo r
return (replaceInFL orig repaired, ok)
where k = "Replaying patch"
aaf :: FL (PatchInfoAnd p) C(w z) -> TreeIO ([Sealed2 (WPatchInfo :||: PatchInfoAnd p)], Bool)
aaf NilFL = return ([], True)
aaf (p:>:ps) = do
mp' <- applyAndTryToFix p
case isInconsistent . patchcontents . hopefully $ p of
Just err -> liftIO $ putDocLn err
Nothing -> return ()
let !winfp = winfo p
liftIO $ finishedOneIO k $ show $ humanFriendly $ unWPatchInfo winfp
(ps', restok) <- aaf ps
case mp' of
Nothing -> return (ps', restok)
Just (e,pp) -> liftIO $ do putStrLn e
p' <- makePatchLazy r pp
return (Sealed2 (winfp :||: p'):ps', False)
data RepositoryConsistency p C(x) =
RepositoryConsistent
| BrokenPristine (Tree IO)
| BrokenPatches (Tree IO) (PatchSet p C(Origin x))
checkUniqueness :: (RepoPatch p, ApplyState p ~ Tree)
=> (Doc -> IO ()) -> (Doc -> IO ()) -> Repository p C(r u t) -> IO ()
checkUniqueness putVerbose putInfo repository =
do putVerbose $ text "Checking that patch names are unique..."
r <- readRepo repository
case hasDuplicate $ mapRL info $ newset2RL r of
Nothing -> return ()
Just pinf -> do putInfo $ text "Error! Duplicate patch name:"
putInfo $ humanFriendly pinf
fail "Duplicate patches found."
hasDuplicate :: Ord a => [a] -> Maybe a
hasDuplicate li = hd $ sort li
where hd [_] = Nothing
hd [] = Nothing
hd (x1:x2:xs) | x1 == x2 = Just x1
| otherwise = hd (x2:xs)
replayRepository' ::
forall p C(r u t) . (RepoPatch p, ApplyState p ~ Tree)
=> AbsolutePath -> Repository p C(r u t) -> [DarcsFlag] -> IO (RepositoryConsistency p C(r))
replayRepository' whereToReplay' repo opts = do
let whereToReplay = toFilePath whereToReplay'
putVerbose s = when (Verbose `elem` opts) $ putDocLn s
putInfo s = when (not $ Quiet `elem` opts) $ putDocLn s
checkUniqueness putVerbose putInfo repo
createDirectoryIfMissing False whereToReplay
putVerbose $ text "Reading recorded state..."
pris <- readRecorded repo `catch` \_ -> return emptyTree
putVerbose $ text "Applying patches..."
patches <- readRepo repo
debugMessage "Fixing any broken patches..."
let psin = newset2FL patches
repair = applyAndFix repo psin
((ps, patches_ok), newpris) <- hashedTreeIO repair emptyTree whereToReplay
debugMessage "Done fixing broken patches..."
let newpatches = PatchSet (reverseFL ps) NilRL
debugMessage "Checking pristine against slurpy"
ftf <- filetypeFunction
is_same <- do Sealed diff <- unFreeLeft `fmap` treeDiff ftf pris newpris :: IO (Sealed (FL (PrimOf p) C(r)))
return $ nullFL diff
`catchall` return False
return (if is_same && patches_ok
then RepositoryConsistent
else if patches_ok
then BrokenPristine newpris
else BrokenPatches newpris newpatches)
cleanupRepositoryReplay :: Repository p C(r u t) -> IO ()
cleanupRepositoryReplay r = do
let c = extractCache r
rf <- identifyRepoFormat "."
unless (formatHas HashedInventory rf) $
rmRecursive $ darcsdir ++ "/pristine.hashed"
when (formatHas HashedInventory rf) $ do
current <- readHashedPristineRoot r
cleanHashdir c HashedPristineDir $ catMaybes [current]
replayRepositoryInTemp :: (RepoPatch p, ApplyState p ~ Tree) => Repository p C(r u t) -> [DarcsFlag]
-> IO (RepositoryConsistency p C(r))
replayRepositoryInTemp r opt = do
repodir <- getCurrentDirectory
withTempDir "darcs-check" $ \tmpDir -> do
setCurrentDirectory repodir
replayRepository' tmpDir r opt
replayRepository :: (RepoPatch p, ApplyState p ~ Tree)
=> Repository p C(r u t) -> [DarcsFlag]
-> (RepositoryConsistency p C(r) -> IO a) -> IO a
replayRepository r opt f = do
run `finally` cleanupRepositoryReplay r
where run = do
createDirectoryIfMissing False "_darcs/pristine.hashed"
hashedPristine <- ioAbsolute "_darcs/pristine.hashed"
st <- replayRepository' hashedPristine r opt
f st
checkIndex :: (RepoPatch p, ApplyState p ~ Tree) => Repository p C(r u t) -> Bool -> IO Bool
checkIndex repo quiet = do
index <- updateIndex =<< readIndex repo
pristine <- expand =<< readRecordedAndPending repo
working <- expand =<< restrict pristine <$> readPlainTree "."
working_hashed <- darcsUpdateHashes working
let index_paths = [ p | (p, _) <- list index ]
working_paths = [ p | (p, _) <- list working ]
index_extra = index_paths \\ working_paths
working_extra = working_paths \\ index_paths
gethashes p (Just i1) (Just i2) = (p, itemHash i1, itemHash i2)
gethashes p (Just i1) Nothing = (p, itemHash i1, NoHash)
gethashes p Nothing (Just i2) = (p, NoHash, itemHash i2)
gethashes p Nothing Nothing = error $ "Bad case at " ++ show p
mismatches = [ miss | miss@(_, h1, h2) <- zipTrees gethashes index working_hashed, h1 /= h2 ]
format paths = unlines $ (map $ ((" " ++) . anchorPath "")) paths
mismatches_disp = unlines [ anchorPath "" p ++
"\n index: " ++ BS.unpack (encodeBase16 h1) ++
"\n working: " ++ BS.unpack (encodeBase16 h2)
| (p, h1, h2) <- mismatches ]
unless (quiet || null index_extra) $
putStrLn $ "Extra items in index!\n" ++ format index_extra
unless (quiet || null working_extra) $
putStrLn $ "Missing items in index!\n" ++ format working_extra
unless (quiet || null mismatches) $
putStrLn $ "Hash mismatch(es)!\n" ++ mismatches_disp
return $ null index_extra && null working_extra && null mismatches