1 /* This file contains routines to construct and validate Cilk Plus
2 constructs within the C and C++ front ends.
4 Copyright (C) 2013-2015 Free Software Foundation, Inc.
5 Contributed by Aldy Hernandez <aldyh@redhat.com>.
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it
10 under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
14 GCC is distributed in the hope that it will be useful, but
15 WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17 General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
25 #include "coretypes.h"
29 #include "double-int.h"
39 /* Validate the body of a _Cilk_for construct or a <#pragma simd> for
42 Returns true if there were no errors, false otherwise. */
45 c_check_cilk_loop (location_t loc, tree decl)
47 if (TREE_THIS_VOLATILE (decl))
49 error_at (loc, "iteration variable cannot be volatile");
55 /* Validate and emit code for <#pragma simd> clauses. */
58 c_finish_cilk_clauses (tree clauses)
60 for (tree c = clauses; c; c = OMP_CLAUSE_CHAIN (c))
64 /* If a variable appears in a linear clause it cannot appear in
65 any other OMP clause. */
66 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LINEAR)
67 for (tree c2 = clauses; c2; c2 = OMP_CLAUSE_CHAIN (c2))
71 enum omp_clause_code code = OMP_CLAUSE_CODE (c2);
75 case OMP_CLAUSE_LINEAR:
76 case OMP_CLAUSE_PRIVATE:
77 case OMP_CLAUSE_FIRSTPRIVATE:
78 case OMP_CLAUSE_LASTPRIVATE:
79 case OMP_CLAUSE_REDUCTION:
82 case OMP_CLAUSE_SAFELEN:
89 if (OMP_CLAUSE_DECL (c) == OMP_CLAUSE_DECL (c2))
91 error_at (OMP_CLAUSE_LOCATION (c2),
92 "variable appears in more than one clause");
93 inform (OMP_CLAUSE_LOCATION (c),
94 "other clause defined here");
95 // Remove problematic clauses.
96 OMP_CLAUSE_CHAIN (prev) = OMP_CLAUSE_CHAIN (c2);
105 /* Calculate number of iterations of CILK_FOR. */
108 cilk_for_number_of_iterations (tree cilk_for)
110 tree t, v, n1, n2, step, type, init, cond, incr, itype;
111 enum tree_code cond_code;
112 location_t loc = EXPR_LOCATION (cilk_for);
114 init = TREE_VEC_ELT (OMP_FOR_INIT (cilk_for), 0);
115 v = TREE_OPERAND (init, 0);
116 cond = TREE_VEC_ELT (OMP_FOR_COND (cilk_for), 0);
117 incr = TREE_VEC_ELT (OMP_FOR_INCR (cilk_for), 0);
118 type = TREE_TYPE (v);
120 gcc_assert (TREE_CODE (TREE_TYPE (v)) == INTEGER_TYPE
121 || TREE_CODE (TREE_TYPE (v)) == POINTER_TYPE);
122 n1 = TREE_OPERAND (init, 1);
123 cond_code = TREE_CODE (cond);
124 n2 = TREE_OPERAND (cond, 1);
132 if (POINTER_TYPE_P (TREE_TYPE (n2)))
133 n2 = fold_build_pointer_plus_hwi_loc (loc, n2, 1);
135 n2 = fold_build2_loc (loc, PLUS_EXPR, TREE_TYPE (n2), n2,
136 build_int_cst (TREE_TYPE (n2), 1));
140 if (POINTER_TYPE_P (TREE_TYPE (n2)))
141 n2 = fold_build_pointer_plus_hwi_loc (loc, n2, -1);
143 n2 = fold_build2_loc (loc, MINUS_EXPR, TREE_TYPE (n2), n2,
144 build_int_cst (TREE_TYPE (n2), 1));
152 switch (TREE_CODE (incr))
154 case PREINCREMENT_EXPR:
155 case POSTINCREMENT_EXPR:
156 step = build_int_cst (TREE_TYPE (v), 1);
158 case PREDECREMENT_EXPR:
159 case POSTDECREMENT_EXPR:
160 step = build_int_cst (TREE_TYPE (v), -1);
163 t = TREE_OPERAND (incr, 1);
164 gcc_assert (TREE_OPERAND (t, 0) == v);
165 switch (TREE_CODE (t))
168 step = TREE_OPERAND (t, 1);
170 case POINTER_PLUS_EXPR:
171 step = fold_convert (ssizetype, TREE_OPERAND (t, 1));
174 step = TREE_OPERAND (t, 1);
175 step = fold_build1_loc (loc, NEGATE_EXPR, TREE_TYPE (step), step);
186 if (POINTER_TYPE_P (itype))
187 itype = signed_type_for (itype);
188 if (cond_code == NE_EXPR)
190 /* For NE_EXPR, we need to find out if the iterator increases
191 or decreases from whether step is positive or negative. */
193 if (TYPE_UNSIGNED (stype))
194 stype = signed_type_for (stype);
195 cond = fold_build2_loc (loc, GE_EXPR, boolean_type_node,
196 fold_convert_loc (loc, stype, step),
197 build_int_cst (stype, 0));
198 t = fold_build3_loc (loc, COND_EXPR, itype, cond,
199 build_int_cst (itype, -1),
200 build_int_cst (itype, 1));
203 t = build_int_cst (itype, (cond_code == LT_EXPR ? -1 : 1));
204 t = fold_build2_loc (loc, PLUS_EXPR, itype,
205 fold_convert_loc (loc, itype, step), t);
206 t = fold_build2_loc (loc, PLUS_EXPR, itype, t,
207 fold_convert_loc (loc, itype, n2));
208 t = fold_build2_loc (loc, MINUS_EXPR, itype, t,
209 fold_convert_loc (loc, itype, n1));
210 if (TYPE_UNSIGNED (itype) && cond_code == GT_EXPR)
211 t = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype,
212 fold_build1_loc (loc, NEGATE_EXPR, itype, t),
213 fold_build1_loc (loc, NEGATE_EXPR, itype,
214 fold_convert_loc (loc, itype,
216 else if (TYPE_UNSIGNED (itype) && cond_code == NE_EXPR)
219 = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype, t,
220 fold_convert_loc (loc, itype, step));
222 = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype,
223 fold_build1_loc (loc, NEGATE_EXPR, itype, t),
224 fold_build1_loc (loc, NEGATE_EXPR, itype,
225 fold_convert_loc (loc, itype,
227 t = fold_build3_loc (loc, COND_EXPR, itype, cond, t1, t2);
230 t = fold_build2_loc (loc, TRUNC_DIV_EXPR, itype, t,
231 fold_convert_loc (loc, itype, step));
232 cond = fold_build2_loc (loc, cond_code, boolean_type_node, n1, n2);
233 t = fold_build3_loc (loc, COND_EXPR, itype, cond, t,
234 build_int_cst (itype, 0));