mirror of
				https://codeberg.org/forgejo/forgejo.git
				synced 2025-11-04 00:11:04 +00:00 
			
		
		
		
	* Reduce calls to git cat-file -s There are multiple places where there are repeated calls to git cat-file -s due to the blobs not being created with their size. Through judicious use of git ls-tree -l and slight adjustments to the indexer code we can avoid a lot of these calls. * simplify by always expecting the long format * Also always set the sized field and tell the indexer the update is sized
		
			
				
	
	
		
			69 lines
		
	
	
	
		
			1.5 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			69 lines
		
	
	
	
		
			1.5 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
// Copyright 2020 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.
 | 
						|
 | 
						|
// +build !gogit
 | 
						|
 | 
						|
package git
 | 
						|
 | 
						|
import (
 | 
						|
	"strings"
 | 
						|
)
 | 
						|
 | 
						|
// Tree represents a flat directory listing.
 | 
						|
type Tree struct {
 | 
						|
	ID         SHA1
 | 
						|
	ResolvedID SHA1
 | 
						|
	repo       *Repository
 | 
						|
 | 
						|
	// parent tree
 | 
						|
	ptree *Tree
 | 
						|
 | 
						|
	entries       Entries
 | 
						|
	entriesParsed bool
 | 
						|
 | 
						|
	entriesRecursive       Entries
 | 
						|
	entriesRecursiveParsed bool
 | 
						|
}
 | 
						|
 | 
						|
// ListEntries returns all entries of current tree.
 | 
						|
func (t *Tree) ListEntries() (Entries, error) {
 | 
						|
	if t.entriesParsed {
 | 
						|
		return t.entries, nil
 | 
						|
	}
 | 
						|
 | 
						|
	stdout, err := NewCommand("ls-tree", "-l", t.ID.String()).RunInDirBytes(t.repo.Path)
 | 
						|
	if err != nil {
 | 
						|
		if strings.Contains(err.Error(), "fatal: Not a valid object name") || strings.Contains(err.Error(), "fatal: not a tree object") {
 | 
						|
			return nil, ErrNotExist{
 | 
						|
				ID: t.ID.String(),
 | 
						|
			}
 | 
						|
		}
 | 
						|
		return nil, err
 | 
						|
	}
 | 
						|
 | 
						|
	t.entries, err = parseTreeEntries(stdout, t)
 | 
						|
	if err == nil {
 | 
						|
		t.entriesParsed = true
 | 
						|
	}
 | 
						|
 | 
						|
	return t.entries, err
 | 
						|
}
 | 
						|
 | 
						|
// ListEntriesRecursive returns all entries of current tree recursively including all subtrees
 | 
						|
func (t *Tree) ListEntriesRecursive() (Entries, error) {
 | 
						|
	if t.entriesRecursiveParsed {
 | 
						|
		return t.entriesRecursive, nil
 | 
						|
	}
 | 
						|
	stdout, err := NewCommand("ls-tree", "-t", "-l", "-r", t.ID.String()).RunInDirBytes(t.repo.Path)
 | 
						|
	if err != nil {
 | 
						|
		return nil, err
 | 
						|
	}
 | 
						|
 | 
						|
	t.entriesRecursive, err = parseTreeEntries(stdout, t)
 | 
						|
	if err == nil {
 | 
						|
		t.entriesRecursiveParsed = true
 | 
						|
	}
 | 
						|
 | 
						|
	return t.entriesRecursive, err
 | 
						|
}
 |