1  /* { dg-options "-O2 -fdump-tree-optimized" } */
       2  _Bool
       3  foo (_Bool a, _Bool b)
       4  {
       5    int c = 1 - a;
       6    int d = 1 - b;
       7    int e = c & d;
       8    return 1 - e;
       9  }
      10  
      11  _Bool
      12  bar (_Bool a, _Bool b)
      13  {
      14    int c = 1 - a;
      15    int d = 1 - b;
      16    _Bool e = c & d;
      17    return 1 - e;
      18  }
      19  
      20  _Bool
      21  baz (_Bool a, _Bool b)
      22  {
      23    _Bool c = 1 - a;
      24    _Bool d = 1 - b;
      25    _Bool e = c & d;
      26    return 1 - e;
      27  }
      28  
      29  /* { dg-final { scan-tree-dump-times "1 - " 0 "optimized" } } */
      30  /* { dg-final { scan-tree-dump-times "~a" 0 "optimized" } } */
      31  /* { dg-final { scan-tree-dump-times "~b" 0 "optimized" } } */
      32  /* { dg-final { scan-tree-dump-times "a_\[0-9\]+.D. \\\| b_\[0-9\]+.D." 3 "optimized" } } */
      33