forgejo/vendor/code.gitea.io/git/tree_entry.go

275 lines
7 KiB
Go
Raw Normal View History

2016-11-03 22:16:01 +00:00
// Copyright 2015 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 (
2017-06-18 00:30:23 +00:00
"fmt"
2017-06-20 05:05:32 +00:00
"path"
2017-06-28 14:43:58 +00:00
"path/filepath"
"runtime"
2016-11-03 22:16:01 +00:00
"sort"
"strconv"
"strings"
)
2016-12-22 09:30:52 +00:00
// EntryMode the type of the object in the git tree
2016-11-03 22:16:01 +00:00
type EntryMode int
// There are only a few file modes in Git. They look like unix file modes, but they can only be
// one of these.
const (
2016-12-22 09:30:52 +00:00
// EntryModeBlob
EntryModeBlob EntryMode = 0100644
// EntryModeExec
EntryModeExec EntryMode = 0100755
// EntryModeSymlink
EntryModeSymlink EntryMode = 0120000
// EntryModeCommit
EntryModeCommit EntryMode = 0160000
// EntryModeTree
EntryModeTree EntryMode = 0040000
2016-11-03 22:16:01 +00:00
)
2016-12-22 09:30:52 +00:00
// TreeEntry the leaf in the git tree
2016-11-03 22:16:01 +00:00
type TreeEntry struct {
2016-12-22 09:30:52 +00:00
ID SHA1
2016-11-03 22:16:01 +00:00
Type ObjectType
mode EntryMode
name string
ptree *Tree
commited bool
size int64
sized bool
}
2016-12-22 09:30:52 +00:00
// Name returns the name of the entry
2016-11-03 22:16:01 +00:00
func (te *TreeEntry) Name() string {
return te.name
}
2016-12-22 09:30:52 +00:00
// Size returns the size of the entry
2016-11-03 22:16:01 +00:00
func (te *TreeEntry) Size() int64 {
if te.IsDir() {
return 0
} else if te.sized {
return te.size
}
stdout, err := NewCommand("cat-file", "-s", te.ID.String()).RunInDir(te.ptree.repo.Path)
if err != nil {
return 0
}
te.sized = true
te.size, _ = strconv.ParseInt(strings.TrimSpace(stdout), 10, 64)
return te.size
}
2016-12-22 09:30:52 +00:00
// IsSubModule if the entry is a sub module
2016-11-03 22:16:01 +00:00
func (te *TreeEntry) IsSubModule() bool {
2016-12-22 09:30:52 +00:00
return te.mode == EntryModeCommit
2016-11-03 22:16:01 +00:00
}
2016-12-22 09:30:52 +00:00
// IsDir if the entry is a sub dir
2016-11-03 22:16:01 +00:00
func (te *TreeEntry) IsDir() bool {
2016-12-22 09:30:52 +00:00
return te.mode == EntryModeTree
2016-11-03 22:16:01 +00:00
}
2016-12-22 09:30:52 +00:00
// IsLink if the entry is a symlink
func (te *TreeEntry) IsLink() bool {
return te.mode == EntryModeSymlink
}
// Blob retrun the blob object the entry
2016-11-03 22:16:01 +00:00
func (te *TreeEntry) Blob() *Blob {
return &Blob{
repo: te.ptree.repo,
TreeEntry: te,
}
}
2016-12-28 16:35:52 +00:00
// GetSubJumpablePathName return the full path of subdirectory jumpable ( contains only one directory )
func (te *TreeEntry) GetSubJumpablePathName() string {
if te.IsSubModule() || !te.IsDir() {
return ""
}
tree, err := te.ptree.SubTree(te.name)
if err != nil {
return te.name
}
entries, _ := tree.ListEntries()
if len(entries) == 1 && entries[0].IsDir() {
name := entries[0].GetSubJumpablePathName()
if name != "" {
return te.name + "/" + name
}
}
return te.name
}
2016-12-22 09:30:52 +00:00
// Entries a list of entry
2016-11-03 22:16:01 +00:00
type Entries []*TreeEntry
type customSortableEntries struct {
Comparer func(s1, s2 string) bool
Entries
}
var sorter = []func(t1, t2 *TreeEntry, cmp func(s1, s2 string) bool) bool{
func(t1, t2 *TreeEntry, cmp func(s1, s2 string) bool) bool {
2016-11-03 22:16:01 +00:00
return (t1.IsDir() || t1.IsSubModule()) && !t2.IsDir() && !t2.IsSubModule()
},
func(t1, t2 *TreeEntry, cmp func(s1, s2 string) bool) bool {
return cmp(t1.name, t2.name)
2016-11-03 22:16:01 +00:00
},
}
func (ctes customSortableEntries) Len() int { return len(ctes.Entries) }
func (ctes customSortableEntries) Swap(i, j int) {
ctes.Entries[i], ctes.Entries[j] = ctes.Entries[j], ctes.Entries[i]
}
func (ctes customSortableEntries) Less(i, j int) bool {
t1, t2 := ctes.Entries[i], ctes.Entries[j]
2016-11-03 22:16:01 +00:00
var k int
for k = 0; k < len(sorter)-1; k++ {
2016-11-12 11:09:25 +00:00
s := sorter[k]
2016-11-03 22:16:01 +00:00
switch {
case s(t1, t2, ctes.Comparer):
2016-11-03 22:16:01 +00:00
return true
case s(t2, t1, ctes.Comparer):
2016-11-03 22:16:01 +00:00
return false
}
}
return sorter[k](t1, t2, ctes.Comparer)
2016-11-03 22:16:01 +00:00
}
2016-12-22 09:30:52 +00:00
// Sort sort the list of entry
2016-11-03 22:16:01 +00:00
func (tes Entries) Sort() {
sort.Sort(customSortableEntries{func(s1, s2 string) bool {
return s1 < s2
}, tes})
}
// CustomSort customizable string comparing sort entry list
func (tes Entries) CustomSort(cmp func(s1, s2 string) bool) {
sort.Sort(customSortableEntries{cmp, tes})
2016-11-03 22:16:01 +00:00
}
2017-06-28 14:43:58 +00:00
type commitInfo struct {
entryName string
infos []interface{}
err error
2016-11-03 22:16:01 +00:00
}
2017-06-28 14:43:58 +00:00
// GetCommitsInfo takes advantages of concurrency to speed up getting information
// of all commits that are corresponding to these entries. This method will automatically
// choose the right number of goroutine (concurrency) to use related of the host CPU.
2016-11-03 22:16:01 +00:00
func (tes Entries) GetCommitsInfo(commit *Commit, treePath string) ([][]interface{}, error) {
2017-06-28 14:43:58 +00:00
return tes.GetCommitsInfoWithCustomConcurrency(commit, treePath, 0)
}
2017-06-28 14:43:58 +00:00
// GetCommitsInfoWithCustomConcurrency takes advantages of concurrency to speed up getting information
// of all commits that are corresponding to these entries. If the given maxConcurrency is negative or
// equal to zero: the right number of goroutine (concurrency) to use will be chosen related of the
// host CPU.
func (tes Entries) GetCommitsInfoWithCustomConcurrency(commit *Commit, treePath string, maxConcurrency int) ([][]interface{}, error) {
if len(tes) == 0 {
return nil, nil
2016-11-03 22:16:01 +00:00
}
2017-06-28 14:43:58 +00:00
if maxConcurrency <= 0 {
maxConcurrency = runtime.NumCPU()
}
2017-06-20 05:05:32 +00:00
2017-06-28 14:43:58 +00:00
// Length of taskChan determines how many goroutines (subprocesses) can run at the same time.
// The length of revChan should be same as taskChan so goroutines whoever finished job can
// exit as early as possible, only store data inside channel.
taskChan := make(chan bool, maxConcurrency)
revChan := make(chan commitInfo, maxConcurrency)
doneChan := make(chan error)
// Receive loop will exit when it collects same number of data pieces as tree entries.
// It notifies doneChan before exits or notify early with possible error.
infoMap := make(map[string][]interface{}, len(tes))
go func() {
i := 0
for info := range revChan {
if info.err != nil {
doneChan <- info.err
return
}
2016-11-03 22:16:01 +00:00
2017-06-28 14:43:58 +00:00
infoMap[info.entryName] = info.infos
i++
if i == len(tes) {
2016-11-03 22:16:01 +00:00
break
}
2017-06-28 14:43:58 +00:00
}
doneChan <- nil
}()
for i := range tes {
// When taskChan is idle (or has empty slots), put operation will not block.
// However when taskChan is full, code will block and wait any running goroutines to finish.
taskChan <- true
if tes[i].Type != ObjectCommit {
go func(i int) {
cinfo := commitInfo{entryName: tes[i].Name()}
c, err := commit.GetCommitByPath(filepath.Join(treePath, tes[i].Name()))
2017-06-18 00:30:23 +00:00
if err != nil {
2017-06-28 14:43:58 +00:00
cinfo.err = fmt.Errorf("GetCommitByPath (%s/%s): %v", treePath, tes[i].Name(), err)
} else {
cinfo.infos = []interface{}{tes[i], c}
2017-06-18 00:30:23 +00:00
}
2017-06-28 14:43:58 +00:00
revChan <- cinfo
<-taskChan // Clear one slot from taskChan to allow new goroutines to start.
}(i)
continue
}
// Handle submodule
go func(i int) {
cinfo := commitInfo{entryName: tes[i].Name()}
sm, err := commit.GetSubModule(path.Join(treePath, tes[i].Name()))
if err != nil && !IsErrNotExist(err) {
cinfo.err = fmt.Errorf("GetSubModule (%s/%s): %v", treePath, tes[i].Name(), err)
revChan <- cinfo
return
2017-06-18 00:30:23 +00:00
}
2017-06-28 14:43:58 +00:00
smURL := ""
if sm != nil {
smURL = sm.URL
2017-06-23 00:06:43 +00:00
}
2017-06-28 14:43:58 +00:00
c, err := commit.GetCommitByPath(filepath.Join(treePath, tes[i].Name()))
if err != nil {
cinfo.err = fmt.Errorf("GetCommitByPath (%s/%s): %v", treePath, tes[i].Name(), err)
} else {
cinfo.infos = []interface{}{tes[i], NewSubModuleFile(c, smURL, tes[i].ID.String())}
}
revChan <- cinfo
<-taskChan
}(i)
2016-11-03 22:16:01 +00:00
}
2017-06-28 14:43:58 +00:00
if err := <-doneChan; err != nil {
return nil, err
2016-11-03 22:16:01 +00:00
}
2017-06-28 14:43:58 +00:00
commitsInfo := make([][]interface{}, len(tes))
for i := 0; i < len(tes); i++ {
commitsInfo[i] = infoMap[tes[i].Name()]
2016-11-03 22:16:01 +00:00
}
2017-06-28 14:43:58 +00:00
return commitsInfo, nil
2016-11-03 22:16:01 +00:00
}