Bithack

*BitHack* makes a few changes to the way our BitSwap implementation work. From an API standpoint, the biggest change is the addition of `GetBlocks`.  `GetBlock` has been changed to be a special case call of `GetBlocks`. When `GetBlocks` is called, the keys that are requested are sent to another goroutine through a channel, where the actual requests are handled.

When a set of keys are requested, BitSwap will add them all to the wantlist, and the find providers for the first key in the list. It will then send the wantlist to those found providers.
The main bitswap loop now contains a 'timeout ticker', when it ticks, bitswap will find providers for every single key left on the wantlist and send the wantlist out to them, this is the 'plan B' as we hope that our initial request succeeds, saving us the bandwidth. This operation could be optimized to ensure only sending wantlist to a peer once per tick.

`ReceiveMessage` also was changed. Previously it would *always* return a message, which looked to me like it would cause an infinite loop of messaging between a set of peers. Im surprised we never experienced anything bad because of it.

To take advantage of this new behaviour, I modified the DAGReader to use GetBlocks to retrieve blocks for reading.
To be fair, until now I did not know the order in which multiple deferreds are executed.

> The behavior of defer statements is straightforward and predictable. There are three simple rules:
> i A deferred function's arguments are evaluated when the defer statement is evaluated.
> ii Deferred function calls are executed in Last In First Out order after_the surrounding function returns.
``` go
This function prints "3210":
func b() {
    for i := 0; i < 4; i++ {
        defer fmt.Print(i)
    }
}
```
> iii Deferred functions may read and assign to the returning function's named return values.

http://blog.golang.org/defer-panic-and-recover