mirrors/yosys
3
0
Fork 0
mirror of https://github.com/YosysHQ/yosys synced 2025-09-12 04:31:29 +00:00
Code Activity

hashlib: don't build an unused hash for expired value in do_insert

Browse source
This commit is contained in:
Emil J. Tywoniak 2025-09-04 14:47:45 +02:00
parent cec48c6abd
commit ccf140f2ef
1 changed files with 3 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

10
kernel/hashlib.h
View file

@ -509,12 +509,11 @@ class dict {
return do_lookup_internal(key, hash); return do_lookup_internal(key, hash);
} }
int do_insert(const K &key, Hasher::hash_t &hash) int do_insert(const K &key, const Hasher::hash_t &hash)
{ {
if (hashtable.empty()) { if (hashtable.empty()) {
entries.emplace_back(std::pair<K, T>(key, T()), -1); entries.emplace_back(std::pair<K, T>(key, T()), -1);
do_rehash(); do_rehash();
hash = do_hash(key);
} else { } else {
entries.emplace_back(std::pair<K, T>(key, T()), hashtable[hash]); entries.emplace_back(std::pair<K, T>(key, T()), hashtable[hash]);
hashtable[hash] = entries.size() - 1; hashtable[hash] = entries.size() - 1;
@ -522,12 +521,11 @@ class dict {
return entries.size() - 1; return entries.size() - 1;
} }
int do_insert(const std::pair<K, T> &value, Hasher::hash_t &hash) int do_insert(const std::pair<K, T> &value, const Hasher::hash_t &hash)
{ {
if (hashtable.empty()) { if (hashtable.empty()) {
entries.emplace_back(value, -1); entries.emplace_back(value, -1);
do_rehash(); do_rehash();
hash = do_hash(value.first);
} else { } else {
entries.emplace_back(value, hashtable[hash]); entries.emplace_back(value, hashtable[hash]);
hashtable[hash] = entries.size() - 1; hashtable[hash] = entries.size() - 1;
@ -535,13 +533,11 @@ class dict {
return entries.size() - 1; return entries.size() - 1;
} }
int do_insert(std::pair<K, T> &&rvalue, Hasher::hash_t &hash) int do_insert(std::pair<K, T> &&rvalue, const Hasher::hash_t &hash)
{ {
if (hashtable.empty()) { if (hashtable.empty()) {
auto key = rvalue.first;
entries.emplace_back(std::forward<std::pair<K, T>>(rvalue), -1); entries.emplace_back(std::forward<std::pair<K, T>>(rvalue), -1);
do_rehash(); do_rehash();
hash = do_hash(key);
} else { } else {
entries.emplace_back(std::forward<std::pair<K, T>>(rvalue), hashtable[hash]); entries.emplace_back(std::forward<std::pair<K, T>>(rvalue), hashtable[hash]);
hashtable[hash] = entries.size() - 1; hashtable[hash] = entries.size() - 1;