tree 7686d75276acd73fe36e46fdfdc51e390e16e88f
parent af63e1b505453de3e6a281d1b72e62fa8d396b23
author Peter Collingbourne <peter@pcc.me.uk> 1744758183 -0700
committer GitHub <noreply@github.com> 1744758183 -0700
gpgsig -----BEGIN PGP SIGNATURE-----
 
 wsFcBAABCAAQBQJn/uWnCRC1aQ7uu5UhlAAA/OoQACN3o611t/x9Gu872gWUlFpI
 r/rz+ShQd+fuPTlEctRWwa3ZOnCFgSaivugZikXMfqFOvO82KzLYioEl3KltTssd
 95ebO+y9kwp60fut6w9Uc3pPQnDXu8fyRHpFGxJs9MK6yLaicsCdZZLCAbxJVmU9
 q1hFET7eFnqAwBVKzmZ9d+n5o7DsnL0rDgvkH1QMksMCXmDlmczhAGSvx4i+Ofgu
 IiiZk/ySddf+5uRRazFpP+dqYi/T7SHAY4JxtVALNFIgiyjmjcQJN//z119RJ7Az
 GxHhIQxiOPYSBpGp6fV/Mf9hMPuObqXmPD2AWO9bf/kh55HAE1LmqgPP2MbrUFsi
 HJ4pPXOe7lldwLXW9JJiajyGxPvEV6ICLr9IVYMLAoOUs5MI3rANQ0Z4Xel0EBCf
 Nd5YQLozNQc5GioCq7zM69LikUjgpq85J4/ZVhlV3NufRwDqBroJvDjq9YcNo7Mx
 qANSEmRDy25Acl1kBmO8zJowSkIjS7tarmdFcXbAiD4nJtcmSKg1iuRyHyoByWX8
 WAsb8sJYIA3YHvM31C43RMDYzT/8pIetkIw7Q/f0ohTrw8IVuFydhlGm/y3BodF2
 fHNTRNCqkJ1r1VuQBgnydncZjd7sqgKNOLD+13oG/RnYHPy6ivAqHfgd/b2oIRnu
 HQe3LcBWf+w4f8sOklKT
 =BSCo
 -----END PGP SIGNATURE-----
 

LowerTypeTests: Fix quadratic complexity.

Currently we have quadratic complexity in LowerTypeTests because
ScopedSaveAliaseesAndUsed loops over all aliases for each disjoint
set, and the number of aliases and number of disjoint sets is
roughly proportional to the program size. Fix that by moving
ScopedSaveAliaseesAndUsed to LowerTypeTestsModule::lower() so that
we do this only once.

Reviewers: fmayer, vitalybuka

Reviewed By: vitalybuka

Pull Request: https://github.com/llvm/llvm-project/pull/135875