package swarm import ( "context" "sync" "github.com/libp2p/go-libp2p/core/event" "github.com/libp2p/go-libp2p/core/network" "github.com/libp2p/go-libp2p/core/peer" ) // connectednessEventEmitter emits PeerConnectednessChanged events. // We ensure that for any peer we connected to we always sent atleast 1 NotConnected Event after // the peer disconnects. This is because peers can observe a connection before they are notified // of the connection by a peer connectedness changed event. type connectednessEventEmitter struct { mx sync.RWMutex // newConns is the channel that holds the peerIDs we recently connected to newConns chan peer.ID removeConnsMx sync.Mutex // removeConns is a slice of peerIDs we have recently closed connections to removeConns []peer.ID // lastEvent is the last connectedness event sent for a particular peer. lastEvent map[peer.ID]network.Connectedness // connectedness is the function that gives the peers current connectedness state connectedness func(peer.ID) network.Connectedness // emitter is the PeerConnectednessChanged event emitter emitter event.Emitter wg sync.WaitGroup removeConnNotif chan struct{} ctx context.Context cancel context.CancelFunc } func newConnectednessEventEmitter(connectedness func(peer.ID) network.Connectedness, emitter event.Emitter) *connectednessEventEmitter { ctx, cancel := context.WithCancel(context.Background()) c := &connectednessEventEmitter{ newConns: make(chan peer.ID, 32), lastEvent: make(map[peer.ID]network.Connectedness), removeConnNotif: make(chan struct{}, 1), connectedness: connectedness, emitter: emitter, ctx: ctx, cancel: cancel, } c.wg.Add(1) go c.runEmitter() return c } func (c *connectednessEventEmitter) AddConn(p peer.ID) { c.mx.RLock() if c.ctx.Err() != nil { c.mx.RUnlock() return } c.newConns <- p c.mx.RUnlock() } func (c *connectednessEventEmitter) RemoveConn(p peer.ID) { c.mx.RLock() if c.ctx.Err() != nil { c.mx.RUnlock() return } c.removeConnsMx.Lock() // This queue is roughly bounded by the total number of added connections we // have. If consumers of connectedness events are slow, we apply // backpressure to AddConn operations. // // We purposefully don't block/backpressure here to avoid deadlocks, since it's // reasonable for a consumer of the event to want to remove a connection. c.removeConns = append(c.removeConns, p) c.removeConnsMx.Unlock() select { case c.removeConnNotif <- struct{}{}: default: } c.mx.RUnlock() } func (c *connectednessEventEmitter) Close() { c.cancel() c.wg.Wait() } func (c *connectednessEventEmitter) runEmitter() { for { select { case p := <-c.newConns: c.notifyPeer(p, true) case <-c.removeConnNotif: c.sendConnRemovedNotifications() case <-c.ctx.Done(): c.mx.Lock() // Wait for all pending AddConn & RemoveConn operations to complete for { select { case p := <-c.newConns: c.notifyPeer(p, true) case <-c.removeConnNotif: c.sendConnRemovedNotifications() default: c.mx.Unlock() c.wg.Done() return } } } } } // notifyPeer sends the peer connectedness event using the emitter. // Use forceNotConnectedEvent = true to send a NotConnected event even if // no Connected event was sent for this peer. // In case a peer is disconnected before we sent the Connected event, we still // send the Disconnected event because a connection to the peer can be observed // in such cases. func (c *connectednessEventEmitter) notifyPeer(p peer.ID, forceNotConnectedEvent bool) { oldState := c.lastEvent[p] c.lastEvent[p] = c.connectedness(p) if c.lastEvent[p] == network.NotConnected { delete(c.lastEvent, p) } if (forceNotConnectedEvent && c.lastEvent[p] == network.NotConnected) || c.lastEvent[p] != oldState { c.emitter.Emit(event.EvtPeerConnectednessChanged{ Peer: p, Connectedness: c.lastEvent[p], }) } } func (c *connectednessEventEmitter) sendConnRemovedNotifications() { c.removeConnsMx.Lock() removeConns := c.removeConns c.removeConns = nil c.removeConnsMx.Unlock() for _, p := range removeConns { c.notifyPeer(p, false) } }