bitswap.go 10.4 KB
Newer Older
Brian Tiger Chow's avatar
Brian Tiger Chow committed
1 2
// package bitswap implements the IPFS Exchange interface with the BitSwap
// bilateral exchange protocol.
3 4 5
package bitswap

import (
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
6
	"errors"
7
	"math"
8
	"sync"
Jeromy's avatar
Jeromy committed
9 10
	"time"

11 12
	blocks "github.com/ipfs/go-ipfs/blocks"
	blockstore "github.com/ipfs/go-ipfs/blocks/blockstore"
13
	key "github.com/ipfs/go-ipfs/blocks/key"
14 15 16 17 18 19
	exchange "github.com/ipfs/go-ipfs/exchange"
	decision "github.com/ipfs/go-ipfs/exchange/bitswap/decision"
	bsmsg "github.com/ipfs/go-ipfs/exchange/bitswap/message"
	bsnet "github.com/ipfs/go-ipfs/exchange/bitswap/network"
	notifications "github.com/ipfs/go-ipfs/exchange/bitswap/notifications"
	wantlist "github.com/ipfs/go-ipfs/exchange/bitswap/wantlist"
Jeromy's avatar
Jeromy committed
20
	flags "github.com/ipfs/go-ipfs/flags"
21
	"github.com/ipfs/go-ipfs/thirdparty/delay"
22 23
	process "gx/ipfs/QmQopLATEYMNg7dVqZRNDfeE2S1yKy8zrRh5xnYiuqeZBn/goprocess"
	procctx "gx/ipfs/QmQopLATEYMNg7dVqZRNDfeE2S1yKy8zrRh5xnYiuqeZBn/goprocess/context"
24
	peer "gx/ipfs/QmZwZjMVGss5rqYsJVGy18gNbkTJffFyq2x1uJ4e4p3ZAt/go-libp2p-peer"
Jeromy's avatar
Jeromy committed
25
	context "gx/ipfs/QmZy2y8t9zQH2a1b8q2ZSLKp17ATuJoCNxxyMFG5qFExpt/go-net/context"
Jeromy's avatar
Jeromy committed
26
	logging "gx/ipfs/Qmazh5oNUVsDZTs2g59rq8aYQqwpss8tcUWQzor5sCCEuH/go-log"
27 28
)

Jeromy's avatar
Jeromy committed
29
var log = logging.Logger("bitswap")
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
30

Brian Tiger Chow's avatar
Brian Tiger Chow committed
31
const (
Brian Tiger Chow's avatar
Brian Tiger Chow committed
32 33 34
	// maxProvidersPerRequest specifies the maximum number of providers desired
	// from the network. This value is specified because the network streams
	// results.
Brian Tiger Chow's avatar
Brian Tiger Chow committed
35 36 37 38
	// TODO: if a 'non-nice' strategy is implemented, consider increasing this value
	maxProvidersPerRequest = 3
	providerRequestTimeout = time.Second * 10
	hasBlockTimeout        = time.Second * 15
39
	provideTimeout         = time.Second * 15
Brian Tiger Chow's avatar
Brian Tiger Chow committed
40
	sizeBatchRequestChan   = 32
41 42
	// kMaxPriority is the max priority as defined by the bitswap protocol
	kMaxPriority = math.MaxInt32
Jeromy's avatar
Jeromy committed
43
)
44

Jeromy's avatar
Jeromy committed
45
var (
46 47 48
	HasBlockBufferSize    = 256
	provideKeysBufferSize = 2048
	provideWorkerMax      = 512
Brian Tiger Chow's avatar
Brian Tiger Chow committed
49
)
Jeromy's avatar
Jeromy committed
50

Jeromy's avatar
Jeromy committed
51 52 53 54 55 56 57 58
func init() {
	if flags.LowMemMode {
		HasBlockBufferSize = 64
		provideKeysBufferSize = 512
		provideWorkerMax = 16
	}
}

59
var rebroadcastDelay = delay.Fixed(time.Second * 10)
60

