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.
115 lines
4.6 KiB
Go
115 lines
4.6 KiB
Go
package filersink
|
|
|
|
import (
|
|
"errors"
|
|
"testing"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/pb/filer_pb"
|
|
)
|
|
|
|
// entry builds a file entry with the given mtime and size for the update-action
|
|
// decision, which only looks at those two attributes.
|
|
func entry(mtime int64, size uint64) *filer_pb.Entry {
|
|
return &filer_pb.Entry{Attributes: &filer_pb.FuseAttributes{Mtime: mtime, FileSize: size}}
|
|
}
|
|
|
|
// entryNs adds a sub-second component to check same-second ordering.
|
|
func entryNs(mtime int64, ns int32, size uint64) *filer_pb.Entry {
|
|
return &filer_pb.Entry{Attributes: &filer_pb.FuseAttributes{Mtime: mtime, MtimeNs: ns, FileSize: size}}
|
|
}
|
|
|
|
// getEntryMtimeNs must order versions written within the same second, which
|
|
// plain second-grained mtime cannot. It also must be nil-safe.
|
|
func TestGetEntryMtimeNs(t *testing.T) {
|
|
if got := getEntryMtimeNs(nil); got != 0 {
|
|
t.Fatalf("nil entry: got %d, want 0", got)
|
|
}
|
|
if got := getEntryMtimeNs(&filer_pb.Entry{}); got != 0 {
|
|
t.Fatalf("nil attributes: got %d, want 0", got)
|
|
}
|
|
|
|
mk := func(sec int64, ns int32) *filer_pb.Entry {
|
|
return &filer_pb.Entry{Attributes: &filer_pb.FuseAttributes{Mtime: sec, MtimeNs: ns}}
|
|
}
|
|
if got, want := getEntryMtimeNs(mk(5, 200)), int64(5_000_000_200); got != want {
|
|
t.Fatalf("full-ns: got %d, want %d", got, want)
|
|
}
|
|
// same second, later sub-second component must compare strictly greater
|
|
if !(getEntryMtimeNs(mk(5, 200)) > getEntryMtimeNs(mk(5, 100))) {
|
|
t.Fatalf("same-second ordering failed: %d not > %d",
|
|
getEntryMtimeNs(mk(5, 200)), getEntryMtimeNs(mk(5, 100)))
|
|
}
|
|
}
|
|
|
|
// onCorruptChunk must surface the error, not skip, when it can't confirm
|
|
// supersession (no source filer here) — otherwise it could drop a live file.
|
|
func TestOnCorruptChunkRefusesWhenSupersessionUnconfirmed(t *testing.T) {
|
|
fs := &FilerSink{} // filerSource nil => hasSourceNewerVersion is always false
|
|
sentinel := errors.New("corrupt chunk: read 0 bytes, source says 107")
|
|
|
|
got := fs.onCorruptChunk("/buckets/x/config",
|
|
&filer_pb.Entry{Attributes: &filer_pb.FuseAttributes{Mtime: 5, MtimeNs: 200}},
|
|
sentinel)
|
|
|
|
if !errors.Is(got, sentinel) {
|
|
t.Fatalf("expected the error to be returned (refuse), got %v", got)
|
|
}
|
|
}
|
|
|
|
// chooseUpdateAction decides skip vs repair vs normal. A destination left
|
|
// truncated by an earlier failed replication can carry a newer mtime (the
|
|
// source preserved an old mtime while the partial copy was written recently),
|
|
// so a pure mtime guard would strand the corruption. A shorter destination with
|
|
// a newer mtime must be repaired, not skipped.
|
|
func TestChooseUpdateAction(t *testing.T) {
|
|
tests := []struct {
|
|
name string
|
|
existing *filer_pb.Entry
|
|
incoming *filer_pb.Entry
|
|
want updateAction
|
|
}{
|
|
{"nil existing entry", nil, entry(200, 100), updateNormal},
|
|
{"destination older, catching up", entry(100, 50), entry(200, 100), updateNormal},
|
|
{"same mtime", entry(200, 50), entry(200, 100), updateNormal},
|
|
{"destination newer and complete", entry(300, 100), entry(200, 100), updateSkip},
|
|
{"destination newer and larger", entry(300, 200), entry(200, 100), updateSkip},
|
|
{"destination newer but truncated", entry(300, 90), entry(200, 100), updateRepair},
|
|
// same second: sub-second ordering must still pick the winner
|
|
{"same second, destination newer and complete", entryNs(5, 200, 100), entryNs(5, 100, 100), updateSkip},
|
|
{"same second, destination older", entryNs(5, 100, 100), entryNs(5, 200, 100), updateNormal},
|
|
}
|
|
for _, tc := range tests {
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
if got := chooseUpdateAction(tc.existing, tc.incoming); got != tc.want {
|
|
t.Fatalf("chooseUpdateAction = %v, want %v", got, tc.want)
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
// updatedEntryKey must resolve the incoming entry's new path. For a rename the
|
|
// supersession check has to target newParentPath/newEntry.Name, not the old key,
|
|
// or the renamed-away old path looks deleted on the source and skips a live event.
|
|
func TestUpdatedEntryKey(t *testing.T) {
|
|
named := func(name string) *filer_pb.Entry { return &filer_pb.Entry{Name: name} }
|
|
tests := []struct {
|
|
name string
|
|
key string
|
|
newParentPath string
|
|
entry *filer_pb.Entry
|
|
want string
|
|
}{
|
|
{"content update, no new parent", "/dst/a.txt", "", named("a.txt"), "/dst/a.txt"},
|
|
{"rename same dir", "/dst/old.txt", "/dst", named("new.txt"), "/dst/new.txt"},
|
|
{"rename to subdir", "/dst/old.txt", "/dst/sub", named("new.txt"), "/dst/sub/new.txt"},
|
|
{"root parent", "/old.txt", "/", named("new.txt"), "/new.txt"},
|
|
}
|
|
for _, tc := range tests {
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
if got := updatedEntryKey(tc.key, tc.newParentPath, tc.entry); got != tc.want {
|
|
t.Fatalf("updatedEntryKey = %q, want %q", got, tc.want)
|
|
}
|
|
})
|
|
}
|
|
}
|