git-annex/Command/Fsck.hs

69 lines
1.7 KiB
Haskell
Raw Normal View History

2010-11-06 21:06:19 +00:00
{- git-annex command
-
- Copyright 2010 Joey Hess <joey@kitenet.net>
-
- Licensed under the GNU GPL version 3 or higher.
-}
module Command.Fsck where
2010-11-07 22:22:25 +00:00
import qualified Data.Map as M
2010-11-06 21:06:19 +00:00
import Command
import Types
import Core
2010-11-08 19:15:21 +00:00
import Messages
import qualified Command.FsckFile
2010-11-06 21:06:19 +00:00
2010-11-11 22:54:52 +00:00
seek :: [SubCmdSeek]
2010-11-13 20:15:45 +00:00
seek = [withNothing start, withAll withFilesInGit Command.FsckFile.start]
2010-11-11 22:54:52 +00:00
{- Checks the whole annex for problems, only if specific files were not
- specified. -}
2010-11-13 20:15:45 +00:00
start :: SubCmdStartNothing
start = do
showStart "fsck" ""
return $ Just perform
2010-11-06 21:06:19 +00:00
perform :: SubCmdPerform
perform = do
ok <- checkUnused
if ok
2010-11-06 21:06:19 +00:00
then return $ Just $ return True
else return Nothing
2010-11-06 21:06:19 +00:00
checkUnused :: Annex Bool
checkUnused = do
showNote "checking for unused data..."
2010-11-07 21:26:21 +00:00
unused <- unusedKeys
if (null unused)
then return True
else do
showLongNote $ w unused
return False
where
w u = unlines $ [
2010-11-07 22:22:25 +00:00
"Some annexed data is no longer pointed to by any files in the repository.",
2010-11-07 21:26:21 +00:00
"If this data is no longer needed, it can be removed using git-annex dropkey:"
2010-11-07 22:22:25 +00:00
] ++ map (\k -> " " ++ show k) u
2010-11-07 21:26:21 +00:00
2010-11-07 22:22:25 +00:00
{- Finds keys whose content is present, but that do not seem to be used
- by any files in the git repo. -}
2010-11-07 21:26:21 +00:00
unusedKeys :: Annex [Key]
unusedKeys = do
present <- getKeysPresent
referenced <- getKeysReferenced
-- Constructing a single map, of the set that tends to be smaller,
-- appears more efficient in both memory and CPU than constructing
-- and taking the M.difference of two maps.
let present_m = existsMap present
let unused_m = remove referenced present_m
return $ M.keys unused_m
where
remove [] m = m
remove (x:xs) m = remove xs $ M.delete x m
existsMap :: Ord k => [k] -> M.Map k Int
existsMap l = M.fromList $ map (\k -> (k, 1)) l