Brian Tiger Chow's avatar
Brian Tiger Chow committed
61 62 63 64
// New initializes a BitSwap instance that communicates over the provided
// BitSwapNetwork. This function registers the returned instance as the network
// delegate.
// Runs until context is cancelled.
65
func New(parent context.Context, p peer.ID, network bsnet.BitSwapNetwork,
66
	bstore blockstore.Blockstore, nice bool) exchange.Interface {
67

68 69 70 71 72 73 74
	// important to use provided parent context (since it may include important
	// loggable data). It's probably not a good idea to allow bitswap to be
	// coupled to the concerns of the IPFS daemon in this way.
	//
	// FIXME(btc) Now that bitswap manages itself using a process, it probably
	// shouldn't accept a context anymore. Clients should probably use Close()
	// exclusively. We should probably find another way to share logging data
75 76
	ctx, cancelFunc := context.WithCancel(parent)

77
	notif := notifications.New()
78 79 80 81 82
	px := process.WithTeardown(func() error {
		notif.Shutdown()
		return nil
	})

83
	bs := &Bitswap{
Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
84
		self:          p,
85
		blockstore:    bstore,
86
		notifications: notif,
87
		engine:        decision.NewEngine(ctx, bstore), // TODO close the engine with Close() method
88
		network:       network,
89
		findKeys:      make(chan *wantlist.Entry, sizeBatchRequestChan),
90
		process:       px,
Jeromy's avatar
Jeromy committed
91
		newBlocks:     make(chan *blocks.Block, HasBlockBufferSize),
92
		provideKeys:   make(chan key.Key, provideKeysBufferSize),
93
		wm:            NewWantManager(ctx, network),
94
	}
95
	go bs.wm.Run()
Brian Tiger Chow's avatar
Brian Tiger Chow committed
96
	network.SetDelegate(bs)
97

98 99
	// Start up bitswaps async worker routines
	bs.startWorkers(px, ctx)
100 101 102 103 104 105 106 107 108

	// bind the context and process.
	// do it over here to avoid closing before all setup is done.
	go func() {
		<-px.Closing() // process closes first
		cancelFunc()
	}()
	procctx.CloseAfterContext(px, ctx) // parent cancelled first

109 110 111
	return bs
}

112 113
// Bitswap instances implement the bitswap protocol.
type Bitswap struct {
114

Juan Batiz-Benet's avatar
Juan Batiz-Benet committed
115 116 117
	// the ID of the peer to act on behalf of
	self peer.ID

118 119
	// network delivers messages on behalf of the session
	network bsnet.BitSwapNetwork
120

121 122
	// the peermanager manages sending messages to peers in a way that
	// wont block bitswap operation
123
	wm *WantManager
124

125 126 127 128 129 130
	// blockstore is the local database
	// NB: ensure threadsafety
	blockstore blockstore.Blockstore

	notifications notifications.PubSub

Jeromy's avatar
Jeromy committed
131
	// send keys to a worker to find and connect to providers for them
132
	findKeys chan *wantlist.Entry
Jeromy's avatar
Jeromy committed
133

134
	engine *decision.Engine
135

136
	process process.Process
137 138

	newBlocks chan *blocks.Block
139

140
	provideKeys chan key.Key
141

Jeromy's avatar
Jeromy committed
142
	counterLk      sync.Mutex
143 144
	blocksRecvd    int
	dupBlocksRecvd int
145
	dupDataRecvd   uint64
146 147
}

148
type blockRequest struct {
149 150
	key key.Key
	ctx context.Context
151 152
}

