-
Notifications
You must be signed in to change notification settings - Fork 199
/
trieNodeResolver.go
259 lines (217 loc) · 7.4 KB
/
trieNodeResolver.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
package resolvers
import (
"github.com/multiversx/mx-chain-core-go/core"
"github.com/multiversx/mx-chain-core-go/core/check"
"github.com/multiversx/mx-chain-core-go/data/batch"
"github.com/multiversx/mx-chain-go/dataRetriever"
"github.com/multiversx/mx-chain-go/p2p"
logger "github.com/multiversx/mx-chain-logger-go"
)
var _ dataRetriever.Resolver = (*TrieNodeResolver)(nil)
var logTrieNodes = logger.GetOrCreate("dataretriever/resolvers/trienoderesolver")
// ArgTrieNodeResolver is the argument structure used to create new TrieNodeResolver instance
type ArgTrieNodeResolver struct {
ArgBaseResolver
TrieDataGetter dataRetriever.TrieDataGetter
}
// TrieNodeResolver is a wrapper over Resolver that is specialized in resolving trie node requests
type TrieNodeResolver struct {
*baseResolver
messageProcessor
trieDataGetter dataRetriever.TrieDataGetter
}
// NewTrieNodeResolver creates a new trie node resolver
func NewTrieNodeResolver(arg ArgTrieNodeResolver) (*TrieNodeResolver, error) {
err := checkArgTrieNodeResolver(arg)
if err != nil {
return nil, err
}
return &TrieNodeResolver{
baseResolver: &baseResolver{
TopicResolverSender: arg.SenderResolver,
},
trieDataGetter: arg.TrieDataGetter,
messageProcessor: messageProcessor{
marshalizer: arg.Marshaller,
antifloodHandler: arg.AntifloodHandler,
topic: arg.SenderResolver.RequestTopic(),
throttler: arg.Throttler,
},
}, nil
}
func checkArgTrieNodeResolver(arg ArgTrieNodeResolver) error {
err := checkArgBase(arg.ArgBaseResolver)
if err != nil {
return err
}
if check.IfNil(arg.TrieDataGetter) {
return dataRetriever.ErrNilTrieDataGetter
}
return nil
}
// ProcessReceivedMessage will be the callback func from the p2p.Messenger and will be called each time a new message was received
// (for the topic this validator was registered to, usually a request topic)
func (tnRes *TrieNodeResolver) ProcessReceivedMessage(message p2p.MessageP2P, fromConnectedPeer core.PeerID, source p2p.MessageHandler) error {
err := tnRes.canProcessMessage(message, fromConnectedPeer)
if err != nil {
return err
}
tnRes.throttler.StartProcessing()
defer tnRes.throttler.EndProcessing()
rd, err := tnRes.parseReceivedMessage(message, fromConnectedPeer)
if err != nil {
return err
}
switch rd.Type {
case dataRetriever.HashType:
return tnRes.resolveOneHash(rd.Value, rd.ChunkIndex, message, source)
case dataRetriever.HashArrayType:
return tnRes.resolveMultipleHashes(rd.Value, message, source)
default:
return dataRetriever.ErrRequestTypeNotImplemented
}
}
func (tnRes *TrieNodeResolver) resolveMultipleHashes(hashesBuff []byte, message p2p.MessageP2P, source p2p.MessageHandler) error {
b := batch.Batch{}
err := tnRes.marshalizer.Unmarshal(&b, hashesBuff)
if err != nil {
return err
}
hashes := b.Data
supportedChunkIndex := uint32(0)
nodes := make(map[string]struct{})
spaceUsed, usedAllSpace := tnRes.resolveOnlyRequestedHashes(hashes, nodes)
if usedAllSpace {
return tnRes.sendResponse(convertMapToSlice(nodes), hashes, supportedChunkIndex, message, source)
}
tnRes.resolveSubTries(hashes, nodes, spaceUsed)
return tnRes.sendResponse(convertMapToSlice(nodes), hashes, supportedChunkIndex, message, source)
}
func (tnRes *TrieNodeResolver) resolveOnlyRequestedHashes(hashes [][]byte, nodes map[string]struct{}) (int, bool) {
spaceUsed := 0
usedAllSpace := false
remainingSpace := core.MaxBufferSizeToSendTrieNodes
for _, hash := range hashes {
serializedNode, err := tnRes.trieDataGetter.GetSerializedNode(hash)
if err != nil {
continue
}
isNotFirstLargeElement := spaceUsed > 0 && (remainingSpace-len(serializedNode)) < 0
if isNotFirstLargeElement {
usedAllSpace = true
break
}
spaceUsed += len(serializedNode)
nodes[string(serializedNode)] = struct{}{}
remainingSpace -= len(serializedNode)
}
usedAllSpace = usedAllSpace || remainingSpace == 0
return spaceUsed, usedAllSpace
}
func (tnRes *TrieNodeResolver) resolveSubTries(hashes [][]byte, nodes map[string]struct{}, spaceUsedAlready int) {
var serializedNodes [][]byte
var err error
var serializedNode []byte
for _, hash := range hashes {
remainingForSubtries := core.MaxBufferSizeToSendTrieNodes - spaceUsedAlready
if remainingForSubtries < 0 {
return
}
serializedNodes, _, err = tnRes.getSubTrie(hash, uint64(remainingForSubtries))
if err != nil {
continue
}
for _, serializedNode = range serializedNodes {
_, exists := nodes[string(serializedNode)]
if exists {
continue
}
if remainingForSubtries-len(serializedNode) < 0 {
return
}
spaceUsedAlready += len(serializedNode)
nodes[string(serializedNode)] = struct{}{}
}
}
}
func convertMapToSlice(m map[string]struct{}) [][]byte {
buff := make([][]byte, 0, len(m))
for data := range m {
buff = append(buff, []byte(data))
}
return buff
}
func (tnRes *TrieNodeResolver) resolveOneHash(hash []byte, chunkIndex uint32, message p2p.MessageP2P, source p2p.MessageHandler) error {
serializedNode, err := tnRes.trieDataGetter.GetSerializedNode(hash)
if err != nil {
return err
}
return tnRes.sendResponse([][]byte{serializedNode}, [][]byte{hash}, chunkIndex, message, source)
}
func (tnRes *TrieNodeResolver) getSubTrie(hash []byte, remainingSpace uint64) ([][]byte, uint64, error) {
serializedNodes, remainingSpace, err := tnRes.trieDataGetter.GetSerializedNodes(hash, remainingSpace)
if err != nil {
tnRes.DebugHandler().LogFailedToResolveData(
tnRes.topic,
hash,
err,
)
return nil, remainingSpace, err
}
tnRes.DebugHandler().LogSucceededToResolveData(tnRes.topic, hash)
return serializedNodes, remainingSpace, nil
}
func (tnRes *TrieNodeResolver) sendResponse(
serializedNodes [][]byte,
hashes [][]byte,
chunkIndex uint32,
message p2p.MessageP2P,
source p2p.MessageHandler,
) error {
if len(serializedNodes) == 0 {
//do not send useless message
return nil
}
if len(serializedNodes) == 1 && len(serializedNodes[0]) > core.MaxBufferSizeToSendTrieNodes {
return tnRes.sendLargeMessage(serializedNodes[0], hashes[0], int(chunkIndex), message, source)
}
buff, err := tnRes.marshalizer.Marshal(&batch.Batch{Data: serializedNodes})
if err != nil {
return err
}
return tnRes.Send(buff, message.Peer(), source)
}
func (tnRes *TrieNodeResolver) sendLargeMessage(
largeBuff []byte,
reference []byte,
chunkIndex int,
message p2p.MessageP2P,
source p2p.MessageHandler,
) error {
logTrieNodes.Trace("assembling chunk", "reference", reference, "len", len(largeBuff))
maxChunks := len(largeBuff) / core.MaxBufferSizeToSendTrieNodes
if len(largeBuff)%core.MaxBufferSizeToSendTrieNodes != 0 {
maxChunks++
}
chunkIndexOutOfBounds := chunkIndex < 0 || chunkIndex > maxChunks
if chunkIndexOutOfBounds {
return nil
}
startIndex := chunkIndex * core.MaxBufferSizeToSendTrieNodes
endIndex := startIndex + core.MaxBufferSizeToSendTrieNodes
if endIndex > len(largeBuff) {
endIndex = len(largeBuff)
}
chunkBuffer := largeBuff[startIndex:endIndex]
chunk := batch.NewChunk(uint32(chunkIndex), reference, uint32(maxChunks), chunkBuffer)
logTrieNodes.Trace("assembled chunk", "index", chunkIndex, "reference", reference, "max chunks", maxChunks, "len", len(chunkBuffer))
buff, err := tnRes.marshalizer.Marshal(chunk)
if err != nil {
return err
}
return tnRes.Send(buff, message.Peer(), source)
}
// IsInterfaceNil returns true if there is no value under the interface
func (tnRes *TrieNodeResolver) IsInterfaceNil() bool {
return tnRes == nil
}