tree 0fc1edf73a3e25f685e256dfbdf64371100a9060
parent 89453ed6f2059b5cec576fc41914def713fe38f7
author Roman Lebedev <lebedev.ri@gmail.com> 1638257780 +0300
committer Roman Lebedev <lebedev.ri@gmail.com> 1638258476 +0300
gpgsig -----BEGIN PGP SIGNATURE-----
 
 iQIzBAABCgAdFiEEjkF6151RK40WXe2HCDw+u0oWieAFAmGl1ywACgkQCDw+u0oW
 ieAIZQ//aL9MbGFvwrhMmAnLjLgJCerWPWktMzUMkJOWfS7fSNX5lUGLrk65r7O3
 95A2md85EID9tfA1VJnWOkD53aLkC97kDxQf20SS948syVZUyLHzuP0JEsnI7gXC
 UgzoJ1Ydcj1hD96oq+O5LcrnVrh/sjjWTsomwU81D/EzW+KAjOihT5jq6i2jZWsy
 2mbf/4KuRrLfR4or4BnZb5q7s9d85LUGKbHRpKbcvkMpl8LSTjIt9IqzwlhQc5XL
 NeaGMKACaZ/QRCVkCYHhy+eBgYoRxiIevU/IEn2Wl9wDioBjeHJiNogKfOYp6JIp
 C2Ex6RMyn8a751YFrPS0wxknH8OCBWzIEbnFSAIBWGoR1W/DqgHciXjyMhl8KA3M
 CM8xva9wzw4W1CR/kfmgwSlP07+nSmzjfPD9DQJrmGhKiRyVcCb8CLjrrs/1M/pm
 U42+OkIR2tR9B5fpLur2hpfTPEEtv9J+DpK062J4Ib9xSTykwRAKWj9r7vltbXru
 8CfnZnXalw1luwTwccU78l29sJOiQqJ8P0MFgoCK08SmXMD8VbU2PF2aLUICFuEi
 CCEOsgD4on9XN7mB+dF4TzfEw1EXckcKGpDjNkOULYSkpPp3cEkbdtpTlBH4mBvV
 jCIwbnO7qW065/S/e+2rYf5yVBntJfEsuWbU1cM612HgZy92fiY=
 =aV0u
 -----END PGP SIGNATURE-----

[X86][LoopVectorize] "Fix" `X86TTIImpl::getAddressComputationCost()`

We ask `TTI.getAddressComputationCost()` about the cost of computing vector address,
and then multiply it by the vector width. This doesn't make any sense,
it implies that we'd do a vector GEP and then scalarize the vector of pointers,
but there is no such thing in the vectorized IR, we perform scalar GEP's.

This is *especially* bad on X86, and was effectively prohibiting any scalarized
vectorization of gathers/scatters, because `X86TTIImpl::getAddressComputationCost()`
says that cost of vector address computation is `10` as compared to `1` for scalar.

The computed costs are similar to the ones with D111222+D111220,
but we end up without masked memory intrinsics that we'd then have to
expand later on, without much luck. (D111363)

Differential Revision: https://reviews.llvm.org/D111460