The new hash looks interesting and it would be good to see some
comparisons of lookup times with the old and new. I recall that someone
did some tests indicating that the current scheme wasn't too bad, though
I'm sure it can be improved.
Putting the parent pointer into the hash in the beginning would likely
be a problem, as then you'd need to recompute hashes when the parents
Probably a good starting point for comparison would be to gather some
stats on the evenness of the current hash chains, and then see what the
new algorithm can do.
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to firstname.lastname@example.org
Please read the FAQ at http://www.tux.org/lkml/faq.html