mirror of
https://github.com/hanzoai/volume.git
synced 2026-11-02 11:28:15 +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.
79 lines
1.9 KiB
Go
79 lines
1.9 KiB
Go
/*
|
|
Copyright 2022 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 cache
|
|
|
|
import (
|
|
"k8s.io/utils/clock"
|
|
"time"
|
|
)
|
|
|
|
type RetryWithDeadline interface {
|
|
After(error)
|
|
ShouldRetry() bool
|
|
}
|
|
|
|
type retryWithDeadlineImpl struct {
|
|
firstErrorTime time.Time
|
|
lastErrorTime time.Time
|
|
maxRetryDuration time.Duration
|
|
minResetPeriod time.Duration
|
|
isRetryable func(error) bool
|
|
clock clock.Clock
|
|
}
|
|
|
|
func NewRetryWithDeadline(maxRetryDuration, minResetPeriod time.Duration, isRetryable func(error) bool, clock clock.Clock) RetryWithDeadline {
|
|
return &retryWithDeadlineImpl{
|
|
firstErrorTime: time.Time{},
|
|
lastErrorTime: time.Time{},
|
|
maxRetryDuration: maxRetryDuration,
|
|
minResetPeriod: minResetPeriod,
|
|
isRetryable: isRetryable,
|
|
clock: clock,
|
|
}
|
|
}
|
|
|
|
func (r *retryWithDeadlineImpl) reset() {
|
|
r.firstErrorTime = time.Time{}
|
|
r.lastErrorTime = time.Time{}
|
|
}
|
|
|
|
func (r *retryWithDeadlineImpl) After(err error) {
|
|
if r.isRetryable(err) {
|
|
if r.clock.Now().Sub(r.lastErrorTime) >= r.minResetPeriod {
|
|
r.reset()
|
|
}
|
|
|
|
if r.firstErrorTime.IsZero() {
|
|
r.firstErrorTime = r.clock.Now()
|
|
}
|
|
r.lastErrorTime = r.clock.Now()
|
|
}
|
|
}
|
|
|
|
func (r *retryWithDeadlineImpl) ShouldRetry() bool {
|
|
if r.maxRetryDuration <= time.Duration(0) {
|
|
return false
|
|
}
|
|
|
|
if r.clock.Now().Sub(r.firstErrorTime) <= r.maxRetryDuration {
|
|
return true
|
|
}
|
|
|
|
r.reset()
|
|
return false
|
|
}
|