assert(f);
assert(field && size > 0);
- hash = hash64(field, size);
+ hash = jenkins_hash64(field, size);
return journal_file_find_field_object_with_hash(
f,
assert(f);
assert(data || size == 0);
- hash = hash64(data, size);
+ hash = jenkins_hash64(data, size);
return journal_file_find_data_object_with_hash(
f,
assert(f);
assert(field && size > 0);
- hash = hash64(field, size);
+ hash = jenkins_hash64(field, size);
r = journal_file_find_field_object_with_hash(f, field, size, hash, &o, &p);
if (r < 0)
assert(f);
assert(data || size == 0);
- hash = hash64(data, size);
+ hash = jenkins_hash64(data, size);
r = journal_file_find_data_object_with_hash(f, data, size, hash, &o, &p);
if (r < 0)
return r;
}
- h2 = hash64(b, b_size);
+ h2 = jenkins_hash64(b, b_size);
} else
- h2 = hash64(o->data.payload, le64toh(o->object.size) - offsetof(Object, data.payload));
+ h2 = jenkins_hash64(o->data.payload, le64toh(o->object.size) - offsetof(Object, data.payload));
if (h1 != h2) {
error(offset, "Invalid hash (%08"PRIx64" vs. %08"PRIx64, h1, h2);
uint32_t jenkins_hashbig(const void *key, size_t length, uint32_t initval) _pure_;
-static inline uint64_t hash64(const void *data, size_t length) {
+static inline uint64_t jenkins_hash64(const void *data, size_t length) {
uint32_t a = 0, b = 0;
jenkins_hashlittle2(data, length, &a, &b);
assert(j->level1->type == MATCH_OR_TERM);
assert(j->level2->type == MATCH_AND_TERM);
- hash = hash64(data, size);
+ hash = jenkins_hash64(data, size);
LIST_FOREACH(matches, l3, j->level2->matches) {
assert(l3->type == MATCH_OR_TERM);