mirror of
https://github.com/hanzoai/s3.git
synced 2026-11-02 13:11:24 +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.
170 lines
4.0 KiB
Go
170 lines
4.0 KiB
Go
package needle_map
|
|
|
|
import (
|
|
"fmt"
|
|
"io"
|
|
"os"
|
|
|
|
"github.com/syndtr/goleveldb/leveldb"
|
|
"github.com/syndtr/goleveldb/leveldb/iterator"
|
|
"github.com/syndtr/goleveldb/leveldb/opt"
|
|
"github.com/syndtr/goleveldb/leveldb/storage"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/glog"
|
|
"github.com/seaweedfs/seaweedfs/weed/storage/idx"
|
|
. "github.com/seaweedfs/seaweedfs/weed/storage/types"
|
|
)
|
|
|
|
// This map uses in memory level db
|
|
type MemDb struct {
|
|
db *leveldb.DB
|
|
}
|
|
|
|
func NewMemDb() *MemDb {
|
|
opts := &opt.Options{}
|
|
|
|
var err error
|
|
t := &MemDb{}
|
|
if t.db, err = leveldb.Open(storage.NewMemStorage(), opts); err != nil {
|
|
glog.V(0).Infof("MemDb fails to open: %v", err)
|
|
return nil
|
|
}
|
|
|
|
return t
|
|
}
|
|
|
|
func (cm *MemDb) Set(key NeedleId, offset Offset, size Size) error {
|
|
|
|
bytes := ToBytes(key, offset, size)
|
|
|
|
if err := cm.db.Put(bytes[0:NeedleIdSize], bytes[NeedleIdSize:NeedleIdSize+OffsetSize+SizeSize], nil); err != nil {
|
|
return fmt.Errorf("failed to write temp leveldb: %w", err)
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (cm *MemDb) Delete(key NeedleId) error {
|
|
bytes := make([]byte, NeedleIdSize)
|
|
NeedleIdToBytes(bytes, key)
|
|
return cm.db.Delete(bytes, nil)
|
|
|
|
}
|
|
func (cm *MemDb) Get(key NeedleId) (*NeedleValue, bool) {
|
|
bytes := make([]byte, NeedleIdSize)
|
|
NeedleIdToBytes(bytes[0:NeedleIdSize], key)
|
|
data, err := cm.db.Get(bytes, nil)
|
|
if err != nil || len(data) != OffsetSize+SizeSize {
|
|
return nil, false
|
|
}
|
|
offset := BytesToOffset(data[0:OffsetSize])
|
|
size := BytesToSize(data[OffsetSize : OffsetSize+SizeSize])
|
|
return &NeedleValue{Key: key, Offset: offset, Size: size}, true
|
|
}
|
|
|
|
// Visit visits all entries or stop if any error when visiting
|
|
func doVisit(iter iterator.Iterator, visit func(NeedleValue) error) (ret error) {
|
|
key := BytesToNeedleId(iter.Key())
|
|
data := iter.Value()
|
|
offset := BytesToOffset(data[0:OffsetSize])
|
|
size := BytesToSize(data[OffsetSize : OffsetSize+SizeSize])
|
|
|
|
needle := NeedleValue{Key: key, Offset: offset, Size: size}
|
|
ret = visit(needle)
|
|
if ret != nil {
|
|
return
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (cm *MemDb) AscendingVisit(visit func(NeedleValue) error) (ret error) {
|
|
iter := cm.db.NewIterator(nil, nil)
|
|
if iter.First() {
|
|
if ret = doVisit(iter, visit); ret != nil {
|
|
return
|
|
}
|
|
}
|
|
for iter.Next() {
|
|
if ret = doVisit(iter, visit); ret != nil {
|
|
return
|
|
}
|
|
}
|
|
iter.Release()
|
|
ret = iter.Error()
|
|
|
|
return
|
|
}
|
|
|
|
func (cm *MemDb) DescendingVisit(visit func(NeedleValue) error) (ret error) {
|
|
iter := cm.db.NewIterator(nil, nil)
|
|
if iter.Last() {
|
|
if ret = doVisit(iter, visit); ret != nil {
|
|
return
|
|
}
|
|
}
|
|
for iter.Prev() {
|
|
if ret = doVisit(iter, visit); ret != nil {
|
|
return
|
|
}
|
|
}
|
|
iter.Release()
|
|
ret = iter.Error()
|
|
|
|
return
|
|
}
|
|
|
|
func (cm *MemDb) SaveToIdx(idxName string) (ret error) {
|
|
idxFile, err := os.OpenFile(idxName, os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644)
|
|
if err != nil {
|
|
return
|
|
}
|
|
defer func() {
|
|
// The .cpx generated here is renamed to .idx at commit, so a discarded
|
|
// fsync or close error could leave a partially-written index after a crash.
|
|
if syncErr := idxFile.Sync(); syncErr != nil && ret == nil {
|
|
ret = syncErr
|
|
}
|
|
if closeErr := idxFile.Close(); closeErr != nil && ret == nil {
|
|
ret = closeErr
|
|
}
|
|
}()
|
|
|
|
return cm.AscendingVisit(func(value NeedleValue) error {
|
|
if value.Offset.IsZero() || value.Size.IsDeleted() {
|
|
return nil
|
|
}
|
|
_, err := idxFile.Write(value.ToBytes())
|
|
return err
|
|
})
|
|
|
|
}
|
|
|
|
func (cm *MemDb) LoadFromIdx(idxName string) (ret error) {
|
|
idxFile, err := os.OpenFile(idxName, os.O_RDONLY, 0644)
|
|
if err != nil {
|
|
return
|
|
}
|
|
defer idxFile.Close()
|
|
|
|
return cm.LoadFromReaderAt(idxFile)
|
|
|
|
}
|
|
|
|
func (cm *MemDb) LoadFromReaderAt(readerAt io.ReaderAt) (ret error) {
|
|
|
|
return cm.LoadFilterFromReaderAt(readerAt, true, true)
|
|
}
|
|
|
|
func (cm *MemDb) LoadFilterFromReaderAt(readerAt io.ReaderAt, isFilterOffsetZero bool, isFilterDeleted bool) (ret error) {
|
|
return idx.WalkIndexFile(readerAt, 0, func(key NeedleId, offset Offset, size Size) error {
|
|
if (isFilterOffsetZero && offset.IsZero()) || (isFilterDeleted && size.IsDeleted()) {
|
|
return cm.Delete(key)
|
|
}
|
|
return cm.Set(key, offset, size)
|
|
})
|
|
|
|
}
|
|
|
|
func (cm *MemDb) Close() {
|
|
cm.db.Close()
|
|
}
|