2012-08-24 05:33:37 +00:00
package topology
import (
2014-10-26 18:34:55 +00:00
"errors"
2019-04-21 17:14:17 +00:00
"fmt"
2014-10-26 18:34:55 +00:00
"math/rand"
2019-05-24 06:34:29 +00:00
"sync"
2020-08-10 08:37:47 +00:00
"time"
2014-10-26 18:34:55 +00:00
2015-05-03 19:37:49 +00:00
"github.com/chrislusf/raft"
2019-12-23 20:48:20 +00:00
2020-11-17 06:26:58 +00:00
"github.com/chrislusf/seaweedfs/weed/util/log"
2018-07-11 09:01:33 +00:00
"github.com/chrislusf/seaweedfs/weed/pb/master_pb"
2016-06-03 01:09:14 +00:00
"github.com/chrislusf/seaweedfs/weed/sequence"
"github.com/chrislusf/seaweedfs/weed/storage"
2019-04-19 04:43:36 +00:00
"github.com/chrislusf/seaweedfs/weed/storage/needle"
2019-12-23 20:48:20 +00:00
"github.com/chrislusf/seaweedfs/weed/storage/super_block"
2016-06-03 01:09:14 +00:00
"github.com/chrislusf/seaweedfs/weed/util"
2012-08-24 05:33:37 +00:00
)
type Topology struct {
2019-07-22 04:49:10 +00:00
vacuumLockCounter int64
2012-09-02 21:33:48 +00:00
NodeImpl
2012-09-10 07:18:07 +00:00
2019-05-24 06:34:29 +00:00
collectionMap * util . ConcurrentReadMap
ecShardMap map [ needle . VolumeId ] * EcShardLocations
ecShardMapLock sync . RWMutex
2012-09-10 07:18:07 +00:00
pulse int64
2020-04-01 19:18:40 +00:00
volumeSizeLimit uint64
replicationAsMin bool
2012-09-10 07:18:07 +00:00
2014-04-17 06:43:27 +00:00
Sequence sequence . Sequencer
2012-09-18 21:05:12 +00:00
2017-01-10 09:01:12 +00:00
chanFullVolumes chan storage . VolumeInfo
2012-09-24 09:01:53 +00:00
2017-01-10 09:01:12 +00:00
Configuration * Configuration
2014-03-16 06:03:49 +00:00
RaftServer raft . Server
2012-08-31 08:35:11 +00:00
}
2012-08-28 08:04:39 +00:00
2020-04-01 19:18:40 +00:00
func NewTopology ( id string , seq sequence . Sequencer , volumeSizeLimit uint64 , pulse int , replicationAsMin bool ) * Topology {
2012-09-02 21:33:48 +00:00
t := & Topology { }
t . id = NodeId ( id )
t . nodeType = "Topology"
2012-09-19 08:45:30 +00:00
t . NodeImpl . value = t
2012-09-02 21:33:48 +00:00
t . children = make ( map [ NodeId ] Node )
2014-12-09 04:29:25 +00:00
t . collectionMap = util . NewConcurrentReadMap ( )
2019-05-24 06:34:29 +00:00
t . ecShardMap = make ( map [ needle . VolumeId ] * EcShardLocations )
2012-09-10 07:18:07 +00:00
t . pulse = int64 ( pulse )
t . volumeSizeLimit = volumeSizeLimit
2020-04-01 19:18:40 +00:00
t . replicationAsMin = replicationAsMin
2012-09-19 08:45:30 +00:00
2014-04-17 06:43:27 +00:00
t . Sequence = seq
2012-09-19 08:45:30 +00:00
2012-12-04 04:28:12 +00:00
t . chanFullVolumes = make ( chan storage . VolumeInfo )
2012-09-19 08:45:30 +00:00
2017-02-13 05:58:44 +00:00
t . Configuration = & Configuration { }
2012-09-24 09:01:53 +00:00
2017-02-13 05:58:44 +00:00
return t
2012-09-02 21:33:48 +00:00
}
2012-09-17 00:31:15 +00:00
2014-03-16 06:03:49 +00:00
func ( t * Topology ) IsLeader ( ) bool {
2019-02-15 08:09:48 +00:00
if t . RaftServer != nil {
2020-01-10 08:37:44 +00:00
if t . RaftServer . State ( ) == raft . Leader {
return true
}
2019-01-28 18:36:16 +00:00
}
2014-04-11 23:23:58 +00:00
return false
2014-03-16 06:03:49 +00:00
}
2014-04-11 23:23:58 +00:00
func ( t * Topology ) Leader ( ) ( string , error ) {
2014-03-16 06:03:49 +00:00
l := ""
2020-08-11 03:42:27 +00:00
for count := 0 ; count < 3 ; count ++ {
2020-08-10 08:37:47 +00:00
if t . RaftServer != nil {
l = t . RaftServer . Leader ( )
} else {
return "" , errors . New ( "Raft Server not ready yet!" )
}
if l != "" {
break
} else {
2020-08-11 03:42:27 +00:00
time . Sleep ( time . Duration ( 5 + count ) * time . Second )
2020-08-10 08:37:47 +00:00
}
2014-03-16 06:03:49 +00:00
}
2014-04-11 23:23:58 +00:00
return l , nil
2014-03-16 06:03:49 +00:00
}
2019-06-06 06:20:26 +00:00
func ( t * Topology ) Lookup ( collection string , vid needle . VolumeId ) ( dataNodes [ ] * DataNode ) {
2020-08-11 03:42:27 +00:00
// maybe an issue if lots of collections?
2013-11-12 10:21:22 +00:00
if collection == "" {
2016-05-30 19:30:26 +00:00
for _ , c := range t . collectionMap . Items ( ) {
2014-12-09 04:29:25 +00:00
if list := c . ( * Collection ) . Lookup ( vid ) ; list != nil {
2012-09-24 09:01:53 +00:00
return list
}
}
2013-11-12 10:21:22 +00:00
} else {
2016-05-30 19:30:26 +00:00
if c , ok := t . collectionMap . Find ( collection ) ; ok {
2014-12-09 04:29:25 +00:00
return c . ( * Collection ) . Lookup ( vid )
2013-11-12 10:21:22 +00:00
}
2012-09-24 09:01:53 +00:00
}
2019-06-06 06:20:26 +00:00
if locations , found := t . LookupEcShards ( vid ) ; found {
for _ , loc := range locations . Locations {
dataNodes = append ( dataNodes , loc ... )
}
return dataNodes
}
2012-09-24 09:01:53 +00:00
return nil
2012-09-23 22:45:26 +00:00
}
2019-04-19 04:43:36 +00:00
func ( t * Topology ) NextVolumeId ( ) ( needle . VolumeId , error ) {
2012-09-02 21:33:48 +00:00
vid := t . GetMaxVolumeId ( )
2014-03-16 06:03:49 +00:00
next := vid . Next ( )
2019-02-25 02:47:41 +00:00
if _ , err := t . RaftServer . Do ( NewMaxVolumeIdCommand ( next ) ) ; err != nil {
return 0 , err
}
return next , nil
2012-08-28 08:04:39 +00:00
}
2012-09-10 07:18:07 +00:00
2014-10-26 06:45:31 +00:00
func ( t * Topology ) HasWritableVolume ( option * VolumeGrowOption ) bool {
2014-09-20 19:38:59 +00:00
vl := t . GetVolumeLayout ( option . Collection , option . ReplicaPlacement , option . Ttl )
2014-04-13 08:29:52 +00:00
return vl . GetActiveVolumeCount ( option ) > 0
}
2015-04-06 21:17:36 +00:00
func ( t * Topology ) PickForWrite ( count uint64 , option * VolumeGrowOption ) ( string , uint64 , * DataNode , error ) {
2014-09-20 19:38:59 +00:00
vid , count , datanodes , err := t . GetVolumeLayout ( option . Collection , option . ReplicaPlacement , option . Ttl ) . PickForWrite ( count , option )
2019-04-21 17:14:17 +00:00
if err != nil {
2019-10-29 13:28:28 +00:00
return "" , 0 , nil , fmt . Errorf ( "failed to find writable volumes for collection:%s replication:%s ttl:%s error: %v" , option . Collection , option . ReplicaPlacement . String ( ) , option . Ttl . String ( ) , err )
2019-04-21 17:14:17 +00:00
}
if datanodes . Length ( ) == 0 {
2019-10-29 13:28:28 +00:00
return "" , 0 , nil , fmt . Errorf ( "no writable volumes available for collection:%s replication:%s ttl:%s" , option . Collection , option . ReplicaPlacement . String ( ) , option . Ttl . String ( ) )
2012-09-17 00:31:15 +00:00
}
2019-10-30 07:49:58 +00:00
fileId := t . Sequence . NextFileId ( count )
2019-04-19 04:43:36 +00:00
return needle . NewFileId ( * vid , fileId , rand . Uint32 ( ) ) . String ( ) , count , datanodes . Head ( ) , nil
2012-09-17 00:31:15 +00:00
}
2019-12-23 20:48:20 +00:00
func ( t * Topology ) GetVolumeLayout ( collectionName string , rp * super_block . ReplicaPlacement , ttl * needle . TTL ) * VolumeLayout {
2014-12-09 04:29:25 +00:00
return t . collectionMap . Get ( collectionName , func ( ) interface { } {
2020-04-01 19:18:40 +00:00
return NewCollection ( collectionName , t . volumeSizeLimit , t . replicationAsMin )
2014-12-09 04:29:25 +00:00
} ) . ( * Collection ) . GetOrCreateVolumeLayout ( rp , ttl )
2012-09-14 08:17:13 +00:00
}
2019-05-30 16:27:23 +00:00
func ( t * Topology ) ListCollections ( includeNormalVolumes , includeEcVolumes bool ) ( ret [ ] string ) {
2019-05-30 16:17:58 +00:00
mapOfCollections := make ( map [ string ] bool )
2019-03-16 20:43:16 +00:00
for _ , c := range t . collectionMap . Items ( ) {
2019-05-30 16:17:58 +00:00
mapOfCollections [ c . ( * Collection ) . Name ] = true
}
2019-05-30 16:27:23 +00:00
if includeEcVolumes {
t . ecShardMapLock . RLock ( )
for _ , ecVolumeLocation := range t . ecShardMap {
mapOfCollections [ ecVolumeLocation . Collection ] = true
}
t . ecShardMapLock . RUnlock ( )
2019-05-30 16:17:58 +00:00
}
2020-01-10 08:37:44 +00:00
for k := range mapOfCollections {
2019-05-30 16:17:58 +00:00
ret = append ( ret , k )
2019-03-16 20:43:16 +00:00
}
return ret
}
2016-05-30 19:30:26 +00:00
func ( t * Topology ) FindCollection ( collectionName string ) ( * Collection , bool ) {
c , hasCollection := t . collectionMap . Find ( collectionName )
2017-07-14 12:04:33 +00:00
if ! hasCollection {
return nil , false
}
2014-12-09 04:29:25 +00:00
return c . ( * Collection ) , hasCollection
2014-03-10 18:43:54 +00:00
}
func ( t * Topology ) DeleteCollection ( collectionName string ) {
2016-05-30 19:30:26 +00:00
t . collectionMap . Delete ( collectionName )
2014-03-10 18:43:54 +00:00
}
2014-03-19 11:48:13 +00:00
func ( t * Topology ) RegisterVolumeLayout ( v storage . VolumeInfo , dn * DataNode ) {
2014-09-20 19:38:59 +00:00
t . GetVolumeLayout ( v . Collection , v . ReplicaPlacement , v . Ttl ) . RegisterVolume ( & v , dn )
}
func ( t * Topology ) UnRegisterVolumeLayout ( v storage . VolumeInfo , dn * DataNode ) {
2020-11-17 06:26:58 +00:00
log . Infof ( "removing volume info:%+v" , v )
2018-07-11 09:01:33 +00:00
volumeLayout := t . GetVolumeLayout ( v . Collection , v . ReplicaPlacement , v . Ttl )
volumeLayout . UnRegisterVolume ( & v , dn )
if volumeLayout . isEmpty ( ) {
t . DeleteCollection ( v . Collection )
}
2012-09-17 00:31:15 +00:00
}
2012-09-23 03:46:31 +00:00
func ( t * Topology ) GetOrCreateDataCenter ( dcName string ) * DataCenter {
2012-09-17 00:31:15 +00:00
for _ , c := range t . Children ( ) {
dc := c . ( * DataCenter )
2012-09-23 03:46:31 +00:00
if string ( dc . Id ( ) ) == dcName {
2012-09-17 00:31:15 +00:00
return dc
}
}
2012-09-23 03:46:31 +00:00
dc := NewDataCenter ( dcName )
2012-09-17 00:31:15 +00:00
t . LinkChildNode ( dc )
return dc
}
2018-06-25 07:01:53 +00:00
2018-07-28 06:09:55 +00:00
func ( t * Topology ) SyncDataNodeRegistration ( volumes [ ] * master_pb . VolumeInformationMessage , dn * DataNode ) ( newVolumes , deletedVolumes [ ] storage . VolumeInfo ) {
2019-05-23 07:04:24 +00:00
// convert into in memory struct storage.VolumeInfo
2018-06-25 07:01:53 +00:00
var volumeInfos [ ] storage . VolumeInfo
for _ , v := range volumes {
if vi , err := storage . NewVolumeInfo ( v ) ; err == nil {
volumeInfos = append ( volumeInfos , vi )
} else {
2020-11-17 06:26:58 +00:00
log . Infof ( "Fail to convert joined volume information: %v" , err )
2018-06-25 07:01:53 +00:00
}
}
2019-05-23 07:04:24 +00:00
// find out the delta volumes
2020-06-05 15:18:15 +00:00
var changedVolumes [ ] storage . VolumeInfo
newVolumes , deletedVolumes , changedVolumes = dn . UpdateVolumes ( volumeInfos )
2019-04-20 18:35:20 +00:00
for _ , v := range newVolumes {
2018-06-25 07:01:53 +00:00
t . RegisterVolumeLayout ( v , dn )
}
for _ , v := range deletedVolumes {
t . UnRegisterVolumeLayout ( v , dn )
}
2020-06-05 15:18:15 +00:00
for _ , v := range changedVolumes {
vl := t . GetVolumeLayout ( v . Collection , v . ReplicaPlacement , v . Ttl )
adding locking to avoid nil VolumeLocationList
fix panic: runtime error: invalid memory address or nil pointer dereference
Oct 22 00:53:44 bedb-master1 weed[8055]: [signal SIGSEGV: segmentation violation code=0x1 addr=0x8 pc=0x17658da]
Oct 22 00:53:44 bedb-master1 weed[8055]: goroutine 310 [running]:
Oct 22 00:53:44 bedb-master1 weed[8055]: github.com/chrislusf/seaweedfs/weed/topology.(*VolumeLocationList).Length(...)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/seaweedfs/weed/topology/volume_location_list.go:35
Oct 22 00:53:44 bedb-master1 weed[8055]: github.com/chrislusf/seaweedfs/weed/topology.(*VolumeLayout).enoughCopies(...)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/seaweedfs/weed/topology/volume_layout.go:376
Oct 22 00:53:44 bedb-master1 weed[8055]: github.com/chrislusf/seaweedfs/weed/topology.(*VolumeLayout).ensureCorrectWritables(0xc000111d50, 0xc000b55438)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/seaweedfs/weed/topology/volume_layout.go:202 +0x5a
Oct 22 00:53:44 bedb-master1 weed[8055]: github.com/chrislusf/seaweedfs/weed/topology.(*Topology).SyncDataNodeRegistration(0xc00042ac60, 0xc001454d30, 0x1, 0x1, 0xc0005fc000, 0xc00135de40, 0x4, 0xc00135de50, 0x10, 0x10d, ...)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/seaweedfs/weed/topology/topology.go:224 +0x616
Oct 22 00:53:44 bedb-master1 weed[8055]: github.com/chrislusf/seaweedfs/weed/server.(*MasterServer).SendHeartbeat(0xc000162700, 0x23b97c0, 0xc000ae2c90, 0x0, 0x0)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/seaweedfs/weed/server/master_grpc_server.go:106 +0x325
Oct 22 00:53:44 bedb-master1 weed[8055]: github.com/chrislusf/seaweedfs/weed/pb/master_pb._Seaweed_SendHeartbeat_Handler(0x1f8e7c0, 0xc000162700, 0x23b0a60, 0xc00024b440, 0x3172c38, 0xc000ab7100)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/seaweedfs/weed/pb/master_pb/master.pb.go:4250 +0xad
Oct 22 00:53:44 bedb-master1 weed[8055]: google.golang.org/grpc.(*Server).processStreamingRPC(0xc0001f31e0, 0x23bb800, 0xc000ac5500, 0xc000ab7100, 0xc0001fea80, 0x311fec0, 0x0, 0x0, 0x0)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/go/pkg/mod/google.golang.org/grpc@v1.29.1/server.go:1329 +0xcd8
Oct 22 00:53:44 bedb-master1 weed[8055]: google.golang.org/grpc.(*Server).handleStream(0xc0001f31e0, 0x23bb800, 0xc000ac5500, 0xc000ab7100, 0x0)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/go/pkg/mod/google.golang.org/grpc@v1.29.1/server.go:1409 +0xc5c
Oct 22 00:53:44 bedb-master1 weed[8055]: google.golang.org/grpc.(*Server).serveStreams.func1.1(0xc0001ce8b0, 0xc0001f31e0, 0x23bb800, 0xc000ac5500, 0xc000ab7100)
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/go/pkg/mod/google.golang.org/grpc@v1.29.1/server.go:746 +0xa5
Oct 22 00:53:44 bedb-master1 weed[8055]: created by google.golang.org/grpc.(*Server).serveStreams.func1
Oct 22 00:53:44 bedb-master1 weed[8055]: #011/root/go/pkg/mod/google.golang.org/grpc@v1.29.1/server.go:744 +0xa5
Oct 22 00:53:44 bedb-master1 systemd[1]: weedmaster.service: Main process exited, code=exited, status=2/INVALIDARGUMENT
Oct 22 00:53:44 bedb-master1 systemd[1]: weedmaster.service: Failed with result 'exit-code'.
2020-10-22 06:15:48 +00:00
vl . EnsureCorrectWritables ( & v )
2020-06-05 15:18:15 +00:00
}
2018-07-28 06:09:55 +00:00
return
2018-06-25 07:01:53 +00:00
}
2019-04-20 18:35:20 +00:00
func ( t * Topology ) IncrementalSyncDataNodeRegistration ( newVolumes , deletedVolumes [ ] * master_pb . VolumeShortInformationMessage , dn * DataNode ) {
var newVis , oldVis [ ] storage . VolumeInfo
for _ , v := range newVolumes {
vi , err := storage . NewVolumeInfoFromShort ( v )
if err != nil {
2020-11-17 06:26:58 +00:00
log . Infof ( "NewVolumeInfoFromShort %v: %v" , v , err )
2019-04-20 18:35:20 +00:00
continue
}
newVis = append ( newVis , vi )
}
for _ , v := range deletedVolumes {
vi , err := storage . NewVolumeInfoFromShort ( v )
if err != nil {
2020-11-17 06:26:58 +00:00
log . Infof ( "NewVolumeInfoFromShort %v: %v" , v , err )
2019-04-20 18:35:20 +00:00
continue
}
oldVis = append ( oldVis , vi )
}
dn . DeltaUpdateVolumes ( newVis , oldVis )
2019-04-21 06:53:37 +00:00
for _ , vi := range newVis {
t . RegisterVolumeLayout ( vi , dn )
}
for _ , vi := range oldVis {
t . UnRegisterVolumeLayout ( vi , dn )
}
2019-04-20 18:35:20 +00:00
return
}