What were you measuring? Code size or runtime memory consumption? It
looks a bit large for code size, but _very_ small for runtime.
> The really small algorithm I know about (at least for decompression)
> is upx. The compression is comparable with gzip with a decompressor
> that can fit in a page or two of assembly code.
Sounds interesting as well. Maybe we should add a central compression
library to the kernel. zlib is already central, but at least jffs2 and
ppp also have some other algorithms that could be moved and possibly
reused for other subsystems/drivers.
-- Optimizations always bust things, because all optimizations are, in the long haul, a form of cheating, and cheaters eventually get caught. -- Larry Wall - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to firstname.lastname@example.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/