2018-06-20 14:06:27 +02:00
|
|
|
// Copyright 2018 The go-ethereum Authors
|
|
|
|
// This file is part of the go-ethereum library.
|
|
|
|
//
|
|
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
|
|
// (at your option) any later version.
|
|
|
|
//
|
|
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU Lesser General Public License for more details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
package stream
|
|
|
|
|
|
|
|
import (
|
2018-07-13 17:40:28 +02:00
|
|
|
"context"
|
2018-06-20 14:06:27 +02:00
|
|
|
"errors"
|
2018-09-13 11:42:19 +02:00
|
|
|
"fmt"
|
2019-04-11 10:26:52 +02:00
|
|
|
"time"
|
2018-09-13 11:42:19 +02:00
|
|
|
|
2018-06-20 14:06:27 +02:00
|
|
|
"github.com/ethereum/go-ethereum/metrics"
|
all: new p2p node representation (#17643)
Package p2p/enode provides a generalized representation of p2p nodes
which can contain arbitrary information in key/value pairs. It is also
the new home for the node database. The "v4" identity scheme is also
moved here from p2p/enr to remove the dependency on Ethereum crypto from
that package.
Record signature handling is changed significantly. The identity scheme
registry is removed and acceptable schemes must be passed to any method
that needs identity. This means records must now be validated explicitly
after decoding.
The enode API is designed to make signature handling easy and safe: most
APIs around the codebase work with enode.Node, which is a wrapper around
a valid record. Going from enr.Record to enode.Node requires a valid
signature.
* p2p/discover: port to p2p/enode
This ports the discovery code to the new node representation in
p2p/enode. The wire protocol is unchanged, this can be considered a
refactoring change. The Kademlia table can now deal with nodes using an
arbitrary identity scheme. This requires a few incompatible API changes:
- Table.Lookup is not available anymore. It used to take a public key
as argument because v4 protocol requires one. Its replacement is
LookupRandom.
- Table.Resolve takes *enode.Node instead of NodeID. This is also for
v4 protocol compatibility because nodes cannot be looked up by ID
alone.
- Types Node and NodeID are gone. Further commits in the series will be
fixes all over the the codebase to deal with those removals.
* p2p: port to p2p/enode and discovery changes
This adapts package p2p to the changes in p2p/discover. All uses of
discover.Node and discover.NodeID are replaced by their equivalents from
p2p/enode.
New API is added to retrieve the enode.Node instance of a peer. The
behavior of Server.Self with discovery disabled is improved. It now
tries much harder to report a working IP address, falling back to
127.0.0.1 if no suitable address can be determined through other means.
These changes were needed for tests of other packages later in the
series.
* p2p/simulations, p2p/testing: port to p2p/enode
No surprises here, mostly replacements of discover.Node, discover.NodeID
with their new equivalents. The 'interesting' API changes are:
- testing.ProtocolSession tracks complete nodes, not just their IDs.
- adapters.NodeConfig has a new method to create a complete node.
These changes were needed to make swarm tests work.
Note that the NodeID change makes the code incompatible with old
simulation snapshots.
* whisper/whisperv5, whisper/whisperv6: port to p2p/enode
This port was easy because whisper uses []byte for node IDs and
URL strings in the API.
* eth: port to p2p/enode
Again, easy to port because eth uses strings for node IDs and doesn't
care about node information in any way.
* les: port to p2p/enode
Apart from replacing discover.NodeID with enode.ID, most changes are in
the server pool code. It now deals with complete nodes instead
of (Pubkey, IP, Port) triples. The database format is unchanged for now,
but we should probably change it to use the node database later.
* node: port to p2p/enode
This change simply replaces discover.Node and discover.NodeID with their
new equivalents.
* swarm/network: port to p2p/enode
Swarm has its own node address representation, BzzAddr, containing both
an overlay address (the hash of a secp256k1 public key) and an underlay
address (enode:// URL).
There are no changes to the BzzAddr format in this commit, but certain
operations such as creating a BzzAddr from a node ID are now impossible
because node IDs aren't public keys anymore.
Most swarm-related changes in the series remove uses of
NewAddrFromNodeID, replacing it with NewAddr which takes a complete node
as argument. ToOverlayAddr is removed because we can just use the node
ID directly.
2018-09-25 00:59:00 +02:00
|
|
|
"github.com/ethereum/go-ethereum/p2p/enode"
|
2019-06-03 12:28:18 +02:00
|
|
|
"github.com/ethersphere/swarm/chunk"
|
|
|
|
"github.com/ethersphere/swarm/log"
|
|
|
|
"github.com/ethersphere/swarm/network"
|
2019-06-17 10:01:12 +02:00
|
|
|
"github.com/ethersphere/swarm/network/timeouts"
|
2019-06-03 12:28:18 +02:00
|
|
|
"github.com/ethersphere/swarm/spancontext"
|
|
|
|
"github.com/ethersphere/swarm/storage"
|
2018-07-13 17:40:28 +02:00
|
|
|
opentracing "github.com/opentracing/opentracing-go"
|
2019-03-11 11:45:34 +01:00
|
|
|
olog "github.com/opentracing/opentracing-go/log"
|
2018-06-20 14:06:27 +02:00
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
|
|
|
processReceivedChunksCount = metrics.NewRegisteredCounter("network.stream.received_chunks.count", nil)
|
|
|
|
handleRetrieveRequestMsgCount = metrics.NewRegisteredCounter("network.stream.handle_retrieve_request_msg.count", nil)
|
2018-12-04 12:29:51 -05:00
|
|
|
retrieveChunkFail = metrics.NewRegisteredCounter("network.stream.retrieve_chunks_fail.count", nil)
|
2018-06-20 14:06:27 +02:00
|
|
|
|
2019-04-11 10:26:52 +02:00
|
|
|
lastReceivedChunksMsg = metrics.GetOrRegisterGauge("network.stream.received_chunks", nil)
|
2018-06-20 14:06:27 +02:00
|
|
|
)
|
|
|
|
|
|
|
|
type Delivery struct {
|
2019-04-11 10:26:52 +02:00
|
|
|
netStore *storage.NetStore
|
|
|
|
kad *network.Kademlia
|
|
|
|
getPeer func(enode.ID) *Peer
|
|
|
|
quit chan struct{}
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
|
|
|
|
2019-04-11 10:26:52 +02:00
|
|
|
func NewDelivery(kad *network.Kademlia, netStore *storage.NetStore) *Delivery {
|
2018-09-13 11:42:19 +02:00
|
|
|
return &Delivery{
|
2019-04-11 10:26:52 +02:00
|
|
|
netStore: netStore,
|
|
|
|
kad: kad,
|
|
|
|
quit: make(chan struct{}),
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// RetrieveRequestMsg is the protocol msg for chunk retrieve requests
|
|
|
|
type RetrieveRequestMsg struct {
|
2019-06-17 10:01:12 +02:00
|
|
|
Addr storage.Address
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
|
|
|
|
2018-07-13 17:40:28 +02:00
|
|
|
func (d *Delivery) handleRetrieveRequestMsg(ctx context.Context, sp *Peer, req *RetrieveRequestMsg) error {
|
2019-06-17 10:01:12 +02:00
|
|
|
log.Trace("handle retrieve request", "peer", sp.ID(), "hash", req.Addr)
|
2018-06-20 14:06:27 +02:00
|
|
|
handleRetrieveRequestMsgCount.Inc(1)
|
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
ctx, osp := spancontext.StartSpan(
|
2018-07-13 17:40:28 +02:00
|
|
|
ctx,
|
2019-06-17 10:01:12 +02:00
|
|
|
"handle.retrieve.request")
|
2018-07-13 17:40:28 +02:00
|
|
|
|
2019-03-11 11:45:34 +01:00
|
|
|
osp.LogFields(olog.String("ref", req.Addr.String()))
|
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
defer osp.Finish()
|
2018-09-13 11:42:19 +02:00
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
ctx, cancel := context.WithTimeout(ctx, timeouts.FetcherGlobalTimeout)
|
|
|
|
defer cancel()
|
2018-09-13 11:42:19 +02:00
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
r := &storage.Request{
|
|
|
|
Addr: req.Addr,
|
|
|
|
Origin: sp.ID(),
|
|
|
|
}
|
|
|
|
chunk, err := d.netStore.Get(ctx, chunk.ModeGetRequest, r)
|
|
|
|
if err != nil {
|
|
|
|
retrieveChunkFail.Inc(1)
|
|
|
|
log.Debug("ChunkStore.Get can not retrieve chunk", "peer", sp.ID().String(), "addr", req.Addr, "err", err)
|
|
|
|
return nil
|
|
|
|
}
|
2019-03-11 11:45:34 +01:00
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
log.Trace("retrieve request, delivery", "ref", req.Addr, "peer", sp.ID())
|
|
|
|
syncing := false
|
|
|
|
err = sp.Deliver(ctx, chunk, 0, syncing)
|
|
|
|
if err != nil {
|
|
|
|
log.Error("sp.Deliver errored", "err", err)
|
|
|
|
}
|
|
|
|
osp.LogFields(olog.Bool("delivered", true))
|
2018-09-13 11:42:19 +02:00
|
|
|
|
2018-06-20 14:06:27 +02:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2018-10-21 02:30:41 -05:00
|
|
|
//Chunk delivery always uses the same message type....
|
2018-06-20 14:06:27 +02:00
|
|
|
type ChunkDeliveryMsg struct {
|
|
|
|
Addr storage.Address
|
|
|
|
SData []byte // the stored chunk Data (incl size)
|
|
|
|
peer *Peer // set in handleChunkDeliveryMsg
|
|
|
|
}
|
|
|
|
|
2018-10-21 02:30:41 -05:00
|
|
|
//...but swap accounting needs to disambiguate if it is a delivery for syncing or for retrieval
|
|
|
|
//as it decides based on message type if it needs to account for this message or not
|
|
|
|
|
|
|
|
//defines a chunk delivery for retrieval (with accounting)
|
|
|
|
type ChunkDeliveryMsgRetrieval ChunkDeliveryMsg
|
|
|
|
|
|
|
|
//defines a chunk delivery for syncing (without accounting)
|
|
|
|
type ChunkDeliveryMsgSyncing ChunkDeliveryMsg
|
|
|
|
|
2019-02-20 14:50:37 +01:00
|
|
|
// chunk delivery msg is response to retrieverequest msg
|
2019-04-10 16:50:58 +02:00
|
|
|
func (d *Delivery) handleChunkDeliveryMsg(ctx context.Context, sp *Peer, req interface{}) error {
|
2019-03-20 21:30:34 +01:00
|
|
|
var osp opentracing.Span
|
|
|
|
ctx, osp = spancontext.StartSpan(
|
|
|
|
ctx,
|
|
|
|
"handle.chunk.delivery")
|
2018-07-13 17:40:28 +02:00
|
|
|
|
2018-09-13 11:42:19 +02:00
|
|
|
processReceivedChunksCount.Inc(1)
|
2018-06-20 14:06:27 +02:00
|
|
|
|
2019-04-11 10:26:52 +02:00
|
|
|
// record the last time we received a chunk delivery message
|
|
|
|
lastReceivedChunksMsg.Update(time.Now().UnixNano())
|
|
|
|
|
2019-04-10 16:50:58 +02:00
|
|
|
var msg *ChunkDeliveryMsg
|
|
|
|
var mode chunk.ModePut
|
|
|
|
switch r := req.(type) {
|
|
|
|
case *ChunkDeliveryMsgRetrieval:
|
|
|
|
msg = (*ChunkDeliveryMsg)(r)
|
2019-04-30 09:28:46 +02:00
|
|
|
peerPO := chunk.Proximity(sp.BzzAddr.Over(), msg.Addr)
|
2019-04-10 16:50:58 +02:00
|
|
|
po := chunk.Proximity(d.kad.BaseAddr(), msg.Addr)
|
|
|
|
depth := d.kad.NeighbourhoodDepth()
|
|
|
|
// chunks within the area of responsibility should always sync
|
|
|
|
// https://github.com/ethersphere/go-ethereum/pull/1282#discussion_r269406125
|
|
|
|
if po >= depth || peerPO < po {
|
|
|
|
mode = chunk.ModePutSync
|
|
|
|
} else {
|
|
|
|
// do not sync if peer that is sending us a chunk is closer to the chunk then we are
|
|
|
|
mode = chunk.ModePutRequest
|
|
|
|
}
|
|
|
|
case *ChunkDeliveryMsgSyncing:
|
|
|
|
msg = (*ChunkDeliveryMsg)(r)
|
|
|
|
mode = chunk.ModePutSync
|
2019-04-11 10:26:52 +02:00
|
|
|
case *ChunkDeliveryMsg:
|
|
|
|
msg = r
|
|
|
|
mode = chunk.ModePutSync
|
2019-04-10 16:50:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
log.Trace("handle.chunk.delivery", "ref", msg.Addr, "from peer", sp.ID())
|
2019-03-20 21:30:34 +01:00
|
|
|
|
2018-09-13 11:42:19 +02:00
|
|
|
go func() {
|
2019-03-20 21:30:34 +01:00
|
|
|
defer osp.Finish()
|
|
|
|
|
2019-04-10 16:50:58 +02:00
|
|
|
msg.peer = sp
|
|
|
|
log.Trace("handle.chunk.delivery", "put", msg.Addr)
|
2019-04-11 10:26:52 +02:00
|
|
|
_, err := d.netStore.Put(ctx, mode, storage.NewChunk(msg.Addr, msg.SData))
|
2018-09-13 11:42:19 +02:00
|
|
|
if err != nil {
|
2018-06-20 14:06:27 +02:00
|
|
|
if err == storage.ErrChunkInvalid {
|
2018-09-13 11:42:19 +02:00
|
|
|
// we removed this log because it spams the logs
|
|
|
|
// TODO: Enable this log line
|
2019-04-10 16:50:58 +02:00
|
|
|
// log.Warn("invalid chunk delivered", "peer", sp.ID(), "chunk", msg.Addr, )
|
2019-04-11 10:26:52 +02:00
|
|
|
msg.peer.Drop()
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
2018-09-13 11:42:19 +02:00
|
|
|
}
|
2019-04-10 16:50:58 +02:00
|
|
|
log.Trace("handle.chunk.delivery", "done put", msg.Addr, "err", err)
|
2018-09-13 11:42:19 +02:00
|
|
|
}()
|
|
|
|
return nil
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
|
|
|
|
2019-04-11 10:26:52 +02:00
|
|
|
func (d *Delivery) Close() {
|
|
|
|
close(d.quit)
|
|
|
|
}
|
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
// getOriginPo returns the originPo if the incoming Request has an Origin
|
|
|
|
// if our node is the first node that requests this chunk, then we don't have an Origin,
|
|
|
|
// and return -1
|
|
|
|
// this is used only for tracing, and can probably be refactor so that we don't have to
|
|
|
|
// iterater over Kademlia
|
|
|
|
func (d *Delivery) getOriginPo(req *storage.Request) int {
|
|
|
|
originPo := -1
|
|
|
|
|
|
|
|
d.kad.EachConn(req.Addr[:], 255, func(p *network.Peer, po int) bool {
|
|
|
|
id := p.ID()
|
|
|
|
|
|
|
|
// get po between chunk and origin
|
|
|
|
if req.Origin.String() == id.String() {
|
|
|
|
originPo = po
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
return true
|
|
|
|
})
|
|
|
|
|
|
|
|
return originPo
|
|
|
|
}
|
|
|
|
|
|
|
|
// FindPeer is returning the closest peer from Kademlia that a chunk
|
|
|
|
// request hasn't already been sent to
|
|
|
|
func (d *Delivery) FindPeer(ctx context.Context, req *storage.Request) (*Peer, error) {
|
2018-09-13 11:42:19 +02:00
|
|
|
var sp *Peer
|
2019-06-17 10:01:12 +02:00
|
|
|
var err error
|
|
|
|
|
|
|
|
osp, _ := ctx.Value("remote.fetch").(opentracing.Span)
|
|
|
|
|
|
|
|
// originPo - proximity of the node that made the request; -1 if the request originator is our node;
|
|
|
|
// myPo - this node's proximity with the requested chunk
|
|
|
|
// selectedPeerPo - kademlia suggested node's proximity with the requested chunk (computed further below)
|
|
|
|
originPo := d.getOriginPo(req)
|
|
|
|
myPo := chunk.Proximity(req.Addr, d.kad.BaseAddr())
|
|
|
|
selectedPeerPo := -1
|
|
|
|
|
|
|
|
depth := d.kad.NeighbourhoodDepth()
|
|
|
|
|
|
|
|
if osp != nil {
|
|
|
|
osp.LogFields(olog.Int("originPo", originPo))
|
|
|
|
osp.LogFields(olog.Int("depth", depth))
|
|
|
|
osp.LogFields(olog.Int("myPo", myPo))
|
|
|
|
}
|
|
|
|
|
|
|
|
// do not forward requests if origin proximity is bigger than our node's proximity
|
|
|
|
// this means that origin is closer to the chunk
|
|
|
|
if originPo > myPo {
|
|
|
|
return nil, errors.New("not forwarding request, origin node is closer to chunk than this node")
|
|
|
|
}
|
2018-07-13 17:40:28 +02:00
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
d.kad.EachConn(req.Addr[:], 255, func(p *network.Peer, po int) bool {
|
|
|
|
id := p.ID()
|
|
|
|
|
|
|
|
// skip light nodes
|
|
|
|
if p.LightNode {
|
|
|
|
return true
|
2018-09-13 11:42:19 +02:00
|
|
|
}
|
2019-06-17 10:01:12 +02:00
|
|
|
|
|
|
|
// do not send request back to peer who asked us. maybe merge with SkipPeer at some point
|
|
|
|
if req.Origin.String() == id.String() {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
// skip peers that we have already tried
|
|
|
|
if req.SkipPeer(id.String()) {
|
|
|
|
log.Trace("findpeer skip peer", "peer", id, "ref", req.Addr.String())
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
if myPo < depth { // chunk is NOT within the neighbourhood
|
|
|
|
if po <= myPo { // always choose a peer strictly closer to chunk than us
|
|
|
|
log.Trace("findpeer1a", "originpo", originPo, "mypo", myPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
|
|
|
return false
|
|
|
|
} else {
|
|
|
|
log.Trace("findpeer1b", "originpo", originPo, "mypo", myPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
2019-06-17 10:01:12 +02:00
|
|
|
} else { // chunk IS WITHIN neighbourhood
|
|
|
|
if po < depth { // do not select peer outside the neighbourhood. But allows peers further from the chunk than us
|
|
|
|
log.Trace("findpeer2a", "originpo", originPo, "mypo", myPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
|
|
|
return false
|
|
|
|
} else if po <= originPo { // avoid loop in neighbourhood, so not forward when a request comes from the neighbourhood
|
|
|
|
log.Trace("findpeer2b", "originpo", originPo, "mypo", myPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
|
|
|
return false
|
|
|
|
} else {
|
|
|
|
log.Trace("findpeer2c", "originpo", originPo, "mypo", myPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
2019-01-24 12:02:18 +01:00
|
|
|
}
|
2019-06-17 10:01:12 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// if selected peer is not in the depth (2nd condition; if depth <= po, then peer is in nearest neighbourhood)
|
|
|
|
// and they have a lower po than ours, return error
|
|
|
|
if po < myPo && depth > po {
|
|
|
|
log.Trace("findpeer4 skip peer because origin was closer", "originpo", originPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
|
|
|
|
|
|
|
err = fmt.Errorf("not asking peers further away from origin; ref=%s originpo=%v po=%v depth=%v myPo=%v", req.Addr.String(), originPo, po, depth, myPo)
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// if chunk falls in our nearest neighbourhood (1st condition), but suggested peer is not in
|
|
|
|
// the nearest neighbourhood (2nd condition), don't forward the request to suggested peer
|
|
|
|
if depth <= myPo && depth > po {
|
|
|
|
log.Trace("findpeer5 skip peer because depth", "originpo", originPo, "po", po, "depth", depth, "peer", id, "ref", req.Addr.String())
|
|
|
|
|
|
|
|
err = fmt.Errorf("not going outside of depth; ref=%s originpo=%v po=%v depth=%v myPo=%v", req.Addr.String(), originPo, po, depth, myPo)
|
2018-09-13 11:42:19 +02:00
|
|
|
return false
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
2019-06-17 10:01:12 +02:00
|
|
|
|
|
|
|
sp = d.getPeer(id)
|
|
|
|
|
|
|
|
// sp could be nil, if we encountered a peer that is not registered for delivery, i.e. doesn't support the `stream` protocol
|
|
|
|
// if sp is not nil, then we have selected the next peer and we stop iterating
|
|
|
|
// if sp is nil, we continue iterating
|
|
|
|
if sp != nil {
|
|
|
|
selectedPeerPo = po
|
|
|
|
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// continue iterating
|
|
|
|
return true
|
|
|
|
})
|
|
|
|
|
|
|
|
if osp != nil {
|
|
|
|
osp.LogFields(olog.Int("selectedPeerPo", selectedPeerPo))
|
|
|
|
}
|
|
|
|
|
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
|
|
|
if sp == nil {
|
|
|
|
return nil, errors.New("no peer found")
|
|
|
|
}
|
|
|
|
|
|
|
|
return sp, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// RequestFromPeers sends a chunk retrieve request to the next found peer
|
|
|
|
func (d *Delivery) RequestFromPeers(ctx context.Context, req *storage.Request, localID enode.ID) (*enode.ID, error) {
|
|
|
|
metrics.GetOrRegisterCounter("delivery.requestfrompeers", nil).Inc(1)
|
|
|
|
|
|
|
|
sp, err := d.FindPeer(ctx, req)
|
|
|
|
if err != nil {
|
|
|
|
log.Trace(err.Error())
|
|
|
|
return nil, err
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|
2018-09-13 11:42:19 +02:00
|
|
|
|
2019-02-20 14:50:37 +01:00
|
|
|
// setting this value in the context creates a new span that can persist across the sendpriority queue and the network roundtrip
|
|
|
|
// this span will finish only when delivery is handled (or times out)
|
2019-06-17 10:01:12 +02:00
|
|
|
r := &RetrieveRequestMsg{
|
|
|
|
Addr: req.Addr,
|
|
|
|
}
|
|
|
|
log.Trace("sending retrieve request", "ref", r.Addr, "peer", sp.ID().String(), "origin", localID)
|
|
|
|
err = sp.Send(ctx, r)
|
2018-09-13 11:42:19 +02:00
|
|
|
if err != nil {
|
2019-06-17 10:01:12 +02:00
|
|
|
log.Error(err.Error())
|
|
|
|
return nil, err
|
2018-09-13 11:42:19 +02:00
|
|
|
}
|
|
|
|
|
2019-06-17 10:01:12 +02:00
|
|
|
spID := sp.ID()
|
|
|
|
return &spID, nil
|
2018-06-20 14:06:27 +02:00
|
|
|
}
|