mirror of
https://github.com/hanzoai/volume.git
synced 2026-10-30 14:55:30 +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.
78 lines
2.0 KiB
Go
78 lines
2.0 KiB
Go
// Copyright 2014 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package http2
|
|
|
|
import "math"
|
|
|
|
// NewRandomWriteScheduler constructs a WriteScheduler that ignores HTTP/2
|
|
// priorities. Control frames like SETTINGS and PING are written before DATA
|
|
// frames, but if no control frames are queued and multiple streams have queued
|
|
// HEADERS or DATA frames, Pop selects a ready stream arbitrarily.
|
|
func NewRandomWriteScheduler() WriteScheduler {
|
|
return &randomWriteScheduler{sq: make(map[uint32]*writeQueue)}
|
|
}
|
|
|
|
type randomWriteScheduler struct {
|
|
// zero are frames not associated with a specific stream.
|
|
zero writeQueue
|
|
|
|
// sq contains the stream-specific queues, keyed by stream ID.
|
|
// When a stream is idle, closed, or emptied, it's deleted
|
|
// from the map.
|
|
sq map[uint32]*writeQueue
|
|
|
|
// pool of empty queues for reuse.
|
|
queuePool writeQueuePool
|
|
}
|
|
|
|
func (ws *randomWriteScheduler) OpenStream(streamID uint32, options OpenStreamOptions) {
|
|
// no-op: idle streams are not tracked
|
|
}
|
|
|
|
func (ws *randomWriteScheduler) CloseStream(streamID uint32) {
|
|
q, ok := ws.sq[streamID]
|
|
if !ok {
|
|
return
|
|
}
|
|
delete(ws.sq, streamID)
|
|
ws.queuePool.put(q)
|
|
}
|
|
|
|
func (ws *randomWriteScheduler) AdjustStream(streamID uint32, priority PriorityParam) {
|
|
// no-op: priorities are ignored
|
|
}
|
|
|
|
func (ws *randomWriteScheduler) Push(wr FrameWriteRequest) {
|
|
if wr.isControl() {
|
|
ws.zero.push(wr)
|
|
return
|
|
}
|
|
id := wr.StreamID()
|
|
q, ok := ws.sq[id]
|
|
if !ok {
|
|
q = ws.queuePool.get()
|
|
ws.sq[id] = q
|
|
}
|
|
q.push(wr)
|
|
}
|
|
|
|
func (ws *randomWriteScheduler) Pop() (FrameWriteRequest, bool) {
|
|
// Control and RST_STREAM frames first.
|
|
if !ws.zero.empty() {
|
|
return ws.zero.shift(), true
|
|
}
|
|
// Iterate over all non-idle streams until finding one that can be consumed.
|
|
for streamID, q := range ws.sq {
|
|
if wr, ok := q.consume(math.MaxInt32); ok {
|
|
if q.empty() {
|
|
delete(ws.sq, streamID)
|
|
ws.queuePool.put(q)
|
|
}
|
|
return wr, true
|
|
}
|
|
}
|
|
return FrameWriteRequest{}, false
|
|
}
|