Chris LuandGitHub ee54fd6c08 perf(weed/storage/super_block): intern the byte-encoded replica placements (#10610) ...

NewReplicaPlacementFromByte formatted the byte with fmt.Sprintf and parsed the
result back, allocating a string and a ReplicaPlacement every call. The master
calls it once per volume in every heartbeat, and keeps the pointer for the
lifetime of the volume, so a cluster with 1.6M volume replicas carries 1.6M of
these where a handful of distinct values exist.

The table is a flat pointer-free array, so it costs 6KB of static data and no
heap objects however few placements a cluster actually uses.

A byte only ever decodes to a valid placement, so the table is complete and the
error return stays nil.

BenchmarkSyncDataNodeRegistration/100000Volumes  500601 allocs/op -> 300589 allocs/op

2026-08-07 00:53:02 -07:00

..

replica_placement_test.go

perf(weed/storage/super_block): intern the byte-encoded replica placements (#10610)

2026-08-07 00:53:02 -07:00

replica_placement.go

perf(weed/storage/super_block): intern the byte-encoded replica placements (#10610)

2026-08-07 00:53:02 -07:00

super_block_read.go.go

ReadAt may return io.EOF t end of file

2024-11-21 00:37:38 -08:00

super_block_test.go

refactoring

2025-06-16 22:25:22 -07:00

super_block.go

move proto package

2022-08-17 12:05:07 -07:00