mirror of
https://github.com/stashapp/stash.git
synced 2026-02-28 18:22:59 +01:00
* Add basename field to folder * Add parent_folders field to folder * Add basename column to folder table * Add basename filter field * Create missing folder hierarchies during migration * Treat files/folders in zips where path can't be made relative as not found Addresses an issue during clean where corrupt folder entries in zip files could not be removed due to an error during the call to Rel.
225 lines
6.2 KiB
Go
225 lines
6.2 KiB
Go
// Code generated by github.com/vektah/dataloaden, DO NOT EDIT.
|
|
|
|
package loaders
|
|
|
|
import (
|
|
"sync"
|
|
"time"
|
|
|
|
"github.com/stashapp/stash/pkg/models"
|
|
)
|
|
|
|
// FolderParentFolderIDsLoaderConfig captures the config to create a new FolderParentFolderIDsLoader
|
|
type FolderParentFolderIDsLoaderConfig struct {
|
|
// Fetch is a method that provides the data for the loader
|
|
Fetch func(keys []models.FolderID) ([][]models.FolderID, []error)
|
|
|
|
// Wait is how long wait before sending a batch
|
|
Wait time.Duration
|
|
|
|
// MaxBatch will limit the maximum number of keys to send in one batch, 0 = not limit
|
|
MaxBatch int
|
|
}
|
|
|
|
// NewFolderParentFolderIDsLoader creates a new FolderParentFolderIDsLoader given a fetch, wait, and maxBatch
|
|
func NewFolderParentFolderIDsLoader(config FolderParentFolderIDsLoaderConfig) *FolderParentFolderIDsLoader {
|
|
return &FolderParentFolderIDsLoader{
|
|
fetch: config.Fetch,
|
|
wait: config.Wait,
|
|
maxBatch: config.MaxBatch,
|
|
}
|
|
}
|
|
|
|
// FolderParentFolderIDsLoader batches and caches requests
|
|
type FolderParentFolderIDsLoader struct {
|
|
// this method provides the data for the loader
|
|
fetch func(keys []models.FolderID) ([][]models.FolderID, []error)
|
|
|
|
// how long to done before sending a batch
|
|
wait time.Duration
|
|
|
|
// this will limit the maximum number of keys to send in one batch, 0 = no limit
|
|
maxBatch int
|
|
|
|
// INTERNAL
|
|
|
|
// lazily created cache
|
|
cache map[models.FolderID][]models.FolderID
|
|
|
|
// the current batch. keys will continue to be collected until timeout is hit,
|
|
// then everything will be sent to the fetch method and out to the listeners
|
|
batch *folderParentFolderIDsLoaderBatch
|
|
|
|
// mutex to prevent races
|
|
mu sync.Mutex
|
|
}
|
|
|
|
type folderParentFolderIDsLoaderBatch struct {
|
|
keys []models.FolderID
|
|
data [][]models.FolderID
|
|
error []error
|
|
closing bool
|
|
done chan struct{}
|
|
}
|
|
|
|
// Load a FolderID by key, batching and caching will be applied automatically
|
|
func (l *FolderParentFolderIDsLoader) Load(key models.FolderID) ([]models.FolderID, error) {
|
|
return l.LoadThunk(key)()
|
|
}
|
|
|
|
// LoadThunk returns a function that when called will block waiting for a FolderID.
|
|
// This method should be used if you want one goroutine to make requests to many
|
|
// different data loaders without blocking until the thunk is called.
|
|
func (l *FolderParentFolderIDsLoader) LoadThunk(key models.FolderID) func() ([]models.FolderID, error) {
|
|
l.mu.Lock()
|
|
if it, ok := l.cache[key]; ok {
|
|
l.mu.Unlock()
|
|
return func() ([]models.FolderID, error) {
|
|
return it, nil
|
|
}
|
|
}
|
|
if l.batch == nil {
|
|
l.batch = &folderParentFolderIDsLoaderBatch{done: make(chan struct{})}
|
|
}
|
|
batch := l.batch
|
|
pos := batch.keyIndex(l, key)
|
|
l.mu.Unlock()
|
|
|
|
return func() ([]models.FolderID, error) {
|
|
<-batch.done
|
|
|
|
var data []models.FolderID
|
|
if pos < len(batch.data) {
|
|
data = batch.data[pos]
|
|
}
|
|
|
|
var err error
|
|
// its convenient to be able to return a single error for everything
|
|
if len(batch.error) == 1 {
|
|
err = batch.error[0]
|
|
} else if batch.error != nil {
|
|
err = batch.error[pos]
|
|
}
|
|
|
|
if err == nil {
|
|
l.mu.Lock()
|
|
l.unsafeSet(key, data)
|
|
l.mu.Unlock()
|
|
}
|
|
|
|
return data, err
|
|
}
|
|
}
|
|
|
|
// LoadAll fetches many keys at once. It will be broken into appropriate sized
|
|
// sub batches depending on how the loader is configured
|
|
func (l *FolderParentFolderIDsLoader) LoadAll(keys []models.FolderID) ([][]models.FolderID, []error) {
|
|
results := make([]func() ([]models.FolderID, error), len(keys))
|
|
|
|
for i, key := range keys {
|
|
results[i] = l.LoadThunk(key)
|
|
}
|
|
|
|
folderIDs := make([][]models.FolderID, len(keys))
|
|
errors := make([]error, len(keys))
|
|
for i, thunk := range results {
|
|
folderIDs[i], errors[i] = thunk()
|
|
}
|
|
return folderIDs, errors
|
|
}
|
|
|
|
// LoadAllThunk returns a function that when called will block waiting for a FolderIDs.
|
|
// This method should be used if you want one goroutine to make requests to many
|
|
// different data loaders without blocking until the thunk is called.
|
|
func (l *FolderParentFolderIDsLoader) LoadAllThunk(keys []models.FolderID) func() ([][]models.FolderID, []error) {
|
|
results := make([]func() ([]models.FolderID, error), len(keys))
|
|
for i, key := range keys {
|
|
results[i] = l.LoadThunk(key)
|
|
}
|
|
return func() ([][]models.FolderID, []error) {
|
|
folderIDs := make([][]models.FolderID, len(keys))
|
|
errors := make([]error, len(keys))
|
|
for i, thunk := range results {
|
|
folderIDs[i], errors[i] = thunk()
|
|
}
|
|
return folderIDs, errors
|
|
}
|
|
}
|
|
|
|
// Prime the cache with the provided key and value. If the key already exists, no change is made
|
|
// and false is returned.
|
|
// (To forcefully prime the cache, clear the key first with loader.clear(key).prime(key, value).)
|
|
func (l *FolderParentFolderIDsLoader) Prime(key models.FolderID, value []models.FolderID) bool {
|
|
l.mu.Lock()
|
|
var found bool
|
|
if _, found = l.cache[key]; !found {
|
|
// make a copy when writing to the cache, its easy to pass a pointer in from a loop var
|
|
// and end up with the whole cache pointing to the same value.
|
|
cpy := make([]models.FolderID, len(value))
|
|
copy(cpy, value)
|
|
l.unsafeSet(key, cpy)
|
|
}
|
|
l.mu.Unlock()
|
|
return !found
|
|
}
|
|
|
|
// Clear the value at key from the cache, if it exists
|
|
func (l *FolderParentFolderIDsLoader) Clear(key models.FolderID) {
|
|
l.mu.Lock()
|
|
delete(l.cache, key)
|
|
l.mu.Unlock()
|
|
}
|
|
|
|
func (l *FolderParentFolderIDsLoader) unsafeSet(key models.FolderID, value []models.FolderID) {
|
|
if l.cache == nil {
|
|
l.cache = map[models.FolderID][]models.FolderID{}
|
|
}
|
|
l.cache[key] = value
|
|
}
|
|
|
|
// keyIndex will return the location of the key in the batch, if its not found
|
|
// it will add the key to the batch
|
|
func (b *folderParentFolderIDsLoaderBatch) keyIndex(l *FolderParentFolderIDsLoader, key models.FolderID) int {
|
|
for i, existingKey := range b.keys {
|
|
if key == existingKey {
|
|
return i
|
|
}
|
|
}
|
|
|
|
pos := len(b.keys)
|
|
b.keys = append(b.keys, key)
|
|
if pos == 0 {
|
|
go b.startTimer(l)
|
|
}
|
|
|
|
if l.maxBatch != 0 && pos >= l.maxBatch-1 {
|
|
if !b.closing {
|
|
b.closing = true
|
|
l.batch = nil
|
|
go b.end(l)
|
|
}
|
|
}
|
|
|
|
return pos
|
|
}
|
|
|
|
func (b *folderParentFolderIDsLoaderBatch) startTimer(l *FolderParentFolderIDsLoader) {
|
|
time.Sleep(l.wait)
|
|
l.mu.Lock()
|
|
|
|
// we must have hit a batch limit and are already finalizing this batch
|
|
if b.closing {
|
|
l.mu.Unlock()
|
|
return
|
|
}
|
|
|
|
l.batch = nil
|
|
l.mu.Unlock()
|
|
|
|
b.end(l)
|
|
}
|
|
|
|
func (b *folderParentFolderIDsLoaderBatch) end(l *FolderParentFolderIDsLoader) {
|
|
b.data, b.error = l.fetch(b.keys)
|
|
close(b.done)
|
|
}
|