lbry.go/dht/contact.go

119 lines
3.3 KiB
Go
Raw Normal View History

2018-06-25 19:00:55 +02:00
package dht
import (
"bytes"
"net"
2018-07-25 17:44:11 +02:00
"sort"
2018-07-13 19:31:54 +02:00
"strconv"
2018-06-25 19:00:55 +02:00
2019-10-10 05:07:33 +02:00
"github.com/lbryio/lbry.go/v2/dht/bits"
"github.com/lbryio/lbry.go/v2/extras/errors"
2018-06-25 19:00:55 +02:00
"github.com/lyoshenka/bencode"
)
// TODO: if routing table is ever empty (aka the node is isolated), it should re-bootstrap
2018-07-13 19:31:54 +02:00
// Contact contains information for contacting another node on the network
2018-06-25 19:00:55 +02:00
type Contact struct {
2018-07-13 19:31:54 +02:00
ID bits.Bitmap
IP net.IP
Port int // the udp port used for the dht
PeerPort int // the tcp port a peer can be contacted on for blob requests
2018-06-25 19:00:55 +02:00
}
2018-07-13 19:31:54 +02:00
// Equals returns true if two contacts are the same.
2018-06-25 19:00:55 +02:00
func (c Contact) Equals(other Contact, checkID bool) bool {
return c.IP.Equal(other.IP) && c.Port == other.Port && (!checkID || c.ID == other.ID)
}
2018-07-13 19:31:54 +02:00
// Addr returns the address of the contact.
2018-06-25 19:00:55 +02:00
func (c Contact) Addr() *net.UDPAddr {
return &net.UDPAddr{IP: c.IP, Port: c.Port}
}
2018-07-13 19:31:54 +02:00
// String returns a short string representation of the contact
2018-06-25 19:00:55 +02:00
func (c Contact) String() string {
2018-07-13 19:31:54 +02:00
str := c.ID.HexShort() + "@" + c.Addr().String()
if c.PeerPort != 0 {
str += "(" + strconv.Itoa(c.PeerPort) + ")"
}
return str
2018-06-25 19:00:55 +02:00
}
2018-07-13 19:31:54 +02:00
// MarshalCompact returns a compact byteslice representation of the contact
// NOTE: The compact representation always uses the tcp PeerPort, not the udp Port. This is dumb, but that's how the python daemon does it
2018-06-25 19:00:55 +02:00
func (c Contact) MarshalCompact() ([]byte, error) {
if c.IP.To4() == nil {
return nil, errors.Err("ip not set")
}
2018-07-13 19:31:54 +02:00
if c.PeerPort < 0 || c.PeerPort > 65535 {
2018-06-25 19:00:55 +02:00
return nil, errors.Err("invalid port")
}
var buf bytes.Buffer
buf.Write(c.IP.To4())
2018-07-13 19:31:54 +02:00
buf.WriteByte(byte(c.PeerPort >> 8))
buf.WriteByte(byte(c.PeerPort))
2018-06-25 19:00:55 +02:00
buf.Write(c.ID[:])
if buf.Len() != compactNodeInfoLength {
return nil, errors.Err("i dont know how this happened")
}
return buf.Bytes(), nil
}
2018-07-13 19:31:54 +02:00
// UnmarshalCompact unmarshals the compact byteslice representation of a contact.
// NOTE: The compact representation always uses the tcp PeerPort, not the udp Port. This is dumb, but that's how the python daemon does it
2018-06-25 19:00:55 +02:00
func (c *Contact) UnmarshalCompact(b []byte) error {
if len(b) != compactNodeInfoLength {
return errors.Err("invalid compact length")
}
c.IP = net.IPv4(b[0], b[1], b[2], b[3]).To4()
2018-07-13 19:31:54 +02:00
c.PeerPort = int(uint16(b[5]) | uint16(b[4])<<8)
2018-06-25 19:00:55 +02:00
c.ID = bits.FromBytesP(b[6:])
return nil
}
// MarshalBencode returns the serialized byte slice representation of a contact.
func (c Contact) MarshalBencode() ([]byte, error) {
return bencode.EncodeBytes([]interface{}{c.ID, c.IP.String(), c.Port})
}
// UnmarshalBencode unmarshals the serialized byte slice into the appropriate fields of the contact.
func (c *Contact) UnmarshalBencode(b []byte) error {
var raw []bencode.RawMessage
err := bencode.DecodeBytes(b, &raw)
if err != nil {
return err
}
if len(raw) != 3 {
return errors.Err("contact must have 3 elements; got %d", len(raw))
}
err = bencode.DecodeBytes(raw[0], &c.ID)
if err != nil {
return err
}
var ipStr string
err = bencode.DecodeBytes(raw[1], &ipStr)
if err != nil {
return err
}
c.IP = net.ParseIP(ipStr).To4()
if c.IP == nil {
return errors.Err("invalid IP")
}
return bencode.DecodeBytes(raw[2], &c.Port)
2018-06-25 19:00:55 +02:00
}
2018-07-25 17:44:11 +02:00
func sortByDistance(contacts []Contact, target bits.Bitmap) {
sort.Slice(contacts, func(i, j int) bool {
return contacts[i].ID.Xor(target).Cmp(contacts[j].ID.Xor(target)) < 0
})
2018-06-25 19:00:55 +02:00
}