| /* { dg-do compile } */ | |
| /* { dg-options "-O2 -fdump-tree-cunrolli-details" } */ | |
| int a[10]; | |
| int b[11]; | |
| t(int n) | |
| { | |
| int i; | |
| int sum = 0; | |
| for (i=0;i<n;i++) | |
| if (q()) | |
| sum+=a[i]; | |
| else | |
| sum+=b[i]; | |
| return sum; | |
| } | |
| /* { dg-final { scan-tree-dump "Found better loop bound 11" "cunrolli" } } */ | |
| /* { dg-final { scan-tree-dump "Loop 1 iterates at most 11 times" "cunrolli" } } */ | |
| /* { dg-final { cleanup-tree-dump "cunrolli" } } */ |