JFFS3 & performance

Jörn Engel joern at wohnheim.fh-wedel.de
Fri Dec 17 05:25:14 EST 2004

On Thu, 16 December 2004 23:06:41 +0100, Joakim Tjernlund wrote:
> > On Thu, 16 December 2004 22:06:21 +0100, Joakim Tjernlund wrote:
> > 
> > Istr reading something from one of the two authors that basically
> > states the adler32 weakness for short files.  But for long files, the
> > checksum is getting strong enough and much faster.  Too bad that our
> > "files" are short.
> I too rember reading about that. So a new optimzed crc16 is probably the best bet.
> It should do better than crc32 once it is done.


> hmm, I rember that the networking code has some crc/checksum algorithm too.
> Maybe it is possible to use that?


Looks rather complicated.  Iirc it was introduced to avoid DoS attacks
against the networking code.  With the old hashing algorithm
(include/linux/hash.h?), it was easy for an attacker to predict into
which hash bucket any given packet would go.  So it could just
generate tons of packets that would all hash to the same bucket.  End
result is that the hash table is pointless and performance is the same
as with a linked list.

Then there's ethernet checksumming, which is crc32.

TCP/IP should have some checksums as well, but I'm not familiar with
those right now.


Schrödinger's cat is <BLINK>not</BLINK> dead.
-- Illiad

More information about the linux-mtd mailing list