From the source code, I see that a StackDepotNode is inserted into the
hash table maintained by StackDepot, but I don't see any code that
removes a node from the hash table. Is this hash table only growing
without shrinking?
I encountered an issue where the program becomes abnormally slow over
time when running under tsan. Based on my tests, the main overhead is in
the function StackDepotBase<Node, kReservedBits, kTabSizeLog>::Put.
Could this be because the bucket size of the hash table is fixed, and
as the number of entries increases, the lookup performance of the hash
table significantly degrades?