| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/rnp/src/lib/crypto/ |
| H A D | hash_ossl.cpp | 81 EVP_MD_CTX *hash_fn = EVP_MD_CTX_new(); in Hash() local
82 if (!hash_fn) { in Hash()
86 int res = EVP_DigestInit_ex(hash_fn, hash_tp, NULL); in Hash()
89 EVP_MD_CTX_free(hash_fn); in Hash()
95 handle_ = hash_fn; in Hash()
111 int res = EVP_DigestUpdate(hash_fn, buf, len); in add()
137 EVP_MD_CTX_free(hash_fn); in finish()
173 EVP_MD_CTX *hash_fn = EVP_MD_CTX_new(); in clone() local
174 if (!hash_fn) { in clone()
182 EVP_MD_CTX_free(hash_fn); in clone()
[all …]
|
| H A D | hash.cpp | 71 auto hash_fn = Botan::HashFunction::create(name); in Hash() local
72 if (!hash_fn) { in Hash()
77 size_ = hash_fn->output_length(); in Hash()
82 handle_ = hash_fn.release(); in Hash()
116 auto hash_fn = in finish() local
118 if (!hash_fn) { in finish()
128 hash_fn->final(digest); in finish()
155 if (!hash_fn) { in clone()
159 auto copy = hash_fn->copy_state(); in clone()
185 if (!hash_fn) { in CRC24()
[all …]
|
| /dports/security/botan110/Botan-1.10.17/src/constructs/srp6/ |
| H A D | srp6.cpp | 23 std::auto_ptr<HashFunction> hash_fn( in hash_seq() local
29 return BigInt::decode(hash_fn->final()); in hash_seq()
38 std::auto_ptr<HashFunction> hash_fn( in hash_seq() local
45 return BigInt::decode(hash_fn->final()); in hash_seq()
53 std::auto_ptr<HashFunction> hash_fn( in compute_x() local
56 hash_fn->update(identifier); in compute_x()
57 hash_fn->update(":"); in compute_x()
58 hash_fn->update(password); in compute_x()
60 SecureVector<byte> inner_h = hash_fn->final(); in compute_x()
62 hash_fn->update(salt); in compute_x()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/testing/mozharness/mozharness/mozilla/ |
| H A D | merkle.py | 16 def _leaf_hash(hash_fn, leaf): argument
17 return hash_fn(b"\x00" + leaf).digest()
20 def _pair_hash(hash_fn, left, right): argument
21 return hash_fn(b"\x01" + left + right).digest()
106 def _expected_head(self, hash_fn, leaf, leaf_index, tree_size): argument
107 node = _leaf_hash(hash_fn, leaf)
126 node = _pair_hash(hash_fn, node, elem)
128 node = _pair_hash(hash_fn, elem, node)
146 def __init__(self, hash_fn, data): argument
148 self.hash_fn = hash_fn
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/testing/mozharness/mozharness/mozilla/ |
| H A D | merkle.py | 11 def _leaf_hash(hash_fn, leaf): argument
12 return hash_fn(b'\x00' + leaf).digest()
15 def _pair_hash(hash_fn, left, right): argument
16 return hash_fn(b'\x01' + left + right).digest()
97 def _expected_head(self, hash_fn, leaf, leaf_index, tree_size): argument
98 node = _leaf_hash(hash_fn, leaf)
117 node = _pair_hash(hash_fn, node, elem)
119 node = _pair_hash(hash_fn, elem, node)
137 def __init__(self, hash_fn, data): argument
139 self.hash_fn = hash_fn
[all …]
|
| /dports/www/firefox/firefox-99.0/testing/mozharness/mozharness/mozilla/ |
| H A D | merkle.py | 16 def _leaf_hash(hash_fn, leaf): argument
17 return hash_fn(b"\x00" + leaf).digest()
20 def _pair_hash(hash_fn, left, right): argument
21 return hash_fn(b"\x01" + left + right).digest()
106 def _expected_head(self, hash_fn, leaf, leaf_index, tree_size): argument
107 node = _leaf_hash(hash_fn, leaf)
126 node = _pair_hash(hash_fn, node, elem)
128 node = _pair_hash(hash_fn, elem, node)
146 def __init__(self, hash_fn, data): argument
148 self.hash_fn = hash_fn
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/testing/mozharness/mozharness/mozilla/ |
| H A D | merkle.py | 16 def _leaf_hash(hash_fn, leaf): argument
17 return hash_fn(b"\x00" + leaf).digest()
20 def _pair_hash(hash_fn, left, right): argument
21 return hash_fn(b"\x01" + left + right).digest()
106 def _expected_head(self, hash_fn, leaf, leaf_index, tree_size): argument
107 node = _leaf_hash(hash_fn, leaf)
126 node = _pair_hash(hash_fn, node, elem)
128 node = _pair_hash(hash_fn, elem, node)
146 def __init__(self, hash_fn, data): argument
148 self.hash_fn = hash_fn
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/testing/mozharness/mozharness/mozilla/ |
| H A D | merkle.py | 11 def _leaf_hash(hash_fn, leaf): argument
12 return hash_fn(b'\x00' + leaf).digest()
15 def _pair_hash(hash_fn, left, right): argument
16 return hash_fn(b'\x01' + left + right).digest()
97 def _expected_head(self, hash_fn, leaf, leaf_index, tree_size): argument
98 node = _leaf_hash(hash_fn, leaf)
117 node = _pair_hash(hash_fn, node, elem)
119 node = _pair_hash(hash_fn, elem, node)
137 def __init__(self, hash_fn, data): argument
139 self.hash_fn = hash_fn
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/acro/packages/utilib/src/utilib/ |
| H A D | hash_fn.h | 84 size_type hash_fn(const T& key, size_type table_size) in hash_fn() function
89 inline size_type hash_fn(const BasicArray<T>& key, size_type table_size) in hash_fn() function
94 size_type hash_fn(const ValuedContainer<V,T>& key, size_type table_size) in hash_fn() function
95 {return hash_fn(key.info,table_size);} in hash_fn()
107 inline size_type hash_fn(const CharString& key, size_type table_size) in hash_fn() function
114 inline size_type hash_fn(const std::string& key, size_type table_size) in hash_fn() function
124 inline size_type hash_fn(const int& key, size_type table_size) in hash_fn() function
129 inline size_type hash_fn(const long int& key, size_type table_size) in hash_fn() function
139 inline size_type hash_fn(const double& key, size_type table_size) in hash_fn() function
149 inline size_type hash_fn(const BasicArray<int>& key, size_type table_size) in hash_fn() function
[all …]
|
| /dports/security/rnp/rnp-0.15.2/src/lib/crypto/ |
| H A D | hash.cpp | 155 std::unique_ptr<Botan::HashFunction> hash_fn; in botan_hash_create() local
157 hash_fn = Botan::HashFunction::create(hash_name); in botan_hash_create()
161 if (!hash_fn) { in botan_hash_create()
166 hash->_output_len = hash_fn->output_length(); in botan_hash_create()
172 hash->handle = hash_fn.release(); in botan_hash_create()
211 Botan::HashFunction *hash_fn = static_cast<Botan::HashFunction *>(src->handle); in pgp_hash_copy() local
212 if (!hash_fn) { in pgp_hash_copy()
218 handle = hash_fn->copy_state(); in pgp_hash_copy()
257 if (!hash_fn) { in pgp_hash_finish()
266 hash_fn->final(out); in pgp_hash_finish()
[all …]
|
| /dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/botan/src/lib/misc/srp6/ |
| H A D | srp6.cpp | 22 std::unique_ptr<HashFunction> hash_fn(HashFunction::create_or_throw(hash_id)); in hash_seq() local
24 hash_fn->update(BigInt::encode_1363(in1, pad_to)); in hash_seq()
25 hash_fn->update(BigInt::encode_1363(in2, pad_to)); in hash_seq()
27 return BigInt::decode(hash_fn->final()); in hash_seq()
37 hash_fn->update(identifier); in compute_x()
38 hash_fn->update(":"); in compute_x()
39 hash_fn->update(password); in compute_x()
41 secure_vector<uint8_t> inner_h = hash_fn->final(); in compute_x()
43 hash_fn->update(salt); in compute_x()
44 hash_fn->update(inner_h); in compute_x()
[all …]
|
| /dports/security/botan2/Botan-2.18.2/src/lib/misc/srp6/ |
| H A D | srp6.cpp | 22 std::unique_ptr<HashFunction> hash_fn(HashFunction::create_or_throw(hash_id)); in hash_seq() local
24 hash_fn->update(BigInt::encode_1363(in1, pad_to)); in hash_seq()
25 hash_fn->update(BigInt::encode_1363(in2, pad_to)); in hash_seq()
27 return BigInt::decode(hash_fn->final()); in hash_seq()
37 hash_fn->update(identifier); in compute_x()
38 hash_fn->update(":"); in compute_x()
39 hash_fn->update(password); in compute_x()
41 secure_vector<uint8_t> inner_h = hash_fn->final(); in compute_x()
43 hash_fn->update(salt); in compute_x()
44 hash_fn->update(inner_h); in compute_x()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/botan/src/lib/misc/srp6/ |
| H A D | srp6.cpp | 22 std::unique_ptr<HashFunction> hash_fn(HashFunction::create_or_throw(hash_id)); in hash_seq() local
24 hash_fn->update(BigInt::encode_1363(in1, pad_to)); in hash_seq()
25 hash_fn->update(BigInt::encode_1363(in2, pad_to)); in hash_seq()
27 return BigInt::decode(hash_fn->final()); in hash_seq()
37 hash_fn->update(identifier); in compute_x()
38 hash_fn->update(":"); in compute_x()
39 hash_fn->update(password); in compute_x()
41 secure_vector<uint8_t> inner_h = hash_fn->final(); in compute_x()
43 hash_fn->update(salt); in compute_x()
44 hash_fn->update(inner_h); in compute_x()
[all …]
|
| /dports/dns/knot3/knot-3.1.5/src/contrib/libbpf/bpf/ |
| H A D | hashmap.c | 32 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
35 map->hash_fn = hash_fn; in hashmap__init()
45 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
53 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
106 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
155 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
179 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
199 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
214 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| H A D | hashmap.h | 36 hashmap_hash_fn hash_fn; member
46 #define HASHMAP_INIT(hash_fn, equal_fn, ctx) { \ argument
47 .hash_fn = (hash_fn), \
56 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn,
58 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn,
163 for (cur = ({ size_t bkt = hash_bits(map->hash_fn((_key), map->ctx),\
171 for (cur = ({ size_t bkt = hash_bits(map->hash_fn((_key), map->ctx),\
|
| /dports/dns/knot3-lib/knot-3.1.5/src/contrib/libbpf/bpf/ |
| H A D | hashmap.c | 32 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
35 map->hash_fn = hash_fn; in hashmap__init()
45 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
53 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
106 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
155 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
179 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
199 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
214 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| H A D | hashmap.h | 36 hashmap_hash_fn hash_fn; member
46 #define HASHMAP_INIT(hash_fn, equal_fn, ctx) { \ argument
47 .hash_fn = (hash_fn), \
56 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn,
58 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn,
163 for (cur = ({ size_t bkt = hash_bits(map->hash_fn((_key), map->ctx),\
171 for (cur = ({ size_t bkt = hash_bits(map->hash_fn((_key), map->ctx),\
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/tools/lib/bpf/ |
| H A D | hashmap.c | 38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
41 map->hash_fn = hash_fn; in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
59 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| H A D | hashmap.h | 53 hashmap_hash_fn hash_fn; member
63 #define HASHMAP_INIT(hash_fn, equal_fn, ctx) { \ argument
64 .hash_fn = (hash_fn), \
73 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn,
75 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn,
181 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
189 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/tools/perf/util/ |
| H A D | hashmap.c | 38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
41 map->hash_fn = hash_fn; in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
59 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| H A D | hashmap.h | 53 hashmap_hash_fn hash_fn; member
63 #define HASHMAP_INIT(hash_fn, equal_fn, ctx) { \ argument
64 .hash_fn = (hash_fn), \
73 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn,
75 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn,
181 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
189 ? map->buckets[hash_bits(map->hash_fn((_key), map->ctx), map->cap_bits)] \
|
| /dports/multimedia/libv4l/linux-5.13-rc2/tools/perf/util/ |
| H A D | hashmap.c | 38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
41 map->hash_fn = hash_fn; in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
59 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/tools/lib/bpf/ |
| H A D | hashmap.c | 38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
41 map->hash_fn = hash_fn; in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
59 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/tools/perf/util/ |
| H A D | hashmap.c | 38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
41 map->hash_fn = hash_fn; in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
59 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/tools/lib/bpf/ |
| H A D | hashmap.c | 38 void hashmap__init(struct hashmap *map, hashmap_hash_fn hash_fn, in hashmap__init() argument
41 map->hash_fn = hash_fn; in hashmap__init()
51 struct hashmap *hashmap__new(hashmap_hash_fn hash_fn, in hashmap__new() argument
59 hashmap__init(map, hash_fn, equal_fn, ctx); in hashmap__new()
118 h = hash_bits(map->hash_fn(cur->key, map->ctx), new_cap_bits); in hashmap_grow()
167 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
191 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__insert()
211 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__find()
226 h = hash_bits(map->hash_fn(key, map->ctx), map->cap_bits); in hashmap__delete()
|