summaryrefslogtreecommitdiffstats
path: root/modules/git/tree.go
diff options
context:
space:
mode:
authorUnknwon <joe2010xtmf@163.com>2014-07-26 00:24:27 -0400
committerUnknwon <joe2010xtmf@163.com>2014-07-26 00:24:27 -0400
commit8dd07c0ddd99ae626a1ec8c06f75f27fed51269f (patch)
tree261d3c9911dabc58c1ac54e4e36b3dee24d2032b /modules/git/tree.go
parent0a739cf9ac901f54484c34bba8322418dedb09b0 (diff)
downloadgitea-8dd07c0ddd99ae626a1ec8c06f75f27fed51269f.tar.gz
gitea-8dd07c0ddd99ae626a1ec8c06f75f27fed51269f.zip
New UI merge in progress
Diffstat (limited to 'modules/git/tree.go')
-rw-r--r--modules/git/tree.go124
1 files changed, 124 insertions, 0 deletions
diff --git a/modules/git/tree.go b/modules/git/tree.go
new file mode 100644
index 0000000000..03152c34ac
--- /dev/null
+++ b/modules/git/tree.go
@@ -0,0 +1,124 @@
+// Copyright 2014 The Gogs Authors. All rights reserved.
+// Use of this source code is governed by a MIT-style
+// license that can be found in the LICENSE file.
+
+package git
+
+import (
+ "bytes"
+ "errors"
+ "strings"
+
+ "github.com/Unknwon/com"
+)
+
+var (
+ ErrNotExist = errors.New("error not exist")
+)
+
+// A tree is a flat directory listing.
+type Tree struct {
+ Id sha1
+ repo *Repository
+
+ // parent tree
+ ptree *Tree
+
+ entries Entries
+ entriesParsed bool
+}
+
+// Parse tree information from the (uncompressed) raw
+// data from the tree object.
+func parseTreeData(tree *Tree, data []byte) ([]*TreeEntry, error) {
+ entries := make([]*TreeEntry, 0, 10)
+ l := len(data)
+ pos := 0
+ for pos < l {
+ entry := new(TreeEntry)
+ entry.ptree = tree
+ step := 6
+ switch string(data[pos : pos+step]) {
+ case "100644":
+ entry.mode = ModeBlob
+ entry.Type = BLOB
+ case "100755":
+ entry.mode = ModeExec
+ entry.Type = BLOB
+ case "120000":
+ entry.mode = ModeSymlink
+ entry.Type = BLOB
+ case "160000":
+ entry.mode = ModeCommit
+ entry.Type = COMMIT
+ case "040000":
+ entry.mode = ModeTree
+ entry.Type = TREE
+ default:
+ return nil, errors.New("unknown type: " + string(data[pos:pos+step]))
+ }
+ pos += step + 6 // Skip string type of entry type.
+
+ step = 40
+ id, err := NewIdFromString(string(data[pos : pos+step]))
+ if err != nil {
+ return nil, err
+ }
+ entry.Id = id
+ pos += step + 1 // Skip half of sha1.
+
+ step = bytes.IndexByte(data[pos:], '\n')
+ entry.name = string(data[pos : pos+step])
+ pos += step + 1
+ entries = append(entries, entry)
+ }
+ return entries, nil
+}
+
+func (t *Tree) SubTree(rpath string) (*Tree, error) {
+ if len(rpath) == 0 {
+ return t, nil
+ }
+
+ paths := strings.Split(rpath, "/")
+ var err error
+ var g = t
+ var p = t
+ var te *TreeEntry
+ for _, name := range paths {
+ te, err = p.GetTreeEntryByPath(name)
+ if err != nil {
+ return nil, err
+ }
+
+ g, err = t.repo.getTree(te.Id)
+ if err != nil {
+ return nil, err
+ }
+ g.ptree = p
+ p = g
+ }
+ return g, nil
+}
+
+func (t *Tree) ListEntries(relpath string) (Entries, error) {
+ if t.entriesParsed {
+ return t.entries, nil
+ }
+ t.entriesParsed = true
+
+ stdout, _, err := com.ExecCmdDirBytes(t.repo.Path,
+ "git", "ls-tree", t.Id.String())
+ if err != nil {
+ return nil, err
+ }
+ t.entries, err = parseTreeData(t, stdout)
+ return t.entries, err
+}
+
+func NewTree(repo *Repository, id sha1) *Tree {
+ tree := new(Tree)
+ tree.Id = id
+ tree.repo = repo
+ return tree
+}