-
Notifications
You must be signed in to change notification settings - Fork 0
/
types.go
367 lines (319 loc) · 7.36 KB
/
types.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
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
// Copyright 2020 Thinkium
//
// 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 common
import (
"bytes"
"errors"
"fmt"
"math/big"
"reflect"
"strings"
"sync"
lru "github.com/hashicorp/golang-lru"
"github.com/stephenfire/go-common/hexutil"
)
var (
EmptyPlaceHolder struct{} = struct{}{}
EmptyByteSliceHolder []byte = make([]byte, 0)
BytesBufferPool = sync.Pool{
New: func() interface{} {
return new(bytes.Buffer)
},
}
BigIntPool = sync.Pool{
New: func() interface{} {
return new(big.Int)
},
}
ErrAlreadyInitialized = errors.New("already initialized")
ErrAlreadyStarted = errors.New("already started")
ErrAlreadyStopped = errors.New("already stopped")
ErrNeedInitialization = errors.New("need initialization")
ErrNotStarted = errors.New("not started yet")
ErrIllegalStatus = errors.New("illegal status")
ErrNoAdapter = errors.New("no adapter")
ErrInsufficientLength = errors.New("insufficient length")
ErrLength = errors.New("length error")
ErrNil = errors.New("nil value")
ErrNotFound = errors.New("not found")
ErrDuplicated = errors.New("duplicated")
ErrIllegalParams = errors.New("illegal parameters")
ErrUnsupported = errors.New("unsupported")
ErrUnknown = errors.New("unknown error")
ErrAlreadyDone = errors.New("already done, operation ignored")
ErrReservedAddress = errors.New("reserved address")
ErrMissMatch = errors.New("miss match")
ErrInsufficientBalance = errors.New("insufficient balance for transfer")
EmptyHash = Hash{}
NilHashSlice = []byte(nil)
NilHash = BytesToHash(NilHashSlice)
EmptyNodeHashSlice []byte
EmptyNodeHash Hash
)
func init() {
// Initialize the hash values of Nil according to RealCipher
NilHashSlice = SystemHash256(nil)
NilHash = BytesToHash(NilHashSlice)
}
// type NodeType string
type Service interface {
String() string
Init() error
Start() error
Close() error
}
type ServiceStatus byte
func (ss *ServiceStatus) CheckInit() error {
switch *ss {
case SSInitialized:
return ErrAlreadyInitialized
case SSStarted:
return ErrAlreadyStarted
}
*ss = SSInitialized
return nil
}
func (ss *ServiceStatus) CheckStart() error {
if *ss != SSInitialized {
return ErrNeedInitialization
}
*ss = SSStarted
return nil
}
func (ss *ServiceStatus) CheckStop() error {
switch *ss {
case SSCreated, SSInitialized:
return ErrNotStarted
case SSStopped:
return ErrAlreadyStopped
}
*ss = SSStopped
return nil
}
type ServiceStateChanger interface {
Initializer() error
Starter() error
Closer() error
}
func dummyFunc() error {
return nil
}
type AbstractService struct {
serviceStatus ServiceStatus
serviceLocker sync.Mutex
InitFunc func() error
StartFunc func() error
CloseFunc func() error
}
func (s AbstractService) Copy() AbstractService {
as := AbstractService{}
as.serviceStatus = s.serviceStatus
as.InitFunc = dummyFunc
as.StartFunc = dummyFunc
as.CloseFunc = dummyFunc
return as
}
func (s *AbstractService) SetChanger(changer ServiceStateChanger) {
s.InitFunc = changer.Initializer
s.StartFunc = changer.Starter
s.CloseFunc = changer.Closer
}
func (s *AbstractService) Init() error {
s.serviceLocker.Lock()
defer s.serviceLocker.Unlock()
if err := s.serviceStatus.CheckInit(); err != nil {
return err
}
if s.InitFunc != nil {
if err := s.InitFunc(); err != nil {
return err
}
}
return nil
}
func (s *AbstractService) Start() error {
s.serviceLocker.Lock()
defer s.serviceLocker.Unlock()
if err := s.serviceStatus.CheckStart(); err != nil {
return err
}
if s.StartFunc != nil {
if err := s.StartFunc(); err != nil {
return err
}
}
return nil
}
func (s *AbstractService) Close() error {
s.serviceLocker.Lock()
defer s.serviceLocker.Unlock()
if err := s.serviceStatus.CheckStop(); err != nil {
return err
}
if s.CloseFunc != nil {
if err := s.CloseFunc(); err != nil {
return err
}
}
return nil
}
type DvppError struct {
Message string
Embedded error
}
func NewDvppError(msg string, embeded error) DvppError {
return DvppError{Message: msg, Embedded: embeded}
}
func (e DvppError) Error() string {
return fmt.Sprintf("%s: %v", e.Message, e.Embedded)
}
type LruMap struct {
Map *lru.Cache
}
func NewLruMap(size int) *LruMap {
cache, err := lru.New(size)
if err != nil {
panic(err)
}
return &LruMap{Map: cache}
}
func (m *LruMap) Add(key interface{}, value interface{}) bool {
if m.Map.Contains(key) {
return false
}
m.Map.Add(key, value)
return true
}
func (m *LruMap) Get(key interface{}) interface{} {
v, ok := m.Map.Get(key)
if !ok {
return nil
}
return v
}
func (m *LruMap) Contains(key interface{}) bool {
return m.Map.Contains(key)
}
func (m *LruMap) Remove(key interface{}) {
m.Map.Remove(key)
}
func (m *LruMap) Clear() {
m.Map.Purge()
}
type (
// key pair
Cipherer interface {
Priv() []byte
Pub() []byte
}
// account
Identifier interface {
Cipherer
Address() Address
AddressP() *Address
}
// node
NodeIdentifier interface {
Cipherer
NodeID() NodeID
NodeIDP() *NodeID
}
)
func IdentifiersToNodeIDs(nis []NodeIdentifier) NodeIDs {
if nis == nil {
return nil
}
nids := make(NodeIDs, 0, len(nis))
for _, ni := range nis {
if ni == nil {
continue
}
nids = append(nids, ni.NodeID())
}
return nids
}
type Infoer interface {
InfoString(level IndentLevel) string
}
type IndentLevel int
func (l IndentLevel) IndentString() string {
if l <= 0 {
return ""
}
return strings.Repeat("\t", int(l))
}
func (l IndentLevel) _valueInfo(v reflect.Value) string {
if !v.IsValid() {
return "N/A"
}
o := v.Interface()
switch obj := o.(type) {
case []byte:
return hexutil.Encode(obj)
case string:
return obj
case Infoer:
return obj.InfoString(l)
case fmt.Stringer:
return fmt.Sprintf("%s", obj.String())
default:
return "UKN"
}
}
func (l IndentLevel) InfoString(o interface{}) string {
if o == nil {
return "<nil>"
}
v := reflect.ValueOf(o)
if !v.IsValid() {
return "N/A"
}
kind := v.Kind()
switch kind {
case reflect.Array, reflect.Slice:
indent := l.IndentString()
if kind == reflect.Slice && v.IsNil() {
return "<nil>"
}
next := l + 1
nextIndent := next.IndentString()
buf := new(bytes.Buffer)
buf.WriteByte('[')
if v.Len() > 0 {
for i := 0; i < v.Len(); i++ {
one := v.Index(i)
buf.WriteString(fmt.Sprintf("\n%s%s,", nextIndent, next._valueInfo(one)))
}
buf.WriteByte('\n')
buf.WriteString(indent)
}
buf.WriteByte(']')
return buf.String()
default:
return l._valueInfo(v)
}
}
func (l IndentLevel) DoubleByteSlice(slices [][]byte) string {
if slices == nil {
return "<nil>"
}
indent := l.IndentString()
buf := new(bytes.Buffer)
buf.WriteByte('[')
for _, slice := range slices {
buf.WriteString(fmt.Sprintf("\n%s\t%x,", indent, slice))
}
buf.WriteString(fmt.Sprintf("\n%s]", indent))
return buf.String()
}