You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

tree_nogogit.go 2.6KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120
  1. // Copyright 2020 The Gitea 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. //go:build !gogit
  5. package git
  6. import (
  7. "io"
  8. "math"
  9. "strings"
  10. )
  11. // Tree represents a flat directory listing.
  12. type Tree struct {
  13. ID SHA1
  14. ResolvedID SHA1
  15. repo *Repository
  16. // parent tree
  17. ptree *Tree
  18. entries Entries
  19. entriesParsed bool
  20. entriesRecursive Entries
  21. entriesRecursiveParsed bool
  22. }
  23. // ListEntries returns all entries of current tree.
  24. func (t *Tree) ListEntries() (Entries, error) {
  25. if t.entriesParsed {
  26. return t.entries, nil
  27. }
  28. if t.repo != nil {
  29. wr, rd, cancel := t.repo.CatFileBatch(t.repo.Ctx)
  30. defer cancel()
  31. _, _ = wr.Write([]byte(t.ID.String() + "\n"))
  32. _, typ, sz, err := ReadBatchLine(rd)
  33. if err != nil {
  34. return nil, err
  35. }
  36. if typ == "commit" {
  37. treeID, err := ReadTreeID(rd, sz)
  38. if err != nil && err != io.EOF {
  39. return nil, err
  40. }
  41. _, _ = wr.Write([]byte(treeID + "\n"))
  42. _, typ, sz, err = ReadBatchLine(rd)
  43. if err != nil {
  44. return nil, err
  45. }
  46. }
  47. if typ == "tree" {
  48. t.entries, err = catBatchParseTreeEntries(t, rd, sz)
  49. if err != nil {
  50. return nil, err
  51. }
  52. t.entriesParsed = true
  53. return t.entries, nil
  54. }
  55. // Not a tree just use ls-tree instead
  56. for sz > math.MaxInt32 {
  57. discarded, err := rd.Discard(math.MaxInt32)
  58. sz -= int64(discarded)
  59. if err != nil {
  60. return nil, err
  61. }
  62. }
  63. for sz > 0 {
  64. discarded, err := rd.Discard(int(sz))
  65. sz -= int64(discarded)
  66. if err != nil {
  67. return nil, err
  68. }
  69. }
  70. }
  71. stdout, _, runErr := NewCommand(t.repo.Ctx, "ls-tree", "-l", t.ID.String()).RunStdBytes(&RunOpts{Dir: t.repo.Path})
  72. if runErr != nil {
  73. if strings.Contains(runErr.Error(), "fatal: Not a valid object name") || strings.Contains(runErr.Error(), "fatal: not a tree object") {
  74. return nil, ErrNotExist{
  75. ID: t.ID.String(),
  76. }
  77. }
  78. return nil, runErr
  79. }
  80. var err error
  81. t.entries, err = parseTreeEntries(stdout, t)
  82. if err == nil {
  83. t.entriesParsed = true
  84. }
  85. return t.entries, err
  86. }
  87. // ListEntriesRecursive returns all entries of current tree recursively including all subtrees
  88. func (t *Tree) ListEntriesRecursive() (Entries, error) {
  89. if t.entriesRecursiveParsed {
  90. return t.entriesRecursive, nil
  91. }
  92. stdout, _, runErr := NewCommand(t.repo.Ctx, "ls-tree", "-t", "-l", "-r", t.ID.String()).RunStdBytes(&RunOpts{Dir: t.repo.Path})
  93. if runErr != nil {
  94. return nil, runErr
  95. }
  96. var err error
  97. t.entriesRecursive, err = parseTreeEntries(stdout, t)
  98. if err == nil {
  99. t.entriesRecursiveParsed = true
  100. }
  101. return t.entriesRecursive, err
  102. }