gcc/testsuite/gcc.dg/tree-ssa/cmpbit-1.c

   1 /* { dg-do compile } */
   2 /* { dg-options "-O1 -fno-tree-reassoc -fdump-tree-optimized-raw" } */
   3 _Bool f(int a, int b)
   4 {
   5   _Bool c = a > b;
   6   _Bool d = a >= b;
   7   return c & d;
   8 }
   9
  10 _Bool f1(int a, int b)
  11 {
  12   _Bool c = a > b;
  13   _Bool d = a >= b;
  14   return c | d;
  15 }
  16
  17 _Bool g(int a, int b)
  18 {
  19   _Bool c = a < b;
  20   _Bool d = a <= b;
  21   return c & d;
  22 }
  23
  24 _Bool g1(int a, int b)
  25 {
  26   _Bool c = a < b;
  27   _Bool d = a <= b;
  28   return c | d;
  29 }
  30
  31
  32 /* We should be able to optimize these without reassociation too. */
  33 /* { dg-final { scan-tree-dump-not "bit_and_expr," "optimized" } } */
  34 /* { dg-final { scan-tree-dump-not "bit_ior_expr," "optimized" } } */
  35 /* { dg-final { scan-tree-dump-times "gt_expr," 1 "optimized" } } */
  36 /* { dg-final { scan-tree-dump-times "ge_expr," 1 "optimized" } } */
  37 /* { dg-final { scan-tree-dump-times "lt_expr," 1 "optimized" } } */
  38 /* { dg-final { scan-tree-dump-times "le_expr," 1 "optimized" } } */