1 /* PR tree-optimization/51581 */
6 unsigned int c[8], d[8];
92 for (i = 0; i < 8; i++)
100 for (i = 0; i < 8; i++)
101 if (a[i] != b[i] / 8 || c[i] != d[i] / 3)
105 for (i = 0; i < 8; i+= 2)
106 if (a[i] != b[i] / 8 || a[i + 1] != b[i + 1] / 4
107 || c[i] != d[i] / 3 || c[i + 1] != d[i + 1] / 5)
111 for (i = 0; i < 8; i+= 2)
112 if (a[i] != b[i] / 14 || a[i + 1] != b[i + 1] / 15
113 || c[i] != d[i] / (i == 6 ? 13 : 6) || c[i + 1] != d[i + 1] / 5)
118 /* { dg-final { cleanup-tree-dump "vect" } } */