tree abb104ee4e7b8fd3f25181f164f62caf76912223
parent 150b0bedb7f0aa3af89dbd75a3f046b76260c191
author Roman Lebedev <lebedev.ri@gmail.com> 1571604726 +0000
committer Roman Lebedev <lebedev.ri@gmail.com> 1571604726 +0000

[InstCombine] conditional sign-extend of high-bit-extract: 'or' pattern.

In this pattern, all the "magic" bits that we'd `add` are all
high sign bits, and in the value we'd be adding to they are all unset,
not unexpectedly, so we can have an `or` there:
https://rise4fun.com/Alive/ups

It is possible that `haveNoCommonBitsSet()` should be taught about this
pattern so that we never have an `add` variant, but the reasoning would
need to be recursive (because of that `select`), so i'm not really sure
that would be worth it just yet.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@375378 91177308-0d34-0410-b5e6-96231b3b80d8