Cross Reference: /systemd/src/journal/journal-file.c

Lines Matching defs:hash
630         /* We estimate that we need 1 hash table entry per 768 bytes
632            beyond 75% fill level. Calculate the hash table size for
639         log_debug("Reserving %"PRIu64" entries in hash table.", s / sizeof(HashItem));
664         /* We use a fixed size hash table for the fields as this
739                 uint64_t hash) {
760         h = hash % m;
784                 uint64_t hash) {
807         h = hash % m;
810                 /* Only entry in the hash table is easy */
833                 const void *field, uint64_t size, uint64_t hash,
843         /* If the field hash table is empty, we can't find anything */
847         /* Map the field hash table, if it isn't mapped yet. */
858         h = hash % m;
868                 if (le64toh(o->field.hash) == hash &&
891         uint64_t hash;
896         hash = hash64(field, size);
899                                                         field, size, hash,
905                 const void *data, uint64_t size, uint64_t hash,
915         /* If there's no data hash table, then there's no entry. */
919         /* Map the data hash table, if it isn't mapped yet. */
930         h = hash % m;
940                 if (le64toh(o->data.hash) != hash)
997         uint64_t hash;
1002         hash = hash64(data, size);
1005                                                        data, size, hash,
1014         uint64_t hash, p;
1022         hash = hash64(field, size);
1024         r = journal_file_find_field_object_with_hash(f, field, size, hash, &o, &p);
1043         o->field.hash = htole64(hash);
1046         r = journal_file_link_field(f, o, p, hash);
1076         uint64_t hash, p;
1085         hash = hash64(data, size);
1087         r = journal_file_find_data_object_with_hash(f, data, size, hash, &o, &p);
1106         o->data.hash = htole64(hash);
1129         r = journal_file_link_data(f, o, p, hash);
1551                 xor_hash ^= le64toh(o->data.hash);
1553                 items[i].hash = o->data.hash;
3042                 le_hash = o->entry.items[i].hash;
3048                 if (le_hash != o->data.hash)
3079                 xor_hash ^= le64toh(u->data.hash);
3081                 items[i].hash = u->data.hash;
3278         /* Let's check if the hash tables grew over a certain fill
3279          * level (75%, borrowing this value from Java's hash table
3286                         log_debug("Data hash table of %s has a fill level at %.1f (%"PRIu64" of %"PRIu64" items, %llu file size, %"PRIu64" bytes per hash table item), suggesting rotation.",
3298                         log_debug("Field hash table of %s has a fill level at %.1f (%"PRIu64" of %"PRIu64" items), suggesting rotation.",