mirror of
https://source.quilibrium.com/quilibrium/ceremonyclient.git
synced 2024-11-15 20:55:17 +00:00
6a7cbab864
- removed defer/recover/panic where warranted - found and eliminated race conditions when extremely high connection pressure was hit - resolved race condition in blossomsub around mesh maintenance - incorporated resource manager scaling to work off low/hi watermark values
693 lines
21 KiB
Go
693 lines
21 KiB
Go
package swarm
|
|
|
|
import (
|
|
"context"
|
|
"errors"
|
|
"fmt"
|
|
"net/netip"
|
|
"strconv"
|
|
"sync"
|
|
"time"
|
|
|
|
"github.com/libp2p/go-libp2p/core/canonicallog"
|
|
"github.com/libp2p/go-libp2p/core/network"
|
|
"github.com/libp2p/go-libp2p/core/peer"
|
|
"github.com/libp2p/go-libp2p/core/peerstore"
|
|
"github.com/libp2p/go-libp2p/core/transport"
|
|
|
|
ma "github.com/multiformats/go-multiaddr"
|
|
madns "github.com/multiformats/go-multiaddr-dns"
|
|
mafmt "github.com/multiformats/go-multiaddr-fmt"
|
|
manet "github.com/multiformats/go-multiaddr/net"
|
|
)
|
|
|
|
// The maximum number of address resolution steps we'll perform for a single
|
|
// peer (for all addresses).
|
|
const maxAddressResolution = 32
|
|
|
|
// Diagram of dial sync:
|
|
//
|
|
// many callers of Dial() synched w. dials many addrs results to callers
|
|
// ----------------------\ dialsync use earliest /--------------
|
|
// -----------------------\ |----------\ /----------------
|
|
// ------------------------>------------<------- >---------<-----------------
|
|
// -----------------------| \----x \----------------
|
|
// ----------------------| \-----x \---------------
|
|
// any may fail if no addr at end
|
|
// retry dialAttempt x
|
|
|
|
var (
|
|
// ErrDialBackoff is returned by the backoff code when a given peer has
|
|
// been dialed too frequently
|
|
ErrDialBackoff = errors.New("dial backoff")
|
|
|
|
// ErrDialRefusedBlackHole is returned when we are in a black holed environment
|
|
ErrDialRefusedBlackHole = errors.New("dial refused because of black hole")
|
|
|
|
// ErrDialToSelf is returned if we attempt to dial our own peer
|
|
ErrDialToSelf = errors.New("dial to self attempted")
|
|
|
|
// ErrNoTransport is returned when we don't know a transport for the
|
|
// given multiaddr.
|
|
ErrNoTransport = errors.New("no transport for protocol")
|
|
|
|
// ErrAllDialsFailed is returned when connecting to a peer has ultimately failed
|
|
ErrAllDialsFailed = errors.New("all dials failed")
|
|
|
|
// ErrNoAddresses is returned when we fail to find any addresses for a
|
|
// peer we're trying to dial.
|
|
ErrNoAddresses = errors.New("no addresses")
|
|
|
|
// ErrNoGoodAddresses is returned when we find addresses for a peer but
|
|
// can't use any of them.
|
|
ErrNoGoodAddresses = errors.New("no good addresses")
|
|
|
|
// ErrGaterDisallowedConnection is returned when the gater prevents us from
|
|
// forming a connection with a peer.
|
|
ErrGaterDisallowedConnection = errors.New("gater disallows connection to peer")
|
|
)
|
|
|
|
// ErrQUICDraft29 wraps ErrNoTransport and provide a more meaningful error message
|
|
var ErrQUICDraft29 errQUICDraft29
|
|
|
|
type errQUICDraft29 struct{}
|
|
|
|
func (errQUICDraft29) Error() string {
|
|
return "QUIC draft-29 has been removed, QUIC (RFC 9000) is accessible with /quic-v1"
|
|
}
|
|
|
|
func (errQUICDraft29) Unwrap() error {
|
|
return ErrNoTransport
|
|
}
|
|
|
|
// DialAttempts governs how many times a goroutine will try to dial a given peer.
|
|
// Note: this is down to one, as we have _too many dials_ atm. To add back in,
|
|
// add loop back in Dial(.)
|
|
const DialAttempts = 1
|
|
|
|
// ConcurrentFdDials is the number of concurrent outbound dials over transports
|
|
// that consume file descriptors
|
|
const ConcurrentFdDials = 160
|
|
|
|
// DefaultPerPeerRateLimit is the number of concurrent outbound dials to make
|
|
// per peer
|
|
var DefaultPerPeerRateLimit = 8
|
|
|
|
// DialBackoff is a type for tracking peer dial backoffs. Dialbackoff is used to
|
|
// avoid over-dialing the same, dead peers. Whenever we totally time out on all
|
|
// addresses of a peer, we add the addresses to DialBackoff. Then, whenever we
|
|
// attempt to dial the peer again, we check each address for backoff. If it's on
|
|
// backoff, we don't dial the address and exit promptly. If a dial is
|
|
// successful, the peer and all its addresses are removed from backoff.
|
|
//
|
|
// * It's safe to use its zero value.
|
|
// * It's thread-safe.
|
|
// * It's *not* safe to move this type after using.
|
|
type DialBackoff struct {
|
|
entries map[peer.ID]map[string]*backoffAddr
|
|
lock sync.RWMutex
|
|
}
|
|
|
|
type backoffAddr struct {
|
|
tries int
|
|
until time.Time
|
|
}
|
|
|
|
func (db *DialBackoff) init(ctx context.Context) {
|
|
if db.entries == nil {
|
|
db.entries = make(map[peer.ID]map[string]*backoffAddr)
|
|
}
|
|
go db.background(ctx)
|
|
}
|
|
|
|
func (db *DialBackoff) background(ctx context.Context) {
|
|
ticker := time.NewTicker(BackoffMax)
|
|
for {
|
|
select {
|
|
case <-ctx.Done():
|
|
ticker.Stop()
|
|
return
|
|
case <-ticker.C:
|
|
db.cleanup()
|
|
}
|
|
}
|
|
}
|
|
|
|
// Backoff returns whether the client should backoff from dialing
|
|
// peer p at address addr
|
|
func (db *DialBackoff) Backoff(p peer.ID, addr ma.Multiaddr) (backoff bool) {
|
|
db.lock.RLock()
|
|
|
|
ap, found := db.entries[p][string(addr.Bytes())]
|
|
db.lock.RUnlock()
|
|
return found && time.Now().Before(ap.until)
|
|
}
|
|
|
|
// BackoffBase is the base amount of time to backoff (default: 5s).
|
|
var BackoffBase = time.Second * 5
|
|
|
|
// BackoffCoef is the backoff coefficient (default: 1s).
|
|
var BackoffCoef = time.Second
|
|
|
|
// BackoffMax is the maximum backoff time (default: 5m).
|
|
var BackoffMax = time.Minute * 5
|
|
|
|
// AddBackoff adds peer's address to backoff.
|
|
//
|
|
// Backoff is not exponential, it's quadratic and computed according to the
|
|
// following formula:
|
|
//
|
|
// BackoffBase + BakoffCoef * PriorBackoffs^2
|
|
//
|
|
// Where PriorBackoffs is the number of previous backoffs.
|
|
func (db *DialBackoff) AddBackoff(p peer.ID, addr ma.Multiaddr) {
|
|
saddr := string(addr.Bytes())
|
|
db.lock.Lock()
|
|
bp, ok := db.entries[p]
|
|
if !ok {
|
|
bp = make(map[string]*backoffAddr, 1)
|
|
db.entries[p] = bp
|
|
}
|
|
ba, ok := bp[saddr]
|
|
if !ok {
|
|
bp[saddr] = &backoffAddr{
|
|
tries: 1,
|
|
until: time.Now().Add(BackoffBase),
|
|
}
|
|
db.lock.Unlock()
|
|
return
|
|
}
|
|
|
|
backoffTime := BackoffBase + BackoffCoef*time.Duration(ba.tries*ba.tries)
|
|
if backoffTime > BackoffMax {
|
|
backoffTime = BackoffMax
|
|
}
|
|
ba.until = time.Now().Add(backoffTime)
|
|
ba.tries++
|
|
db.lock.Unlock()
|
|
}
|
|
|
|
// Clear removes a backoff record. Clients should call this after a
|
|
// successful Dial.
|
|
func (db *DialBackoff) Clear(p peer.ID) {
|
|
db.lock.Lock()
|
|
delete(db.entries, p)
|
|
db.lock.Unlock()
|
|
}
|
|
|
|
func (db *DialBackoff) cleanup() {
|
|
db.lock.Lock()
|
|
now := time.Now()
|
|
for p, e := range db.entries {
|
|
good := false
|
|
for _, backoff := range e {
|
|
backoffTime := BackoffBase + BackoffCoef*time.Duration(backoff.tries*backoff.tries)
|
|
if backoffTime > BackoffMax {
|
|
backoffTime = BackoffMax
|
|
}
|
|
if now.Before(backoff.until.Add(backoffTime)) {
|
|
good = true
|
|
break
|
|
}
|
|
}
|
|
if !good {
|
|
delete(db.entries, p)
|
|
}
|
|
}
|
|
db.lock.Unlock()
|
|
}
|
|
|
|
// DialPeer connects to a peer. Use network.WithForceDirectDial to force a
|
|
// direct connection.
|
|
//
|
|
// The idea is that the client of Swarm does not need to know what network
|
|
// the connection will happen over. Swarm can use whichever it choses.
|
|
// This allows us to use various transport protocols, do NAT traversal/relay,
|
|
// etc. to achieve connection.
|
|
func (s *Swarm) DialPeer(ctx context.Context, p peer.ID) (network.Conn, error) {
|
|
// Avoid typed nil issues.
|
|
c, err := s.dialPeer(ctx, p)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
return c, nil
|
|
}
|
|
|
|
// internal dial method that returns an unwrapped conn
|
|
//
|
|
// It is gated by the swarm's dial synchronization systems: dialsync and
|
|
// dialbackoff.
|
|
func (s *Swarm) dialPeer(ctx context.Context, p peer.ID) (*Conn, error) {
|
|
log.Debugw("dialing peer", "from", s.local, "to", p)
|
|
err := p.Validate()
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
if p == s.local {
|
|
return nil, ErrDialToSelf
|
|
}
|
|
|
|
// check if we already have an open (usable) connection.
|
|
conn := s.bestAcceptableConnToPeer(ctx, p)
|
|
if conn != nil {
|
|
return conn, nil
|
|
}
|
|
|
|
if s.gater != nil && !s.gater.InterceptPeerDial(p) {
|
|
log.Debugf("gater disallowed outbound connection to peer %s", p)
|
|
return nil, &DialError{Peer: p, Cause: ErrGaterDisallowedConnection}
|
|
}
|
|
|
|
// apply the DialPeer timeout
|
|
ctx, cancel := context.WithTimeout(ctx, network.GetDialPeerTimeout(ctx))
|
|
|
|
conn, err = s.dsync.Dial(ctx, p)
|
|
if err == nil {
|
|
// Ensure we connected to the correct peer.
|
|
// This was most likely already checked by the security protocol, but it doesn't hurt do it again here.
|
|
if conn.RemotePeer() != p {
|
|
conn.Close()
|
|
log.Errorw("Handshake failed to properly authenticate peer", "authenticated", conn.RemotePeer(), "expected", p)
|
|
cancel()
|
|
return nil, fmt.Errorf("unexpected peer")
|
|
}
|
|
cancel()
|
|
return conn, nil
|
|
}
|
|
|
|
log.Debugf("network for %s finished dialing %s", s.local, p)
|
|
|
|
if ctx.Err() != nil {
|
|
// Context error trumps any dial errors as it was likely the ultimate cause.
|
|
cancel()
|
|
return nil, ctx.Err()
|
|
}
|
|
|
|
if s.ctx.Err() != nil {
|
|
// Ok, so the swarm is shutting down.
|
|
cancel()
|
|
return nil, ErrSwarmClosed
|
|
}
|
|
|
|
cancel()
|
|
return nil, err
|
|
}
|
|
|
|
// dialWorkerLoop synchronizes and executes concurrent dials to a single peer
|
|
func (s *Swarm) dialWorkerLoop(p peer.ID, reqch <-chan dialRequest) {
|
|
w := newDialWorker(s, p, reqch, nil)
|
|
w.loop()
|
|
}
|
|
|
|
func (s *Swarm) addrsForDial(ctx context.Context, p peer.ID) (goodAddrs []ma.Multiaddr, addrErrs []TransportError, err error) {
|
|
peerAddrs := s.peers.Addrs(p)
|
|
if len(peerAddrs) == 0 {
|
|
return nil, nil, ErrNoAddresses
|
|
}
|
|
|
|
// Resolve dns or dnsaddrs
|
|
resolved, err := s.resolveAddrs(ctx, peer.AddrInfo{ID: p, Addrs: peerAddrs})
|
|
if err != nil {
|
|
return nil, nil, err
|
|
}
|
|
|
|
goodAddrs = ma.Unique(resolved)
|
|
goodAddrs, addrErrs = s.filterKnownUndialables(p, goodAddrs)
|
|
if forceDirect, _ := network.GetForceDirectDial(ctx); forceDirect {
|
|
goodAddrs = ma.FilterAddrs(goodAddrs, s.nonProxyAddr)
|
|
}
|
|
|
|
if len(goodAddrs) == 0 {
|
|
return nil, addrErrs, ErrNoGoodAddresses
|
|
}
|
|
|
|
s.peers.AddAddrs(p, goodAddrs, peerstore.TempAddrTTL)
|
|
|
|
return goodAddrs, addrErrs, nil
|
|
}
|
|
|
|
func (s *Swarm) resolveAddrs(ctx context.Context, pi peer.AddrInfo) ([]ma.Multiaddr, error) {
|
|
p2paddr, err := ma.NewMultiaddr("/" + ma.ProtocolWithCode(ma.P_P2P).Name + "/" + pi.ID.String())
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
var resolveSteps int
|
|
// Recursively resolve all addrs.
|
|
//
|
|
// While the toResolve list is non-empty:
|
|
// * Pop an address off.
|
|
// * If the address is fully resolved, add it to the resolved list.
|
|
// * Otherwise, resolve it and add the results to the "to resolve" list.
|
|
toResolve := append([]ma.Multiaddr{}, pi.Addrs...)
|
|
resolved := make([]ma.Multiaddr, 0, len(pi.Addrs))
|
|
for len(toResolve) > 0 {
|
|
// pop the last addr off.
|
|
addr := toResolve[len(toResolve)-1]
|
|
toResolve = toResolve[:len(toResolve)-1]
|
|
|
|
// if it's resolved, add it to the resolved list.
|
|
if !madns.Matches(addr) {
|
|
resolved = append(resolved, addr)
|
|
continue
|
|
}
|
|
|
|
resolveSteps++
|
|
|
|
// We've resolved too many addresses. We can keep all the fully
|
|
// resolved addresses but we'll need to skip the rest.
|
|
if resolveSteps >= maxAddressResolution {
|
|
log.Warnf(
|
|
"peer %s asked us to resolve too many addresses: %s/%s",
|
|
pi.ID,
|
|
resolveSteps,
|
|
maxAddressResolution,
|
|
)
|
|
continue
|
|
}
|
|
|
|
tpt := s.TransportForDialing(addr)
|
|
resolver, ok := tpt.(transport.Resolver)
|
|
if ok {
|
|
resolvedAddrs, err := resolver.Resolve(ctx, addr)
|
|
if err != nil {
|
|
log.Warnf("Failed to resolve multiaddr %s by transport %v: %v", addr, tpt, err)
|
|
continue
|
|
}
|
|
var added bool
|
|
for _, a := range resolvedAddrs {
|
|
if !addr.Equal(a) {
|
|
toResolve = append(toResolve, a)
|
|
added = true
|
|
}
|
|
}
|
|
if added {
|
|
continue
|
|
}
|
|
}
|
|
|
|
// otherwise, resolve it
|
|
reqaddr := addr.Encapsulate(p2paddr)
|
|
resaddrs, err := s.maResolver.Resolve(ctx, reqaddr)
|
|
if err != nil {
|
|
log.Infof("error resolving %s: %s", reqaddr, err)
|
|
}
|
|
|
|
// add the results to the toResolve list.
|
|
for _, res := range resaddrs {
|
|
pi, err := peer.AddrInfoFromP2pAddr(res)
|
|
if err != nil {
|
|
log.Infof("error parsing %s: %s", res, err)
|
|
}
|
|
toResolve = append(toResolve, pi.Addrs...)
|
|
}
|
|
}
|
|
|
|
return resolved, nil
|
|
}
|
|
|
|
func (s *Swarm) dialNextAddr(ctx context.Context, p peer.ID, addr ma.Multiaddr, resch chan transport.DialUpdate) error {
|
|
// check the dial backoff
|
|
if forceDirect, _ := network.GetForceDirectDial(ctx); !forceDirect {
|
|
if s.backf.Backoff(p, addr) {
|
|
return ErrDialBackoff
|
|
}
|
|
}
|
|
|
|
// start the dial
|
|
s.limitedDial(ctx, p, addr, resch)
|
|
|
|
return nil
|
|
}
|
|
|
|
func (s *Swarm) nonProxyAddr(addr ma.Multiaddr) bool {
|
|
t := s.TransportForDialing(addr)
|
|
return !t.Proxy()
|
|
}
|
|
|
|
var quicDraft29DialMatcher = mafmt.And(mafmt.IP, mafmt.Base(ma.P_UDP), mafmt.Base(ma.P_QUIC))
|
|
|
|
// filterKnownUndialables takes a list of multiaddrs, and removes those
|
|
// that we definitely don't want to dial: addresses configured to be blocked,
|
|
// IPv6 link-local addresses, addresses without a dial-capable transport,
|
|
// addresses that we know to be our own, and addresses with a better transport
|
|
// available. This is an optimization to avoid wasting time on dials that we
|
|
// know are going to fail or for which we have a better alternative.
|
|
func (s *Swarm) filterKnownUndialables(p peer.ID, addrs []ma.Multiaddr) (goodAddrs []ma.Multiaddr, addrErrs []TransportError) {
|
|
lisAddrs, _ := s.InterfaceListenAddresses()
|
|
var ourAddrs []ma.Multiaddr
|
|
for _, addr := range lisAddrs {
|
|
// we're only sure about filtering out /ip4 and /ip6 addresses, so far
|
|
ma.ForEach(addr, func(c ma.Component, e error) bool {
|
|
if e != nil {
|
|
return true
|
|
}
|
|
if c.Protocol().Code == ma.P_IP4 || c.Protocol().Code == ma.P_IP6 {
|
|
ourAddrs = append(ourAddrs, addr)
|
|
}
|
|
return false
|
|
})
|
|
}
|
|
|
|
addrErrs = make([]TransportError, 0, len(addrs))
|
|
|
|
// The order of checking for transport and filtering low priority addrs is important. If we
|
|
// can only dial /webtransport, we don't want to filter /webtransport addresses out because
|
|
// the peer had a /quic-v1 address
|
|
|
|
// filter addresses with no transport
|
|
addrs = ma.FilterAddrs(addrs, func(a ma.Multiaddr) bool {
|
|
if s.TransportForDialing(a) == nil {
|
|
e := ErrNoTransport
|
|
// We used to support QUIC draft-29 for a long time.
|
|
// Provide a more useful error when attempting to dial a QUIC draft-29 address.
|
|
if quicDraft29DialMatcher.Matches(a) {
|
|
e = ErrQUICDraft29
|
|
}
|
|
addrErrs = append(addrErrs, TransportError{Address: a, Cause: e})
|
|
return false
|
|
}
|
|
return true
|
|
})
|
|
|
|
// filter low priority addresses among the addresses we can dial
|
|
// We don't return an error for these addresses
|
|
addrs = filterLowPriorityAddresses(addrs)
|
|
|
|
// remove black holed addrs
|
|
addrs, blackHoledAddrs := s.bhd.FilterAddrs(addrs)
|
|
for _, a := range blackHoledAddrs {
|
|
addrErrs = append(addrErrs, TransportError{Address: a, Cause: ErrDialRefusedBlackHole})
|
|
}
|
|
|
|
return ma.FilterAddrs(addrs,
|
|
// Linux and BSD treat an unspecified address when dialing as a localhost address.
|
|
// Windows doesn't support this. We filter all such addresses out because peers
|
|
// listening on unspecified addresses will advertise more specific addresses.
|
|
// https://unix.stackexchange.com/a/419881
|
|
// https://superuser.com/a/1755455
|
|
func(addr ma.Multiaddr) bool {
|
|
return !manet.IsIPUnspecified(addr)
|
|
},
|
|
func(addr ma.Multiaddr) bool {
|
|
if ma.Contains(ourAddrs, addr) {
|
|
addrErrs = append(addrErrs, TransportError{Address: addr, Cause: ErrDialToSelf})
|
|
return false
|
|
}
|
|
return true
|
|
},
|
|
// TODO: Consider allowing link-local addresses
|
|
func(addr ma.Multiaddr) bool { return !manet.IsIP6LinkLocal(addr) },
|
|
func(addr ma.Multiaddr) bool {
|
|
if s.gater != nil && !s.gater.InterceptAddrDial(p, addr) {
|
|
addrErrs = append(addrErrs, TransportError{Address: addr, Cause: ErrGaterDisallowedConnection})
|
|
return false
|
|
}
|
|
return true
|
|
},
|
|
), addrErrs
|
|
}
|
|
|
|
// limitedDial will start a dial to the given peer when
|
|
// it is able, respecting the various different types of rate
|
|
// limiting that occur without using extra goroutines per addr
|
|
func (s *Swarm) limitedDial(ctx context.Context, p peer.ID, a ma.Multiaddr, resp chan transport.DialUpdate) error {
|
|
timeout := s.dialTimeout
|
|
is, err := manet.IsPrivateAddr(a)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
if is && s.dialTimeoutLocal < s.dialTimeout {
|
|
timeout = s.dialTimeoutLocal
|
|
}
|
|
s.limiter.AddDialJob(&dialJob{
|
|
addr: a,
|
|
peer: p,
|
|
resp: resp,
|
|
ctx: ctx,
|
|
timeout: timeout,
|
|
})
|
|
return nil
|
|
}
|
|
|
|
// dialAddr is the actual dial for an addr, indirectly invoked through the limiter
|
|
func (s *Swarm) dialAddr(ctx context.Context, p peer.ID, addr ma.Multiaddr, updCh chan<- transport.DialUpdate) (transport.CapableConn, error) {
|
|
// Just to double check. Costs nothing.
|
|
if s.local == p {
|
|
return nil, ErrDialToSelf
|
|
}
|
|
// Check before we start work
|
|
if err := ctx.Err(); err != nil {
|
|
log.Debugf("%s swarm not dialing. Context cancelled: %v. %s %s", s.local, err, p, addr)
|
|
return nil, err
|
|
}
|
|
log.Debugf("%s swarm dialing %s %s", s.local, p, addr)
|
|
|
|
tpt := s.TransportForDialing(addr)
|
|
if tpt == nil {
|
|
return nil, ErrNoTransport
|
|
}
|
|
|
|
start := time.Now()
|
|
var connC transport.CapableConn
|
|
var err error
|
|
if du, ok := tpt.(transport.DialUpdater); ok {
|
|
connC, err = du.DialWithUpdates(ctx, addr, p, updCh)
|
|
} else {
|
|
connC, err = tpt.Dial(ctx, addr, p)
|
|
}
|
|
|
|
// We're recording any error as a failure here.
|
|
// Notably, this also applies to cancellations (i.e. if another dial attempt was faster).
|
|
// This is ok since the black hole detector uses a very low threshold (5%).
|
|
s.bhd.RecordResult(addr, err == nil)
|
|
|
|
if err != nil {
|
|
if s.metricsTracer != nil {
|
|
s.metricsTracer.FailedDialing(addr, err, context.Cause(ctx))
|
|
}
|
|
return nil, err
|
|
}
|
|
canonicallog.LogPeerStatus(100, connC.RemotePeer(), connC.RemoteMultiaddr(), "connection_status", "established", "dir", "outbound")
|
|
if s.metricsTracer != nil {
|
|
connWithMetrics := wrapWithMetrics(connC, s.metricsTracer, start, network.DirOutbound)
|
|
connWithMetrics.completedHandshake()
|
|
connC = connWithMetrics
|
|
}
|
|
|
|
// Trust the transport? Yeah... right.
|
|
if connC.RemotePeer() != p {
|
|
connC.Close()
|
|
err = fmt.Errorf("BUG in transport %T: tried to dial %s, dialed %s", p, connC.RemotePeer(), tpt)
|
|
log.Error(err)
|
|
return nil, err
|
|
}
|
|
|
|
// success! we got one!
|
|
return connC, nil
|
|
}
|
|
|
|
// TODO We should have a `IsFdConsuming() bool` method on the `Transport` interface in go-libp2p/core/transport.
|
|
// This function checks if any of the transport protocols in the address requires a file descriptor.
|
|
// For now:
|
|
// A Non-circuit address which has the TCP/UNIX protocol is deemed FD consuming.
|
|
// For a circuit-relay address, we look at the address of the relay server/proxy
|
|
// and use the same logic as above to decide.
|
|
func isFdConsumingAddr(addr ma.Multiaddr) bool {
|
|
first, _, err := ma.SplitFunc(addr, func(c ma.Component) bool {
|
|
return c.Protocol().Code == ma.P_CIRCUIT
|
|
})
|
|
|
|
// for safety
|
|
if err == nil && first == nil {
|
|
return true
|
|
}
|
|
|
|
_, err1 := first.ValueForProtocol(ma.P_TCP)
|
|
_, err2 := first.ValueForProtocol(ma.P_UNIX)
|
|
return err1 == nil || err2 == nil
|
|
}
|
|
|
|
func isRelayAddr(addr ma.Multiaddr) bool {
|
|
_, err := addr.ValueForProtocol(ma.P_CIRCUIT)
|
|
return err == nil
|
|
}
|
|
|
|
// filterLowPriorityAddresses removes addresses inplace for which we have a better alternative
|
|
// 1. If a /quic-v1 address is present, filter out /quic and /webtransport address on the same 2-tuple:
|
|
// QUIC v1 is preferred over the deprecated QUIC draft-29, and given the choice, we prefer using
|
|
// raw QUIC over using WebTransport.
|
|
// 2. If a /tcp address is present, filter out /ws or /wss addresses on the same 2-tuple:
|
|
// We prefer using raw TCP over using WebSocket.
|
|
func filterLowPriorityAddresses(addrs []ma.Multiaddr) []ma.Multiaddr {
|
|
// make a map of QUIC v1 and TCP AddrPorts.
|
|
quicV1Addr := make(map[netip.AddrPort]struct{})
|
|
tcpAddr := make(map[netip.AddrPort]struct{})
|
|
for _, a := range addrs {
|
|
switch {
|
|
case isProtocolAddr(a, ma.P_WEBTRANSPORT):
|
|
case isProtocolAddr(a, ma.P_QUIC_V1):
|
|
ap, err := addrPort(a, ma.P_UDP)
|
|
if err != nil {
|
|
continue
|
|
}
|
|
quicV1Addr[ap] = struct{}{}
|
|
case isProtocolAddr(a, ma.P_WS) || isProtocolAddr(a, ma.P_WSS):
|
|
case isProtocolAddr(a, ma.P_TCP):
|
|
ap, err := addrPort(a, ma.P_TCP)
|
|
if err != nil {
|
|
continue
|
|
}
|
|
tcpAddr[ap] = struct{}{}
|
|
}
|
|
}
|
|
|
|
i := 0
|
|
for _, a := range addrs {
|
|
switch {
|
|
case isProtocolAddr(a, ma.P_WEBTRANSPORT) || isProtocolAddr(a, ma.P_QUIC):
|
|
ap, err := addrPort(a, ma.P_UDP)
|
|
if err != nil {
|
|
break
|
|
}
|
|
if _, ok := quicV1Addr[ap]; ok {
|
|
continue
|
|
}
|
|
case isProtocolAddr(a, ma.P_WS) || isProtocolAddr(a, ma.P_WSS):
|
|
ap, err := addrPort(a, ma.P_TCP)
|
|
if err != nil {
|
|
break
|
|
}
|
|
if _, ok := tcpAddr[ap]; ok {
|
|
continue
|
|
}
|
|
}
|
|
addrs[i] = a
|
|
i++
|
|
}
|
|
return addrs[:i]
|
|
}
|
|
|
|
// addrPort returns the ip and port for a. p should be either ma.P_TCP or ma.P_UDP.
|
|
// a must be an (ip, TCP) or (ip, udp) address.
|
|
func addrPort(a ma.Multiaddr, p int) (netip.AddrPort, error) {
|
|
ip, err := manet.ToIP(a)
|
|
if err != nil {
|
|
return netip.AddrPort{}, err
|
|
}
|
|
port, err := a.ValueForProtocol(p)
|
|
if err != nil {
|
|
return netip.AddrPort{}, err
|
|
}
|
|
pi, err := strconv.Atoi(port)
|
|
if err != nil {
|
|
return netip.AddrPort{}, err
|
|
}
|
|
addr, ok := netip.AddrFromSlice(ip)
|
|
if !ok {
|
|
return netip.AddrPort{}, fmt.Errorf("failed to parse IP %s", ip)
|
|
}
|
|
return netip.AddrPortFrom(addr, uint16(pi)), nil
|
|
}
|