gcc/testsuite/gcc.dg/tree-ssa/bitops-10.c

   1 /* { dg-do compile } */
   2 /* { dg-options "-O1 -fdump-tree-optimized-raw" } */
   3 /* PR tree-optimization/115449 */
   4
   5 void setBit_un(unsigned char *a, int b) {
   6    unsigned char c = 0x1UL << b;
   7    *a &= ~c;
   8    *a |= c;
   9 }
  10
  11 void setBit_sign(signed char *a, int b) {
  12    signed char c = 0x1UL << b;
  13    *a &= ~c;
  14    *a |= c;
  15 }
  16
  17 void setBit(char *a, int b) {
  18    char c = 0x1UL << b;
  19    *a &= ~c;
  20    *a |= c;
  21 }
  22 /*
  23    All three should produce:
  24     _1 = 1 << b_4(D);
  25     c_5 = (cast) _1;
  26     _2 = *a_7(D);
  27     _3 = _2 | c_5;
  28     *a_7(D) = _3;
  29    Removing the `&~c` as we are matching `(~x & y) | x` -> `x | y`
  30    match pattern even with extra casts are being involved. */
  31
  32 /* { dg-final { scan-tree-dump-not "bit_not_expr, " "optimized" } } */
  33 /* { dg-final { scan-tree-dump-not "bit_and_expr, " "optimized" } } */
  34 /* { dg-final { scan-tree-dump-times "bit_ior_expr, " 3 "optimized" } } */