tree.go 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124
  1. // Copyright 2014 The Gogs Authors. All rights reserved.
  2. // Use of this source code is governed by a MIT-style
  3. // license that can be found in the LICENSE file.
  4. package git
  5. import (
  6. "bytes"
  7. "errors"
  8. "strings"
  9. "github.com/Unknwon/com"
  10. )
  11. var (
  12. ErrNotExist = errors.New("error not exist")
  13. )
  14. // A tree is a flat directory listing.
  15. type Tree struct {
  16. Id sha1
  17. repo *Repository
  18. // parent tree
  19. ptree *Tree
  20. entries Entries
  21. entriesParsed bool
  22. }
  23. // Parse tree information from the (uncompressed) raw
  24. // data from the tree object.
  25. func parseTreeData(tree *Tree, data []byte) ([]*TreeEntry, error) {
  26. entries := make([]*TreeEntry, 0, 10)
  27. l := len(data)
  28. pos := 0
  29. for pos < l {
  30. entry := new(TreeEntry)
  31. entry.ptree = tree
  32. step := 6
  33. switch string(data[pos : pos+step]) {
  34. case "100644":
  35. entry.mode = ModeBlob
  36. entry.Type = BLOB
  37. case "100755":
  38. entry.mode = ModeExec
  39. entry.Type = BLOB
  40. case "120000":
  41. entry.mode = ModeSymlink
  42. entry.Type = BLOB
  43. case "160000":
  44. entry.mode = ModeCommit
  45. entry.Type = COMMIT
  46. case "040000":
  47. entry.mode = ModeTree
  48. entry.Type = TREE
  49. default:
  50. return nil, errors.New("unknown type: " + string(data[pos:pos+step]))
  51. }
  52. pos += step + 6 // Skip string type of entry type.
  53. step = 40
  54. id, err := NewIdFromString(string(data[pos : pos+step]))
  55. if err != nil {
  56. return nil, err
  57. }
  58. entry.Id = id
  59. pos += step + 1 // Skip half of sha1.
  60. step = bytes.IndexByte(data[pos:], '\n')
  61. entry.name = string(data[pos : pos+step])
  62. pos += step + 1
  63. entries = append(entries, entry)
  64. }
  65. return entries, nil
  66. }
  67. func (t *Tree) SubTree(rpath string) (*Tree, error) {
  68. if len(rpath) == 0 {
  69. return t, nil
  70. }
  71. paths := strings.Split(rpath, "/")
  72. var err error
  73. var g = t
  74. var p = t
  75. var te *TreeEntry
  76. for _, name := range paths {
  77. te, err = p.GetTreeEntryByPath(name)
  78. if err != nil {
  79. return nil, err
  80. }
  81. g, err = t.repo.getTree(te.Id)
  82. if err != nil {
  83. return nil, err
  84. }
  85. g.ptree = p
  86. p = g
  87. }
  88. return g, nil
  89. }
  90. func (t *Tree) ListEntries(relpath string) (Entries, error) {
  91. if t.entriesParsed {
  92. return t.entries, nil
  93. }
  94. t.entriesParsed = true
  95. stdout, _, err := com.ExecCmdDirBytes(t.repo.Path,
  96. "git", "ls-tree", t.Id.String())
  97. if err != nil {
  98. return nil, err
  99. }
  100. t.entries, err = parseTreeData(t, stdout)
  101. return t.entries, err
  102. }
  103. func NewTree(repo *Repository, id sha1) *Tree {
  104. tree := new(Tree)
  105. tree.Id = id
  106. tree.repo = repo
  107. return tree
  108. }