mirror of
https://github.com/hanzoai/volume.git
synced 2026-11-03 04:24:40 +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.
47 lines
1.9 KiB
Go
47 lines
1.9 KiB
Go
//go:build go1.18
|
|
|
|
/*
|
|
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 transport
|
|
|
|
// this is just to make the "unused" linter rule happy
|
|
var _ = isCacheKeyComparable[tlsCacheKey]
|
|
|
|
// assert at compile time that tlsCacheKey is comparable in a way that will never panic at runtime.
|
|
//
|
|
// Golang 1.20 introduced an exception to type constraints that allows comparable, but not
|
|
// necessarily strictly comparable type arguments to satisfy the `comparable` type constraint,
|
|
// thus allowing interfaces to fulfil the `comparable` constraint.
|
|
// However, by definition, "A comparison of two interface values with identical
|
|
// dynamic types causes a run-time panic if that type is not comparable".
|
|
//
|
|
// We want to make sure that comparing two `tlsCacheKey` elements won't cause a
|
|
// runtime panic. In order to do that, we'll force the `tlsCacheKey` to be strictly
|
|
// comparable, thus making it impossible for it to contain interfaces.
|
|
// To assert strict comparability, we'll use another definition: "Type
|
|
// parameters are comparable if they are strictly comparable".
|
|
// Below, we first construct a type parameter from the `tlsCacheKey` type so that
|
|
// we can then push this type parameter to a comparable check, thus checking these
|
|
// are strictly comparable.
|
|
//
|
|
// Original suggestion from https://github.com/golang/go/issues/56548#issuecomment-1317673963
|
|
func isCacheKeyComparable[K tlsCacheKey]() {
|
|
_ = isComparable[K]
|
|
}
|
|
|
|
func isComparable[T comparable]() {}
|