Changes

Summary

[NVPTX][AsmPrinter] Avoid removing globals before calling AsmPrinter::doFinalization() (details)
[DSE] Optimize defining access of defs while walking upwards. (details)
[ARM] Extra testing for v2i1 types. NFC (details)
[SCEV] Simplify invalidation after BE count calculation (NFCI) (details)

Commit 9f374a74c2aabed998a731ac9f14bd8baa4208ba by kbessonova [NVPTX][AsmPrinter] Avoid removing globals before calling AsmPrinter::doFinalization() Instead of removing globals from a module, we, it seems, can just override AsmPrinter::emitGlobalVariable() to do nothing as NVPTXAsmPrinter already emitted globals by this time and we don't want to do it twice. Reviewed By: tra Differential Revision: https://reviews.llvm.org/D113653
	llvm/lib/Target/NVPTX/NVPTXAsmPrinter.cpp
	llvm/lib/Target/NVPTX/NVPTXAsmPrinter.h
Commit 25dad1064bf14b9a24c6e33ef4a9e7f8e951c1e3 by flo [DSE] Optimize defining access of defs while walking upwards. This patch extends the code that walks memory defs upwards to find clobbering accesses to also try to optimize the clobbering defining access. We should be able to find set the optimized access of our starting def (KillingDef), if the following holds: 1. It is the first call of getDomMemoryDef for KillingDef (so Current == KillingDef->getDefiningAccess(). 2. No potentially aliasing defs are skipped. Then if a (partly) aliasing def is encountered, it can be used as optimized access for KillingDef. No further optimizations can be applied to KillingDef. I'd appreciate a careful look, as the existing documentation is not too clear on what is expected for optimized accesses. The motivation for this patch is to use the optimized accesses to cover more cases of redundant stores as follow-up to D111727. Reviewed By: nikic Differential Revision: https://reviews.llvm.org/D112313
	llvm/lib/Transforms/Scalar/DeadStoreElimination.cpp
Commit 1b2d58ba90cd72a8dfe1535b5fbecbefacc30016 by david.green [ARM] Extra testing for v2i1 types. NFC This adds extra tests for various operations from making the v2i1 type legal.
	llvm/test/CodeGen/Thumb2/mve-pred-spill.ll
	llvm/test/CodeGen/Thumb2/mve-vpsel.ll
	llvm/test/CodeGen/Thumb2/mve-vcmp.ll
	llvm/test/CodeGen/Thumb2/mve-vmovimm.ll
	llvm/test/CodeGen/Thumb2/active_lane_mask.ll
	llvm/test/CodeGen/Thumb2/mve-pred-shuffle.ll
	llvm/test/CodeGen/Thumb2/mve-pred-ext.ll
Commit c2550e342732d029c3a8ae1eff764d68b1abfc59 by nikita.ppv [SCEV] Simplify invalidation after BE count calculation (NFCI) After backedge taken counts have been calculated, we want to invalidate all addrecs and dependent expressions in the loop, because we might compute better results with the newly available backedge taken counts. Previously this was done with a forgetLoop() style use-def walk. With recent improvements to SCEV invalidation, we can instead directly invalidate any SCEVs using addrecs in this loop. This requires a great deal less subtlety to avoid invalidating more than necessary, and in particular gets rid of the hack from D113349. The change is similar to D114263 in spirit.
	llvm/lib/Analysis/ScalarEvolution.cpp
	llvm/include/llvm/Analysis/ScalarEvolution.h