mirrors/git-annex
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
git-annex/Git/LsTree.hs

52 lines
1.2 KiB
Haskell
Raw Normal View History

add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
{- git ls-tree interface
-
- Copyright 2011 Joey Hess <joey@kitenet.net>
-
- Licensed under the GNU GPL version 3 or higher.
-}
module Git.LsTree (
make unused check branches and tags too needs time and space optimisation
2011-09-28 20:43:10 +00:00
TreeItem(..),
Sped up unused. Added Git.ByteString which replaces Git IO methods with ones using lazy ByteStrings. This can be more efficient when large quantities of data are being read from git. In Git.LsTree, parse git ls-tree output more efficiently, thanks to ByteString. This benchmarks 25% faster, in a benchmark that includes (probably predominately) the run time for git ls-tree itself. In real world numbers, this makes git annex unused 2 seconds faster for each branch it needs to check, in my usual large repo.
2011-09-29 23:04:24 +00:00
lsTree,
parseLsTree
add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
) where
import Numeric
import Control.Applicative
use FileMode
2011-09-28 18:14:52 +00:00
import System.Posix.Types
Sped up unused. Added Git.ByteString which replaces Git IO methods with ones using lazy ByteStrings. This can be more efficient when large quantities of data are being read from git. In Git.LsTree, parse git ls-tree output more efficiently, thanks to ByteString. This benchmarks 25% faster, in a benchmark that includes (probably predominately) the run time for git ls-tree itself. In real world numbers, this makes git annex unused 2 seconds faster for each branch it needs to check, in my usual large repo.
2011-09-29 23:04:24 +00:00
import qualified Data.ByteString.Lazy.Char8 as L
add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
convert all git read/write functions to use ByteStrings 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.
2011-09-30 03:43:42 +00:00
import Git
split out two more Git modules
2011-12-13 19:22:43 +00:00
import qualified Git.Filename
add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
import Utility.SafeCommand
data TreeItem = TreeItem
use FileMode
2011-09-28 18:14:52 +00:00
{ mode :: FileMode
Sped up unused. Added Git.ByteString which replaces Git IO methods with ones using lazy ByteStrings. This can be more efficient when large quantities of data are being read from git. In Git.LsTree, parse git ls-tree output more efficiently, thanks to ByteString. This benchmarks 25% faster, in a benchmark that includes (probably predominately) the run time for git ls-tree itself. In real world numbers, this makes git annex unused 2 seconds faster for each branch it needs to check, in my usual large repo.
2011-09-29 23:04:24 +00:00
, typeobj :: String
add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
, sha :: String
, file :: FilePath
} deriving Show
improve type signatures with a Ref newtype In git, a Ref can be a Sha, or a Branch, or a Tag. I added type aliases for those. Note that this does not prevent mixing up of eg, refs and branches at the type level. Since git really doesn't care, except rare cases like git update-ref, or git tag -d, that seems ok for now. There's also a tree-ish, but let's just use Ref for it. A given Sha or Ref may or may not be a tree-ish, depending on the object type, so there seems no point in trying to represent it at the type level.
2011-11-16 06:23:34 +00:00
{- Lists the contents of a Ref -}
lsTree :: Ref -> Repo -> IO [TreeItem]
reorder repo parameters last Many functions took the repo as their first parameter. Changing it consistently to be the last parameter allows doing some useful things with currying, that reduce boilerplate. In particular, g <- gitRepo is almost never needed now, instead use inRepo to run an IO action in the repo, and fromRepo to get a value from the repo. This also provides more opportunities to use monadic and applicative combinators.
2011-11-08 19:34:10 +00:00
lsTree t repo = map parseLsTree <$>
improve type signatures with a Ref newtype In git, a Ref can be a Sha, or a Branch, or a Tag. I added type aliases for those. Note that this does not prevent mixing up of eg, refs and branches at the type level. Since git really doesn't care, except rare cases like git update-ref, or git tag -d, that seems ok for now. There's also a tree-ish, but let's just use Ref for it. A given Sha or Ref may or may not be a tree-ish, depending on the object type, so there seems no point in trying to represent it at the type level.
2011-11-16 06:23:34 +00:00
pipeNullSplitB [Params "ls-tree --full-tree -z -r --", File $ show t] repo
add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
{- Parses a line of ls-tree output.
- (The --long format is not currently supported.) -}
Sped up unused. Added Git.ByteString which replaces Git IO methods with ones using lazy ByteStrings. This can be more efficient when large quantities of data are being read from git. In Git.LsTree, parse git ls-tree output more efficiently, thanks to ByteString. This benchmarks 25% faster, in a benchmark that includes (probably predominately) the run time for git ls-tree itself. In real world numbers, this makes git annex unused 2 seconds faster for each branch it needs to check, in my usual large repo.
2011-09-29 23:04:24 +00:00
parseLsTree :: L.ByteString -> TreeItem
layout
2011-09-30 02:31:20 +00:00
parseLsTree l = TreeItem
{ mode = fst $ head $ readOct $ L.unpack m
, typeobj = L.unpack t
, sha = L.unpack s
split out two more Git modules
2011-12-13 19:22:43 +00:00
, file = Git.Filename.decode $ L.unpack f
layout
2011-09-30 02:31:20 +00:00
}
add ls-tree interface This parser should be fast. I hope.
2011-09-28 18:03:59 +00:00
where
-- l = <mode> SP <type> SP <sha> TAB <file>
Sped up unused. Added Git.ByteString which replaces Git IO methods with ones using lazy ByteStrings. This can be more efficient when large quantities of data are being read from git. In Git.LsTree, parse git ls-tree output more efficiently, thanks to ByteString. This benchmarks 25% faster, in a benchmark that includes (probably predominately) the run time for git ls-tree itself. In real world numbers, this makes git annex unused 2 seconds faster for each branch it needs to check, in my usual large repo.
2011-09-29 23:04:24 +00:00
-- 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
Reference in a new issue Copy permalink