volume_layout.go 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436
  1. package topology
  2. import (
  3. "errors"
  4. "fmt"
  5. "math/rand"
  6. "sync"
  7. "time"
  8. "github.com/chrislusf/seaweedfs/weed/util/log"
  9. "github.com/chrislusf/seaweedfs/weed/storage"
  10. "github.com/chrislusf/seaweedfs/weed/storage/needle"
  11. "github.com/chrislusf/seaweedfs/weed/storage/super_block"
  12. )
  13. type copyState int
  14. const (
  15. noCopies copyState = 0 + iota
  16. insufficientCopies
  17. enoughCopies
  18. )
  19. type volumeState string
  20. const (
  21. readOnlyState volumeState = "ReadOnly"
  22. oversizedState = "Oversized"
  23. )
  24. type stateIndicator func(copyState) bool
  25. func ExistCopies() stateIndicator {
  26. return func(state copyState) bool { return state != noCopies }
  27. }
  28. func NoCopies() stateIndicator {
  29. return func(state copyState) bool { return state == noCopies }
  30. }
  31. type volumesBinaryState struct {
  32. rp *super_block.ReplicaPlacement
  33. name volumeState // the name for volume state (eg. "Readonly", "Oversized")
  34. indicator stateIndicator // indicate whether the volumes should be marked as `name`
  35. copyMap map[needle.VolumeId]*VolumeLocationList
  36. }
  37. func NewVolumesBinaryState(name volumeState, rp *super_block.ReplicaPlacement, indicator stateIndicator) *volumesBinaryState {
  38. return &volumesBinaryState{
  39. rp: rp,
  40. name: name,
  41. indicator: indicator,
  42. copyMap: make(map[needle.VolumeId]*VolumeLocationList),
  43. }
  44. }
  45. func (v *volumesBinaryState) Dump() (res []uint32) {
  46. for vid, list := range v.copyMap {
  47. if v.indicator(v.copyState(list)) {
  48. res = append(res, uint32(vid))
  49. }
  50. }
  51. return
  52. }
  53. func (v *volumesBinaryState) IsTrue(vid needle.VolumeId) bool {
  54. list, _ := v.copyMap[vid]
  55. return v.indicator(v.copyState(list))
  56. }
  57. func (v *volumesBinaryState) Add(vid needle.VolumeId, dn *DataNode) {
  58. list, _ := v.copyMap[vid]
  59. if list != nil {
  60. list.Set(dn)
  61. return
  62. }
  63. list = NewVolumeLocationList()
  64. list.Set(dn)
  65. v.copyMap[vid] = list
  66. }
  67. func (v *volumesBinaryState) Remove(vid needle.VolumeId, dn *DataNode) {
  68. list, _ := v.copyMap[vid]
  69. if list != nil {
  70. list.Remove(dn)
  71. if list.Length() == 0 {
  72. delete(v.copyMap, vid)
  73. }
  74. }
  75. }
  76. func (v *volumesBinaryState) copyState(list *VolumeLocationList) copyState {
  77. if list == nil {
  78. return noCopies
  79. }
  80. if list.Length() < v.rp.GetCopyCount() {
  81. return insufficientCopies
  82. }
  83. return enoughCopies
  84. }
  85. // mapping from volume to its locations, inverted from server to volume
  86. type VolumeLayout struct {
  87. rp *super_block.ReplicaPlacement
  88. ttl *needle.TTL
  89. vid2location map[needle.VolumeId]*VolumeLocationList
  90. writables []needle.VolumeId // transient array of writable volume id
  91. readonlyVolumes *volumesBinaryState // readonly volumes
  92. oversizedVolumes *volumesBinaryState // oversized volumes
  93. volumeSizeLimit uint64
  94. replicationAsMin bool
  95. accessLock sync.RWMutex
  96. }
  97. type VolumeLayoutStats struct {
  98. TotalSize uint64
  99. UsedSize uint64
  100. FileCount uint64
  101. }
  102. func NewVolumeLayout(rp *super_block.ReplicaPlacement, ttl *needle.TTL, volumeSizeLimit uint64, replicationAsMin bool) *VolumeLayout {
  103. return &VolumeLayout{
  104. rp: rp,
  105. ttl: ttl,
  106. vid2location: make(map[needle.VolumeId]*VolumeLocationList),
  107. writables: *new([]needle.VolumeId),
  108. readonlyVolumes: NewVolumesBinaryState(readOnlyState, rp, ExistCopies()),
  109. oversizedVolumes: NewVolumesBinaryState(oversizedState, rp, ExistCopies()),
  110. volumeSizeLimit: volumeSizeLimit,
  111. replicationAsMin: replicationAsMin,
  112. }
  113. }
  114. func (vl *VolumeLayout) String() string {
  115. return fmt.Sprintf("rp:%v, ttl:%v, vid2location:%v, writables:%v, volumeSizeLimit:%v", vl.rp, vl.ttl, vl.vid2location, vl.writables, vl.volumeSizeLimit)
  116. }
  117. func (vl *VolumeLayout) RegisterVolume(v *storage.VolumeInfo, dn *DataNode) {
  118. vl.accessLock.Lock()
  119. defer vl.accessLock.Unlock()
  120. defer vl.ensureCorrectWritables(v.Id)
  121. defer vl.rememberOversizedVolume(v, dn)
  122. if _, ok := vl.vid2location[v.Id]; !ok {
  123. vl.vid2location[v.Id] = NewVolumeLocationList()
  124. }
  125. vl.vid2location[v.Id].Set(dn)
  126. // log.Tracef("volume %d added to %s len %d copy %d", v.Id, dn.Id(), vl.vid2location[v.Id].Length(), v.ReplicaPlacement.GetCopyCount())
  127. for _, dn := range vl.vid2location[v.Id].list {
  128. if vInfo, err := dn.GetVolumesById(v.Id); err == nil {
  129. if vInfo.ReadOnly {
  130. log.Debugf("vid %d removed from writable", v.Id)
  131. vl.removeFromWritable(v.Id)
  132. vl.readonlyVolumes.Add(v.Id, dn)
  133. return
  134. } else {
  135. vl.readonlyVolumes.Remove(v.Id, dn)
  136. }
  137. } else {
  138. log.Debugf("vid %d removed from writable", v.Id)
  139. vl.removeFromWritable(v.Id)
  140. vl.readonlyVolumes.Remove(v.Id, dn)
  141. return
  142. }
  143. }
  144. }
  145. func (vl *VolumeLayout) rememberOversizedVolume(v *storage.VolumeInfo, dn *DataNode) {
  146. if vl.isOversized(v) {
  147. vl.oversizedVolumes.Add(v.Id, dn)
  148. } else {
  149. vl.oversizedVolumes.Remove(v.Id, dn)
  150. }
  151. }
  152. func (vl *VolumeLayout) UnRegisterVolume(v *storage.VolumeInfo, dn *DataNode) {
  153. vl.accessLock.Lock()
  154. defer vl.accessLock.Unlock()
  155. // remove from vid2location map
  156. location, ok := vl.vid2location[v.Id]
  157. if !ok {
  158. return
  159. }
  160. if location.Remove(dn) {
  161. vl.readonlyVolumes.Remove(v.Id, dn)
  162. vl.oversizedVolumes.Remove(v.Id, dn)
  163. vl.ensureCorrectWritables(v.Id)
  164. if location.Length() == 0 {
  165. delete(vl.vid2location, v.Id)
  166. }
  167. }
  168. }
  169. func (vl *VolumeLayout) EnsureCorrectWritables(v *storage.VolumeInfo) {
  170. vl.accessLock.Lock()
  171. defer vl.accessLock.Unlock()
  172. vl.ensureCorrectWritables(v.Id)
  173. }
  174. func (vl *VolumeLayout) ensureCorrectWritables(vid needle.VolumeId) {
  175. if vl.enoughCopies(vid) && vl.isAllWritable(vid) {
  176. if !vl.oversizedVolumes.IsTrue(vid) {
  177. vl.setVolumeWritable(vid)
  178. }
  179. } else {
  180. vl.removeFromWritable(vid)
  181. }
  182. }
  183. func (vl *VolumeLayout) isAllWritable(vid needle.VolumeId) bool {
  184. for _, dn := range vl.vid2location[vid].list {
  185. if v, found := dn.volumes[vid]; found {
  186. if v.ReadOnly {
  187. return false
  188. }
  189. }
  190. }
  191. return true
  192. }
  193. func (vl *VolumeLayout) isOversized(v *storage.VolumeInfo) bool {
  194. return uint64(v.Size) >= vl.volumeSizeLimit
  195. }
  196. func (vl *VolumeLayout) isWritable(v *storage.VolumeInfo) bool {
  197. return !vl.isOversized(v) &&
  198. v.Version == needle.CurrentVersion &&
  199. !v.ReadOnly
  200. }
  201. func (vl *VolumeLayout) isEmpty() bool {
  202. vl.accessLock.RLock()
  203. defer vl.accessLock.RUnlock()
  204. return len(vl.vid2location) == 0
  205. }
  206. func (vl *VolumeLayout) Lookup(vid needle.VolumeId) []*DataNode {
  207. vl.accessLock.RLock()
  208. defer vl.accessLock.RUnlock()
  209. if location := vl.vid2location[vid]; location != nil {
  210. return location.list
  211. }
  212. return nil
  213. }
  214. func (vl *VolumeLayout) ListVolumeServers() (nodes []*DataNode) {
  215. vl.accessLock.RLock()
  216. defer vl.accessLock.RUnlock()
  217. for _, location := range vl.vid2location {
  218. nodes = append(nodes, location.list...)
  219. }
  220. return
  221. }
  222. func (vl *VolumeLayout) PickForWrite(count uint64, option *VolumeGrowOption) (*needle.VolumeId, uint64, *VolumeLocationList, error) {
  223. vl.accessLock.RLock()
  224. defer vl.accessLock.RUnlock()
  225. lenWriters := len(vl.writables)
  226. if lenWriters <= 0 {
  227. log.Infoln("No more writable volumes!")
  228. return nil, 0, nil, errors.New("No more writable volumes!")
  229. }
  230. if option.DataCenter == "" {
  231. vid := vl.writables[rand.Intn(lenWriters)]
  232. locationList := vl.vid2location[vid]
  233. if locationList != nil {
  234. return &vid, count, locationList, nil
  235. }
  236. return nil, 0, nil, errors.New("Strangely vid " + vid.String() + " is on no machine!")
  237. }
  238. var vid needle.VolumeId
  239. var locationList *VolumeLocationList
  240. counter := 0
  241. for _, v := range vl.writables {
  242. volumeLocationList := vl.vid2location[v]
  243. for _, dn := range volumeLocationList.list {
  244. if dn.GetDataCenter().Id() == NodeId(option.DataCenter) {
  245. if option.Rack != "" && dn.GetRack().Id() != NodeId(option.Rack) {
  246. continue
  247. }
  248. if option.DataNode != "" && dn.Id() != NodeId(option.DataNode) {
  249. continue
  250. }
  251. counter++
  252. if rand.Intn(counter) < 1 {
  253. vid, locationList = v, volumeLocationList
  254. }
  255. }
  256. }
  257. }
  258. return &vid, count, locationList, nil
  259. }
  260. func (vl *VolumeLayout) GetActiveVolumeCount(option *VolumeGrowOption) int {
  261. vl.accessLock.RLock()
  262. defer vl.accessLock.RUnlock()
  263. if option.DataCenter == "" {
  264. return len(vl.writables)
  265. }
  266. counter := 0
  267. for _, v := range vl.writables {
  268. for _, dn := range vl.vid2location[v].list {
  269. if dn.GetDataCenter().Id() == NodeId(option.DataCenter) {
  270. if option.Rack != "" && dn.GetRack().Id() != NodeId(option.Rack) {
  271. continue
  272. }
  273. if option.DataNode != "" && dn.Id() != NodeId(option.DataNode) {
  274. continue
  275. }
  276. counter++
  277. }
  278. }
  279. }
  280. return counter
  281. }
  282. func (vl *VolumeLayout) removeFromWritable(vid needle.VolumeId) bool {
  283. toDeleteIndex := -1
  284. for k, id := range vl.writables {
  285. if id == vid {
  286. toDeleteIndex = k
  287. break
  288. }
  289. }
  290. if toDeleteIndex >= 0 {
  291. log.Infoln("Volume", vid, "becomes unwritable")
  292. vl.writables = append(vl.writables[0:toDeleteIndex], vl.writables[toDeleteIndex+1:]...)
  293. return true
  294. }
  295. return false
  296. }
  297. func (vl *VolumeLayout) setVolumeWritable(vid needle.VolumeId) bool {
  298. for _, v := range vl.writables {
  299. if v == vid {
  300. return false
  301. }
  302. }
  303. log.Infoln("Volume", vid, "becomes writable")
  304. vl.writables = append(vl.writables, vid)
  305. return true
  306. }
  307. func (vl *VolumeLayout) SetVolumeUnavailable(dn *DataNode, vid needle.VolumeId) bool {
  308. vl.accessLock.Lock()
  309. defer vl.accessLock.Unlock()
  310. if location, ok := vl.vid2location[vid]; ok {
  311. if location.Remove(dn) {
  312. vl.readonlyVolumes.Remove(vid, dn)
  313. vl.oversizedVolumes.Remove(vid, dn)
  314. if location.Length() < vl.rp.GetCopyCount() {
  315. log.Infoln("Volume", vid, "has", location.Length(), "replica, less than required", vl.rp.GetCopyCount())
  316. return vl.removeFromWritable(vid)
  317. }
  318. }
  319. }
  320. return false
  321. }
  322. func (vl *VolumeLayout) SetVolumeAvailable(dn *DataNode, vid needle.VolumeId, isReadOnly bool) bool {
  323. vl.accessLock.Lock()
  324. defer vl.accessLock.Unlock()
  325. vInfo, err := dn.GetVolumesById(vid)
  326. if err != nil {
  327. return false
  328. }
  329. vl.vid2location[vid].Set(dn)
  330. if vInfo.ReadOnly || isReadOnly {
  331. return false
  332. }
  333. if vl.enoughCopies(vid) {
  334. return vl.setVolumeWritable(vid)
  335. }
  336. return false
  337. }
  338. func (vl *VolumeLayout) enoughCopies(vid needle.VolumeId) bool {
  339. locations := vl.vid2location[vid].Length()
  340. desired := vl.rp.GetCopyCount()
  341. return locations == desired || (vl.replicationAsMin && locations > desired)
  342. }
  343. func (vl *VolumeLayout) SetVolumeCapacityFull(vid needle.VolumeId) bool {
  344. vl.accessLock.Lock()
  345. defer vl.accessLock.Unlock()
  346. // log.Infoln("Volume", vid, "reaches full capacity.")
  347. return vl.removeFromWritable(vid)
  348. }
  349. func (vl *VolumeLayout) ToMap() map[string]interface{} {
  350. m := make(map[string]interface{})
  351. m["replication"] = vl.rp.String()
  352. m["ttl"] = vl.ttl.String()
  353. m["writables"] = vl.writables
  354. //m["locations"] = vl.vid2location
  355. return m
  356. }
  357. func (vl *VolumeLayout) Stats() *VolumeLayoutStats {
  358. vl.accessLock.RLock()
  359. defer vl.accessLock.RUnlock()
  360. ret := &VolumeLayoutStats{}
  361. freshThreshold := time.Now().Unix() - 60
  362. for vid, vll := range vl.vid2location {
  363. size, fileCount := vll.Stats(vid, freshThreshold)
  364. ret.FileCount += uint64(fileCount)
  365. ret.UsedSize += size
  366. if vl.readonlyVolumes.IsTrue(vid) {
  367. ret.TotalSize += size
  368. } else {
  369. ret.TotalSize += vl.volumeSizeLimit
  370. }
  371. }
  372. return ret
  373. }