| 1 |
/* { dg-do compile } */ |
| 2 |
/* { dg-options "-fharden-conditional-branches -fharden-compares -fdump-tree-hardcbr -fdump-tree-hardcmp -ffat-lto-objects" } */ |
| 3 |
|
| 4 |
int f(int i, int j, int k, int l) { |
| 5 |
if (i == 0) |
| 6 |
return (j != 0) + l; |
| 7 |
else |
| 8 |
return (i * j != 0) * k; |
| 9 |
} |
| 10 |
|
| 11 |
/* { dg-final { scan-tree-dump-times "Splitting edge" 2 "hardcbr" } } */ |
| 12 |
/* { dg-final { scan-tree-dump-times "Adding reversed compare" 2 "hardcbr" } } */ |
| 13 |
/* { dg-final { scan-tree-dump-times "__builtin_trap" 2 "hardcbr" } } */ |
| 14 |
|
| 15 |
/* { dg-final { scan-tree-dump-times "Splitting block" 2 "hardcmp" } } */ |
| 16 |
/* { dg-final { scan-tree-dump-times "Adding reversed compare" 2 "hardcmp" } } */ |
| 17 |
/* { dg-final { scan-tree-dump-times "__builtin_trap" 4 "hardcmp" } } */ |
| 18 |
|
| 19 |
/* Check that the optimization barrier is placed before the original compare. */ |
| 20 |
/* { dg-final { scan-tree-dump-times {__asm__[(]"" : "=g" _[0-9]* : "0" i_[0-9]*[(]D[)][)][;][\n][ ]*if [(]i_[0-9]*[(]D[)] == 0[)]} 1 "hardcbr" } } */ |
| 21 |
/* { dg-final { scan-tree-dump-times {if [(]_[0-9]* != 0[)]} 2 "hardcbr" } } */ |
| 22 |
|
| 23 |
/* { dg-final { scan-tree-dump-times {__asm__[(]"" : "=g" _[0-9]* : "0" j_[0-9]*[(]D[)][)][;][\n][ ]*_[0-9]* = j_[0-9]*[(]D[)] != 0;[\n] *_[0-9]* = _[0-9]* == 0} 1 "hardcmp" } } */ |
| 24 |
/* { dg-final { scan-tree-dump-times {__asm__[(]"" : "=g" _[0-9]* : "0" _[0-9]*[)][;][\n][ ]*_[0-9]* = _[0-9]* != 0;[\n] *_[0-9]* = _[0-9]* == 0} 1 "hardcmp" } } */ |