{"push_id":1438759927,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bb03f57f04083e85f64c6e65fd050f9db3272e96","before":"da70d5a32a83f370626b72c085e82908b90f1798","commits":[{"sha":"bb03f57f04083e85f64c6e65fd050f9db3272e96","author":{"name":"Sanjay Patel","email":"8a358757f1b64d62facccc1fd839683fb6856b45@rotateright.com"},"message":"[TargetLowering] add special-case for demanded bits analysis of 'not'\n\nWe treat bitwise 'not' as a special operation and try not to reduce its all-ones mask. \nPresumably, this is because a 'not' may be cheaper than a generic 'xor' or it may get\nfolded into another logic op if the target has those. However, if we can remove a logic\ninstruction by changing the xor's constant mask value, that should always be a win.\n\nNote that the IR version of SimplifyDemandedBits() does not treat 'not' as a special-case\ncurrently (although that's marked with a FIXME). So if you run this IR through -instcombine,\nyou should get the same end result. I'm hoping to add a different backend transform that \nwill expose this problem though, so I need to solve this first.\n\nDifferential Revision: https://reviews.llvm.org/D27356\n\n\ngit-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@288676 91177308-0d34-0410-b5e6-96231b3b80d8","distinct":true,"url":"https://api.github.com/repos/llvm-project/llvm/commits/bb03f57f04083e85f64c6e65fd050f9db3272e96"}]}
{"actor":{"display_login":"chapuni"}}