1. 24 Jan, 2015 1 commit
  2. 22 Jan, 2015 1 commit
  3. 19 Jan, 2015 2 commits
    • Brian Tiger Chow's avatar
      fix: return pointer · 02c7adcf
      Brian Tiger Chow authored
      @whyrusleeping
      02c7adcf
    • Brian Tiger Chow's avatar
      fix(bitswap.decision.Engine) enqueue only the freshest messages · e82011a8
      Brian Tiger Chow authored
      Before, the engine worker would pop a task and block on send to the
      bitswap worker even if the bitswap worker wasn't to receive. Since the
      task could have been invalidated during this blocking send, a small
      number of stale (already acquired) blocks would be send to partners.
      
      Now, tasks are only popped off of the queue when bitswap is ready to
      send them over the wire. This is accomplished by removing the
      outboxChanBuffer and implementing a two-phase communication sequence.
      e82011a8
  4. 18 Jan, 2015 6 commits
  5. 05 Jan, 2015 4 commits
  6. 02 Jan, 2015 1 commit
    • Juan Batiz-Benet's avatar
      introducing p2p pkg · 0636625d
      Juan Batiz-Benet authored
      I think it's time to move a lot of the peer-to-peer networking
      but-not-ipfs-specific things into its own package: p2p.
      This could in the future be split off into its own library.
      The first thing to go is the peer.
      0636625d
  7. 23 Dec, 2014 1 commit
    • Juan Batiz-Benet's avatar
      peer change: peer.Peer -> peer.ID · 42f61ec0
      Juan Batiz-Benet authored
      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
      42f61ec0
  8. 18 Dec, 2014 11 commits