* The implementation is based on Paul Hsieh's SuperFastHash:
* http://www.azillionmonkeys.com/qed/hash.html
*/
-u_int32_t chunk_hash(chunk_t chunk)
+u_int32_t chunk_hash_inc(chunk_t chunk, u_int32_t hash)
{
u_char *data = chunk.ptr;
size_t len = chunk.len;
- u_int32_t hash = len, tmp;
+ u_int32_t tmp;
int rem;
if (!len || data == NULL)
return hash;
}
+/**
+ * Described in header.
+ */
+u_int32_t chunk_hash(chunk_t chunk)
+{
+ return chunk_hash_inc(chunk, chunk.len);
+}
+
/**
* output handler in printf() for chunks
*/
*/
u_int32_t chunk_hash(chunk_t chunk);
+/**
+ * Incremental version of chunk_hash. Use this to hash two or more chunks.
+ */
+u_int32_t chunk_hash_inc(chunk_t chunk, u_int32_t hash);
+
/**
* Get printf hooks for a chunk.
*