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.
44 lines
1.3 KiB
Go
44 lines
1.3 KiB
Go
// Copyright 2024 The Prometheus 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 model
|
|
|
|
import (
|
|
"bytes"
|
|
"slices"
|
|
"strconv"
|
|
)
|
|
|
|
// String will look like `{foo="bar", more="less"}`. Names are sorted alphabetically.
|
|
func (l LabelSet) String() string {
|
|
var lna [32]string // On stack to avoid memory allocation for sorting names.
|
|
labelNames := lna[:0]
|
|
for name := range l {
|
|
labelNames = append(labelNames, string(name))
|
|
}
|
|
slices.Sort(labelNames)
|
|
var bytea [1024]byte // On stack to avoid memory allocation while building the output.
|
|
b := bytes.NewBuffer(bytea[:0])
|
|
b.WriteByte('{')
|
|
for i, name := range labelNames {
|
|
if i > 0 {
|
|
b.WriteString(", ")
|
|
}
|
|
b.WriteString(name)
|
|
b.WriteByte('=')
|
|
b.Write(strconv.AppendQuote(b.AvailableBuffer(), string(l[LabelName(name)])))
|
|
}
|
|
b.WriteByte('}')
|
|
return b.String()
|
|
}
|