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.
95 lines
1.8 KiB
Go
95 lines
1.8 KiB
Go
// Copyright (c) Faye Amacker. All rights reserved.
|
|
// Licensed under the MIT License. See LICENSE in the project root for license information.
|
|
|
|
//go:build go1.20
|
|
|
|
package cbor
|
|
|
|
import (
|
|
"bytes"
|
|
"reflect"
|
|
"sync"
|
|
)
|
|
|
|
type mapKeyValueEncodeFunc struct {
|
|
kf, ef encodeFunc
|
|
kpool, vpool sync.Pool
|
|
}
|
|
|
|
func (me *mapKeyValueEncodeFunc) encodeKeyValues(e *bytes.Buffer, em *encMode, v reflect.Value, kvs []keyValue) error {
|
|
iterk := me.kpool.Get().(*reflect.Value)
|
|
defer func() {
|
|
iterk.SetZero()
|
|
me.kpool.Put(iterk)
|
|
}()
|
|
iterv := me.vpool.Get().(*reflect.Value)
|
|
defer func() {
|
|
iterv.SetZero()
|
|
me.vpool.Put(iterv)
|
|
}()
|
|
|
|
if kvs == nil {
|
|
for i, iter := 0, v.MapRange(); iter.Next(); i++ {
|
|
iterk.SetIterKey(iter)
|
|
iterv.SetIterValue(iter)
|
|
|
|
if err := me.kf(e, em, *iterk); err != nil {
|
|
return err
|
|
}
|
|
if err := me.ef(e, em, *iterv); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
initial := e.Len()
|
|
for i, iter := 0, v.MapRange(); iter.Next(); i++ {
|
|
iterk.SetIterKey(iter)
|
|
iterv.SetIterValue(iter)
|
|
|
|
offset := e.Len()
|
|
if err := me.kf(e, em, *iterk); err != nil {
|
|
return err
|
|
}
|
|
valueOffset := e.Len()
|
|
if err := me.ef(e, em, *iterv); err != nil {
|
|
return err
|
|
}
|
|
kvs[i] = keyValue{
|
|
offset: offset - initial,
|
|
valueOffset: valueOffset - initial,
|
|
nextOffset: e.Len() - initial,
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func getEncodeMapFunc(t reflect.Type) encodeFunc {
|
|
kf, _ := getEncodeFunc(t.Key())
|
|
ef, _ := getEncodeFunc(t.Elem())
|
|
if kf == nil || ef == nil {
|
|
return nil
|
|
}
|
|
mkv := &mapKeyValueEncodeFunc{
|
|
kf: kf,
|
|
ef: ef,
|
|
kpool: sync.Pool{
|
|
New: func() interface{} {
|
|
rk := reflect.New(t.Key()).Elem()
|
|
return &rk
|
|
},
|
|
},
|
|
vpool: sync.Pool{
|
|
New: func() interface{} {
|
|
rv := reflect.New(t.Elem()).Elem()
|
|
return &rv
|
|
},
|
|
},
|
|
}
|
|
return mapEncodeFunc{
|
|
e: mkv.encodeKeyValues,
|
|
}.encode
|
|
}
|