New testcase. If one side of and/or is known to be 0/-1, it doesn't matter

if the other side is overdefined.

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

diff --git a/test/Transforms/SCCP/logical-nuke.ll b/test/Transforms/SCCP/logical-nuke.ll
new file mode 100644 (file)
index 0000000..5b4f842
--- /dev/null
+++ b/test/Transforms/SCCP/logical-nuke.ll
@@ -0,0 +1,8 @@
+; RUN: llvm-as < %s | opt -sccp | llvm-dis | grep 'ret int 0'
+
+; Test that SCCP has basic knowledge of when and/or nuke overdefined values.
+
+int %test(int %X) {
+       %Y = and int %X, 0
+       ret int %Y
+}