mirror of
https://github.com/hanzoai/volume.git
synced 2026-10-01 00:48:00 +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.
53 lines
1.3 KiB
Go
53 lines
1.3 KiB
Go
package dns
|
|
|
|
// StringToType is the reverse of TypeToString, needed for string parsing.
|
|
var StringToType = reverseInt16(TypeToString)
|
|
|
|
// StringToClass is the reverse of ClassToString, needed for string parsing.
|
|
var StringToClass = reverseInt16(ClassToString)
|
|
|
|
// StringToOpcode is a map of opcodes to strings.
|
|
var StringToOpcode = reverseInt(OpcodeToString)
|
|
|
|
// StringToRcode is a map of rcodes to strings.
|
|
var StringToRcode = reverseInt(RcodeToString)
|
|
|
|
func init() {
|
|
// Preserve previous NOTIMP typo, see github.com/miekg/dns/issues/733.
|
|
StringToRcode["NOTIMPL"] = RcodeNotImplemented
|
|
}
|
|
|
|
// StringToAlgorithm is the reverse of AlgorithmToString.
|
|
var StringToAlgorithm = reverseInt8(AlgorithmToString)
|
|
|
|
// StringToHash is a map of names to hash IDs.
|
|
var StringToHash = reverseInt8(HashToString)
|
|
|
|
// StringToCertType is the reverseof CertTypeToString.
|
|
var StringToCertType = reverseInt16(CertTypeToString)
|
|
|
|
// Reverse a map
|
|
func reverseInt8(m map[uint8]string) map[string]uint8 {
|
|
n := make(map[string]uint8, len(m))
|
|
for u, s := range m {
|
|
n[s] = u
|
|
}
|
|
return n
|
|
}
|
|
|
|
func reverseInt16(m map[uint16]string) map[string]uint16 {
|
|
n := make(map[string]uint16, len(m))
|
|
for u, s := range m {
|
|
n[s] = u
|
|
}
|
|
return n
|
|
}
|
|
|
|
func reverseInt(m map[int]string) map[string]int {
|
|
n := make(map[string]int, len(m))
|
|
for u, s := range m {
|
|
n[s] = u
|
|
}
|
|
return n
|
|
}
|