Reverting merge from trunk
[official-gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / vrp47.c
blob5a09fa0f49d56f5684b86db8825038d403429c25
1 /* Skip on MIPS/ARC, where LOGICAL_OP_NON_SHORT_CIRCUIT inhibits the setcc
2 optimizations that expose the VRP opportunity. */
3 /* Skip on S/390 and avr. Lower values in BRANCH_COST lead to two conditional
4 jumps when evaluating an && condition. VRP is not able to optimize
5 this. */
6 /* { dg-do compile { target { ! "mips*-*-* arc*-*-* s390*-*-* avr-*-* mn10300-*-*" } } } */
7 /* { dg-options "-O2 -fdump-tree-vrp1 -fdump-tree-dom1 -fdump-tree-vrp2" } */
8 /* { dg-additional-options "-march=i586" { target { { i?86-*-* x86_64-*-* } && ia32 } } } */
9 /* Skip on ARM Cortex-M, where LOGICAL_OP_NON_SHORT_CIRCUIT is set to false,
10 leading to two conditional jumps when evaluating an && condition. VRP is
11 not able to optimize this. */
12 /* { dg-skip-if "" { arm_cortex_m } } */
14 int h(int x, int y)
16 if ((x >= 0 && x <= 1) && (y >= 0 && y <= 1))
17 return x && y;
18 else
19 return -1;
22 int g(int x, int y)
24 if ((x >= 0 && x <= 1) && (y >= 0 && y <= 1))
25 return x || y;
26 else
27 return -1;
30 int f(int x)
32 if (x != 0 && x != 1)
33 return -2;
35 else
36 return !x;
39 /* Test that x and y are never compared to 0 -- they're always known to be
40 0 or 1. */
41 /* { dg-final { scan-tree-dump-times "\[xy\]\[^ \]* !=" 0 "vrp1" } } */
43 /* These two are fully simplified by VRP1. */
44 /* { dg-final { scan-tree-dump-times "x\[^ \]* \[|\] y" 1 "vrp1" } } */
45 /* { dg-final { scan-tree-dump-times "x\[^ \]* \\^ 1" 1 "vrp1" } } */
47 /* VRP2 gets rid of the remaining & 1 operations, x and y are always
48 either 0 or 1. */
49 /* { dg-final { scan-tree-dump-times " & 1;" 0 "vrp2" } } */
51 /* { dg-final { cleanup-tree-dump "vrp1" } } */
52 /* { dg-final { cleanup-tree-dump "dom1" } } */
53 /* { dg-final { cleanup-tree-dump "vrp2" } } */