Initial checkin of GCC 4.9.0 from trunk (r208799).

Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba

1 files changed, 49 insertions, 0 deletions

diff --git a/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/pr22026.c b/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/pr22026.c
new file mode 100644
index 000000000..7e6914d9d
--- /dev/null
+++ b/gcc-4.9/gcc/testsuite/gcc.dg/tree-ssa/pr22026.c
@@ -0,0 +1,49 @@
+/* PR tree-optimization/22026
+   VRP used think that ~[0,0] + ~[0,0] = ~[0,0], which is wrong.  The
+   same applies to subtraction and unsigned multiplication.  */
+
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-vrp1" } */
+
+int
+plus (int x, int y)
+{
+  if (x != 0)
+    if (y != 0)
+      {
+        int z = x + y;
+        if (z != 0)
+          return 1;
+      }
+  return 0;
+}
+
+int
+minus (int x, int y)
+{
+  if (x != 0)
+    if (y != 0)
+      {
+        int z = x - y;
+        if (z != 0)
+          return 1;
+      }
+  return 0;
+}
+
+int
+mult (unsigned x, unsigned y)
+{
+  if (x != 0)
+    if (y != 0)
+      {
+	unsigned z = x * y;
+	if (z != 0)
+	  return 1;
+      }
+  return 0;
+}
+
+/* None of the predicates can be folded in these functions.  */
+/* { dg-final { scan-tree-dump-times "Folding predicate" 0 "vrp1" } } */
+/* { dg-final { cleanup-tree-dump "vrp1" } } */