* Improve wbuf_append's time complexity from linear to amortized constant.
This is done by the usual technique employed in many, may libraries out
there (C++'s vector, Java's ArrayList, Python's list, ...): Distinguish
between the size and the capacity of the underlying container. The capacity
grows by some *factor* (2 in our case) if it is too small, amortizing the
needed allocations/copies over time.
In a nutshell: Adding a single character to the buffer can now be done in
constant amortized time.
* Simplify and improve handle_request_fetch.
Now that add_response_info is efficient (thanks to the improved
wbuf_append), we can vastly simplify handle_request_fetch and even remove
some arbitrary length restrictions on the way.