+2009-07-07 Richard Guenther <rguenther@suse.de>
+
+ PR middle-end/40328
+ PR tree-optimization/40669
+ * tree-tailcall.c (adjust_accumulator_values): Properly
+ set DECL_GIMPLE_REG_P.
+ (adjust_return_value): Likewise.
+ (tree_optimize_tail_calls_1): Likewise.
+ * fold-const.c (fold_convert): Fold the built COMPLEX_EXPR.
+
2009-07-02 Richard Guenther <rguenther@suse.de>
PR middle-end/40585
case POINTER_TYPE: case REFERENCE_TYPE:
case REAL_TYPE:
case FIXED_POINT_TYPE:
- return build2 (COMPLEX_EXPR, type,
- fold_convert (TREE_TYPE (type), arg),
- fold_convert (TREE_TYPE (type), integer_zero_node));
+ return fold_build2 (COMPLEX_EXPR, type,
+ fold_convert (TREE_TYPE (type), arg),
+ fold_convert (TREE_TYPE (type), integer_zero_node));
case COMPLEX_TYPE:
{
tree rpart, ipart;
+2009-07-07 Richard Guenther <rguenther@suse.de>
+
+ PR middle-end/40328
+ PR tree-optimization/40669
+ * gcc.dg/pr40669.c: New testcase.
+ * gcc.dg/torture/pr40328.c: Likewise.
+
2009-07-03 Jerry DeLisle <jvdelisle@gcc.gnu.org>
PR fortran/40638
--- /dev/null
+/* PR middle-end/40669 */
+/* { dg-do compile } */
+/* { dg-options "-O2 -ffast-math" } */
+
+double _Complex
+test (int d, int t, double *x, double *y, double *z, int n,
+ double _Complex (*fnp) (double))
+{
+ int m = n / 2;
+ double min = y[t], max = z[t], med = x[m * d + t];
+ double _Complex result = 0.0;
+
+ if (n == 0)
+ return 0.0;
+
+ if (min > med)
+ result += test (d, (t + 1) % d, x + (m + 1) * d, y, z, n - m - 1, fnp);
+ else if (max < med)
+ result += test (d, (t + 1) % d, x, y, z, m, fnp);
+ else
+ {
+ result += fnp (y[0] + x[m]);
+ result += test (d, (t + 1) % d, x + (m + 1) * d, y, z, n - m - 1, fnp);
+ }
+ return result;
+}
+
--- /dev/null
+/* { dg-do compile } */
+/* { dg-options "-fno-tree-sra" } */
+
+_Complex float foo(void)
+{
+ _Complex float a[64] = {};
+ _Complex float x;
+ x = a[1];
+ return x;
+}
+
m_acc, a));
tmp = create_tmp_var (ret_type, "acc_tmp");
+ if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
+ || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
+ DECL_GIMPLE_REG_P (tmp) = 1;
add_referenced_var (tmp);
var = make_ssa_name (tmp, stmt);
m_acc, ret_var));
tmp = create_tmp_var (ret_type, "acc_tmp");
+ if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
+ || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
+ DECL_GIMPLE_REG_P (tmp) = 1;
add_referenced_var (tmp);
var = make_ssa_name (tmp, stmt);
a_acc, var));
tmp = create_tmp_var (ret_type, "acc_tmp");
+ if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
+ || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
+ DECL_GIMPLE_REG_P (tmp) = 1;
add_referenced_var (tmp);
var = make_ssa_name (tmp, stmt);
ret_type = TREE_TYPE (DECL_RESULT (current_function_decl));
tmp = create_tmp_var (ret_type, "add_acc");
+ if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
+ || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
+ DECL_GIMPLE_REG_P (tmp) = 1;
add_referenced_var (tmp);
phi = create_phi_node (tmp, first);
ret_type = TREE_TYPE (DECL_RESULT (current_function_decl));
tmp = create_tmp_var (ret_type, "mult_acc");
+ if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
+ || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
+ DECL_GIMPLE_REG_P (tmp) = 1;
add_referenced_var (tmp);
phi = create_phi_node (tmp, first);