-
Notifications
You must be signed in to change notification settings - Fork 635
/
partition.go
143 lines (121 loc) · 3.32 KB
/
partition.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
// Copyright 2018 The Chubao Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
// implied. See the License for the specific language governing
// permissions and limitations under the License.
package meta
import (
"fmt"
"github.com/chubaofs/chubaofs/util/btree"
)
type MetaPartition struct {
PartitionID uint64
Start uint64
End uint64
Members []string
LeaderAddr string
Status int8
}
func (this *MetaPartition) Less(than btree.Item) bool {
that := than.(*MetaPartition)
return this.Start < that.Start
}
func (mp *MetaPartition) Copy() btree.Item {
return mp
}
func (mp *MetaPartition) String() string {
return fmt.Sprintf("PartitionID(%v) Start(%v) End(%v) Members(%v) LeaderAddr(%v) Status(%v)", mp.PartitionID, mp.Start, mp.End, mp.Members, mp.LeaderAddr, mp.Status)
}
// Meta partition managements
//
func (mw *MetaWrapper) addPartition(mp *MetaPartition) {
mw.partitions[mp.PartitionID] = mp
mw.ranges.ReplaceOrInsert(mp)
}
func (mw *MetaWrapper) deletePartition(mp *MetaPartition) {
delete(mw.partitions, mp.PartitionID)
mw.ranges.Delete(mp)
}
func (mw *MetaWrapper) replaceOrInsertPartition(mp *MetaPartition) {
mw.Lock()
defer mw.Unlock()
found, ok := mw.partitions[mp.PartitionID]
if ok {
mw.deletePartition(found)
}
mw.addPartition(mp)
return
}
func (mw *MetaWrapper) getPartitionByID(id uint64) *MetaPartition {
mw.RLock()
defer mw.RUnlock()
mp, ok := mw.partitions[id]
if !ok {
return nil
}
return mp
}
func (mw *MetaWrapper) getPartitionByInode(ino uint64) *MetaPartition {
var mp *MetaPartition
mw.RLock()
defer mw.RUnlock()
pivot := &MetaPartition{Start: ino}
mw.ranges.DescendLessOrEqual(pivot, func(i btree.Item) bool {
mp = i.(*MetaPartition)
if ino > mp.End || ino < mp.Start {
mp = nil
}
// Iterate one item is enough
return false
})
return mp
}
//func (mw *MetaWrapper) getRWPartitions() []*MetaPartition {
// rwPartitions := make([]*MetaPartition, 0)
// mw.RLock()
// defer mw.RUnlock()
// for _, mp := range mw.partitions {
// if mp.Status == proto.ReadWrite {
// rwPartitions = append(rwPartitions, mp)
// }
// }
// return rwPartitions
//}
func (mw *MetaWrapper) getRWPartitions() []*MetaPartition {
mw.RLock()
defer mw.RUnlock()
rwPartitions := mw.rwPartitions
if len(rwPartitions) == 0 {
rwPartitions = make([]*MetaPartition, 0)
for _, mp := range mw.partitions {
rwPartitions = append(rwPartitions, mp)
}
}
return rwPartitions
}
// GetConnect the partition whose Start is Larger than ino.
// Return nil if no successive partition.
func (mw *MetaWrapper) getNextPartition(ino uint64) *MetaPartition {
var mp *MetaPartition
mw.RLock()
defer mw.RUnlock()
pivot := &MetaPartition{Start: ino + 1}
mw.ranges.AscendGreaterOrEqual(pivot, func(i btree.Item) bool {
mp = i.(*MetaPartition)
return false
})
return mp
}
func (mw *MetaWrapper) getLatestPartition() *MetaPartition {
mw.RLock()
defer mw.RUnlock()
return mw.ranges.Max().(*MetaPartition)
}