1 /* Gimple IR support functions.
3 Copyright 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
4 Contributed by Aldy Hernandez <aldyh@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
32 #include "diagnostic.h"
33 #include "tree-flow.h"
34 #include "value-prof.h"
38 #include "langhooks.h"
40 /* Global 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 GTY((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
46 static GTY((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
47 htab_t gimple_canonical_types
;
48 static GTY((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map
)))
49 htab_t type_hash_cache
;
50 static GTY((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map
)))
51 htab_t canonical_type_hash_cache
;
53 /* All the tuples have their operand vector (if present) at the very bottom
54 of the structure. Therefore, the offset required to find the
55 operands vector the size of the structure minus the size of the 1
56 element tree array at the end (see gimple_ops). */
57 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \
58 (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0),
59 EXPORTED_CONST
size_t gimple_ops_offset_
[] = {
60 #include "gsstruct.def"
64 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof(struct STRUCT),
65 static const size_t gsstruct_code_size
[] = {
66 #include "gsstruct.def"
70 #define DEFGSCODE(SYM, NAME, GSSCODE) NAME,
71 const char *const gimple_code_name
[] = {
76 #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE,
77 EXPORTED_CONST
enum gimple_statement_structure_enum gss_for_code_
[] = {
82 #ifdef GATHER_STATISTICS
85 int gimple_alloc_counts
[(int) gimple_alloc_kind_all
];
86 int gimple_alloc_sizes
[(int) gimple_alloc_kind_all
];
88 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
89 static const char * const gimple_alloc_kind_names
[] = {
97 #endif /* GATHER_STATISTICS */
99 /* A cache of gimple_seq objects. Sequences are created and destroyed
100 fairly often during gimplification. */
101 static GTY ((deletable
)) struct gimple_seq_d
*gimple_seq_cache
;
103 /* Private API manipulation functions shared only with some
105 extern void gimple_set_stored_syms (gimple
, bitmap
, bitmap_obstack
*);
106 extern void gimple_set_loaded_syms (gimple
, bitmap
, bitmap_obstack
*);
108 /* Gimple tuple constructors.
109 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
110 be passed a NULL to start with an empty sequence. */
112 /* Set the code for statement G to CODE. */
115 gimple_set_code (gimple g
, enum gimple_code code
)
117 g
->gsbase
.code
= code
;
120 /* Return the number of bytes needed to hold a GIMPLE statement with
124 gimple_size (enum gimple_code code
)
126 return gsstruct_code_size
[gss_for_code (code
)];
129 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
133 gimple_alloc_stat (enum gimple_code code
, unsigned num_ops MEM_STAT_DECL
)
138 size
= gimple_size (code
);
140 size
+= sizeof (tree
) * (num_ops
- 1);
142 #ifdef GATHER_STATISTICS
144 enum gimple_alloc_kind kind
= gimple_alloc_kind (code
);
145 gimple_alloc_counts
[(int) kind
]++;
146 gimple_alloc_sizes
[(int) kind
] += size
;
150 stmt
= ggc_alloc_cleared_gimple_statement_d_stat (size PASS_MEM_STAT
);
151 gimple_set_code (stmt
, code
);
152 gimple_set_num_ops (stmt
, num_ops
);
154 /* Do not call gimple_set_modified here as it has other side
155 effects and this tuple is still not completely built. */
156 stmt
->gsbase
.modified
= 1;
161 /* Set SUBCODE to be the code of the expression computed by statement G. */
164 gimple_set_subcode (gimple g
, unsigned subcode
)
166 /* We only have 16 bits for the RHS code. Assert that we are not
168 gcc_assert (subcode
< (1 << 16));
169 g
->gsbase
.subcode
= subcode
;
174 /* Build a tuple with operands. CODE is the statement to build (which
175 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the sub-code
176 for the new tuple. NUM_OPS is the number of operands to allocate. */
178 #define gimple_build_with_ops(c, s, n) \
179 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
182 gimple_build_with_ops_stat (enum gimple_code code
, unsigned subcode
,
183 unsigned num_ops MEM_STAT_DECL
)
185 gimple s
= gimple_alloc_stat (code
, num_ops PASS_MEM_STAT
);
186 gimple_set_subcode (s
, subcode
);
192 /* Build a GIMPLE_RETURN statement returning RETVAL. */
195 gimple_build_return (tree retval
)
197 gimple s
= gimple_build_with_ops (GIMPLE_RETURN
, ERROR_MARK
, 1);
199 gimple_return_set_retval (s
, retval
);
203 /* Reset alias information on call S. */
206 gimple_call_reset_alias_info (gimple s
)
208 if (gimple_call_flags (s
) & ECF_CONST
)
209 memset (gimple_call_use_set (s
), 0, sizeof (struct pt_solution
));
211 pt_solution_reset (gimple_call_use_set (s
));
212 if (gimple_call_flags (s
) & (ECF_CONST
|ECF_PURE
|ECF_NOVOPS
))
213 memset (gimple_call_clobber_set (s
), 0, sizeof (struct pt_solution
));
215 pt_solution_reset (gimple_call_clobber_set (s
));
218 /* Helper for gimple_build_call, gimple_build_call_valist,
219 gimple_build_call_vec and gimple_build_call_from_tree. Build the basic
220 components of a GIMPLE_CALL statement to function FN with NARGS
224 gimple_build_call_1 (tree fn
, unsigned nargs
)
226 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
227 if (TREE_CODE (fn
) == FUNCTION_DECL
)
228 fn
= build_fold_addr_expr (fn
);
229 gimple_set_op (s
, 1, fn
);
230 gimple_call_set_fntype (s
, TREE_TYPE (TREE_TYPE (fn
)));
231 gimple_call_reset_alias_info (s
);
236 /* Build a GIMPLE_CALL statement to function FN with the arguments
237 specified in vector ARGS. */
240 gimple_build_call_vec (tree fn
, VEC(tree
, heap
) *args
)
243 unsigned nargs
= VEC_length (tree
, args
);
244 gimple call
= gimple_build_call_1 (fn
, nargs
);
246 for (i
= 0; i
< nargs
; i
++)
247 gimple_call_set_arg (call
, i
, VEC_index (tree
, args
, i
));
253 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
254 arguments. The ... are the arguments. */
257 gimple_build_call (tree fn
, unsigned nargs
, ...)
263 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
265 call
= gimple_build_call_1 (fn
, nargs
);
267 va_start (ap
, nargs
);
268 for (i
= 0; i
< nargs
; i
++)
269 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
276 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
277 arguments. AP contains the arguments. */
280 gimple_build_call_valist (tree fn
, unsigned nargs
, va_list ap
)
285 gcc_assert (TREE_CODE (fn
) == FUNCTION_DECL
|| is_gimple_call_addr (fn
));
287 call
= gimple_build_call_1 (fn
, nargs
);
289 for (i
= 0; i
< nargs
; i
++)
290 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
296 /* Helper for gimple_build_call_internal and gimple_build_call_internal_vec.
297 Build the basic components of a GIMPLE_CALL statement to internal
298 function FN with NARGS arguments. */
301 gimple_build_call_internal_1 (enum internal_fn fn
, unsigned nargs
)
303 gimple s
= gimple_build_with_ops (GIMPLE_CALL
, ERROR_MARK
, nargs
+ 3);
304 s
->gsbase
.subcode
|= GF_CALL_INTERNAL
;
305 gimple_call_set_internal_fn (s
, fn
);
306 gimple_call_reset_alias_info (s
);
311 /* Build a GIMPLE_CALL statement to internal function FN. NARGS is
312 the number of arguments. The ... are the arguments. */
315 gimple_build_call_internal (enum internal_fn fn
, unsigned nargs
, ...)
321 call
= gimple_build_call_internal_1 (fn
, nargs
);
322 va_start (ap
, nargs
);
323 for (i
= 0; i
< nargs
; i
++)
324 gimple_call_set_arg (call
, i
, va_arg (ap
, tree
));
331 /* Build a GIMPLE_CALL statement to internal function FN with the arguments
332 specified in vector ARGS. */
335 gimple_build_call_internal_vec (enum internal_fn fn
, VEC(tree
, heap
) *args
)
340 nargs
= VEC_length (tree
, args
);
341 call
= gimple_build_call_internal_1 (fn
, nargs
);
342 for (i
= 0; i
< nargs
; i
++)
343 gimple_call_set_arg (call
, i
, VEC_index (tree
, args
, i
));
349 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
350 assumed to be in GIMPLE form already. Minimal checking is done of
354 gimple_build_call_from_tree (tree t
)
358 tree fndecl
= get_callee_fndecl (t
);
360 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
362 nargs
= call_expr_nargs (t
);
363 call
= gimple_build_call_1 (fndecl
? fndecl
: CALL_EXPR_FN (t
), nargs
);
365 for (i
= 0; i
< nargs
; i
++)
366 gimple_call_set_arg (call
, i
, CALL_EXPR_ARG (t
, i
));
368 gimple_set_block (call
, TREE_BLOCK (t
));
370 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
371 gimple_call_set_chain (call
, CALL_EXPR_STATIC_CHAIN (t
));
372 gimple_call_set_tail (call
, CALL_EXPR_TAILCALL (t
));
373 gimple_call_set_cannot_inline (call
, CALL_CANNOT_INLINE_P (t
));
374 gimple_call_set_return_slot_opt (call
, CALL_EXPR_RETURN_SLOT_OPT (t
));
376 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
377 && (DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA
378 || DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_ALLOCA_WITH_ALIGN
))
379 gimple_call_set_alloca_for_var (call
, CALL_ALLOCA_FOR_VAR_P (t
));
381 gimple_call_set_from_thunk (call
, CALL_FROM_THUNK_P (t
));
382 gimple_call_set_va_arg_pack (call
, CALL_EXPR_VA_ARG_PACK (t
));
383 gimple_call_set_nothrow (call
, TREE_NOTHROW (t
));
384 gimple_set_no_warning (call
, TREE_NO_WARNING (t
));
390 /* Extract the operands and code for expression EXPR into *SUBCODE_P,
391 *OP1_P, *OP2_P and *OP3_P respectively. */
394 extract_ops_from_tree_1 (tree expr
, enum tree_code
*subcode_p
, tree
*op1_p
,
395 tree
*op2_p
, tree
*op3_p
)
397 enum gimple_rhs_class grhs_class
;
399 *subcode_p
= TREE_CODE (expr
);
400 grhs_class
= get_gimple_rhs_class (*subcode_p
);
402 if (grhs_class
== GIMPLE_TERNARY_RHS
)
404 *op1_p
= TREE_OPERAND (expr
, 0);
405 *op2_p
= TREE_OPERAND (expr
, 1);
406 *op3_p
= TREE_OPERAND (expr
, 2);
408 else if (grhs_class
== GIMPLE_BINARY_RHS
)
410 *op1_p
= TREE_OPERAND (expr
, 0);
411 *op2_p
= TREE_OPERAND (expr
, 1);
414 else if (grhs_class
== GIMPLE_UNARY_RHS
)
416 *op1_p
= TREE_OPERAND (expr
, 0);
420 else if (grhs_class
== GIMPLE_SINGLE_RHS
)
431 /* Build a GIMPLE_ASSIGN statement.
433 LHS of the assignment.
434 RHS of the assignment which can be unary or binary. */
437 gimple_build_assign_stat (tree lhs
, tree rhs MEM_STAT_DECL
)
439 enum tree_code subcode
;
442 extract_ops_from_tree_1 (rhs
, &subcode
, &op1
, &op2
, &op3
);
443 return gimple_build_assign_with_ops_stat (subcode
, lhs
, op1
, op2
, op3
448 /* Build a GIMPLE_ASSIGN statement with sub-code SUBCODE and operands
449 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
450 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
453 gimple_build_assign_with_ops_stat (enum tree_code subcode
, tree lhs
, tree op1
,
454 tree op2
, tree op3 MEM_STAT_DECL
)
459 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
461 num_ops
= get_gimple_rhs_num_ops (subcode
) + 1;
463 p
= gimple_build_with_ops_stat (GIMPLE_ASSIGN
, (unsigned)subcode
, num_ops
465 gimple_assign_set_lhs (p
, lhs
);
466 gimple_assign_set_rhs1 (p
, op1
);
469 gcc_assert (num_ops
> 2);
470 gimple_assign_set_rhs2 (p
, op2
);
475 gcc_assert (num_ops
> 3);
476 gimple_assign_set_rhs3 (p
, op3
);
483 /* Build a new GIMPLE_ASSIGN tuple and append it to the end of *SEQ_P.
485 DST/SRC are the destination and source respectively. You can pass
486 ungimplified trees in DST or SRC, in which case they will be
487 converted to a gimple operand if necessary.
489 This function returns the newly created GIMPLE_ASSIGN tuple. */
492 gimplify_assign (tree dst
, tree src
, gimple_seq
*seq_p
)
494 tree t
= build2 (MODIFY_EXPR
, TREE_TYPE (dst
), dst
, src
);
495 gimplify_and_add (t
, seq_p
);
497 return gimple_seq_last_stmt (*seq_p
);
501 /* Build a GIMPLE_COND statement.
503 PRED is the condition used to compare LHS and the RHS.
504 T_LABEL is the label to jump to if the condition is true.
505 F_LABEL is the label to jump to otherwise. */
508 gimple_build_cond (enum tree_code pred_code
, tree lhs
, tree rhs
,
509 tree t_label
, tree f_label
)
513 gcc_assert (TREE_CODE_CLASS (pred_code
) == tcc_comparison
);
514 p
= gimple_build_with_ops (GIMPLE_COND
, pred_code
, 4);
515 gimple_cond_set_lhs (p
, lhs
);
516 gimple_cond_set_rhs (p
, rhs
);
517 gimple_cond_set_true_label (p
, t_label
);
518 gimple_cond_set_false_label (p
, f_label
);
523 /* Extract operands for a GIMPLE_COND statement out of COND_EXPR tree COND. */
526 gimple_cond_get_ops_from_tree (tree cond
, enum tree_code
*code_p
,
527 tree
*lhs_p
, tree
*rhs_p
)
529 gcc_assert (TREE_CODE_CLASS (TREE_CODE (cond
)) == tcc_comparison
530 || TREE_CODE (cond
) == TRUTH_NOT_EXPR
531 || is_gimple_min_invariant (cond
)
532 || SSA_VAR_P (cond
));
534 extract_ops_from_tree (cond
, code_p
, lhs_p
, rhs_p
);
536 /* Canonicalize conditionals of the form 'if (!VAL)'. */
537 if (*code_p
== TRUTH_NOT_EXPR
)
540 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
541 *rhs_p
= build_zero_cst (TREE_TYPE (*lhs_p
));
543 /* Canonicalize conditionals of the form 'if (VAL)' */
544 else if (TREE_CODE_CLASS (*code_p
) != tcc_comparison
)
547 gcc_assert (*lhs_p
&& *rhs_p
== NULL_TREE
);
548 *rhs_p
= build_zero_cst (TREE_TYPE (*lhs_p
));
553 /* Build a GIMPLE_COND statement from the conditional expression tree
554 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
557 gimple_build_cond_from_tree (tree cond
, tree t_label
, tree f_label
)
562 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
563 return gimple_build_cond (code
, lhs
, rhs
, t_label
, f_label
);
566 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
567 boolean expression tree COND. */
570 gimple_cond_set_condition_from_tree (gimple stmt
, tree cond
)
575 gimple_cond_get_ops_from_tree (cond
, &code
, &lhs
, &rhs
);
576 gimple_cond_set_condition (stmt
, code
, lhs
, rhs
);
579 /* Build a GIMPLE_LABEL statement for LABEL. */
582 gimple_build_label (tree label
)
584 gimple p
= gimple_build_with_ops (GIMPLE_LABEL
, ERROR_MARK
, 1);
585 gimple_label_set_label (p
, label
);
589 /* Build a GIMPLE_GOTO statement to label DEST. */
592 gimple_build_goto (tree dest
)
594 gimple p
= gimple_build_with_ops (GIMPLE_GOTO
, ERROR_MARK
, 1);
595 gimple_goto_set_dest (p
, dest
);
600 /* Build a GIMPLE_NOP statement. */
603 gimple_build_nop (void)
605 return gimple_alloc (GIMPLE_NOP
, 0);
609 /* Build a GIMPLE_BIND statement.
610 VARS are the variables in BODY.
611 BLOCK is the containing block. */
614 gimple_build_bind (tree vars
, gimple_seq body
, tree block
)
616 gimple p
= gimple_alloc (GIMPLE_BIND
, 0);
617 gimple_bind_set_vars (p
, vars
);
619 gimple_bind_set_body (p
, body
);
621 gimple_bind_set_block (p
, block
);
625 /* Helper function to set the simple fields of a asm stmt.
627 STRING is a pointer to a string that is the asm blocks assembly code.
628 NINPUT is the number of register inputs.
629 NOUTPUT is the number of register outputs.
630 NCLOBBERS is the number of clobbered registers.
634 gimple_build_asm_1 (const char *string
, unsigned ninputs
, unsigned noutputs
,
635 unsigned nclobbers
, unsigned nlabels
)
638 int size
= strlen (string
);
640 /* ASMs with labels cannot have outputs. This should have been
641 enforced by the front end. */
642 gcc_assert (nlabels
== 0 || noutputs
== 0);
644 p
= gimple_build_with_ops (GIMPLE_ASM
, ERROR_MARK
,
645 ninputs
+ noutputs
+ nclobbers
+ nlabels
);
647 p
->gimple_asm
.ni
= ninputs
;
648 p
->gimple_asm
.no
= noutputs
;
649 p
->gimple_asm
.nc
= nclobbers
;
650 p
->gimple_asm
.nl
= nlabels
;
651 p
->gimple_asm
.string
= ggc_alloc_string (string
, size
);
653 #ifdef GATHER_STATISTICS
654 gimple_alloc_sizes
[(int) gimple_alloc_kind (GIMPLE_ASM
)] += size
;
660 /* Build a GIMPLE_ASM statement.
662 STRING is the assembly code.
663 NINPUT is the number of register inputs.
664 NOUTPUT is the number of register outputs.
665 NCLOBBERS is the number of clobbered registers.
666 INPUTS is a vector of the input register parameters.
667 OUTPUTS is a vector of the output register parameters.
668 CLOBBERS is a vector of the clobbered register parameters.
669 LABELS is a vector of destination labels. */
672 gimple_build_asm_vec (const char *string
, VEC(tree
,gc
)* inputs
,
673 VEC(tree
,gc
)* outputs
, VEC(tree
,gc
)* clobbers
,
674 VEC(tree
,gc
)* labels
)
679 p
= gimple_build_asm_1 (string
,
680 VEC_length (tree
, inputs
),
681 VEC_length (tree
, outputs
),
682 VEC_length (tree
, clobbers
),
683 VEC_length (tree
, labels
));
685 for (i
= 0; i
< VEC_length (tree
, inputs
); i
++)
686 gimple_asm_set_input_op (p
, i
, VEC_index (tree
, inputs
, i
));
688 for (i
= 0; i
< VEC_length (tree
, outputs
); i
++)
689 gimple_asm_set_output_op (p
, i
, VEC_index (tree
, outputs
, i
));
691 for (i
= 0; i
< VEC_length (tree
, clobbers
); i
++)
692 gimple_asm_set_clobber_op (p
, i
, VEC_index (tree
, clobbers
, i
));
694 for (i
= 0; i
< VEC_length (tree
, labels
); i
++)
695 gimple_asm_set_label_op (p
, i
, VEC_index (tree
, labels
, i
));
700 /* Build a GIMPLE_CATCH statement.
702 TYPES are the catch types.
703 HANDLER is the exception handler. */
706 gimple_build_catch (tree types
, gimple_seq handler
)
708 gimple p
= gimple_alloc (GIMPLE_CATCH
, 0);
709 gimple_catch_set_types (p
, types
);
711 gimple_catch_set_handler (p
, handler
);
716 /* Build a GIMPLE_EH_FILTER statement.
718 TYPES are the filter's types.
719 FAILURE is the filter's failure action. */
722 gimple_build_eh_filter (tree types
, gimple_seq failure
)
724 gimple p
= gimple_alloc (GIMPLE_EH_FILTER
, 0);
725 gimple_eh_filter_set_types (p
, types
);
727 gimple_eh_filter_set_failure (p
, failure
);
732 /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */
735 gimple_build_eh_must_not_throw (tree decl
)
737 gimple p
= gimple_alloc (GIMPLE_EH_MUST_NOT_THROW
, 0);
739 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
740 gcc_assert (flags_from_decl_or_type (decl
) & ECF_NORETURN
);
741 gimple_eh_must_not_throw_set_fndecl (p
, decl
);
746 /* Build a GIMPLE_EH_ELSE statement. */
749 gimple_build_eh_else (gimple_seq n_body
, gimple_seq e_body
)
751 gimple p
= gimple_alloc (GIMPLE_EH_ELSE
, 0);
752 gimple_eh_else_set_n_body (p
, n_body
);
753 gimple_eh_else_set_e_body (p
, e_body
);
757 /* Build a GIMPLE_TRY statement.
759 EVAL is the expression to evaluate.
760 CLEANUP is the cleanup expression.
761 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
762 whether this is a try/catch or a try/finally respectively. */
765 gimple_build_try (gimple_seq eval
, gimple_seq cleanup
,
766 enum gimple_try_flags kind
)
770 gcc_assert (kind
== GIMPLE_TRY_CATCH
|| kind
== GIMPLE_TRY_FINALLY
);
771 p
= gimple_alloc (GIMPLE_TRY
, 0);
772 gimple_set_subcode (p
, kind
);
774 gimple_try_set_eval (p
, eval
);
776 gimple_try_set_cleanup (p
, cleanup
);
781 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
783 CLEANUP is the cleanup expression. */
786 gimple_build_wce (gimple_seq cleanup
)
788 gimple p
= gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR
, 0);
790 gimple_wce_set_cleanup (p
, cleanup
);
796 /* Build a GIMPLE_RESX statement. */
799 gimple_build_resx (int region
)
801 gimple p
= gimple_build_with_ops (GIMPLE_RESX
, ERROR_MARK
, 0);
802 p
->gimple_eh_ctrl
.region
= region
;
807 /* The helper for constructing a gimple switch statement.
808 INDEX is the switch's index.
809 NLABELS is the number of labels in the switch excluding the default.
810 DEFAULT_LABEL is the default label for the switch statement. */
813 gimple_build_switch_nlabels (unsigned nlabels
, tree index
, tree default_label
)
815 /* nlabels + 1 default label + 1 index. */
816 gimple p
= gimple_build_with_ops (GIMPLE_SWITCH
, ERROR_MARK
,
817 1 + (default_label
!= NULL
) + nlabels
);
818 gimple_switch_set_index (p
, index
);
820 gimple_switch_set_default_label (p
, default_label
);
825 /* Build a GIMPLE_SWITCH statement.
827 INDEX is the switch's index.
828 NLABELS is the number of labels in the switch excluding the DEFAULT_LABEL.
829 ... are the labels excluding the default. */
832 gimple_build_switch (unsigned nlabels
, tree index
, tree default_label
, ...)
836 gimple p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
838 /* Store the rest of the labels. */
839 va_start (al
, default_label
);
840 offset
= (default_label
!= NULL
);
841 for (i
= 0; i
< nlabels
; i
++)
842 gimple_switch_set_label (p
, i
+ offset
, va_arg (al
, tree
));
849 /* Build a GIMPLE_SWITCH statement.
851 INDEX is the switch's index.
852 DEFAULT_LABEL is the default label
853 ARGS is a vector of labels excluding the default. */
856 gimple_build_switch_vec (tree index
, tree default_label
, VEC(tree
, heap
) *args
)
858 unsigned i
, offset
, nlabels
= VEC_length (tree
, args
);
859 gimple p
= gimple_build_switch_nlabels (nlabels
, index
, default_label
);
861 /* Copy the labels from the vector to the switch statement. */
862 offset
= (default_label
!= NULL
);
863 for (i
= 0; i
< nlabels
; i
++)
864 gimple_switch_set_label (p
, i
+ offset
, VEC_index (tree
, args
, i
));
869 /* Build a GIMPLE_EH_DISPATCH statement. */
872 gimple_build_eh_dispatch (int region
)
874 gimple p
= gimple_build_with_ops (GIMPLE_EH_DISPATCH
, ERROR_MARK
, 0);
875 p
->gimple_eh_ctrl
.region
= region
;
879 /* Build a new GIMPLE_DEBUG_BIND statement.
881 VAR is bound to VALUE; block and location are taken from STMT. */
884 gimple_build_debug_bind_stat (tree var
, tree value
, gimple stmt MEM_STAT_DECL
)
886 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
887 (unsigned)GIMPLE_DEBUG_BIND
, 2
890 gimple_debug_bind_set_var (p
, var
);
891 gimple_debug_bind_set_value (p
, value
);
894 gimple_set_block (p
, gimple_block (stmt
));
895 gimple_set_location (p
, gimple_location (stmt
));
902 /* Build a new GIMPLE_DEBUG_SOURCE_BIND statement.
904 VAR is bound to VALUE; block and location are taken from STMT. */
907 gimple_build_debug_source_bind_stat (tree var
, tree value
,
908 gimple stmt MEM_STAT_DECL
)
910 gimple p
= gimple_build_with_ops_stat (GIMPLE_DEBUG
,
911 (unsigned)GIMPLE_DEBUG_SOURCE_BIND
, 2
914 gimple_debug_source_bind_set_var (p
, var
);
915 gimple_debug_source_bind_set_value (p
, value
);
918 gimple_set_block (p
, gimple_block (stmt
));
919 gimple_set_location (p
, gimple_location (stmt
));
926 /* Build a GIMPLE_OMP_CRITICAL statement.
928 BODY is the sequence of statements for which only one thread can execute.
929 NAME is optional identifier for this critical block. */
932 gimple_build_omp_critical (gimple_seq body
, tree name
)
934 gimple p
= gimple_alloc (GIMPLE_OMP_CRITICAL
, 0);
935 gimple_omp_critical_set_name (p
, name
);
937 gimple_omp_set_body (p
, body
);
942 /* Build a GIMPLE_OMP_FOR statement.
944 BODY is sequence of statements inside the for loop.
945 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
946 lastprivate, reductions, ordered, schedule, and nowait.
947 COLLAPSE is the collapse count.
948 PRE_BODY is the sequence of statements that are loop invariant. */
951 gimple_build_omp_for (gimple_seq body
, tree clauses
, size_t collapse
,
954 gimple p
= gimple_alloc (GIMPLE_OMP_FOR
, 0);
956 gimple_omp_set_body (p
, body
);
957 gimple_omp_for_set_clauses (p
, clauses
);
958 p
->gimple_omp_for
.collapse
= collapse
;
959 p
->gimple_omp_for
.iter
960 = ggc_alloc_cleared_vec_gimple_omp_for_iter (collapse
);
962 gimple_omp_for_set_pre_body (p
, pre_body
);
968 /* Build a GIMPLE_OMP_PARALLEL statement.
970 BODY is sequence of statements which are executed in parallel.
971 CLAUSES, are the OMP parallel construct's clauses.
972 CHILD_FN is the function created for the parallel threads to execute.
973 DATA_ARG are the shared data argument(s). */
976 gimple_build_omp_parallel (gimple_seq body
, tree clauses
, tree child_fn
,
979 gimple p
= gimple_alloc (GIMPLE_OMP_PARALLEL
, 0);
981 gimple_omp_set_body (p
, body
);
982 gimple_omp_parallel_set_clauses (p
, clauses
);
983 gimple_omp_parallel_set_child_fn (p
, child_fn
);
984 gimple_omp_parallel_set_data_arg (p
, data_arg
);
990 /* Build a GIMPLE_OMP_TASK statement.
992 BODY is sequence of statements which are executed by the explicit task.
993 CLAUSES, are the OMP parallel construct's clauses.
994 CHILD_FN is the function created for the parallel threads to execute.
995 DATA_ARG are the shared data argument(s).
996 COPY_FN is the optional function for firstprivate initialization.
997 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
1000 gimple_build_omp_task (gimple_seq body
, tree clauses
, tree child_fn
,
1001 tree data_arg
, tree copy_fn
, tree arg_size
,
1004 gimple p
= gimple_alloc (GIMPLE_OMP_TASK
, 0);
1006 gimple_omp_set_body (p
, body
);
1007 gimple_omp_task_set_clauses (p
, clauses
);
1008 gimple_omp_task_set_child_fn (p
, child_fn
);
1009 gimple_omp_task_set_data_arg (p
, data_arg
);
1010 gimple_omp_task_set_copy_fn (p
, copy_fn
);
1011 gimple_omp_task_set_arg_size (p
, arg_size
);
1012 gimple_omp_task_set_arg_align (p
, arg_align
);
1018 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
1020 BODY is the sequence of statements in the section. */
1023 gimple_build_omp_section (gimple_seq body
)
1025 gimple p
= gimple_alloc (GIMPLE_OMP_SECTION
, 0);
1027 gimple_omp_set_body (p
, body
);
1033 /* Build a GIMPLE_OMP_MASTER statement.
1035 BODY is the sequence of statements to be executed by just the master. */
1038 gimple_build_omp_master (gimple_seq body
)
1040 gimple p
= gimple_alloc (GIMPLE_OMP_MASTER
, 0);
1042 gimple_omp_set_body (p
, body
);
1048 /* Build a GIMPLE_OMP_CONTINUE statement.
1050 CONTROL_DEF is the definition of the control variable.
1051 CONTROL_USE is the use of the control variable. */
1054 gimple_build_omp_continue (tree control_def
, tree control_use
)
1056 gimple p
= gimple_alloc (GIMPLE_OMP_CONTINUE
, 0);
1057 gimple_omp_continue_set_control_def (p
, control_def
);
1058 gimple_omp_continue_set_control_use (p
, control_use
);
1062 /* Build a GIMPLE_OMP_ORDERED statement.
1064 BODY is the sequence of statements inside a loop that will executed in
1068 gimple_build_omp_ordered (gimple_seq body
)
1070 gimple p
= gimple_alloc (GIMPLE_OMP_ORDERED
, 0);
1072 gimple_omp_set_body (p
, body
);
1078 /* Build a GIMPLE_OMP_RETURN statement.
1079 WAIT_P is true if this is a non-waiting return. */
1082 gimple_build_omp_return (bool wait_p
)
1084 gimple p
= gimple_alloc (GIMPLE_OMP_RETURN
, 0);
1086 gimple_omp_return_set_nowait (p
);
1092 /* Build a GIMPLE_OMP_SECTIONS statement.
1094 BODY is a sequence of section statements.
1095 CLAUSES are any of the OMP sections contsruct's clauses: private,
1096 firstprivate, lastprivate, reduction, and nowait. */
1099 gimple_build_omp_sections (gimple_seq body
, tree clauses
)
1101 gimple p
= gimple_alloc (GIMPLE_OMP_SECTIONS
, 0);
1103 gimple_omp_set_body (p
, body
);
1104 gimple_omp_sections_set_clauses (p
, clauses
);
1110 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
1113 gimple_build_omp_sections_switch (void)
1115 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH
, 0);
1119 /* Build a GIMPLE_OMP_SINGLE statement.
1121 BODY is the sequence of statements that will be executed once.
1122 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
1123 copyprivate, nowait. */
1126 gimple_build_omp_single (gimple_seq body
, tree clauses
)
1128 gimple p
= gimple_alloc (GIMPLE_OMP_SINGLE
, 0);
1130 gimple_omp_set_body (p
, body
);
1131 gimple_omp_single_set_clauses (p
, clauses
);
1137 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1140 gimple_build_omp_atomic_load (tree lhs
, tree rhs
)
1142 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD
, 0);
1143 gimple_omp_atomic_load_set_lhs (p
, lhs
);
1144 gimple_omp_atomic_load_set_rhs (p
, rhs
);
1148 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1150 VAL is the value we are storing. */
1153 gimple_build_omp_atomic_store (tree val
)
1155 gimple p
= gimple_alloc (GIMPLE_OMP_ATOMIC_STORE
, 0);
1156 gimple_omp_atomic_store_set_val (p
, val
);
1160 /* Build a GIMPLE_TRANSACTION statement. */
1163 gimple_build_transaction (gimple_seq body
, tree label
)
1165 gimple p
= gimple_alloc (GIMPLE_TRANSACTION
, 0);
1166 gimple_transaction_set_body (p
, body
);
1167 gimple_transaction_set_label (p
, label
);
1171 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1172 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1175 gimple_build_predict (enum br_predictor predictor
, enum prediction outcome
)
1177 gimple p
= gimple_alloc (GIMPLE_PREDICT
, 0);
1178 /* Ensure all the predictors fit into the lower bits of the subcode. */
1179 gcc_assert ((int) END_PREDICTORS
<= GF_PREDICT_TAKEN
);
1180 gimple_predict_set_predictor (p
, predictor
);
1181 gimple_predict_set_outcome (p
, outcome
);
1185 #if defined ENABLE_GIMPLE_CHECKING
1186 /* Complain of a gimple type mismatch and die. */
1189 gimple_check_failed (const_gimple gs
, const char *file
, int line
,
1190 const char *function
, enum gimple_code code
,
1191 enum tree_code subcode
)
1193 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1194 gimple_code_name
[code
],
1195 tree_code_name
[subcode
],
1196 gimple_code_name
[gimple_code (gs
)],
1197 gs
->gsbase
.subcode
> 0
1198 ? tree_code_name
[gs
->gsbase
.subcode
]
1200 function
, trim_filename (file
), line
);
1202 #endif /* ENABLE_GIMPLE_CHECKING */
1205 /* Allocate a new GIMPLE sequence in GC memory and return it. If
1206 there are free sequences in GIMPLE_SEQ_CACHE return one of those
1210 gimple_seq_alloc (void)
1212 gimple_seq seq
= gimple_seq_cache
;
1215 gimple_seq_cache
= gimple_seq_cache
->next_free
;
1216 gcc_assert (gimple_seq_cache
!= seq
);
1217 memset (seq
, 0, sizeof (*seq
));
1221 seq
= ggc_alloc_cleared_gimple_seq_d ();
1222 #ifdef GATHER_STATISTICS
1223 gimple_alloc_counts
[(int) gimple_alloc_kind_seq
]++;
1224 gimple_alloc_sizes
[(int) gimple_alloc_kind_seq
] += sizeof (*seq
);
1231 /* Return SEQ to the free pool of GIMPLE sequences. */
1234 gimple_seq_free (gimple_seq seq
)
1239 gcc_assert (gimple_seq_first (seq
) == NULL
);
1240 gcc_assert (gimple_seq_last (seq
) == NULL
);
1242 /* If this triggers, it's a sign that the same list is being freed
1244 gcc_assert (seq
!= gimple_seq_cache
|| gimple_seq_cache
== NULL
);
1246 /* Add SEQ to the pool of free sequences. */
1247 seq
->next_free
= gimple_seq_cache
;
1248 gimple_seq_cache
= seq
;
1252 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1253 *SEQ_P is NULL, a new sequence is allocated. */
1256 gimple_seq_add_stmt (gimple_seq
*seq_p
, gimple gs
)
1258 gimple_stmt_iterator si
;
1264 *seq_p
= gimple_seq_alloc ();
1266 si
= gsi_last (*seq_p
);
1267 gsi_insert_after (&si
, gs
, GSI_NEW_STMT
);
1271 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1272 NULL, a new sequence is allocated. */
1275 gimple_seq_add_seq (gimple_seq
*dst_p
, gimple_seq src
)
1277 gimple_stmt_iterator si
;
1283 *dst_p
= gimple_seq_alloc ();
1285 si
= gsi_last (*dst_p
);
1286 gsi_insert_seq_after (&si
, src
, GSI_NEW_STMT
);
1290 /* Helper function of empty_body_p. Return true if STMT is an empty
1294 empty_stmt_p (gimple stmt
)
1296 if (gimple_code (stmt
) == GIMPLE_NOP
)
1298 if (gimple_code (stmt
) == GIMPLE_BIND
)
1299 return empty_body_p (gimple_bind_body (stmt
));
1304 /* Return true if BODY contains nothing but empty statements. */
1307 empty_body_p (gimple_seq body
)
1309 gimple_stmt_iterator i
;
1311 if (gimple_seq_empty_p (body
))
1313 for (i
= gsi_start (body
); !gsi_end_p (i
); gsi_next (&i
))
1314 if (!empty_stmt_p (gsi_stmt (i
))
1315 && !is_gimple_debug (gsi_stmt (i
)))
1322 /* Perform a deep copy of sequence SRC and return the result. */
1325 gimple_seq_copy (gimple_seq src
)
1327 gimple_stmt_iterator gsi
;
1328 gimple_seq new_seq
= gimple_seq_alloc ();
1331 for (gsi
= gsi_start (src
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1333 stmt
= gimple_copy (gsi_stmt (gsi
));
1334 gimple_seq_add_stmt (&new_seq
, stmt
);
1341 /* Walk all the statements in the sequence SEQ calling walk_gimple_stmt
1342 on each one. WI is as in walk_gimple_stmt.
1344 If walk_gimple_stmt returns non-NULL, the walk is stopped, and the
1345 value is stored in WI->CALLBACK_RESULT. Also, the statement that
1346 produced the value is returned if this statement has not been
1347 removed by a callback (wi->removed_stmt). If the statement has
1348 been removed, NULL is returned.
1350 Otherwise, all the statements are walked and NULL returned. */
1353 walk_gimple_seq (gimple_seq seq
, walk_stmt_fn callback_stmt
,
1354 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1356 gimple_stmt_iterator gsi
;
1358 for (gsi
= gsi_start (seq
); !gsi_end_p (gsi
); )
1360 tree ret
= walk_gimple_stmt (&gsi
, callback_stmt
, callback_op
, wi
);
1363 /* If CALLBACK_STMT or CALLBACK_OP return a value, WI must exist
1366 wi
->callback_result
= ret
;
1368 return wi
->removed_stmt
? NULL
: gsi_stmt (gsi
);
1371 if (!wi
->removed_stmt
)
1376 wi
->callback_result
= NULL_TREE
;
1382 /* Helper function for walk_gimple_stmt. Walk operands of a GIMPLE_ASM. */
1385 walk_gimple_asm (gimple stmt
, walk_tree_fn callback_op
,
1386 struct walk_stmt_info
*wi
)
1390 const char **oconstraints
;
1392 const char *constraint
;
1393 bool allows_mem
, allows_reg
, is_inout
;
1395 noutputs
= gimple_asm_noutputs (stmt
);
1396 oconstraints
= (const char **) alloca ((noutputs
) * sizeof (const char *));
1401 for (i
= 0; i
< noutputs
; i
++)
1403 op
= gimple_asm_output_op (stmt
, i
);
1404 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1405 oconstraints
[i
] = constraint
;
1406 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
, &allows_reg
,
1409 wi
->val_only
= (allows_reg
|| !allows_mem
);
1410 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1415 n
= gimple_asm_ninputs (stmt
);
1416 for (i
= 0; i
< n
; i
++)
1418 op
= gimple_asm_input_op (stmt
, i
);
1419 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op
)));
1420 parse_input_constraint (&constraint
, 0, 0, noutputs
, 0,
1421 oconstraints
, &allows_mem
, &allows_reg
);
1424 wi
->val_only
= (allows_reg
|| !allows_mem
);
1425 /* Although input "m" is not really a LHS, we need a lvalue. */
1426 wi
->is_lhs
= !wi
->val_only
;
1428 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1436 wi
->val_only
= true;
1439 n
= gimple_asm_nlabels (stmt
);
1440 for (i
= 0; i
< n
; i
++)
1442 op
= gimple_asm_label_op (stmt
, i
);
1443 ret
= walk_tree (&TREE_VALUE (op
), callback_op
, wi
, NULL
);
1452 /* Helper function of WALK_GIMPLE_STMT. Walk every tree operand in
1453 STMT. CALLBACK_OP and WI are as in WALK_GIMPLE_STMT.
1455 CALLBACK_OP is called on each operand of STMT via walk_tree.
1456 Additional parameters to walk_tree must be stored in WI. For each operand
1457 OP, walk_tree is called as:
1459 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
1461 If CALLBACK_OP returns non-NULL for an operand, the remaining
1462 operands are not scanned.
1464 The return value is that returned by the last call to walk_tree, or
1465 NULL_TREE if no CALLBACK_OP is specified. */
1468 walk_gimple_op (gimple stmt
, walk_tree_fn callback_op
,
1469 struct walk_stmt_info
*wi
)
1471 struct pointer_set_t
*pset
= (wi
) ? wi
->pset
: NULL
;
1473 tree ret
= NULL_TREE
;
1475 switch (gimple_code (stmt
))
1478 /* Walk the RHS operands. If the LHS is of a non-renamable type or
1479 is a register variable, we may use a COMPONENT_REF on the RHS. */
1482 tree lhs
= gimple_assign_lhs (stmt
);
1484 = (is_gimple_reg_type (TREE_TYPE (lhs
)) && !is_gimple_reg (lhs
))
1485 || !gimple_assign_single_p (stmt
);
1488 for (i
= 1; i
< gimple_num_ops (stmt
); i
++)
1490 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
,
1496 /* Walk the LHS. If the RHS is appropriate for a memory, we
1497 may use a COMPONENT_REF on the LHS. */
1500 /* If the RHS has more than 1 operand, it is not appropriate
1502 wi
->val_only
= !(is_gimple_mem_rhs (gimple_assign_rhs1 (stmt
))
1503 || TREE_CODE (gimple_assign_rhs1 (stmt
))
1505 || !gimple_assign_single_p (stmt
);
1509 ret
= walk_tree (gimple_op_ptr (stmt
, 0), callback_op
, wi
, pset
);
1515 wi
->val_only
= true;
1524 wi
->val_only
= true;
1527 ret
= walk_tree (gimple_call_chain_ptr (stmt
), callback_op
, wi
, pset
);
1531 ret
= walk_tree (gimple_call_fn_ptr (stmt
), callback_op
, wi
, pset
);
1535 for (i
= 0; i
< gimple_call_num_args (stmt
); i
++)
1539 = is_gimple_reg_type (TREE_TYPE (gimple_call_arg (stmt
, i
)));
1540 ret
= walk_tree (gimple_call_arg_ptr (stmt
, i
), callback_op
, wi
,
1546 if (gimple_call_lhs (stmt
))
1552 = is_gimple_reg_type (TREE_TYPE (gimple_call_lhs (stmt
)));
1555 ret
= walk_tree (gimple_call_lhs_ptr (stmt
), callback_op
, wi
, pset
);
1563 wi
->val_only
= true;
1568 ret
= walk_tree (gimple_catch_types_ptr (stmt
), callback_op
, wi
,
1574 case GIMPLE_EH_FILTER
:
1575 ret
= walk_tree (gimple_eh_filter_types_ptr (stmt
), callback_op
, wi
,
1582 ret
= walk_gimple_asm (stmt
, callback_op
, wi
);
1587 case GIMPLE_OMP_CONTINUE
:
1588 ret
= walk_tree (gimple_omp_continue_control_def_ptr (stmt
),
1589 callback_op
, wi
, pset
);
1593 ret
= walk_tree (gimple_omp_continue_control_use_ptr (stmt
),
1594 callback_op
, wi
, pset
);
1599 case GIMPLE_OMP_CRITICAL
:
1600 ret
= walk_tree (gimple_omp_critical_name_ptr (stmt
), callback_op
, wi
,
1606 case GIMPLE_OMP_FOR
:
1607 ret
= walk_tree (gimple_omp_for_clauses_ptr (stmt
), callback_op
, wi
,
1611 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
1613 ret
= walk_tree (gimple_omp_for_index_ptr (stmt
, i
), callback_op
,
1617 ret
= walk_tree (gimple_omp_for_initial_ptr (stmt
, i
), callback_op
,
1621 ret
= walk_tree (gimple_omp_for_final_ptr (stmt
, i
), callback_op
,
1625 ret
= walk_tree (gimple_omp_for_incr_ptr (stmt
, i
), callback_op
,
1632 case GIMPLE_OMP_PARALLEL
:
1633 ret
= walk_tree (gimple_omp_parallel_clauses_ptr (stmt
), callback_op
,
1637 ret
= walk_tree (gimple_omp_parallel_child_fn_ptr (stmt
), callback_op
,
1641 ret
= walk_tree (gimple_omp_parallel_data_arg_ptr (stmt
), callback_op
,
1647 case GIMPLE_OMP_TASK
:
1648 ret
= walk_tree (gimple_omp_task_clauses_ptr (stmt
), callback_op
,
1652 ret
= walk_tree (gimple_omp_task_child_fn_ptr (stmt
), callback_op
,
1656 ret
= walk_tree (gimple_omp_task_data_arg_ptr (stmt
), callback_op
,
1660 ret
= walk_tree (gimple_omp_task_copy_fn_ptr (stmt
), callback_op
,
1664 ret
= walk_tree (gimple_omp_task_arg_size_ptr (stmt
), callback_op
,
1668 ret
= walk_tree (gimple_omp_task_arg_align_ptr (stmt
), callback_op
,
1674 case GIMPLE_OMP_SECTIONS
:
1675 ret
= walk_tree (gimple_omp_sections_clauses_ptr (stmt
), callback_op
,
1680 ret
= walk_tree (gimple_omp_sections_control_ptr (stmt
), callback_op
,
1687 case GIMPLE_OMP_SINGLE
:
1688 ret
= walk_tree (gimple_omp_single_clauses_ptr (stmt
), callback_op
, wi
,
1694 case GIMPLE_OMP_ATOMIC_LOAD
:
1695 ret
= walk_tree (gimple_omp_atomic_load_lhs_ptr (stmt
), callback_op
, wi
,
1700 ret
= walk_tree (gimple_omp_atomic_load_rhs_ptr (stmt
), callback_op
, wi
,
1706 case GIMPLE_OMP_ATOMIC_STORE
:
1707 ret
= walk_tree (gimple_omp_atomic_store_val_ptr (stmt
), callback_op
,
1713 case GIMPLE_TRANSACTION
:
1714 ret
= walk_tree (gimple_transaction_label_ptr (stmt
), callback_op
,
1720 /* Tuples that do not have operands. */
1723 case GIMPLE_OMP_RETURN
:
1724 case GIMPLE_PREDICT
:
1729 enum gimple_statement_structure_enum gss
;
1730 gss
= gimple_statement_structure (stmt
);
1731 if (gss
== GSS_WITH_OPS
|| gss
== GSS_WITH_MEM_OPS
)
1732 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1734 ret
= walk_tree (gimple_op_ptr (stmt
, i
), callback_op
, wi
, pset
);
1746 /* Walk the current statement in GSI (optionally using traversal state
1747 stored in WI). If WI is NULL, no state is kept during traversal.
1748 The callback CALLBACK_STMT is called. If CALLBACK_STMT indicates
1749 that it has handled all the operands of the statement, its return
1750 value is returned. Otherwise, the return value from CALLBACK_STMT
1751 is discarded and its operands are scanned.
1753 If CALLBACK_STMT is NULL or it didn't handle the operands,
1754 CALLBACK_OP is called on each operand of the statement via
1755 walk_gimple_op. If walk_gimple_op returns non-NULL for any
1756 operand, the remaining operands are not scanned. In this case, the
1757 return value from CALLBACK_OP is returned.
1759 In any other case, NULL_TREE is returned. */
1762 walk_gimple_stmt (gimple_stmt_iterator
*gsi
, walk_stmt_fn callback_stmt
,
1763 walk_tree_fn callback_op
, struct walk_stmt_info
*wi
)
1767 gimple stmt
= gsi_stmt (*gsi
);
1772 wi
->removed_stmt
= false;
1774 if (wi
->want_locations
&& gimple_has_location (stmt
))
1775 input_location
= gimple_location (stmt
);
1780 /* Invoke the statement callback. Return if the callback handled
1781 all of STMT operands by itself. */
1784 bool handled_ops
= false;
1785 tree_ret
= callback_stmt (gsi
, &handled_ops
, wi
);
1789 /* If CALLBACK_STMT did not handle operands, it should not have
1790 a value to return. */
1791 gcc_assert (tree_ret
== NULL
);
1793 if (wi
&& wi
->removed_stmt
)
1796 /* Re-read stmt in case the callback changed it. */
1797 stmt
= gsi_stmt (*gsi
);
1800 /* If CALLBACK_OP is defined, invoke it on every operand of STMT. */
1803 tree_ret
= walk_gimple_op (stmt
, callback_op
, wi
);
1808 /* If STMT can have statements inside (e.g. GIMPLE_BIND), walk them. */
1809 switch (gimple_code (stmt
))
1812 ret
= walk_gimple_seq (gimple_bind_body (stmt
), callback_stmt
,
1815 return wi
->callback_result
;
1819 ret
= walk_gimple_seq (gimple_catch_handler (stmt
), callback_stmt
,
1822 return wi
->callback_result
;
1825 case GIMPLE_EH_FILTER
:
1826 ret
= walk_gimple_seq (gimple_eh_filter_failure (stmt
), callback_stmt
,
1829 return wi
->callback_result
;
1832 case GIMPLE_EH_ELSE
:
1833 ret
= walk_gimple_seq (gimple_eh_else_n_body (stmt
),
1834 callback_stmt
, callback_op
, wi
);
1836 return wi
->callback_result
;
1837 ret
= walk_gimple_seq (gimple_eh_else_e_body (stmt
),
1838 callback_stmt
, callback_op
, wi
);
1840 return wi
->callback_result
;
1844 ret
= walk_gimple_seq (gimple_try_eval (stmt
), callback_stmt
, callback_op
,
1847 return wi
->callback_result
;
1849 ret
= walk_gimple_seq (gimple_try_cleanup (stmt
), callback_stmt
,
1852 return wi
->callback_result
;
1855 case GIMPLE_OMP_FOR
:
1856 ret
= walk_gimple_seq (gimple_omp_for_pre_body (stmt
), callback_stmt
,
1859 return wi
->callback_result
;
1862 case GIMPLE_OMP_CRITICAL
:
1863 case GIMPLE_OMP_MASTER
:
1864 case GIMPLE_OMP_ORDERED
:
1865 case GIMPLE_OMP_SECTION
:
1866 case GIMPLE_OMP_PARALLEL
:
1867 case GIMPLE_OMP_TASK
:
1868 case GIMPLE_OMP_SECTIONS
:
1869 case GIMPLE_OMP_SINGLE
:
1870 ret
= walk_gimple_seq (gimple_omp_body (stmt
), callback_stmt
,
1873 return wi
->callback_result
;
1876 case GIMPLE_WITH_CLEANUP_EXPR
:
1877 ret
= walk_gimple_seq (gimple_wce_cleanup (stmt
), callback_stmt
,
1880 return wi
->callback_result
;
1883 case GIMPLE_TRANSACTION
:
1884 ret
= walk_gimple_seq (gimple_transaction_body (stmt
),
1885 callback_stmt
, callback_op
, wi
);
1887 return wi
->callback_result
;
1891 gcc_assert (!gimple_has_substatements (stmt
));
1899 /* Set sequence SEQ to be the GIMPLE body for function FN. */
1902 gimple_set_body (tree fndecl
, gimple_seq seq
)
1904 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1907 /* If FNDECL still does not have a function structure associated
1908 with it, then it does not make sense for it to receive a
1910 gcc_assert (seq
== NULL
);
1913 fn
->gimple_body
= seq
;
1917 /* Return the body of GIMPLE statements for function FN. After the
1918 CFG pass, the function body doesn't exist anymore because it has
1919 been split up into basic blocks. In this case, it returns
1923 gimple_body (tree fndecl
)
1925 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1926 return fn
? fn
->gimple_body
: NULL
;
1929 /* Return true when FNDECL has Gimple body either in unlowered
1932 gimple_has_body_p (tree fndecl
)
1934 struct function
*fn
= DECL_STRUCT_FUNCTION (fndecl
);
1935 return (gimple_body (fndecl
) || (fn
&& fn
->cfg
));
1938 /* Return true if calls C1 and C2 are known to go to the same function. */
1941 gimple_call_same_target_p (const_gimple c1
, const_gimple c2
)
1943 if (gimple_call_internal_p (c1
))
1944 return (gimple_call_internal_p (c2
)
1945 && gimple_call_internal_fn (c1
) == gimple_call_internal_fn (c2
));
1947 return (gimple_call_fn (c1
) == gimple_call_fn (c2
)
1948 || (gimple_call_fndecl (c1
)
1949 && gimple_call_fndecl (c1
) == gimple_call_fndecl (c2
)));
1952 /* Detect flags from a GIMPLE_CALL. This is just like
1953 call_expr_flags, but for gimple tuples. */
1956 gimple_call_flags (const_gimple stmt
)
1959 tree decl
= gimple_call_fndecl (stmt
);
1962 flags
= flags_from_decl_or_type (decl
);
1963 else if (gimple_call_internal_p (stmt
))
1964 flags
= internal_fn_flags (gimple_call_internal_fn (stmt
));
1966 flags
= flags_from_decl_or_type (gimple_call_fntype (stmt
));
1968 if (stmt
->gsbase
.subcode
& GF_CALL_NOTHROW
)
1969 flags
|= ECF_NOTHROW
;
1974 /* Return the "fn spec" string for call STMT. */
1977 gimple_call_fnspec (const_gimple stmt
)
1981 type
= gimple_call_fntype (stmt
);
1985 attr
= lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type
));
1989 return TREE_VALUE (TREE_VALUE (attr
));
1992 /* Detects argument flags for argument number ARG on call STMT. */
1995 gimple_call_arg_flags (const_gimple stmt
, unsigned arg
)
1997 tree attr
= gimple_call_fnspec (stmt
);
1999 if (!attr
|| 1 + arg
>= (unsigned) TREE_STRING_LENGTH (attr
))
2002 switch (TREE_STRING_POINTER (attr
)[1 + arg
])
2009 return EAF_DIRECT
| EAF_NOCLOBBER
| EAF_NOESCAPE
;
2012 return EAF_NOCLOBBER
| EAF_NOESCAPE
;
2015 return EAF_DIRECT
| EAF_NOESCAPE
;
2018 return EAF_NOESCAPE
;
2026 /* Detects return flags for the call STMT. */
2029 gimple_call_return_flags (const_gimple stmt
)
2033 if (gimple_call_flags (stmt
) & ECF_MALLOC
)
2036 attr
= gimple_call_fnspec (stmt
);
2037 if (!attr
|| TREE_STRING_LENGTH (attr
) < 1)
2040 switch (TREE_STRING_POINTER (attr
)[0])
2046 return ERF_RETURNS_ARG
| (TREE_STRING_POINTER (attr
)[0] - '1');
2058 /* Return true if GS is a copy assignment. */
2061 gimple_assign_copy_p (gimple gs
)
2063 return (gimple_assign_single_p (gs
)
2064 && is_gimple_val (gimple_op (gs
, 1)));
2068 /* Return true if GS is a SSA_NAME copy assignment. */
2071 gimple_assign_ssa_name_copy_p (gimple gs
)
2073 return (gimple_assign_single_p (gs
)
2074 && TREE_CODE (gimple_assign_lhs (gs
)) == SSA_NAME
2075 && TREE_CODE (gimple_assign_rhs1 (gs
)) == SSA_NAME
);
2079 /* Return true if GS is an assignment with a unary RHS, but the
2080 operator has no effect on the assigned value. The logic is adapted
2081 from STRIP_NOPS. This predicate is intended to be used in tuplifying
2082 instances in which STRIP_NOPS was previously applied to the RHS of
2085 NOTE: In the use cases that led to the creation of this function
2086 and of gimple_assign_single_p, it is typical to test for either
2087 condition and to proceed in the same manner. In each case, the
2088 assigned value is represented by the single RHS operand of the
2089 assignment. I suspect there may be cases where gimple_assign_copy_p,
2090 gimple_assign_single_p, or equivalent logic is used where a similar
2091 treatment of unary NOPs is appropriate. */
2094 gimple_assign_unary_nop_p (gimple gs
)
2096 return (is_gimple_assign (gs
)
2097 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs
))
2098 || gimple_assign_rhs_code (gs
) == NON_LVALUE_EXPR
)
2099 && gimple_assign_rhs1 (gs
) != error_mark_node
2100 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs
)))
2101 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs
)))));
2104 /* Set BB to be the basic block holding G. */
2107 gimple_set_bb (gimple stmt
, basic_block bb
)
2109 stmt
->gsbase
.bb
= bb
;
2111 /* If the statement is a label, add the label to block-to-labels map
2112 so that we can speed up edge creation for GIMPLE_GOTOs. */
2113 if (cfun
->cfg
&& gimple_code (stmt
) == GIMPLE_LABEL
)
2118 t
= gimple_label_label (stmt
);
2119 uid
= LABEL_DECL_UID (t
);
2122 unsigned old_len
= VEC_length (basic_block
, label_to_block_map
);
2123 LABEL_DECL_UID (t
) = uid
= cfun
->cfg
->last_label_uid
++;
2124 if (old_len
<= (unsigned) uid
)
2126 unsigned new_len
= 3 * uid
/ 2 + 1;
2128 VEC_safe_grow_cleared (basic_block
, gc
, label_to_block_map
,
2133 VEC_replace (basic_block
, label_to_block_map
, uid
, bb
);
2138 /* Modify the RHS of the assignment pointed-to by GSI using the
2139 operands in the expression tree EXPR.
2141 NOTE: The statement pointed-to by GSI may be reallocated if it
2142 did not have enough operand slots.
2144 This function is useful to convert an existing tree expression into
2145 the flat representation used for the RHS of a GIMPLE assignment.
2146 It will reallocate memory as needed to expand or shrink the number
2147 of operand slots needed to represent EXPR.
2149 NOTE: If you find yourself building a tree and then calling this
2150 function, you are most certainly doing it the slow way. It is much
2151 better to build a new assignment or to use the function
2152 gimple_assign_set_rhs_with_ops, which does not require an
2153 expression tree to be built. */
2156 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator
*gsi
, tree expr
)
2158 enum tree_code subcode
;
2161 extract_ops_from_tree_1 (expr
, &subcode
, &op1
, &op2
, &op3
);
2162 gimple_assign_set_rhs_with_ops_1 (gsi
, subcode
, op1
, op2
, op3
);
2166 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
2167 operands OP1, OP2 and OP3.
2169 NOTE: The statement pointed-to by GSI may be reallocated if it
2170 did not have enough operand slots. */
2173 gimple_assign_set_rhs_with_ops_1 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
2174 tree op1
, tree op2
, tree op3
)
2176 unsigned new_rhs_ops
= get_gimple_rhs_num_ops (code
);
2177 gimple stmt
= gsi_stmt (*gsi
);
2179 /* If the new CODE needs more operands, allocate a new statement. */
2180 if (gimple_num_ops (stmt
) < new_rhs_ops
+ 1)
2182 tree lhs
= gimple_assign_lhs (stmt
);
2183 gimple new_stmt
= gimple_alloc (gimple_code (stmt
), new_rhs_ops
+ 1);
2184 memcpy (new_stmt
, stmt
, gimple_size (gimple_code (stmt
)));
2185 gsi_replace (gsi
, new_stmt
, true);
2188 /* The LHS needs to be reset as this also changes the SSA name
2190 gimple_assign_set_lhs (stmt
, lhs
);
2193 gimple_set_num_ops (stmt
, new_rhs_ops
+ 1);
2194 gimple_set_subcode (stmt
, code
);
2195 gimple_assign_set_rhs1 (stmt
, op1
);
2196 if (new_rhs_ops
> 1)
2197 gimple_assign_set_rhs2 (stmt
, op2
);
2198 if (new_rhs_ops
> 2)
2199 gimple_assign_set_rhs3 (stmt
, op3
);
2203 /* Return the LHS of a statement that performs an assignment,
2204 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
2205 for a call to a function that returns no value, or for a
2206 statement other than an assignment or a call. */
2209 gimple_get_lhs (const_gimple stmt
)
2211 enum gimple_code code
= gimple_code (stmt
);
2213 if (code
== GIMPLE_ASSIGN
)
2214 return gimple_assign_lhs (stmt
);
2215 else if (code
== GIMPLE_CALL
)
2216 return gimple_call_lhs (stmt
);
2222 /* Set the LHS of a statement that performs an assignment,
2223 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2226 gimple_set_lhs (gimple stmt
, tree lhs
)
2228 enum gimple_code code
= gimple_code (stmt
);
2230 if (code
== GIMPLE_ASSIGN
)
2231 gimple_assign_set_lhs (stmt
, lhs
);
2232 else if (code
== GIMPLE_CALL
)
2233 gimple_call_set_lhs (stmt
, lhs
);
2238 /* Replace the LHS of STMT, an assignment, either a GIMPLE_ASSIGN or a
2239 GIMPLE_CALL, with NLHS, in preparation for modifying the RHS to an
2240 expression with a different value.
2242 This will update any annotations (say debug bind stmts) referring
2243 to the original LHS, so that they use the RHS instead. This is
2244 done even if NLHS and LHS are the same, for it is understood that
2245 the RHS will be modified afterwards, and NLHS will not be assigned
2246 an equivalent value.
2248 Adjusting any non-annotation uses of the LHS, if needed, is a
2249 responsibility of the caller.
2251 The effect of this call should be pretty much the same as that of
2252 inserting a copy of STMT before STMT, and then removing the
2253 original stmt, at which time gsi_remove() would have update
2254 annotations, but using this function saves all the inserting,
2255 copying and removing. */
2258 gimple_replace_lhs (gimple stmt
, tree nlhs
)
2260 if (MAY_HAVE_DEBUG_STMTS
)
2262 tree lhs
= gimple_get_lhs (stmt
);
2264 gcc_assert (SSA_NAME_DEF_STMT (lhs
) == stmt
);
2266 insert_debug_temp_for_var_def (NULL
, lhs
);
2269 gimple_set_lhs (stmt
, nlhs
);
2272 /* Return a deep copy of statement STMT. All the operands from STMT
2273 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
2274 and VUSE operand arrays are set to empty in the new copy. */
2277 gimple_copy (gimple stmt
)
2279 enum gimple_code code
= gimple_code (stmt
);
2280 unsigned num_ops
= gimple_num_ops (stmt
);
2281 gimple copy
= gimple_alloc (code
, num_ops
);
2284 /* Shallow copy all the fields from STMT. */
2285 memcpy (copy
, stmt
, gimple_size (code
));
2287 /* If STMT has sub-statements, deep-copy them as well. */
2288 if (gimple_has_substatements (stmt
))
2293 switch (gimple_code (stmt
))
2296 new_seq
= gimple_seq_copy (gimple_bind_body (stmt
));
2297 gimple_bind_set_body (copy
, new_seq
);
2298 gimple_bind_set_vars (copy
, unshare_expr (gimple_bind_vars (stmt
)));
2299 gimple_bind_set_block (copy
, gimple_bind_block (stmt
));
2303 new_seq
= gimple_seq_copy (gimple_catch_handler (stmt
));
2304 gimple_catch_set_handler (copy
, new_seq
);
2305 t
= unshare_expr (gimple_catch_types (stmt
));
2306 gimple_catch_set_types (copy
, t
);
2309 case GIMPLE_EH_FILTER
:
2310 new_seq
= gimple_seq_copy (gimple_eh_filter_failure (stmt
));
2311 gimple_eh_filter_set_failure (copy
, new_seq
);
2312 t
= unshare_expr (gimple_eh_filter_types (stmt
));
2313 gimple_eh_filter_set_types (copy
, t
);
2316 case GIMPLE_EH_ELSE
:
2317 new_seq
= gimple_seq_copy (gimple_eh_else_n_body (stmt
));
2318 gimple_eh_else_set_n_body (copy
, new_seq
);
2319 new_seq
= gimple_seq_copy (gimple_eh_else_e_body (stmt
));
2320 gimple_eh_else_set_e_body (copy
, new_seq
);
2324 new_seq
= gimple_seq_copy (gimple_try_eval (stmt
));
2325 gimple_try_set_eval (copy
, new_seq
);
2326 new_seq
= gimple_seq_copy (gimple_try_cleanup (stmt
));
2327 gimple_try_set_cleanup (copy
, new_seq
);
2330 case GIMPLE_OMP_FOR
:
2331 new_seq
= gimple_seq_copy (gimple_omp_for_pre_body (stmt
));
2332 gimple_omp_for_set_pre_body (copy
, new_seq
);
2333 t
= unshare_expr (gimple_omp_for_clauses (stmt
));
2334 gimple_omp_for_set_clauses (copy
, t
);
2335 copy
->gimple_omp_for
.iter
2336 = ggc_alloc_vec_gimple_omp_for_iter
2337 (gimple_omp_for_collapse (stmt
));
2338 for (i
= 0; i
< gimple_omp_for_collapse (stmt
); i
++)
2340 gimple_omp_for_set_cond (copy
, i
,
2341 gimple_omp_for_cond (stmt
, i
));
2342 gimple_omp_for_set_index (copy
, i
,
2343 gimple_omp_for_index (stmt
, i
));
2344 t
= unshare_expr (gimple_omp_for_initial (stmt
, i
));
2345 gimple_omp_for_set_initial (copy
, i
, t
);
2346 t
= unshare_expr (gimple_omp_for_final (stmt
, i
));
2347 gimple_omp_for_set_final (copy
, i
, t
);
2348 t
= unshare_expr (gimple_omp_for_incr (stmt
, i
));
2349 gimple_omp_for_set_incr (copy
, i
, t
);
2353 case GIMPLE_OMP_PARALLEL
:
2354 t
= unshare_expr (gimple_omp_parallel_clauses (stmt
));
2355 gimple_omp_parallel_set_clauses (copy
, t
);
2356 t
= unshare_expr (gimple_omp_parallel_child_fn (stmt
));
2357 gimple_omp_parallel_set_child_fn (copy
, t
);
2358 t
= unshare_expr (gimple_omp_parallel_data_arg (stmt
));
2359 gimple_omp_parallel_set_data_arg (copy
, t
);
2362 case GIMPLE_OMP_TASK
:
2363 t
= unshare_expr (gimple_omp_task_clauses (stmt
));
2364 gimple_omp_task_set_clauses (copy
, t
);
2365 t
= unshare_expr (gimple_omp_task_child_fn (stmt
));
2366 gimple_omp_task_set_child_fn (copy
, t
);
2367 t
= unshare_expr (gimple_omp_task_data_arg (stmt
));
2368 gimple_omp_task_set_data_arg (copy
, t
);
2369 t
= unshare_expr (gimple_omp_task_copy_fn (stmt
));
2370 gimple_omp_task_set_copy_fn (copy
, t
);
2371 t
= unshare_expr (gimple_omp_task_arg_size (stmt
));
2372 gimple_omp_task_set_arg_size (copy
, t
);
2373 t
= unshare_expr (gimple_omp_task_arg_align (stmt
));
2374 gimple_omp_task_set_arg_align (copy
, t
);
2377 case GIMPLE_OMP_CRITICAL
:
2378 t
= unshare_expr (gimple_omp_critical_name (stmt
));
2379 gimple_omp_critical_set_name (copy
, t
);
2382 case GIMPLE_OMP_SECTIONS
:
2383 t
= unshare_expr (gimple_omp_sections_clauses (stmt
));
2384 gimple_omp_sections_set_clauses (copy
, t
);
2385 t
= unshare_expr (gimple_omp_sections_control (stmt
));
2386 gimple_omp_sections_set_control (copy
, t
);
2389 case GIMPLE_OMP_SINGLE
:
2390 case GIMPLE_OMP_SECTION
:
2391 case GIMPLE_OMP_MASTER
:
2392 case GIMPLE_OMP_ORDERED
:
2394 new_seq
= gimple_seq_copy (gimple_omp_body (stmt
));
2395 gimple_omp_set_body (copy
, new_seq
);
2398 case GIMPLE_TRANSACTION
:
2399 new_seq
= gimple_seq_copy (gimple_transaction_body (stmt
));
2400 gimple_transaction_set_body (copy
, new_seq
);
2403 case GIMPLE_WITH_CLEANUP_EXPR
:
2404 new_seq
= gimple_seq_copy (gimple_wce_cleanup (stmt
));
2405 gimple_wce_set_cleanup (copy
, new_seq
);
2413 /* Make copy of operands. */
2416 for (i
= 0; i
< num_ops
; i
++)
2417 gimple_set_op (copy
, i
, unshare_expr (gimple_op (stmt
, i
)));
2419 /* Clear out SSA operand vectors on COPY. */
2420 if (gimple_has_ops (stmt
))
2422 gimple_set_def_ops (copy
, NULL
);
2423 gimple_set_use_ops (copy
, NULL
);
2426 if (gimple_has_mem_ops (stmt
))
2428 gimple_set_vdef (copy
, gimple_vdef (stmt
));
2429 gimple_set_vuse (copy
, gimple_vuse (stmt
));
2432 /* SSA operands need to be updated. */
2433 gimple_set_modified (copy
, true);
2440 /* Set the MODIFIED flag to MODIFIEDP, iff the gimple statement G has
2441 a MODIFIED field. */
2444 gimple_set_modified (gimple s
, bool modifiedp
)
2446 if (gimple_has_ops (s
))
2447 s
->gsbase
.modified
= (unsigned) modifiedp
;
2451 /* Return true if statement S has side-effects. We consider a
2452 statement to have side effects if:
2454 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
2455 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
2458 gimple_has_side_effects (const_gimple s
)
2460 if (is_gimple_debug (s
))
2463 /* We don't have to scan the arguments to check for
2464 volatile arguments, though, at present, we still
2465 do a scan to check for TREE_SIDE_EFFECTS. */
2466 if (gimple_has_volatile_ops (s
))
2469 if (gimple_code (s
) == GIMPLE_ASM
2470 && gimple_asm_volatile_p (s
))
2473 if (is_gimple_call (s
))
2475 int flags
= gimple_call_flags (s
);
2477 /* An infinite loop is considered a side effect. */
2478 if (!(flags
& (ECF_CONST
| ECF_PURE
))
2479 || (flags
& ECF_LOOPING_CONST_OR_PURE
))
2488 /* Return true if the RHS of statement S has side effects.
2489 We may use it to determine if it is admissable to replace
2490 an assignment or call with a copy of a previously-computed
2491 value. In such cases, side-effects due to the LHS are
2495 gimple_rhs_has_side_effects (const_gimple s
)
2499 if (is_gimple_call (s
))
2501 unsigned nargs
= gimple_call_num_args (s
);
2504 if (!(gimple_call_flags (s
) & (ECF_CONST
| ECF_PURE
)))
2507 /* We cannot use gimple_has_volatile_ops here,
2508 because we must ignore a volatile LHS. */
2509 fn
= gimple_call_fn (s
);
2510 if (fn
&& (TREE_SIDE_EFFECTS (fn
) || TREE_THIS_VOLATILE (fn
)))
2512 gcc_assert (gimple_has_volatile_ops (s
));
2516 for (i
= 0; i
< nargs
; i
++)
2517 if (TREE_SIDE_EFFECTS (gimple_call_arg (s
, i
))
2518 || TREE_THIS_VOLATILE (gimple_call_arg (s
, i
)))
2523 else if (is_gimple_assign (s
))
2525 /* Skip the first operand, the LHS. */
2526 for (i
= 1; i
< gimple_num_ops (s
); i
++)
2527 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
))
2528 || TREE_THIS_VOLATILE (gimple_op (s
, i
)))
2530 gcc_assert (gimple_has_volatile_ops (s
));
2534 else if (is_gimple_debug (s
))
2538 /* For statements without an LHS, examine all arguments. */
2539 for (i
= 0; i
< gimple_num_ops (s
); i
++)
2540 if (TREE_SIDE_EFFECTS (gimple_op (s
, i
))
2541 || TREE_THIS_VOLATILE (gimple_op (s
, i
)))
2543 gcc_assert (gimple_has_volatile_ops (s
));
2551 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
2552 Return true if S can trap. When INCLUDE_MEM is true, check whether
2553 the memory operations could trap. When INCLUDE_STORES is true and
2554 S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */
2557 gimple_could_trap_p_1 (gimple s
, bool include_mem
, bool include_stores
)
2559 tree t
, div
= NULL_TREE
;
2564 unsigned i
, start
= (is_gimple_assign (s
) && !include_stores
) ? 1 : 0;
2566 for (i
= start
; i
< gimple_num_ops (s
); i
++)
2567 if (tree_could_trap_p (gimple_op (s
, i
)))
2571 switch (gimple_code (s
))
2574 return gimple_asm_volatile_p (s
);
2577 t
= gimple_call_fndecl (s
);
2578 /* Assume that calls to weak functions may trap. */
2579 if (!t
|| !DECL_P (t
) || DECL_WEAK (t
))
2584 t
= gimple_expr_type (s
);
2585 op
= gimple_assign_rhs_code (s
);
2586 if (get_gimple_rhs_class (op
) == GIMPLE_BINARY_RHS
)
2587 div
= gimple_assign_rhs2 (s
);
2588 return (operation_could_trap_p (op
, FLOAT_TYPE_P (t
),
2589 (INTEGRAL_TYPE_P (t
)
2590 && TYPE_OVERFLOW_TRAPS (t
)),
2600 /* Return true if statement S can trap. */
2603 gimple_could_trap_p (gimple s
)
2605 return gimple_could_trap_p_1 (s
, true, true);
2608 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
2611 gimple_assign_rhs_could_trap_p (gimple s
)
2613 gcc_assert (is_gimple_assign (s
));
2614 return gimple_could_trap_p_1 (s
, true, false);
2618 /* Print debugging information for gimple stmts generated. */
2621 dump_gimple_statistics (void)
2623 #ifdef GATHER_STATISTICS
2624 int i
, total_tuples
= 0, total_bytes
= 0;
2626 fprintf (stderr
, "\nGIMPLE statements\n");
2627 fprintf (stderr
, "Kind Stmts Bytes\n");
2628 fprintf (stderr
, "---------------------------------------\n");
2629 for (i
= 0; i
< (int) gimple_alloc_kind_all
; ++i
)
2631 fprintf (stderr
, "%-20s %7d %10d\n", gimple_alloc_kind_names
[i
],
2632 gimple_alloc_counts
[i
], gimple_alloc_sizes
[i
]);
2633 total_tuples
+= gimple_alloc_counts
[i
];
2634 total_bytes
+= gimple_alloc_sizes
[i
];
2636 fprintf (stderr
, "---------------------------------------\n");
2637 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_tuples
, total_bytes
);
2638 fprintf (stderr
, "---------------------------------------\n");
2640 fprintf (stderr
, "No gimple statistics\n");
2645 /* Return the number of operands needed on the RHS of a GIMPLE
2646 assignment for an expression with tree code CODE. */
2649 get_gimple_rhs_num_ops (enum tree_code code
)
2651 enum gimple_rhs_class rhs_class
= get_gimple_rhs_class (code
);
2653 if (rhs_class
== GIMPLE_UNARY_RHS
|| rhs_class
== GIMPLE_SINGLE_RHS
)
2655 else if (rhs_class
== GIMPLE_BINARY_RHS
)
2657 else if (rhs_class
== GIMPLE_TERNARY_RHS
)
2663 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
2665 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
2666 : ((TYPE) == tcc_binary \
2667 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
2668 : ((TYPE) == tcc_constant \
2669 || (TYPE) == tcc_declaration \
2670 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
2671 : ((SYM) == TRUTH_AND_EXPR \
2672 || (SYM) == TRUTH_OR_EXPR \
2673 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
2674 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
2675 : ((SYM) == COND_EXPR \
2676 || (SYM) == WIDEN_MULT_PLUS_EXPR \
2677 || (SYM) == WIDEN_MULT_MINUS_EXPR \
2678 || (SYM) == DOT_PROD_EXPR \
2679 || (SYM) == REALIGN_LOAD_EXPR \
2680 || (SYM) == VEC_COND_EXPR \
2681 || (SYM) == VEC_PERM_EXPR \
2682 || (SYM) == FMA_EXPR) ? GIMPLE_TERNARY_RHS \
2683 : ((SYM) == CONSTRUCTOR \
2684 || (SYM) == OBJ_TYPE_REF \
2685 || (SYM) == ASSERT_EXPR \
2686 || (SYM) == ADDR_EXPR \
2687 || (SYM) == WITH_SIZE_EXPR \
2688 || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \
2689 : GIMPLE_INVALID_RHS),
2690 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
2692 const unsigned char gimple_rhs_class_table
[] = {
2693 #include "all-tree.def"
2697 #undef END_OF_BASE_TREE_CODES
2699 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
2701 /* Validation of GIMPLE expressions. */
2703 /* Returns true iff T is a valid RHS for an assignment to a renamed
2704 user -- or front-end generated artificial -- variable. */
2707 is_gimple_reg_rhs (tree t
)
2709 return get_gimple_rhs_class (TREE_CODE (t
)) != GIMPLE_INVALID_RHS
;
2712 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
2713 LHS, or for a call argument. */
2716 is_gimple_mem_rhs (tree t
)
2718 /* If we're dealing with a renamable type, either source or dest must be
2719 a renamed variable. */
2720 if (is_gimple_reg_type (TREE_TYPE (t
)))
2721 return is_gimple_val (t
);
2723 return is_gimple_val (t
) || is_gimple_lvalue (t
);
2726 /* Return true if T is a valid LHS for a GIMPLE assignment expression. */
2729 is_gimple_lvalue (tree t
)
2731 return (is_gimple_addressable (t
)
2732 || TREE_CODE (t
) == WITH_SIZE_EXPR
2733 /* These are complex lvalues, but don't have addresses, so they
2735 || TREE_CODE (t
) == BIT_FIELD_REF
);
2738 /* Return true if T is a GIMPLE condition. */
2741 is_gimple_condexpr (tree t
)
2743 return (is_gimple_val (t
) || (COMPARISON_CLASS_P (t
)
2744 && !tree_could_throw_p (t
)
2745 && is_gimple_val (TREE_OPERAND (t
, 0))
2746 && is_gimple_val (TREE_OPERAND (t
, 1))));
2749 /* Return true if T is something whose address can be taken. */
2752 is_gimple_addressable (tree t
)
2754 return (is_gimple_id (t
) || handled_component_p (t
)
2755 || TREE_CODE (t
) == MEM_REF
);
2758 /* Return true if T is a valid gimple constant. */
2761 is_gimple_constant (const_tree t
)
2763 switch (TREE_CODE (t
))
2773 /* Vector constant constructors are gimple invariant. */
2775 if (TREE_TYPE (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2776 return TREE_CONSTANT (t
);
2785 /* Return true if T is a gimple address. */
2788 is_gimple_address (const_tree t
)
2792 if (TREE_CODE (t
) != ADDR_EXPR
)
2795 op
= TREE_OPERAND (t
, 0);
2796 while (handled_component_p (op
))
2798 if ((TREE_CODE (op
) == ARRAY_REF
2799 || TREE_CODE (op
) == ARRAY_RANGE_REF
)
2800 && !is_gimple_val (TREE_OPERAND (op
, 1)))
2803 op
= TREE_OPERAND (op
, 0);
2806 if (CONSTANT_CLASS_P (op
) || TREE_CODE (op
) == MEM_REF
)
2809 switch (TREE_CODE (op
))
2824 /* Return true if T is a gimple invariant address. */
2827 is_gimple_invariant_address (const_tree t
)
2831 if (TREE_CODE (t
) != ADDR_EXPR
)
2834 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2838 if (TREE_CODE (op
) == MEM_REF
)
2840 const_tree op0
= TREE_OPERAND (op
, 0);
2841 return (TREE_CODE (op0
) == ADDR_EXPR
2842 && (CONSTANT_CLASS_P (TREE_OPERAND (op0
, 0))
2843 || decl_address_invariant_p (TREE_OPERAND (op0
, 0))));
2846 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2849 /* Return true if T is a gimple invariant address at IPA level
2850 (so addresses of variables on stack are not allowed). */
2853 is_gimple_ip_invariant_address (const_tree t
)
2857 if (TREE_CODE (t
) != ADDR_EXPR
)
2860 op
= strip_invariant_refs (TREE_OPERAND (t
, 0));
2862 return op
&& (CONSTANT_CLASS_P (op
) || decl_address_ip_invariant_p (op
));
2865 /* Return true if T is a GIMPLE minimal invariant. It's a restricted
2866 form of function invariant. */
2869 is_gimple_min_invariant (const_tree t
)
2871 if (TREE_CODE (t
) == ADDR_EXPR
)
2872 return is_gimple_invariant_address (t
);
2874 return is_gimple_constant (t
);
2877 /* Return true if T is a GIMPLE interprocedural invariant. It's a restricted
2878 form of gimple minimal invariant. */
2881 is_gimple_ip_invariant (const_tree t
)
2883 if (TREE_CODE (t
) == ADDR_EXPR
)
2884 return is_gimple_ip_invariant_address (t
);
2886 return is_gimple_constant (t
);
2889 /* Return true if T looks like a valid GIMPLE statement. */
2892 is_gimple_stmt (tree t
)
2894 const enum tree_code code
= TREE_CODE (t
);
2899 /* The only valid NOP_EXPR is the empty statement. */
2900 return IS_EMPTY_STMT (t
);
2904 /* These are only valid if they're void. */
2905 return TREE_TYPE (t
) == NULL
|| VOID_TYPE_P (TREE_TYPE (t
));
2911 case CASE_LABEL_EXPR
:
2912 case TRY_CATCH_EXPR
:
2913 case TRY_FINALLY_EXPR
:
2914 case EH_FILTER_EXPR
:
2917 case STATEMENT_LIST
:
2927 /* These are always void. */
2933 /* These are valid regardless of their type. */
2941 /* Return true if T is a variable. */
2944 is_gimple_variable (tree t
)
2946 return (TREE_CODE (t
) == VAR_DECL
2947 || TREE_CODE (t
) == PARM_DECL
2948 || TREE_CODE (t
) == RESULT_DECL
2949 || TREE_CODE (t
) == SSA_NAME
);
2952 /* Return true if T is a GIMPLE identifier (something with an address). */
2955 is_gimple_id (tree t
)
2957 return (is_gimple_variable (t
)
2958 || TREE_CODE (t
) == FUNCTION_DECL
2959 || TREE_CODE (t
) == LABEL_DECL
2960 || TREE_CODE (t
) == CONST_DECL
2961 /* Allow string constants, since they are addressable. */
2962 || TREE_CODE (t
) == STRING_CST
);
2965 /* Return true if TYPE is a suitable type for a scalar register variable. */
2968 is_gimple_reg_type (tree type
)
2970 return !AGGREGATE_TYPE_P (type
);
2973 /* Return true if T is a non-aggregate register variable. */
2976 is_gimple_reg (tree t
)
2978 if (TREE_CODE (t
) == SSA_NAME
)
2979 t
= SSA_NAME_VAR (t
);
2981 if (!is_gimple_variable (t
))
2984 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2987 /* A volatile decl is not acceptable because we can't reuse it as
2988 needed. We need to copy it into a temp first. */
2989 if (TREE_THIS_VOLATILE (t
))
2992 /* We define "registers" as things that can be renamed as needed,
2993 which with our infrastructure does not apply to memory. */
2994 if (needs_to_live_in_memory (t
))
2997 /* Hard register variables are an interesting case. For those that
2998 are call-clobbered, we don't know where all the calls are, since
2999 we don't (want to) take into account which operations will turn
3000 into libcalls at the rtl level. For those that are call-saved,
3001 we don't currently model the fact that calls may in fact change
3002 global hard registers, nor do we examine ASM_CLOBBERS at the tree
3003 level, and so miss variable changes that might imply. All around,
3004 it seems safest to not do too much optimization with these at the
3005 tree level at all. We'll have to rely on the rtl optimizers to
3006 clean this up, as there we've got all the appropriate bits exposed. */
3007 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
3010 /* Complex and vector values must have been put into SSA-like form.
3011 That is, no assignments to the individual components. */
3012 if (TREE_CODE (TREE_TYPE (t
)) == COMPLEX_TYPE
3013 || TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3014 return DECL_GIMPLE_REG_P (t
);
3020 /* Return true if T is a GIMPLE variable whose address is not needed. */
3023 is_gimple_non_addressable (tree t
)
3025 if (TREE_CODE (t
) == SSA_NAME
)
3026 t
= SSA_NAME_VAR (t
);
3028 return (is_gimple_variable (t
) && ! needs_to_live_in_memory (t
));
3031 /* Return true if T is a GIMPLE rvalue, i.e. an identifier or a constant. */
3034 is_gimple_val (tree t
)
3036 /* Make loads from volatiles and memory vars explicit. */
3037 if (is_gimple_variable (t
)
3038 && is_gimple_reg_type (TREE_TYPE (t
))
3039 && !is_gimple_reg (t
))
3042 return (is_gimple_variable (t
) || is_gimple_min_invariant (t
));
3045 /* Similarly, but accept hard registers as inputs to asm statements. */
3048 is_gimple_asm_val (tree t
)
3050 if (TREE_CODE (t
) == VAR_DECL
&& DECL_HARD_REGISTER (t
))
3053 return is_gimple_val (t
);
3056 /* Return true if T is a GIMPLE minimal lvalue. */
3059 is_gimple_min_lval (tree t
)
3061 if (!(t
= CONST_CAST_TREE (strip_invariant_refs (t
))))
3063 return (is_gimple_id (t
) || TREE_CODE (t
) == MEM_REF
);
3066 /* Return true if T is a valid function operand of a CALL_EXPR. */
3069 is_gimple_call_addr (tree t
)
3071 return (TREE_CODE (t
) == OBJ_TYPE_REF
|| is_gimple_val (t
));
3074 /* Return true if T is a valid address operand of a MEM_REF. */
3077 is_gimple_mem_ref_addr (tree t
)
3079 return (is_gimple_reg (t
)
3080 || TREE_CODE (t
) == INTEGER_CST
3081 || (TREE_CODE (t
) == ADDR_EXPR
3082 && (CONSTANT_CLASS_P (TREE_OPERAND (t
, 0))
3083 || decl_address_invariant_p (TREE_OPERAND (t
, 0)))));
3087 /* Given a memory reference expression T, return its base address.
3088 The base address of a memory reference expression is the main
3089 object being referenced. For instance, the base address for
3090 'array[i].fld[j]' is 'array'. You can think of this as stripping
3091 away the offset part from a memory address.
3093 This function calls handled_component_p to strip away all the inner
3094 parts of the memory reference until it reaches the base object. */
3097 get_base_address (tree t
)
3099 while (handled_component_p (t
))
3100 t
= TREE_OPERAND (t
, 0);
3102 if ((TREE_CODE (t
) == MEM_REF
3103 || TREE_CODE (t
) == TARGET_MEM_REF
)
3104 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
3105 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
3107 if (TREE_CODE (t
) == SSA_NAME
3109 || TREE_CODE (t
) == STRING_CST
3110 || TREE_CODE (t
) == CONSTRUCTOR
3111 || INDIRECT_REF_P (t
)
3112 || TREE_CODE (t
) == MEM_REF
3113 || TREE_CODE (t
) == TARGET_MEM_REF
)
3120 recalculate_side_effects (tree t
)
3122 enum tree_code code
= TREE_CODE (t
);
3123 int len
= TREE_OPERAND_LENGTH (t
);
3126 switch (TREE_CODE_CLASS (code
))
3128 case tcc_expression
:
3134 case PREDECREMENT_EXPR
:
3135 case PREINCREMENT_EXPR
:
3136 case POSTDECREMENT_EXPR
:
3137 case POSTINCREMENT_EXPR
:
3138 /* All of these have side-effects, no matter what their
3147 case tcc_comparison
: /* a comparison expression */
3148 case tcc_unary
: /* a unary arithmetic expression */
3149 case tcc_binary
: /* a binary arithmetic expression */
3150 case tcc_reference
: /* a reference */
3151 case tcc_vl_exp
: /* a function call */
3152 TREE_SIDE_EFFECTS (t
) = TREE_THIS_VOLATILE (t
);
3153 for (i
= 0; i
< len
; ++i
)
3155 tree op
= TREE_OPERAND (t
, i
);
3156 if (op
&& TREE_SIDE_EFFECTS (op
))
3157 TREE_SIDE_EFFECTS (t
) = 1;
3162 /* No side-effects. */
3170 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
3171 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
3172 we failed to create one. */
3175 canonicalize_cond_expr_cond (tree t
)
3177 /* Strip conversions around boolean operations. */
3178 if (CONVERT_EXPR_P (t
)
3179 && (truth_value_p (TREE_CODE (TREE_OPERAND (t
, 0)))
3180 || TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0)))
3182 t
= TREE_OPERAND (t
, 0);
3184 /* For !x use x == 0. */
3185 if (TREE_CODE (t
) == TRUTH_NOT_EXPR
)
3187 tree top0
= TREE_OPERAND (t
, 0);
3188 t
= build2 (EQ_EXPR
, TREE_TYPE (t
),
3189 top0
, build_int_cst (TREE_TYPE (top0
), 0));
3191 /* For cmp ? 1 : 0 use cmp. */
3192 else if (TREE_CODE (t
) == COND_EXPR
3193 && COMPARISON_CLASS_P (TREE_OPERAND (t
, 0))
3194 && integer_onep (TREE_OPERAND (t
, 1))
3195 && integer_zerop (TREE_OPERAND (t
, 2)))
3197 tree top0
= TREE_OPERAND (t
, 0);
3198 t
= build2 (TREE_CODE (top0
), TREE_TYPE (t
),
3199 TREE_OPERAND (top0
, 0), TREE_OPERAND (top0
, 1));
3202 if (is_gimple_condexpr (t
))
3208 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
3209 the positions marked by the set ARGS_TO_SKIP. */
3212 gimple_call_copy_skip_args (gimple stmt
, bitmap args_to_skip
)
3215 int nargs
= gimple_call_num_args (stmt
);
3216 VEC(tree
, heap
) *vargs
= VEC_alloc (tree
, heap
, nargs
);
3219 for (i
= 0; i
< nargs
; i
++)
3220 if (!bitmap_bit_p (args_to_skip
, i
))
3221 VEC_quick_push (tree
, vargs
, gimple_call_arg (stmt
, i
));
3223 if (gimple_call_internal_p (stmt
))
3224 new_stmt
= gimple_build_call_internal_vec (gimple_call_internal_fn (stmt
),
3227 new_stmt
= gimple_build_call_vec (gimple_call_fn (stmt
), vargs
);
3228 VEC_free (tree
, heap
, vargs
);
3229 if (gimple_call_lhs (stmt
))
3230 gimple_call_set_lhs (new_stmt
, gimple_call_lhs (stmt
));
3232 gimple_set_vuse (new_stmt
, gimple_vuse (stmt
));
3233 gimple_set_vdef (new_stmt
, gimple_vdef (stmt
));
3235 gimple_set_block (new_stmt
, gimple_block (stmt
));
3236 if (gimple_has_location (stmt
))
3237 gimple_set_location (new_stmt
, gimple_location (stmt
));
3238 gimple_call_copy_flags (new_stmt
, stmt
);
3239 gimple_call_set_chain (new_stmt
, gimple_call_chain (stmt
));
3241 gimple_set_modified (new_stmt
, true);
3247 enum gtc_mode
{ GTC_MERGE
= 0, GTC_DIAG
= 1 };
3249 static hashval_t
gimple_type_hash (const void *);
3251 /* Structure used to maintain a cache of some type pairs compared by
3252 gimple_types_compatible_p when comparing aggregate types. There are
3253 three possible values for SAME_P:
3255 -2: The pair (T1, T2) has just been inserted in the table.
3256 0: T1 and T2 are different types.
3257 1: T1 and T2 are the same type.
3259 The two elements in the SAME_P array are indexed by the comparison
3266 signed char same_p
[2];
3268 typedef struct type_pair_d
*type_pair_t
;
3269 DEF_VEC_P(type_pair_t
);
3270 DEF_VEC_ALLOC_P(type_pair_t
,heap
);
3272 #define GIMPLE_TYPE_PAIR_SIZE 16381
3273 struct type_pair_d
*type_pair_cache
;
3276 /* Lookup the pair of types T1 and T2 in *VISITED_P. Insert a new
3277 entry if none existed. */
3279 static inline type_pair_t
3280 lookup_type_pair (tree t1
, tree t2
)
3283 unsigned int uid1
, uid2
;
3285 if (type_pair_cache
== NULL
)
3286 type_pair_cache
= XCNEWVEC (struct type_pair_d
, GIMPLE_TYPE_PAIR_SIZE
);
3288 if (TYPE_UID (t1
) < TYPE_UID (t2
))
3290 uid1
= TYPE_UID (t1
);
3291 uid2
= TYPE_UID (t2
);
3295 uid1
= TYPE_UID (t2
);
3296 uid2
= TYPE_UID (t1
);
3298 gcc_checking_assert (uid1
!= uid2
);
3300 /* iterative_hash_hashval_t imply an function calls.
3301 We know that UIDS are in limited range. */
3302 index
= ((((unsigned HOST_WIDE_INT
)uid1
<< HOST_BITS_PER_WIDE_INT
/ 2) + uid2
)
3303 % GIMPLE_TYPE_PAIR_SIZE
);
3304 if (type_pair_cache
[index
].uid1
== uid1
3305 && type_pair_cache
[index
].uid2
== uid2
)
3306 return &type_pair_cache
[index
];
3308 type_pair_cache
[index
].uid1
= uid1
;
3309 type_pair_cache
[index
].uid2
= uid2
;
3310 type_pair_cache
[index
].same_p
[0] = -2;
3311 type_pair_cache
[index
].same_p
[1] = -2;
3313 return &type_pair_cache
[index
];
3316 /* Per pointer state for the SCC finding. The on_sccstack flag
3317 is not strictly required, it is true when there is no hash value
3318 recorded for the type and false otherwise. But querying that
3323 unsigned int dfsnum
;
3332 static unsigned int next_dfs_num
;
3333 static unsigned int gtc_next_dfs_num
;
3336 /* GIMPLE type merging cache. A direct-mapped cache based on TYPE_UID. */
3338 typedef struct GTY(()) gimple_type_leader_entry_s
{
3341 } gimple_type_leader_entry
;
3343 #define GIMPLE_TYPE_LEADER_SIZE 16381
3344 static GTY((deletable
, length("GIMPLE_TYPE_LEADER_SIZE")))
3345 gimple_type_leader_entry
*gimple_type_leader
;
3347 /* Lookup an existing leader for T and return it or NULL_TREE, if
3348 there is none in the cache. */
3351 gimple_lookup_type_leader (tree t
)
3353 gimple_type_leader_entry
*leader
;
3355 if (!gimple_type_leader
)
3358 leader
= &gimple_type_leader
[TYPE_UID (t
) % GIMPLE_TYPE_LEADER_SIZE
];
3359 if (leader
->type
!= t
)
3362 return leader
->leader
;
3365 /* Return true if T1 and T2 have the same name. If FOR_COMPLETION_P is
3366 true then if any type has no name return false, otherwise return
3367 true if both types have no names. */
3370 compare_type_names_p (tree t1
, tree t2
)
3372 tree name1
= TYPE_NAME (t1
);
3373 tree name2
= TYPE_NAME (t2
);
3375 if (name1
&& TREE_CODE (name1
) == TYPE_DECL
)
3376 name1
= DECL_NAME (name1
);
3377 gcc_checking_assert (!name1
|| TREE_CODE (name1
) == IDENTIFIER_NODE
);
3379 if (name2
&& TREE_CODE (name2
) == TYPE_DECL
)
3380 name2
= DECL_NAME (name2
);
3381 gcc_checking_assert (!name2
|| TREE_CODE (name2
) == IDENTIFIER_NODE
);
3383 /* Identifiers can be compared with pointer equality rather
3384 than a string comparison. */
3391 /* Return true if the field decls F1 and F2 are at the same offset.
3393 This is intended to be used on GIMPLE types only. */
3396 gimple_compare_field_offset (tree f1
, tree f2
)
3398 if (DECL_OFFSET_ALIGN (f1
) == DECL_OFFSET_ALIGN (f2
))
3400 tree offset1
= DECL_FIELD_OFFSET (f1
);
3401 tree offset2
= DECL_FIELD_OFFSET (f2
);
3402 return ((offset1
== offset2
3403 /* Once gimplification is done, self-referential offsets are
3404 instantiated as operand #2 of the COMPONENT_REF built for
3405 each access and reset. Therefore, they are not relevant
3406 anymore and fields are interchangeable provided that they
3407 represent the same access. */
3408 || (TREE_CODE (offset1
) == PLACEHOLDER_EXPR
3409 && TREE_CODE (offset2
) == PLACEHOLDER_EXPR
3410 && (DECL_SIZE (f1
) == DECL_SIZE (f2
)
3411 || (TREE_CODE (DECL_SIZE (f1
)) == PLACEHOLDER_EXPR
3412 && TREE_CODE (DECL_SIZE (f2
)) == PLACEHOLDER_EXPR
)
3413 || operand_equal_p (DECL_SIZE (f1
), DECL_SIZE (f2
), 0))
3414 && DECL_ALIGN (f1
) == DECL_ALIGN (f2
))
3415 || operand_equal_p (offset1
, offset2
, 0))
3416 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1
),
3417 DECL_FIELD_BIT_OFFSET (f2
)));
3420 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
3421 should be, so handle differing ones specially by decomposing
3422 the offset into a byte and bit offset manually. */
3423 if (host_integerp (DECL_FIELD_OFFSET (f1
), 0)
3424 && host_integerp (DECL_FIELD_OFFSET (f2
), 0))
3426 unsigned HOST_WIDE_INT byte_offset1
, byte_offset2
;
3427 unsigned HOST_WIDE_INT bit_offset1
, bit_offset2
;
3428 bit_offset1
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1
));
3429 byte_offset1
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1
))
3430 + bit_offset1
/ BITS_PER_UNIT
);
3431 bit_offset2
= TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2
));
3432 byte_offset2
= (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2
))
3433 + bit_offset2
/ BITS_PER_UNIT
);
3434 if (byte_offset1
!= byte_offset2
)
3436 return bit_offset1
% BITS_PER_UNIT
== bit_offset2
% BITS_PER_UNIT
;
3443 gimple_types_compatible_p_1 (tree
, tree
, type_pair_t
,
3444 VEC(type_pair_t
, heap
) **,
3445 struct pointer_map_t
*, struct obstack
*);
3447 /* DFS visit the edge from the callers type pair with state *STATE to
3448 the pair T1, T2 while operating in FOR_MERGING_P mode.
3449 Update the merging status if it is not part of the SCC containing the
3450 callers pair and return it.
3451 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3454 gtc_visit (tree t1
, tree t2
,
3456 VEC(type_pair_t
, heap
) **sccstack
,
3457 struct pointer_map_t
*sccstate
,
3458 struct obstack
*sccstate_obstack
)
3460 struct sccs
*cstate
= NULL
;
3463 tree leader1
, leader2
;
3465 /* Check first for the obvious case of pointer identity. */
3469 /* Check that we have two types to compare. */
3470 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
3473 /* Can't be the same type if the types don't have the same code. */
3474 if (TREE_CODE (t1
) != TREE_CODE (t2
))
3477 /* Can't be the same type if they have different CV qualifiers. */
3478 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
3481 if (TREE_ADDRESSABLE (t1
) != TREE_ADDRESSABLE (t2
))
3484 /* Void types and nullptr types are always the same. */
3485 if (TREE_CODE (t1
) == VOID_TYPE
3486 || TREE_CODE (t1
) == NULLPTR_TYPE
)
3489 /* Can't be the same type if they have different alignment or mode. */
3490 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3491 || TYPE_MODE (t1
) != TYPE_MODE (t2
))
3494 /* Do some simple checks before doing three hashtable queries. */
3495 if (INTEGRAL_TYPE_P (t1
)
3496 || SCALAR_FLOAT_TYPE_P (t1
)
3497 || FIXED_POINT_TYPE_P (t1
)
3498 || TREE_CODE (t1
) == VECTOR_TYPE
3499 || TREE_CODE (t1
) == COMPLEX_TYPE
3500 || TREE_CODE (t1
) == OFFSET_TYPE
3501 || POINTER_TYPE_P (t1
))
3503 /* Can't be the same type if they have different sign or precision. */
3504 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
)
3505 || TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
3508 if (TREE_CODE (t1
) == INTEGER_TYPE
3509 && (TYPE_IS_SIZETYPE (t1
) != TYPE_IS_SIZETYPE (t2
)
3510 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)))
3513 /* That's all we need to check for float and fixed-point types. */
3514 if (SCALAR_FLOAT_TYPE_P (t1
)
3515 || FIXED_POINT_TYPE_P (t1
))
3518 /* For other types fall thru to more complex checks. */
3521 /* If the types have been previously registered and found equal
3523 leader1
= gimple_lookup_type_leader (t1
);
3524 leader2
= gimple_lookup_type_leader (t2
);
3527 || (leader1
&& leader1
== leader2
))
3530 /* If the hash values of t1 and t2 are different the types can't
3531 possibly be the same. This helps keeping the type-pair hashtable
3532 small, only tracking comparisons for hash collisions. */
3533 if (gimple_type_hash (t1
) != gimple_type_hash (t2
))
3536 /* Allocate a new cache entry for this comparison. */
3537 p
= lookup_type_pair (t1
, t2
);
3538 if (p
->same_p
[GTC_MERGE
] == 0 || p
->same_p
[GTC_MERGE
] == 1)
3540 /* We have already decided whether T1 and T2 are the
3541 same, return the cached result. */
3542 return p
->same_p
[GTC_MERGE
] == 1;
3545 if ((slot
= pointer_map_contains (sccstate
, p
)) != NULL
)
3546 cstate
= (struct sccs
*)*slot
;
3547 /* Not yet visited. DFS recurse. */
3550 gimple_types_compatible_p_1 (t1
, t2
, p
,
3551 sccstack
, sccstate
, sccstate_obstack
);
3552 cstate
= (struct sccs
*)* pointer_map_contains (sccstate
, p
);
3553 state
->low
= MIN (state
->low
, cstate
->low
);
3555 /* If the type is still on the SCC stack adjust the parents low. */
3556 if (cstate
->dfsnum
< state
->dfsnum
3557 && cstate
->on_sccstack
)
3558 state
->low
= MIN (cstate
->dfsnum
, state
->low
);
3560 /* Return the current lattice value. We start with an equality
3561 assumption so types part of a SCC will be optimistically
3562 treated equal unless proven otherwise. */
3563 return cstate
->u
.same_p
;
3566 /* Worker for gimple_types_compatible.
3567 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3570 gimple_types_compatible_p_1 (tree t1
, tree t2
, type_pair_t p
,
3571 VEC(type_pair_t
, heap
) **sccstack
,
3572 struct pointer_map_t
*sccstate
,
3573 struct obstack
*sccstate_obstack
)
3577 gcc_assert (p
->same_p
[GTC_MERGE
] == -2);
3579 state
= XOBNEW (sccstate_obstack
, struct sccs
);
3580 *pointer_map_insert (sccstate
, p
) = state
;
3582 VEC_safe_push (type_pair_t
, heap
, *sccstack
, p
);
3583 state
->dfsnum
= gtc_next_dfs_num
++;
3584 state
->low
= state
->dfsnum
;
3585 state
->on_sccstack
= true;
3586 /* Start with an equality assumption. As we DFS recurse into child
3587 SCCs this assumption may get revisited. */
3588 state
->u
.same_p
= 1;
3590 /* The struct tags shall compare equal. */
3591 if (!compare_type_names_p (t1
, t2
))
3592 goto different_types
;
3594 /* If their attributes are not the same they can't be the same type. */
3595 if (!attribute_list_equal (TYPE_ATTRIBUTES (t1
), TYPE_ATTRIBUTES (t2
)))
3596 goto different_types
;
3598 /* Do type-specific comparisons. */
3599 switch (TREE_CODE (t1
))
3603 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
),
3604 state
, sccstack
, sccstate
, sccstate_obstack
))
3605 goto different_types
;
3609 /* Array types are the same if the element types are the same and
3610 the number of elements are the same. */
3611 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
),
3612 state
, sccstack
, sccstate
, sccstate_obstack
)
3613 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
3614 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
3615 goto different_types
;
3618 tree i1
= TYPE_DOMAIN (t1
);
3619 tree i2
= TYPE_DOMAIN (t2
);
3621 /* For an incomplete external array, the type domain can be
3622 NULL_TREE. Check this condition also. */
3623 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
3625 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
3626 goto different_types
;
3627 /* If for a complete array type the possibly gimplified sizes
3628 are different the types are different. */
3629 else if (((TYPE_SIZE (i1
) != NULL
) ^ (TYPE_SIZE (i2
) != NULL
))
3632 && !operand_equal_p (TYPE_SIZE (i1
), TYPE_SIZE (i2
), 0)))
3633 goto different_types
;
3636 tree min1
= TYPE_MIN_VALUE (i1
);
3637 tree min2
= TYPE_MIN_VALUE (i2
);
3638 tree max1
= TYPE_MAX_VALUE (i1
);
3639 tree max2
= TYPE_MAX_VALUE (i2
);
3641 /* The minimum/maximum values have to be the same. */
3644 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
3645 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
3646 || operand_equal_p (min1
, min2
, 0))))
3649 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
3650 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
3651 || operand_equal_p (max1
, max2
, 0)))))
3654 goto different_types
;
3659 /* Method types should belong to the same class. */
3660 if (!gtc_visit (TYPE_METHOD_BASETYPE (t1
), TYPE_METHOD_BASETYPE (t2
),
3661 state
, sccstack
, sccstate
, sccstate_obstack
))
3662 goto different_types
;
3667 /* Function types are the same if the return type and arguments types
3669 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
),
3670 state
, sccstack
, sccstate
, sccstate_obstack
))
3671 goto different_types
;
3673 if (!comp_type_attributes (t1
, t2
))
3674 goto different_types
;
3676 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
3680 tree parms1
, parms2
;
3682 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
3684 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
3686 if (!gtc_visit (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
3687 state
, sccstack
, sccstate
, sccstate_obstack
))
3688 goto different_types
;
3691 if (parms1
|| parms2
)
3692 goto different_types
;
3699 if (!gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
),
3700 state
, sccstack
, sccstate
, sccstate_obstack
)
3701 || !gtc_visit (TYPE_OFFSET_BASETYPE (t1
),
3702 TYPE_OFFSET_BASETYPE (t2
),
3703 state
, sccstack
, sccstate
, sccstate_obstack
))
3704 goto different_types
;
3710 case REFERENCE_TYPE
:
3712 /* If the two pointers have different ref-all attributes,
3713 they can't be the same type. */
3714 if (TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
3715 goto different_types
;
3717 /* Otherwise, pointer and reference types are the same if the
3718 pointed-to types are the same. */
3719 if (gtc_visit (TREE_TYPE (t1
), TREE_TYPE (t2
),
3720 state
, sccstack
, sccstate
, sccstate_obstack
))
3723 goto different_types
;
3729 tree min1
= TYPE_MIN_VALUE (t1
);
3730 tree max1
= TYPE_MAX_VALUE (t1
);
3731 tree min2
= TYPE_MIN_VALUE (t2
);
3732 tree max2
= TYPE_MAX_VALUE (t2
);
3733 bool min_equal_p
= false;
3734 bool max_equal_p
= false;
3736 /* If either type has a minimum value, the other type must
3738 if (min1
== NULL_TREE
&& min2
== NULL_TREE
)
3740 else if (min1
&& min2
&& operand_equal_p (min1
, min2
, 0))
3743 /* Likewise, if either type has a maximum value, the other
3744 type must have the same. */
3745 if (max1
== NULL_TREE
&& max2
== NULL_TREE
)
3747 else if (max1
&& max2
&& operand_equal_p (max1
, max2
, 0))
3750 if (!min_equal_p
|| !max_equal_p
)
3751 goto different_types
;
3758 /* FIXME lto, we cannot check bounds on enumeral types because
3759 different front ends will produce different values.
3760 In C, enumeral types are integers, while in C++ each element
3761 will have its own symbolic value. We should decide how enums
3762 are to be represented in GIMPLE and have each front end lower
3766 /* For enumeral types, all the values must be the same. */
3767 if (TYPE_VALUES (t1
) == TYPE_VALUES (t2
))
3770 for (v1
= TYPE_VALUES (t1
), v2
= TYPE_VALUES (t2
);
3772 v1
= TREE_CHAIN (v1
), v2
= TREE_CHAIN (v2
))
3774 tree c1
= TREE_VALUE (v1
);
3775 tree c2
= TREE_VALUE (v2
);
3777 if (TREE_CODE (c1
) == CONST_DECL
)
3778 c1
= DECL_INITIAL (c1
);
3780 if (TREE_CODE (c2
) == CONST_DECL
)
3781 c2
= DECL_INITIAL (c2
);
3783 if (tree_int_cst_equal (c1
, c2
) != 1)
3784 goto different_types
;
3786 if (TREE_PURPOSE (v1
) != TREE_PURPOSE (v2
))
3787 goto different_types
;
3790 /* If one enumeration has more values than the other, they
3791 are not the same. */
3793 goto different_types
;
3800 case QUAL_UNION_TYPE
:
3804 /* For aggregate types, all the fields must be the same. */
3805 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
3807 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
3809 /* Different field kinds are not compatible. */
3810 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3811 goto different_types
;
3812 /* Field decls must have the same name and offset. */
3813 if (TREE_CODE (f1
) == FIELD_DECL
3814 && (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
3815 || !gimple_compare_field_offset (f1
, f2
)))
3816 goto different_types
;
3817 /* All entities should have the same name and type. */
3818 if (DECL_NAME (f1
) != DECL_NAME (f2
)
3819 || !gtc_visit (TREE_TYPE (f1
), TREE_TYPE (f2
),
3820 state
, sccstack
, sccstate
, sccstate_obstack
))
3821 goto different_types
;
3824 /* If one aggregate has more fields than the other, they
3825 are not the same. */
3827 goto different_types
;
3836 /* Common exit path for types that are not compatible. */
3838 state
->u
.same_p
= 0;
3841 /* Common exit path for types that are compatible. */
3843 gcc_assert (state
->u
.same_p
== 1);
3846 if (state
->low
== state
->dfsnum
)
3850 /* Pop off the SCC and set its cache values to the final
3851 comparison result. */
3854 struct sccs
*cstate
;
3855 x
= VEC_pop (type_pair_t
, *sccstack
);
3856 cstate
= (struct sccs
*)*pointer_map_contains (sccstate
, x
);
3857 cstate
->on_sccstack
= false;
3858 x
->same_p
[GTC_MERGE
] = state
->u
.same_p
;
3863 return state
->u
.same_p
;
3866 /* Return true iff T1 and T2 are structurally identical. When
3867 FOR_MERGING_P is true the an incomplete type and a complete type
3868 are considered different, otherwise they are considered compatible. */
3871 gimple_types_compatible_p (tree t1
, tree t2
)
3873 VEC(type_pair_t
, heap
) *sccstack
= NULL
;
3874 struct pointer_map_t
*sccstate
;
3875 struct obstack sccstate_obstack
;
3876 type_pair_t p
= NULL
;
3878 tree leader1
, leader2
;
3880 /* Before starting to set up the SCC machinery handle simple cases. */
3882 /* Check first for the obvious case of pointer identity. */
3886 /* Check that we have two types to compare. */
3887 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
3890 /* Can't be the same type if the types don't have the same code. */
3891 if (TREE_CODE (t1
) != TREE_CODE (t2
))
3894 /* Can't be the same type if they have different CV qualifiers. */
3895 if (TYPE_QUALS (t1
) != TYPE_QUALS (t2
))
3898 if (TREE_ADDRESSABLE (t1
) != TREE_ADDRESSABLE (t2
))
3901 /* Void types and nullptr types are always the same. */
3902 if (TREE_CODE (t1
) == VOID_TYPE
3903 || TREE_CODE (t1
) == NULLPTR_TYPE
)
3906 /* Can't be the same type if they have different alignment or mode. */
3907 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
3908 || TYPE_MODE (t1
) != TYPE_MODE (t2
))
3911 /* Do some simple checks before doing three hashtable queries. */
3912 if (INTEGRAL_TYPE_P (t1
)
3913 || SCALAR_FLOAT_TYPE_P (t1
)
3914 || FIXED_POINT_TYPE_P (t1
)
3915 || TREE_CODE (t1
) == VECTOR_TYPE
3916 || TREE_CODE (t1
) == COMPLEX_TYPE
3917 || TREE_CODE (t1
) == OFFSET_TYPE
3918 || POINTER_TYPE_P (t1
))
3920 /* Can't be the same type if they have different sign or precision. */
3921 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
)
3922 || TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
3925 if (TREE_CODE (t1
) == INTEGER_TYPE
3926 && (TYPE_IS_SIZETYPE (t1
) != TYPE_IS_SIZETYPE (t2
)
3927 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)))
3930 /* That's all we need to check for float and fixed-point types. */
3931 if (SCALAR_FLOAT_TYPE_P (t1
)
3932 || FIXED_POINT_TYPE_P (t1
))
3935 /* For other types fall thru to more complex checks. */
3938 /* If the types have been previously registered and found equal
3940 leader1
= gimple_lookup_type_leader (t1
);
3941 leader2
= gimple_lookup_type_leader (t2
);
3944 || (leader1
&& leader1
== leader2
))
3947 /* If the hash values of t1 and t2 are different the types can't
3948 possibly be the same. This helps keeping the type-pair hashtable
3949 small, only tracking comparisons for hash collisions. */
3950 if (gimple_type_hash (t1
) != gimple_type_hash (t2
))
3953 /* If we've visited this type pair before (in the case of aggregates
3954 with self-referential types), and we made a decision, return it. */
3955 p
= lookup_type_pair (t1
, t2
);
3956 if (p
->same_p
[GTC_MERGE
] == 0 || p
->same_p
[GTC_MERGE
] == 1)
3958 /* We have already decided whether T1 and T2 are the
3959 same, return the cached result. */
3960 return p
->same_p
[GTC_MERGE
] == 1;
3963 /* Now set up the SCC machinery for the comparison. */
3964 gtc_next_dfs_num
= 1;
3965 sccstate
= pointer_map_create ();
3966 gcc_obstack_init (&sccstate_obstack
);
3967 res
= gimple_types_compatible_p_1 (t1
, t2
, p
,
3968 &sccstack
, sccstate
, &sccstate_obstack
);
3969 VEC_free (type_pair_t
, heap
, sccstack
);
3970 pointer_map_destroy (sccstate
);
3971 obstack_free (&sccstate_obstack
, NULL
);
3978 iterative_hash_gimple_type (tree
, hashval_t
, VEC(tree
, heap
) **,
3979 struct pointer_map_t
*, struct obstack
*);
3981 /* DFS visit the edge from the callers type with state *STATE to T.
3982 Update the callers type hash V with the hash for T if it is not part
3983 of the SCC containing the callers type and return it.
3984 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3987 visit (tree t
, struct sccs
*state
, hashval_t v
,
3988 VEC (tree
, heap
) **sccstack
,
3989 struct pointer_map_t
*sccstate
,
3990 struct obstack
*sccstate_obstack
)
3992 struct sccs
*cstate
= NULL
;
3993 struct tree_int_map m
;
3996 /* If there is a hash value recorded for this type then it can't
3997 possibly be part of our parent SCC. Simply mix in its hash. */
3999 if ((slot
= htab_find_slot (type_hash_cache
, &m
, NO_INSERT
))
4001 return iterative_hash_hashval_t (((struct tree_int_map
*) *slot
)->to
, v
);
4003 if ((slot
= pointer_map_contains (sccstate
, t
)) != NULL
)
4004 cstate
= (struct sccs
*)*slot
;
4008 /* Not yet visited. DFS recurse. */
4009 tem
= iterative_hash_gimple_type (t
, v
,
4010 sccstack
, sccstate
, sccstate_obstack
);
4012 cstate
= (struct sccs
*)* pointer_map_contains (sccstate
, t
);
4013 state
->low
= MIN (state
->low
, cstate
->low
);
4014 /* If the type is no longer on the SCC stack and thus is not part
4015 of the parents SCC mix in its hash value. Otherwise we will
4016 ignore the type for hashing purposes and return the unaltered
4018 if (!cstate
->on_sccstack
)
4021 if (cstate
->dfsnum
< state
->dfsnum
4022 && cstate
->on_sccstack
)
4023 state
->low
= MIN (cstate
->dfsnum
, state
->low
);
4025 /* We are part of our parents SCC, skip this type during hashing
4026 and return the unaltered hash value. */
4030 /* Hash NAME with the previous hash value V and return it. */
4033 iterative_hash_name (tree name
, hashval_t v
)
4037 if (TREE_CODE (name
) == TYPE_DECL
)
4038 name
= DECL_NAME (name
);
4041 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
4042 return iterative_hash_object (IDENTIFIER_HASH_VALUE (name
), v
);
4045 /* A type, hashvalue pair for sorting SCC members. */
4047 struct type_hash_pair
{
4052 /* Compare two type, hashvalue pairs. */
4055 type_hash_pair_compare (const void *p1_
, const void *p2_
)
4057 const struct type_hash_pair
*p1
= (const struct type_hash_pair
*) p1_
;
4058 const struct type_hash_pair
*p2
= (const struct type_hash_pair
*) p2_
;
4059 if (p1
->hash
< p2
->hash
)
4061 else if (p1
->hash
> p2
->hash
)
4066 /* Returning a hash value for gimple type TYPE combined with VAL.
4067 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done.
4069 To hash a type we end up hashing in types that are reachable.
4070 Through pointers we can end up with cycles which messes up the
4071 required property that we need to compute the same hash value
4072 for structurally equivalent types. To avoid this we have to
4073 hash all types in a cycle (the SCC) in a commutative way. The
4074 easiest way is to not mix in the hashes of the SCC members at
4075 all. To make this work we have to delay setting the hash
4076 values of the SCC until it is complete. */
4079 iterative_hash_gimple_type (tree type
, hashval_t val
,
4080 VEC(tree
, heap
) **sccstack
,
4081 struct pointer_map_t
*sccstate
,
4082 struct obstack
*sccstate_obstack
)
4088 /* Not visited during this DFS walk. */
4089 gcc_checking_assert (!pointer_map_contains (sccstate
, type
));
4090 state
= XOBNEW (sccstate_obstack
, struct sccs
);
4091 *pointer_map_insert (sccstate
, type
) = state
;
4093 VEC_safe_push (tree
, heap
, *sccstack
, type
);
4094 state
->dfsnum
= next_dfs_num
++;
4095 state
->low
= state
->dfsnum
;
4096 state
->on_sccstack
= true;
4098 /* Combine a few common features of types so that types are grouped into
4099 smaller sets; when searching for existing matching types to merge,
4100 only existing types having the same features as the new type will be
4102 v
= iterative_hash_name (TYPE_NAME (type
), 0);
4103 v
= iterative_hash_hashval_t (TREE_CODE (type
), v
);
4104 v
= iterative_hash_hashval_t (TYPE_QUALS (type
), v
);
4105 v
= iterative_hash_hashval_t (TREE_ADDRESSABLE (type
), v
);
4107 /* Do not hash the types size as this will cause differences in
4108 hash values for the complete vs. the incomplete type variant. */
4110 /* Incorporate common features of numerical types. */
4111 if (INTEGRAL_TYPE_P (type
)
4112 || SCALAR_FLOAT_TYPE_P (type
)
4113 || FIXED_POINT_TYPE_P (type
))
4115 v
= iterative_hash_hashval_t (TYPE_PRECISION (type
), v
);
4116 v
= iterative_hash_hashval_t (TYPE_MODE (type
), v
);
4117 v
= iterative_hash_hashval_t (TYPE_UNSIGNED (type
), v
);
4120 /* For pointer and reference types, fold in information about the type
4122 if (POINTER_TYPE_P (type
))
4123 v
= visit (TREE_TYPE (type
), state
, v
,
4124 sccstack
, sccstate
, sccstate_obstack
);
4126 /* For integer types hash the types min/max values and the string flag. */
4127 if (TREE_CODE (type
) == INTEGER_TYPE
)
4129 /* OMP lowering can introduce error_mark_node in place of
4130 random local decls in types. */
4131 if (TYPE_MIN_VALUE (type
) != error_mark_node
)
4132 v
= iterative_hash_expr (TYPE_MIN_VALUE (type
), v
);
4133 if (TYPE_MAX_VALUE (type
) != error_mark_node
)
4134 v
= iterative_hash_expr (TYPE_MAX_VALUE (type
), v
);
4135 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
4138 /* For array types hash their domain and the string flag. */
4139 if (TREE_CODE (type
) == ARRAY_TYPE
4140 && TYPE_DOMAIN (type
))
4142 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
4143 v
= visit (TYPE_DOMAIN (type
), state
, v
,
4144 sccstack
, sccstate
, sccstate_obstack
);
4147 /* Recurse for aggregates with a single element type. */
4148 if (TREE_CODE (type
) == ARRAY_TYPE
4149 || TREE_CODE (type
) == COMPLEX_TYPE
4150 || TREE_CODE (type
) == VECTOR_TYPE
)
4151 v
= visit (TREE_TYPE (type
), state
, v
,
4152 sccstack
, sccstate
, sccstate_obstack
);
4154 /* Incorporate function return and argument types. */
4155 if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
4160 /* For method types also incorporate their parent class. */
4161 if (TREE_CODE (type
) == METHOD_TYPE
)
4162 v
= visit (TYPE_METHOD_BASETYPE (type
), state
, v
,
4163 sccstack
, sccstate
, sccstate_obstack
);
4165 /* Check result and argument types. */
4166 v
= visit (TREE_TYPE (type
), state
, v
,
4167 sccstack
, sccstate
, sccstate_obstack
);
4168 for (p
= TYPE_ARG_TYPES (type
), na
= 0; p
; p
= TREE_CHAIN (p
))
4170 v
= visit (TREE_VALUE (p
), state
, v
,
4171 sccstack
, sccstate
, sccstate_obstack
);
4175 v
= iterative_hash_hashval_t (na
, v
);
4178 if (TREE_CODE (type
) == RECORD_TYPE
4179 || TREE_CODE (type
) == UNION_TYPE
4180 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4185 for (f
= TYPE_FIELDS (type
), nf
= 0; f
; f
= TREE_CHAIN (f
))
4187 v
= iterative_hash_name (DECL_NAME (f
), v
);
4188 v
= visit (TREE_TYPE (f
), state
, v
,
4189 sccstack
, sccstate
, sccstate_obstack
);
4193 v
= iterative_hash_hashval_t (nf
, v
);
4196 /* Record hash for us. */
4199 /* See if we found an SCC. */
4200 if (state
->low
== state
->dfsnum
)
4203 struct tree_int_map
*m
;
4205 /* Pop off the SCC and set its hash values. */
4206 x
= VEC_pop (tree
, *sccstack
);
4207 /* Optimize SCC size one. */
4210 state
->on_sccstack
= false;
4211 m
= ggc_alloc_cleared_tree_int_map ();
4214 slot
= htab_find_slot (type_hash_cache
, m
, INSERT
);
4215 gcc_assert (!*slot
);
4220 struct sccs
*cstate
;
4221 unsigned first
, i
, size
, j
;
4222 struct type_hash_pair
*pairs
;
4223 /* Pop off the SCC and build an array of type, hash pairs. */
4224 first
= VEC_length (tree
, *sccstack
) - 1;
4225 while (VEC_index (tree
, *sccstack
, first
) != type
)
4227 size
= VEC_length (tree
, *sccstack
) - first
+ 1;
4228 pairs
= XALLOCAVEC (struct type_hash_pair
, size
);
4230 cstate
= (struct sccs
*)*pointer_map_contains (sccstate
, x
);
4231 cstate
->on_sccstack
= false;
4233 pairs
[i
].hash
= cstate
->u
.hash
;
4236 x
= VEC_pop (tree
, *sccstack
);
4237 cstate
= (struct sccs
*)*pointer_map_contains (sccstate
, x
);
4238 cstate
->on_sccstack
= false;
4241 pairs
[i
].hash
= cstate
->u
.hash
;
4244 gcc_assert (i
+ 1 == size
);
4245 /* Sort the arrays of type, hash pairs so that when we mix in
4246 all members of the SCC the hash value becomes independent on
4247 the order we visited the SCC. Disregard hashes equal to
4248 the hash of the type we mix into because we cannot guarantee
4249 a stable sort for those across different TUs. */
4250 qsort (pairs
, size
, sizeof (struct type_hash_pair
),
4251 type_hash_pair_compare
);
4252 for (i
= 0; i
< size
; ++i
)
4255 m
= ggc_alloc_cleared_tree_int_map ();
4256 m
->base
.from
= pairs
[i
].type
;
4257 hash
= pairs
[i
].hash
;
4258 /* Skip same hashes. */
4259 for (j
= i
+ 1; j
< size
&& pairs
[j
].hash
== pairs
[i
].hash
; ++j
)
4261 for (; j
< size
; ++j
)
4262 hash
= iterative_hash_hashval_t (pairs
[j
].hash
, hash
);
4263 for (j
= 0; pairs
[j
].hash
!= pairs
[i
].hash
; ++j
)
4264 hash
= iterative_hash_hashval_t (pairs
[j
].hash
, hash
);
4266 if (pairs
[i
].type
== type
)
4268 slot
= htab_find_slot (type_hash_cache
, m
, INSERT
);
4269 gcc_assert (!*slot
);
4275 return iterative_hash_hashval_t (v
, val
);
4279 /* Returns a hash value for P (assumed to be a type). The hash value
4280 is computed using some distinguishing features of the type. Note
4281 that we cannot use pointer hashing here as we may be dealing with
4282 two distinct instances of the same type.
4284 This function should produce the same hash value for two compatible
4285 types according to gimple_types_compatible_p. */
4288 gimple_type_hash (const void *p
)
4290 const_tree t
= (const_tree
) p
;
4291 VEC(tree
, heap
) *sccstack
= NULL
;
4292 struct pointer_map_t
*sccstate
;
4293 struct obstack sccstate_obstack
;
4296 struct tree_int_map m
;
4298 if (type_hash_cache
== NULL
)
4299 type_hash_cache
= htab_create_ggc (512, tree_int_map_hash
,
4300 tree_int_map_eq
, NULL
);
4302 m
.base
.from
= CONST_CAST_TREE (t
);
4303 if ((slot
= htab_find_slot (type_hash_cache
, &m
, NO_INSERT
))
4305 return iterative_hash_hashval_t (((struct tree_int_map
*) *slot
)->to
, 0);
4307 /* Perform a DFS walk and pre-hash all reachable types. */
4309 sccstate
= pointer_map_create ();
4310 gcc_obstack_init (&sccstate_obstack
);
4311 val
= iterative_hash_gimple_type (CONST_CAST_TREE (t
), 0,
4312 &sccstack
, sccstate
, &sccstate_obstack
);
4313 VEC_free (tree
, heap
, sccstack
);
4314 pointer_map_destroy (sccstate
);
4315 obstack_free (&sccstate_obstack
, NULL
);
4320 /* Returning a hash value for gimple type TYPE combined with VAL.
4322 The hash value returned is equal for types considered compatible
4323 by gimple_canonical_types_compatible_p. */
4326 iterative_hash_canonical_type (tree type
, hashval_t val
)
4330 struct tree_int_map
*mp
, m
;
4333 if ((slot
= htab_find_slot (canonical_type_hash_cache
, &m
, INSERT
))
4335 return iterative_hash_hashval_t (((struct tree_int_map
*) *slot
)->to
, val
);
4337 /* Combine a few common features of types so that types are grouped into
4338 smaller sets; when searching for existing matching types to merge,
4339 only existing types having the same features as the new type will be
4341 v
= iterative_hash_hashval_t (TREE_CODE (type
), 0);
4342 v
= iterative_hash_hashval_t (TREE_ADDRESSABLE (type
), v
);
4343 v
= iterative_hash_hashval_t (TYPE_ALIGN (type
), v
);
4344 v
= iterative_hash_hashval_t (TYPE_MODE (type
), v
);
4346 /* Incorporate common features of numerical types. */
4347 if (INTEGRAL_TYPE_P (type
)
4348 || SCALAR_FLOAT_TYPE_P (type
)
4349 || FIXED_POINT_TYPE_P (type
)
4350 || TREE_CODE (type
) == VECTOR_TYPE
4351 || TREE_CODE (type
) == COMPLEX_TYPE
4352 || TREE_CODE (type
) == OFFSET_TYPE
4353 || POINTER_TYPE_P (type
))
4355 v
= iterative_hash_hashval_t (TYPE_PRECISION (type
), v
);
4356 v
= iterative_hash_hashval_t (TYPE_UNSIGNED (type
), v
);
4359 /* For pointer and reference types, fold in information about the type
4360 pointed to but do not recurse to the pointed-to type. */
4361 if (POINTER_TYPE_P (type
))
4363 v
= iterative_hash_hashval_t (TYPE_REF_CAN_ALIAS_ALL (type
), v
);
4364 v
= iterative_hash_hashval_t (TYPE_ADDR_SPACE (TREE_TYPE (type
)), v
);
4365 v
= iterative_hash_hashval_t (TYPE_RESTRICT (type
), v
);
4366 v
= iterative_hash_hashval_t (TREE_CODE (TREE_TYPE (type
)), v
);
4369 /* For integer types hash the types min/max values and the string flag. */
4370 if (TREE_CODE (type
) == INTEGER_TYPE
)
4372 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
4373 v
= iterative_hash_hashval_t (TYPE_IS_SIZETYPE (type
), v
);
4376 /* For array types hash their domain and the string flag. */
4377 if (TREE_CODE (type
) == ARRAY_TYPE
4378 && TYPE_DOMAIN (type
))
4380 v
= iterative_hash_hashval_t (TYPE_STRING_FLAG (type
), v
);
4381 v
= iterative_hash_canonical_type (TYPE_DOMAIN (type
), v
);
4384 /* Recurse for aggregates with a single element type. */
4385 if (TREE_CODE (type
) == ARRAY_TYPE
4386 || TREE_CODE (type
) == COMPLEX_TYPE
4387 || TREE_CODE (type
) == VECTOR_TYPE
)
4388 v
= iterative_hash_canonical_type (TREE_TYPE (type
), v
);
4390 /* Incorporate function return and argument types. */
4391 if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
4396 /* For method types also incorporate their parent class. */
4397 if (TREE_CODE (type
) == METHOD_TYPE
)
4398 v
= iterative_hash_canonical_type (TYPE_METHOD_BASETYPE (type
), v
);
4400 v
= iterative_hash_canonical_type (TREE_TYPE (type
), v
);
4402 for (p
= TYPE_ARG_TYPES (type
), na
= 0; p
; p
= TREE_CHAIN (p
))
4404 v
= iterative_hash_canonical_type (TREE_VALUE (p
), v
);
4408 v
= iterative_hash_hashval_t (na
, v
);
4411 if (TREE_CODE (type
) == RECORD_TYPE
4412 || TREE_CODE (type
) == UNION_TYPE
4413 || TREE_CODE (type
) == QUAL_UNION_TYPE
)
4418 for (f
= TYPE_FIELDS (type
), nf
= 0; f
; f
= TREE_CHAIN (f
))
4419 if (TREE_CODE (f
) == FIELD_DECL
)
4421 v
= iterative_hash_canonical_type (TREE_TYPE (f
), v
);
4425 v
= iterative_hash_hashval_t (nf
, v
);
4428 /* Cache the just computed hash value. */
4429 mp
= ggc_alloc_cleared_tree_int_map ();
4430 mp
->base
.from
= type
;
4432 *slot
= (void *) mp
;
4434 return iterative_hash_hashval_t (v
, val
);
4438 gimple_canonical_type_hash (const void *p
)
4440 if (canonical_type_hash_cache
== NULL
)
4441 canonical_type_hash_cache
= htab_create_ggc (512, tree_int_map_hash
,
4442 tree_int_map_eq
, NULL
);
4444 return iterative_hash_canonical_type (CONST_CAST_TREE ((const_tree
) p
), 0);
4448 /* Returns nonzero if P1 and P2 are equal. */
4451 gimple_type_eq (const void *p1
, const void *p2
)
4453 const_tree t1
= (const_tree
) p1
;
4454 const_tree t2
= (const_tree
) p2
;
4455 return gimple_types_compatible_p (CONST_CAST_TREE (t1
),
4456 CONST_CAST_TREE (t2
));
4460 /* Worker for gimple_register_type.
4461 Register type T in the global type table gimple_types.
4462 When REGISTERING_MV is false first recurse for the main variant of T. */
4465 gimple_register_type_1 (tree t
, bool registering_mv
)
4468 gimple_type_leader_entry
*leader
;
4470 /* If we registered this type before return the cached result. */
4471 leader
= &gimple_type_leader
[TYPE_UID (t
) % GIMPLE_TYPE_LEADER_SIZE
];
4472 if (leader
->type
== t
)
4473 return leader
->leader
;
4475 /* Always register the main variant first. This is important so we
4476 pick up the non-typedef variants as canonical, otherwise we'll end
4477 up taking typedef ids for structure tags during comparison.
4478 It also makes sure that main variants will be merged to main variants.
4479 As we are operating on a possibly partially fixed up type graph
4480 do not bother to recurse more than once, otherwise we may end up
4482 If we are registering a main variant it will either remain its
4483 own main variant or it will be merged to something else in which
4484 case we do not care for the main variant leader. */
4486 && TYPE_MAIN_VARIANT (t
) != t
)
4487 gimple_register_type_1 (TYPE_MAIN_VARIANT (t
), true);
4489 /* See if we already have an equivalent type registered. */
4490 slot
= htab_find_slot (gimple_types
, t
, INSERT
);
4492 && *(tree
*)slot
!= t
)
4494 tree new_type
= (tree
) *((tree
*) slot
);
4496 leader
->leader
= new_type
;
4500 /* If not, insert it to the cache and the hash. */
4507 /* Register type T in the global type table gimple_types.
4508 If another type T', compatible with T, already existed in
4509 gimple_types then return T', otherwise return T. This is used by
4510 LTO to merge identical types read from different TUs. */
4513 gimple_register_type (tree t
)
4515 gcc_assert (TYPE_P (t
));
4517 if (!gimple_type_leader
)
4518 gimple_type_leader
= ggc_alloc_cleared_vec_gimple_type_leader_entry_s
4519 (GIMPLE_TYPE_LEADER_SIZE
);
4521 if (gimple_types
== NULL
)
4522 gimple_types
= htab_create_ggc (16381, gimple_type_hash
, gimple_type_eq
, 0);
4524 return gimple_register_type_1 (t
, false);
4527 /* The TYPE_CANONICAL merging machinery. It should closely resemble
4528 the middle-end types_compatible_p function. It needs to avoid
4529 claiming types are different for types that should be treated
4530 the same with respect to TBAA. Canonical types are also used
4531 for IL consistency checks via the useless_type_conversion_p
4532 predicate which does not handle all type kinds itself but falls
4533 back to pointer-comparison of TYPE_CANONICAL for aggregates
4536 /* Return true iff T1 and T2 are structurally identical for what
4537 TBAA is concerned. */
4540 gimple_canonical_types_compatible_p (tree t1
, tree t2
)
4542 /* Before starting to set up the SCC machinery handle simple cases. */
4544 /* Check first for the obvious case of pointer identity. */
4548 /* Check that we have two types to compare. */
4549 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
4552 /* If the types have been previously registered and found equal
4554 if (TYPE_CANONICAL (t1
)
4555 && TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
))
4558 /* Can't be the same type if the types don't have the same code. */
4559 if (TREE_CODE (t1
) != TREE_CODE (t2
))
4562 if (TREE_ADDRESSABLE (t1
) != TREE_ADDRESSABLE (t2
))
4565 /* Qualifiers do not matter for canonical type comparison purposes. */
4567 /* Void types and nullptr types are always the same. */
4568 if (TREE_CODE (t1
) == VOID_TYPE
4569 || TREE_CODE (t1
) == NULLPTR_TYPE
)
4572 /* Can't be the same type if they have different alignment, or mode. */
4573 if (TYPE_ALIGN (t1
) != TYPE_ALIGN (t2
)
4574 || TYPE_MODE (t1
) != TYPE_MODE (t2
))
4577 /* Non-aggregate types can be handled cheaply. */
4578 if (INTEGRAL_TYPE_P (t1
)
4579 || SCALAR_FLOAT_TYPE_P (t1
)
4580 || FIXED_POINT_TYPE_P (t1
)
4581 || TREE_CODE (t1
) == VECTOR_TYPE
4582 || TREE_CODE (t1
) == COMPLEX_TYPE
4583 || TREE_CODE (t1
) == OFFSET_TYPE
4584 || POINTER_TYPE_P (t1
))
4586 /* Can't be the same type if they have different sign or precision. */
4587 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
)
4588 || TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
))
4591 if (TREE_CODE (t1
) == INTEGER_TYPE
4592 && (TYPE_IS_SIZETYPE (t1
) != TYPE_IS_SIZETYPE (t2
)
4593 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)))
4596 /* For canonical type comparisons we do not want to build SCCs
4597 so we cannot compare pointed-to types. But we can, for now,
4598 require the same pointed-to type kind and match what
4599 useless_type_conversion_p would do. */
4600 if (POINTER_TYPE_P (t1
))
4602 /* If the two pointers have different ref-all attributes,
4603 they can't be the same type. */
4604 if (TYPE_REF_CAN_ALIAS_ALL (t1
) != TYPE_REF_CAN_ALIAS_ALL (t2
))
4607 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
4608 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
4611 if (TYPE_RESTRICT (t1
) != TYPE_RESTRICT (t2
))
4614 if (TREE_CODE (TREE_TYPE (t1
)) != TREE_CODE (TREE_TYPE (t2
)))
4618 /* Tail-recurse to components. */
4619 if (TREE_CODE (t1
) == VECTOR_TYPE
4620 || TREE_CODE (t1
) == COMPLEX_TYPE
)
4621 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
4627 /* If their attributes are not the same they can't be the same type. */
4628 if (!attribute_list_equal (TYPE_ATTRIBUTES (t1
), TYPE_ATTRIBUTES (t2
)))
4631 /* Do type-specific comparisons. */
4632 switch (TREE_CODE (t1
))
4635 /* Array types are the same if the element types are the same and
4636 the number of elements are the same. */
4637 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
4638 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
4639 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
4643 tree i1
= TYPE_DOMAIN (t1
);
4644 tree i2
= TYPE_DOMAIN (t2
);
4646 /* For an incomplete external array, the type domain can be
4647 NULL_TREE. Check this condition also. */
4648 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
4650 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
4652 /* If for a complete array type the possibly gimplified sizes
4653 are different the types are different. */
4654 else if (((TYPE_SIZE (i1
) != NULL
) ^ (TYPE_SIZE (i2
) != NULL
))
4657 && !operand_equal_p (TYPE_SIZE (i1
), TYPE_SIZE (i2
), 0)))
4661 tree min1
= TYPE_MIN_VALUE (i1
);
4662 tree min2
= TYPE_MIN_VALUE (i2
);
4663 tree max1
= TYPE_MAX_VALUE (i1
);
4664 tree max2
= TYPE_MAX_VALUE (i2
);
4666 /* The minimum/maximum values have to be the same. */
4669 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
4670 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
4671 || operand_equal_p (min1
, min2
, 0))))
4674 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
4675 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
4676 || operand_equal_p (max1
, max2
, 0)))))
4684 /* Method types should belong to the same class. */
4685 if (!gimple_canonical_types_compatible_p
4686 (TYPE_METHOD_BASETYPE (t1
), TYPE_METHOD_BASETYPE (t2
)))
4692 /* Function types are the same if the return type and arguments types
4694 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
)))
4697 if (!comp_type_attributes (t1
, t2
))
4700 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
4704 tree parms1
, parms2
;
4706 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
4708 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
4710 if (!gimple_canonical_types_compatible_p
4711 (TREE_VALUE (parms1
), TREE_VALUE (parms2
)))
4715 if (parms1
|| parms2
)
4723 case QUAL_UNION_TYPE
:
4727 /* For aggregate types, all the fields must be the same. */
4728 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
4730 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
4732 /* Skip non-fields. */
4733 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
4734 f1
= TREE_CHAIN (f1
);
4735 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
4736 f2
= TREE_CHAIN (f2
);
4739 /* The fields must have the same name, offset and type. */
4740 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
4741 || !gimple_compare_field_offset (f1
, f2
)
4742 || !gimple_canonical_types_compatible_p
4743 (TREE_TYPE (f1
), TREE_TYPE (f2
)))
4747 /* If one aggregate has more fields than the other, they
4748 are not the same. */
4761 /* Returns nonzero if P1 and P2 are equal. */
4764 gimple_canonical_type_eq (const void *p1
, const void *p2
)
4766 const_tree t1
= (const_tree
) p1
;
4767 const_tree t2
= (const_tree
) p2
;
4768 return gimple_canonical_types_compatible_p (CONST_CAST_TREE (t1
),
4769 CONST_CAST_TREE (t2
));
4772 /* Register type T in the global type table gimple_types.
4773 If another type T', compatible with T, already existed in
4774 gimple_types then return T', otherwise return T. This is used by
4775 LTO to merge identical types read from different TUs.
4777 ??? This merging does not exactly match how the tree.c middle-end
4778 functions will assign TYPE_CANONICAL when new types are created
4779 during optimization (which at least happens for pointer and array
4783 gimple_register_canonical_type (tree t
)
4787 gcc_assert (TYPE_P (t
));
4789 if (TYPE_CANONICAL (t
))
4790 return TYPE_CANONICAL (t
);
4792 if (gimple_canonical_types
== NULL
)
4793 gimple_canonical_types
= htab_create_ggc (16381, gimple_canonical_type_hash
,
4794 gimple_canonical_type_eq
, 0);
4796 slot
= htab_find_slot (gimple_canonical_types
, t
, INSERT
);
4798 && *(tree
*)slot
!= t
)
4800 tree new_type
= (tree
) *((tree
*) slot
);
4802 TYPE_CANONICAL (t
) = new_type
;
4807 TYPE_CANONICAL (t
) = t
;
4815 /* Show statistics on references to the global type table gimple_types. */
4818 print_gimple_types_stats (void)
4821 fprintf (stderr
, "GIMPLE type table: size %ld, %ld elements, "
4822 "%ld searches, %ld collisions (ratio: %f)\n",
4823 (long) htab_size (gimple_types
),
4824 (long) htab_elements (gimple_types
),
4825 (long) gimple_types
->searches
,
4826 (long) gimple_types
->collisions
,
4827 htab_collisions (gimple_types
));
4829 fprintf (stderr
, "GIMPLE type table is empty\n");
4830 if (type_hash_cache
)
4831 fprintf (stderr
, "GIMPLE type hash table: size %ld, %ld elements, "
4832 "%ld searches, %ld collisions (ratio: %f)\n",
4833 (long) htab_size (type_hash_cache
),
4834 (long) htab_elements (type_hash_cache
),
4835 (long) type_hash_cache
->searches
,
4836 (long) type_hash_cache
->collisions
,
4837 htab_collisions (type_hash_cache
));
4839 fprintf (stderr
, "GIMPLE type hash table is empty\n");
4840 if (gimple_canonical_types
)
4841 fprintf (stderr
, "GIMPLE canonical type table: size %ld, %ld elements, "
4842 "%ld searches, %ld collisions (ratio: %f)\n",
4843 (long) htab_size (gimple_canonical_types
),
4844 (long) htab_elements (gimple_canonical_types
),
4845 (long) gimple_canonical_types
->searches
,
4846 (long) gimple_canonical_types
->collisions
,
4847 htab_collisions (gimple_canonical_types
));
4849 fprintf (stderr
, "GIMPLE canonical type table is empty\n");
4850 if (canonical_type_hash_cache
)
4851 fprintf (stderr
, "GIMPLE canonical type hash table: size %ld, %ld elements, "
4852 "%ld searches, %ld collisions (ratio: %f)\n",
4853 (long) htab_size (canonical_type_hash_cache
),
4854 (long) htab_elements (canonical_type_hash_cache
),
4855 (long) canonical_type_hash_cache
->searches
,
4856 (long) canonical_type_hash_cache
->collisions
,
4857 htab_collisions (canonical_type_hash_cache
));
4859 fprintf (stderr
, "GIMPLE canonical type hash table is empty\n");
4862 /* Free the gimple type hashtables used for LTO type merging. */
4865 free_gimple_type_tables (void)
4867 /* Last chance to print stats for the tables. */
4868 if (flag_lto_report
)
4869 print_gimple_types_stats ();
4873 htab_delete (gimple_types
);
4874 gimple_types
= NULL
;
4876 if (gimple_canonical_types
)
4878 htab_delete (gimple_canonical_types
);
4879 gimple_canonical_types
= NULL
;
4881 if (type_hash_cache
)
4883 htab_delete (type_hash_cache
);
4884 type_hash_cache
= NULL
;
4886 if (canonical_type_hash_cache
)
4888 htab_delete (canonical_type_hash_cache
);
4889 canonical_type_hash_cache
= NULL
;
4891 if (type_pair_cache
)
4893 free (type_pair_cache
);
4894 type_pair_cache
= NULL
;
4896 gimple_type_leader
= NULL
;
4900 /* Return a type the same as TYPE except unsigned or
4901 signed according to UNSIGNEDP. */
4904 gimple_signed_or_unsigned_type (bool unsignedp
, tree type
)
4908 type1
= TYPE_MAIN_VARIANT (type
);
4909 if (type1
== signed_char_type_node
4910 || type1
== char_type_node
4911 || type1
== unsigned_char_type_node
)
4912 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
4913 if (type1
== integer_type_node
|| type1
== unsigned_type_node
)
4914 return unsignedp
? unsigned_type_node
: integer_type_node
;
4915 if (type1
== short_integer_type_node
|| type1
== short_unsigned_type_node
)
4916 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
4917 if (type1
== long_integer_type_node
|| type1
== long_unsigned_type_node
)
4918 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
4919 if (type1
== long_long_integer_type_node
4920 || type1
== long_long_unsigned_type_node
)
4922 ? long_long_unsigned_type_node
4923 : long_long_integer_type_node
;
4924 if (int128_integer_type_node
&& (type1
== int128_integer_type_node
|| type1
== int128_unsigned_type_node
))
4926 ? int128_unsigned_type_node
4927 : int128_integer_type_node
;
4928 #if HOST_BITS_PER_WIDE_INT >= 64
4929 if (type1
== intTI_type_node
|| type1
== unsigned_intTI_type_node
)
4930 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
4932 if (type1
== intDI_type_node
|| type1
== unsigned_intDI_type_node
)
4933 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
4934 if (type1
== intSI_type_node
|| type1
== unsigned_intSI_type_node
)
4935 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
4936 if (type1
== intHI_type_node
|| type1
== unsigned_intHI_type_node
)
4937 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
4938 if (type1
== intQI_type_node
|| type1
== unsigned_intQI_type_node
)
4939 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
4941 #define GIMPLE_FIXED_TYPES(NAME) \
4942 if (type1 == short_ ## NAME ## _type_node \
4943 || type1 == unsigned_short_ ## NAME ## _type_node) \
4944 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4945 : short_ ## NAME ## _type_node; \
4946 if (type1 == NAME ## _type_node \
4947 || type1 == unsigned_ ## NAME ## _type_node) \
4948 return unsignedp ? unsigned_ ## NAME ## _type_node \
4949 : NAME ## _type_node; \
4950 if (type1 == long_ ## NAME ## _type_node \
4951 || type1 == unsigned_long_ ## NAME ## _type_node) \
4952 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4953 : long_ ## NAME ## _type_node; \
4954 if (type1 == long_long_ ## NAME ## _type_node \
4955 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4956 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4957 : long_long_ ## NAME ## _type_node;
4959 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
4960 if (type1 == NAME ## _type_node \
4961 || type1 == u ## NAME ## _type_node) \
4962 return unsignedp ? u ## NAME ## _type_node \
4963 : NAME ## _type_node;
4965 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
4966 if (type1 == sat_ ## short_ ## NAME ## _type_node \
4967 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
4968 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
4969 : sat_ ## short_ ## NAME ## _type_node; \
4970 if (type1 == sat_ ## NAME ## _type_node \
4971 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
4972 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
4973 : sat_ ## NAME ## _type_node; \
4974 if (type1 == sat_ ## long_ ## NAME ## _type_node \
4975 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
4976 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
4977 : sat_ ## long_ ## NAME ## _type_node; \
4978 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
4979 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
4980 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
4981 : sat_ ## long_long_ ## NAME ## _type_node;
4983 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
4984 if (type1 == sat_ ## NAME ## _type_node \
4985 || type1 == sat_ ## u ## NAME ## _type_node) \
4986 return unsignedp ? sat_ ## u ## NAME ## _type_node \
4987 : sat_ ## NAME ## _type_node;
4989 GIMPLE_FIXED_TYPES (fract
);
4990 GIMPLE_FIXED_TYPES_SAT (fract
);
4991 GIMPLE_FIXED_TYPES (accum
);
4992 GIMPLE_FIXED_TYPES_SAT (accum
);
4994 GIMPLE_FIXED_MODE_TYPES (qq
);
4995 GIMPLE_FIXED_MODE_TYPES (hq
);
4996 GIMPLE_FIXED_MODE_TYPES (sq
);
4997 GIMPLE_FIXED_MODE_TYPES (dq
);
4998 GIMPLE_FIXED_MODE_TYPES (tq
);
4999 GIMPLE_FIXED_MODE_TYPES_SAT (qq
);
5000 GIMPLE_FIXED_MODE_TYPES_SAT (hq
);
5001 GIMPLE_FIXED_MODE_TYPES_SAT (sq
);
5002 GIMPLE_FIXED_MODE_TYPES_SAT (dq
);
5003 GIMPLE_FIXED_MODE_TYPES_SAT (tq
);
5004 GIMPLE_FIXED_MODE_TYPES (ha
);
5005 GIMPLE_FIXED_MODE_TYPES (sa
);
5006 GIMPLE_FIXED_MODE_TYPES (da
);
5007 GIMPLE_FIXED_MODE_TYPES (ta
);
5008 GIMPLE_FIXED_MODE_TYPES_SAT (ha
);
5009 GIMPLE_FIXED_MODE_TYPES_SAT (sa
);
5010 GIMPLE_FIXED_MODE_TYPES_SAT (da
);
5011 GIMPLE_FIXED_MODE_TYPES_SAT (ta
);
5013 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
5014 the precision; they have precision set to match their range, but
5015 may use a wider mode to match an ABI. If we change modes, we may
5016 wind up with bad conversions. For INTEGER_TYPEs in C, must check
5017 the precision as well, so as to yield correct results for
5018 bit-field types. C++ does not have these separate bit-field
5019 types, and producing a signed or unsigned variant of an
5020 ENUMERAL_TYPE may cause other problems as well. */
5021 if (!INTEGRAL_TYPE_P (type
)
5022 || TYPE_UNSIGNED (type
) == unsignedp
)
5025 #define TYPE_OK(node) \
5026 (TYPE_MODE (type) == TYPE_MODE (node) \
5027 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
5028 if (TYPE_OK (signed_char_type_node
))
5029 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
5030 if (TYPE_OK (integer_type_node
))
5031 return unsignedp
? unsigned_type_node
: integer_type_node
;
5032 if (TYPE_OK (short_integer_type_node
))
5033 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
5034 if (TYPE_OK (long_integer_type_node
))
5035 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
5036 if (TYPE_OK (long_long_integer_type_node
))
5038 ? long_long_unsigned_type_node
5039 : long_long_integer_type_node
);
5040 if (int128_integer_type_node
&& TYPE_OK (int128_integer_type_node
))
5042 ? int128_unsigned_type_node
5043 : int128_integer_type_node
);
5045 #if HOST_BITS_PER_WIDE_INT >= 64
5046 if (TYPE_OK (intTI_type_node
))
5047 return unsignedp
? unsigned_intTI_type_node
: intTI_type_node
;
5049 if (TYPE_OK (intDI_type_node
))
5050 return unsignedp
? unsigned_intDI_type_node
: intDI_type_node
;
5051 if (TYPE_OK (intSI_type_node
))
5052 return unsignedp
? unsigned_intSI_type_node
: intSI_type_node
;
5053 if (TYPE_OK (intHI_type_node
))
5054 return unsignedp
? unsigned_intHI_type_node
: intHI_type_node
;
5055 if (TYPE_OK (intQI_type_node
))
5056 return unsignedp
? unsigned_intQI_type_node
: intQI_type_node
;
5058 #undef GIMPLE_FIXED_TYPES
5059 #undef GIMPLE_FIXED_MODE_TYPES
5060 #undef GIMPLE_FIXED_TYPES_SAT
5061 #undef GIMPLE_FIXED_MODE_TYPES_SAT
5064 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
5068 /* Return an unsigned type the same as TYPE in other respects. */
5071 gimple_unsigned_type (tree type
)
5073 return gimple_signed_or_unsigned_type (true, type
);
5077 /* Return a signed type the same as TYPE in other respects. */
5080 gimple_signed_type (tree type
)
5082 return gimple_signed_or_unsigned_type (false, type
);
5086 /* Return the typed-based alias set for T, which may be an expression
5087 or a type. Return -1 if we don't do anything special. */
5090 gimple_get_alias_set (tree t
)
5094 /* Permit type-punning when accessing a union, provided the access
5095 is directly through the union. For example, this code does not
5096 permit taking the address of a union member and then storing
5097 through it. Even the type-punning allowed here is a GCC
5098 extension, albeit a common and useful one; the C standard says
5099 that such accesses have implementation-defined behavior. */
5101 TREE_CODE (u
) == COMPONENT_REF
|| TREE_CODE (u
) == ARRAY_REF
;
5102 u
= TREE_OPERAND (u
, 0))
5103 if (TREE_CODE (u
) == COMPONENT_REF
5104 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u
, 0))) == UNION_TYPE
)
5107 /* That's all the expressions we handle specially. */
5111 /* For convenience, follow the C standard when dealing with
5112 character types. Any object may be accessed via an lvalue that
5113 has character type. */
5114 if (t
== char_type_node
5115 || t
== signed_char_type_node
5116 || t
== unsigned_char_type_node
)
5119 /* Allow aliasing between signed and unsigned variants of the same
5120 type. We treat the signed variant as canonical. */
5121 if (TREE_CODE (t
) == INTEGER_TYPE
&& TYPE_UNSIGNED (t
))
5123 tree t1
= gimple_signed_type (t
);
5125 /* t1 == t can happen for boolean nodes which are always unsigned. */
5127 return get_alias_set (t1
);
5134 /* Data structure used to count the number of dereferences to PTR
5135 inside an expression. */
5139 unsigned num_stores
;
5143 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
5144 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
5147 count_ptr_derefs (tree
*tp
, int *walk_subtrees
, void *data
)
5149 struct walk_stmt_info
*wi_p
= (struct walk_stmt_info
*) data
;
5150 struct count_ptr_d
*count_p
= (struct count_ptr_d
*) wi_p
->info
;
5152 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
5153 pointer 'ptr' is *not* dereferenced, it is simply used to compute
5154 the address of 'fld' as 'ptr + offsetof(fld)'. */
5155 if (TREE_CODE (*tp
) == ADDR_EXPR
)
5161 if (TREE_CODE (*tp
) == MEM_REF
&& TREE_OPERAND (*tp
, 0) == count_p
->ptr
)
5164 count_p
->num_stores
++;
5166 count_p
->num_loads
++;
5172 /* Count the number of direct and indirect uses for pointer PTR in
5173 statement STMT. The number of direct uses is stored in
5174 *NUM_USES_P. Indirect references are counted separately depending
5175 on whether they are store or load operations. The counts are
5176 stored in *NUM_STORES_P and *NUM_LOADS_P. */
5179 count_uses_and_derefs (tree ptr
, gimple stmt
, unsigned *num_uses_p
,
5180 unsigned *num_loads_p
, unsigned *num_stores_p
)
5189 /* Find out the total number of uses of PTR in STMT. */
5190 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, i
, SSA_OP_USE
)
5194 /* Now count the number of indirect references to PTR. This is
5195 truly awful, but we don't have much choice. There are no parent
5196 pointers inside INDIRECT_REFs, so an expression like
5197 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
5198 find all the indirect and direct uses of x_1 inside. The only
5199 shortcut we can take is the fact that GIMPLE only allows
5200 INDIRECT_REFs inside the expressions below. */
5201 if (is_gimple_assign (stmt
)
5202 || gimple_code (stmt
) == GIMPLE_RETURN
5203 || gimple_code (stmt
) == GIMPLE_ASM
5204 || is_gimple_call (stmt
))
5206 struct walk_stmt_info wi
;
5207 struct count_ptr_d count
;
5210 count
.num_stores
= 0;
5211 count
.num_loads
= 0;
5213 memset (&wi
, 0, sizeof (wi
));
5215 walk_gimple_op (stmt
, count_ptr_derefs
, &wi
);
5217 *num_stores_p
= count
.num_stores
;
5218 *num_loads_p
= count
.num_loads
;
5221 gcc_assert (*num_uses_p
>= *num_loads_p
+ *num_stores_p
);
5224 /* From a tree operand OP return the base of a load or store operation
5225 or NULL_TREE if OP is not a load or a store. */
5228 get_base_loadstore (tree op
)
5230 while (handled_component_p (op
))
5231 op
= TREE_OPERAND (op
, 0);
5233 || INDIRECT_REF_P (op
)
5234 || TREE_CODE (op
) == MEM_REF
5235 || TREE_CODE (op
) == TARGET_MEM_REF
)
5240 /* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and
5241 VISIT_ADDR if non-NULL on loads, store and address-taken operands
5242 passing the STMT, the base of the operand and DATA to it. The base
5243 will be either a decl, an indirect reference (including TARGET_MEM_REF)
5244 or the argument of an address expression.
5245 Returns the results of these callbacks or'ed. */
5248 walk_stmt_load_store_addr_ops (gimple stmt
, void *data
,
5249 bool (*visit_load
)(gimple
, tree
, void *),
5250 bool (*visit_store
)(gimple
, tree
, void *),
5251 bool (*visit_addr
)(gimple
, tree
, void *))
5255 if (gimple_assign_single_p (stmt
))
5260 lhs
= get_base_loadstore (gimple_assign_lhs (stmt
));
5262 ret
|= visit_store (stmt
, lhs
, data
);
5264 rhs
= gimple_assign_rhs1 (stmt
);
5265 while (handled_component_p (rhs
))
5266 rhs
= TREE_OPERAND (rhs
, 0);
5269 if (TREE_CODE (rhs
) == ADDR_EXPR
)
5270 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
5271 else if (TREE_CODE (rhs
) == TARGET_MEM_REF
5272 && TREE_CODE (TMR_BASE (rhs
)) == ADDR_EXPR
)
5273 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (rhs
), 0), data
);
5274 else if (TREE_CODE (rhs
) == OBJ_TYPE_REF
5275 && TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs
)) == ADDR_EXPR
)
5276 ret
|= visit_addr (stmt
, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs
),
5278 else if (TREE_CODE (rhs
) == CONSTRUCTOR
)
5283 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (rhs
), ix
, val
)
5284 if (TREE_CODE (val
) == ADDR_EXPR
)
5285 ret
|= visit_addr (stmt
, TREE_OPERAND (val
, 0), data
);
5286 else if (TREE_CODE (val
) == OBJ_TYPE_REF
5287 && TREE_CODE (OBJ_TYPE_REF_OBJECT (val
)) == ADDR_EXPR
)
5288 ret
|= visit_addr (stmt
,
5289 TREE_OPERAND (OBJ_TYPE_REF_OBJECT (val
),
5292 lhs
= gimple_assign_lhs (stmt
);
5293 if (TREE_CODE (lhs
) == TARGET_MEM_REF
5294 && TREE_CODE (TMR_BASE (lhs
)) == ADDR_EXPR
)
5295 ret
|= visit_addr (stmt
, TREE_OPERAND (TMR_BASE (lhs
), 0), data
);
5299 rhs
= get_base_loadstore (rhs
);
5301 ret
|= visit_load (stmt
, rhs
, data
);
5305 && (is_gimple_assign (stmt
)
5306 || gimple_code (stmt
) == GIMPLE_COND
))
5308 for (i
= 0; i
< gimple_num_ops (stmt
); ++i
)
5310 tree op
= gimple_op (stmt
, i
);
5311 if (op
== NULL_TREE
)
5313 else if (TREE_CODE (op
) == ADDR_EXPR
)
5314 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
5315 /* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison
5316 tree with two operands. */
5317 else if (i
== 1 && COMPARISON_CLASS_P (op
))
5319 if (TREE_CODE (TREE_OPERAND (op
, 0)) == ADDR_EXPR
)
5320 ret
|= visit_addr (stmt
, TREE_OPERAND (TREE_OPERAND (op
, 0),
5322 if (TREE_CODE (TREE_OPERAND (op
, 1)) == ADDR_EXPR
)
5323 ret
|= visit_addr (stmt
, TREE_OPERAND (TREE_OPERAND (op
, 1),
5328 else if (is_gimple_call (stmt
))
5332 tree lhs
= gimple_call_lhs (stmt
);
5335 lhs
= get_base_loadstore (lhs
);
5337 ret
|= visit_store (stmt
, lhs
, data
);
5340 if (visit_load
|| visit_addr
)
5341 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
5343 tree rhs
= gimple_call_arg (stmt
, i
);
5345 && TREE_CODE (rhs
) == ADDR_EXPR
)
5346 ret
|= visit_addr (stmt
, TREE_OPERAND (rhs
, 0), data
);
5347 else if (visit_load
)
5349 rhs
= get_base_loadstore (rhs
);
5351 ret
|= visit_load (stmt
, rhs
, data
);
5355 && gimple_call_chain (stmt
)
5356 && TREE_CODE (gimple_call_chain (stmt
)) == ADDR_EXPR
)
5357 ret
|= visit_addr (stmt
, TREE_OPERAND (gimple_call_chain (stmt
), 0),
5360 && gimple_call_return_slot_opt_p (stmt
)
5361 && gimple_call_lhs (stmt
) != NULL_TREE
5362 && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt
))))
5363 ret
|= visit_addr (stmt
, gimple_call_lhs (stmt
), data
);
5365 else if (gimple_code (stmt
) == GIMPLE_ASM
)
5368 const char *constraint
;
5369 const char **oconstraints
;
5370 bool allows_mem
, allows_reg
, is_inout
;
5371 noutputs
= gimple_asm_noutputs (stmt
);
5372 oconstraints
= XALLOCAVEC (const char *, noutputs
);
5373 if (visit_store
|| visit_addr
)
5374 for (i
= 0; i
< gimple_asm_noutputs (stmt
); ++i
)
5376 tree link
= gimple_asm_output_op (stmt
, i
);
5377 tree op
= get_base_loadstore (TREE_VALUE (link
));
5378 if (op
&& visit_store
)
5379 ret
|= visit_store (stmt
, op
, data
);
5382 constraint
= TREE_STRING_POINTER
5383 (TREE_VALUE (TREE_PURPOSE (link
)));
5384 oconstraints
[i
] = constraint
;
5385 parse_output_constraint (&constraint
, i
, 0, 0, &allows_mem
,
5386 &allows_reg
, &is_inout
);
5387 if (op
&& !allows_reg
&& allows_mem
)
5388 ret
|= visit_addr (stmt
, op
, data
);
5391 if (visit_load
|| visit_addr
)
5392 for (i
= 0; i
< gimple_asm_ninputs (stmt
); ++i
)
5394 tree link
= gimple_asm_input_op (stmt
, i
);
5395 tree op
= TREE_VALUE (link
);
5397 && TREE_CODE (op
) == ADDR_EXPR
)
5398 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
5399 else if (visit_load
|| visit_addr
)
5401 op
= get_base_loadstore (op
);
5405 ret
|= visit_load (stmt
, op
, data
);
5408 constraint
= TREE_STRING_POINTER
5409 (TREE_VALUE (TREE_PURPOSE (link
)));
5410 parse_input_constraint (&constraint
, 0, 0, noutputs
,
5412 &allows_mem
, &allows_reg
);
5413 if (!allows_reg
&& allows_mem
)
5414 ret
|= visit_addr (stmt
, op
, data
);
5420 else if (gimple_code (stmt
) == GIMPLE_RETURN
)
5422 tree op
= gimple_return_retval (stmt
);
5426 && TREE_CODE (op
) == ADDR_EXPR
)
5427 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
5428 else if (visit_load
)
5430 op
= get_base_loadstore (op
);
5432 ret
|= visit_load (stmt
, op
, data
);
5437 && gimple_code (stmt
) == GIMPLE_PHI
)
5439 for (i
= 0; i
< gimple_phi_num_args (stmt
); ++i
)
5441 tree op
= PHI_ARG_DEF (stmt
, i
);
5442 if (TREE_CODE (op
) == ADDR_EXPR
)
5443 ret
|= visit_addr (stmt
, TREE_OPERAND (op
, 0), data
);
5450 /* Like walk_stmt_load_store_addr_ops but with NULL visit_addr. IPA-CP
5451 should make a faster clone for this case. */
5454 walk_stmt_load_store_ops (gimple stmt
, void *data
,
5455 bool (*visit_load
)(gimple
, tree
, void *),
5456 bool (*visit_store
)(gimple
, tree
, void *))
5458 return walk_stmt_load_store_addr_ops (stmt
, data
,
5459 visit_load
, visit_store
, NULL
);
5462 /* Helper for gimple_ior_addresses_taken_1. */
5465 gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED
,
5466 tree addr
, void *data
)
5468 bitmap addresses_taken
= (bitmap
)data
;
5469 addr
= get_base_address (addr
);
5473 bitmap_set_bit (addresses_taken
, DECL_UID (addr
));
5479 /* Set the bit for the uid of all decls that have their address taken
5480 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
5481 were any in this stmt. */
5484 gimple_ior_addresses_taken (bitmap addresses_taken
, gimple stmt
)
5486 return walk_stmt_load_store_addr_ops (stmt
, addresses_taken
, NULL
, NULL
,
5487 gimple_ior_addresses_taken_1
);
5491 /* Return a printable name for symbol DECL. */
5494 gimple_decl_printable_name (tree decl
, int verbosity
)
5496 if (!DECL_NAME (decl
))
5499 if (DECL_ASSEMBLER_NAME_SET_P (decl
))
5501 const char *str
, *mangled_str
;
5502 int dmgl_opts
= DMGL_NO_OPTS
;
5506 dmgl_opts
= DMGL_VERBOSE
5510 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5511 dmgl_opts
|= DMGL_PARAMS
;
5514 mangled_str
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
5515 str
= cplus_demangle_v3 (mangled_str
, dmgl_opts
);
5516 return (str
) ? str
: mangled_str
;
5519 return IDENTIFIER_POINTER (DECL_NAME (decl
));
5522 /* Return true when STMT is builtins call to CODE. */
5525 gimple_call_builtin_p (gimple stmt
, enum built_in_function code
)
5528 return (is_gimple_call (stmt
)
5529 && (fndecl
= gimple_call_fndecl (stmt
)) != NULL
5530 && DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
5531 && DECL_FUNCTION_CODE (fndecl
) == code
);
5534 /* Return true if STMT clobbers memory. STMT is required to be a
5538 gimple_asm_clobbers_memory_p (const_gimple stmt
)
5542 for (i
= 0; i
< gimple_asm_nclobbers (stmt
); i
++)
5544 tree op
= gimple_asm_clobber_op (stmt
, i
);
5545 if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op
)), "memory") == 0)
5551 #include "gt-gimple.h"