On 4/26/23 21:27, Andrew MacLeod wrote:
Sparsely used ssa caches can benefit from using a bitmap to determine if
a name already has an entry. The path_query class was already managing
something like this internally, but there is benefit to making it
generally available.
ssa_lazy_cache inherits from ssa_cache and adds management of the
bitmap. The self-managed version in path_query has been removed,
cleaned up, and replaced with this lazy version. It is also now used in
"assume_query" processing.
All 5 patches combined produce about
- a 0.4% speedup in total compilation time,
- about a 1% speedup in VRP
- and threading picks up a more impressive 13% improvement.
That's very cool, btw. Thanks for working on this.
Aldy
