Searched refs:hash (Results 1 - 25 of 29) sorted by relevance

12

/systemd/src/basic/
H A Dhash-funcs.c21 #include "hash-funcs.h"
32 .hash = string_hash_func,
45 .hash = trivial_hash_func,
61 .hash = uint64_hash_func,
78 .hash = devt_hash_func,
H A Dhash-funcs.h30 hash_func_t hash; member in struct:hash_ops
58 .hash = devt_hash_func,
H A Dhashmap.c87 * http://blog.booking.com/hardening-perls-hash-function.html
116 /* In several functions it is advantageous to have the hash table extended
180 uint8_t hash_key[HASH_KEY_SIZE]; /* hash key; changes during resize */
208 /* Hashmaps with directly stored entries all use this shared hash key.
217 const struct hash_ops *hash_ops; /* hash and compare ops to use */
232 /* Specific hash types
317 uint64_t hash; local
321 h->hash_ops->hash(p, &state);
323 hash = siphash24_finalize(&state);
325 return (unsigned) (hash
1196 unsigned hash, idx; local
1218 unsigned hash, idx; local
1235 unsigned hash, idx; local
1266 unsigned hash, idx; local
1282 unsigned hash, idx; local
1298 unsigned hash, idx; local
1316 unsigned hash; local
1327 unsigned hash, idx; local
1347 unsigned hash, idx; local
1465 unsigned hash, idx; local
1748 unsigned hash, idx; local
[all...]
/systemd/src/libsystemd-network/
H A Ddhcp-identifier.c36 uint64_t hash; local
53 hash = htole64(siphash24(&machine_id, sizeof(machine_id), HASH_KEY.bytes));
54 memcpy(duid->en.id, &hash, sizeof(duid->en.id));
H A Dsd-dhcp-server.c141 .hash = client_id_hash_func,
746 uint64_t hash; local
750 the same IP address. we do this by using the hash of the client id
755 hash = htole64(siphash24_finalize(&state));
756 next_offer = hash % server->pool_size;
H A Dsd-lldp.c101 .hash = chassis_id_hash_func,
/systemd/src/libudev/
H A Dlibudev-util.c257 /* get a bunch of bit numbers out of the hash, and set the bits in our bit field */
261 unsigned int hash = util_string_hash32(str); local
263 bits |= 1LLU << (hash & 63);
264 bits |= 1LLU << ((hash >> 6) & 63);
265 bits |= 1LLU << ((hash >> 12) & 63);
266 bits |= 1LLU << ((hash >> 18) & 63);
H A Dlibudev-monitor.c347 unsigned int hash = util_string_hash32(udev_list_entry_get_name(list_entry)); local
353 bpf_jmp(ins, &i, BPF_JMP|BPF_JEQ|BPF_K, hash, 0, 1);
356 bpf_jmp(ins, &i, BPF_JMP|BPF_JEQ|BPF_K, hash, 0, 3);
361 hash = util_string_hash32(udev_list_entry_get_value(list_entry));
362 bpf_jmp(ins, &i, BPF_JMP|BPF_JEQ|BPF_K, hash, 0, 1);
/systemd/src/journal/
H A Djournal-def.h83 le64_t hash; member in struct:DataObject
94 le64_t hash; member in struct:FieldObject
102 le64_t hash; member in struct:EntryItem
H A Djournald-rate-limit.c60 uint64_t hash; member in struct:JournalRateLimitGroup
105 LIST_REMOVE(bucket, g->parent->buckets[g->hash % BUCKETS_MAX], g);
163 g->hash = siphash24_finalize(&state);
167 LIST_PREPEND(bucket, r->buckets[g->hash % BUCKETS_MAX], g);
H A Djournal-file.c630 /* 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,
735 journal_file_link_field( JournalFile *f, Object *o, uint64_t offset, uint64_t hash) argument
780 journal_file_link_data( JournalFile *f, Object *o, uint64_t offset, uint64_t hash) argument
831 journal_file_find_field_object_with_hash( JournalFile *f, const void *field, uint64_t size, uint64_t hash, Object **ret, uint64_t *offset) argument
891 uint64_t hash; local
903 journal_file_find_data_object_with_hash( JournalFile *f, const void *data, uint64_t size, uint64_t hash, Object **ret, uint64_t *offset) argument
997 uint64_t hash; local
1014 uint64_t hash, p; local
1076 uint64_t hash, p; local
[all...]
H A Djournal-authenticate.c68 * header. This will exclude the actual hash value in it */
258 /* All but hash and payload are mutable */
259 gcry_md_write(f->hmac, &o->data.hash, sizeof(o->data.hash));
265 gcry_md_write(f->hmac, &o->field.hash, sizeof(o->field.hash));
H A Djournal-file.h200 int journal_file_find_data_object_with_hash(JournalFile *f, const void *data, uint64_t size, uint64_t hash, Object **ret, uint64_t *offset);
203 int journal_file_find_field_object_with_hash(JournalFile *f, const void *field, uint64_t size, uint64_t hash, Object **ret, uint64_t *offset);
H A Djournal-verify.c153 h1 = le64toh(o->data.hash);
175 error(offset, "Invalid hash (%08"PRIx64" vs. %08"PRIx64, h1, h2);
268 "Invalid %s hash table size: %"PRIu64,
278 "Invalid %s hash table item (%"PRIu64"/%"PRIu64") head_hash_offset: "OFSfmt,
287 "Invalid %s hash table item (%"PRIu64"/%"PRIu64") tail_hash_offset: "OFSfmt,
297 "Invalid %s hash table item (%"PRIu64"/%"PRIu64"): head_hash_offset="OFSfmt" tail_hash_offset="OFSfmt,
596 return log_error_errno(r, "Failed to map data hash table: %m");
610 error(p, "Invalid data object at hash entry %"PRIu64" of %"PRIu64, i, n);
620 error(p, "Hash chain has a cycle in hash entry %"PRIu64" of %"PRIu64, i, n);
624 if (le64toh(o->data.hash)
646 data_object_in_hash_table(JournalFile *f, uint64_t hash, uint64_t p) argument
[all...]
H A Dsd-journal.c1942 le_hash = o->entry.items[i].hash;
1947 if (le_hash != o->data.hash)
2069 le_hash = o->entry.items[j->current_field].hash;
2074 if (le_hash != o->data.hash)
2528 r = journal_file_find_data_object_with_hash(of, odata, ol, le64toh(o->data.hash), NULL, NULL);
2597 /* Reached the end of the hash table, go to the next file. */
2607 /* Empty hash table bucket, go to next one */
2633 /* Reached the end of the hash table chain */
2662 r = journal_file_find_field_object_with_hash(of, o->field.payload, sz, le64toh(o->field.hash), NULL, NULL);
H A Dcatalog.c91 .hash = catalog_hash_func,
/systemd/src/test/
H A Dtest-prioq.c98 .hash = test_hash,
/systemd/src/import/
H A Dpull-common.c199 * When that happens, a URL hash is used instead. Paths returned by this function
202 _cleanup_free_ char *hash = NULL; local
207 r = hash_url(url, &hash);
211 path = strjoin(image_root, "/", strempty(prefix), hash, escaped_etag ? "." : "",
/systemd/src/resolve/
H A Dresolved-dns-dnssec.c214 "(data (flags pkcs1) (hash %s %b))",
262 const void *hash, size_t hash_size,
270 assert(hash);
311 hash, hash_size,
361 "(data (flags rfc6979) (hash %s %b))",
409 const void *hash, size_t hash_size,
417 assert(hash);
446 hash, hash_size,
628 void *hash; local
788 hash
260 dnssec_rsa_verify( const char *hash_algorithm, const void *hash, size_t hash_size, DnsResourceRecord *rrsig, DnsResourceRecord *dnskey) argument
406 dnssec_ecdsa_verify( const char *hash_algorithm, int algorithm, const void *hash, size_t hash_size, DnsResourceRecord *rrsig, DnsResourceRecord *dnskey) argument
[all...]
H A Dresolved-dns-rr.c305 .hash = dns_resource_key_hash_func,
1073 _cleanup_free_ char *salt = NULL, *hash = NULL; local
1081 hash = base32hexmem(rr->nsec3.next_hashed_name, rr->nsec3.next_hashed_name_size, false);
1082 if (!hash)
1095 hash,
1338 /* Add an extra NUL byte, so that "a" followed by "b" doesn't result in the same hash as "ab"
1458 .hash = dns_resource_record_hash_func,
H A Dresolved-etc-hosts.c94 .hash = etc_hosts_item_hash_func,
H A Dresolved-dns-server.c587 .hash = dns_server_hash_func,
/systemd/src/cryptsetup/
H A Dcryptsetup.c132 } else if (startswith(option, "hash=")) {
501 /* plain isn't a real hash type. it just means "use no hash" */
503 params.hash = arg_hash;
506 * package is to not hash when a key file is provided */
507 params.hash = "ripemd160";
537 /* hash == NULL implies the user passed "plain" */
538 pass_volume_key = (params.hash == NULL);
/systemd/src/network/
H A Dnetworkd-address.c189 .hash = address_hash_func,
H A Dnetworkd-route.c172 .hash = route_hash_func,

Completed in 197 milliseconds

12