mirror of
https://github.com/rclone/rclone.git
synced 2024-12-13 02:33:58 +01:00
89 lines
2.1 KiB
Go
89 lines
2.1 KiB
Go
|
// Copyright (C) 2019 Storj Labs, Inc.
|
||
|
// See LICENSE for copying information.
|
||
|
|
||
|
package pb
|
||
|
|
||
|
import (
|
||
|
"bytes"
|
||
|
"reflect"
|
||
|
|
||
|
"github.com/gogo/protobuf/proto"
|
||
|
|
||
|
"storj.io/common/storj"
|
||
|
)
|
||
|
|
||
|
// Equal compares two Protobuf messages via serialization
|
||
|
func Equal(msg1, msg2 proto.Message) bool {
|
||
|
//reflect.DeepEqual and proto.Equal don't seem work in all cases
|
||
|
//todo: see how slow this is compared to custom equality checks
|
||
|
if msg1 == nil {
|
||
|
return msg2 == nil
|
||
|
}
|
||
|
if reflect.TypeOf(msg1) != reflect.TypeOf(msg2) {
|
||
|
return false
|
||
|
}
|
||
|
msg1Bytes, err := Marshal(msg1)
|
||
|
if err != nil {
|
||
|
return false
|
||
|
}
|
||
|
msg2Bytes, err := Marshal(msg2)
|
||
|
if err != nil {
|
||
|
return false
|
||
|
}
|
||
|
return bytes.Equal(msg1Bytes, msg2Bytes)
|
||
|
}
|
||
|
|
||
|
// NodesToIDs extracts Node-s into a list of ids
|
||
|
func NodesToIDs(nodes []*Node) storj.NodeIDList {
|
||
|
ids := make(storj.NodeIDList, len(nodes))
|
||
|
for i, node := range nodes {
|
||
|
if node != nil {
|
||
|
ids[i] = node.Id
|
||
|
}
|
||
|
}
|
||
|
return ids
|
||
|
}
|
||
|
|
||
|
// CopyNode returns a deep copy of a node
|
||
|
// It would be better to use `proto.Clone` but it is curently incompatible
|
||
|
// with gogo's customtype extension.
|
||
|
// (see https://github.com/gogo/protobuf/issues/147)
|
||
|
func CopyNode(src *Node) (dst *Node) {
|
||
|
node := Node{Id: storj.NodeID{}}
|
||
|
copy(node.Id[:], src.Id[:])
|
||
|
|
||
|
if src.Address != nil {
|
||
|
node.Address = &NodeAddress{
|
||
|
Transport: src.Address.Transport,
|
||
|
Address: src.Address.Address,
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return &node
|
||
|
}
|
||
|
|
||
|
// AddressEqual compares two node addresses
|
||
|
func AddressEqual(a1, a2 *NodeAddress) bool {
|
||
|
if a1 == nil && a2 == nil {
|
||
|
return true
|
||
|
}
|
||
|
if a1 == nil || a2 == nil {
|
||
|
return false
|
||
|
}
|
||
|
return a1.Transport == a2.Transport &&
|
||
|
a1.Address == a2.Address
|
||
|
}
|
||
|
|
||
|
// NewRedundancySchemeToStorj creates new storj.RedundancyScheme from the given
|
||
|
// protobuf RedundancyScheme.
|
||
|
func NewRedundancySchemeToStorj(scheme *RedundancyScheme) *storj.RedundancyScheme {
|
||
|
return &storj.RedundancyScheme{
|
||
|
Algorithm: storj.RedundancyAlgorithm(scheme.GetType()),
|
||
|
ShareSize: scheme.GetErasureShareSize(),
|
||
|
RequiredShares: int16(scheme.GetMinReq()),
|
||
|
RepairShares: int16(scheme.GetRepairThreshold()),
|
||
|
OptimalShares: int16(scheme.GetSuccessThreshold()),
|
||
|
TotalShares: int16(scheme.GetTotal()),
|
||
|
}
|
||
|
}
|