153
// GetBlock attempts to retrieve a particular block from peers within the
154
// deadline enforced by the context.
155
func (bs *Bitswap) GetBlock(parent context.Context, k key.Key) (*blocks.Block, error) {
156

157 158 159 160
	// Any async work initiated by this function must end when this function
	// returns. To ensure this, derive a new context. Note that it is okay to
	// listen on parent in this scope, but NOT okay to pass |parent| to
	// functions called by this one. Otherwise those functions won't return
161 162
	// when this context's cancel func is executed. This is difficult to
	// enforce. May this comment keep you safe.
163

164
	ctx, cancelFunc := context.WithCancel(parent)
165

Jeromy's avatar
Jeromy committed
166
	ctx = logging.ContextWithLoggable(ctx, logging.Uuid("GetBlockRequest"))
167 168
	log.Event(ctx, "Bitswap.GetBlockRequest.Start", &k)
	defer log.Event(ctx, "Bitswap.GetBlockRequest.End", &k)
169 170 171 172

	defer func() {
		cancelFunc()
	}()
173

174
	promise, err := bs.GetBlocks(ctx, []key.Key{k})
175 176
	if err != nil {
		return nil, err
Jeromy's avatar
Jeromy committed
177
	}
178 179

	select {
180 181 182 183 184 185 186 187 188
	case block, ok := <-promise:
		if !ok {
			select {
			case <-ctx.Done():
				return nil, ctx.Err()
			default:
				return nil, errors.New("promise channel was closed")
			}
		}
Jeromy's avatar
Jeromy committed
189
		return block, nil
190 191
	case <-parent.Done():
		return nil, parent.Err()
192 193 194
	}
}

195 196
func (bs *Bitswap) WantlistForPeer(p peer.ID) []key.Key {
	var out []key.Key
197 198 199 200 201 202
	for _, e := range bs.engine.WantlistForPeer(p) {
		out = append(out, e.Key)
	}
	return out
}

203 204 205 206 207 208 209
// GetBlocks returns a channel where the caller may receive blocks that
// correspond to the provided |keys|. Returns an error if BitSwap is unable to
// begin this request within the deadline enforced by the context.
//
// NB: Your request remains open until the context expires. To conserve
// resources, provide a context with a reasonably short deadline (ie. not one
// that lasts throughout the lifetime of the server)
210
func (bs *Bitswap) GetBlocks(ctx context.Context, keys []key.Key) (<-chan *blocks.Block, error) {
211 212 213 214 215 216
	if len(keys) == 0 {
		out := make(chan *blocks.Block)
		close(out)
		return out, nil
	}

217 218 219 220 221
	select {
	case <-bs.process.Closing():
		return nil, errors.New("bitswap is closed")
	default:
	}
222
	promise := bs.notifications.Subscribe(ctx, keys...)
223

224 225 226 227
	for _, k := range keys {
		log.Event(ctx, "Bitswap.GetBlockRequest.Start", &k)
	}

228
	bs.wm.WantBlocks(ctx, keys)
229

230 231 232 233 234 235
	// NB: Optimization. Assumes that providers of key[0] are likely to
	// be able to provide for all keys. This currently holds true in most
	// every situation. Later, this assumption may not hold as true.
	req := &wantlist.Entry{
		Key: keys[0],
		Ctx: ctx,
236
	}
237
	select {
Jeromy's avatar
Jeromy committed
238
	case bs.findKeys <- req:
239
		return promise, nil
240 241 242
	case <-ctx.Done():
		return nil, ctx.Err()
	}
Jeromy's avatar
Jeromy committed
243 244
}

245 246 247 248 249
// CancelWant removes a given key from the wantlist
func (bs *Bitswap) CancelWants(ks []key.Key) {
	bs.wm.CancelWants(ks)
}

250 251
// HasBlock announces the existance of a block to this bitswap service. The
// service will potentially notify its peers.
252
func (bs *Bitswap) HasBlock(blk *blocks.Block) error {
253 254 255 256 257
	select {
	case <-bs.process.Closing():
		return errors.New("bitswap is closed")
	default:
	}
258

259 260 261
	err := bs.tryPutBlock(blk, 4) // attempt to store block up to four times
	if err != nil {
		log.Errorf("Error writing block to datastore: %s", err)
262 263
		return err
	}
264

Jeromy's avatar
Jeromy committed
265 266
	bs.notifications.Publish(blk)

267 268
	select {
	case bs.newBlocks <- blk:
269
		// send block off to be reprovided
270 271
	case <-bs.process.Closing():
		return bs.process.Close()
272 273
	}
	return nil
274 275
}

