Lines Matching defs:hash
1410 struct hashmap *hash = NULL;
1432 hash = hashmap__new(strs_hash_fn, strs_hash_equal_fn, btf);
1433 if (IS_ERR(hash)) {
1434 err = PTR_ERR(hash);
1435 hash = NULL;
1442 * content already is in the hash map
1444 err = hashmap__add(hash, (void *)off, (void *)off);
1457 btf->strs_hash = hash;
1469 hashmap__free(hash);
2785 * index (`btf_dedup->dedup_table`), which maps type descriptor's signature hash
2858 * This is a map from any type's signature hash to a list of possible
2894 #define for_each_dedup_cand(d, node, hash) \
2895 hashmap__for_each_key_entry(d->dedup_table, node, (void *)hash)
2897 static int btf_dedup_table_add(struct btf_dedup *d, long hash, __u32 type_id)
2900 (void *)hash, (void *)(long)type_id);
3319 /* Calculate type signature hash of INT. */
3342 /* Calculate type signature hash of ENUM. */
3347 /* don't hash vlen and enum members to support enum fwd resolving */
3392 * Calculate type signature hash of STRUCT/UNION, ignoring referenced type IDs,
3439 * Calculate type signature hash of ARRAY, including referenced type IDs,
3489 * Calculate type signature hash of FUNC_PROTO, including referenced type IDs,
3565 * their type signature hash and comparing them with any possible canonical
4015 * For each struct/union type its type signature hash is calculated, taking
4018 * completely until after reference types deduplication phase. This type hash
4019 * is used to iterate over all potential canonical types, sharing same hash.
4031 * as canonical for itself and is added into btf_dedup->dedup_table hash map
4063 * This can happen due to hash collision. In such case just
4121 * hash (this time taking into account referenced type IDs) and loop over all