- 23 12月, 2014 8 次提交
-
-
- Make sure we call IdentifyConn on dialed out conns - we wait until the identify is **done** before return - on listening case, we can also wait. - tests now make sure dial does wait. - tests now make sure we can wait on listening case.
由 Juan Batiz-Benet 提交于 -
由 Juan Batiz-Benet 提交于
-
由 Juan Batiz-Benet 提交于
-
由 Brian Tiger Chow 提交于
-
this is a major refactor of the entire codebase it changes the monolithic peer.Peer into using a peer.ID and a peer.Peerstore. Other changes: - removed handshake3. - testutil vastly simplified peer - secio bugfix + debugging logs - testutil: RandKeyPair - backpressure bugfix: w.o.w. - peer: added hex enc/dec - peer: added a PeerInfo struct PeerInfo is a small struct used to pass around a peer with a set of addresses and keys. This is not meant to be a complete view of the system, but rather to model updates to the peerstore. It is used by things like the routing system. - updated peer/queue + peerset - latency metrics - testutil: use crand for PeerID gen RandPeerID generates random "valid" peer IDs. it does not NEED to generate keys because it is as if we lost the key right away. fine to read some randomness and hash it. to generate proper keys and an ID, use: sk, pk, _ := testutil.RandKeyPair() id, _ := peer.IDFromPublicKey(pk) Also added RandPeerIDFatal helper - removed old spipe - updated seccat - core: cleanup initIdentity - removed old getFromPeerList
由 Juan Batiz-Benet 提交于 -
由 Juan Batiz-Benet 提交于
-
由 Juan Batiz-Benet 提交于
-
由 Juan Batiz-Benet 提交于
-
- 21 12月, 2014 1 次提交
-
-
Godeps: update dependency for go-msgio
由 Brian Tiger Chow 提交于
-
- 20 12月, 2014 1 次提交
-
-
Otherwise there is the following failure when running godep restore: fatal: reference is not a tree: 281b085dc602c4f0377438e20331f45a91bcdf9c godep: restore: exit status 128 License: MIT Signed-off-by:Christian Couder <chriscool@tuxfamily.org>
由 Christian Couder 提交于
-
- 19 12月, 2014 1 次提交
-
-
由 Jeromy 提交于
-
- 18 12月, 2014 29 次提交
-
-
Bitswap rounds
由 Juan Batiz-Benet 提交于 -
@whyrusleeping License: MIT Signed-off-by:Brian Tiger Chow <brian@perfmode.com>
由 Brian Tiger Chow 提交于 -
由 Jeromy 提交于
-
addresses... https://github.com/jbenet/go-ipfs/pull/438/files#r21878994 License: MIT Signed-off-by:
由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
@whyrusleeping may wanna have a look and make sure i didn't screw anything up here BenchmarkInstantaneousAddCat1MB-4 200 10763761 ns/op 97.42 MB/s BenchmarkInstantaneousAddCat2MB-4 panic: runtime error: invalid memory address or nil pointer dereference [signal 0xb code=0x1 addr=0x0 pc=0xbedd] goroutine 14297 [running]: github.com/jbenet/go-ipfs/exchange/bitswap/decision.(*taskQueue).Remove(0xc2087553a0, 0xc2085ef200, 0x22, 0x56f570, 0xc208367a40) /Users/btc/go/src/github.com/jbenet/go-ipfs/exchange/bitswap/decision/taskqueue.go:66 +0x82 github.com/jbenet/go-ipfs/exchange/bitswap/decision.(*Engine).MessageSent(0xc20871b5c0, 0x56f570, 0xc208367a40, 0x570040, 0xc208753d40, 0x0, 0x0) /Users/btc/go/src/github.com/jbenet/go-ipfs/exchange/bitswap/decision/engine.go:177 +0x29e github.com/jbenet/go-ipfs/exchange/bitswap.(*bitswap).send(0xc20871b7a0, 0x56f4d8, 0xc208379800, 0x56f570, 0xc208367a40, 0x570040, 0xc208753d40, 0x0, 0x0) /Users/btc/go/src/github.com/jbenet/go-ipfs/exchange/bitswap/bitswap.go:352 +0x11c github.com/jbenet/go-ipfs/exchange/bitswap.(*bitswap).taskWorker(0xc20871b7a0, 0x56f4d8, 0xc208379800) /Users/btc/go/src/github.com/jbenet/go-ipfs/exchange/bitswap/bitswap.go:238 +0x165 created by github.com/jbenet/go-ipfs/exchange/bitswap.New /Users/btc/go/src/github.com/jbenet/go-ipfs/exchange/bitswap/bitswap.go:66 +0x49e由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
in many places, entries are assigned from one slice to another and in different goroutines. In one place, entries were modified (in the queue). To avoid shared mutable state, probably best to handle entries by value. License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
not changing this because i don't want to write a test for it now License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
addresses https://github.com/jbenet/go-ipfs/pull/438#discussion_r21952271 License: MIT Signed-off-by:
由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
addresses https://github.com/jbenet/go-ipfs/pull/438#discussion_r21953742 License: MIT Signed-off-by:
由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
only sort SortedEntries() License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
this opens up the possibility of having multiple queues. And for all outgoing messages to be managed by the decision engine License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
bitswap keeps the threadsafe version. observing the ledger shows that it doesn't need it anymore (ledgermanager is protected and safe). License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
If we put the lock next to the fields it protects, it can sometimes make it easier to reason about threadsafety. In this case, it reveals that the task queue (not threadsafe) isn't protected by the mutex, yet shared between the worker and callers. @whyrusleeping License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
it's only used in two places, but i think we've been using maps on IPFS types so much now that the specificity is no longer necessary License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
Before, priority carried two pieces of information. One: priority as defined by remote peer Two: whether task is trashed This assumes the protocol is defined for natural numbers instead of integers. That may not always be the case. Better to leave that assumption outside so this package isn't coupled to the whims of the protocol. The protocol may be changed to allow any integer value to be used. Hopefully by that time, new responsibilties weren't added to the Priority variable. License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
it seems to make sense since, in each place, the Key and Priority represent the same information b/c you know the saying... "It is better to have 100 functions operate on one data structure than 10 functions on 10 data structures." License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于 -
License: MIT Signed-off-by:由 Brian Tiger Chow 提交于
-
