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.go 2.6KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. // Copyright 2019 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. package repofiles
  5. import (
  6. "fmt"
  7. "code.gitea.io/gitea/models"
  8. "code.gitea.io/gitea/modules/git"
  9. "code.gitea.io/gitea/modules/setting"
  10. api "code.gitea.io/gitea/modules/structs"
  11. )
  12. // GetTreeBySHA get the GitTreeResponse of a repository using a sha hash.
  13. func GetTreeBySHA(repo *models.Repository, sha string, page, perPage int, recursive bool) (*api.GitTreeResponse, error) {
  14. gitRepo, err := git.OpenRepository(repo.RepoPath())
  15. if err != nil {
  16. return nil, err
  17. }
  18. defer gitRepo.Close()
  19. gitTree, err := gitRepo.GetTree(sha)
  20. if err != nil || gitTree == nil {
  21. return nil, models.ErrSHANotFound{
  22. SHA: sha,
  23. }
  24. }
  25. tree := new(api.GitTreeResponse)
  26. tree.SHA = gitTree.ResolvedID.String()
  27. tree.URL = repo.APIURL() + "/git/trees/" + tree.SHA
  28. var entries git.Entries
  29. if recursive {
  30. entries, err = gitTree.ListEntriesRecursive()
  31. } else {
  32. entries, err = gitTree.ListEntries()
  33. }
  34. if err != nil {
  35. return nil, err
  36. }
  37. apiURL := repo.APIURL()
  38. apiURLLen := len(apiURL)
  39. // 51 is len(sha1) + len("/git/blobs/"). 40 + 11.
  40. blobURL := make([]byte, apiURLLen+51)
  41. copy(blobURL, apiURL)
  42. copy(blobURL[apiURLLen:], "/git/blobs/")
  43. // 51 is len(sha1) + len("/git/trees/"). 40 + 11.
  44. treeURL := make([]byte, apiURLLen+51)
  45. copy(treeURL, apiURL)
  46. copy(treeURL[apiURLLen:], "/git/trees/")
  47. // 40 is the size of the sha1 hash in hexadecimal format.
  48. copyPos := len(treeURL) - 40
  49. if perPage <= 0 || perPage > setting.API.DefaultGitTreesPerPage {
  50. perPage = setting.API.DefaultGitTreesPerPage
  51. }
  52. if page <= 0 {
  53. page = 1
  54. }
  55. tree.Page = page
  56. tree.TotalCount = len(entries)
  57. rangeStart := perPage * (page - 1)
  58. if rangeStart >= len(entries) {
  59. return tree, nil
  60. }
  61. var rangeEnd int
  62. if len(entries) > perPage {
  63. tree.Truncated = true
  64. }
  65. if rangeStart+perPage < len(entries) {
  66. rangeEnd = rangeStart + perPage
  67. } else {
  68. rangeEnd = len(entries)
  69. }
  70. tree.Entries = make([]api.GitEntry, rangeEnd-rangeStart)
  71. for e := rangeStart; e < rangeEnd; e++ {
  72. i := e - rangeStart
  73. tree.Entries[e].Path = entries[e].Name()
  74. tree.Entries[e].Mode = fmt.Sprintf("%06o", entries[e].Mode())
  75. tree.Entries[e].Type = entries[e].Type()
  76. tree.Entries[e].Size = entries[e].Size()
  77. tree.Entries[e].SHA = entries[e].ID.String()
  78. if entries[e].IsDir() {
  79. copy(treeURL[copyPos:], entries[e].ID.String())
  80. tree.Entries[i].URL = string(treeURL)
  81. } else {
  82. copy(blobURL[copyPos:], entries[e].ID.String())
  83. tree.Entries[i].URL = string(blobURL)
  84. }
  85. }
  86. return tree, nil
  87. }