/
baseNode.go
292 lines (271 loc) · 6.42 KB
/
baseNode.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
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
package node
// xlNode_go/baseNode.go
import (
"crypto/rsa"
"encoding/hex"
"fmt"
xc "github.com/jddixon/xlCrypto_go"
xi "github.com/jddixon/xlNodeID_go"
xo "github.com/jddixon/xlOverlay_go"
"strings"
)
/**
* Basic abstraction underlying Peer and Node
*/
type BaseNode struct {
name string // convenience for testing
nodeID *xi.NodeID
commsPubKey *rsa.PublicKey
sigPubKey *rsa.PublicKey
overlays []xo.OverlayI
}
func NewNewBaseNode(name string, id *xi.NodeID) (*BaseNode, error) {
return NewBaseNode(name, id, nil, nil, nil)
}
func NewBaseNode(name string, id *xi.NodeID,
ck *rsa.PublicKey, sk *rsa.PublicKey,
o []xo.OverlayI) (p *BaseNode, err error) {
// IDENTITY /////////////////////////////////////////////////////
if id == nil {
return nil, NilNodeID
}
nodeID, err := (*id).Clone()
if err != nil {
return
}
commsPubKey := ck
sigPubKey := sk
var overlays []xo.OverlayI // an empty slice
if o != nil {
count := len(o)
for i := 0; i < count; i++ {
overlays = append(overlays, o[i])
}
} // FOO
p = new(BaseNode)
p.name = name
p.nodeID = nodeID // the clone
p.commsPubKey = commsPubKey
p.sigPubKey = sigPubKey
p.overlays = overlays
return p, nil
}
func (p *BaseNode) GetName() string {
return p.name
}
func (p *BaseNode) GetNodeID() *xi.NodeID {
return p.nodeID
}
func (p *BaseNode) GetCommsPublicKey() *rsa.PublicKey {
return p.commsPubKey
}
func (p *BaseNode) GetSigPublicKey() *rsa.PublicKey {
return p.sigPubKey
}
// OVERLAYS /////////////////////////////////////////////////////////
// Add an overlay to the BaseNode, returing either its non-negative
// index in the overlay table or an error. If the overlay is already
// present, it simply returns its index.
func (n *BaseNode) AddOverlay(o xo.OverlayI) (ndx int, err error) {
ndx = -1
if o == nil {
err = NilOverlay
} else {
for i := 0; i < len(n.overlays); i++ {
if n.overlays[i].Equal(o) {
ndx = i
break
}
}
if ndx == -1 {
n.overlays = append(n.overlays, o)
ndx = len(n.overlays) - 1
}
}
return
}
// Return a count of the number of overlays.
func (p *BaseNode) SizeOverlays() int {
return len(p.overlays)
}
func (p *BaseNode) GetOverlay(n int) xo.OverlayI {
return p.overlays[n]
}
// EQUAL ////////////////////////////////////////////////////////////
func (p *BaseNode) Equal(any interface{}) bool {
if any == p {
return true
}
if any == nil {
return false
}
switch v := any.(type) {
case *BaseNode:
_ = v
default:
return false
}
other := any.(*BaseNode) // type assertion
// THINK ABOUT publicKey.equals(any.publicKey)
return xi.SameNodeID(p.nodeID, other.nodeID)
}
// SERIALIZATION ////////////////////////////////////////////////////
func addStringlet(slice *[]string, s string) {
*slice = append(*slice, s)
}
func (p *BaseNode) Strings() []string {
// DEBUG
if p == nil {
panic("BaseNode.Strings: nil p !")
}
if p.commsPubKey == nil {
panic("BaseNode.Strings: nil p.commsPubKey !")
}
// END
ckPEM, err := xc.RSAPubKeyToPEM(p.commsPubKey)
if err != nil {
panic(err)
}
skPEM, err := xc.RSAPubKeyToPEM(p.sigPubKey)
if err != nil {
panic(err)
}
var s []string
addStringlet(&s, fmt.Sprintf("name: %s", p.name))
addStringlet(&s, fmt.Sprintf("nodeID: %s", p.nodeID.String()))
addStringlet(&s, fmt.Sprintf("commsPubKey: %s", ckPEM))
addStringlet(&s, fmt.Sprintf("sigPubKey: %s", skPEM))
addStringlet(&s, fmt.Sprintf("overlays {"))
for i := 0; i < len(p.overlays); i++ {
addStringlet(&s, fmt.Sprintf(" %s", p.overlays[i].String()))
}
addStringlet(&s, fmt.Sprintf("}"))
return s
}
func (p *BaseNode) String() string {
return strings.Join(p.Strings(), "\n")
}
// DESERIALIZATION //////////////////////////////////////////////////
// Parse a serialized BaseNode, ignoring blank lines and leading and
// trailing whitespace. Expect the first line to be like "TYPE {"
func ParseBaseNode(data, whichType string) (bn *BaseNode, rest []string, err error) {
ss := strings.Split(data, "\n") // yields a slice of strings
return ParseBNFromStrings(ss, whichType)
}
// Version of the above which consumes a slice of strings. XXX Copies the
// slice unnecessarily.
func ParseBNFromStrings(ss []string, whichType string) (bn *BaseNode, rest []string, err error) {
var (
name string
nodeID *xi.NodeID
commsPubKey *rsa.PublicKey
sigPubKey *rsa.PublicKey
overlays []xo.OverlayI
)
s, err := xc.NextNBLine(&ss)
if err == nil {
opener := fmt.Sprintf("%s {", whichType) // "peer {" or "node {"
if s != opener {
err = NotExpectedOpener
}
}
if err == nil {
s, err := xc.NextNBLine(&ss)
if err == nil {
if strings.HasPrefix(s, "name: ") {
name = s[6:]
} else {
err = NotABaseNode
}
}
}
if err == nil {
s, err = xc.NextNBLine(&ss)
if err == nil {
if strings.HasPrefix(s, "nodeID: ") {
var val []byte
val, err = hex.DecodeString(s[8:])
if err == nil {
nodeID, err = xi.NewNodeID(val)
}
} else {
err = NotABaseNode
}
}
}
if err == nil {
s, err = xc.NextNBLine(&ss)
if err == nil {
if strings.HasPrefix(s, "commsPubKey: ") {
var ckPEM []byte
ckPEM, err = xc.CollectPEMRSAPublicKey(s[13:], &ss)
if err == nil {
commsPubKey, err = xc.RSAPubKeyFromPEM(ckPEM)
}
} else {
// DEBUG
fmt.Printf("\ndon't see commsPubKey\n")
// END
err = NotABaseNode
}
}
}
if err == nil {
s, err = xc.NextNBLine(&ss)
if err == nil {
if strings.HasPrefix(s, "sigPubKey: ") {
var skPEM []byte
skPEM, err = xc.CollectPEMRSAPublicKey(s[11:], &ss)
if err == nil {
sigPubKey, err = xc.RSAPubKeyFromPEM(skPEM)
}
} else {
// DEBUG
fmt.Printf("\ndon't see sigPubKey\n")
// END
err = NotABaseNode
}
}
}
if err == nil {
s, err = xc.NextNBLine(&ss)
if err == nil {
if s == "overlays {" {
for {
s, err = xc.NextNBLine(&ss)
if err == nil {
if s == "" { // end of strings
err = NotABaseNode
break
} else if s == "}" {
prepend := []string{s}
ss = append(prepend, ss...)
break
}
}
var o xo.OverlayI
o, err = xo.Parse(s)
if err == nil {
overlays = append(overlays, o)
}
}
} else {
err = NotABaseNode
}
}
}
if err == nil {
s, err = xc.NextNBLine(&ss)
if err == nil {
if s != "}" {
err = NotABaseNode
}
}
}
if err == nil {
var bn = BaseNode{name, nodeID, commsPubKey, sigPubKey, overlays}
return &bn, ss, nil
} else {
return nil, nil, err
}
}