upstream/unbound
1
0
Fork 0
mirror of https://github.com/NLnetLabs/unbound.git synced 2025-12-20 23:00:56 -05:00
Code Issues Projects Releases Packages Wiki Activity Actions

- Improve documentation for #826, describe the large collisions amount.

Browse source
This commit is contained in:
W.C.A. Wijngaards 2023-01-13 11:22:47 +01:00
parent 469133e8df
commit 90d42148de
2 changed files with 5 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
doc/Changelog
View file

@ -1,6 +1,7 @@
13 January 2023: Wouter 13 January 2023: Wouter
- Merge #826: Аdd a metric about the maximum number of collisions in - Merge #826: Аdd a metric about the maximum number of collisions in
lrushah. lrushah.
- Improve documentation for #826, describe the large collisions amount.
9 January 2023: Wouter 9 January 2023: Wouter
- Fix python module install path detection. - Fix python module install path detection.

8
doc/unbound-control.8.in
View file

@ -656,14 +656,14 @@ per delegation point, and their validation status.
.I msg.cache.max_collisions .I msg.cache.max_collisions
The maximum number of hash table collisions in the msg cache. This is the The maximum number of hash table collisions in the msg cache. This is the
number of hashes that are identical when a new element is inserted in the number of hashes that are identical when a new element is inserted in the
hash table. If the value is very large, something is wrong with the performance hash table. If the value is very large, like hundreds, something is wrong
of the hash table, hash values are incorrect or malicious. with the performance of the hash table, hash values are incorrect or malicious.
.TP .TP
.I rrset.cache.max_collisions .I rrset.cache.max_collisions
The maximum number of hash table collisions in the rrset cache. This is the The maximum number of hash table collisions in the rrset cache. This is the
number of hashes that are identical when a new element is inserted in the number of hashes that are identical when a new element is inserted in the
hash table. If the value is very large, something is wrong with the performance hash table. If the value is very large, like hundreds, something is wrong
of the hash table, hash values are incorrect or malicious. with the performance of the hash table, hash values are incorrect or malicious.
.TP .TP
.I dnscrypt_shared_secret.cache.count .I dnscrypt_shared_secret.cache.count
The number of items in the shared secret cache. These are precomputed shared The number of items in the shared secret cache. These are precomputed shared