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"
32 #include "basic-block.h"
33 #include "tree-ssa-alias.h"
34 #include "internal-fn.h"
36 #include "gimple-expr.h"
39 #include "gimple-iterator.h"
40 #include "gimple-walk.h"
43 #include "diagnostic.h"
44 #include "value-prof.h"
48 #include "langhooks.h"
52 /* All the tuples have their operand vector (if present) at the very bottom
53 of the structure. Therefore, the offset required to find the
54 operands vector the size of the structure minus the size of the 1
55 element tree array at the end (see gimple_ops). */
56 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \
57 (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0),
58 EXPORTED_CONST
size_t gimple_ops_offset_
[] = {
59 #include "gsstruct.def"
63 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof (struct STRUCT),
64 static const size_t gsstruct_code_size
[] = {
65 #include "gsstruct.def"
69 #define DEFGSCODE(SYM, NAME, GSSCODE) NAME,
70 const char *const gimple_code_name
[] = {
75 #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE,
76 EXPORTED_CONST
enum gimple_statement_structure_enum gss_for_code_
[] = {
83 int gimple_alloc_counts
[(int) gimple_alloc_kind_all
];
84 int gimple_alloc_sizes
[(int) gimple_alloc_kind_all
];
86 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
87 static const char * const gimple_alloc_kind_names
[] = {
94 /* Gimple tuple constructors.
95 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
96 be passed a NULL to start with an empty sequence. */
98 /* Set the code for statement G to CODE. */
101 gimple_set_code (gimple g
, enum gimple_code code
)
106 /* Return the number of bytes needed to hold a GIMPLE statement with
110 gimple_size (enum gimple_code code
)
112 return gsstruct_code_size
[gss_for_code (code
)];
115 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
119 gimple_alloc_stat (enum gimple_code code
, unsigned num_ops MEM_STAT_DECL
)
124 size
= gimple_size (code
);
126 size
+= sizeof (tree
) * (num_ops
- 1);
128 if (GATHER_STATISTICS
)
130 enum gimple_alloc_kind kind
= gimple_alloc_kind (code
);
131 gimple_alloc_counts
[(int) kind
]++;
132 gimple_alloc_sizes
[(int) kind
] += size
;
135 stmt
= ggc_alloc_cleared_gimple_statement_stat (size PASS_MEM_STAT
);
136 gimple_set_code (stmt
, code
);
137 gimple_set_num_ops (stmt
, num_ops
);
139 /* Do not call gimple_set_modified here as it has other side
140 effects and this tuple is still not completely built. */
142 gimple_init_singleton (stmt
);
147 /* Set SUBCODE to be the code of the expression computed by statement G. */
150 gimple_set_subcode (gimple g
, unsigned subcode
)
152 /* We only have 16 bits for the RHS code. Assert that we are not
154 gcc_assert (subcode
< (1 << 16));
155 g
->subcode
= subcode
;
160 /* Build a tuple with operands. CODE is the statement to build (which
161 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the subcode
162 for the new tuple. NUM_OPS is the number of operands to allocate. */
164 #define gimple_build_with_ops(c, s, n) \
165 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
168 gimple_build_with_ops_stat (enum gimple_code code
, unsigned subcode
,
169 unsigned num_ops MEM_STAT_DECL
)
171 gimple s
= gimple_alloc_stat (code
, num_ops PASS_MEM_STAT
);
172 gimple_set_subcode (s
, subcode
);
178 /* Build a GIMPLE_RETURN statement returning RETVAL. */
181 gimple_build_return (tree retval
)
184 as_a
<gimple_return
> (gimple_build_with_ops (GIMPLE_RETURN
, ERROR_MARK
,
187 gimple_return_set_retval (s
, retval
);
191 /* Reset alias information on call S. */
194 gimple_call_reset_alias_info (gimple_call s
)
196 if (gimple_call_flags (s
) & ECF_CONST
)
197 memset (gimple_call_use_set (s
), 0, sizeof (struct pt_solution
));
199 pt_solution_reset (gimple_call_use_set (s
));
200 if (gimple_call_flags (s
) & (ECF_CONST
|ECF_PURE
|ECF_NOVOPS
))
201 memset (gimple_call_clobber_set (s
), 0, sizeof (struct pt_solution
));
203 pt_solution_reset (gimple_call_clobber_set (s
));
206 /* Helper for gimple_build_call, gimple_build_call_valist,
207 gimple_build_call_vec and gimple_build_call_from_tree. Build the basic
208 components of a GIMPLE_CALL statement to function FN with NARGS
211 static inline gimple_call
212 gimple_build_call_1 (tree fn
, unsigned nargs
)
215 as_a
<gimple_call
> (gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
,
217 if (TREE_CODE (fn
) == FUNCTION_DECL
)
218 fn
= build_fold_addr_expr (fn
);
219 gimple_set_op (s
, 1, fn
);
220 gimple_call_set_fntype (s
, TREE_TYPE (TREE_TYPE (fn
)));
221 gimple_call_reset_alias_info (s
);
226 /* Build a GIMPLE_CALL statement to function FN with the arguments
227 specified in vector ARGS. */
230 gimple_build_call_vec (tree fn
, vec
<tree
> args
)
233 unsigned nargs
= args
.length ();
234 gimple_call call
= gimple_build_call_1 (fn
, nargs
);
236 for (i
= 0; i
< nargs
; i
++)
237 gimple_call_set_arg (call
, i
, args
[i
]);
243 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
244 arguments. The ... are the arguments. */
247 gimple_build_call (tree fn
, unsigned nargs
, ...)
253 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
255 call
= gimple_build_call_1 (fn
, nargs
);
257 va_start (ap
, nargs
);
258 for (i
= 0; i
< nargs
; i
++)
259 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
266 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
267 arguments. AP contains the arguments. */
270 gimple_build_call_valist (tree fn
, unsigned nargs
, va_list ap
)
275 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
277 call
= gimple_build_call_1 (fn
, nargs
);
279 for (i
= 0; i
< nargs
; i
++)
280 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
286 /* Helper for gimple_build_call_internal and gimple_build_call_internal_vec.
287 Build the basic components of a GIMPLE_CALL statement to internal
288 function FN with NARGS arguments. */
290 static inline gimple_call
291 gimple_build_call_internal_1 (enum internal_fn fn
, unsigned nargs
)
294 as_a
<gimple_call
> (gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
,
296 s
->subcode
|= GF_CALL_INTERNAL
;
297 gimple_call_set_internal_fn (s
, fn
);
298 gimple_call_reset_alias_info (s
);
303 /* Build a GIMPLE_CALL statement to internal function FN. NARGS is
304 the number of arguments. The ... are the arguments. */
307 gimple_build_call_internal (enum internal_fn fn
, unsigned nargs
, ...)
313 call
= gimple_build_call_internal_1 (fn
, nargs
);
314 va_start (ap
, nargs
);
315 for (i
= 0; i
< nargs
; i
++)
316 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
323 /* Build a GIMPLE_CALL statement to internal function FN with the arguments
324 specified in vector ARGS. */
327 gimple_build_call_internal_vec (enum internal_fn fn
, vec
<tree
> args
)
332 nargs
= args
.length ();
333 call
= gimple_build_call_internal_1 (fn
, nargs
);
334 for (i
= 0; i
< nargs
; i
++)
335 gimple_call_set_arg (call
, i
, args
[i
]);
341 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
342 assumed to be in GIMPLE form already. Minimal checking is done of
346 gimple_build_call_from_tree (tree t
)
350 tree fndecl
= get_callee_fndecl (t
);
352 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
354 nargs
= call_expr_nargs (t
);
355 call
= gimple_build_call_1 (fndecl
? fndecl
: CALL_EXPR_FN (t
), nargs
);
357 for (i
= 0; i
< nargs
; i
++)
358 gimple_call_set_arg (call
, i
, CALL_EXPR_ARG (t
, i
));
360 gimple_set_block (call
, TREE_BLOCK (t
));
362 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
363 gimple_call_set_chain (call
, CALL_EXPR_STATIC_CHAIN (t
));
364 gimple_call_set_tail (call
, CALL_EXPR_TAILCALL (t
));
365 gimple_call_set_return_slot_opt (call
, CALL_EXPR_RETURN_SLOT_OPT (t
));
367 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
368 && (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
369 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA_WITH_ALIGN
))
370 gimple_call_set_alloca_for_var (call
, CALL_ALLOCA_FOR_VAR_P (t
));
372 gimple_call_set_from_thunk (call
, CALL_FROM_THUNK_P (t
));
373 gimple_call_set_va_arg_pack (call
, CALL_EXPR_VA_ARG_PACK (t
));
374 gimple_call_set_nothrow (call
, TREE_NOTHROW (t
));
375 gimple_set_no_warning (call
, TREE_NO_WARNING (t
));
381 /* Build a GIMPLE_ASSIGN statement.
383 LHS of the assignment.
384 RHS of the assignment which can be unary or binary. */
387 gimple_build_assign_stat (tree lhs
, tree rhs MEM_STAT_DECL
)
389 enum tree_code subcode
;
392 extract_ops_from_tree_1 (rhs
, &subcode
, &op1
, &op2
, &op3
);
393 return gimple_build_assign_with_ops (subcode
, lhs
, op1
, op2
, op3
398 /* Build a GIMPLE_ASSIGN statement with subcode SUBCODE and operands
399 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
400 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
403 gimple_build_assign_with_ops (enum tree_code subcode
, tree lhs
, tree op1
,
404 tree op2
, tree op3 MEM_STAT_DECL
)
409 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
411 num_ops
= get_gimple_rhs_num_ops (subcode
) + 1;
413 p
= as_a
<gimple_assign
> (
414 gimple_build_with_ops_stat (GIMPLE_ASSIGN
, (unsigned)subcode
, num_ops
416 gimple_assign_set_lhs (p
, lhs
);
417 gimple_assign_set_rhs1 (p
, op1
);
420 gcc_assert (num_ops
> 2);
421 gimple_assign_set_rhs2 (p
, op2
);
426 gcc_assert (num_ops
> 3);
427 gimple_assign_set_rhs3 (p
, op3
);
434 gimple_build_assign_with_ops (enum tree_code subcode
, tree lhs
, tree op1
,
435 tree op2 MEM_STAT_DECL
)
437 return gimple_build_assign_with_ops (subcode
, lhs
, op1
, op2
, NULL_TREE
442 /* Build a GIMPLE_COND statement.
444 PRED is the condition used to compare LHS and the RHS.
445 T_LABEL is the label to jump to if the condition is true.
446 F_LABEL is the label to jump to otherwise. */
449 gimple_build_cond (enum tree_code pred_code
, tree lhs
, tree rhs
,
450 tree t_label
, tree f_label
)
454 gcc_assert (TREE_CODE_CLASS (pred_code
) == tcc_comparison
);
455 p
= as_a
<gimple_cond
> (gimple_build_with_ops (GIMPLE_COND
, pred_code
, 4));
456 gimple_cond_set_lhs (p
, lhs
);
457 gimple_cond_set_rhs (p
, rhs
);
458 gimple_cond_set_true_label (p
, t_label
);
459 gimple_cond_set_false_label (p
, f_label
);
463 /* Build a GIMPLE_COND statement from the conditional expression tree
464 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
467 gimple_build_cond_from_tree (tree cond
, tree t_label
, tree f_label
)
472 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
473 return gimple_build_cond (code
, lhs
, rhs
, t_label
, f_label
);
476 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
477 boolean expression tree COND. */
480 gimple_cond_set_condition_from_tree (gimple_cond stmt
, tree cond
)
485 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
486 gimple_cond_set_condition (stmt
, code
, lhs
, rhs
);
489 /* Build a GIMPLE_LABEL statement for LABEL. */
492 gimple_build_label (tree label
)
495 as_a
<gimple_label
> (gimple_build_with_ops (GIMPLE_LABEL
, ERROR_MARK
, 1));
496 gimple_label_set_label (p
, label
);
500 /* Build a GIMPLE_GOTO statement to label DEST. */
503 gimple_build_goto (tree dest
)
506 as_a
<gimple_goto
> (gimple_build_with_ops (GIMPLE_GOTO
, ERROR_MARK
, 1));
507 gimple_goto_set_dest (p
, dest
);
512 /* Build a GIMPLE_NOP statement. */
515 gimple_build_nop (void)
517 return gimple_alloc (GIMPLE_NOP
, 0);
521 /* Build a GIMPLE_BIND statement.
522 VARS are the variables in BODY.
523 BLOCK is the containing block. */
526 gimple_build_bind (tree vars
, gimple_seq body
, tree block
)
528 gimple_bind p
= as_a
<gimple_bind
> (gimple_alloc (GIMPLE_BIND
, 0));
529 gimple_bind_set_vars (p
, vars
);
531 gimple_bind_set_body (p
, body
);
533 gimple_bind_set_block (p
, block
);
537 /* Helper function to set the simple fields of a asm stmt.
539 STRING is a pointer to a string that is the asm blocks assembly code.
540 NINPUT is the number of register inputs.
541 NOUTPUT is the number of register outputs.
542 NCLOBBERS is the number of clobbered registers.
545 static inline gimple_asm
546 gimple_build_asm_1 (const char *string
, unsigned ninputs
, unsigned noutputs
,
547 unsigned nclobbers
, unsigned nlabels
)
550 int size
= strlen (string
);
552 /* ASMs with labels cannot have outputs. This should have been
553 enforced by the front end. */
554 gcc_assert (nlabels
== 0 || noutputs
== 0);
556 p
= as_a
<gimple_statement_asm
*> (
557 gimple_build_with_ops (GIMPLE_ASM
, ERROR_MARK
,
558 ninputs
+ noutputs
+ nclobbers
+ nlabels
));
564 p
->string
= ggc_alloc_string (string
, size
);
566 if (GATHER_STATISTICS
)
567 gimple_alloc_sizes
[(int) gimple_alloc_kind (GIMPLE_ASM
)] += size
;
572 /* Build a GIMPLE_ASM statement.
574 STRING is the assembly code.
575 NINPUT is the number of register inputs.
576 NOUTPUT is the number of register outputs.
577 NCLOBBERS is the number of clobbered registers.
578 INPUTS is a vector of the input register parameters.
579 OUTPUTS is a vector of the output register parameters.
580 CLOBBERS is a vector of the clobbered register parameters.
581 LABELS is a vector of destination labels. */
584 gimple_build_asm_vec (const char *string
, vec
<tree
, va_gc
> *inputs
,
585 vec
<tree
, va_gc
> *outputs
, vec
<tree
, va_gc
> *clobbers
,
586 vec
<tree
, va_gc
> *labels
)
591 p
= gimple_build_asm_1 (string
,
592 vec_safe_length (inputs
),
593 vec_safe_length (outputs
),
594 vec_safe_length (clobbers
),
595 vec_safe_length (labels
));
597 for (i
= 0; i
< vec_safe_length (inputs
); i
++)
598 gimple_asm_set_input_op (p
, i
, (*inputs
)[i
]);
600 for (i
= 0; i
< vec_safe_length (outputs
); i
++)
601 gimple_asm_set_output_op (p
, i
, (*outputs
)[i
]);
603 for (i
= 0; i
< vec_safe_length (clobbers
); i
++)
604 gimple_asm_set_clobber_op (p
, i
, (*clobbers
)[i
]);
606 for (i
= 0; i
< vec_safe_length (labels
); i
++)
607 gimple_asm_set_label_op (p
, i
, (*labels
)[i
]);
612 /* Build a GIMPLE_CATCH statement.
614 TYPES are the catch types.
615 HANDLER is the exception handler. */
618 gimple_build_catch (tree types
, gimple_seq handler
)
620 gimple_catch p
= as_a
<gimple_catch
> (gimple_alloc (GIMPLE_CATCH
, 0));
621 gimple_catch_set_types (p
, types
);
623 gimple_catch_set_handler (p
, handler
);
628 /* Build a GIMPLE_EH_FILTER statement.
630 TYPES are the filter's types.
631 FAILURE is the filter's failure action. */
634 gimple_build_eh_filter (tree types
, gimple_seq failure
)
637 as_a
<gimple_eh_filter
> (gimple_alloc (GIMPLE_EH_FILTER
, 0));
638 gimple_eh_filter_set_types (p
, types
);
640 gimple_eh_filter_set_failure (p
, failure
);
645 /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */
647 gimple_eh_must_not_throw
648 gimple_build_eh_must_not_throw (tree decl
)
650 gimple_eh_must_not_throw p
=
651 as_a
<gimple_eh_must_not_throw
> (
652 gimple_alloc (GIMPLE_EH_MUST_NOT_THROW
, 0));
654 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
655 gcc_assert (flags_from_decl_or_type (decl
) & ECF_NORETURN
);
656 gimple_eh_must_not_throw_set_fndecl (p
, decl
);
661 /* Build a GIMPLE_EH_ELSE statement. */
664 gimple_build_eh_else (gimple_seq n_body
, gimple_seq e_body
)
666 gimple_eh_else p
= as_a
<gimple_eh_else
> (gimple_alloc (GIMPLE_EH_ELSE
, 0));
667 gimple_eh_else_set_n_body (p
, n_body
);
668 gimple_eh_else_set_e_body (p
, e_body
);
672 /* Build a GIMPLE_TRY statement.
674 EVAL is the expression to evaluate.
675 CLEANUP is the cleanup expression.
676 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
677 whether this is a try/catch or a try/finally respectively. */
679 gimple_statement_try
*
680 gimple_build_try (gimple_seq eval
, gimple_seq cleanup
,
681 enum gimple_try_flags kind
)
683 gimple_statement_try
*p
;
685 gcc_assert (kind
== GIMPLE_TRY_CATCH
|| kind
== GIMPLE_TRY_FINALLY
);
686 p
= as_a
<gimple_statement_try
*> (gimple_alloc (GIMPLE_TRY
, 0));
687 gimple_set_subcode (p
, kind
);
689 gimple_try_set_eval (p
, eval
);
691 gimple_try_set_cleanup (p
, cleanup
);
696 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
698 CLEANUP is the cleanup expression. */
701 gimple_build_wce (gimple_seq cleanup
)
703 gimple p
= gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR
, 0);
705 gimple_wce_set_cleanup (p
, cleanup
);
711 /* Build a GIMPLE_RESX statement. */
714 gimple_build_resx (int region
)
717 as_a
<gimple_resx
> (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
);
734 as_a
<gimple_switch
> (gimple_build_with_ops (GIMPLE_SWITCH
, ERROR_MARK
,
736 gimple_switch_set_index (p
, index
);
737 gimple_switch_set_default_label (p
, default_label
);
741 /* Build a GIMPLE_SWITCH statement.
743 INDEX is the switch's index.
744 DEFAULT_LABEL is the default label
745 ARGS is a vector of labels excluding the default. */
748 gimple_build_switch (tree index
, tree default_label
, vec
<tree
> args
)
750 unsigned i
, nlabels
= args
.length ();
752 gimple_switch p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
754 /* Copy the labels from the vector to the switch statement. */
755 for (i
= 0; i
< nlabels
; i
++)
756 gimple_switch_set_label (p
, i
+ 1, args
[i
]);
761 /* Build a GIMPLE_EH_DISPATCH statement. */
764 gimple_build_eh_dispatch (int region
)
766 gimple_eh_dispatch p
=
767 as_a
<gimple_eh_dispatch
> (
768 gimple_build_with_ops (GIMPLE_EH_DISPATCH
, ERROR_MARK
, 0));
773 /* Build a new GIMPLE_DEBUG_BIND statement.
775 VAR is bound to VALUE; block and location are taken from STMT. */
778 gimple_build_debug_bind_stat (tree var
, tree value
, gimple stmt MEM_STAT_DECL
)
781 as_a
<gimple_debug
> (gimple_build_with_ops_stat (GIMPLE_DEBUG
,
782 (unsigned)GIMPLE_DEBUG_BIND
, 2
784 gimple_debug_bind_set_var (p
, var
);
785 gimple_debug_bind_set_value (p
, value
);
787 gimple_set_location (p
, gimple_location (stmt
));
793 /* Build a new GIMPLE_DEBUG_SOURCE_BIND statement.
795 VAR is bound to VALUE; block and location are taken from STMT. */
798 gimple_build_debug_source_bind_stat (tree var
, tree value
,
799 gimple stmt MEM_STAT_DECL
)
802 as_a
<gimple_debug
> (
803 gimple_build_with_ops_stat (GIMPLE_DEBUG
,
804 (unsigned)GIMPLE_DEBUG_SOURCE_BIND
, 2
807 gimple_debug_source_bind_set_var (p
, var
);
808 gimple_debug_source_bind_set_value (p
, value
);
810 gimple_set_location (p
, gimple_location (stmt
));
816 /* Build a GIMPLE_OMP_CRITICAL statement.
818 BODY is the sequence of statements for which only one thread can execute.
819 NAME is optional identifier for this critical block. */
822 gimple_build_omp_critical (gimple_seq body
, tree name
)
824 gimple p
= gimple_alloc (GIMPLE_OMP_CRITICAL
, 0);
825 gimple_omp_critical_set_name (p
, name
);
827 gimple_omp_set_body (p
, body
);
832 /* Build a GIMPLE_OMP_FOR statement.
834 BODY is sequence of statements inside the for loop.
835 KIND is the `for' variant.
836 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
837 lastprivate, reductions, ordered, schedule, and nowait.
838 COLLAPSE is the collapse count.
839 PRE_BODY is the sequence of statements that are loop invariant. */
842 gimple_build_omp_for (gimple_seq body
, int kind
, tree clauses
, size_t collapse
,
845 gimple_statement_omp_for
*p
=
846 as_a
<gimple_statement_omp_for
*> (gimple_alloc (GIMPLE_OMP_FOR
, 0));
848 gimple_omp_set_body (p
, body
);
849 gimple_omp_for_set_clauses (p
, clauses
);
850 gimple_omp_for_set_kind (p
, kind
);
851 p
->collapse
= collapse
;
852 p
->iter
= ggc_cleared_vec_alloc
<gimple_omp_for_iter
> (collapse
);
855 gimple_omp_for_set_pre_body (p
, pre_body
);
861 /* Build a GIMPLE_OMP_PARALLEL statement.
863 BODY is sequence of statements which are executed in parallel.
864 CLAUSES, are the OMP parallel construct's clauses.
865 CHILD_FN is the function created for the parallel threads to execute.
866 DATA_ARG are the shared data argument(s). */
869 gimple_build_omp_parallel (gimple_seq body
, tree clauses
, tree child_fn
,
872 gimple p
= gimple_alloc (GIMPLE_OMP_PARALLEL
, 0);
874 gimple_omp_set_body (p
, body
);
875 gimple_omp_parallel_set_clauses (p
, clauses
);
876 gimple_omp_parallel_set_child_fn (p
, child_fn
);
877 gimple_omp_parallel_set_data_arg (p
, data_arg
);
883 /* Build a GIMPLE_OMP_TASK statement.
885 BODY is sequence of statements which are executed by the explicit task.
886 CLAUSES, are the OMP parallel construct's clauses.
887 CHILD_FN is the function created for the parallel threads to execute.
888 DATA_ARG are the shared data argument(s).
889 COPY_FN is the optional function for firstprivate initialization.
890 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
893 gimple_build_omp_task (gimple_seq body
, tree clauses
, tree child_fn
,
894 tree data_arg
, tree copy_fn
, tree arg_size
,
897 gimple p
= gimple_alloc (GIMPLE_OMP_TASK
, 0);
899 gimple_omp_set_body (p
, body
);
900 gimple_omp_task_set_clauses (p
, clauses
);
901 gimple_omp_task_set_child_fn (p
, child_fn
);
902 gimple_omp_task_set_data_arg (p
, data_arg
);
903 gimple_omp_task_set_copy_fn (p
, copy_fn
);
904 gimple_omp_task_set_arg_size (p
, arg_size
);
905 gimple_omp_task_set_arg_align (p
, arg_align
);
911 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
913 BODY is the sequence of statements in the section. */
916 gimple_build_omp_section (gimple_seq body
)
918 gimple p
= gimple_alloc (GIMPLE_OMP_SECTION
, 0);
920 gimple_omp_set_body (p
, body
);
926 /* Build a GIMPLE_OMP_MASTER statement.
928 BODY is the sequence of statements to be executed by just the master. */
931 gimple_build_omp_master (gimple_seq body
)
933 gimple p
= gimple_alloc (GIMPLE_OMP_MASTER
, 0);
935 gimple_omp_set_body (p
, body
);
941 /* Build a GIMPLE_OMP_TASKGROUP statement.
943 BODY is the sequence of statements to be executed by the taskgroup
947 gimple_build_omp_taskgroup (gimple_seq body
)
949 gimple p
= gimple_alloc (GIMPLE_OMP_TASKGROUP
, 0);
951 gimple_omp_set_body (p
, body
);
957 /* Build a GIMPLE_OMP_CONTINUE statement.
959 CONTROL_DEF is the definition of the control variable.
960 CONTROL_USE is the use of the control variable. */
963 gimple_build_omp_continue (tree control_def
, tree control_use
)
965 gimple p
= gimple_alloc (GIMPLE_OMP_CONTINUE
, 0);
966 gimple_omp_continue_set_control_def (p
, control_def
);
967 gimple_omp_continue_set_control_use (p
, control_use
);
971 /* Build a GIMPLE_OMP_ORDERED statement.
973 BODY is the sequence of statements inside a loop that will executed in
977 gimple_build_omp_ordered (gimple_seq body
)
979 gimple p
= gimple_alloc (GIMPLE_OMP_ORDERED
, 0);
981 gimple_omp_set_body (p
, body
);
987 /* Build a GIMPLE_OMP_RETURN statement.
988 WAIT_P is true if this is a non-waiting return. */
991 gimple_build_omp_return (bool wait_p
)
993 gimple p
= gimple_alloc (GIMPLE_OMP_RETURN
, 0);
995 gimple_omp_return_set_nowait (p
);
1001 /* Build a GIMPLE_OMP_SECTIONS statement.
1003 BODY is a sequence of section statements.
1004 CLAUSES are any of the OMP sections contsruct's clauses: private,
1005 firstprivate, lastprivate, reduction, and nowait. */
1008 gimple_build_omp_sections (gimple_seq body
, tree clauses
)
1010 gimple p
= gimple_alloc (GIMPLE_OMP_SECTIONS
, 0);
1012 gimple_omp_set_body (p
, body
);
1013 gimple_omp_sections_set_clauses (p
, clauses
);
1019 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
1022 gimple_build_omp_sections_switch (void)
1024 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH
, 0);
1028 /* Build a GIMPLE_OMP_SINGLE statement.
1030 BODY is the sequence of statements that will be executed once.
1031 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
1032 copyprivate, nowait. */
1035 gimple_build_omp_single (gimple_seq body
, tree clauses
)
1037 gimple p
= gimple_alloc (GIMPLE_OMP_SINGLE
, 0);
1039 gimple_omp_set_body (p
, body
);
1040 gimple_omp_single_set_clauses (p
, clauses
);
1046 /* Build a GIMPLE_OMP_TARGET statement.
1048 BODY is the sequence of statements that will be executed.
1049 CLAUSES are any of the OMP target construct's clauses. */
1052 gimple_build_omp_target (gimple_seq body
, int kind
, tree clauses
)
1054 gimple p
= gimple_alloc (GIMPLE_OMP_TARGET
, 0);
1056 gimple_omp_set_body (p
, body
);
1057 gimple_omp_target_set_clauses (p
, clauses
);
1058 gimple_omp_target_set_kind (p
, kind
);
1064 /* Build a GIMPLE_OMP_TEAMS statement.
1066 BODY is the sequence of statements that will be executed.
1067 CLAUSES are any of the OMP teams construct's clauses. */
1070 gimple_build_omp_teams (gimple_seq body
, tree clauses
)
1072 gimple p
= gimple_alloc (GIMPLE_OMP_TEAMS
, 0);
1074 gimple_omp_set_body (p
, body
);
1075 gimple_omp_teams_set_clauses (p
, clauses
);
1081 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1084 gimple_build_omp_atomic_load (tree lhs
, tree rhs
)
1086 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD
, 0);
1087 gimple_omp_atomic_load_set_lhs (p
, lhs
);
1088 gimple_omp_atomic_load_set_rhs (p
, rhs
);
1092 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1094 VAL is the value we are storing. */
1097 gimple_build_omp_atomic_store (tree val
)
1099 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_STORE
, 0);
1100 gimple_omp_atomic_store_set_val (p
, val
);
1104 /* Build a GIMPLE_TRANSACTION statement. */
1107 gimple_build_transaction (gimple_seq body
, tree label
)
1109 gimple_transaction p
=
1110 as_a
<gimple_transaction
> (gimple_alloc (GIMPLE_TRANSACTION
, 0));
1111 gimple_transaction_set_body (p
, body
);
1112 gimple_transaction_set_label (p
, label
);
1116 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1117 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1120 gimple_build_predict (enum br_predictor predictor
, enum prediction outcome
)
1122 gimple p
= gimple_alloc (GIMPLE_PREDICT
, 0);
1123 /* Ensure all the predictors fit into the lower bits of the subcode. */
1124 gcc_assert ((int) END_PREDICTORS
<= GF_PREDICT_TAKEN
);
1125 gimple_predict_set_predictor (p
, predictor
);
1126 gimple_predict_set_outcome (p
, outcome
);
1130 #if defined ENABLE_GIMPLE_CHECKING
1131 /* Complain of a gimple type mismatch and die. */
1134 gimple_check_failed (const_gimple gs
, const char *file
, int line
,
1135 const char *function
, enum gimple_code code
,
1136 enum tree_code subcode
)
1138 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1139 gimple_code_name
[code
],
1140 get_tree_code_name (subcode
),
1141 gimple_code_name
[gimple_code (gs
)],
1143 ? get_tree_code_name ((enum tree_code
) gs
->subcode
)
1145 function
, trim_filename (file
), line
);
1147 #endif /* ENABLE_GIMPLE_CHECKING */
1150 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1151 *SEQ_P is NULL, a new sequence is allocated. */
1154 gimple_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
1156 gimple_stmt_iterator si
;
1160 si
= gsi_last (*seq_p
);
1161 gsi_insert_after (&si
, gs
, GSI_NEW_STMT
);
1164 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1165 *SEQ_P is NULL, a new sequence is allocated. This function is
1166 similar to gimple_seq_add_stmt, but does not scan the operands.
1167 During gimplification, we need to manipulate statement sequences
1168 before the def/use vectors have been constructed. */
1171 gimple_seq_add_stmt_without_update (gimple_seq
*seq_p
, gimple gs
)
1173 gimple_stmt_iterator si
;
1178 si
= gsi_last (*seq_p
);
1179 gsi_insert_after_without_update (&si
, gs
, GSI_NEW_STMT
);
1182 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1183 NULL, a new sequence is allocated. */
1186 gimple_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
1188 gimple_stmt_iterator si
;
1192 si
= gsi_last (*dst_p
);
1193 gsi_insert_seq_after (&si
, src
, GSI_NEW_STMT
);
1196 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1197 NULL, a new sequence is allocated. This function is
1198 similar to gimple_seq_add_seq, but does not scan the operands. */
1201 gimple_seq_add_seq_without_update (gimple_seq
*dst_p
, gimple_seq src
)
1203 gimple_stmt_iterator si
;
1207 si
= gsi_last (*dst_p
);
1208 gsi_insert_seq_after_without_update (&si
, src
, GSI_NEW_STMT
);
1211 /* Determine whether to assign a location to the statement GS. */
1214 should_carry_location_p (gimple gs
)
1216 /* Don't emit a line note for a label. We particularly don't want to
1217 emit one for the break label, since it doesn't actually correspond
1218 to the beginning of the loop/switch. */
1219 if (gimple_code (gs
) == GIMPLE_LABEL
)
1225 /* Set the location for gimple statement GS to LOCATION. */
1228 annotate_one_with_location (gimple gs
, location_t location
)
1230 if (!gimple_has_location (gs
)
1231 && !gimple_do_not_emit_location_p (gs
)
1232 && should_carry_location_p (gs
))
1233 gimple_set_location (gs
, location
);
1236 /* Set LOCATION for all the statements after iterator GSI in sequence
1237 SEQ. If GSI is pointing to the end of the sequence, start with the
1238 first statement in SEQ. */
1241 annotate_all_with_location_after (gimple_seq seq
, gimple_stmt_iterator gsi
,
1242 location_t location
)
1244 if (gsi_end_p (gsi
))
1245 gsi
= gsi_start (seq
);
1249 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
1250 annotate_one_with_location (gsi_stmt (gsi
), location
);
1253 /* Set the location for all the statements in a sequence STMT_P to LOCATION. */
1256 annotate_all_with_location (gimple_seq stmt_p
, location_t location
)
1258 gimple_stmt_iterator i
;
1260 if (gimple_seq_empty_p (stmt_p
))
1263 for (i
= gsi_start (stmt_p
); !gsi_end_p (i
); gsi_next (&i
))
1265 gimple gs
= gsi_stmt (i
);
1266 annotate_one_with_location (gs
, location
);
1270 /* Helper function of empty_body_p. Return true if STMT is an empty
1274 empty_stmt_p (gimple stmt
)
1276 if (gimple_code (stmt
) == GIMPLE_NOP
)
1278 if (gimple_bind bind_stmt
= dyn_cast
<gimple_bind
> (stmt
))
1279 return empty_body_p (gimple_bind_body (bind_stmt
));
1284 /* Return true if BODY contains nothing but empty statements. */
1287 empty_body_p (gimple_seq body
)
1289 gimple_stmt_iterator i
;
1291 if (gimple_seq_empty_p (body
))
1293 for (i
= gsi_start (body
); !gsi_end_p (i
); gsi_next (&i
))
1294 if (!empty_stmt_p (gsi_stmt (i
))
1295 && !is_gimple_debug (gsi_stmt (i
)))
1302 /* Perform a deep copy of sequence SRC and return the result. */
1305 gimple_seq_copy (gimple_seq src
)
1307 gimple_stmt_iterator gsi
;
1308 gimple_seq new_seq
= NULL
;
1311 for (gsi
= gsi_start (src
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1313 stmt
= gimple_copy (gsi_stmt (gsi
));
1314 gimple_seq_add_stmt (&new_seq
, stmt
);
1322 /* Return true if calls C1 and C2 are known to go to the same function. */
1325 gimple_call_same_target_p (const_gimple c1
, const_gimple c2
)
1327 if (gimple_call_internal_p (c1
))
1328 return (gimple_call_internal_p (c2
)
1329 && gimple_call_internal_fn (c1
) == gimple_call_internal_fn (c2
));
1331 return (gimple_call_fn (c1
) == gimple_call_fn (c2
)
1332 || (gimple_call_fndecl (c1
)
1333 && gimple_call_fndecl (c1
) == gimple_call_fndecl (c2
)));
1336 /* Detect flags from a GIMPLE_CALL. This is just like
1337 call_expr_flags, but for gimple tuples. */
1340 gimple_call_flags (const_gimple stmt
)
1343 tree decl
= gimple_call_fndecl (stmt
);
1346 flags
= flags_from_decl_or_type (decl
);
1347 else if (gimple_call_internal_p (stmt
))
1348 flags
= internal_fn_flags (gimple_call_internal_fn (stmt
));
1350 flags
= flags_from_decl_or_type (gimple_call_fntype (stmt
));
1352 if (stmt
->subcode
& GF_CALL_NOTHROW
)
1353 flags
|= ECF_NOTHROW
;
1358 /* Return the "fn spec" string for call STMT. */
1361 gimple_call_fnspec (const_gimple stmt
)
1365 if (gimple_call_internal_p (stmt
))
1366 return internal_fn_fnspec (gimple_call_internal_fn (stmt
));
1368 type
= gimple_call_fntype (stmt
);
1372 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
1376 return TREE_VALUE (TREE_VALUE (attr
));
1379 /* Detects argument flags for argument number ARG on call STMT. */
1382 gimple_call_arg_flags (const_gimple stmt
, unsigned arg
)
1384 const_tree attr
= gimple_call_fnspec (stmt
);
1386 if (!attr
|| 1 + arg
>= (unsigned) TREE_STRING_LENGTH (attr
))
1389 switch (TREE_STRING_POINTER (attr
)[1 + arg
])
1396 return EAF_DIRECT
| EAF_NOCLOBBER
| EAF_NOESCAPE
;
1399 return EAF_NOCLOBBER
| EAF_NOESCAPE
;
1402 return EAF_DIRECT
| EAF_NOESCAPE
;
1405 return EAF_NOESCAPE
;
1413 /* Detects return flags for the call STMT. */
1416 gimple_call_return_flags (const_gimple_call stmt
)
1420 if (gimple_call_flags (stmt
) & ECF_MALLOC
)
1423 attr
= gimple_call_fnspec (stmt
);
1424 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
1427 switch (TREE_STRING_POINTER (attr
)[0])
1433 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
1445 /* Return true if GS is a copy assignment. */
1448 gimple_assign_copy_p (gimple gs
)
1450 return (gimple_assign_single_p (gs
)
1451 && is_gimple_val (gimple_op (gs
, 1)));
1455 /* Return true if GS is a SSA_NAME copy assignment. */
1458 gimple_assign_ssa_name_copy_p (gimple gs
)
1460 return (gimple_assign_single_p (gs
)
1461 && TREE_CODE (gimple_assign_lhs (gs
)) == SSA_NAME
1462 && TREE_CODE (gimple_assign_rhs1 (gs
)) == SSA_NAME
);
1466 /* Return true if GS is an assignment with a unary RHS, but the
1467 operator has no effect on the assigned value. The logic is adapted
1468 from STRIP_NOPS. This predicate is intended to be used in tuplifying
1469 instances in which STRIP_NOPS was previously applied to the RHS of
1472 NOTE: In the use cases that led to the creation of this function
1473 and of gimple_assign_single_p, it is typical to test for either
1474 condition and to proceed in the same manner. In each case, the
1475 assigned value is represented by the single RHS operand of the
1476 assignment. I suspect there may be cases where gimple_assign_copy_p,
1477 gimple_assign_single_p, or equivalent logic is used where a similar
1478 treatment of unary NOPs is appropriate. */
1481 gimple_assign_unary_nop_p (gimple gs
)
1483 return (is_gimple_assign (gs
)
1484 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs
))
1485 || gimple_assign_rhs_code (gs
) == NON_LVALUE_EXPR
)
1486 && gimple_assign_rhs1 (gs
) != error_mark_node
1487 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs
)))
1488 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs
)))));
1491 /* Set BB to be the basic block holding G. */
1494 gimple_set_bb (gimple stmt
, basic_block bb
)
1498 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1501 /* If the statement is a label, add the label to block-to-labels map
1502 so that we can speed up edge creation for GIMPLE_GOTOs. */
1508 t
= gimple_label_label (stmt
);
1509 uid
= LABEL_DECL_UID (t
);
1513 vec_safe_length (label_to_block_map_for_fn (cfun
));
1514 LABEL_DECL_UID (t
) = uid
= cfun
->cfg
->last_label_uid
++;
1515 if (old_len
<= (unsigned) uid
)
1517 unsigned new_len
= 3 * uid
/ 2 + 1;
1519 vec_safe_grow_cleared (label_to_block_map_for_fn (cfun
),
1524 (*label_to_block_map_for_fn (cfun
))[uid
] = bb
;
1529 /* Modify the RHS of the assignment pointed-to by GSI using the
1530 operands in the expression tree EXPR.
1532 NOTE: The statement pointed-to by GSI may be reallocated if it
1533 did not have enough operand slots.
1535 This function is useful to convert an existing tree expression into
1536 the flat representation used for the RHS of a GIMPLE assignment.
1537 It will reallocate memory as needed to expand or shrink the number
1538 of operand slots needed to represent EXPR.
1540 NOTE: If you find yourself building a tree and then calling this
1541 function, you are most certainly doing it the slow way. It is much
1542 better to build a new assignment or to use the function
1543 gimple_assign_set_rhs_with_ops, which does not require an
1544 expression tree to be built. */
1547 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator
*gsi
, tree expr
)
1549 enum tree_code subcode
;
1552 extract_ops_from_tree_1 (expr
, &subcode
, &op1
, &op2
, &op3
);
1553 gimple_assign_set_rhs_with_ops_1 (gsi
, subcode
, op1
, op2
, op3
);
1557 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
1558 operands OP1, OP2 and OP3.
1560 NOTE: The statement pointed-to by GSI may be reallocated if it
1561 did not have enough operand slots. */
1564 gimple_assign_set_rhs_with_ops_1 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
1565 tree op1
, tree op2
, tree op3
)
1567 unsigned new_rhs_ops
= get_gimple_rhs_num_ops (code
);
1568 gimple stmt
= gsi_stmt (*gsi
);
1570 /* If the new CODE needs more operands, allocate a new statement. */
1571 if (gimple_num_ops (stmt
) < new_rhs_ops
+ 1)
1573 tree lhs
= gimple_assign_lhs (stmt
);
1574 gimple new_stmt
= gimple_alloc (gimple_code (stmt
), new_rhs_ops
+ 1);
1575 memcpy (new_stmt
, stmt
, gimple_size (gimple_code (stmt
)));
1576 gimple_init_singleton (new_stmt
);
1577 gsi_replace (gsi
, new_stmt
, true);
1580 /* The LHS needs to be reset as this also changes the SSA name
1582 gimple_assign_set_lhs (stmt
, lhs
);
1585 gimple_set_num_ops (stmt
, new_rhs_ops
+ 1);
1586 gimple_set_subcode (stmt
, code
);
1587 gimple_assign_set_rhs1 (stmt
, op1
);
1588 if (new_rhs_ops
> 1)
1589 gimple_assign_set_rhs2 (stmt
, op2
);
1590 if (new_rhs_ops
> 2)
1591 gimple_assign_set_rhs3 (stmt
, op3
);
1595 /* Return the LHS of a statement that performs an assignment,
1596 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
1597 for a call to a function that returns no value, or for a
1598 statement other than an assignment or a call. */
1601 gimple_get_lhs (const_gimple stmt
)
1603 enum gimple_code code
= gimple_code (stmt
);
1605 if (code
== GIMPLE_ASSIGN
)
1606 return gimple_assign_lhs (stmt
);
1607 else if (code
== GIMPLE_CALL
)
1608 return gimple_call_lhs (stmt
);
1614 /* Set the LHS of a statement that performs an assignment,
1615 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
1618 gimple_set_lhs (gimple stmt
, tree lhs
)
1620 enum gimple_code code
= gimple_code (stmt
);
1622 if (code
== GIMPLE_ASSIGN
)
1623 gimple_assign_set_lhs (stmt
, lhs
);
1624 else if (code
== GIMPLE_CALL
)
1625 gimple_call_set_lhs (stmt
, lhs
);
1631 /* Return a deep copy of statement STMT. All the operands from STMT
1632 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
1633 and VUSE operand arrays are set to empty in the new copy. The new
1634 copy isn't part of any sequence. */
1637 gimple_copy (gimple stmt
)
1639 enum gimple_code code
= gimple_code (stmt
);
1640 unsigned num_ops
= gimple_num_ops (stmt
);
1641 gimple copy
= gimple_alloc (code
, num_ops
);
1644 /* Shallow copy all the fields from STMT. */
1645 memcpy (copy
, stmt
, gimple_size (code
));
1646 gimple_init_singleton (copy
);
1648 /* If STMT has sub-statements, deep-copy them as well. */
1649 if (gimple_has_substatements (stmt
))
1654 switch (gimple_code (stmt
))
1658 gimple_bind bind_stmt
= as_a
<gimple_bind
> (stmt
);
1659 gimple_bind bind_copy
= as_a
<gimple_bind
> (copy
);
1660 new_seq
= gimple_seq_copy (gimple_bind_body (bind_stmt
));
1661 gimple_bind_set_body (bind_copy
, new_seq
);
1662 gimple_bind_set_vars (bind_copy
,
1663 unshare_expr (gimple_bind_vars (bind_stmt
)));
1664 gimple_bind_set_block (bind_copy
, gimple_bind_block (bind_stmt
));
1670 gimple_catch catch_stmt
= as_a
<gimple_catch
> (stmt
);
1671 gimple_catch catch_copy
= as_a
<gimple_catch
> (copy
);
1672 new_seq
= gimple_seq_copy (gimple_catch_handler (catch_stmt
));
1673 gimple_catch_set_handler (catch_copy
, new_seq
);
1674 t
= unshare_expr (gimple_catch_types (catch_stmt
));
1675 gimple_catch_set_types (catch_copy
, t
);
1679 case GIMPLE_EH_FILTER
:
1680 new_seq
= gimple_seq_copy (gimple_eh_filter_failure (stmt
));
1681 gimple_eh_filter_set_failure (copy
, new_seq
);
1682 t
= unshare_expr (gimple_eh_filter_types (stmt
));
1683 gimple_eh_filter_set_types (copy
, t
);
1686 case GIMPLE_EH_ELSE
:
1688 gimple_eh_else eh_else_stmt
= as_a
<gimple_eh_else
> (stmt
);
1689 gimple_eh_else eh_else_copy
= as_a
<gimple_eh_else
> (copy
);
1690 new_seq
= gimple_seq_copy (gimple_eh_else_n_body (eh_else_stmt
));
1691 gimple_eh_else_set_n_body (eh_else_copy
, new_seq
);
1692 new_seq
= gimple_seq_copy (gimple_eh_else_e_body (eh_else_stmt
));
1693 gimple_eh_else_set_e_body (eh_else_copy
, new_seq
);
1698 new_seq
= gimple_seq_copy (gimple_try_eval (stmt
));
1699 gimple_try_set_eval (copy
, new_seq
);
1700 new_seq
= gimple_seq_copy (gimple_try_cleanup (stmt
));
1701 gimple_try_set_cleanup (copy
, new_seq
);
1704 case GIMPLE_OMP_FOR
:
1705 new_seq
= gimple_seq_copy (gimple_omp_for_pre_body (stmt
));
1706 gimple_omp_for_set_pre_body (copy
, new_seq
);
1707 t
= unshare_expr (gimple_omp_for_clauses (stmt
));
1708 gimple_omp_for_set_clauses (copy
, t
);
1710 gimple_statement_omp_for
*omp_for_copy
=
1711 as_a
<gimple_statement_omp_for
*> (copy
);
1712 omp_for_copy
->iter
= ggc_vec_alloc
<gimple_omp_for_iter
>
1713 ( gimple_omp_for_collapse (stmt
));
1715 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1717 gimple_omp_for_set_cond (copy
, i
,
1718 gimple_omp_for_cond (stmt
, i
));
1719 gimple_omp_for_set_index (copy
, i
,
1720 gimple_omp_for_index (stmt
, i
));
1721 t
= unshare_expr (gimple_omp_for_initial (stmt
, i
));
1722 gimple_omp_for_set_initial (copy
, i
, t
);
1723 t
= unshare_expr (gimple_omp_for_final (stmt
, i
));
1724 gimple_omp_for_set_final (copy
, i
, t
);
1725 t
= unshare_expr (gimple_omp_for_incr (stmt
, i
));
1726 gimple_omp_for_set_incr (copy
, i
, t
);
1730 case GIMPLE_OMP_PARALLEL
:
1731 t
= unshare_expr (gimple_omp_parallel_clauses (stmt
));
1732 gimple_omp_parallel_set_clauses (copy
, t
);
1733 t
= unshare_expr (gimple_omp_parallel_child_fn (stmt
));
1734 gimple_omp_parallel_set_child_fn (copy
, t
);
1735 t
= unshare_expr (gimple_omp_parallel_data_arg (stmt
));
1736 gimple_omp_parallel_set_data_arg (copy
, t
);
1739 case GIMPLE_OMP_TASK
:
1740 t
= unshare_expr (gimple_omp_task_clauses (stmt
));
1741 gimple_omp_task_set_clauses (copy
, t
);
1742 t
= unshare_expr (gimple_omp_task_child_fn (stmt
));
1743 gimple_omp_task_set_child_fn (copy
, t
);
1744 t
= unshare_expr (gimple_omp_task_data_arg (stmt
));
1745 gimple_omp_task_set_data_arg (copy
, t
);
1746 t
= unshare_expr (gimple_omp_task_copy_fn (stmt
));
1747 gimple_omp_task_set_copy_fn (copy
, t
);
1748 t
= unshare_expr (gimple_omp_task_arg_size (stmt
));
1749 gimple_omp_task_set_arg_size (copy
, t
);
1750 t
= unshare_expr (gimple_omp_task_arg_align (stmt
));
1751 gimple_omp_task_set_arg_align (copy
, t
);
1754 case GIMPLE_OMP_CRITICAL
:
1755 t
= unshare_expr (gimple_omp_critical_name (stmt
));
1756 gimple_omp_critical_set_name (copy
, t
);
1759 case GIMPLE_OMP_SECTIONS
:
1760 t
= unshare_expr (gimple_omp_sections_clauses (stmt
));
1761 gimple_omp_sections_set_clauses (copy
, t
);
1762 t
= unshare_expr (gimple_omp_sections_control (stmt
));
1763 gimple_omp_sections_set_control (copy
, t
);
1766 case GIMPLE_OMP_SINGLE
:
1767 case GIMPLE_OMP_TARGET
:
1768 case GIMPLE_OMP_TEAMS
:
1769 case GIMPLE_OMP_SECTION
:
1770 case GIMPLE_OMP_MASTER
:
1771 case GIMPLE_OMP_TASKGROUP
:
1772 case GIMPLE_OMP_ORDERED
:
1774 new_seq
= gimple_seq_copy (gimple_omp_body (stmt
));
1775 gimple_omp_set_body (copy
, new_seq
);
1778 case GIMPLE_TRANSACTION
:
1779 new_seq
= gimple_seq_copy (gimple_transaction_body (
1780 as_a
<gimple_transaction
> (stmt
)));
1781 gimple_transaction_set_body (as_a
<gimple_transaction
> (copy
),
1785 case GIMPLE_WITH_CLEANUP_EXPR
:
1786 new_seq
= gimple_seq_copy (gimple_wce_cleanup (stmt
));
1787 gimple_wce_set_cleanup (copy
, new_seq
);
1795 /* Make copy of operands. */
1796 for (i
= 0; i
< num_ops
; i
++)
1797 gimple_set_op (copy
, i
, unshare_expr (gimple_op (stmt
, i
)));
1799 if (gimple_has_mem_ops (stmt
))
1801 gimple_set_vdef (copy
, gimple_vdef (stmt
));
1802 gimple_set_vuse (copy
, gimple_vuse (stmt
));
1805 /* Clear out SSA operand vectors on COPY. */
1806 if (gimple_has_ops (stmt
))
1808 gimple_set_use_ops (copy
, NULL
);
1810 /* SSA operands need to be updated. */
1811 gimple_set_modified (copy
, true);
1818 /* Return true if statement S has side-effects. We consider a
1819 statement to have side effects if:
1821 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
1822 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
1825 gimple_has_side_effects (const_gimple s
)
1827 if (is_gimple_debug (s
))
1830 /* We don't have to scan the arguments to check for
1831 volatile arguments, though, at present, we still
1832 do a scan to check for TREE_SIDE_EFFECTS. */
1833 if (gimple_has_volatile_ops (s
))
1836 if (gimple_code (s
) == GIMPLE_ASM
1837 && gimple_asm_volatile_p (as_a
<const_gimple_asm
> (s
)))
1840 if (is_gimple_call (s
))
1842 int flags
= gimple_call_flags (s
);
1844 /* An infinite loop is considered a side effect. */
1845 if (!(flags
& (ECF_CONST
| ECF_PURE
))
1846 || (flags
& ECF_LOOPING_CONST_OR_PURE
))
1855 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
1856 Return true if S can trap. When INCLUDE_MEM is true, check whether
1857 the memory operations could trap. When INCLUDE_STORES is true and
1858 S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */
1861 gimple_could_trap_p_1 (gimple s
, bool include_mem
, bool include_stores
)
1863 tree t
, div
= NULL_TREE
;
1868 unsigned i
, start
= (is_gimple_assign (s
) && !include_stores
) ? 1 : 0;
1870 for (i
= start
; i
< gimple_num_ops (s
); i
++)
1871 if (tree_could_trap_p (gimple_op (s
, i
)))
1875 switch (gimple_code (s
))
1878 return gimple_asm_volatile_p (as_a
<gimple_asm
> (s
));
1881 t
= gimple_call_fndecl (s
);
1882 /* Assume that calls to weak functions may trap. */
1883 if (!t
|| !DECL_P (t
) || DECL_WEAK (t
))
1888 t
= gimple_expr_type (s
);
1889 op
= gimple_assign_rhs_code (s
);
1890 if (get_gimple_rhs_class (op
) == GIMPLE_BINARY_RHS
)
1891 div
= gimple_assign_rhs2 (s
);
1892 return (operation_could_trap_p (op
, FLOAT_TYPE_P (t
),
1893 (INTEGRAL_TYPE_P (t
)
1894 && TYPE_OVERFLOW_TRAPS (t
)),
1904 /* Return true if statement S can trap. */
1907 gimple_could_trap_p (gimple s
)
1909 return gimple_could_trap_p_1 (s
, true, true);
1912 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
1915 gimple_assign_rhs_could_trap_p (gimple s
)
1917 gcc_assert (is_gimple_assign (s
));
1918 return gimple_could_trap_p_1 (s
, true, false);
1922 /* Print debugging information for gimple stmts generated. */
1925 dump_gimple_statistics (void)
1927 int i
, total_tuples
= 0, total_bytes
= 0;
1929 if (! GATHER_STATISTICS
)
1931 fprintf (stderr
, "No gimple statistics\n");
1935 fprintf (stderr
, "\nGIMPLE statements\n");
1936 fprintf (stderr
, "Kind Stmts Bytes\n");
1937 fprintf (stderr
, "---------------------------------------\n");
1938 for (i
= 0; i
< (int) gimple_alloc_kind_all
; ++i
)
1940 fprintf (stderr
, "%-20s %7d %10d\n", gimple_alloc_kind_names
[i
],
1941 gimple_alloc_counts
[i
], gimple_alloc_sizes
[i
]);
1942 total_tuples
+= gimple_alloc_counts
[i
];
1943 total_bytes
+= gimple_alloc_sizes
[i
];
1945 fprintf (stderr
, "---------------------------------------\n");
1946 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_tuples
, total_bytes
);
1947 fprintf (stderr
, "---------------------------------------\n");
1951 /* Return the number of operands needed on the RHS of a GIMPLE
1952 assignment for an expression with tree code CODE. */
1955 get_gimple_rhs_num_ops (enum tree_code code
)
1957 enum gimple_rhs_class rhs_class
= get_gimple_rhs_class (code
);
1959 if (rhs_class
== GIMPLE_UNARY_RHS
|| rhs_class
== GIMPLE_SINGLE_RHS
)
1961 else if (rhs_class
== GIMPLE_BINARY_RHS
)
1963 else if (rhs_class
== GIMPLE_TERNARY_RHS
)
1969 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
1971 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
1972 : ((TYPE) == tcc_binary \
1973 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
1974 : ((TYPE) == tcc_constant \
1975 || (TYPE) == tcc_declaration \
1976 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
1977 : ((SYM) == TRUTH_AND_EXPR \
1978 || (SYM) == TRUTH_OR_EXPR \
1979 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
1980 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
1981 : ((SYM) == COND_EXPR \
1982 || (SYM) == WIDEN_MULT_PLUS_EXPR \
1983 || (SYM) == WIDEN_MULT_MINUS_EXPR \
1984 || (SYM) == DOT_PROD_EXPR \
1985 || (SYM) == SAD_EXPR \
1986 || (SYM) == REALIGN_LOAD_EXPR \
1987 || (SYM) == VEC_COND_EXPR \
1988 || (SYM) == VEC_PERM_EXPR \
1989 || (SYM) == FMA_EXPR) ? GIMPLE_TERNARY_RHS \
1990 : ((SYM) == CONSTRUCTOR \
1991 || (SYM) == OBJ_TYPE_REF \
1992 || (SYM) == ASSERT_EXPR \
1993 || (SYM) == ADDR_EXPR \
1994 || (SYM) == WITH_SIZE_EXPR \
1995 || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \
1996 : GIMPLE_INVALID_RHS),
1997 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
1999 const unsigned char gimple_rhs_class_table
[] = {
2000 #include "all-tree.def"
2004 #undef END_OF_BASE_TREE_CODES
2006 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
2007 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
2008 we failed to create one. */
2011 canonicalize_cond_expr_cond (tree t
)
2013 /* Strip conversions around boolean operations. */
2014 if (CONVERT_EXPR_P (t
)
2015 && (truth_value_p (TREE_CODE (TREE_OPERAND (t
, 0)))
2016 || TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
2018 t
= TREE_OPERAND (t
, 0);
2020 /* For !x use x == 0. */
2021 if (TREE_CODE (t
) == TRUTH_NOT_EXPR
)
2023 tree top0
= TREE_OPERAND (t
, 0);
2024 t
= build2 (EQ_EXPR
, TREE_TYPE (t
),
2025 top0
, build_int_cst (TREE_TYPE (top0
), 0));
2027 /* For cmp ? 1 : 0 use cmp. */
2028 else if (TREE_CODE (t
) == COND_EXPR
2029 && COMPARISON_CLASS_P (TREE_OPERAND (t
, 0))
2030 && integer_onep (TREE_OPERAND (t
, 1))
2031 && integer_zerop (TREE_OPERAND (t
, 2)))
2033 tree top0
= TREE_OPERAND (t
, 0);
2034 t
= build2 (TREE_CODE (top0
), TREE_TYPE (t
),
2035 TREE_OPERAND (top0
, 0), TREE_OPERAND (top0
, 1));
2037 /* For x ^ y use x != y. */
2038 else if (TREE_CODE (t
) == BIT_XOR_EXPR
)
2039 t
= build2 (NE_EXPR
, TREE_TYPE (t
),
2040 TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
2042 if (is_gimple_condexpr (t
))
2048 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
2049 the positions marked by the set ARGS_TO_SKIP. */
2052 gimple_call_copy_skip_args (gimple stmt
, bitmap args_to_skip
)
2055 int nargs
= gimple_call_num_args (stmt
);
2056 auto_vec
<tree
> vargs (nargs
);
2057 gimple_call new_stmt
;
2059 for (i
= 0; i
< nargs
; i
++)
2060 if (!bitmap_bit_p (args_to_skip
, i
))
2061 vargs
.quick_push (gimple_call_arg (stmt
, i
));
2063 if (gimple_call_internal_p (stmt
))
2064 new_stmt
= gimple_build_call_internal_vec (gimple_call_internal_fn (stmt
),
2067 new_stmt
= gimple_build_call_vec (gimple_call_fn (stmt
), vargs
);
2069 if (gimple_call_lhs (stmt
))
2070 gimple_call_set_lhs (new_stmt
, gimple_call_lhs (stmt
));
2072 gimple_set_vuse (new_stmt
, gimple_vuse (stmt
));
2073 gimple_set_vdef (new_stmt
, gimple_vdef (stmt
));
2075 if (gimple_has_location (stmt
))
2076 gimple_set_location (new_stmt
, gimple_location (stmt
));
2077 gimple_call_copy_flags (new_stmt
, stmt
);
2078 gimple_call_set_chain (new_stmt
, gimple_call_chain (stmt
));
2080 gimple_set_modified (new_stmt
, true);
2087 /* Return true if the field decls F1 and F2 are at the same offset.
2089 This is intended to be used on GIMPLE types only. */
2092 gimple_compare_field_offset (tree f1
, tree f2
)
2094 if (DECL_OFFSET_ALIGN (f1
) == DECL_OFFSET_ALIGN (f2
))
2096 tree offset1
= DECL_FIELD_OFFSET (f1
);
2097 tree offset2
= DECL_FIELD_OFFSET (f2
);
2098 return ((offset1
== offset2
2099 /* Once gimplification is done, self-referential offsets are
2100 instantiated as operand #2 of the COMPONENT_REF built for
2101 each access and reset. Therefore, they are not relevant
2102 anymore and fields are interchangeable provided that they
2103 represent the same access. */
2104 || (TREE_CODE (offset1
) == PLACEHOLDER_EXPR
2105 && TREE_CODE (offset2
) == PLACEHOLDER_EXPR
2106 && (DECL_SIZE (f1
) == DECL_SIZE (f2
)
2107 || (TREE_CODE (DECL_SIZE (f1
)) == PLACEHOLDER_EXPR
2108 && TREE_CODE (DECL_SIZE (f2
)) == PLACEHOLDER_EXPR
)
2109 || operand_equal_p (DECL_SIZE (f1
), DECL_SIZE (f2
), 0))
2110 && DECL_ALIGN (f1
) == DECL_ALIGN (f2
))
2111 || operand_equal_p (offset1
, offset2
, 0))
2112 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1
),
2113 DECL_FIELD_BIT_OFFSET (f2
)));
2116 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
2117 should be, so handle differing ones specially by decomposing
2118 the offset into a byte and bit offset manually. */
2119 if (tree_fits_shwi_p (DECL_FIELD_OFFSET (f1
))
2120 && tree_fits_shwi_p (DECL_FIELD_OFFSET (f2
)))
2122 unsigned HOST_WIDE_INT byte_offset1
, byte_offset2
;
2123 unsigned HOST_WIDE_INT bit_offset1
, bit_offset2
;
2124 bit_offset1
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1
));
2125 byte_offset1
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1
))
2126 + bit_offset1
/ BITS_PER_UNIT
);
2127 bit_offset2
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2
));
2128 byte_offset2
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2
))
2129 + bit_offset2
/ BITS_PER_UNIT
);
2130 if (byte_offset1
!= byte_offset2
)
2132 return bit_offset1
% BITS_PER_UNIT
== bit_offset2
% BITS_PER_UNIT
;
2139 /* Return a type the same as TYPE except unsigned or
2140 signed according to UNSIGNEDP. */
2143 gimple_signed_or_unsigned_type (bool unsignedp
, tree type
)
2147 type1
= TYPE_MAIN_VARIANT (type
);
2148 if (type1
== signed_char_type_node
2149 || type1
== char_type_node
2150 || type1
== unsigned_char_type_node
)
2151 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2152 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
2153 return unsignedp
? unsigned_type_node
: integer_type_node
;
2154 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
2155 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2156 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
2157 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2158 if (type1
== long_long_integer_type_node
2159 || type1
== long_long_unsigned_type_node
)
2161 ? long_long_unsigned_type_node
2162 : long_long_integer_type_node
;
2163 if (int128_integer_type_node
&& (type1
== int128_integer_type_node
|| type1
== int128_unsigned_type_node
))
2165 ? int128_unsigned_type_node
2166 : int128_integer_type_node
;
2167 #if HOST_BITS_PER_WIDE_INT >= 64
2168 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
2169 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2171 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
2172 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2173 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
2174 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2175 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
2176 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2177 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
2178 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2180 #define GIMPLE_FIXED_TYPES(NAME) \
2181 if (type1 == short_ ## NAME ## _type_node \
2182 || type1 == unsigned_short_ ## NAME ## _type_node) \
2183 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
2184 : short_ ## NAME ## _type_node; \
2185 if (type1 == NAME ## _type_node \
2186 || type1 == unsigned_ ## NAME ## _type_node) \
2187 return unsignedp ? unsigned_ ## NAME ## _type_node \
2188 : NAME ## _type_node; \
2189 if (type1 == long_ ## NAME ## _type_node \
2190 || type1 == unsigned_long_ ## NAME ## _type_node) \
2191 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
2192 : long_ ## NAME ## _type_node; \
2193 if (type1 == long_long_ ## NAME ## _type_node \
2194 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
2195 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
2196 : long_long_ ## NAME ## _type_node;
2198 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
2199 if (type1 == NAME ## _type_node \
2200 || type1 == u ## NAME ## _type_node) \
2201 return unsignedp ? u ## NAME ## _type_node \
2202 : NAME ## _type_node;
2204 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
2205 if (type1 == sat_ ## short_ ## NAME ## _type_node \
2206 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
2207 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
2208 : sat_ ## short_ ## NAME ## _type_node; \
2209 if (type1 == sat_ ## NAME ## _type_node \
2210 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
2211 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
2212 : sat_ ## NAME ## _type_node; \
2213 if (type1 == sat_ ## long_ ## NAME ## _type_node \
2214 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
2215 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
2216 : sat_ ## long_ ## NAME ## _type_node; \
2217 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
2218 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
2219 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
2220 : sat_ ## long_long_ ## NAME ## _type_node;
2222 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
2223 if (type1 == sat_ ## NAME ## _type_node \
2224 || type1 == sat_ ## u ## NAME ## _type_node) \
2225 return unsignedp ? sat_ ## u ## NAME ## _type_node \
2226 : sat_ ## NAME ## _type_node;
2228 GIMPLE_FIXED_TYPES (fract
);
2229 GIMPLE_FIXED_TYPES_SAT (fract
);
2230 GIMPLE_FIXED_TYPES (accum
);
2231 GIMPLE_FIXED_TYPES_SAT (accum
);
2233 GIMPLE_FIXED_MODE_TYPES (qq
);
2234 GIMPLE_FIXED_MODE_TYPES (hq
);
2235 GIMPLE_FIXED_MODE_TYPES (sq
);
2236 GIMPLE_FIXED_MODE_TYPES (dq
);
2237 GIMPLE_FIXED_MODE_TYPES (tq
);
2238 GIMPLE_FIXED_MODE_TYPES_SAT (qq
);
2239 GIMPLE_FIXED_MODE_TYPES_SAT (hq
);
2240 GIMPLE_FIXED_MODE_TYPES_SAT (sq
);
2241 GIMPLE_FIXED_MODE_TYPES_SAT (dq
);
2242 GIMPLE_FIXED_MODE_TYPES_SAT (tq
);
2243 GIMPLE_FIXED_MODE_TYPES (ha
);
2244 GIMPLE_FIXED_MODE_TYPES (sa
);
2245 GIMPLE_FIXED_MODE_TYPES (da
);
2246 GIMPLE_FIXED_MODE_TYPES (ta
);
2247 GIMPLE_FIXED_MODE_TYPES_SAT (ha
);
2248 GIMPLE_FIXED_MODE_TYPES_SAT (sa
);
2249 GIMPLE_FIXED_MODE_TYPES_SAT (da
);
2250 GIMPLE_FIXED_MODE_TYPES_SAT (ta
);
2252 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
2253 the precision; they have precision set to match their range, but
2254 may use a wider mode to match an ABI. If we change modes, we may
2255 wind up with bad conversions. For INTEGER_TYPEs in C, must check
2256 the precision as well, so as to yield correct results for
2257 bit-field types. C++ does not have these separate bit-field
2258 types, and producing a signed or unsigned variant of an
2259 ENUMERAL_TYPE may cause other problems as well. */
2260 if (!INTEGRAL_TYPE_P (type
)
2261 || TYPE_UNSIGNED (type
) == unsignedp
)
2264 #define TYPE_OK(node) \
2265 (TYPE_MODE (type) == TYPE_MODE (node) \
2266 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
2267 if (TYPE_OK (signed_char_type_node
))
2268 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
2269 if (TYPE_OK (integer_type_node
))
2270 return unsignedp
? unsigned_type_node
: integer_type_node
;
2271 if (TYPE_OK (short_integer_type_node
))
2272 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
2273 if (TYPE_OK (long_integer_type_node
))
2274 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
2275 if (TYPE_OK (long_long_integer_type_node
))
2277 ? long_long_unsigned_type_node
2278 : long_long_integer_type_node
);
2279 if (int128_integer_type_node
&& TYPE_OK (int128_integer_type_node
))
2281 ? int128_unsigned_type_node
2282 : int128_integer_type_node
);
2284 #if HOST_BITS_PER_WIDE_INT >= 64
2285 if (TYPE_OK (intTI_type_node
))
2286 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
2288 if (TYPE_OK (intDI_type_node
))
2289 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
2290 if (TYPE_OK (intSI_type_node
))
2291 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
2292 if (TYPE_OK (intHI_type_node
))
2293 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
2294 if (TYPE_OK (intQI_type_node
))
2295 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
2297 #undef GIMPLE_FIXED_TYPES
2298 #undef GIMPLE_FIXED_MODE_TYPES
2299 #undef GIMPLE_FIXED_TYPES_SAT
2300 #undef GIMPLE_FIXED_MODE_TYPES_SAT
2303 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
2307 /* Return an unsigned type the same as TYPE in other respects. */
2310 gimple_unsigned_type (tree type
)
2312 return gimple_signed_or_unsigned_type (true, type
);
2316 /* Return a signed type the same as TYPE in other respects. */
2319 gimple_signed_type (tree type
)
2321 return gimple_signed_or_unsigned_type (false, type
);
2325 /* Return the typed-based alias set for T, which may be an expression
2326 or a type. Return -1 if we don't do anything special. */
2329 gimple_get_alias_set (tree t
)
2333 /* Permit type-punning when accessing a union, provided the access
2334 is directly through the union. For example, this code does not
2335 permit taking the address of a union member and then storing
2336 through it. Even the type-punning allowed here is a GCC
2337 extension, albeit a common and useful one; the C standard says
2338 that such accesses have implementation-defined behavior. */
2340 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
2341 u
= TREE_OPERAND (u
, 0))
2342 if (TREE_CODE (u
) == COMPONENT_REF
2343 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
2346 /* That's all the expressions we handle specially. */
2350 /* For convenience, follow the C standard when dealing with
2351 character types. Any object may be accessed via an lvalue that
2352 has character type. */
2353 if (t
== char_type_node
2354 || t
== signed_char_type_node
2355 || t
== unsigned_char_type_node
)
2358 /* Allow aliasing between signed and unsigned variants of the same
2359 type. We treat the signed variant as canonical. */
2360 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
2362 tree t1
= gimple_signed_type (t
);
2364 /* t1 == t can happen for boolean nodes which are always unsigned. */
2366 return get_alias_set (t1
);
2373 /* Helper for gimple_ior_addresses_taken_1. */
2376 gimple_ior_addresses_taken_1 (gimple
, tree addr
, tree
, void *data
)
2378 bitmap addresses_taken
= (bitmap
)data
;
2379 addr
= get_base_address (addr
);
2383 bitmap_set_bit (addresses_taken
, DECL_UID (addr
));
2389 /* Set the bit for the uid of all decls that have their address taken
2390 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
2391 were any in this stmt. */
2394 gimple_ior_addresses_taken (bitmap addresses_taken
, gimple stmt
)
2396 return walk_stmt_load_store_addr_ops (stmt
, addresses_taken
, NULL
, NULL
,
2397 gimple_ior_addresses_taken_1
);
2401 /* Return true if TYPE1 and TYPE2 are compatible enough for builtin
2405 validate_type (tree type1
, tree type2
)
2407 if (INTEGRAL_TYPE_P (type1
)
2408 && INTEGRAL_TYPE_P (type2
))
2410 else if (POINTER_TYPE_P (type1
)
2411 && POINTER_TYPE_P (type2
))
2413 else if (TREE_CODE (type1
)
2414 != TREE_CODE (type2
))
2419 /* Return true when STMTs arguments and return value match those of FNDECL,
2420 a decl of a builtin function. */
2423 gimple_builtin_call_types_compatible_p (const_gimple stmt
, tree fndecl
)
2425 gcc_checking_assert (DECL_BUILT_IN_CLASS (fndecl
) != NOT_BUILT_IN
);
2427 tree ret
= gimple_call_lhs (stmt
);
2429 && !validate_type (TREE_TYPE (ret
), TREE_TYPE (TREE_TYPE (fndecl
))))
2432 tree targs
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
2433 unsigned nargs
= gimple_call_num_args (stmt
);
2434 for (unsigned i
= 0; i
< nargs
; ++i
)
2436 /* Variadic args follow. */
2439 tree arg
= gimple_call_arg (stmt
, i
);
2440 if (!validate_type (TREE_TYPE (arg
), TREE_VALUE (targs
)))
2442 targs
= TREE_CHAIN (targs
);
2444 if (targs
&& !VOID_TYPE_P (TREE_VALUE (targs
)))
2449 /* Return true when STMT is builtins call. */
2452 gimple_call_builtin_p (const_gimple stmt
)
2455 if (is_gimple_call (stmt
)
2456 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
2457 && DECL_BUILT_IN_CLASS (fndecl
) != NOT_BUILT_IN
)
2458 return gimple_builtin_call_types_compatible_p (stmt
, fndecl
);
2462 /* Return true when STMT is builtins call to CLASS. */
2465 gimple_call_builtin_p (const_gimple stmt
, enum built_in_class klass
)
2468 if (is_gimple_call (stmt
)
2469 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
2470 && DECL_BUILT_IN_CLASS (fndecl
) == klass
)
2471 return gimple_builtin_call_types_compatible_p (stmt
, fndecl
);
2475 /* Return true when STMT is builtins call to CODE of CLASS. */
2478 gimple_call_builtin_p (const_gimple stmt
, enum built_in_function code
)
2481 if (is_gimple_call (stmt
)
2482 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL_TREE
2483 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
2484 && DECL_FUNCTION_CODE (fndecl
) == code
)
2485 return gimple_builtin_call_types_compatible_p (stmt
, fndecl
);
2489 /* Return true if STMT clobbers memory. STMT is required to be a
2493 gimple_asm_clobbers_memory_p (const_gimple_asm stmt
)
2497 for (i
= 0; i
< gimple_asm_nclobbers (stmt
); i
++)
2499 tree op
= gimple_asm_clobber_op (stmt
, i
);
2500 if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op
)), "memory") == 0)
2507 /* Dump bitmap SET (assumed to contain VAR_DECLs) to FILE. */
2510 dump_decl_set (FILE *file
, bitmap set
)
2517 fprintf (file
, "{ ");
2519 EXECUTE_IF_SET_IN_BITMAP (set
, 0, i
, bi
)
2521 fprintf (file
, "D.%u", i
);
2522 fprintf (file
, " ");
2525 fprintf (file
, "}");
2528 fprintf (file
, "NIL");
2531 /* Return true when CALL is a call stmt that definitely doesn't
2532 free any memory or makes it unavailable otherwise. */
2534 nonfreeing_call_p (gimple call
)
2536 if (gimple_call_builtin_p (call
, BUILT_IN_NORMAL
)
2537 && gimple_call_flags (call
) & ECF_LEAF
)
2538 switch (DECL_FUNCTION_CODE (gimple_call_fndecl (call
)))
2540 /* Just in case these become ECF_LEAF in the future. */
2542 case BUILT_IN_TM_FREE
:
2543 case BUILT_IN_REALLOC
:
2544 case BUILT_IN_STACK_RESTORE
:
2553 /* Callback for walk_stmt_load_store_ops.
2555 Return TRUE if OP will dereference the tree stored in DATA, FALSE
2558 This routine only makes a superficial check for a dereference. Thus
2559 it must only be used if it is safe to return a false negative. */
2561 check_loadstore (gimple
, tree op
, tree
, void *data
)
2563 if ((TREE_CODE (op
) == MEM_REF
|| TREE_CODE (op
) == TARGET_MEM_REF
)
2564 && operand_equal_p (TREE_OPERAND (op
, 0), (tree
)data
, 0))
2569 /* If OP can be inferred to be non-NULL after STMT executes, return true.
2571 DEREFERENCE is TRUE if we can use a pointer dereference to infer a
2572 non-NULL range, FALSE otherwise.
2574 ATTRIBUTE is TRUE if we can use attributes to infer a non-NULL range
2575 for function arguments and return values. FALSE otherwise. */
2578 infer_nonnull_range (gimple stmt
, tree op
, bool dereference
, bool attribute
)
2580 /* We can only assume that a pointer dereference will yield
2581 non-NULL if -fdelete-null-pointer-checks is enabled. */
2582 if (!flag_delete_null_pointer_checks
2583 || !POINTER_TYPE_P (TREE_TYPE (op
))
2584 || gimple_code (stmt
) == GIMPLE_ASM
)
2588 && walk_stmt_load_store_ops (stmt
, (void *)op
,
2589 check_loadstore
, check_loadstore
))
2593 && is_gimple_call (stmt
) && !gimple_call_internal_p (stmt
))
2595 tree fntype
= gimple_call_fntype (stmt
);
2596 tree attrs
= TYPE_ATTRIBUTES (fntype
);
2597 for (; attrs
; attrs
= TREE_CHAIN (attrs
))
2599 attrs
= lookup_attribute ("nonnull", attrs
);
2601 /* If "nonnull" wasn't specified, we know nothing about
2603 if (attrs
== NULL_TREE
)
2606 /* If "nonnull" applies to all the arguments, then ARG
2607 is non-null if it's in the argument list. */
2608 if (TREE_VALUE (attrs
) == NULL_TREE
)
2610 for (unsigned int i
= 0; i
< gimple_call_num_args (stmt
); i
++)
2612 if (POINTER_TYPE_P (TREE_TYPE (gimple_call_arg (stmt
, i
)))
2613 && operand_equal_p (op
, gimple_call_arg (stmt
, i
), 0))
2619 /* Now see if op appears in the nonnull list. */
2620 for (tree t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
2622 int idx
= TREE_INT_CST_LOW (TREE_VALUE (t
)) - 1;
2623 tree arg
= gimple_call_arg (stmt
, idx
);
2624 if (operand_equal_p (op
, arg
, 0))
2630 /* If this function is marked as returning non-null, then we can
2631 infer OP is non-null if it is used in the return statement. */
2633 && gimple_code (stmt
) == GIMPLE_RETURN
2634 && gimple_return_retval (stmt
)
2635 && operand_equal_p (gimple_return_retval (stmt
), op
, 0)
2636 && lookup_attribute ("returns_nonnull",
2637 TYPE_ATTRIBUTES (TREE_TYPE (current_function_decl
))))
2643 /* Compare two case labels. Because the front end should already have
2644 made sure that case ranges do not overlap, it is enough to only compare
2645 the CASE_LOW values of each case label. */
2648 compare_case_labels (const void *p1
, const void *p2
)
2650 const_tree
const case1
= *(const_tree
const*)p1
;
2651 const_tree
const case2
= *(const_tree
const*)p2
;
2653 /* The 'default' case label always goes first. */
2654 if (!CASE_LOW (case1
))
2656 else if (!CASE_LOW (case2
))
2659 return tree_int_cst_compare (CASE_LOW (case1
), CASE_LOW (case2
));
2662 /* Sort the case labels in LABEL_VEC in place in ascending order. */
2665 sort_case_labels (vec
<tree
> label_vec
)
2667 label_vec
.qsort (compare_case_labels
);
2670 /* Prepare a vector of case labels to be used in a GIMPLE_SWITCH statement.
2672 LABELS is a vector that contains all case labels to look at.
2674 INDEX_TYPE is the type of the switch index expression. Case labels
2675 in LABELS are discarded if their values are not in the value range
2676 covered by INDEX_TYPE. The remaining case label values are folded
2679 If a default case exists in LABELS, it is removed from LABELS and
2680 returned in DEFAULT_CASEP. If no default case exists, but the
2681 case labels already cover the whole range of INDEX_TYPE, a default
2682 case is returned pointing to one of the existing case labels.
2683 Otherwise DEFAULT_CASEP is set to NULL_TREE.
2685 DEFAULT_CASEP may be NULL, in which case the above comment doesn't
2686 apply and no action is taken regardless of whether a default case is
2690 preprocess_case_label_vec_for_gimple (vec
<tree
> labels
,
2692 tree
*default_casep
)
2694 tree min_value
, max_value
;
2695 tree default_case
= NULL_TREE
;
2699 min_value
= TYPE_MIN_VALUE (index_type
);
2700 max_value
= TYPE_MAX_VALUE (index_type
);
2701 while (i
< labels
.length ())
2703 tree elt
= labels
[i
];
2704 tree low
= CASE_LOW (elt
);
2705 tree high
= CASE_HIGH (elt
);
2706 bool remove_element
= FALSE
;
2710 gcc_checking_assert (TREE_CODE (low
) == INTEGER_CST
);
2711 gcc_checking_assert (!high
|| TREE_CODE (high
) == INTEGER_CST
);
2713 /* This is a non-default case label, i.e. it has a value.
2715 See if the case label is reachable within the range of
2716 the index type. Remove out-of-range case values. Turn
2717 case ranges into a canonical form (high > low strictly)
2718 and convert the case label values to the index type.
2720 NB: The type of gimple_switch_index() may be the promoted
2721 type, but the case labels retain the original type. */
2725 /* This is a case range. Discard empty ranges.
2726 If the bounds or the range are equal, turn this
2727 into a simple (one-value) case. */
2728 int cmp
= tree_int_cst_compare (high
, low
);
2730 remove_element
= TRUE
;
2737 /* If the simple case value is unreachable, ignore it. */
2738 if ((TREE_CODE (min_value
) == INTEGER_CST
2739 && tree_int_cst_compare (low
, min_value
) < 0)
2740 || (TREE_CODE (max_value
) == INTEGER_CST
2741 && tree_int_cst_compare (low
, max_value
) > 0))
2742 remove_element
= TRUE
;
2744 low
= fold_convert (index_type
, low
);
2748 /* If the entire case range is unreachable, ignore it. */
2749 if ((TREE_CODE (min_value
) == INTEGER_CST
2750 && tree_int_cst_compare (high
, min_value
) < 0)
2751 || (TREE_CODE (max_value
) == INTEGER_CST
2752 && tree_int_cst_compare (low
, max_value
) > 0))
2753 remove_element
= TRUE
;
2756 /* If the lower bound is less than the index type's
2757 minimum value, truncate the range bounds. */
2758 if (TREE_CODE (min_value
) == INTEGER_CST
2759 && tree_int_cst_compare (low
, min_value
) < 0)
2761 low
= fold_convert (index_type
, low
);
2763 /* If the upper bound is greater than the index type's
2764 maximum value, truncate the range bounds. */
2765 if (TREE_CODE (max_value
) == INTEGER_CST
2766 && tree_int_cst_compare (high
, max_value
) > 0)
2768 high
= fold_convert (index_type
, high
);
2770 /* We may have folded a case range to a one-value case. */
2771 if (tree_int_cst_equal (low
, high
))
2776 CASE_LOW (elt
) = low
;
2777 CASE_HIGH (elt
) = high
;
2781 gcc_assert (!default_case
);
2783 /* The default case must be passed separately to the
2784 gimple_build_switch routine. But if DEFAULT_CASEP
2785 is NULL, we do not remove the default case (it would
2786 be completely lost). */
2788 remove_element
= TRUE
;
2792 labels
.ordered_remove (i
);
2798 if (!labels
.is_empty ())
2799 sort_case_labels (labels
);
2801 if (default_casep
&& !default_case
)
2803 /* If the switch has no default label, add one, so that we jump
2804 around the switch body. If the labels already cover the whole
2805 range of the switch index_type, add the default label pointing
2806 to one of the existing labels. */
2808 && TYPE_MIN_VALUE (index_type
)
2809 && TYPE_MAX_VALUE (index_type
)
2810 && tree_int_cst_equal (CASE_LOW (labels
[0]),
2811 TYPE_MIN_VALUE (index_type
)))
2813 tree low
, high
= CASE_HIGH (labels
[len
- 1]);
2815 high
= CASE_LOW (labels
[len
- 1]);
2816 if (tree_int_cst_equal (high
, TYPE_MAX_VALUE (index_type
)))
2818 for (i
= 1; i
< len
; i
++)
2820 high
= CASE_LOW (labels
[i
]);
2821 low
= CASE_HIGH (labels
[i
- 1]);
2823 low
= CASE_LOW (labels
[i
- 1]);
2824 if (wi::add (low
, 1) != high
)
2829 tree label
= CASE_LABEL (labels
[0]);
2830 default_case
= build_case_label (NULL_TREE
, NULL_TREE
,
2838 *default_casep
= default_case
;
2841 /* Set the location of all statements in SEQ to LOC. */
2844 gimple_seq_set_location (gimple_seq seq
, location_t loc
)
2846 for (gimple_stmt_iterator i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
2847 gimple_set_location (gsi_stmt (i
), loc
);