httpico is yet another lightweight HTTP server. It implements a few HTML rewriting rules delineated by '<?pico>' tags, and makes it fairly easy to add more straight into the C code. It does not have complete HTTP standards compliance. It also contains a 'genstats' log analysis tool.
RipTcl is a front-end to various programs that rips audio CDs and encodes/transcodes to FLAC, Ogg Vorbis, MP3, WAV, or AAC under Linux. It provides extended meta tagging features, detects and saves files to USB storage players, burns CDs in DAO mode, plays audio, and supports freedb.
phpLiteAdmin is a Web-based database admin tool with support for SQLite 2 and 3. It consists of a single 60KB source file that can simply be dropped into a directory on your server and then visited in a browser. There is virtually no setup required except for specifying your database(s). The available operations, feature set, interface, and user experience is comparable to phpMyAdmin for MySQL.
cola is a C implementation of the COLA structure described in the paper "Cache Oblivious Streaming B-Trees" by Bender, Farach-Colton, et al. This algorithm is a drop-in replacement for B-Tree databases/indexes which performs faster on spinning disks than B-Trees do on SSD. It's asymptotically optimal in terms of data transfers to and from disk. For example, random key inserts are turned into linear sequential writes while maintaining the property which queries always require, at most, precisely log N blocks read sequentially (but not contiguously) from disk (or half that, on average).
Metrix++ is a platform to collect and analyze code metrics. It has a plugin-based architecture, so it is easy to add support for new languages, define new metrics, and/or create new pre- and post-processing tools. Every metric has 'turn-on' and other configuration options. There are no predefined thresholds for metrics or rules; you can choose and configure any limit you want. It scales well to large codebases. For example, initial parsing of about 10000 files takes 2-3 minutes on an average PC, and only 10-20 seconds for iterative re-run. Reporting summary results and exceeded limits takes less than 1 - 10 seconds. It can compare results for 2 code snapshots (collections) and differentiate added regions (classes, functions, etc.), modified regions, and unchanged regions. As a result, easy deployment is guaranteed into legacy software, helping you to deal with legacy code efficiently, and either enforce the 'leave it not worse than it was before' rule or motivate re-factoring.