Files
bind9/lib/dns
Ondřej Surý c13a1d8b01 Improve the reference counting checks in newref()
In qpcache (and rbtdb), there are some functions that acquire
neither the tree lock nor the node lock when calling newref().
In theory, this could lead to a race in which a new reference
is added to a node that was about to be deleted.

We now detect this condition by passing the current tree and node
lock status to newref(). If the node was previously unreferenced
and we don't hold at least one read lock, we will assert.
2024-04-30 08:41:56 +02:00
..
2024-02-26 12:02:40 +11:00
2023-10-13 14:44:40 +02:00
…
2024-03-08 15:36:56 -08:00
2024-02-14 13:24:56 +01:00
…
…
2024-03-08 15:36:56 -08:00
2024-01-25 15:37:40 +01:00
…
2024-02-14 13:24:56 +01:00
…
…
2024-02-08 08:01:58 +01:00
…
…
…
…
2024-03-08 15:36:56 -08:00
2024-02-14 13:24:56 +01:00
…
2024-04-02 10:35:56 +02:00
…
…
…
2024-03-08 15:36:56 -08:00
2024-03-06 09:57:24 +01:00
2024-04-10 22:51:07 -04:00
…
…
…
…
2024-04-23 13:11:52 +02:00
2024-04-10 22:51:07 -04:00
…
2023-10-13 14:44:40 +02:00
2023-11-21 14:48:43 +11:00
…
…
…
…
2024-01-05 11:16:12 +01:00
…
2024-01-25 14:48:07 +01:00
…
…