tree fb2782ce63c2cd227340c3dcf0517f644e100c83
parent eef978290ccb847c67bf0431e5fdd1dc4c7d408d
author Peter Collingbourne <peter@pcc.me.uk> 1744849190 -0700
committer GitHub <noreply@github.com> 1744849190 -0700
gpgsig -----BEGIN PGP SIGNATURE-----
 
 wsFcBAABCAAQBQJoAEkmCRC1aQ7uu5UhlAAA48EQAE1bXwmtaHeBFrovXe/OYarm
 Vbcd1L873mZqcqJZotL5HVNXD5HBOpCKNWb9+geU6xrKtIJJJtt1c2iBlJCtgt7I
 9bn+ua2zyUw6AoFEMmtFGoqO+p1Rm+KzPqKzuMyqvp1a2tN00umqw9CtK6BUXtrk
 65Za9pldhZPt+KVSsm44j9Hby7TtV2DaXpS/rS8sl+cEeh8nnA3Z/udYKx//hxSC
 z8JgWcyerMVH6QFpq37Xy/V3Z7LAvQTTmG4PwYYZVi+6APwYHeLqJgZXboz341cf
 p35vGa5B0HxiXvhlk1mbykO16QUcJa/Uc1X20WrhKAtYNWyHeauNFrTxAhYunzpM
 0w17pPGSqGW3/2CIpnQPr6Kz69+YLIc7uK0lOUJoJS5C/2iUodVMH/wUj/Jej9hv
 b1aO4bxPHNp7gS6UyyMTAWGI/uEM90IioF/CvkrvBV6jdl6t2g+onOjUE/Dz3LF8
 ULvxYn8tz2wNvu9NHiW95pgPACiw6pNIH62llVX0n+wWGO8DWTfdn1VFvBznAoQD
 Rs3sCls0+7a5c5ROmxpBpXOd0rpJFyiB5pyRdwapDrF2N9CvJ2nkzl525EI38ZqZ
 cM12RcWV1TasPiD/CW00UJVS77LvYBszfVzMUP6OlFQwvvvBoNfnxe1dsyoOhUQK
 Xdgy3elwZn6+GTfF8JKf
 =nnh3
 -----END PGP SIGNATURE-----
 

LowerTypeTests: Fix quadratic complexity (try 2).

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.

Reland of #135875 with fix for bug that caused check-lld test failures.
The fix is to only remove functions from llvm.used/llvm.compiler.used
because buildBitSetsFromGlobalVariables, which now runs while
ScopedSaveAliaseesAndUsed is in scope, will delete global variables,
which would otherwise lead to a use-after-free when they are added
back to llvm.used or llvm.compiler.used.

Reviewers: fmayer, vitalybuka

Reviewed By: fmayer

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