GitLab

fix: return wants from engine.WantlistForPeer()

chore(deps): bump github.com/libp2p/go-libp2p from 0.6.1 to 0.8.3

Bumps [github.com/libp2p/go-libp2p](https://github.com/libp2p/go-libp2p) from 0.6.1 to 0.8.3.
- [Release notes](https://github.com/libp2p/go-libp2p/releases)
- [Changelog](https://github.com/libp2p/go-libp2p/blob/master/NEWS.md)
- [Commits](https://github.com/libp2p/go-libp2p/compare/v0.6.1...v0.8.3)
Signed-off-by: dependabot-preview[bot] <support@dependabot.com>

calculate message latency

chore(deps): bump github.com/ipfs/go-log from 1.0.2 to 1.0.4

* fix: use one less go-routine per session

* fix: send cancel when GetBlocks() is cancelled (#383)

* fix: send cancel when GetBlocks() is cancelled

* fix: in SessionManager shutdown nil out sessions

* fix: sessionWantSender perf

* make sessionWantSender.SignalAvailability() non-blocking

* Refactor SessionInterestManager (#384)

* refactor: customize SessionInterestManager

* refactor: SessionInterestManager perf

Bumps [github.com/ipfs/go-log](https://github.com/ipfs/go-log) from 1.0.2 to 1.0.4.
- [Release notes](https://github.com/ipfs/go-log/releases)
- [Commits](https://github.com/ipfs/go-log/compare/v1.0.2...v1.0.4)
Signed-off-by: dependabot-preview[bot] <support@dependabot.com>

refactor: remove WantManager

Send CANCELs when session context is cancelled

refactor: remove unused code

Change timing for DONT_HAVE timeouts to be more conservative

fix: avoid calling ctx.SetDeadline() every time we send a message

* feat: small optimizations

* feat: move broadcast wantlist into the peermanager

This deduplicates some state and allows us to do less book-keeping for broadcast
wants. We should probably rename the PeerManager to the WantManager and rename the
WantManager to something else.

* fix: lint warnings

* refactor: add reverse index to peerWantManager to speed up cancels

* refactor: in peerWantManager use ForEach instead of allocating lists

* fix: minimize time holding wantlist lock

Instead of holding the lock the entire time we prepare a message, hold the lock
while we retrieve the wantlist entries, process the entries without the lock,
retake the lock, then mark entries as sent.

This means:

1. We never sort entries while holding the lock.
2. We allocate exactly three times while holding the lock (once per entry list).

* fix: address code review

feat: optimize entry sorting in MessageQueue

Move connection management into networking layer

There's no reason to launch this async.