OpenFT 0.2.1.2 released!

Again, I'd like to apologize for the unacceptable delay on this release. We have been brewing over several changes that were originally planned for OpenFT 0.2.1.2 but were rolled back at the last minute due to the dubious nature of the changes. None-the-less, we have put together a solid release with many new features and bug fixes which we hope will improve the search node diversity issue on the network.

The most notable change here is the redesign of the search database and getrlimit/setrlimit support. With this, we hope that many otherwise shut-out Poisoned users will be able to function as robust and powerful search nodes on the network. Since these users occupy the largest portion of OpenFT, it is up to them to do their part to improve the availability of search node connections in the absence of an auto-promotion feature (we're working on it, I promise!).

Quoting from the ChangeLog:

* Fixed a problem that would improperly cast the result of recv() to size_t before testing for a negative return value.

* Improved URL encoding correctness. This code is likely to be phased out entirely with the introduction of giFT 0.12.x, *sigh*.

* Added HEAD request method support. This is a server-side only change and is not currently being utilized by this code base.

* Minor internal cleanups regarding the use of FT_SELF' as a valid FTNode object.

* Major logic improvements regarding class changes.

* Turned off incoming search verification by default.

* Massive search database redesign and internal code cleanups. Added an additional non-persistent index for efficient removal (similar to what was used before but greatly cluttered the memory pool cache and persisted for the life of the child connection). This improvement manifests itself in the form of a drop of n file descriptors actively opened where n is the number of children the search node is currently managing.

* Added a simple test-case system for benchmarking and testing ft_search_db.c tweaks.

* Search node defaults have been adjusted to better facilitate the increased search node distribution and lower the system requirements for more casual search nodes.

* Minor search node optimization which avoids port verification for nodes that can't possibly become our child (even if they think they can). This optimization should eventually be built into the network by allowing users to dynamically adjust their firewalled status based on the verification results from remote search peers.

* Automatically detect and adjust the fd limit of the process space OpenFT is running in using getrlimit/setrlimit when available. This should greatly improve some operating system's ability to function as a search node.

* Avoid a fatal assertion when giFT [mistakenly] calls p->download_start consecutively, with no p->download_stop in-between.

* Major win32 portability improvements. Thanks pretender :-)