]>
Commit | Line | Data |
---|---|---|
75a70cf9 | 1 | /* Gimple IR support functions. |
2 | ||
f1717362 | 3 | Copyright (C) 2007-2016 Free Software Foundation, Inc. |
75a70cf9 | 4 | Contributed by Aldy Hernandez <aldyh@redhat.com> |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 3, or (at your option) any later | |
11 | version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GCC; see the file COPYING3. If not see | |
20 | <http://www.gnu.org/licenses/>. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
9ef16211 | 25 | #include "backend.h" |
26 | #include "tree.h" | |
27 | #include "gimple.h" | |
9ef16211 | 28 | #include "ssa.h" |
7c29e30e | 29 | #include "cgraph.h" |
30 | #include "diagnostic.h" | |
b20a8bb4 | 31 | #include "alias.h" |
b20a8bb4 | 32 | #include "fold-const.h" |
9ed99284 | 33 | #include "calls.h" |
9ed99284 | 34 | #include "stor-layout.h" |
bc61cadb | 35 | #include "internal-fn.h" |
36 | #include "tree-eh.h" | |
dcf1a1ec | 37 | #include "gimple-iterator.h" |
38 | #include "gimple-walk.h" | |
a8783bee | 39 | #include "gimplify.h" |
9cb89654 | 40 | #include "target.h" |
75a70cf9 | 41 | |
7bfefa9d | 42 | |
1fed3255 | 43 | /* All the tuples have their operand vector (if present) at the very bottom |
75a70cf9 | 44 | of the structure. Therefore, the offset required to find the |
45 | operands vector the size of the structure minus the size of the 1 | |
46 | element tree array at the end (see gimple_ops). */ | |
1fed3255 | 47 | #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \ |
48 | (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0), | |
cd819d2f | 49 | EXPORTED_CONST size_t gimple_ops_offset_[] = { |
1fed3255 | 50 | #include "gsstruct.def" |
51 | }; | |
52 | #undef DEFGSSTRUCT | |
53 | ||
9af5ce0c | 54 | #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof (struct STRUCT), |
1fed3255 | 55 | static const size_t gsstruct_code_size[] = { |
56 | #include "gsstruct.def" | |
57 | }; | |
58 | #undef DEFGSSTRUCT | |
59 | ||
60 | #define DEFGSCODE(SYM, NAME, GSSCODE) NAME, | |
61 | const char *const gimple_code_name[] = { | |
62 | #include "gimple.def" | |
63 | }; | |
64 | #undef DEFGSCODE | |
65 | ||
66 | #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE, | |
67 | EXPORTED_CONST enum gimple_statement_structure_enum gss_for_code_[] = { | |
75a70cf9 | 68 | #include "gimple.def" |
69 | }; | |
70 | #undef DEFGSCODE | |
71 | ||
75a70cf9 | 72 | /* Gimple stats. */ |
73 | ||
74 | int gimple_alloc_counts[(int) gimple_alloc_kind_all]; | |
75 | int gimple_alloc_sizes[(int) gimple_alloc_kind_all]; | |
76 | ||
77 | /* Keep in sync with gimple.h:enum gimple_alloc_kind. */ | |
78 | static const char * const gimple_alloc_kind_names[] = { | |
79 | "assignments", | |
80 | "phi nodes", | |
81 | "conditionals", | |
75a70cf9 | 82 | "everything else" |
83 | }; | |
84 | ||
2ee9f21a | 85 | /* Static gimple tuple members. */ |
86 | const enum gimple_code gassign::code_; | |
31d3df5c | 87 | const enum gimple_code gcall::code_; |
88 | const enum gimple_code gcond::code_; | |
2ee9f21a | 89 | |
90 | ||
75a70cf9 | 91 | /* Gimple tuple constructors. |
92 | Note: Any constructor taking a ``gimple_seq'' as a parameter, can | |
93 | be passed a NULL to start with an empty sequence. */ | |
94 | ||
95 | /* Set the code for statement G to CODE. */ | |
96 | ||
97 | static inline void | |
42acab1c | 98 | gimple_set_code (gimple *g, enum gimple_code code) |
75a70cf9 | 99 | { |
de6bd75e | 100 | g->code = code; |
75a70cf9 | 101 | } |
102 | ||
75a70cf9 | 103 | /* Return the number of bytes needed to hold a GIMPLE statement with |
104 | code CODE. */ | |
105 | ||
1fed3255 | 106 | static inline size_t |
75a70cf9 | 107 | gimple_size (enum gimple_code code) |
108 | { | |
1fed3255 | 109 | return gsstruct_code_size[gss_for_code (code)]; |
75a70cf9 | 110 | } |
111 | ||
75a70cf9 | 112 | /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS |
113 | operands. */ | |
114 | ||
42acab1c | 115 | gimple * |
75a70cf9 | 116 | gimple_alloc_stat (enum gimple_code code, unsigned num_ops MEM_STAT_DECL) |
117 | { | |
118 | size_t size; | |
42acab1c | 119 | gimple *stmt; |
75a70cf9 | 120 | |
121 | size = gimple_size (code); | |
122 | if (num_ops > 0) | |
123 | size += sizeof (tree) * (num_ops - 1); | |
124 | ||
ecd52ea9 | 125 | if (GATHER_STATISTICS) |
126 | { | |
127 | enum gimple_alloc_kind kind = gimple_alloc_kind (code); | |
128 | gimple_alloc_counts[(int) kind]++; | |
129 | gimple_alloc_sizes[(int) kind] += size; | |
130 | } | |
75a70cf9 | 131 | |
de6bd75e | 132 | stmt = ggc_alloc_cleared_gimple_statement_stat (size PASS_MEM_STAT); |
75a70cf9 | 133 | gimple_set_code (stmt, code); |
134 | gimple_set_num_ops (stmt, num_ops); | |
135 | ||
136 | /* Do not call gimple_set_modified here as it has other side | |
137 | effects and this tuple is still not completely built. */ | |
de6bd75e | 138 | stmt->modified = 1; |
e3a19533 | 139 | gimple_init_singleton (stmt); |
75a70cf9 | 140 | |
141 | return stmt; | |
142 | } | |
143 | ||
144 | /* Set SUBCODE to be the code of the expression computed by statement G. */ | |
145 | ||
146 | static inline void | |
42acab1c | 147 | gimple_set_subcode (gimple *g, unsigned subcode) |
75a70cf9 | 148 | { |
149 | /* We only have 16 bits for the RHS code. Assert that we are not | |
150 | overflowing it. */ | |
151 | gcc_assert (subcode < (1 << 16)); | |
de6bd75e | 152 | g->subcode = subcode; |
75a70cf9 | 153 | } |
154 | ||
155 | ||
156 | ||
157 | /* Build a tuple with operands. CODE is the statement to build (which | |
d4f73cba | 158 | must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the subcode |
48e1416a | 159 | for the new tuple. NUM_OPS is the number of operands to allocate. */ |
75a70cf9 | 160 | |
161 | #define gimple_build_with_ops(c, s, n) \ | |
162 | gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO) | |
163 | ||
42acab1c | 164 | static gimple * |
9845d120 | 165 | gimple_build_with_ops_stat (enum gimple_code code, unsigned subcode, |
75a70cf9 | 166 | unsigned num_ops MEM_STAT_DECL) |
167 | { | |
42acab1c | 168 | gimple *s = gimple_alloc_stat (code, num_ops PASS_MEM_STAT); |
75a70cf9 | 169 | gimple_set_subcode (s, subcode); |
170 | ||
171 | return s; | |
172 | } | |
173 | ||
174 | ||
175 | /* Build a GIMPLE_RETURN statement returning RETVAL. */ | |
176 | ||
1a91d914 | 177 | greturn * |
75a70cf9 | 178 | gimple_build_return (tree retval) |
179 | { | |
1a91d914 | 180 | greturn *s |
181 | = as_a <greturn *> (gimple_build_with_ops (GIMPLE_RETURN, ERROR_MARK, | |
182 | 2)); | |
75a70cf9 | 183 | if (retval) |
184 | gimple_return_set_retval (s, retval); | |
185 | return s; | |
186 | } | |
187 | ||
cb245216 | 188 | /* Reset alias information on call S. */ |
189 | ||
190 | void | |
1a91d914 | 191 | gimple_call_reset_alias_info (gcall *s) |
cb245216 | 192 | { |
193 | if (gimple_call_flags (s) & ECF_CONST) | |
194 | memset (gimple_call_use_set (s), 0, sizeof (struct pt_solution)); | |
195 | else | |
196 | pt_solution_reset (gimple_call_use_set (s)); | |
197 | if (gimple_call_flags (s) & (ECF_CONST|ECF_PURE|ECF_NOVOPS)) | |
198 | memset (gimple_call_clobber_set (s), 0, sizeof (struct pt_solution)); | |
199 | else | |
200 | pt_solution_reset (gimple_call_clobber_set (s)); | |
201 | } | |
202 | ||
be7317e9 | 203 | /* Helper for gimple_build_call, gimple_build_call_valist, |
204 | gimple_build_call_vec and gimple_build_call_from_tree. Build the basic | |
205 | components of a GIMPLE_CALL statement to function FN with NARGS | |
206 | arguments. */ | |
75a70cf9 | 207 | |
1a91d914 | 208 | static inline gcall * |
75a70cf9 | 209 | gimple_build_call_1 (tree fn, unsigned nargs) |
210 | { | |
1a91d914 | 211 | gcall *s |
212 | = as_a <gcall *> (gimple_build_with_ops (GIMPLE_CALL, ERROR_MARK, | |
213 | nargs + 3)); | |
0acacf9e | 214 | if (TREE_CODE (fn) == FUNCTION_DECL) |
215 | fn = build_fold_addr_expr (fn); | |
75a70cf9 | 216 | gimple_set_op (s, 1, fn); |
39f59e65 | 217 | gimple_call_set_fntype (s, TREE_TYPE (TREE_TYPE (fn))); |
cb245216 | 218 | gimple_call_reset_alias_info (s); |
75a70cf9 | 219 | return s; |
220 | } | |
221 | ||
222 | ||
223 | /* Build a GIMPLE_CALL statement to function FN with the arguments | |
224 | specified in vector ARGS. */ | |
225 | ||
1a91d914 | 226 | gcall * |
f1f41a6c | 227 | gimple_build_call_vec (tree fn, vec<tree> args) |
75a70cf9 | 228 | { |
229 | unsigned i; | |
f1f41a6c | 230 | unsigned nargs = args.length (); |
1a91d914 | 231 | gcall *call = gimple_build_call_1 (fn, nargs); |
75a70cf9 | 232 | |
233 | for (i = 0; i < nargs; i++) | |
f1f41a6c | 234 | gimple_call_set_arg (call, i, args[i]); |
75a70cf9 | 235 | |
236 | return call; | |
237 | } | |
238 | ||
239 | ||
240 | /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of | |
241 | arguments. The ... are the arguments. */ | |
242 | ||
1a91d914 | 243 | gcall * |
75a70cf9 | 244 | gimple_build_call (tree fn, unsigned nargs, ...) |
245 | { | |
246 | va_list ap; | |
1a91d914 | 247 | gcall *call; |
75a70cf9 | 248 | unsigned i; |
249 | ||
250 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL || is_gimple_call_addr (fn)); | |
251 | ||
252 | call = gimple_build_call_1 (fn, nargs); | |
253 | ||
254 | va_start (ap, nargs); | |
255 | for (i = 0; i < nargs; i++) | |
256 | gimple_call_set_arg (call, i, va_arg (ap, tree)); | |
257 | va_end (ap); | |
258 | ||
259 | return call; | |
260 | } | |
261 | ||
262 | ||
be7317e9 | 263 | /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of |
264 | arguments. AP contains the arguments. */ | |
265 | ||
1a91d914 | 266 | gcall * |
be7317e9 | 267 | gimple_build_call_valist (tree fn, unsigned nargs, va_list ap) |
268 | { | |
1a91d914 | 269 | gcall *call; |
be7317e9 | 270 | unsigned i; |
271 | ||
272 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL || is_gimple_call_addr (fn)); | |
273 | ||
274 | call = gimple_build_call_1 (fn, nargs); | |
275 | ||
276 | for (i = 0; i < nargs; i++) | |
277 | gimple_call_set_arg (call, i, va_arg (ap, tree)); | |
278 | ||
279 | return call; | |
280 | } | |
281 | ||
282 | ||
fb049fba | 283 | /* Helper for gimple_build_call_internal and gimple_build_call_internal_vec. |
284 | Build the basic components of a GIMPLE_CALL statement to internal | |
285 | function FN with NARGS arguments. */ | |
286 | ||
1a91d914 | 287 | static inline gcall * |
fb049fba | 288 | gimple_build_call_internal_1 (enum internal_fn fn, unsigned nargs) |
289 | { | |
1a91d914 | 290 | gcall *s |
291 | = as_a <gcall *> (gimple_build_with_ops (GIMPLE_CALL, ERROR_MARK, | |
292 | nargs + 3)); | |
de6bd75e | 293 | s->subcode |= GF_CALL_INTERNAL; |
fb049fba | 294 | gimple_call_set_internal_fn (s, fn); |
295 | gimple_call_reset_alias_info (s); | |
296 | return s; | |
297 | } | |
298 | ||
299 | ||
300 | /* Build a GIMPLE_CALL statement to internal function FN. NARGS is | |
301 | the number of arguments. The ... are the arguments. */ | |
302 | ||
1a91d914 | 303 | gcall * |
fb049fba | 304 | gimple_build_call_internal (enum internal_fn fn, unsigned nargs, ...) |
305 | { | |
306 | va_list ap; | |
1a91d914 | 307 | gcall *call; |
fb049fba | 308 | unsigned i; |
309 | ||
310 | call = gimple_build_call_internal_1 (fn, nargs); | |
311 | va_start (ap, nargs); | |
312 | for (i = 0; i < nargs; i++) | |
313 | gimple_call_set_arg (call, i, va_arg (ap, tree)); | |
314 | va_end (ap); | |
315 | ||
316 | return call; | |
317 | } | |
318 | ||
319 | ||
320 | /* Build a GIMPLE_CALL statement to internal function FN with the arguments | |
321 | specified in vector ARGS. */ | |
322 | ||
1a91d914 | 323 | gcall * |
f1f41a6c | 324 | gimple_build_call_internal_vec (enum internal_fn fn, vec<tree> args) |
fb049fba | 325 | { |
326 | unsigned i, nargs; | |
1a91d914 | 327 | gcall *call; |
fb049fba | 328 | |
f1f41a6c | 329 | nargs = args.length (); |
fb049fba | 330 | call = gimple_build_call_internal_1 (fn, nargs); |
331 | for (i = 0; i < nargs; i++) | |
f1f41a6c | 332 | gimple_call_set_arg (call, i, args[i]); |
fb049fba | 333 | |
334 | return call; | |
335 | } | |
336 | ||
337 | ||
75a70cf9 | 338 | /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is |
339 | assumed to be in GIMPLE form already. Minimal checking is done of | |
340 | this fact. */ | |
341 | ||
1a91d914 | 342 | gcall * |
75a70cf9 | 343 | gimple_build_call_from_tree (tree t) |
344 | { | |
345 | unsigned i, nargs; | |
1a91d914 | 346 | gcall *call; |
75a70cf9 | 347 | tree fndecl = get_callee_fndecl (t); |
348 | ||
349 | gcc_assert (TREE_CODE (t) == CALL_EXPR); | |
350 | ||
351 | nargs = call_expr_nargs (t); | |
352 | call = gimple_build_call_1 (fndecl ? fndecl : CALL_EXPR_FN (t), nargs); | |
353 | ||
354 | for (i = 0; i < nargs; i++) | |
355 | gimple_call_set_arg (call, i, CALL_EXPR_ARG (t, i)); | |
356 | ||
357 | gimple_set_block (call, TREE_BLOCK (t)); | |
358 | ||
359 | /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */ | |
360 | gimple_call_set_chain (call, CALL_EXPR_STATIC_CHAIN (t)); | |
361 | gimple_call_set_tail (call, CALL_EXPR_TAILCALL (t)); | |
75a70cf9 | 362 | gimple_call_set_return_slot_opt (call, CALL_EXPR_RETURN_SLOT_OPT (t)); |
a882d754 | 363 | if (fndecl |
364 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
581bf1c2 | 365 | && (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA |
366 | || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_ALLOCA_WITH_ALIGN)) | |
a882d754 | 367 | gimple_call_set_alloca_for_var (call, CALL_ALLOCA_FOR_VAR_P (t)); |
368 | else | |
369 | gimple_call_set_from_thunk (call, CALL_FROM_THUNK_P (t)); | |
75a70cf9 | 370 | gimple_call_set_va_arg_pack (call, CALL_EXPR_VA_ARG_PACK (t)); |
1d3f675f | 371 | gimple_call_set_nothrow (call, TREE_NOTHROW (t)); |
e627cda1 | 372 | gimple_set_no_warning (call, TREE_NO_WARNING (t)); |
058a1b7a | 373 | gimple_call_set_with_bounds (call, CALL_WITH_BOUNDS_P (t)); |
75a70cf9 | 374 | |
375 | return call; | |
376 | } | |
377 | ||
378 | ||
75a70cf9 | 379 | /* Build a GIMPLE_ASSIGN statement. |
380 | ||
381 | LHS of the assignment. | |
382 | RHS of the assignment which can be unary or binary. */ | |
383 | ||
1a91d914 | 384 | gassign * |
e9cf809e | 385 | gimple_build_assign (tree lhs, tree rhs MEM_STAT_DECL) |
75a70cf9 | 386 | { |
387 | enum tree_code subcode; | |
00f4f705 | 388 | tree op1, op2, op3; |
75a70cf9 | 389 | |
00f4f705 | 390 | extract_ops_from_tree_1 (rhs, &subcode, &op1, &op2, &op3); |
e9cf809e | 391 | return gimple_build_assign (lhs, subcode, op1, op2, op3 PASS_MEM_STAT); |
75a70cf9 | 392 | } |
393 | ||
394 | ||
d4f73cba | 395 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands |
e9cf809e | 396 | OP1, OP2 and OP3. */ |
75a70cf9 | 397 | |
e9cf809e | 398 | static inline gassign * |
399 | gimple_build_assign_1 (tree lhs, enum tree_code subcode, tree op1, | |
400 | tree op2, tree op3 MEM_STAT_DECL) | |
75a70cf9 | 401 | { |
402 | unsigned num_ops; | |
1a91d914 | 403 | gassign *p; |
75a70cf9 | 404 | |
405 | /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the | |
406 | code). */ | |
407 | num_ops = get_gimple_rhs_num_ops (subcode) + 1; | |
48e1416a | 408 | |
1a91d914 | 409 | p = as_a <gassign *> ( |
410 | gimple_build_with_ops_stat (GIMPLE_ASSIGN, (unsigned)subcode, num_ops | |
411 | PASS_MEM_STAT)); | |
75a70cf9 | 412 | gimple_assign_set_lhs (p, lhs); |
413 | gimple_assign_set_rhs1 (p, op1); | |
414 | if (op2) | |
415 | { | |
416 | gcc_assert (num_ops > 2); | |
417 | gimple_assign_set_rhs2 (p, op2); | |
418 | } | |
419 | ||
00f4f705 | 420 | if (op3) |
421 | { | |
422 | gcc_assert (num_ops > 3); | |
423 | gimple_assign_set_rhs3 (p, op3); | |
424 | } | |
425 | ||
75a70cf9 | 426 | return p; |
427 | } | |
428 | ||
e9cf809e | 429 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands |
430 | OP1, OP2 and OP3. */ | |
431 | ||
432 | gassign * | |
433 | gimple_build_assign (tree lhs, enum tree_code subcode, tree op1, | |
434 | tree op2, tree op3 MEM_STAT_DECL) | |
435 | { | |
436 | return gimple_build_assign_1 (lhs, subcode, op1, op2, op3 PASS_MEM_STAT); | |
437 | } | |
438 | ||
439 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands | |
440 | OP1 and OP2. */ | |
441 | ||
1a91d914 | 442 | gassign * |
e9cf809e | 443 | gimple_build_assign (tree lhs, enum tree_code subcode, tree op1, |
444 | tree op2 MEM_STAT_DECL) | |
446e85eb | 445 | { |
e9cf809e | 446 | return gimple_build_assign_1 (lhs, subcode, op1, op2, NULL_TREE |
447 | PASS_MEM_STAT); | |
446e85eb | 448 | } |
449 | ||
e9cf809e | 450 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operand OP1. */ |
451 | ||
1a91d914 | 452 | gassign * |
e9cf809e | 453 | gimple_build_assign (tree lhs, enum tree_code subcode, tree op1 MEM_STAT_DECL) |
806413d2 | 454 | { |
e9cf809e | 455 | return gimple_build_assign_1 (lhs, subcode, op1, NULL_TREE, NULL_TREE |
456 | PASS_MEM_STAT); | |
806413d2 | 457 | } |
458 | ||
75a70cf9 | 459 | |
75a70cf9 | 460 | /* Build a GIMPLE_COND statement. |
461 | ||
462 | PRED is the condition used to compare LHS and the RHS. | |
463 | T_LABEL is the label to jump to if the condition is true. | |
464 | F_LABEL is the label to jump to otherwise. */ | |
465 | ||
1a91d914 | 466 | gcond * |
75a70cf9 | 467 | gimple_build_cond (enum tree_code pred_code, tree lhs, tree rhs, |
468 | tree t_label, tree f_label) | |
469 | { | |
1a91d914 | 470 | gcond *p; |
75a70cf9 | 471 | |
472 | gcc_assert (TREE_CODE_CLASS (pred_code) == tcc_comparison); | |
1a91d914 | 473 | p = as_a <gcond *> (gimple_build_with_ops (GIMPLE_COND, pred_code, 4)); |
75a70cf9 | 474 | gimple_cond_set_lhs (p, lhs); |
475 | gimple_cond_set_rhs (p, rhs); | |
476 | gimple_cond_set_true_label (p, t_label); | |
477 | gimple_cond_set_false_label (p, f_label); | |
478 | return p; | |
479 | } | |
480 | ||
75a70cf9 | 481 | /* Build a GIMPLE_COND statement from the conditional expression tree |
482 | COND. T_LABEL and F_LABEL are as in gimple_build_cond. */ | |
483 | ||
1a91d914 | 484 | gcond * |
75a70cf9 | 485 | gimple_build_cond_from_tree (tree cond, tree t_label, tree f_label) |
486 | { | |
487 | enum tree_code code; | |
488 | tree lhs, rhs; | |
489 | ||
490 | gimple_cond_get_ops_from_tree (cond, &code, &lhs, &rhs); | |
491 | return gimple_build_cond (code, lhs, rhs, t_label, f_label); | |
492 | } | |
493 | ||
494 | /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable | |
495 | boolean expression tree COND. */ | |
496 | ||
497 | void | |
1a91d914 | 498 | gimple_cond_set_condition_from_tree (gcond *stmt, tree cond) |
75a70cf9 | 499 | { |
500 | enum tree_code code; | |
501 | tree lhs, rhs; | |
502 | ||
503 | gimple_cond_get_ops_from_tree (cond, &code, &lhs, &rhs); | |
504 | gimple_cond_set_condition (stmt, code, lhs, rhs); | |
505 | } | |
506 | ||
507 | /* Build a GIMPLE_LABEL statement for LABEL. */ | |
508 | ||
1a91d914 | 509 | glabel * |
75a70cf9 | 510 | gimple_build_label (tree label) |
511 | { | |
1a91d914 | 512 | glabel *p |
513 | = as_a <glabel *> (gimple_build_with_ops (GIMPLE_LABEL, ERROR_MARK, 1)); | |
75a70cf9 | 514 | gimple_label_set_label (p, label); |
515 | return p; | |
516 | } | |
517 | ||
518 | /* Build a GIMPLE_GOTO statement to label DEST. */ | |
519 | ||
1a91d914 | 520 | ggoto * |
75a70cf9 | 521 | gimple_build_goto (tree dest) |
522 | { | |
1a91d914 | 523 | ggoto *p |
524 | = as_a <ggoto *> (gimple_build_with_ops (GIMPLE_GOTO, ERROR_MARK, 1)); | |
75a70cf9 | 525 | gimple_goto_set_dest (p, dest); |
526 | return p; | |
527 | } | |
528 | ||
529 | ||
530 | /* Build a GIMPLE_NOP statement. */ | |
531 | ||
42acab1c | 532 | gimple * |
75a70cf9 | 533 | gimple_build_nop (void) |
534 | { | |
535 | return gimple_alloc (GIMPLE_NOP, 0); | |
536 | } | |
537 | ||
538 | ||
539 | /* Build a GIMPLE_BIND statement. | |
540 | VARS are the variables in BODY. | |
541 | BLOCK is the containing block. */ | |
542 | ||
1a91d914 | 543 | gbind * |
75a70cf9 | 544 | gimple_build_bind (tree vars, gimple_seq body, tree block) |
545 | { | |
1a91d914 | 546 | gbind *p = as_a <gbind *> (gimple_alloc (GIMPLE_BIND, 0)); |
75a70cf9 | 547 | gimple_bind_set_vars (p, vars); |
548 | if (body) | |
549 | gimple_bind_set_body (p, body); | |
550 | if (block) | |
551 | gimple_bind_set_block (p, block); | |
552 | return p; | |
553 | } | |
554 | ||
555 | /* Helper function to set the simple fields of a asm stmt. | |
556 | ||
557 | STRING is a pointer to a string that is the asm blocks assembly code. | |
558 | NINPUT is the number of register inputs. | |
559 | NOUTPUT is the number of register outputs. | |
560 | NCLOBBERS is the number of clobbered registers. | |
561 | */ | |
562 | ||
1a91d914 | 563 | static inline gasm * |
48e1416a | 564 | gimple_build_asm_1 (const char *string, unsigned ninputs, unsigned noutputs, |
78f55ca8 | 565 | unsigned nclobbers, unsigned nlabels) |
75a70cf9 | 566 | { |
1a91d914 | 567 | gasm *p; |
75a70cf9 | 568 | int size = strlen (string); |
569 | ||
78f55ca8 | 570 | /* ASMs with labels cannot have outputs. This should have been |
571 | enforced by the front end. */ | |
572 | gcc_assert (nlabels == 0 || noutputs == 0); | |
573 | ||
1a91d914 | 574 | p = as_a <gasm *> ( |
de6bd75e | 575 | gimple_build_with_ops (GIMPLE_ASM, ERROR_MARK, |
576 | ninputs + noutputs + nclobbers + nlabels)); | |
75a70cf9 | 577 | |
de6bd75e | 578 | p->ni = ninputs; |
579 | p->no = noutputs; | |
580 | p->nc = nclobbers; | |
581 | p->nl = nlabels; | |
582 | p->string = ggc_alloc_string (string, size); | |
75a70cf9 | 583 | |
ecd52ea9 | 584 | if (GATHER_STATISTICS) |
585 | gimple_alloc_sizes[(int) gimple_alloc_kind (GIMPLE_ASM)] += size; | |
48e1416a | 586 | |
75a70cf9 | 587 | return p; |
588 | } | |
589 | ||
590 | /* Build a GIMPLE_ASM statement. | |
591 | ||
592 | STRING is the assembly code. | |
593 | NINPUT is the number of register inputs. | |
594 | NOUTPUT is the number of register outputs. | |
595 | NCLOBBERS is the number of clobbered registers. | |
596 | INPUTS is a vector of the input register parameters. | |
597 | OUTPUTS is a vector of the output register parameters. | |
78f55ca8 | 598 | CLOBBERS is a vector of the clobbered register parameters. |
599 | LABELS is a vector of destination labels. */ | |
75a70cf9 | 600 | |
1a91d914 | 601 | gasm * |
f1f41a6c | 602 | gimple_build_asm_vec (const char *string, vec<tree, va_gc> *inputs, |
603 | vec<tree, va_gc> *outputs, vec<tree, va_gc> *clobbers, | |
604 | vec<tree, va_gc> *labels) | |
75a70cf9 | 605 | { |
1a91d914 | 606 | gasm *p; |
75a70cf9 | 607 | unsigned i; |
608 | ||
609 | p = gimple_build_asm_1 (string, | |
f1f41a6c | 610 | vec_safe_length (inputs), |
611 | vec_safe_length (outputs), | |
612 | vec_safe_length (clobbers), | |
613 | vec_safe_length (labels)); | |
48e1416a | 614 | |
f1f41a6c | 615 | for (i = 0; i < vec_safe_length (inputs); i++) |
616 | gimple_asm_set_input_op (p, i, (*inputs)[i]); | |
75a70cf9 | 617 | |
f1f41a6c | 618 | for (i = 0; i < vec_safe_length (outputs); i++) |
619 | gimple_asm_set_output_op (p, i, (*outputs)[i]); | |
75a70cf9 | 620 | |
f1f41a6c | 621 | for (i = 0; i < vec_safe_length (clobbers); i++) |
622 | gimple_asm_set_clobber_op (p, i, (*clobbers)[i]); | |
48e1416a | 623 | |
f1f41a6c | 624 | for (i = 0; i < vec_safe_length (labels); i++) |
625 | gimple_asm_set_label_op (p, i, (*labels)[i]); | |
48e1416a | 626 | |
75a70cf9 | 627 | return p; |
628 | } | |
629 | ||
630 | /* Build a GIMPLE_CATCH statement. | |
631 | ||
632 | TYPES are the catch types. | |
633 | HANDLER is the exception handler. */ | |
634 | ||
1a91d914 | 635 | gcatch * |
75a70cf9 | 636 | gimple_build_catch (tree types, gimple_seq handler) |
637 | { | |
1a91d914 | 638 | gcatch *p = as_a <gcatch *> (gimple_alloc (GIMPLE_CATCH, 0)); |
75a70cf9 | 639 | gimple_catch_set_types (p, types); |
640 | if (handler) | |
641 | gimple_catch_set_handler (p, handler); | |
642 | ||
643 | return p; | |
644 | } | |
645 | ||
646 | /* Build a GIMPLE_EH_FILTER statement. | |
647 | ||
648 | TYPES are the filter's types. | |
649 | FAILURE is the filter's failure action. */ | |
650 | ||
1a91d914 | 651 | geh_filter * |
75a70cf9 | 652 | gimple_build_eh_filter (tree types, gimple_seq failure) |
653 | { | |
1a91d914 | 654 | geh_filter *p = as_a <geh_filter *> (gimple_alloc (GIMPLE_EH_FILTER, 0)); |
75a70cf9 | 655 | gimple_eh_filter_set_types (p, types); |
656 | if (failure) | |
657 | gimple_eh_filter_set_failure (p, failure); | |
658 | ||
659 | return p; | |
660 | } | |
661 | ||
e38def9c | 662 | /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */ |
663 | ||
1a91d914 | 664 | geh_mnt * |
e38def9c | 665 | gimple_build_eh_must_not_throw (tree decl) |
666 | { | |
1a91d914 | 667 | geh_mnt *p = as_a <geh_mnt *> (gimple_alloc (GIMPLE_EH_MUST_NOT_THROW, 0)); |
e38def9c | 668 | |
669 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
670 | gcc_assert (flags_from_decl_or_type (decl) & ECF_NORETURN); | |
7bfefa9d | 671 | gimple_eh_must_not_throw_set_fndecl (p, decl); |
e38def9c | 672 | |
673 | return p; | |
674 | } | |
675 | ||
4c0315d0 | 676 | /* Build a GIMPLE_EH_ELSE statement. */ |
677 | ||
1a91d914 | 678 | geh_else * |
4c0315d0 | 679 | gimple_build_eh_else (gimple_seq n_body, gimple_seq e_body) |
680 | { | |
1a91d914 | 681 | geh_else *p = as_a <geh_else *> (gimple_alloc (GIMPLE_EH_ELSE, 0)); |
4c0315d0 | 682 | gimple_eh_else_set_n_body (p, n_body); |
683 | gimple_eh_else_set_e_body (p, e_body); | |
684 | return p; | |
685 | } | |
686 | ||
75a70cf9 | 687 | /* Build a GIMPLE_TRY statement. |
688 | ||
689 | EVAL is the expression to evaluate. | |
690 | CLEANUP is the cleanup expression. | |
691 | KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on | |
692 | whether this is a try/catch or a try/finally respectively. */ | |
693 | ||
1a91d914 | 694 | gtry * |
75a70cf9 | 695 | gimple_build_try (gimple_seq eval, gimple_seq cleanup, |
696 | enum gimple_try_flags kind) | |
697 | { | |
1a91d914 | 698 | gtry *p; |
75a70cf9 | 699 | |
700 | gcc_assert (kind == GIMPLE_TRY_CATCH || kind == GIMPLE_TRY_FINALLY); | |
1a91d914 | 701 | p = as_a <gtry *> (gimple_alloc (GIMPLE_TRY, 0)); |
75a70cf9 | 702 | gimple_set_subcode (p, kind); |
703 | if (eval) | |
704 | gimple_try_set_eval (p, eval); | |
705 | if (cleanup) | |
706 | gimple_try_set_cleanup (p, cleanup); | |
707 | ||
708 | return p; | |
709 | } | |
710 | ||
711 | /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement. | |
712 | ||
713 | CLEANUP is the cleanup expression. */ | |
714 | ||
42acab1c | 715 | gimple * |
75a70cf9 | 716 | gimple_build_wce (gimple_seq cleanup) |
717 | { | |
42acab1c | 718 | gimple *p = gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR, 0); |
75a70cf9 | 719 | if (cleanup) |
720 | gimple_wce_set_cleanup (p, cleanup); | |
721 | ||
722 | return p; | |
723 | } | |
724 | ||
725 | ||
e38def9c | 726 | /* Build a GIMPLE_RESX statement. */ |
75a70cf9 | 727 | |
1a91d914 | 728 | gresx * |
75a70cf9 | 729 | gimple_build_resx (int region) |
730 | { | |
1a91d914 | 731 | gresx *p |
732 | = as_a <gresx *> (gimple_build_with_ops (GIMPLE_RESX, ERROR_MARK, 0)); | |
de6bd75e | 733 | p->region = region; |
75a70cf9 | 734 | return p; |
735 | } | |
736 | ||
737 | ||
738 | /* The helper for constructing a gimple switch statement. | |
739 | INDEX is the switch's index. | |
740 | NLABELS is the number of labels in the switch excluding the default. | |
741 | DEFAULT_LABEL is the default label for the switch statement. */ | |
742 | ||
1a91d914 | 743 | gswitch * |
e38def9c | 744 | gimple_build_switch_nlabels (unsigned nlabels, tree index, tree default_label) |
75a70cf9 | 745 | { |
746 | /* nlabels + 1 default label + 1 index. */ | |
49a70175 | 747 | gcc_checking_assert (default_label); |
1a91d914 | 748 | gswitch *p = as_a <gswitch *> (gimple_build_with_ops (GIMPLE_SWITCH, |
749 | ERROR_MARK, | |
750 | 1 + 1 + nlabels)); | |
75a70cf9 | 751 | gimple_switch_set_index (p, index); |
49a70175 | 752 | gimple_switch_set_default_label (p, default_label); |
75a70cf9 | 753 | return p; |
754 | } | |
755 | ||
75a70cf9 | 756 | /* Build a GIMPLE_SWITCH statement. |
757 | ||
758 | INDEX is the switch's index. | |
759 | DEFAULT_LABEL is the default label | |
760 | ARGS is a vector of labels excluding the default. */ | |
761 | ||
1a91d914 | 762 | gswitch * |
f1f41a6c | 763 | gimple_build_switch (tree index, tree default_label, vec<tree> args) |
75a70cf9 | 764 | { |
f1f41a6c | 765 | unsigned i, nlabels = args.length (); |
49a70175 | 766 | |
1a91d914 | 767 | gswitch *p = gimple_build_switch_nlabels (nlabels, index, default_label); |
75a70cf9 | 768 | |
e38def9c | 769 | /* Copy the labels from the vector to the switch statement. */ |
e38def9c | 770 | for (i = 0; i < nlabels; i++) |
f1f41a6c | 771 | gimple_switch_set_label (p, i + 1, args[i]); |
75a70cf9 | 772 | |
773 | return p; | |
774 | } | |
775 | ||
e38def9c | 776 | /* Build a GIMPLE_EH_DISPATCH statement. */ |
777 | ||
1a91d914 | 778 | geh_dispatch * |
e38def9c | 779 | gimple_build_eh_dispatch (int region) |
780 | { | |
1a91d914 | 781 | geh_dispatch *p |
782 | = as_a <geh_dispatch *> ( | |
783 | gimple_build_with_ops (GIMPLE_EH_DISPATCH, ERROR_MARK, 0)); | |
de6bd75e | 784 | p->region = region; |
e38def9c | 785 | return p; |
786 | } | |
75a70cf9 | 787 | |
9845d120 | 788 | /* Build a new GIMPLE_DEBUG_BIND statement. |
789 | ||
790 | VAR is bound to VALUE; block and location are taken from STMT. */ | |
791 | ||
1a91d914 | 792 | gdebug * |
42acab1c | 793 | gimple_build_debug_bind_stat (tree var, tree value, gimple *stmt MEM_STAT_DECL) |
9845d120 | 794 | { |
1a91d914 | 795 | gdebug *p |
796 | = as_a <gdebug *> (gimple_build_with_ops_stat (GIMPLE_DEBUG, | |
797 | (unsigned)GIMPLE_DEBUG_BIND, 2 | |
798 | PASS_MEM_STAT)); | |
9845d120 | 799 | gimple_debug_bind_set_var (p, var); |
800 | gimple_debug_bind_set_value (p, value); | |
801 | if (stmt) | |
5169661d | 802 | gimple_set_location (p, gimple_location (stmt)); |
9845d120 | 803 | |
804 | return p; | |
805 | } | |
806 | ||
807 | ||
841424cc | 808 | /* Build a new GIMPLE_DEBUG_SOURCE_BIND statement. |
809 | ||
810 | VAR is bound to VALUE; block and location are taken from STMT. */ | |
811 | ||
1a91d914 | 812 | gdebug * |
841424cc | 813 | gimple_build_debug_source_bind_stat (tree var, tree value, |
42acab1c | 814 | gimple *stmt MEM_STAT_DECL) |
841424cc | 815 | { |
1a91d914 | 816 | gdebug *p |
817 | = as_a <gdebug *> ( | |
818 | gimple_build_with_ops_stat (GIMPLE_DEBUG, | |
819 | (unsigned)GIMPLE_DEBUG_SOURCE_BIND, 2 | |
820 | PASS_MEM_STAT)); | |
841424cc | 821 | |
822 | gimple_debug_source_bind_set_var (p, var); | |
823 | gimple_debug_source_bind_set_value (p, value); | |
824 | if (stmt) | |
5169661d | 825 | gimple_set_location (p, gimple_location (stmt)); |
841424cc | 826 | |
827 | return p; | |
828 | } | |
829 | ||
830 | ||
75a70cf9 | 831 | /* Build a GIMPLE_OMP_CRITICAL statement. |
832 | ||
833 | BODY is the sequence of statements for which only one thread can execute. | |
43895be5 | 834 | NAME is optional identifier for this critical block. |
835 | CLAUSES are clauses for this critical block. */ | |
75a70cf9 | 836 | |
1a91d914 | 837 | gomp_critical * |
43895be5 | 838 | gimple_build_omp_critical (gimple_seq body, tree name, tree clauses) |
75a70cf9 | 839 | { |
1a91d914 | 840 | gomp_critical *p |
841 | = as_a <gomp_critical *> (gimple_alloc (GIMPLE_OMP_CRITICAL, 0)); | |
75a70cf9 | 842 | gimple_omp_critical_set_name (p, name); |
43895be5 | 843 | gimple_omp_critical_set_clauses (p, clauses); |
75a70cf9 | 844 | if (body) |
845 | gimple_omp_set_body (p, body); | |
846 | ||
847 | return p; | |
848 | } | |
849 | ||
850 | /* Build a GIMPLE_OMP_FOR statement. | |
851 | ||
852 | BODY is sequence of statements inside the for loop. | |
3d483a94 | 853 | KIND is the `for' variant. |
ca4c3545 | 854 | CLAUSES, are any of the construct's clauses. |
75a70cf9 | 855 | COLLAPSE is the collapse count. |
856 | PRE_BODY is the sequence of statements that are loop invariant. */ | |
857 | ||
1a91d914 | 858 | gomp_for * |
3d483a94 | 859 | gimple_build_omp_for (gimple_seq body, int kind, tree clauses, size_t collapse, |
75a70cf9 | 860 | gimple_seq pre_body) |
861 | { | |
1a91d914 | 862 | gomp_for *p = as_a <gomp_for *> (gimple_alloc (GIMPLE_OMP_FOR, 0)); |
75a70cf9 | 863 | if (body) |
864 | gimple_omp_set_body (p, body); | |
865 | gimple_omp_for_set_clauses (p, clauses); | |
3d483a94 | 866 | gimple_omp_for_set_kind (p, kind); |
de6bd75e | 867 | p->collapse = collapse; |
25a27413 | 868 | p->iter = ggc_cleared_vec_alloc<gimple_omp_for_iter> (collapse); |
de6bd75e | 869 | |
75a70cf9 | 870 | if (pre_body) |
871 | gimple_omp_for_set_pre_body (p, pre_body); | |
872 | ||
873 | return p; | |
874 | } | |
875 | ||
876 | ||
877 | /* Build a GIMPLE_OMP_PARALLEL statement. | |
878 | ||
879 | BODY is sequence of statements which are executed in parallel. | |
880 | CLAUSES, are the OMP parallel construct's clauses. | |
881 | CHILD_FN is the function created for the parallel threads to execute. | |
882 | DATA_ARG are the shared data argument(s). */ | |
883 | ||
1a91d914 | 884 | gomp_parallel * |
48e1416a | 885 | gimple_build_omp_parallel (gimple_seq body, tree clauses, tree child_fn, |
75a70cf9 | 886 | tree data_arg) |
887 | { | |
1a91d914 | 888 | gomp_parallel *p |
889 | = as_a <gomp_parallel *> (gimple_alloc (GIMPLE_OMP_PARALLEL, 0)); | |
75a70cf9 | 890 | if (body) |
891 | gimple_omp_set_body (p, body); | |
892 | gimple_omp_parallel_set_clauses (p, clauses); | |
893 | gimple_omp_parallel_set_child_fn (p, child_fn); | |
894 | gimple_omp_parallel_set_data_arg (p, data_arg); | |
895 | ||
896 | return p; | |
897 | } | |
898 | ||
899 | ||
900 | /* Build a GIMPLE_OMP_TASK statement. | |
901 | ||
902 | BODY is sequence of statements which are executed by the explicit task. | |
903 | CLAUSES, are the OMP parallel construct's clauses. | |
904 | CHILD_FN is the function created for the parallel threads to execute. | |
905 | DATA_ARG are the shared data argument(s). | |
906 | COPY_FN is the optional function for firstprivate initialization. | |
907 | ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */ | |
908 | ||
1a91d914 | 909 | gomp_task * |
75a70cf9 | 910 | gimple_build_omp_task (gimple_seq body, tree clauses, tree child_fn, |
911 | tree data_arg, tree copy_fn, tree arg_size, | |
912 | tree arg_align) | |
913 | { | |
1a91d914 | 914 | gomp_task *p = as_a <gomp_task *> (gimple_alloc (GIMPLE_OMP_TASK, 0)); |
75a70cf9 | 915 | if (body) |
916 | gimple_omp_set_body (p, body); | |
917 | gimple_omp_task_set_clauses (p, clauses); | |
918 | gimple_omp_task_set_child_fn (p, child_fn); | |
919 | gimple_omp_task_set_data_arg (p, data_arg); | |
920 | gimple_omp_task_set_copy_fn (p, copy_fn); | |
921 | gimple_omp_task_set_arg_size (p, arg_size); | |
922 | gimple_omp_task_set_arg_align (p, arg_align); | |
923 | ||
924 | return p; | |
925 | } | |
926 | ||
927 | ||
928 | /* Build a GIMPLE_OMP_SECTION statement for a sections statement. | |
929 | ||
930 | BODY is the sequence of statements in the section. */ | |
931 | ||
42acab1c | 932 | gimple * |
75a70cf9 | 933 | gimple_build_omp_section (gimple_seq body) |
934 | { | |
42acab1c | 935 | gimple *p = gimple_alloc (GIMPLE_OMP_SECTION, 0); |
75a70cf9 | 936 | if (body) |
937 | gimple_omp_set_body (p, body); | |
938 | ||
939 | return p; | |
940 | } | |
941 | ||
942 | ||
943 | /* Build a GIMPLE_OMP_MASTER statement. | |
944 | ||
945 | BODY is the sequence of statements to be executed by just the master. */ | |
946 | ||
42acab1c | 947 | gimple * |
75a70cf9 | 948 | gimple_build_omp_master (gimple_seq body) |
949 | { | |
42acab1c | 950 | gimple *p = gimple_alloc (GIMPLE_OMP_MASTER, 0); |
75a70cf9 | 951 | if (body) |
952 | gimple_omp_set_body (p, body); | |
953 | ||
954 | return p; | |
955 | } | |
956 | ||
957 | ||
bc7bff74 | 958 | /* Build a GIMPLE_OMP_TASKGROUP statement. |
959 | ||
960 | BODY is the sequence of statements to be executed by the taskgroup | |
961 | construct. */ | |
962 | ||
42acab1c | 963 | gimple * |
bc7bff74 | 964 | gimple_build_omp_taskgroup (gimple_seq body) |
965 | { | |
42acab1c | 966 | gimple *p = gimple_alloc (GIMPLE_OMP_TASKGROUP, 0); |
bc7bff74 | 967 | if (body) |
968 | gimple_omp_set_body (p, body); | |
969 | ||
970 | return p; | |
971 | } | |
972 | ||
973 | ||
75a70cf9 | 974 | /* Build a GIMPLE_OMP_CONTINUE statement. |
975 | ||
976 | CONTROL_DEF is the definition of the control variable. | |
977 | CONTROL_USE is the use of the control variable. */ | |
978 | ||
1a91d914 | 979 | gomp_continue * |
75a70cf9 | 980 | gimple_build_omp_continue (tree control_def, tree control_use) |
981 | { | |
1a91d914 | 982 | gomp_continue *p |
983 | = as_a <gomp_continue *> (gimple_alloc (GIMPLE_OMP_CONTINUE, 0)); | |
75a70cf9 | 984 | gimple_omp_continue_set_control_def (p, control_def); |
985 | gimple_omp_continue_set_control_use (p, control_use); | |
986 | return p; | |
987 | } | |
988 | ||
989 | /* Build a GIMPLE_OMP_ORDERED statement. | |
990 | ||
991 | BODY is the sequence of statements inside a loop that will executed in | |
43895be5 | 992 | sequence. |
993 | CLAUSES are clauses for this statement. */ | |
75a70cf9 | 994 | |
43895be5 | 995 | gomp_ordered * |
996 | gimple_build_omp_ordered (gimple_seq body, tree clauses) | |
75a70cf9 | 997 | { |
43895be5 | 998 | gomp_ordered *p |
999 | = as_a <gomp_ordered *> (gimple_alloc (GIMPLE_OMP_ORDERED, 0)); | |
1000 | gimple_omp_ordered_set_clauses (p, clauses); | |
75a70cf9 | 1001 | if (body) |
1002 | gimple_omp_set_body (p, body); | |
1003 | ||
1004 | return p; | |
1005 | } | |
1006 | ||
1007 | ||
1008 | /* Build a GIMPLE_OMP_RETURN statement. | |
1009 | WAIT_P is true if this is a non-waiting return. */ | |
1010 | ||
42acab1c | 1011 | gimple * |
75a70cf9 | 1012 | gimple_build_omp_return (bool wait_p) |
1013 | { | |
42acab1c | 1014 | gimple *p = gimple_alloc (GIMPLE_OMP_RETURN, 0); |
75a70cf9 | 1015 | if (wait_p) |
1016 | gimple_omp_return_set_nowait (p); | |
1017 | ||
1018 | return p; | |
1019 | } | |
1020 | ||
1021 | ||
1022 | /* Build a GIMPLE_OMP_SECTIONS statement. | |
1023 | ||
1024 | BODY is a sequence of section statements. | |
1025 | CLAUSES are any of the OMP sections contsruct's clauses: private, | |
1026 | firstprivate, lastprivate, reduction, and nowait. */ | |
1027 | ||
1a91d914 | 1028 | gomp_sections * |
75a70cf9 | 1029 | gimple_build_omp_sections (gimple_seq body, tree clauses) |
1030 | { | |
1a91d914 | 1031 | gomp_sections *p |
1032 | = as_a <gomp_sections *> (gimple_alloc (GIMPLE_OMP_SECTIONS, 0)); | |
75a70cf9 | 1033 | if (body) |
1034 | gimple_omp_set_body (p, body); | |
1035 | gimple_omp_sections_set_clauses (p, clauses); | |
1036 | ||
1037 | return p; | |
1038 | } | |
1039 | ||
1040 | ||
1041 | /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */ | |
1042 | ||
42acab1c | 1043 | gimple * |
75a70cf9 | 1044 | gimple_build_omp_sections_switch (void) |
1045 | { | |
1046 | return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH, 0); | |
1047 | } | |
1048 | ||
1049 | ||
1050 | /* Build a GIMPLE_OMP_SINGLE statement. | |
1051 | ||
1052 | BODY is the sequence of statements that will be executed once. | |
1053 | CLAUSES are any of the OMP single construct's clauses: private, firstprivate, | |
1054 | copyprivate, nowait. */ | |
1055 | ||
1a91d914 | 1056 | gomp_single * |
75a70cf9 | 1057 | gimple_build_omp_single (gimple_seq body, tree clauses) |
1058 | { | |
1a91d914 | 1059 | gomp_single *p |
1060 | = as_a <gomp_single *> (gimple_alloc (GIMPLE_OMP_SINGLE, 0)); | |
75a70cf9 | 1061 | if (body) |
1062 | gimple_omp_set_body (p, body); | |
1063 | gimple_omp_single_set_clauses (p, clauses); | |
1064 | ||
1065 | return p; | |
1066 | } | |
1067 | ||
1068 | ||
bc7bff74 | 1069 | /* Build a GIMPLE_OMP_TARGET statement. |
1070 | ||
1071 | BODY is the sequence of statements that will be executed. | |
ca4c3545 | 1072 | KIND is the kind of the region. |
1073 | CLAUSES are any of the construct's clauses. */ | |
bc7bff74 | 1074 | |
1a91d914 | 1075 | gomp_target * |
bc7bff74 | 1076 | gimple_build_omp_target (gimple_seq body, int kind, tree clauses) |
1077 | { | |
1a91d914 | 1078 | gomp_target *p |
1079 | = as_a <gomp_target *> (gimple_alloc (GIMPLE_OMP_TARGET, 0)); | |
bc7bff74 | 1080 | if (body) |
1081 | gimple_omp_set_body (p, body); | |
1082 | gimple_omp_target_set_clauses (p, clauses); | |
1083 | gimple_omp_target_set_kind (p, kind); | |
1084 | ||
1085 | return p; | |
1086 | } | |
1087 | ||
1088 | ||
1089 | /* Build a GIMPLE_OMP_TEAMS statement. | |
1090 | ||
1091 | BODY is the sequence of statements that will be executed. | |
1092 | CLAUSES are any of the OMP teams construct's clauses. */ | |
1093 | ||
1a91d914 | 1094 | gomp_teams * |
bc7bff74 | 1095 | gimple_build_omp_teams (gimple_seq body, tree clauses) |
1096 | { | |
1a91d914 | 1097 | gomp_teams *p = as_a <gomp_teams *> (gimple_alloc (GIMPLE_OMP_TEAMS, 0)); |
bc7bff74 | 1098 | if (body) |
1099 | gimple_omp_set_body (p, body); | |
1100 | gimple_omp_teams_set_clauses (p, clauses); | |
1101 | ||
1102 | return p; | |
1103 | } | |
1104 | ||
1105 | ||
75a70cf9 | 1106 | /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */ |
1107 | ||
1a91d914 | 1108 | gomp_atomic_load * |
75a70cf9 | 1109 | gimple_build_omp_atomic_load (tree lhs, tree rhs) |
1110 | { | |
1a91d914 | 1111 | gomp_atomic_load *p |
1112 | = as_a <gomp_atomic_load *> (gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD, 0)); | |
75a70cf9 | 1113 | gimple_omp_atomic_load_set_lhs (p, lhs); |
1114 | gimple_omp_atomic_load_set_rhs (p, rhs); | |
1115 | return p; | |
1116 | } | |
1117 | ||
1118 | /* Build a GIMPLE_OMP_ATOMIC_STORE statement. | |
1119 | ||
1120 | VAL is the value we are storing. */ | |
1121 | ||
1a91d914 | 1122 | gomp_atomic_store * |
75a70cf9 | 1123 | gimple_build_omp_atomic_store (tree val) |
1124 | { | |
1a91d914 | 1125 | gomp_atomic_store *p |
1126 | = as_a <gomp_atomic_store *> (gimple_alloc (GIMPLE_OMP_ATOMIC_STORE, 0)); | |
75a70cf9 | 1127 | gimple_omp_atomic_store_set_val (p, val); |
1128 | return p; | |
1129 | } | |
1130 | ||
4c0315d0 | 1131 | /* Build a GIMPLE_TRANSACTION statement. */ |
1132 | ||
1a91d914 | 1133 | gtransaction * |
a08574d7 | 1134 | gimple_build_transaction (gimple_seq body) |
4c0315d0 | 1135 | { |
1a91d914 | 1136 | gtransaction *p |
1137 | = as_a <gtransaction *> (gimple_alloc (GIMPLE_TRANSACTION, 0)); | |
4c0315d0 | 1138 | gimple_transaction_set_body (p, body); |
a08574d7 | 1139 | gimple_transaction_set_label_norm (p, 0); |
1140 | gimple_transaction_set_label_uninst (p, 0); | |
1141 | gimple_transaction_set_label_over (p, 0); | |
4c0315d0 | 1142 | return p; |
1143 | } | |
1144 | ||
384dcddb | 1145 | #if defined ENABLE_GIMPLE_CHECKING |
75a70cf9 | 1146 | /* Complain of a gimple type mismatch and die. */ |
1147 | ||
1148 | void | |
42acab1c | 1149 | gimple_check_failed (const gimple *gs, const char *file, int line, |
75a70cf9 | 1150 | const char *function, enum gimple_code code, |
1151 | enum tree_code subcode) | |
1152 | { | |
1153 | internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d", | |
1154 | gimple_code_name[code], | |
f3d35d4d | 1155 | get_tree_code_name (subcode), |
75a70cf9 | 1156 | gimple_code_name[gimple_code (gs)], |
de6bd75e | 1157 | gs->subcode > 0 |
1158 | ? get_tree_code_name ((enum tree_code) gs->subcode) | |
75a70cf9 | 1159 | : "", |
1160 | function, trim_filename (file), line); | |
1161 | } | |
75a70cf9 | 1162 | #endif /* ENABLE_GIMPLE_CHECKING */ |
1163 | ||
1164 | ||
75a70cf9 | 1165 | /* Link gimple statement GS to the end of the sequence *SEQ_P. If |
1166 | *SEQ_P is NULL, a new sequence is allocated. */ | |
1167 | ||
1168 | void | |
42acab1c | 1169 | gimple_seq_add_stmt (gimple_seq *seq_p, gimple *gs) |
75a70cf9 | 1170 | { |
1171 | gimple_stmt_iterator si; | |
75a70cf9 | 1172 | if (gs == NULL) |
1173 | return; | |
1174 | ||
75a70cf9 | 1175 | si = gsi_last (*seq_p); |
1176 | gsi_insert_after (&si, gs, GSI_NEW_STMT); | |
1177 | } | |
1178 | ||
a8783bee | 1179 | /* Link gimple statement GS to the end of the sequence *SEQ_P. If |
1180 | *SEQ_P is NULL, a new sequence is allocated. This function is | |
1181 | similar to gimple_seq_add_stmt, but does not scan the operands. | |
1182 | During gimplification, we need to manipulate statement sequences | |
1183 | before the def/use vectors have been constructed. */ | |
1184 | ||
1185 | void | |
42acab1c | 1186 | gimple_seq_add_stmt_without_update (gimple_seq *seq_p, gimple *gs) |
a8783bee | 1187 | { |
1188 | gimple_stmt_iterator si; | |
1189 | ||
1190 | if (gs == NULL) | |
1191 | return; | |
1192 | ||
1193 | si = gsi_last (*seq_p); | |
1194 | gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT); | |
1195 | } | |
75a70cf9 | 1196 | |
1197 | /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is | |
1198 | NULL, a new sequence is allocated. */ | |
1199 | ||
1200 | void | |
1201 | gimple_seq_add_seq (gimple_seq *dst_p, gimple_seq src) | |
1202 | { | |
1203 | gimple_stmt_iterator si; | |
75a70cf9 | 1204 | if (src == NULL) |
1205 | return; | |
1206 | ||
75a70cf9 | 1207 | si = gsi_last (*dst_p); |
1208 | gsi_insert_seq_after (&si, src, GSI_NEW_STMT); | |
1209 | } | |
1210 | ||
b9ea678c | 1211 | /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is |
1212 | NULL, a new sequence is allocated. This function is | |
1213 | similar to gimple_seq_add_seq, but does not scan the operands. */ | |
1214 | ||
1215 | void | |
1216 | gimple_seq_add_seq_without_update (gimple_seq *dst_p, gimple_seq src) | |
1217 | { | |
1218 | gimple_stmt_iterator si; | |
1219 | if (src == NULL) | |
1220 | return; | |
1221 | ||
1222 | si = gsi_last (*dst_p); | |
1223 | gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT); | |
1224 | } | |
1225 | ||
a8783bee | 1226 | /* Determine whether to assign a location to the statement GS. */ |
1227 | ||
1228 | static bool | |
42acab1c | 1229 | should_carry_location_p (gimple *gs) |
a8783bee | 1230 | { |
1231 | /* Don't emit a line note for a label. We particularly don't want to | |
1232 | emit one for the break label, since it doesn't actually correspond | |
1233 | to the beginning of the loop/switch. */ | |
1234 | if (gimple_code (gs) == GIMPLE_LABEL) | |
1235 | return false; | |
1236 | ||
1237 | return true; | |
1238 | } | |
1239 | ||
1240 | /* Set the location for gimple statement GS to LOCATION. */ | |
1241 | ||
1242 | static void | |
42acab1c | 1243 | annotate_one_with_location (gimple *gs, location_t location) |
a8783bee | 1244 | { |
1245 | if (!gimple_has_location (gs) | |
1246 | && !gimple_do_not_emit_location_p (gs) | |
1247 | && should_carry_location_p (gs)) | |
1248 | gimple_set_location (gs, location); | |
1249 | } | |
1250 | ||
1251 | /* Set LOCATION for all the statements after iterator GSI in sequence | |
1252 | SEQ. If GSI is pointing to the end of the sequence, start with the | |
1253 | first statement in SEQ. */ | |
1254 | ||
1255 | void | |
1256 | annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi, | |
1257 | location_t location) | |
1258 | { | |
1259 | if (gsi_end_p (gsi)) | |
1260 | gsi = gsi_start (seq); | |
1261 | else | |
1262 | gsi_next (&gsi); | |
1263 | ||
1264 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
1265 | annotate_one_with_location (gsi_stmt (gsi), location); | |
1266 | } | |
1267 | ||
1268 | /* Set the location for all the statements in a sequence STMT_P to LOCATION. */ | |
1269 | ||
1270 | void | |
1271 | annotate_all_with_location (gimple_seq stmt_p, location_t location) | |
1272 | { | |
1273 | gimple_stmt_iterator i; | |
1274 | ||
1275 | if (gimple_seq_empty_p (stmt_p)) | |
1276 | return; | |
1277 | ||
1278 | for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i)) | |
1279 | { | |
42acab1c | 1280 | gimple *gs = gsi_stmt (i); |
a8783bee | 1281 | annotate_one_with_location (gs, location); |
1282 | } | |
1283 | } | |
75a70cf9 | 1284 | |
1285 | /* Helper function of empty_body_p. Return true if STMT is an empty | |
1286 | statement. */ | |
1287 | ||
1288 | static bool | |
42acab1c | 1289 | empty_stmt_p (gimple *stmt) |
75a70cf9 | 1290 | { |
1291 | if (gimple_code (stmt) == GIMPLE_NOP) | |
1292 | return true; | |
1a91d914 | 1293 | if (gbind *bind_stmt = dyn_cast <gbind *> (stmt)) |
1294 | return empty_body_p (gimple_bind_body (bind_stmt)); | |
75a70cf9 | 1295 | return false; |
1296 | } | |
1297 | ||
1298 | ||
1299 | /* Return true if BODY contains nothing but empty statements. */ | |
1300 | ||
1301 | bool | |
1302 | empty_body_p (gimple_seq body) | |
1303 | { | |
1304 | gimple_stmt_iterator i; | |
1305 | ||
75a70cf9 | 1306 | if (gimple_seq_empty_p (body)) |
1307 | return true; | |
1308 | for (i = gsi_start (body); !gsi_end_p (i); gsi_next (&i)) | |
9845d120 | 1309 | if (!empty_stmt_p (gsi_stmt (i)) |
1310 | && !is_gimple_debug (gsi_stmt (i))) | |
75a70cf9 | 1311 | return false; |
1312 | ||
1313 | return true; | |
1314 | } | |
1315 | ||
1316 | ||
1317 | /* Perform a deep copy of sequence SRC and return the result. */ | |
1318 | ||
1319 | gimple_seq | |
1320 | gimple_seq_copy (gimple_seq src) | |
1321 | { | |
1322 | gimple_stmt_iterator gsi; | |
e3a19533 | 1323 | gimple_seq new_seq = NULL; |
42acab1c | 1324 | gimple *stmt; |
75a70cf9 | 1325 | |
1326 | for (gsi = gsi_start (src); !gsi_end_p (gsi); gsi_next (&gsi)) | |
1327 | { | |
1328 | stmt = gimple_copy (gsi_stmt (gsi)); | |
f4e36c33 | 1329 | gimple_seq_add_stmt (&new_seq, stmt); |
75a70cf9 | 1330 | } |
1331 | ||
f4e36c33 | 1332 | return new_seq; |
75a70cf9 | 1333 | } |
1334 | ||
1335 | ||
75a70cf9 | 1336 | |
fb049fba | 1337 | /* Return true if calls C1 and C2 are known to go to the same function. */ |
1338 | ||
1339 | bool | |
42acab1c | 1340 | gimple_call_same_target_p (const gimple *c1, const gimple *c2) |
fb049fba | 1341 | { |
1342 | if (gimple_call_internal_p (c1)) | |
1343 | return (gimple_call_internal_p (c2) | |
6c5c88f6 | 1344 | && gimple_call_internal_fn (c1) == gimple_call_internal_fn (c2) |
1345 | && !gimple_call_internal_unique_p (as_a <const gcall *> (c1))); | |
fb049fba | 1346 | else |
1347 | return (gimple_call_fn (c1) == gimple_call_fn (c2) | |
1348 | || (gimple_call_fndecl (c1) | |
1349 | && gimple_call_fndecl (c1) == gimple_call_fndecl (c2))); | |
1350 | } | |
1351 | ||
75a70cf9 | 1352 | /* Detect flags from a GIMPLE_CALL. This is just like |
1353 | call_expr_flags, but for gimple tuples. */ | |
1354 | ||
1355 | int | |
42acab1c | 1356 | gimple_call_flags (const gimple *stmt) |
75a70cf9 | 1357 | { |
1358 | int flags; | |
1359 | tree decl = gimple_call_fndecl (stmt); | |
75a70cf9 | 1360 | |
1361 | if (decl) | |
1362 | flags = flags_from_decl_or_type (decl); | |
fb049fba | 1363 | else if (gimple_call_internal_p (stmt)) |
1364 | flags = internal_fn_flags (gimple_call_internal_fn (stmt)); | |
75a70cf9 | 1365 | else |
d71dc717 | 1366 | flags = flags_from_decl_or_type (gimple_call_fntype (stmt)); |
75a70cf9 | 1367 | |
de6bd75e | 1368 | if (stmt->subcode & GF_CALL_NOTHROW) |
1d3f675f | 1369 | flags |= ECF_NOTHROW; |
1370 | ||
75a70cf9 | 1371 | return flags; |
1372 | } | |
1373 | ||
fb049fba | 1374 | /* Return the "fn spec" string for call STMT. */ |
1375 | ||
64d5d3e8 | 1376 | static const_tree |
1a91d914 | 1377 | gimple_call_fnspec (const gcall *stmt) |
fb049fba | 1378 | { |
1379 | tree type, attr; | |
1380 | ||
64d5d3e8 | 1381 | if (gimple_call_internal_p (stmt)) |
1382 | return internal_fn_fnspec (gimple_call_internal_fn (stmt)); | |
1383 | ||
fb049fba | 1384 | type = gimple_call_fntype (stmt); |
1385 | if (!type) | |
1386 | return NULL_TREE; | |
1387 | ||
1388 | attr = lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type)); | |
1389 | if (!attr) | |
1390 | return NULL_TREE; | |
1391 | ||
1392 | return TREE_VALUE (TREE_VALUE (attr)); | |
1393 | } | |
1394 | ||
8ce86007 | 1395 | /* Detects argument flags for argument number ARG on call STMT. */ |
1396 | ||
1397 | int | |
1a91d914 | 1398 | gimple_call_arg_flags (const gcall *stmt, unsigned arg) |
8ce86007 | 1399 | { |
64d5d3e8 | 1400 | const_tree attr = gimple_call_fnspec (stmt); |
8ce86007 | 1401 | |
fb049fba | 1402 | if (!attr || 1 + arg >= (unsigned) TREE_STRING_LENGTH (attr)) |
8ce86007 | 1403 | return 0; |
1404 | ||
1405 | switch (TREE_STRING_POINTER (attr)[1 + arg]) | |
1406 | { | |
1407 | case 'x': | |
1408 | case 'X': | |
1409 | return EAF_UNUSED; | |
1410 | ||
1411 | case 'R': | |
1412 | return EAF_DIRECT | EAF_NOCLOBBER | EAF_NOESCAPE; | |
1413 | ||
1414 | case 'r': | |
1415 | return EAF_NOCLOBBER | EAF_NOESCAPE; | |
1416 | ||
1417 | case 'W': | |
1418 | return EAF_DIRECT | EAF_NOESCAPE; | |
1419 | ||
1420 | case 'w': | |
1421 | return EAF_NOESCAPE; | |
1422 | ||
1423 | case '.': | |
1424 | default: | |
1425 | return 0; | |
1426 | } | |
1427 | } | |
1428 | ||
1429 | /* Detects return flags for the call STMT. */ | |
1430 | ||
1431 | int | |
1a91d914 | 1432 | gimple_call_return_flags (const gcall *stmt) |
8ce86007 | 1433 | { |
64d5d3e8 | 1434 | const_tree attr; |
8ce86007 | 1435 | |
1436 | if (gimple_call_flags (stmt) & ECF_MALLOC) | |
1437 | return ERF_NOALIAS; | |
1438 | ||
fb049fba | 1439 | attr = gimple_call_fnspec (stmt); |
1440 | if (!attr || TREE_STRING_LENGTH (attr) < 1) | |
8ce86007 | 1441 | return 0; |
1442 | ||
1443 | switch (TREE_STRING_POINTER (attr)[0]) | |
1444 | { | |
1445 | case '1': | |
1446 | case '2': | |
1447 | case '3': | |
1448 | case '4': | |
1449 | return ERF_RETURNS_ARG | (TREE_STRING_POINTER (attr)[0] - '1'); | |
1450 | ||
1451 | case 'm': | |
1452 | return ERF_NOALIAS; | |
1453 | ||
1454 | case '.': | |
1455 | default: | |
1456 | return 0; | |
1457 | } | |
1458 | } | |
75a70cf9 | 1459 | |
09937c79 | 1460 | |
75a70cf9 | 1461 | /* Return true if GS is a copy assignment. */ |
1462 | ||
1463 | bool | |
42acab1c | 1464 | gimple_assign_copy_p (gimple *gs) |
75a70cf9 | 1465 | { |
09937c79 | 1466 | return (gimple_assign_single_p (gs) |
1467 | && is_gimple_val (gimple_op (gs, 1))); | |
75a70cf9 | 1468 | } |
1469 | ||
1470 | ||
1471 | /* Return true if GS is a SSA_NAME copy assignment. */ | |
1472 | ||
1473 | bool | |
42acab1c | 1474 | gimple_assign_ssa_name_copy_p (gimple *gs) |
75a70cf9 | 1475 | { |
09937c79 | 1476 | return (gimple_assign_single_p (gs) |
75a70cf9 | 1477 | && TREE_CODE (gimple_assign_lhs (gs)) == SSA_NAME |
1478 | && TREE_CODE (gimple_assign_rhs1 (gs)) == SSA_NAME); | |
1479 | } | |
1480 | ||
1481 | ||
75a70cf9 | 1482 | /* Return true if GS is an assignment with a unary RHS, but the |
1483 | operator has no effect on the assigned value. The logic is adapted | |
1484 | from STRIP_NOPS. This predicate is intended to be used in tuplifying | |
1485 | instances in which STRIP_NOPS was previously applied to the RHS of | |
1486 | an assignment. | |
1487 | ||
1488 | NOTE: In the use cases that led to the creation of this function | |
1489 | and of gimple_assign_single_p, it is typical to test for either | |
1490 | condition and to proceed in the same manner. In each case, the | |
1491 | assigned value is represented by the single RHS operand of the | |
1492 | assignment. I suspect there may be cases where gimple_assign_copy_p, | |
1493 | gimple_assign_single_p, or equivalent logic is used where a similar | |
1494 | treatment of unary NOPs is appropriate. */ | |
48e1416a | 1495 | |
75a70cf9 | 1496 | bool |
42acab1c | 1497 | gimple_assign_unary_nop_p (gimple *gs) |
75a70cf9 | 1498 | { |
09937c79 | 1499 | return (is_gimple_assign (gs) |
d9659041 | 1500 | && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs)) |
75a70cf9 | 1501 | || gimple_assign_rhs_code (gs) == NON_LVALUE_EXPR) |
1502 | && gimple_assign_rhs1 (gs) != error_mark_node | |
1503 | && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs))) | |
1504 | == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs))))); | |
1505 | } | |
1506 | ||
1507 | /* Set BB to be the basic block holding G. */ | |
1508 | ||
1509 | void | |
42acab1c | 1510 | gimple_set_bb (gimple *stmt, basic_block bb) |
75a70cf9 | 1511 | { |
de6bd75e | 1512 | stmt->bb = bb; |
75a70cf9 | 1513 | |
98107def | 1514 | if (gimple_code (stmt) != GIMPLE_LABEL) |
1515 | return; | |
1516 | ||
75a70cf9 | 1517 | /* If the statement is a label, add the label to block-to-labels map |
1518 | so that we can speed up edge creation for GIMPLE_GOTOs. */ | |
98107def | 1519 | if (cfun->cfg) |
75a70cf9 | 1520 | { |
1521 | tree t; | |
1522 | int uid; | |
1523 | ||
1a91d914 | 1524 | t = gimple_label_label (as_a <glabel *> (stmt)); |
75a70cf9 | 1525 | uid = LABEL_DECL_UID (t); |
1526 | if (uid == -1) | |
1527 | { | |
37943f95 | 1528 | unsigned old_len = |
1529 | vec_safe_length (label_to_block_map_for_fn (cfun)); | |
75a70cf9 | 1530 | LABEL_DECL_UID (t) = uid = cfun->cfg->last_label_uid++; |
1531 | if (old_len <= (unsigned) uid) | |
1532 | { | |
dd277d48 | 1533 | unsigned new_len = 3 * uid / 2 + 1; |
75a70cf9 | 1534 | |
37943f95 | 1535 | vec_safe_grow_cleared (label_to_block_map_for_fn (cfun), |
1536 | new_len); | |
75a70cf9 | 1537 | } |
1538 | } | |
1539 | ||
37943f95 | 1540 | (*label_to_block_map_for_fn (cfun))[uid] = bb; |
75a70cf9 | 1541 | } |
1542 | } | |
1543 | ||
1544 | ||
75a70cf9 | 1545 | /* Modify the RHS of the assignment pointed-to by GSI using the |
1546 | operands in the expression tree EXPR. | |
1547 | ||
1548 | NOTE: The statement pointed-to by GSI may be reallocated if it | |
1549 | did not have enough operand slots. | |
1550 | ||
1551 | This function is useful to convert an existing tree expression into | |
1552 | the flat representation used for the RHS of a GIMPLE assignment. | |
1553 | It will reallocate memory as needed to expand or shrink the number | |
1554 | of operand slots needed to represent EXPR. | |
1555 | ||
1556 | NOTE: If you find yourself building a tree and then calling this | |
1557 | function, you are most certainly doing it the slow way. It is much | |
1558 | better to build a new assignment or to use the function | |
1559 | gimple_assign_set_rhs_with_ops, which does not require an | |
1560 | expression tree to be built. */ | |
1561 | ||
1562 | void | |
1563 | gimple_assign_set_rhs_from_tree (gimple_stmt_iterator *gsi, tree expr) | |
1564 | { | |
1565 | enum tree_code subcode; | |
00f4f705 | 1566 | tree op1, op2, op3; |
75a70cf9 | 1567 | |
00f4f705 | 1568 | extract_ops_from_tree_1 (expr, &subcode, &op1, &op2, &op3); |
806413d2 | 1569 | gimple_assign_set_rhs_with_ops (gsi, subcode, op1, op2, op3); |
75a70cf9 | 1570 | } |
1571 | ||
1572 | ||
1573 | /* Set the RHS of assignment statement pointed-to by GSI to CODE with | |
00f4f705 | 1574 | operands OP1, OP2 and OP3. |
75a70cf9 | 1575 | |
1576 | NOTE: The statement pointed-to by GSI may be reallocated if it | |
1577 | did not have enough operand slots. */ | |
1578 | ||
1579 | void | |
806413d2 | 1580 | gimple_assign_set_rhs_with_ops (gimple_stmt_iterator *gsi, enum tree_code code, |
1581 | tree op1, tree op2, tree op3) | |
75a70cf9 | 1582 | { |
1583 | unsigned new_rhs_ops = get_gimple_rhs_num_ops (code); | |
42acab1c | 1584 | gimple *stmt = gsi_stmt (*gsi); |
75a70cf9 | 1585 | |
1586 | /* If the new CODE needs more operands, allocate a new statement. */ | |
1587 | if (gimple_num_ops (stmt) < new_rhs_ops + 1) | |
1588 | { | |
1589 | tree lhs = gimple_assign_lhs (stmt); | |
42acab1c | 1590 | gimple *new_stmt = gimple_alloc (gimple_code (stmt), new_rhs_ops + 1); |
75a70cf9 | 1591 | memcpy (new_stmt, stmt, gimple_size (gimple_code (stmt))); |
e3a19533 | 1592 | gimple_init_singleton (new_stmt); |
75a70cf9 | 1593 | gsi_replace (gsi, new_stmt, true); |
1594 | stmt = new_stmt; | |
1595 | ||
1596 | /* The LHS needs to be reset as this also changes the SSA name | |
1597 | on the LHS. */ | |
1598 | gimple_assign_set_lhs (stmt, lhs); | |
1599 | } | |
1600 | ||
1601 | gimple_set_num_ops (stmt, new_rhs_ops + 1); | |
1602 | gimple_set_subcode (stmt, code); | |
1603 | gimple_assign_set_rhs1 (stmt, op1); | |
1604 | if (new_rhs_ops > 1) | |
1605 | gimple_assign_set_rhs2 (stmt, op2); | |
00f4f705 | 1606 | if (new_rhs_ops > 2) |
1607 | gimple_assign_set_rhs3 (stmt, op3); | |
75a70cf9 | 1608 | } |
1609 | ||
1610 | ||
1611 | /* Return the LHS of a statement that performs an assignment, | |
1612 | either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE | |
1613 | for a call to a function that returns no value, or for a | |
1614 | statement other than an assignment or a call. */ | |
1615 | ||
1616 | tree | |
42acab1c | 1617 | gimple_get_lhs (const gimple *stmt) |
75a70cf9 | 1618 | { |
590c3166 | 1619 | enum gimple_code code = gimple_code (stmt); |
75a70cf9 | 1620 | |
1621 | if (code == GIMPLE_ASSIGN) | |
1622 | return gimple_assign_lhs (stmt); | |
1623 | else if (code == GIMPLE_CALL) | |
1624 | return gimple_call_lhs (stmt); | |
1625 | else | |
1626 | return NULL_TREE; | |
1627 | } | |
1628 | ||
1629 | ||
1630 | /* Set the LHS of a statement that performs an assignment, | |
1631 | either a GIMPLE_ASSIGN or a GIMPLE_CALL. */ | |
1632 | ||
1633 | void | |
42acab1c | 1634 | gimple_set_lhs (gimple *stmt, tree lhs) |
75a70cf9 | 1635 | { |
590c3166 | 1636 | enum gimple_code code = gimple_code (stmt); |
75a70cf9 | 1637 | |
1638 | if (code == GIMPLE_ASSIGN) | |
1639 | gimple_assign_set_lhs (stmt, lhs); | |
1640 | else if (code == GIMPLE_CALL) | |
1641 | gimple_call_set_lhs (stmt, lhs); | |
1642 | else | |
9af5ce0c | 1643 | gcc_unreachable (); |
75a70cf9 | 1644 | } |
1645 | ||
1646 | ||
1647 | /* Return a deep copy of statement STMT. All the operands from STMT | |
1648 | are reallocated and copied using unshare_expr. The DEF, USE, VDEF | |
e3a19533 | 1649 | and VUSE operand arrays are set to empty in the new copy. The new |
1650 | copy isn't part of any sequence. */ | |
75a70cf9 | 1651 | |
42acab1c | 1652 | gimple * |
1653 | gimple_copy (gimple *stmt) | |
75a70cf9 | 1654 | { |
1655 | enum gimple_code code = gimple_code (stmt); | |
1656 | unsigned num_ops = gimple_num_ops (stmt); | |
42acab1c | 1657 | gimple *copy = gimple_alloc (code, num_ops); |
75a70cf9 | 1658 | unsigned i; |
1659 | ||
1660 | /* Shallow copy all the fields from STMT. */ | |
1661 | memcpy (copy, stmt, gimple_size (code)); | |
e3a19533 | 1662 | gimple_init_singleton (copy); |
75a70cf9 | 1663 | |
1664 | /* If STMT has sub-statements, deep-copy them as well. */ | |
1665 | if (gimple_has_substatements (stmt)) | |
1666 | { | |
1667 | gimple_seq new_seq; | |
1668 | tree t; | |
1669 | ||
1670 | switch (gimple_code (stmt)) | |
1671 | { | |
1672 | case GIMPLE_BIND: | |
1a91d914 | 1673 | { |
1674 | gbind *bind_stmt = as_a <gbind *> (stmt); | |
1675 | gbind *bind_copy = as_a <gbind *> (copy); | |
1676 | new_seq = gimple_seq_copy (gimple_bind_body (bind_stmt)); | |
1677 | gimple_bind_set_body (bind_copy, new_seq); | |
1678 | gimple_bind_set_vars (bind_copy, | |
1679 | unshare_expr (gimple_bind_vars (bind_stmt))); | |
1680 | gimple_bind_set_block (bind_copy, gimple_bind_block (bind_stmt)); | |
1681 | } | |
75a70cf9 | 1682 | break; |
1683 | ||
1684 | case GIMPLE_CATCH: | |
1a91d914 | 1685 | { |
1686 | gcatch *catch_stmt = as_a <gcatch *> (stmt); | |
1687 | gcatch *catch_copy = as_a <gcatch *> (copy); | |
1688 | new_seq = gimple_seq_copy (gimple_catch_handler (catch_stmt)); | |
1689 | gimple_catch_set_handler (catch_copy, new_seq); | |
1690 | t = unshare_expr (gimple_catch_types (catch_stmt)); | |
1691 | gimple_catch_set_types (catch_copy, t); | |
1692 | } | |
75a70cf9 | 1693 | break; |
1694 | ||
1695 | case GIMPLE_EH_FILTER: | |
1a91d914 | 1696 | { |
1697 | geh_filter *eh_filter_stmt = as_a <geh_filter *> (stmt); | |
1698 | geh_filter *eh_filter_copy = as_a <geh_filter *> (copy); | |
1699 | new_seq | |
1700 | = gimple_seq_copy (gimple_eh_filter_failure (eh_filter_stmt)); | |
1701 | gimple_eh_filter_set_failure (eh_filter_copy, new_seq); | |
1702 | t = unshare_expr (gimple_eh_filter_types (eh_filter_stmt)); | |
1703 | gimple_eh_filter_set_types (eh_filter_copy, t); | |
1704 | } | |
75a70cf9 | 1705 | break; |
1706 | ||
4c0315d0 | 1707 | case GIMPLE_EH_ELSE: |
1a91d914 | 1708 | { |
1709 | geh_else *eh_else_stmt = as_a <geh_else *> (stmt); | |
1710 | geh_else *eh_else_copy = as_a <geh_else *> (copy); | |
1711 | new_seq = gimple_seq_copy (gimple_eh_else_n_body (eh_else_stmt)); | |
1712 | gimple_eh_else_set_n_body (eh_else_copy, new_seq); | |
1713 | new_seq = gimple_seq_copy (gimple_eh_else_e_body (eh_else_stmt)); | |
1714 | gimple_eh_else_set_e_body (eh_else_copy, new_seq); | |
1715 | } | |
4c0315d0 | 1716 | break; |
1717 | ||
75a70cf9 | 1718 | case GIMPLE_TRY: |
1a91d914 | 1719 | { |
1720 | gtry *try_stmt = as_a <gtry *> (stmt); | |
1721 | gtry *try_copy = as_a <gtry *> (copy); | |
1722 | new_seq = gimple_seq_copy (gimple_try_eval (try_stmt)); | |
1723 | gimple_try_set_eval (try_copy, new_seq); | |
1724 | new_seq = gimple_seq_copy (gimple_try_cleanup (try_stmt)); | |
1725 | gimple_try_set_cleanup (try_copy, new_seq); | |
1726 | } | |
75a70cf9 | 1727 | break; |
1728 | ||
1729 | case GIMPLE_OMP_FOR: | |
1730 | new_seq = gimple_seq_copy (gimple_omp_for_pre_body (stmt)); | |
1731 | gimple_omp_for_set_pre_body (copy, new_seq); | |
1732 | t = unshare_expr (gimple_omp_for_clauses (stmt)); | |
1733 | gimple_omp_for_set_clauses (copy, t); | |
de6bd75e | 1734 | { |
1a91d914 | 1735 | gomp_for *omp_for_copy = as_a <gomp_for *> (copy); |
25a27413 | 1736 | omp_for_copy->iter = ggc_vec_alloc<gimple_omp_for_iter> |
1737 | ( gimple_omp_for_collapse (stmt)); | |
de6bd75e | 1738 | } |
75a70cf9 | 1739 | for (i = 0; i < gimple_omp_for_collapse (stmt); i++) |
1740 | { | |
1741 | gimple_omp_for_set_cond (copy, i, | |
1742 | gimple_omp_for_cond (stmt, i)); | |
1743 | gimple_omp_for_set_index (copy, i, | |
1744 | gimple_omp_for_index (stmt, i)); | |
1745 | t = unshare_expr (gimple_omp_for_initial (stmt, i)); | |
1746 | gimple_omp_for_set_initial (copy, i, t); | |
1747 | t = unshare_expr (gimple_omp_for_final (stmt, i)); | |
1748 | gimple_omp_for_set_final (copy, i, t); | |
1749 | t = unshare_expr (gimple_omp_for_incr (stmt, i)); | |
1750 | gimple_omp_for_set_incr (copy, i, t); | |
1751 | } | |
1752 | goto copy_omp_body; | |
1753 | ||
1754 | case GIMPLE_OMP_PARALLEL: | |
1a91d914 | 1755 | { |
1756 | gomp_parallel *omp_par_stmt = as_a <gomp_parallel *> (stmt); | |
1757 | gomp_parallel *omp_par_copy = as_a <gomp_parallel *> (copy); | |
1758 | t = unshare_expr (gimple_omp_parallel_clauses (omp_par_stmt)); | |
1759 | gimple_omp_parallel_set_clauses (omp_par_copy, t); | |
1760 | t = unshare_expr (gimple_omp_parallel_child_fn (omp_par_stmt)); | |
1761 | gimple_omp_parallel_set_child_fn (omp_par_copy, t); | |
1762 | t = unshare_expr (gimple_omp_parallel_data_arg (omp_par_stmt)); | |
1763 | gimple_omp_parallel_set_data_arg (omp_par_copy, t); | |
1764 | } | |
75a70cf9 | 1765 | goto copy_omp_body; |
1766 | ||
1767 | case GIMPLE_OMP_TASK: | |
1768 | t = unshare_expr (gimple_omp_task_clauses (stmt)); | |
1769 | gimple_omp_task_set_clauses (copy, t); | |
1770 | t = unshare_expr (gimple_omp_task_child_fn (stmt)); | |
1771 | gimple_omp_task_set_child_fn (copy, t); | |
1772 | t = unshare_expr (gimple_omp_task_data_arg (stmt)); | |
1773 | gimple_omp_task_set_data_arg (copy, t); | |
1774 | t = unshare_expr (gimple_omp_task_copy_fn (stmt)); | |
1775 | gimple_omp_task_set_copy_fn (copy, t); | |
1776 | t = unshare_expr (gimple_omp_task_arg_size (stmt)); | |
1777 | gimple_omp_task_set_arg_size (copy, t); | |
1778 | t = unshare_expr (gimple_omp_task_arg_align (stmt)); | |
1779 | gimple_omp_task_set_arg_align (copy, t); | |
1780 | goto copy_omp_body; | |
1781 | ||
1782 | case GIMPLE_OMP_CRITICAL: | |
43895be5 | 1783 | t = unshare_expr (gimple_omp_critical_name |
1784 | (as_a <gomp_critical *> (stmt))); | |
1a91d914 | 1785 | gimple_omp_critical_set_name (as_a <gomp_critical *> (copy), t); |
43895be5 | 1786 | t = unshare_expr (gimple_omp_critical_clauses |
1787 | (as_a <gomp_critical *> (stmt))); | |
1788 | gimple_omp_critical_set_clauses (as_a <gomp_critical *> (copy), t); | |
1789 | goto copy_omp_body; | |
1790 | ||
1791 | case GIMPLE_OMP_ORDERED: | |
1792 | t = unshare_expr (gimple_omp_ordered_clauses | |
1793 | (as_a <gomp_ordered *> (stmt))); | |
1794 | gimple_omp_ordered_set_clauses (as_a <gomp_ordered *> (copy), t); | |
75a70cf9 | 1795 | goto copy_omp_body; |
1796 | ||
1797 | case GIMPLE_OMP_SECTIONS: | |
1798 | t = unshare_expr (gimple_omp_sections_clauses (stmt)); | |
1799 | gimple_omp_sections_set_clauses (copy, t); | |
1800 | t = unshare_expr (gimple_omp_sections_control (stmt)); | |
1801 | gimple_omp_sections_set_control (copy, t); | |
1802 | /* FALLTHRU */ | |
1803 | ||
1804 | case GIMPLE_OMP_SINGLE: | |
bc7bff74 | 1805 | case GIMPLE_OMP_TARGET: |
1806 | case GIMPLE_OMP_TEAMS: | |
75a70cf9 | 1807 | case GIMPLE_OMP_SECTION: |
1808 | case GIMPLE_OMP_MASTER: | |
bc7bff74 | 1809 | case GIMPLE_OMP_TASKGROUP: |
75a70cf9 | 1810 | copy_omp_body: |
1811 | new_seq = gimple_seq_copy (gimple_omp_body (stmt)); | |
1812 | gimple_omp_set_body (copy, new_seq); | |
1813 | break; | |
1814 | ||
4c0315d0 | 1815 | case GIMPLE_TRANSACTION: |
1a91d914 | 1816 | new_seq = gimple_seq_copy (gimple_transaction_body ( |
1817 | as_a <gtransaction *> (stmt))); | |
1818 | gimple_transaction_set_body (as_a <gtransaction *> (copy), | |
1819 | new_seq); | |
4c0315d0 | 1820 | break; |
1821 | ||
75a70cf9 | 1822 | case GIMPLE_WITH_CLEANUP_EXPR: |
1823 | new_seq = gimple_seq_copy (gimple_wce_cleanup (stmt)); | |
1824 | gimple_wce_set_cleanup (copy, new_seq); | |
1825 | break; | |
1826 | ||
1827 | default: | |
1828 | gcc_unreachable (); | |
1829 | } | |
1830 | } | |
1831 | ||
1832 | /* Make copy of operands. */ | |
8ee04e91 | 1833 | for (i = 0; i < num_ops; i++) |
1834 | gimple_set_op (copy, i, unshare_expr (gimple_op (stmt, i))); | |
75a70cf9 | 1835 | |
8ee04e91 | 1836 | if (gimple_has_mem_ops (stmt)) |
1837 | { | |
1838 | gimple_set_vdef (copy, gimple_vdef (stmt)); | |
1839 | gimple_set_vuse (copy, gimple_vuse (stmt)); | |
1840 | } | |
75a70cf9 | 1841 | |
8ee04e91 | 1842 | /* Clear out SSA operand vectors on COPY. */ |
1843 | if (gimple_has_ops (stmt)) | |
1844 | { | |
8ee04e91 | 1845 | gimple_set_use_ops (copy, NULL); |
75a70cf9 | 1846 | |
dd277d48 | 1847 | /* SSA operands need to be updated. */ |
1848 | gimple_set_modified (copy, true); | |
75a70cf9 | 1849 | } |
1850 | ||
1851 | return copy; | |
1852 | } | |
1853 | ||
1854 | ||
75a70cf9 | 1855 | /* Return true if statement S has side-effects. We consider a |
1856 | statement to have side effects if: | |
1857 | ||
1858 | - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST. | |
1859 | - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */ | |
1860 | ||
1861 | bool | |
42acab1c | 1862 | gimple_has_side_effects (const gimple *s) |
75a70cf9 | 1863 | { |
9845d120 | 1864 | if (is_gimple_debug (s)) |
1865 | return false; | |
1866 | ||
75a70cf9 | 1867 | /* We don't have to scan the arguments to check for |
1868 | volatile arguments, though, at present, we still | |
1869 | do a scan to check for TREE_SIDE_EFFECTS. */ | |
1870 | if (gimple_has_volatile_ops (s)) | |
1871 | return true; | |
1872 | ||
b523dd6d | 1873 | if (gimple_code (s) == GIMPLE_ASM |
1a91d914 | 1874 | && gimple_asm_volatile_p (as_a <const gasm *> (s))) |
b523dd6d | 1875 | return true; |
1876 | ||
75a70cf9 | 1877 | if (is_gimple_call (s)) |
1878 | { | |
2d01f631 | 1879 | int flags = gimple_call_flags (s); |
75a70cf9 | 1880 | |
2d01f631 | 1881 | /* An infinite loop is considered a side effect. */ |
1882 | if (!(flags & (ECF_CONST | ECF_PURE)) | |
1883 | || (flags & ECF_LOOPING_CONST_OR_PURE)) | |
75a70cf9 | 1884 | return true; |
1885 | ||
75a70cf9 | 1886 | return false; |
1887 | } | |
75a70cf9 | 1888 | |
1889 | return false; | |
1890 | } | |
1891 | ||
75a70cf9 | 1892 | /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p. |
e1cc68bd | 1893 | Return true if S can trap. When INCLUDE_MEM is true, check whether |
1894 | the memory operations could trap. When INCLUDE_STORES is true and | |
1895 | S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */ | |
75a70cf9 | 1896 | |
e1cc68bd | 1897 | bool |
42acab1c | 1898 | gimple_could_trap_p_1 (gimple *s, bool include_mem, bool include_stores) |
75a70cf9 | 1899 | { |
75a70cf9 | 1900 | tree t, div = NULL_TREE; |
1901 | enum tree_code op; | |
1902 | ||
e1cc68bd | 1903 | if (include_mem) |
1904 | { | |
1905 | unsigned i, start = (is_gimple_assign (s) && !include_stores) ? 1 : 0; | |
75a70cf9 | 1906 | |
e1cc68bd | 1907 | for (i = start; i < gimple_num_ops (s); i++) |
1908 | if (tree_could_trap_p (gimple_op (s, i))) | |
1909 | return true; | |
1910 | } | |
75a70cf9 | 1911 | |
1912 | switch (gimple_code (s)) | |
1913 | { | |
1914 | case GIMPLE_ASM: | |
1a91d914 | 1915 | return gimple_asm_volatile_p (as_a <gasm *> (s)); |
75a70cf9 | 1916 | |
1917 | case GIMPLE_CALL: | |
1918 | t = gimple_call_fndecl (s); | |
1919 | /* Assume that calls to weak functions may trap. */ | |
1920 | if (!t || !DECL_P (t) || DECL_WEAK (t)) | |
1921 | return true; | |
1922 | return false; | |
1923 | ||
1924 | case GIMPLE_ASSIGN: | |
1925 | t = gimple_expr_type (s); | |
1926 | op = gimple_assign_rhs_code (s); | |
1927 | if (get_gimple_rhs_class (op) == GIMPLE_BINARY_RHS) | |
1928 | div = gimple_assign_rhs2 (s); | |
1929 | return (operation_could_trap_p (op, FLOAT_TYPE_P (t), | |
1930 | (INTEGRAL_TYPE_P (t) | |
1931 | && TYPE_OVERFLOW_TRAPS (t)), | |
1932 | div)); | |
1933 | ||
d336d1a7 | 1934 | case GIMPLE_COND: |
1935 | t = TREE_TYPE (gimple_cond_lhs (s)); | |
1936 | return operation_could_trap_p (gimple_cond_code (s), | |
1937 | FLOAT_TYPE_P (t), false, NULL_TREE); | |
1938 | ||
75a70cf9 | 1939 | default: |
1940 | break; | |
1941 | } | |
1942 | ||
1943 | return false; | |
75a70cf9 | 1944 | } |
1945 | ||
75a70cf9 | 1946 | /* Return true if statement S can trap. */ |
1947 | ||
1948 | bool | |
42acab1c | 1949 | gimple_could_trap_p (gimple *s) |
75a70cf9 | 1950 | { |
e1cc68bd | 1951 | return gimple_could_trap_p_1 (s, true, true); |
75a70cf9 | 1952 | } |
1953 | ||
75a70cf9 | 1954 | /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */ |
1955 | ||
1956 | bool | |
42acab1c | 1957 | gimple_assign_rhs_could_trap_p (gimple *s) |
75a70cf9 | 1958 | { |
1959 | gcc_assert (is_gimple_assign (s)); | |
e1cc68bd | 1960 | return gimple_could_trap_p_1 (s, true, false); |
75a70cf9 | 1961 | } |
1962 | ||
1963 | ||
1964 | /* Print debugging information for gimple stmts generated. */ | |
1965 | ||
1966 | void | |
1967 | dump_gimple_statistics (void) | |
1968 | { | |
75a70cf9 | 1969 | int i, total_tuples = 0, total_bytes = 0; |
1970 | ||
ecd52ea9 | 1971 | if (! GATHER_STATISTICS) |
1972 | { | |
1973 | fprintf (stderr, "No gimple statistics\n"); | |
1974 | return; | |
1975 | } | |
1976 | ||
75a70cf9 | 1977 | fprintf (stderr, "\nGIMPLE statements\n"); |
1978 | fprintf (stderr, "Kind Stmts Bytes\n"); | |
1979 | fprintf (stderr, "---------------------------------------\n"); | |
1980 | for (i = 0; i < (int) gimple_alloc_kind_all; ++i) | |
1981 | { | |
1982 | fprintf (stderr, "%-20s %7d %10d\n", gimple_alloc_kind_names[i], | |
1983 | gimple_alloc_counts[i], gimple_alloc_sizes[i]); | |
1984 | total_tuples += gimple_alloc_counts[i]; | |
1985 | total_bytes += gimple_alloc_sizes[i]; | |
1986 | } | |
1987 | fprintf (stderr, "---------------------------------------\n"); | |
1988 | fprintf (stderr, "%-20s %7d %10d\n", "Total", total_tuples, total_bytes); | |
1989 | fprintf (stderr, "---------------------------------------\n"); | |
75a70cf9 | 1990 | } |
1991 | ||
1992 | ||
75a70cf9 | 1993 | /* Return the number of operands needed on the RHS of a GIMPLE |
1994 | assignment for an expression with tree code CODE. */ | |
1995 | ||
1996 | unsigned | |
1997 | get_gimple_rhs_num_ops (enum tree_code code) | |
1998 | { | |
1999 | enum gimple_rhs_class rhs_class = get_gimple_rhs_class (code); | |
2000 | ||
2001 | if (rhs_class == GIMPLE_UNARY_RHS || rhs_class == GIMPLE_SINGLE_RHS) | |
2002 | return 1; | |
2003 | else if (rhs_class == GIMPLE_BINARY_RHS) | |
2004 | return 2; | |
00f4f705 | 2005 | else if (rhs_class == GIMPLE_TERNARY_RHS) |
2006 | return 3; | |
75a70cf9 | 2007 | else |
2008 | gcc_unreachable (); | |
2009 | } | |
2010 | ||
2011 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \ | |
2012 | (unsigned char) \ | |
2013 | ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \ | |
2014 | : ((TYPE) == tcc_binary \ | |
2015 | || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \ | |
2016 | : ((TYPE) == tcc_constant \ | |
2017 | || (TYPE) == tcc_declaration \ | |
2018 | || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \ | |
2019 | : ((SYM) == TRUTH_AND_EXPR \ | |
2020 | || (SYM) == TRUTH_OR_EXPR \ | |
2021 | || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \ | |
2022 | : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \ | |
8a2caf10 | 2023 | : ((SYM) == COND_EXPR \ |
2024 | || (SYM) == WIDEN_MULT_PLUS_EXPR \ | |
b9be572e | 2025 | || (SYM) == WIDEN_MULT_MINUS_EXPR \ |
c86930b0 | 2026 | || (SYM) == DOT_PROD_EXPR \ |
a2287001 | 2027 | || (SYM) == SAD_EXPR \ |
c86930b0 | 2028 | || (SYM) == REALIGN_LOAD_EXPR \ |
8a2caf10 | 2029 | || (SYM) == VEC_COND_EXPR \ |
f4803722 | 2030 | || (SYM) == VEC_PERM_EXPR \ |
b9be572e | 2031 | || (SYM) == FMA_EXPR) ? GIMPLE_TERNARY_RHS \ |
8a2caf10 | 2032 | : ((SYM) == CONSTRUCTOR \ |
75a70cf9 | 2033 | || (SYM) == OBJ_TYPE_REF \ |
2034 | || (SYM) == ASSERT_EXPR \ | |
2035 | || (SYM) == ADDR_EXPR \ | |
2036 | || (SYM) == WITH_SIZE_EXPR \ | |
8a2caf10 | 2037 | || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \ |
75a70cf9 | 2038 | : GIMPLE_INVALID_RHS), |
2039 | #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS, | |
2040 | ||
2041 | const unsigned char gimple_rhs_class_table[] = { | |
2042 | #include "all-tree.def" | |
2043 | }; | |
2044 | ||
2045 | #undef DEFTREECODE | |
2046 | #undef END_OF_BASE_TREE_CODES | |
2047 | ||
75a70cf9 | 2048 | /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns |
2049 | a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if | |
2050 | we failed to create one. */ | |
2051 | ||
2052 | tree | |
2053 | canonicalize_cond_expr_cond (tree t) | |
2054 | { | |
abd3c475 | 2055 | /* Strip conversions around boolean operations. */ |
2056 | if (CONVERT_EXPR_P (t) | |
75200312 | 2057 | && (truth_value_p (TREE_CODE (TREE_OPERAND (t, 0))) |
2058 | || TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) | |
2059 | == BOOLEAN_TYPE)) | |
abd3c475 | 2060 | t = TREE_OPERAND (t, 0); |
2061 | ||
75a70cf9 | 2062 | /* For !x use x == 0. */ |
71b5c25e | 2063 | if (TREE_CODE (t) == TRUTH_NOT_EXPR) |
75a70cf9 | 2064 | { |
2065 | tree top0 = TREE_OPERAND (t, 0); | |
2066 | t = build2 (EQ_EXPR, TREE_TYPE (t), | |
2067 | top0, build_int_cst (TREE_TYPE (top0), 0)); | |
2068 | } | |
2069 | /* For cmp ? 1 : 0 use cmp. */ | |
2070 | else if (TREE_CODE (t) == COND_EXPR | |
2071 | && COMPARISON_CLASS_P (TREE_OPERAND (t, 0)) | |
2072 | && integer_onep (TREE_OPERAND (t, 1)) | |
2073 | && integer_zerop (TREE_OPERAND (t, 2))) | |
2074 | { | |
2075 | tree top0 = TREE_OPERAND (t, 0); | |
2076 | t = build2 (TREE_CODE (top0), TREE_TYPE (t), | |
2077 | TREE_OPERAND (top0, 0), TREE_OPERAND (top0, 1)); | |
2078 | } | |
d701b871 | 2079 | /* For x ^ y use x != y. */ |
2080 | else if (TREE_CODE (t) == BIT_XOR_EXPR) | |
2081 | t = build2 (NE_EXPR, TREE_TYPE (t), | |
2082 | TREE_OPERAND (t, 0), TREE_OPERAND (t, 1)); | |
2083 | ||
75a70cf9 | 2084 | if (is_gimple_condexpr (t)) |
2085 | return t; | |
2086 | ||
2087 | return NULL_TREE; | |
2088 | } | |
2089 | ||
09c20c11 | 2090 | /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in |
2091 | the positions marked by the set ARGS_TO_SKIP. */ | |
2092 | ||
1a91d914 | 2093 | gcall * |
2094 | gimple_call_copy_skip_args (gcall *stmt, bitmap args_to_skip) | |
5afe38fe | 2095 | { |
2096 | int i; | |
5afe38fe | 2097 | int nargs = gimple_call_num_args (stmt); |
c2078b80 | 2098 | auto_vec<tree> vargs (nargs); |
1a91d914 | 2099 | gcall *new_stmt; |
5afe38fe | 2100 | |
2101 | for (i = 0; i < nargs; i++) | |
2102 | if (!bitmap_bit_p (args_to_skip, i)) | |
f1f41a6c | 2103 | vargs.quick_push (gimple_call_arg (stmt, i)); |
5afe38fe | 2104 | |
fb049fba | 2105 | if (gimple_call_internal_p (stmt)) |
2106 | new_stmt = gimple_build_call_internal_vec (gimple_call_internal_fn (stmt), | |
2107 | vargs); | |
2108 | else | |
2109 | new_stmt = gimple_build_call_vec (gimple_call_fn (stmt), vargs); | |
c2078b80 | 2110 | |
5afe38fe | 2111 | if (gimple_call_lhs (stmt)) |
2112 | gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt)); | |
2113 | ||
dd277d48 | 2114 | gimple_set_vuse (new_stmt, gimple_vuse (stmt)); |
2115 | gimple_set_vdef (new_stmt, gimple_vdef (stmt)); | |
2116 | ||
5afe38fe | 2117 | if (gimple_has_location (stmt)) |
2118 | gimple_set_location (new_stmt, gimple_location (stmt)); | |
91aba934 | 2119 | gimple_call_copy_flags (new_stmt, stmt); |
5afe38fe | 2120 | gimple_call_set_chain (new_stmt, gimple_call_chain (stmt)); |
dd277d48 | 2121 | |
2122 | gimple_set_modified (new_stmt, true); | |
2123 | ||
5afe38fe | 2124 | return new_stmt; |
2125 | } | |
2126 | ||
dd277d48 | 2127 | |
7bfefa9d | 2128 | |
a1072234 | 2129 | /* Return true if the field decls F1 and F2 are at the same offset. |
2130 | ||
e7e718d0 | 2131 | This is intended to be used on GIMPLE types only. */ |
7bfefa9d | 2132 | |
67b18080 | 2133 | bool |
a1072234 | 2134 | gimple_compare_field_offset (tree f1, tree f2) |
7bfefa9d | 2135 | { |
2136 | if (DECL_OFFSET_ALIGN (f1) == DECL_OFFSET_ALIGN (f2)) | |
a1072234 | 2137 | { |
2138 | tree offset1 = DECL_FIELD_OFFSET (f1); | |
2139 | tree offset2 = DECL_FIELD_OFFSET (f2); | |
2140 | return ((offset1 == offset2 | |
2141 | /* Once gimplification is done, self-referential offsets are | |
2142 | instantiated as operand #2 of the COMPONENT_REF built for | |
2143 | each access and reset. Therefore, they are not relevant | |
2144 | anymore and fields are interchangeable provided that they | |
2145 | represent the same access. */ | |
2146 | || (TREE_CODE (offset1) == PLACEHOLDER_EXPR | |
2147 | && TREE_CODE (offset2) == PLACEHOLDER_EXPR | |
2148 | && (DECL_SIZE (f1) == DECL_SIZE (f2) | |
2149 | || (TREE_CODE (DECL_SIZE (f1)) == PLACEHOLDER_EXPR | |
2150 | && TREE_CODE (DECL_SIZE (f2)) == PLACEHOLDER_EXPR) | |
2151 | || operand_equal_p (DECL_SIZE (f1), DECL_SIZE (f2), 0)) | |
2152 | && DECL_ALIGN (f1) == DECL_ALIGN (f2)) | |
2153 | || operand_equal_p (offset1, offset2, 0)) | |
2154 | && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1), | |
2155 | DECL_FIELD_BIT_OFFSET (f2))); | |
2156 | } | |
7bfefa9d | 2157 | |
2158 | /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN | |
2159 | should be, so handle differing ones specially by decomposing | |
2160 | the offset into a byte and bit offset manually. */ | |
e913b5cd | 2161 | if (tree_fits_shwi_p (DECL_FIELD_OFFSET (f1)) |
2162 | && tree_fits_shwi_p (DECL_FIELD_OFFSET (f2))) | |
7bfefa9d | 2163 | { |
2164 | unsigned HOST_WIDE_INT byte_offset1, byte_offset2; | |
2165 | unsigned HOST_WIDE_INT bit_offset1, bit_offset2; | |
f9ae6f95 | 2166 | bit_offset1 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1)); |
2167 | byte_offset1 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1)) | |
7bfefa9d | 2168 | + bit_offset1 / BITS_PER_UNIT); |
f9ae6f95 | 2169 | bit_offset2 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2)); |
2170 | byte_offset2 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2)) | |
7bfefa9d | 2171 | + bit_offset2 / BITS_PER_UNIT); |
2172 | if (byte_offset1 != byte_offset2) | |
2173 | return false; | |
2174 | return bit_offset1 % BITS_PER_UNIT == bit_offset2 % BITS_PER_UNIT; | |
2175 | } | |
2176 | ||
2177 | return false; | |
2178 | } | |
2179 | ||
7bfefa9d | 2180 | |
2181 | /* Return a type the same as TYPE except unsigned or | |
2182 | signed according to UNSIGNEDP. */ | |
2183 | ||
2184 | static tree | |
2185 | gimple_signed_or_unsigned_type (bool unsignedp, tree type) | |
2186 | { | |
2187 | tree type1; | |
9f75f026 | 2188 | int i; |
7bfefa9d | 2189 | |
2190 | type1 = TYPE_MAIN_VARIANT (type); | |
2191 | if (type1 == signed_char_type_node | |
2192 | || type1 == char_type_node | |
2193 | || type1 == unsigned_char_type_node) | |
2194 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2195 | if (type1 == integer_type_node || type1 == unsigned_type_node) | |
2196 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2197 | if (type1 == short_integer_type_node || type1 == short_unsigned_type_node) | |
2198 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2199 | if (type1 == long_integer_type_node || type1 == long_unsigned_type_node) | |
2200 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2201 | if (type1 == long_long_integer_type_node | |
2202 | || type1 == long_long_unsigned_type_node) | |
2203 | return unsignedp | |
2204 | ? long_long_unsigned_type_node | |
2205 | : long_long_integer_type_node; | |
9f75f026 | 2206 | |
2207 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
2208 | if (int_n_enabled_p[i] | |
2209 | && (type1 == int_n_trees[i].unsigned_type | |
2210 | || type1 == int_n_trees[i].signed_type)) | |
2211 | return unsignedp | |
2212 | ? int_n_trees[i].unsigned_type | |
2213 | : int_n_trees[i].signed_type; | |
2214 | ||
7bfefa9d | 2215 | #if HOST_BITS_PER_WIDE_INT >= 64 |
2216 | if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node) | |
2217 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
2218 | #endif | |
2219 | if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node) | |
2220 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2221 | if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node) | |
2222 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2223 | if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node) | |
2224 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2225 | if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node) | |
2226 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2227 | ||
2228 | #define GIMPLE_FIXED_TYPES(NAME) \ | |
2229 | if (type1 == short_ ## NAME ## _type_node \ | |
2230 | || type1 == unsigned_short_ ## NAME ## _type_node) \ | |
2231 | return unsignedp ? unsigned_short_ ## NAME ## _type_node \ | |
2232 | : short_ ## NAME ## _type_node; \ | |
2233 | if (type1 == NAME ## _type_node \ | |
2234 | || type1 == unsigned_ ## NAME ## _type_node) \ | |
2235 | return unsignedp ? unsigned_ ## NAME ## _type_node \ | |
2236 | : NAME ## _type_node; \ | |
2237 | if (type1 == long_ ## NAME ## _type_node \ | |
2238 | || type1 == unsigned_long_ ## NAME ## _type_node) \ | |
2239 | return unsignedp ? unsigned_long_ ## NAME ## _type_node \ | |
2240 | : long_ ## NAME ## _type_node; \ | |
2241 | if (type1 == long_long_ ## NAME ## _type_node \ | |
2242 | || type1 == unsigned_long_long_ ## NAME ## _type_node) \ | |
2243 | return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \ | |
2244 | : long_long_ ## NAME ## _type_node; | |
2245 | ||
2246 | #define GIMPLE_FIXED_MODE_TYPES(NAME) \ | |
2247 | if (type1 == NAME ## _type_node \ | |
2248 | || type1 == u ## NAME ## _type_node) \ | |
2249 | return unsignedp ? u ## NAME ## _type_node \ | |
2250 | : NAME ## _type_node; | |
2251 | ||
2252 | #define GIMPLE_FIXED_TYPES_SAT(NAME) \ | |
2253 | if (type1 == sat_ ## short_ ## NAME ## _type_node \ | |
2254 | || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \ | |
2255 | return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \ | |
2256 | : sat_ ## short_ ## NAME ## _type_node; \ | |
2257 | if (type1 == sat_ ## NAME ## _type_node \ | |
2258 | || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \ | |
2259 | return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \ | |
2260 | : sat_ ## NAME ## _type_node; \ | |
2261 | if (type1 == sat_ ## long_ ## NAME ## _type_node \ | |
2262 | || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \ | |
2263 | return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \ | |
2264 | : sat_ ## long_ ## NAME ## _type_node; \ | |
2265 | if (type1 == sat_ ## long_long_ ## NAME ## _type_node \ | |
2266 | || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \ | |
2267 | return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \ | |
2268 | : sat_ ## long_long_ ## NAME ## _type_node; | |
2269 | ||
2270 | #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \ | |
2271 | if (type1 == sat_ ## NAME ## _type_node \ | |
2272 | || type1 == sat_ ## u ## NAME ## _type_node) \ | |
2273 | return unsignedp ? sat_ ## u ## NAME ## _type_node \ | |
2274 | : sat_ ## NAME ## _type_node; | |
2275 | ||
2276 | GIMPLE_FIXED_TYPES (fract); | |
2277 | GIMPLE_FIXED_TYPES_SAT (fract); | |
2278 | GIMPLE_FIXED_TYPES (accum); | |
2279 | GIMPLE_FIXED_TYPES_SAT (accum); | |
2280 | ||
2281 | GIMPLE_FIXED_MODE_TYPES (qq); | |
2282 | GIMPLE_FIXED_MODE_TYPES (hq); | |
2283 | GIMPLE_FIXED_MODE_TYPES (sq); | |
2284 | GIMPLE_FIXED_MODE_TYPES (dq); | |
2285 | GIMPLE_FIXED_MODE_TYPES (tq); | |
2286 | GIMPLE_FIXED_MODE_TYPES_SAT (qq); | |
2287 | GIMPLE_FIXED_MODE_TYPES_SAT (hq); | |
2288 | GIMPLE_FIXED_MODE_TYPES_SAT (sq); | |
2289 | GIMPLE_FIXED_MODE_TYPES_SAT (dq); | |
2290 | GIMPLE_FIXED_MODE_TYPES_SAT (tq); | |
2291 | GIMPLE_FIXED_MODE_TYPES (ha); | |
2292 | GIMPLE_FIXED_MODE_TYPES (sa); | |
2293 | GIMPLE_FIXED_MODE_TYPES (da); | |
2294 | GIMPLE_FIXED_MODE_TYPES (ta); | |
2295 | GIMPLE_FIXED_MODE_TYPES_SAT (ha); | |
2296 | GIMPLE_FIXED_MODE_TYPES_SAT (sa); | |
2297 | GIMPLE_FIXED_MODE_TYPES_SAT (da); | |
2298 | GIMPLE_FIXED_MODE_TYPES_SAT (ta); | |
2299 | ||
2300 | /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not | |
2301 | the precision; they have precision set to match their range, but | |
2302 | may use a wider mode to match an ABI. If we change modes, we may | |
2303 | wind up with bad conversions. For INTEGER_TYPEs in C, must check | |
2304 | the precision as well, so as to yield correct results for | |
2305 | bit-field types. C++ does not have these separate bit-field | |
2306 | types, and producing a signed or unsigned variant of an | |
2307 | ENUMERAL_TYPE may cause other problems as well. */ | |
2308 | if (!INTEGRAL_TYPE_P (type) | |
2309 | || TYPE_UNSIGNED (type) == unsignedp) | |
2310 | return type; | |
2311 | ||
2312 | #define TYPE_OK(node) \ | |
2313 | (TYPE_MODE (type) == TYPE_MODE (node) \ | |
2314 | && TYPE_PRECISION (type) == TYPE_PRECISION (node)) | |
2315 | if (TYPE_OK (signed_char_type_node)) | |
2316 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2317 | if (TYPE_OK (integer_type_node)) | |
2318 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2319 | if (TYPE_OK (short_integer_type_node)) | |
2320 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2321 | if (TYPE_OK (long_integer_type_node)) | |
2322 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2323 | if (TYPE_OK (long_long_integer_type_node)) | |
2324 | return (unsignedp | |
2325 | ? long_long_unsigned_type_node | |
2326 | : long_long_integer_type_node); | |
9f75f026 | 2327 | |
2328 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
2329 | if (int_n_enabled_p[i] | |
2330 | && TYPE_MODE (type) == int_n_data[i].m | |
2331 | && TYPE_PRECISION (type) == int_n_data[i].bitsize) | |
2332 | return unsignedp | |
2333 | ? int_n_trees[i].unsigned_type | |
2334 | : int_n_trees[i].signed_type; | |
7bfefa9d | 2335 | |
2336 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
2337 | if (TYPE_OK (intTI_type_node)) | |
2338 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
2339 | #endif | |
2340 | if (TYPE_OK (intDI_type_node)) | |
2341 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2342 | if (TYPE_OK (intSI_type_node)) | |
2343 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2344 | if (TYPE_OK (intHI_type_node)) | |
2345 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2346 | if (TYPE_OK (intQI_type_node)) | |
2347 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2348 | ||
2349 | #undef GIMPLE_FIXED_TYPES | |
2350 | #undef GIMPLE_FIXED_MODE_TYPES | |
2351 | #undef GIMPLE_FIXED_TYPES_SAT | |
2352 | #undef GIMPLE_FIXED_MODE_TYPES_SAT | |
2353 | #undef TYPE_OK | |
2354 | ||
2355 | return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp); | |
2356 | } | |
2357 | ||
2358 | ||
2359 | /* Return an unsigned type the same as TYPE in other respects. */ | |
2360 | ||
2361 | tree | |
2362 | gimple_unsigned_type (tree type) | |
2363 | { | |
2364 | return gimple_signed_or_unsigned_type (true, type); | |
2365 | } | |
2366 | ||
2367 | ||
2368 | /* Return a signed type the same as TYPE in other respects. */ | |
2369 | ||
2370 | tree | |
2371 | gimple_signed_type (tree type) | |
2372 | { | |
2373 | return gimple_signed_or_unsigned_type (false, type); | |
2374 | } | |
2375 | ||
2376 | ||
2377 | /* Return the typed-based alias set for T, which may be an expression | |
2378 | or a type. Return -1 if we don't do anything special. */ | |
2379 | ||
2380 | alias_set_type | |
2381 | gimple_get_alias_set (tree t) | |
2382 | { | |
2383 | tree u; | |
2384 | ||
2385 | /* Permit type-punning when accessing a union, provided the access | |
2386 | is directly through the union. For example, this code does not | |
2387 | permit taking the address of a union member and then storing | |
2388 | through it. Even the type-punning allowed here is a GCC | |
2389 | extension, albeit a common and useful one; the C standard says | |
2390 | that such accesses have implementation-defined behavior. */ | |
2391 | for (u = t; | |
2392 | TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF; | |
2393 | u = TREE_OPERAND (u, 0)) | |
2394 | if (TREE_CODE (u) == COMPONENT_REF | |
2395 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE) | |
2396 | return 0; | |
2397 | ||
2398 | /* That's all the expressions we handle specially. */ | |
2399 | if (!TYPE_P (t)) | |
2400 | return -1; | |
2401 | ||
2402 | /* For convenience, follow the C standard when dealing with | |
2403 | character types. Any object may be accessed via an lvalue that | |
2404 | has character type. */ | |
2405 | if (t == char_type_node | |
2406 | || t == signed_char_type_node | |
2407 | || t == unsigned_char_type_node) | |
2408 | return 0; | |
2409 | ||
2410 | /* Allow aliasing between signed and unsigned variants of the same | |
2411 | type. We treat the signed variant as canonical. */ | |
2412 | if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t)) | |
2413 | { | |
2414 | tree t1 = gimple_signed_type (t); | |
2415 | ||
2416 | /* t1 == t can happen for boolean nodes which are always unsigned. */ | |
2417 | if (t1 != t) | |
2418 | return get_alias_set (t1); | |
2419 | } | |
7bfefa9d | 2420 | |
2421 | return -1; | |
2422 | } | |
2423 | ||
2424 | ||
6d5ec6f8 | 2425 | /* Helper for gimple_ior_addresses_taken_1. */ |
2426 | ||
2427 | static bool | |
42acab1c | 2428 | gimple_ior_addresses_taken_1 (gimple *, tree addr, tree, void *data) |
6d5ec6f8 | 2429 | { |
2430 | bitmap addresses_taken = (bitmap)data; | |
7f2d9047 | 2431 | addr = get_base_address (addr); |
2432 | if (addr | |
2433 | && DECL_P (addr)) | |
6d5ec6f8 | 2434 | { |
2435 | bitmap_set_bit (addresses_taken, DECL_UID (addr)); | |
2436 | return true; | |
2437 | } | |
2438 | return false; | |
2439 | } | |
2440 | ||
2441 | /* Set the bit for the uid of all decls that have their address taken | |
2442 | in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there | |
2443 | were any in this stmt. */ | |
2444 | ||
2445 | bool | |
42acab1c | 2446 | gimple_ior_addresses_taken (bitmap addresses_taken, gimple *stmt) |
6d5ec6f8 | 2447 | { |
2448 | return walk_stmt_load_store_addr_ops (stmt, addresses_taken, NULL, NULL, | |
2449 | gimple_ior_addresses_taken_1); | |
2450 | } | |
2451 | ||
34e5cced | 2452 | |
8ded4352 | 2453 | /* Return true when STMTs arguments and return value match those of FNDECL, |
2454 | a decl of a builtin function. */ | |
789a8d72 | 2455 | |
8ded4352 | 2456 | bool |
42acab1c | 2457 | gimple_builtin_call_types_compatible_p (const gimple *stmt, tree fndecl) |
789a8d72 | 2458 | { |
8ded4352 | 2459 | gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl) != NOT_BUILT_IN); |
2460 | ||
2461 | tree ret = gimple_call_lhs (stmt); | |
2462 | if (ret | |
9b657cf1 | 2463 | && !useless_type_conversion_p (TREE_TYPE (ret), |
2464 | TREE_TYPE (TREE_TYPE (fndecl)))) | |
8ded4352 | 2465 | return false; |
2466 | ||
789a8d72 | 2467 | tree targs = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); |
2468 | unsigned nargs = gimple_call_num_args (stmt); | |
2469 | for (unsigned i = 0; i < nargs; ++i) | |
2470 | { | |
2471 | /* Variadic args follow. */ | |
2472 | if (!targs) | |
2473 | return true; | |
2474 | tree arg = gimple_call_arg (stmt, i); | |
9b657cf1 | 2475 | if (!useless_type_conversion_p (TREE_VALUE (targs), TREE_TYPE (arg))) |
789a8d72 | 2476 | return false; |
2477 | targs = TREE_CHAIN (targs); | |
2478 | } | |
2479 | if (targs && !VOID_TYPE_P (TREE_VALUE (targs))) | |
2480 | return false; | |
2481 | return true; | |
2482 | } | |
2483 | ||
8ded4352 | 2484 | /* Return true when STMT is builtins call. */ |
2485 | ||
2486 | bool | |
42acab1c | 2487 | gimple_call_builtin_p (const gimple *stmt) |
8ded4352 | 2488 | { |
2489 | tree fndecl; | |
2490 | if (is_gimple_call (stmt) | |
2491 | && (fndecl = gimple_call_fndecl (stmt)) != NULL_TREE | |
2492 | && DECL_BUILT_IN_CLASS (fndecl) != NOT_BUILT_IN) | |
2493 | return gimple_builtin_call_types_compatible_p (stmt, fndecl); | |
2494 | return false; | |
2495 | } | |
2496 | ||
789a8d72 | 2497 | /* Return true when STMT is builtins call to CLASS. */ |
2498 | ||
2499 | bool | |
42acab1c | 2500 | gimple_call_builtin_p (const gimple *stmt, enum built_in_class klass) |
789a8d72 | 2501 | { |
2502 | tree fndecl; | |
2503 | if (is_gimple_call (stmt) | |
2504 | && (fndecl = gimple_call_fndecl (stmt)) != NULL_TREE | |
2505 | && DECL_BUILT_IN_CLASS (fndecl) == klass) | |
8ded4352 | 2506 | return gimple_builtin_call_types_compatible_p (stmt, fndecl); |
789a8d72 | 2507 | return false; |
2508 | } | |
2509 | ||
2510 | /* Return true when STMT is builtins call to CODE of CLASS. */ | |
3ea38c1f | 2511 | |
2512 | bool | |
42acab1c | 2513 | gimple_call_builtin_p (const gimple *stmt, enum built_in_function code) |
3ea38c1f | 2514 | { |
2515 | tree fndecl; | |
789a8d72 | 2516 | if (is_gimple_call (stmt) |
2517 | && (fndecl = gimple_call_fndecl (stmt)) != NULL_TREE | |
2518 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
2519 | && DECL_FUNCTION_CODE (fndecl) == code) | |
8ded4352 | 2520 | return gimple_builtin_call_types_compatible_p (stmt, fndecl); |
789a8d72 | 2521 | return false; |
3ea38c1f | 2522 | } |
2523 | ||
be03bd18 | 2524 | /* If CALL is a call to a combined_fn (i.e. an internal function or |
2525 | a normal built-in function), return its code, otherwise return | |
2526 | CFN_LAST. */ | |
2527 | ||
2528 | combined_fn | |
2529 | gimple_call_combined_fn (const gimple *stmt) | |
2530 | { | |
2531 | if (const gcall *call = dyn_cast <const gcall *> (stmt)) | |
2532 | { | |
2533 | if (gimple_call_internal_p (call)) | |
2534 | return as_combined_fn (gimple_call_internal_fn (call)); | |
2535 | ||
2536 | tree fndecl = gimple_call_fndecl (stmt); | |
2537 | if (fndecl | |
2538 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
2539 | && gimple_builtin_call_types_compatible_p (stmt, fndecl)) | |
2540 | return as_combined_fn (DECL_FUNCTION_CODE (fndecl)); | |
2541 | } | |
2542 | return CFN_LAST; | |
2543 | } | |
2544 | ||
97cf41ec | 2545 | /* Return true if STMT clobbers memory. STMT is required to be a |
2546 | GIMPLE_ASM. */ | |
2547 | ||
2548 | bool | |
1a91d914 | 2549 | gimple_asm_clobbers_memory_p (const gasm *stmt) |
97cf41ec | 2550 | { |
2551 | unsigned i; | |
2552 | ||
2553 | for (i = 0; i < gimple_asm_nclobbers (stmt); i++) | |
2554 | { | |
2555 | tree op = gimple_asm_clobber_op (stmt, i); | |
2556 | if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op)), "memory") == 0) | |
2557 | return true; | |
2558 | } | |
2559 | ||
2560 | return false; | |
2561 | } | |
32bd7708 | 2562 | |
8f6fa493 | 2563 | /* Dump bitmap SET (assumed to contain VAR_DECLs) to FILE. */ |
69ee5dbb | 2564 | |
8f6fa493 | 2565 | void |
2566 | dump_decl_set (FILE *file, bitmap set) | |
2567 | { | |
2568 | if (set) | |
2569 | { | |
2570 | bitmap_iterator bi; | |
2571 | unsigned i; | |
2572 | ||
2573 | fprintf (file, "{ "); | |
2574 | ||
2575 | EXECUTE_IF_SET_IN_BITMAP (set, 0, i, bi) | |
2576 | { | |
2577 | fprintf (file, "D.%u", i); | |
2578 | fprintf (file, " "); | |
2579 | } | |
2580 | ||
2581 | fprintf (file, "}"); | |
2582 | } | |
2583 | else | |
2584 | fprintf (file, "NIL"); | |
2585 | } | |
69ee5dbb | 2586 | |
ba4d2b2f | 2587 | /* Return true when CALL is a call stmt that definitely doesn't |
2588 | free any memory or makes it unavailable otherwise. */ | |
2589 | bool | |
42acab1c | 2590 | nonfreeing_call_p (gimple *call) |
ba4d2b2f | 2591 | { |
2592 | if (gimple_call_builtin_p (call, BUILT_IN_NORMAL) | |
2593 | && gimple_call_flags (call) & ECF_LEAF) | |
2594 | switch (DECL_FUNCTION_CODE (gimple_call_fndecl (call))) | |
2595 | { | |
2596 | /* Just in case these become ECF_LEAF in the future. */ | |
2597 | case BUILT_IN_FREE: | |
2598 | case BUILT_IN_TM_FREE: | |
2599 | case BUILT_IN_REALLOC: | |
2600 | case BUILT_IN_STACK_RESTORE: | |
2601 | return false; | |
2602 | default: | |
2603 | return true; | |
2604 | } | |
04c849b3 | 2605 | else if (gimple_call_internal_p (call)) |
2606 | switch (gimple_call_internal_fn (call)) | |
2607 | { | |
2608 | case IFN_ABNORMAL_DISPATCHER: | |
2609 | return true; | |
2610 | default: | |
2611 | if (gimple_call_flags (call) & ECF_LEAF) | |
2612 | return true; | |
2613 | return false; | |
2614 | } | |
ba4d2b2f | 2615 | |
04c849b3 | 2616 | tree fndecl = gimple_call_fndecl (call); |
2617 | if (!fndecl) | |
2618 | return false; | |
2619 | struct cgraph_node *n = cgraph_node::get (fndecl); | |
2620 | if (!n) | |
2621 | return false; | |
2622 | enum availability availability; | |
2623 | n = n->function_symbol (&availability); | |
2624 | if (!n || availability <= AVAIL_INTERPOSABLE) | |
2625 | return false; | |
2626 | return n->nonfreeing_fn; | |
ba4d2b2f | 2627 | } |
7740abd8 | 2628 | |
05a63389 | 2629 | /* Return true when CALL is a call stmt that definitely need not |
2630 | be considered to be a memory barrier. */ | |
2631 | bool | |
2632 | nonbarrier_call_p (gimple *call) | |
2633 | { | |
2634 | if (gimple_call_flags (call) & (ECF_PURE | ECF_CONST)) | |
2635 | return true; | |
2636 | /* Should extend this to have a nonbarrier_fn flag, just as above in | |
2637 | the nonfreeing case. */ | |
2638 | return false; | |
2639 | } | |
2640 | ||
db242b6d | 2641 | /* Callback for walk_stmt_load_store_ops. |
2642 | ||
2643 | Return TRUE if OP will dereference the tree stored in DATA, FALSE | |
2644 | otherwise. | |
7740abd8 | 2645 | |
db242b6d | 2646 | This routine only makes a superficial check for a dereference. Thus |
2647 | it must only be used if it is safe to return a false negative. */ | |
2648 | static bool | |
42acab1c | 2649 | check_loadstore (gimple *, tree op, tree, void *data) |
7740abd8 | 2650 | { |
9cb89654 | 2651 | if (TREE_CODE (op) == MEM_REF || TREE_CODE (op) == TARGET_MEM_REF) |
2652 | { | |
2653 | /* Some address spaces may legitimately dereference zero. */ | |
2654 | addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (op)); | |
2655 | if (targetm.addr_space.zero_address_valid (as)) | |
2656 | return false; | |
2657 | ||
2658 | return operand_equal_p (TREE_OPERAND (op, 0), (tree)data, 0); | |
2659 | } | |
db242b6d | 2660 | return false; |
2661 | } | |
7740abd8 | 2662 | |
30b10261 | 2663 | |
254d68a9 | 2664 | /* Return true if OP can be inferred to be non-NULL after STMT executes, |
2665 | either by using a pointer dereference or attributes. */ | |
2666 | bool | |
42acab1c | 2667 | infer_nonnull_range (gimple *stmt, tree op) |
254d68a9 | 2668 | { |
2669 | return infer_nonnull_range_by_dereference (stmt, op) | |
2670 | || infer_nonnull_range_by_attribute (stmt, op); | |
2671 | } | |
db242b6d | 2672 | |
254d68a9 | 2673 | /* Return true if OP can be inferred to be non-NULL after STMT |
2674 | executes by using a pointer dereference. */ | |
db242b6d | 2675 | bool |
42acab1c | 2676 | infer_nonnull_range_by_dereference (gimple *stmt, tree op) |
db242b6d | 2677 | { |
2678 | /* We can only assume that a pointer dereference will yield | |
2679 | non-NULL if -fdelete-null-pointer-checks is enabled. */ | |
2680 | if (!flag_delete_null_pointer_checks | |
2681 | || !POINTER_TYPE_P (TREE_TYPE (op)) | |
2682 | || gimple_code (stmt) == GIMPLE_ASM) | |
2683 | return false; | |
2684 | ||
254d68a9 | 2685 | if (walk_stmt_load_store_ops (stmt, (void *)op, |
2686 | check_loadstore, check_loadstore)) | |
db242b6d | 2687 | return true; |
2688 | ||
254d68a9 | 2689 | return false; |
2690 | } | |
2691 | ||
2692 | /* Return true if OP can be inferred to be a non-NULL after STMT | |
2693 | executes by using attributes. */ | |
2694 | bool | |
42acab1c | 2695 | infer_nonnull_range_by_attribute (gimple *stmt, tree op) |
254d68a9 | 2696 | { |
2697 | /* We can only assume that a pointer dereference will yield | |
2698 | non-NULL if -fdelete-null-pointer-checks is enabled. */ | |
2699 | if (!flag_delete_null_pointer_checks | |
2700 | || !POINTER_TYPE_P (TREE_TYPE (op)) | |
2701 | || gimple_code (stmt) == GIMPLE_ASM) | |
2702 | return false; | |
2703 | ||
2704 | if (is_gimple_call (stmt) && !gimple_call_internal_p (stmt)) | |
db242b6d | 2705 | { |
2706 | tree fntype = gimple_call_fntype (stmt); | |
2707 | tree attrs = TYPE_ATTRIBUTES (fntype); | |
2708 | for (; attrs; attrs = TREE_CHAIN (attrs)) | |
2709 | { | |
2710 | attrs = lookup_attribute ("nonnull", attrs); | |
2711 | ||
2712 | /* If "nonnull" wasn't specified, we know nothing about | |
2713 | the argument. */ | |
2714 | if (attrs == NULL_TREE) | |
2715 | return false; | |
2716 | ||
2717 | /* If "nonnull" applies to all the arguments, then ARG | |
2718 | is non-null if it's in the argument list. */ | |
2719 | if (TREE_VALUE (attrs) == NULL_TREE) | |
2720 | { | |
2721 | for (unsigned int i = 0; i < gimple_call_num_args (stmt); i++) | |
2722 | { | |
54751bcf | 2723 | if (POINTER_TYPE_P (TREE_TYPE (gimple_call_arg (stmt, i))) |
2724 | && operand_equal_p (op, gimple_call_arg (stmt, i), 0)) | |
db242b6d | 2725 | return true; |
2726 | } | |
2727 | return false; | |
2728 | } | |
2729 | ||
2730 | /* Now see if op appears in the nonnull list. */ | |
2731 | for (tree t = TREE_VALUE (attrs); t; t = TREE_CHAIN (t)) | |
2732 | { | |
1ad08220 | 2733 | unsigned int idx = TREE_INT_CST_LOW (TREE_VALUE (t)) - 1; |
2734 | if (idx < gimple_call_num_args (stmt)) | |
2735 | { | |
2736 | tree arg = gimple_call_arg (stmt, idx); | |
2737 | if (operand_equal_p (op, arg, 0)) | |
2738 | return true; | |
2739 | } | |
db242b6d | 2740 | } |
2741 | } | |
2742 | } | |
2743 | ||
2744 | /* If this function is marked as returning non-null, then we can | |
2745 | infer OP is non-null if it is used in the return statement. */ | |
254d68a9 | 2746 | if (greturn *return_stmt = dyn_cast <greturn *> (stmt)) |
2747 | if (gimple_return_retval (return_stmt) | |
2748 | && operand_equal_p (gimple_return_retval (return_stmt), op, 0) | |
2749 | && lookup_attribute ("returns_nonnull", | |
2750 | TYPE_ATTRIBUTES (TREE_TYPE (current_function_decl)))) | |
2751 | return true; | |
db242b6d | 2752 | |
2753 | return false; | |
7740abd8 | 2754 | } |
a8783bee | 2755 | |
2756 | /* Compare two case labels. Because the front end should already have | |
2757 | made sure that case ranges do not overlap, it is enough to only compare | |
2758 | the CASE_LOW values of each case label. */ | |
2759 | ||
2760 | static int | |
2761 | compare_case_labels (const void *p1, const void *p2) | |
2762 | { | |
2763 | const_tree const case1 = *(const_tree const*)p1; | |
2764 | const_tree const case2 = *(const_tree const*)p2; | |
2765 | ||
2766 | /* The 'default' case label always goes first. */ | |
2767 | if (!CASE_LOW (case1)) | |
2768 | return -1; | |
2769 | else if (!CASE_LOW (case2)) | |
2770 | return 1; | |
2771 | else | |
2772 | return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2)); | |
2773 | } | |
2774 | ||
2775 | /* Sort the case labels in LABEL_VEC in place in ascending order. */ | |
2776 | ||
2777 | void | |
2778 | sort_case_labels (vec<tree> label_vec) | |
2779 | { | |
2780 | label_vec.qsort (compare_case_labels); | |
2781 | } | |
2782 | \f | |
2783 | /* Prepare a vector of case labels to be used in a GIMPLE_SWITCH statement. | |
2784 | ||
2785 | LABELS is a vector that contains all case labels to look at. | |
2786 | ||
2787 | INDEX_TYPE is the type of the switch index expression. Case labels | |
2788 | in LABELS are discarded if their values are not in the value range | |
2789 | covered by INDEX_TYPE. The remaining case label values are folded | |
2790 | to INDEX_TYPE. | |
2791 | ||
2792 | If a default case exists in LABELS, it is removed from LABELS and | |
2793 | returned in DEFAULT_CASEP. If no default case exists, but the | |
2794 | case labels already cover the whole range of INDEX_TYPE, a default | |
2795 | case is returned pointing to one of the existing case labels. | |
2796 | Otherwise DEFAULT_CASEP is set to NULL_TREE. | |
2797 | ||
2798 | DEFAULT_CASEP may be NULL, in which case the above comment doesn't | |
2799 | apply and no action is taken regardless of whether a default case is | |
2800 | found or not. */ | |
2801 | ||
2802 | void | |
2803 | preprocess_case_label_vec_for_gimple (vec<tree> labels, | |
2804 | tree index_type, | |
2805 | tree *default_casep) | |
2806 | { | |
2807 | tree min_value, max_value; | |
2808 | tree default_case = NULL_TREE; | |
2809 | size_t i, len; | |
2810 | ||
2811 | i = 0; | |
2812 | min_value = TYPE_MIN_VALUE (index_type); | |
2813 | max_value = TYPE_MAX_VALUE (index_type); | |
2814 | while (i < labels.length ()) | |
2815 | { | |
2816 | tree elt = labels[i]; | |
2817 | tree low = CASE_LOW (elt); | |
2818 | tree high = CASE_HIGH (elt); | |
2819 | bool remove_element = FALSE; | |
2820 | ||
2821 | if (low) | |
2822 | { | |
2823 | gcc_checking_assert (TREE_CODE (low) == INTEGER_CST); | |
2824 | gcc_checking_assert (!high || TREE_CODE (high) == INTEGER_CST); | |
2825 | ||
2826 | /* This is a non-default case label, i.e. it has a value. | |
2827 | ||
2828 | See if the case label is reachable within the range of | |
2829 | the index type. Remove out-of-range case values. Turn | |
2830 | case ranges into a canonical form (high > low strictly) | |
2831 | and convert the case label values to the index type. | |
2832 | ||
2833 | NB: The type of gimple_switch_index() may be the promoted | |
2834 | type, but the case labels retain the original type. */ | |
2835 | ||
2836 | if (high) | |
2837 | { | |
2838 | /* This is a case range. Discard empty ranges. | |
2839 | If the bounds or the range are equal, turn this | |
2840 | into a simple (one-value) case. */ | |
2841 | int cmp = tree_int_cst_compare (high, low); | |
2842 | if (cmp < 0) | |
2843 | remove_element = TRUE; | |
2844 | else if (cmp == 0) | |
2845 | high = NULL_TREE; | |
2846 | } | |
2847 | ||
2848 | if (! high) | |
2849 | { | |
2850 | /* If the simple case value is unreachable, ignore it. */ | |
2851 | if ((TREE_CODE (min_value) == INTEGER_CST | |
2852 | && tree_int_cst_compare (low, min_value) < 0) | |
2853 | || (TREE_CODE (max_value) == INTEGER_CST | |
2854 | && tree_int_cst_compare (low, max_value) > 0)) | |
2855 | remove_element = TRUE; | |
2856 | else | |
2857 | low = fold_convert (index_type, low); | |
2858 | } | |
2859 | else | |
2860 | { | |
2861 | /* If the entire case range is unreachable, ignore it. */ | |
2862 | if ((TREE_CODE (min_value) == INTEGER_CST | |
2863 | && tree_int_cst_compare (high, min_value) < 0) | |
2864 | || (TREE_CODE (max_value) == INTEGER_CST | |
2865 | && tree_int_cst_compare (low, max_value) > 0)) | |
2866 | remove_element = TRUE; | |
2867 | else | |
2868 | { | |
2869 | /* If the lower bound is less than the index type's | |
2870 | minimum value, truncate the range bounds. */ | |
2871 | if (TREE_CODE (min_value) == INTEGER_CST | |
2872 | && tree_int_cst_compare (low, min_value) < 0) | |
2873 | low = min_value; | |
2874 | low = fold_convert (index_type, low); | |
2875 | ||
2876 | /* If the upper bound is greater than the index type's | |
2877 | maximum value, truncate the range bounds. */ | |
2878 | if (TREE_CODE (max_value) == INTEGER_CST | |
2879 | && tree_int_cst_compare (high, max_value) > 0) | |
2880 | high = max_value; | |
2881 | high = fold_convert (index_type, high); | |
2882 | ||
2883 | /* We may have folded a case range to a one-value case. */ | |
2884 | if (tree_int_cst_equal (low, high)) | |
2885 | high = NULL_TREE; | |
2886 | } | |
2887 | } | |
2888 | ||
2889 | CASE_LOW (elt) = low; | |
2890 | CASE_HIGH (elt) = high; | |
2891 | } | |
2892 | else | |
2893 | { | |
2894 | gcc_assert (!default_case); | |
2895 | default_case = elt; | |
2896 | /* The default case must be passed separately to the | |
2897 | gimple_build_switch routine. But if DEFAULT_CASEP | |
2898 | is NULL, we do not remove the default case (it would | |
2899 | be completely lost). */ | |
2900 | if (default_casep) | |
2901 | remove_element = TRUE; | |
2902 | } | |
2903 | ||
2904 | if (remove_element) | |
2905 | labels.ordered_remove (i); | |
2906 | else | |
2907 | i++; | |
2908 | } | |
2909 | len = i; | |
2910 | ||
2911 | if (!labels.is_empty ()) | |
2912 | sort_case_labels (labels); | |
2913 | ||
2914 | if (default_casep && !default_case) | |
2915 | { | |
2916 | /* If the switch has no default label, add one, so that we jump | |
2917 | around the switch body. If the labels already cover the whole | |
2918 | range of the switch index_type, add the default label pointing | |
2919 | to one of the existing labels. */ | |
2920 | if (len | |
2921 | && TYPE_MIN_VALUE (index_type) | |
2922 | && TYPE_MAX_VALUE (index_type) | |
2923 | && tree_int_cst_equal (CASE_LOW (labels[0]), | |
2924 | TYPE_MIN_VALUE (index_type))) | |
2925 | { | |
2926 | tree low, high = CASE_HIGH (labels[len - 1]); | |
2927 | if (!high) | |
2928 | high = CASE_LOW (labels[len - 1]); | |
2929 | if (tree_int_cst_equal (high, TYPE_MAX_VALUE (index_type))) | |
2930 | { | |
2931 | for (i = 1; i < len; i++) | |
2932 | { | |
2933 | high = CASE_LOW (labels[i]); | |
2934 | low = CASE_HIGH (labels[i - 1]); | |
2935 | if (!low) | |
2936 | low = CASE_LOW (labels[i - 1]); | |
8370b483 | 2937 | if (wi::add (low, 1) != high) |
a8783bee | 2938 | break; |
2939 | } | |
2940 | if (i == len) | |
2941 | { | |
2942 | tree label = CASE_LABEL (labels[0]); | |
2943 | default_case = build_case_label (NULL_TREE, NULL_TREE, | |
2944 | label); | |
2945 | } | |
2946 | } | |
2947 | } | |
2948 | } | |
2949 | ||
2950 | if (default_casep) | |
2951 | *default_casep = default_case; | |
2952 | } | |
dcf1a1ec | 2953 | |
2954 | /* Set the location of all statements in SEQ to LOC. */ | |
2955 | ||
2956 | void | |
2957 | gimple_seq_set_location (gimple_seq seq, location_t loc) | |
2958 | { | |
2959 | for (gimple_stmt_iterator i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i)) | |
2960 | gimple_set_location (gsi_stmt (i), loc); | |
2961 | } | |
e3668db5 | 2962 | |
2963 | /* Release SSA_NAMEs in SEQ as well as the GIMPLE statements. */ | |
2964 | ||
2965 | void | |
2966 | gimple_seq_discard (gimple_seq seq) | |
2967 | { | |
2968 | gimple_stmt_iterator gsi; | |
2969 | ||
2970 | for (gsi = gsi_start (seq); !gsi_end_p (gsi); ) | |
2971 | { | |
42acab1c | 2972 | gimple *stmt = gsi_stmt (gsi); |
e3668db5 | 2973 | gsi_remove (&gsi, true); |
2974 | release_defs (stmt); | |
2975 | ggc_free (stmt); | |
2976 | } | |
2977 | } | |
aee8a3e8 | 2978 | |
2979 | /* See if STMT now calls function that takes no parameters and if so, drop | |
2980 | call arguments. This is used when devirtualization machinery redirects | |
2981 | to __builtiln_unreacahble or __cxa_pure_virutal. */ | |
2982 | ||
2983 | void | |
42acab1c | 2984 | maybe_remove_unused_call_args (struct function *fn, gimple *stmt) |
aee8a3e8 | 2985 | { |
2986 | tree decl = gimple_call_fndecl (stmt); | |
2987 | if (TYPE_ARG_TYPES (TREE_TYPE (decl)) | |
2988 | && TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl))) == void_type_node | |
2989 | && gimple_call_num_args (stmt)) | |
2990 | { | |
2991 | gimple_set_num_ops (stmt, 3); | |
2992 | update_stmt_fn (fn, stmt); | |
2993 | } | |
2994 | } |