Viewing file:  pr65947-13.c (1.09 KB) -rw-r--r--
Select action/file-type:
 (+) |  (+) |  (+) | Code (+) | Session (+) |  (+) | SDB (+) |  (+) |  (+) |  (+) |  (+) |  (+) |
/* Disabling epilogues until we find a better way to deal with scans. */
/* { dg-additional-options "--param vect-epilogues-nomask=0" } */
/* { dg-require-effective-target vect_condition } */
#include "tree-vect.h"
extern void abort (void) __attribute__ ((noreturn));
#define N 32
/* Simple condition reduction with a reversed loop. */
int
condition_reduction (int *a, int min_v)
{
int last = -1;
for (int i = N-1; i >=0; i--)
if (a[i] < min_v)
last = i;
return last;
}
int
main (void)
{
int a[N] = {
17, 28, 13, 14, 15, 16, 17, 18, 19, 20,
1, 2, -3, 4, 5, 6, 7, -8, 9, 10,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32
};
check_vect ();
int ret = condition_reduction (a, 16);
if (ret != 2)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "LOOP VECTORIZED" 2 "vect" } } */
/* { dg-final { scan-tree-dump-times "condition expression based on integer induction." 2 "vect" { xfail vect_fold_extract_last } } } */
/* { dg-final { scan-tree-dump-times "optimizing condition reduction with FOLD_EXTRACT_LAST" 2 "vect" { target vect_fold_extract_last } } } */
|
