{"push_id":1344758677,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"f904ccd09c68acfca742856245f646afdf8c1b85","before":"3b4fbbeee860929f0ff5e9bf8b3fffda9cfea80f","commits":[{"sha":"f904ccd09c68acfca742856245f646afdf8c1b85","author":{"name":"Chad Rosier","email":"e952f8aa3e67effe457298fd1b65a8202b705b98@codeaurora.org"},"message":"[CVP] Convert an AShr to a LShr if 1st operand is known to be nonnegative.\n\nAn arithmetic shift can be safely changed to a logical shift if the first\noperand is known positive. This allows ComputeKnownBits (and similar analysis)\nto determine the sign bit of the shifted value in some cases. In turn, this\nallows InstCombine to canonicalize a signed comparison (a > 0) into an equality\ncheck (a != 0).\n\nPR30577\n\nDifferential Revision: https://reviews.llvm.org/D25119","distinct":true,"url":"https://api.github.com/repos/llvm-project/llvm-project/commits/f904ccd09c68acfca742856245f646afdf8c1b85"}]}
{"actor":{"display_login":"chapuni"}}