mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-10-31 11:42:25 -05:00 
			
		
		
		
	* add automatic cache max size generation based on ratios of a singular fixed memory target
Signed-off-by: kim <grufwub@gmail.com>
* remove now-unused cache max-size config variables
Signed-off-by: kim <grufwub@gmail.com>
* slight ratio tweak
Signed-off-by: kim <grufwub@gmail.com>
* remove unused visibility config var
Signed-off-by: kim <grufwub@gmail.com>
* add secret little ratio config trick
Signed-off-by: kim <grufwub@gmail.com>
* fixed a word
Signed-off-by: kim <grufwub@gmail.com>
* update cache library to remove use of TTL in result caches + slice cache
Signed-off-by: kim <grufwub@gmail.com>
* update other cache usages to use correct interface
Signed-off-by: kim <grufwub@gmail.com>
* update example config to explain the cache memory target
Signed-off-by: kim <grufwub@gmail.com>
* update env parsing test with new config values
Signed-off-by: kim <grufwub@gmail.com>
* do some ratio twiddling
Signed-off-by: kim <grufwub@gmail.com>
* add missing header
* update envparsing with latest defaults
Signed-off-by: kim <grufwub@gmail.com>
* update size calculations to take into account result cache, simple cache and extra map overheads
Signed-off-by: kim <grufwub@gmail.com>
* tweak the ratios some more
Signed-off-by: kim <grufwub@gmail.com>
* more nan rampaging
Signed-off-by: kim <grufwub@gmail.com>
* fix envparsing script
Signed-off-by: kim <grufwub@gmail.com>
* update cache library, add sweep function to keep caches trim
Signed-off-by: kim <grufwub@gmail.com>
* sweep caches once a minute
Signed-off-by: kim <grufwub@gmail.com>
* add a regular job to sweep caches and keep under 80% utilisation
Signed-off-by: kim <grufwub@gmail.com>
* remove dead code
Signed-off-by: kim <grufwub@gmail.com>
* add new size library used to libraries section of readme
Signed-off-by: kim <grufwub@gmail.com>
* add better explanations for the mem-ratio numbers
Signed-off-by: kim <grufwub@gmail.com>
* update go-cache
Signed-off-by: kim <grufwub@gmail.com>
* library version bump
Signed-off-by: kim <grufwub@gmail.com>
* update cache.result{} size model estimation
Signed-off-by: kim <grufwub@gmail.com>
---------
Signed-off-by: kim <grufwub@gmail.com>
		
	
			
		
			
				
	
	
		
			76 lines
		
	
	
	
		
			2.2 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			76 lines
		
	
	
	
		
			2.2 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| // GoToSocial
 | |
| // Copyright (C) GoToSocial Authors admin@gotosocial.org
 | |
| // SPDX-License-Identifier: AGPL-3.0-or-later
 | |
| //
 | |
| // This program is free software: you can redistribute it and/or modify
 | |
| // it under the terms of the GNU Affero General Public License as published by
 | |
| // the Free Software Foundation, either version 3 of the License, or
 | |
| // (at your option) any later version.
 | |
| //
 | |
| // This program is distributed in the hope that it will be useful,
 | |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of
 | |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | |
| // GNU Affero General Public License for more details.
 | |
| //
 | |
| // You should have received a copy of the GNU Affero General Public License
 | |
| // along with this program.  If not, see <http://www.gnu.org/licenses/>.
 | |
| 
 | |
| package cache
 | |
| 
 | |
| import (
 | |
| 	"codeberg.org/gruf/go-cache/v3/simple"
 | |
| 	"golang.org/x/exp/slices"
 | |
| )
 | |
| 
 | |
| // SliceCache wraps a ttl.Cache to provide simple loader-callback
 | |
| // functions for fetching + caching slices of objects (e.g. IDs).
 | |
| type SliceCache[T any] struct {
 | |
| 	*simple.Cache[string, []T]
 | |
| }
 | |
| 
 | |
| // Load will attempt to load an existing slice from the cache for the given key, else calling the provided load function and caching the result.
 | |
| func (c *SliceCache[T]) Load(key string, load func() ([]T, error)) ([]T, error) {
 | |
| 	// Look for follow IDs list in cache under this key.
 | |
| 	data, ok := c.Get(key)
 | |
| 
 | |
| 	if !ok {
 | |
| 		var err error
 | |
| 
 | |
| 		// Not cached, load!
 | |
| 		data, err = load()
 | |
| 		if err != nil {
 | |
| 			return nil, err
 | |
| 		}
 | |
| 
 | |
| 		// Store the data.
 | |
| 		c.Set(key, data)
 | |
| 	}
 | |
| 
 | |
| 	// Return data clone for safety.
 | |
| 	return slices.Clone(data), nil
 | |
| }
 | |
| 
 | |
| // LoadRange is functionally the same as .Load(), but will pass the result through provided reslice function before returning a cloned result.
 | |
| func (c *SliceCache[T]) LoadRange(key string, load func() ([]T, error), reslice func([]T) []T) ([]T, error) {
 | |
| 	// Look for follow IDs list in cache under this key.
 | |
| 	data, ok := c.Get(key)
 | |
| 
 | |
| 	if !ok {
 | |
| 		var err error
 | |
| 
 | |
| 		// Not cached, load!
 | |
| 		data, err = load()
 | |
| 		if err != nil {
 | |
| 			return nil, err
 | |
| 		}
 | |
| 
 | |
| 		// Store the data.
 | |
| 		c.Set(key, data)
 | |
| 	}
 | |
| 
 | |
| 	// Reslice to range.
 | |
| 	slice := reslice(data)
 | |
| 
 | |
| 	// Return range clone for safety.
 | |
| 	return slices.Clone(slice), nil
 | |
| }
 |