mirror of
https://github.com/hanzoai/s3.git
synced 2026-10-30 14:59:09 +00:00
zooqueen
dd74d3e6d6
hanzoai/s3 was an AGPL-3.0 MinIO fork whose network-copyleft blocks embedding
and reselling as a managed service. Replace it wholesale with a fork of
SeaweedFS (github.com/seaweedfs/seaweedfs, Apache-2.0, Go) which ships a
built-in S3 gateway + Filer.
- License: AGPL-3.0 -> Apache-2.0 (upstream LICENSE kept verbatim, incl.
"Copyright 2025 Chris Lu"); NOTICE added crediting SeaweedFS. No AGPL/BUSL/
SSPL/GPL or enterprise ("ee") files remain.
- Module: go.mod path set to github.com/hanzoai/s3 with a self-replace
(replace github.com/seaweedfs/seaweedfs => ./) so the ~1800 internal Go files
keep their upstream import paths with zero churn. Internal identifiers and
import paths are intentionally NOT renamed.
- CLI rebrand: the binary is built as `s3` (was `weed`); root usage, per-command
help/usage/flag strings, shell autocomplete program name, and the product name
in CLI output now read "Hanzo S3" / `s3`. Users never see `weed`.
(e.g. `s3 server`, `s3 filer`, `s3 master`, `s3 volume`, `s3 s3`, `s3 mount`.)
- Build: `make` (or `go build -o s3 ./weed`) builds the `s3` binary green;
`cmd/weed-db` and `cmd/weed-sql` also build; `go vet ./weed/command/` clean.
- README/LLM.md rewritten for Hanzo S3; AGENTS.md/CLAUDE.md symlinks preserved.
- Dropped a 33MB prebuilt Mach-O `stress` binary upstream had committed; `.gitignore`
updated to ignore the `s3` build output.
77 lines
2.0 KiB
Go
77 lines
2.0 KiB
Go
package router
|
|
|
|
import (
|
|
"container/heap"
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
// Schedule is the worker's in-memory pending list, ordered by DueTime.
|
|
// The dispatcher polls Drain on each tick to retrieve due Matches.
|
|
//
|
|
// Duplicates are allowed: a re-schedule for the same (ActionKey, ObjectKey)
|
|
// before the prior dispatch ran results in two heap entries. The
|
|
// LifecycleDelete RPC's identity-CAS makes the second dispatch a no-op
|
|
// (NOOP_RESOLVED with STALE_IDENTITY), so dedup at insert time would only
|
|
// be a micro-optimization at the cost of an extra map.
|
|
type Schedule struct {
|
|
mu sync.Mutex
|
|
h scheduleHeap
|
|
}
|
|
|
|
func NewSchedule() *Schedule {
|
|
return &Schedule{}
|
|
}
|
|
|
|
// Add enqueues a Match.
|
|
func (s *Schedule) Add(m Match) {
|
|
s.mu.Lock()
|
|
defer s.mu.Unlock()
|
|
heap.Push(&s.h, m)
|
|
}
|
|
|
|
// Len returns the number of pending Matches.
|
|
func (s *Schedule) Len() int {
|
|
s.mu.Lock()
|
|
defer s.mu.Unlock()
|
|
return s.h.Len()
|
|
}
|
|
|
|
// NextDue returns the DueTime of the earliest pending Match. ok=false if
|
|
// the schedule is empty.
|
|
func (s *Schedule) NextDue() (time.Time, bool) {
|
|
s.mu.Lock()
|
|
defer s.mu.Unlock()
|
|
if s.h.Len() == 0 {
|
|
return time.Time{}, false
|
|
}
|
|
return s.h[0].DueTime, true
|
|
}
|
|
|
|
// Drain pops and returns all Matches whose DueTime <= now, in DueTime order.
|
|
// Subsequent calls return only newly-due Matches.
|
|
func (s *Schedule) Drain(now time.Time) []Match {
|
|
s.mu.Lock()
|
|
defer s.mu.Unlock()
|
|
var out []Match
|
|
for s.h.Len() > 0 && !s.h[0].DueTime.After(now) {
|
|
out = append(out, heap.Pop(&s.h).(Match))
|
|
}
|
|
return out
|
|
}
|
|
|
|
// scheduleHeap implements heap.Interface ordered by Match.DueTime ascending.
|
|
type scheduleHeap []Match
|
|
|
|
func (h scheduleHeap) Len() int { return len(h) }
|
|
func (h scheduleHeap) Less(i, j int) bool { return h[i].DueTime.Before(h[j].DueTime) }
|
|
func (h scheduleHeap) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
|
|
func (h *scheduleHeap) Push(x interface{}) { *h = append(*h, x.(Match)) }
|
|
func (h *scheduleHeap) Pop() interface{} {
|
|
old := *h
|
|
n := len(old)
|
|
x := old[n-1]
|
|
*h = old[:n-1]
|
|
return x
|
|
}
|