mirror of
https://github.com/hanzoai/volume.git
synced 2026-11-02 12:11:53 +00:00
zeekay
b61441f7d7
A fork of Rancher's local-path-provisioner at v0.0.36. The behaviour is unchanged and deliberately so — a directory on the node a pod lands on is the right thing for a disk. What changes is identity. The provisioner answers to hanzo.ai/volume rather than rancher.io/local-path. That is not branding: two provisioners sharing one name race for the same claims, and a stock k3s carries the upstream one, so a cluster running both would settle our storage by chance. Data lives at /var/lib/hanzo/volume, so reading a Hanzo cluster does not mean learning another vendor's directory. Apache-2.0 as published, unaltered, with Rancher's attribution in NOTICE. The README says what this is not: durability. A volume here dies with its node. That is hanzoai/replicate's question, one layer up, and keeping the two apart is what lets the disk stay this simple.
100 lines
2.3 KiB
Go
100 lines
2.3 KiB
Go
/*
|
|
Copyright 2021 The Kubernetes Authors.
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
*/
|
|
package lru
|
|
|
|
import (
|
|
"fmt"
|
|
"sync"
|
|
|
|
groupcache "k8s.io/utils/internal/third_party/forked/golang/golang-lru"
|
|
)
|
|
|
|
type Key = groupcache.Key
|
|
type EvictionFunc = func(key Key, value interface{})
|
|
|
|
// Cache is a thread-safe fixed size LRU cache.
|
|
type Cache struct {
|
|
cache *groupcache.Cache
|
|
lock sync.RWMutex
|
|
}
|
|
|
|
// New creates an LRU of the given size.
|
|
func New(size int) *Cache {
|
|
return &Cache{
|
|
cache: groupcache.New(size),
|
|
}
|
|
}
|
|
|
|
// NewWithEvictionFunc creates an LRU of the given size with the given eviction func.
|
|
func NewWithEvictionFunc(size int, f EvictionFunc) *Cache {
|
|
c := New(size)
|
|
c.cache.OnEvicted = f
|
|
return c
|
|
}
|
|
|
|
// SetEvictionFunc updates the eviction func
|
|
func (c *Cache) SetEvictionFunc(f EvictionFunc) error {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
if c.cache.OnEvicted != nil {
|
|
return fmt.Errorf("lru cache eviction function is already set")
|
|
}
|
|
c.cache.OnEvicted = f
|
|
return nil
|
|
}
|
|
|
|
// Add adds a value to the cache.
|
|
func (c *Cache) Add(key Key, value interface{}) {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
c.cache.Add(key, value)
|
|
}
|
|
|
|
// Get looks up a key's value from the cache.
|
|
func (c *Cache) Get(key Key) (value interface{}, ok bool) {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
return c.cache.Get(key)
|
|
}
|
|
|
|
// Remove removes the provided key from the cache.
|
|
func (c *Cache) Remove(key Key) {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
c.cache.Remove(key)
|
|
}
|
|
|
|
// RemoveOldest removes the oldest item from the cache.
|
|
func (c *Cache) RemoveOldest() {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
c.cache.RemoveOldest()
|
|
}
|
|
|
|
// Len returns the number of items in the cache.
|
|
func (c *Cache) Len() int {
|
|
c.lock.RLock()
|
|
defer c.lock.RUnlock()
|
|
return c.cache.Len()
|
|
}
|
|
|
|
// Clear purges all stored items from the cache.
|
|
func (c *Cache) Clear() {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
c.cache.Clear()
|
|
}
|