|
- // Copyright 2015 The Gogs Authors. All rights reserved.
- // Copyright 2019 The Gitea 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 (
- "io"
- "sort"
- "strings"
-
- "gopkg.in/src-d/go-git.v4/plumbing"
- "gopkg.in/src-d/go-git.v4/plumbing/filemode"
- "gopkg.in/src-d/go-git.v4/plumbing/object"
- )
-
- // EntryMode the type of the object in the git tree
- 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 (
- // EntryModeBlob
- EntryModeBlob EntryMode = 0100644
- // EntryModeExec
- EntryModeExec EntryMode = 0100755
- // EntryModeSymlink
- EntryModeSymlink EntryMode = 0120000
- // EntryModeCommit
- EntryModeCommit EntryMode = 0160000
- // EntryModeTree
- EntryModeTree EntryMode = 0040000
- )
-
- // TreeEntry the leaf in the git tree
- type TreeEntry struct {
- ID SHA1
-
- gogitTreeEntry *object.TreeEntry
- ptree *Tree
-
- size int64
- sized bool
- fullName string
- }
-
- // Name returns the name of the entry
- func (te *TreeEntry) Name() string {
- if te.fullName != "" {
- return te.fullName
- }
- return te.gogitTreeEntry.Name
- }
-
- // Mode returns the mode of the entry
- func (te *TreeEntry) Mode() EntryMode {
- return EntryMode(te.gogitTreeEntry.Mode)
- }
-
- // Type returns the type of the entry (commit, tree, blob)
- func (te *TreeEntry) Type() string {
- switch te.Mode() {
- case EntryModeCommit:
- return "commit"
- case EntryModeTree:
- return "tree"
- default:
- return "blob"
- }
- }
-
- // Size returns the size of the entry
- func (te *TreeEntry) Size() int64 {
- if te.IsDir() {
- return 0
- } else if te.sized {
- return te.size
- }
-
- file, err := te.ptree.gogitTree.TreeEntryFile(te.gogitTreeEntry)
- if err != nil {
- return 0
- }
-
- te.sized = true
- te.size = file.Size
- return te.size
- }
-
- // IsSubModule if the entry is a sub module
- func (te *TreeEntry) IsSubModule() bool {
- return te.gogitTreeEntry.Mode == filemode.Submodule
- }
-
- // IsDir if the entry is a sub dir
- func (te *TreeEntry) IsDir() bool {
- return te.gogitTreeEntry.Mode == filemode.Dir
- }
-
- // IsLink if the entry is a symlink
- func (te *TreeEntry) IsLink() bool {
- return te.gogitTreeEntry.Mode == filemode.Symlink
- }
-
- // IsRegular if the entry is a regular file
- func (te *TreeEntry) IsRegular() bool {
- return te.gogitTreeEntry.Mode == filemode.Regular
- }
-
- // IsExecutable if the entry is an executable file (not necessarily binary)
- func (te *TreeEntry) IsExecutable() bool {
- return te.gogitTreeEntry.Mode == filemode.Executable
- }
-
- // Blob returns the blob object the entry
- func (te *TreeEntry) Blob() *Blob {
- encodedObj, err := te.ptree.repo.gogitRepo.Storer.EncodedObject(plumbing.AnyObject, te.gogitTreeEntry.Hash)
- if err != nil {
- return nil
- }
-
- return &Blob{
- ID: te.gogitTreeEntry.Hash,
- gogitEncodedObj: encodedObj,
- name: te.Name(),
- }
- }
-
- // FollowLink returns the entry pointed to by a symlink
- func (te *TreeEntry) FollowLink() (*TreeEntry, error) {
- if !te.IsLink() {
- return nil, ErrBadLink{te.Name(), "not a symlink"}
- }
-
- // read the link
- r, err := te.Blob().DataAsync()
- if err != nil {
- return nil, err
- }
- defer r.Close()
- buf := make([]byte, te.Size())
- _, err = io.ReadFull(r, buf)
- if err != nil {
- return nil, err
- }
-
- lnk := string(buf)
- t := te.ptree
-
- // traverse up directories
- for ; t != nil && strings.HasPrefix(lnk, "../"); lnk = lnk[3:] {
- t = t.ptree
- }
-
- if t == nil {
- return nil, ErrBadLink{te.Name(), "points outside of repo"}
- }
-
- target, err := t.GetTreeEntryByPath(lnk)
- if err != nil {
- if IsErrNotExist(err) {
- return nil, ErrBadLink{te.Name(), "broken link"}
- }
- return nil, err
- }
- return target, nil
- }
-
- // 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()
- }
-
- // Entries a list of entry
- 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 {
- 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())
- },
- }
-
- 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]
- var k int
- for k = 0; k < len(sorter)-1; k++ {
- s := sorter[k]
- switch {
- case s(t1, t2, ctes.Comparer):
- return true
- case s(t2, t1, ctes.Comparer):
- return false
- }
- }
- return sorter[k](t1, t2, ctes.Comparer)
- }
-
- // Sort sort the list of entry
- 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})
- }
|