libdwarf reads and/or writes DWARF debugging information in Elf object files. dwarfdump uses libdwarf to read object files and print the DWARF content in a readable fashion. libdwarf implements the DWARF2 (and later) standard by providing function interfaces that abstract away many DWARF implementation details (the writer code only emits DWARF2 so far). The source also includes implementations of a few tree search (tsearch) algorithms (balanced, red-black, and binary).
EmilPRO is a graphical disassembler for most architectures. It supports quick navigation through the code, visualizing jump destinations, and easy lookup of symbols and addresses. It also supports cross-referencing symbols and displays data (or instructions) in a hexview. Instruction types can be easily edited by the user and shared with others via a Web service. For binaries with debugging information, the high-level source code is shown in addition to the disassembled instructions. EmilPRO can open binaries of many formats, including ELF, Mach-O, and PE executables, with or without symbols.
Backerup is a robust remote backup system which can operate over relatively slow networks. File transfers are done using rsync, and snapshots are taken using hardlinks. Bandwidth can be controlled per host and per network. Priorities can be set on backup groups, as well as requesting minimum ages for backups.
ng-jackspa is a set of simple user interface programs that host a LADSPA plugin, providing JACK ports for its audio inputs and outputs, and dynamic setting of its control inputs through the user interface. Additionally, the plugin controls can be exported to or controlled by control voltages on standard JACK audio ports. The following interfaces are available: an ncurses visual (full screen) interface for the terminal; a GTK+ graphical interface; a Qt 4 graphical interface; and a command line interface for the terminal.
Capsule Tree is a general purpose, self-balancing tree data structure for large, ordered data sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees.