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