JIT throughput: SimplerHashTable

We have way more uses of SimplerHashTable than JIT32. It would be useful to understand more about these uses. E.g., how many hash table resizes happen? Do any users prime the expected hash table size based on some IR characteristic, and could they do so to avoid resizes? They all use JitSimplerHashBehavior; is this the right set of behaviors for all the hash tables? How much time/memory is taken in these hash table uses/creation/maintenance? How well is the hash table working, e.g., what is the table density, how long are the linked list chains, etc.

category:throughput theme:jit-coding-style skill-level:expert cost:small impact:medium