mirror of
https://gitee.com/gitea/gitea.git
synced 2024-12-05 13:19:00 +08:00
104 lines
2.5 KiB
Go
104 lines
2.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 (
|
||
|
"path"
|
||
|
)
|
||
|
|
||
|
// LastCommitCache represents a cache to store last commit
|
||
|
type LastCommitCache struct {
|
||
|
repoPath string
|
||
|
ttl int64
|
||
|
repo *Repository
|
||
|
commitCache map[string]*Commit
|
||
|
cache Cache
|
||
|
}
|
||
|
|
||
|
// NewLastCommitCache creates a new last commit cache for repo
|
||
|
func NewLastCommitCache(repoPath string, gitRepo *Repository, ttl int64, cache Cache) *LastCommitCache {
|
||
|
if cache == nil {
|
||
|
return nil
|
||
|
}
|
||
|
return &LastCommitCache{
|
||
|
repoPath: repoPath,
|
||
|
repo: gitRepo,
|
||
|
commitCache: make(map[string]*Commit),
|
||
|
ttl: ttl,
|
||
|
cache: cache,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// Get get the last commit information by commit id and entry path
|
||
|
func (c *LastCommitCache) Get(ref, entryPath string) (interface{}, error) {
|
||
|
v := c.cache.Get(c.getCacheKey(c.repoPath, ref, entryPath))
|
||
|
if vs, ok := v.(string); ok {
|
||
|
log("LastCommitCache hit level 1: [%s:%s:%s]", ref, entryPath, vs)
|
||
|
if commit, ok := c.commitCache[vs]; ok {
|
||
|
log("LastCommitCache hit level 2: [%s:%s:%s]", ref, entryPath, vs)
|
||
|
return commit, nil
|
||
|
}
|
||
|
id, err := c.repo.ConvertToSHA1(vs)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
commit, err := c.repo.getCommit(id)
|
||
|
if err != nil {
|
||
|
return nil, err
|
||
|
}
|
||
|
c.commitCache[vs] = commit
|
||
|
return commit, nil
|
||
|
}
|
||
|
return nil, nil
|
||
|
}
|
||
|
|
||
|
// CacheCommit will cache the commit from the gitRepository
|
||
|
func (c *LastCommitCache) CacheCommit(commit *Commit) error {
|
||
|
return c.recursiveCache(commit, &commit.Tree, "", 1)
|
||
|
}
|
||
|
|
||
|
func (c *LastCommitCache) recursiveCache(commit *Commit, tree *Tree, treePath string, level int) error {
|
||
|
if level == 0 {
|
||
|
return nil
|
||
|
}
|
||
|
|
||
|
entries, err := tree.ListEntries()
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
entryPaths := make([]string, len(entries))
|
||
|
entryMap := make(map[string]*TreeEntry)
|
||
|
for i, entry := range entries {
|
||
|
entryPaths[i] = entry.Name()
|
||
|
entryMap[entry.Name()] = entry
|
||
|
}
|
||
|
|
||
|
commits, err := GetLastCommitForPaths(commit, treePath, entryPaths)
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
|
||
|
for i, entryCommit := range commits {
|
||
|
entry := entryPaths[i]
|
||
|
if err := c.Put(commit.ID.String(), path.Join(treePath, entryPaths[i]), entryCommit.ID.String()); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if entryMap[entry].IsDir() {
|
||
|
subTree, err := tree.SubTree(entry)
|
||
|
if err != nil {
|
||
|
return err
|
||
|
}
|
||
|
if err := c.recursiveCache(commit, subTree, entry, level-1); err != nil {
|
||
|
return err
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return nil
|
||
|
}
|