tree lhs_type = TREE_TYPE (lhs);
/* In GIMPLE the type of the MEM_REF specifies the alignment. The
required alignment (power) is 4 bytes regardless of data type. */
- tree align_ltype = build_aligned_type (lhs_type, 4);
+ tree align_ltype = build_aligned_type (lhs_type, 32);
/* POINTER_PLUS_EXPR wants the offset to be of type 'sizetype'. Create
the tree using the value from arg0. The resulting type will match
the type of arg1. */
tree arg2_type = ptr_type_node;
/* In GIMPLE the type of the MEM_REF specifies the alignment. The
required alignment (power) is 4 bytes regardless of data type. */
- tree align_stype = build_aligned_type (arg0_type, 4);
+ tree align_stype = build_aligned_type (arg0_type, 32);
/* POINTER_PLUS_EXPR wants the offset to be of type 'sizetype'. Create
the tree using the value from arg1. */
gimple_seq stmts = NULL;
--- /dev/null
+/* { dg-require-effective-target powerpc_vsx_ok } */
+/* { dg-options "-mvsx -O2 -fprefetch-loop-arrays" } */
+
+/* Verify there is no ICE or hanging. */
+
+#include <altivec.h>
+
+void b(float *c, vector float a, vector float, vector float)
+{
+ vector float d;
+ vector char ahbc;
+ vec_xst(vec_perm(a, d, ahbc), 0, c);
+}
+
+vector float e(vector unsigned);
+
+void f() {
+ float *dst;
+ int g = 0;
+ for (;; g += 16) {
+ vector unsigned m, i;
+ vector unsigned n, j;
+ vector unsigned k, l;
+ b(dst + g * 3, e(m), e(n), e(k));
+ b(dst + (g + 4) * 3, e(i), e(j), e(l));
+ }
+}
if (delta >= (HOST_WIDE_INT) cache_line_size)
return false;
+ gcc_assert (align_unit > 0);
+
miss_positions = 0;
total_positions = (cache_line_size / align_unit) * distinct_iters;
max_allowed_miss_positions = (ACCEPTABLE_MISS_RATE * total_positions) / 1000;
return t;
}
-/* Create a variant of type T with alignment ALIGN. */
+/* Create a variant of type T with alignment ALIGN which
+ is measured in bits. */
tree
build_aligned_type (tree type, unsigned int align)