7ff89ccfee
This yields a second or so speedup in unused, find, etc. Seems that even when the ByteString is immediately split and then converted to Strings, it's faster. I may try to push ByteStrings out into more of git-annex gradually, although I suspect most of the time-critical parts are already covered now, and many of the rest rely on libraries that only support Strings.
52 lines
1.2 KiB
Haskell
52 lines
1.2 KiB
Haskell
{- git ls-tree interface
|
|
-
|
|
- Copyright 2011 Joey Hess <joey@kitenet.net>
|
|
-
|
|
- Licensed under the GNU GPL version 3 or higher.
|
|
-}
|
|
|
|
module Git.LsTree (
|
|
TreeItem(..),
|
|
lsTree,
|
|
parseLsTree
|
|
) where
|
|
|
|
import Numeric
|
|
import Control.Applicative
|
|
import System.Posix.Types
|
|
import qualified Data.ByteString.Lazy.Char8 as L
|
|
|
|
import Git
|
|
import Utility.SafeCommand
|
|
|
|
type Treeish = String
|
|
|
|
data TreeItem = TreeItem
|
|
{ mode :: FileMode
|
|
, typeobj :: String
|
|
, sha :: String
|
|
, file :: FilePath
|
|
} deriving Show
|
|
|
|
{- Lists the contents of a Treeish -}
|
|
lsTree :: Repo -> Treeish -> IO [TreeItem]
|
|
lsTree repo t = map parseLsTree <$>
|
|
pipeNullSplitB repo [Params "ls-tree --full-tree -z -r --", File t]
|
|
|
|
{- Parses a line of ls-tree output.
|
|
- (The --long format is not currently supported.) -}
|
|
parseLsTree :: L.ByteString -> TreeItem
|
|
parseLsTree l = TreeItem
|
|
{ mode = fst $ head $ readOct $ L.unpack m
|
|
, typeobj = L.unpack t
|
|
, sha = L.unpack s
|
|
, file = decodeGitFile $ L.unpack f
|
|
}
|
|
where
|
|
-- l = <mode> SP <type> SP <sha> TAB <file>
|
|
-- All fields are fixed, so we can pull them out of
|
|
-- specific positions in the line.
|
|
(m, past_m) = L.splitAt 7 l
|
|
(t, past_t) = L.splitAt 4 past_m
|
|
(s, past_s) = L.splitAt 40 $ L.tail past_t
|
|
f = L.tail past_s
|