* Load "test" torrent on start.
* Look for content and resume in the right places.

message when we no longer have any pending requests. This fixes a bug
where two uniterest messages were sent to a peer that was no longer
wanted in endgame.

rid of the global btpd struct. Some fields in the struct got a corresponding
global variable whereas some was made static and moved to a module.

The bandwidht algorithm also got tweaked. It now tries to fire the event
at specific times. This was to make the code simpler. It'll probably have
to be tweaked again :P

First step to make btpd run from a directory where it'll keep the log,
socket, configuration, data on the known torrents, etc. Btpd now uses
flock on the pidfile instead of connecting to the socket in order to
be reasonably sure that no other btpd runs in the same directory.

before we read the piece data. This can be used to test for junk earlier.

sending an uninterest message.

requests were sent.

Use the net_state enum and change some state names from NET_ to BTP_.
Some minor type fixes.

Remove unneccesary use of struct io_buffer.

Remove an unneccesary net state.
Pass the char buffer directly to net_state instead of struct io_buf.

removed some deug logging.

that had closed the at least one direction of the connection. That feature
was probably unneccesary. Removed it for now.

It's not quite how I want it yet, but it's getting there.

message followed by an interest message. Optimize this but not sending
those messages in that case. This is better becasue we don't risk to
trigger a choke from the receiving peer.

be shared by several peers. At least in end game.
* Link blocks with the peers we are loading them from and vice versa.
* Limit the number of requests / peer in end game too.
* Improve end game by using some sort of round robin for block requests.

to build with glibc.

writing to a peer. If more requests arrive they will be ignored.
When all pieces have been sent to the peer, in order for it not to
wait on the ignored requests, its state will be reset by a choke
followed by an unchoke message. 

Without this limit there was no bound on how much memory btpd would
consume to satisfy a greedy peer.

* Use the new net_bufs where it makes sense.
* Take advantage of the reference count on net_bufs and only allocate
  the (un)choke and (un)interest messages once.

being sent too early it could now be sent too late.

Change version to 0.5 and document the bug fix.

be extracted from the buffer data instead. Created functions to do
that.

gotten new request if the piece was fully downloaded and found
to be bad.

Each piece must have at least one byte for their block bit array,
  or they will collide causing great confusion in btpd. The calculation
  was done wrong so this could happen for small torrents (blocks / piece < 8).

policy_subr.c:
  * Add test for correctness.
  * Add missing call to cm_on_piece_full in cm_new_piece.

* Add function net_unsend to safely remove network buffers from a peer's
  outq. Use it where needed in peer.c.

information on what data they hold, making it unnecessary to have
other lists tracking that information. Also they now have a reference
count, making it possible to use the same buffer on many peers.

This is only a start though. I've just done enough for btpd to work,
I haven't taken advantage of the reference count yet.