-
Notifications
You must be signed in to change notification settings - Fork 0
/
init.go
63 lines (55 loc) · 3.32 KB
/
init.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
/*
* The Clear BSD License
*
* Copyright (c) 2019 Insolar Technologies
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted (subject to the limitations in the disclaimer below) provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* Neither the name of Insolar Technologies nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
package packets
import (
"github.com/insolar/insolar/log"
)
// packetMaxSize should be less then MTU
const packetMaxSize = 1400
var (
phase1PacketSizeForClaims int
// claimSizeMap contains serialized size of each claim type without header(2 bytes)
claimSizeMap map[ClaimType]uint16
// claimSizeMap contains sizes of serialized votes for each type without header (2 bytes)
voteSizeMap map[VoteType]uint16
)
// init packets and claims size variables
func init() {
sizeOf := func(s Serializer) uint16 {
data, err := s.Serialize()
if err != nil {
log.Fatalln("Failed to init packets package: ", err.Error())
}
return uint16(len(data))
}
phase1PacketSizeForClaims = packetMaxSize - int(sizeOf(&Phase1Packet{}))
claimSizeMap = make(map[ClaimType]uint16)
claimSizeMap[TypeNodeJoinClaim] = sizeOf(&NodeJoinClaim{})
claimSizeMap[TypeNodeAnnounceClaim] = sizeOf(&NodeAnnounceClaim{})
claimSizeMap[TypeCapabilityPollingAndActivation] = sizeOf(&CapabilityPoolingAndActivation{})
claimSizeMap[TypeNodeViolationBlame] = sizeOf(&NodeViolationBlame{})
claimSizeMap[TypeNodeBroadcast] = sizeOf(&NodeBroadcast{})
claimSizeMap[TypeNodeLeaveClaim] = sizeOf(&NodeLeaveClaim{})
claimSizeMap[TypeChangeNetworkClaim] = sizeOf(&NodeLeaveClaim{})
voteSizeMap = make(map[VoteType]uint16)
voteSizeMap[TypeStateFraudNodeSupplementaryVote] = sizeOf(&StateFraudNodeSupplementaryVote{})
voteSizeMap[TypeNodeListSupplementaryVote] = sizeOf(&NodeListSupplementaryVote{})
voteSizeMap[TypeMissingNodeSupplementaryVote] = sizeOf(&MissingNodeSupplementaryVote{})
voteSizeMap[TypeMissingNode] = sizeOf(&MissingNode{})
// MissingNodeClaim has variable-sized length
voteSizeMap[TypeMissingNodeClaim] = 0
}