1 /* Gimple IR support functions.
3 Copyright (C) 2007-2014 Free Software Foundation, Inc.
4 Contributed by Aldy Hernandez <aldyh@redhat.com>
6 This file is part of GCC.
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
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
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/>. */
24 #include "coretypes.h"
30 #include "stor-layout.h"
31 #include "hard-reg-set.h"
39 #include "dominance.h"
41 #include "basic-block.h"
42 #include "tree-ssa-alias.h"
43 #include "internal-fn.h"
45 #include "gimple-expr.h"
48 #include "gimple-iterator.h"
49 #include "gimple-walk.h"
52 #include "diagnostic.h"
53 #include "value-prof.h"
57 #include "langhooks.h"
59 #include "stringpool.h"
60 #include "tree-ssanames.h"
63 /* All the tuples have their operand vector (if present) at the very bottom
64 of the structure. Therefore, the offset required to find the
65 operands vector the size of the structure minus the size of the 1
66 element tree array at the end (see gimple_ops). */
67 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \
68 (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0),
69 EXPORTED_CONST
size_t gimple_ops_offset_
[] = {
70 #include "gsstruct.def"
74 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof (struct STRUCT),
75 static const size_t gsstruct_code_size
[] = {
76 #include "gsstruct.def"
80 #define DEFGSCODE(SYM, NAME, GSSCODE) NAME,
81 const char *const gimple_code_name
[] = {
86 #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE,
87 EXPORTED_CONST
enum gimple_statement_structure_enum gss_for_code_
[] = {
94 int gimple_alloc_counts
[(int) gimple_alloc_kind_all
];
95 int gimple_alloc_sizes
[(int) gimple_alloc_kind_all
];
97 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
98 static const char * const gimple_alloc_kind_names
[] = {
105 /* Gimple tuple constructors.
106 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
107 be passed a NULL to start with an empty sequence. */
109 /* Set the code for statement G to CODE. */
112 gimple_set_code (gimple g
, enum gimple_code code
)
117 /* Return the number of bytes needed to hold a GIMPLE statement with
121 gimple_size (enum gimple_code code
)
123 return gsstruct_code_size
[gss_for_code (code
)];
126 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
130 gimple_alloc_stat (enum gimple_code code
, unsigned num_ops MEM_STAT_DECL
)
135 size
= gimple_size (code
);
137 size
+= sizeof (tree
) * (num_ops
- 1);
139 if (GATHER_STATISTICS
)
141 enum gimple_alloc_kind kind
= gimple_alloc_kind (code
);
142 gimple_alloc_counts
[(int) kind
]++;
143 gimple_alloc_sizes
[(int) kind
] += size
;
146 stmt
= ggc_alloc_cleared_gimple_statement_stat (size PASS_MEM_STAT
);
147 gimple_set_code (stmt
, code
);
148 gimple_set_num_ops (stmt
, num_ops
);
150 /* Do not call gimple_set_modified here as it has other side
151 effects and this tuple is still not completely built. */
153 gimple_init_singleton (stmt
);
158 /* Set SUBCODE to be the code of the expression computed by statement G. */
161 gimple_set_subcode (gimple g
, unsigned subcode
)
163 /* We only have 16 bits for the RHS code. Assert that we are not
165 gcc_assert (subcode
< (1 << 16));
166 g
->subcode
= subcode
;
171 /* Build a tuple with operands. CODE is the statement to build (which
172 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the subcode
173 for the new tuple. NUM_OPS is the number of operands to allocate. */
175 #define gimple_build_with_ops(c, s, n) \
176 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
179 gimple_build_with_ops_stat (enum gimple_code code
, unsigned subcode
,
180 unsigned num_ops MEM_STAT_DECL
)
182 gimple s
= gimple_alloc_stat (code
, num_ops PASS_MEM_STAT
);
183 gimple_set_subcode (s
, subcode
);
189 /* Build a GIMPLE_RETURN statement returning RETVAL. */
192 gimple_build_return (tree retval
)
194 gimple s
= gimple_build_with_ops (GIMPLE_RETURN
, ERROR_MARK
, 1);
196 gimple_return_set_retval (s
, retval
);
200 /* Reset alias information on call S. */
203 gimple_call_reset_alias_info (gimple s
)
205 if (gimple_call_flags (s
) & ECF_CONST
)
206 memset (gimple_call_use_set (s
), 0, sizeof (struct pt_solution
));
208 pt_solution_reset (gimple_call_use_set (s
));
209 if (gimple_call_flags (s
) & (ECF_CONST
|ECF_PURE
|ECF_NOVOPS
))
210 memset (gimple_call_clobber_set (s
), 0, sizeof (struct pt_solution
));
212 pt_solution_reset (gimple_call_clobber_set (s
));
215 /* Helper for gimple_build_call, gimple_build_call_valist,
216 gimple_build_call_vec and gimple_build_call_from_tree. Build the basic
217 components of a GIMPLE_CALL statement to function FN with NARGS
221 gimple_build_call_1 (tree fn
, unsigned nargs
)
223 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
224 if (TREE_CODE (fn
) == FUNCTION_DECL
)
225 fn
= build_fold_addr_expr (fn
);
226 gimple_set_op (s
, 1, fn
);
227 gimple_call_set_fntype (s
, TREE_TYPE (TREE_TYPE (fn
)));
228 gimple_call_reset_alias_info (s
);
233 /* Build a GIMPLE_CALL statement to function FN with the arguments
234 specified in vector ARGS. */
237 gimple_build_call_vec (tree fn
, vec
<tree
> args
)
240 unsigned nargs
= args
.length ();
241 gimple call
= gimple_build_call_1 (fn
, nargs
);
243 for (i
= 0; i
< nargs
; i
++)
244 gimple_call_set_arg (call
, i
, args
[i
]);
250 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
251 arguments. The ... are the arguments. */
254 gimple_build_call (tree fn
, unsigned nargs
, ...)
260 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
262 call
= gimple_build_call_1 (fn
, nargs
);
264 va_start (ap
, nargs
);
265 for (i
= 0; i
< nargs
; i
++)
266 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
273 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
274 arguments. AP contains the arguments. */
277 gimple_build_call_valist (tree fn
, unsigned nargs
, va_list ap
)
282 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
284 call
= gimple_build_call_1 (fn
, nargs
);
286 for (i
= 0; i
< nargs
; i
++)
287 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
293 /* Helper for gimple_build_call_internal and gimple_build_call_internal_vec.
294 Build the basic components of a GIMPLE_CALL statement to internal
295 function FN with NARGS arguments. */
298 gimple_build_call_internal_1 (enum internal_fn fn
, unsigned nargs
)
300 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
301 s
->subcode
|= GF_CALL_INTERNAL
;
302 gimple_call_set_internal_fn (s
, fn
);
303 gimple_call_reset_alias_info (s
);
308 /* Build a GIMPLE_CALL statement to internal function FN. NARGS is
309 the number of arguments. The ... are the arguments. */
312 gimple_build_call_internal (enum internal_fn fn
, unsigned nargs
, ...)
318 call
= gimple_build_call_internal_1 (fn
, nargs
);
319 va_start (ap
, nargs
);
320 for (i
= 0; i
< nargs
; i
++)
321 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
328 /* Build a GIMPLE_CALL statement to internal function FN with the arguments
329 specified in vector ARGS. */
332 gimple_build_call_internal_vec (enum internal_fn fn
, vec
<tree
> args
)
337 nargs
= args
.length ();
338 call
= gimple_build_call_internal_1 (fn
, nargs
);
339 for (i
= 0; i
< nargs
; i
++)
340 gimple_call_set_arg (call
, i
, args
[i
]);
346 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
347 assumed to be in GIMPLE form already. Minimal checking is done of
351 gimple_build_call_from_tree (tree t
)
355 tree fndecl
= get_callee_fndecl (t
);
357 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
359 nargs
= call_expr_nargs (t
);
360 call
= gimple_build_call_1 (fndecl
? fndecl
: CALL_EXPR_FN (t
), nargs
);
362 for (i
= 0; i
< nargs
; i
++)
363 gimple_call_set_arg (call
, i
, CALL_EXPR_ARG (t
, i
));
365 gimple_set_block (call
, TREE_BLOCK (t
));
367 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
368 gimple_call_set_chain (call
, CALL_EXPR_STATIC_CHAIN (t
));
369 gimple_call_set_tail (call
, CALL_EXPR_TAILCALL (t
));
370 gimple_call_set_return_slot_opt (call
, CALL_EXPR_RETURN_SLOT_OPT (t
));
372 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
373 && (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
374 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA_WITH_ALIGN
))
375 gimple_call_set_alloca_for_var (call
, CALL_ALLOCA_FOR_VAR_P (t
));
377 gimple_call_set_from_thunk (call
, CALL_FROM_THUNK_P (t
));
378 gimple_call_set_va_arg_pack (call
, CALL_EXPR_VA_ARG_PACK (t
));
379 gimple_call_set_nothrow (call
, TREE_NOTHROW (t
));
380 gimple_set_no_warning (call
, TREE_NO_WARNING (t
));
386 /* Build a GIMPLE_ASSIGN statement.
388 LHS of the assignment.
389 RHS of the assignment which can be unary or binary. */
392 gimple_build_assign_stat (tree lhs
, tree rhs MEM_STAT_DECL
)
394 enum tree_code subcode
;
397 extract_ops_from_tree_1 (rhs
, &subcode
, &op1
, &op2
, &op3
);
398 return gimple_build_assign_with_ops (subcode
, lhs
, op1
, op2
, op3
403 /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands
404 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
405 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
408 gimple_build_assign_with_ops (enum tree_code subcode
, tree lhs
, tree op1
,
409 tree op2
, tree op3 MEM_STAT_DECL
)
414 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
416 num_ops
= get_gimple_rhs_num_ops (subcode
) + 1;
418 p
= gimple_build_with_ops_stat (GIMPLE_ASSIGN
, (unsigned)subcode
, num_ops
420 gimple_assign_set_lhs (p
, lhs
);
421 gimple_assign_set_rhs1 (p
, op1
);
424 gcc_assert (num_ops
> 2);
425 gimple_assign_set_rhs2 (p
, op2
);
430 gcc_assert (num_ops
> 3);
431 gimple_assign_set_rhs3 (p
, op3
);
438 gimple_build_assign_with_ops (enum tree_code subcode
, tree lhs
, tree op1
,
439 tree op2 MEM_STAT_DECL
)
441 return gimple_build_assign_with_ops (subcode
, lhs
, op1
, op2
, NULL_TREE
446 /* Build a GIMPLE_COND statement.
448 PRED is the condition used to compare LHS and the RHS.
449 T_LABEL is the label to jump to if the condition is true.
450 F_LABEL is the label to jump to otherwise. */
453 gimple_build_cond (enum tree_code pred_code
, tree lhs
, tree rhs
,
454 tree t_label
, tree f_label
)
458 gcc_assert (TREE_CODE_CLASS (pred_code
) == tcc_comparison
);
459 p
= gimple_build_with_ops (GIMPLE_COND
, pred_code
, 4);
460 gimple_cond_set_lhs (p
, lhs
);
461 gimple_cond_set_rhs (p
, rhs
);
462 gimple_cond_set_true_label (p
, t_label
);
463 gimple_cond_set_false_label (p
, f_label
);
467 /* Build a GIMPLE_COND statement from the conditional expression tree
468 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
471 gimple_build_cond_from_tree (tree cond
, tree t_label
, tree f_label
)
476 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
477 return gimple_build_cond (code
, lhs
, rhs
, t_label
, f_label
);
480 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
481 boolean expression tree COND. */
484 gimple_cond_set_condition_from_tree (gimple stmt
, tree cond
)
489 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
490 gimple_cond_set_condition (stmt
, code
, lhs
, rhs
);
493 /* Build a GIMPLE_LABEL statement for LABEL. */
496 gimple_build_label (tree label
)
498 gimple p
= gimple_build_with_ops (GIMPLE_LABEL
, ERROR_MARK
, 1);
499 gimple_label_set_label (p
, label
);
503 /* Build a GIMPLE_GOTO statement to label DEST. */
506 gimple_build_goto (tree dest
)
508 gimple p
= gimple_build_with_ops (GIMPLE_GOTO
, ERROR_MARK
, 1);
509 gimple_goto_set_dest (p
, dest
);
514 /* Build a GIMPLE_NOP statement. */
517 gimple_build_nop (void)
519 return gimple_alloc (GIMPLE_NOP
, 0);
523 /* Build a GIMPLE_BIND statement.
524 VARS are the variables in BODY.
525 BLOCK is the containing block. */
528 gimple_build_bind (tree vars
, gimple_seq body
, tree block
)
530 gimple p
= gimple_alloc (GIMPLE_BIND
, 0);
531 gimple_bind_set_vars (p
, vars
);
533 gimple_bind_set_body (p
, body
);
535 gimple_bind_set_block (p
, block
);
539 /* Helper function to set the simple fields of a asm stmt.
541 STRING is a pointer to a string that is the asm blocks assembly code.
542 NINPUT is the number of register inputs.
543 NOUTPUT is the number of register outputs.
544 NCLOBBERS is the number of clobbered registers.
548 gimple_build_asm_1 (const char *string
, unsigned ninputs
, unsigned noutputs
,
549 unsigned nclobbers
, unsigned nlabels
)
551 gimple_statement_asm
*p
;
552 int size
= strlen (string
);
554 /* ASMs with labels cannot have outputs. This should have been
555 enforced by the front end. */
556 gcc_assert (nlabels
== 0 || noutputs
== 0);
558 p
= as_a
<gimple_statement_asm
*> (
559 gimple_build_with_ops (GIMPLE_ASM
, ERROR_MARK
,
560 ninputs
+ noutputs
+ nclobbers
+ nlabels
));
566 p
->string
= ggc_alloc_string (string
, size
);
568 if (GATHER_STATISTICS
)
569 gimple_alloc_sizes
[(int) gimple_alloc_kind (GIMPLE_ASM
)] += size
;
574 /* Build a GIMPLE_ASM statement.
576 STRING is the assembly code.
577 NINPUT is the number of register inputs.
578 NOUTPUT is the number of register outputs.
579 NCLOBBERS is the number of clobbered registers.
580 INPUTS is a vector of the input register parameters.
581 OUTPUTS is a vector of the output register parameters.
582 CLOBBERS is a vector of the clobbered register parameters.
583 LABELS is a vector of destination labels. */
586 gimple_build_asm_vec (const char *string
, vec
<tree
, va_gc
> *inputs
,
587 vec
<tree
, va_gc
> *outputs
, vec
<tree
, va_gc
> *clobbers
,
588 vec
<tree
, va_gc
> *labels
)
593 p
= gimple_build_asm_1 (string
,
594 vec_safe_length (inputs
),
595 vec_safe_length (outputs
),
596 vec_safe_length (clobbers
),
597 vec_safe_length (labels
));
599 for (i
= 0; i
< vec_safe_length (inputs
); i
++)
600 gimple_asm_set_input_op (p
, i
, (*inputs
)[i
]);
602 for (i
= 0; i
< vec_safe_length (outputs
); i
++)
603 gimple_asm_set_output_op (p
, i
, (*outputs
)[i
]);
605 for (i
= 0; i
< vec_safe_length (clobbers
); i
++)
606 gimple_asm_set_clobber_op (p
, i
, (*clobbers
)[i
]);
608 for (i
= 0; i
< vec_safe_length (labels
); i
++)
609 gimple_asm_set_label_op (p
, i
, (*labels
)[i
]);
614 /* Build a GIMPLE_CATCH statement.
616 TYPES are the catch types.
617 HANDLER is the exception handler. */
620 gimple_build_catch (tree types
, gimple_seq handler
)
622 gimple p
= gimple_alloc (GIMPLE_CATCH
, 0);
623 gimple_catch_set_types (p
, types
);
625 gimple_catch_set_handler (p
, handler
);
630 /* Build a GIMPLE_EH_FILTER statement.
632 TYPES are the filter's types.
633 FAILURE is the filter's failure action. */
636 gimple_build_eh_filter (tree types
, gimple_seq failure
)
638 gimple p
= gimple_alloc (GIMPLE_EH_FILTER
, 0);
639 gimple_eh_filter_set_types (p
, types
);
641 gimple_eh_filter_set_failure (p
, failure
);
646 /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */
649 gimple_build_eh_must_not_throw (tree decl
)
651 gimple p
= gimple_alloc (GIMPLE_EH_MUST_NOT_THROW
, 0);
653 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
654 gcc_assert (flags_from_decl_or_type (decl
) & ECF_NORETURN
);
655 gimple_eh_must_not_throw_set_fndecl (p
, decl
);
660 /* Build a GIMPLE_EH_ELSE statement. */
663 gimple_build_eh_else (gimple_seq n_body
, gimple_seq e_body
)
665 gimple p
= gimple_alloc (GIMPLE_EH_ELSE
, 0);
666 gimple_eh_else_set_n_body (p
, n_body
);
667 gimple_eh_else_set_e_body (p
, e_body
);
671 /* Build a GIMPLE_TRY statement.
673 EVAL is the expression to evaluate.
674 CLEANUP is the cleanup expression.
675 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
676 whether this is a try/catch or a try/finally respectively. */
678 gimple_statement_try
*
679 gimple_build_try (gimple_seq eval
, gimple_seq cleanup
,
680 enum gimple_try_flags kind
)
682 gimple_statement_try
*p
;
684 gcc_assert (kind
== GIMPLE_TRY_CATCH
|| kind
== GIMPLE_TRY_FINALLY
);
685 p
= as_a
<gimple_statement_try
*> (gimple_alloc (GIMPLE_TRY
, 0));
686 gimple_set_subcode (p
, kind
);
688 gimple_try_set_eval (p
, eval
);
690 gimple_try_set_cleanup (p
, cleanup
);
695 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
697 CLEANUP is the cleanup expression. */
700 gimple_build_wce (gimple_seq cleanup
)
702 gimple p
= gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR
, 0);
704 gimple_wce_set_cleanup (p
, cleanup
);
710 /* Build a GIMPLE_RESX statement. */
713 gimple_build_resx (int region
)
715 gimple_statement_resx
*p
=
716 as_a
<gimple_statement_resx
*> (
717 gimple_build_with_ops (GIMPLE_RESX
, ERROR_MARK
, 0));
723 /* The helper for constructing a gimple switch statement.
724 INDEX is the switch's index.
725 NLABELS is the number of labels in the switch excluding the default.
726 DEFAULT_LABEL is the default label for the switch statement. */
729 gimple_build_switch_nlabels (unsigned nlabels
, tree index
, tree default_label
)
731 /* nlabels + 1 default label + 1 index. */
732 gcc_checking_assert (default_label
);
733 gimple p
= gimple_build_with_ops (GIMPLE_SWITCH
, ERROR_MARK
,
735 gimple_switch_set_index (p
, index
);
736 gimple_switch_set_default_label (p
, default_label
);
740 /* Build a GIMPLE_SWITCH statement.
742 INDEX is the switch's index.
743 DEFAULT_LABEL is the default label
744 ARGS is a vector of labels excluding the default. */
747 gimple_build_switch (tree index
, tree default_label
, vec
<tree
> args
)
749 unsigned i
, nlabels
= args
.length ();
751 gimple p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
753 /* Copy the labels from the vector to the switch statement. */
754 for (i
= 0; i
< nlabels
; i
++)
755 gimple_switch_set_label (p
, i
+ 1, args
[i
]);
760 /* Build a GIMPLE_EH_DISPATCH statement. */
763 gimple_build_eh_dispatch (int region
)
765 gimple_statement_eh_dispatch
*p
=
766 as_a
<gimple_statement_eh_dispatch
*> (
767 gimple_build_with_ops (GIMPLE_EH_DISPATCH
, ERROR_MARK
, 0));
772 /* Build a new GIMPLE_DEBUG_BIND statement.
774 VAR is bound to VALUE; block and location are taken from STMT. */
777 gimple_build_debug_bind_stat (tree var
, tree value
, gimple stmt MEM_STAT_DECL
)
779 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
780 (unsigned)GIMPLE_DEBUG_BIND
, 2
783 gimple_debug_bind_set_var (p
, var
);
784 gimple_debug_bind_set_value (p
, value
);
786 gimple_set_location (p
, gimple_location (stmt
));
792 /* Build a new GIMPLE_DEBUG_SOURCE_BIND statement.
794 VAR is bound to VALUE; block and location are taken from STMT. */
797 gimple_build_debug_source_bind_stat (tree var
, tree value
,
798 gimple stmt MEM_STAT_DECL
)
800 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
801 (unsigned)GIMPLE_DEBUG_SOURCE_BIND
, 2
804 gimple_debug_source_bind_set_var (p
, var
);
805 gimple_debug_source_bind_set_value (p
, value
);
807 gimple_set_location (p
, gimple_location (stmt
));
813 /* Build a GIMPLE_OMP_CRITICAL statement.
815 BODY is the sequence of statements for which only one thread can execute.
816 NAME is optional identifier for this critical block. */
819 gimple_build_omp_critical (gimple_seq body
, tree name
)
821 gimple p
= gimple_alloc (GIMPLE_OMP_CRITICAL
, 0);
822 gimple_omp_critical_set_name (p
, name
);
824 gimple_omp_set_body (p
, body
);
829 /* Build a GIMPLE_OMP_FOR statement.
831 BODY is sequence of statements inside the for loop.
832 KIND is the `for' variant.
833 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
834 lastprivate, reductions, ordered, schedule, and nowait.
835 COLLAPSE is the collapse count.
836 PRE_BODY is the sequence of statements that are loop invariant. */
839 gimple_build_omp_for (gimple_seq body
, int kind
, tree clauses
, size_t collapse
,
842 gimple_statement_omp_for
*p
=
843 as_a
<gimple_statement_omp_for
*> (gimple_alloc (GIMPLE_OMP_FOR
, 0));
845 gimple_omp_set_body (p
, body
);
846 gimple_omp_for_set_clauses (p
, clauses
);
847 gimple_omp_for_set_kind (p
, kind
);
848 p
->collapse
= collapse
;
849 p
->iter
= ggc_cleared_vec_alloc
<gimple_omp_for_iter
> (collapse
);
852 gimple_omp_for_set_pre_body (p
, pre_body
);
858 /* Build a GIMPLE_OMP_PARALLEL statement.
860 BODY is sequence of statements which are executed in parallel.
861 CLAUSES, are the OMP parallel construct's clauses.
862 CHILD_FN is the function created for the parallel threads to execute.
863 DATA_ARG are the shared data argument(s). */
866 gimple_build_omp_parallel (gimple_seq body
, tree clauses
, tree child_fn
,
869 gimple p
= gimple_alloc (GIMPLE_OMP_PARALLEL
, 0);
871 gimple_omp_set_body (p
, body
);
872 gimple_omp_parallel_set_clauses (p
, clauses
);
873 gimple_omp_parallel_set_child_fn (p
, child_fn
);
874 gimple_omp_parallel_set_data_arg (p
, data_arg
);
880 /* Build a GIMPLE_OMP_TASK statement.
882 BODY is sequence of statements which are executed by the explicit task.
883 CLAUSES, are the OMP parallel construct's clauses.
884 CHILD_FN is the function created for the parallel threads to execute.
885 DATA_ARG are the shared data argument(s).
886 COPY_FN is the optional function for firstprivate initialization.
887 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
890 gimple_build_omp_task (gimple_seq body
, tree clauses
, tree child_fn
,
891 tree data_arg
, tree copy_fn
, tree arg_size
,
894 gimple p
= gimple_alloc (GIMPLE_OMP_TASK
, 0);
896 gimple_omp_set_body (p
, body
);
897 gimple_omp_task_set_clauses (p
, clauses
);
898 gimple_omp_task_set_child_fn (p
, child_fn
);
899 gimple_omp_task_set_data_arg (p
, data_arg
);
900 gimple_omp_task_set_copy_fn (p
, copy_fn
);
901 gimple_omp_task_set_arg_size (p
, arg_size
);
902 gimple_omp_task_set_arg_align (p
, arg_align
);
908 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
910 BODY is the sequence of statements in the section. */
913 gimple_build_omp_section (gimple_seq body
)
915 gimple p
= gimple_alloc (GIMPLE_OMP_SECTION
, 0);
917 gimple_omp_set_body (p
, body
);
923 /* Build a GIMPLE_OMP_MASTER statement.
925 BODY is the sequence of statements to be executed by just the master. */
928 gimple_build_omp_master (gimple_seq body
)
930 gimple p
= gimple_alloc (GIMPLE_OMP_MASTER
, 0);
932 gimple_omp_set_body (p
, body
);
938 /* Build a GIMPLE_OMP_TASKGROUP statement.
940 BODY is the sequence of statements to be executed by the taskgroup
944 gimple_build_omp_taskgroup (gimple_seq body
)
946 gimple p
= gimple_alloc (GIMPLE_OMP_TASKGROUP
, 0);
948 gimple_omp_set_body (p
, body
);
954 /* Build a GIMPLE_OMP_CONTINUE statement.
956 CONTROL_DEF is the definition of the control variable.
957 CONTROL_USE is the use of the control variable. */
960 gimple_build_omp_continue (tree control_def
, tree control_use
)
962 gimple p
= gimple_alloc (GIMPLE_OMP_CONTINUE
, 0);
963 gimple_omp_continue_set_control_def (p
, control_def
);
964 gimple_omp_continue_set_control_use (p
, control_use
);
968 /* Build a GIMPLE_OMP_ORDERED statement.
970 BODY is the sequence of statements inside a loop that will executed in
974 gimple_build_omp_ordered (gimple_seq body
)
976 gimple p
= gimple_alloc (GIMPLE_OMP_ORDERED
, 0);
978 gimple_omp_set_body (p
, body
);
984 /* Build a GIMPLE_OMP_RETURN statement.
985 WAIT_P is true if this is a non-waiting return. */
988 gimple_build_omp_return (bool wait_p
)
990 gimple p
= gimple_alloc (GIMPLE_OMP_RETURN
, 0);
992 gimple_omp_return_set_nowait (p
);
998 /* Build a GIMPLE_OMP_SECTIONS statement.
1000 BODY is a sequence of section statements.
1001 CLAUSES are any of the OMP sections contsruct's clauses: private,
1002 firstprivate, lastprivate, reduction, and nowait. */
1005 gimple_build_omp_sections (gimple_seq body
, tree clauses
)
1007 gimple p
= gimple_alloc (GIMPLE_OMP_SECTIONS
, 0);
1009 gimple_omp_set_body (p
, body
);
1010 gimple_omp_sections_set_clauses (p
, clauses
);
1016 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
1019 gimple_build_omp_sections_switch (void)
1021 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH
, 0);
1025 /* Build a GIMPLE_OMP_SINGLE statement.
1027 BODY is the sequence of statements that will be executed once.
1028 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
1029 copyprivate, nowait. */
1032 gimple_build_omp_single (gimple_seq body
, tree clauses
)
1034 gimple p
= gimple_alloc (GIMPLE_OMP_SINGLE
, 0);
1036 gimple_omp_set_body (p
, body
);
1037 gimple_omp_single_set_clauses (p
, clauses
);
1043 /* Build a GIMPLE_OMP_TARGET statement.
1045 BODY is the sequence of statements that will be executed.
1046 CLAUSES are any of the OMP target construct's clauses. */
1049 gimple_build_omp_target (gimple_seq body
, int kind
, tree clauses
)
1051 gimple p
= gimple_alloc (GIMPLE_OMP_TARGET
, 0);
1053 gimple_omp_set_body (p
, body
);
1054 gimple_omp_target_set_clauses (p
, clauses
);
1055 gimple_omp_target_set_kind (p
, kind
);
1061 /* Build a GIMPLE_OMP_TEAMS statement.
1063 BODY is the sequence of statements that will be executed.
1064 CLAUSES are any of the OMP teams construct's clauses. */
1067 gimple_build_omp_teams (gimple_seq body
, tree clauses
)
1069 gimple p
= gimple_alloc (GIMPLE_OMP_TEAMS
, 0);
1071 gimple_omp_set_body (p
, body
);
1072 gimple_omp_teams_set_clauses (p
, clauses
);
1078 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1081 gimple_build_omp_atomic_load (tree lhs
, tree rhs
)
1083 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD
, 0);
1084 gimple_omp_atomic_load_set_lhs (p
, lhs
);
1085 gimple_omp_atomic_load_set_rhs (p
, rhs
);
1089 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1091 VAL is the value we are storing. */
1094 gimple_build_omp_atomic_store (tree val
)
1096 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_STORE
, 0);
1097 gimple_omp_atomic_store_set_val (p
, val
);
1101 /* Build a GIMPLE_TRANSACTION statement. */
1104 gimple_build_transaction (gimple_seq body
, tree label
)
1106 gimple p
= gimple_alloc (GIMPLE_TRANSACTION
, 0);
1107 gimple_transaction_set_body (p
, body
);
1108 gimple_transaction_set_label (p
, label
);
1112 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1113 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1116 gimple_build_predict (enum br_predictor predictor
, enum prediction outcome
)
1118 gimple p
= gimple_alloc (GIMPLE_PREDICT
, 0);
1119 /* Ensure all the predictors fit into the lower bits of the subcode. */
1120 gcc_assert ((int) END_PREDICTORS
<= GF_PREDICT_TAKEN
);
1121 gimple_predict_set_predictor (p
, predictor
);
1122 gimple_predict_set_outcome (p
, outcome
);
1126 #if defined ENABLE_GIMPLE_CHECKING
1127 /* Complain of a gimple type mismatch and die. */
1130 gimple_check_failed (const_gimple gs
, const char *file
, int line
,
1131 const char *function
, enum gimple_code code
,
1132 enum tree_code subcode
)
1134 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1135 gimple_code_name
[code
],
1136 get_tree_code_name (subcode
),
1137 gimple_code_name
[gimple_code (gs
)],
1139 ? get_tree_code_name ((enum tree_code
) gs
->subcode
)
1141 function
, trim_filename (file
), line
);
1143 #endif /* ENABLE_GIMPLE_CHECKING */
1146 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1147 *SEQ_P is NULL, a new sequence is allocated. */
1150 gimple_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
1152 gimple_stmt_iterator si
;
1156 si
= gsi_last (*seq_p
);
1157 gsi_insert_after (&si
, gs
, GSI_NEW_STMT
);
1160 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1161 *SEQ_P is NULL, a new sequence is allocated. This function is
1162 similar to gimple_seq_add_stmt, but does not scan the operands.
1163 During gimplification, we need to manipulate statement sequences
1164 before the def/use vectors have been constructed. */
1167 gimple_seq_add_stmt_without_update (gimple_seq
*seq_p
, gimple gs
)
1169 gimple_stmt_iterator si
;
1174 si
= gsi_last (*seq_p
);
1175 gsi_insert_after_without_update (&si
, gs
, GSI_NEW_STMT
);
1178 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1179 NULL, a new sequence is allocated. */
1182 gimple_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
1184 gimple_stmt_iterator si
;
1188 si
= gsi_last (*dst_p
);
1189 gsi_insert_seq_after (&si
, src
, GSI_NEW_STMT
);
1192 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1193 NULL, a new sequence is allocated. This function is
1194 similar to gimple_seq_add_seq, but does not scan the operands. */
1197 gimple_seq_add_seq_without_update (gimple_seq
*dst_p
, gimple_seq src
)
1199 gimple_stmt_iterator si
;
1203 si
= gsi_last (*dst_p
);
1204 gsi_insert_seq_after_without_update (&si
, src
, GSI_NEW_STMT
);
1207 /* Determine whether to assign a location to the statement GS. */
1210 should_carry_location_p (gimple gs
)
1212 /* Don't emit a line note for a label. We particularly don't want to
1213 emit one for the break label, since it doesn't actually correspond
1214 to the beginning of the loop/switch. */
1215 if (gimple_code (gs
) == GIMPLE_LABEL
)
1221 /* Set the location for gimple statement GS to LOCATION. */
1224 annotate_one_with_location (gimple gs
, location_t location
)
1226 if (!gimple_has_location (gs
)
1227 && !gimple_do_not_emit_location_p (gs
)
1228 && should_carry_location_p (gs
))
1229 gimple_set_location (gs
, location
);
1232 /* Set LOCATION for all the statements after iterator GSI in sequence
1233 SEQ. If GSI is pointing to the end of the sequence, start with the
1234 first statement in SEQ. */
1237 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
1238 location_t location
)
1240 if (gsi_end_p (gsi
))
1241 gsi
= gsi_start (seq
);
1245 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
1246 annotate_one_with_location (gsi_stmt (gsi
), location
);
1249 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
1252 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
1254 gimple_stmt_iterator i
;
1256 if (gimple_seq_empty_p (stmt_p
))
1259 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
1261 gimple gs
= gsi_stmt (i
);
1262 annotate_one_with_location (gs
, location
);
1266 /* Helper function of empty_body_p. Return true if STMT is an empty
1270 empty_stmt_p (gimple stmt
)
1272 if (gimple_code (stmt
) == GIMPLE_NOP
)
1274 if (gimple_code (stmt
) == GIMPLE_BIND
)
1275 return empty_body_p (gimple_bind_body (stmt
));
1280 /* Return true if BODY contains nothing but empty statements. */
1283 empty_body_p (gimple_seq body
)
1285 gimple_stmt_iterator i
;
1287 if (gimple_seq_empty_p (body
))
1289 for (i
= gsi_start (body
); !gsi_end_p (i
); gsi_next (&i
))
1290 if (!empty_stmt_p (gsi_stmt (i
))
1291 && !is_gimple_debug (gsi_stmt (i
)))
1298 /* Perform a deep copy of sequence SRC and return the result. */
1301 gimple_seq_copy (gimple_seq src
)
1303 gimple_stmt_iterator gsi
;
1304 gimple_seq new_seq
= NULL
;
1307 for (gsi
= gsi_start (src
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1309 stmt
= gimple_copy (gsi_stmt (gsi
));
1310 gimple_seq_add_stmt (&new_seq
, stmt
);
1318 /* Return true if calls C1 and C2 are known to go to the same function. */
1321 gimple_call_same_target_p (const_gimple c1
, const_gimple c2
)
1323 if (gimple_call_internal_p (c1
))
1324 return (gimple_call_internal_p (c2
)
1325 && gimple_call_internal_fn (c1
) == gimple_call_internal_fn (c2
));
1327 return (gimple_call_fn (c1
) == gimple_call_fn (c2
)
1328 || (gimple_call_fndecl (c1
)
1329 && gimple_call_fndecl (c1
) == gimple_call_fndecl (c2
)));
1332 /* Detect flags from a GIMPLE_CALL. This is just like
1333 call_expr_flags, but for gimple tuples. */
1336 gimple_call_flags (const_gimple stmt
)
1339 tree decl
= gimple_call_fndecl (stmt
);
1342 flags
= flags_from_decl_or_type (decl
);
1343 else if (gimple_call_internal_p (stmt
))
1344 flags
= internal_fn_flags (gimple_call_internal_fn (stmt
));
1346 flags
= flags_from_decl_or_type (gimple_call_fntype (stmt
));
1348 if (stmt
->subcode
& GF_CALL_NOTHROW
)
1349 flags
|= ECF_NOTHROW
;
1354 /* Return the "fn spec" string for call STMT. */
1357 gimple_call_fnspec (const_gimple stmt
)
1361 if (gimple_call_internal_p (stmt
))
1362 return internal_fn_fnspec (gimple_call_internal_fn (stmt
));
1364 type
= gimple_call_fntype (stmt
);
1368 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
1372 return TREE_VALUE (TREE_VALUE (attr
));
1375 /* Detects argument flags for argument number ARG on call STMT. */
1378 gimple_call_arg_flags (const_gimple stmt
, unsigned arg
)
1380 const_tree attr
= gimple_call_fnspec (stmt
);
1382 if (!attr
|| 1 + arg
>= (unsigned) TREE_STRING_LENGTH (attr
))
1385 switch (TREE_STRING_POINTER (attr
)[1 + arg
])
1392 return EAF_DIRECT
| EAF_NOCLOBBER
| EAF_NOESCAPE
;
1395 return EAF_NOCLOBBER
| EAF_NOESCAPE
;
1398 return EAF_DIRECT
| EAF_NOESCAPE
;
1401 return EAF_NOESCAPE
;
1409 /* Detects return flags for the call STMT. */
1412 gimple_call_return_flags (const_gimple stmt
)
1416 if (gimple_call_flags (stmt
) & ECF_MALLOC
)
1419 attr
= gimple_call_fnspec (stmt
);
1420 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
1423 switch (TREE_STRING_POINTER (attr
)[0])
1429 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
1441 /* Return true if GS is a copy assignment. */
1444 gimple_assign_copy_p (gimple gs
)
1446 return (gimple_assign_single_p (gs
)
1447 && is_gimple_val (gimple_op (gs
, 1)));
1451 /* Return true if GS is a SSA_NAME copy assignment. */
1454 gimple_assign_ssa_name_copy_p (gimple gs
)
1456 return (gimple_assign_single_p (gs
)
1457 && TREE_CODE (gimple_assign_lhs (gs
)) == SSA_NAME
1458 && TREE_CODE (gimple_assign_rhs1 (gs
)) == SSA_NAME
);
1462 /* Return true if GS is an assignment with a unary RHS, but the
1463 operator has no effect on the assigned value. The logic is adapted
1464 from STRIP_NOPS. This predicate is intended to be used in tuplifying
1465 instances in which STRIP_NOPS was previously applied to the RHS of
1468 NOTE: In the use cases that led to the creation of this function
1469 and of gimple_assign_single_p, it is typical to test for either
1470 condition and to proceed in the same manner. In each case, the
1471 assigned value is represented by the single RHS operand of the
1472 assignment. I suspect there may be cases where gimple_assign_copy_p,
1473 gimple_assign_single_p, or equivalent logic is used where a similar
1474 treatment of unary NOPs is appropriate. */
1477 gimple_assign_unary_nop_p (gimple gs
)
1479 return (is_gimple_assign (gs
)
1480 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs
))
1481 || gimple_assign_rhs_code (gs
) == NON_LVALUE_EXPR
)
1482 && gimple_assign_rhs1 (gs
) != error_mark_node
1483 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs
)))
1484 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs
)))));
1487 /* Set BB to be the basic block holding G. */
1490 gimple_set_bb (gimple stmt
, basic_block bb
)
1494 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1497 /* If the statement is a label, add the label to block-to-labels map
1498 so that we can speed up edge creation for GIMPLE_GOTOs. */
1504 t
= gimple_label_label (stmt
);
1505 uid
= LABEL_DECL_UID (t
);
1509 vec_safe_length (label_to_block_map_for_fn (cfun
));
1510 LABEL_DECL_UID (t
) = uid
= cfun
->cfg
->last_label_uid
++;
1511 if (old_len
<= (unsigned) uid
)
1513 unsigned new_len
= 3 * uid
/ 2 + 1;
1515 vec_safe_grow_cleared (label_to_block_map_for_fn (cfun
),
1520 (*label_to_block_map_for_fn (cfun
))[uid
] = bb
;
1525 /* Modify the RHS of the assignment pointed-to by GSI using the
1526 operands in the expression tree EXPR.
1528 NOTE: The statement pointed-to by GSI may be reallocated if it
1529 did not have enough operand slots.
1531 This function is useful to convert an existing tree expression into
1532 the flat representation used for the RHS of a GIMPLE assignment.
1533 It will reallocate memory as needed to expand or shrink the number
1534 of operand slots needed to represent EXPR.
1536 NOTE: If you find yourself building a tree and then calling this
1537 function, you are most certainly doing it the slow way. It is much
1538 better to build a new assignment or to use the function
1539 gimple_assign_set_rhs_with_ops, which does not require an
1540 expression tree to be built. */
1543 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator
*gsi
, tree expr
)
1545 enum tree_code subcode
;
1548 extract_ops_from_tree_1 (expr
, &subcode
, &op1
, &op2
, &op3
);
1549 gimple_assign_set_rhs_with_ops_1 (gsi
, subcode
, op1
, op2
, op3
);
1553 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
1554 operands OP1, OP2 and OP3.
1556 NOTE: The statement pointed-to by GSI may be reallocated if it
1557 did not have enough operand slots. */
1560 gimple_assign_set_rhs_with_ops_1 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
1561 tree op1
, tree op2
, tree op3
)
1563 unsigned new_rhs_ops
= get_gimple_rhs_num_ops (code
);
1564 gimple stmt
= gsi_stmt (*gsi
);
1566 /* If the new CODE needs more operands, allocate a new statement. */
1567 if (gimple_num_ops (stmt
) < new_rhs_ops
+ 1)
1569 tree lhs
= gimple_assign_lhs (stmt
);
1570 gimple new_stmt
= gimple_alloc (gimple_code (stmt
), new_rhs_ops
+ 1);
1571 memcpy (new_stmt
, stmt
, gimple_size (gimple_code (stmt
)));
1572 gimple_init_singleton (new_stmt
);
1573 gsi_replace (gsi
, new_stmt
, true);
1576 /* The LHS needs to be reset as this also changes the SSA name
1578 gimple_assign_set_lhs (stmt
, lhs
);
1581 gimple_set_num_ops (stmt
, new_rhs_ops
+ 1);
1582 gimple_set_subcode (stmt
, code
);
1583 gimple_assign_set_rhs1 (stmt
, op1
);
1584 if (new_rhs_ops
> 1)
1585 gimple_assign_set_rhs2 (stmt
, op2
);
1586 if (new_rhs_ops
> 2)
1587 gimple_assign_set_rhs3 (stmt
, op3
);
1591 /* Return the LHS of a statement that performs an assignment,
1592 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
1593 for a call to a function that returns no value, or for a
1594 statement other than an assignment or a call. */
1597 gimple_get_lhs (const_gimple stmt
)
1599 enum gimple_code code
= gimple_code (stmt
);
1601 if (code
== GIMPLE_ASSIGN
)
1602 return gimple_assign_lhs (stmt
);
1603 else if (code
== GIMPLE_CALL
)
1604 return gimple_call_lhs (stmt
);
1610 /* Set the LHS of a statement that performs an assignment,
1611 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
1614 gimple_set_lhs (gimple stmt
, tree lhs
)
1616 enum gimple_code code
= gimple_code (stmt
);
1618 if (code
== GIMPLE_ASSIGN
)
1619 gimple_assign_set_lhs (stmt
, lhs
);
1620 else if (code
== GIMPLE_CALL
)
1621 gimple_call_set_lhs (stmt
, lhs
);
1627 /* Return a deep copy of statement STMT. All the operands from STMT
1628 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
1629 and VUSE operand arrays are set to empty in the new copy. The new
1630 copy isn't part of any sequence. */
1633 gimple_copy (gimple stmt
)
1635 enum gimple_code code
= gimple_code (stmt
);
1636 unsigned num_ops
= gimple_num_ops (stmt
);
1637 gimple copy
= gimple_alloc (code
, num_ops
);
1640 /* Shallow copy all the fields from STMT. */
1641 memcpy (copy
, stmt
, gimple_size (code
));
1642 gimple_init_singleton (copy
);
1644 /* If STMT has sub-statements, deep-copy them as well. */
1645 if (gimple_has_substatements (stmt
))
1650 switch (gimple_code (stmt
))
1653 new_seq
= gimple_seq_copy (gimple_bind_body (stmt
));
1654 gimple_bind_set_body (copy
, new_seq
);
1655 gimple_bind_set_vars (copy
, unshare_expr (gimple_bind_vars (stmt
)));
1656 gimple_bind_set_block (copy
, gimple_bind_block (stmt
));
1660 new_seq
= gimple_seq_copy (gimple_catch_handler (stmt
));
1661 gimple_catch_set_handler (copy
, new_seq
);
1662 t
= unshare_expr (gimple_catch_types (stmt
));
1663 gimple_catch_set_types (copy
, t
);
1666 case GIMPLE_EH_FILTER
:
1667 new_seq
= gimple_seq_copy (gimple_eh_filter_failure (stmt
));
1668 gimple_eh_filter_set_failure (copy
, new_seq
);
1669 t
= unshare_expr (gimple_eh_filter_types (stmt
));
1670 gimple_eh_filter_set_types (copy
, t
);
1673 case GIMPLE_EH_ELSE
:
1674 new_seq
= gimple_seq_copy (gimple_eh_else_n_body (stmt
));
1675 gimple_eh_else_set_n_body (copy
, new_seq
);
1676 new_seq
= gimple_seq_copy (gimple_eh_else_e_body (stmt
));
1677 gimple_eh_else_set_e_body (copy
, new_seq
);
1681 new_seq
= gimple_seq_copy (gimple_try_eval (stmt
));
1682 gimple_try_set_eval (copy
, new_seq
);
1683 new_seq
= gimple_seq_copy (gimple_try_cleanup (stmt
));
1684 gimple_try_set_cleanup (copy
, new_seq
);
1687 case GIMPLE_OMP_FOR
:
1688 new_seq
= gimple_seq_copy (gimple_omp_for_pre_body (stmt
));
1689 gimple_omp_for_set_pre_body (copy
, new_seq
);
1690 t
= unshare_expr (gimple_omp_for_clauses (stmt
));
1691 gimple_omp_for_set_clauses (copy
, t
);
1693 gimple_statement_omp_for
*omp_for_copy
=
1694 as_a
<gimple_statement_omp_for
*> (copy
);
1695 omp_for_copy
->iter
= ggc_vec_alloc
<gimple_omp_for_iter
>
1696 ( gimple_omp_for_collapse (stmt
));
1698 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1700 gimple_omp_for_set_cond (copy
, i
,
1701 gimple_omp_for_cond (stmt
, i
));
1702 gimple_omp_for_set_index (copy
, i
,
1703 gimple_omp_for_index (stmt
, i
));
1704 t
= unshare_expr (gimple_omp_for_initial (stmt
, i
));
1705 gimple_omp_for_set_initial (copy
, i
, t
);
1706 t
= unshare_expr (gimple_omp_for_final (stmt
, i
));
1707 gimple_omp_for_set_final (copy
, i
, t
);
1708 t
= unshare_expr (gimple_omp_for_incr (stmt
, i
));
1709 gimple_omp_for_set_incr (copy
, i
, t
);
1713 case GIMPLE_OMP_PARALLEL
:
1714 t
= unshare_expr (gimple_omp_parallel_clauses (stmt
));
1715 gimple_omp_parallel_set_clauses (copy
, t
);
1716 t
= unshare_expr (gimple_omp_parallel_child_fn (stmt
));
1717 gimple_omp_parallel_set_child_fn (copy
, t
);
1718 t
= unshare_expr (gimple_omp_parallel_data_arg (stmt
));
1719 gimple_omp_parallel_set_data_arg (copy
, t
);
1722 case GIMPLE_OMP_TASK
:
1723 t
= unshare_expr (gimple_omp_task_clauses (stmt
));
1724 gimple_omp_task_set_clauses (copy
, t
);
1725 t
= unshare_expr (gimple_omp_task_child_fn (stmt
));
1726 gimple_omp_task_set_child_fn (copy
, t
);
1727 t
= unshare_expr (gimple_omp_task_data_arg (stmt
));
1728 gimple_omp_task_set_data_arg (copy
, t
);
1729 t
= unshare_expr (gimple_omp_task_copy_fn (stmt
));
1730 gimple_omp_task_set_copy_fn (copy
, t
);
1731 t
= unshare_expr (gimple_omp_task_arg_size (stmt
));
1732 gimple_omp_task_set_arg_size (copy
, t
);
1733 t
= unshare_expr (gimple_omp_task_arg_align (stmt
));
1734 gimple_omp_task_set_arg_align (copy
, t
);
1737 case GIMPLE_OMP_CRITICAL
:
1738 t
= unshare_expr (gimple_omp_critical_name (stmt
));
1739 gimple_omp_critical_set_name (copy
, t
);
1742 case GIMPLE_OMP_SECTIONS
:
1743 t
= unshare_expr (gimple_omp_sections_clauses (stmt
));
1744 gimple_omp_sections_set_clauses (copy
, t
);
1745 t
= unshare_expr (gimple_omp_sections_control (stmt
));
1746 gimple_omp_sections_set_control (copy
, t
);
1749 case GIMPLE_OMP_SINGLE
:
1750 case GIMPLE_OMP_TARGET
:
1751 case GIMPLE_OMP_TEAMS
:
1752 case GIMPLE_OMP_SECTION
:
1753 case GIMPLE_OMP_MASTER
:
1754 case GIMPLE_OMP_TASKGROUP
:
1755 case GIMPLE_OMP_ORDERED
:
1757 new_seq
= gimple_seq_copy (gimple_omp_body (stmt
));
1758 gimple_omp_set_body (copy
, new_seq
);
1761 case GIMPLE_TRANSACTION
:
1762 new_seq
= gimple_seq_copy (gimple_transaction_body (stmt
));
1763 gimple_transaction_set_body (copy
, new_seq
);
1766 case GIMPLE_WITH_CLEANUP_EXPR
:
1767 new_seq
= gimple_seq_copy (gimple_wce_cleanup (stmt
));
1768 gimple_wce_set_cleanup (copy
, new_seq
);
1776 /* Make copy of operands. */
1777 for (i
= 0; i
< num_ops
; i
++)
1778 gimple_set_op (copy
, i
, unshare_expr (gimple_op (stmt
, i
)));
1780 if (gimple_has_mem_ops (stmt
))
1782 gimple_set_vdef (copy
, gimple_vdef (stmt
));
1783 gimple_set_vuse (copy
, gimple_vuse (stmt
));
1786 /* Clear out SSA operand vectors on COPY. */
1787 if (gimple_has_ops (stmt
))
1789 gimple_set_use_ops (copy
, NULL
);
1791 /* SSA operands need to be updated. */
1792 gimple_set_modified (copy
, true);
1799 /* Return true if statement S has side-effects. We consider a
1800 statement to have side effects if:
1802 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
1803 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
1806 gimple_has_side_effects (const_gimple s
)
1808 if (is_gimple_debug (s
))
1811 /* We don't have to scan the arguments to check for
1812 volatile arguments, though, at present, we still
1813 do a scan to check for TREE_SIDE_EFFECTS. */
1814 if (gimple_has_volatile_ops (s
))
1817 if (gimple_code (s
) == GIMPLE_ASM
1818 && gimple_asm_volatile_p (s
))
1821 if (is_gimple_call (s
))
1823 int flags
= gimple_call_flags (s
);
1825 /* An infinite loop is considered a side effect. */
1826 if (!(flags
& (ECF_CONST
| ECF_PURE
))
1827 || (flags
& ECF_LOOPING_CONST_OR_PURE
))
1836 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
1837 Return true if S can trap. When INCLUDE_MEM is true, check whether
1838 the memory operations could trap. When INCLUDE_STORES is true and
1839 S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */
1842 gimple_could_trap_p_1 (gimple s
, bool include_mem
, bool include_stores
)
1844 tree t
, div
= NULL_TREE
;
1849 unsigned i
, start
= (is_gimple_assign (s
) && !include_stores
) ? 1 : 0;
1851 for (i
= start
; i
< gimple_num_ops (s
); i
++)
1852 if (tree_could_trap_p (gimple_op (s
, i
)))
1856 switch (gimple_code (s
))
1859 return gimple_asm_volatile_p (s
);
1862 t
= gimple_call_fndecl (s
);
1863 /* Assume that calls to weak functions may trap. */
1864 if (!t
|| !DECL_P (t
) || DECL_WEAK (t
))
1869 t
= gimple_expr_type (s
);
1870 op
= gimple_assign_rhs_code (s
);
1871 if (get_gimple_rhs_class (op
) == GIMPLE_BINARY_RHS
)
1872 div
= gimple_assign_rhs2 (s
);
1873 return (operation_could_trap_p (op
, FLOAT_TYPE_P (t
),
1874 (INTEGRAL_TYPE_P (t
)
1875 && TYPE_OVERFLOW_TRAPS (t
)),
1885 /* Return true if statement S can trap. */
1888 gimple_could_trap_p (gimple s
)
1890 return gimple_could_trap_p_1 (s
, true, true);
1893 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
1896 gimple_assign_rhs_could_trap_p (gimple s
)
1898 gcc_assert (is_gimple_assign (s
));
1899 return gimple_could_trap_p_1 (s
, true, false);
1903 /* Print debugging information for gimple stmts generated. */
1906 dump_gimple_statistics (void)
1908 int i
, total_tuples
= 0, total_bytes
= 0;
1910 if (! GATHER_STATISTICS
)
1912 fprintf (stderr
, "No gimple statistics\n");
1916 fprintf (stderr
, "\nGIMPLE statements\n");
1917 fprintf (stderr
, "Kind Stmts Bytes\n");
1918 fprintf (stderr
, "---------------------------------------\n");
1919 for (i
= 0; i
< (int) gimple_alloc_kind_all
; ++i
)
1921 fprintf (stderr
, "%-20s %7d %10d\n", gimple_alloc_kind_names
[i
],
1922 gimple_alloc_counts
[i
], gimple_alloc_sizes
[i
]);
1923 total_tuples
+= gimple_alloc_counts
[i
];
1924 total_bytes
+= gimple_alloc_sizes
[i
];
1926 fprintf (stderr
, "---------------------------------------\n");
1927 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_tuples
, total_bytes
);
1928 fprintf (stderr
, "---------------------------------------\n");
1932 /* Return the number of operands needed on the RHS of a GIMPLE
1933 assignment for an expression with tree code CODE. */
1936 get_gimple_rhs_num_ops (enum tree_code code
)
1938 enum gimple_rhs_class rhs_class
= get_gimple_rhs_class (code
);
1940 if (rhs_class
== GIMPLE_UNARY_RHS
|| rhs_class
== GIMPLE_SINGLE_RHS
)
1942 else if (rhs_class
== GIMPLE_BINARY_RHS
)
1944 else if (rhs_class
== GIMPLE_TERNARY_RHS
)
1950 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
1952 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
1953 : ((TYPE) == tcc_binary \
1954 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
1955 : ((TYPE) == tcc_constant \
1956 || (TYPE) == tcc_declaration \
1957 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
1958 : ((SYM) == TRUTH_AND_EXPR \
1959 || (SYM) == TRUTH_OR_EXPR \
1960 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
1961 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
1962 : ((SYM) == COND_EXPR \
1963 || (SYM) == WIDEN_MULT_PLUS_EXPR \
1964 || (SYM) == WIDEN_MULT_MINUS_EXPR \
1965 || (SYM) == DOT_PROD_EXPR \
1966 || (SYM) == SAD_EXPR \
1967 || (SYM) == REALIGN_LOAD_EXPR \
1968 || (SYM) == VEC_COND_EXPR \
1969 || (SYM) == VEC_PERM_EXPR \
1970 || (SYM) == FMA_EXPR) ? GIMPLE_TERNARY_RHS \
1971 : ((SYM) == CONSTRUCTOR \
1972 || (SYM) == OBJ_TYPE_REF \
1973 || (SYM) == ASSERT_EXPR \
1974 || (SYM) == ADDR_EXPR \
1975 || (SYM) == WITH_SIZE_EXPR \
1976 || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \
1977 : GIMPLE_INVALID_RHS),
1978 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
1980 const unsigned char gimple_rhs_class_table
[] = {
1981 #include "all-tree.def"
1985 #undef END_OF_BASE_TREE_CODES
1987 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
1988 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
1989 we failed to create one. */
1992 canonicalize_cond_expr_cond (tree t
)
1994 /* Strip conversions around boolean operations. */
1995 if (CONVERT_EXPR_P (t
)
1996 && (truth_value_p (TREE_CODE (TREE_OPERAND (t
, 0)))
1997 || TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
1999 t
= TREE_OPERAND (t
, 0);
2001 /* For !x use x == 0. */
2002 if (TREE_CODE (t
) == TRUTH_NOT_EXPR
)
2004 tree top0
= TREE_OPERAND (t
, 0);
2005 t
= build2 (EQ_EXPR
, TREE_TYPE (t
),
2006 top0
, build_int_cst (TREE_TYPE (top0
), 0));
2008 /* For cmp ? 1 : 0 use cmp. */
2009 else if (TREE_CODE (t
) == COND_EXPR
2010 && COMPARISON_CLASS_P (TREE_OPERAND (t
, 0))
2011 && integer_onep (TREE_OPERAND (t
, 1))
2012 && integer_zerop (TREE_OPERAND (t
, 2)))
2014 tree top0
= TREE_OPERAND (t
, 0);
2015 t
= build2 (TREE_CODE (top0
), TREE_TYPE (t
),
2016 TREE_OPERAND (top0
, 0), TREE_OPERAND (top0
, 1));
2018 /* For x ^ y use x != y. */
2019 else if (TREE_CODE (t
) == BIT_XOR_EXPR
)
2020 t
= build2 (NE_EXPR
, TREE_TYPE (t
),
2021 TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
2023 if (is_gimple_condexpr (t
))
2029 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
2030 the positions marked by the set ARGS_TO_SKIP. */
2033 gimple_call_copy_skip_args (gimple stmt
, bitmap args_to_skip
)
2036 int nargs
= gimple_call_num_args (stmt
);
2037 auto_vec
<tree
> vargs (nargs
);
2040 for (i
= 0; i
< nargs
; i
++)
2041 if (!bitmap_bit_p (args_to_skip
, i
))
2042 vargs
.quick_push (gimple_call_arg (stmt
, i
));
2044 if (gimple_call_internal_p (stmt
))
2045 new_stmt
= gimple_build_call_internal_vec (gimple_call_internal_fn (stmt
),
2048 new_stmt
= gimple_build_call_vec (gimple_call_fn (stmt
), vargs
);
2050 if (gimple_call_lhs (stmt
))
2051 gimple_call_set_lhs (new_stmt
, gimple_call_lhs (stmt
));
2053 gimple_set_vuse (new_stmt
, gimple_vuse (stmt
));
2054 gimple_set_vdef (new_stmt
, gimple_vdef (stmt
));
2056 if (gimple_has_location (stmt
))
2057 gimple_set_location (new_stmt
, gimple_location (stmt
));
2058 gimple_call_copy_flags (new_stmt
, stmt
);
2059 gimple_call_set_chain (new_stmt
, gimple_call_chain (stmt
));
2061 gimple_set_modified (new_stmt
, true);
2068 /* Return true if the field decls F1 and F2 are at the same offset.
2070 This is intended to be used on GIMPLE types only. */
2073 gimple_compare_field_offset (tree f1
, tree f2
)
2075 if (DECL_OFFSET_ALIGN (f1
) == DECL_OFFSET_ALIGN (f2
))
2077 tree offset1
= DECL_FIELD_OFFSET (f1
);
2078 tree offset2
= DECL_FIELD_OFFSET (f2
);
2079 return ((offset1
== offset2
2080 /* Once gimplification is done, self-referential offsets are
2081 instantiated as operand #2 of the COMPONENT_REF built for
2082 each access and reset. Therefore, they are not relevant
2083 anymore and fields are interchangeable provided that they
2084 represent the same access. */
2085 || (TREE_CODE (offset1
) == PLACEHOLDER_EXPR
2086 && TREE_CODE (offset2
) == PLACEHOLDER_EXPR
2087 && (DECL_SIZE (f1
) == DECL_SIZE (f2
)
2088 || (TREE_CODE (DECL_SIZE (f1
)) == PLACEHOLDER_EXPR
2089 && TREE_CODE (DECL_SIZE (f2
)) == PLACEHOLDER_EXPR
)
2090 || operand_equal_p (DECL_SIZE (f1
), DECL_SIZE (f2
), 0))
2091 && DECL_ALIGN (f1
) == DECL_ALIGN (f2
))
2092 || operand_equal_p (offset1
, offset2
, 0))
2093 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1
),
2094 DECL_FIELD_BIT_OFFSET (f2
)));
2097 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
2098 should be, so handle differing ones specially by decomposing
2099 the offset into a byte and bit offset manually. */
2100 if (tree_fits_shwi_p (DECL_FIELD_OFFSET (f1
))
2101 && tree_fits_shwi_p (DECL_FIELD_OFFSET (f2
)))
2103 unsigned HOST_WIDE_INT byte_offset1
, byte_offset2
;
2104 unsigned HOST_WIDE_INT bit_offset1
, bit_offset2
;
2105 bit_offset1
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1
));
2106 byte_offset1
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1
))
2107 + bit_offset1
/ BITS_PER_UNIT
);
2108 bit_offset2
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2
));
2109 byte_offset2
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2
))
2110 + bit_offset2
/ BITS_PER_UNIT
);
2111 if (byte_offset1
!= byte_offset2
)
2113 return bit_offset1
% BITS_PER_UNIT
== bit_offset2
% BITS_PER_UNIT
;
2120 /* Return a type the same as TYPE except unsigned or
2121 signed according to UNSIGNEDP. */
2124 gimple_signed_or_unsigned_type (bool unsignedp
, tree type
)
2129 type1
= TYPE_MAIN_VARIANT (type
);
2130 if (type1
== signed_char_type_node
2131 || type1
== char_type_node
2132 || type1
== unsigned_char_type_node
)
2133 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2134 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2135 return unsignedp
? unsigned_type_node
: integer_type_node
;
2136 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2137 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2138 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2139 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2140 if (type1
== long_long_integer_type_node
2141 || type1
== long_long_unsigned_type_node
)
2143 ? long_long_unsigned_type_node
2144 : long_long_integer_type_node
;
2146 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2147 if (int_n_enabled_p
[i
]
2148 && (type1
== int_n_trees
[i
].unsigned_type
2149 || type1
== int_n_trees
[i
].signed_type
))
2151 ? int_n_trees
[i
].unsigned_type
2152 : int_n_trees
[i
].signed_type
;
2154 #if HOST_BITS_PER_WIDE_INT >= 64
2155 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2156 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2158 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2159 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2160 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2161 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2162 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2163 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2164 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2165 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2167 #define GIMPLE_FIXED_TYPES(NAME) \
2168 if (type1 == short_ ## NAME ## _type_node \
2169 || type1 == unsigned_short_ ## NAME ## _type_node) \
2170 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2171 : short_ ## NAME ## _type_node; \
2172 if (type1 == NAME ## _type_node \
2173 || type1 == unsigned_ ## NAME ## _type_node) \
2174 return unsignedp ? unsigned_ ## NAME ## _type_node \
2175 : NAME ## _type_node; \
2176 if (type1 == long_ ## NAME ## _type_node \
2177 || type1 == unsigned_long_ ## NAME ## _type_node) \
2178 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2179 : long_ ## NAME ## _type_node; \
2180 if (type1 == long_long_ ## NAME ## _type_node \
2181 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2182 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2183 : long_long_ ## NAME ## _type_node;
2185 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
2186 if (type1 == NAME ## _type_node \
2187 || type1 == u ## NAME ## _type_node) \
2188 return unsignedp ? u ## NAME ## _type_node \
2189 : NAME ## _type_node;
2191 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
2192 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2193 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2194 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2195 : sat_ ## short_ ## NAME ## _type_node; \
2196 if (type1 == sat_ ## NAME ## _type_node \
2197 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2198 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2199 : sat_ ## NAME ## _type_node; \
2200 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2201 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2202 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2203 : sat_ ## long_ ## NAME ## _type_node; \
2204 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2205 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2206 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2207 : sat_ ## long_long_ ## NAME ## _type_node;
2209 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
2210 if (type1 == sat_ ## NAME ## _type_node \
2211 || type1 == sat_ ## u ## NAME ## _type_node) \
2212 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2213 : sat_ ## NAME ## _type_node;
2215 GIMPLE_FIXED_TYPES (fract
);
2216 GIMPLE_FIXED_TYPES_SAT (fract
);
2217 GIMPLE_FIXED_TYPES (accum
);
2218 GIMPLE_FIXED_TYPES_SAT (accum
);
2220 GIMPLE_FIXED_MODE_TYPES (qq
);
2221 GIMPLE_FIXED_MODE_TYPES (hq
);
2222 GIMPLE_FIXED_MODE_TYPES (sq
);
2223 GIMPLE_FIXED_MODE_TYPES (dq
);
2224 GIMPLE_FIXED_MODE_TYPES (tq
);
2225 GIMPLE_FIXED_MODE_TYPES_SAT (qq
);
2226 GIMPLE_FIXED_MODE_TYPES_SAT (hq
);
2227 GIMPLE_FIXED_MODE_TYPES_SAT (sq
);
2228 GIMPLE_FIXED_MODE_TYPES_SAT (dq
);
2229 GIMPLE_FIXED_MODE_TYPES_SAT (tq
);
2230 GIMPLE_FIXED_MODE_TYPES (ha
);
2231 GIMPLE_FIXED_MODE_TYPES (sa
);
2232 GIMPLE_FIXED_MODE_TYPES (da
);
2233 GIMPLE_FIXED_MODE_TYPES (ta
);
2234 GIMPLE_FIXED_MODE_TYPES_SAT (ha
);
2235 GIMPLE_FIXED_MODE_TYPES_SAT (sa
);
2236 GIMPLE_FIXED_MODE_TYPES_SAT (da
);
2237 GIMPLE_FIXED_MODE_TYPES_SAT (ta
);
2239 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2240 the precision; they have precision set to match their range, but
2241 may use a wider mode to match an ABI. If we change modes, we may
2242 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2243 the precision as well, so as to yield correct results for
2244 bit-field types. C++ does not have these separate bit-field
2245 types, and producing a signed or unsigned variant of an
2246 ENUMERAL_TYPE may cause other problems as well. */
2247 if (!INTEGRAL_TYPE_P (type
)
2248 || TYPE_UNSIGNED (type
) == unsignedp
)
2251 #define TYPE_OK(node) \
2252 (TYPE_MODE (type) == TYPE_MODE (node) \
2253 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
2254 if (TYPE_OK (signed_char_type_node
))
2255 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2256 if (TYPE_OK (integer_type_node
))
2257 return unsignedp
? unsigned_type_node
: integer_type_node
;
2258 if (TYPE_OK (short_integer_type_node
))
2259 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2260 if (TYPE_OK (long_integer_type_node
))
2261 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2262 if (TYPE_OK (long_long_integer_type_node
))
2264 ? long_long_unsigned_type_node
2265 : long_long_integer_type_node
);
2267 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
2268 if (int_n_enabled_p
[i
]
2269 && TYPE_MODE (type
) == int_n_data
[i
].m
2270 && TYPE_PRECISION (type
) == int_n_data
[i
].bitsize
)
2272 ? int_n_trees
[i
].unsigned_type
2273 : int_n_trees
[i
].signed_type
;
2275 #if HOST_BITS_PER_WIDE_INT >= 64
2276 if (TYPE_OK (intTI_type_node
))
2277 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2279 if (TYPE_OK (intDI_type_node
))
2280 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2281 if (TYPE_OK (intSI_type_node
))
2282 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2283 if (TYPE_OK (intHI_type_node
))
2284 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2285 if (TYPE_OK (intQI_type_node
))
2286 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2288 #undef GIMPLE_FIXED_TYPES
2289 #undef GIMPLE_FIXED_MODE_TYPES
2290 #undef GIMPLE_FIXED_TYPES_SAT
2291 #undef GIMPLE_FIXED_MODE_TYPES_SAT
2294 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2298 /* Return an unsigned type the same as TYPE in other respects. */
2301 gimple_unsigned_type (tree type
)
2303 return gimple_signed_or_unsigned_type (true, type
);
2307 /* Return a signed type the same as TYPE in other respects. */
2310 gimple_signed_type (tree type
)
2312 return gimple_signed_or_unsigned_type (false, type
);
2316 /* Return the typed-based alias set for T, which may be an expression
2317 or a type. Return -1 if we don't do anything special. */
2320 gimple_get_alias_set (tree t
)
2324 /* Permit type-punning when accessing a union, provided the access
2325 is directly through the union. For example, this code does not
2326 permit taking the address of a union member and then storing
2327 through it. Even the type-punning allowed here is a GCC
2328 extension, albeit a common and useful one; the C standard says
2329 that such accesses have implementation-defined behavior. */
2331 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2332 u
= TREE_OPERAND (u
, 0))
2333 if (TREE_CODE (u
) == COMPONENT_REF
2334 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2337 /* That's all the expressions we handle specially. */
2341 /* For convenience, follow the C standard when dealing with
2342 character types. Any object may be accessed via an lvalue that
2343 has character type. */
2344 if (t
== char_type_node
2345 || t
== signed_char_type_node
2346 || t
== unsigned_char_type_node
)
2349 /* Allow aliasing between signed and unsigned variants of the same
2350 type. We treat the signed variant as canonical. */
2351 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
2353 tree t1
= gimple_signed_type (t
);
2355 /* t1 == t can happen for boolean nodes which are always unsigned. */
2357 return get_alias_set (t1
);
2364 /* Helper for gimple_ior_addresses_taken_1. */
2367 gimple_ior_addresses_taken_1 (gimple
, tree addr
, tree
, void *data
)
2369 bitmap addresses_taken
= (bitmap
)data
;
2370 addr
= get_base_address (addr
);
2374 bitmap_set_bit (addresses_taken
, DECL_UID (addr
));
2380 /* Set the bit for the uid of all decls that have their address taken
2381 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
2382 were any in this stmt. */
2385 gimple_ior_addresses_taken (bitmap addresses_taken
, gimple stmt
)
2387 return walk_stmt_load_store_addr_ops (stmt
, addresses_taken
, NULL
, NULL
,
2388 gimple_ior_addresses_taken_1
);
2392 /* Return true if TYPE1 and TYPE2 are compatible enough for builtin
2396 validate_type (tree type1
, tree type2
)
2398 if (INTEGRAL_TYPE_P (type1
)
2399 && INTEGRAL_TYPE_P (type2
))
2401 else if (POINTER_TYPE_P (type1
)
2402 && POINTER_TYPE_P (type2
))
2404 else if (TREE_CODE (type1
)
2405 != TREE_CODE (type2
))
2410 /* Return true when STMTs arguments and return value match those of FNDECL,
2411 a decl of a builtin function. */
2414 gimple_builtin_call_types_compatible_p (const_gimple stmt
, tree fndecl
)
2416 gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl
) != NOT_BUILT_IN
);
2418 tree ret
= gimple_call_lhs (stmt
);
2420 && !validate_type (TREE_TYPE (ret
), TREE_TYPE (TREE_TYPE (fndecl
))))
2423 tree targs
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2424 unsigned nargs
= gimple_call_num_args (stmt
);
2425 for (unsigned i
= 0; i
< nargs
; ++i
)
2427 /* Variadic args follow. */
2430 tree arg
= gimple_call_arg (stmt
, i
);
2431 if (!validate_type (TREE_TYPE (arg
), TREE_VALUE (targs
)))
2433 targs
= TREE_CHAIN (targs
);
2435 if (targs
&& !VOID_TYPE_P (TREE_VALUE (targs
)))
2440 /* Return true when STMT is builtins call. */
2443 gimple_call_builtin_p (const_gimple stmt
)
2446 if (is_gimple_call (stmt
)
2447 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
2448 && DECL_BUILT_IN_CLASS (fndecl
) != NOT_BUILT_IN
)
2449 return gimple_builtin_call_types_compatible_p (stmt
, fndecl
);
2453 /* Return true when STMT is builtins call to CLASS. */
2456 gimple_call_builtin_p (const_gimple stmt
, enum built_in_class klass
)
2459 if (is_gimple_call (stmt
)
2460 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
2461 && DECL_BUILT_IN_CLASS (fndecl
) == klass
)
2462 return gimple_builtin_call_types_compatible_p (stmt
, fndecl
);
2466 /* Return true when STMT is builtins call to CODE of CLASS. */
2469 gimple_call_builtin_p (const_gimple stmt
, enum built_in_function code
)
2472 if (is_gimple_call (stmt
)
2473 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
2474 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2475 && DECL_FUNCTION_CODE (fndecl
) == code
)
2476 return gimple_builtin_call_types_compatible_p (stmt
, fndecl
);
2480 /* Return true if STMT clobbers memory. STMT is required to be a
2484 gimple_asm_clobbers_memory_p (const_gimple stmt
)
2488 for (i
= 0; i
< gimple_asm_nclobbers (stmt
); i
++)
2490 tree op
= gimple_asm_clobber_op (stmt
, i
);
2491 if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op
)), "memory") == 0)
2498 /* Dump bitmap SET (assumed to contain VAR_DECLs) to FILE. */
2501 dump_decl_set (FILE *file
, bitmap set
)
2508 fprintf (file
, "{ ");
2510 EXECUTE_IF_SET_IN_BITMAP (set
, 0, i
, bi
)
2512 fprintf (file
, "D.%u", i
);
2513 fprintf (file
, " ");
2516 fprintf (file
, "}");
2519 fprintf (file
, "NIL");
2522 /* Return true when CALL is a call stmt that definitely doesn't
2523 free any memory or makes it unavailable otherwise. */
2525 nonfreeing_call_p (gimple call
)
2527 if (gimple_call_builtin_p (call
, BUILT_IN_NORMAL
)
2528 && gimple_call_flags (call
) & ECF_LEAF
)
2529 switch (DECL_FUNCTION_CODE (gimple_call_fndecl (call
)))
2531 /* Just in case these become ECF_LEAF in the future. */
2533 case BUILT_IN_TM_FREE
:
2534 case BUILT_IN_REALLOC
:
2535 case BUILT_IN_STACK_RESTORE
:
2544 /* Callback for walk_stmt_load_store_ops.
2546 Return TRUE if OP will dereference the tree stored in DATA, FALSE
2549 This routine only makes a superficial check for a dereference. Thus
2550 it must only be used if it is safe to return a false negative. */
2552 check_loadstore (gimple
, tree op
, tree
, void *data
)
2554 if ((TREE_CODE (op
) == MEM_REF
|| TREE_CODE (op
) == TARGET_MEM_REF
)
2555 && operand_equal_p (TREE_OPERAND (op
, 0), (tree
)data
, 0))
2560 /* If OP can be inferred to be non-NULL after STMT executes, return true.
2562 DEREFERENCE is TRUE if we can use a pointer dereference to infer a
2563 non-NULL range, FALSE otherwise.
2565 ATTRIBUTE is TRUE if we can use attributes to infer a non-NULL range
2566 for function arguments and return values. FALSE otherwise. */
2569 infer_nonnull_range (gimple stmt
, tree op
, bool dereference
, bool attribute
)
2571 /* We can only assume that a pointer dereference will yield
2572 non-NULL if -fdelete-null-pointer-checks is enabled. */
2573 if (!flag_delete_null_pointer_checks
2574 || !POINTER_TYPE_P (TREE_TYPE (op
))
2575 || gimple_code (stmt
) == GIMPLE_ASM
)
2579 && walk_stmt_load_store_ops (stmt
, (void *)op
,
2580 check_loadstore
, check_loadstore
))
2584 && is_gimple_call (stmt
) && !gimple_call_internal_p (stmt
))
2586 tree fntype
= gimple_call_fntype (stmt
);
2587 tree attrs
= TYPE_ATTRIBUTES (fntype
);
2588 for (; attrs
; attrs
= TREE_CHAIN (attrs
))
2590 attrs
= lookup_attribute ("nonnull", attrs
);
2592 /* If "nonnull" wasn't specified, we know nothing about
2594 if (attrs
== NULL_TREE
)
2597 /* If "nonnull" applies to all the arguments, then ARG
2598 is non-null if it's in the argument list. */
2599 if (TREE_VALUE (attrs
) == NULL_TREE
)
2601 for (unsigned int i
= 0; i
< gimple_call_num_args (stmt
); i
++)
2603 if (POINTER_TYPE_P (TREE_TYPE (gimple_call_arg (stmt
, i
)))
2604 && operand_equal_p (op
, gimple_call_arg (stmt
, i
), 0))
2610 /* Now see if op appears in the nonnull list. */
2611 for (tree t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
2613 int idx
= TREE_INT_CST_LOW (TREE_VALUE (t
)) - 1;
2614 tree arg
= gimple_call_arg (stmt
, idx
);
2615 if (operand_equal_p (op
, arg
, 0))
2621 /* If this function is marked as returning non-null, then we can
2622 infer OP is non-null if it is used in the return statement. */
2624 && gimple_code (stmt
) == GIMPLE_RETURN
2625 && gimple_return_retval (stmt
)
2626 && operand_equal_p (gimple_return_retval (stmt
), op
, 0)
2627 && lookup_attribute ("returns_nonnull",
2628 TYPE_ATTRIBUTES (TREE_TYPE (current_function_decl
))))
2634 /* Compare two case labels. Because the front end should already have
2635 made sure that case ranges do not overlap, it is enough to only compare
2636 the CASE_LOW values of each case label. */
2639 compare_case_labels (const void *p1
, const void *p2
)
2641 const_tree
const case1
= *(const_tree
const*)p1
;
2642 const_tree
const case2
= *(const_tree
const*)p2
;
2644 /* The 'default' case label always goes first. */
2645 if (!CASE_LOW (case1
))
2647 else if (!CASE_LOW (case2
))
2650 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
2653 /* Sort the case labels in LABEL_VEC in place in ascending order. */
2656 sort_case_labels (vec
<tree
> label_vec
)
2658 label_vec
.qsort (compare_case_labels
);
2661 /* Prepare a vector of case labels to be used in a GIMPLE_SWITCH statement.
2663 LABELS is a vector that contains all case labels to look at.
2665 INDEX_TYPE is the type of the switch index expression. Case labels
2666 in LABELS are discarded if their values are not in the value range
2667 covered by INDEX_TYPE. The remaining case label values are folded
2670 If a default case exists in LABELS, it is removed from LABELS and
2671 returned in DEFAULT_CASEP. If no default case exists, but the
2672 case labels already cover the whole range of INDEX_TYPE, a default
2673 case is returned pointing to one of the existing case labels.
2674 Otherwise DEFAULT_CASEP is set to NULL_TREE.
2676 DEFAULT_CASEP may be NULL, in which case the above comment doesn't
2677 apply and no action is taken regardless of whether a default case is
2681 preprocess_case_label_vec_for_gimple (vec
<tree
> labels
,
2683 tree
*default_casep
)
2685 tree min_value
, max_value
;
2686 tree default_case
= NULL_TREE
;
2690 min_value
= TYPE_MIN_VALUE (index_type
);
2691 max_value
= TYPE_MAX_VALUE (index_type
);
2692 while (i
< labels
.length ())
2694 tree elt
= labels
[i
];
2695 tree low
= CASE_LOW (elt
);
2696 tree high
= CASE_HIGH (elt
);
2697 bool remove_element
= FALSE
;
2701 gcc_checking_assert (TREE_CODE (low
) == INTEGER_CST
);
2702 gcc_checking_assert (!high
|| TREE_CODE (high
) == INTEGER_CST
);
2704 /* This is a non-default case label, i.e. it has a value.
2706 See if the case label is reachable within the range of
2707 the index type. Remove out-of-range case values. Turn
2708 case ranges into a canonical form (high > low strictly)
2709 and convert the case label values to the index type.
2711 NB: The type of gimple_switch_index() may be the promoted
2712 type, but the case labels retain the original type. */
2716 /* This is a case range. Discard empty ranges.
2717 If the bounds or the range are equal, turn this
2718 into a simple (one-value) case. */
2719 int cmp
= tree_int_cst_compare (high
, low
);
2721 remove_element
= TRUE
;
2728 /* If the simple case value is unreachable, ignore it. */
2729 if ((TREE_CODE (min_value
) == INTEGER_CST
2730 && tree_int_cst_compare (low
, min_value
) < 0)
2731 || (TREE_CODE (max_value
) == INTEGER_CST
2732 && tree_int_cst_compare (low
, max_value
) > 0))
2733 remove_element
= TRUE
;
2735 low
= fold_convert (index_type
, low
);
2739 /* If the entire case range is unreachable, ignore it. */
2740 if ((TREE_CODE (min_value
) == INTEGER_CST
2741 && tree_int_cst_compare (high
, min_value
) < 0)
2742 || (TREE_CODE (max_value
) == INTEGER_CST
2743 && tree_int_cst_compare (low
, max_value
) > 0))
2744 remove_element
= TRUE
;
2747 /* If the lower bound is less than the index type's
2748 minimum value, truncate the range bounds. */
2749 if (TREE_CODE (min_value
) == INTEGER_CST
2750 && tree_int_cst_compare (low
, min_value
) < 0)
2752 low
= fold_convert (index_type
, low
);
2754 /* If the upper bound is greater than the index type's
2755 maximum value, truncate the range bounds. */
2756 if (TREE_CODE (max_value
) == INTEGER_CST
2757 && tree_int_cst_compare (high
, max_value
) > 0)
2759 high
= fold_convert (index_type
, high
);
2761 /* We may have folded a case range to a one-value case. */
2762 if (tree_int_cst_equal (low
, high
))
2767 CASE_LOW (elt
) = low
;
2768 CASE_HIGH (elt
) = high
;
2772 gcc_assert (!default_case
);
2774 /* The default case must be passed separately to the
2775 gimple_build_switch routine. But if DEFAULT_CASEP
2776 is NULL, we do not remove the default case (it would
2777 be completely lost). */
2779 remove_element
= TRUE
;
2783 labels
.ordered_remove (i
);
2789 if (!labels
.is_empty ())
2790 sort_case_labels (labels
);
2792 if (default_casep
&& !default_case
)
2794 /* If the switch has no default label, add one, so that we jump
2795 around the switch body. If the labels already cover the whole
2796 range of the switch index_type, add the default label pointing
2797 to one of the existing labels. */
2799 && TYPE_MIN_VALUE (index_type
)
2800 && TYPE_MAX_VALUE (index_type
)
2801 && tree_int_cst_equal (CASE_LOW (labels
[0]),
2802 TYPE_MIN_VALUE (index_type
)))
2804 tree low
, high
= CASE_HIGH (labels
[len
- 1]);
2806 high
= CASE_LOW (labels
[len
- 1]);
2807 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (index_type
)))
2809 for (i
= 1; i
< len
; i
++)
2811 high
= CASE_LOW (labels
[i
]);
2812 low
= CASE_HIGH (labels
[i
- 1]);
2814 low
= CASE_LOW (labels
[i
- 1]);
2815 if (wi::add (low
, 1) != high
)
2820 tree label
= CASE_LABEL (labels
[0]);
2821 default_case
= build_case_label (NULL_TREE
, NULL_TREE
,
2829 *default_casep
= default_case
;
2832 /* Set the location of all statements in SEQ to LOC. */
2835 gimple_seq_set_location (gimple_seq seq
, location_t loc
)
2837 for (gimple_stmt_iterator i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
2838 gimple_set_location (gsi_stmt (i
), loc
);
2841 /* Release SSA_NAMEs in SEQ as well as the GIMPLE statements. */
2844 gimple_seq_discard (gimple_seq seq
)
2846 gimple_stmt_iterator gsi
;
2848 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); )
2850 gimple stmt
= gsi_stmt (gsi
);
2851 gsi_remove (&gsi
, true);
2852 release_defs (stmt
);