-
Notifications
You must be signed in to change notification settings - Fork 0
/
registry.go
277 lines (247 loc) · 6.71 KB
/
registry.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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
package reg
// xlReg_go/registry.go
// This file contains functions and structures used to describe
// and manage the cluster data managed by the registry.
import (
"fmt"
ha "github.com/jddixon/hamt_go"
xcl "github.com/jddixon/xlCluster_go"
xf "github.com/jddixon/xlCrypto_go/filters"
xi "github.com/jddixon/xlNodeID_go"
xt "github.com/jddixon/xlTransport_go"
xu "github.com/jddixon/xlUtil_go"
"io/ioutil"
"log"
"os"
"path/filepath"
"strings"
"sync"
)
var _ = fmt.Print
type Registry struct {
LogFile string
Logger *log.Logger // volatile, not serialized
// registry data
m, k uint // serialized
Clusters []*RegCluster // serialized
GlobalEndPoint xt.EndPointI // gets written to regCred
idFilter xf.BloomSHAI
ClustersByName map[string]*RegCluster // volatile, not serialized
ClustersByID ha.HAMT // -ditto-
RegMembersByID ha.HAMT // -ditto-
mu sync.RWMutex // -ditto-
// the extended XLattice node, so id, lfs, keys, etc
RegNode
}
func NewRegistry(clusters []*RegCluster,
rn *RegNode,
opt *RegOptions) (
reg *Registry, err error) {
var (
idFilter xf.BloomSHAI
m ha.HAMT
serverVersion xu.DecimalVersion
)
serverVersion, err = xu.ParseDecimalVersion(VERSION)
if err == nil && rn == nil {
err = NilRegNode
}
if err == nil {
if opt.BackingFile == "" {
idFilter, err = xf.NewBloomSHA(opt.M, opt.K)
} else {
idFilter, err = xf.NewMappedBloomSHA(opt.M, opt.K, opt.BackingFile)
}
if err == nil {
// HAMT root table size is 2^opt.T
m, err = ha.NewHAMT(DEFAULT_W, opt.T)
}
}
if err == nil {
logger := opt.Logger
if logger == nil {
logger = log.New(os.Stderr, "", log.Ldate|log.Ltime)
}
testing := opt.Testing
// DEBUG
if testing {
logger.Printf("testing and globalEndPoint = %s\n", opt.GlobalEndPoint)
}
// END
reg = &Registry{
idFilter: idFilter,
Clusters: clusters,
GlobalEndPoint: opt.GlobalEndPoint, // written to regCred
ClustersByName: make(map[string]*RegCluster),
ClustersByID: m,
Logger: logger,
RegNode: *rn,
}
if clusters != nil {
// XXX need to populate the indexes here
}
myLFS := rn.GetLFS()
if myLFS != "" {
var ep []xt.EndPointI
// list of endpoints for regCred
//for i := 0; i < rn.SizeEndPoints(); i++ {
// ep = append(ep, rn.GetEndPoint(i))
//}
// XXX err should never be nil here
if err == nil {
ep = append(ep, opt.GlobalEndPoint)
regCred := &RegCred{
Name: rn.GetName(),
ID: rn.GetNodeID(),
CommsPubKey: rn.GetCommsPublicKey(),
SigPubKey: rn.GetSigPublicKey(),
EndPoints: ep,
Version: serverVersion,
}
serialized := regCred.String() // shd have terminating CRLF
logger.Print(serialized)
pathToFile := filepath.Join(myLFS, "regCred.dat")
err = ioutil.WriteFile(pathToFile, []byte(serialized), 0644)
}
}
}
if err == nil {
// registry's own ID added to Bloom filter
regID := rn.GetNodeID()
// DEBUG
reg.Logger.Printf("\ninserting registry ID %x\n", regID.Value())
// END
err = reg.InsertID(regID)
}
return
}
func (reg *Registry) ContainsID(n *xi.NodeID) (found bool, err error) {
found, _, err = reg.idFilter.IsMember(n.Value())
// DEBUG
reg.Logger.Printf("Registry.ContainsID(%x) returning %v, %v\n",
n.Value(), found, err)
// END
return
}
func (reg *Registry) InsertID(n *xi.NodeID) (err error) {
b := n.Value()
// DEBUG
reg.Logger.Printf("Registry.InsertID(%x)\n", b)
// END
found, _, err := reg.idFilter.IsMember(b)
if err == nil {
if found {
// DEBUG
reg.Logger.Printf(" id is already registered\n")
// END
err = IDAlreadyInUse
} else {
err = reg.idFilter.Insert(b)
// DEBUG
reg.Logger.Printf(" added %x to registry; err is %v\n", b, err)
// END
}
}
return
}
func (reg *Registry) IDCount() (count uint) {
reg.mu.Lock()
defer reg.mu.Unlock()
count = reg.idFilter.Size()
return
}
// XXX RegMembersByID is not being updated! This is the redundant and so
// possibly inconsistent index of members of registry clusters
// Add a cluster member to the RegMembersByID index unless it is already
// present.
func (reg *Registry) indexClusterMember(cluster *RegCluster, cm *xcl.ClusterMember) (
index int, err error) {
if cluster == nil {
err = NilCluster
} else if cm == nil {
err = NilClusterMember
} else {
}
return
}
func (reg *Registry) AddCluster(cluster *RegCluster) (index int, err error) {
var bKey, cKey ha.BytesKey
if cluster == nil {
err = NilCluster
} else {
name := cluster.Name
id := cluster.ID // []byte
// convert ID into a HAMT BytesKey
bKey, err = ha.NewBytesKey(id)
if err == nil {
reg.mu.Lock()
defer reg.mu.Unlock()
if _, ok := reg.ClustersByName[name]; ok {
err = NameAlreadyInUse
} else {
var whatever interface{}
whatever, err = reg.ClustersByID.Find(bKey)
if err == nil && whatever != nil {
err = IDAlreadyInUse
}
}
if err == nil {
index = len(reg.Clusters)
reg.Clusters = append(reg.Clusters, cluster)
reg.ClustersByName[name] = cluster
cKey, err = ha.NewBytesKey(cluster.GetNodeID().Value())
if err == nil {
err = reg.ClustersByID.Insert(cKey, cluster)
}
}
}
}
if err != nil {
index = -1
}
return
}
// This function generates a good-quality random NodeID (a 20-byte
// value) that is not already known to the registry and then adds
// the new NodeID to the registry's Bloom filter.
func (reg *Registry) InsertUniqueNodeID() (nodeID *xi.NodeID, err error) {
nodeID, err = xi.New(nil)
found, err := reg.ContainsID(nodeID)
for err == nil && found {
nodeID, err = xi.New(nil)
found, err = reg.ContainsID(nodeID)
}
if err == nil {
err = reg.idFilter.Insert(nodeID.Value())
}
// DEBUG
reg.Logger.Printf("InsertUniqueNodeID returning %x, %v\n",
nodeID.Value(), err)
// END
return
}
// SERIALIZATION ====================================================
// Tentatively the registry is serialized separately from the regNode
// and so consists of a sequence of serialized clusters
func (reg *Registry) String() (s string) {
return strings.Join(reg.Strings(), "\n")
}
// If we change the serialization so that there is no closing brace,
// it will be possible to simply append cluster serializations to the
// registry configuration file while the registry is running.
func (reg *Registry) Strings() (ss []string) {
ss = []string{"registry {"}
ss = append(ss, fmt.Sprintf(" LogFile: %s", reg.LogFile))
ss = append(ss, "}")
for i := 0; i < len(reg.Clusters); i++ {
cs := reg.Clusters[i].Strings()
for j := 0; j < len(cs); j++ {
ss = append(ss, cs[j])
}
}
return
}
func ParseRegistry(s string) (reg *Registry, rest []string, err error) {
// XXX STUB
return
}