1 /* Gimple IR support functions.
3 Copyright 2007, 2008, 2009, 2010, 2011 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"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
32 #include "diagnostic.h"
33 #include "tree-flow.h"
34 #include "value-prof.h"
38 #include "langhooks.h"
40 /* Global canonical type table. */
41 static GTY((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
42 htab_t gimple_canonical_types
;
43 static GTY((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map
)))
44 htab_t canonical_type_hash_cache
;
46 /* All the tuples have their operand vector (if present) at the very bottom
47 of the structure. Therefore, the offset required to find the
48 operands vector the size of the structure minus the size of the 1
49 element tree array at the end (see gimple_ops). */
50 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \
51 (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0),
52 EXPORTED_CONST
size_t gimple_ops_offset_
[] = {
53 #include "gsstruct.def"
57 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof(struct STRUCT),
58 static const size_t gsstruct_code_size
[] = {
59 #include "gsstruct.def"
63 #define DEFGSCODE(SYM, NAME, GSSCODE) NAME,
64 const char *const gimple_code_name
[] = {
69 #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE,
70 EXPORTED_CONST
enum gimple_statement_structure_enum gss_for_code_
[] = {
77 int gimple_alloc_counts
[(int) gimple_alloc_kind_all
];
78 int gimple_alloc_sizes
[(int) gimple_alloc_kind_all
];
80 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
81 static const char * const gimple_alloc_kind_names
[] = {
88 /* Private API manipulation functions shared only with some
90 extern void gimple_set_stored_syms (gimple
, bitmap
, bitmap_obstack
*);
91 extern void gimple_set_loaded_syms (gimple
, bitmap
, bitmap_obstack
*);
93 /* Gimple tuple constructors.
94 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
95 be passed a NULL to start with an empty sequence. */
97 /* Set the code for statement G to CODE. */
100 gimple_set_code (gimple g
, enum gimple_code code
)
102 g
->gsbase
.code
= code
;
105 /* Return the number of bytes needed to hold a GIMPLE statement with
109 gimple_size (enum gimple_code code
)
111 return gsstruct_code_size
[gss_for_code (code
)];
114 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
118 gimple_alloc_stat (enum gimple_code code
, unsigned num_ops MEM_STAT_DECL
)
123 size
= gimple_size (code
);
125 size
+= sizeof (tree
) * (num_ops
- 1);
127 if (GATHER_STATISTICS
)
129 enum gimple_alloc_kind kind
= gimple_alloc_kind (code
);
130 gimple_alloc_counts
[(int) kind
]++;
131 gimple_alloc_sizes
[(int) kind
] += size
;
134 stmt
= ggc_alloc_cleared_gimple_statement_d_stat (size PASS_MEM_STAT
);
135 gimple_set_code (stmt
, code
);
136 gimple_set_num_ops (stmt
, num_ops
);
138 /* Do not call gimple_set_modified here as it has other side
139 effects and this tuple is still not completely built. */
140 stmt
->gsbase
.modified
= 1;
141 gimple_init_singleton (stmt
);
146 /* Set SUBCODE to be the code of the expression computed by statement G. */
149 gimple_set_subcode (gimple g
, unsigned subcode
)
151 /* We only have 16 bits for the RHS code. Assert that we are not
153 gcc_assert (subcode
< (1 << 16));
154 g
->gsbase
.subcode
= subcode
;
159 /* Build a tuple with operands. CODE is the statement to build (which
160 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the sub-code
161 for the new tuple. NUM_OPS is the number of operands to allocate. */
163 #define gimple_build_with_ops(c, s, n) \
164 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
167 gimple_build_with_ops_stat (enum gimple_code code
, unsigned subcode
,
168 unsigned num_ops MEM_STAT_DECL
)
170 gimple s
= gimple_alloc_stat (code
, num_ops PASS_MEM_STAT
);
171 gimple_set_subcode (s
, subcode
);
177 /* Build a GIMPLE_RETURN statement returning RETVAL. */
180 gimple_build_return (tree retval
)
182 gimple s
= gimple_build_with_ops (GIMPLE_RETURN
, ERROR_MARK
, 1);
184 gimple_return_set_retval (s
, retval
);
188 /* Reset alias information on call S. */
191 gimple_call_reset_alias_info (gimple s
)
193 if (gimple_call_flags (s
) & ECF_CONST
)
194 memset (gimple_call_use_set (s
), 0, sizeof (struct pt_solution
));
196 pt_solution_reset (gimple_call_use_set (s
));
197 if (gimple_call_flags (s
) & (ECF_CONST
|ECF_PURE
|ECF_NOVOPS
))
198 memset (gimple_call_clobber_set (s
), 0, sizeof (struct pt_solution
));
200 pt_solution_reset (gimple_call_clobber_set (s
));
203 /* Helper for gimple_build_call, gimple_build_call_valist,
204 gimple_build_call_vec and gimple_build_call_from_tree. Build the basic
205 components of a GIMPLE_CALL statement to function FN with NARGS
209 gimple_build_call_1 (tree fn
, unsigned nargs
)
211 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
212 if (TREE_CODE (fn
) == FUNCTION_DECL
)
213 fn
= build_fold_addr_expr (fn
);
214 gimple_set_op (s
, 1, fn
);
215 gimple_call_set_fntype (s
, TREE_TYPE (TREE_TYPE (fn
)));
216 gimple_call_reset_alias_info (s
);
221 /* Build a GIMPLE_CALL statement to function FN with the arguments
222 specified in vector ARGS. */
225 gimple_build_call_vec (tree fn
, VEC(tree
, heap
) *args
)
228 unsigned nargs
= VEC_length (tree
, args
);
229 gimple call
= gimple_build_call_1 (fn
, nargs
);
231 for (i
= 0; i
< nargs
; i
++)
232 gimple_call_set_arg (call
, i
, VEC_index (tree
, args
, i
));
238 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
239 arguments. The ... are the arguments. */
242 gimple_build_call (tree fn
, unsigned nargs
, ...)
248 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
250 call
= gimple_build_call_1 (fn
, nargs
);
252 va_start (ap
, nargs
);
253 for (i
= 0; i
< nargs
; i
++)
254 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
261 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
262 arguments. AP contains the arguments. */
265 gimple_build_call_valist (tree fn
, unsigned nargs
, va_list ap
)
270 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
272 call
= gimple_build_call_1 (fn
, nargs
);
274 for (i
= 0; i
< nargs
; i
++)
275 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
281 /* Helper for gimple_build_call_internal and gimple_build_call_internal_vec.
282 Build the basic components of a GIMPLE_CALL statement to internal
283 function FN with NARGS arguments. */
286 gimple_build_call_internal_1 (enum internal_fn fn
, unsigned nargs
)
288 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
289 s
->gsbase
.subcode
|= GF_CALL_INTERNAL
;
290 gimple_call_set_internal_fn (s
, fn
);
291 gimple_call_reset_alias_info (s
);
296 /* Build a GIMPLE_CALL statement to internal function FN. NARGS is
297 the number of arguments. The ... are the arguments. */
300 gimple_build_call_internal (enum internal_fn fn
, unsigned nargs
, ...)
306 call
= gimple_build_call_internal_1 (fn
, nargs
);
307 va_start (ap
, nargs
);
308 for (i
= 0; i
< nargs
; i
++)
309 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
316 /* Build a GIMPLE_CALL statement to internal function FN with the arguments
317 specified in vector ARGS. */
320 gimple_build_call_internal_vec (enum internal_fn fn
, VEC(tree
, heap
) *args
)
325 nargs
= VEC_length (tree
, args
);
326 call
= gimple_build_call_internal_1 (fn
, nargs
);
327 for (i
= 0; i
< nargs
; i
++)
328 gimple_call_set_arg (call
, i
, VEC_index (tree
, args
, i
));
334 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
335 assumed to be in GIMPLE form already. Minimal checking is done of
339 gimple_build_call_from_tree (tree t
)
343 tree fndecl
= get_callee_fndecl (t
);
345 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
347 nargs
= call_expr_nargs (t
);
348 call
= gimple_build_call_1 (fndecl
? fndecl
: CALL_EXPR_FN (t
), nargs
);
350 for (i
= 0; i
< nargs
; i
++)
351 gimple_call_set_arg (call
, i
, CALL_EXPR_ARG (t
, i
));
353 gimple_set_block (call
, TREE_BLOCK (t
));
355 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
356 gimple_call_set_chain (call
, CALL_EXPR_STATIC_CHAIN (t
));
357 gimple_call_set_tail (call
, CALL_EXPR_TAILCALL (t
));
358 gimple_call_set_return_slot_opt (call
, CALL_EXPR_RETURN_SLOT_OPT (t
));
360 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
361 && (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
362 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA_WITH_ALIGN
))
363 gimple_call_set_alloca_for_var (call
, CALL_ALLOCA_FOR_VAR_P (t
));
365 gimple_call_set_from_thunk (call
, CALL_FROM_THUNK_P (t
));
366 gimple_call_set_va_arg_pack (call
, CALL_EXPR_VA_ARG_PACK (t
));
367 gimple_call_set_nothrow (call
, TREE_NOTHROW (t
));
368 gimple_set_no_warning (call
, TREE_NO_WARNING (t
));
374 /* Extract the operands and code for expression EXPR into *SUBCODE_P,
375 *OP1_P, *OP2_P and *OP3_P respectively. */
378 extract_ops_from_tree_1 (tree expr
, enum tree_code
*subcode_p
, tree
*op1_p
,
379 tree
*op2_p
, tree
*op3_p
)
381 enum gimple_rhs_class grhs_class
;
383 *subcode_p
= TREE_CODE (expr
);
384 grhs_class
= get_gimple_rhs_class (*subcode_p
);
386 if (grhs_class
== GIMPLE_TERNARY_RHS
)
388 *op1_p
= TREE_OPERAND (expr
, 0);
389 *op2_p
= TREE_OPERAND (expr
, 1);
390 *op3_p
= TREE_OPERAND (expr
, 2);
392 else if (grhs_class
== GIMPLE_BINARY_RHS
)
394 *op1_p
= TREE_OPERAND (expr
, 0);
395 *op2_p
= TREE_OPERAND (expr
, 1);
398 else if (grhs_class
== GIMPLE_UNARY_RHS
)
400 *op1_p
= TREE_OPERAND (expr
, 0);
404 else if (grhs_class
== GIMPLE_SINGLE_RHS
)
415 /* Build a GIMPLE_ASSIGN statement.
417 LHS of the assignment.
418 RHS of the assignment which can be unary or binary. */
421 gimple_build_assign_stat (tree lhs
, tree rhs MEM_STAT_DECL
)
423 enum tree_code subcode
;
426 extract_ops_from_tree_1 (rhs
, &subcode
, &op1
, &op2
, &op3
);
427 return gimple_build_assign_with_ops_stat (subcode
, lhs
, op1
, op2
, op3
432 /* Build a GIMPLE_ASSIGN statement with sub-code SUBCODE and operands
433 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
434 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
437 gimple_build_assign_with_ops_stat (enum tree_code subcode
, tree lhs
, tree op1
,
438 tree op2
, tree op3 MEM_STAT_DECL
)
443 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
445 num_ops
= get_gimple_rhs_num_ops (subcode
) + 1;
447 p
= gimple_build_with_ops_stat (GIMPLE_ASSIGN
, (unsigned)subcode
, num_ops
449 gimple_assign_set_lhs (p
, lhs
);
450 gimple_assign_set_rhs1 (p
, op1
);
453 gcc_assert (num_ops
> 2);
454 gimple_assign_set_rhs2 (p
, op2
);
459 gcc_assert (num_ops
> 3);
460 gimple_assign_set_rhs3 (p
, op3
);
467 /* Build a new GIMPLE_ASSIGN tuple and append it to the end of *SEQ_P.
469 DST/SRC are the destination and source respectively. You can pass
470 ungimplified trees in DST or SRC, in which case they will be
471 converted to a gimple operand if necessary.
473 This function returns the newly created GIMPLE_ASSIGN tuple. */
476 gimplify_assign (tree dst
, tree src
, gimple_seq
*seq_p
)
478 tree t
= build2 (MODIFY_EXPR
, TREE_TYPE (dst
), dst
, src
);
479 gimplify_and_add (t
, seq_p
);
481 return gimple_seq_last_stmt (*seq_p
);
485 /* Build a GIMPLE_COND statement.
487 PRED is the condition used to compare LHS and the RHS.
488 T_LABEL is the label to jump to if the condition is true.
489 F_LABEL is the label to jump to otherwise. */
492 gimple_build_cond (enum tree_code pred_code
, tree lhs
, tree rhs
,
493 tree t_label
, tree f_label
)
497 gcc_assert (TREE_CODE_CLASS (pred_code
) == tcc_comparison
);
498 p
= gimple_build_with_ops (GIMPLE_COND
, pred_code
, 4);
499 gimple_cond_set_lhs (p
, lhs
);
500 gimple_cond_set_rhs (p
, rhs
);
501 gimple_cond_set_true_label (p
, t_label
);
502 gimple_cond_set_false_label (p
, f_label
);
507 /* Extract operands for a GIMPLE_COND statement out of COND_EXPR tree COND. */
510 gimple_cond_get_ops_from_tree (tree cond
, enum tree_code
*code_p
,
511 tree
*lhs_p
, tree
*rhs_p
)
513 gcc_assert (TREE_CODE_CLASS (TREE_CODE (cond
)) == tcc_comparison
514 || TREE_CODE (cond
) == TRUTH_NOT_EXPR
515 || is_gimple_min_invariant (cond
)
516 || SSA_VAR_P (cond
));
518 extract_ops_from_tree (cond
, code_p
, lhs_p
, rhs_p
);
520 /* Canonicalize conditionals of the form 'if (!VAL)'. */
521 if (*code_p
== TRUTH_NOT_EXPR
)
524 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
525 *rhs_p
= build_zero_cst (TREE_TYPE (*lhs_p
));
527 /* Canonicalize conditionals of the form 'if (VAL)' */
528 else if (TREE_CODE_CLASS (*code_p
) != tcc_comparison
)
531 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
532 *rhs_p
= build_zero_cst (TREE_TYPE (*lhs_p
));
537 /* Build a GIMPLE_COND statement from the conditional expression tree
538 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
541 gimple_build_cond_from_tree (tree cond
, tree t_label
, tree f_label
)
546 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
547 return gimple_build_cond (code
, lhs
, rhs
, t_label
, f_label
);
550 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
551 boolean expression tree COND. */
554 gimple_cond_set_condition_from_tree (gimple stmt
, tree cond
)
559 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
560 gimple_cond_set_condition (stmt
, code
, lhs
, rhs
);
563 /* Build a GIMPLE_LABEL statement for LABEL. */
566 gimple_build_label (tree label
)
568 gimple p
= gimple_build_with_ops (GIMPLE_LABEL
, ERROR_MARK
, 1);
569 gimple_label_set_label (p
, label
);
573 /* Build a GIMPLE_GOTO statement to label DEST. */
576 gimple_build_goto (tree dest
)
578 gimple p
= gimple_build_with_ops (GIMPLE_GOTO
, ERROR_MARK
, 1);
579 gimple_goto_set_dest (p
, dest
);
584 /* Build a GIMPLE_NOP statement. */
587 gimple_build_nop (void)
589 return gimple_alloc (GIMPLE_NOP
, 0);
593 /* Build a GIMPLE_BIND statement.
594 VARS are the variables in BODY.
595 BLOCK is the containing block. */
598 gimple_build_bind (tree vars
, gimple_seq body
, tree block
)
600 gimple p
= gimple_alloc (GIMPLE_BIND
, 0);
601 gimple_bind_set_vars (p
, vars
);
603 gimple_bind_set_body (p
, body
);
605 gimple_bind_set_block (p
, block
);
609 /* Helper function to set the simple fields of a asm stmt.
611 STRING is a pointer to a string that is the asm blocks assembly code.
612 NINPUT is the number of register inputs.
613 NOUTPUT is the number of register outputs.
614 NCLOBBERS is the number of clobbered registers.
618 gimple_build_asm_1 (const char *string
, unsigned ninputs
, unsigned noutputs
,
619 unsigned nclobbers
, unsigned nlabels
)
622 int size
= strlen (string
);
624 /* ASMs with labels cannot have outputs. This should have been
625 enforced by the front end. */
626 gcc_assert (nlabels
== 0 || noutputs
== 0);
628 p
= gimple_build_with_ops (GIMPLE_ASM
, ERROR_MARK
,
629 ninputs
+ noutputs
+ nclobbers
+ nlabels
);
631 p
->gimple_asm
.ni
= ninputs
;
632 p
->gimple_asm
.no
= noutputs
;
633 p
->gimple_asm
.nc
= nclobbers
;
634 p
->gimple_asm
.nl
= nlabels
;
635 p
->gimple_asm
.string
= ggc_alloc_string (string
, size
);
637 if (GATHER_STATISTICS
)
638 gimple_alloc_sizes
[(int) gimple_alloc_kind (GIMPLE_ASM
)] += size
;
643 /* Build a GIMPLE_ASM statement.
645 STRING is the assembly code.
646 NINPUT is the number of register inputs.
647 NOUTPUT is the number of register outputs.
648 NCLOBBERS is the number of clobbered registers.
649 INPUTS is a vector of the input register parameters.
650 OUTPUTS is a vector of the output register parameters.
651 CLOBBERS is a vector of the clobbered register parameters.
652 LABELS is a vector of destination labels. */
655 gimple_build_asm_vec (const char *string
, VEC(tree
,gc
)* inputs
,
656 VEC(tree
,gc
)* outputs
, VEC(tree
,gc
)* clobbers
,
657 VEC(tree
,gc
)* labels
)
662 p
= gimple_build_asm_1 (string
,
663 VEC_length (tree
, inputs
),
664 VEC_length (tree
, outputs
),
665 VEC_length (tree
, clobbers
),
666 VEC_length (tree
, labels
));
668 for (i
= 0; i
< VEC_length (tree
, inputs
); i
++)
669 gimple_asm_set_input_op (p
, i
, VEC_index (tree
, inputs
, i
));
671 for (i
= 0; i
< VEC_length (tree
, outputs
); i
++)
672 gimple_asm_set_output_op (p
, i
, VEC_index (tree
, outputs
, i
));
674 for (i
= 0; i
< VEC_length (tree
, clobbers
); i
++)
675 gimple_asm_set_clobber_op (p
, i
, VEC_index (tree
, clobbers
, i
));
677 for (i
= 0; i
< VEC_length (tree
, labels
); i
++)
678 gimple_asm_set_label_op (p
, i
, VEC_index (tree
, labels
, i
));
683 /* Build a GIMPLE_CATCH statement.
685 TYPES are the catch types.
686 HANDLER is the exception handler. */
689 gimple_build_catch (tree types
, gimple_seq handler
)
691 gimple p
= gimple_alloc (GIMPLE_CATCH
, 0);
692 gimple_catch_set_types (p
, types
);
694 gimple_catch_set_handler (p
, handler
);
699 /* Build a GIMPLE_EH_FILTER statement.
701 TYPES are the filter's types.
702 FAILURE is the filter's failure action. */
705 gimple_build_eh_filter (tree types
, gimple_seq failure
)
707 gimple p
= gimple_alloc (GIMPLE_EH_FILTER
, 0);
708 gimple_eh_filter_set_types (p
, types
);
710 gimple_eh_filter_set_failure (p
, failure
);
715 /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */
718 gimple_build_eh_must_not_throw (tree decl
)
720 gimple p
= gimple_alloc (GIMPLE_EH_MUST_NOT_THROW
, 0);
722 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
723 gcc_assert (flags_from_decl_or_type (decl
) & ECF_NORETURN
);
724 gimple_eh_must_not_throw_set_fndecl (p
, decl
);
729 /* Build a GIMPLE_EH_ELSE statement. */
732 gimple_build_eh_else (gimple_seq n_body
, gimple_seq e_body
)
734 gimple p
= gimple_alloc (GIMPLE_EH_ELSE
, 0);
735 gimple_eh_else_set_n_body (p
, n_body
);
736 gimple_eh_else_set_e_body (p
, e_body
);
740 /* Build a GIMPLE_TRY statement.
742 EVAL is the expression to evaluate.
743 CLEANUP is the cleanup expression.
744 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
745 whether this is a try/catch or a try/finally respectively. */
748 gimple_build_try (gimple_seq eval
, gimple_seq cleanup
,
749 enum gimple_try_flags kind
)
753 gcc_assert (kind
== GIMPLE_TRY_CATCH
|| kind
== GIMPLE_TRY_FINALLY
);
754 p
= gimple_alloc (GIMPLE_TRY
, 0);
755 gimple_set_subcode (p
, kind
);
757 gimple_try_set_eval (p
, eval
);
759 gimple_try_set_cleanup (p
, cleanup
);
764 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
766 CLEANUP is the cleanup expression. */
769 gimple_build_wce (gimple_seq cleanup
)
771 gimple p
= gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR
, 0);
773 gimple_wce_set_cleanup (p
, cleanup
);
779 /* Build a GIMPLE_RESX statement. */
782 gimple_build_resx (int region
)
784 gimple p
= gimple_build_with_ops (GIMPLE_RESX
, ERROR_MARK
, 0);
785 p
->gimple_eh_ctrl
.region
= region
;
790 /* The helper for constructing a gimple switch statement.
791 INDEX is the switch's index.
792 NLABELS is the number of labels in the switch excluding the default.
793 DEFAULT_LABEL is the default label for the switch statement. */
796 gimple_build_switch_nlabels (unsigned nlabels
, tree index
, tree default_label
)
798 /* nlabels + 1 default label + 1 index. */
799 gcc_checking_assert (default_label
);
800 gimple p
= gimple_build_with_ops (GIMPLE_SWITCH
, ERROR_MARK
,
802 gimple_switch_set_index (p
, index
);
803 gimple_switch_set_default_label (p
, default_label
);
807 /* Build a GIMPLE_SWITCH statement.
809 INDEX is the switch's index.
810 DEFAULT_LABEL is the default label
811 ARGS is a vector of labels excluding the default. */
814 gimple_build_switch (tree index
, tree default_label
, VEC(tree
, heap
) *args
)
816 unsigned i
, nlabels
= VEC_length (tree
, args
);
818 gimple p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
820 /* Copy the labels from the vector to the switch statement. */
821 for (i
= 0; i
< nlabels
; i
++)
822 gimple_switch_set_label (p
, i
+ 1, VEC_index (tree
, args
, i
));
827 /* Build a GIMPLE_EH_DISPATCH statement. */
830 gimple_build_eh_dispatch (int region
)
832 gimple p
= gimple_build_with_ops (GIMPLE_EH_DISPATCH
, ERROR_MARK
, 0);
833 p
->gimple_eh_ctrl
.region
= region
;
837 /* Build a new GIMPLE_DEBUG_BIND statement.
839 VAR is bound to VALUE; block and location are taken from STMT. */
842 gimple_build_debug_bind_stat (tree var
, tree value
, gimple stmt MEM_STAT_DECL
)
844 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
845 (unsigned)GIMPLE_DEBUG_BIND
, 2
848 gimple_debug_bind_set_var (p
, var
);
849 gimple_debug_bind_set_value (p
, value
);
852 gimple_set_block (p
, gimple_block (stmt
));
853 gimple_set_location (p
, gimple_location (stmt
));
860 /* Build a new GIMPLE_DEBUG_SOURCE_BIND statement.
862 VAR is bound to VALUE; block and location are taken from STMT. */
865 gimple_build_debug_source_bind_stat (tree var
, tree value
,
866 gimple stmt MEM_STAT_DECL
)
868 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
869 (unsigned)GIMPLE_DEBUG_SOURCE_BIND
, 2
872 gimple_debug_source_bind_set_var (p
, var
);
873 gimple_debug_source_bind_set_value (p
, value
);
876 gimple_set_block (p
, gimple_block (stmt
));
877 gimple_set_location (p
, gimple_location (stmt
));
884 /* Build a GIMPLE_OMP_CRITICAL statement.
886 BODY is the sequence of statements for which only one thread can execute.
887 NAME is optional identifier for this critical block. */
890 gimple_build_omp_critical (gimple_seq body
, tree name
)
892 gimple p
= gimple_alloc (GIMPLE_OMP_CRITICAL
, 0);
893 gimple_omp_critical_set_name (p
, name
);
895 gimple_omp_set_body (p
, body
);
900 /* Build a GIMPLE_OMP_FOR statement.
902 BODY is sequence of statements inside the for loop.
903 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
904 lastprivate, reductions, ordered, schedule, and nowait.
905 COLLAPSE is the collapse count.
906 PRE_BODY is the sequence of statements that are loop invariant. */
909 gimple_build_omp_for (gimple_seq body
, tree clauses
, size_t collapse
,
912 gimple p
= gimple_alloc (GIMPLE_OMP_FOR
, 0);
914 gimple_omp_set_body (p
, body
);
915 gimple_omp_for_set_clauses (p
, clauses
);
916 p
->gimple_omp_for
.collapse
= collapse
;
917 p
->gimple_omp_for
.iter
918 = ggc_alloc_cleared_vec_gimple_omp_for_iter (collapse
);
920 gimple_omp_for_set_pre_body (p
, pre_body
);
926 /* Build a GIMPLE_OMP_PARALLEL statement.
928 BODY is sequence of statements which are executed in parallel.
929 CLAUSES, are the OMP parallel construct's clauses.
930 CHILD_FN is the function created for the parallel threads to execute.
931 DATA_ARG are the shared data argument(s). */
934 gimple_build_omp_parallel (gimple_seq body
, tree clauses
, tree child_fn
,
937 gimple p
= gimple_alloc (GIMPLE_OMP_PARALLEL
, 0);
939 gimple_omp_set_body (p
, body
);
940 gimple_omp_parallel_set_clauses (p
, clauses
);
941 gimple_omp_parallel_set_child_fn (p
, child_fn
);
942 gimple_omp_parallel_set_data_arg (p
, data_arg
);
948 /* Build a GIMPLE_OMP_TASK statement.
950 BODY is sequence of statements which are executed by the explicit task.
951 CLAUSES, are the OMP parallel construct's clauses.
952 CHILD_FN is the function created for the parallel threads to execute.
953 DATA_ARG are the shared data argument(s).
954 COPY_FN is the optional function for firstprivate initialization.
955 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
958 gimple_build_omp_task (gimple_seq body
, tree clauses
, tree child_fn
,
959 tree data_arg
, tree copy_fn
, tree arg_size
,
962 gimple p
= gimple_alloc (GIMPLE_OMP_TASK
, 0);
964 gimple_omp_set_body (p
, body
);
965 gimple_omp_task_set_clauses (p
, clauses
);
966 gimple_omp_task_set_child_fn (p
, child_fn
);
967 gimple_omp_task_set_data_arg (p
, data_arg
);
968 gimple_omp_task_set_copy_fn (p
, copy_fn
);
969 gimple_omp_task_set_arg_size (p
, arg_size
);
970 gimple_omp_task_set_arg_align (p
, arg_align
);
976 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
978 BODY is the sequence of statements in the section. */
981 gimple_build_omp_section (gimple_seq body
)
983 gimple p
= gimple_alloc (GIMPLE_OMP_SECTION
, 0);
985 gimple_omp_set_body (p
, body
);
991 /* Build a GIMPLE_OMP_MASTER statement.
993 BODY is the sequence of statements to be executed by just the master. */
996 gimple_build_omp_master (gimple_seq body
)
998 gimple p
= gimple_alloc (GIMPLE_OMP_MASTER
, 0);
1000 gimple_omp_set_body (p
, body
);
1006 /* Build a GIMPLE_OMP_CONTINUE statement.
1008 CONTROL_DEF is the definition of the control variable.
1009 CONTROL_USE is the use of the control variable. */
1012 gimple_build_omp_continue (tree control_def
, tree control_use
)
1014 gimple p
= gimple_alloc (GIMPLE_OMP_CONTINUE
, 0);
1015 gimple_omp_continue_set_control_def (p
, control_def
);
1016 gimple_omp_continue_set_control_use (p
, control_use
);
1020 /* Build a GIMPLE_OMP_ORDERED statement.
1022 BODY is the sequence of statements inside a loop that will executed in
1026 gimple_build_omp_ordered (gimple_seq body
)
1028 gimple p
= gimple_alloc (GIMPLE_OMP_ORDERED
, 0);
1030 gimple_omp_set_body (p
, body
);
1036 /* Build a GIMPLE_OMP_RETURN statement.
1037 WAIT_P is true if this is a non-waiting return. */
1040 gimple_build_omp_return (bool wait_p
)
1042 gimple p
= gimple_alloc (GIMPLE_OMP_RETURN
, 0);
1044 gimple_omp_return_set_nowait (p
);
1050 /* Build a GIMPLE_OMP_SECTIONS statement.
1052 BODY is a sequence of section statements.
1053 CLAUSES are any of the OMP sections contsruct's clauses: private,
1054 firstprivate, lastprivate, reduction, and nowait. */
1057 gimple_build_omp_sections (gimple_seq body
, tree clauses
)
1059 gimple p
= gimple_alloc (GIMPLE_OMP_SECTIONS
, 0);
1061 gimple_omp_set_body (p
, body
);
1062 gimple_omp_sections_set_clauses (p
, clauses
);
1068 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
1071 gimple_build_omp_sections_switch (void)
1073 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH
, 0);
1077 /* Build a GIMPLE_OMP_SINGLE statement.
1079 BODY is the sequence of statements that will be executed once.
1080 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
1081 copyprivate, nowait. */
1084 gimple_build_omp_single (gimple_seq body
, tree clauses
)
1086 gimple p
= gimple_alloc (GIMPLE_OMP_SINGLE
, 0);
1088 gimple_omp_set_body (p
, body
);
1089 gimple_omp_single_set_clauses (p
, clauses
);
1095 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1098 gimple_build_omp_atomic_load (tree lhs
, tree rhs
)
1100 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD
, 0);
1101 gimple_omp_atomic_load_set_lhs (p
, lhs
);
1102 gimple_omp_atomic_load_set_rhs (p
, rhs
);
1106 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1108 VAL is the value we are storing. */
1111 gimple_build_omp_atomic_store (tree val
)
1113 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_STORE
, 0);
1114 gimple_omp_atomic_store_set_val (p
, val
);
1118 /* Build a GIMPLE_TRANSACTION statement. */
1121 gimple_build_transaction (gimple_seq body
, tree label
)
1123 gimple p
= gimple_alloc (GIMPLE_TRANSACTION
, 0);
1124 gimple_transaction_set_body (p
, body
);
1125 gimple_transaction_set_label (p
, label
);
1129 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1130 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1133 gimple_build_predict (enum br_predictor predictor
, enum prediction outcome
)
1135 gimple p
= gimple_alloc (GIMPLE_PREDICT
, 0);
1136 /* Ensure all the predictors fit into the lower bits of the subcode. */
1137 gcc_assert ((int) END_PREDICTORS
<= GF_PREDICT_TAKEN
);
1138 gimple_predict_set_predictor (p
, predictor
);
1139 gimple_predict_set_outcome (p
, outcome
);
1143 #if defined ENABLE_GIMPLE_CHECKING
1144 /* Complain of a gimple type mismatch and die. */
1147 gimple_check_failed (const_gimple gs
, const char *file
, int line
,
1148 const char *function
, enum gimple_code code
,
1149 enum tree_code subcode
)
1151 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1152 gimple_code_name
[code
],
1153 tree_code_name
[subcode
],
1154 gimple_code_name
[gimple_code (gs
)],
1155 gs
->gsbase
.subcode
> 0
1156 ? tree_code_name
[gs
->gsbase
.subcode
]
1158 function
, trim_filename (file
), line
);
1160 #endif /* ENABLE_GIMPLE_CHECKING */
1163 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1164 *SEQ_P is NULL, a new sequence is allocated. */
1167 gimple_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
1169 gimple_stmt_iterator si
;
1173 si
= gsi_last (*seq_p
);
1174 gsi_insert_after (&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
);
1193 /* Helper function of empty_body_p. Return true if STMT is an empty
1197 empty_stmt_p (gimple stmt
)
1199 if (gimple_code (stmt
) == GIMPLE_NOP
)
1201 if (gimple_code (stmt
) == GIMPLE_BIND
)
1202 return empty_body_p (gimple_bind_body (stmt
));
1207 /* Return true if BODY contains nothing but empty statements. */
1210 empty_body_p (gimple_seq body
)
1212 gimple_stmt_iterator i
;
1214 if (gimple_seq_empty_p (body
))
1216 for (i
= gsi_start (body
); !gsi_end_p (i
); gsi_next (&i
))
1217 if (!empty_stmt_p (gsi_stmt (i
))
1218 && !is_gimple_debug (gsi_stmt (i
)))
1225 /* Perform a deep copy of sequence SRC and return the result. */
1228 gimple_seq_copy (gimple_seq src
)
1230 gimple_stmt_iterator gsi
;
1231 gimple_seq new_seq
= NULL
;
1234 for (gsi
= gsi_start (src
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1236 stmt
= gimple_copy (gsi_stmt (gsi
));
1237 gimple_seq_add_stmt (&new_seq
, stmt
);
1244 /* Walk all the statements in the sequence *PSEQ calling walk_gimple_stmt
1245 on each one. WI is as in walk_gimple_stmt.
1247 If walk_gimple_stmt returns non-NULL, the walk is stopped, and the
1248 value is stored in WI->CALLBACK_RESULT. Also, the statement that
1249 produced the value is returned if this statement has not been
1250 removed by a callback (wi->removed_stmt). If the statement has
1251 been removed, NULL is returned.
1253 Otherwise, all the statements are walked and NULL returned. */
1256 walk_gimple_seq_mod (gimple_seq
*pseq
, walk_stmt_fn callback_stmt
,
1257 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1259 gimple_stmt_iterator gsi
;
1261 for (gsi
= gsi_start (*pseq
); !gsi_end_p (gsi
); )
1263 tree ret
= walk_gimple_stmt (&gsi
, callback_stmt
, callback_op
, wi
);
1266 /* If CALLBACK_STMT or CALLBACK_OP return a value, WI must exist
1269 wi
->callback_result
= ret
;
1271 return wi
->removed_stmt
? NULL
: gsi_stmt (gsi
);
1274 if (!wi
->removed_stmt
)
1279 wi
->callback_result
= NULL_TREE
;
1285 /* Like walk_gimple_seq_mod, but ensure that the head of SEQ isn't
1286 changed by the callbacks. */
1289 walk_gimple_seq (gimple_seq seq
, walk_stmt_fn callback_stmt
,
1290 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1292 gimple_seq seq2
= seq
;
1293 gimple ret
= walk_gimple_seq_mod (&seq2
, callback_stmt
, callback_op
, wi
);
1294 gcc_assert (seq2
== seq
);
1299 /* Helper function for walk_gimple_stmt. Walk operands of a GIMPLE_ASM. */
1302 walk_gimple_asm (gimple stmt
, walk_tree_fn callback_op
,
1303 struct walk_stmt_info
*wi
)
1307 const char **oconstraints
;
1309 const char *constraint
;
1310 bool allows_mem
, allows_reg
, is_inout
;
1312 noutputs
= gimple_asm_noutputs (stmt
);
1313 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
1318 for (i
= 0; i
< noutputs
; i
++)
1320 op
= gimple_asm_output_op (stmt
, i
);
1321 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1322 oconstraints
[i
] = constraint
;
1323 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
, &allows_reg
,
1326 wi
->val_only
= (allows_reg
|| !allows_mem
);
1327 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1332 n
= gimple_asm_ninputs (stmt
);
1333 for (i
= 0; i
< n
; i
++)
1335 op
= gimple_asm_input_op (stmt
, i
);
1336 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1337 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
1338 oconstraints
, &allows_mem
, &allows_reg
);
1341 wi
->val_only
= (allows_reg
|| !allows_mem
);
1342 /* Although input "m" is not really a LHS, we need a lvalue. */
1343 wi
->is_lhs
= !wi
->val_only
;
1345 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1353 wi
->val_only
= true;
1356 n
= gimple_asm_nlabels (stmt
);
1357 for (i
= 0; i
< n
; i
++)
1359 op
= gimple_asm_label_op (stmt
, i
);
1360 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1369 /* Helper function of WALK_GIMPLE_STMT. Walk every tree operand in
1370 STMT. CALLBACK_OP and WI are as in WALK_GIMPLE_STMT.
1372 CALLBACK_OP is called on each operand of STMT via walk_tree.
1373 Additional parameters to walk_tree must be stored in WI. For each operand
1374 OP, walk_tree is called as:
1376 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
1378 If CALLBACK_OP returns non-NULL for an operand, the remaining
1379 operands are not scanned.
1381 The return value is that returned by the last call to walk_tree, or
1382 NULL_TREE if no CALLBACK_OP is specified. */
1385 walk_gimple_op (gimple stmt
, walk_tree_fn callback_op
,
1386 struct walk_stmt_info
*wi
)
1388 struct pointer_set_t
*pset
= (wi
) ? wi
->pset
: NULL
;
1390 tree ret
= NULL_TREE
;
1392 switch (gimple_code (stmt
))
1395 /* Walk the RHS operands. If the LHS is of a non-renamable type or
1396 is a register variable, we may use a COMPONENT_REF on the RHS. */
1399 tree lhs
= gimple_assign_lhs (stmt
);
1401 = (is_gimple_reg_type (TREE_TYPE (lhs
)) && !is_gimple_reg (lhs
))
1402 || gimple_assign_rhs_class (stmt
) != GIMPLE_SINGLE_RHS
;
1405 for (i
= 1; i
< gimple_num_ops (stmt
); i
++)
1407 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
,
1413 /* Walk the LHS. If the RHS is appropriate for a memory, we
1414 may use a COMPONENT_REF on the LHS. */
1417 /* If the RHS is of a non-renamable type or is a register variable,
1418 we may use a COMPONENT_REF on the LHS. */
1419 tree rhs1
= gimple_assign_rhs1 (stmt
);
1421 = (is_gimple_reg_type (TREE_TYPE (rhs1
)) && !is_gimple_reg (rhs1
))
1422 || gimple_assign_rhs_class (stmt
) != GIMPLE_SINGLE_RHS
;
1426 ret
= walk_tree (gimple_op_ptr (stmt
, 0), callback_op
, wi
, pset
);
1432 wi
->val_only
= true;
1441 wi
->val_only
= true;
1444 ret
= walk_tree (gimple_call_chain_ptr (stmt
), callback_op
, wi
, pset
);
1448 ret
= walk_tree (gimple_call_fn_ptr (stmt
), callback_op
, wi
, pset
);
1452 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
1456 = is_gimple_reg_type (TREE_TYPE (gimple_call_arg (stmt
, i
)));
1457 ret
= walk_tree (gimple_call_arg_ptr (stmt
, i
), callback_op
, wi
,
1463 if (gimple_call_lhs (stmt
))
1469 = is_gimple_reg_type (TREE_TYPE (gimple_call_lhs (stmt
)));
1472 ret
= walk_tree (gimple_call_lhs_ptr (stmt
), callback_op
, wi
, pset
);
1480 wi
->val_only
= true;
1485 ret
= walk_tree (gimple_catch_types_ptr (stmt
), callback_op
, wi
,
1491 case GIMPLE_EH_FILTER
:
1492 ret
= walk_tree (gimple_eh_filter_types_ptr (stmt
), callback_op
, wi
,
1499 ret
= walk_gimple_asm (stmt
, callback_op
, wi
);
1504 case GIMPLE_OMP_CONTINUE
:
1505 ret
= walk_tree (gimple_omp_continue_control_def_ptr (stmt
),
1506 callback_op
, wi
, pset
);
1510 ret
= walk_tree (gimple_omp_continue_control_use_ptr (stmt
),
1511 callback_op
, wi
, pset
);
1516 case GIMPLE_OMP_CRITICAL
:
1517 ret
= walk_tree (gimple_omp_critical_name_ptr (stmt
), callback_op
, wi
,
1523 case GIMPLE_OMP_FOR
:
1524 ret
= walk_tree (gimple_omp_for_clauses_ptr (stmt
), callback_op
, wi
,
1528 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1530 ret
= walk_tree (gimple_omp_for_index_ptr (stmt
, i
), callback_op
,
1534 ret
= walk_tree (gimple_omp_for_initial_ptr (stmt
, i
), callback_op
,
1538 ret
= walk_tree (gimple_omp_for_final_ptr (stmt
, i
), callback_op
,
1542 ret
= walk_tree (gimple_omp_for_incr_ptr (stmt
, i
), callback_op
,
1549 case GIMPLE_OMP_PARALLEL
:
1550 ret
= walk_tree (gimple_omp_parallel_clauses_ptr (stmt
), callback_op
,
1554 ret
= walk_tree (gimple_omp_parallel_child_fn_ptr (stmt
), callback_op
,
1558 ret
= walk_tree (gimple_omp_parallel_data_arg_ptr (stmt
), callback_op
,
1564 case GIMPLE_OMP_TASK
:
1565 ret
= walk_tree (gimple_omp_task_clauses_ptr (stmt
), callback_op
,
1569 ret
= walk_tree (gimple_omp_task_child_fn_ptr (stmt
), callback_op
,
1573 ret
= walk_tree (gimple_omp_task_data_arg_ptr (stmt
), callback_op
,
1577 ret
= walk_tree (gimple_omp_task_copy_fn_ptr (stmt
), callback_op
,
1581 ret
= walk_tree (gimple_omp_task_arg_size_ptr (stmt
), callback_op
,
1585 ret
= walk_tree (gimple_omp_task_arg_align_ptr (stmt
), callback_op
,
1591 case GIMPLE_OMP_SECTIONS
:
1592 ret
= walk_tree (gimple_omp_sections_clauses_ptr (stmt
), callback_op
,
1597 ret
= walk_tree (gimple_omp_sections_control_ptr (stmt
), callback_op
,
1604 case GIMPLE_OMP_SINGLE
:
1605 ret
= walk_tree (gimple_omp_single_clauses_ptr (stmt
), callback_op
, wi
,
1611 case GIMPLE_OMP_ATOMIC_LOAD
:
1612 ret
= walk_tree (gimple_omp_atomic_load_lhs_ptr (stmt
), callback_op
, wi
,
1617 ret
= walk_tree (gimple_omp_atomic_load_rhs_ptr (stmt
), callback_op
, wi
,
1623 case GIMPLE_OMP_ATOMIC_STORE
:
1624 ret
= walk_tree (gimple_omp_atomic_store_val_ptr (stmt
), callback_op
,
1630 case GIMPLE_TRANSACTION
:
1631 ret
= walk_tree (gimple_transaction_label_ptr (stmt
), callback_op
,
1637 /* Tuples that do not have operands. */
1640 case GIMPLE_OMP_RETURN
:
1641 case GIMPLE_PREDICT
:
1646 enum gimple_statement_structure_enum gss
;
1647 gss
= gimple_statement_structure (stmt
);
1648 if (gss
== GSS_WITH_OPS
|| gss
== GSS_WITH_MEM_OPS
)
1649 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1651 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
, pset
);
1663 /* Walk the current statement in GSI (optionally using traversal state
1664 stored in WI). If WI is NULL, no state is kept during traversal.
1665 The callback CALLBACK_STMT is called. If CALLBACK_STMT indicates
1666 that it has handled all the operands of the statement, its return
1667 value is returned. Otherwise, the return value from CALLBACK_STMT
1668 is discarded and its operands are scanned.
1670 If CALLBACK_STMT is NULL or it didn't handle the operands,
1671 CALLBACK_OP is called on each operand of the statement via
1672 walk_gimple_op. If walk_gimple_op returns non-NULL for any
1673 operand, the remaining operands are not scanned. In this case, the
1674 return value from CALLBACK_OP is returned.
1676 In any other case, NULL_TREE is returned. */
1679 walk_gimple_stmt (gimple_stmt_iterator
*gsi
, walk_stmt_fn callback_stmt
,
1680 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1684 gimple stmt
= gsi_stmt (*gsi
);
1689 wi
->removed_stmt
= false;
1691 if (wi
->want_locations
&& gimple_has_location (stmt
))
1692 input_location
= gimple_location (stmt
);
1697 /* Invoke the statement callback. Return if the callback handled
1698 all of STMT operands by itself. */
1701 bool handled_ops
= false;
1702 tree_ret
= callback_stmt (gsi
, &handled_ops
, wi
);
1706 /* If CALLBACK_STMT did not handle operands, it should not have
1707 a value to return. */
1708 gcc_assert (tree_ret
== NULL
);
1710 if (wi
&& wi
->removed_stmt
)
1713 /* Re-read stmt in case the callback changed it. */
1714 stmt
= gsi_stmt (*gsi
);
1717 /* If CALLBACK_OP is defined, invoke it on every operand of STMT. */
1720 tree_ret
= walk_gimple_op (stmt
, callback_op
, wi
);
1725 /* If STMT can have statements inside (e.g. GIMPLE_BIND), walk them. */
1726 switch (gimple_code (stmt
))
1729 ret
= walk_gimple_seq_mod (gimple_bind_body_ptr (stmt
), callback_stmt
,
1732 return wi
->callback_result
;
1736 ret
= walk_gimple_seq_mod (gimple_catch_handler_ptr (stmt
), callback_stmt
,
1739 return wi
->callback_result
;
1742 case GIMPLE_EH_FILTER
:
1743 ret
= walk_gimple_seq_mod (gimple_eh_filter_failure_ptr (stmt
), callback_stmt
,
1746 return wi
->callback_result
;
1749 case GIMPLE_EH_ELSE
:
1750 ret
= walk_gimple_seq_mod (gimple_eh_else_n_body_ptr (stmt
),
1751 callback_stmt
, callback_op
, wi
);
1753 return wi
->callback_result
;
1754 ret
= walk_gimple_seq_mod (gimple_eh_else_e_body_ptr (stmt
),
1755 callback_stmt
, callback_op
, wi
);
1757 return wi
->callback_result
;
1761 ret
= walk_gimple_seq_mod (gimple_try_eval_ptr (stmt
), callback_stmt
, callback_op
,
1764 return wi
->callback_result
;
1766 ret
= walk_gimple_seq_mod (gimple_try_cleanup_ptr (stmt
), callback_stmt
,
1769 return wi
->callback_result
;
1772 case GIMPLE_OMP_FOR
:
1773 ret
= walk_gimple_seq_mod (gimple_omp_for_pre_body_ptr (stmt
), callback_stmt
,
1776 return wi
->callback_result
;
1779 case GIMPLE_OMP_CRITICAL
:
1780 case GIMPLE_OMP_MASTER
:
1781 case GIMPLE_OMP_ORDERED
:
1782 case GIMPLE_OMP_SECTION
:
1783 case GIMPLE_OMP_PARALLEL
:
1784 case GIMPLE_OMP_TASK
:
1785 case GIMPLE_OMP_SECTIONS
:
1786 case GIMPLE_OMP_SINGLE
:
1787 ret
= walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), callback_stmt
,
1790 return wi
->callback_result
;
1793 case GIMPLE_WITH_CLEANUP_EXPR
:
1794 ret
= walk_gimple_seq_mod (gimple_wce_cleanup_ptr (stmt
), callback_stmt
,
1797 return wi
->callback_result
;
1800 case GIMPLE_TRANSACTION
:
1801 ret
= walk_gimple_seq_mod (gimple_transaction_body_ptr (stmt
),
1802 callback_stmt
, callback_op
, wi
);
1804 return wi
->callback_result
;
1808 gcc_assert (!gimple_has_substatements (stmt
));
1816 /* Set sequence SEQ to be the GIMPLE body for function FN. */
1819 gimple_set_body (tree fndecl
, gimple_seq seq
)
1821 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1824 /* If FNDECL still does not have a function structure associated
1825 with it, then it does not make sense for it to receive a
1827 gcc_assert (seq
== NULL
);
1830 fn
->gimple_body
= seq
;
1834 /* Return the body of GIMPLE statements for function FN. After the
1835 CFG pass, the function body doesn't exist anymore because it has
1836 been split up into basic blocks. In this case, it returns
1840 gimple_body (tree fndecl
)
1842 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1843 return fn
? fn
->gimple_body
: NULL
;
1846 /* Return true when FNDECL has Gimple body either in unlowered
1849 gimple_has_body_p (tree fndecl
)
1851 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1852 return (gimple_body (fndecl
) || (fn
&& fn
->cfg
));
1855 /* Return true if calls C1 and C2 are known to go to the same function. */
1858 gimple_call_same_target_p (const_gimple c1
, const_gimple c2
)
1860 if (gimple_call_internal_p (c1
))
1861 return (gimple_call_internal_p (c2
)
1862 && gimple_call_internal_fn (c1
) == gimple_call_internal_fn (c2
));
1864 return (gimple_call_fn (c1
) == gimple_call_fn (c2
)
1865 || (gimple_call_fndecl (c1
)
1866 && gimple_call_fndecl (c1
) == gimple_call_fndecl (c2
)));
1869 /* Detect flags from a GIMPLE_CALL. This is just like
1870 call_expr_flags, but for gimple tuples. */
1873 gimple_call_flags (const_gimple stmt
)
1876 tree decl
= gimple_call_fndecl (stmt
);
1879 flags
= flags_from_decl_or_type (decl
);
1880 else if (gimple_call_internal_p (stmt
))
1881 flags
= internal_fn_flags (gimple_call_internal_fn (stmt
));
1883 flags
= flags_from_decl_or_type (gimple_call_fntype (stmt
));
1885 if (stmt
->gsbase
.subcode
& GF_CALL_NOTHROW
)
1886 flags
|= ECF_NOTHROW
;
1891 /* Return the "fn spec" string for call STMT. */
1894 gimple_call_fnspec (const_gimple stmt
)
1898 type
= gimple_call_fntype (stmt
);
1902 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
1906 return TREE_VALUE (TREE_VALUE (attr
));
1909 /* Detects argument flags for argument number ARG on call STMT. */
1912 gimple_call_arg_flags (const_gimple stmt
, unsigned arg
)
1914 tree attr
= gimple_call_fnspec (stmt
);
1916 if (!attr
|| 1 + arg
>= (unsigned) TREE_STRING_LENGTH (attr
))
1919 switch (TREE_STRING_POINTER (attr
)[1 + arg
])
1926 return EAF_DIRECT
| EAF_NOCLOBBER
| EAF_NOESCAPE
;
1929 return EAF_NOCLOBBER
| EAF_NOESCAPE
;
1932 return EAF_DIRECT
| EAF_NOESCAPE
;
1935 return EAF_NOESCAPE
;
1943 /* Detects return flags for the call STMT. */
1946 gimple_call_return_flags (const_gimple stmt
)
1950 if (gimple_call_flags (stmt
) & ECF_MALLOC
)
1953 attr
= gimple_call_fnspec (stmt
);
1954 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
1957 switch (TREE_STRING_POINTER (attr
)[0])
1963 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
1975 /* Return true if GS is a copy assignment. */
1978 gimple_assign_copy_p (gimple gs
)
1980 return (gimple_assign_single_p (gs
)
1981 && is_gimple_val (gimple_op (gs
, 1)));
1985 /* Return true if GS is a SSA_NAME copy assignment. */
1988 gimple_assign_ssa_name_copy_p (gimple gs
)
1990 return (gimple_assign_single_p (gs
)
1991 && TREE_CODE (gimple_assign_lhs (gs
)) == SSA_NAME
1992 && TREE_CODE (gimple_assign_rhs1 (gs
)) == SSA_NAME
);
1996 /* Return true if GS is an assignment with a unary RHS, but the
1997 operator has no effect on the assigned value. The logic is adapted
1998 from STRIP_NOPS. This predicate is intended to be used in tuplifying
1999 instances in which STRIP_NOPS was previously applied to the RHS of
2002 NOTE: In the use cases that led to the creation of this function
2003 and of gimple_assign_single_p, it is typical to test for either
2004 condition and to proceed in the same manner. In each case, the
2005 assigned value is represented by the single RHS operand of the
2006 assignment. I suspect there may be cases where gimple_assign_copy_p,
2007 gimple_assign_single_p, or equivalent logic is used where a similar
2008 treatment of unary NOPs is appropriate. */
2011 gimple_assign_unary_nop_p (gimple gs
)
2013 return (is_gimple_assign (gs
)
2014 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs
))
2015 || gimple_assign_rhs_code (gs
) == NON_LVALUE_EXPR
)
2016 && gimple_assign_rhs1 (gs
) != error_mark_node
2017 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs
)))
2018 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs
)))));
2021 /* Set BB to be the basic block holding G. */
2024 gimple_set_bb (gimple stmt
, basic_block bb
)
2026 stmt
->gsbase
.bb
= bb
;
2028 /* If the statement is a label, add the label to block-to-labels map
2029 so that we can speed up edge creation for GIMPLE_GOTOs. */
2030 if (cfun
->cfg
&& gimple_code (stmt
) == GIMPLE_LABEL
)
2035 t
= gimple_label_label (stmt
);
2036 uid
= LABEL_DECL_UID (t
);
2039 unsigned old_len
= VEC_length (basic_block
, label_to_block_map
);
2040 LABEL_DECL_UID (t
) = uid
= cfun
->cfg
->last_label_uid
++;
2041 if (old_len
<= (unsigned) uid
)
2043 unsigned new_len
= 3 * uid
/ 2 + 1;
2045 VEC_safe_grow_cleared (basic_block
, gc
, label_to_block_map
,
2050 VEC_replace (basic_block
, label_to_block_map
, uid
, bb
);
2055 /* Modify the RHS of the assignment pointed-to by GSI using the
2056 operands in the expression tree EXPR.
2058 NOTE: The statement pointed-to by GSI may be reallocated if it
2059 did not have enough operand slots.
2061 This function is useful to convert an existing tree expression into
2062 the flat representation used for the RHS of a GIMPLE assignment.
2063 It will reallocate memory as needed to expand or shrink the number
2064 of operand slots needed to represent EXPR.
2066 NOTE: If you find yourself building a tree and then calling this
2067 function, you are most certainly doing it the slow way. It is much
2068 better to build a new assignment or to use the function
2069 gimple_assign_set_rhs_with_ops, which does not require an
2070 expression tree to be built. */
2073 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator
*gsi
, tree expr
)
2075 enum tree_code subcode
;
2078 extract_ops_from_tree_1 (expr
, &subcode
, &op1
, &op2
, &op3
);
2079 gimple_assign_set_rhs_with_ops_1 (gsi
, subcode
, op1
, op2
, op3
);
2083 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
2084 operands OP1, OP2 and OP3.
2086 NOTE: The statement pointed-to by GSI may be reallocated if it
2087 did not have enough operand slots. */
2090 gimple_assign_set_rhs_with_ops_1 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
2091 tree op1
, tree op2
, tree op3
)
2093 unsigned new_rhs_ops
= get_gimple_rhs_num_ops (code
);
2094 gimple stmt
= gsi_stmt (*gsi
);
2096 /* If the new CODE needs more operands, allocate a new statement. */
2097 if (gimple_num_ops (stmt
) < new_rhs_ops
+ 1)
2099 tree lhs
= gimple_assign_lhs (stmt
);
2100 gimple new_stmt
= gimple_alloc (gimple_code (stmt
), new_rhs_ops
+ 1);
2101 memcpy (new_stmt
, stmt
, gimple_size (gimple_code (stmt
)));
2102 gimple_init_singleton (new_stmt
);
2103 gsi_replace (gsi
, new_stmt
, true);
2106 /* The LHS needs to be reset as this also changes the SSA name
2108 gimple_assign_set_lhs (stmt
, lhs
);
2111 gimple_set_num_ops (stmt
, new_rhs_ops
+ 1);
2112 gimple_set_subcode (stmt
, code
);
2113 gimple_assign_set_rhs1 (stmt
, op1
);
2114 if (new_rhs_ops
> 1)
2115 gimple_assign_set_rhs2 (stmt
, op2
);
2116 if (new_rhs_ops
> 2)
2117 gimple_assign_set_rhs3 (stmt
, op3
);
2121 /* Return the LHS of a statement that performs an assignment,
2122 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
2123 for a call to a function that returns no value, or for a
2124 statement other than an assignment or a call. */
2127 gimple_get_lhs (const_gimple stmt
)
2129 enum gimple_code code
= gimple_code (stmt
);
2131 if (code
== GIMPLE_ASSIGN
)
2132 return gimple_assign_lhs (stmt
);
2133 else if (code
== GIMPLE_CALL
)
2134 return gimple_call_lhs (stmt
);
2140 /* Set the LHS of a statement that performs an assignment,
2141 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2144 gimple_set_lhs (gimple stmt
, tree lhs
)
2146 enum gimple_code code
= gimple_code (stmt
);
2148 if (code
== GIMPLE_ASSIGN
)
2149 gimple_assign_set_lhs (stmt
, lhs
);
2150 else if (code
== GIMPLE_CALL
)
2151 gimple_call_set_lhs (stmt
, lhs
);
2156 /* Replace the LHS of STMT, an assignment, either a GIMPLE_ASSIGN or a
2157 GIMPLE_CALL, with NLHS, in preparation for modifying the RHS to an
2158 expression with a different value.
2160 This will update any annotations (say debug bind stmts) referring
2161 to the original LHS, so that they use the RHS instead. This is
2162 done even if NLHS and LHS are the same, for it is understood that
2163 the RHS will be modified afterwards, and NLHS will not be assigned
2164 an equivalent value.
2166 Adjusting any non-annotation uses of the LHS, if needed, is a
2167 responsibility of the caller.
2169 The effect of this call should be pretty much the same as that of
2170 inserting a copy of STMT before STMT, and then removing the
2171 original stmt, at which time gsi_remove() would have update
2172 annotations, but using this function saves all the inserting,
2173 copying and removing. */
2176 gimple_replace_lhs (gimple stmt
, tree nlhs
)
2178 if (MAY_HAVE_DEBUG_STMTS
)
2180 tree lhs
= gimple_get_lhs (stmt
);
2182 gcc_assert (SSA_NAME_DEF_STMT (lhs
) == stmt
);
2184 insert_debug_temp_for_var_def (NULL
, lhs
);
2187 gimple_set_lhs (stmt
, nlhs
);
2190 /* Return a deep copy of statement STMT. All the operands from STMT
2191 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
2192 and VUSE operand arrays are set to empty in the new copy. The new
2193 copy isn't part of any sequence. */
2196 gimple_copy (gimple stmt
)
2198 enum gimple_code code
= gimple_code (stmt
);
2199 unsigned num_ops
= gimple_num_ops (stmt
);
2200 gimple copy
= gimple_alloc (code
, num_ops
);
2203 /* Shallow copy all the fields from STMT. */
2204 memcpy (copy
, stmt
, gimple_size (code
));
2205 gimple_init_singleton (copy
);
2207 /* If STMT has sub-statements, deep-copy them as well. */
2208 if (gimple_has_substatements (stmt
))
2213 switch (gimple_code (stmt
))
2216 new_seq
= gimple_seq_copy (gimple_bind_body (stmt
));
2217 gimple_bind_set_body (copy
, new_seq
);
2218 gimple_bind_set_vars (copy
, unshare_expr (gimple_bind_vars (stmt
)));
2219 gimple_bind_set_block (copy
, gimple_bind_block (stmt
));
2223 new_seq
= gimple_seq_copy (gimple_catch_handler (stmt
));
2224 gimple_catch_set_handler (copy
, new_seq
);
2225 t
= unshare_expr (gimple_catch_types (stmt
));
2226 gimple_catch_set_types (copy
, t
);
2229 case GIMPLE_EH_FILTER
:
2230 new_seq
= gimple_seq_copy (gimple_eh_filter_failure (stmt
));
2231 gimple_eh_filter_set_failure (copy
, new_seq
);
2232 t
= unshare_expr (gimple_eh_filter_types (stmt
));
2233 gimple_eh_filter_set_types (copy
, t
);
2236 case GIMPLE_EH_ELSE
:
2237 new_seq
= gimple_seq_copy (gimple_eh_else_n_body (stmt
));
2238 gimple_eh_else_set_n_body (copy
, new_seq
);
2239 new_seq
= gimple_seq_copy (gimple_eh_else_e_body (stmt
));
2240 gimple_eh_else_set_e_body (copy
, new_seq
);
2244 new_seq
= gimple_seq_copy (gimple_try_eval (stmt
));
2245 gimple_try_set_eval (copy
, new_seq
);
2246 new_seq
= gimple_seq_copy (gimple_try_cleanup (stmt
));
2247 gimple_try_set_cleanup (copy
, new_seq
);
2250 case GIMPLE_OMP_FOR
:
2251 new_seq
= gimple_seq_copy (gimple_omp_for_pre_body (stmt
));
2252 gimple_omp_for_set_pre_body (copy
, new_seq
);
2253 t
= unshare_expr (gimple_omp_for_clauses (stmt
));
2254 gimple_omp_for_set_clauses (copy
, t
);
2255 copy
->gimple_omp_for
.iter
2256 = ggc_alloc_vec_gimple_omp_for_iter
2257 (gimple_omp_for_collapse (stmt
));
2258 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
2260 gimple_omp_for_set_cond (copy
, i
,
2261 gimple_omp_for_cond (stmt
, i
));
2262 gimple_omp_for_set_index (copy
, i
,
2263 gimple_omp_for_index (stmt
, i
));
2264 t
= unshare_expr (gimple_omp_for_initial (stmt
, i
));
2265 gimple_omp_for_set_initial (copy
, i
, t
);
2266 t
= unshare_expr (gimple_omp_for_final (stmt
, i
));
2267 gimple_omp_for_set_final (copy
, i
, t
);
2268 t
= unshare_expr (gimple_omp_for_incr (stmt
, i
));
2269 gimple_omp_for_set_incr (copy
, i
, t
);
2273 case GIMPLE_OMP_PARALLEL
:
2274 t
= unshare_expr (gimple_omp_parallel_clauses (stmt
));
2275 gimple_omp_parallel_set_clauses (copy
, t
);
2276 t
= unshare_expr (gimple_omp_parallel_child_fn (stmt
));
2277 gimple_omp_parallel_set_child_fn (copy
, t
);
2278 t
= unshare_expr (gimple_omp_parallel_data_arg (stmt
));
2279 gimple_omp_parallel_set_data_arg (copy
, t
);
2282 case GIMPLE_OMP_TASK
:
2283 t
= unshare_expr (gimple_omp_task_clauses (stmt
));
2284 gimple_omp_task_set_clauses (copy
, t
);
2285 t
= unshare_expr (gimple_omp_task_child_fn (stmt
));
2286 gimple_omp_task_set_child_fn (copy
, t
);
2287 t
= unshare_expr (gimple_omp_task_data_arg (stmt
));
2288 gimple_omp_task_set_data_arg (copy
, t
);
2289 t
= unshare_expr (gimple_omp_task_copy_fn (stmt
));
2290 gimple_omp_task_set_copy_fn (copy
, t
);
2291 t
= unshare_expr (gimple_omp_task_arg_size (stmt
));
2292 gimple_omp_task_set_arg_size (copy
, t
);
2293 t
= unshare_expr (gimple_omp_task_arg_align (stmt
));
2294 gimple_omp_task_set_arg_align (copy
, t
);
2297 case GIMPLE_OMP_CRITICAL
:
2298 t
= unshare_expr (gimple_omp_critical_name (stmt
));
2299 gimple_omp_critical_set_name (copy
, t
);
2302 case GIMPLE_OMP_SECTIONS
:
2303 t
= unshare_expr (gimple_omp_sections_clauses (stmt
));
2304 gimple_omp_sections_set_clauses (copy
, t
);
2305 t
= unshare_expr (gimple_omp_sections_control (stmt
));
2306 gimple_omp_sections_set_control (copy
, t
);
2309 case GIMPLE_OMP_SINGLE
:
2310 case GIMPLE_OMP_SECTION
:
2311 case GIMPLE_OMP_MASTER
:
2312 case GIMPLE_OMP_ORDERED
:
2314 new_seq
= gimple_seq_copy (gimple_omp_body (stmt
));
2315 gimple_omp_set_body (copy
, new_seq
);
2318 case GIMPLE_TRANSACTION
:
2319 new_seq
= gimple_seq_copy (gimple_transaction_body (stmt
));
2320 gimple_transaction_set_body (copy
, new_seq
);
2323 case GIMPLE_WITH_CLEANUP_EXPR
:
2324 new_seq
= gimple_seq_copy (gimple_wce_cleanup (stmt
));
2325 gimple_wce_set_cleanup (copy
, new_seq
);
2333 /* Make copy of operands. */
2336 for (i
= 0; i
< num_ops
; i
++)
2337 gimple_set_op (copy
, i
, unshare_expr (gimple_op (stmt
, i
)));
2339 /* Clear out SSA operand vectors on COPY. */
2340 if (gimple_has_ops (stmt
))
2342 gimple_set_def_ops (copy
, NULL
);
2343 gimple_set_use_ops (copy
, NULL
);
2346 if (gimple_has_mem_ops (stmt
))
2348 gimple_set_vdef (copy
, gimple_vdef (stmt
));
2349 gimple_set_vuse (copy
, gimple_vuse (stmt
));
2352 /* SSA operands need to be updated. */
2353 gimple_set_modified (copy
, true);
2360 /* Return true if statement S has side-effects. We consider a
2361 statement to have side effects if:
2363 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
2364 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
2367 gimple_has_side_effects (const_gimple s
)
2369 if (is_gimple_debug (s
))
2372 /* We don't have to scan the arguments to check for
2373 volatile arguments, though, at present, we still
2374 do a scan to check for TREE_SIDE_EFFECTS. */
2375 if (gimple_has_volatile_ops (s
))
2378 if (gimple_code (s
) == GIMPLE_ASM
2379 && gimple_asm_volatile_p (s
))
2382 if (is_gimple_call (s
))
2384 int flags
= gimple_call_flags (s
);
2386 /* An infinite loop is considered a side effect. */
2387 if (!(flags
& (ECF_CONST
| ECF_PURE
))
2388 || (flags
& ECF_LOOPING_CONST_OR_PURE
))
2397 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
2398 Return true if S can trap. When INCLUDE_MEM is true, check whether
2399 the memory operations could trap. When INCLUDE_STORES is true and
2400 S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */
2403 gimple_could_trap_p_1 (gimple s
, bool include_mem
, bool include_stores
)
2405 tree t
, div
= NULL_TREE
;
2410 unsigned i
, start
= (is_gimple_assign (s
) && !include_stores
) ? 1 : 0;
2412 for (i
= start
; i
< gimple_num_ops (s
); i
++)
2413 if (tree_could_trap_p (gimple_op (s
, i
)))
2417 switch (gimple_code (s
))
2420 return gimple_asm_volatile_p (s
);
2423 t
= gimple_call_fndecl (s
);
2424 /* Assume that calls to weak functions may trap. */
2425 if (!t
|| !DECL_P (t
) || DECL_WEAK (t
))
2430 t
= gimple_expr_type (s
);
2431 op
= gimple_assign_rhs_code (s
);
2432 if (get_gimple_rhs_class (op
) == GIMPLE_BINARY_RHS
)
2433 div
= gimple_assign_rhs2 (s
);
2434 return (operation_could_trap_p (op
, FLOAT_TYPE_P (t
),
2435 (INTEGRAL_TYPE_P (t
)
2436 && TYPE_OVERFLOW_TRAPS (t
)),
2446 /* Return true if statement S can trap. */
2449 gimple_could_trap_p (gimple s
)
2451 return gimple_could_trap_p_1 (s
, true, true);
2454 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
2457 gimple_assign_rhs_could_trap_p (gimple s
)
2459 gcc_assert (is_gimple_assign (s
));
2460 return gimple_could_trap_p_1 (s
, true, false);
2464 /* Print debugging information for gimple stmts generated. */
2467 dump_gimple_statistics (void)
2469 int i
, total_tuples
= 0, total_bytes
= 0;
2471 if (! GATHER_STATISTICS
)
2473 fprintf (stderr
, "No gimple statistics\n");
2477 fprintf (stderr
, "\nGIMPLE statements\n");
2478 fprintf (stderr
, "Kind Stmts Bytes\n");
2479 fprintf (stderr
, "---------------------------------------\n");
2480 for (i
= 0; i
< (int) gimple_alloc_kind_all
; ++i
)
2482 fprintf (stderr
, "%-20s %7d %10d\n", gimple_alloc_kind_names
[i
],
2483 gimple_alloc_counts
[i
], gimple_alloc_sizes
[i
]);
2484 total_tuples
+= gimple_alloc_counts
[i
];
2485 total_bytes
+= gimple_alloc_sizes
[i
];
2487 fprintf (stderr
, "---------------------------------------\n");
2488 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_tuples
, total_bytes
);
2489 fprintf (stderr
, "---------------------------------------\n");
2493 /* Return the number of operands needed on the RHS of a GIMPLE
2494 assignment for an expression with tree code CODE. */
2497 get_gimple_rhs_num_ops (enum tree_code code
)
2499 enum gimple_rhs_class rhs_class
= get_gimple_rhs_class (code
);
2501 if (rhs_class
== GIMPLE_UNARY_RHS
|| rhs_class
== GIMPLE_SINGLE_RHS
)
2503 else if (rhs_class
== GIMPLE_BINARY_RHS
)
2505 else if (rhs_class
== GIMPLE_TERNARY_RHS
)
2511 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
2513 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
2514 : ((TYPE) == tcc_binary \
2515 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
2516 : ((TYPE) == tcc_constant \
2517 || (TYPE) == tcc_declaration \
2518 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
2519 : ((SYM) == TRUTH_AND_EXPR \
2520 || (SYM) == TRUTH_OR_EXPR \
2521 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
2522 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
2523 : ((SYM) == COND_EXPR \
2524 || (SYM) == WIDEN_MULT_PLUS_EXPR \
2525 || (SYM) == WIDEN_MULT_MINUS_EXPR \
2526 || (SYM) == DOT_PROD_EXPR \
2527 || (SYM) == REALIGN_LOAD_EXPR \
2528 || (SYM) == VEC_COND_EXPR \
2529 || (SYM) == VEC_PERM_EXPR \
2530 || (SYM) == FMA_EXPR) ? GIMPLE_TERNARY_RHS \
2531 : ((SYM) == CONSTRUCTOR \
2532 || (SYM) == OBJ_TYPE_REF \
2533 || (SYM) == ASSERT_EXPR \
2534 || (SYM) == ADDR_EXPR \
2535 || (SYM) == WITH_SIZE_EXPR \
2536 || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \
2537 : GIMPLE_INVALID_RHS),
2538 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
2540 const unsigned char gimple_rhs_class_table
[] = {
2541 #include "all-tree.def"
2545 #undef END_OF_BASE_TREE_CODES
2547 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
2549 /* Validation of GIMPLE expressions. */
2551 /* Return true if T is a valid LHS for a GIMPLE assignment expression. */
2554 is_gimple_lvalue (tree t
)
2556 return (is_gimple_addressable (t
)
2557 || TREE_CODE (t
) == WITH_SIZE_EXPR
2558 /* These are complex lvalues, but don't have addresses, so they
2560 || TREE_CODE (t
) == BIT_FIELD_REF
);
2563 /* Return true if T is a GIMPLE condition. */
2566 is_gimple_condexpr (tree t
)
2568 return (is_gimple_val (t
) || (COMPARISON_CLASS_P (t
)
2569 && !tree_could_throw_p (t
)
2570 && is_gimple_val (TREE_OPERAND (t
, 0))
2571 && is_gimple_val (TREE_OPERAND (t
, 1))));
2574 /* Return true if T is something whose address can be taken. */
2577 is_gimple_addressable (tree t
)
2579 return (is_gimple_id (t
) || handled_component_p (t
)
2580 || TREE_CODE (t
) == MEM_REF
);
2583 /* Return true if T is a valid gimple constant. */
2586 is_gimple_constant (const_tree t
)
2588 switch (TREE_CODE (t
))
2598 /* Vector constant constructors are gimple invariant. */
2600 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2601 return TREE_CONSTANT (t
);
2610 /* Return true if T is a gimple address. */
2613 is_gimple_address (const_tree t
)
2617 if (TREE_CODE (t
) != ADDR_EXPR
)
2620 op
= TREE_OPERAND (t
, 0);
2621 while (handled_component_p (op
))
2623 if ((TREE_CODE (op
) == ARRAY_REF
2624 || TREE_CODE (op
) == ARRAY_RANGE_REF
)
2625 && !is_gimple_val (TREE_OPERAND (op
, 1)))
2628 op
= TREE_OPERAND (op
, 0);
2631 if (CONSTANT_CLASS_P (op
) || TREE_CODE (op
) == MEM_REF
)
2634 switch (TREE_CODE (op
))
2649 /* Return true if T is a gimple invariant address. */
2652 is_gimple_invariant_address (const_tree t
)
2656 if (TREE_CODE (t
) != ADDR_EXPR
)
2659 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2663 if (TREE_CODE (op
) == MEM_REF
)
2665 const_tree op0
= TREE_OPERAND (op
, 0);
2666 return (TREE_CODE (op0
) == ADDR_EXPR
2667 && (CONSTANT_CLASS_P (TREE_OPERAND (op0
, 0))
2668 || decl_address_invariant_p (TREE_OPERAND (op0
, 0))));
2671 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2674 /* Return true if T is a gimple invariant address at IPA level
2675 (so addresses of variables on stack are not allowed). */
2678 is_gimple_ip_invariant_address (const_tree t
)
2682 if (TREE_CODE (t
) != ADDR_EXPR
)
2685 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2689 if (TREE_CODE (op
) == MEM_REF
)
2691 const_tree op0
= TREE_OPERAND (op
, 0);
2692 return (TREE_CODE (op0
) == ADDR_EXPR
2693 && (CONSTANT_CLASS_P (TREE_OPERAND (op0
, 0))
2694 || decl_address_ip_invariant_p (TREE_OPERAND (op0
, 0))));
2697 return CONSTANT_CLASS_P (op
) || decl_address_ip_invariant_p (op
);
2700 /* Return true if T is a GIMPLE minimal invariant. It's a restricted
2701 form of function invariant. */
2704 is_gimple_min_invariant (const_tree t
)
2706 if (TREE_CODE (t
) == ADDR_EXPR
)
2707 return is_gimple_invariant_address (t
);
2709 return is_gimple_constant (t
);
2712 /* Return true if T is a GIMPLE interprocedural invariant. It's a restricted
2713 form of gimple minimal invariant. */
2716 is_gimple_ip_invariant (const_tree t
)
2718 if (TREE_CODE (t
) == ADDR_EXPR
)
2719 return is_gimple_ip_invariant_address (t
);
2721 return is_gimple_constant (t
);
2724 /* Return true if T is a variable. */
2727 is_gimple_variable (tree t
)
2729 return (TREE_CODE (t
) == VAR_DECL
2730 || TREE_CODE (t
) == PARM_DECL
2731 || TREE_CODE (t
) == RESULT_DECL
2732 || TREE_CODE (t
) == SSA_NAME
);
2735 /* Return true if T is a GIMPLE identifier (something with an address). */
2738 is_gimple_id (tree t
)
2740 return (is_gimple_variable (t
)
2741 || TREE_CODE (t
) == FUNCTION_DECL
2742 || TREE_CODE (t
) == LABEL_DECL
2743 || TREE_CODE (t
) == CONST_DECL
2744 /* Allow string constants, since they are addressable. */
2745 || TREE_CODE (t
) == STRING_CST
);
2748 /* Return true if T is a non-aggregate register variable. */
2751 is_gimple_reg (tree t
)
2753 if (virtual_operand_p (t
))
2756 if (TREE_CODE (t
) == SSA_NAME
)
2759 if (!is_gimple_variable (t
))
2762 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2765 /* A volatile decl is not acceptable because we can't reuse it as
2766 needed. We need to copy it into a temp first. */
2767 if (TREE_THIS_VOLATILE (t
))
2770 /* We define "registers" as things that can be renamed as needed,
2771 which with our infrastructure does not apply to memory. */
2772 if (needs_to_live_in_memory (t
))
2775 /* Hard register variables are an interesting case. For those that
2776 are call-clobbered, we don't know where all the calls are, since
2777 we don't (want to) take into account which operations will turn
2778 into libcalls at the rtl level. For those that are call-saved,
2779 we don't currently model the fact that calls may in fact change
2780 global hard registers, nor do we examine ASM_CLOBBERS at the tree
2781 level, and so miss variable changes that might imply. All around,
2782 it seems safest to not do too much optimization with these at the
2783 tree level at all. We'll have to rely on the rtl optimizers to
2784 clean this up, as there we've got all the appropriate bits exposed. */
2785 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
2788 /* Complex and vector values must have been put into SSA-like form.
2789 That is, no assignments to the individual components. */
2790 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
2791 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2792 return DECL_GIMPLE_REG_P (t
);
2798 /* Return true if T is a GIMPLE rvalue, i.e. an identifier or a constant. */
2801 is_gimple_val (tree t
)
2803 /* Make loads from volatiles and memory vars explicit. */
2804 if (is_gimple_variable (t
)
2805 && is_gimple_reg_type (TREE_TYPE (t
))
2806 && !is_gimple_reg (t
))
2809 return (is_gimple_variable (t
) || is_gimple_min_invariant (t
));
2812 /* Similarly, but accept hard registers as inputs to asm statements. */
2815 is_gimple_asm_val (tree t
)
2817 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
2820 return is_gimple_val (t
);
2823 /* Return true if T is a GIMPLE minimal lvalue. */
2826 is_gimple_min_lval (tree t
)
2828 if (!(t
= CONST_CAST_TREE (strip_invariant_refs (t
))))
2830 return (is_gimple_id (t
) || TREE_CODE (t
) == MEM_REF
);
2833 /* Return true if T is a valid function operand of a CALL_EXPR. */
2836 is_gimple_call_addr (tree t
)
2838 return (TREE_CODE (t
) == OBJ_TYPE_REF
|| is_gimple_val (t
));
2841 /* Return true if T is a valid address operand of a MEM_REF. */
2844 is_gimple_mem_ref_addr (tree t
)
2846 return (is_gimple_reg (t
)
2847 || TREE_CODE (t
) == INTEGER_CST
2848 || (TREE_CODE (t
) == ADDR_EXPR
2849 && (CONSTANT_CLASS_P (TREE_OPERAND (t
, 0))
2850 || decl_address_invariant_p (TREE_OPERAND (t
, 0)))));
2854 /* Given a memory reference expression T, return its base address.
2855 The base address of a memory reference expression is the main
2856 object being referenced. For instance, the base address for
2857 'array[i].fld[j]' is 'array'. You can think of this as stripping
2858 away the offset part from a memory address.
2860 This function calls handled_component_p to strip away all the inner
2861 parts of the memory reference until it reaches the base object. */
2864 get_base_address (tree t
)
2866 while (handled_component_p (t
))
2867 t
= TREE_OPERAND (t
, 0);
2869 if ((TREE_CODE (t
) == MEM_REF
2870 || TREE_CODE (t
) == TARGET_MEM_REF
)
2871 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
2872 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
2874 /* ??? Either the alias oracle or all callers need to properly deal
2875 with WITH_SIZE_EXPRs before we can look through those. */
2876 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
2883 recalculate_side_effects (tree t
)
2885 enum tree_code code
= TREE_CODE (t
);
2886 int len
= TREE_OPERAND_LENGTH (t
);
2889 switch (TREE_CODE_CLASS (code
))
2891 case tcc_expression
:
2897 case PREDECREMENT_EXPR
:
2898 case PREINCREMENT_EXPR
:
2899 case POSTDECREMENT_EXPR
:
2900 case POSTINCREMENT_EXPR
:
2901 /* All of these have side-effects, no matter what their
2910 case tcc_comparison
: /* a comparison expression */
2911 case tcc_unary
: /* a unary arithmetic expression */
2912 case tcc_binary
: /* a binary arithmetic expression */
2913 case tcc_reference
: /* a reference */
2914 case tcc_vl_exp
: /* a function call */
2915 TREE_SIDE_EFFECTS (t
) = TREE_THIS_VOLATILE (t
);
2916 for (i
= 0; i
< len
; ++i
)
2918 tree op
= TREE_OPERAND (t
, i
);
2919 if (op
&& TREE_SIDE_EFFECTS (op
))
2920 TREE_SIDE_EFFECTS (t
) = 1;
2925 /* No side-effects. */
2933 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
2934 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
2935 we failed to create one. */
2938 canonicalize_cond_expr_cond (tree t
)
2940 /* Strip conversions around boolean operations. */
2941 if (CONVERT_EXPR_P (t
)
2942 && (truth_value_p (TREE_CODE (TREE_OPERAND (t
, 0)))
2943 || TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
2945 t
= TREE_OPERAND (t
, 0);
2947 /* For !x use x == 0. */
2948 if (TREE_CODE (t
) == TRUTH_NOT_EXPR
)
2950 tree top0
= TREE_OPERAND (t
, 0);
2951 t
= build2 (EQ_EXPR
, TREE_TYPE (t
),
2952 top0
, build_int_cst (TREE_TYPE (top0
), 0));
2954 /* For cmp ? 1 : 0 use cmp. */
2955 else if (TREE_CODE (t
) == COND_EXPR
2956 && COMPARISON_CLASS_P (TREE_OPERAND (t
, 0))
2957 && integer_onep (TREE_OPERAND (t
, 1))
2958 && integer_zerop (TREE_OPERAND (t
, 2)))
2960 tree top0
= TREE_OPERAND (t
, 0);
2961 t
= build2 (TREE_CODE (top0
), TREE_TYPE (t
),
2962 TREE_OPERAND (top0
, 0), TREE_OPERAND (top0
, 1));
2965 if (is_gimple_condexpr (t
))
2971 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
2972 the positions marked by the set ARGS_TO_SKIP. */
2975 gimple_call_copy_skip_args (gimple stmt
, bitmap args_to_skip
)
2978 int nargs
= gimple_call_num_args (stmt
);
2979 VEC(tree
, heap
) *vargs
= VEC_alloc (tree
, heap
, nargs
);
2982 for (i
= 0; i
< nargs
; i
++)
2983 if (!bitmap_bit_p (args_to_skip
, i
))
2984 VEC_quick_push (tree
, vargs
, gimple_call_arg (stmt
, i
));
2986 if (gimple_call_internal_p (stmt
))
2987 new_stmt
= gimple_build_call_internal_vec (gimple_call_internal_fn (stmt
),
2990 new_stmt
= gimple_build_call_vec (gimple_call_fn (stmt
), vargs
);
2991 VEC_free (tree
, heap
, vargs
);
2992 if (gimple_call_lhs (stmt
))
2993 gimple_call_set_lhs (new_stmt
, gimple_call_lhs (stmt
));
2995 gimple_set_vuse (new_stmt
, gimple_vuse (stmt
));
2996 gimple_set_vdef (new_stmt
, gimple_vdef (stmt
));
2998 gimple_set_block (new_stmt
, gimple_block (stmt
));
2999 if (gimple_has_location (stmt
))
3000 gimple_set_location (new_stmt
, gimple_location (stmt
));
3001 gimple_call_copy_flags (new_stmt
, stmt
);
3002 gimple_call_set_chain (new_stmt
, gimple_call_chain (stmt
));
3004 gimple_set_modified (new_stmt
, true);
3011 /* Return true if the field decls F1 and F2 are at the same offset.
3013 This is intended to be used on GIMPLE types only. */
3016 gimple_compare_field_offset (tree f1
, tree f2
)
3018 if (DECL_OFFSET_ALIGN (f1
) == DECL_OFFSET_ALIGN (f2
))
3020 tree offset1
= DECL_FIELD_OFFSET (f1
);
3021 tree offset2
= DECL_FIELD_OFFSET (f2
);
3022 return ((offset1
== offset2
3023 /* Once gimplification is done, self-referential offsets are
3024 instantiated as operand #2 of the COMPONENT_REF built for
3025 each access and reset. Therefore, they are not relevant
3026 anymore and fields are interchangeable provided that they
3027 represent the same access. */
3028 || (TREE_CODE (offset1
) == PLACEHOLDER_EXPR
3029 && TREE_CODE (offset2
) == PLACEHOLDER_EXPR
3030 && (DECL_SIZE (f1
) == DECL_SIZE (f2
)
3031 || (TREE_CODE (DECL_SIZE (f1
)) == PLACEHOLDER_EXPR
3032 && TREE_CODE (DECL_SIZE (f2
)) == PLACEHOLDER_EXPR
)
3033 || operand_equal_p (DECL_SIZE (f1
), DECL_SIZE (f2
), 0))
3034 && DECL_ALIGN (f1
) == DECL_ALIGN (f2
))
3035 || operand_equal_p (offset1
, offset2
, 0))
3036 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1
),
3037 DECL_FIELD_BIT_OFFSET (f2
)));
3040 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
3041 should be, so handle differing ones specially by decomposing
3042 the offset into a byte and bit offset manually. */
3043 if (host_integerp (DECL_FIELD_OFFSET (f1
), 0)
3044 && host_integerp (DECL_FIELD_OFFSET (f2
), 0))
3046 unsigned HOST_WIDE_INT byte_offset1
, byte_offset2
;
3047 unsigned HOST_WIDE_INT bit_offset1
, bit_offset2
;
3048 bit_offset1
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1
));
3049 byte_offset1
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1
))
3050 + bit_offset1
/ BITS_PER_UNIT
);
3051 bit_offset2
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2
));
3052 byte_offset2
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2
))
3053 + bit_offset2
/ BITS_PER_UNIT
);
3054 if (byte_offset1
!= byte_offset2
)
3056 return bit_offset1
% BITS_PER_UNIT
== bit_offset2
% BITS_PER_UNIT
;
3062 /* Returning a hash value for gimple type TYPE combined with VAL.
3064 The hash value returned is equal for types considered compatible
3065 by gimple_canonical_types_compatible_p. */
3068 iterative_hash_canonical_type (tree type
, hashval_t val
)
3072 struct tree_int_map
*mp
, m
;
3075 if ((slot
= htab_find_slot (canonical_type_hash_cache
, &m
, INSERT
))
3077 return iterative_hash_hashval_t (((struct tree_int_map
*) *slot
)->to
, val
);
3079 /* Combine a few common features of types so that types are grouped into
3080 smaller sets; when searching for existing matching types to merge,
3081 only existing types having the same features as the new type will be
3083 v
= iterative_hash_hashval_t (TREE_CODE (type
), 0);
3084 v
= iterative_hash_hashval_t (TREE_ADDRESSABLE (type
), v
);
3085 v
= iterative_hash_hashval_t (TYPE_ALIGN (type
), v
);
3086 v
= iterative_hash_hashval_t (TYPE_MODE (type
), v
);
3088 /* Incorporate common features of numerical types. */
3089 if (INTEGRAL_TYPE_P (type
)
3090 || SCALAR_FLOAT_TYPE_P (type
)
3091 || FIXED_POINT_TYPE_P (type
)
3092 || TREE_CODE (type
) == VECTOR_TYPE
3093 || TREE_CODE (type
) == COMPLEX_TYPE
3094 || TREE_CODE (type
) == OFFSET_TYPE
3095 || POINTER_TYPE_P (type
))
3097 v
= iterative_hash_hashval_t (TYPE_PRECISION (type
), v
);
3098 v
= iterative_hash_hashval_t (TYPE_UNSIGNED (type
), v
);
3101 /* For pointer and reference types, fold in information about the type
3102 pointed to but do not recurse to the pointed-to type. */
3103 if (POINTER_TYPE_P (type
))
3105 v
= iterative_hash_hashval_t (TYPE_REF_CAN_ALIAS_ALL (type
), v
);
3106 v
= iterative_hash_hashval_t (TYPE_ADDR_SPACE (TREE_TYPE (type
)), v
);
3107 v
= iterative_hash_hashval_t (TYPE_RESTRICT (type
), v
);
3108 v
= iterative_hash_hashval_t (TREE_CODE (TREE_TYPE (type
)), v
);
3111 /* For integer types hash only the string flag. */
3112 if (TREE_CODE (type
) == INTEGER_TYPE
)
3113 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
3115 /* For array types hash the domain bounds and the string flag. */
3116 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_DOMAIN (type
))
3118 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
3119 /* OMP lowering can introduce error_mark_node in place of
3120 random local decls in types. */
3121 if (TYPE_MIN_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
3122 v
= iterative_hash_expr (TYPE_MIN_VALUE (TYPE_DOMAIN (type
)), v
);
3123 if (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != error_mark_node
)
3124 v
= iterative_hash_expr (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)), v
);
3127 /* Recurse for aggregates with a single element type. */
3128 if (TREE_CODE (type
) == ARRAY_TYPE
3129 || TREE_CODE (type
) == COMPLEX_TYPE
3130 || TREE_CODE (type
) == VECTOR_TYPE
)
3131 v
= iterative_hash_canonical_type (TREE_TYPE (type
), v
);
3133 /* Incorporate function return and argument types. */
3134 if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
3139 /* For method types also incorporate their parent class. */
3140 if (TREE_CODE (type
) == METHOD_TYPE
)
3141 v
= iterative_hash_canonical_type (TYPE_METHOD_BASETYPE (type
), v
);
3143 v
= iterative_hash_canonical_type (TREE_TYPE (type
), v
);
3145 for (p
= TYPE_ARG_TYPES (type
), na
= 0; p
; p
= TREE_CHAIN (p
))
3147 v
= iterative_hash_canonical_type (TREE_VALUE (p
), v
);
3151 v
= iterative_hash_hashval_t (na
, v
);
3154 if (RECORD_OR_UNION_TYPE_P (type
))
3159 for (f
= TYPE_FIELDS (type
), nf
= 0; f
; f
= TREE_CHAIN (f
))
3160 if (TREE_CODE (f
) == FIELD_DECL
)
3162 v
= iterative_hash_canonical_type (TREE_TYPE (f
), v
);
3166 v
= iterative_hash_hashval_t (nf
, v
);
3169 /* Cache the just computed hash value. */
3170 mp
= ggc_alloc_cleared_tree_int_map ();
3171 mp
->base
.from
= type
;
3173 *slot
= (void *) mp
;
3175 return iterative_hash_hashval_t (v
, val
);
3179 gimple_canonical_type_hash (const void *p
)
3181 if (canonical_type_hash_cache
== NULL
)
3182 canonical_type_hash_cache
= htab_create_ggc (512, tree_int_map_hash
,
3183 tree_int_map_eq
, NULL
);
3185 return iterative_hash_canonical_type (CONST_CAST_TREE ((const_tree
) p
), 0);
3191 /* The TYPE_CANONICAL merging machinery. It should closely resemble
3192 the middle-end types_compatible_p function. It needs to avoid
3193 claiming types are different for types that should be treated
3194 the same with respect to TBAA. Canonical types are also used
3195 for IL consistency checks via the useless_type_conversion_p
3196 predicate which does not handle all type kinds itself but falls
3197 back to pointer-comparison of TYPE_CANONICAL for aggregates
3200 /* Return true iff T1 and T2 are structurally identical for what
3201 TBAA is concerned. */
3204 gimple_canonical_types_compatible_p (tree t1
, tree t2
)
3206 /* Before starting to set up the SCC machinery handle simple cases. */
3208 /* Check first for the obvious case of pointer identity. */
3212 /* Check that we have two types to compare. */
3213 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
3216 /* If the types have been previously registered and found equal
3218 if (TYPE_CANONICAL (t1
)
3219 && TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
3222 /* Can't be the same type if the types don't have the same code. */
3223 if (TREE_CODE (t1
) != TREE_CODE (t2
))
3226 if (TREE_ADDRESSABLE (t1
) != TREE_ADDRESSABLE (t2
))
3229 /* Qualifiers do not matter for canonical type comparison purposes. */
3231 /* Void types and nullptr types are always the same. */
3232 if (TREE_CODE (t1
) == VOID_TYPE
3233 || TREE_CODE (t1
) == NULLPTR_TYPE
)
3236 /* Can't be the same type if they have different alignment, or mode. */
3237 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3238 || TYPE_MODE (t1
) != TYPE_MODE (t2
))
3241 /* Non-aggregate types can be handled cheaply. */
3242 if (INTEGRAL_TYPE_P (t1
)
3243 || SCALAR_FLOAT_TYPE_P (t1
)
3244 || FIXED_POINT_TYPE_P (t1
)
3245 || TREE_CODE (t1
) == VECTOR_TYPE
3246 || TREE_CODE (t1
) == COMPLEX_TYPE
3247 || TREE_CODE (t1
) == OFFSET_TYPE
3248 || POINTER_TYPE_P (t1
))
3250 /* Can't be the same type if they have different sign or precision. */
3251 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
)
3252 || TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
3255 if (TREE_CODE (t1
) == INTEGER_TYPE
3256 && TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
))
3259 /* For canonical type comparisons we do not want to build SCCs
3260 so we cannot compare pointed-to types. But we can, for now,
3261 require the same pointed-to type kind and match what
3262 useless_type_conversion_p would do. */
3263 if (POINTER_TYPE_P (t1
))
3265 /* If the two pointers have different ref-all attributes,
3266 they can't be the same type. */
3267 if (TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
3270 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
3271 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
3274 if (TYPE_RESTRICT (t1
) != TYPE_RESTRICT (t2
))
3277 if (TREE_CODE (TREE_TYPE (t1
)) != TREE_CODE (TREE_TYPE (t2
)))
3281 /* Tail-recurse to components. */
3282 if (TREE_CODE (t1
) == VECTOR_TYPE
3283 || TREE_CODE (t1
) == COMPLEX_TYPE
)
3284 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
3290 /* Do type-specific comparisons. */
3291 switch (TREE_CODE (t1
))
3294 /* Array types are the same if the element types are the same and
3295 the number of elements are the same. */
3296 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
3297 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
3298 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
3302 tree i1
= TYPE_DOMAIN (t1
);
3303 tree i2
= TYPE_DOMAIN (t2
);
3305 /* For an incomplete external array, the type domain can be
3306 NULL_TREE. Check this condition also. */
3307 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
3309 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
3313 tree min1
= TYPE_MIN_VALUE (i1
);
3314 tree min2
= TYPE_MIN_VALUE (i2
);
3315 tree max1
= TYPE_MAX_VALUE (i1
);
3316 tree max2
= TYPE_MAX_VALUE (i2
);
3318 /* The minimum/maximum values have to be the same. */
3321 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
3322 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
3323 || operand_equal_p (min1
, min2
, 0))))
3326 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
3327 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
3328 || operand_equal_p (max1
, max2
, 0)))))
3337 /* Function types are the same if the return type and arguments types
3339 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3342 if (!comp_type_attributes (t1
, t2
))
3345 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
3349 tree parms1
, parms2
;
3351 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
3353 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
3355 if (!gimple_canonical_types_compatible_p
3356 (TREE_VALUE (parms1
), TREE_VALUE (parms2
)))
3360 if (parms1
|| parms2
)
3368 case QUAL_UNION_TYPE
:
3372 /* For aggregate types, all the fields must be the same. */
3373 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
3375 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
3377 /* Skip non-fields. */
3378 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
3379 f1
= TREE_CHAIN (f1
);
3380 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
3381 f2
= TREE_CHAIN (f2
);
3384 /* The fields must have the same name, offset and type. */
3385 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
3386 || !gimple_compare_field_offset (f1
, f2
)
3387 || !gimple_canonical_types_compatible_p
3388 (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3392 /* If one aggregate has more fields than the other, they
3393 are not the same. */
3406 /* Returns nonzero if P1 and P2 are equal. */
3409 gimple_canonical_type_eq (const void *p1
, const void *p2
)
3411 const_tree t1
= (const_tree
) p1
;
3412 const_tree t2
= (const_tree
) p2
;
3413 return gimple_canonical_types_compatible_p (CONST_CAST_TREE (t1
),
3414 CONST_CAST_TREE (t2
));
3417 /* Register type T in the global type table gimple_types.
3418 If another type T', compatible with T, already existed in
3419 gimple_types then return T', otherwise return T. This is used by
3420 LTO to merge identical types read from different TUs.
3422 ??? This merging does not exactly match how the tree.c middle-end
3423 functions will assign TYPE_CANONICAL when new types are created
3424 during optimization (which at least happens for pointer and array
3428 gimple_register_canonical_type (tree t
)
3432 gcc_assert (TYPE_P (t
));
3434 if (TYPE_CANONICAL (t
))
3435 return TYPE_CANONICAL (t
);
3437 if (gimple_canonical_types
== NULL
)
3438 gimple_canonical_types
= htab_create_ggc (16381, gimple_canonical_type_hash
,
3439 gimple_canonical_type_eq
, 0);
3441 slot
= htab_find_slot (gimple_canonical_types
, t
, INSERT
);
3443 && *(tree
*)slot
!= t
)
3445 tree new_type
= (tree
) *((tree
*) slot
);
3447 TYPE_CANONICAL (t
) = new_type
;
3452 TYPE_CANONICAL (t
) = t
;
3460 /* Show statistics on references to the global type table gimple_types. */
3463 print_gimple_types_stats (const char *pfx
)
3465 if (gimple_canonical_types
)
3466 fprintf (stderr
, "[%s] GIMPLE canonical type table: size %ld, "
3467 "%ld elements, %ld searches, %ld collisions (ratio: %f)\n", pfx
,
3468 (long) htab_size (gimple_canonical_types
),
3469 (long) htab_elements (gimple_canonical_types
),
3470 (long) gimple_canonical_types
->searches
,
3471 (long) gimple_canonical_types
->collisions
,
3472 htab_collisions (gimple_canonical_types
));
3474 fprintf (stderr
, "[%s] GIMPLE canonical type table is empty\n", pfx
);
3475 if (canonical_type_hash_cache
)
3476 fprintf (stderr
, "[%s] GIMPLE canonical type hash table: size %ld, "
3477 "%ld elements, %ld searches, %ld collisions (ratio: %f)\n", pfx
,
3478 (long) htab_size (canonical_type_hash_cache
),
3479 (long) htab_elements (canonical_type_hash_cache
),
3480 (long) canonical_type_hash_cache
->searches
,
3481 (long) canonical_type_hash_cache
->collisions
,
3482 htab_collisions (canonical_type_hash_cache
));
3484 fprintf (stderr
, "[%s] GIMPLE canonical type hash table is empty\n", pfx
);
3487 /* Free the gimple type hashtables used for LTO type merging. */
3490 free_gimple_type_tables (void)
3492 if (gimple_canonical_types
)
3494 htab_delete (gimple_canonical_types
);
3495 gimple_canonical_types
= NULL
;
3497 if (canonical_type_hash_cache
)
3499 htab_delete (canonical_type_hash_cache
);
3500 canonical_type_hash_cache
= NULL
;
3505 /* Return a type the same as TYPE except unsigned or
3506 signed according to UNSIGNEDP. */
3509 gimple_signed_or_unsigned_type (bool unsignedp
, tree type
)
3513 type1
= TYPE_MAIN_VARIANT (type
);
3514 if (type1
== signed_char_type_node
3515 || type1
== char_type_node
3516 || type1
== unsigned_char_type_node
)
3517 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3518 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
3519 return unsignedp
? unsigned_type_node
: integer_type_node
;
3520 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
3521 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3522 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
3523 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3524 if (type1
== long_long_integer_type_node
3525 || type1
== long_long_unsigned_type_node
)
3527 ? long_long_unsigned_type_node
3528 : long_long_integer_type_node
;
3529 if (int128_integer_type_node
&& (type1
== int128_integer_type_node
|| type1
== int128_unsigned_type_node
))
3531 ? int128_unsigned_type_node
3532 : int128_integer_type_node
;
3533 #if HOST_BITS_PER_WIDE_INT >= 64
3534 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
3535 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3537 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
3538 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3539 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
3540 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3541 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
3542 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3543 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
3544 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3546 #define GIMPLE_FIXED_TYPES(NAME) \
3547 if (type1 == short_ ## NAME ## _type_node \
3548 || type1 == unsigned_short_ ## NAME ## _type_node) \
3549 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
3550 : short_ ## NAME ## _type_node; \
3551 if (type1 == NAME ## _type_node \
3552 || type1 == unsigned_ ## NAME ## _type_node) \
3553 return unsignedp ? unsigned_ ## NAME ## _type_node \
3554 : NAME ## _type_node; \
3555 if (type1 == long_ ## NAME ## _type_node \
3556 || type1 == unsigned_long_ ## NAME ## _type_node) \
3557 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
3558 : long_ ## NAME ## _type_node; \
3559 if (type1 == long_long_ ## NAME ## _type_node \
3560 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
3561 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
3562 : long_long_ ## NAME ## _type_node;
3564 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
3565 if (type1 == NAME ## _type_node \
3566 || type1 == u ## NAME ## _type_node) \
3567 return unsignedp ? u ## NAME ## _type_node \
3568 : NAME ## _type_node;
3570 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
3571 if (type1 == sat_ ## short_ ## NAME ## _type_node \
3572 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
3573 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
3574 : sat_ ## short_ ## NAME ## _type_node; \
3575 if (type1 == sat_ ## NAME ## _type_node \
3576 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
3577 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
3578 : sat_ ## NAME ## _type_node; \
3579 if (type1 == sat_ ## long_ ## NAME ## _type_node \
3580 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
3581 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
3582 : sat_ ## long_ ## NAME ## _type_node; \
3583 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
3584 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
3585 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
3586 : sat_ ## long_long_ ## NAME ## _type_node;
3588 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
3589 if (type1 == sat_ ## NAME ## _type_node \
3590 || type1 == sat_ ## u ## NAME ## _type_node) \
3591 return unsignedp ? sat_ ## u ## NAME ## _type_node \
3592 : sat_ ## NAME ## _type_node;
3594 GIMPLE_FIXED_TYPES (fract
);
3595 GIMPLE_FIXED_TYPES_SAT (fract
);
3596 GIMPLE_FIXED_TYPES (accum
);
3597 GIMPLE_FIXED_TYPES_SAT (accum
);
3599 GIMPLE_FIXED_MODE_TYPES (qq
);
3600 GIMPLE_FIXED_MODE_TYPES (hq
);
3601 GIMPLE_FIXED_MODE_TYPES (sq
);
3602 GIMPLE_FIXED_MODE_TYPES (dq
);
3603 GIMPLE_FIXED_MODE_TYPES (tq
);
3604 GIMPLE_FIXED_MODE_TYPES_SAT (qq
);
3605 GIMPLE_FIXED_MODE_TYPES_SAT (hq
);
3606 GIMPLE_FIXED_MODE_TYPES_SAT (sq
);
3607 GIMPLE_FIXED_MODE_TYPES_SAT (dq
);
3608 GIMPLE_FIXED_MODE_TYPES_SAT (tq
);
3609 GIMPLE_FIXED_MODE_TYPES (ha
);
3610 GIMPLE_FIXED_MODE_TYPES (sa
);
3611 GIMPLE_FIXED_MODE_TYPES (da
);
3612 GIMPLE_FIXED_MODE_TYPES (ta
);
3613 GIMPLE_FIXED_MODE_TYPES_SAT (ha
);
3614 GIMPLE_FIXED_MODE_TYPES_SAT (sa
);
3615 GIMPLE_FIXED_MODE_TYPES_SAT (da
);
3616 GIMPLE_FIXED_MODE_TYPES_SAT (ta
);
3618 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
3619 the precision; they have precision set to match their range, but
3620 may use a wider mode to match an ABI. If we change modes, we may
3621 wind up with bad conversions. For INTEGER_TYPEs in C, must check
3622 the precision as well, so as to yield correct results for
3623 bit-field types. C++ does not have these separate bit-field
3624 types, and producing a signed or unsigned variant of an
3625 ENUMERAL_TYPE may cause other problems as well. */
3626 if (!INTEGRAL_TYPE_P (type
)
3627 || TYPE_UNSIGNED (type
) == unsignedp
)
3630 #define TYPE_OK(node) \
3631 (TYPE_MODE (type) == TYPE_MODE (node) \
3632 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
3633 if (TYPE_OK (signed_char_type_node
))
3634 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
3635 if (TYPE_OK (integer_type_node
))
3636 return unsignedp
? unsigned_type_node
: integer_type_node
;
3637 if (TYPE_OK (short_integer_type_node
))
3638 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
3639 if (TYPE_OK (long_integer_type_node
))
3640 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
3641 if (TYPE_OK (long_long_integer_type_node
))
3643 ? long_long_unsigned_type_node
3644 : long_long_integer_type_node
);
3645 if (int128_integer_type_node
&& TYPE_OK (int128_integer_type_node
))
3647 ? int128_unsigned_type_node
3648 : int128_integer_type_node
);
3650 #if HOST_BITS_PER_WIDE_INT >= 64
3651 if (TYPE_OK (intTI_type_node
))
3652 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
3654 if (TYPE_OK (intDI_type_node
))
3655 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
3656 if (TYPE_OK (intSI_type_node
))
3657 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
3658 if (TYPE_OK (intHI_type_node
))
3659 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
3660 if (TYPE_OK (intQI_type_node
))
3661 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
3663 #undef GIMPLE_FIXED_TYPES
3664 #undef GIMPLE_FIXED_MODE_TYPES
3665 #undef GIMPLE_FIXED_TYPES_SAT
3666 #undef GIMPLE_FIXED_MODE_TYPES_SAT
3669 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
3673 /* Return an unsigned type the same as TYPE in other respects. */
3676 gimple_unsigned_type (tree type
)
3678 return gimple_signed_or_unsigned_type (true, type
);
3682 /* Return a signed type the same as TYPE in other respects. */
3685 gimple_signed_type (tree type
)
3687 return gimple_signed_or_unsigned_type (false, type
);
3691 /* Return the typed-based alias set for T, which may be an expression
3692 or a type. Return -1 if we don't do anything special. */
3695 gimple_get_alias_set (tree t
)
3699 /* Permit type-punning when accessing a union, provided the access
3700 is directly through the union. For example, this code does not
3701 permit taking the address of a union member and then storing
3702 through it. Even the type-punning allowed here is a GCC
3703 extension, albeit a common and useful one; the C standard says
3704 that such accesses have implementation-defined behavior. */
3706 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
3707 u
= TREE_OPERAND (u
, 0))
3708 if (TREE_CODE (u
) == COMPONENT_REF
3709 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
3712 /* That's all the expressions we handle specially. */
3716 /* For convenience, follow the C standard when dealing with
3717 character types. Any object may be accessed via an lvalue that
3718 has character type. */
3719 if (t
== char_type_node
3720 || t
== signed_char_type_node
3721 || t
== unsigned_char_type_node
)
3724 /* Allow aliasing between signed and unsigned variants of the same
3725 type. We treat the signed variant as canonical. */
3726 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
3728 tree t1
= gimple_signed_type (t
);
3730 /* t1 == t can happen for boolean nodes which are always unsigned. */
3732 return get_alias_set (t1
);
3739 /* Data structure used to count the number of dereferences to PTR
3740 inside an expression. */
3744 unsigned num_stores
;
3748 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
3749 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
3752 count_ptr_derefs (tree
*tp
, int *walk_subtrees
, void *data
)
3754 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
3755 struct count_ptr_d
*count_p
= (struct count_ptr_d
*) wi_p
->info
;
3757 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
3758 pointer 'ptr' is *not* dereferenced, it is simply used to compute
3759 the address of 'fld' as 'ptr + offsetof(fld)'. */
3760 if (TREE_CODE (*tp
) == ADDR_EXPR
)
3766 if (TREE_CODE (*tp
) == MEM_REF
&& TREE_OPERAND (*tp
, 0) == count_p
->ptr
)
3769 count_p
->num_stores
++;
3771 count_p
->num_loads
++;
3777 /* Count the number of direct and indirect uses for pointer PTR in
3778 statement STMT. The number of direct uses is stored in
3779 *NUM_USES_P. Indirect references are counted separately depending
3780 on whether they are store or load operations. The counts are
3781 stored in *NUM_STORES_P and *NUM_LOADS_P. */
3784 count_uses_and_derefs (tree ptr
, gimple stmt
, unsigned *num_uses_p
,
3785 unsigned *num_loads_p
, unsigned *num_stores_p
)
3794 /* Find out the total number of uses of PTR in STMT. */
3795 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, i
, SSA_OP_USE
)
3799 /* Now count the number of indirect references to PTR. This is
3800 truly awful, but we don't have much choice. There are no parent
3801 pointers inside INDIRECT_REFs, so an expression like
3802 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
3803 find all the indirect and direct uses of x_1 inside. The only
3804 shortcut we can take is the fact that GIMPLE only allows
3805 INDIRECT_REFs inside the expressions below. */
3806 if (is_gimple_assign (stmt
)
3807 || gimple_code (stmt
) == GIMPLE_RETURN
3808 || gimple_code (stmt
) == GIMPLE_ASM
3809 || is_gimple_call (stmt
))
3811 struct walk_stmt_info wi
;
3812 struct count_ptr_d count
;
3815 count
.num_stores
= 0;
3816 count
.num_loads
= 0;
3818 memset (&wi
, 0, sizeof (wi
));
3820 walk_gimple_op (stmt
, count_ptr_derefs
, &wi
);
3822 *num_stores_p
= count
.num_stores
;
3823 *num_loads_p
= count
.num_loads
;
3826 gcc_assert (*num_uses_p
>= *num_loads_p
+ *num_stores_p
);
3829 /* From a tree operand OP return the base of a load or store operation
3830 or NULL_TREE if OP is not a load or a store. */
3833 get_base_loadstore (tree op
)
3835 while (handled_component_p (op
))
3836 op
= TREE_OPERAND (op
, 0);
3838 || INDIRECT_REF_P (op
)
3839 || TREE_CODE (op
) == MEM_REF
3840 || TREE_CODE (op
) == TARGET_MEM_REF
)
3845 /* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and
3846 VISIT_ADDR if non-NULL on loads, store and address-taken operands
3847 passing the STMT, the base of the operand and DATA to it. The base
3848 will be either a decl, an indirect reference (including TARGET_MEM_REF)
3849 or the argument of an address expression.
3850 Returns the results of these callbacks or'ed. */
3853 walk_stmt_load_store_addr_ops (gimple stmt
, void *data
,
3854 bool (*visit_load
)(gimple
, tree
, void *),
3855 bool (*visit_store
)(gimple
, tree
, void *),
3856 bool (*visit_addr
)(gimple
, tree
, void *))
3860 if (gimple_assign_single_p (stmt
))
3865 lhs
= get_base_loadstore (gimple_assign_lhs (stmt
));
3867 ret
|= visit_store (stmt
, lhs
, data
);
3869 rhs
= gimple_assign_rhs1 (stmt
);
3870 while (handled_component_p (rhs
))
3871 rhs
= TREE_OPERAND (rhs
, 0);
3874 if (TREE_CODE (rhs
) == ADDR_EXPR
)
3875 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
3876 else if (TREE_CODE (rhs
) == TARGET_MEM_REF
3877 && TREE_CODE (TMR_BASE (rhs
)) == ADDR_EXPR
)
3878 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (rhs
), 0), data
);
3879 else if (TREE_CODE (rhs
) == OBJ_TYPE_REF
3880 && TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs
)) == ADDR_EXPR
)
3881 ret
|= visit_addr (stmt
, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs
),
3883 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
3888 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (rhs
), ix
, val
)
3889 if (TREE_CODE (val
) == ADDR_EXPR
)
3890 ret
|= visit_addr (stmt
, TREE_OPERAND (val
, 0), data
);
3891 else if (TREE_CODE (val
) == OBJ_TYPE_REF
3892 && TREE_CODE (OBJ_TYPE_REF_OBJECT (val
)) == ADDR_EXPR
)
3893 ret
|= visit_addr (stmt
,
3894 TREE_OPERAND (OBJ_TYPE_REF_OBJECT (val
),
3897 lhs
= gimple_assign_lhs (stmt
);
3898 if (TREE_CODE (lhs
) == TARGET_MEM_REF
3899 && TREE_CODE (TMR_BASE (lhs
)) == ADDR_EXPR
)
3900 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (lhs
), 0), data
);
3904 rhs
= get_base_loadstore (rhs
);
3906 ret
|= visit_load (stmt
, rhs
, data
);
3910 && (is_gimple_assign (stmt
)
3911 || gimple_code (stmt
) == GIMPLE_COND
))
3913 for (i
= 0; i
< gimple_num_ops (stmt
); ++i
)
3915 tree op
= gimple_op (stmt
, i
);
3916 if (op
== NULL_TREE
)
3918 else if (TREE_CODE (op
) == ADDR_EXPR
)
3919 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
3920 /* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison
3921 tree with two operands. */
3922 else if (i
== 1 && COMPARISON_CLASS_P (op
))
3924 if (TREE_CODE (TREE_OPERAND (op
, 0)) == ADDR_EXPR
)
3925 ret
|= visit_addr (stmt
, TREE_OPERAND (TREE_OPERAND (op
, 0),
3927 if (TREE_CODE (TREE_OPERAND (op
, 1)) == ADDR_EXPR
)
3928 ret
|= visit_addr (stmt
, TREE_OPERAND (TREE_OPERAND (op
, 1),
3933 else if (is_gimple_call (stmt
))
3937 tree lhs
= gimple_call_lhs (stmt
);
3940 lhs
= get_base_loadstore (lhs
);
3942 ret
|= visit_store (stmt
, lhs
, data
);
3945 if (visit_load
|| visit_addr
)
3946 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3948 tree rhs
= gimple_call_arg (stmt
, i
);
3950 && TREE_CODE (rhs
) == ADDR_EXPR
)
3951 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
3952 else if (visit_load
)
3954 rhs
= get_base_loadstore (rhs
);
3956 ret
|= visit_load (stmt
, rhs
, data
);
3960 && gimple_call_chain (stmt
)
3961 && TREE_CODE (gimple_call_chain (stmt
)) == ADDR_EXPR
)
3962 ret
|= visit_addr (stmt
, TREE_OPERAND (gimple_call_chain (stmt
), 0),
3965 && gimple_call_return_slot_opt_p (stmt
)
3966 && gimple_call_lhs (stmt
) != NULL_TREE
3967 && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt
))))
3968 ret
|= visit_addr (stmt
, gimple_call_lhs (stmt
), data
);
3970 else if (gimple_code (stmt
) == GIMPLE_ASM
)
3973 const char *constraint
;
3974 const char **oconstraints
;
3975 bool allows_mem
, allows_reg
, is_inout
;
3976 noutputs
= gimple_asm_noutputs (stmt
);
3977 oconstraints
= XALLOCAVEC (const char *, noutputs
);
3978 if (visit_store
|| visit_addr
)
3979 for (i
= 0; i
< gimple_asm_noutputs (stmt
); ++i
)
3981 tree link
= gimple_asm_output_op (stmt
, i
);
3982 tree op
= get_base_loadstore (TREE_VALUE (link
));
3983 if (op
&& visit_store
)
3984 ret
|= visit_store (stmt
, op
, data
);
3987 constraint
= TREE_STRING_POINTER
3988 (TREE_VALUE (TREE_PURPOSE (link
)));
3989 oconstraints
[i
] = constraint
;
3990 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
3991 &allows_reg
, &is_inout
);
3992 if (op
&& !allows_reg
&& allows_mem
)
3993 ret
|= visit_addr (stmt
, op
, data
);
3996 if (visit_load
|| visit_addr
)
3997 for (i
= 0; i
< gimple_asm_ninputs (stmt
); ++i
)
3999 tree link
= gimple_asm_input_op (stmt
, i
);
4000 tree op
= TREE_VALUE (link
);
4002 && TREE_CODE (op
) == ADDR_EXPR
)
4003 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
4004 else if (visit_load
|| visit_addr
)
4006 op
= get_base_loadstore (op
);
4010 ret
|= visit_load (stmt
, op
, data
);
4013 constraint
= TREE_STRING_POINTER
4014 (TREE_VALUE (TREE_PURPOSE (link
)));
4015 parse_input_constraint (&constraint
, 0, 0, noutputs
,
4017 &allows_mem
, &allows_reg
);
4018 if (!allows_reg
&& allows_mem
)
4019 ret
|= visit_addr (stmt
, op
, data
);
4025 else if (gimple_code (stmt
) == GIMPLE_RETURN
)
4027 tree op
= gimple_return_retval (stmt
);
4031 && TREE_CODE (op
) == ADDR_EXPR
)
4032 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
4033 else if (visit_load
)
4035 op
= get_base_loadstore (op
);
4037 ret
|= visit_load (stmt
, op
, data
);
4042 && gimple_code (stmt
) == GIMPLE_PHI
)
4044 for (i
= 0; i
< gimple_phi_num_args (stmt
); ++i
)
4046 tree op
= PHI_ARG_DEF (stmt
, i
);
4047 if (TREE_CODE (op
) == ADDR_EXPR
)
4048 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
4055 /* Like walk_stmt_load_store_addr_ops but with NULL visit_addr. IPA-CP
4056 should make a faster clone for this case. */
4059 walk_stmt_load_store_ops (gimple stmt
, void *data
,
4060 bool (*visit_load
)(gimple
, tree
, void *),
4061 bool (*visit_store
)(gimple
, tree
, void *))
4063 return walk_stmt_load_store_addr_ops (stmt
, data
,
4064 visit_load
, visit_store
, NULL
);
4067 /* Helper for gimple_ior_addresses_taken_1. */
4070 gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED
,
4071 tree addr
, void *data
)
4073 bitmap addresses_taken
= (bitmap
)data
;
4074 addr
= get_base_address (addr
);
4078 bitmap_set_bit (addresses_taken
, DECL_UID (addr
));
4084 /* Set the bit for the uid of all decls that have their address taken
4085 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
4086 were any in this stmt. */
4089 gimple_ior_addresses_taken (bitmap addresses_taken
, gimple stmt
)
4091 return walk_stmt_load_store_addr_ops (stmt
, addresses_taken
, NULL
, NULL
,
4092 gimple_ior_addresses_taken_1
);
4096 /* Return a printable name for symbol DECL. */
4099 gimple_decl_printable_name (tree decl
, int verbosity
)
4101 if (!DECL_NAME (decl
))
4104 if (DECL_ASSEMBLER_NAME_SET_P (decl
))
4106 const char *str
, *mangled_str
;
4107 int dmgl_opts
= DMGL_NO_OPTS
;
4111 dmgl_opts
= DMGL_VERBOSE
4115 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4116 dmgl_opts
|= DMGL_PARAMS
;
4119 mangled_str
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4120 str
= cplus_demangle_v3 (mangled_str
, dmgl_opts
);
4121 return (str
) ? str
: mangled_str
;
4124 return IDENTIFIER_POINTER (DECL_NAME (decl
));
4127 /* Return true when STMT is builtins call to CODE. */
4130 gimple_call_builtin_p (gimple stmt
, enum built_in_function code
)
4133 return (is_gimple_call (stmt
)
4134 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL
4135 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
4136 && DECL_FUNCTION_CODE (fndecl
) == code
);
4139 /* Return true if STMT clobbers memory. STMT is required to be a
4143 gimple_asm_clobbers_memory_p (const_gimple stmt
)
4147 for (i
= 0; i
< gimple_asm_nclobbers (stmt
); i
++)
4149 tree op
= gimple_asm_clobber_op (stmt
, i
);
4150 if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op
)), "memory") == 0)
4156 #include "gt-gimple.h"