/* Nested function decomposition for trees.
- Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
+ Copyright (C) 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
This file is part of GCC.
walk_body (callback, info, &DECL_SAVED_TREE (info->context));
}
+/* Invoke CALLBACK on OMP_FOR init, cond, incr and pre-body. */
+
+static void
+walk_omp_for (walk_tree_fn callback, struct nesting_info *info, tree for_stmt)
+{
+ struct walk_stmt_info wi;
+ tree t, list = NULL, empty;
+
+ walk_body (callback, info, &OMP_FOR_PRE_BODY (for_stmt));
+
+ empty = build_empty_stmt ();
+ append_to_statement_list_force (empty, &list);
+ memset (&wi, 0, sizeof (wi));
+ wi.callback = callback;
+ wi.info = info;
+ wi.tsi = tsi_last (list);
+
+ t = OMP_FOR_INIT (for_stmt);
+ gcc_assert (TREE_CODE (t) == GIMPLE_MODIFY_STMT);
+ SET_EXPR_LOCUS (empty, EXPR_LOCUS (t));
+ wi.val_only = false;
+ walk_tree (&GIMPLE_STMT_OPERAND (t, 0), callback, &wi, NULL);
+ wi.val_only = true;
+ wi.is_lhs = false;
+ walk_tree (&GIMPLE_STMT_OPERAND (t, 1), callback, &wi, NULL);
+
+ t = OMP_FOR_COND (for_stmt);
+ gcc_assert (COMPARISON_CLASS_P (t));
+ SET_EXPR_LOCUS (empty, EXPR_LOCUS (t));
+ wi.val_only = false;
+ walk_tree (&TREE_OPERAND (t, 0), callback, &wi, NULL);
+ wi.val_only = true;
+ wi.is_lhs = false;
+ walk_tree (&TREE_OPERAND (t, 1), callback, &wi, NULL);
+
+ t = OMP_FOR_INCR (for_stmt);
+ gcc_assert (TREE_CODE (t) == GIMPLE_MODIFY_STMT);
+ SET_EXPR_LOCUS (empty, EXPR_LOCUS (t));
+ wi.val_only = false;
+ walk_tree (&GIMPLE_STMT_OPERAND (t, 0), callback, &wi, NULL);
+ t = GIMPLE_STMT_OPERAND (t, 1);
+ gcc_assert (BINARY_CLASS_P (t));
+ wi.val_only = false;
+ walk_tree (&TREE_OPERAND (t, 0), callback, &wi, NULL);
+ wi.val_only = true;
+ wi.is_lhs = false;
+ walk_tree (&TREE_OPERAND (t, 1), callback, &wi, NULL);
+
+ /* Remove empty statement added above from the end of statement list. */
+ tsi_delink (&wi.tsi);
+ append_to_statement_list (list, &OMP_FOR_PRE_BODY (for_stmt));
+}
+
/* Similarly for ROOT and all functions nested underneath, depth first. */
static void
break;
case OMP_FOR:
+ save_suppress = info->suppress_expansion;
+ convert_nonlocal_omp_clauses (&OMP_FOR_CLAUSES (t), wi);
+ walk_omp_for (convert_nonlocal_reference, info, t);
+ walk_body (convert_nonlocal_reference, info, &OMP_FOR_BODY (t));
+ info->suppress_expansion = save_suppress;
+ break;
+
case OMP_SECTIONS:
case OMP_SINGLE:
save_suppress = info->suppress_expansion;
break;
case OMP_FOR:
+ save_suppress = info->suppress_expansion;
+ convert_local_omp_clauses (&OMP_FOR_CLAUSES (t), wi);
+ walk_omp_for (convert_local_reference, info, t);
+ walk_body (convert_local_reference, info, &OMP_FOR_BODY (t));
+ info->suppress_expansion = save_suppress;
+ break;
+
case OMP_SECTIONS:
case OMP_SINGLE:
save_suppress = info->suppress_expansion;
break;
case OMP_FOR:
+ walk_body (convert_call_expr, info, &OMP_FOR_PRE_BODY (t));
+ /* FALLTHRU */
case OMP_SECTIONS:
case OMP_SECTION:
case OMP_SINGLE:
--- /dev/null
+/* PR middle-end/33880 */
+/* { dg-do run } */
+
+extern void abort (void);
+
+void
+test1 (void)
+{
+ int i = 0, j = 0;
+ void bar (void)
+ {
+ i++;
+ j++;
+ }
+ bar ();
+ #pragma omp parallel for num_threads(4)
+ for (i = 0; i < 100; i++)
+ #pragma omp atomic
+ j += 1;
+ if (j != 101)
+ abort ();
+ #pragma omp parallel for lastprivate(i) num_threads(2)
+ for (i = 0; i < 100; i++)
+ #pragma omp atomic
+ j += 1;
+ if (i != 100)
+ abort ();
+ i = 3;
+ bar ();
+ if (j != 202)
+ abort ();
+ if (i != 4)
+ abort ();
+}
+
+void
+test2 (void)
+{
+ int i = -1, j = 99, k, l = 9, m = 0;
+ void bar (void)
+ {
+ i++;
+ j++;
+ l++;
+ m++;
+ }
+ bar ();
+ #pragma omp parallel for num_threads(4)
+ for (k = i; k < j; k += l)
+ #pragma omp atomic
+ m += 1;
+ bar ();
+ if (i != 1 || j != 101 || l != 11 || m != 12)
+ abort ();
+}
+
+void
+test3 (void)
+{
+ int i, j, k, l, m;
+ void bar (void)
+ {
+ #pragma omp parallel for num_threads(4)
+ for (i = j; i < k; i += l)
+ #pragma omp atomic
+ m += 1;
+ }
+ void baz (void)
+ {
+ #pragma omp parallel for num_threads(2) lastprivate(i)
+ for (i = j; i < k * 2; i += l / 2)
+ #pragma omp atomic
+ m += 1;
+ }
+ i = 7;
+ j = 0;
+ k = 100;
+ l = 2;
+ m = 0;
+ bar ();
+ if (j != 0 || k != 100 || l != 2 || m != 50)
+ abort ();
+ baz ();
+ if (i != 200 || j != 0 || k != 100 || l != 2 || m != 250)
+ abort ();
+}
+
+void
+test4 (void)
+{
+ int i, j, k, l, m = 0;
+ int foo (void)
+ {
+ return j;
+ }
+ int bar (void)
+ {
+ return k;
+ }
+ int baz (void)
+ {
+ return l;
+ }
+ j = 0;
+ k = 1000;
+ l = 2;
+ #pragma omp parallel for num_threads(8) lastprivate(i)
+ for (i = foo (); i < bar (); i += baz ())
+ #pragma omp atomic
+ m += 1;
+ if (i != 1000 || m != 500 || j != 0 || k != 1000 || l != 2)
+ abort ();
+}
+
+int
+main (void)
+{
+ test1 ();
+ test2 ();
+ test3 ();
+ test4 ();
+ return 0;
+}