276 277 278 279 280 281 282 283 284 285 286 287
func (bs *Bitswap) tryPutBlock(blk *blocks.Block, attempts int) error {
	var err error
	for i := 0; i < attempts; i++ {
		if err = bs.blockstore.Put(blk); err == nil {
			break
		}

		time.Sleep(time.Millisecond * time.Duration(400*(i+1)))
	}
	return err
}

288
func (bs *Bitswap) ReceiveMessage(ctx context.Context, p peer.ID, incoming bsmsg.BitSwapMessage) {
Jeromy's avatar
Jeromy committed
289 290
	// This call records changes to wantlists, blocks received,
	// and number of bytes transfered.
291
	bs.engine.MessageReceived(p, incoming)
Jeromy's avatar
Jeromy committed
292 293
	// TODO: this is bad, and could be easily abused.
	// Should only track *useful* messages in ledger
294

295 296 297
	iblocks := incoming.Blocks()

	if len(iblocks) == 0 {
298 299 300 301
		return
	}

	// quickly send out cancels, reduces chances of duplicate block receives
302
	var keys []key.Key
303 304
	for _, block := range iblocks {
		if _, found := bs.wm.wl.Contains(block.Key()); !found {
305
			log.Infof("received un-asked-for %s from %s", block, p)
306 307
			continue
		}
Jeromy's avatar
Jeromy committed
308 309 310
		keys = append(keys, block.Key())
	}
	bs.wm.CancelWants(keys)
311

Jeromy's avatar
Jeromy committed
312 313 314 315 316
	wg := sync.WaitGroup{}
	for _, block := range iblocks {
		wg.Add(1)
		go func(b *blocks.Block) {
			defer wg.Done()
317

318
			if err := bs.updateReceiveCounters(b); err != nil {
319
				return // ignore error, is either logged previously, or ErrAlreadyHaveBlock
Jeromy's avatar
Jeromy committed
320
			}
321

322 323 324
			k := b.Key()
			log.Event(ctx, "Bitswap.GetBlockRequest.End", &k)

325
			log.Debugf("got block %s from %s", b, p)
326
			if err := bs.HasBlock(b); err != nil {
Jeromy's avatar
Jeromy committed
327 328 329
				log.Warningf("ReceiveMessage HasBlock error: %s", err)
			}
		}(block)
330
	}
Jeromy's avatar
Jeromy committed
331
	wg.Wait()
332 333
}

334 335
var ErrAlreadyHaveBlock = errors.New("already have block")

336
func (bs *Bitswap) updateReceiveCounters(b *blocks.Block) error {
337 338 339
	bs.counterLk.Lock()
	defer bs.counterLk.Unlock()
	bs.blocksRecvd++
340
	has, err := bs.blockstore.Has(b.Key())
341 342 343 344 345 346
	if err != nil {
		log.Infof("blockstore.Has error: %s", err)
		return err
	}
	if err == nil && has {
		bs.dupBlocksRecvd++
347
		bs.dupDataRecvd += uint64(len(b.Data))
348 349 350 351 352 353 354 355
	}

	if has {
		return ErrAlreadyHaveBlock
	}
	return nil
}

356
// Connected/Disconnected warns bitswap about peer connections
357
func (bs *Bitswap) PeerConnected(p peer.ID) {
358
	bs.wm.Connected(p)
359 360 361
}

// Connected/Disconnected warns bitswap about peer connections
362
func (bs *Bitswap) PeerDisconnected(p peer.ID) {
363
	bs.wm.Disconnected(p)
364
	bs.engine.PeerDisconnected(p)
365 366
}

367
func (bs *Bitswap) ReceiveError(err error) {
368
	log.Infof("Bitswap ReceiveError: %s", err)
369 370
	// TODO log the network error
	// TODO bubble the network error up to the parent context/error logger
371 372
}

373
func (bs *Bitswap) Close() error {
374
	return bs.process.Close()
375
}
376

377 378
func (bs *Bitswap) GetWantlist() []key.Key {
	var out []key.Key
379
	for _, e := range bs.wm.wl.Entries() {
380 381 382 383
		out = append(out, e.Key)
	}
	return out
}