mirror of
https://github.com/hanzoai/s3.git
synced 2026-11-03 03:07:41 +00:00
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.
144 lines
4.5 KiB
Go
144 lines
4.5 KiB
Go
package dailyrun
|
|
|
|
import (
|
|
"context"
|
|
"errors"
|
|
"testing"
|
|
"time"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/s3api/s3lifecycle"
|
|
"github.com/seaweedfs/seaweedfs/weed/s3api/s3lifecycle/engine"
|
|
"github.com/stretchr/testify/assert"
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
// memPersister is a minimal in-memory CursorPersister. Phase 4b tests
|
|
// drive runShard directly; the recovery-branch path returns before
|
|
// drainShardEvents so the heavier filer/client/lister fakes aren't
|
|
// needed here.
|
|
type memPersister struct {
|
|
store map[int]Cursor
|
|
}
|
|
|
|
func newMemPersister() *memPersister { return &memPersister{store: map[int]Cursor{}} }
|
|
|
|
func (p *memPersister) Load(_ context.Context, shardID int) (Cursor, bool, error) {
|
|
c, ok := p.store[shardID]
|
|
return c, ok, nil
|
|
}
|
|
|
|
func (p *memPersister) Save(_ context.Context, shardID int, c Cursor) error {
|
|
p.store[shardID] = c
|
|
return nil
|
|
}
|
|
|
|
func snapshotWithRule(t *testing.T, days int) *engine.Snapshot {
|
|
t.Helper()
|
|
e := engine.New()
|
|
e.Compile([]engine.CompileInput{
|
|
{Bucket: "b1", Rules: []*s3lifecycle.Rule{
|
|
{ID: "r", Status: s3lifecycle.StatusEnabled, ExpirationDays: days},
|
|
}},
|
|
}, engine.CompileOptions{})
|
|
snap := e.Snapshot()
|
|
for _, a := range snap.AllActions() {
|
|
snap.MarkActive(a.Key)
|
|
}
|
|
return snap
|
|
}
|
|
|
|
func TestRunShard_WalkerInvokedOnRecoveryBranch(t *testing.T) {
|
|
snap := snapshotWithRule(t, 30)
|
|
p := newMemPersister()
|
|
// Seed a persisted cursor whose RuleSetHash differs from snap's, so
|
|
// the rule-change branch fires.
|
|
var stale [32]byte
|
|
for i := range stale {
|
|
stale[i] = 0xAA
|
|
}
|
|
require.NoError(t, p.Save(context.Background(), 3, Cursor{TsNs: 1234, RuleSetHash: stale}))
|
|
|
|
var gotView *engine.Snapshot
|
|
var gotShard int
|
|
calls := 0
|
|
cfg := Config{
|
|
Persister: p,
|
|
Walker: func(_ context.Context, view *engine.Snapshot, shardID int) error {
|
|
calls++
|
|
gotView = view
|
|
gotShard = shardID
|
|
return nil
|
|
},
|
|
}
|
|
runNow := time.Unix(1_700_000_000, 0).UTC()
|
|
require.NoError(t, runShard(context.Background(), cfg, snap, runNow, 3, nil))
|
|
|
|
assert.Equal(t, 1, calls, "walker must fire exactly once on recovery")
|
|
require.NotNil(t, gotView, "walker received the RecoveryView")
|
|
assert.Equal(t, 3, gotShard)
|
|
|
|
// Cursor rewound to runNow - maxTTL with the new hashes persisted.
|
|
got, ok, err := p.Load(context.Background(), 3)
|
|
require.NoError(t, err)
|
|
require.True(t, ok)
|
|
expectedFloor := runNow.Add(-engine.MaxEffectiveTTL(snap)).UnixNano()
|
|
assert.Equal(t, expectedFloor, got.TsNs, "cursor must rewind to runNow - maxTTL after recovery walk")
|
|
assert.NotEqual(t, stale, got.RuleSetHash, "stale hash must be replaced")
|
|
}
|
|
|
|
func TestRunShard_NilWalkerOnRecoveryIsNoop(t *testing.T) {
|
|
// Phase 4a behavior: a nil Walker must not crash and must still
|
|
// rewind the cursor.
|
|
snap := snapshotWithRule(t, 30)
|
|
p := newMemPersister()
|
|
var stale [32]byte
|
|
for i := range stale {
|
|
stale[i] = 0xBB
|
|
}
|
|
require.NoError(t, p.Save(context.Background(), 0, Cursor{TsNs: 9999, RuleSetHash: stale}))
|
|
|
|
cfg := Config{Persister: p} // Walker nil
|
|
runNow := time.Unix(1_700_000_000, 0).UTC()
|
|
require.NoError(t, runShard(context.Background(), cfg, snap, runNow, 0, nil))
|
|
|
|
got, ok, err := p.Load(context.Background(), 0)
|
|
require.NoError(t, err)
|
|
require.True(t, ok)
|
|
assert.Equal(t, runNow.Add(-engine.MaxEffectiveTTL(snap)).UnixNano(), got.TsNs)
|
|
}
|
|
|
|
func TestRunShard_WalkerErrorPropagates(t *testing.T) {
|
|
// A walker failure must surface as the runShard error so the daily
|
|
// run treats the shard as interrupted, and must NOT advance the
|
|
// cursor (the seeded cursor stays).
|
|
snap := snapshotWithRule(t, 30)
|
|
p := newMemPersister()
|
|
var stale [32]byte
|
|
for i := range stale {
|
|
stale[i] = 0xCC
|
|
}
|
|
require.NoError(t, p.Save(context.Background(), 7, Cursor{TsNs: 42, RuleSetHash: stale}))
|
|
|
|
cfg := Config{
|
|
Persister: p,
|
|
Walker: func(_ context.Context, _ *engine.Snapshot, _ int) error {
|
|
return errors.New("walker boom")
|
|
},
|
|
}
|
|
runNow := time.Unix(1_700_000_000, 0).UTC()
|
|
err := runShard(context.Background(), cfg, snap, runNow, 7, nil)
|
|
require.Error(t, err)
|
|
assert.Contains(t, err.Error(), "walker boom")
|
|
|
|
// Cursor untouched.
|
|
got, _, _ := p.Load(context.Background(), 7)
|
|
assert.Equal(t, int64(42), got.TsNs, "walker failure must leave cursor unchanged")
|
|
assert.Equal(t, stale, got.RuleSetHash)
|
|
}
|
|
|
|
// The "matching cursor doesn't invoke walker" case is implicit: the
|
|
// walker call is inside the rule-change / partition-flip `if` and
|
|
// can't be reached otherwise. Exercising it end-to-end requires the
|
|
// full filer + lister + client harness; covered by the integration
|
|
// tests once Phase 4b is wired into the handler.
|