mirror of
https://github.com/seaweedfs/seaweedfs.git
synced 2026-10-25 14:30:43 +01:00
* master: cap writable volumes per collection via -maxWritableVolumes Some deployments serialize disk writes (e.g. an Unraid array where concurrent writes to multiple disks collapse throughput). With more than one writable volume in a collection, the master's weighted pick spreads assignments over all of them, so several disks get written at once. -maxWritableVolumes=N narrows the pick candidates to the N fullest writable volumes, so a collection's writes concentrate on one (or few) volumes at a time. 0 keeps the current spread-everywhere behavior. Generated with [Devin](https://devin.ai) Co-Authored-By: Devin <158243242+devin-ai-integration[bot]@users.noreply.github.com> * master: give master.follower a maxWritableVolumes default * master: cap writable volumes inside the requested location * master: pick the capped volumes without sorting the writable list * master: assert the capped candidate set instead of random pick outcomes * master: describe -maxWritableVolumes as a per-layout cap --------- Co-authored-by: Devin <158243242+devin-ai-integration[bot]@users.noreply.github.com>
111 lines
3.0 KiB
Go
111 lines
3.0 KiB
Go
package topology
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/storage/types"
|
|
|
|
"github.com/seaweedfs/seaweedfs/weed/storage/needle"
|
|
"github.com/seaweedfs/seaweedfs/weed/storage/super_block"
|
|
"github.com/seaweedfs/seaweedfs/weed/util"
|
|
)
|
|
|
|
type Collection struct {
|
|
Name string
|
|
volumeSizeLimit uint64
|
|
replicationAsMin bool
|
|
maxWritableVolumes int
|
|
storageType2VolumeLayout *util.ConcurrentReadMap
|
|
}
|
|
|
|
func NewCollection(name string, volumeSizeLimit uint64, replicationAsMin bool) *Collection {
|
|
c := &Collection{
|
|
Name: name,
|
|
volumeSizeLimit: volumeSizeLimit,
|
|
replicationAsMin: replicationAsMin,
|
|
}
|
|
c.storageType2VolumeLayout = util.NewConcurrentReadMap()
|
|
return c
|
|
}
|
|
|
|
func (c *Collection) String() string {
|
|
return fmt.Sprintf("Name:%s, volumeSizeLimit:%d, storageType2VolumeLayout:%v", c.Name, c.volumeSizeLimit, c.storageType2VolumeLayout)
|
|
}
|
|
|
|
func (c *Collection) GetOrCreateVolumeLayout(rp *super_block.ReplicaPlacement, ttl *needle.TTL, diskType types.DiskType) *VolumeLayout {
|
|
keyString := rp.String()
|
|
if ttl != nil {
|
|
keyString += ttl.String()
|
|
}
|
|
if diskType != types.HardDriveType {
|
|
keyString += string(diskType)
|
|
}
|
|
vl := c.storageType2VolumeLayout.Get(keyString, func() interface{} {
|
|
layout := NewVolumeLayout(rp, ttl, diskType, c.volumeSizeLimit, c.replicationAsMin)
|
|
layout.maxWritableVolumes = c.maxWritableVolumes
|
|
return layout
|
|
})
|
|
return vl.(*VolumeLayout)
|
|
}
|
|
|
|
func (c *Collection) GetVolumeLayout(rp *super_block.ReplicaPlacement, ttl *needle.TTL, diskType types.DiskType) (*VolumeLayout, bool) {
|
|
keyString := rp.String()
|
|
if ttl != nil {
|
|
keyString += ttl.String()
|
|
}
|
|
if diskType != types.HardDriveType {
|
|
keyString += string(diskType)
|
|
}
|
|
vl, ok := c.storageType2VolumeLayout.Find(keyString)
|
|
if !ok {
|
|
return nil, false
|
|
}
|
|
return vl.(*VolumeLayout), true
|
|
}
|
|
|
|
func (c *Collection) GetAllVolumeLayouts() []*VolumeLayout {
|
|
var vls []*VolumeLayout
|
|
for _, vl := range c.storageType2VolumeLayout.Items() {
|
|
if vl != nil {
|
|
vls = append(vls, vl.(*VolumeLayout))
|
|
}
|
|
}
|
|
return vls
|
|
}
|
|
|
|
func (c *Collection) DeleteVolumeLayout(rp *super_block.ReplicaPlacement, ttl *needle.TTL, diskType types.DiskType) {
|
|
keyString := rp.String()
|
|
if ttl != nil {
|
|
keyString += ttl.String()
|
|
}
|
|
if diskType != types.HardDriveType {
|
|
keyString += string(diskType)
|
|
}
|
|
// Unpublish first so a racing registration re-resolves into a fresh layout.
|
|
if vl, found := c.storageType2VolumeLayout.Delete(keyString); found {
|
|
vl.(*VolumeLayout).releaseLookupOwnership()
|
|
}
|
|
}
|
|
|
|
func (c *Collection) Lookup(vid needle.VolumeId) []*DataNode {
|
|
for _, vl := range c.storageType2VolumeLayout.Items() {
|
|
if vl != nil {
|
|
if list := vl.(*VolumeLayout).Lookup(vid); list != nil {
|
|
return list
|
|
}
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (c *Collection) ListVolumeServers() (nodes []*DataNode) {
|
|
for _, vl := range c.storageType2VolumeLayout.Items() {
|
|
if vl != nil {
|
|
if list := vl.(*VolumeLayout).ListVolumeServers(); list != nil {
|
|
nodes = append(nodes, list...)
|
|
}
|
|
}
|
|
}
|
|
return
|
|
}
|