1 /* Gimple IR support functions.
3 Copyright 2007, 2008, 2009, 2010 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"
33 #include "diagnostic.h"
34 #include "tree-flow.h"
35 #include "value-prof.h"
40 /* Global type table. FIXME lto, it should be possible to re-use some
41 of the type hashing routines in tree.c (type_hash_canon, type_hash_lookup,
42 etc), but those assume that types were built with the various
43 build_*_type routines which is not the case with the streamer. */
44 static htab_t gimple_types
;
45 static struct pointer_map_t
*type_hash_cache
;
47 /* Global type comparison cache. */
48 static htab_t gtc_visited
;
49 static struct obstack gtc_ob
;
51 /* All the tuples have their operand vector (if present) at the very bottom
52 of the structure. Therefore, the offset required to find the
53 operands vector the size of the structure minus the size of the 1
54 element tree array at the end (see gimple_ops). */
55 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \
56 (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0),
57 EXPORTED_CONST
size_t gimple_ops_offset_
[] = {
58 #include "gsstruct.def"
62 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof(struct STRUCT),
63 static const size_t gsstruct_code_size
[] = {
64 #include "gsstruct.def"
68 #define DEFGSCODE(SYM, NAME, GSSCODE) NAME,
69 const char *const gimple_code_name
[] = {
74 #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE,
75 EXPORTED_CONST
enum gimple_statement_structure_enum gss_for_code_
[] = {
80 #ifdef GATHER_STATISTICS
83 int gimple_alloc_counts
[(int) gimple_alloc_kind_all
];
84 int gimple_alloc_sizes
[(int) gimple_alloc_kind_all
];
86 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
87 static const char * const gimple_alloc_kind_names
[] = {
95 #endif /* GATHER_STATISTICS */
97 /* A cache of gimple_seq objects. Sequences are created and destroyed
98 fairly often during gimplification. */
99 static GTY ((deletable
)) struct gimple_seq_d
*gimple_seq_cache
;
101 /* Private API manipulation functions shared only with some
103 extern void gimple_set_stored_syms (gimple
, bitmap
, bitmap_obstack
*);
104 extern void gimple_set_loaded_syms (gimple
, bitmap
, bitmap_obstack
*);
106 /* Gimple tuple constructors.
107 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
108 be passed a NULL to start with an empty sequence. */
110 /* Set the code for statement G to CODE. */
113 gimple_set_code (gimple g
, enum gimple_code code
)
115 g
->gsbase
.code
= code
;
118 /* Return the number of bytes needed to hold a GIMPLE statement with
122 gimple_size (enum gimple_code code
)
124 return gsstruct_code_size
[gss_for_code (code
)];
127 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
131 gimple_alloc_stat (enum gimple_code code
, unsigned num_ops MEM_STAT_DECL
)
136 size
= gimple_size (code
);
138 size
+= sizeof (tree
) * (num_ops
- 1);
140 #ifdef GATHER_STATISTICS
142 enum gimple_alloc_kind kind
= gimple_alloc_kind (code
);
143 gimple_alloc_counts
[(int) kind
]++;
144 gimple_alloc_sizes
[(int) kind
] += size
;
148 stmt
= ggc_alloc_cleared_gimple_statement_d_stat (size PASS_MEM_STAT
);
149 gimple_set_code (stmt
, code
);
150 gimple_set_num_ops (stmt
, num_ops
);
152 /* Do not call gimple_set_modified here as it has other side
153 effects and this tuple is still not completely built. */
154 stmt
->gsbase
.modified
= 1;
159 /* Set SUBCODE to be the code of the expression computed by statement G. */
162 gimple_set_subcode (gimple g
, unsigned subcode
)
164 /* We only have 16 bits for the RHS code. Assert that we are not
166 gcc_assert (subcode
< (1 << 16));
167 g
->gsbase
.subcode
= subcode
;
172 /* Build a tuple with operands. CODE is the statement to build (which
173 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the sub-code
174 for the new tuple. NUM_OPS is the number of operands to allocate. */
176 #define gimple_build_with_ops(c, s, n) \
177 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
180 gimple_build_with_ops_stat (enum gimple_code code
, unsigned subcode
,
181 unsigned num_ops MEM_STAT_DECL
)
183 gimple s
= gimple_alloc_stat (code
, num_ops PASS_MEM_STAT
);
184 gimple_set_subcode (s
, subcode
);
190 /* Build a GIMPLE_RETURN statement returning RETVAL. */
193 gimple_build_return (tree retval
)
195 gimple s
= gimple_build_with_ops (GIMPLE_RETURN
, ERROR_MARK
, 1);
197 gimple_return_set_retval (s
, retval
);
201 /* Reset alias information on call S. */
204 gimple_call_reset_alias_info (gimple s
)
206 if (gimple_call_flags (s
) & ECF_CONST
)
207 memset (gimple_call_use_set (s
), 0, sizeof (struct pt_solution
));
209 pt_solution_reset (gimple_call_use_set (s
));
210 if (gimple_call_flags (s
) & (ECF_CONST
|ECF_PURE
|ECF_NOVOPS
))
211 memset (gimple_call_clobber_set (s
), 0, sizeof (struct pt_solution
));
213 pt_solution_reset (gimple_call_clobber_set (s
));
216 /* Helper for gimple_build_call, gimple_build_call_vec and
217 gimple_build_call_from_tree. Build the basic components of a
218 GIMPLE_CALL statement to function FN with NARGS arguments. */
221 gimple_build_call_1 (tree fn
, unsigned nargs
)
223 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
224 if (TREE_CODE (fn
) == FUNCTION_DECL
)
225 fn
= build_fold_addr_expr (fn
);
226 gimple_set_op (s
, 1, fn
);
227 gimple_call_reset_alias_info (s
);
232 /* Build a GIMPLE_CALL statement to function FN with the arguments
233 specified in vector ARGS. */
236 gimple_build_call_vec (tree fn
, VEC(tree
, heap
) *args
)
239 unsigned nargs
= VEC_length (tree
, args
);
240 gimple call
= gimple_build_call_1 (fn
, nargs
);
242 for (i
= 0; i
< nargs
; i
++)
243 gimple_call_set_arg (call
, i
, VEC_index (tree
, args
, i
));
249 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
250 arguments. The ... are the arguments. */
253 gimple_build_call (tree fn
, unsigned nargs
, ...)
259 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
261 call
= gimple_build_call_1 (fn
, nargs
);
263 va_start (ap
, nargs
);
264 for (i
= 0; i
< nargs
; i
++)
265 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
272 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
273 assumed to be in GIMPLE form already. Minimal checking is done of
277 gimple_build_call_from_tree (tree t
)
281 tree fndecl
= get_callee_fndecl (t
);
283 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
285 nargs
= call_expr_nargs (t
);
286 call
= gimple_build_call_1 (fndecl
? fndecl
: CALL_EXPR_FN (t
), nargs
);
288 for (i
= 0; i
< nargs
; i
++)
289 gimple_call_set_arg (call
, i
, CALL_EXPR_ARG (t
, i
));
291 gimple_set_block (call
, TREE_BLOCK (t
));
293 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
294 gimple_call_set_chain (call
, CALL_EXPR_STATIC_CHAIN (t
));
295 gimple_call_set_tail (call
, CALL_EXPR_TAILCALL (t
));
296 gimple_call_set_cannot_inline (call
, CALL_CANNOT_INLINE_P (t
));
297 gimple_call_set_return_slot_opt (call
, CALL_EXPR_RETURN_SLOT_OPT (t
));
298 gimple_call_set_from_thunk (call
, CALL_FROM_THUNK_P (t
));
299 gimple_call_set_va_arg_pack (call
, CALL_EXPR_VA_ARG_PACK (t
));
300 gimple_call_set_nothrow (call
, TREE_NOTHROW (t
));
301 gimple_set_no_warning (call
, TREE_NO_WARNING (t
));
307 /* Extract the operands and code for expression EXPR into *SUBCODE_P,
308 *OP1_P, *OP2_P and *OP3_P respectively. */
311 extract_ops_from_tree_1 (tree expr
, enum tree_code
*subcode_p
, tree
*op1_p
,
312 tree
*op2_p
, tree
*op3_p
)
314 enum gimple_rhs_class grhs_class
;
316 *subcode_p
= TREE_CODE (expr
);
317 grhs_class
= get_gimple_rhs_class (*subcode_p
);
319 if (grhs_class
== GIMPLE_TERNARY_RHS
)
321 *op1_p
= TREE_OPERAND (expr
, 0);
322 *op2_p
= TREE_OPERAND (expr
, 1);
323 *op3_p
= TREE_OPERAND (expr
, 2);
325 else if (grhs_class
== GIMPLE_BINARY_RHS
)
327 *op1_p
= TREE_OPERAND (expr
, 0);
328 *op2_p
= TREE_OPERAND (expr
, 1);
331 else if (grhs_class
== GIMPLE_UNARY_RHS
)
333 *op1_p
= TREE_OPERAND (expr
, 0);
337 else if (grhs_class
== GIMPLE_SINGLE_RHS
)
348 /* Build a GIMPLE_ASSIGN statement.
350 LHS of the assignment.
351 RHS of the assignment which can be unary or binary. */
354 gimple_build_assign_stat (tree lhs
, tree rhs MEM_STAT_DECL
)
356 enum tree_code subcode
;
359 extract_ops_from_tree_1 (rhs
, &subcode
, &op1
, &op2
, &op3
);
360 return gimple_build_assign_with_ops_stat (subcode
, lhs
, op1
, op2
, op3
365 /* Build a GIMPLE_ASSIGN statement with sub-code SUBCODE and operands
366 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
367 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
370 gimple_build_assign_with_ops_stat (enum tree_code subcode
, tree lhs
, tree op1
,
371 tree op2
, tree op3 MEM_STAT_DECL
)
376 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
378 num_ops
= get_gimple_rhs_num_ops (subcode
) + 1;
380 p
= gimple_build_with_ops_stat (GIMPLE_ASSIGN
, (unsigned)subcode
, num_ops
382 gimple_assign_set_lhs (p
, lhs
);
383 gimple_assign_set_rhs1 (p
, op1
);
386 gcc_assert (num_ops
> 2);
387 gimple_assign_set_rhs2 (p
, op2
);
392 gcc_assert (num_ops
> 3);
393 gimple_assign_set_rhs3 (p
, op3
);
400 /* Build a new GIMPLE_ASSIGN tuple and append it to the end of *SEQ_P.
402 DST/SRC are the destination and source respectively. You can pass
403 ungimplified trees in DST or SRC, in which case they will be
404 converted to a gimple operand if necessary.
406 This function returns the newly created GIMPLE_ASSIGN tuple. */
409 gimplify_assign (tree dst
, tree src
, gimple_seq
*seq_p
)
411 tree t
= build2 (MODIFY_EXPR
, TREE_TYPE (dst
), dst
, src
);
412 gimplify_and_add (t
, seq_p
);
414 return gimple_seq_last_stmt (*seq_p
);
418 /* Build a GIMPLE_COND statement.
420 PRED is the condition used to compare LHS and the RHS.
421 T_LABEL is the label to jump to if the condition is true.
422 F_LABEL is the label to jump to otherwise. */
425 gimple_build_cond (enum tree_code pred_code
, tree lhs
, tree rhs
,
426 tree t_label
, tree f_label
)
430 gcc_assert (TREE_CODE_CLASS (pred_code
) == tcc_comparison
);
431 p
= gimple_build_with_ops (GIMPLE_COND
, pred_code
, 4);
432 gimple_cond_set_lhs (p
, lhs
);
433 gimple_cond_set_rhs (p
, rhs
);
434 gimple_cond_set_true_label (p
, t_label
);
435 gimple_cond_set_false_label (p
, f_label
);
440 /* Extract operands for a GIMPLE_COND statement out of COND_EXPR tree COND. */
443 gimple_cond_get_ops_from_tree (tree cond
, enum tree_code
*code_p
,
444 tree
*lhs_p
, tree
*rhs_p
)
446 location_t loc
= EXPR_LOCATION (cond
);
447 gcc_assert (TREE_CODE_CLASS (TREE_CODE (cond
)) == tcc_comparison
448 || TREE_CODE (cond
) == TRUTH_NOT_EXPR
449 || is_gimple_min_invariant (cond
)
450 || SSA_VAR_P (cond
));
452 extract_ops_from_tree (cond
, code_p
, lhs_p
, rhs_p
);
454 /* Canonicalize conditionals of the form 'if (!VAL)'. */
455 if (*code_p
== TRUTH_NOT_EXPR
)
458 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
459 *rhs_p
= fold_convert_loc (loc
, TREE_TYPE (*lhs_p
), integer_zero_node
);
461 /* Canonicalize conditionals of the form 'if (VAL)' */
462 else if (TREE_CODE_CLASS (*code_p
) != tcc_comparison
)
465 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
466 *rhs_p
= fold_convert_loc (loc
, TREE_TYPE (*lhs_p
), integer_zero_node
);
471 /* Build a GIMPLE_COND statement from the conditional expression tree
472 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
475 gimple_build_cond_from_tree (tree cond
, tree t_label
, tree f_label
)
480 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
481 return gimple_build_cond (code
, lhs
, rhs
, t_label
, f_label
);
484 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
485 boolean expression tree COND. */
488 gimple_cond_set_condition_from_tree (gimple stmt
, tree cond
)
493 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
494 gimple_cond_set_condition (stmt
, code
, lhs
, rhs
);
497 /* Build a GIMPLE_LABEL statement for LABEL. */
500 gimple_build_label (tree label
)
502 gimple p
= gimple_build_with_ops (GIMPLE_LABEL
, ERROR_MARK
, 1);
503 gimple_label_set_label (p
, label
);
507 /* Build a GIMPLE_GOTO statement to label DEST. */
510 gimple_build_goto (tree dest
)
512 gimple p
= gimple_build_with_ops (GIMPLE_GOTO
, ERROR_MARK
, 1);
513 gimple_goto_set_dest (p
, dest
);
518 /* Build a GIMPLE_NOP statement. */
521 gimple_build_nop (void)
523 return gimple_alloc (GIMPLE_NOP
, 0);
527 /* Build a GIMPLE_BIND statement.
528 VARS are the variables in BODY.
529 BLOCK is the containing block. */
532 gimple_build_bind (tree vars
, gimple_seq body
, tree block
)
534 gimple p
= gimple_alloc (GIMPLE_BIND
, 0);
535 gimple_bind_set_vars (p
, vars
);
537 gimple_bind_set_body (p
, body
);
539 gimple_bind_set_block (p
, block
);
543 /* Helper function to set the simple fields of a asm stmt.
545 STRING is a pointer to a string that is the asm blocks assembly code.
546 NINPUT is the number of register inputs.
547 NOUTPUT is the number of register outputs.
548 NCLOBBERS is the number of clobbered registers.
552 gimple_build_asm_1 (const char *string
, unsigned ninputs
, unsigned noutputs
,
553 unsigned nclobbers
, unsigned nlabels
)
556 int size
= strlen (string
);
558 /* ASMs with labels cannot have outputs. This should have been
559 enforced by the front end. */
560 gcc_assert (nlabels
== 0 || noutputs
== 0);
562 p
= gimple_build_with_ops (GIMPLE_ASM
, ERROR_MARK
,
563 ninputs
+ noutputs
+ nclobbers
+ nlabels
);
565 p
->gimple_asm
.ni
= ninputs
;
566 p
->gimple_asm
.no
= noutputs
;
567 p
->gimple_asm
.nc
= nclobbers
;
568 p
->gimple_asm
.nl
= nlabels
;
569 p
->gimple_asm
.string
= ggc_alloc_string (string
, size
);
571 #ifdef GATHER_STATISTICS
572 gimple_alloc_sizes
[(int) gimple_alloc_kind (GIMPLE_ASM
)] += size
;
578 /* Build a GIMPLE_ASM statement.
580 STRING is the assembly code.
581 NINPUT is the number of register inputs.
582 NOUTPUT is the number of register outputs.
583 NCLOBBERS is the number of clobbered registers.
584 INPUTS is a vector of the input register parameters.
585 OUTPUTS is a vector of the output register parameters.
586 CLOBBERS is a vector of the clobbered register parameters.
587 LABELS is a vector of destination labels. */
590 gimple_build_asm_vec (const char *string
, VEC(tree
,gc
)* inputs
,
591 VEC(tree
,gc
)* outputs
, VEC(tree
,gc
)* clobbers
,
592 VEC(tree
,gc
)* labels
)
597 p
= gimple_build_asm_1 (string
,
598 VEC_length (tree
, inputs
),
599 VEC_length (tree
, outputs
),
600 VEC_length (tree
, clobbers
),
601 VEC_length (tree
, labels
));
603 for (i
= 0; i
< VEC_length (tree
, inputs
); i
++)
604 gimple_asm_set_input_op (p
, i
, VEC_index (tree
, inputs
, i
));
606 for (i
= 0; i
< VEC_length (tree
, outputs
); i
++)
607 gimple_asm_set_output_op (p
, i
, VEC_index (tree
, outputs
, i
));
609 for (i
= 0; i
< VEC_length (tree
, clobbers
); i
++)
610 gimple_asm_set_clobber_op (p
, i
, VEC_index (tree
, clobbers
, i
));
612 for (i
= 0; i
< VEC_length (tree
, labels
); i
++)
613 gimple_asm_set_label_op (p
, i
, VEC_index (tree
, labels
, i
));
618 /* Build a GIMPLE_CATCH statement.
620 TYPES are the catch types.
621 HANDLER is the exception handler. */
624 gimple_build_catch (tree types
, gimple_seq handler
)
626 gimple p
= gimple_alloc (GIMPLE_CATCH
, 0);
627 gimple_catch_set_types (p
, types
);
629 gimple_catch_set_handler (p
, handler
);
634 /* Build a GIMPLE_EH_FILTER statement.
636 TYPES are the filter's types.
637 FAILURE is the filter's failure action. */
640 gimple_build_eh_filter (tree types
, gimple_seq failure
)
642 gimple p
= gimple_alloc (GIMPLE_EH_FILTER
, 0);
643 gimple_eh_filter_set_types (p
, types
);
645 gimple_eh_filter_set_failure (p
, failure
);
650 /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */
653 gimple_build_eh_must_not_throw (tree decl
)
655 gimple p
= gimple_alloc (GIMPLE_EH_MUST_NOT_THROW
, 0);
657 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
658 gcc_assert (flags_from_decl_or_type (decl
) & ECF_NORETURN
);
659 gimple_eh_must_not_throw_set_fndecl (p
, decl
);
664 /* Build a GIMPLE_TRY statement.
666 EVAL is the expression to evaluate.
667 CLEANUP is the cleanup expression.
668 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
669 whether this is a try/catch or a try/finally respectively. */
672 gimple_build_try (gimple_seq eval
, gimple_seq cleanup
,
673 enum gimple_try_flags kind
)
677 gcc_assert (kind
== GIMPLE_TRY_CATCH
|| kind
== GIMPLE_TRY_FINALLY
);
678 p
= gimple_alloc (GIMPLE_TRY
, 0);
679 gimple_set_subcode (p
, kind
);
681 gimple_try_set_eval (p
, eval
);
683 gimple_try_set_cleanup (p
, cleanup
);
688 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
690 CLEANUP is the cleanup expression. */
693 gimple_build_wce (gimple_seq cleanup
)
695 gimple p
= gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR
, 0);
697 gimple_wce_set_cleanup (p
, cleanup
);
703 /* Build a GIMPLE_RESX statement. */
706 gimple_build_resx (int region
)
708 gimple p
= gimple_build_with_ops (GIMPLE_RESX
, ERROR_MARK
, 0);
709 p
->gimple_eh_ctrl
.region
= region
;
714 /* The helper for constructing a gimple switch statement.
715 INDEX is the switch's index.
716 NLABELS is the number of labels in the switch excluding the default.
717 DEFAULT_LABEL is the default label for the switch statement. */
720 gimple_build_switch_nlabels (unsigned nlabels
, tree index
, tree default_label
)
722 /* nlabels + 1 default label + 1 index. */
723 gimple p
= gimple_build_with_ops (GIMPLE_SWITCH
, ERROR_MARK
,
724 1 + (default_label
!= NULL
) + nlabels
);
725 gimple_switch_set_index (p
, index
);
727 gimple_switch_set_default_label (p
, default_label
);
732 /* Build a GIMPLE_SWITCH statement.
734 INDEX is the switch's index.
735 NLABELS is the number of labels in the switch excluding the DEFAULT_LABEL.
736 ... are the labels excluding the default. */
739 gimple_build_switch (unsigned nlabels
, tree index
, tree default_label
, ...)
743 gimple p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
745 /* Store the rest of the labels. */
746 va_start (al
, default_label
);
747 offset
= (default_label
!= NULL
);
748 for (i
= 0; i
< nlabels
; i
++)
749 gimple_switch_set_label (p
, i
+ offset
, va_arg (al
, tree
));
756 /* Build a GIMPLE_SWITCH statement.
758 INDEX is the switch's index.
759 DEFAULT_LABEL is the default label
760 ARGS is a vector of labels excluding the default. */
763 gimple_build_switch_vec (tree index
, tree default_label
, VEC(tree
, heap
) *args
)
765 unsigned i
, offset
, nlabels
= VEC_length (tree
, args
);
766 gimple p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
768 /* Copy the labels from the vector to the switch statement. */
769 offset
= (default_label
!= NULL
);
770 for (i
= 0; i
< nlabels
; i
++)
771 gimple_switch_set_label (p
, i
+ offset
, VEC_index (tree
, args
, i
));
776 /* Build a GIMPLE_EH_DISPATCH statement. */
779 gimple_build_eh_dispatch (int region
)
781 gimple p
= gimple_build_with_ops (GIMPLE_EH_DISPATCH
, ERROR_MARK
, 0);
782 p
->gimple_eh_ctrl
.region
= region
;
786 /* Build a new GIMPLE_DEBUG_BIND statement.
788 VAR is bound to VALUE; block and location are taken from STMT. */
791 gimple_build_debug_bind_stat (tree var
, tree value
, gimple stmt MEM_STAT_DECL
)
793 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
794 (unsigned)GIMPLE_DEBUG_BIND
, 2
797 gimple_debug_bind_set_var (p
, var
);
798 gimple_debug_bind_set_value (p
, value
);
801 gimple_set_block (p
, gimple_block (stmt
));
802 gimple_set_location (p
, gimple_location (stmt
));
809 /* Build a GIMPLE_OMP_CRITICAL statement.
811 BODY is the sequence of statements for which only one thread can execute.
812 NAME is optional identifier for this critical block. */
815 gimple_build_omp_critical (gimple_seq body
, tree name
)
817 gimple p
= gimple_alloc (GIMPLE_OMP_CRITICAL
, 0);
818 gimple_omp_critical_set_name (p
, name
);
820 gimple_omp_set_body (p
, body
);
825 /* Build a GIMPLE_OMP_FOR statement.
827 BODY is sequence of statements inside the for loop.
828 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
829 lastprivate, reductions, ordered, schedule, and nowait.
830 COLLAPSE is the collapse count.
831 PRE_BODY is the sequence of statements that are loop invariant. */
834 gimple_build_omp_for (gimple_seq body
, tree clauses
, size_t collapse
,
837 gimple p
= gimple_alloc (GIMPLE_OMP_FOR
, 0);
839 gimple_omp_set_body (p
, body
);
840 gimple_omp_for_set_clauses (p
, clauses
);
841 p
->gimple_omp_for
.collapse
= collapse
;
842 p
->gimple_omp_for
.iter
843 = ggc_alloc_cleared_vec_gimple_omp_for_iter (collapse
);
845 gimple_omp_for_set_pre_body (p
, pre_body
);
851 /* Build a GIMPLE_OMP_PARALLEL statement.
853 BODY is sequence of statements which are executed in parallel.
854 CLAUSES, are the OMP parallel construct's clauses.
855 CHILD_FN is the function created for the parallel threads to execute.
856 DATA_ARG are the shared data argument(s). */
859 gimple_build_omp_parallel (gimple_seq body
, tree clauses
, tree child_fn
,
862 gimple p
= gimple_alloc (GIMPLE_OMP_PARALLEL
, 0);
864 gimple_omp_set_body (p
, body
);
865 gimple_omp_parallel_set_clauses (p
, clauses
);
866 gimple_omp_parallel_set_child_fn (p
, child_fn
);
867 gimple_omp_parallel_set_data_arg (p
, data_arg
);
873 /* Build a GIMPLE_OMP_TASK statement.
875 BODY is sequence of statements which are executed by the explicit task.
876 CLAUSES, are the OMP parallel construct's clauses.
877 CHILD_FN is the function created for the parallel threads to execute.
878 DATA_ARG are the shared data argument(s).
879 COPY_FN is the optional function for firstprivate initialization.
880 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
883 gimple_build_omp_task (gimple_seq body
, tree clauses
, tree child_fn
,
884 tree data_arg
, tree copy_fn
, tree arg_size
,
887 gimple p
= gimple_alloc (GIMPLE_OMP_TASK
, 0);
889 gimple_omp_set_body (p
, body
);
890 gimple_omp_task_set_clauses (p
, clauses
);
891 gimple_omp_task_set_child_fn (p
, child_fn
);
892 gimple_omp_task_set_data_arg (p
, data_arg
);
893 gimple_omp_task_set_copy_fn (p
, copy_fn
);
894 gimple_omp_task_set_arg_size (p
, arg_size
);
895 gimple_omp_task_set_arg_align (p
, arg_align
);
901 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
903 BODY is the sequence of statements in the section. */
906 gimple_build_omp_section (gimple_seq body
)
908 gimple p
= gimple_alloc (GIMPLE_OMP_SECTION
, 0);
910 gimple_omp_set_body (p
, body
);
916 /* Build a GIMPLE_OMP_MASTER statement.
918 BODY is the sequence of statements to be executed by just the master. */
921 gimple_build_omp_master (gimple_seq body
)
923 gimple p
= gimple_alloc (GIMPLE_OMP_MASTER
, 0);
925 gimple_omp_set_body (p
, body
);
931 /* Build a GIMPLE_OMP_CONTINUE statement.
933 CONTROL_DEF is the definition of the control variable.
934 CONTROL_USE is the use of the control variable. */
937 gimple_build_omp_continue (tree control_def
, tree control_use
)
939 gimple p
= gimple_alloc (GIMPLE_OMP_CONTINUE
, 0);
940 gimple_omp_continue_set_control_def (p
, control_def
);
941 gimple_omp_continue_set_control_use (p
, control_use
);
945 /* Build a GIMPLE_OMP_ORDERED statement.
947 BODY is the sequence of statements inside a loop that will executed in
951 gimple_build_omp_ordered (gimple_seq body
)
953 gimple p
= gimple_alloc (GIMPLE_OMP_ORDERED
, 0);
955 gimple_omp_set_body (p
, body
);
961 /* Build a GIMPLE_OMP_RETURN statement.
962 WAIT_P is true if this is a non-waiting return. */
965 gimple_build_omp_return (bool wait_p
)
967 gimple p
= gimple_alloc (GIMPLE_OMP_RETURN
, 0);
969 gimple_omp_return_set_nowait (p
);
975 /* Build a GIMPLE_OMP_SECTIONS statement.
977 BODY is a sequence of section statements.
978 CLAUSES are any of the OMP sections contsruct's clauses: private,
979 firstprivate, lastprivate, reduction, and nowait. */
982 gimple_build_omp_sections (gimple_seq body
, tree clauses
)
984 gimple p
= gimple_alloc (GIMPLE_OMP_SECTIONS
, 0);
986 gimple_omp_set_body (p
, body
);
987 gimple_omp_sections_set_clauses (p
, clauses
);
993 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
996 gimple_build_omp_sections_switch (void)
998 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH
, 0);
1002 /* Build a GIMPLE_OMP_SINGLE statement.
1004 BODY is the sequence of statements that will be executed once.
1005 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
1006 copyprivate, nowait. */
1009 gimple_build_omp_single (gimple_seq body
, tree clauses
)
1011 gimple p
= gimple_alloc (GIMPLE_OMP_SINGLE
, 0);
1013 gimple_omp_set_body (p
, body
);
1014 gimple_omp_single_set_clauses (p
, clauses
);
1020 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1023 gimple_build_omp_atomic_load (tree lhs
, tree rhs
)
1025 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD
, 0);
1026 gimple_omp_atomic_load_set_lhs (p
, lhs
);
1027 gimple_omp_atomic_load_set_rhs (p
, rhs
);
1031 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1033 VAL is the value we are storing. */
1036 gimple_build_omp_atomic_store (tree val
)
1038 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_STORE
, 0);
1039 gimple_omp_atomic_store_set_val (p
, val
);
1043 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1044 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1047 gimple_build_predict (enum br_predictor predictor
, enum prediction outcome
)
1049 gimple p
= gimple_alloc (GIMPLE_PREDICT
, 0);
1050 /* Ensure all the predictors fit into the lower bits of the subcode. */
1051 gcc_assert ((int) END_PREDICTORS
<= GF_PREDICT_TAKEN
);
1052 gimple_predict_set_predictor (p
, predictor
);
1053 gimple_predict_set_outcome (p
, outcome
);
1057 #if defined ENABLE_GIMPLE_CHECKING
1058 /* Complain of a gimple type mismatch and die. */
1061 gimple_check_failed (const_gimple gs
, const char *file
, int line
,
1062 const char *function
, enum gimple_code code
,
1063 enum tree_code subcode
)
1065 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1066 gimple_code_name
[code
],
1067 tree_code_name
[subcode
],
1068 gimple_code_name
[gimple_code (gs
)],
1069 gs
->gsbase
.subcode
> 0
1070 ? tree_code_name
[gs
->gsbase
.subcode
]
1072 function
, trim_filename (file
), line
);
1074 #endif /* ENABLE_GIMPLE_CHECKING */
1077 /* Allocate a new GIMPLE sequence in GC memory and return it. If
1078 there are free sequences in GIMPLE_SEQ_CACHE return one of those
1082 gimple_seq_alloc (void)
1084 gimple_seq seq
= gimple_seq_cache
;
1087 gimple_seq_cache
= gimple_seq_cache
->next_free
;
1088 gcc_assert (gimple_seq_cache
!= seq
);
1089 memset (seq
, 0, sizeof (*seq
));
1093 seq
= ggc_alloc_cleared_gimple_seq_d ();
1094 #ifdef GATHER_STATISTICS
1095 gimple_alloc_counts
[(int) gimple_alloc_kind_seq
]++;
1096 gimple_alloc_sizes
[(int) gimple_alloc_kind_seq
] += sizeof (*seq
);
1103 /* Return SEQ to the free pool of GIMPLE sequences. */
1106 gimple_seq_free (gimple_seq seq
)
1111 gcc_assert (gimple_seq_first (seq
) == NULL
);
1112 gcc_assert (gimple_seq_last (seq
) == NULL
);
1114 /* If this triggers, it's a sign that the same list is being freed
1116 gcc_assert (seq
!= gimple_seq_cache
|| gimple_seq_cache
== NULL
);
1118 /* Add SEQ to the pool of free sequences. */
1119 seq
->next_free
= gimple_seq_cache
;
1120 gimple_seq_cache
= seq
;
1124 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1125 *SEQ_P is NULL, a new sequence is allocated. */
1128 gimple_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
1130 gimple_stmt_iterator si
;
1136 *seq_p
= gimple_seq_alloc ();
1138 si
= gsi_last (*seq_p
);
1139 gsi_insert_after (&si
, gs
, GSI_NEW_STMT
);
1143 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1144 NULL, a new sequence is allocated. */
1147 gimple_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
1149 gimple_stmt_iterator si
;
1155 *dst_p
= gimple_seq_alloc ();
1157 si
= gsi_last (*dst_p
);
1158 gsi_insert_seq_after (&si
, src
, GSI_NEW_STMT
);
1162 /* Helper function of empty_body_p. Return true if STMT is an empty
1166 empty_stmt_p (gimple stmt
)
1168 if (gimple_code (stmt
) == GIMPLE_NOP
)
1170 if (gimple_code (stmt
) == GIMPLE_BIND
)
1171 return empty_body_p (gimple_bind_body (stmt
));
1176 /* Return true if BODY contains nothing but empty statements. */
1179 empty_body_p (gimple_seq body
)
1181 gimple_stmt_iterator i
;
1183 if (gimple_seq_empty_p (body
))
1185 for (i
= gsi_start (body
); !gsi_end_p (i
); gsi_next (&i
))
1186 if (!empty_stmt_p (gsi_stmt (i
))
1187 && !is_gimple_debug (gsi_stmt (i
)))
1194 /* Perform a deep copy of sequence SRC and return the result. */
1197 gimple_seq_copy (gimple_seq src
)
1199 gimple_stmt_iterator gsi
;
1200 gimple_seq new_seq
= gimple_seq_alloc ();
1203 for (gsi
= gsi_start (src
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1205 stmt
= gimple_copy (gsi_stmt (gsi
));
1206 gimple_seq_add_stmt (&new_seq
, stmt
);
1213 /* Walk all the statements in the sequence SEQ calling walk_gimple_stmt
1214 on each one. WI is as in walk_gimple_stmt.
1216 If walk_gimple_stmt returns non-NULL, the walk is stopped, the
1217 value is stored in WI->CALLBACK_RESULT and the statement that
1218 produced the value is returned.
1220 Otherwise, all the statements are walked and NULL returned. */
1223 walk_gimple_seq (gimple_seq seq
, walk_stmt_fn callback_stmt
,
1224 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1226 gimple_stmt_iterator gsi
;
1228 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1230 tree ret
= walk_gimple_stmt (&gsi
, callback_stmt
, callback_op
, wi
);
1233 /* If CALLBACK_STMT or CALLBACK_OP return a value, WI must exist
1236 wi
->callback_result
= ret
;
1237 return gsi_stmt (gsi
);
1242 wi
->callback_result
= NULL_TREE
;
1248 /* Helper function for walk_gimple_stmt. Walk operands of a GIMPLE_ASM. */
1251 walk_gimple_asm (gimple stmt
, walk_tree_fn callback_op
,
1252 struct walk_stmt_info
*wi
)
1256 const char **oconstraints
;
1258 const char *constraint
;
1259 bool allows_mem
, allows_reg
, is_inout
;
1261 noutputs
= gimple_asm_noutputs (stmt
);
1262 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
1267 for (i
= 0; i
< noutputs
; i
++)
1269 op
= gimple_asm_output_op (stmt
, i
);
1270 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1271 oconstraints
[i
] = constraint
;
1272 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
, &allows_reg
,
1275 wi
->val_only
= (allows_reg
|| !allows_mem
);
1276 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1281 n
= gimple_asm_ninputs (stmt
);
1282 for (i
= 0; i
< n
; i
++)
1284 op
= gimple_asm_input_op (stmt
, i
);
1285 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1286 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
1287 oconstraints
, &allows_mem
, &allows_reg
);
1290 wi
->val_only
= (allows_reg
|| !allows_mem
);
1291 /* Although input "m" is not really a LHS, we need a lvalue. */
1292 wi
->is_lhs
= !wi
->val_only
;
1294 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1302 wi
->val_only
= true;
1305 n
= gimple_asm_nlabels (stmt
);
1306 for (i
= 0; i
< n
; i
++)
1308 op
= gimple_asm_label_op (stmt
, i
);
1309 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1318 /* Helper function of WALK_GIMPLE_STMT. Walk every tree operand in
1319 STMT. CALLBACK_OP and WI are as in WALK_GIMPLE_STMT.
1321 CALLBACK_OP is called on each operand of STMT via walk_tree.
1322 Additional parameters to walk_tree must be stored in WI. For each operand
1323 OP, walk_tree is called as:
1325 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
1327 If CALLBACK_OP returns non-NULL for an operand, the remaining
1328 operands are not scanned.
1330 The return value is that returned by the last call to walk_tree, or
1331 NULL_TREE if no CALLBACK_OP is specified. */
1334 walk_gimple_op (gimple stmt
, walk_tree_fn callback_op
,
1335 struct walk_stmt_info
*wi
)
1337 struct pointer_set_t
*pset
= (wi
) ? wi
->pset
: NULL
;
1339 tree ret
= NULL_TREE
;
1341 switch (gimple_code (stmt
))
1344 /* Walk the RHS operands. If the LHS is of a non-renamable type or
1345 is a register variable, we may use a COMPONENT_REF on the RHS. */
1348 tree lhs
= gimple_assign_lhs (stmt
);
1350 = (is_gimple_reg_type (TREE_TYPE (lhs
)) && !is_gimple_reg (lhs
))
1351 || !gimple_assign_single_p (stmt
);
1354 for (i
= 1; i
< gimple_num_ops (stmt
); i
++)
1356 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
,
1362 /* Walk the LHS. If the RHS is appropriate for a memory, we
1363 may use a COMPONENT_REF on the LHS. */
1366 /* If the RHS has more than 1 operand, it is not appropriate
1368 wi
->val_only
= !is_gimple_mem_rhs (gimple_assign_rhs1 (stmt
))
1369 || !gimple_assign_single_p (stmt
);
1373 ret
= walk_tree (gimple_op_ptr (stmt
, 0), callback_op
, wi
, pset
);
1379 wi
->val_only
= true;
1388 wi
->val_only
= true;
1391 ret
= walk_tree (gimple_call_chain_ptr (stmt
), callback_op
, wi
, pset
);
1395 ret
= walk_tree (gimple_call_fn_ptr (stmt
), callback_op
, wi
, pset
);
1399 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
1402 wi
->val_only
= is_gimple_reg_type (gimple_call_arg (stmt
, i
));
1403 ret
= walk_tree (gimple_call_arg_ptr (stmt
, i
), callback_op
, wi
,
1409 if (gimple_call_lhs (stmt
))
1414 wi
->val_only
= is_gimple_reg_type (gimple_call_lhs (stmt
));
1417 ret
= walk_tree (gimple_call_lhs_ptr (stmt
), callback_op
, wi
, pset
);
1425 wi
->val_only
= true;
1430 ret
= walk_tree (gimple_catch_types_ptr (stmt
), callback_op
, wi
,
1436 case GIMPLE_EH_FILTER
:
1437 ret
= walk_tree (gimple_eh_filter_types_ptr (stmt
), callback_op
, wi
,
1444 ret
= walk_gimple_asm (stmt
, callback_op
, wi
);
1449 case GIMPLE_OMP_CONTINUE
:
1450 ret
= walk_tree (gimple_omp_continue_control_def_ptr (stmt
),
1451 callback_op
, wi
, pset
);
1455 ret
= walk_tree (gimple_omp_continue_control_use_ptr (stmt
),
1456 callback_op
, wi
, pset
);
1461 case GIMPLE_OMP_CRITICAL
:
1462 ret
= walk_tree (gimple_omp_critical_name_ptr (stmt
), callback_op
, wi
,
1468 case GIMPLE_OMP_FOR
:
1469 ret
= walk_tree (gimple_omp_for_clauses_ptr (stmt
), callback_op
, wi
,
1473 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1475 ret
= walk_tree (gimple_omp_for_index_ptr (stmt
, i
), callback_op
,
1479 ret
= walk_tree (gimple_omp_for_initial_ptr (stmt
, i
), callback_op
,
1483 ret
= walk_tree (gimple_omp_for_final_ptr (stmt
, i
), callback_op
,
1487 ret
= walk_tree (gimple_omp_for_incr_ptr (stmt
, i
), callback_op
,
1494 case GIMPLE_OMP_PARALLEL
:
1495 ret
= walk_tree (gimple_omp_parallel_clauses_ptr (stmt
), callback_op
,
1499 ret
= walk_tree (gimple_omp_parallel_child_fn_ptr (stmt
), callback_op
,
1503 ret
= walk_tree (gimple_omp_parallel_data_arg_ptr (stmt
), callback_op
,
1509 case GIMPLE_OMP_TASK
:
1510 ret
= walk_tree (gimple_omp_task_clauses_ptr (stmt
), callback_op
,
1514 ret
= walk_tree (gimple_omp_task_child_fn_ptr (stmt
), callback_op
,
1518 ret
= walk_tree (gimple_omp_task_data_arg_ptr (stmt
), callback_op
,
1522 ret
= walk_tree (gimple_omp_task_copy_fn_ptr (stmt
), callback_op
,
1526 ret
= walk_tree (gimple_omp_task_arg_size_ptr (stmt
), callback_op
,
1530 ret
= walk_tree (gimple_omp_task_arg_align_ptr (stmt
), callback_op
,
1536 case GIMPLE_OMP_SECTIONS
:
1537 ret
= walk_tree (gimple_omp_sections_clauses_ptr (stmt
), callback_op
,
1542 ret
= walk_tree (gimple_omp_sections_control_ptr (stmt
), callback_op
,
1549 case GIMPLE_OMP_SINGLE
:
1550 ret
= walk_tree (gimple_omp_single_clauses_ptr (stmt
), callback_op
, wi
,
1556 case GIMPLE_OMP_ATOMIC_LOAD
:
1557 ret
= walk_tree (gimple_omp_atomic_load_lhs_ptr (stmt
), callback_op
, wi
,
1562 ret
= walk_tree (gimple_omp_atomic_load_rhs_ptr (stmt
), callback_op
, wi
,
1568 case GIMPLE_OMP_ATOMIC_STORE
:
1569 ret
= walk_tree (gimple_omp_atomic_store_val_ptr (stmt
), callback_op
,
1575 /* Tuples that do not have operands. */
1578 case GIMPLE_OMP_RETURN
:
1579 case GIMPLE_PREDICT
:
1584 enum gimple_statement_structure_enum gss
;
1585 gss
= gimple_statement_structure (stmt
);
1586 if (gss
== GSS_WITH_OPS
|| gss
== GSS_WITH_MEM_OPS
)
1587 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1589 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
, pset
);
1601 /* Walk the current statement in GSI (optionally using traversal state
1602 stored in WI). If WI is NULL, no state is kept during traversal.
1603 The callback CALLBACK_STMT is called. If CALLBACK_STMT indicates
1604 that it has handled all the operands of the statement, its return
1605 value is returned. Otherwise, the return value from CALLBACK_STMT
1606 is discarded and its operands are scanned.
1608 If CALLBACK_STMT is NULL or it didn't handle the operands,
1609 CALLBACK_OP is called on each operand of the statement via
1610 walk_gimple_op. If walk_gimple_op returns non-NULL for any
1611 operand, the remaining operands are not scanned. In this case, the
1612 return value from CALLBACK_OP is returned.
1614 In any other case, NULL_TREE is returned. */
1617 walk_gimple_stmt (gimple_stmt_iterator
*gsi
, walk_stmt_fn callback_stmt
,
1618 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1622 gimple stmt
= gsi_stmt (*gsi
);
1627 if (wi
&& wi
->want_locations
&& gimple_has_location (stmt
))
1628 input_location
= gimple_location (stmt
);
1632 /* Invoke the statement callback. Return if the callback handled
1633 all of STMT operands by itself. */
1636 bool handled_ops
= false;
1637 tree_ret
= callback_stmt (gsi
, &handled_ops
, wi
);
1641 /* If CALLBACK_STMT did not handle operands, it should not have
1642 a value to return. */
1643 gcc_assert (tree_ret
== NULL
);
1645 /* Re-read stmt in case the callback changed it. */
1646 stmt
= gsi_stmt (*gsi
);
1649 /* If CALLBACK_OP is defined, invoke it on every operand of STMT. */
1652 tree_ret
= walk_gimple_op (stmt
, callback_op
, wi
);
1657 /* If STMT can have statements inside (e.g. GIMPLE_BIND), walk them. */
1658 switch (gimple_code (stmt
))
1661 ret
= walk_gimple_seq (gimple_bind_body (stmt
), callback_stmt
,
1664 return wi
->callback_result
;
1668 ret
= walk_gimple_seq (gimple_catch_handler (stmt
), callback_stmt
,
1671 return wi
->callback_result
;
1674 case GIMPLE_EH_FILTER
:
1675 ret
= walk_gimple_seq (gimple_eh_filter_failure (stmt
), callback_stmt
,
1678 return wi
->callback_result
;
1682 ret
= walk_gimple_seq (gimple_try_eval (stmt
), callback_stmt
, callback_op
,
1685 return wi
->callback_result
;
1687 ret
= walk_gimple_seq (gimple_try_cleanup (stmt
), callback_stmt
,
1690 return wi
->callback_result
;
1693 case GIMPLE_OMP_FOR
:
1694 ret
= walk_gimple_seq (gimple_omp_for_pre_body (stmt
), callback_stmt
,
1697 return wi
->callback_result
;
1700 case GIMPLE_OMP_CRITICAL
:
1701 case GIMPLE_OMP_MASTER
:
1702 case GIMPLE_OMP_ORDERED
:
1703 case GIMPLE_OMP_SECTION
:
1704 case GIMPLE_OMP_PARALLEL
:
1705 case GIMPLE_OMP_TASK
:
1706 case GIMPLE_OMP_SECTIONS
:
1707 case GIMPLE_OMP_SINGLE
:
1708 ret
= walk_gimple_seq (gimple_omp_body (stmt
), callback_stmt
, callback_op
,
1711 return wi
->callback_result
;
1714 case GIMPLE_WITH_CLEANUP_EXPR
:
1715 ret
= walk_gimple_seq (gimple_wce_cleanup (stmt
), callback_stmt
,
1718 return wi
->callback_result
;
1722 gcc_assert (!gimple_has_substatements (stmt
));
1730 /* Set sequence SEQ to be the GIMPLE body for function FN. */
1733 gimple_set_body (tree fndecl
, gimple_seq seq
)
1735 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1738 /* If FNDECL still does not have a function structure associated
1739 with it, then it does not make sense for it to receive a
1741 gcc_assert (seq
== NULL
);
1744 fn
->gimple_body
= seq
;
1748 /* Return the body of GIMPLE statements for function FN. After the
1749 CFG pass, the function body doesn't exist anymore because it has
1750 been split up into basic blocks. In this case, it returns
1754 gimple_body (tree fndecl
)
1756 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1757 return fn
? fn
->gimple_body
: NULL
;
1760 /* Return true when FNDECL has Gimple body either in unlowered
1763 gimple_has_body_p (tree fndecl
)
1765 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1766 return (gimple_body (fndecl
) || (fn
&& fn
->cfg
));
1769 /* Detect flags from a GIMPLE_CALL. This is just like
1770 call_expr_flags, but for gimple tuples. */
1773 gimple_call_flags (const_gimple stmt
)
1776 tree decl
= gimple_call_fndecl (stmt
);
1780 flags
= flags_from_decl_or_type (decl
);
1783 t
= TREE_TYPE (gimple_call_fn (stmt
));
1784 if (t
&& TREE_CODE (t
) == POINTER_TYPE
)
1785 flags
= flags_from_decl_or_type (TREE_TYPE (t
));
1790 if (stmt
->gsbase
.subcode
& GF_CALL_NOTHROW
)
1791 flags
|= ECF_NOTHROW
;
1796 /* Detects argument flags for argument number ARG on call STMT. */
1799 gimple_call_arg_flags (const_gimple stmt
, unsigned arg
)
1801 tree type
= TREE_TYPE (TREE_TYPE (gimple_call_fn (stmt
)));
1802 tree attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
1806 attr
= TREE_VALUE (TREE_VALUE (attr
));
1807 if (1 + arg
>= (unsigned) TREE_STRING_LENGTH (attr
))
1810 switch (TREE_STRING_POINTER (attr
)[1 + arg
])
1817 return EAF_DIRECT
| EAF_NOCLOBBER
| EAF_NOESCAPE
;
1820 return EAF_NOCLOBBER
| EAF_NOESCAPE
;
1823 return EAF_DIRECT
| EAF_NOESCAPE
;
1826 return EAF_NOESCAPE
;
1834 /* Detects return flags for the call STMT. */
1837 gimple_call_return_flags (const_gimple stmt
)
1840 tree attr
= NULL_TREE
;
1842 if (gimple_call_flags (stmt
) & ECF_MALLOC
)
1845 type
= TREE_TYPE (TREE_TYPE (gimple_call_fn (stmt
)));
1846 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
1850 attr
= TREE_VALUE (TREE_VALUE (attr
));
1851 if (TREE_STRING_LENGTH (attr
) < 1)
1854 switch (TREE_STRING_POINTER (attr
)[0])
1860 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
1871 /* Return true if GS is a copy assignment. */
1874 gimple_assign_copy_p (gimple gs
)
1876 return gimple_code (gs
) == GIMPLE_ASSIGN
1877 && get_gimple_rhs_class (gimple_assign_rhs_code (gs
))
1878 == GIMPLE_SINGLE_RHS
1879 && is_gimple_val (gimple_op (gs
, 1));
1883 /* Return true if GS is a SSA_NAME copy assignment. */
1886 gimple_assign_ssa_name_copy_p (gimple gs
)
1888 return (gimple_code (gs
) == GIMPLE_ASSIGN
1889 && (get_gimple_rhs_class (gimple_assign_rhs_code (gs
))
1890 == GIMPLE_SINGLE_RHS
)
1891 && TREE_CODE (gimple_assign_lhs (gs
)) == SSA_NAME
1892 && TREE_CODE (gimple_assign_rhs1 (gs
)) == SSA_NAME
);
1896 /* Return true if GS is an assignment with a singleton RHS, i.e.,
1897 there is no operator associated with the assignment itself.
1898 Unlike gimple_assign_copy_p, this predicate returns true for
1899 any RHS operand, including those that perform an operation
1900 and do not have the semantics of a copy, such as COND_EXPR. */
1903 gimple_assign_single_p (gimple gs
)
1905 return (gimple_code (gs
) == GIMPLE_ASSIGN
1906 && get_gimple_rhs_class (gimple_assign_rhs_code (gs
))
1907 == GIMPLE_SINGLE_RHS
);
1910 /* Return true if GS is an assignment with a unary RHS, but the
1911 operator has no effect on the assigned value. The logic is adapted
1912 from STRIP_NOPS. This predicate is intended to be used in tuplifying
1913 instances in which STRIP_NOPS was previously applied to the RHS of
1916 NOTE: In the use cases that led to the creation of this function
1917 and of gimple_assign_single_p, it is typical to test for either
1918 condition and to proceed in the same manner. In each case, the
1919 assigned value is represented by the single RHS operand of the
1920 assignment. I suspect there may be cases where gimple_assign_copy_p,
1921 gimple_assign_single_p, or equivalent logic is used where a similar
1922 treatment of unary NOPs is appropriate. */
1925 gimple_assign_unary_nop_p (gimple gs
)
1927 return (gimple_code (gs
) == GIMPLE_ASSIGN
1928 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs
))
1929 || gimple_assign_rhs_code (gs
) == NON_LVALUE_EXPR
)
1930 && gimple_assign_rhs1 (gs
) != error_mark_node
1931 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs
)))
1932 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs
)))));
1935 /* Set BB to be the basic block holding G. */
1938 gimple_set_bb (gimple stmt
, basic_block bb
)
1940 stmt
->gsbase
.bb
= bb
;
1942 /* If the statement is a label, add the label to block-to-labels map
1943 so that we can speed up edge creation for GIMPLE_GOTOs. */
1944 if (cfun
->cfg
&& gimple_code (stmt
) == GIMPLE_LABEL
)
1949 t
= gimple_label_label (stmt
);
1950 uid
= LABEL_DECL_UID (t
);
1953 unsigned old_len
= VEC_length (basic_block
, label_to_block_map
);
1954 LABEL_DECL_UID (t
) = uid
= cfun
->cfg
->last_label_uid
++;
1955 if (old_len
<= (unsigned) uid
)
1957 unsigned new_len
= 3 * uid
/ 2 + 1;
1959 VEC_safe_grow_cleared (basic_block
, gc
, label_to_block_map
,
1964 VEC_replace (basic_block
, label_to_block_map
, uid
, bb
);
1969 /* Modify the RHS of the assignment pointed-to by GSI using the
1970 operands in the expression tree EXPR.
1972 NOTE: The statement pointed-to by GSI may be reallocated if it
1973 did not have enough operand slots.
1975 This function is useful to convert an existing tree expression into
1976 the flat representation used for the RHS of a GIMPLE assignment.
1977 It will reallocate memory as needed to expand or shrink the number
1978 of operand slots needed to represent EXPR.
1980 NOTE: If you find yourself building a tree and then calling this
1981 function, you are most certainly doing it the slow way. It is much
1982 better to build a new assignment or to use the function
1983 gimple_assign_set_rhs_with_ops, which does not require an
1984 expression tree to be built. */
1987 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator
*gsi
, tree expr
)
1989 enum tree_code subcode
;
1992 extract_ops_from_tree_1 (expr
, &subcode
, &op1
, &op2
, &op3
);
1993 gimple_assign_set_rhs_with_ops_1 (gsi
, subcode
, op1
, op2
, op3
);
1997 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
1998 operands OP1, OP2 and OP3.
2000 NOTE: The statement pointed-to by GSI may be reallocated if it
2001 did not have enough operand slots. */
2004 gimple_assign_set_rhs_with_ops_1 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
2005 tree op1
, tree op2
, tree op3
)
2007 unsigned new_rhs_ops
= get_gimple_rhs_num_ops (code
);
2008 gimple stmt
= gsi_stmt (*gsi
);
2010 /* If the new CODE needs more operands, allocate a new statement. */
2011 if (gimple_num_ops (stmt
) < new_rhs_ops
+ 1)
2013 tree lhs
= gimple_assign_lhs (stmt
);
2014 gimple new_stmt
= gimple_alloc (gimple_code (stmt
), new_rhs_ops
+ 1);
2015 memcpy (new_stmt
, stmt
, gimple_size (gimple_code (stmt
)));
2016 gsi_replace (gsi
, new_stmt
, true);
2019 /* The LHS needs to be reset as this also changes the SSA name
2021 gimple_assign_set_lhs (stmt
, lhs
);
2024 gimple_set_num_ops (stmt
, new_rhs_ops
+ 1);
2025 gimple_set_subcode (stmt
, code
);
2026 gimple_assign_set_rhs1 (stmt
, op1
);
2027 if (new_rhs_ops
> 1)
2028 gimple_assign_set_rhs2 (stmt
, op2
);
2029 if (new_rhs_ops
> 2)
2030 gimple_assign_set_rhs3 (stmt
, op3
);
2034 /* Return the LHS of a statement that performs an assignment,
2035 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
2036 for a call to a function that returns no value, or for a
2037 statement other than an assignment or a call. */
2040 gimple_get_lhs (const_gimple stmt
)
2042 enum gimple_code code
= gimple_code (stmt
);
2044 if (code
== GIMPLE_ASSIGN
)
2045 return gimple_assign_lhs (stmt
);
2046 else if (code
== GIMPLE_CALL
)
2047 return gimple_call_lhs (stmt
);
2053 /* Set the LHS of a statement that performs an assignment,
2054 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2057 gimple_set_lhs (gimple stmt
, tree lhs
)
2059 enum gimple_code code
= gimple_code (stmt
);
2061 if (code
== GIMPLE_ASSIGN
)
2062 gimple_assign_set_lhs (stmt
, lhs
);
2063 else if (code
== GIMPLE_CALL
)
2064 gimple_call_set_lhs (stmt
, lhs
);
2069 /* Replace the LHS of STMT, an assignment, either a GIMPLE_ASSIGN or a
2070 GIMPLE_CALL, with NLHS, in preparation for modifying the RHS to an
2071 expression with a different value.
2073 This will update any annotations (say debug bind stmts) referring
2074 to the original LHS, so that they use the RHS instead. This is
2075 done even if NLHS and LHS are the same, for it is understood that
2076 the RHS will be modified afterwards, and NLHS will not be assigned
2077 an equivalent value.
2079 Adjusting any non-annotation uses of the LHS, if needed, is a
2080 responsibility of the caller.
2082 The effect of this call should be pretty much the same as that of
2083 inserting a copy of STMT before STMT, and then removing the
2084 original stmt, at which time gsi_remove() would have update
2085 annotations, but using this function saves all the inserting,
2086 copying and removing. */
2089 gimple_replace_lhs (gimple stmt
, tree nlhs
)
2091 if (MAY_HAVE_DEBUG_STMTS
)
2093 tree lhs
= gimple_get_lhs (stmt
);
2095 gcc_assert (SSA_NAME_DEF_STMT (lhs
) == stmt
);
2097 insert_debug_temp_for_var_def (NULL
, lhs
);
2100 gimple_set_lhs (stmt
, nlhs
);
2103 /* Return a deep copy of statement STMT. All the operands from STMT
2104 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
2105 and VUSE operand arrays are set to empty in the new copy. */
2108 gimple_copy (gimple stmt
)
2110 enum gimple_code code
= gimple_code (stmt
);
2111 unsigned num_ops
= gimple_num_ops (stmt
);
2112 gimple copy
= gimple_alloc (code
, num_ops
);
2115 /* Shallow copy all the fields from STMT. */
2116 memcpy (copy
, stmt
, gimple_size (code
));
2118 /* If STMT has sub-statements, deep-copy them as well. */
2119 if (gimple_has_substatements (stmt
))
2124 switch (gimple_code (stmt
))
2127 new_seq
= gimple_seq_copy (gimple_bind_body (stmt
));
2128 gimple_bind_set_body (copy
, new_seq
);
2129 gimple_bind_set_vars (copy
, unshare_expr (gimple_bind_vars (stmt
)));
2130 gimple_bind_set_block (copy
, gimple_bind_block (stmt
));
2134 new_seq
= gimple_seq_copy (gimple_catch_handler (stmt
));
2135 gimple_catch_set_handler (copy
, new_seq
);
2136 t
= unshare_expr (gimple_catch_types (stmt
));
2137 gimple_catch_set_types (copy
, t
);
2140 case GIMPLE_EH_FILTER
:
2141 new_seq
= gimple_seq_copy (gimple_eh_filter_failure (stmt
));
2142 gimple_eh_filter_set_failure (copy
, new_seq
);
2143 t
= unshare_expr (gimple_eh_filter_types (stmt
));
2144 gimple_eh_filter_set_types (copy
, t
);
2148 new_seq
= gimple_seq_copy (gimple_try_eval (stmt
));
2149 gimple_try_set_eval (copy
, new_seq
);
2150 new_seq
= gimple_seq_copy (gimple_try_cleanup (stmt
));
2151 gimple_try_set_cleanup (copy
, new_seq
);
2154 case GIMPLE_OMP_FOR
:
2155 new_seq
= gimple_seq_copy (gimple_omp_for_pre_body (stmt
));
2156 gimple_omp_for_set_pre_body (copy
, new_seq
);
2157 t
= unshare_expr (gimple_omp_for_clauses (stmt
));
2158 gimple_omp_for_set_clauses (copy
, t
);
2159 copy
->gimple_omp_for
.iter
2160 = ggc_alloc_vec_gimple_omp_for_iter
2161 (gimple_omp_for_collapse (stmt
));
2162 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
2164 gimple_omp_for_set_cond (copy
, i
,
2165 gimple_omp_for_cond (stmt
, i
));
2166 gimple_omp_for_set_index (copy
, i
,
2167 gimple_omp_for_index (stmt
, i
));
2168 t
= unshare_expr (gimple_omp_for_initial (stmt
, i
));
2169 gimple_omp_for_set_initial (copy
, i
, t
);
2170 t
= unshare_expr (gimple_omp_for_final (stmt
, i
));
2171 gimple_omp_for_set_final (copy
, i
, t
);
2172 t
= unshare_expr (gimple_omp_for_incr (stmt
, i
));
2173 gimple_omp_for_set_incr (copy
, i
, t
);
2177 case GIMPLE_OMP_PARALLEL
:
2178 t
= unshare_expr (gimple_omp_parallel_clauses (stmt
));
2179 gimple_omp_parallel_set_clauses (copy
, t
);
2180 t
= unshare_expr (gimple_omp_parallel_child_fn (stmt
));
2181 gimple_omp_parallel_set_child_fn (copy
, t
);
2182 t
= unshare_expr (gimple_omp_parallel_data_arg (stmt
));
2183 gimple_omp_parallel_set_data_arg (copy
, t
);
2186 case GIMPLE_OMP_TASK
:
2187 t
= unshare_expr (gimple_omp_task_clauses (stmt
));
2188 gimple_omp_task_set_clauses (copy
, t
);
2189 t
= unshare_expr (gimple_omp_task_child_fn (stmt
));
2190 gimple_omp_task_set_child_fn (copy
, t
);
2191 t
= unshare_expr (gimple_omp_task_data_arg (stmt
));
2192 gimple_omp_task_set_data_arg (copy
, t
);
2193 t
= unshare_expr (gimple_omp_task_copy_fn (stmt
));
2194 gimple_omp_task_set_copy_fn (copy
, t
);
2195 t
= unshare_expr (gimple_omp_task_arg_size (stmt
));
2196 gimple_omp_task_set_arg_size (copy
, t
);
2197 t
= unshare_expr (gimple_omp_task_arg_align (stmt
));
2198 gimple_omp_task_set_arg_align (copy
, t
);
2201 case GIMPLE_OMP_CRITICAL
:
2202 t
= unshare_expr (gimple_omp_critical_name (stmt
));
2203 gimple_omp_critical_set_name (copy
, t
);
2206 case GIMPLE_OMP_SECTIONS
:
2207 t
= unshare_expr (gimple_omp_sections_clauses (stmt
));
2208 gimple_omp_sections_set_clauses (copy
, t
);
2209 t
= unshare_expr (gimple_omp_sections_control (stmt
));
2210 gimple_omp_sections_set_control (copy
, t
);
2213 case GIMPLE_OMP_SINGLE
:
2214 case GIMPLE_OMP_SECTION
:
2215 case GIMPLE_OMP_MASTER
:
2216 case GIMPLE_OMP_ORDERED
:
2218 new_seq
= gimple_seq_copy (gimple_omp_body (stmt
));
2219 gimple_omp_set_body (copy
, new_seq
);
2222 case GIMPLE_WITH_CLEANUP_EXPR
:
2223 new_seq
= gimple_seq_copy (gimple_wce_cleanup (stmt
));
2224 gimple_wce_set_cleanup (copy
, new_seq
);
2232 /* Make copy of operands. */
2235 for (i
= 0; i
< num_ops
; i
++)
2236 gimple_set_op (copy
, i
, unshare_expr (gimple_op (stmt
, i
)));
2238 /* Clear out SSA operand vectors on COPY. */
2239 if (gimple_has_ops (stmt
))
2241 gimple_set_def_ops (copy
, NULL
);
2242 gimple_set_use_ops (copy
, NULL
);
2245 if (gimple_has_mem_ops (stmt
))
2247 gimple_set_vdef (copy
, gimple_vdef (stmt
));
2248 gimple_set_vuse (copy
, gimple_vuse (stmt
));
2251 /* SSA operands need to be updated. */
2252 gimple_set_modified (copy
, true);
2259 /* Set the MODIFIED flag to MODIFIEDP, iff the gimple statement G has
2260 a MODIFIED field. */
2263 gimple_set_modified (gimple s
, bool modifiedp
)
2265 if (gimple_has_ops (s
))
2267 s
->gsbase
.modified
= (unsigned) modifiedp
;
2271 && is_gimple_call (s
)
2272 && gimple_call_noreturn_p (s
))
2273 VEC_safe_push (gimple
, gc
, MODIFIED_NORETURN_CALLS (cfun
), s
);
2278 /* Return true if statement S has side-effects. We consider a
2279 statement to have side effects if:
2281 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
2282 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
2285 gimple_has_side_effects (const_gimple s
)
2289 if (is_gimple_debug (s
))
2292 /* We don't have to scan the arguments to check for
2293 volatile arguments, though, at present, we still
2294 do a scan to check for TREE_SIDE_EFFECTS. */
2295 if (gimple_has_volatile_ops (s
))
2298 if (is_gimple_call (s
))
2300 unsigned nargs
= gimple_call_num_args (s
);
2302 if (!(gimple_call_flags (s
) & (ECF_CONST
| ECF_PURE
)))
2304 else if (gimple_call_flags (s
) & ECF_LOOPING_CONST_OR_PURE
)
2305 /* An infinite loop is considered a side effect. */
2308 if (gimple_call_lhs (s
)
2309 && TREE_SIDE_EFFECTS (gimple_call_lhs (s
)))
2311 gcc_assert (gimple_has_volatile_ops (s
));
2315 if (TREE_SIDE_EFFECTS (gimple_call_fn (s
)))
2318 for (i
= 0; i
< nargs
; i
++)
2319 if (TREE_SIDE_EFFECTS (gimple_call_arg (s
, i
)))
2321 gcc_assert (gimple_has_volatile_ops (s
));
2329 for (i
= 0; i
< gimple_num_ops (s
); i
++)
2330 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
)))
2332 gcc_assert (gimple_has_volatile_ops (s
));
2340 /* Return true if the RHS of statement S has side effects.
2341 We may use it to determine if it is admissable to replace
2342 an assignment or call with a copy of a previously-computed
2343 value. In such cases, side-effects due the the LHS are
2347 gimple_rhs_has_side_effects (const_gimple s
)
2351 if (is_gimple_call (s
))
2353 unsigned nargs
= gimple_call_num_args (s
);
2355 if (!(gimple_call_flags (s
) & (ECF_CONST
| ECF_PURE
)))
2358 /* We cannot use gimple_has_volatile_ops here,
2359 because we must ignore a volatile LHS. */
2360 if (TREE_SIDE_EFFECTS (gimple_call_fn (s
))
2361 || TREE_THIS_VOLATILE (gimple_call_fn (s
)))
2363 gcc_assert (gimple_has_volatile_ops (s
));
2367 for (i
= 0; i
< nargs
; i
++)
2368 if (TREE_SIDE_EFFECTS (gimple_call_arg (s
, i
))
2369 || TREE_THIS_VOLATILE (gimple_call_arg (s
, i
)))
2374 else if (is_gimple_assign (s
))
2376 /* Skip the first operand, the LHS. */
2377 for (i
= 1; i
< gimple_num_ops (s
); i
++)
2378 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
))
2379 || TREE_THIS_VOLATILE (gimple_op (s
, i
)))
2381 gcc_assert (gimple_has_volatile_ops (s
));
2385 else if (is_gimple_debug (s
))
2389 /* For statements without an LHS, examine all arguments. */
2390 for (i
= 0; i
< gimple_num_ops (s
); i
++)
2391 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
))
2392 || TREE_THIS_VOLATILE (gimple_op (s
, i
)))
2394 gcc_assert (gimple_has_volatile_ops (s
));
2403 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
2404 Return true if S can trap. If INCLUDE_LHS is true and S is a
2405 GIMPLE_ASSIGN, the LHS of the assignment is also checked.
2406 Otherwise, only the RHS of the assignment is checked. */
2409 gimple_could_trap_p_1 (gimple s
, bool include_lhs
)
2412 tree t
, div
= NULL_TREE
;
2415 start
= (is_gimple_assign (s
) && !include_lhs
) ? 1 : 0;
2417 for (i
= start
; i
< gimple_num_ops (s
); i
++)
2418 if (tree_could_trap_p (gimple_op (s
, i
)))
2421 switch (gimple_code (s
))
2424 return gimple_asm_volatile_p (s
);
2427 t
= gimple_call_fndecl (s
);
2428 /* Assume that calls to weak functions may trap. */
2429 if (!t
|| !DECL_P (t
) || DECL_WEAK (t
))
2434 t
= gimple_expr_type (s
);
2435 op
= gimple_assign_rhs_code (s
);
2436 if (get_gimple_rhs_class (op
) == GIMPLE_BINARY_RHS
)
2437 div
= gimple_assign_rhs2 (s
);
2438 return (operation_could_trap_p (op
, FLOAT_TYPE_P (t
),
2439 (INTEGRAL_TYPE_P (t
)
2440 && TYPE_OVERFLOW_TRAPS (t
)),
2452 /* Return true if statement S can trap. */
2455 gimple_could_trap_p (gimple s
)
2457 return gimple_could_trap_p_1 (s
, true);
2461 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
2464 gimple_assign_rhs_could_trap_p (gimple s
)
2466 gcc_assert (is_gimple_assign (s
));
2467 return gimple_could_trap_p_1 (s
, false);
2471 /* Print debugging information for gimple stmts generated. */
2474 dump_gimple_statistics (void)
2476 #ifdef GATHER_STATISTICS
2477 int i
, total_tuples
= 0, total_bytes
= 0;
2479 fprintf (stderr
, "\nGIMPLE statements\n");
2480 fprintf (stderr
, "Kind Stmts Bytes\n");
2481 fprintf (stderr
, "---------------------------------------\n");
2482 for (i
= 0; i
< (int) gimple_alloc_kind_all
; ++i
)
2484 fprintf (stderr
, "%-20s %7d %10d\n", gimple_alloc_kind_names
[i
],
2485 gimple_alloc_counts
[i
], gimple_alloc_sizes
[i
]);
2486 total_tuples
+= gimple_alloc_counts
[i
];
2487 total_bytes
+= gimple_alloc_sizes
[i
];
2489 fprintf (stderr
, "---------------------------------------\n");
2490 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_tuples
, total_bytes
);
2491 fprintf (stderr
, "---------------------------------------\n");
2493 fprintf (stderr
, "No gimple statistics\n");
2498 /* Return the number of operands needed on the RHS of a GIMPLE
2499 assignment for an expression with tree code CODE. */
2502 get_gimple_rhs_num_ops (enum tree_code code
)
2504 enum gimple_rhs_class rhs_class
= get_gimple_rhs_class (code
);
2506 if (rhs_class
== GIMPLE_UNARY_RHS
|| rhs_class
== GIMPLE_SINGLE_RHS
)
2508 else if (rhs_class
== GIMPLE_BINARY_RHS
)
2510 else if (rhs_class
== GIMPLE_TERNARY_RHS
)
2516 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
2518 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
2519 : ((TYPE) == tcc_binary \
2520 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
2521 : ((TYPE) == tcc_constant \
2522 || (TYPE) == tcc_declaration \
2523 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
2524 : ((SYM) == TRUTH_AND_EXPR \
2525 || (SYM) == TRUTH_OR_EXPR \
2526 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
2527 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
2528 : ((SYM) == WIDEN_MULT_PLUS_EXPR \
2529 || (SYM) == WIDEN_MULT_MINUS_EXPR) ? GIMPLE_TERNARY_RHS \
2530 : ((SYM) == COND_EXPR \
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 \
2537 || (SYM) == POLYNOMIAL_CHREC \
2538 || (SYM) == DOT_PROD_EXPR \
2539 || (SYM) == VEC_COND_EXPR \
2540 || (SYM) == REALIGN_LOAD_EXPR) ? GIMPLE_SINGLE_RHS \
2541 : GIMPLE_INVALID_RHS),
2542 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
2544 const unsigned char gimple_rhs_class_table
[] = {
2545 #include "all-tree.def"
2549 #undef END_OF_BASE_TREE_CODES
2551 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
2553 /* Validation of GIMPLE expressions. */
2555 /* Returns true iff T is a valid RHS for an assignment to a renamed
2556 user -- or front-end generated artificial -- variable. */
2559 is_gimple_reg_rhs (tree t
)
2561 return get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
;
2564 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
2565 LHS, or for a call argument. */
2568 is_gimple_mem_rhs (tree t
)
2570 /* If we're dealing with a renamable type, either source or dest must be
2571 a renamed variable. */
2572 if (is_gimple_reg_type (TREE_TYPE (t
)))
2573 return is_gimple_val (t
);
2575 return is_gimple_val (t
) || is_gimple_lvalue (t
);
2578 /* Return true if T is a valid LHS for a GIMPLE assignment expression. */
2581 is_gimple_lvalue (tree t
)
2583 return (is_gimple_addressable (t
)
2584 || TREE_CODE (t
) == WITH_SIZE_EXPR
2585 /* These are complex lvalues, but don't have addresses, so they
2587 || TREE_CODE (t
) == BIT_FIELD_REF
);
2590 /* Return true if T is a GIMPLE condition. */
2593 is_gimple_condexpr (tree t
)
2595 return (is_gimple_val (t
) || (COMPARISON_CLASS_P (t
)
2596 && !tree_could_trap_p (t
)
2597 && is_gimple_val (TREE_OPERAND (t
, 0))
2598 && is_gimple_val (TREE_OPERAND (t
, 1))));
2601 /* Return true if T is something whose address can be taken. */
2604 is_gimple_addressable (tree t
)
2606 return (is_gimple_id (t
) || handled_component_p (t
)
2607 || TREE_CODE (t
) == MEM_REF
);
2610 /* Return true if T is a valid gimple constant. */
2613 is_gimple_constant (const_tree t
)
2615 switch (TREE_CODE (t
))
2625 /* Vector constant constructors are gimple invariant. */
2627 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2628 return TREE_CONSTANT (t
);
2637 /* Return true if T is a gimple address. */
2640 is_gimple_address (const_tree t
)
2644 if (TREE_CODE (t
) != ADDR_EXPR
)
2647 op
= TREE_OPERAND (t
, 0);
2648 while (handled_component_p (op
))
2650 if ((TREE_CODE (op
) == ARRAY_REF
2651 || TREE_CODE (op
) == ARRAY_RANGE_REF
)
2652 && !is_gimple_val (TREE_OPERAND (op
, 1)))
2655 op
= TREE_OPERAND (op
, 0);
2658 if (CONSTANT_CLASS_P (op
) || TREE_CODE (op
) == MEM_REF
)
2661 switch (TREE_CODE (op
))
2676 /* Strip out all handled components that produce invariant
2680 strip_invariant_refs (const_tree op
)
2682 while (handled_component_p (op
))
2684 switch (TREE_CODE (op
))
2687 case ARRAY_RANGE_REF
:
2688 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
2689 || TREE_OPERAND (op
, 2) != NULL_TREE
2690 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2695 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2701 op
= TREE_OPERAND (op
, 0);
2707 /* Return true if T is a gimple invariant address. */
2710 is_gimple_invariant_address (const_tree t
)
2714 if (TREE_CODE (t
) != ADDR_EXPR
)
2717 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2721 if (TREE_CODE (op
) == MEM_REF
)
2723 const_tree op0
= TREE_OPERAND (op
, 0);
2724 return (TREE_CODE (op0
) == ADDR_EXPR
2725 && (CONSTANT_CLASS_P (TREE_OPERAND (op0
, 0))
2726 || decl_address_invariant_p (TREE_OPERAND (op0
, 0))));
2729 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2732 /* Return true if T is a gimple invariant address at IPA level
2733 (so addresses of variables on stack are not allowed). */
2736 is_gimple_ip_invariant_address (const_tree t
)
2740 if (TREE_CODE (t
) != ADDR_EXPR
)
2743 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2745 return op
&& (CONSTANT_CLASS_P (op
) || decl_address_ip_invariant_p (op
));
2748 /* Return true if T is a GIMPLE minimal invariant. It's a restricted
2749 form of function invariant. */
2752 is_gimple_min_invariant (const_tree t
)
2754 if (TREE_CODE (t
) == ADDR_EXPR
)
2755 return is_gimple_invariant_address (t
);
2757 return is_gimple_constant (t
);
2760 /* Return true if T is a GIMPLE interprocedural invariant. It's a restricted
2761 form of gimple minimal invariant. */
2764 is_gimple_ip_invariant (const_tree t
)
2766 if (TREE_CODE (t
) == ADDR_EXPR
)
2767 return is_gimple_ip_invariant_address (t
);
2769 return is_gimple_constant (t
);
2772 /* Return true if T looks like a valid GIMPLE statement. */
2775 is_gimple_stmt (tree t
)
2777 const enum tree_code code
= TREE_CODE (t
);
2782 /* The only valid NOP_EXPR is the empty statement. */
2783 return IS_EMPTY_STMT (t
);
2787 /* These are only valid if they're void. */
2788 return TREE_TYPE (t
) == NULL
|| VOID_TYPE_P (TREE_TYPE (t
));
2794 case CASE_LABEL_EXPR
:
2795 case TRY_CATCH_EXPR
:
2796 case TRY_FINALLY_EXPR
:
2797 case EH_FILTER_EXPR
:
2800 case STATEMENT_LIST
:
2810 /* These are always void. */
2816 /* These are valid regardless of their type. */
2824 /* Return true if T is a variable. */
2827 is_gimple_variable (tree t
)
2829 return (TREE_CODE (t
) == VAR_DECL
2830 || TREE_CODE (t
) == PARM_DECL
2831 || TREE_CODE (t
) == RESULT_DECL
2832 || TREE_CODE (t
) == SSA_NAME
);
2835 /* Return true if T is a GIMPLE identifier (something with an address). */
2838 is_gimple_id (tree t
)
2840 return (is_gimple_variable (t
)
2841 || TREE_CODE (t
) == FUNCTION_DECL
2842 || TREE_CODE (t
) == LABEL_DECL
2843 || TREE_CODE (t
) == CONST_DECL
2844 /* Allow string constants, since they are addressable. */
2845 || TREE_CODE (t
) == STRING_CST
);
2848 /* Return true if TYPE is a suitable type for a scalar register variable. */
2851 is_gimple_reg_type (tree type
)
2853 return !AGGREGATE_TYPE_P (type
);
2856 /* Return true if T is a non-aggregate register variable. */
2859 is_gimple_reg (tree t
)
2861 if (TREE_CODE (t
) == SSA_NAME
)
2862 t
= SSA_NAME_VAR (t
);
2864 if (!is_gimple_variable (t
))
2867 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2870 /* A volatile decl is not acceptable because we can't reuse it as
2871 needed. We need to copy it into a temp first. */
2872 if (TREE_THIS_VOLATILE (t
))
2875 /* We define "registers" as things that can be renamed as needed,
2876 which with our infrastructure does not apply to memory. */
2877 if (needs_to_live_in_memory (t
))
2880 /* Hard register variables are an interesting case. For those that
2881 are call-clobbered, we don't know where all the calls are, since
2882 we don't (want to) take into account which operations will turn
2883 into libcalls at the rtl level. For those that are call-saved,
2884 we don't currently model the fact that calls may in fact change
2885 global hard registers, nor do we examine ASM_CLOBBERS at the tree
2886 level, and so miss variable changes that might imply. All around,
2887 it seems safest to not do too much optimization with these at the
2888 tree level at all. We'll have to rely on the rtl optimizers to
2889 clean this up, as there we've got all the appropriate bits exposed. */
2890 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
2893 /* Complex and vector values must have been put into SSA-like form.
2894 That is, no assignments to the individual components. */
2895 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
2896 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2897 return DECL_GIMPLE_REG_P (t
);
2903 /* Return true if T is a GIMPLE variable whose address is not needed. */
2906 is_gimple_non_addressable (tree t
)
2908 if (TREE_CODE (t
) == SSA_NAME
)
2909 t
= SSA_NAME_VAR (t
);
2911 return (is_gimple_variable (t
) && ! needs_to_live_in_memory (t
));
2914 /* Return true if T is a GIMPLE rvalue, i.e. an identifier or a constant. */
2917 is_gimple_val (tree t
)
2919 /* Make loads from volatiles and memory vars explicit. */
2920 if (is_gimple_variable (t
)
2921 && is_gimple_reg_type (TREE_TYPE (t
))
2922 && !is_gimple_reg (t
))
2925 return (is_gimple_variable (t
) || is_gimple_min_invariant (t
));
2928 /* Similarly, but accept hard registers as inputs to asm statements. */
2931 is_gimple_asm_val (tree t
)
2933 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
2936 return is_gimple_val (t
);
2939 /* Return true if T is a GIMPLE minimal lvalue. */
2942 is_gimple_min_lval (tree t
)
2944 if (!(t
= CONST_CAST_TREE (strip_invariant_refs (t
))))
2946 return (is_gimple_id (t
) || TREE_CODE (t
) == MEM_REF
);
2949 /* Return true if T is a typecast operation. */
2952 is_gimple_cast (tree t
)
2954 return (CONVERT_EXPR_P (t
)
2955 || TREE_CODE (t
) == FIX_TRUNC_EXPR
);
2958 /* Return true if T is a valid function operand of a CALL_EXPR. */
2961 is_gimple_call_addr (tree t
)
2963 return (TREE_CODE (t
) == OBJ_TYPE_REF
|| is_gimple_val (t
));
2966 /* Return true if T is a valid address operand of a MEM_REF. */
2969 is_gimple_mem_ref_addr (tree t
)
2971 return (is_gimple_reg (t
)
2972 || TREE_CODE (t
) == INTEGER_CST
2973 || (TREE_CODE (t
) == ADDR_EXPR
2974 && (CONSTANT_CLASS_P (TREE_OPERAND (t
, 0))
2975 || decl_address_invariant_p (TREE_OPERAND (t
, 0)))));
2978 /* If T makes a function call, return the corresponding CALL_EXPR operand.
2979 Otherwise, return NULL_TREE. */
2982 get_call_expr_in (tree t
)
2984 if (TREE_CODE (t
) == MODIFY_EXPR
)
2985 t
= TREE_OPERAND (t
, 1);
2986 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
2987 t
= TREE_OPERAND (t
, 0);
2988 if (TREE_CODE (t
) == CALL_EXPR
)
2994 /* Given a memory reference expression T, return its base address.
2995 The base address of a memory reference expression is the main
2996 object being referenced. For instance, the base address for
2997 'array[i].fld[j]' is 'array'. You can think of this as stripping
2998 away the offset part from a memory address.
3000 This function calls handled_component_p to strip away all the inner
3001 parts of the memory reference until it reaches the base object. */
3004 get_base_address (tree t
)
3006 while (handled_component_p (t
))
3007 t
= TREE_OPERAND (t
, 0);
3009 if (TREE_CODE (t
) == MEM_REF
3010 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
3011 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
3014 || TREE_CODE (t
) == STRING_CST
3015 || TREE_CODE (t
) == CONSTRUCTOR
3016 || INDIRECT_REF_P (t
)
3017 || TREE_CODE (t
) == MEM_REF
)
3024 recalculate_side_effects (tree t
)
3026 enum tree_code code
= TREE_CODE (t
);
3027 int len
= TREE_OPERAND_LENGTH (t
);
3030 switch (TREE_CODE_CLASS (code
))
3032 case tcc_expression
:
3038 case PREDECREMENT_EXPR
:
3039 case PREINCREMENT_EXPR
:
3040 case POSTDECREMENT_EXPR
:
3041 case POSTINCREMENT_EXPR
:
3042 /* All of these have side-effects, no matter what their
3051 case tcc_comparison
: /* a comparison expression */
3052 case tcc_unary
: /* a unary arithmetic expression */
3053 case tcc_binary
: /* a binary arithmetic expression */
3054 case tcc_reference
: /* a reference */
3055 case tcc_vl_exp
: /* a function call */
3056 TREE_SIDE_EFFECTS (t
) = TREE_THIS_VOLATILE (t
);
3057 for (i
= 0; i
< len
; ++i
)
3059 tree op
= TREE_OPERAND (t
, i
);
3060 if (op
&& TREE_SIDE_EFFECTS (op
))
3061 TREE_SIDE_EFFECTS (t
) = 1;
3066 /* No side-effects. */
3074 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
3075 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
3076 we failed to create one. */
3079 canonicalize_cond_expr_cond (tree t
)
3081 /* Strip conversions around boolean operations. */
3082 if (CONVERT_EXPR_P (t
)
3083 && truth_value_p (TREE_CODE (TREE_OPERAND (t
, 0))))
3084 t
= TREE_OPERAND (t
, 0);
3086 /* For (bool)x use x != 0. */
3087 if (CONVERT_EXPR_P (t
)
3088 && TREE_CODE (TREE_TYPE (t
)) == BOOLEAN_TYPE
)
3090 tree top0
= TREE_OPERAND (t
, 0);
3091 t
= build2 (NE_EXPR
, TREE_TYPE (t
),
3092 top0
, build_int_cst (TREE_TYPE (top0
), 0));
3094 /* For !x use x == 0. */
3095 else if (TREE_CODE (t
) == TRUTH_NOT_EXPR
)
3097 tree top0
= TREE_OPERAND (t
, 0);
3098 t
= build2 (EQ_EXPR
, TREE_TYPE (t
),
3099 top0
, build_int_cst (TREE_TYPE (top0
), 0));
3101 /* For cmp ? 1 : 0 use cmp. */
3102 else if (TREE_CODE (t
) == COND_EXPR
3103 && COMPARISON_CLASS_P (TREE_OPERAND (t
, 0))
3104 && integer_onep (TREE_OPERAND (t
, 1))
3105 && integer_zerop (TREE_OPERAND (t
, 2)))
3107 tree top0
= TREE_OPERAND (t
, 0);
3108 t
= build2 (TREE_CODE (top0
), TREE_TYPE (t
),
3109 TREE_OPERAND (top0
, 0), TREE_OPERAND (top0
, 1));
3112 if (is_gimple_condexpr (t
))
3118 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
3119 the positions marked by the set ARGS_TO_SKIP. */
3122 gimple_call_copy_skip_args (gimple stmt
, bitmap args_to_skip
)
3125 tree fn
= gimple_call_fn (stmt
);
3126 int nargs
= gimple_call_num_args (stmt
);
3127 VEC(tree
, heap
) *vargs
= VEC_alloc (tree
, heap
, nargs
);
3130 for (i
= 0; i
< nargs
; i
++)
3131 if (!bitmap_bit_p (args_to_skip
, i
))
3132 VEC_quick_push (tree
, vargs
, gimple_call_arg (stmt
, i
));
3134 new_stmt
= gimple_build_call_vec (fn
, vargs
);
3135 VEC_free (tree
, heap
, vargs
);
3136 if (gimple_call_lhs (stmt
))
3137 gimple_call_set_lhs (new_stmt
, gimple_call_lhs (stmt
));
3139 gimple_set_vuse (new_stmt
, gimple_vuse (stmt
));
3140 gimple_set_vdef (new_stmt
, gimple_vdef (stmt
));
3142 gimple_set_block (new_stmt
, gimple_block (stmt
));
3143 if (gimple_has_location (stmt
))
3144 gimple_set_location (new_stmt
, gimple_location (stmt
));
3145 gimple_call_copy_flags (new_stmt
, stmt
);
3146 gimple_call_set_chain (new_stmt
, gimple_call_chain (stmt
));
3148 gimple_set_modified (new_stmt
, true);
3154 static hashval_t
gimple_type_hash (const void *);
3156 /* Structure used to maintain a cache of some type pairs compared by
3157 gimple_types_compatible_p when comparing aggregate types. There are
3158 three possible values for SAME_P:
3160 -2: The pair (T1, T2) has just been inserted in the table.
3161 0: T1 and T2 are different types.
3162 1: T1 and T2 are the same type.
3164 The two elements in the SAME_P array are indexed by the comparison
3171 signed char same_p
[2];
3173 typedef struct type_pair_d
*type_pair_t
;
3175 DEF_VEC_P(type_pair_t
);
3176 DEF_VEC_ALLOC_P(type_pair_t
,heap
);
3178 /* Return a hash value for the type pair pointed-to by P. */
3181 type_pair_hash (const void *p
)
3183 const struct type_pair_d
*pair
= (const struct type_pair_d
*) p
;
3184 hashval_t val1
= pair
->uid1
;
3185 hashval_t val2
= pair
->uid2
;
3186 return (iterative_hash_hashval_t (val2
, val1
)
3187 ^ iterative_hash_hashval_t (val1
, val2
));
3190 /* Compare two type pairs pointed-to by P1 and P2. */
3193 type_pair_eq (const void *p1
, const void *p2
)
3195 const struct type_pair_d
*pair1
= (const struct type_pair_d
*) p1
;
3196 const struct type_pair_d
*pair2
= (const struct type_pair_d
*) p2
;
3197 return ((pair1
->uid1
== pair2
->uid1
&& pair1
->uid2
== pair2
->uid2
)
3198 || (pair1
->uid1
== pair2
->uid2
&& pair1
->uid2
== pair2
->uid1
));
3201 /* Lookup the pair of types T1 and T2 in *VISITED_P. Insert a new
3202 entry if none existed. */
3205 lookup_type_pair (tree t1
, tree t2
, htab_t
*visited_p
, struct obstack
*ob_p
)
3207 struct type_pair_d pair
;
3211 if (*visited_p
== NULL
)
3213 *visited_p
= htab_create (251, type_pair_hash
, type_pair_eq
, NULL
);
3214 gcc_obstack_init (ob_p
);
3217 pair
.uid1
= TYPE_UID (t1
);
3218 pair
.uid2
= TYPE_UID (t2
);
3219 slot
= htab_find_slot (*visited_p
, &pair
, INSERT
);
3222 p
= *((type_pair_t
*) slot
);
3225 p
= XOBNEW (ob_p
, struct type_pair_d
);
3226 p
->uid1
= TYPE_UID (t1
);
3227 p
->uid2
= TYPE_UID (t2
);
3236 /* Per pointer state for the SCC finding. The on_sccstack flag
3237 is not strictly required, it is true when there is no hash value
3238 recorded for the type and false otherwise. But querying that
3243 unsigned int dfsnum
;
3252 static unsigned int next_dfs_num
;
3253 static unsigned int gtc_next_dfs_num
;
3255 /* Return true if T1 and T2 have the same name. If FOR_COMPLETION_P is
3256 true then if any type has no name return false, otherwise return
3257 true if both types have no names. */
3260 compare_type_names_p (tree t1
, tree t2
, bool for_completion_p
)
3262 tree name1
= TYPE_NAME (t1
);
3263 tree name2
= TYPE_NAME (t2
);
3265 /* Consider anonymous types all unique for completion. */
3266 if (for_completion_p
3267 && (!name1
|| !name2
))
3270 if (name1
&& TREE_CODE (name1
) == TYPE_DECL
)
3272 name1
= DECL_NAME (name1
);
3273 if (for_completion_p
3277 gcc_assert (!name1
|| TREE_CODE (name1
) == IDENTIFIER_NODE
);
3279 if (name2
&& TREE_CODE (name2
) == TYPE_DECL
)
3281 name2
= DECL_NAME (name2
);
3282 if (for_completion_p
3286 gcc_assert (!name2
|| TREE_CODE (name2
) == IDENTIFIER_NODE
);
3288 /* Identifiers can be compared with pointer equality rather
3289 than a string comparison. */
3296 /* Return true if the field decls F1 and F2 are at the same offset.
3298 This is intended to be used on GIMPLE types only. In order to
3299 compare GENERIC types, use fields_compatible_p instead. */
3302 gimple_compare_field_offset (tree f1
, tree f2
)
3304 if (DECL_OFFSET_ALIGN (f1
) == DECL_OFFSET_ALIGN (f2
))
3306 tree offset1
= DECL_FIELD_OFFSET (f1
);
3307 tree offset2
= DECL_FIELD_OFFSET (f2
);
3308 return ((offset1
== offset2
3309 /* Once gimplification is done, self-referential offsets are
3310 instantiated as operand #2 of the COMPONENT_REF built for
3311 each access and reset. Therefore, they are not relevant
3312 anymore and fields are interchangeable provided that they
3313 represent the same access. */
3314 || (TREE_CODE (offset1
) == PLACEHOLDER_EXPR
3315 && TREE_CODE (offset2
) == PLACEHOLDER_EXPR
3316 && (DECL_SIZE (f1
) == DECL_SIZE (f2
)
3317 || (TREE_CODE (DECL_SIZE (f1
)) == PLACEHOLDER_EXPR
3318 && TREE_CODE (DECL_SIZE (f2
)) == PLACEHOLDER_EXPR
)
3319 || operand_equal_p (DECL_SIZE (f1
), DECL_SIZE (f2
), 0))
3320 && DECL_ALIGN (f1
) == DECL_ALIGN (f2
))
3321 || operand_equal_p (offset1
, offset2
, 0))
3322 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1
),
3323 DECL_FIELD_BIT_OFFSET (f2
)));
3326 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
3327 should be, so handle differing ones specially by decomposing
3328 the offset into a byte and bit offset manually. */
3329 if (host_integerp (DECL_FIELD_OFFSET (f1
), 0)
3330 && host_integerp (DECL_FIELD_OFFSET (f2
), 0))
3332 unsigned HOST_WIDE_INT byte_offset1
, byte_offset2
;
3333 unsigned HOST_WIDE_INT bit_offset1
, bit_offset2
;
3334 bit_offset1
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1
));
3335 byte_offset1
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1
))
3336 + bit_offset1
/ BITS_PER_UNIT
);
3337 bit_offset2
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2
));
3338 byte_offset2
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2
))
3339 + bit_offset2
/ BITS_PER_UNIT
);
3340 if (byte_offset1
!= byte_offset2
)
3342 return bit_offset1
% BITS_PER_UNIT
== bit_offset2
% BITS_PER_UNIT
;
3348 /* If the type T1 and the type T2 are a complete and an incomplete
3349 variant of the same type return true. */
3352 gimple_compatible_complete_and_incomplete_subtype_p (tree t1
, tree t2
)
3354 /* If one pointer points to an incomplete type variant of
3355 the other pointed-to type they are the same. */
3356 if (TREE_CODE (t1
) == TREE_CODE (t2
)
3357 && RECORD_OR_UNION_TYPE_P (t1
)
3358 && (!COMPLETE_TYPE_P (t1
)
3359 || !COMPLETE_TYPE_P (t2
))
3360 && TYPE_QUALS (t1
) == TYPE_QUALS (t2
)
3361 && compare_type_names_p (TYPE_MAIN_VARIANT (t1
),
3362 TYPE_MAIN_VARIANT (t2
), true))
3368 gimple_types_compatible_p_1 (tree
, tree
, enum gtc_mode
, type_pair_t
,
3369 VEC(type_pair_t
, heap
) **,
3370 struct pointer_map_t
*, struct obstack
*);
3372 /* DFS visit the edge from the callers type pair with state *STATE to
3373 the pair T1, T2 while operating in FOR_MERGING_P mode.
3374 Update the merging status if it is not part of the SCC containing the
3375 callers pair and return it.
3376 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3379 gtc_visit (tree t1
, tree t2
, enum gtc_mode mode
,
3381 VEC(type_pair_t
, heap
) **sccstack
,
3382 struct pointer_map_t
*sccstate
,
3383 struct obstack
*sccstate_obstack
)
3385 struct sccs
*cstate
= NULL
;
3389 /* Check first for the obvious case of pointer identity. */
3393 /* Check that we have two types to compare. */
3394 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
3397 /* If the types have been previously registered and found equal
3399 if (TYPE_CANONICAL (t1
)
3400 && TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
3403 /* Can't be the same type if the types don't have the same code. */
3404 if (TREE_CODE (t1
) != TREE_CODE (t2
))
3407 /* Can't be the same type if they have different CV qualifiers. */
3408 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
3411 /* Void types are always the same. */
3412 if (TREE_CODE (t1
) == VOID_TYPE
)
3415 /* Do some simple checks before doing three hashtable queries. */
3416 if (INTEGRAL_TYPE_P (t1
)
3417 || SCALAR_FLOAT_TYPE_P (t1
)
3418 || FIXED_POINT_TYPE_P (t1
)
3419 || TREE_CODE (t1
) == VECTOR_TYPE
3420 || TREE_CODE (t1
) == COMPLEX_TYPE
3421 || TREE_CODE (t1
) == OFFSET_TYPE
)
3423 /* Can't be the same type if they have different alignment,
3424 sign, precision or mode. */
3425 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3426 || TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
)
3427 || TYPE_MODE (t1
) != TYPE_MODE (t2
)
3428 || TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
3431 if (TREE_CODE (t1
) == INTEGER_TYPE
3432 && (TYPE_IS_SIZETYPE (t1
) != TYPE_IS_SIZETYPE (t2
)
3433 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)))
3436 /* That's all we need to check for float and fixed-point types. */
3437 if (SCALAR_FLOAT_TYPE_P (t1
)
3438 || FIXED_POINT_TYPE_P (t1
))
3441 /* For integral types fall thru to more complex checks. */
3444 else if (AGGREGATE_TYPE_P (t1
) || POINTER_TYPE_P (t1
))
3446 /* Can't be the same type if they have different alignment or mode. */
3447 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3448 || TYPE_MODE (t1
) != TYPE_MODE (t2
))
3452 /* If the hash values of t1 and t2 are different the types can't
3453 possibly be the same. This helps keeping the type-pair hashtable
3454 small, only tracking comparisons for hash collisions. */
3455 if (gimple_type_hash (t1
) != gimple_type_hash (t2
))
3458 /* Allocate a new cache entry for this comparison. */
3459 p
= lookup_type_pair (t1
, t2
, >c_visited
, >c_ob
);
3460 if (p
->same_p
[mode
] == 0 || p
->same_p
[mode
] == 1)
3462 /* We have already decided whether T1 and T2 are the
3463 same, return the cached result. */
3464 return p
->same_p
[mode
] == 1;
3467 if ((slot
= pointer_map_contains (sccstate
, p
)) != NULL
)
3468 cstate
= (struct sccs
*)*slot
;
3472 /* Not yet visited. DFS recurse. */
3473 res
= gimple_types_compatible_p_1 (t1
, t2
, mode
, p
,
3474 sccstack
, sccstate
, sccstate_obstack
);
3476 cstate
= (struct sccs
*)* pointer_map_contains (sccstate
, p
);
3477 state
->low
= MIN (state
->low
, cstate
->low
);
3478 /* If the type is no longer on the SCC stack and thus is not part
3479 of the parents SCC, return its state. Otherwise we will
3480 ignore this pair and assume equality. */
3481 if (!cstate
->on_sccstack
)
3484 if (cstate
->dfsnum
< state
->dfsnum
3485 && cstate
->on_sccstack
)
3486 state
->low
= MIN (cstate
->dfsnum
, state
->low
);
3488 /* We are part of our parents SCC, skip this entry and return true. */
3492 /* Worker for gimple_types_compatible.
3493 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3496 gimple_types_compatible_p_1 (tree t1
, tree t2
, enum gtc_mode mode
,
3498 VEC(type_pair_t
, heap
) **sccstack
,
3499 struct pointer_map_t
*sccstate
,
3500 struct obstack
*sccstate_obstack
)
3504 gcc_assert (p
->same_p
[mode
] == -2);
3506 state
= XOBNEW (sccstate_obstack
, struct sccs
);
3507 *pointer_map_insert (sccstate
, p
) = state
;
3509 VEC_safe_push (type_pair_t
, heap
, *sccstack
, p
);
3510 state
->dfsnum
= gtc_next_dfs_num
++;
3511 state
->low
= state
->dfsnum
;
3512 state
->on_sccstack
= true;
3514 /* If their attributes are not the same they can't be the same type. */
3515 if (!attribute_list_equal (TYPE_ATTRIBUTES (t1
), TYPE_ATTRIBUTES (t2
)))
3516 goto different_types
;
3518 /* Do type-specific comparisons. */
3519 switch (TREE_CODE (t1
))
3523 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
), mode
,
3524 state
, sccstack
, sccstate
, sccstate_obstack
))
3525 goto different_types
;
3529 /* Array types are the same if the element types are the same and
3530 the number of elements are the same. */
3531 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
), mode
,
3532 state
, sccstack
, sccstate
, sccstate_obstack
)
3533 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
3534 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
3535 goto different_types
;
3538 tree i1
= TYPE_DOMAIN (t1
);
3539 tree i2
= TYPE_DOMAIN (t2
);
3541 /* For an incomplete external array, the type domain can be
3542 NULL_TREE. Check this condition also. */
3543 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
3545 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
3546 goto different_types
;
3547 /* If for a complete array type the possibly gimplified sizes
3548 are different the types are different. */
3549 else if (((TYPE_SIZE (i1
) != NULL
) ^ (TYPE_SIZE (i2
) != NULL
))
3552 && !operand_equal_p (TYPE_SIZE (i1
), TYPE_SIZE (i2
), 0)))
3553 goto different_types
;
3556 tree min1
= TYPE_MIN_VALUE (i1
);
3557 tree min2
= TYPE_MIN_VALUE (i2
);
3558 tree max1
= TYPE_MAX_VALUE (i1
);
3559 tree max2
= TYPE_MAX_VALUE (i2
);
3561 /* The minimum/maximum values have to be the same. */
3564 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
3565 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
3566 || operand_equal_p (min1
, min2
, 0))))
3569 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
3570 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
3571 || operand_equal_p (max1
, max2
, 0)))))
3574 goto different_types
;
3579 /* Method types should belong to the same class. */
3580 if (!gtc_visit (TYPE_METHOD_BASETYPE (t1
), TYPE_METHOD_BASETYPE (t2
),
3581 mode
, state
, sccstack
, sccstate
, sccstate_obstack
))
3582 goto different_types
;
3587 /* Function types are the same if the return type and arguments types
3589 if ((mode
!= GTC_DIAG
3590 || !gimple_compatible_complete_and_incomplete_subtype_p
3591 (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3592 && !gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
), mode
,
3593 state
, sccstack
, sccstate
, sccstate_obstack
))
3594 goto different_types
;
3596 if (!targetm
.comp_type_attributes (t1
, t2
))
3597 goto different_types
;
3599 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
3603 tree parms1
, parms2
;
3605 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
3607 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
3609 if ((mode
== GTC_MERGE
3610 || !gimple_compatible_complete_and_incomplete_subtype_p
3611 (TREE_VALUE (parms1
), TREE_VALUE (parms2
)))
3612 && !gtc_visit (TREE_VALUE (parms1
), TREE_VALUE (parms2
), mode
,
3613 state
, sccstack
, sccstate
, sccstate_obstack
))
3614 goto different_types
;
3617 if (parms1
|| parms2
)
3618 goto different_types
;
3625 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
), mode
,
3626 state
, sccstack
, sccstate
, sccstate_obstack
)
3627 || !gtc_visit (TYPE_OFFSET_BASETYPE (t1
),
3628 TYPE_OFFSET_BASETYPE (t2
), mode
,
3629 state
, sccstack
, sccstate
, sccstate_obstack
))
3630 goto different_types
;
3636 case REFERENCE_TYPE
:
3638 /* If the two pointers have different ref-all attributes,
3639 they can't be the same type. */
3640 if (TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
3641 goto different_types
;
3643 /* If one pointer points to an incomplete type variant of
3644 the other pointed-to type they are the same. */
3645 if (mode
== GTC_DIAG
3646 && gimple_compatible_complete_and_incomplete_subtype_p
3647 (TREE_TYPE (t1
), TREE_TYPE (t2
)))
3650 /* Otherwise, pointer and reference types are the same if the
3651 pointed-to types are the same. */
3652 if (gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
), mode
,
3653 state
, sccstack
, sccstate
, sccstate_obstack
))
3656 goto different_types
;
3662 tree min1
= TYPE_MIN_VALUE (t1
);
3663 tree max1
= TYPE_MAX_VALUE (t1
);
3664 tree min2
= TYPE_MIN_VALUE (t2
);
3665 tree max2
= TYPE_MAX_VALUE (t2
);
3666 bool min_equal_p
= false;
3667 bool max_equal_p
= false;
3669 /* If either type has a minimum value, the other type must
3671 if (min1
== NULL_TREE
&& min2
== NULL_TREE
)
3673 else if (min1
&& min2
&& operand_equal_p (min1
, min2
, 0))
3676 /* Likewise, if either type has a maximum value, the other
3677 type must have the same. */
3678 if (max1
== NULL_TREE
&& max2
== NULL_TREE
)
3680 else if (max1
&& max2
&& operand_equal_p (max1
, max2
, 0))
3683 if (!min_equal_p
|| !max_equal_p
)
3684 goto different_types
;
3691 /* FIXME lto, we cannot check bounds on enumeral types because
3692 different front ends will produce different values.
3693 In C, enumeral types are integers, while in C++ each element
3694 will have its own symbolic value. We should decide how enums
3695 are to be represented in GIMPLE and have each front end lower
3699 /* For enumeral types, all the values must be the same. */
3700 if (TYPE_VALUES (t1
) == TYPE_VALUES (t2
))
3703 for (v1
= TYPE_VALUES (t1
), v2
= TYPE_VALUES (t2
);
3705 v1
= TREE_CHAIN (v1
), v2
= TREE_CHAIN (v2
))
3707 tree c1
= TREE_VALUE (v1
);
3708 tree c2
= TREE_VALUE (v2
);
3710 if (TREE_CODE (c1
) == CONST_DECL
)
3711 c1
= DECL_INITIAL (c1
);
3713 if (TREE_CODE (c2
) == CONST_DECL
)
3714 c2
= DECL_INITIAL (c2
);
3716 if (tree_int_cst_equal (c1
, c2
) != 1)
3717 goto different_types
;
3720 /* If one enumeration has more values than the other, they
3721 are not the same. */
3723 goto different_types
;
3730 case QUAL_UNION_TYPE
:
3734 /* The struct tags shall compare equal. */
3735 if (!compare_type_names_p (TYPE_MAIN_VARIANT (t1
),
3736 TYPE_MAIN_VARIANT (t2
), false))
3737 goto different_types
;
3739 /* For aggregate types, all the fields must be the same. */
3740 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
3742 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
3744 /* The fields must have the same name, offset and type. */
3745 if (DECL_NAME (f1
) != DECL_NAME (f2
)
3746 || DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
3747 || !gimple_compare_field_offset (f1
, f2
)
3748 || !gtc_visit (TREE_TYPE (f1
), TREE_TYPE (f2
), mode
,
3749 state
, sccstack
, sccstate
, sccstate_obstack
))
3750 goto different_types
;
3753 /* If one aggregate has more fields than the other, they
3754 are not the same. */
3756 goto different_types
;
3765 /* Common exit path for types that are not compatible. */
3767 state
->u
.same_p
= 0;
3770 /* Common exit path for types that are compatible. */
3772 state
->u
.same_p
= 1;
3776 if (state
->low
== state
->dfsnum
)
3780 /* Pop off the SCC and set its cache values. */
3783 struct sccs
*cstate
;
3784 x
= VEC_pop (type_pair_t
, *sccstack
);
3785 cstate
= (struct sccs
*)*pointer_map_contains (sccstate
, x
);
3786 cstate
->on_sccstack
= false;
3787 x
->same_p
[mode
] = cstate
->u
.same_p
;
3792 return state
->u
.same_p
;
3795 /* Return true iff T1 and T2 are structurally identical. When
3796 FOR_MERGING_P is true the an incomplete type and a complete type
3797 are considered different, otherwise they are considered compatible. */
3800 gimple_types_compatible_p (tree t1
, tree t2
, enum gtc_mode mode
)
3802 VEC(type_pair_t
, heap
) *sccstack
= NULL
;
3803 struct pointer_map_t
*sccstate
;
3804 struct obstack sccstate_obstack
;
3805 type_pair_t p
= NULL
;
3808 /* Before starting to set up the SCC machinery handle simple cases. */
3810 /* Check first for the obvious case of pointer identity. */
3814 /* Check that we have two types to compare. */
3815 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
3818 /* If the types have been previously registered and found equal
3820 if (TYPE_CANONICAL (t1
)
3821 && TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
3824 /* Can't be the same type if the types don't have the same code. */
3825 if (TREE_CODE (t1
) != TREE_CODE (t2
))
3828 /* Can't be the same type if they have different CV qualifiers. */
3829 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
3832 /* Void types are always the same. */
3833 if (TREE_CODE (t1
) == VOID_TYPE
)
3836 /* Do some simple checks before doing three hashtable queries. */
3837 if (INTEGRAL_TYPE_P (t1
)
3838 || SCALAR_FLOAT_TYPE_P (t1
)
3839 || FIXED_POINT_TYPE_P (t1
)
3840 || TREE_CODE (t1
) == VECTOR_TYPE
3841 || TREE_CODE (t1
) == COMPLEX_TYPE
3842 || TREE_CODE (t1
) == OFFSET_TYPE
)
3844 /* Can't be the same type if they have different alignment,
3845 sign, precision or mode. */
3846 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3847 || TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
)
3848 || TYPE_MODE (t1
) != TYPE_MODE (t2
)
3849 || TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
3852 if (TREE_CODE (t1
) == INTEGER_TYPE
3853 && (TYPE_IS_SIZETYPE (t1
) != TYPE_IS_SIZETYPE (t2
)
3854 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)))
3857 /* That's all we need to check for float and fixed-point types. */
3858 if (SCALAR_FLOAT_TYPE_P (t1
)
3859 || FIXED_POINT_TYPE_P (t1
))
3862 /* For integral types fall thru to more complex checks. */
3865 else if (AGGREGATE_TYPE_P (t1
) || POINTER_TYPE_P (t1
))
3867 /* Can't be the same type if they have different alignment or mode. */
3868 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3869 || TYPE_MODE (t1
) != TYPE_MODE (t2
))
3873 /* If the hash values of t1 and t2 are different the types can't
3874 possibly be the same. This helps keeping the type-pair hashtable
3875 small, only tracking comparisons for hash collisions. */
3876 if (gimple_type_hash (t1
) != gimple_type_hash (t2
))
3879 /* If we've visited this type pair before (in the case of aggregates
3880 with self-referential types), and we made a decision, return it. */
3881 p
= lookup_type_pair (t1
, t2
, >c_visited
, >c_ob
);
3882 if (p
->same_p
[mode
] == 0 || p
->same_p
[mode
] == 1)
3884 /* We have already decided whether T1 and T2 are the
3885 same, return the cached result. */
3886 return p
->same_p
[mode
] == 1;
3889 /* Now set up the SCC machinery for the comparison. */
3890 gtc_next_dfs_num
= 1;
3891 sccstate
= pointer_map_create ();
3892 gcc_obstack_init (&sccstate_obstack
);
3893 res
= gimple_types_compatible_p_1 (t1
, t2
, mode
, p
,
3894 &sccstack
, sccstate
, &sccstate_obstack
);
3895 VEC_free (type_pair_t
, heap
, sccstack
);
3896 pointer_map_destroy (sccstate
);
3897 obstack_free (&sccstate_obstack
, NULL
);
3904 iterative_hash_gimple_type (tree
, hashval_t
, VEC(tree
, heap
) **,
3905 struct pointer_map_t
*, struct obstack
*);
3907 /* DFS visit the edge from the callers type with state *STATE to T.
3908 Update the callers type hash V with the hash for T if it is not part
3909 of the SCC containing the callers type and return it.
3910 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3913 visit (tree t
, struct sccs
*state
, hashval_t v
,
3914 VEC (tree
, heap
) **sccstack
,
3915 struct pointer_map_t
*sccstate
,
3916 struct obstack
*sccstate_obstack
)
3918 struct sccs
*cstate
= NULL
;
3921 /* If there is a hash value recorded for this type then it can't
3922 possibly be part of our parent SCC. Simply mix in its hash. */
3923 if ((slot
= pointer_map_contains (type_hash_cache
, t
)))
3924 return iterative_hash_hashval_t ((hashval_t
) (size_t) *slot
, v
);
3926 if ((slot
= pointer_map_contains (sccstate
, t
)) != NULL
)
3927 cstate
= (struct sccs
*)*slot
;
3931 /* Not yet visited. DFS recurse. */
3932 tem
= iterative_hash_gimple_type (t
, v
,
3933 sccstack
, sccstate
, sccstate_obstack
);
3935 cstate
= (struct sccs
*)* pointer_map_contains (sccstate
, t
);
3936 state
->low
= MIN (state
->low
, cstate
->low
);
3937 /* If the type is no longer on the SCC stack and thus is not part
3938 of the parents SCC mix in its hash value. Otherwise we will
3939 ignore the type for hashing purposes and return the unaltered
3941 if (!cstate
->on_sccstack
)
3944 if (cstate
->dfsnum
< state
->dfsnum
3945 && cstate
->on_sccstack
)
3946 state
->low
= MIN (cstate
->dfsnum
, state
->low
);
3948 /* We are part of our parents SCC, skip this type during hashing
3949 and return the unaltered hash value. */
3953 /* Hash NAME with the previous hash value V and return it. */
3956 iterative_hash_name (tree name
, hashval_t v
)
3960 if (TREE_CODE (name
) == TYPE_DECL
)
3961 name
= DECL_NAME (name
);
3964 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
3965 return iterative_hash_object (IDENTIFIER_HASH_VALUE (name
), v
);
3968 /* Returning a hash value for gimple type TYPE combined with VAL.
3969 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done.
3971 To hash a type we end up hashing in types that are reachable.
3972 Through pointers we can end up with cycles which messes up the
3973 required property that we need to compute the same hash value
3974 for structurally equivalent types. To avoid this we have to
3975 hash all types in a cycle (the SCC) in a commutative way. The
3976 easiest way is to not mix in the hashes of the SCC members at
3977 all. To make this work we have to delay setting the hash
3978 values of the SCC until it is complete. */
3981 iterative_hash_gimple_type (tree type
, hashval_t val
,
3982 VEC(tree
, heap
) **sccstack
,
3983 struct pointer_map_t
*sccstate
,
3984 struct obstack
*sccstate_obstack
)
3990 #ifdef ENABLE_CHECKING
3991 /* Not visited during this DFS walk nor during previous walks. */
3992 gcc_assert (!pointer_map_contains (type_hash_cache
, type
)
3993 && !pointer_map_contains (sccstate
, type
));
3995 state
= XOBNEW (sccstate_obstack
, struct sccs
);
3996 *pointer_map_insert (sccstate
, type
) = state
;
3998 VEC_safe_push (tree
, heap
, *sccstack
, type
);
3999 state
->dfsnum
= next_dfs_num
++;
4000 state
->low
= state
->dfsnum
;
4001 state
->on_sccstack
= true;
4003 /* Combine a few common features of types so that types are grouped into
4004 smaller sets; when searching for existing matching types to merge,
4005 only existing types having the same features as the new type will be
4007 v
= iterative_hash_hashval_t (TREE_CODE (type
), 0);
4008 v
= iterative_hash_hashval_t (TYPE_QUALS (type
), v
);
4009 v
= iterative_hash_hashval_t (TREE_ADDRESSABLE (type
), v
);
4011 /* Do not hash the types size as this will cause differences in
4012 hash values for the complete vs. the incomplete type variant. */
4014 /* Incorporate common features of numerical types. */
4015 if (INTEGRAL_TYPE_P (type
)
4016 || SCALAR_FLOAT_TYPE_P (type
)
4017 || FIXED_POINT_TYPE_P (type
))
4019 v
= iterative_hash_hashval_t (TYPE_PRECISION (type
), v
);
4020 v
= iterative_hash_hashval_t (TYPE_MODE (type
), v
);
4021 v
= iterative_hash_hashval_t (TYPE_UNSIGNED (type
), v
);
4024 /* For pointer and reference types, fold in information about the type
4025 pointed to but do not recurse into possibly incomplete types to
4026 avoid hash differences for complete vs. incomplete types. */
4027 if (POINTER_TYPE_P (type
))
4029 if (RECORD_OR_UNION_TYPE_P (TREE_TYPE (type
)))
4031 v
= iterative_hash_hashval_t (TREE_CODE (TREE_TYPE (type
)), v
);
4032 v
= iterative_hash_name
4033 (TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (type
))), v
);
4036 v
= visit (TREE_TYPE (type
), state
, v
,
4037 sccstack
, sccstate
, sccstate_obstack
);
4040 /* For integer types hash the types min/max values and the string flag. */
4041 if (TREE_CODE (type
) == INTEGER_TYPE
)
4043 /* OMP lowering can introduce error_mark_node in place of
4044 random local decls in types. */
4045 if (TYPE_MIN_VALUE (type
) != error_mark_node
)
4046 v
= iterative_hash_expr (TYPE_MIN_VALUE (type
), v
);
4047 if (TYPE_MAX_VALUE (type
) != error_mark_node
)
4048 v
= iterative_hash_expr (TYPE_MAX_VALUE (type
), v
);
4049 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
4052 /* For array types hash their domain and the string flag. */
4053 if (TREE_CODE (type
) == ARRAY_TYPE
4054 && TYPE_DOMAIN (type
))
4056 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
4057 v
= visit (TYPE_DOMAIN (type
), state
, v
,
4058 sccstack
, sccstate
, sccstate_obstack
);
4061 /* Recurse for aggregates with a single element type. */
4062 if (TREE_CODE (type
) == ARRAY_TYPE
4063 || TREE_CODE (type
) == COMPLEX_TYPE
4064 || TREE_CODE (type
) == VECTOR_TYPE
)
4065 v
= visit (TREE_TYPE (type
), state
, v
,
4066 sccstack
, sccstate
, sccstate_obstack
);
4068 /* Incorporate function return and argument types. */
4069 if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
4074 /* For method types also incorporate their parent class. */
4075 if (TREE_CODE (type
) == METHOD_TYPE
)
4076 v
= visit (TYPE_METHOD_BASETYPE (type
), state
, v
,
4077 sccstack
, sccstate
, sccstate_obstack
);
4079 /* For result types allow mismatch in completeness. */
4080 if (RECORD_OR_UNION_TYPE_P (TREE_TYPE (type
)))
4082 v
= iterative_hash_hashval_t (TREE_CODE (TREE_TYPE (type
)), v
);
4083 v
= iterative_hash_name
4084 (TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (type
))), v
);
4087 v
= visit (TREE_TYPE (type
), state
, v
,
4088 sccstack
, sccstate
, sccstate_obstack
);
4090 for (p
= TYPE_ARG_TYPES (type
), na
= 0; p
; p
= TREE_CHAIN (p
))
4092 /* For argument types allow mismatch in completeness. */
4093 if (RECORD_OR_UNION_TYPE_P (TREE_VALUE (p
)))
4095 v
= iterative_hash_hashval_t (TREE_CODE (TREE_VALUE (p
)), v
);
4096 v
= iterative_hash_name
4097 (TYPE_NAME (TYPE_MAIN_VARIANT (TREE_VALUE (p
))), v
);
4100 v
= visit (TREE_VALUE (p
), state
, v
,
4101 sccstack
, sccstate
, sccstate_obstack
);
4105 v
= iterative_hash_hashval_t (na
, v
);
4108 if (TREE_CODE (type
) == RECORD_TYPE
4109 || TREE_CODE (type
) == UNION_TYPE
4110 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4115 v
= iterative_hash_name (TYPE_NAME (TYPE_MAIN_VARIANT (type
)), v
);
4117 for (f
= TYPE_FIELDS (type
), nf
= 0; f
; f
= TREE_CHAIN (f
))
4119 v
= iterative_hash_name (DECL_NAME (f
), v
);
4120 v
= visit (TREE_TYPE (f
), state
, v
,
4121 sccstack
, sccstate
, sccstate_obstack
);
4125 v
= iterative_hash_hashval_t (nf
, v
);
4128 /* Record hash for us. */
4131 /* See if we found an SCC. */
4132 if (state
->low
== state
->dfsnum
)
4136 /* Pop off the SCC and set its hash values. */
4139 struct sccs
*cstate
;
4140 x
= VEC_pop (tree
, *sccstack
);
4141 gcc_assert (!pointer_map_contains (type_hash_cache
, x
));
4142 cstate
= (struct sccs
*)*pointer_map_contains (sccstate
, x
);
4143 cstate
->on_sccstack
= false;
4144 slot
= pointer_map_insert (type_hash_cache
, x
);
4145 *slot
= (void *) (size_t) cstate
->u
.hash
;
4150 return iterative_hash_hashval_t (v
, val
);
4154 /* Returns a hash value for P (assumed to be a type). The hash value
4155 is computed using some distinguishing features of the type. Note
4156 that we cannot use pointer hashing here as we may be dealing with
4157 two distinct instances of the same type.
4159 This function should produce the same hash value for two compatible
4160 types according to gimple_types_compatible_p. */
4163 gimple_type_hash (const void *p
)
4165 const_tree t
= (const_tree
) p
;
4166 VEC(tree
, heap
) *sccstack
= NULL
;
4167 struct pointer_map_t
*sccstate
;
4168 struct obstack sccstate_obstack
;
4172 if (type_hash_cache
== NULL
)
4173 type_hash_cache
= pointer_map_create ();
4175 if ((slot
= pointer_map_contains (type_hash_cache
, p
)) != NULL
)
4176 return iterative_hash_hashval_t ((hashval_t
) (size_t) *slot
, 0);
4178 /* Perform a DFS walk and pre-hash all reachable types. */
4180 sccstate
= pointer_map_create ();
4181 gcc_obstack_init (&sccstate_obstack
);
4182 val
= iterative_hash_gimple_type (CONST_CAST_TREE (t
), 0,
4183 &sccstack
, sccstate
, &sccstate_obstack
);
4184 VEC_free (tree
, heap
, sccstack
);
4185 pointer_map_destroy (sccstate
);
4186 obstack_free (&sccstate_obstack
, NULL
);
4192 /* Returns nonzero if P1 and P2 are equal. */
4195 gimple_type_eq (const void *p1
, const void *p2
)
4197 const_tree t1
= (const_tree
) p1
;
4198 const_tree t2
= (const_tree
) p2
;
4199 return gimple_types_compatible_p (CONST_CAST_TREE (t1
),
4200 CONST_CAST_TREE (t2
), GTC_MERGE
);
4204 /* Register type T in the global type table gimple_types.
4205 If another type T', compatible with T, already existed in
4206 gimple_types then return T', otherwise return T. This is used by
4207 LTO to merge identical types read from different TUs. */
4210 gimple_register_type (tree t
)
4214 gcc_assert (TYPE_P (t
));
4216 /* In TYPE_CANONICAL we cache the result of gimple_register_type.
4217 It is initially set to NULL during LTO streaming. */
4218 if (TYPE_CANONICAL (t
))
4219 return TYPE_CANONICAL (t
);
4221 /* Always register the main variant first. This is important so we
4222 pick up the non-typedef variants as canonical, otherwise we'll end
4223 up taking typedef ids for structure tags during comparison. */
4224 if (TYPE_MAIN_VARIANT (t
) != t
)
4225 gimple_register_type (TYPE_MAIN_VARIANT (t
));
4227 if (gimple_types
== NULL
)
4228 gimple_types
= htab_create (16381, gimple_type_hash
, gimple_type_eq
, 0);
4230 slot
= htab_find_slot (gimple_types
, t
, INSERT
);
4232 && *(tree
*)slot
!= t
)
4234 tree new_type
= (tree
) *((tree
*) slot
);
4236 /* Do not merge types with different addressability. */
4237 gcc_assert (TREE_ADDRESSABLE (t
) == TREE_ADDRESSABLE (new_type
));
4239 /* If t is not its main variant then make t unreachable from its
4240 main variant list. Otherwise we'd queue up a lot of duplicates
4242 if (t
!= TYPE_MAIN_VARIANT (t
))
4244 tree tem
= TYPE_MAIN_VARIANT (t
);
4245 while (tem
&& TYPE_NEXT_VARIANT (tem
) != t
)
4246 tem
= TYPE_NEXT_VARIANT (tem
);
4248 TYPE_NEXT_VARIANT (tem
) = TYPE_NEXT_VARIANT (t
);
4249 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
4252 /* If we are a pointer then remove us from the pointer-to or
4253 reference-to chain. Otherwise we'd queue up a lot of duplicates
4255 if (TREE_CODE (t
) == POINTER_TYPE
)
4257 if (TYPE_POINTER_TO (TREE_TYPE (t
)) == t
)
4258 TYPE_POINTER_TO (TREE_TYPE (t
)) = TYPE_NEXT_PTR_TO (t
);
4261 tree tem
= TYPE_POINTER_TO (TREE_TYPE (t
));
4262 while (tem
&& TYPE_NEXT_PTR_TO (tem
) != t
)
4263 tem
= TYPE_NEXT_PTR_TO (tem
);
4265 TYPE_NEXT_PTR_TO (tem
) = TYPE_NEXT_PTR_TO (t
);
4267 TYPE_NEXT_PTR_TO (t
) = NULL_TREE
;
4269 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
4271 if (TYPE_REFERENCE_TO (TREE_TYPE (t
)) == t
)
4272 TYPE_REFERENCE_TO (TREE_TYPE (t
)) = TYPE_NEXT_REF_TO (t
);
4275 tree tem
= TYPE_REFERENCE_TO (TREE_TYPE (t
));
4276 while (tem
&& TYPE_NEXT_REF_TO (tem
) != t
)
4277 tem
= TYPE_NEXT_REF_TO (tem
);
4279 TYPE_NEXT_REF_TO (tem
) = TYPE_NEXT_REF_TO (t
);
4281 TYPE_NEXT_REF_TO (t
) = NULL_TREE
;
4284 TYPE_CANONICAL (t
) = new_type
;
4289 TYPE_CANONICAL (t
) = t
;
4297 /* Show statistics on references to the global type table gimple_types. */
4300 print_gimple_types_stats (void)
4303 fprintf (stderr
, "GIMPLE type table: size %ld, %ld elements, "
4304 "%ld searches, %ld collisions (ratio: %f)\n",
4305 (long) htab_size (gimple_types
),
4306 (long) htab_elements (gimple_types
),
4307 (long) gimple_types
->searches
,
4308 (long) gimple_types
->collisions
,
4309 htab_collisions (gimple_types
));
4311 fprintf (stderr
, "GIMPLE type table is empty\n");
4313 fprintf (stderr
, "GIMPLE type comparison table: size %ld, %ld "
4314 "elements, %ld searches, %ld collisions (ratio: %f)\n",
4315 (long) htab_size (gtc_visited
),
4316 (long) htab_elements (gtc_visited
),
4317 (long) gtc_visited
->searches
,
4318 (long) gtc_visited
->collisions
,
4319 htab_collisions (gtc_visited
));
4321 fprintf (stderr
, "GIMPLE type comparison table is empty\n");
4324 /* Free the gimple type hashtables used for LTO type merging. */
4327 free_gimple_type_tables (void)
4329 /* Last chance to print stats for the tables. */
4330 if (flag_lto_report
)
4331 print_gimple_types_stats ();
4335 htab_delete (gimple_types
);
4336 gimple_types
= NULL
;
4338 if (type_hash_cache
)
4340 pointer_map_destroy (type_hash_cache
);
4341 type_hash_cache
= NULL
;
4345 htab_delete (gtc_visited
);
4346 obstack_free (>c_ob
, NULL
);
4352 /* Return a type the same as TYPE except unsigned or
4353 signed according to UNSIGNEDP. */
4356 gimple_signed_or_unsigned_type (bool unsignedp
, tree type
)
4360 type1
= TYPE_MAIN_VARIANT (type
);
4361 if (type1
== signed_char_type_node
4362 || type1
== char_type_node
4363 || type1
== unsigned_char_type_node
)
4364 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
4365 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
4366 return unsignedp
? unsigned_type_node
: integer_type_node
;
4367 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
4368 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
4369 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
4370 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
4371 if (type1
== long_long_integer_type_node
4372 || type1
== long_long_unsigned_type_node
)
4374 ? long_long_unsigned_type_node
4375 : long_long_integer_type_node
;
4376 if (int128_integer_type_node
&& (type1
== int128_integer_type_node
|| type1
== int128_unsigned_type_node
))
4378 ? int128_unsigned_type_node
4379 : int128_integer_type_node
;
4380 #if HOST_BITS_PER_WIDE_INT >= 64
4381 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
4382 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
4384 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
4385 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
4386 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
4387 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
4388 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
4389 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
4390 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
4391 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
4393 #define GIMPLE_FIXED_TYPES(NAME) \
4394 if (type1 == short_ ## NAME ## _type_node \
4395 || type1 == unsigned_short_ ## NAME ## _type_node) \
4396 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4397 : short_ ## NAME ## _type_node; \
4398 if (type1 == NAME ## _type_node \
4399 || type1 == unsigned_ ## NAME ## _type_node) \
4400 return unsignedp ? unsigned_ ## NAME ## _type_node \
4401 : NAME ## _type_node; \
4402 if (type1 == long_ ## NAME ## _type_node \
4403 || type1 == unsigned_long_ ## NAME ## _type_node) \
4404 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4405 : long_ ## NAME ## _type_node; \
4406 if (type1 == long_long_ ## NAME ## _type_node \
4407 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4408 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4409 : long_long_ ## NAME ## _type_node;
4411 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
4412 if (type1 == NAME ## _type_node \
4413 || type1 == u ## NAME ## _type_node) \
4414 return unsignedp ? u ## NAME ## _type_node \
4415 : NAME ## _type_node;
4417 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
4418 if (type1 == sat_ ## short_ ## NAME ## _type_node \
4419 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
4420 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
4421 : sat_ ## short_ ## NAME ## _type_node; \
4422 if (type1 == sat_ ## NAME ## _type_node \
4423 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
4424 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
4425 : sat_ ## NAME ## _type_node; \
4426 if (type1 == sat_ ## long_ ## NAME ## _type_node \
4427 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
4428 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
4429 : sat_ ## long_ ## NAME ## _type_node; \
4430 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
4431 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
4432 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
4433 : sat_ ## long_long_ ## NAME ## _type_node;
4435 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
4436 if (type1 == sat_ ## NAME ## _type_node \
4437 || type1 == sat_ ## u ## NAME ## _type_node) \
4438 return unsignedp ? sat_ ## u ## NAME ## _type_node \
4439 : sat_ ## NAME ## _type_node;
4441 GIMPLE_FIXED_TYPES (fract
);
4442 GIMPLE_FIXED_TYPES_SAT (fract
);
4443 GIMPLE_FIXED_TYPES (accum
);
4444 GIMPLE_FIXED_TYPES_SAT (accum
);
4446 GIMPLE_FIXED_MODE_TYPES (qq
);
4447 GIMPLE_FIXED_MODE_TYPES (hq
);
4448 GIMPLE_FIXED_MODE_TYPES (sq
);
4449 GIMPLE_FIXED_MODE_TYPES (dq
);
4450 GIMPLE_FIXED_MODE_TYPES (tq
);
4451 GIMPLE_FIXED_MODE_TYPES_SAT (qq
);
4452 GIMPLE_FIXED_MODE_TYPES_SAT (hq
);
4453 GIMPLE_FIXED_MODE_TYPES_SAT (sq
);
4454 GIMPLE_FIXED_MODE_TYPES_SAT (dq
);
4455 GIMPLE_FIXED_MODE_TYPES_SAT (tq
);
4456 GIMPLE_FIXED_MODE_TYPES (ha
);
4457 GIMPLE_FIXED_MODE_TYPES (sa
);
4458 GIMPLE_FIXED_MODE_TYPES (da
);
4459 GIMPLE_FIXED_MODE_TYPES (ta
);
4460 GIMPLE_FIXED_MODE_TYPES_SAT (ha
);
4461 GIMPLE_FIXED_MODE_TYPES_SAT (sa
);
4462 GIMPLE_FIXED_MODE_TYPES_SAT (da
);
4463 GIMPLE_FIXED_MODE_TYPES_SAT (ta
);
4465 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
4466 the precision; they have precision set to match their range, but
4467 may use a wider mode to match an ABI. If we change modes, we may
4468 wind up with bad conversions. For INTEGER_TYPEs in C, must check
4469 the precision as well, so as to yield correct results for
4470 bit-field types. C++ does not have these separate bit-field
4471 types, and producing a signed or unsigned variant of an
4472 ENUMERAL_TYPE may cause other problems as well. */
4473 if (!INTEGRAL_TYPE_P (type
)
4474 || TYPE_UNSIGNED (type
) == unsignedp
)
4477 #define TYPE_OK(node) \
4478 (TYPE_MODE (type) == TYPE_MODE (node) \
4479 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4480 if (TYPE_OK (signed_char_type_node
))
4481 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
4482 if (TYPE_OK (integer_type_node
))
4483 return unsignedp
? unsigned_type_node
: integer_type_node
;
4484 if (TYPE_OK (short_integer_type_node
))
4485 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
4486 if (TYPE_OK (long_integer_type_node
))
4487 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
4488 if (TYPE_OK (long_long_integer_type_node
))
4490 ? long_long_unsigned_type_node
4491 : long_long_integer_type_node
);
4492 if (int128_integer_type_node
&& TYPE_OK (int128_integer_type_node
))
4494 ? int128_unsigned_type_node
4495 : int128_integer_type_node
);
4497 #if HOST_BITS_PER_WIDE_INT >= 64
4498 if (TYPE_OK (intTI_type_node
))
4499 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
4501 if (TYPE_OK (intDI_type_node
))
4502 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
4503 if (TYPE_OK (intSI_type_node
))
4504 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
4505 if (TYPE_OK (intHI_type_node
))
4506 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
4507 if (TYPE_OK (intQI_type_node
))
4508 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
4510 #undef GIMPLE_FIXED_TYPES
4511 #undef GIMPLE_FIXED_MODE_TYPES
4512 #undef GIMPLE_FIXED_TYPES_SAT
4513 #undef GIMPLE_FIXED_MODE_TYPES_SAT
4516 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
4520 /* Return an unsigned type the same as TYPE in other respects. */
4523 gimple_unsigned_type (tree type
)
4525 return gimple_signed_or_unsigned_type (true, type
);
4529 /* Return a signed type the same as TYPE in other respects. */
4532 gimple_signed_type (tree type
)
4534 return gimple_signed_or_unsigned_type (false, type
);
4538 /* Return the typed-based alias set for T, which may be an expression
4539 or a type. Return -1 if we don't do anything special. */
4542 gimple_get_alias_set (tree t
)
4546 /* Permit type-punning when accessing a union, provided the access
4547 is directly through the union. For example, this code does not
4548 permit taking the address of a union member and then storing
4549 through it. Even the type-punning allowed here is a GCC
4550 extension, albeit a common and useful one; the C standard says
4551 that such accesses have implementation-defined behavior. */
4553 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
4554 u
= TREE_OPERAND (u
, 0))
4555 if (TREE_CODE (u
) == COMPONENT_REF
4556 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
4559 /* That's all the expressions we handle specially. */
4563 /* For convenience, follow the C standard when dealing with
4564 character types. Any object may be accessed via an lvalue that
4565 has character type. */
4566 if (t
== char_type_node
4567 || t
== signed_char_type_node
4568 || t
== unsigned_char_type_node
)
4571 /* Allow aliasing between signed and unsigned variants of the same
4572 type. We treat the signed variant as canonical. */
4573 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
4575 tree t1
= gimple_signed_type (t
);
4577 /* t1 == t can happen for boolean nodes which are always unsigned. */
4579 return get_alias_set (t1
);
4581 else if (POINTER_TYPE_P (t
))
4583 /* From the common C and C++ langhook implementation:
4585 Unfortunately, there is no canonical form of a pointer type.
4586 In particular, if we have `typedef int I', then `int *', and
4587 `I *' are different types. So, we have to pick a canonical
4588 representative. We do this below.
4590 Technically, this approach is actually more conservative that
4591 it needs to be. In particular, `const int *' and `int *'
4592 should be in different alias sets, according to the C and C++
4593 standard, since their types are not the same, and so,
4594 technically, an `int **' and `const int **' cannot point at
4597 But, the standard is wrong. In particular, this code is
4602 const int* const* cipp = ipp;
4603 And, it doesn't make sense for that to be legal unless you
4604 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
4605 the pointed-to types. This issue has been reported to the
4608 /* In addition to the above canonicalization issue with LTO
4609 we should also canonicalize `T (*)[]' to `T *' avoiding
4610 alias issues with pointer-to element types and pointer-to
4613 Likewise we need to deal with the situation of incomplete
4614 pointed-to types and make `*(struct X **)&a' and
4615 `*(struct X {} **)&a' alias. Otherwise we will have to
4616 guarantee that all pointer-to incomplete type variants
4617 will be replaced by pointer-to complete type variants if
4620 With LTO the convenient situation of using `void *' to
4621 access and store any pointer type will also become
4622 more apparent (and `void *' is just another pointer-to
4623 incomplete type). Assigning alias-set zero to `void *'
4624 and all pointer-to incomplete types is a not appealing
4625 solution. Assigning an effective alias-set zero only
4626 affecting pointers might be - by recording proper subset
4627 relationships of all pointer alias-sets.
4629 Pointer-to function types are another grey area which
4630 needs caution. Globbing them all into one alias-set
4631 or the above effective zero set would work. */
4633 /* For now just assign the same alias-set to all pointers.
4634 That's simple and avoids all the above problems. */
4635 if (t
!= ptr_type_node
)
4636 return get_alias_set (ptr_type_node
);
4643 /* Data structure used to count the number of dereferences to PTR
4644 inside an expression. */
4648 unsigned num_stores
;
4652 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
4653 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
4656 count_ptr_derefs (tree
*tp
, int *walk_subtrees
, void *data
)
4658 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
4659 struct count_ptr_d
*count_p
= (struct count_ptr_d
*) wi_p
->info
;
4661 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
4662 pointer 'ptr' is *not* dereferenced, it is simply used to compute
4663 the address of 'fld' as 'ptr + offsetof(fld)'. */
4664 if (TREE_CODE (*tp
) == ADDR_EXPR
)
4670 if (TREE_CODE (*tp
) == MEM_REF
&& TREE_OPERAND (*tp
, 0) == count_p
->ptr
)
4673 count_p
->num_stores
++;
4675 count_p
->num_loads
++;
4681 /* Count the number of direct and indirect uses for pointer PTR in
4682 statement STMT. The number of direct uses is stored in
4683 *NUM_USES_P. Indirect references are counted separately depending
4684 on whether they are store or load operations. The counts are
4685 stored in *NUM_STORES_P and *NUM_LOADS_P. */
4688 count_uses_and_derefs (tree ptr
, gimple stmt
, unsigned *num_uses_p
,
4689 unsigned *num_loads_p
, unsigned *num_stores_p
)
4698 /* Find out the total number of uses of PTR in STMT. */
4699 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, i
, SSA_OP_USE
)
4703 /* Now count the number of indirect references to PTR. This is
4704 truly awful, but we don't have much choice. There are no parent
4705 pointers inside INDIRECT_REFs, so an expression like
4706 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
4707 find all the indirect and direct uses of x_1 inside. The only
4708 shortcut we can take is the fact that GIMPLE only allows
4709 INDIRECT_REFs inside the expressions below. */
4710 if (is_gimple_assign (stmt
)
4711 || gimple_code (stmt
) == GIMPLE_RETURN
4712 || gimple_code (stmt
) == GIMPLE_ASM
4713 || is_gimple_call (stmt
))
4715 struct walk_stmt_info wi
;
4716 struct count_ptr_d count
;
4719 count
.num_stores
= 0;
4720 count
.num_loads
= 0;
4722 memset (&wi
, 0, sizeof (wi
));
4724 walk_gimple_op (stmt
, count_ptr_derefs
, &wi
);
4726 *num_stores_p
= count
.num_stores
;
4727 *num_loads_p
= count
.num_loads
;
4730 gcc_assert (*num_uses_p
>= *num_loads_p
+ *num_stores_p
);
4733 /* From a tree operand OP return the base of a load or store operation
4734 or NULL_TREE if OP is not a load or a store. */
4737 get_base_loadstore (tree op
)
4739 while (handled_component_p (op
))
4740 op
= TREE_OPERAND (op
, 0);
4742 || INDIRECT_REF_P (op
)
4743 || TREE_CODE (op
) == MEM_REF
4744 || TREE_CODE (op
) == TARGET_MEM_REF
)
4749 /* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and
4750 VISIT_ADDR if non-NULL on loads, store and address-taken operands
4751 passing the STMT, the base of the operand and DATA to it. The base
4752 will be either a decl, an indirect reference (including TARGET_MEM_REF)
4753 or the argument of an address expression.
4754 Returns the results of these callbacks or'ed. */
4757 walk_stmt_load_store_addr_ops (gimple stmt
, void *data
,
4758 bool (*visit_load
)(gimple
, tree
, void *),
4759 bool (*visit_store
)(gimple
, tree
, void *),
4760 bool (*visit_addr
)(gimple
, tree
, void *))
4764 if (gimple_assign_single_p (stmt
))
4769 lhs
= get_base_loadstore (gimple_assign_lhs (stmt
));
4771 ret
|= visit_store (stmt
, lhs
, data
);
4773 rhs
= gimple_assign_rhs1 (stmt
);
4774 while (handled_component_p (rhs
))
4775 rhs
= TREE_OPERAND (rhs
, 0);
4778 if (TREE_CODE (rhs
) == ADDR_EXPR
)
4779 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
4780 else if (TREE_CODE (rhs
) == TARGET_MEM_REF
4781 && TMR_BASE (rhs
) != NULL_TREE
4782 && TREE_CODE (TMR_BASE (rhs
)) == ADDR_EXPR
)
4783 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (rhs
), 0), data
);
4784 else if (TREE_CODE (rhs
) == OBJ_TYPE_REF
4785 && TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs
)) == ADDR_EXPR
)
4786 ret
|= visit_addr (stmt
, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs
),
4788 lhs
= gimple_assign_lhs (stmt
);
4789 if (TREE_CODE (lhs
) == TARGET_MEM_REF
4790 && TMR_BASE (lhs
) != NULL_TREE
4791 && TREE_CODE (TMR_BASE (lhs
)) == ADDR_EXPR
)
4792 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (lhs
), 0), data
);
4796 rhs
= get_base_loadstore (rhs
);
4798 ret
|= visit_load (stmt
, rhs
, data
);
4802 && (is_gimple_assign (stmt
)
4803 || gimple_code (stmt
) == GIMPLE_COND
))
4805 for (i
= 0; i
< gimple_num_ops (stmt
); ++i
)
4806 if (gimple_op (stmt
, i
)
4807 && TREE_CODE (gimple_op (stmt
, i
)) == ADDR_EXPR
)
4808 ret
|= visit_addr (stmt
, TREE_OPERAND (gimple_op (stmt
, i
), 0), data
);
4810 else if (is_gimple_call (stmt
))
4814 tree lhs
= gimple_call_lhs (stmt
);
4817 lhs
= get_base_loadstore (lhs
);
4819 ret
|= visit_store (stmt
, lhs
, data
);
4822 if (visit_load
|| visit_addr
)
4823 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
4825 tree rhs
= gimple_call_arg (stmt
, i
);
4827 && TREE_CODE (rhs
) == ADDR_EXPR
)
4828 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
4829 else if (visit_load
)
4831 rhs
= get_base_loadstore (rhs
);
4833 ret
|= visit_load (stmt
, rhs
, data
);
4837 && gimple_call_chain (stmt
)
4838 && TREE_CODE (gimple_call_chain (stmt
)) == ADDR_EXPR
)
4839 ret
|= visit_addr (stmt
, TREE_OPERAND (gimple_call_chain (stmt
), 0),
4842 && gimple_call_return_slot_opt_p (stmt
)
4843 && gimple_call_lhs (stmt
) != NULL_TREE
4844 && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt
))))
4845 ret
|= visit_addr (stmt
, gimple_call_lhs (stmt
), data
);
4847 else if (gimple_code (stmt
) == GIMPLE_ASM
)
4850 const char *constraint
;
4851 const char **oconstraints
;
4852 bool allows_mem
, allows_reg
, is_inout
;
4853 noutputs
= gimple_asm_noutputs (stmt
);
4854 oconstraints
= XALLOCAVEC (const char *, noutputs
);
4855 if (visit_store
|| visit_addr
)
4856 for (i
= 0; i
< gimple_asm_noutputs (stmt
); ++i
)
4858 tree link
= gimple_asm_output_op (stmt
, i
);
4859 tree op
= get_base_loadstore (TREE_VALUE (link
));
4860 if (op
&& visit_store
)
4861 ret
|= visit_store (stmt
, op
, data
);
4864 constraint
= TREE_STRING_POINTER
4865 (TREE_VALUE (TREE_PURPOSE (link
)));
4866 oconstraints
[i
] = constraint
;
4867 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
4868 &allows_reg
, &is_inout
);
4869 if (op
&& !allows_reg
&& allows_mem
)
4870 ret
|= visit_addr (stmt
, op
, data
);
4873 if (visit_load
|| visit_addr
)
4874 for (i
= 0; i
< gimple_asm_ninputs (stmt
); ++i
)
4876 tree link
= gimple_asm_input_op (stmt
, i
);
4877 tree op
= TREE_VALUE (link
);
4879 && TREE_CODE (op
) == ADDR_EXPR
)
4880 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
4881 else if (visit_load
|| visit_addr
)
4883 op
= get_base_loadstore (op
);
4887 ret
|= visit_load (stmt
, op
, data
);
4890 constraint
= TREE_STRING_POINTER
4891 (TREE_VALUE (TREE_PURPOSE (link
)));
4892 parse_input_constraint (&constraint
, 0, 0, noutputs
,
4894 &allows_mem
, &allows_reg
);
4895 if (!allows_reg
&& allows_mem
)
4896 ret
|= visit_addr (stmt
, op
, data
);
4902 else if (gimple_code (stmt
) == GIMPLE_RETURN
)
4904 tree op
= gimple_return_retval (stmt
);
4908 && TREE_CODE (op
) == ADDR_EXPR
)
4909 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
4910 else if (visit_load
)
4912 op
= get_base_loadstore (op
);
4914 ret
|= visit_load (stmt
, op
, data
);
4919 && gimple_code (stmt
) == GIMPLE_PHI
)
4921 for (i
= 0; i
< gimple_phi_num_args (stmt
); ++i
)
4923 tree op
= PHI_ARG_DEF (stmt
, i
);
4924 if (TREE_CODE (op
) == ADDR_EXPR
)
4925 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
4932 /* Like walk_stmt_load_store_addr_ops but with NULL visit_addr. IPA-CP
4933 should make a faster clone for this case. */
4936 walk_stmt_load_store_ops (gimple stmt
, void *data
,
4937 bool (*visit_load
)(gimple
, tree
, void *),
4938 bool (*visit_store
)(gimple
, tree
, void *))
4940 return walk_stmt_load_store_addr_ops (stmt
, data
,
4941 visit_load
, visit_store
, NULL
);
4944 /* Helper for gimple_ior_addresses_taken_1. */
4947 gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED
,
4948 tree addr
, void *data
)
4950 bitmap addresses_taken
= (bitmap
)data
;
4951 addr
= get_base_address (addr
);
4955 bitmap_set_bit (addresses_taken
, DECL_UID (addr
));
4961 /* Set the bit for the uid of all decls that have their address taken
4962 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
4963 were any in this stmt. */
4966 gimple_ior_addresses_taken (bitmap addresses_taken
, gimple stmt
)
4968 return walk_stmt_load_store_addr_ops (stmt
, addresses_taken
, NULL
, NULL
,
4969 gimple_ior_addresses_taken_1
);
4973 /* Return a printable name for symbol DECL. */
4976 gimple_decl_printable_name (tree decl
, int verbosity
)
4978 if (!DECL_NAME (decl
))
4981 if (DECL_ASSEMBLER_NAME_SET_P (decl
))
4983 const char *str
, *mangled_str
;
4984 int dmgl_opts
= DMGL_NO_OPTS
;
4988 dmgl_opts
= DMGL_VERBOSE
4992 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4993 dmgl_opts
|= DMGL_PARAMS
;
4996 mangled_str
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
4997 str
= cplus_demangle_v3 (mangled_str
, dmgl_opts
);
4998 return (str
) ? str
: mangled_str
;
5001 return IDENTIFIER_POINTER (DECL_NAME (decl
));
5004 /* Return true when STMT is builtins call to CODE. */
5007 gimple_call_builtin_p (gimple stmt
, enum built_in_function code
)
5010 return (is_gimple_call (stmt
)
5011 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL
5012 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
5013 && DECL_FUNCTION_CODE (fndecl
) == code
);
5016 #include "gt-gimple.h"