]>
Commit | Line | Data |
---|---|---|
726a989a RB |
1 | /* Gimple IR support functions. |
2 | ||
99dee823 | 3 | Copyright (C) 2007-2021 Free Software Foundation, Inc. |
726a989a RB |
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" | |
c7131fb2 AM |
25 | #include "backend.h" |
26 | #include "tree.h" | |
27 | #include "gimple.h" | |
c7131fb2 | 28 | #include "ssa.h" |
957060b5 AM |
29 | #include "cgraph.h" |
30 | #include "diagnostic.h" | |
40e23961 | 31 | #include "alias.h" |
40e23961 | 32 | #include "fold-const.h" |
d8a2d370 | 33 | #include "calls.h" |
d8a2d370 | 34 | #include "stor-layout.h" |
2fb9a547 AM |
35 | #include "internal-fn.h" |
36 | #include "tree-eh.h" | |
5be5c238 AM |
37 | #include "gimple-iterator.h" |
38 | #include "gimple-walk.h" | |
45b0be94 | 39 | #include "gimplify.h" |
6626f970 | 40 | #include "target.h" |
ce120587 | 41 | #include "builtins.h" |
d9b950dd DM |
42 | #include "selftest.h" |
43 | #include "gimple-pretty-print.h" | |
314e6352 ML |
44 | #include "stringpool.h" |
45 | #include "attribs.h" | |
6dc4a604 | 46 | #include "asan.h" |
2a82beaa | 47 | #include "langhooks.h" |
05d39f0d | 48 | #include "attr-fnspec.h" |
520d5ad3 JH |
49 | #include "ipa-modref-tree.h" |
50 | #include "ipa-modref.h" | |
6f1a3668 | 51 | #include "dbgcnt.h" |
d7f09764 | 52 | |
f2c4a81c | 53 | /* All the tuples have their operand vector (if present) at the very bottom |
726a989a RB |
54 | of the structure. Therefore, the offset required to find the |
55 | operands vector the size of the structure minus the size of the 1 | |
56 | element tree array at the end (see gimple_ops). */ | |
f2c4a81c RH |
57 | #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \ |
58 | (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0), | |
6bc7bc14 | 59 | EXPORTED_CONST size_t gimple_ops_offset_[] = { |
f2c4a81c RH |
60 | #include "gsstruct.def" |
61 | }; | |
62 | #undef DEFGSSTRUCT | |
63 | ||
c3284718 | 64 | #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof (struct STRUCT), |
f2c4a81c RH |
65 | static const size_t gsstruct_code_size[] = { |
66 | #include "gsstruct.def" | |
67 | }; | |
68 | #undef DEFGSSTRUCT | |
69 | ||
70 | #define DEFGSCODE(SYM, NAME, GSSCODE) NAME, | |
71 | const char *const gimple_code_name[] = { | |
72 | #include "gimple.def" | |
73 | }; | |
74 | #undef DEFGSCODE | |
75 | ||
76 | #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE, | |
77 | EXPORTED_CONST enum gimple_statement_structure_enum gss_for_code_[] = { | |
726a989a RB |
78 | #include "gimple.def" |
79 | }; | |
80 | #undef DEFGSCODE | |
81 | ||
726a989a RB |
82 | /* Gimple stats. */ |
83 | ||
33b366c3 ML |
84 | uint64_t gimple_alloc_counts[(int) gimple_alloc_kind_all]; |
85 | uint64_t gimple_alloc_sizes[(int) gimple_alloc_kind_all]; | |
726a989a RB |
86 | |
87 | /* Keep in sync with gimple.h:enum gimple_alloc_kind. */ | |
88 | static const char * const gimple_alloc_kind_names[] = { | |
89 | "assignments", | |
90 | "phi nodes", | |
91 | "conditionals", | |
726a989a RB |
92 | "everything else" |
93 | }; | |
94 | ||
bde351d5 RB |
95 | /* Static gimple tuple members. */ |
96 | const enum gimple_code gassign::code_; | |
003b40ae RB |
97 | const enum gimple_code gcall::code_; |
98 | const enum gimple_code gcond::code_; | |
bde351d5 RB |
99 | |
100 | ||
726a989a RB |
101 | /* Gimple tuple constructors. |
102 | Note: Any constructor taking a ``gimple_seq'' as a parameter, can | |
103 | be passed a NULL to start with an empty sequence. */ | |
104 | ||
105 | /* Set the code for statement G to CODE. */ | |
106 | ||
107 | static inline void | |
355fe088 | 108 | gimple_set_code (gimple *g, enum gimple_code code) |
726a989a | 109 | { |
daa6e488 | 110 | g->code = code; |
726a989a RB |
111 | } |
112 | ||
726a989a RB |
113 | /* Return the number of bytes needed to hold a GIMPLE statement with |
114 | code CODE. */ | |
115 | ||
5f487a34 LJH |
116 | size_t |
117 | gimple_size (enum gimple_code code, unsigned num_ops) | |
726a989a | 118 | { |
5f487a34 LJH |
119 | size_t size = gsstruct_code_size[gss_for_code (code)]; |
120 | if (num_ops > 0) | |
121 | size += (sizeof (tree) * (num_ops - 1)); | |
122 | return size; | |
123 | } | |
124 | ||
125 | /* Initialize GIMPLE statement G with CODE and NUM_OPS. */ | |
126 | ||
127 | void | |
128 | gimple_init (gimple *g, enum gimple_code code, unsigned num_ops) | |
129 | { | |
130 | gimple_set_code (g, code); | |
131 | gimple_set_num_ops (g, num_ops); | |
132 | ||
133 | /* Do not call gimple_set_modified here as it has other side | |
134 | effects and this tuple is still not completely built. */ | |
135 | g->modified = 1; | |
136 | gimple_init_singleton (g); | |
726a989a RB |
137 | } |
138 | ||
726a989a RB |
139 | /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS |
140 | operands. */ | |
141 | ||
355fe088 | 142 | gimple * |
9e2d7f46 | 143 | gimple_alloc (enum gimple_code code, unsigned num_ops MEM_STAT_DECL) |
726a989a RB |
144 | { |
145 | size_t size; | |
355fe088 | 146 | gimple *stmt; |
726a989a | 147 | |
5f487a34 | 148 | size = gimple_size (code, num_ops); |
7aa6d18a SB |
149 | if (GATHER_STATISTICS) |
150 | { | |
151 | enum gimple_alloc_kind kind = gimple_alloc_kind (code); | |
152 | gimple_alloc_counts[(int) kind]++; | |
153 | gimple_alloc_sizes[(int) kind] += size; | |
154 | } | |
726a989a | 155 | |
daa6e488 | 156 | stmt = ggc_alloc_cleared_gimple_statement_stat (size PASS_MEM_STAT); |
5f487a34 | 157 | gimple_init (stmt, code, num_ops); |
726a989a RB |
158 | return stmt; |
159 | } | |
160 | ||
161 | /* Set SUBCODE to be the code of the expression computed by statement G. */ | |
162 | ||
163 | static inline void | |
355fe088 | 164 | gimple_set_subcode (gimple *g, unsigned subcode) |
726a989a RB |
165 | { |
166 | /* We only have 16 bits for the RHS code. Assert that we are not | |
167 | overflowing it. */ | |
168 | gcc_assert (subcode < (1 << 16)); | |
daa6e488 | 169 | g->subcode = subcode; |
726a989a RB |
170 | } |
171 | ||
172 | ||
173 | ||
174 | /* Build a tuple with operands. CODE is the statement to build (which | |
7d05cebb | 175 | must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the subcode |
b8698a0f | 176 | for the new tuple. NUM_OPS is the number of operands to allocate. */ |
726a989a RB |
177 | |
178 | #define gimple_build_with_ops(c, s, n) \ | |
179 | gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO) | |
180 | ||
355fe088 | 181 | static gimple * |
b5b8b0ac | 182 | gimple_build_with_ops_stat (enum gimple_code code, unsigned subcode, |
726a989a RB |
183 | unsigned num_ops MEM_STAT_DECL) |
184 | { | |
9e2d7f46 | 185 | gimple *s = gimple_alloc (code, num_ops PASS_MEM_STAT); |
726a989a RB |
186 | gimple_set_subcode (s, subcode); |
187 | ||
188 | return s; | |
189 | } | |
190 | ||
191 | ||
192 | /* Build a GIMPLE_RETURN statement returning RETVAL. */ | |
193 | ||
538dd0b7 | 194 | greturn * |
726a989a RB |
195 | gimple_build_return (tree retval) |
196 | { | |
538dd0b7 DM |
197 | greturn *s |
198 | = as_a <greturn *> (gimple_build_with_ops (GIMPLE_RETURN, ERROR_MARK, | |
199 | 2)); | |
726a989a RB |
200 | if (retval) |
201 | gimple_return_set_retval (s, retval); | |
202 | return s; | |
203 | } | |
204 | ||
d086d311 RG |
205 | /* Reset alias information on call S. */ |
206 | ||
207 | void | |
538dd0b7 | 208 | gimple_call_reset_alias_info (gcall *s) |
d086d311 RG |
209 | { |
210 | if (gimple_call_flags (s) & ECF_CONST) | |
211 | memset (gimple_call_use_set (s), 0, sizeof (struct pt_solution)); | |
212 | else | |
213 | pt_solution_reset (gimple_call_use_set (s)); | |
214 | if (gimple_call_flags (s) & (ECF_CONST|ECF_PURE|ECF_NOVOPS)) | |
215 | memset (gimple_call_clobber_set (s), 0, sizeof (struct pt_solution)); | |
216 | else | |
217 | pt_solution_reset (gimple_call_clobber_set (s)); | |
218 | } | |
219 | ||
21860814 JJ |
220 | /* Helper for gimple_build_call, gimple_build_call_valist, |
221 | gimple_build_call_vec and gimple_build_call_from_tree. Build the basic | |
222 | components of a GIMPLE_CALL statement to function FN with NARGS | |
223 | arguments. */ | |
726a989a | 224 | |
538dd0b7 | 225 | static inline gcall * |
726a989a RB |
226 | gimple_build_call_1 (tree fn, unsigned nargs) |
227 | { | |
538dd0b7 DM |
228 | gcall *s |
229 | = as_a <gcall *> (gimple_build_with_ops (GIMPLE_CALL, ERROR_MARK, | |
230 | nargs + 3)); | |
7c9577be RG |
231 | if (TREE_CODE (fn) == FUNCTION_DECL) |
232 | fn = build_fold_addr_expr (fn); | |
726a989a | 233 | gimple_set_op (s, 1, fn); |
f20ca725 | 234 | gimple_call_set_fntype (s, TREE_TYPE (TREE_TYPE (fn))); |
d086d311 | 235 | gimple_call_reset_alias_info (s); |
726a989a RB |
236 | return s; |
237 | } | |
238 | ||
239 | ||
240 | /* Build a GIMPLE_CALL statement to function FN with the arguments | |
241 | specified in vector ARGS. */ | |
242 | ||
538dd0b7 | 243 | gcall * |
00dcc88a | 244 | gimple_build_call_vec (tree fn, const vec<tree> &args) |
726a989a RB |
245 | { |
246 | unsigned i; | |
9771b263 | 247 | unsigned nargs = args.length (); |
538dd0b7 | 248 | gcall *call = gimple_build_call_1 (fn, nargs); |
726a989a RB |
249 | |
250 | for (i = 0; i < nargs; i++) | |
9771b263 | 251 | gimple_call_set_arg (call, i, args[i]); |
726a989a RB |
252 | |
253 | return call; | |
254 | } | |
255 | ||
256 | ||
257 | /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of | |
258 | arguments. The ... are the arguments. */ | |
259 | ||
538dd0b7 | 260 | gcall * |
726a989a RB |
261 | gimple_build_call (tree fn, unsigned nargs, ...) |
262 | { | |
263 | va_list ap; | |
538dd0b7 | 264 | gcall *call; |
726a989a RB |
265 | unsigned i; |
266 | ||
267 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL || is_gimple_call_addr (fn)); | |
268 | ||
269 | call = gimple_build_call_1 (fn, nargs); | |
270 | ||
271 | va_start (ap, nargs); | |
272 | for (i = 0; i < nargs; i++) | |
273 | gimple_call_set_arg (call, i, va_arg (ap, tree)); | |
274 | va_end (ap); | |
275 | ||
276 | return call; | |
277 | } | |
278 | ||
279 | ||
21860814 JJ |
280 | /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of |
281 | arguments. AP contains the arguments. */ | |
282 | ||
538dd0b7 | 283 | gcall * |
21860814 JJ |
284 | gimple_build_call_valist (tree fn, unsigned nargs, va_list ap) |
285 | { | |
538dd0b7 | 286 | gcall *call; |
21860814 JJ |
287 | unsigned i; |
288 | ||
289 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL || is_gimple_call_addr (fn)); | |
290 | ||
291 | call = gimple_build_call_1 (fn, nargs); | |
292 | ||
293 | for (i = 0; i < nargs; i++) | |
294 | gimple_call_set_arg (call, i, va_arg (ap, tree)); | |
295 | ||
296 | return call; | |
297 | } | |
298 | ||
299 | ||
25583c4f RS |
300 | /* Helper for gimple_build_call_internal and gimple_build_call_internal_vec. |
301 | Build the basic components of a GIMPLE_CALL statement to internal | |
302 | function FN with NARGS arguments. */ | |
303 | ||
538dd0b7 | 304 | static inline gcall * |
25583c4f RS |
305 | gimple_build_call_internal_1 (enum internal_fn fn, unsigned nargs) |
306 | { | |
538dd0b7 DM |
307 | gcall *s |
308 | = as_a <gcall *> (gimple_build_with_ops (GIMPLE_CALL, ERROR_MARK, | |
309 | nargs + 3)); | |
daa6e488 | 310 | s->subcode |= GF_CALL_INTERNAL; |
25583c4f RS |
311 | gimple_call_set_internal_fn (s, fn); |
312 | gimple_call_reset_alias_info (s); | |
313 | return s; | |
314 | } | |
315 | ||
316 | ||
317 | /* Build a GIMPLE_CALL statement to internal function FN. NARGS is | |
318 | the number of arguments. The ... are the arguments. */ | |
319 | ||
538dd0b7 | 320 | gcall * |
25583c4f RS |
321 | gimple_build_call_internal (enum internal_fn fn, unsigned nargs, ...) |
322 | { | |
323 | va_list ap; | |
538dd0b7 | 324 | gcall *call; |
25583c4f RS |
325 | unsigned i; |
326 | ||
327 | call = gimple_build_call_internal_1 (fn, nargs); | |
328 | va_start (ap, nargs); | |
329 | for (i = 0; i < nargs; i++) | |
330 | gimple_call_set_arg (call, i, va_arg (ap, tree)); | |
331 | va_end (ap); | |
332 | ||
333 | return call; | |
334 | } | |
335 | ||
336 | ||
337 | /* Build a GIMPLE_CALL statement to internal function FN with the arguments | |
338 | specified in vector ARGS. */ | |
339 | ||
538dd0b7 | 340 | gcall * |
00dcc88a | 341 | gimple_build_call_internal_vec (enum internal_fn fn, const vec<tree> &args) |
25583c4f RS |
342 | { |
343 | unsigned i, nargs; | |
538dd0b7 | 344 | gcall *call; |
25583c4f | 345 | |
9771b263 | 346 | nargs = args.length (); |
25583c4f RS |
347 | call = gimple_build_call_internal_1 (fn, nargs); |
348 | for (i = 0; i < nargs; i++) | |
9771b263 | 349 | gimple_call_set_arg (call, i, args[i]); |
25583c4f RS |
350 | |
351 | return call; | |
352 | } | |
353 | ||
354 | ||
726a989a RB |
355 | /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is |
356 | assumed to be in GIMPLE form already. Minimal checking is done of | |
357 | this fact. */ | |
358 | ||
538dd0b7 | 359 | gcall * |
5c5f0b65 | 360 | gimple_build_call_from_tree (tree t, tree fnptrtype) |
726a989a RB |
361 | { |
362 | unsigned i, nargs; | |
538dd0b7 | 363 | gcall *call; |
726a989a RB |
364 | |
365 | gcc_assert (TREE_CODE (t) == CALL_EXPR); | |
366 | ||
367 | nargs = call_expr_nargs (t); | |
e4f81565 RS |
368 | |
369 | tree fndecl = NULL_TREE; | |
370 | if (CALL_EXPR_FN (t) == NULL_TREE) | |
371 | call = gimple_build_call_internal_1 (CALL_EXPR_IFN (t), nargs); | |
372 | else | |
373 | { | |
374 | fndecl = get_callee_fndecl (t); | |
375 | call = gimple_build_call_1 (fndecl ? fndecl : CALL_EXPR_FN (t), nargs); | |
376 | } | |
726a989a RB |
377 | |
378 | for (i = 0; i < nargs; i++) | |
379 | gimple_call_set_arg (call, i, CALL_EXPR_ARG (t, i)); | |
380 | ||
381 | gimple_set_block (call, TREE_BLOCK (t)); | |
025d57f0 | 382 | gimple_set_location (call, EXPR_LOCATION (t)); |
726a989a RB |
383 | |
384 | /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */ | |
385 | gimple_call_set_chain (call, CALL_EXPR_STATIC_CHAIN (t)); | |
386 | gimple_call_set_tail (call, CALL_EXPR_TAILCALL (t)); | |
9a385c2d | 387 | gimple_call_set_must_tail (call, CALL_EXPR_MUST_TAIL_CALL (t)); |
726a989a | 388 | gimple_call_set_return_slot_opt (call, CALL_EXPR_RETURN_SLOT_OPT (t)); |
63d2a353 | 389 | if (fndecl |
3d78e008 | 390 | && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL) |
9e878cf1 | 391 | && ALLOCA_FUNCTION_CODE_P (DECL_FUNCTION_CODE (fndecl))) |
63d2a353 | 392 | gimple_call_set_alloca_for_var (call, CALL_ALLOCA_FOR_VAR_P (t)); |
0b945f95 RB |
393 | else if (fndecl |
394 | && (DECL_IS_OPERATOR_NEW_P (fndecl) | |
395 | || DECL_IS_OPERATOR_DELETE_P (fndecl))) | |
396 | gimple_call_set_from_new_or_delete (call, CALL_FROM_NEW_OR_DELETE_P (t)); | |
63d2a353 MM |
397 | else |
398 | gimple_call_set_from_thunk (call, CALL_FROM_THUNK_P (t)); | |
726a989a | 399 | gimple_call_set_va_arg_pack (call, CALL_EXPR_VA_ARG_PACK (t)); |
9bb1a81b | 400 | gimple_call_set_nothrow (call, TREE_NOTHROW (t)); |
4c640e26 | 401 | gimple_call_set_by_descriptor (call, CALL_EXPR_BY_DESCRIPTOR (t)); |
e9e2bad7 | 402 | copy_warning (call, t); |
726a989a | 403 | |
5c5f0b65 IT |
404 | if (fnptrtype) |
405 | { | |
406 | gimple_call_set_fntype (call, TREE_TYPE (fnptrtype)); | |
407 | ||
408 | /* Check if it's an indirect CALL and the type has the | |
409 | nocf_check attribute. In that case propagate the information | |
410 | to the gimple CALL insn. */ | |
411 | if (!fndecl) | |
412 | { | |
413 | gcc_assert (POINTER_TYPE_P (fnptrtype)); | |
414 | tree fntype = TREE_TYPE (fnptrtype); | |
415 | ||
416 | if (lookup_attribute ("nocf_check", TYPE_ATTRIBUTES (fntype))) | |
417 | gimple_call_set_nocf_check (call, TRUE); | |
418 | } | |
419 | } | |
420 | ||
726a989a RB |
421 | return call; |
422 | } | |
423 | ||
424 | ||
726a989a RB |
425 | /* Build a GIMPLE_ASSIGN statement. |
426 | ||
427 | LHS of the assignment. | |
428 | RHS of the assignment which can be unary or binary. */ | |
429 | ||
538dd0b7 | 430 | gassign * |
0d0e4a03 | 431 | gimple_build_assign (tree lhs, tree rhs MEM_STAT_DECL) |
726a989a RB |
432 | { |
433 | enum tree_code subcode; | |
0354c0c7 | 434 | tree op1, op2, op3; |
726a989a | 435 | |
d1e2bb2d | 436 | extract_ops_from_tree (rhs, &subcode, &op1, &op2, &op3); |
0d0e4a03 | 437 | return gimple_build_assign (lhs, subcode, op1, op2, op3 PASS_MEM_STAT); |
726a989a RB |
438 | } |
439 | ||
440 | ||
7d05cebb | 441 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands |
0d0e4a03 | 442 | OP1, OP2 and OP3. */ |
726a989a | 443 | |
0d0e4a03 JJ |
444 | static inline gassign * |
445 | gimple_build_assign_1 (tree lhs, enum tree_code subcode, tree op1, | |
446 | tree op2, tree op3 MEM_STAT_DECL) | |
726a989a RB |
447 | { |
448 | unsigned num_ops; | |
538dd0b7 | 449 | gassign *p; |
726a989a RB |
450 | |
451 | /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the | |
452 | code). */ | |
453 | num_ops = get_gimple_rhs_num_ops (subcode) + 1; | |
b8698a0f | 454 | |
538dd0b7 DM |
455 | p = as_a <gassign *> ( |
456 | gimple_build_with_ops_stat (GIMPLE_ASSIGN, (unsigned)subcode, num_ops | |
457 | PASS_MEM_STAT)); | |
726a989a RB |
458 | gimple_assign_set_lhs (p, lhs); |
459 | gimple_assign_set_rhs1 (p, op1); | |
460 | if (op2) | |
461 | { | |
462 | gcc_assert (num_ops > 2); | |
463 | gimple_assign_set_rhs2 (p, op2); | |
464 | } | |
465 | ||
0354c0c7 BS |
466 | if (op3) |
467 | { | |
468 | gcc_assert (num_ops > 3); | |
469 | gimple_assign_set_rhs3 (p, op3); | |
470 | } | |
471 | ||
726a989a RB |
472 | return p; |
473 | } | |
474 | ||
0d0e4a03 JJ |
475 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands |
476 | OP1, OP2 and OP3. */ | |
477 | ||
478 | gassign * | |
479 | gimple_build_assign (tree lhs, enum tree_code subcode, tree op1, | |
480 | tree op2, tree op3 MEM_STAT_DECL) | |
481 | { | |
482 | return gimple_build_assign_1 (lhs, subcode, op1, op2, op3 PASS_MEM_STAT); | |
483 | } | |
484 | ||
485 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands | |
486 | OP1 and OP2. */ | |
487 | ||
538dd0b7 | 488 | gassign * |
0d0e4a03 JJ |
489 | gimple_build_assign (tree lhs, enum tree_code subcode, tree op1, |
490 | tree op2 MEM_STAT_DECL) | |
73804b12 | 491 | { |
0d0e4a03 JJ |
492 | return gimple_build_assign_1 (lhs, subcode, op1, op2, NULL_TREE |
493 | PASS_MEM_STAT); | |
73804b12 RG |
494 | } |
495 | ||
0d0e4a03 JJ |
496 | /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operand OP1. */ |
497 | ||
538dd0b7 | 498 | gassign * |
0d0e4a03 | 499 | gimple_build_assign (tree lhs, enum tree_code subcode, tree op1 MEM_STAT_DECL) |
00d66391 | 500 | { |
0d0e4a03 JJ |
501 | return gimple_build_assign_1 (lhs, subcode, op1, NULL_TREE, NULL_TREE |
502 | PASS_MEM_STAT); | |
00d66391 JJ |
503 | } |
504 | ||
726a989a | 505 | |
726a989a RB |
506 | /* Build a GIMPLE_COND statement. |
507 | ||
508 | PRED is the condition used to compare LHS and the RHS. | |
509 | T_LABEL is the label to jump to if the condition is true. | |
510 | F_LABEL is the label to jump to otherwise. */ | |
511 | ||
538dd0b7 | 512 | gcond * |
726a989a RB |
513 | gimple_build_cond (enum tree_code pred_code, tree lhs, tree rhs, |
514 | tree t_label, tree f_label) | |
515 | { | |
538dd0b7 | 516 | gcond *p; |
726a989a RB |
517 | |
518 | gcc_assert (TREE_CODE_CLASS (pred_code) == tcc_comparison); | |
538dd0b7 | 519 | p = as_a <gcond *> (gimple_build_with_ops (GIMPLE_COND, pred_code, 4)); |
726a989a RB |
520 | gimple_cond_set_lhs (p, lhs); |
521 | gimple_cond_set_rhs (p, rhs); | |
522 | gimple_cond_set_true_label (p, t_label); | |
523 | gimple_cond_set_false_label (p, f_label); | |
524 | return p; | |
525 | } | |
526 | ||
726a989a RB |
527 | /* Build a GIMPLE_COND statement from the conditional expression tree |
528 | COND. T_LABEL and F_LABEL are as in gimple_build_cond. */ | |
529 | ||
538dd0b7 | 530 | gcond * |
726a989a RB |
531 | gimple_build_cond_from_tree (tree cond, tree t_label, tree f_label) |
532 | { | |
533 | enum tree_code code; | |
534 | tree lhs, rhs; | |
535 | ||
536 | gimple_cond_get_ops_from_tree (cond, &code, &lhs, &rhs); | |
537 | return gimple_build_cond (code, lhs, rhs, t_label, f_label); | |
538 | } | |
539 | ||
540 | /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable | |
541 | boolean expression tree COND. */ | |
542 | ||
543 | void | |
538dd0b7 | 544 | gimple_cond_set_condition_from_tree (gcond *stmt, tree cond) |
726a989a RB |
545 | { |
546 | enum tree_code code; | |
547 | tree lhs, rhs; | |
548 | ||
549 | gimple_cond_get_ops_from_tree (cond, &code, &lhs, &rhs); | |
550 | gimple_cond_set_condition (stmt, code, lhs, rhs); | |
551 | } | |
552 | ||
553 | /* Build a GIMPLE_LABEL statement for LABEL. */ | |
554 | ||
538dd0b7 | 555 | glabel * |
726a989a RB |
556 | gimple_build_label (tree label) |
557 | { | |
538dd0b7 DM |
558 | glabel *p |
559 | = as_a <glabel *> (gimple_build_with_ops (GIMPLE_LABEL, ERROR_MARK, 1)); | |
726a989a RB |
560 | gimple_label_set_label (p, label); |
561 | return p; | |
562 | } | |
563 | ||
564 | /* Build a GIMPLE_GOTO statement to label DEST. */ | |
565 | ||
538dd0b7 | 566 | ggoto * |
726a989a RB |
567 | gimple_build_goto (tree dest) |
568 | { | |
538dd0b7 DM |
569 | ggoto *p |
570 | = as_a <ggoto *> (gimple_build_with_ops (GIMPLE_GOTO, ERROR_MARK, 1)); | |
726a989a RB |
571 | gimple_goto_set_dest (p, dest); |
572 | return p; | |
573 | } | |
574 | ||
575 | ||
576 | /* Build a GIMPLE_NOP statement. */ | |
577 | ||
355fe088 | 578 | gimple * |
726a989a RB |
579 | gimple_build_nop (void) |
580 | { | |
581 | return gimple_alloc (GIMPLE_NOP, 0); | |
582 | } | |
583 | ||
584 | ||
585 | /* Build a GIMPLE_BIND statement. | |
586 | VARS are the variables in BODY. | |
587 | BLOCK is the containing block. */ | |
588 | ||
538dd0b7 | 589 | gbind * |
726a989a RB |
590 | gimple_build_bind (tree vars, gimple_seq body, tree block) |
591 | { | |
538dd0b7 | 592 | gbind *p = as_a <gbind *> (gimple_alloc (GIMPLE_BIND, 0)); |
726a989a RB |
593 | gimple_bind_set_vars (p, vars); |
594 | if (body) | |
595 | gimple_bind_set_body (p, body); | |
596 | if (block) | |
597 | gimple_bind_set_block (p, block); | |
598 | return p; | |
599 | } | |
600 | ||
601 | /* Helper function to set the simple fields of a asm stmt. | |
602 | ||
603 | STRING is a pointer to a string that is the asm blocks assembly code. | |
604 | NINPUT is the number of register inputs. | |
605 | NOUTPUT is the number of register outputs. | |
606 | NCLOBBERS is the number of clobbered registers. | |
607 | */ | |
608 | ||
538dd0b7 | 609 | static inline gasm * |
b8698a0f | 610 | gimple_build_asm_1 (const char *string, unsigned ninputs, unsigned noutputs, |
1c384bf1 | 611 | unsigned nclobbers, unsigned nlabels) |
726a989a | 612 | { |
538dd0b7 | 613 | gasm *p; |
726a989a RB |
614 | int size = strlen (string); |
615 | ||
538dd0b7 | 616 | p = as_a <gasm *> ( |
daa6e488 DM |
617 | gimple_build_with_ops (GIMPLE_ASM, ERROR_MARK, |
618 | ninputs + noutputs + nclobbers + nlabels)); | |
726a989a | 619 | |
daa6e488 DM |
620 | p->ni = ninputs; |
621 | p->no = noutputs; | |
622 | p->nc = nclobbers; | |
623 | p->nl = nlabels; | |
624 | p->string = ggc_alloc_string (string, size); | |
726a989a | 625 | |
7aa6d18a SB |
626 | if (GATHER_STATISTICS) |
627 | gimple_alloc_sizes[(int) gimple_alloc_kind (GIMPLE_ASM)] += size; | |
b8698a0f | 628 | |
726a989a RB |
629 | return p; |
630 | } | |
631 | ||
632 | /* Build a GIMPLE_ASM statement. | |
633 | ||
634 | STRING is the assembly code. | |
635 | NINPUT is the number of register inputs. | |
636 | NOUTPUT is the number of register outputs. | |
637 | NCLOBBERS is the number of clobbered registers. | |
638 | INPUTS is a vector of the input register parameters. | |
639 | OUTPUTS is a vector of the output register parameters. | |
1c384bf1 RH |
640 | CLOBBERS is a vector of the clobbered register parameters. |
641 | LABELS is a vector of destination labels. */ | |
726a989a | 642 | |
538dd0b7 | 643 | gasm * |
9771b263 DN |
644 | gimple_build_asm_vec (const char *string, vec<tree, va_gc> *inputs, |
645 | vec<tree, va_gc> *outputs, vec<tree, va_gc> *clobbers, | |
646 | vec<tree, va_gc> *labels) | |
726a989a | 647 | { |
538dd0b7 | 648 | gasm *p; |
726a989a RB |
649 | unsigned i; |
650 | ||
651 | p = gimple_build_asm_1 (string, | |
9771b263 DN |
652 | vec_safe_length (inputs), |
653 | vec_safe_length (outputs), | |
654 | vec_safe_length (clobbers), | |
655 | vec_safe_length (labels)); | |
b8698a0f | 656 | |
9771b263 DN |
657 | for (i = 0; i < vec_safe_length (inputs); i++) |
658 | gimple_asm_set_input_op (p, i, (*inputs)[i]); | |
726a989a | 659 | |
9771b263 DN |
660 | for (i = 0; i < vec_safe_length (outputs); i++) |
661 | gimple_asm_set_output_op (p, i, (*outputs)[i]); | |
726a989a | 662 | |
9771b263 DN |
663 | for (i = 0; i < vec_safe_length (clobbers); i++) |
664 | gimple_asm_set_clobber_op (p, i, (*clobbers)[i]); | |
b8698a0f | 665 | |
9771b263 DN |
666 | for (i = 0; i < vec_safe_length (labels); i++) |
667 | gimple_asm_set_label_op (p, i, (*labels)[i]); | |
b8698a0f | 668 | |
726a989a RB |
669 | return p; |
670 | } | |
671 | ||
672 | /* Build a GIMPLE_CATCH statement. | |
673 | ||
674 | TYPES are the catch types. | |
675 | HANDLER is the exception handler. */ | |
676 | ||
538dd0b7 | 677 | gcatch * |
726a989a RB |
678 | gimple_build_catch (tree types, gimple_seq handler) |
679 | { | |
538dd0b7 | 680 | gcatch *p = as_a <gcatch *> (gimple_alloc (GIMPLE_CATCH, 0)); |
726a989a RB |
681 | gimple_catch_set_types (p, types); |
682 | if (handler) | |
683 | gimple_catch_set_handler (p, handler); | |
684 | ||
685 | return p; | |
686 | } | |
687 | ||
688 | /* Build a GIMPLE_EH_FILTER statement. | |
689 | ||
690 | TYPES are the filter's types. | |
691 | FAILURE is the filter's failure action. */ | |
692 | ||
538dd0b7 | 693 | geh_filter * |
726a989a RB |
694 | gimple_build_eh_filter (tree types, gimple_seq failure) |
695 | { | |
538dd0b7 | 696 | geh_filter *p = as_a <geh_filter *> (gimple_alloc (GIMPLE_EH_FILTER, 0)); |
726a989a RB |
697 | gimple_eh_filter_set_types (p, types); |
698 | if (failure) | |
699 | gimple_eh_filter_set_failure (p, failure); | |
700 | ||
701 | return p; | |
702 | } | |
703 | ||
1d65f45c RH |
704 | /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */ |
705 | ||
538dd0b7 | 706 | geh_mnt * |
1d65f45c RH |
707 | gimple_build_eh_must_not_throw (tree decl) |
708 | { | |
538dd0b7 | 709 | geh_mnt *p = as_a <geh_mnt *> (gimple_alloc (GIMPLE_EH_MUST_NOT_THROW, 0)); |
1d65f45c RH |
710 | |
711 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
712 | gcc_assert (flags_from_decl_or_type (decl) & ECF_NORETURN); | |
d7f09764 | 713 | gimple_eh_must_not_throw_set_fndecl (p, decl); |
1d65f45c RH |
714 | |
715 | return p; | |
716 | } | |
717 | ||
0a35513e AH |
718 | /* Build a GIMPLE_EH_ELSE statement. */ |
719 | ||
538dd0b7 | 720 | geh_else * |
0a35513e AH |
721 | gimple_build_eh_else (gimple_seq n_body, gimple_seq e_body) |
722 | { | |
538dd0b7 | 723 | geh_else *p = as_a <geh_else *> (gimple_alloc (GIMPLE_EH_ELSE, 0)); |
0a35513e AH |
724 | gimple_eh_else_set_n_body (p, n_body); |
725 | gimple_eh_else_set_e_body (p, e_body); | |
726 | return p; | |
727 | } | |
728 | ||
726a989a RB |
729 | /* Build a GIMPLE_TRY statement. |
730 | ||
731 | EVAL is the expression to evaluate. | |
732 | CLEANUP is the cleanup expression. | |
733 | KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on | |
734 | whether this is a try/catch or a try/finally respectively. */ | |
735 | ||
538dd0b7 | 736 | gtry * |
726a989a RB |
737 | gimple_build_try (gimple_seq eval, gimple_seq cleanup, |
738 | enum gimple_try_flags kind) | |
739 | { | |
538dd0b7 | 740 | gtry *p; |
726a989a RB |
741 | |
742 | gcc_assert (kind == GIMPLE_TRY_CATCH || kind == GIMPLE_TRY_FINALLY); | |
538dd0b7 | 743 | p = as_a <gtry *> (gimple_alloc (GIMPLE_TRY, 0)); |
726a989a RB |
744 | gimple_set_subcode (p, kind); |
745 | if (eval) | |
746 | gimple_try_set_eval (p, eval); | |
747 | if (cleanup) | |
748 | gimple_try_set_cleanup (p, cleanup); | |
749 | ||
750 | return p; | |
751 | } | |
752 | ||
753 | /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement. | |
754 | ||
755 | CLEANUP is the cleanup expression. */ | |
756 | ||
355fe088 | 757 | gimple * |
726a989a RB |
758 | gimple_build_wce (gimple_seq cleanup) |
759 | { | |
355fe088 | 760 | gimple *p = gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR, 0); |
726a989a RB |
761 | if (cleanup) |
762 | gimple_wce_set_cleanup (p, cleanup); | |
763 | ||
764 | return p; | |
765 | } | |
766 | ||
767 | ||
1d65f45c | 768 | /* Build a GIMPLE_RESX statement. */ |
726a989a | 769 | |
538dd0b7 | 770 | gresx * |
726a989a RB |
771 | gimple_build_resx (int region) |
772 | { | |
538dd0b7 DM |
773 | gresx *p |
774 | = as_a <gresx *> (gimple_build_with_ops (GIMPLE_RESX, ERROR_MARK, 0)); | |
daa6e488 | 775 | p->region = region; |
726a989a RB |
776 | return p; |
777 | } | |
778 | ||
779 | ||
780 | /* The helper for constructing a gimple switch statement. | |
781 | INDEX is the switch's index. | |
782 | NLABELS is the number of labels in the switch excluding the default. | |
783 | DEFAULT_LABEL is the default label for the switch statement. */ | |
784 | ||
538dd0b7 | 785 | gswitch * |
1d65f45c | 786 | gimple_build_switch_nlabels (unsigned nlabels, tree index, tree default_label) |
726a989a RB |
787 | { |
788 | /* nlabels + 1 default label + 1 index. */ | |
fd8d363e | 789 | gcc_checking_assert (default_label); |
538dd0b7 DM |
790 | gswitch *p = as_a <gswitch *> (gimple_build_with_ops (GIMPLE_SWITCH, |
791 | ERROR_MARK, | |
792 | 1 + 1 + nlabels)); | |
726a989a | 793 | gimple_switch_set_index (p, index); |
fd8d363e | 794 | gimple_switch_set_default_label (p, default_label); |
726a989a RB |
795 | return p; |
796 | } | |
797 | ||
726a989a RB |
798 | /* Build a GIMPLE_SWITCH statement. |
799 | ||
800 | INDEX is the switch's index. | |
801 | DEFAULT_LABEL is the default label | |
802 | ARGS is a vector of labels excluding the default. */ | |
803 | ||
538dd0b7 | 804 | gswitch * |
00dcc88a | 805 | gimple_build_switch (tree index, tree default_label, const vec<tree> &args) |
726a989a | 806 | { |
9771b263 | 807 | unsigned i, nlabels = args.length (); |
fd8d363e | 808 | |
538dd0b7 | 809 | gswitch *p = gimple_build_switch_nlabels (nlabels, index, default_label); |
726a989a | 810 | |
1d65f45c | 811 | /* Copy the labels from the vector to the switch statement. */ |
1d65f45c | 812 | for (i = 0; i < nlabels; i++) |
9771b263 | 813 | gimple_switch_set_label (p, i + 1, args[i]); |
726a989a RB |
814 | |
815 | return p; | |
816 | } | |
817 | ||
1d65f45c RH |
818 | /* Build a GIMPLE_EH_DISPATCH statement. */ |
819 | ||
538dd0b7 | 820 | geh_dispatch * |
1d65f45c RH |
821 | gimple_build_eh_dispatch (int region) |
822 | { | |
538dd0b7 DM |
823 | geh_dispatch *p |
824 | = as_a <geh_dispatch *> ( | |
825 | gimple_build_with_ops (GIMPLE_EH_DISPATCH, ERROR_MARK, 0)); | |
daa6e488 | 826 | p->region = region; |
1d65f45c RH |
827 | return p; |
828 | } | |
726a989a | 829 | |
b5b8b0ac AO |
830 | /* Build a new GIMPLE_DEBUG_BIND statement. |
831 | ||
832 | VAR is bound to VALUE; block and location are taken from STMT. */ | |
833 | ||
538dd0b7 | 834 | gdebug * |
59cdeebc | 835 | gimple_build_debug_bind (tree var, tree value, gimple *stmt MEM_STAT_DECL) |
b5b8b0ac | 836 | { |
538dd0b7 DM |
837 | gdebug *p |
838 | = as_a <gdebug *> (gimple_build_with_ops_stat (GIMPLE_DEBUG, | |
839 | (unsigned)GIMPLE_DEBUG_BIND, 2 | |
840 | PASS_MEM_STAT)); | |
b5b8b0ac AO |
841 | gimple_debug_bind_set_var (p, var); |
842 | gimple_debug_bind_set_value (p, value); | |
843 | if (stmt) | |
5368224f | 844 | gimple_set_location (p, gimple_location (stmt)); |
b5b8b0ac AO |
845 | |
846 | return p; | |
847 | } | |
848 | ||
849 | ||
ddb555ed JJ |
850 | /* Build a new GIMPLE_DEBUG_SOURCE_BIND statement. |
851 | ||
852 | VAR is bound to VALUE; block and location are taken from STMT. */ | |
853 | ||
538dd0b7 | 854 | gdebug * |
59cdeebc | 855 | gimple_build_debug_source_bind (tree var, tree value, |
355fe088 | 856 | gimple *stmt MEM_STAT_DECL) |
ddb555ed | 857 | { |
538dd0b7 DM |
858 | gdebug *p |
859 | = as_a <gdebug *> ( | |
860 | gimple_build_with_ops_stat (GIMPLE_DEBUG, | |
861 | (unsigned)GIMPLE_DEBUG_SOURCE_BIND, 2 | |
862 | PASS_MEM_STAT)); | |
ddb555ed JJ |
863 | |
864 | gimple_debug_source_bind_set_var (p, var); | |
865 | gimple_debug_source_bind_set_value (p, value); | |
866 | if (stmt) | |
5368224f | 867 | gimple_set_location (p, gimple_location (stmt)); |
ddb555ed JJ |
868 | |
869 | return p; | |
870 | } | |
871 | ||
872 | ||
96a95ac1 AO |
873 | /* Build a new GIMPLE_DEBUG_BEGIN_STMT statement in BLOCK at |
874 | LOCATION. */ | |
875 | ||
876 | gdebug * | |
877 | gimple_build_debug_begin_stmt (tree block, location_t location | |
878 | MEM_STAT_DECL) | |
879 | { | |
880 | gdebug *p | |
881 | = as_a <gdebug *> ( | |
882 | gimple_build_with_ops_stat (GIMPLE_DEBUG, | |
883 | (unsigned)GIMPLE_DEBUG_BEGIN_STMT, 0 | |
884 | PASS_MEM_STAT)); | |
885 | ||
886 | gimple_set_location (p, location); | |
887 | gimple_set_block (p, block); | |
888 | cfun->debug_marker_count++; | |
889 | ||
890 | return p; | |
891 | } | |
892 | ||
893 | ||
58006663 AO |
894 | /* Build a new GIMPLE_DEBUG_INLINE_ENTRY statement in BLOCK at |
895 | LOCATION. The BLOCK links to the inlined function. */ | |
896 | ||
897 | gdebug * | |
898 | gimple_build_debug_inline_entry (tree block, location_t location | |
899 | MEM_STAT_DECL) | |
900 | { | |
901 | gdebug *p | |
902 | = as_a <gdebug *> ( | |
903 | gimple_build_with_ops_stat (GIMPLE_DEBUG, | |
904 | (unsigned)GIMPLE_DEBUG_INLINE_ENTRY, 0 | |
905 | PASS_MEM_STAT)); | |
906 | ||
907 | gimple_set_location (p, location); | |
908 | gimple_set_block (p, block); | |
909 | cfun->debug_marker_count++; | |
910 | ||
911 | return p; | |
912 | } | |
913 | ||
914 | ||
726a989a RB |
915 | /* Build a GIMPLE_OMP_CRITICAL statement. |
916 | ||
917 | BODY is the sequence of statements for which only one thread can execute. | |
d9a6bd32 JJ |
918 | NAME is optional identifier for this critical block. |
919 | CLAUSES are clauses for this critical block. */ | |
726a989a | 920 | |
538dd0b7 | 921 | gomp_critical * |
d9a6bd32 | 922 | gimple_build_omp_critical (gimple_seq body, tree name, tree clauses) |
726a989a | 923 | { |
538dd0b7 DM |
924 | gomp_critical *p |
925 | = as_a <gomp_critical *> (gimple_alloc (GIMPLE_OMP_CRITICAL, 0)); | |
726a989a | 926 | gimple_omp_critical_set_name (p, name); |
d9a6bd32 | 927 | gimple_omp_critical_set_clauses (p, clauses); |
726a989a RB |
928 | if (body) |
929 | gimple_omp_set_body (p, body); | |
930 | ||
931 | return p; | |
932 | } | |
933 | ||
934 | /* Build a GIMPLE_OMP_FOR statement. | |
935 | ||
936 | BODY is sequence of statements inside the for loop. | |
74bf76ed | 937 | KIND is the `for' variant. |
28567c40 | 938 | CLAUSES are any of the construct's clauses. |
726a989a RB |
939 | COLLAPSE is the collapse count. |
940 | PRE_BODY is the sequence of statements that are loop invariant. */ | |
941 | ||
538dd0b7 | 942 | gomp_for * |
74bf76ed | 943 | gimple_build_omp_for (gimple_seq body, int kind, tree clauses, size_t collapse, |
726a989a RB |
944 | gimple_seq pre_body) |
945 | { | |
538dd0b7 | 946 | gomp_for *p = as_a <gomp_for *> (gimple_alloc (GIMPLE_OMP_FOR, 0)); |
726a989a RB |
947 | if (body) |
948 | gimple_omp_set_body (p, body); | |
949 | gimple_omp_for_set_clauses (p, clauses); | |
74bf76ed | 950 | gimple_omp_for_set_kind (p, kind); |
daa6e488 | 951 | p->collapse = collapse; |
766090c2 | 952 | p->iter = ggc_cleared_vec_alloc<gimple_omp_for_iter> (collapse); |
daa6e488 | 953 | |
726a989a RB |
954 | if (pre_body) |
955 | gimple_omp_for_set_pre_body (p, pre_body); | |
956 | ||
957 | return p; | |
958 | } | |
959 | ||
960 | ||
961 | /* Build a GIMPLE_OMP_PARALLEL statement. | |
962 | ||
963 | BODY is sequence of statements which are executed in parallel. | |
28567c40 | 964 | CLAUSES are the OMP parallel construct's clauses. |
726a989a RB |
965 | CHILD_FN is the function created for the parallel threads to execute. |
966 | DATA_ARG are the shared data argument(s). */ | |
967 | ||
538dd0b7 | 968 | gomp_parallel * |
b8698a0f | 969 | gimple_build_omp_parallel (gimple_seq body, tree clauses, tree child_fn, |
726a989a RB |
970 | tree data_arg) |
971 | { | |
538dd0b7 DM |
972 | gomp_parallel *p |
973 | = as_a <gomp_parallel *> (gimple_alloc (GIMPLE_OMP_PARALLEL, 0)); | |
726a989a RB |
974 | if (body) |
975 | gimple_omp_set_body (p, body); | |
976 | gimple_omp_parallel_set_clauses (p, clauses); | |
977 | gimple_omp_parallel_set_child_fn (p, child_fn); | |
978 | gimple_omp_parallel_set_data_arg (p, data_arg); | |
979 | ||
980 | return p; | |
981 | } | |
982 | ||
983 | ||
984 | /* Build a GIMPLE_OMP_TASK statement. | |
985 | ||
986 | BODY is sequence of statements which are executed by the explicit task. | |
28567c40 | 987 | CLAUSES are the OMP task construct's clauses. |
726a989a RB |
988 | CHILD_FN is the function created for the parallel threads to execute. |
989 | DATA_ARG are the shared data argument(s). | |
990 | COPY_FN is the optional function for firstprivate initialization. | |
991 | ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */ | |
992 | ||
538dd0b7 | 993 | gomp_task * |
726a989a RB |
994 | gimple_build_omp_task (gimple_seq body, tree clauses, tree child_fn, |
995 | tree data_arg, tree copy_fn, tree arg_size, | |
996 | tree arg_align) | |
997 | { | |
538dd0b7 | 998 | gomp_task *p = as_a <gomp_task *> (gimple_alloc (GIMPLE_OMP_TASK, 0)); |
726a989a RB |
999 | if (body) |
1000 | gimple_omp_set_body (p, body); | |
1001 | gimple_omp_task_set_clauses (p, clauses); | |
1002 | gimple_omp_task_set_child_fn (p, child_fn); | |
1003 | gimple_omp_task_set_data_arg (p, data_arg); | |
1004 | gimple_omp_task_set_copy_fn (p, copy_fn); | |
1005 | gimple_omp_task_set_arg_size (p, arg_size); | |
1006 | gimple_omp_task_set_arg_align (p, arg_align); | |
1007 | ||
1008 | return p; | |
1009 | } | |
1010 | ||
1011 | ||
1012 | /* Build a GIMPLE_OMP_SECTION statement for a sections statement. | |
1013 | ||
1014 | BODY is the sequence of statements in the section. */ | |
1015 | ||
355fe088 | 1016 | gimple * |
726a989a RB |
1017 | gimple_build_omp_section (gimple_seq body) |
1018 | { | |
355fe088 | 1019 | gimple *p = gimple_alloc (GIMPLE_OMP_SECTION, 0); |
726a989a RB |
1020 | if (body) |
1021 | gimple_omp_set_body (p, body); | |
1022 | ||
1023 | return p; | |
1024 | } | |
1025 | ||
1026 | ||
1027 | /* Build a GIMPLE_OMP_MASTER statement. | |
1028 | ||
1029 | BODY is the sequence of statements to be executed by just the master. */ | |
1030 | ||
355fe088 | 1031 | gimple * |
726a989a RB |
1032 | gimple_build_omp_master (gimple_seq body) |
1033 | { | |
355fe088 | 1034 | gimple *p = gimple_alloc (GIMPLE_OMP_MASTER, 0); |
726a989a RB |
1035 | if (body) |
1036 | gimple_omp_set_body (p, body); | |
1037 | ||
1038 | return p; | |
1039 | } | |
1040 | ||
d0befed7 JJ |
1041 | /* Build a GIMPLE_OMP_MASKED statement. |
1042 | ||
1043 | BODY is the sequence of statements to be executed by the selected thread(s). */ | |
1044 | ||
1045 | gimple * | |
1046 | gimple_build_omp_masked (gimple_seq body, tree clauses) | |
1047 | { | |
1048 | gimple *p = gimple_alloc (GIMPLE_OMP_MASKED, 0); | |
1049 | gimple_omp_masked_set_clauses (p, clauses); | |
1050 | if (body) | |
1051 | gimple_omp_set_body (p, body); | |
1052 | ||
1053 | return p; | |
1054 | } | |
1055 | ||
acf0174b JJ |
1056 | /* Build a GIMPLE_OMP_TASKGROUP statement. |
1057 | ||
1058 | BODY is the sequence of statements to be executed by the taskgroup | |
28567c40 JJ |
1059 | construct. |
1060 | CLAUSES are any of the construct's clauses. */ | |
acf0174b | 1061 | |
355fe088 | 1062 | gimple * |
28567c40 | 1063 | gimple_build_omp_taskgroup (gimple_seq body, tree clauses) |
acf0174b | 1064 | { |
355fe088 | 1065 | gimple *p = gimple_alloc (GIMPLE_OMP_TASKGROUP, 0); |
28567c40 | 1066 | gimple_omp_taskgroup_set_clauses (p, clauses); |
acf0174b JJ |
1067 | if (body) |
1068 | gimple_omp_set_body (p, body); | |
1069 | ||
1070 | return p; | |
1071 | } | |
1072 | ||
1073 | ||
726a989a RB |
1074 | /* Build a GIMPLE_OMP_CONTINUE statement. |
1075 | ||
1076 | CONTROL_DEF is the definition of the control variable. | |
1077 | CONTROL_USE is the use of the control variable. */ | |
1078 | ||
538dd0b7 | 1079 | gomp_continue * |
726a989a RB |
1080 | gimple_build_omp_continue (tree control_def, tree control_use) |
1081 | { | |
538dd0b7 DM |
1082 | gomp_continue *p |
1083 | = as_a <gomp_continue *> (gimple_alloc (GIMPLE_OMP_CONTINUE, 0)); | |
726a989a RB |
1084 | gimple_omp_continue_set_control_def (p, control_def); |
1085 | gimple_omp_continue_set_control_use (p, control_use); | |
1086 | return p; | |
1087 | } | |
1088 | ||
1089 | /* Build a GIMPLE_OMP_ORDERED statement. | |
1090 | ||
1091 | BODY is the sequence of statements inside a loop that will executed in | |
d9a6bd32 JJ |
1092 | sequence. |
1093 | CLAUSES are clauses for this statement. */ | |
726a989a | 1094 | |
d9a6bd32 JJ |
1095 | gomp_ordered * |
1096 | gimple_build_omp_ordered (gimple_seq body, tree clauses) | |
726a989a | 1097 | { |
d9a6bd32 JJ |
1098 | gomp_ordered *p |
1099 | = as_a <gomp_ordered *> (gimple_alloc (GIMPLE_OMP_ORDERED, 0)); | |
1100 | gimple_omp_ordered_set_clauses (p, clauses); | |
726a989a RB |
1101 | if (body) |
1102 | gimple_omp_set_body (p, body); | |
1103 | ||
1104 | return p; | |
1105 | } | |
1106 | ||
1107 | ||
1108 | /* Build a GIMPLE_OMP_RETURN statement. | |
1109 | WAIT_P is true if this is a non-waiting return. */ | |
1110 | ||
355fe088 | 1111 | gimple * |
726a989a RB |
1112 | gimple_build_omp_return (bool wait_p) |
1113 | { | |
355fe088 | 1114 | gimple *p = gimple_alloc (GIMPLE_OMP_RETURN, 0); |
726a989a RB |
1115 | if (wait_p) |
1116 | gimple_omp_return_set_nowait (p); | |
1117 | ||
1118 | return p; | |
1119 | } | |
1120 | ||
1121 | ||
bf38f7e9 JJ |
1122 | /* Build a GIMPLE_OMP_SCAN statement. |
1123 | ||
1124 | BODY is the sequence of statements to be executed by the scan | |
1125 | construct. | |
1126 | CLAUSES are any of the construct's clauses. */ | |
1127 | ||
1128 | gomp_scan * | |
1129 | gimple_build_omp_scan (gimple_seq body, tree clauses) | |
1130 | { | |
1131 | gomp_scan *p | |
1132 | = as_a <gomp_scan *> (gimple_alloc (GIMPLE_OMP_SCAN, 0)); | |
1133 | gimple_omp_scan_set_clauses (p, clauses); | |
1134 | if (body) | |
1135 | gimple_omp_set_body (p, body); | |
1136 | ||
1137 | return p; | |
1138 | } | |
1139 | ||
1140 | ||
726a989a RB |
1141 | /* Build a GIMPLE_OMP_SECTIONS statement. |
1142 | ||
1143 | BODY is a sequence of section statements. | |
1144 | CLAUSES are any of the OMP sections contsruct's clauses: private, | |
1145 | firstprivate, lastprivate, reduction, and nowait. */ | |
1146 | ||
538dd0b7 | 1147 | gomp_sections * |
726a989a RB |
1148 | gimple_build_omp_sections (gimple_seq body, tree clauses) |
1149 | { | |
538dd0b7 DM |
1150 | gomp_sections *p |
1151 | = as_a <gomp_sections *> (gimple_alloc (GIMPLE_OMP_SECTIONS, 0)); | |
726a989a RB |
1152 | if (body) |
1153 | gimple_omp_set_body (p, body); | |
1154 | gimple_omp_sections_set_clauses (p, clauses); | |
1155 | ||
1156 | return p; | |
1157 | } | |
1158 | ||
1159 | ||
1160 | /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */ | |
1161 | ||
355fe088 | 1162 | gimple * |
726a989a RB |
1163 | gimple_build_omp_sections_switch (void) |
1164 | { | |
1165 | return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH, 0); | |
1166 | } | |
1167 | ||
1168 | ||
1169 | /* Build a GIMPLE_OMP_SINGLE statement. | |
1170 | ||
1171 | BODY is the sequence of statements that will be executed once. | |
1172 | CLAUSES are any of the OMP single construct's clauses: private, firstprivate, | |
1173 | copyprivate, nowait. */ | |
1174 | ||
538dd0b7 | 1175 | gomp_single * |
726a989a RB |
1176 | gimple_build_omp_single (gimple_seq body, tree clauses) |
1177 | { | |
538dd0b7 DM |
1178 | gomp_single *p |
1179 | = as_a <gomp_single *> (gimple_alloc (GIMPLE_OMP_SINGLE, 0)); | |
726a989a RB |
1180 | if (body) |
1181 | gimple_omp_set_body (p, body); | |
1182 | gimple_omp_single_set_clauses (p, clauses); | |
1183 | ||
1184 | return p; | |
1185 | } | |
1186 | ||
1187 | ||
e45483c7 JJ |
1188 | /* Build a GIMPLE_OMP_SCOPE statement. |
1189 | ||
1190 | BODY is the sequence of statements that will be executed once. | |
1191 | CLAUSES are any of the OMP scope construct's clauses: private, reduction, | |
1192 | nowait. */ | |
1193 | ||
1194 | gimple * | |
1195 | gimple_build_omp_scope (gimple_seq body, tree clauses) | |
1196 | { | |
1197 | gimple *p = gimple_alloc (GIMPLE_OMP_SCOPE, 0); | |
1198 | gimple_omp_scope_set_clauses (p, clauses); | |
1199 | if (body) | |
1200 | gimple_omp_set_body (p, body); | |
1201 | ||
1202 | return p; | |
1203 | } | |
1204 | ||
1205 | ||
acf0174b JJ |
1206 | /* Build a GIMPLE_OMP_TARGET statement. |
1207 | ||
1208 | BODY is the sequence of statements that will be executed. | |
41dbbb37 TS |
1209 | KIND is the kind of the region. |
1210 | CLAUSES are any of the construct's clauses. */ | |
acf0174b | 1211 | |
538dd0b7 | 1212 | gomp_target * |
acf0174b JJ |
1213 | gimple_build_omp_target (gimple_seq body, int kind, tree clauses) |
1214 | { | |
538dd0b7 DM |
1215 | gomp_target *p |
1216 | = as_a <gomp_target *> (gimple_alloc (GIMPLE_OMP_TARGET, 0)); | |
acf0174b JJ |
1217 | if (body) |
1218 | gimple_omp_set_body (p, body); | |
1219 | gimple_omp_target_set_clauses (p, clauses); | |
1220 | gimple_omp_target_set_kind (p, kind); | |
1221 | ||
1222 | return p; | |
1223 | } | |
1224 | ||
1225 | ||
1226 | /* Build a GIMPLE_OMP_TEAMS statement. | |
1227 | ||
1228 | BODY is the sequence of statements that will be executed. | |
1229 | CLAUSES are any of the OMP teams construct's clauses. */ | |
1230 | ||
538dd0b7 | 1231 | gomp_teams * |
acf0174b JJ |
1232 | gimple_build_omp_teams (gimple_seq body, tree clauses) |
1233 | { | |
538dd0b7 | 1234 | gomp_teams *p = as_a <gomp_teams *> (gimple_alloc (GIMPLE_OMP_TEAMS, 0)); |
acf0174b JJ |
1235 | if (body) |
1236 | gimple_omp_set_body (p, body); | |
1237 | gimple_omp_teams_set_clauses (p, clauses); | |
1238 | ||
1239 | return p; | |
1240 | } | |
1241 | ||
1242 | ||
726a989a RB |
1243 | /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */ |
1244 | ||
538dd0b7 | 1245 | gomp_atomic_load * |
28567c40 | 1246 | gimple_build_omp_atomic_load (tree lhs, tree rhs, enum omp_memory_order mo) |
726a989a | 1247 | { |
538dd0b7 DM |
1248 | gomp_atomic_load *p |
1249 | = as_a <gomp_atomic_load *> (gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD, 0)); | |
726a989a RB |
1250 | gimple_omp_atomic_load_set_lhs (p, lhs); |
1251 | gimple_omp_atomic_load_set_rhs (p, rhs); | |
28567c40 | 1252 | gimple_omp_atomic_set_memory_order (p, mo); |
726a989a RB |
1253 | return p; |
1254 | } | |
1255 | ||
1256 | /* Build a GIMPLE_OMP_ATOMIC_STORE statement. | |
1257 | ||
1258 | VAL is the value we are storing. */ | |
1259 | ||
538dd0b7 | 1260 | gomp_atomic_store * |
28567c40 | 1261 | gimple_build_omp_atomic_store (tree val, enum omp_memory_order mo) |
726a989a | 1262 | { |
538dd0b7 DM |
1263 | gomp_atomic_store *p |
1264 | = as_a <gomp_atomic_store *> (gimple_alloc (GIMPLE_OMP_ATOMIC_STORE, 0)); | |
726a989a | 1265 | gimple_omp_atomic_store_set_val (p, val); |
28567c40 | 1266 | gimple_omp_atomic_set_memory_order (p, mo); |
726a989a RB |
1267 | return p; |
1268 | } | |
1269 | ||
0a35513e AH |
1270 | /* Build a GIMPLE_TRANSACTION statement. */ |
1271 | ||
538dd0b7 | 1272 | gtransaction * |
7c11b0fe | 1273 | gimple_build_transaction (gimple_seq body) |
0a35513e | 1274 | { |
538dd0b7 DM |
1275 | gtransaction *p |
1276 | = as_a <gtransaction *> (gimple_alloc (GIMPLE_TRANSACTION, 0)); | |
0a35513e | 1277 | gimple_transaction_set_body (p, body); |
7c11b0fe RH |
1278 | gimple_transaction_set_label_norm (p, 0); |
1279 | gimple_transaction_set_label_uninst (p, 0); | |
1280 | gimple_transaction_set_label_over (p, 0); | |
0a35513e AH |
1281 | return p; |
1282 | } | |
1283 | ||
cea094ed | 1284 | #if defined ENABLE_GIMPLE_CHECKING |
726a989a RB |
1285 | /* Complain of a gimple type mismatch and die. */ |
1286 | ||
1287 | void | |
355fe088 | 1288 | gimple_check_failed (const gimple *gs, const char *file, int line, |
726a989a RB |
1289 | const char *function, enum gimple_code code, |
1290 | enum tree_code subcode) | |
1291 | { | |
1292 | internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d", | |
1293 | gimple_code_name[code], | |
5806f481 | 1294 | get_tree_code_name (subcode), |
726a989a | 1295 | gimple_code_name[gimple_code (gs)], |
daa6e488 DM |
1296 | gs->subcode > 0 |
1297 | ? get_tree_code_name ((enum tree_code) gs->subcode) | |
726a989a RB |
1298 | : "", |
1299 | function, trim_filename (file), line); | |
1300 | } | |
726a989a RB |
1301 | #endif /* ENABLE_GIMPLE_CHECKING */ |
1302 | ||
1303 | ||
726a989a RB |
1304 | /* Link gimple statement GS to the end of the sequence *SEQ_P. If |
1305 | *SEQ_P is NULL, a new sequence is allocated. */ | |
1306 | ||
1307 | void | |
355fe088 | 1308 | gimple_seq_add_stmt (gimple_seq *seq_p, gimple *gs) |
726a989a RB |
1309 | { |
1310 | gimple_stmt_iterator si; | |
726a989a RB |
1311 | if (gs == NULL) |
1312 | return; | |
1313 | ||
726a989a RB |
1314 | si = gsi_last (*seq_p); |
1315 | gsi_insert_after (&si, gs, GSI_NEW_STMT); | |
1316 | } | |
1317 | ||
45b0be94 AM |
1318 | /* Link gimple statement GS to the end of the sequence *SEQ_P. If |
1319 | *SEQ_P is NULL, a new sequence is allocated. This function is | |
1320 | similar to gimple_seq_add_stmt, but does not scan the operands. | |
1321 | During gimplification, we need to manipulate statement sequences | |
1322 | before the def/use vectors have been constructed. */ | |
1323 | ||
1324 | void | |
355fe088 | 1325 | gimple_seq_add_stmt_without_update (gimple_seq *seq_p, gimple *gs) |
45b0be94 AM |
1326 | { |
1327 | gimple_stmt_iterator si; | |
1328 | ||
1329 | if (gs == NULL) | |
1330 | return; | |
1331 | ||
1332 | si = gsi_last (*seq_p); | |
1333 | gsi_insert_after_without_update (&si, gs, GSI_NEW_STMT); | |
1334 | } | |
726a989a RB |
1335 | |
1336 | /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is | |
1337 | NULL, a new sequence is allocated. */ | |
1338 | ||
1339 | void | |
1340 | gimple_seq_add_seq (gimple_seq *dst_p, gimple_seq src) | |
1341 | { | |
1342 | gimple_stmt_iterator si; | |
726a989a RB |
1343 | if (src == NULL) |
1344 | return; | |
1345 | ||
726a989a RB |
1346 | si = gsi_last (*dst_p); |
1347 | gsi_insert_seq_after (&si, src, GSI_NEW_STMT); | |
1348 | } | |
1349 | ||
fef5a0d9 RB |
1350 | /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is |
1351 | NULL, a new sequence is allocated. This function is | |
1352 | similar to gimple_seq_add_seq, but does not scan the operands. */ | |
1353 | ||
1354 | void | |
1355 | gimple_seq_add_seq_without_update (gimple_seq *dst_p, gimple_seq src) | |
1356 | { | |
1357 | gimple_stmt_iterator si; | |
1358 | if (src == NULL) | |
1359 | return; | |
1360 | ||
1361 | si = gsi_last (*dst_p); | |
1362 | gsi_insert_seq_after_without_update (&si, src, GSI_NEW_STMT); | |
1363 | } | |
1364 | ||
45b0be94 AM |
1365 | /* Determine whether to assign a location to the statement GS. */ |
1366 | ||
1367 | static bool | |
355fe088 | 1368 | should_carry_location_p (gimple *gs) |
45b0be94 AM |
1369 | { |
1370 | /* Don't emit a line note for a label. We particularly don't want to | |
1371 | emit one for the break label, since it doesn't actually correspond | |
1372 | to the beginning of the loop/switch. */ | |
1373 | if (gimple_code (gs) == GIMPLE_LABEL) | |
1374 | return false; | |
1375 | ||
1376 | return true; | |
1377 | } | |
1378 | ||
1379 | /* Set the location for gimple statement GS to LOCATION. */ | |
1380 | ||
1381 | static void | |
355fe088 | 1382 | annotate_one_with_location (gimple *gs, location_t location) |
45b0be94 AM |
1383 | { |
1384 | if (!gimple_has_location (gs) | |
1385 | && !gimple_do_not_emit_location_p (gs) | |
1386 | && should_carry_location_p (gs)) | |
1387 | gimple_set_location (gs, location); | |
1388 | } | |
1389 | ||
1390 | /* Set LOCATION for all the statements after iterator GSI in sequence | |
1391 | SEQ. If GSI is pointing to the end of the sequence, start with the | |
1392 | first statement in SEQ. */ | |
1393 | ||
1394 | void | |
1395 | annotate_all_with_location_after (gimple_seq seq, gimple_stmt_iterator gsi, | |
1396 | location_t location) | |
1397 | { | |
1398 | if (gsi_end_p (gsi)) | |
1399 | gsi = gsi_start (seq); | |
1400 | else | |
1401 | gsi_next (&gsi); | |
1402 | ||
1403 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
1404 | annotate_one_with_location (gsi_stmt (gsi), location); | |
1405 | } | |
1406 | ||
1407 | /* Set the location for all the statements in a sequence STMT_P to LOCATION. */ | |
1408 | ||
1409 | void | |
1410 | annotate_all_with_location (gimple_seq stmt_p, location_t location) | |
1411 | { | |
1412 | gimple_stmt_iterator i; | |
1413 | ||
1414 | if (gimple_seq_empty_p (stmt_p)) | |
1415 | return; | |
1416 | ||
1417 | for (i = gsi_start (stmt_p); !gsi_end_p (i); gsi_next (&i)) | |
1418 | { | |
355fe088 | 1419 | gimple *gs = gsi_stmt (i); |
45b0be94 AM |
1420 | annotate_one_with_location (gs, location); |
1421 | } | |
1422 | } | |
726a989a RB |
1423 | |
1424 | /* Helper function of empty_body_p. Return true if STMT is an empty | |
1425 | statement. */ | |
1426 | ||
1427 | static bool | |
355fe088 | 1428 | empty_stmt_p (gimple *stmt) |
726a989a RB |
1429 | { |
1430 | if (gimple_code (stmt) == GIMPLE_NOP) | |
1431 | return true; | |
538dd0b7 DM |
1432 | if (gbind *bind_stmt = dyn_cast <gbind *> (stmt)) |
1433 | return empty_body_p (gimple_bind_body (bind_stmt)); | |
726a989a RB |
1434 | return false; |
1435 | } | |
1436 | ||
1437 | ||
1438 | /* Return true if BODY contains nothing but empty statements. */ | |
1439 | ||
1440 | bool | |
1441 | empty_body_p (gimple_seq body) | |
1442 | { | |
1443 | gimple_stmt_iterator i; | |
1444 | ||
726a989a RB |
1445 | if (gimple_seq_empty_p (body)) |
1446 | return true; | |
1447 | for (i = gsi_start (body); !gsi_end_p (i); gsi_next (&i)) | |
b5b8b0ac AO |
1448 | if (!empty_stmt_p (gsi_stmt (i)) |
1449 | && !is_gimple_debug (gsi_stmt (i))) | |
726a989a RB |
1450 | return false; |
1451 | ||
1452 | return true; | |
1453 | } | |
1454 | ||
1455 | ||
1456 | /* Perform a deep copy of sequence SRC and return the result. */ | |
1457 | ||
1458 | gimple_seq | |
1459 | gimple_seq_copy (gimple_seq src) | |
1460 | { | |
1461 | gimple_stmt_iterator gsi; | |
355a7673 | 1462 | gimple_seq new_seq = NULL; |
355fe088 | 1463 | gimple *stmt; |
726a989a RB |
1464 | |
1465 | for (gsi = gsi_start (src); !gsi_end_p (gsi); gsi_next (&gsi)) | |
1466 | { | |
1467 | stmt = gimple_copy (gsi_stmt (gsi)); | |
82d6e6fc | 1468 | gimple_seq_add_stmt (&new_seq, stmt); |
726a989a RB |
1469 | } |
1470 | ||
82d6e6fc | 1471 | return new_seq; |
726a989a RB |
1472 | } |
1473 | ||
1474 | ||
726a989a | 1475 | |
25583c4f RS |
1476 | /* Return true if calls C1 and C2 are known to go to the same function. */ |
1477 | ||
1478 | bool | |
355fe088 | 1479 | gimple_call_same_target_p (const gimple *c1, const gimple *c2) |
25583c4f RS |
1480 | { |
1481 | if (gimple_call_internal_p (c1)) | |
1482 | return (gimple_call_internal_p (c2) | |
8ab78162 | 1483 | && gimple_call_internal_fn (c1) == gimple_call_internal_fn (c2) |
3433ee35 NS |
1484 | && (!gimple_call_internal_unique_p (as_a <const gcall *> (c1)) |
1485 | || c1 == c2)); | |
25583c4f RS |
1486 | else |
1487 | return (gimple_call_fn (c1) == gimple_call_fn (c2) | |
1488 | || (gimple_call_fndecl (c1) | |
1489 | && gimple_call_fndecl (c1) == gimple_call_fndecl (c2))); | |
1490 | } | |
1491 | ||
726a989a RB |
1492 | /* Detect flags from a GIMPLE_CALL. This is just like |
1493 | call_expr_flags, but for gimple tuples. */ | |
1494 | ||
1495 | int | |
355fe088 | 1496 | gimple_call_flags (const gimple *stmt) |
726a989a | 1497 | { |
0e02fb26 | 1498 | int flags = 0; |
726a989a | 1499 | |
0e02fb26 | 1500 | if (gimple_call_internal_p (stmt)) |
25583c4f | 1501 | flags = internal_fn_flags (gimple_call_internal_fn (stmt)); |
726a989a | 1502 | else |
0e02fb26 RB |
1503 | { |
1504 | tree decl = gimple_call_fndecl (stmt); | |
1505 | if (decl) | |
1506 | flags = flags_from_decl_or_type (decl); | |
1507 | flags |= flags_from_decl_or_type (gimple_call_fntype (stmt)); | |
1508 | } | |
726a989a | 1509 | |
daa6e488 | 1510 | if (stmt->subcode & GF_CALL_NOTHROW) |
9bb1a81b JM |
1511 | flags |= ECF_NOTHROW; |
1512 | ||
4c640e26 EB |
1513 | if (stmt->subcode & GF_CALL_BY_DESCRIPTOR) |
1514 | flags |= ECF_BY_DESCRIPTOR; | |
1515 | ||
726a989a RB |
1516 | return flags; |
1517 | } | |
1518 | ||
25583c4f RS |
1519 | /* Return the "fn spec" string for call STMT. */ |
1520 | ||
4f8cfb42 | 1521 | attr_fnspec |
538dd0b7 | 1522 | gimple_call_fnspec (const gcall *stmt) |
25583c4f RS |
1523 | { |
1524 | tree type, attr; | |
1525 | ||
b78475cf | 1526 | if (gimple_call_internal_p (stmt)) |
4f8cfb42 JH |
1527 | { |
1528 | const_tree spec = internal_fn_fnspec (gimple_call_internal_fn (stmt)); | |
1529 | if (spec) | |
1530 | return spec; | |
1531 | else | |
1532 | return ""; | |
1533 | } | |
b78475cf | 1534 | |
25583c4f | 1535 | type = gimple_call_fntype (stmt); |
4f8cfb42 JH |
1536 | if (type) |
1537 | { | |
1538 | attr = lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type)); | |
1539 | if (attr) | |
1540 | return TREE_VALUE (TREE_VALUE (attr)); | |
1541 | } | |
1542 | if (gimple_call_builtin_p (stmt, BUILT_IN_NORMAL)) | |
1543 | return builtin_fnspec (gimple_call_fndecl (stmt)); | |
58c9de46 JH |
1544 | tree fndecl = gimple_call_fndecl (stmt); |
1545 | /* If the call is to a replaceable operator delete and results | |
1546 | from a delete expression as opposed to a direct call to | |
1547 | such operator, then we can treat it as free. */ | |
1548 | if (fndecl | |
1549 | && DECL_IS_OPERATOR_DELETE_P (fndecl) | |
78c4a9fe | 1550 | && DECL_IS_REPLACEABLE_OPERATOR (fndecl) |
58c9de46 | 1551 | && gimple_call_from_new_or_delete (stmt)) |
09a0affd | 1552 | return ". o "; |
58c9de46 JH |
1553 | /* Similarly operator new can be treated as malloc. */ |
1554 | if (fndecl | |
78c4a9fe | 1555 | && DECL_IS_REPLACEABLE_OPERATOR_NEW_P (fndecl) |
58c9de46 | 1556 | && gimple_call_from_new_or_delete (stmt)) |
09a0affd | 1557 | return "m "; |
4f8cfb42 | 1558 | return ""; |
25583c4f RS |
1559 | } |
1560 | ||
0b7b376d RG |
1561 | /* Detects argument flags for argument number ARG on call STMT. */ |
1562 | ||
1563 | int | |
538dd0b7 | 1564 | gimple_call_arg_flags (const gcall *stmt, unsigned arg) |
0b7b376d | 1565 | { |
4f8cfb42 | 1566 | attr_fnspec fnspec = gimple_call_fnspec (stmt); |
05d39f0d | 1567 | int flags = 0; |
0b7b376d | 1568 | |
520d5ad3 | 1569 | if (fnspec.known_p ()) |
05d39f0d | 1570 | { |
520d5ad3 JH |
1571 | if (!fnspec.arg_specified_p (arg)) |
1572 | ; | |
1573 | else if (!fnspec.arg_used_p (arg)) | |
1574 | flags = EAF_UNUSED; | |
1575 | else | |
1576 | { | |
1577 | if (fnspec.arg_direct_p (arg)) | |
1578 | flags |= EAF_DIRECT; | |
1579 | if (fnspec.arg_noescape_p (arg)) | |
bb07490a | 1580 | flags |= EAF_NOESCAPE | EAF_NODIRECTESCAPE; |
520d5ad3 JH |
1581 | if (fnspec.arg_readonly_p (arg)) |
1582 | flags |= EAF_NOCLOBBER; | |
1583 | } | |
1584 | } | |
1585 | tree callee = gimple_call_fndecl (stmt); | |
1586 | if (callee) | |
1587 | { | |
1588 | cgraph_node *node = cgraph_node::get (callee); | |
1589 | modref_summary *summary = node ? get_modref_function_summary (node) | |
1590 | : NULL; | |
1591 | ||
1592 | if (summary && summary->arg_flags.length () > arg) | |
1593 | { | |
1594 | int modref_flags = summary->arg_flags[arg]; | |
1595 | ||
1596 | /* We have possibly optimized out load. Be conservative here. */ | |
1597 | if (!node->binds_to_current_def_p ()) | |
f6f704fd | 1598 | modref_flags = interposable_eaf_flags (modref_flags, flags); |
6f1a3668 ML |
1599 | if (dbg_cnt (ipa_mod_ref_pta)) |
1600 | flags |= modref_flags; | |
520d5ad3 | 1601 | } |
0b7b376d | 1602 | } |
05d39f0d | 1603 | return flags; |
0b7b376d RG |
1604 | } |
1605 | ||
b8ef019a JH |
1606 | /* Detects argument flags for return slot on call STMT. */ |
1607 | ||
1608 | int | |
1609 | gimple_call_retslot_flags (const gcall *stmt) | |
1610 | { | |
1611 | int flags = EAF_DIRECT | EAF_NOREAD; | |
1612 | ||
1613 | tree callee = gimple_call_fndecl (stmt); | |
1614 | if (callee) | |
1615 | { | |
1616 | cgraph_node *node = cgraph_node::get (callee); | |
1617 | modref_summary *summary = node ? get_modref_function_summary (node) | |
1618 | : NULL; | |
1619 | ||
1620 | if (summary) | |
1621 | { | |
1622 | int modref_flags = summary->retslot_flags; | |
1623 | ||
1624 | /* We have possibly optimized out load. Be conservative here. */ | |
1625 | if (!node->binds_to_current_def_p ()) | |
f6f704fd | 1626 | modref_flags = interposable_eaf_flags (modref_flags, flags); |
b8ef019a JH |
1627 | if (dbg_cnt (ipa_mod_ref_pta)) |
1628 | flags |= modref_flags; | |
1629 | } | |
1630 | } | |
1631 | return flags; | |
1632 | } | |
1633 | ||
a70c0512 JH |
1634 | /* Detects argument flags for static chain on call STMT. */ |
1635 | ||
1636 | int | |
1637 | gimple_call_static_chain_flags (const gcall *stmt) | |
1638 | { | |
1639 | int flags = 0; | |
1640 | ||
1641 | tree callee = gimple_call_fndecl (stmt); | |
1642 | if (callee) | |
1643 | { | |
1644 | cgraph_node *node = cgraph_node::get (callee); | |
1645 | modref_summary *summary = node ? get_modref_function_summary (node) | |
1646 | : NULL; | |
1647 | ||
d44d7910 JH |
1648 | /* Nested functions should always bind to current def since |
1649 | there is no public ABI for them. */ | |
1650 | gcc_checking_assert (node->binds_to_current_def_p ()); | |
a70c0512 JH |
1651 | if (summary) |
1652 | { | |
1653 | int modref_flags = summary->static_chain_flags; | |
1654 | ||
a70c0512 JH |
1655 | if (dbg_cnt (ipa_mod_ref_pta)) |
1656 | flags |= modref_flags; | |
1657 | } | |
1658 | } | |
1659 | return flags; | |
1660 | } | |
1661 | ||
0b7b376d RG |
1662 | /* Detects return flags for the call STMT. */ |
1663 | ||
1664 | int | |
538dd0b7 | 1665 | gimple_call_return_flags (const gcall *stmt) |
0b7b376d | 1666 | { |
0b7b376d RG |
1667 | if (gimple_call_flags (stmt) & ECF_MALLOC) |
1668 | return ERF_NOALIAS; | |
1669 | ||
4f8cfb42 | 1670 | attr_fnspec fnspec = gimple_call_fnspec (stmt); |
0b7b376d | 1671 | |
05d39f0d JH |
1672 | unsigned int arg_no; |
1673 | if (fnspec.returns_arg (&arg_no)) | |
1674 | return ERF_RETURNS_ARG | arg_no; | |
1675 | ||
1676 | if (fnspec.returns_noalias_p ()) | |
1677 | return ERF_NOALIAS; | |
1678 | return 0; | |
0b7b376d | 1679 | } |
726a989a | 1680 | |
3dbe9454 | 1681 | |
288aaa5f AH |
1682 | /* Return true if call STMT is known to return a non-zero result. */ |
1683 | ||
1684 | bool | |
1685 | gimple_call_nonnull_result_p (gcall *call) | |
1686 | { | |
1687 | tree fndecl = gimple_call_fndecl (call); | |
1688 | if (!fndecl) | |
1689 | return false; | |
1690 | if (flag_delete_null_pointer_checks && !flag_check_new | |
cb50701e | 1691 | && DECL_IS_OPERATOR_NEW_P (fndecl) |
288aaa5f AH |
1692 | && !TREE_NOTHROW (fndecl)) |
1693 | return true; | |
1694 | ||
1695 | /* References are always non-NULL. */ | |
1696 | if (flag_delete_null_pointer_checks | |
1697 | && TREE_CODE (TREE_TYPE (fndecl)) == REFERENCE_TYPE) | |
1698 | return true; | |
1699 | ||
1700 | if (flag_delete_null_pointer_checks | |
1701 | && lookup_attribute ("returns_nonnull", | |
1702 | TYPE_ATTRIBUTES (gimple_call_fntype (call)))) | |
1703 | return true; | |
1704 | return gimple_alloca_call_p (call); | |
1705 | } | |
1706 | ||
1707 | ||
1708 | /* If CALL returns a non-null result in an argument, return that arg. */ | |
1709 | ||
1710 | tree | |
1711 | gimple_call_nonnull_arg (gcall *call) | |
1712 | { | |
1713 | tree fndecl = gimple_call_fndecl (call); | |
1714 | if (!fndecl) | |
1715 | return NULL_TREE; | |
1716 | ||
1717 | unsigned rf = gimple_call_return_flags (call); | |
1718 | if (rf & ERF_RETURNS_ARG) | |
1719 | { | |
1720 | unsigned argnum = rf & ERF_RETURN_ARG_MASK; | |
1721 | if (argnum < gimple_call_num_args (call)) | |
1722 | { | |
1723 | tree arg = gimple_call_arg (call, argnum); | |
1724 | if (SSA_VAR_P (arg) | |
1725 | && infer_nonnull_range_by_attribute (call, arg)) | |
1726 | return arg; | |
1727 | } | |
1728 | } | |
1729 | return NULL_TREE; | |
1730 | } | |
1731 | ||
1732 | ||
726a989a RB |
1733 | /* Return true if GS is a copy assignment. */ |
1734 | ||
1735 | bool | |
355fe088 | 1736 | gimple_assign_copy_p (gimple *gs) |
726a989a | 1737 | { |
3dbe9454 RG |
1738 | return (gimple_assign_single_p (gs) |
1739 | && is_gimple_val (gimple_op (gs, 1))); | |
726a989a RB |
1740 | } |
1741 | ||
1742 | ||
1743 | /* Return true if GS is a SSA_NAME copy assignment. */ | |
1744 | ||
1745 | bool | |
355fe088 | 1746 | gimple_assign_ssa_name_copy_p (gimple *gs) |
726a989a | 1747 | { |
3dbe9454 | 1748 | return (gimple_assign_single_p (gs) |
726a989a RB |
1749 | && TREE_CODE (gimple_assign_lhs (gs)) == SSA_NAME |
1750 | && TREE_CODE (gimple_assign_rhs1 (gs)) == SSA_NAME); | |
1751 | } | |
1752 | ||
1753 | ||
726a989a RB |
1754 | /* Return true if GS is an assignment with a unary RHS, but the |
1755 | operator has no effect on the assigned value. The logic is adapted | |
1756 | from STRIP_NOPS. This predicate is intended to be used in tuplifying | |
1757 | instances in which STRIP_NOPS was previously applied to the RHS of | |
1758 | an assignment. | |
1759 | ||
1760 | NOTE: In the use cases that led to the creation of this function | |
1761 | and of gimple_assign_single_p, it is typical to test for either | |
1762 | condition and to proceed in the same manner. In each case, the | |
1763 | assigned value is represented by the single RHS operand of the | |
1764 | assignment. I suspect there may be cases where gimple_assign_copy_p, | |
1765 | gimple_assign_single_p, or equivalent logic is used where a similar | |
1766 | treatment of unary NOPs is appropriate. */ | |
b8698a0f | 1767 | |
726a989a | 1768 | bool |
355fe088 | 1769 | gimple_assign_unary_nop_p (gimple *gs) |
726a989a | 1770 | { |
3dbe9454 | 1771 | return (is_gimple_assign (gs) |
1a87cf0c | 1772 | && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs)) |
726a989a RB |
1773 | || gimple_assign_rhs_code (gs) == NON_LVALUE_EXPR) |
1774 | && gimple_assign_rhs1 (gs) != error_mark_node | |
1775 | && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs))) | |
1776 | == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs))))); | |
1777 | } | |
1778 | ||
1779 | /* Set BB to be the basic block holding G. */ | |
1780 | ||
1781 | void | |
355fe088 | 1782 | gimple_set_bb (gimple *stmt, basic_block bb) |
726a989a | 1783 | { |
daa6e488 | 1784 | stmt->bb = bb; |
726a989a | 1785 | |
45b62594 RB |
1786 | if (gimple_code (stmt) != GIMPLE_LABEL) |
1787 | return; | |
1788 | ||
726a989a RB |
1789 | /* If the statement is a label, add the label to block-to-labels map |
1790 | so that we can speed up edge creation for GIMPLE_GOTOs. */ | |
45b62594 | 1791 | if (cfun->cfg) |
726a989a RB |
1792 | { |
1793 | tree t; | |
1794 | int uid; | |
1795 | ||
538dd0b7 | 1796 | t = gimple_label_label (as_a <glabel *> (stmt)); |
726a989a RB |
1797 | uid = LABEL_DECL_UID (t); |
1798 | if (uid == -1) | |
1799 | { | |
99729d91 DM |
1800 | unsigned old_len = |
1801 | vec_safe_length (label_to_block_map_for_fn (cfun)); | |
726a989a RB |
1802 | LABEL_DECL_UID (t) = uid = cfun->cfg->last_label_uid++; |
1803 | if (old_len <= (unsigned) uid) | |
a292e31d | 1804 | vec_safe_grow_cleared (label_to_block_map_for_fn (cfun), uid + 1); |
726a989a RB |
1805 | } |
1806 | ||
99729d91 | 1807 | (*label_to_block_map_for_fn (cfun))[uid] = bb; |
726a989a RB |
1808 | } |
1809 | } | |
1810 | ||
1811 | ||
726a989a RB |
1812 | /* Modify the RHS of the assignment pointed-to by GSI using the |
1813 | operands in the expression tree EXPR. | |
1814 | ||
1815 | NOTE: The statement pointed-to by GSI may be reallocated if it | |
1816 | did not have enough operand slots. | |
1817 | ||
1818 | This function is useful to convert an existing tree expression into | |
1819 | the flat representation used for the RHS of a GIMPLE assignment. | |
1820 | It will reallocate memory as needed to expand or shrink the number | |
1821 | of operand slots needed to represent EXPR. | |
1822 | ||
1823 | NOTE: If you find yourself building a tree and then calling this | |
1824 | function, you are most certainly doing it the slow way. It is much | |
1825 | better to build a new assignment or to use the function | |
1826 | gimple_assign_set_rhs_with_ops, which does not require an | |
1827 | expression tree to be built. */ | |
1828 | ||
1829 | void | |
1830 | gimple_assign_set_rhs_from_tree (gimple_stmt_iterator *gsi, tree expr) | |
1831 | { | |
1832 | enum tree_code subcode; | |
0354c0c7 | 1833 | tree op1, op2, op3; |
726a989a | 1834 | |
d1e2bb2d | 1835 | extract_ops_from_tree (expr, &subcode, &op1, &op2, &op3); |
00d66391 | 1836 | gimple_assign_set_rhs_with_ops (gsi, subcode, op1, op2, op3); |
726a989a RB |
1837 | } |
1838 | ||
1839 | ||
1840 | /* Set the RHS of assignment statement pointed-to by GSI to CODE with | |
0354c0c7 | 1841 | operands OP1, OP2 and OP3. |
726a989a RB |
1842 | |
1843 | NOTE: The statement pointed-to by GSI may be reallocated if it | |
1844 | did not have enough operand slots. */ | |
1845 | ||
1846 | void | |
00d66391 JJ |
1847 | gimple_assign_set_rhs_with_ops (gimple_stmt_iterator *gsi, enum tree_code code, |
1848 | tree op1, tree op2, tree op3) | |
726a989a RB |
1849 | { |
1850 | unsigned new_rhs_ops = get_gimple_rhs_num_ops (code); | |
355fe088 | 1851 | gimple *stmt = gsi_stmt (*gsi); |
d9611f55 | 1852 | gimple *old_stmt = stmt; |
726a989a RB |
1853 | |
1854 | /* If the new CODE needs more operands, allocate a new statement. */ | |
1855 | if (gimple_num_ops (stmt) < new_rhs_ops + 1) | |
1856 | { | |
d9611f55 RB |
1857 | tree lhs = gimple_assign_lhs (old_stmt); |
1858 | stmt = gimple_alloc (gimple_code (old_stmt), new_rhs_ops + 1); | |
1859 | memcpy (stmt, old_stmt, gimple_size (gimple_code (old_stmt))); | |
1860 | gimple_init_singleton (stmt); | |
726a989a RB |
1861 | |
1862 | /* The LHS needs to be reset as this also changes the SSA name | |
1863 | on the LHS. */ | |
1864 | gimple_assign_set_lhs (stmt, lhs); | |
1865 | } | |
1866 | ||
1867 | gimple_set_num_ops (stmt, new_rhs_ops + 1); | |
1868 | gimple_set_subcode (stmt, code); | |
1869 | gimple_assign_set_rhs1 (stmt, op1); | |
1870 | if (new_rhs_ops > 1) | |
1871 | gimple_assign_set_rhs2 (stmt, op2); | |
0354c0c7 BS |
1872 | if (new_rhs_ops > 2) |
1873 | gimple_assign_set_rhs3 (stmt, op3); | |
d9611f55 | 1874 | if (stmt != old_stmt) |
ef9fc3ba | 1875 | gsi_replace (gsi, stmt, false); |
726a989a RB |
1876 | } |
1877 | ||
1878 | ||
1879 | /* Return the LHS of a statement that performs an assignment, | |
1880 | either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE | |
1881 | for a call to a function that returns no value, or for a | |
1882 | statement other than an assignment or a call. */ | |
1883 | ||
1884 | tree | |
355fe088 | 1885 | gimple_get_lhs (const gimple *stmt) |
726a989a | 1886 | { |
e0c68ce9 | 1887 | enum gimple_code code = gimple_code (stmt); |
726a989a RB |
1888 | |
1889 | if (code == GIMPLE_ASSIGN) | |
1890 | return gimple_assign_lhs (stmt); | |
1891 | else if (code == GIMPLE_CALL) | |
1892 | return gimple_call_lhs (stmt); | |
61362d9d RB |
1893 | else if (code == GIMPLE_PHI) |
1894 | return gimple_phi_result (stmt); | |
726a989a RB |
1895 | else |
1896 | return NULL_TREE; | |
1897 | } | |
1898 | ||
1899 | ||
1900 | /* Set the LHS of a statement that performs an assignment, | |
1901 | either a GIMPLE_ASSIGN or a GIMPLE_CALL. */ | |
1902 | ||
1903 | void | |
355fe088 | 1904 | gimple_set_lhs (gimple *stmt, tree lhs) |
726a989a | 1905 | { |
e0c68ce9 | 1906 | enum gimple_code code = gimple_code (stmt); |
726a989a RB |
1907 | |
1908 | if (code == GIMPLE_ASSIGN) | |
1909 | gimple_assign_set_lhs (stmt, lhs); | |
1910 | else if (code == GIMPLE_CALL) | |
1911 | gimple_call_set_lhs (stmt, lhs); | |
1912 | else | |
c3284718 | 1913 | gcc_unreachable (); |
726a989a RB |
1914 | } |
1915 | ||
1916 | ||
1917 | /* Return a deep copy of statement STMT. All the operands from STMT | |
1918 | are reallocated and copied using unshare_expr. The DEF, USE, VDEF | |
355a7673 MM |
1919 | and VUSE operand arrays are set to empty in the new copy. The new |
1920 | copy isn't part of any sequence. */ | |
726a989a | 1921 | |
355fe088 TS |
1922 | gimple * |
1923 | gimple_copy (gimple *stmt) | |
726a989a RB |
1924 | { |
1925 | enum gimple_code code = gimple_code (stmt); | |
1926 | unsigned num_ops = gimple_num_ops (stmt); | |
355fe088 | 1927 | gimple *copy = gimple_alloc (code, num_ops); |
726a989a RB |
1928 | unsigned i; |
1929 | ||
1930 | /* Shallow copy all the fields from STMT. */ | |
1931 | memcpy (copy, stmt, gimple_size (code)); | |
355a7673 | 1932 | gimple_init_singleton (copy); |
726a989a RB |
1933 | |
1934 | /* If STMT has sub-statements, deep-copy them as well. */ | |
1935 | if (gimple_has_substatements (stmt)) | |
1936 | { | |
1937 | gimple_seq new_seq; | |
1938 | tree t; | |
1939 | ||
1940 | switch (gimple_code (stmt)) | |
1941 | { | |
1942 | case GIMPLE_BIND: | |
538dd0b7 DM |
1943 | { |
1944 | gbind *bind_stmt = as_a <gbind *> (stmt); | |
1945 | gbind *bind_copy = as_a <gbind *> (copy); | |
1946 | new_seq = gimple_seq_copy (gimple_bind_body (bind_stmt)); | |
1947 | gimple_bind_set_body (bind_copy, new_seq); | |
1948 | gimple_bind_set_vars (bind_copy, | |
1949 | unshare_expr (gimple_bind_vars (bind_stmt))); | |
1950 | gimple_bind_set_block (bind_copy, gimple_bind_block (bind_stmt)); | |
1951 | } | |
726a989a RB |
1952 | break; |
1953 | ||
1954 | case GIMPLE_CATCH: | |
538dd0b7 DM |
1955 | { |
1956 | gcatch *catch_stmt = as_a <gcatch *> (stmt); | |
1957 | gcatch *catch_copy = as_a <gcatch *> (copy); | |
1958 | new_seq = gimple_seq_copy (gimple_catch_handler (catch_stmt)); | |
1959 | gimple_catch_set_handler (catch_copy, new_seq); | |
1960 | t = unshare_expr (gimple_catch_types (catch_stmt)); | |
1961 | gimple_catch_set_types (catch_copy, t); | |
1962 | } | |
726a989a RB |
1963 | break; |
1964 | ||
1965 | case GIMPLE_EH_FILTER: | |
538dd0b7 DM |
1966 | { |
1967 | geh_filter *eh_filter_stmt = as_a <geh_filter *> (stmt); | |
1968 | geh_filter *eh_filter_copy = as_a <geh_filter *> (copy); | |
1969 | new_seq | |
1970 | = gimple_seq_copy (gimple_eh_filter_failure (eh_filter_stmt)); | |
1971 | gimple_eh_filter_set_failure (eh_filter_copy, new_seq); | |
1972 | t = unshare_expr (gimple_eh_filter_types (eh_filter_stmt)); | |
1973 | gimple_eh_filter_set_types (eh_filter_copy, t); | |
1974 | } | |
726a989a RB |
1975 | break; |
1976 | ||
0a35513e | 1977 | case GIMPLE_EH_ELSE: |
538dd0b7 DM |
1978 | { |
1979 | geh_else *eh_else_stmt = as_a <geh_else *> (stmt); | |
1980 | geh_else *eh_else_copy = as_a <geh_else *> (copy); | |
1981 | new_seq = gimple_seq_copy (gimple_eh_else_n_body (eh_else_stmt)); | |
1982 | gimple_eh_else_set_n_body (eh_else_copy, new_seq); | |
1983 | new_seq = gimple_seq_copy (gimple_eh_else_e_body (eh_else_stmt)); | |
1984 | gimple_eh_else_set_e_body (eh_else_copy, new_seq); | |
1985 | } | |
0a35513e AH |
1986 | break; |
1987 | ||
726a989a | 1988 | case GIMPLE_TRY: |
538dd0b7 DM |
1989 | { |
1990 | gtry *try_stmt = as_a <gtry *> (stmt); | |
1991 | gtry *try_copy = as_a <gtry *> (copy); | |
1992 | new_seq = gimple_seq_copy (gimple_try_eval (try_stmt)); | |
1993 | gimple_try_set_eval (try_copy, new_seq); | |
1994 | new_seq = gimple_seq_copy (gimple_try_cleanup (try_stmt)); | |
1995 | gimple_try_set_cleanup (try_copy, new_seq); | |
1996 | } | |
726a989a RB |
1997 | break; |
1998 | ||
1999 | case GIMPLE_OMP_FOR: | |
2000 | new_seq = gimple_seq_copy (gimple_omp_for_pre_body (stmt)); | |
2001 | gimple_omp_for_set_pre_body (copy, new_seq); | |
2002 | t = unshare_expr (gimple_omp_for_clauses (stmt)); | |
2003 | gimple_omp_for_set_clauses (copy, t); | |
daa6e488 | 2004 | { |
538dd0b7 | 2005 | gomp_for *omp_for_copy = as_a <gomp_for *> (copy); |
766090c2 TS |
2006 | omp_for_copy->iter = ggc_vec_alloc<gimple_omp_for_iter> |
2007 | ( gimple_omp_for_collapse (stmt)); | |
daa6e488 | 2008 | } |
726a989a RB |
2009 | for (i = 0; i < gimple_omp_for_collapse (stmt); i++) |
2010 | { | |
2011 | gimple_omp_for_set_cond (copy, i, | |
2012 | gimple_omp_for_cond (stmt, i)); | |
2013 | gimple_omp_for_set_index (copy, i, | |
2014 | gimple_omp_for_index (stmt, i)); | |
2015 | t = unshare_expr (gimple_omp_for_initial (stmt, i)); | |
2016 | gimple_omp_for_set_initial (copy, i, t); | |
2017 | t = unshare_expr (gimple_omp_for_final (stmt, i)); | |
2018 | gimple_omp_for_set_final (copy, i, t); | |
2019 | t = unshare_expr (gimple_omp_for_incr (stmt, i)); | |
2020 | gimple_omp_for_set_incr (copy, i, t); | |
2021 | } | |
2022 | goto copy_omp_body; | |
2023 | ||
2024 | case GIMPLE_OMP_PARALLEL: | |
538dd0b7 DM |
2025 | { |
2026 | gomp_parallel *omp_par_stmt = as_a <gomp_parallel *> (stmt); | |
2027 | gomp_parallel *omp_par_copy = as_a <gomp_parallel *> (copy); | |
2028 | t = unshare_expr (gimple_omp_parallel_clauses (omp_par_stmt)); | |
2029 | gimple_omp_parallel_set_clauses (omp_par_copy, t); | |
2030 | t = unshare_expr (gimple_omp_parallel_child_fn (omp_par_stmt)); | |
2031 | gimple_omp_parallel_set_child_fn (omp_par_copy, t); | |
2032 | t = unshare_expr (gimple_omp_parallel_data_arg (omp_par_stmt)); | |
2033 | gimple_omp_parallel_set_data_arg (omp_par_copy, t); | |
2034 | } | |
726a989a RB |
2035 | goto copy_omp_body; |
2036 | ||
2037 | case GIMPLE_OMP_TASK: | |
2038 | t = unshare_expr (gimple_omp_task_clauses (stmt)); | |
2039 | gimple_omp_task_set_clauses (copy, t); | |
2040 | t = unshare_expr (gimple_omp_task_child_fn (stmt)); | |
2041 | gimple_omp_task_set_child_fn (copy, t); | |
2042 | t = unshare_expr (gimple_omp_task_data_arg (stmt)); | |
2043 | gimple_omp_task_set_data_arg (copy, t); | |
2044 | t = unshare_expr (gimple_omp_task_copy_fn (stmt)); | |
2045 | gimple_omp_task_set_copy_fn (copy, t); | |
2046 | t = unshare_expr (gimple_omp_task_arg_size (stmt)); | |
2047 | gimple_omp_task_set_arg_size (copy, t); | |
2048 | t = unshare_expr (gimple_omp_task_arg_align (stmt)); | |
2049 | gimple_omp_task_set_arg_align (copy, t); | |
2050 | goto copy_omp_body; | |
2051 | ||
2052 | case GIMPLE_OMP_CRITICAL: | |
d9a6bd32 JJ |
2053 | t = unshare_expr (gimple_omp_critical_name |
2054 | (as_a <gomp_critical *> (stmt))); | |
538dd0b7 | 2055 | gimple_omp_critical_set_name (as_a <gomp_critical *> (copy), t); |
d9a6bd32 JJ |
2056 | t = unshare_expr (gimple_omp_critical_clauses |
2057 | (as_a <gomp_critical *> (stmt))); | |
2058 | gimple_omp_critical_set_clauses (as_a <gomp_critical *> (copy), t); | |
2059 | goto copy_omp_body; | |
2060 | ||
2061 | case GIMPLE_OMP_ORDERED: | |
2062 | t = unshare_expr (gimple_omp_ordered_clauses | |
2063 | (as_a <gomp_ordered *> (stmt))); | |
2064 | gimple_omp_ordered_set_clauses (as_a <gomp_ordered *> (copy), t); | |
726a989a RB |
2065 | goto copy_omp_body; |
2066 | ||
bf38f7e9 JJ |
2067 | case GIMPLE_OMP_SCAN: |
2068 | t = gimple_omp_scan_clauses (as_a <gomp_scan *> (stmt)); | |
2069 | t = unshare_expr (t); | |
2070 | gimple_omp_scan_set_clauses (as_a <gomp_scan *> (copy), t); | |
2071 | goto copy_omp_body; | |
2072 | ||
28567c40 JJ |
2073 | case GIMPLE_OMP_TASKGROUP: |
2074 | t = unshare_expr (gimple_omp_taskgroup_clauses (stmt)); | |
2075 | gimple_omp_taskgroup_set_clauses (copy, t); | |
2076 | goto copy_omp_body; | |
2077 | ||
726a989a RB |
2078 | case GIMPLE_OMP_SECTIONS: |
2079 | t = unshare_expr (gimple_omp_sections_clauses (stmt)); | |
2080 | gimple_omp_sections_set_clauses (copy, t); | |
2081 | t = unshare_expr (gimple_omp_sections_control (stmt)); | |
2082 | gimple_omp_sections_set_control (copy, t); | |
8a866b82 | 2083 | goto copy_omp_body; |
726a989a RB |
2084 | |
2085 | case GIMPLE_OMP_SINGLE: | |
8a866b82 TV |
2086 | { |
2087 | gomp_single *omp_single_copy = as_a <gomp_single *> (copy); | |
2088 | t = unshare_expr (gimple_omp_single_clauses (stmt)); | |
2089 | gimple_omp_single_set_clauses (omp_single_copy, t); | |
2090 | } | |
2091 | goto copy_omp_body; | |
2092 | ||
e45483c7 JJ |
2093 | case GIMPLE_OMP_SCOPE: |
2094 | t = unshare_expr (gimple_omp_scope_clauses (stmt)); | |
2095 | gimple_omp_scope_set_clauses (copy, t); | |
2096 | goto copy_omp_body; | |
2097 | ||
acf0174b | 2098 | case GIMPLE_OMP_TARGET: |
8a866b82 TV |
2099 | { |
2100 | gomp_target *omp_target_stmt = as_a <gomp_target *> (stmt); | |
2101 | gomp_target *omp_target_copy = as_a <gomp_target *> (copy); | |
2102 | t = unshare_expr (gimple_omp_target_clauses (omp_target_stmt)); | |
2103 | gimple_omp_target_set_clauses (omp_target_copy, t); | |
2104 | t = unshare_expr (gimple_omp_target_data_arg (omp_target_stmt)); | |
2105 | gimple_omp_target_set_data_arg (omp_target_copy, t); | |
2106 | } | |
2107 | goto copy_omp_body; | |
2108 | ||
acf0174b | 2109 | case GIMPLE_OMP_TEAMS: |
8a866b82 TV |
2110 | { |
2111 | gomp_teams *omp_teams_copy = as_a <gomp_teams *> (copy); | |
2112 | t = unshare_expr (gimple_omp_teams_clauses (stmt)); | |
2113 | gimple_omp_teams_set_clauses (omp_teams_copy, t); | |
2114 | } | |
2115 | /* FALLTHRU */ | |
2116 | ||
726a989a RB |
2117 | case GIMPLE_OMP_SECTION: |
2118 | case GIMPLE_OMP_MASTER: | |
726a989a RB |
2119 | copy_omp_body: |
2120 | new_seq = gimple_seq_copy (gimple_omp_body (stmt)); | |
2121 | gimple_omp_set_body (copy, new_seq); | |
2122 | break; | |
2123 | ||
d0befed7 JJ |
2124 | case GIMPLE_OMP_MASKED: |
2125 | t = unshare_expr (gimple_omp_masked_clauses (stmt)); | |
2126 | gimple_omp_masked_set_clauses (copy, t); | |
2127 | goto copy_omp_body; | |
2128 | ||
0a35513e | 2129 | case GIMPLE_TRANSACTION: |
538dd0b7 DM |
2130 | new_seq = gimple_seq_copy (gimple_transaction_body ( |
2131 | as_a <gtransaction *> (stmt))); | |
2132 | gimple_transaction_set_body (as_a <gtransaction *> (copy), | |
2133 | new_seq); | |
0a35513e AH |
2134 | break; |
2135 | ||
726a989a RB |
2136 | case GIMPLE_WITH_CLEANUP_EXPR: |
2137 | new_seq = gimple_seq_copy (gimple_wce_cleanup (stmt)); | |
2138 | gimple_wce_set_cleanup (copy, new_seq); | |
2139 | break; | |
2140 | ||
2141 | default: | |
2142 | gcc_unreachable (); | |
2143 | } | |
2144 | } | |
2145 | ||
2146 | /* Make copy of operands. */ | |
483ef49f RG |
2147 | for (i = 0; i < num_ops; i++) |
2148 | gimple_set_op (copy, i, unshare_expr (gimple_op (stmt, i))); | |
726a989a | 2149 | |
483ef49f RG |
2150 | if (gimple_has_mem_ops (stmt)) |
2151 | { | |
2152 | gimple_set_vdef (copy, gimple_vdef (stmt)); | |
2153 | gimple_set_vuse (copy, gimple_vuse (stmt)); | |
2154 | } | |
726a989a | 2155 | |
483ef49f RG |
2156 | /* Clear out SSA operand vectors on COPY. */ |
2157 | if (gimple_has_ops (stmt)) | |
2158 | { | |
483ef49f | 2159 | gimple_set_use_ops (copy, NULL); |
726a989a | 2160 | |
5006671f RG |
2161 | /* SSA operands need to be updated. */ |
2162 | gimple_set_modified (copy, true); | |
726a989a RB |
2163 | } |
2164 | ||
96a95ac1 AO |
2165 | if (gimple_debug_nonbind_marker_p (stmt)) |
2166 | cfun->debug_marker_count++; | |
2167 | ||
726a989a RB |
2168 | return copy; |
2169 | } | |
2170 | ||
779724a5 RS |
2171 | /* Move OLD_STMT's vuse and vdef operands to NEW_STMT, on the assumption |
2172 | that OLD_STMT is about to be removed. */ | |
2173 | ||
2174 | void | |
2175 | gimple_move_vops (gimple *new_stmt, gimple *old_stmt) | |
2176 | { | |
2177 | tree vdef = gimple_vdef (old_stmt); | |
2178 | gimple_set_vuse (new_stmt, gimple_vuse (old_stmt)); | |
2179 | gimple_set_vdef (new_stmt, vdef); | |
2180 | if (vdef && TREE_CODE (vdef) == SSA_NAME) | |
2181 | SSA_NAME_DEF_STMT (vdef) = new_stmt; | |
2182 | } | |
726a989a | 2183 | |
726a989a RB |
2184 | /* Return true if statement S has side-effects. We consider a |
2185 | statement to have side effects if: | |
2186 | ||
2187 | - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST. | |
2188 | - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */ | |
2189 | ||
2190 | bool | |
355fe088 | 2191 | gimple_has_side_effects (const gimple *s) |
726a989a | 2192 | { |
b5b8b0ac AO |
2193 | if (is_gimple_debug (s)) |
2194 | return false; | |
2195 | ||
726a989a RB |
2196 | /* We don't have to scan the arguments to check for |
2197 | volatile arguments, though, at present, we still | |
2198 | do a scan to check for TREE_SIDE_EFFECTS. */ | |
2199 | if (gimple_has_volatile_ops (s)) | |
2200 | return true; | |
2201 | ||
179184e3 | 2202 | if (gimple_code (s) == GIMPLE_ASM |
538dd0b7 | 2203 | && gimple_asm_volatile_p (as_a <const gasm *> (s))) |
179184e3 RG |
2204 | return true; |
2205 | ||
726a989a RB |
2206 | if (is_gimple_call (s)) |
2207 | { | |
723afc44 | 2208 | int flags = gimple_call_flags (s); |
726a989a | 2209 | |
723afc44 RG |
2210 | /* An infinite loop is considered a side effect. */ |
2211 | if (!(flags & (ECF_CONST | ECF_PURE)) | |
2212 | || (flags & ECF_LOOPING_CONST_OR_PURE)) | |
726a989a RB |
2213 | return true; |
2214 | ||
726a989a RB |
2215 | return false; |
2216 | } | |
726a989a RB |
2217 | |
2218 | return false; | |
2219 | } | |
2220 | ||
726a989a | 2221 | /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p. |
e1fd038a SP |
2222 | Return true if S can trap. When INCLUDE_MEM is true, check whether |
2223 | the memory operations could trap. When INCLUDE_STORES is true and | |
2224 | S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */ | |
726a989a | 2225 | |
e1fd038a | 2226 | bool |
9aa5001e | 2227 | gimple_could_trap_p_1 (const gimple *s, bool include_mem, bool include_stores) |
726a989a | 2228 | { |
726a989a RB |
2229 | tree t, div = NULL_TREE; |
2230 | enum tree_code op; | |
2231 | ||
e1fd038a SP |
2232 | if (include_mem) |
2233 | { | |
2234 | unsigned i, start = (is_gimple_assign (s) && !include_stores) ? 1 : 0; | |
726a989a | 2235 | |
e1fd038a SP |
2236 | for (i = start; i < gimple_num_ops (s); i++) |
2237 | if (tree_could_trap_p (gimple_op (s, i))) | |
2238 | return true; | |
2239 | } | |
726a989a RB |
2240 | |
2241 | switch (gimple_code (s)) | |
2242 | { | |
2243 | case GIMPLE_ASM: | |
9aa5001e | 2244 | return gimple_asm_volatile_p (as_a <const gasm *> (s)); |
726a989a RB |
2245 | |
2246 | case GIMPLE_CALL: | |
123d0a59 RB |
2247 | if (gimple_call_internal_p (s)) |
2248 | return false; | |
726a989a | 2249 | t = gimple_call_fndecl (s); |
123d0a59 | 2250 | /* Assume that indirect and calls to weak functions may trap. */ |
726a989a RB |
2251 | if (!t || !DECL_P (t) || DECL_WEAK (t)) |
2252 | return true; | |
2253 | return false; | |
2254 | ||
2255 | case GIMPLE_ASSIGN: | |
726a989a | 2256 | op = gimple_assign_rhs_code (s); |
70e2a30a | 2257 | |
35b2be21 RB |
2258 | /* For COND_EXPR only the condition may trap. */ |
2259 | if (op == COND_EXPR) | |
70e2a30a IL |
2260 | return tree_could_trap_p (gimple_assign_rhs1 (s)); |
2261 | ||
ce777eae | 2262 | /* For comparisons we need to check rhs operand types instead of lhs type |
70e2a30a IL |
2263 | (which is BOOLEAN_TYPE). */ |
2264 | if (TREE_CODE_CLASS (op) == tcc_comparison) | |
2265 | t = TREE_TYPE (gimple_assign_rhs1 (s)); | |
2266 | else | |
ce777eae | 2267 | t = TREE_TYPE (gimple_assign_lhs (s)); |
70e2a30a | 2268 | |
726a989a RB |
2269 | if (get_gimple_rhs_class (op) == GIMPLE_BINARY_RHS) |
2270 | div = gimple_assign_rhs2 (s); | |
70e2a30a | 2271 | |
726a989a RB |
2272 | return (operation_could_trap_p (op, FLOAT_TYPE_P (t), |
2273 | (INTEGRAL_TYPE_P (t) | |
2274 | && TYPE_OVERFLOW_TRAPS (t)), | |
2275 | div)); | |
2276 | ||
46ec7a06 RB |
2277 | case GIMPLE_COND: |
2278 | t = TREE_TYPE (gimple_cond_lhs (s)); | |
2279 | return operation_could_trap_p (gimple_cond_code (s), | |
2280 | FLOAT_TYPE_P (t), false, NULL_TREE); | |
2281 | ||
726a989a RB |
2282 | default: |
2283 | break; | |
2284 | } | |
2285 | ||
2286 | return false; | |
726a989a RB |
2287 | } |
2288 | ||
726a989a RB |
2289 | /* Return true if statement S can trap. */ |
2290 | ||
2291 | bool | |
9aa5001e | 2292 | gimple_could_trap_p (const gimple *s) |
726a989a | 2293 | { |
e1fd038a | 2294 | return gimple_could_trap_p_1 (s, true, true); |
726a989a RB |
2295 | } |
2296 | ||
726a989a RB |
2297 | /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */ |
2298 | ||
2299 | bool | |
355fe088 | 2300 | gimple_assign_rhs_could_trap_p (gimple *s) |
726a989a RB |
2301 | { |
2302 | gcc_assert (is_gimple_assign (s)); | |
e1fd038a | 2303 | return gimple_could_trap_p_1 (s, true, false); |
726a989a RB |
2304 | } |
2305 | ||
2306 | ||
2307 | /* Print debugging information for gimple stmts generated. */ | |
2308 | ||
2309 | void | |
2310 | dump_gimple_statistics (void) | |
2311 | { | |
33b366c3 ML |
2312 | int i; |
2313 | uint64_t total_tuples = 0, total_bytes = 0; | |
726a989a | 2314 | |
7aa6d18a SB |
2315 | if (! GATHER_STATISTICS) |
2316 | { | |
33b366c3 | 2317 | fprintf (stderr, "No GIMPLE statistics\n"); |
7aa6d18a SB |
2318 | return; |
2319 | } | |
2320 | ||
726a989a RB |
2321 | fprintf (stderr, "\nGIMPLE statements\n"); |
2322 | fprintf (stderr, "Kind Stmts Bytes\n"); | |
2323 | fprintf (stderr, "---------------------------------------\n"); | |
2324 | for (i = 0; i < (int) gimple_alloc_kind_all; ++i) | |
2325 | { | |
40ce7fa6 ML |
2326 | fprintf (stderr, "%-20s %7" PRIu64 "%c %10" PRIu64 "%c\n", |
2327 | gimple_alloc_kind_names[i], | |
2328 | SIZE_AMOUNT (gimple_alloc_counts[i]), | |
2329 | SIZE_AMOUNT (gimple_alloc_sizes[i])); | |
726a989a RB |
2330 | total_tuples += gimple_alloc_counts[i]; |
2331 | total_bytes += gimple_alloc_sizes[i]; | |
2332 | } | |
2333 | fprintf (stderr, "---------------------------------------\n"); | |
40ce7fa6 ML |
2334 | fprintf (stderr, "%-20s %7" PRIu64 "%c %10" PRIu64 "%c\n", "Total", |
2335 | SIZE_AMOUNT (total_tuples), SIZE_AMOUNT (total_bytes)); | |
726a989a | 2336 | fprintf (stderr, "---------------------------------------\n"); |
726a989a RB |
2337 | } |
2338 | ||
2339 | ||
726a989a RB |
2340 | /* Return the number of operands needed on the RHS of a GIMPLE |
2341 | assignment for an expression with tree code CODE. */ | |
2342 | ||
2343 | unsigned | |
2344 | get_gimple_rhs_num_ops (enum tree_code code) | |
2345 | { | |
90acd49f ML |
2346 | switch (get_gimple_rhs_class (code)) |
2347 | { | |
2348 | case GIMPLE_UNARY_RHS: | |
2349 | case GIMPLE_SINGLE_RHS: | |
2350 | return 1; | |
2351 | case GIMPLE_BINARY_RHS: | |
2352 | return 2; | |
2353 | case GIMPLE_TERNARY_RHS: | |
2354 | return 3; | |
2355 | default: | |
2356 | gcc_unreachable (); | |
2357 | } | |
726a989a RB |
2358 | } |
2359 | ||
2360 | #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \ | |
2361 | (unsigned char) \ | |
2362 | ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \ | |
2363 | : ((TYPE) == tcc_binary \ | |
2364 | || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \ | |
2365 | : ((TYPE) == tcc_constant \ | |
2366 | || (TYPE) == tcc_declaration \ | |
2367 | || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \ | |
2368 | : ((SYM) == TRUTH_AND_EXPR \ | |
2369 | || (SYM) == TRUTH_OR_EXPR \ | |
2370 | || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \ | |
2371 | : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \ | |
4e71066d RG |
2372 | : ((SYM) == COND_EXPR \ |
2373 | || (SYM) == WIDEN_MULT_PLUS_EXPR \ | |
16949072 | 2374 | || (SYM) == WIDEN_MULT_MINUS_EXPR \ |
f471fe72 | 2375 | || (SYM) == DOT_PROD_EXPR \ |
79d652a5 | 2376 | || (SYM) == SAD_EXPR \ |
f471fe72 | 2377 | || (SYM) == REALIGN_LOAD_EXPR \ |
4e71066d | 2378 | || (SYM) == VEC_COND_EXPR \ |
2205ed25 | 2379 | || (SYM) == VEC_PERM_EXPR \ |
c566cc9f | 2380 | || (SYM) == BIT_INSERT_EXPR) ? GIMPLE_TERNARY_RHS \ |
4e71066d | 2381 | : ((SYM) == CONSTRUCTOR \ |
726a989a RB |
2382 | || (SYM) == OBJ_TYPE_REF \ |
2383 | || (SYM) == ASSERT_EXPR \ | |
2384 | || (SYM) == ADDR_EXPR \ | |
2385 | || (SYM) == WITH_SIZE_EXPR \ | |
4e71066d | 2386 | || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \ |
726a989a RB |
2387 | : GIMPLE_INVALID_RHS), |
2388 | #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS, | |
2389 | ||
2390 | const unsigned char gimple_rhs_class_table[] = { | |
2391 | #include "all-tree.def" | |
2392 | }; | |
2393 | ||
2394 | #undef DEFTREECODE | |
2395 | #undef END_OF_BASE_TREE_CODES | |
2396 | ||
726a989a RB |
2397 | /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns |
2398 | a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if | |
2399 | we failed to create one. */ | |
2400 | ||
2401 | tree | |
2402 | canonicalize_cond_expr_cond (tree t) | |
2403 | { | |
b66a1bac RG |
2404 | /* Strip conversions around boolean operations. */ |
2405 | if (CONVERT_EXPR_P (t) | |
9b80d091 KT |
2406 | && (truth_value_p (TREE_CODE (TREE_OPERAND (t, 0))) |
2407 | || TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) | |
2408 | == BOOLEAN_TYPE)) | |
b66a1bac RG |
2409 | t = TREE_OPERAND (t, 0); |
2410 | ||
726a989a | 2411 | /* For !x use x == 0. */ |
12430896 | 2412 | if (TREE_CODE (t) == TRUTH_NOT_EXPR) |
726a989a RB |
2413 | { |
2414 | tree top0 = TREE_OPERAND (t, 0); | |
2415 | t = build2 (EQ_EXPR, TREE_TYPE (t), | |
2416 | top0, build_int_cst (TREE_TYPE (top0), 0)); | |
2417 | } | |
2418 | /* For cmp ? 1 : 0 use cmp. */ | |
2419 | else if (TREE_CODE (t) == COND_EXPR | |
2420 | && COMPARISON_CLASS_P (TREE_OPERAND (t, 0)) | |
2421 | && integer_onep (TREE_OPERAND (t, 1)) | |
2422 | && integer_zerop (TREE_OPERAND (t, 2))) | |
2423 | { | |
2424 | tree top0 = TREE_OPERAND (t, 0); | |
2425 | t = build2 (TREE_CODE (top0), TREE_TYPE (t), | |
2426 | TREE_OPERAND (top0, 0), TREE_OPERAND (top0, 1)); | |
2427 | } | |
4481581f JL |
2428 | /* For x ^ y use x != y. */ |
2429 | else if (TREE_CODE (t) == BIT_XOR_EXPR) | |
2430 | t = build2 (NE_EXPR, TREE_TYPE (t), | |
2431 | TREE_OPERAND (t, 0), TREE_OPERAND (t, 1)); | |
2432 | ||
726a989a RB |
2433 | if (is_gimple_condexpr (t)) |
2434 | return t; | |
2435 | ||
2436 | return NULL_TREE; | |
2437 | } | |
2438 | ||
e6c99067 DN |
2439 | /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in |
2440 | the positions marked by the set ARGS_TO_SKIP. */ | |
2441 | ||
538dd0b7 DM |
2442 | gcall * |
2443 | gimple_call_copy_skip_args (gcall *stmt, bitmap args_to_skip) | |
c6f7cfc1 JH |
2444 | { |
2445 | int i; | |
c6f7cfc1 | 2446 | int nargs = gimple_call_num_args (stmt); |
ef062b13 | 2447 | auto_vec<tree> vargs (nargs); |
538dd0b7 | 2448 | gcall *new_stmt; |
c6f7cfc1 JH |
2449 | |
2450 | for (i = 0; i < nargs; i++) | |
2451 | if (!bitmap_bit_p (args_to_skip, i)) | |
9771b263 | 2452 | vargs.quick_push (gimple_call_arg (stmt, i)); |
c6f7cfc1 | 2453 | |
25583c4f RS |
2454 | if (gimple_call_internal_p (stmt)) |
2455 | new_stmt = gimple_build_call_internal_vec (gimple_call_internal_fn (stmt), | |
2456 | vargs); | |
2457 | else | |
2458 | new_stmt = gimple_build_call_vec (gimple_call_fn (stmt), vargs); | |
ef062b13 | 2459 | |
c6f7cfc1 JH |
2460 | if (gimple_call_lhs (stmt)) |
2461 | gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt)); | |
2462 | ||
5006671f RG |
2463 | gimple_set_vuse (new_stmt, gimple_vuse (stmt)); |
2464 | gimple_set_vdef (new_stmt, gimple_vdef (stmt)); | |
2465 | ||
c6f7cfc1 JH |
2466 | if (gimple_has_location (stmt)) |
2467 | gimple_set_location (new_stmt, gimple_location (stmt)); | |
8d2adc24 | 2468 | gimple_call_copy_flags (new_stmt, stmt); |
c6f7cfc1 | 2469 | gimple_call_set_chain (new_stmt, gimple_call_chain (stmt)); |
5006671f RG |
2470 | |
2471 | gimple_set_modified (new_stmt, true); | |
2472 | ||
c6f7cfc1 JH |
2473 | return new_stmt; |
2474 | } | |
2475 | ||
5006671f | 2476 | |
d7f09764 | 2477 | |
d025732d EB |
2478 | /* Return true if the field decls F1 and F2 are at the same offset. |
2479 | ||
91f2fae8 | 2480 | This is intended to be used on GIMPLE types only. */ |
d7f09764 | 2481 | |
1e4bc4eb | 2482 | bool |
d025732d | 2483 | gimple_compare_field_offset (tree f1, tree f2) |
d7f09764 DN |
2484 | { |
2485 | if (DECL_OFFSET_ALIGN (f1) == DECL_OFFSET_ALIGN (f2)) | |
d025732d EB |
2486 | { |
2487 | tree offset1 = DECL_FIELD_OFFSET (f1); | |
2488 | tree offset2 = DECL_FIELD_OFFSET (f2); | |
2489 | return ((offset1 == offset2 | |
2490 | /* Once gimplification is done, self-referential offsets are | |
2491 | instantiated as operand #2 of the COMPONENT_REF built for | |
2492 | each access and reset. Therefore, they are not relevant | |
2493 | anymore and fields are interchangeable provided that they | |
2494 | represent the same access. */ | |
2495 | || (TREE_CODE (offset1) == PLACEHOLDER_EXPR | |
2496 | && TREE_CODE (offset2) == PLACEHOLDER_EXPR | |
2497 | && (DECL_SIZE (f1) == DECL_SIZE (f2) | |
2498 | || (TREE_CODE (DECL_SIZE (f1)) == PLACEHOLDER_EXPR | |
2499 | && TREE_CODE (DECL_SIZE (f2)) == PLACEHOLDER_EXPR) | |
2500 | || operand_equal_p (DECL_SIZE (f1), DECL_SIZE (f2), 0)) | |
2501 | && DECL_ALIGN (f1) == DECL_ALIGN (f2)) | |
2502 | || operand_equal_p (offset1, offset2, 0)) | |
2503 | && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1), | |
2504 | DECL_FIELD_BIT_OFFSET (f2))); | |
2505 | } | |
d7f09764 DN |
2506 | |
2507 | /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN | |
2508 | should be, so handle differing ones specially by decomposing | |
2509 | the offset into a byte and bit offset manually. */ | |
9541ffee RS |
2510 | if (tree_fits_shwi_p (DECL_FIELD_OFFSET (f1)) |
2511 | && tree_fits_shwi_p (DECL_FIELD_OFFSET (f2))) | |
d7f09764 DN |
2512 | { |
2513 | unsigned HOST_WIDE_INT byte_offset1, byte_offset2; | |
2514 | unsigned HOST_WIDE_INT bit_offset1, bit_offset2; | |
2515 | bit_offset1 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1)); | |
2516 | byte_offset1 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1)) | |
2517 | + bit_offset1 / BITS_PER_UNIT); | |
2518 | bit_offset2 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2)); | |
2519 | byte_offset2 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2)) | |
2520 | + bit_offset2 / BITS_PER_UNIT); | |
2521 | if (byte_offset1 != byte_offset2) | |
2522 | return false; | |
2523 | return bit_offset1 % BITS_PER_UNIT == bit_offset2 % BITS_PER_UNIT; | |
2524 | } | |
2525 | ||
2526 | return false; | |
2527 | } | |
2528 | ||
d7f09764 DN |
2529 | |
2530 | /* Return a type the same as TYPE except unsigned or | |
2531 | signed according to UNSIGNEDP. */ | |
2532 | ||
2533 | static tree | |
2534 | gimple_signed_or_unsigned_type (bool unsignedp, tree type) | |
2535 | { | |
2536 | tree type1; | |
78a7c317 | 2537 | int i; |
d7f09764 DN |
2538 | |
2539 | type1 = TYPE_MAIN_VARIANT (type); | |
2540 | if (type1 == signed_char_type_node | |
2541 | || type1 == char_type_node | |
2542 | || type1 == unsigned_char_type_node) | |
2543 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2544 | if (type1 == integer_type_node || type1 == unsigned_type_node) | |
2545 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2546 | if (type1 == short_integer_type_node || type1 == short_unsigned_type_node) | |
2547 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2548 | if (type1 == long_integer_type_node || type1 == long_unsigned_type_node) | |
2549 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2550 | if (type1 == long_long_integer_type_node | |
2551 | || type1 == long_long_unsigned_type_node) | |
2552 | return unsignedp | |
2553 | ? long_long_unsigned_type_node | |
2554 | : long_long_integer_type_node; | |
78a7c317 DD |
2555 | |
2556 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
2557 | if (int_n_enabled_p[i] | |
2558 | && (type1 == int_n_trees[i].unsigned_type | |
2559 | || type1 == int_n_trees[i].signed_type)) | |
2560 | return unsignedp | |
2561 | ? int_n_trees[i].unsigned_type | |
2562 | : int_n_trees[i].signed_type; | |
2563 | ||
d7f09764 DN |
2564 | #if HOST_BITS_PER_WIDE_INT >= 64 |
2565 | if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node) | |
2566 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
2567 | #endif | |
2568 | if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node) | |
2569 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2570 | if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node) | |
2571 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2572 | if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node) | |
2573 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2574 | if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node) | |
2575 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2576 | ||
2577 | #define GIMPLE_FIXED_TYPES(NAME) \ | |
2578 | if (type1 == short_ ## NAME ## _type_node \ | |
2579 | || type1 == unsigned_short_ ## NAME ## _type_node) \ | |
2580 | return unsignedp ? unsigned_short_ ## NAME ## _type_node \ | |
2581 | : short_ ## NAME ## _type_node; \ | |
2582 | if (type1 == NAME ## _type_node \ | |
2583 | || type1 == unsigned_ ## NAME ## _type_node) \ | |
2584 | return unsignedp ? unsigned_ ## NAME ## _type_node \ | |
2585 | : NAME ## _type_node; \ | |
2586 | if (type1 == long_ ## NAME ## _type_node \ | |
2587 | || type1 == unsigned_long_ ## NAME ## _type_node) \ | |
2588 | return unsignedp ? unsigned_long_ ## NAME ## _type_node \ | |
2589 | : long_ ## NAME ## _type_node; \ | |
2590 | if (type1 == long_long_ ## NAME ## _type_node \ | |
2591 | || type1 == unsigned_long_long_ ## NAME ## _type_node) \ | |
2592 | return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \ | |
2593 | : long_long_ ## NAME ## _type_node; | |
2594 | ||
2595 | #define GIMPLE_FIXED_MODE_TYPES(NAME) \ | |
2596 | if (type1 == NAME ## _type_node \ | |
2597 | || type1 == u ## NAME ## _type_node) \ | |
2598 | return unsignedp ? u ## NAME ## _type_node \ | |
2599 | : NAME ## _type_node; | |
2600 | ||
2601 | #define GIMPLE_FIXED_TYPES_SAT(NAME) \ | |
2602 | if (type1 == sat_ ## short_ ## NAME ## _type_node \ | |
2603 | || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \ | |
2604 | return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \ | |
2605 | : sat_ ## short_ ## NAME ## _type_node; \ | |
2606 | if (type1 == sat_ ## NAME ## _type_node \ | |
2607 | || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \ | |
2608 | return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \ | |
2609 | : sat_ ## NAME ## _type_node; \ | |
2610 | if (type1 == sat_ ## long_ ## NAME ## _type_node \ | |
2611 | || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \ | |
2612 | return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \ | |
2613 | : sat_ ## long_ ## NAME ## _type_node; \ | |
2614 | if (type1 == sat_ ## long_long_ ## NAME ## _type_node \ | |
2615 | || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \ | |
2616 | return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \ | |
2617 | : sat_ ## long_long_ ## NAME ## _type_node; | |
2618 | ||
2619 | #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \ | |
2620 | if (type1 == sat_ ## NAME ## _type_node \ | |
2621 | || type1 == sat_ ## u ## NAME ## _type_node) \ | |
2622 | return unsignedp ? sat_ ## u ## NAME ## _type_node \ | |
2623 | : sat_ ## NAME ## _type_node; | |
2624 | ||
2625 | GIMPLE_FIXED_TYPES (fract); | |
2626 | GIMPLE_FIXED_TYPES_SAT (fract); | |
2627 | GIMPLE_FIXED_TYPES (accum); | |
2628 | GIMPLE_FIXED_TYPES_SAT (accum); | |
2629 | ||
2630 | GIMPLE_FIXED_MODE_TYPES (qq); | |
2631 | GIMPLE_FIXED_MODE_TYPES (hq); | |
2632 | GIMPLE_FIXED_MODE_TYPES (sq); | |
2633 | GIMPLE_FIXED_MODE_TYPES (dq); | |
2634 | GIMPLE_FIXED_MODE_TYPES (tq); | |
2635 | GIMPLE_FIXED_MODE_TYPES_SAT (qq); | |
2636 | GIMPLE_FIXED_MODE_TYPES_SAT (hq); | |
2637 | GIMPLE_FIXED_MODE_TYPES_SAT (sq); | |
2638 | GIMPLE_FIXED_MODE_TYPES_SAT (dq); | |
2639 | GIMPLE_FIXED_MODE_TYPES_SAT (tq); | |
2640 | GIMPLE_FIXED_MODE_TYPES (ha); | |
2641 | GIMPLE_FIXED_MODE_TYPES (sa); | |
2642 | GIMPLE_FIXED_MODE_TYPES (da); | |
2643 | GIMPLE_FIXED_MODE_TYPES (ta); | |
2644 | GIMPLE_FIXED_MODE_TYPES_SAT (ha); | |
2645 | GIMPLE_FIXED_MODE_TYPES_SAT (sa); | |
2646 | GIMPLE_FIXED_MODE_TYPES_SAT (da); | |
2647 | GIMPLE_FIXED_MODE_TYPES_SAT (ta); | |
2648 | ||
2649 | /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not | |
2650 | the precision; they have precision set to match their range, but | |
2651 | may use a wider mode to match an ABI. If we change modes, we may | |
2652 | wind up with bad conversions. For INTEGER_TYPEs in C, must check | |
2653 | the precision as well, so as to yield correct results for | |
2654 | bit-field types. C++ does not have these separate bit-field | |
2655 | types, and producing a signed or unsigned variant of an | |
2656 | ENUMERAL_TYPE may cause other problems as well. */ | |
2657 | if (!INTEGRAL_TYPE_P (type) | |
2658 | || TYPE_UNSIGNED (type) == unsignedp) | |
2659 | return type; | |
2660 | ||
2661 | #define TYPE_OK(node) \ | |
2662 | (TYPE_MODE (type) == TYPE_MODE (node) \ | |
2663 | && TYPE_PRECISION (type) == TYPE_PRECISION (node)) | |
2664 | if (TYPE_OK (signed_char_type_node)) | |
2665 | return unsignedp ? unsigned_char_type_node : signed_char_type_node; | |
2666 | if (TYPE_OK (integer_type_node)) | |
2667 | return unsignedp ? unsigned_type_node : integer_type_node; | |
2668 | if (TYPE_OK (short_integer_type_node)) | |
2669 | return unsignedp ? short_unsigned_type_node : short_integer_type_node; | |
2670 | if (TYPE_OK (long_integer_type_node)) | |
2671 | return unsignedp ? long_unsigned_type_node : long_integer_type_node; | |
2672 | if (TYPE_OK (long_long_integer_type_node)) | |
2673 | return (unsignedp | |
2674 | ? long_long_unsigned_type_node | |
2675 | : long_long_integer_type_node); | |
78a7c317 DD |
2676 | |
2677 | for (i = 0; i < NUM_INT_N_ENTS; i ++) | |
2678 | if (int_n_enabled_p[i] | |
2679 | && TYPE_MODE (type) == int_n_data[i].m | |
2680 | && TYPE_PRECISION (type) == int_n_data[i].bitsize) | |
2681 | return unsignedp | |
2682 | ? int_n_trees[i].unsigned_type | |
2683 | : int_n_trees[i].signed_type; | |
d7f09764 DN |
2684 | |
2685 | #if HOST_BITS_PER_WIDE_INT >= 64 | |
2686 | if (TYPE_OK (intTI_type_node)) | |
2687 | return unsignedp ? unsigned_intTI_type_node : intTI_type_node; | |
2688 | #endif | |
2689 | if (TYPE_OK (intDI_type_node)) | |
2690 | return unsignedp ? unsigned_intDI_type_node : intDI_type_node; | |
2691 | if (TYPE_OK (intSI_type_node)) | |
2692 | return unsignedp ? unsigned_intSI_type_node : intSI_type_node; | |
2693 | if (TYPE_OK (intHI_type_node)) | |
2694 | return unsignedp ? unsigned_intHI_type_node : intHI_type_node; | |
2695 | if (TYPE_OK (intQI_type_node)) | |
2696 | return unsignedp ? unsigned_intQI_type_node : intQI_type_node; | |
2697 | ||
2698 | #undef GIMPLE_FIXED_TYPES | |
2699 | #undef GIMPLE_FIXED_MODE_TYPES | |
2700 | #undef GIMPLE_FIXED_TYPES_SAT | |
2701 | #undef GIMPLE_FIXED_MODE_TYPES_SAT | |
2702 | #undef TYPE_OK | |
2703 | ||
2704 | return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp); | |
2705 | } | |
2706 | ||
2707 | ||
2708 | /* Return an unsigned type the same as TYPE in other respects. */ | |
2709 | ||
2710 | tree | |
2711 | gimple_unsigned_type (tree type) | |
2712 | { | |
2713 | return gimple_signed_or_unsigned_type (true, type); | |
2714 | } | |
2715 | ||
2716 | ||
2717 | /* Return a signed type the same as TYPE in other respects. */ | |
2718 | ||
2719 | tree | |
2720 | gimple_signed_type (tree type) | |
2721 | { | |
2722 | return gimple_signed_or_unsigned_type (false, type); | |
2723 | } | |
2724 | ||
2725 | ||
2726 | /* Return the typed-based alias set for T, which may be an expression | |
2727 | or a type. Return -1 if we don't do anything special. */ | |
2728 | ||
2729 | alias_set_type | |
2730 | gimple_get_alias_set (tree t) | |
2731 | { | |
d7f09764 DN |
2732 | /* That's all the expressions we handle specially. */ |
2733 | if (!TYPE_P (t)) | |
2734 | return -1; | |
2735 | ||
2736 | /* For convenience, follow the C standard when dealing with | |
2737 | character types. Any object may be accessed via an lvalue that | |
2738 | has character type. */ | |
2739 | if (t == char_type_node | |
2740 | || t == signed_char_type_node | |
2741 | || t == unsigned_char_type_node) | |
2742 | return 0; | |
2743 | ||
2744 | /* Allow aliasing between signed and unsigned variants of the same | |
2745 | type. We treat the signed variant as canonical. */ | |
2746 | if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t)) | |
2747 | { | |
2748 | tree t1 = gimple_signed_type (t); | |
2749 | ||
2750 | /* t1 == t can happen for boolean nodes which are always unsigned. */ | |
2751 | if (t1 != t) | |
2752 | return get_alias_set (t1); | |
2753 | } | |
d7f09764 | 2754 | |
2a82beaa RB |
2755 | /* Allow aliasing between enumeral types and the underlying |
2756 | integer type. This is required for C since those are | |
2757 | compatible types. */ | |
2758 | else if (TREE_CODE (t) == ENUMERAL_TYPE) | |
2759 | { | |
2760 | tree t1 = lang_hooks.types.type_for_size (tree_to_uhwi (TYPE_SIZE (t)), | |
2761 | false /* short-cut above */); | |
2762 | return get_alias_set (t1); | |
2763 | } | |
2764 | ||
d7f09764 DN |
2765 | return -1; |
2766 | } | |
2767 | ||
2768 | ||
ccacdf06 RG |
2769 | /* Helper for gimple_ior_addresses_taken_1. */ |
2770 | ||
2771 | static bool | |
355fe088 | 2772 | gimple_ior_addresses_taken_1 (gimple *, tree addr, tree, void *data) |
ccacdf06 RG |
2773 | { |
2774 | bitmap addresses_taken = (bitmap)data; | |
2ea9dc64 RG |
2775 | addr = get_base_address (addr); |
2776 | if (addr | |
2777 | && DECL_P (addr)) | |
ccacdf06 RG |
2778 | { |
2779 | bitmap_set_bit (addresses_taken, DECL_UID (addr)); | |
2780 | return true; | |
2781 | } | |
2782 | return false; | |
2783 | } | |
2784 | ||
2785 | /* Set the bit for the uid of all decls that have their address taken | |
2786 | in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there | |
2787 | were any in this stmt. */ | |
2788 | ||
2789 | bool | |
355fe088 | 2790 | gimple_ior_addresses_taken (bitmap addresses_taken, gimple *stmt) |
ccacdf06 RG |
2791 | { |
2792 | return walk_stmt_load_store_addr_ops (stmt, addresses_taken, NULL, NULL, | |
2793 | gimple_ior_addresses_taken_1); | |
2794 | } | |
2795 | ||
4537ec0c | 2796 | |
5c944c6c RB |
2797 | /* Return true when STMTs arguments and return value match those of FNDECL, |
2798 | a decl of a builtin function. */ | |
3626621a | 2799 | |
5c944c6c | 2800 | bool |
355fe088 | 2801 | gimple_builtin_call_types_compatible_p (const gimple *stmt, tree fndecl) |
3626621a | 2802 | { |
5c944c6c RB |
2803 | gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl) != NOT_BUILT_IN); |
2804 | ||
2805 | tree ret = gimple_call_lhs (stmt); | |
2806 | if (ret | |
2ad3adf1 JJ |
2807 | && !useless_type_conversion_p (TREE_TYPE (ret), |
2808 | TREE_TYPE (TREE_TYPE (fndecl)))) | |
5c944c6c RB |
2809 | return false; |
2810 | ||
3626621a RB |
2811 | tree targs = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); |
2812 | unsigned nargs = gimple_call_num_args (stmt); | |
2813 | for (unsigned i = 0; i < nargs; ++i) | |
2814 | { | |
2815 | /* Variadic args follow. */ | |
2816 | if (!targs) | |
2817 | return true; | |
2818 | tree arg = gimple_call_arg (stmt, i); | |
fd39794a JJ |
2819 | tree type = TREE_VALUE (targs); |
2820 | if (!useless_type_conversion_p (type, TREE_TYPE (arg)) | |
2821 | /* char/short integral arguments are promoted to int | |
2822 | by several frontends if targetm.calls.promote_prototypes | |
2823 | is true. Allow such promotion too. */ | |
2824 | && !(INTEGRAL_TYPE_P (type) | |
2825 | && TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node) | |
2826 | && targetm.calls.promote_prototypes (TREE_TYPE (fndecl)) | |
2827 | && useless_type_conversion_p (integer_type_node, | |
2828 | TREE_TYPE (arg)))) | |
3626621a RB |
2829 | return false; |
2830 | targs = TREE_CHAIN (targs); | |
2831 | } | |
2832 | if (targs && !VOID_TYPE_P (TREE_VALUE (targs))) | |
2833 | return false; | |
2834 | return true; | |
2835 | } | |
2836 | ||
70df40ca | 2837 | /* Return true when STMT is operator a replaceable delete call. */ |
6343b6bf ML |
2838 | |
2839 | bool | |
4f4ced28 | 2840 | gimple_call_operator_delete_p (const gcall *stmt) |
6343b6bf ML |
2841 | { |
2842 | tree fndecl; | |
2843 | ||
2844 | if ((fndecl = gimple_call_fndecl (stmt)) != NULL_TREE) | |
4f4ced28 | 2845 | return DECL_IS_OPERATOR_DELETE_P (fndecl); |
6343b6bf ML |
2846 | return false; |
2847 | } | |
2848 | ||
5c944c6c RB |
2849 | /* Return true when STMT is builtins call. */ |
2850 | ||
2851 | bool | |
355fe088 | 2852 | gimple_call_builtin_p (const gimple *stmt) |
5c944c6c RB |
2853 | { |
2854 | tree fndecl; | |
2855 | if (is_gimple_call (stmt) | |
2856 | && (fndecl = gimple_call_fndecl (stmt)) != NULL_TREE | |
2857 | && DECL_BUILT_IN_CLASS (fndecl) != NOT_BUILT_IN) | |
2858 | return gimple_builtin_call_types_compatible_p (stmt, fndecl); | |
2859 | return false; | |
2860 | } | |
2861 | ||
3626621a RB |
2862 | /* Return true when STMT is builtins call to CLASS. */ |
2863 | ||
2864 | bool | |
355fe088 | 2865 | gimple_call_builtin_p (const gimple *stmt, enum built_in_class klass) |
3626621a RB |
2866 | { |
2867 | tree fndecl; | |
2868 | if (is_gimple_call (stmt) | |
2869 | && (fndecl = gimple_call_fndecl (stmt)) != NULL_TREE | |
2870 | && DECL_BUILT_IN_CLASS (fndecl) == klass) | |
5c944c6c | 2871 | return gimple_builtin_call_types_compatible_p (stmt, fndecl); |
3626621a RB |
2872 | return false; |
2873 | } | |
2874 | ||
2875 | /* Return true when STMT is builtins call to CODE of CLASS. */ | |
c54c785d JH |
2876 | |
2877 | bool | |
355fe088 | 2878 | gimple_call_builtin_p (const gimple *stmt, enum built_in_function code) |
c54c785d JH |
2879 | { |
2880 | tree fndecl; | |
3626621a RB |
2881 | if (is_gimple_call (stmt) |
2882 | && (fndecl = gimple_call_fndecl (stmt)) != NULL_TREE | |
3d78e008 | 2883 | && fndecl_built_in_p (fndecl, code)) |
5c944c6c | 2884 | return gimple_builtin_call_types_compatible_p (stmt, fndecl); |
3626621a | 2885 | return false; |
c54c785d JH |
2886 | } |
2887 | ||
00175cb2 RS |
2888 | /* If CALL is a call to a combined_fn (i.e. an internal function or |
2889 | a normal built-in function), return its code, otherwise return | |
2890 | CFN_LAST. */ | |
2891 | ||
2892 | combined_fn | |
2893 | gimple_call_combined_fn (const gimple *stmt) | |
2894 | { | |
2895 | if (const gcall *call = dyn_cast <const gcall *> (stmt)) | |
2896 | { | |
2897 | if (gimple_call_internal_p (call)) | |
2898 | return as_combined_fn (gimple_call_internal_fn (call)); | |
2899 | ||
2900 | tree fndecl = gimple_call_fndecl (stmt); | |
2901 | if (fndecl | |
3d78e008 | 2902 | && fndecl_built_in_p (fndecl, BUILT_IN_NORMAL) |
00175cb2 RS |
2903 | && gimple_builtin_call_types_compatible_p (stmt, fndecl)) |
2904 | return as_combined_fn (DECL_FUNCTION_CODE (fndecl)); | |
2905 | } | |
2906 | return CFN_LAST; | |
2907 | } | |
2908 | ||
edcdea5b NF |
2909 | /* Return true if STMT clobbers memory. STMT is required to be a |
2910 | GIMPLE_ASM. */ | |
2911 | ||
2912 | bool | |
538dd0b7 | 2913 | gimple_asm_clobbers_memory_p (const gasm *stmt) |
edcdea5b NF |
2914 | { |
2915 | unsigned i; | |
2916 | ||
2917 | for (i = 0; i < gimple_asm_nclobbers (stmt); i++) | |
2918 | { | |
2919 | tree op = gimple_asm_clobber_op (stmt, i); | |
2920 | if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op)), "memory") == 0) | |
2921 | return true; | |
2922 | } | |
2923 | ||
93671519 BE |
2924 | /* Non-empty basic ASM implicitly clobbers memory. */ |
2925 | if (gimple_asm_input_p (stmt) && strlen (gimple_asm_string (stmt)) != 0) | |
2926 | return true; | |
2927 | ||
edcdea5b NF |
2928 | return false; |
2929 | } | |
475b8f37 | 2930 | |
80560f95 AM |
2931 | /* Dump bitmap SET (assumed to contain VAR_DECLs) to FILE. */ |
2932 | ||
2933 | void | |
2934 | dump_decl_set (FILE *file, bitmap set) | |
2935 | { | |
2936 | if (set) | |
2937 | { | |
2938 | bitmap_iterator bi; | |
2939 | unsigned i; | |
2940 | ||
2941 | fprintf (file, "{ "); | |
2942 | ||
2943 | EXECUTE_IF_SET_IN_BITMAP (set, 0, i, bi) | |
2944 | { | |
2945 | fprintf (file, "D.%u", i); | |
2946 | fprintf (file, " "); | |
2947 | } | |
2948 | ||
2949 | fprintf (file, "}"); | |
2950 | } | |
2951 | else | |
2952 | fprintf (file, "NIL"); | |
2953 | } | |
7a300452 | 2954 | |
3d9c733e AM |
2955 | /* Return true when CALL is a call stmt that definitely doesn't |
2956 | free any memory or makes it unavailable otherwise. */ | |
2957 | bool | |
355fe088 | 2958 | nonfreeing_call_p (gimple *call) |
3d9c733e AM |
2959 | { |
2960 | if (gimple_call_builtin_p (call, BUILT_IN_NORMAL) | |
2961 | && gimple_call_flags (call) & ECF_LEAF) | |
2962 | switch (DECL_FUNCTION_CODE (gimple_call_fndecl (call))) | |
2963 | { | |
2964 | /* Just in case these become ECF_LEAF in the future. */ | |
2965 | case BUILT_IN_FREE: | |
2966 | case BUILT_IN_TM_FREE: | |
2967 | case BUILT_IN_REALLOC: | |
2968 | case BUILT_IN_STACK_RESTORE: | |
2969 | return false; | |
2970 | default: | |
2971 | return true; | |
2972 | } | |
8413ca87 JJ |
2973 | else if (gimple_call_internal_p (call)) |
2974 | switch (gimple_call_internal_fn (call)) | |
2975 | { | |
2976 | case IFN_ABNORMAL_DISPATCHER: | |
2977 | return true; | |
6dc4a604 | 2978 | case IFN_ASAN_MARK: |
56b7aede | 2979 | return tree_to_uhwi (gimple_call_arg (call, 0)) == ASAN_MARK_UNPOISON; |
8413ca87 JJ |
2980 | default: |
2981 | if (gimple_call_flags (call) & ECF_LEAF) | |
2982 | return true; | |
2983 | return false; | |
2984 | } | |
3d9c733e | 2985 | |
8413ca87 JJ |
2986 | tree fndecl = gimple_call_fndecl (call); |
2987 | if (!fndecl) | |
2988 | return false; | |
2989 | struct cgraph_node *n = cgraph_node::get (fndecl); | |
2990 | if (!n) | |
2991 | return false; | |
2992 | enum availability availability; | |
2993 | n = n->function_symbol (&availability); | |
2994 | if (!n || availability <= AVAIL_INTERPOSABLE) | |
2995 | return false; | |
2996 | return n->nonfreeing_fn; | |
3d9c733e | 2997 | } |
8fdc414d | 2998 | |
c000cd7c BS |
2999 | /* Return true when CALL is a call stmt that definitely need not |
3000 | be considered to be a memory barrier. */ | |
3001 | bool | |
3002 | nonbarrier_call_p (gimple *call) | |
3003 | { | |
3004 | if (gimple_call_flags (call) & (ECF_PURE | ECF_CONST)) | |
3005 | return true; | |
3006 | /* Should extend this to have a nonbarrier_fn flag, just as above in | |
3007 | the nonfreeing case. */ | |
3008 | return false; | |
3009 | } | |
3010 | ||
8fdc414d JL |
3011 | /* Callback for walk_stmt_load_store_ops. |
3012 | ||
3013 | Return TRUE if OP will dereference the tree stored in DATA, FALSE | |
3014 | otherwise. | |
3015 | ||
3016 | This routine only makes a superficial check for a dereference. Thus | |
3017 | it must only be used if it is safe to return a false negative. */ | |
3018 | static bool | |
355fe088 | 3019 | check_loadstore (gimple *, tree op, tree, void *data) |
8fdc414d | 3020 | { |
6626f970 RH |
3021 | if (TREE_CODE (op) == MEM_REF || TREE_CODE (op) == TARGET_MEM_REF) |
3022 | { | |
3023 | /* Some address spaces may legitimately dereference zero. */ | |
3024 | addr_space_t as = TYPE_ADDR_SPACE (TREE_TYPE (op)); | |
3025 | if (targetm.addr_space.zero_address_valid (as)) | |
3026 | return false; | |
3027 | ||
3028 | return operand_equal_p (TREE_OPERAND (op, 0), (tree)data, 0); | |
3029 | } | |
8fdc414d JL |
3030 | return false; |
3031 | } | |
3032 | ||
ae93744d | 3033 | |
76787f70 MLI |
3034 | /* Return true if OP can be inferred to be non-NULL after STMT executes, |
3035 | either by using a pointer dereference or attributes. */ | |
3036 | bool | |
355fe088 | 3037 | infer_nonnull_range (gimple *stmt, tree op) |
76787f70 | 3038 | { |
a5b15fcb JJ |
3039 | return (infer_nonnull_range_by_dereference (stmt, op) |
3040 | || infer_nonnull_range_by_attribute (stmt, op)); | |
76787f70 | 3041 | } |
8fdc414d | 3042 | |
76787f70 MLI |
3043 | /* Return true if OP can be inferred to be non-NULL after STMT |
3044 | executes by using a pointer dereference. */ | |
8fdc414d | 3045 | bool |
355fe088 | 3046 | infer_nonnull_range_by_dereference (gimple *stmt, tree op) |
8fdc414d JL |
3047 | { |
3048 | /* We can only assume that a pointer dereference will yield | |
3049 | non-NULL if -fdelete-null-pointer-checks is enabled. */ | |
3050 | if (!flag_delete_null_pointer_checks | |
3051 | || !POINTER_TYPE_P (TREE_TYPE (op)) | |
a5b15fcb JJ |
3052 | || gimple_code (stmt) == GIMPLE_ASM |
3053 | || gimple_clobber_p (stmt)) | |
8fdc414d JL |
3054 | return false; |
3055 | ||
76787f70 MLI |
3056 | if (walk_stmt_load_store_ops (stmt, (void *)op, |
3057 | check_loadstore, check_loadstore)) | |
8fdc414d JL |
3058 | return true; |
3059 | ||
76787f70 MLI |
3060 | return false; |
3061 | } | |
3062 | ||
3063 | /* Return true if OP can be inferred to be a non-NULL after STMT | |
3064 | executes by using attributes. */ | |
3065 | bool | |
355fe088 | 3066 | infer_nonnull_range_by_attribute (gimple *stmt, tree op) |
76787f70 MLI |
3067 | { |
3068 | /* We can only assume that a pointer dereference will yield | |
3069 | non-NULL if -fdelete-null-pointer-checks is enabled. */ | |
3070 | if (!flag_delete_null_pointer_checks | |
3071 | || !POINTER_TYPE_P (TREE_TYPE (op)) | |
3072 | || gimple_code (stmt) == GIMPLE_ASM) | |
3073 | return false; | |
3074 | ||
3075 | if (is_gimple_call (stmt) && !gimple_call_internal_p (stmt)) | |
8fdc414d JL |
3076 | { |
3077 | tree fntype = gimple_call_fntype (stmt); | |
3078 | tree attrs = TYPE_ATTRIBUTES (fntype); | |
3079 | for (; attrs; attrs = TREE_CHAIN (attrs)) | |
3080 | { | |
3081 | attrs = lookup_attribute ("nonnull", attrs); | |
3082 | ||
3083 | /* If "nonnull" wasn't specified, we know nothing about | |
3084 | the argument. */ | |
3085 | if (attrs == NULL_TREE) | |
3086 | return false; | |
3087 | ||
3088 | /* If "nonnull" applies to all the arguments, then ARG | |
3089 | is non-null if it's in the argument list. */ | |
3090 | if (TREE_VALUE (attrs) == NULL_TREE) | |
3091 | { | |
3092 | for (unsigned int i = 0; i < gimple_call_num_args (stmt); i++) | |
3093 | { | |
36f291f7 PP |
3094 | if (POINTER_TYPE_P (TREE_TYPE (gimple_call_arg (stmt, i))) |
3095 | && operand_equal_p (op, gimple_call_arg (stmt, i), 0)) | |
8fdc414d JL |
3096 | return true; |
3097 | } | |
3098 | return false; | |
3099 | } | |
3100 | ||
3101 | /* Now see if op appears in the nonnull list. */ | |
3102 | for (tree t = TREE_VALUE (attrs); t; t = TREE_CHAIN (t)) | |
3103 | { | |
e37dcf45 MP |
3104 | unsigned int idx = TREE_INT_CST_LOW (TREE_VALUE (t)) - 1; |
3105 | if (idx < gimple_call_num_args (stmt)) | |
3106 | { | |
3107 | tree arg = gimple_call_arg (stmt, idx); | |
3108 | if (operand_equal_p (op, arg, 0)) | |
3109 | return true; | |
3110 | } | |
8fdc414d JL |
3111 | } |
3112 | } | |
3113 | } | |
3114 | ||
3115 | /* If this function is marked as returning non-null, then we can | |
3116 | infer OP is non-null if it is used in the return statement. */ | |
76787f70 MLI |
3117 | if (greturn *return_stmt = dyn_cast <greturn *> (stmt)) |
3118 | if (gimple_return_retval (return_stmt) | |
3119 | && operand_equal_p (gimple_return_retval (return_stmt), op, 0) | |
3120 | && lookup_attribute ("returns_nonnull", | |
3121 | TYPE_ATTRIBUTES (TREE_TYPE (current_function_decl)))) | |
3122 | return true; | |
8fdc414d JL |
3123 | |
3124 | return false; | |
3125 | } | |
45b0be94 AM |
3126 | |
3127 | /* Compare two case labels. Because the front end should already have | |
3128 | made sure that case ranges do not overlap, it is enough to only compare | |
3129 | the CASE_LOW values of each case label. */ | |
3130 | ||
3131 | static int | |
3132 | compare_case_labels (const void *p1, const void *p2) | |
3133 | { | |
3134 | const_tree const case1 = *(const_tree const*)p1; | |
3135 | const_tree const case2 = *(const_tree const*)p2; | |
3136 | ||
3137 | /* The 'default' case label always goes first. */ | |
3138 | if (!CASE_LOW (case1)) | |
3139 | return -1; | |
3140 | else if (!CASE_LOW (case2)) | |
3141 | return 1; | |
3142 | else | |
3143 | return tree_int_cst_compare (CASE_LOW (case1), CASE_LOW (case2)); | |
3144 | } | |
3145 | ||
3146 | /* Sort the case labels in LABEL_VEC in place in ascending order. */ | |
3147 | ||
3148 | void | |
00dcc88a | 3149 | sort_case_labels (vec<tree> &label_vec) |
45b0be94 AM |
3150 | { |
3151 | label_vec.qsort (compare_case_labels); | |
3152 | } | |
3153 | \f | |
3154 | /* Prepare a vector of case labels to be used in a GIMPLE_SWITCH statement. | |
3155 | ||
3156 | LABELS is a vector that contains all case labels to look at. | |
3157 | ||
3158 | INDEX_TYPE is the type of the switch index expression. Case labels | |
3159 | in LABELS are discarded if their values are not in the value range | |
3160 | covered by INDEX_TYPE. The remaining case label values are folded | |
3161 | to INDEX_TYPE. | |
3162 | ||
3163 | If a default case exists in LABELS, it is removed from LABELS and | |
3164 | returned in DEFAULT_CASEP. If no default case exists, but the | |
3165 | case labels already cover the whole range of INDEX_TYPE, a default | |
3166 | case is returned pointing to one of the existing case labels. | |
3167 | Otherwise DEFAULT_CASEP is set to NULL_TREE. | |
3168 | ||
3169 | DEFAULT_CASEP may be NULL, in which case the above comment doesn't | |
3170 | apply and no action is taken regardless of whether a default case is | |
3171 | found or not. */ | |
3172 | ||
3173 | void | |
00dcc88a | 3174 | preprocess_case_label_vec_for_gimple (vec<tree> &labels, |
45b0be94 AM |
3175 | tree index_type, |
3176 | tree *default_casep) | |
3177 | { | |
3178 | tree min_value, max_value; | |
3179 | tree default_case = NULL_TREE; | |
3180 | size_t i, len; | |
3181 | ||
3182 | i = 0; | |
3183 | min_value = TYPE_MIN_VALUE (index_type); | |
3184 | max_value = TYPE_MAX_VALUE (index_type); | |
3185 | while (i < labels.length ()) | |
3186 | { | |
3187 | tree elt = labels[i]; | |
3188 | tree low = CASE_LOW (elt); | |
3189 | tree high = CASE_HIGH (elt); | |
3190 | bool remove_element = FALSE; | |
3191 | ||
3192 | if (low) | |
3193 | { | |
3194 | gcc_checking_assert (TREE_CODE (low) == INTEGER_CST); | |
3195 | gcc_checking_assert (!high || TREE_CODE (high) == INTEGER_CST); | |
3196 | ||
3197 | /* This is a non-default case label, i.e. it has a value. | |
3198 | ||
3199 | See if the case label is reachable within the range of | |
3200 | the index type. Remove out-of-range case values. Turn | |
3201 | case ranges into a canonical form (high > low strictly) | |
3202 | and convert the case label values to the index type. | |
3203 | ||
3204 | NB: The type of gimple_switch_index() may be the promoted | |
3205 | type, but the case labels retain the original type. */ | |
3206 | ||
3207 | if (high) | |
3208 | { | |
3209 | /* This is a case range. Discard empty ranges. | |
3210 | If the bounds or the range are equal, turn this | |
3211 | into a simple (one-value) case. */ | |
3212 | int cmp = tree_int_cst_compare (high, low); | |
3213 | if (cmp < 0) | |
3214 | remove_element = TRUE; | |
3215 | else if (cmp == 0) | |
3216 | high = NULL_TREE; | |
3217 | } | |
3218 | ||
3219 | if (! high) | |
3220 | { | |
3221 | /* If the simple case value is unreachable, ignore it. */ | |
3222 | if ((TREE_CODE (min_value) == INTEGER_CST | |
3223 | && tree_int_cst_compare (low, min_value) < 0) | |
3224 | || (TREE_CODE (max_value) == INTEGER_CST | |
3225 | && tree_int_cst_compare (low, max_value) > 0)) | |
3226 | remove_element = TRUE; | |
3227 | else | |
3228 | low = fold_convert (index_type, low); | |
3229 | } | |
3230 | else | |
3231 | { | |
3232 | /* If the entire case range is unreachable, ignore it. */ | |
3233 | if ((TREE_CODE (min_value) == INTEGER_CST | |
3234 | && tree_int_cst_compare (high, min_value) < 0) | |
3235 | || (TREE_CODE (max_value) == INTEGER_CST | |
3236 | && tree_int_cst_compare (low, max_value) > 0)) | |
3237 | remove_element = TRUE; | |
3238 | else | |
3239 | { | |
3240 | /* If the lower bound is less than the index type's | |
3241 | minimum value, truncate the range bounds. */ | |
3242 | if (TREE_CODE (min_value) == INTEGER_CST | |
3243 | && tree_int_cst_compare (low, min_value) < 0) | |
3244 | low = min_value; | |
3245 | low = fold_convert (index_type, low); | |
3246 | ||
3247 | /* If the upper bound is greater than the index type's | |
3248 | maximum value, truncate the range bounds. */ | |
3249 | if (TREE_CODE (max_value) == INTEGER_CST | |
3250 | && tree_int_cst_compare (high, max_value) > 0) | |
3251 | high = max_value; | |
3252 | high = fold_convert (index_type, high); | |
3253 | ||
3254 | /* We may have folded a case range to a one-value case. */ | |
3255 | if (tree_int_cst_equal (low, high)) | |
3256 | high = NULL_TREE; | |
3257 | } | |
3258 | } | |
3259 | ||
3260 | CASE_LOW (elt) = low; | |
3261 | CASE_HIGH (elt) = high; | |
3262 | } | |
3263 | else | |
3264 | { | |
3265 | gcc_assert (!default_case); | |
3266 | default_case = elt; | |
3267 | /* The default case must be passed separately to the | |
3268 | gimple_build_switch routine. But if DEFAULT_CASEP | |
3269 | is NULL, we do not remove the default case (it would | |
3270 | be completely lost). */ | |
3271 | if (default_casep) | |
3272 | remove_element = TRUE; | |
3273 | } | |
3274 | ||
3275 | if (remove_element) | |
3276 | labels.ordered_remove (i); | |
3277 | else | |
3278 | i++; | |
3279 | } | |
3280 | len = i; | |
3281 | ||
3282 | if (!labels.is_empty ()) | |
3283 | sort_case_labels (labels); | |
3284 | ||
3285 | if (default_casep && !default_case) | |
3286 | { | |
3287 | /* If the switch has no default label, add one, so that we jump | |
3288 | around the switch body. If the labels already cover the whole | |
3289 | range of the switch index_type, add the default label pointing | |
3290 | to one of the existing labels. */ | |
3291 | if (len | |
3292 | && TYPE_MIN_VALUE (index_type) | |
3293 | && TYPE_MAX_VALUE (index_type) | |
3294 | && tree_int_cst_equal (CASE_LOW (labels[0]), | |
3295 | TYPE_MIN_VALUE (index_type))) | |
3296 | { | |
3297 | tree low, high = CASE_HIGH (labels[len - 1]); | |
3298 | if (!high) | |
3299 | high = CASE_LOW (labels[len - 1]); | |
3300 | if (tree_int_cst_equal (high, TYPE_MAX_VALUE (index_type))) | |
3301 | { | |
938da3a5 | 3302 | tree widest_label = labels[0]; |
45b0be94 AM |
3303 | for (i = 1; i < len; i++) |
3304 | { | |
3305 | high = CASE_LOW (labels[i]); | |
3306 | low = CASE_HIGH (labels[i - 1]); | |
3307 | if (!low) | |
3308 | low = CASE_LOW (labels[i - 1]); | |
938da3a5 PP |
3309 | |
3310 | if (CASE_HIGH (labels[i]) != NULL_TREE | |
3311 | && (CASE_HIGH (widest_label) == NULL_TREE | |
8e6cdc90 RS |
3312 | || (wi::gtu_p |
3313 | (wi::to_wide (CASE_HIGH (labels[i])) | |
3314 | - wi::to_wide (CASE_LOW (labels[i])), | |
3315 | wi::to_wide (CASE_HIGH (widest_label)) | |
3316 | - wi::to_wide (CASE_LOW (widest_label)))))) | |
938da3a5 PP |
3317 | widest_label = labels[i]; |
3318 | ||
8e6cdc90 | 3319 | if (wi::to_wide (low) + 1 != wi::to_wide (high)) |
45b0be94 AM |
3320 | break; |
3321 | } | |
3322 | if (i == len) | |
3323 | { | |
938da3a5 PP |
3324 | /* Designate the label with the widest range to be the |
3325 | default label. */ | |
3326 | tree label = CASE_LABEL (widest_label); | |
45b0be94 AM |
3327 | default_case = build_case_label (NULL_TREE, NULL_TREE, |
3328 | label); | |
3329 | } | |
3330 | } | |
3331 | } | |
3332 | } | |
3333 | ||
3334 | if (default_casep) | |
3335 | *default_casep = default_case; | |
3336 | } | |
5be5c238 AM |
3337 | |
3338 | /* Set the location of all statements in SEQ to LOC. */ | |
3339 | ||
3340 | void | |
3341 | gimple_seq_set_location (gimple_seq seq, location_t loc) | |
3342 | { | |
3343 | for (gimple_stmt_iterator i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i)) | |
3344 | gimple_set_location (gsi_stmt (i), loc); | |
3345 | } | |
73049af5 JJ |
3346 | |
3347 | /* Release SSA_NAMEs in SEQ as well as the GIMPLE statements. */ | |
3348 | ||
3349 | void | |
3350 | gimple_seq_discard (gimple_seq seq) | |
3351 | { | |
3352 | gimple_stmt_iterator gsi; | |
3353 | ||
3354 | for (gsi = gsi_start (seq); !gsi_end_p (gsi); ) | |
3355 | { | |
355fe088 | 3356 | gimple *stmt = gsi_stmt (gsi); |
73049af5 JJ |
3357 | gsi_remove (&gsi, true); |
3358 | release_defs (stmt); | |
3359 | ggc_free (stmt); | |
3360 | } | |
3361 | } | |
0b986c6a JH |
3362 | |
3363 | /* See if STMT now calls function that takes no parameters and if so, drop | |
3364 | call arguments. This is used when devirtualization machinery redirects | |
538374e1 | 3365 | to __builtin_unreachable or __cxa_pure_virtual. */ |
0b986c6a JH |
3366 | |
3367 | void | |
355fe088 | 3368 | maybe_remove_unused_call_args (struct function *fn, gimple *stmt) |
0b986c6a JH |
3369 | { |
3370 | tree decl = gimple_call_fndecl (stmt); | |
3371 | if (TYPE_ARG_TYPES (TREE_TYPE (decl)) | |
3372 | && TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl))) == void_type_node | |
3373 | && gimple_call_num_args (stmt)) | |
3374 | { | |
3375 | gimple_set_num_ops (stmt, 3); | |
3376 | update_stmt_fn (fn, stmt); | |
3377 | } | |
3378 | } | |
d9b950dd | 3379 | |
ce120587 JH |
3380 | /* Return false if STMT will likely expand to real function call. */ |
3381 | ||
3382 | bool | |
3383 | gimple_inexpensive_call_p (gcall *stmt) | |
3384 | { | |
3385 | if (gimple_call_internal_p (stmt)) | |
3386 | return true; | |
3387 | tree decl = gimple_call_fndecl (stmt); | |
3388 | if (decl && is_inexpensive_builtin (decl)) | |
3389 | return true; | |
3390 | return false; | |
3391 | } | |
3392 | ||
55ace4d1 JL |
3393 | /* Return a non-artificial location for STMT. If STMT does not have |
3394 | location information, get the location from EXPR. */ | |
3395 | ||
3396 | location_t | |
8c044c65 | 3397 | gimple_or_expr_nonartificial_location (gimple *stmt, tree expr) |
55ace4d1 JL |
3398 | { |
3399 | location_t loc = gimple_nonartificial_location (stmt); | |
3400 | if (loc == UNKNOWN_LOCATION && EXPR_HAS_LOCATION (expr)) | |
3401 | loc = tree_nonartificial_location (expr); | |
3402 | return expansion_point_location_if_in_system_header (loc); | |
3403 | } | |
3404 | ||
3405 | ||
d9b950dd DM |
3406 | #if CHECKING_P |
3407 | ||
3408 | namespace selftest { | |
3409 | ||
3410 | /* Selftests for core gimple structures. */ | |
3411 | ||
3412 | /* Verify that STMT is pretty-printed as EXPECTED. | |
3413 | Helper function for selftests. */ | |
3414 | ||
3415 | static void | |
3416 | verify_gimple_pp (const char *expected, gimple *stmt) | |
3417 | { | |
3418 | pretty_printer pp; | |
4af78ef8 | 3419 | pp_gimple_stmt_1 (&pp, stmt, 0 /* spc */, TDF_NONE /* flags */); |
d9b950dd DM |
3420 | ASSERT_STREQ (expected, pp_formatted_text (&pp)); |
3421 | } | |
3422 | ||
3423 | /* Build a GIMPLE_ASSIGN equivalent to | |
3424 | tmp = 5; | |
3425 | and verify various properties of it. */ | |
3426 | ||
3427 | static void | |
3428 | test_assign_single () | |
3429 | { | |
3430 | tree type = integer_type_node; | |
3431 | tree lhs = build_decl (UNKNOWN_LOCATION, VAR_DECL, | |
3432 | get_identifier ("tmp"), | |
3433 | type); | |
3434 | tree rhs = build_int_cst (type, 5); | |
3435 | gassign *stmt = gimple_build_assign (lhs, rhs); | |
3436 | verify_gimple_pp ("tmp = 5;", stmt); | |
3437 | ||
3438 | ASSERT_TRUE (is_gimple_assign (stmt)); | |
3439 | ASSERT_EQ (lhs, gimple_assign_lhs (stmt)); | |
3440 | ASSERT_EQ (lhs, gimple_get_lhs (stmt)); | |
3441 | ASSERT_EQ (rhs, gimple_assign_rhs1 (stmt)); | |
3442 | ASSERT_EQ (NULL, gimple_assign_rhs2 (stmt)); | |
3443 | ASSERT_EQ (NULL, gimple_assign_rhs3 (stmt)); | |
3444 | ASSERT_TRUE (gimple_assign_single_p (stmt)); | |
3445 | ASSERT_EQ (INTEGER_CST, gimple_assign_rhs_code (stmt)); | |
3446 | } | |
3447 | ||
3448 | /* Build a GIMPLE_ASSIGN equivalent to | |
3449 | tmp = a * b; | |
3450 | and verify various properties of it. */ | |
3451 | ||
3452 | static void | |
3453 | test_assign_binop () | |
3454 | { | |
3455 | tree type = integer_type_node; | |
3456 | tree lhs = build_decl (UNKNOWN_LOCATION, VAR_DECL, | |
3457 | get_identifier ("tmp"), | |
3458 | type); | |
3459 | tree a = build_decl (UNKNOWN_LOCATION, VAR_DECL, | |
3460 | get_identifier ("a"), | |
3461 | type); | |
3462 | tree b = build_decl (UNKNOWN_LOCATION, VAR_DECL, | |
3463 | get_identifier ("b"), | |
3464 | type); | |
3465 | gassign *stmt = gimple_build_assign (lhs, MULT_EXPR, a, b); | |
3466 | verify_gimple_pp ("tmp = a * b;", stmt); | |
3467 | ||
3468 | ASSERT_TRUE (is_gimple_assign (stmt)); | |
3469 | ASSERT_EQ (lhs, gimple_assign_lhs (stmt)); | |
3470 | ASSERT_EQ (lhs, gimple_get_lhs (stmt)); | |
3471 | ASSERT_EQ (a, gimple_assign_rhs1 (stmt)); | |
3472 | ASSERT_EQ (b, gimple_assign_rhs2 (stmt)); | |
3473 | ASSERT_EQ (NULL, gimple_assign_rhs3 (stmt)); | |
3474 | ASSERT_FALSE (gimple_assign_single_p (stmt)); | |
3475 | ASSERT_EQ (MULT_EXPR, gimple_assign_rhs_code (stmt)); | |
3476 | } | |
3477 | ||
3478 | /* Build a GIMPLE_NOP and verify various properties of it. */ | |
3479 | ||
3480 | static void | |
3481 | test_nop_stmt () | |
3482 | { | |
3483 | gimple *stmt = gimple_build_nop (); | |
3484 | verify_gimple_pp ("GIMPLE_NOP", stmt); | |
3485 | ASSERT_EQ (GIMPLE_NOP, gimple_code (stmt)); | |
3486 | ASSERT_EQ (NULL, gimple_get_lhs (stmt)); | |
3487 | ASSERT_FALSE (gimple_assign_single_p (stmt)); | |
3488 | } | |
3489 | ||
3490 | /* Build a GIMPLE_RETURN equivalent to | |
3491 | return 7; | |
3492 | and verify various properties of it. */ | |
3493 | ||
3494 | static void | |
3495 | test_return_stmt () | |
3496 | { | |
3497 | tree type = integer_type_node; | |
3498 | tree val = build_int_cst (type, 7); | |
3499 | greturn *stmt = gimple_build_return (val); | |
3500 | verify_gimple_pp ("return 7;", stmt); | |
3501 | ||
3502 | ASSERT_EQ (GIMPLE_RETURN, gimple_code (stmt)); | |
3503 | ASSERT_EQ (NULL, gimple_get_lhs (stmt)); | |
3504 | ASSERT_EQ (val, gimple_return_retval (stmt)); | |
3505 | ASSERT_FALSE (gimple_assign_single_p (stmt)); | |
3506 | } | |
3507 | ||
3508 | /* Build a GIMPLE_RETURN equivalent to | |
3509 | return; | |
3510 | and verify various properties of it. */ | |
3511 | ||
3512 | static void | |
3513 | test_return_without_value () | |
3514 | { | |
3515 | greturn *stmt = gimple_build_return (NULL); | |
3516 | verify_gimple_pp ("return;", stmt); | |
3517 | ||
3518 | ASSERT_EQ (GIMPLE_RETURN, gimple_code (stmt)); | |
3519 | ASSERT_EQ (NULL, gimple_get_lhs (stmt)); | |
3520 | ASSERT_EQ (NULL, gimple_return_retval (stmt)); | |
3521 | ASSERT_FALSE (gimple_assign_single_p (stmt)); | |
3522 | } | |
3523 | ||
3524 | /* Run all of the selftests within this file. */ | |
3525 | ||
3526 | void | |
3527 | gimple_c_tests () | |
3528 | { | |
3529 | test_assign_single (); | |
3530 | test_assign_binop (); | |
3531 | test_nop_stmt (); | |
3532 | test_return_stmt (); | |
3533 | test_return_without_value (); | |
3534 | } | |
3535 | ||
3536 | } // namespace selftest | |
3537 | ||
3538 | ||
3539 | #endif /* CHECKING_P */ |