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)
2462 if (is_gimple_debug (s))
2465 /* We don't have to scan the arguments to check for
2466 volatile arguments, though, at present, we still
2467 do a scan to check for TREE_SIDE_EFFECTS. */
2468 if (gimple_has_volatile_ops (s))
2471 if (gimple_code (s) == GIMPLE_ASM
2472 && gimple_asm_volatile_p (s))
2475 if (is_gimple_call (s))
2477 unsigned nargs = gimple_call_num_args (s);
2480 if (!(gimple_call_flags (s) & (ECF_CONST | ECF_PURE)))
2482 else if (gimple_call_flags (s) & ECF_LOOPING_CONST_OR_PURE)
2483 /* An infinite loop is considered a side effect. */
2486 if (gimple_call_lhs (s)
2487 && TREE_SIDE_EFFECTS (gimple_call_lhs (s)))
2489 gcc_checking_assert (gimple_has_volatile_ops (s));
2493 fn = gimple_call_fn (s);
2494 if (fn && TREE_SIDE_EFFECTS (fn))
2497 for (i = 0; i < nargs; i++)
2498 if (TREE_SIDE_EFFECTS (gimple_call_arg (s, i)))
2500 gcc_checking_assert (gimple_has_volatile_ops (s));
2508 for (i = 0; i < gimple_num_ops (s); i++)
2510 tree op = gimple_op (s, i);
2511 if (op && TREE_SIDE_EFFECTS (op))
2513 gcc_checking_assert (gimple_has_volatile_ops (s));
2522 /* Return true if the RHS of statement S has side effects.
2523 We may use it to determine if it is admissable to replace
2524 an assignment or call with a copy of a previously-computed
2525 value. In such cases, side-effects due to the LHS are
2529 gimple_rhs_has_side_effects (const_gimple s)
2533 if (is_gimple_call (s))
2535 unsigned nargs = gimple_call_num_args (s);
2538 if (!(gimple_call_flags (s) & (ECF_CONST | ECF_PURE)))
2541 /* We cannot use gimple_has_volatile_ops here,
2542 because we must ignore a volatile LHS. */
2543 fn = gimple_call_fn (s);
2544 if (fn && (TREE_SIDE_EFFECTS (fn) || TREE_THIS_VOLATILE (fn)))
2546 gcc_assert (gimple_has_volatile_ops (s));
2550 for (i = 0; i < nargs; i++)
2551 if (TREE_SIDE_EFFECTS (gimple_call_arg (s, i))
2552 || TREE_THIS_VOLATILE (gimple_call_arg (s, i)))
2557 else if (is_gimple_assign (s))
2559 /* Skip the first operand, the LHS. */
2560 for (i = 1; i < gimple_num_ops (s); i++)
2561 if (TREE_SIDE_EFFECTS (gimple_op (s, i))
2562 || TREE_THIS_VOLATILE (gimple_op (s, i)))
2564 gcc_assert (gimple_has_volatile_ops (s));
2568 else if (is_gimple_debug (s))
2572 /* For statements without an LHS, examine all arguments. */
2573 for (i = 0; i < gimple_num_ops (s); i++)
2574 if (TREE_SIDE_EFFECTS (gimple_op (s, i))
2575 || TREE_THIS_VOLATILE (gimple_op (s, i)))
2577 gcc_assert (gimple_has_volatile_ops (s));
2585 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
2586 Return true if S can trap. When INCLUDE_MEM is true, check whether
2587 the memory operations could trap. When INCLUDE_STORES is true and
2588 S is a GIMPLE_ASSIGN, the LHS of the assignment is also checked. */
2591 gimple_could_trap_p_1 (gimple s, bool include_mem, bool include_stores)
2593 tree t, div = NULL_TREE;
2598 unsigned i, start = (is_gimple_assign (s) && !include_stores) ? 1 : 0;
2600 for (i = start; i < gimple_num_ops (s); i++)
2601 if (tree_could_trap_p (gimple_op (s, i)))
2605 switch (gimple_code (s))
2608 return gimple_asm_volatile_p (s);
2611 t = gimple_call_fndecl (s);
2612 /* Assume that calls to weak functions may trap. */
2613 if (!t || !DECL_P (t) || DECL_WEAK (t))
2618 t = gimple_expr_type (s);
2619 op = gimple_assign_rhs_code (s);
2620 if (get_gimple_rhs_class (op) == GIMPLE_BINARY_RHS)
2621 div = gimple_assign_rhs2 (s);
2622 return (operation_could_trap_p (op, FLOAT_TYPE_P (t),
2623 (INTEGRAL_TYPE_P (t)
2624 && TYPE_OVERFLOW_TRAPS (t)),
2634 /* Return true if statement S can trap. */
2637 gimple_could_trap_p (gimple s)
2639 return gimple_could_trap_p_1 (s, true, true);
2642 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
2645 gimple_assign_rhs_could_trap_p (gimple s)
2647 gcc_assert (is_gimple_assign (s));
2648 return gimple_could_trap_p_1 (s, true, false);
2652 /* Print debugging information for gimple stmts generated. */
2655 dump_gimple_statistics (void)
2657 #ifdef GATHER_STATISTICS
2658 int i, total_tuples = 0, total_bytes = 0;
2660 fprintf (stderr, "\nGIMPLE statements\n");
2661 fprintf (stderr, "Kind Stmts Bytes\n");
2662 fprintf (stderr, "---------------------------------------\n");
2663 for (i = 0; i < (int) gimple_alloc_kind_all; ++i)
2665 fprintf (stderr, "%-20s %7d %10d\n", gimple_alloc_kind_names[i],
2666 gimple_alloc_counts[i], gimple_alloc_sizes[i]);
2667 total_tuples += gimple_alloc_counts[i];
2668 total_bytes += gimple_alloc_sizes[i];
2670 fprintf (stderr, "---------------------------------------\n");
2671 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_tuples, total_bytes);
2672 fprintf (stderr, "---------------------------------------\n");
2674 fprintf (stderr, "No gimple statistics\n");
2679 /* Return the number of operands needed on the RHS of a GIMPLE
2680 assignment for an expression with tree code CODE. */
2683 get_gimple_rhs_num_ops (enum tree_code code)
2685 enum gimple_rhs_class rhs_class = get_gimple_rhs_class (code);
2687 if (rhs_class == GIMPLE_UNARY_RHS || rhs_class == GIMPLE_SINGLE_RHS)
2689 else if (rhs_class == GIMPLE_BINARY_RHS)
2691 else if (rhs_class == GIMPLE_TERNARY_RHS)
2697 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
2699 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
2700 : ((TYPE) == tcc_binary \
2701 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
2702 : ((TYPE) == tcc_constant \
2703 || (TYPE) == tcc_declaration \
2704 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
2705 : ((SYM) == TRUTH_AND_EXPR \
2706 || (SYM) == TRUTH_OR_EXPR \
2707 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
2708 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
2709 : ((SYM) == COND_EXPR \
2710 || (SYM) == WIDEN_MULT_PLUS_EXPR \
2711 || (SYM) == WIDEN_MULT_MINUS_EXPR \
2712 || (SYM) == DOT_PROD_EXPR \
2713 || (SYM) == REALIGN_LOAD_EXPR \
2714 || (SYM) == VEC_COND_EXPR \
2715 || (SYM) == VEC_PERM_EXPR \
2716 || (SYM) == FMA_EXPR) ? GIMPLE_TERNARY_RHS \
2717 : ((SYM) == CONSTRUCTOR \
2718 || (SYM) == OBJ_TYPE_REF \
2719 || (SYM) == ASSERT_EXPR \
2720 || (SYM) == ADDR_EXPR \
2721 || (SYM) == WITH_SIZE_EXPR \
2722 || (SYM) == SSA_NAME) ? GIMPLE_SINGLE_RHS \
2723 : GIMPLE_INVALID_RHS),
2724 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
2726 const unsigned char gimple_rhs_class_table[] = {
2727 #include "all-tree.def"
2731 #undef END_OF_BASE_TREE_CODES
2733 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
2735 /* Validation of GIMPLE expressions. */
2737 /* Returns true iff T is a valid RHS for an assignment to a renamed
2738 user -- or front-end generated artificial -- variable. */
2741 is_gimple_reg_rhs (tree t)
2743 return get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS;
2746 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
2747 LHS, or for a call argument. */
2750 is_gimple_mem_rhs (tree t)
2752 /* If we're dealing with a renamable type, either source or dest must be
2753 a renamed variable. */
2754 if (is_gimple_reg_type (TREE_TYPE (t)))
2755 return is_gimple_val (t);
2757 return is_gimple_val (t) || is_gimple_lvalue (t);
2760 /* Return true if T is a valid LHS for a GIMPLE assignment expression. */
2763 is_gimple_lvalue (tree t)
2765 return (is_gimple_addressable (t)
2766 || TREE_CODE (t) == WITH_SIZE_EXPR
2767 /* These are complex lvalues, but don't have addresses, so they
2769 || TREE_CODE (t) == BIT_FIELD_REF);
2772 /* Return true if T is a GIMPLE condition. */
2775 is_gimple_condexpr (tree t)
2777 return (is_gimple_val (t) || (COMPARISON_CLASS_P (t)
2778 && !tree_could_throw_p (t)
2779 && is_gimple_val (TREE_OPERAND (t, 0))
2780 && is_gimple_val (TREE_OPERAND (t, 1))));
2783 /* Return true if T is something whose address can be taken. */
2786 is_gimple_addressable (tree t)
2788 return (is_gimple_id (t) || handled_component_p (t)
2789 || TREE_CODE (t) == MEM_REF);
2792 /* Return true if T is a valid gimple constant. */
2795 is_gimple_constant (const_tree t)
2797 switch (TREE_CODE (t))
2807 /* Vector constant constructors are gimple invariant. */
2809 if (TREE_TYPE (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2810 return TREE_CONSTANT (t);
2819 /* Return true if T is a gimple address. */
2822 is_gimple_address (const_tree t)
2826 if (TREE_CODE (t) != ADDR_EXPR)
2829 op = TREE_OPERAND (t, 0);
2830 while (handled_component_p (op))
2832 if ((TREE_CODE (op) == ARRAY_REF
2833 || TREE_CODE (op) == ARRAY_RANGE_REF)
2834 && !is_gimple_val (TREE_OPERAND (op, 1)))
2837 op = TREE_OPERAND (op, 0);
2840 if (CONSTANT_CLASS_P (op) || TREE_CODE (op) == MEM_REF)
2843 switch (TREE_CODE (op))
2858 /* Return true if T is a gimple invariant address. */
2861 is_gimple_invariant_address (const_tree t)
2865 if (TREE_CODE (t) != ADDR_EXPR)
2868 op = strip_invariant_refs (TREE_OPERAND (t, 0));
2872 if (TREE_CODE (op) == MEM_REF)
2874 const_tree op0 = TREE_OPERAND (op, 0);
2875 return (TREE_CODE (op0) == ADDR_EXPR
2876 && (CONSTANT_CLASS_P (TREE_OPERAND (op0, 0))
2877 || decl_address_invariant_p (TREE_OPERAND (op0, 0))));
2880 return CONSTANT_CLASS_P (op) || decl_address_invariant_p (op);
2883 /* Return true if T is a gimple invariant address at IPA level
2884 (so addresses of variables on stack are not allowed). */
2887 is_gimple_ip_invariant_address (const_tree t)
2891 if (TREE_CODE (t) != ADDR_EXPR)
2894 op = strip_invariant_refs (TREE_OPERAND (t, 0));
2896 return op && (CONSTANT_CLASS_P (op) || decl_address_ip_invariant_p (op));
2899 /* Return true if T is a GIMPLE minimal invariant. It's a restricted
2900 form of function invariant. */
2903 is_gimple_min_invariant (const_tree t)
2905 if (TREE_CODE (t) == ADDR_EXPR)
2906 return is_gimple_invariant_address (t);
2908 return is_gimple_constant (t);
2911 /* Return true if T is a GIMPLE interprocedural invariant. It's a restricted
2912 form of gimple minimal invariant. */
2915 is_gimple_ip_invariant (const_tree t)
2917 if (TREE_CODE (t) == ADDR_EXPR)
2918 return is_gimple_ip_invariant_address (t);
2920 return is_gimple_constant (t);
2923 /* Return true if T looks like a valid GIMPLE statement. */
2926 is_gimple_stmt (tree t)
2928 const enum tree_code code = TREE_CODE (t);
2933 /* The only valid NOP_EXPR is the empty statement. */
2934 return IS_EMPTY_STMT (t);
2938 /* These are only valid if they're void. */
2939 return TREE_TYPE (t) == NULL || VOID_TYPE_P (TREE_TYPE (t));
2945 case CASE_LABEL_EXPR:
2946 case TRY_CATCH_EXPR:
2947 case TRY_FINALLY_EXPR:
2948 case EH_FILTER_EXPR:
2951 case STATEMENT_LIST:
2961 /* These are always void. */
2967 /* These are valid regardless of their type. */
2975 /* Return true if T is a variable. */
2978 is_gimple_variable (tree t)
2980 return (TREE_CODE (t) == VAR_DECL
2981 || TREE_CODE (t) == PARM_DECL
2982 || TREE_CODE (t) == RESULT_DECL
2983 || TREE_CODE (t) == SSA_NAME);
2986 /* Return true if T is a GIMPLE identifier (something with an address). */
2989 is_gimple_id (tree t)
2991 return (is_gimple_variable (t)
2992 || TREE_CODE (t) == FUNCTION_DECL
2993 || TREE_CODE (t) == LABEL_DECL
2994 || TREE_CODE (t) == CONST_DECL
2995 /* Allow string constants, since they are addressable. */
2996 || TREE_CODE (t) == STRING_CST);
2999 /* Return true if TYPE is a suitable type for a scalar register variable. */
3002 is_gimple_reg_type (tree type)
3004 return !AGGREGATE_TYPE_P (type);
3007 /* Return true if T is a non-aggregate register variable. */
3010 is_gimple_reg (tree t)
3012 if (TREE_CODE (t) == SSA_NAME)
3013 t = SSA_NAME_VAR (t);
3015 if (!is_gimple_variable (t))
3018 if (!is_gimple_reg_type (TREE_TYPE (t)))
3021 /* A volatile decl is not acceptable because we can't reuse it as
3022 needed. We need to copy it into a temp first. */
3023 if (TREE_THIS_VOLATILE (t))
3026 /* We define "registers" as things that can be renamed as needed,
3027 which with our infrastructure does not apply to memory. */
3028 if (needs_to_live_in_memory (t))
3031 /* Hard register variables are an interesting case. For those that
3032 are call-clobbered, we don't know where all the calls are, since
3033 we don't (want to) take into account which operations will turn
3034 into libcalls at the rtl level. For those that are call-saved,
3035 we don't currently model the fact that calls may in fact change
3036 global hard registers, nor do we examine ASM_CLOBBERS at the tree
3037 level, and so miss variable changes that might imply. All around,
3038 it seems safest to not do too much optimization with these at the
3039 tree level at all. We'll have to rely on the rtl optimizers to
3040 clean this up, as there we've got all the appropriate bits exposed. */
3041 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
3044 /* Complex and vector values must have been put into SSA-like form.
3045 That is, no assignments to the individual components. */
3046 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
3047 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
3048 return DECL_GIMPLE_REG_P (t);
3054 /* Return true if T is a GIMPLE variable whose address is not needed. */
3057 is_gimple_non_addressable (tree t)
3059 if (TREE_CODE (t) == SSA_NAME)
3060 t = SSA_NAME_VAR (t);
3062 return (is_gimple_variable (t) && ! needs_to_live_in_memory (t));
3065 /* Return true if T is a GIMPLE rvalue, i.e. an identifier or a constant. */
3068 is_gimple_val (tree t)
3070 /* Make loads from volatiles and memory vars explicit. */
3071 if (is_gimple_variable (t)
3072 && is_gimple_reg_type (TREE_TYPE (t))
3073 && !is_gimple_reg (t))
3076 return (is_gimple_variable (t) || is_gimple_min_invariant (t));
3079 /* Similarly, but accept hard registers as inputs to asm statements. */
3082 is_gimple_asm_val (tree t)
3084 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
3087 return is_gimple_val (t);
3090 /* Return true if T is a GIMPLE minimal lvalue. */
3093 is_gimple_min_lval (tree t)
3095 if (!(t = CONST_CAST_TREE (strip_invariant_refs (t))))
3097 return (is_gimple_id (t) || TREE_CODE (t) == MEM_REF);
3100 /* Return true if T is a valid function operand of a CALL_EXPR. */
3103 is_gimple_call_addr (tree t)
3105 return (TREE_CODE (t) == OBJ_TYPE_REF || is_gimple_val (t));
3108 /* Return true if T is a valid address operand of a MEM_REF. */
3111 is_gimple_mem_ref_addr (tree t)
3113 return (is_gimple_reg (t)
3114 || TREE_CODE (t) == INTEGER_CST
3115 || (TREE_CODE (t) == ADDR_EXPR
3116 && (CONSTANT_CLASS_P (TREE_OPERAND (t, 0))
3117 || decl_address_invariant_p (TREE_OPERAND (t, 0)))));
3121 /* Given a memory reference expression T, return its base address.
3122 The base address of a memory reference expression is the main
3123 object being referenced. For instance, the base address for
3124 'array[i].fld[j]' is 'array'. You can think of this as stripping
3125 away the offset part from a memory address.
3127 This function calls handled_component_p to strip away all the inner
3128 parts of the memory reference until it reaches the base object. */
3131 get_base_address (tree t)
3133 while (handled_component_p (t))
3134 t = TREE_OPERAND (t, 0);
3136 if ((TREE_CODE (t) == MEM_REF
3137 || TREE_CODE (t) == TARGET_MEM_REF)
3138 && TREE_CODE (TREE_OPERAND (t, 0)) == ADDR_EXPR)
3139 t = TREE_OPERAND (TREE_OPERAND (t, 0), 0);
3141 if (TREE_CODE (t) == SSA_NAME
3143 || TREE_CODE (t) == STRING_CST
3144 || TREE_CODE (t) == CONSTRUCTOR
3145 || INDIRECT_REF_P (t)
3146 || TREE_CODE (t) == MEM_REF
3147 || TREE_CODE (t) == TARGET_MEM_REF)
3154 recalculate_side_effects (tree t)
3156 enum tree_code code = TREE_CODE (t);
3157 int len = TREE_OPERAND_LENGTH (t);
3160 switch (TREE_CODE_CLASS (code))
3162 case tcc_expression:
3168 case PREDECREMENT_EXPR:
3169 case PREINCREMENT_EXPR:
3170 case POSTDECREMENT_EXPR:
3171 case POSTINCREMENT_EXPR:
3172 /* All of these have side-effects, no matter what their
3181 case tcc_comparison: /* a comparison expression */
3182 case tcc_unary: /* a unary arithmetic expression */
3183 case tcc_binary: /* a binary arithmetic expression */
3184 case tcc_reference: /* a reference */
3185 case tcc_vl_exp: /* a function call */
3186 TREE_SIDE_EFFECTS (t) = TREE_THIS_VOLATILE (t);
3187 for (i = 0; i < len; ++i)
3189 tree op = TREE_OPERAND (t, i);
3190 if (op && TREE_SIDE_EFFECTS (op))
3191 TREE_SIDE_EFFECTS (t) = 1;
3196 /* No side-effects. */
3204 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
3205 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
3206 we failed to create one. */
3209 canonicalize_cond_expr_cond (tree t)
3211 /* Strip conversions around boolean operations. */
3212 if (CONVERT_EXPR_P (t)
3213 && (truth_value_p (TREE_CODE (TREE_OPERAND (t, 0)))
3214 || TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0)))
3216 t = TREE_OPERAND (t, 0);
3218 /* For !x use x == 0. */
3219 if (TREE_CODE (t) == TRUTH_NOT_EXPR)
3221 tree top0 = TREE_OPERAND (t, 0);
3222 t = build2 (EQ_EXPR, TREE_TYPE (t),
3223 top0, build_int_cst (TREE_TYPE (top0), 0));
3225 /* For cmp ? 1 : 0 use cmp. */
3226 else if (TREE_CODE (t) == COND_EXPR
3227 && COMPARISON_CLASS_P (TREE_OPERAND (t, 0))
3228 && integer_onep (TREE_OPERAND (t, 1))
3229 && integer_zerop (TREE_OPERAND (t, 2)))
3231 tree top0 = TREE_OPERAND (t, 0);
3232 t = build2 (TREE_CODE (top0), TREE_TYPE (t),
3233 TREE_OPERAND (top0, 0), TREE_OPERAND (top0, 1));
3236 if (is_gimple_condexpr (t))
3242 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
3243 the positions marked by the set ARGS_TO_SKIP. */
3246 gimple_call_copy_skip_args (gimple stmt, bitmap args_to_skip)
3249 int nargs = gimple_call_num_args (stmt);
3250 VEC(tree, heap) *vargs = VEC_alloc (tree, heap, nargs);
3253 for (i = 0; i < nargs; i++)
3254 if (!bitmap_bit_p (args_to_skip, i))
3255 VEC_quick_push (tree, vargs, gimple_call_arg (stmt, i));
3257 if (gimple_call_internal_p (stmt))
3258 new_stmt = gimple_build_call_internal_vec (gimple_call_internal_fn (stmt),
3261 new_stmt = gimple_build_call_vec (gimple_call_fn (stmt), vargs);
3262 VEC_free (tree, heap, vargs);
3263 if (gimple_call_lhs (stmt))
3264 gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt));
3266 gimple_set_vuse (new_stmt, gimple_vuse (stmt));
3267 gimple_set_vdef (new_stmt, gimple_vdef (stmt));
3269 gimple_set_block (new_stmt, gimple_block (stmt));
3270 if (gimple_has_location (stmt))
3271 gimple_set_location (new_stmt, gimple_location (stmt));
3272 gimple_call_copy_flags (new_stmt, stmt);
3273 gimple_call_set_chain (new_stmt, gimple_call_chain (stmt));
3275 gimple_set_modified (new_stmt, true);
3281 enum gtc_mode { GTC_MERGE = 0, GTC_DIAG = 1 };
3283 static hashval_t gimple_type_hash (const void *);
3285 /* Structure used to maintain a cache of some type pairs compared by
3286 gimple_types_compatible_p when comparing aggregate types. There are
3287 three possible values for SAME_P:
3289 -2: The pair (T1, T2) has just been inserted in the table.
3290 0: T1 and T2 are different types.
3291 1: T1 and T2 are the same type.
3293 The two elements in the SAME_P array are indexed by the comparison
3300 signed char same_p[2];
3302 typedef struct type_pair_d *type_pair_t;
3303 DEF_VEC_P(type_pair_t);
3304 DEF_VEC_ALLOC_P(type_pair_t,heap);
3306 #define GIMPLE_TYPE_PAIR_SIZE 16381
3307 struct type_pair_d *type_pair_cache;
3310 /* Lookup the pair of types T1 and T2 in *VISITED_P. Insert a new
3311 entry if none existed. */
3313 static inline type_pair_t
3314 lookup_type_pair (tree t1, tree t2)
3317 unsigned int uid1, uid2;
3319 if (type_pair_cache == NULL)
3320 type_pair_cache = XCNEWVEC (struct type_pair_d, GIMPLE_TYPE_PAIR_SIZE);
3322 if (TYPE_UID (t1) < TYPE_UID (t2))
3324 uid1 = TYPE_UID (t1);
3325 uid2 = TYPE_UID (t2);
3329 uid1 = TYPE_UID (t2);
3330 uid2 = TYPE_UID (t1);
3332 gcc_checking_assert (uid1 != uid2);
3334 /* iterative_hash_hashval_t imply an function calls.
3335 We know that UIDS are in limited range. */
3336 index = ((((unsigned HOST_WIDE_INT)uid1 << HOST_BITS_PER_WIDE_INT / 2) + uid2)
3337 % GIMPLE_TYPE_PAIR_SIZE);
3338 if (type_pair_cache [index].uid1 == uid1
3339 && type_pair_cache [index].uid2 == uid2)
3340 return &type_pair_cache[index];
3342 type_pair_cache [index].uid1 = uid1;
3343 type_pair_cache [index].uid2 = uid2;
3344 type_pair_cache [index].same_p[0] = -2;
3345 type_pair_cache [index].same_p[1] = -2;
3347 return &type_pair_cache[index];
3350 /* Per pointer state for the SCC finding. The on_sccstack flag
3351 is not strictly required, it is true when there is no hash value
3352 recorded for the type and false otherwise. But querying that
3357 unsigned int dfsnum;
3366 static unsigned int next_dfs_num;
3367 static unsigned int gtc_next_dfs_num;
3370 /* GIMPLE type merging cache. A direct-mapped cache based on TYPE_UID. */
3372 typedef struct GTY(()) gimple_type_leader_entry_s {
3375 } gimple_type_leader_entry;
3377 #define GIMPLE_TYPE_LEADER_SIZE 16381
3378 static GTY((deletable, length("GIMPLE_TYPE_LEADER_SIZE")))
3379 gimple_type_leader_entry *gimple_type_leader;
3381 /* Lookup an existing leader for T and return it or NULL_TREE, if
3382 there is none in the cache. */
3385 gimple_lookup_type_leader (tree t)
3387 gimple_type_leader_entry *leader;
3389 if (!gimple_type_leader)
3392 leader = &gimple_type_leader[TYPE_UID (t) % GIMPLE_TYPE_LEADER_SIZE];
3393 if (leader->type != t)
3396 return leader->leader;
3399 /* Return true if T1 and T2 have the same name. If FOR_COMPLETION_P is
3400 true then if any type has no name return false, otherwise return
3401 true if both types have no names. */
3404 compare_type_names_p (tree t1, tree t2)
3406 tree name1 = TYPE_NAME (t1);
3407 tree name2 = TYPE_NAME (t2);
3409 if (name1 && TREE_CODE (name1) == TYPE_DECL)
3410 name1 = DECL_NAME (name1);
3411 gcc_checking_assert (!name1 || TREE_CODE (name1) == IDENTIFIER_NODE);
3413 if (name2 && TREE_CODE (name2) == TYPE_DECL)
3414 name2 = DECL_NAME (name2);
3415 gcc_checking_assert (!name2 || TREE_CODE (name2) == IDENTIFIER_NODE);
3417 /* Identifiers can be compared with pointer equality rather
3418 than a string comparison. */
3425 /* Return true if the field decls F1 and F2 are at the same offset.
3427 This is intended to be used on GIMPLE types only. */
3430 gimple_compare_field_offset (tree f1, tree f2)
3432 if (DECL_OFFSET_ALIGN (f1) == DECL_OFFSET_ALIGN (f2))
3434 tree offset1 = DECL_FIELD_OFFSET (f1);
3435 tree offset2 = DECL_FIELD_OFFSET (f2);
3436 return ((offset1 == offset2
3437 /* Once gimplification is done, self-referential offsets are
3438 instantiated as operand #2 of the COMPONENT_REF built for
3439 each access and reset. Therefore, they are not relevant
3440 anymore and fields are interchangeable provided that they
3441 represent the same access. */
3442 || (TREE_CODE (offset1) == PLACEHOLDER_EXPR
3443 && TREE_CODE (offset2) == PLACEHOLDER_EXPR
3444 && (DECL_SIZE (f1) == DECL_SIZE (f2)
3445 || (TREE_CODE (DECL_SIZE (f1)) == PLACEHOLDER_EXPR
3446 && TREE_CODE (DECL_SIZE (f2)) == PLACEHOLDER_EXPR)
3447 || operand_equal_p (DECL_SIZE (f1), DECL_SIZE (f2), 0))
3448 && DECL_ALIGN (f1) == DECL_ALIGN (f2))
3449 || operand_equal_p (offset1, offset2, 0))
3450 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1),
3451 DECL_FIELD_BIT_OFFSET (f2)));
3454 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
3455 should be, so handle differing ones specially by decomposing
3456 the offset into a byte and bit offset manually. */
3457 if (host_integerp (DECL_FIELD_OFFSET (f1), 0)
3458 && host_integerp (DECL_FIELD_OFFSET (f2), 0))
3460 unsigned HOST_WIDE_INT byte_offset1, byte_offset2;
3461 unsigned HOST_WIDE_INT bit_offset1, bit_offset2;
3462 bit_offset1 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1));
3463 byte_offset1 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1))
3464 + bit_offset1 / BITS_PER_UNIT);
3465 bit_offset2 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2));
3466 byte_offset2 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2))
3467 + bit_offset2 / BITS_PER_UNIT);
3468 if (byte_offset1 != byte_offset2)
3470 return bit_offset1 % BITS_PER_UNIT == bit_offset2 % BITS_PER_UNIT;
3477 gimple_types_compatible_p_1 (tree, tree, type_pair_t,
3478 VEC(type_pair_t, heap) **,
3479 struct pointer_map_t *, struct obstack *);
3481 /* DFS visit the edge from the callers type pair with state *STATE to
3482 the pair T1, T2 while operating in FOR_MERGING_P mode.
3483 Update the merging status if it is not part of the SCC containing the
3484 callers pair and return it.
3485 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3488 gtc_visit (tree t1, tree t2,
3490 VEC(type_pair_t, heap) **sccstack,
3491 struct pointer_map_t *sccstate,
3492 struct obstack *sccstate_obstack)
3494 struct sccs *cstate = NULL;
3497 tree leader1, leader2;
3499 /* Check first for the obvious case of pointer identity. */
3503 /* Check that we have two types to compare. */
3504 if (t1 == NULL_TREE || t2 == NULL_TREE)
3507 /* Can't be the same type if the types don't have the same code. */
3508 if (TREE_CODE (t1) != TREE_CODE (t2))
3511 /* Can't be the same type if they have different CV qualifiers. */
3512 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
3515 if (TREE_ADDRESSABLE (t1) != TREE_ADDRESSABLE (t2))
3518 /* Void types and nullptr types are always the same. */
3519 if (TREE_CODE (t1) == VOID_TYPE
3520 || TREE_CODE (t1) == NULLPTR_TYPE)
3523 /* Can't be the same type if they have different alignment or mode. */
3524 if (TYPE_ALIGN (t1) != TYPE_ALIGN (t2)
3525 || TYPE_MODE (t1) != TYPE_MODE (t2))
3528 /* Do some simple checks before doing three hashtable queries. */
3529 if (INTEGRAL_TYPE_P (t1)
3530 || SCALAR_FLOAT_TYPE_P (t1)
3531 || FIXED_POINT_TYPE_P (t1)
3532 || TREE_CODE (t1) == VECTOR_TYPE
3533 || TREE_CODE (t1) == COMPLEX_TYPE
3534 || TREE_CODE (t1) == OFFSET_TYPE
3535 || POINTER_TYPE_P (t1))
3537 /* Can't be the same type if they have different sign or precision. */
3538 if (TYPE_PRECISION (t1) != TYPE_PRECISION (t2)
3539 || TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2))
3542 if (TREE_CODE (t1) == INTEGER_TYPE
3543 && (TYPE_IS_SIZETYPE (t1) != TYPE_IS_SIZETYPE (t2)
3544 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)))
3547 /* That's all we need to check for float and fixed-point types. */
3548 if (SCALAR_FLOAT_TYPE_P (t1)
3549 || FIXED_POINT_TYPE_P (t1))
3552 /* For other types fall thru to more complex checks. */
3555 /* If the types have been previously registered and found equal
3557 leader1 = gimple_lookup_type_leader (t1);
3558 leader2 = gimple_lookup_type_leader (t2);
3561 || (leader1 && leader1 == leader2))
3564 /* If the hash values of t1 and t2 are different the types can't
3565 possibly be the same. This helps keeping the type-pair hashtable
3566 small, only tracking comparisons for hash collisions. */
3567 if (gimple_type_hash (t1) != gimple_type_hash (t2))
3570 /* Allocate a new cache entry for this comparison. */
3571 p = lookup_type_pair (t1, t2);
3572 if (p->same_p[GTC_MERGE] == 0 || p->same_p[GTC_MERGE] == 1)
3574 /* We have already decided whether T1 and T2 are the
3575 same, return the cached result. */
3576 return p->same_p[GTC_MERGE] == 1;
3579 if ((slot = pointer_map_contains (sccstate, p)) != NULL)
3580 cstate = (struct sccs *)*slot;
3581 /* Not yet visited. DFS recurse. */
3584 gimple_types_compatible_p_1 (t1, t2, p,
3585 sccstack, sccstate, sccstate_obstack);
3586 cstate = (struct sccs *)* pointer_map_contains (sccstate, p);
3587 state->low = MIN (state->low, cstate->low);
3589 /* If the type is still on the SCC stack adjust the parents low. */
3590 if (cstate->dfsnum < state->dfsnum
3591 && cstate->on_sccstack)
3592 state->low = MIN (cstate->dfsnum, state->low);
3594 /* Return the current lattice value. We start with an equality
3595 assumption so types part of a SCC will be optimistically
3596 treated equal unless proven otherwise. */
3597 return cstate->u.same_p;
3600 /* Worker for gimple_types_compatible.
3601 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3604 gimple_types_compatible_p_1 (tree t1, tree t2, type_pair_t p,
3605 VEC(type_pair_t, heap) **sccstack,
3606 struct pointer_map_t *sccstate,
3607 struct obstack *sccstate_obstack)
3611 gcc_assert (p->same_p[GTC_MERGE] == -2);
3613 state = XOBNEW (sccstate_obstack, struct sccs);
3614 *pointer_map_insert (sccstate, p) = state;
3616 VEC_safe_push (type_pair_t, heap, *sccstack, p);
3617 state->dfsnum = gtc_next_dfs_num++;
3618 state->low = state->dfsnum;
3619 state->on_sccstack = true;
3620 /* Start with an equality assumption. As we DFS recurse into child
3621 SCCs this assumption may get revisited. */
3622 state->u.same_p = 1;
3624 /* The struct tags shall compare equal. */
3625 if (!compare_type_names_p (t1, t2))
3626 goto different_types;
3628 /* If their attributes are not the same they can't be the same type. */
3629 if (!attribute_list_equal (TYPE_ATTRIBUTES (t1), TYPE_ATTRIBUTES (t2)))
3630 goto different_types;
3632 /* Do type-specific comparisons. */
3633 switch (TREE_CODE (t1))
3637 if (!gtc_visit (TREE_TYPE (t1), TREE_TYPE (t2),
3638 state, sccstack, sccstate, sccstate_obstack))
3639 goto different_types;
3643 /* Array types are the same if the element types are the same and
3644 the number of elements are the same. */
3645 if (!gtc_visit (TREE_TYPE (t1), TREE_TYPE (t2),
3646 state, sccstack, sccstate, sccstate_obstack)
3647 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)
3648 || TYPE_NONALIASED_COMPONENT (t1) != TYPE_NONALIASED_COMPONENT (t2))
3649 goto different_types;
3652 tree i1 = TYPE_DOMAIN (t1);
3653 tree i2 = TYPE_DOMAIN (t2);
3655 /* For an incomplete external array, the type domain can be
3656 NULL_TREE. Check this condition also. */
3657 if (i1 == NULL_TREE && i2 == NULL_TREE)
3659 else if (i1 == NULL_TREE || i2 == NULL_TREE)
3660 goto different_types;
3661 /* If for a complete array type the possibly gimplified sizes
3662 are different the types are different. */
3663 else if (((TYPE_SIZE (i1) != NULL) ^ (TYPE_SIZE (i2) != NULL))
3666 && !operand_equal_p (TYPE_SIZE (i1), TYPE_SIZE (i2), 0)))
3667 goto different_types;
3670 tree min1 = TYPE_MIN_VALUE (i1);
3671 tree min2 = TYPE_MIN_VALUE (i2);
3672 tree max1 = TYPE_MAX_VALUE (i1);
3673 tree max2 = TYPE_MAX_VALUE (i2);
3675 /* The minimum/maximum values have to be the same. */
3678 && ((TREE_CODE (min1) == PLACEHOLDER_EXPR
3679 && TREE_CODE (min2) == PLACEHOLDER_EXPR)
3680 || operand_equal_p (min1, min2, 0))))
3683 && ((TREE_CODE (max1) == PLACEHOLDER_EXPR
3684 && TREE_CODE (max2) == PLACEHOLDER_EXPR)
3685 || operand_equal_p (max1, max2, 0)))))
3688 goto different_types;
3693 /* Method types should belong to the same class. */
3694 if (!gtc_visit (TYPE_METHOD_BASETYPE (t1), TYPE_METHOD_BASETYPE (t2),
3695 state, sccstack, sccstate, sccstate_obstack))
3696 goto different_types;
3701 /* Function types are the same if the return type and arguments types
3703 if (!gtc_visit (TREE_TYPE (t1), TREE_TYPE (t2),
3704 state, sccstack, sccstate, sccstate_obstack))
3705 goto different_types;
3707 if (!comp_type_attributes (t1, t2))
3708 goto different_types;
3710 if (TYPE_ARG_TYPES (t1) == TYPE_ARG_TYPES (t2))
3714 tree parms1, parms2;
3716 for (parms1 = TYPE_ARG_TYPES (t1), parms2 = TYPE_ARG_TYPES (t2);
3718 parms1 = TREE_CHAIN (parms1), parms2 = TREE_CHAIN (parms2))
3720 if (!gtc_visit (TREE_VALUE (parms1), TREE_VALUE (parms2),
3721 state, sccstack, sccstate, sccstate_obstack))
3722 goto different_types;
3725 if (parms1 || parms2)
3726 goto different_types;
3733 if (!gtc_visit (TREE_TYPE (t1), TREE_TYPE (t2),
3734 state, sccstack, sccstate, sccstate_obstack)
3735 || !gtc_visit (TYPE_OFFSET_BASETYPE (t1),
3736 TYPE_OFFSET_BASETYPE (t2),
3737 state, sccstack, sccstate, sccstate_obstack))
3738 goto different_types;
3744 case REFERENCE_TYPE:
3746 /* If the two pointers have different ref-all attributes,
3747 they can't be the same type. */
3748 if (TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
3749 goto different_types;
3751 /* Otherwise, pointer and reference types are the same if the
3752 pointed-to types are the same. */
3753 if (gtc_visit (TREE_TYPE (t1), TREE_TYPE (t2),
3754 state, sccstack, sccstate, sccstate_obstack))
3757 goto different_types;
3763 tree min1 = TYPE_MIN_VALUE (t1);
3764 tree max1 = TYPE_MAX_VALUE (t1);
3765 tree min2 = TYPE_MIN_VALUE (t2);
3766 tree max2 = TYPE_MAX_VALUE (t2);
3767 bool min_equal_p = false;
3768 bool max_equal_p = false;
3770 /* If either type has a minimum value, the other type must
3772 if (min1 == NULL_TREE && min2 == NULL_TREE)
3774 else if (min1 && min2 && operand_equal_p (min1, min2, 0))
3777 /* Likewise, if either type has a maximum value, the other
3778 type must have the same. */
3779 if (max1 == NULL_TREE && max2 == NULL_TREE)
3781 else if (max1 && max2 && operand_equal_p (max1, max2, 0))
3784 if (!min_equal_p || !max_equal_p)
3785 goto different_types;
3792 /* FIXME lto, we cannot check bounds on enumeral types because
3793 different front ends will produce different values.
3794 In C, enumeral types are integers, while in C++ each element
3795 will have its own symbolic value. We should decide how enums
3796 are to be represented in GIMPLE and have each front end lower
3800 /* For enumeral types, all the values must be the same. */
3801 if (TYPE_VALUES (t1) == TYPE_VALUES (t2))
3804 for (v1 = TYPE_VALUES (t1), v2 = TYPE_VALUES (t2);
3806 v1 = TREE_CHAIN (v1), v2 = TREE_CHAIN (v2))
3808 tree c1 = TREE_VALUE (v1);
3809 tree c2 = TREE_VALUE (v2);
3811 if (TREE_CODE (c1) == CONST_DECL)
3812 c1 = DECL_INITIAL (c1);
3814 if (TREE_CODE (c2) == CONST_DECL)
3815 c2 = DECL_INITIAL (c2);
3817 if (tree_int_cst_equal (c1, c2) != 1)
3818 goto different_types;
3820 if (TREE_PURPOSE (v1) != TREE_PURPOSE (v2))
3821 goto different_types;
3824 /* If one enumeration has more values than the other, they
3825 are not the same. */
3827 goto different_types;
3834 case QUAL_UNION_TYPE:
3838 /* For aggregate types, all the fields must be the same. */
3839 for (f1 = TYPE_FIELDS (t1), f2 = TYPE_FIELDS (t2);
3841 f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
3843 /* Different field kinds are not compatible. */
3844 if (TREE_CODE (f1) != TREE_CODE (f2))
3845 goto different_types;
3846 /* Field decls must have the same name and offset. */
3847 if (TREE_CODE (f1) == FIELD_DECL
3848 && (DECL_NONADDRESSABLE_P (f1) != DECL_NONADDRESSABLE_P (f2)
3849 || !gimple_compare_field_offset (f1, f2)))
3850 goto different_types;
3851 /* All entities should have the same name and type. */
3852 if (DECL_NAME (f1) != DECL_NAME (f2)
3853 || !gtc_visit (TREE_TYPE (f1), TREE_TYPE (f2),
3854 state, sccstack, sccstate, sccstate_obstack))
3855 goto different_types;
3858 /* If one aggregate has more fields than the other, they
3859 are not the same. */
3861 goto different_types;
3870 /* Common exit path for types that are not compatible. */
3872 state->u.same_p = 0;
3875 /* Common exit path for types that are compatible. */
3877 gcc_assert (state->u.same_p == 1);
3880 if (state->low == state->dfsnum)
3884 /* Pop off the SCC and set its cache values to the final
3885 comparison result. */
3888 struct sccs *cstate;
3889 x = VEC_pop (type_pair_t, *sccstack);
3890 cstate = (struct sccs *)*pointer_map_contains (sccstate, x);
3891 cstate->on_sccstack = false;
3892 x->same_p[GTC_MERGE] = state->u.same_p;
3897 return state->u.same_p;
3900 /* Return true iff T1 and T2 are structurally identical. When
3901 FOR_MERGING_P is true the an incomplete type and a complete type
3902 are considered different, otherwise they are considered compatible. */
3905 gimple_types_compatible_p (tree t1, tree t2)
3907 VEC(type_pair_t, heap) *sccstack = NULL;
3908 struct pointer_map_t *sccstate;
3909 struct obstack sccstate_obstack;
3910 type_pair_t p = NULL;
3912 tree leader1, leader2;
3914 /* Before starting to set up the SCC machinery handle simple cases. */
3916 /* Check first for the obvious case of pointer identity. */
3920 /* Check that we have two types to compare. */
3921 if (t1 == NULL_TREE || t2 == NULL_TREE)
3924 /* Can't be the same type if the types don't have the same code. */
3925 if (TREE_CODE (t1) != TREE_CODE (t2))
3928 /* Can't be the same type if they have different CV qualifiers. */
3929 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
3932 if (TREE_ADDRESSABLE (t1) != TREE_ADDRESSABLE (t2))
3935 /* Void types and nullptr types are always the same. */
3936 if (TREE_CODE (t1) == VOID_TYPE
3937 || TREE_CODE (t1) == NULLPTR_TYPE)
3940 /* Can't be the same type if they have different alignment or mode. */
3941 if (TYPE_ALIGN (t1) != TYPE_ALIGN (t2)
3942 || TYPE_MODE (t1) != TYPE_MODE (t2))
3945 /* Do some simple checks before doing three hashtable queries. */
3946 if (INTEGRAL_TYPE_P (t1)
3947 || SCALAR_FLOAT_TYPE_P (t1)
3948 || FIXED_POINT_TYPE_P (t1)
3949 || TREE_CODE (t1) == VECTOR_TYPE
3950 || TREE_CODE (t1) == COMPLEX_TYPE
3951 || TREE_CODE (t1) == OFFSET_TYPE
3952 || POINTER_TYPE_P (t1))
3954 /* Can't be the same type if they have different sign or precision. */
3955 if (TYPE_PRECISION (t1) != TYPE_PRECISION (t2)
3956 || TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2))
3959 if (TREE_CODE (t1) == INTEGER_TYPE
3960 && (TYPE_IS_SIZETYPE (t1) != TYPE_IS_SIZETYPE (t2)
3961 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)))
3964 /* That's all we need to check for float and fixed-point types. */
3965 if (SCALAR_FLOAT_TYPE_P (t1)
3966 || FIXED_POINT_TYPE_P (t1))
3969 /* For other types fall thru to more complex checks. */
3972 /* If the types have been previously registered and found equal
3974 leader1 = gimple_lookup_type_leader (t1);
3975 leader2 = gimple_lookup_type_leader (t2);
3978 || (leader1 && leader1 == leader2))
3981 /* If the hash values of t1 and t2 are different the types can't
3982 possibly be the same. This helps keeping the type-pair hashtable
3983 small, only tracking comparisons for hash collisions. */
3984 if (gimple_type_hash (t1) != gimple_type_hash (t2))
3987 /* If we've visited this type pair before (in the case of aggregates
3988 with self-referential types), and we made a decision, return it. */
3989 p = lookup_type_pair (t1, t2);
3990 if (p->same_p[GTC_MERGE] == 0 || p->same_p[GTC_MERGE] == 1)
3992 /* We have already decided whether T1 and T2 are the
3993 same, return the cached result. */
3994 return p->same_p[GTC_MERGE] == 1;
3997 /* Now set up the SCC machinery for the comparison. */
3998 gtc_next_dfs_num = 1;
3999 sccstate = pointer_map_create ();
4000 gcc_obstack_init (&sccstate_obstack);
4001 res = gimple_types_compatible_p_1 (t1, t2, p,
4002 &sccstack, sccstate, &sccstate_obstack);
4003 VEC_free (type_pair_t, heap, sccstack);
4004 pointer_map_destroy (sccstate);
4005 obstack_free (&sccstate_obstack, NULL);
4012 iterative_hash_gimple_type (tree, hashval_t, VEC(tree, heap) **,
4013 struct pointer_map_t *, struct obstack *);
4015 /* DFS visit the edge from the callers type with state *STATE to T.
4016 Update the callers type hash V with the hash for T if it is not part
4017 of the SCC containing the callers type and return it.
4018 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
4021 visit (tree t, struct sccs *state, hashval_t v,
4022 VEC (tree, heap) **sccstack,
4023 struct pointer_map_t *sccstate,
4024 struct obstack *sccstate_obstack)
4026 struct sccs *cstate = NULL;
4027 struct tree_int_map m;
4030 /* If there is a hash value recorded for this type then it can't
4031 possibly be part of our parent SCC. Simply mix in its hash. */
4033 if ((slot = htab_find_slot (type_hash_cache, &m, NO_INSERT))
4035 return iterative_hash_hashval_t (((struct tree_int_map *) *slot)->to, v);
4037 if ((slot = pointer_map_contains (sccstate, t)) != NULL)
4038 cstate = (struct sccs *)*slot;
4042 /* Not yet visited. DFS recurse. */
4043 tem = iterative_hash_gimple_type (t, v,
4044 sccstack, sccstate, sccstate_obstack);
4046 cstate = (struct sccs *)* pointer_map_contains (sccstate, t);
4047 state->low = MIN (state->low, cstate->low);
4048 /* If the type is no longer on the SCC stack and thus is not part
4049 of the parents SCC mix in its hash value. Otherwise we will
4050 ignore the type for hashing purposes and return the unaltered
4052 if (!cstate->on_sccstack)
4055 if (cstate->dfsnum < state->dfsnum
4056 && cstate->on_sccstack)
4057 state->low = MIN (cstate->dfsnum, state->low);
4059 /* We are part of our parents SCC, skip this type during hashing
4060 and return the unaltered hash value. */
4064 /* Hash NAME with the previous hash value V and return it. */
4067 iterative_hash_name (tree name, hashval_t v)
4071 if (TREE_CODE (name) == TYPE_DECL)
4072 name = DECL_NAME (name);
4075 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
4076 return iterative_hash_object (IDENTIFIER_HASH_VALUE (name), v);
4079 /* A type, hashvalue pair for sorting SCC members. */
4081 struct type_hash_pair {
4086 /* Compare two type, hashvalue pairs. */
4089 type_hash_pair_compare (const void *p1_, const void *p2_)
4091 const struct type_hash_pair *p1 = (const struct type_hash_pair *) p1_;
4092 const struct type_hash_pair *p2 = (const struct type_hash_pair *) p2_;
4093 if (p1->hash < p2->hash)
4095 else if (p1->hash > p2->hash)
4100 /* Returning a hash value for gimple type TYPE combined with VAL.
4101 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done.
4103 To hash a type we end up hashing in types that are reachable.
4104 Through pointers we can end up with cycles which messes up the
4105 required property that we need to compute the same hash value
4106 for structurally equivalent types. To avoid this we have to
4107 hash all types in a cycle (the SCC) in a commutative way. The
4108 easiest way is to not mix in the hashes of the SCC members at
4109 all. To make this work we have to delay setting the hash
4110 values of the SCC until it is complete. */
4113 iterative_hash_gimple_type (tree type, hashval_t val,
4114 VEC(tree, heap) **sccstack,
4115 struct pointer_map_t *sccstate,
4116 struct obstack *sccstate_obstack)
4122 /* Not visited during this DFS walk. */
4123 gcc_checking_assert (!pointer_map_contains (sccstate, type));
4124 state = XOBNEW (sccstate_obstack, struct sccs);
4125 *pointer_map_insert (sccstate, type) = state;
4127 VEC_safe_push (tree, heap, *sccstack, type);
4128 state->dfsnum = next_dfs_num++;
4129 state->low = state->dfsnum;
4130 state->on_sccstack = true;
4132 /* Combine a few common features of types so that types are grouped into
4133 smaller sets; when searching for existing matching types to merge,
4134 only existing types having the same features as the new type will be
4136 v = iterative_hash_name (TYPE_NAME (type), 0);
4137 v = iterative_hash_hashval_t (TREE_CODE (type), v);
4138 v = iterative_hash_hashval_t (TYPE_QUALS (type), v);
4139 v = iterative_hash_hashval_t (TREE_ADDRESSABLE (type), v);
4141 /* Do not hash the types size as this will cause differences in
4142 hash values for the complete vs. the incomplete type variant. */
4144 /* Incorporate common features of numerical types. */
4145 if (INTEGRAL_TYPE_P (type)
4146 || SCALAR_FLOAT_TYPE_P (type)
4147 || FIXED_POINT_TYPE_P (type))
4149 v = iterative_hash_hashval_t (TYPE_PRECISION (type), v);
4150 v = iterative_hash_hashval_t (TYPE_MODE (type), v);
4151 v = iterative_hash_hashval_t (TYPE_UNSIGNED (type), v);
4154 /* For pointer and reference types, fold in information about the type
4156 if (POINTER_TYPE_P (type))
4157 v = visit (TREE_TYPE (type), state, v,
4158 sccstack, sccstate, sccstate_obstack);
4160 /* For integer types hash the types min/max values and the string flag. */
4161 if (TREE_CODE (type) == INTEGER_TYPE)
4163 /* OMP lowering can introduce error_mark_node in place of
4164 random local decls in types. */
4165 if (TYPE_MIN_VALUE (type) != error_mark_node)
4166 v = iterative_hash_expr (TYPE_MIN_VALUE (type), v);
4167 if (TYPE_MAX_VALUE (type) != error_mark_node)
4168 v = iterative_hash_expr (TYPE_MAX_VALUE (type), v);
4169 v = iterative_hash_hashval_t (TYPE_STRING_FLAG (type), v);
4172 /* For array types hash their domain and the string flag. */
4173 if (TREE_CODE (type) == ARRAY_TYPE
4174 && TYPE_DOMAIN (type))
4176 v = iterative_hash_hashval_t (TYPE_STRING_FLAG (type), v);
4177 v = visit (TYPE_DOMAIN (type), state, v,
4178 sccstack, sccstate, sccstate_obstack);
4181 /* Recurse for aggregates with a single element type. */
4182 if (TREE_CODE (type) == ARRAY_TYPE
4183 || TREE_CODE (type) == COMPLEX_TYPE
4184 || TREE_CODE (type) == VECTOR_TYPE)
4185 v = visit (TREE_TYPE (type), state, v,
4186 sccstack, sccstate, sccstate_obstack);
4188 /* Incorporate function return and argument types. */
4189 if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
4194 /* For method types also incorporate their parent class. */
4195 if (TREE_CODE (type) == METHOD_TYPE)
4196 v = visit (TYPE_METHOD_BASETYPE (type), state, v,
4197 sccstack, sccstate, sccstate_obstack);
4199 /* Check result and argument types. */
4200 v = visit (TREE_TYPE (type), state, v,
4201 sccstack, sccstate, sccstate_obstack);
4202 for (p = TYPE_ARG_TYPES (type), na = 0; p; p = TREE_CHAIN (p))
4204 v = visit (TREE_VALUE (p), state, v,
4205 sccstack, sccstate, sccstate_obstack);
4209 v = iterative_hash_hashval_t (na, v);
4212 if (TREE_CODE (type) == RECORD_TYPE
4213 || TREE_CODE (type) == UNION_TYPE
4214 || TREE_CODE (type) == QUAL_UNION_TYPE)
4219 for (f = TYPE_FIELDS (type), nf = 0; f; f = TREE_CHAIN (f))
4221 v = iterative_hash_name (DECL_NAME (f), v);
4222 v = visit (TREE_TYPE (f), state, v,
4223 sccstack, sccstate, sccstate_obstack);
4227 v = iterative_hash_hashval_t (nf, v);
4230 /* Record hash for us. */
4233 /* See if we found an SCC. */
4234 if (state->low == state->dfsnum)
4237 struct tree_int_map *m;
4239 /* Pop off the SCC and set its hash values. */
4240 x = VEC_pop (tree, *sccstack);
4241 /* Optimize SCC size one. */
4244 state->on_sccstack = false;
4245 m = ggc_alloc_cleared_tree_int_map ();
4248 slot = htab_find_slot (type_hash_cache, m, INSERT);
4249 gcc_assert (!*slot);
4254 struct sccs *cstate;
4255 unsigned first, i, size, j;
4256 struct type_hash_pair *pairs;
4257 /* Pop off the SCC and build an array of type, hash pairs. */
4258 first = VEC_length (tree, *sccstack) - 1;
4259 while (VEC_index (tree, *sccstack, first) != type)
4261 size = VEC_length (tree, *sccstack) - first + 1;
4262 pairs = XALLOCAVEC (struct type_hash_pair, size);
4264 cstate = (struct sccs *)*pointer_map_contains (sccstate, x);
4265 cstate->on_sccstack = false;
4267 pairs[i].hash = cstate->u.hash;
4270 x = VEC_pop (tree, *sccstack);
4271 cstate = (struct sccs *)*pointer_map_contains (sccstate, x);
4272 cstate->on_sccstack = false;
4275 pairs[i].hash = cstate->u.hash;
4278 gcc_assert (i + 1 == size);
4279 /* Sort the arrays of type, hash pairs so that when we mix in
4280 all members of the SCC the hash value becomes independent on
4281 the order we visited the SCC. Disregard hashes equal to
4282 the hash of the type we mix into because we cannot guarantee
4283 a stable sort for those across different TUs. */
4284 qsort (pairs, size, sizeof (struct type_hash_pair),
4285 type_hash_pair_compare);
4286 for (i = 0; i < size; ++i)
4289 m = ggc_alloc_cleared_tree_int_map ();
4290 m->base.from = pairs[i].type;
4291 hash = pairs[i].hash;
4292 /* Skip same hashes. */
4293 for (j = i + 1; j < size && pairs[j].hash == pairs[i].hash; ++j)
4295 for (; j < size; ++j)
4296 hash = iterative_hash_hashval_t (pairs[j].hash, hash);
4297 for (j = 0; pairs[j].hash != pairs[i].hash; ++j)
4298 hash = iterative_hash_hashval_t (pairs[j].hash, hash);
4300 if (pairs[i].type == type)
4302 slot = htab_find_slot (type_hash_cache, m, INSERT);
4303 gcc_assert (!*slot);
4309 return iterative_hash_hashval_t (v, val);
4313 /* Returns a hash value for P (assumed to be a type). The hash value
4314 is computed using some distinguishing features of the type. Note
4315 that we cannot use pointer hashing here as we may be dealing with
4316 two distinct instances of the same type.
4318 This function should produce the same hash value for two compatible
4319 types according to gimple_types_compatible_p. */
4322 gimple_type_hash (const void *p)
4324 const_tree t = (const_tree) p;
4325 VEC(tree, heap) *sccstack = NULL;
4326 struct pointer_map_t *sccstate;
4327 struct obstack sccstate_obstack;
4330 struct tree_int_map m;
4332 if (type_hash_cache == NULL)
4333 type_hash_cache = htab_create_ggc (512, tree_int_map_hash,
4334 tree_int_map_eq, NULL);
4336 m.base.from = CONST_CAST_TREE (t);
4337 if ((slot = htab_find_slot (type_hash_cache, &m, NO_INSERT))
4339 return iterative_hash_hashval_t (((struct tree_int_map *) *slot)->to, 0);
4341 /* Perform a DFS walk and pre-hash all reachable types. */
4343 sccstate = pointer_map_create ();
4344 gcc_obstack_init (&sccstate_obstack);
4345 val = iterative_hash_gimple_type (CONST_CAST_TREE (t), 0,
4346 &sccstack, sccstate, &sccstate_obstack);
4347 VEC_free (tree, heap, sccstack);
4348 pointer_map_destroy (sccstate);
4349 obstack_free (&sccstate_obstack, NULL);
4354 /* Returning a hash value for gimple type TYPE combined with VAL.
4356 The hash value returned is equal for types considered compatible
4357 by gimple_canonical_types_compatible_p. */
4360 iterative_hash_canonical_type (tree type, hashval_t val)
4364 struct tree_int_map *mp, m;
4367 if ((slot = htab_find_slot (canonical_type_hash_cache, &m, INSERT))
4369 return iterative_hash_hashval_t (((struct tree_int_map *) *slot)->to, val);
4371 /* Combine a few common features of types so that types are grouped into
4372 smaller sets; when searching for existing matching types to merge,
4373 only existing types having the same features as the new type will be
4375 v = iterative_hash_hashval_t (TREE_CODE (type), 0);
4376 v = iterative_hash_hashval_t (TREE_ADDRESSABLE (type), v);
4377 v = iterative_hash_hashval_t (TYPE_ALIGN (type), v);
4378 v = iterative_hash_hashval_t (TYPE_MODE (type), v);
4380 /* Incorporate common features of numerical types. */
4381 if (INTEGRAL_TYPE_P (type)
4382 || SCALAR_FLOAT_TYPE_P (type)
4383 || FIXED_POINT_TYPE_P (type)
4384 || TREE_CODE (type) == VECTOR_TYPE
4385 || TREE_CODE (type) == COMPLEX_TYPE
4386 || TREE_CODE (type) == OFFSET_TYPE
4387 || POINTER_TYPE_P (type))
4389 v = iterative_hash_hashval_t (TYPE_PRECISION (type), v);
4390 v = iterative_hash_hashval_t (TYPE_UNSIGNED (type), v);
4393 /* For pointer and reference types, fold in information about the type
4394 pointed to but do not recurse to the pointed-to type. */
4395 if (POINTER_TYPE_P (type))
4397 v = iterative_hash_hashval_t (TYPE_REF_CAN_ALIAS_ALL (type), v);
4398 v = iterative_hash_hashval_t (TYPE_ADDR_SPACE (TREE_TYPE (type)), v);
4399 v = iterative_hash_hashval_t (TYPE_RESTRICT (type), v);
4400 v = iterative_hash_hashval_t (TREE_CODE (TREE_TYPE (type)), v);
4403 /* For integer types hash the types min/max values and the string flag. */
4404 if (TREE_CODE (type) == INTEGER_TYPE)
4406 v = iterative_hash_hashval_t (TYPE_STRING_FLAG (type), v);
4407 v = iterative_hash_hashval_t (TYPE_IS_SIZETYPE (type), v);
4410 /* For array types hash their domain and the string flag. */
4411 if (TREE_CODE (type) == ARRAY_TYPE
4412 && TYPE_DOMAIN (type))
4414 v = iterative_hash_hashval_t (TYPE_STRING_FLAG (type), v);
4415 v = iterative_hash_canonical_type (TYPE_DOMAIN (type), v);
4418 /* Recurse for aggregates with a single element type. */
4419 if (TREE_CODE (type) == ARRAY_TYPE
4420 || TREE_CODE (type) == COMPLEX_TYPE
4421 || TREE_CODE (type) == VECTOR_TYPE)
4422 v = iterative_hash_canonical_type (TREE_TYPE (type), v);
4424 /* Incorporate function return and argument types. */
4425 if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
4430 /* For method types also incorporate their parent class. */
4431 if (TREE_CODE (type) == METHOD_TYPE)
4432 v = iterative_hash_canonical_type (TYPE_METHOD_BASETYPE (type), v);
4434 v = iterative_hash_canonical_type (TREE_TYPE (type), v);
4436 for (p = TYPE_ARG_TYPES (type), na = 0; p; p = TREE_CHAIN (p))
4438 v = iterative_hash_canonical_type (TREE_VALUE (p), v);
4442 v = iterative_hash_hashval_t (na, v);
4445 if (TREE_CODE (type) == RECORD_TYPE
4446 || TREE_CODE (type) == UNION_TYPE
4447 || TREE_CODE (type) == QUAL_UNION_TYPE)
4452 for (f = TYPE_FIELDS (type), nf = 0; f; f = TREE_CHAIN (f))
4453 if (TREE_CODE (f) == FIELD_DECL)
4455 v = iterative_hash_canonical_type (TREE_TYPE (f), v);
4459 v = iterative_hash_hashval_t (nf, v);
4462 /* Cache the just computed hash value. */
4463 mp = ggc_alloc_cleared_tree_int_map ();
4464 mp->base.from = type;
4466 *slot = (void *) mp;
4468 return iterative_hash_hashval_t (v, val);
4472 gimple_canonical_type_hash (const void *p)
4474 if (canonical_type_hash_cache == NULL)
4475 canonical_type_hash_cache = htab_create_ggc (512, tree_int_map_hash,
4476 tree_int_map_eq, NULL);
4478 return iterative_hash_canonical_type (CONST_CAST_TREE ((const_tree) p), 0);
4482 /* Returns nonzero if P1 and P2 are equal. */
4485 gimple_type_eq (const void *p1, const void *p2)
4487 const_tree t1 = (const_tree) p1;
4488 const_tree t2 = (const_tree) p2;
4489 return gimple_types_compatible_p (CONST_CAST_TREE (t1),
4490 CONST_CAST_TREE (t2));
4494 /* Worker for gimple_register_type.
4495 Register type T in the global type table gimple_types.
4496 When REGISTERING_MV is false first recurse for the main variant of T. */
4499 gimple_register_type_1 (tree t, bool registering_mv)
4502 gimple_type_leader_entry *leader;
4504 /* If we registered this type before return the cached result. */
4505 leader = &gimple_type_leader[TYPE_UID (t) % GIMPLE_TYPE_LEADER_SIZE];
4506 if (leader->type == t)
4507 return leader->leader;
4509 /* Always register the main variant first. This is important so we
4510 pick up the non-typedef variants as canonical, otherwise we'll end
4511 up taking typedef ids for structure tags during comparison.
4512 It also makes sure that main variants will be merged to main variants.
4513 As we are operating on a possibly partially fixed up type graph
4514 do not bother to recurse more than once, otherwise we may end up
4516 If we are registering a main variant it will either remain its
4517 own main variant or it will be merged to something else in which
4518 case we do not care for the main variant leader. */
4520 && TYPE_MAIN_VARIANT (t) != t)
4521 gimple_register_type_1 (TYPE_MAIN_VARIANT (t), true);
4523 /* See if we already have an equivalent type registered. */
4524 slot = htab_find_slot (gimple_types, t, INSERT);
4526 && *(tree *)slot != t)
4528 tree new_type = (tree) *((tree *) slot);
4530 leader->leader = new_type;
4534 /* If not, insert it to the cache and the hash. */
4541 /* Register type T in the global type table gimple_types.
4542 If another type T', compatible with T, already existed in
4543 gimple_types then return T', otherwise return T. This is used by
4544 LTO to merge identical types read from different TUs. */
4547 gimple_register_type (tree t)
4549 gcc_assert (TYPE_P (t));
4551 if (!gimple_type_leader)
4552 gimple_type_leader = ggc_alloc_cleared_vec_gimple_type_leader_entry_s
4553 (GIMPLE_TYPE_LEADER_SIZE);
4555 if (gimple_types == NULL)
4556 gimple_types = htab_create_ggc (16381, gimple_type_hash, gimple_type_eq, 0);
4558 return gimple_register_type_1 (t, false);
4561 /* The TYPE_CANONICAL merging machinery. It should closely resemble
4562 the middle-end types_compatible_p function. It needs to avoid
4563 claiming types are different for types that should be treated
4564 the same with respect to TBAA. Canonical types are also used
4565 for IL consistency checks via the useless_type_conversion_p
4566 predicate which does not handle all type kinds itself but falls
4567 back to pointer-comparison of TYPE_CANONICAL for aggregates
4570 /* Return true iff T1 and T2 are structurally identical for what
4571 TBAA is concerned. */
4574 gimple_canonical_types_compatible_p (tree t1, tree t2)
4576 /* Before starting to set up the SCC machinery handle simple cases. */
4578 /* Check first for the obvious case of pointer identity. */
4582 /* Check that we have two types to compare. */
4583 if (t1 == NULL_TREE || t2 == NULL_TREE)
4586 /* If the types have been previously registered and found equal
4588 if (TYPE_CANONICAL (t1)
4589 && TYPE_CANONICAL (t1) == TYPE_CANONICAL (t2))
4592 /* Can't be the same type if the types don't have the same code. */
4593 if (TREE_CODE (t1) != TREE_CODE (t2))
4596 if (TREE_ADDRESSABLE (t1) != TREE_ADDRESSABLE (t2))
4599 /* Qualifiers do not matter for canonical type comparison purposes. */
4601 /* Void types and nullptr types are always the same. */
4602 if (TREE_CODE (t1) == VOID_TYPE
4603 || TREE_CODE (t1) == NULLPTR_TYPE)
4606 /* Can't be the same type if they have different alignment, or mode. */
4607 if (TYPE_ALIGN (t1) != TYPE_ALIGN (t2)
4608 || TYPE_MODE (t1) != TYPE_MODE (t2))
4611 /* Non-aggregate types can be handled cheaply. */
4612 if (INTEGRAL_TYPE_P (t1)
4613 || SCALAR_FLOAT_TYPE_P (t1)
4614 || FIXED_POINT_TYPE_P (t1)
4615 || TREE_CODE (t1) == VECTOR_TYPE
4616 || TREE_CODE (t1) == COMPLEX_TYPE
4617 || TREE_CODE (t1) == OFFSET_TYPE
4618 || POINTER_TYPE_P (t1))
4620 /* Can't be the same type if they have different sign or precision. */
4621 if (TYPE_PRECISION (t1) != TYPE_PRECISION (t2)
4622 || TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2))
4625 if (TREE_CODE (t1) == INTEGER_TYPE
4626 && (TYPE_IS_SIZETYPE (t1) != TYPE_IS_SIZETYPE (t2)
4627 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)))
4630 /* For canonical type comparisons we do not want to build SCCs
4631 so we cannot compare pointed-to types. But we can, for now,
4632 require the same pointed-to type kind and match what
4633 useless_type_conversion_p would do. */
4634 if (POINTER_TYPE_P (t1))
4636 /* If the two pointers have different ref-all attributes,
4637 they can't be the same type. */
4638 if (TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
4641 if (TYPE_ADDR_SPACE (TREE_TYPE (t1))
4642 != TYPE_ADDR_SPACE (TREE_TYPE (t2)))
4645 if (TYPE_RESTRICT (t1) != TYPE_RESTRICT (t2))
4648 if (TREE_CODE (TREE_TYPE (t1)) != TREE_CODE (TREE_TYPE (t2)))
4652 /* Tail-recurse to components. */
4653 if (TREE_CODE (t1) == VECTOR_TYPE
4654 || TREE_CODE (t1) == COMPLEX_TYPE)
4655 return gimple_canonical_types_compatible_p (TREE_TYPE (t1),
4661 /* If their attributes are not the same they can't be the same type. */
4662 if (!attribute_list_equal (TYPE_ATTRIBUTES (t1), TYPE_ATTRIBUTES (t2)))
4665 /* Do type-specific comparisons. */
4666 switch (TREE_CODE (t1))
4669 /* Array types are the same if the element types are the same and
4670 the number of elements are the same. */
4671 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2))
4672 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)
4673 || TYPE_NONALIASED_COMPONENT (t1) != TYPE_NONALIASED_COMPONENT (t2))
4677 tree i1 = TYPE_DOMAIN (t1);
4678 tree i2 = TYPE_DOMAIN (t2);
4680 /* For an incomplete external array, the type domain can be
4681 NULL_TREE. Check this condition also. */
4682 if (i1 == NULL_TREE && i2 == NULL_TREE)
4684 else if (i1 == NULL_TREE || i2 == NULL_TREE)
4686 /* If for a complete array type the possibly gimplified sizes
4687 are different the types are different. */
4688 else if (((TYPE_SIZE (i1) != NULL) ^ (TYPE_SIZE (i2) != NULL))
4691 && !operand_equal_p (TYPE_SIZE (i1), TYPE_SIZE (i2), 0)))
4695 tree min1 = TYPE_MIN_VALUE (i1);
4696 tree min2 = TYPE_MIN_VALUE (i2);
4697 tree max1 = TYPE_MAX_VALUE (i1);
4698 tree max2 = TYPE_MAX_VALUE (i2);
4700 /* The minimum/maximum values have to be the same. */
4703 && ((TREE_CODE (min1) == PLACEHOLDER_EXPR
4704 && TREE_CODE (min2) == PLACEHOLDER_EXPR)
4705 || operand_equal_p (min1, min2, 0))))
4708 && ((TREE_CODE (max1) == PLACEHOLDER_EXPR
4709 && TREE_CODE (max2) == PLACEHOLDER_EXPR)
4710 || operand_equal_p (max1, max2, 0)))))
4718 /* Method types should belong to the same class. */
4719 if (!gimple_canonical_types_compatible_p
4720 (TYPE_METHOD_BASETYPE (t1), TYPE_METHOD_BASETYPE (t2)))
4726 /* Function types are the same if the return type and arguments types
4728 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
4731 if (!comp_type_attributes (t1, t2))
4734 if (TYPE_ARG_TYPES (t1) == TYPE_ARG_TYPES (t2))
4738 tree parms1, parms2;
4740 for (parms1 = TYPE_ARG_TYPES (t1), parms2 = TYPE_ARG_TYPES (t2);
4742 parms1 = TREE_CHAIN (parms1), parms2 = TREE_CHAIN (parms2))
4744 if (!gimple_canonical_types_compatible_p
4745 (TREE_VALUE (parms1), TREE_VALUE (parms2)))
4749 if (parms1 || parms2)
4757 case QUAL_UNION_TYPE:
4761 /* For aggregate types, all the fields must be the same. */
4762 for (f1 = TYPE_FIELDS (t1), f2 = TYPE_FIELDS (t2);
4764 f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
4766 /* Skip non-fields. */
4767 while (f1 && TREE_CODE (f1) != FIELD_DECL)
4768 f1 = TREE_CHAIN (f1);
4769 while (f2 && TREE_CODE (f2) != FIELD_DECL)
4770 f2 = TREE_CHAIN (f2);
4773 /* The fields must have the same name, offset and type. */
4774 if (DECL_NONADDRESSABLE_P (f1) != DECL_NONADDRESSABLE_P (f2)
4775 || !gimple_compare_field_offset (f1, f2)
4776 || !gimple_canonical_types_compatible_p
4777 (TREE_TYPE (f1), TREE_TYPE (f2)))
4781 /* If one aggregate has more fields than the other, they
4782 are not the same. */
4795 /* Returns nonzero if P1 and P2 are equal. */
4798 gimple_canonical_type_eq (const void *p1, const void *p2)
4800 const_tree t1 = (const_tree) p1;
4801 const_tree t2 = (const_tree) p2;
4802 return gimple_canonical_types_compatible_p (CONST_CAST_TREE (t1),
4803 CONST_CAST_TREE (t2));
4806 /* Register type T in the global type table gimple_types.
4807 If another type T', compatible with T, already existed in
4808 gimple_types then return T', otherwise return T. This is used by
4809 LTO to merge identical types read from different TUs.
4811 ??? This merging does not exactly match how the tree.c middle-end
4812 functions will assign TYPE_CANONICAL when new types are created
4813 during optimization (which at least happens for pointer and array
4817 gimple_register_canonical_type (tree t)
4821 gcc_assert (TYPE_P (t));
4823 if (TYPE_CANONICAL (t))
4824 return TYPE_CANONICAL (t);
4826 if (gimple_canonical_types == NULL)
4827 gimple_canonical_types = htab_create_ggc (16381, gimple_canonical_type_hash,
4828 gimple_canonical_type_eq, 0);
4830 slot = htab_find_slot (gimple_canonical_types, t, INSERT);
4832 && *(tree *)slot != t)
4834 tree new_type = (tree) *((tree *) slot);
4836 TYPE_CANONICAL (t) = new_type;
4841 TYPE_CANONICAL (t) = t;
4849 /* Show statistics on references to the global type table gimple_types. */
4852 print_gimple_types_stats (void)
4855 fprintf (stderr, "GIMPLE type table: size %ld, %ld elements, "
4856 "%ld searches, %ld collisions (ratio: %f)\n",
4857 (long) htab_size (gimple_types),
4858 (long) htab_elements (gimple_types),
4859 (long) gimple_types->searches,
4860 (long) gimple_types->collisions,
4861 htab_collisions (gimple_types));
4863 fprintf (stderr, "GIMPLE type table is empty\n");
4864 if (type_hash_cache)
4865 fprintf (stderr, "GIMPLE type hash table: size %ld, %ld elements, "
4866 "%ld searches, %ld collisions (ratio: %f)\n",
4867 (long) htab_size (type_hash_cache),
4868 (long) htab_elements (type_hash_cache),
4869 (long) type_hash_cache->searches,
4870 (long) type_hash_cache->collisions,
4871 htab_collisions (type_hash_cache));
4873 fprintf (stderr, "GIMPLE type hash table is empty\n");
4874 if (gimple_canonical_types)
4875 fprintf (stderr, "GIMPLE canonical type table: size %ld, %ld elements, "
4876 "%ld searches, %ld collisions (ratio: %f)\n",
4877 (long) htab_size (gimple_canonical_types),
4878 (long) htab_elements (gimple_canonical_types),
4879 (long) gimple_canonical_types->searches,
4880 (long) gimple_canonical_types->collisions,
4881 htab_collisions (gimple_canonical_types));
4883 fprintf (stderr, "GIMPLE canonical type table is empty\n");
4884 if (canonical_type_hash_cache)
4885 fprintf (stderr, "GIMPLE canonical type hash table: size %ld, %ld elements, "
4886 "%ld searches, %ld collisions (ratio: %f)\n",
4887 (long) htab_size (canonical_type_hash_cache),
4888 (long) htab_elements (canonical_type_hash_cache),
4889 (long) canonical_type_hash_cache->searches,
4890 (long) canonical_type_hash_cache->collisions,
4891 htab_collisions (canonical_type_hash_cache));
4893 fprintf (stderr, "GIMPLE canonical type hash table is empty\n");
4896 /* Free the gimple type hashtables used for LTO type merging. */
4899 free_gimple_type_tables (void)
4901 /* Last chance to print stats for the tables. */
4902 if (flag_lto_report)
4903 print_gimple_types_stats ();
4907 htab_delete (gimple_types);
4908 gimple_types = NULL;
4910 if (gimple_canonical_types)
4912 htab_delete (gimple_canonical_types);
4913 gimple_canonical_types = NULL;
4915 if (type_hash_cache)
4917 htab_delete (type_hash_cache);
4918 type_hash_cache = NULL;
4920 if (canonical_type_hash_cache)
4922 htab_delete (canonical_type_hash_cache);
4923 canonical_type_hash_cache = NULL;
4925 if (type_pair_cache)
4927 free (type_pair_cache);
4928 type_pair_cache = NULL;
4930 gimple_type_leader = NULL;
4934 /* Return a type the same as TYPE except unsigned or
4935 signed according to UNSIGNEDP. */
4938 gimple_signed_or_unsigned_type (bool unsignedp, tree type)
4942 type1 = TYPE_MAIN_VARIANT (type);
4943 if (type1 == signed_char_type_node
4944 || type1 == char_type_node
4945 || type1 == unsigned_char_type_node)
4946 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
4947 if (type1 == integer_type_node || type1 == unsigned_type_node)
4948 return unsignedp ? unsigned_type_node : integer_type_node;
4949 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
4950 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
4951 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
4952 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
4953 if (type1 == long_long_integer_type_node
4954 || type1 == long_long_unsigned_type_node)
4956 ? long_long_unsigned_type_node
4957 : long_long_integer_type_node;
4958 if (int128_integer_type_node && (type1 == int128_integer_type_node || type1 == int128_unsigned_type_node))
4960 ? int128_unsigned_type_node
4961 : int128_integer_type_node;
4962 #if HOST_BITS_PER_WIDE_INT >= 64
4963 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
4964 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
4966 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
4967 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
4968 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
4969 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
4970 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
4971 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
4972 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
4973 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
4975 #define GIMPLE_FIXED_TYPES(NAME) \
4976 if (type1 == short_ ## NAME ## _type_node \
4977 || type1 == unsigned_short_ ## NAME ## _type_node) \
4978 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4979 : short_ ## NAME ## _type_node; \
4980 if (type1 == NAME ## _type_node \
4981 || type1 == unsigned_ ## NAME ## _type_node) \
4982 return unsignedp ? unsigned_ ## NAME ## _type_node \
4983 : NAME ## _type_node; \
4984 if (type1 == long_ ## NAME ## _type_node \
4985 || type1 == unsigned_long_ ## NAME ## _type_node) \
4986 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4987 : long_ ## NAME ## _type_node; \
4988 if (type1 == long_long_ ## NAME ## _type_node \
4989 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4990 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4991 : long_long_ ## NAME ## _type_node;
4993 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
4994 if (type1 == NAME ## _type_node \
4995 || type1 == u ## NAME ## _type_node) \
4996 return unsignedp ? u ## NAME ## _type_node \
4997 : NAME ## _type_node;
4999 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
5000 if (type1 == sat_ ## short_ ## NAME ## _type_node \
5001 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
5002 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
5003 : sat_ ## short_ ## NAME ## _type_node; \
5004 if (type1 == sat_ ## NAME ## _type_node \
5005 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
5006 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
5007 : sat_ ## NAME ## _type_node; \
5008 if (type1 == sat_ ## long_ ## NAME ## _type_node \
5009 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
5010 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
5011 : sat_ ## long_ ## NAME ## _type_node; \
5012 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
5013 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
5014 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
5015 : sat_ ## long_long_ ## NAME ## _type_node;
5017 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
5018 if (type1 == sat_ ## NAME ## _type_node \
5019 || type1 == sat_ ## u ## NAME ## _type_node) \
5020 return unsignedp ? sat_ ## u ## NAME ## _type_node \
5021 : sat_ ## NAME ## _type_node;
5023 GIMPLE_FIXED_TYPES (fract);
5024 GIMPLE_FIXED_TYPES_SAT (fract);
5025 GIMPLE_FIXED_TYPES (accum);
5026 GIMPLE_FIXED_TYPES_SAT (accum);
5028 GIMPLE_FIXED_MODE_TYPES (qq);
5029 GIMPLE_FIXED_MODE_TYPES (hq);
5030 GIMPLE_FIXED_MODE_TYPES (sq);
5031 GIMPLE_FIXED_MODE_TYPES (dq);
5032 GIMPLE_FIXED_MODE_TYPES (tq);
5033 GIMPLE_FIXED_MODE_TYPES_SAT (qq);
5034 GIMPLE_FIXED_MODE_TYPES_SAT (hq);
5035 GIMPLE_FIXED_MODE_TYPES_SAT (sq);
5036 GIMPLE_FIXED_MODE_TYPES_SAT (dq);
5037 GIMPLE_FIXED_MODE_TYPES_SAT (tq);
5038 GIMPLE_FIXED_MODE_TYPES (ha);
5039 GIMPLE_FIXED_MODE_TYPES (sa);
5040 GIMPLE_FIXED_MODE_TYPES (da);
5041 GIMPLE_FIXED_MODE_TYPES (ta);
5042 GIMPLE_FIXED_MODE_TYPES_SAT (ha);
5043 GIMPLE_FIXED_MODE_TYPES_SAT (sa);
5044 GIMPLE_FIXED_MODE_TYPES_SAT (da);
5045 GIMPLE_FIXED_MODE_TYPES_SAT (ta);
5047 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
5048 the precision; they have precision set to match their range, but
5049 may use a wider mode to match an ABI. If we change modes, we may
5050 wind up with bad conversions. For INTEGER_TYPEs in C, must check
5051 the precision as well, so as to yield correct results for
5052 bit-field types. C++ does not have these separate bit-field
5053 types, and producing a signed or unsigned variant of an
5054 ENUMERAL_TYPE may cause other problems as well. */
5055 if (!INTEGRAL_TYPE_P (type)
5056 || TYPE_UNSIGNED (type) == unsignedp)
5059 #define TYPE_OK(node) \
5060 (TYPE_MODE (type) == TYPE_MODE (node) \
5061 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
5062 if (TYPE_OK (signed_char_type_node))
5063 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
5064 if (TYPE_OK (integer_type_node))
5065 return unsignedp ? unsigned_type_node : integer_type_node;
5066 if (TYPE_OK (short_integer_type_node))
5067 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
5068 if (TYPE_OK (long_integer_type_node))
5069 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
5070 if (TYPE_OK (long_long_integer_type_node))
5072 ? long_long_unsigned_type_node
5073 : long_long_integer_type_node);
5074 if (int128_integer_type_node && TYPE_OK (int128_integer_type_node))
5076 ? int128_unsigned_type_node
5077 : int128_integer_type_node);
5079 #if HOST_BITS_PER_WIDE_INT >= 64
5080 if (TYPE_OK (intTI_type_node))
5081 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
5083 if (TYPE_OK (intDI_type_node))
5084 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
5085 if (TYPE_OK (intSI_type_node))
5086 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
5087 if (TYPE_OK (intHI_type_node))
5088 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
5089 if (TYPE_OK (intQI_type_node))
5090 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
5092 #undef GIMPLE_FIXED_TYPES
5093 #undef GIMPLE_FIXED_MODE_TYPES
5094 #undef GIMPLE_FIXED_TYPES_SAT
5095 #undef GIMPLE_FIXED_MODE_TYPES_SAT
5098 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
5102 /* Return an unsigned type the same as TYPE in other respects. */
5105 gimple_unsigned_type (tree type)
5107 return gimple_signed_or_unsigned_type (true, type);
5111 /* Return a signed type the same as TYPE in other respects. */
5114 gimple_signed_type (tree type)
5116 return gimple_signed_or_unsigned_type (false, type);
5120 /* Return the typed-based alias set for T, which may be an expression
5121 or a type. Return -1 if we don't do anything special. */
5124 gimple_get_alias_set (tree t)
5128 /* Permit type-punning when accessing a union, provided the access
5129 is directly through the union. For example, this code does not
5130 permit taking the address of a union member and then storing
5131 through it. Even the type-punning allowed here is a GCC
5132 extension, albeit a common and useful one; the C standard says
5133 that such accesses have implementation-defined behavior. */
5135 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
5136 u = TREE_OPERAND (u, 0))
5137 if (TREE_CODE (u) == COMPONENT_REF
5138 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
5141 /* That's all the expressions we handle specially. */
5145 /* For convenience, follow the C standard when dealing with
5146 character types. Any object may be accessed via an lvalue that
5147 has character type. */
5148 if (t == char_type_node
5149 || t == signed_char_type_node
5150 || t == unsigned_char_type_node)
5153 /* Allow aliasing between signed and unsigned variants of the same
5154 type. We treat the signed variant as canonical. */
5155 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
5157 tree t1 = gimple_signed_type (t);
5159 /* t1 == t can happen for boolean nodes which are always unsigned. */
5161 return get_alias_set (t1);
5168 /* Data structure used to count the number of dereferences to PTR
5169 inside an expression. */
5173 unsigned num_stores;
5177 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
5178 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
5181 count_ptr_derefs (tree *tp, int *walk_subtrees, void *data)
5183 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
5184 struct count_ptr_d *count_p = (struct count_ptr_d *) wi_p->info;
5186 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
5187 pointer 'ptr' is *not* dereferenced, it is simply used to compute
5188 the address of 'fld' as 'ptr + offsetof(fld)'. */
5189 if (TREE_CODE (*tp) == ADDR_EXPR)
5195 if (TREE_CODE (*tp) == MEM_REF && TREE_OPERAND (*tp, 0) == count_p->ptr)
5198 count_p->num_stores++;
5200 count_p->num_loads++;
5206 /* Count the number of direct and indirect uses for pointer PTR in
5207 statement STMT. The number of direct uses is stored in
5208 *NUM_USES_P. Indirect references are counted separately depending
5209 on whether they are store or load operations. The counts are
5210 stored in *NUM_STORES_P and *NUM_LOADS_P. */
5213 count_uses_and_derefs (tree ptr, gimple stmt, unsigned *num_uses_p,
5214 unsigned *num_loads_p, unsigned *num_stores_p)
5223 /* Find out the total number of uses of PTR in STMT. */
5224 FOR_EACH_SSA_TREE_OPERAND (use, stmt, i, SSA_OP_USE)
5228 /* Now count the number of indirect references to PTR. This is
5229 truly awful, but we don't have much choice. There are no parent
5230 pointers inside INDIRECT_REFs, so an expression like
5231 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
5232 find all the indirect and direct uses of x_1 inside. The only
5233 shortcut we can take is the fact that GIMPLE only allows
5234 INDIRECT_REFs inside the expressions below. */
5235 if (is_gimple_assign (stmt)
5236 || gimple_code (stmt) == GIMPLE_RETURN
5237 || gimple_code (stmt) == GIMPLE_ASM
5238 || is_gimple_call (stmt))
5240 struct walk_stmt_info wi;
5241 struct count_ptr_d count;
5244 count.num_stores = 0;
5245 count.num_loads = 0;
5247 memset (&wi, 0, sizeof (wi));
5249 walk_gimple_op (stmt, count_ptr_derefs, &wi);
5251 *num_stores_p = count.num_stores;
5252 *num_loads_p = count.num_loads;
5255 gcc_assert (*num_uses_p >= *num_loads_p + *num_stores_p);
5258 /* From a tree operand OP return the base of a load or store operation
5259 or NULL_TREE if OP is not a load or a store. */
5262 get_base_loadstore (tree op)
5264 while (handled_component_p (op))
5265 op = TREE_OPERAND (op, 0);
5267 || INDIRECT_REF_P (op)
5268 || TREE_CODE (op) == MEM_REF
5269 || TREE_CODE (op) == TARGET_MEM_REF)
5274 /* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and
5275 VISIT_ADDR if non-NULL on loads, store and address-taken operands
5276 passing the STMT, the base of the operand and DATA to it. The base
5277 will be either a decl, an indirect reference (including TARGET_MEM_REF)
5278 or the argument of an address expression.
5279 Returns the results of these callbacks or'ed. */
5282 walk_stmt_load_store_addr_ops (gimple stmt, void *data,
5283 bool (*visit_load)(gimple, tree, void *),
5284 bool (*visit_store)(gimple, tree, void *),
5285 bool (*visit_addr)(gimple, tree, void *))
5289 if (gimple_assign_single_p (stmt))
5294 lhs = get_base_loadstore (gimple_assign_lhs (stmt));
5296 ret |= visit_store (stmt, lhs, data);
5298 rhs = gimple_assign_rhs1 (stmt);
5299 while (handled_component_p (rhs))
5300 rhs = TREE_OPERAND (rhs, 0);
5303 if (TREE_CODE (rhs) == ADDR_EXPR)
5304 ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);
5305 else if (TREE_CODE (rhs) == TARGET_MEM_REF
5306 && TREE_CODE (TMR_BASE (rhs)) == ADDR_EXPR)
5307 ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (rhs), 0), data);
5308 else if (TREE_CODE (rhs) == OBJ_TYPE_REF
5309 && TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs)) == ADDR_EXPR)
5310 ret |= visit_addr (stmt, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs),
5312 else if (TREE_CODE (rhs) == CONSTRUCTOR)
5317 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (rhs), ix, val)
5318 if (TREE_CODE (val) == ADDR_EXPR)
5319 ret |= visit_addr (stmt, TREE_OPERAND (val, 0), data);
5320 else if (TREE_CODE (val) == OBJ_TYPE_REF
5321 && TREE_CODE (OBJ_TYPE_REF_OBJECT (val)) == ADDR_EXPR)
5322 ret |= visit_addr (stmt,
5323 TREE_OPERAND (OBJ_TYPE_REF_OBJECT (val),
5326 lhs = gimple_assign_lhs (stmt);
5327 if (TREE_CODE (lhs) == TARGET_MEM_REF
5328 && TREE_CODE (TMR_BASE (lhs)) == ADDR_EXPR)
5329 ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (lhs), 0), data);
5333 rhs = get_base_loadstore (rhs);
5335 ret |= visit_load (stmt, rhs, data);
5339 && (is_gimple_assign (stmt)
5340 || gimple_code (stmt) == GIMPLE_COND))
5342 for (i = 0; i < gimple_num_ops (stmt); ++i)
5344 tree op = gimple_op (stmt, i);
5345 if (op == NULL_TREE)
5347 else if (TREE_CODE (op) == ADDR_EXPR)
5348 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
5349 /* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison
5350 tree with two operands. */
5351 else if (i == 1 && COMPARISON_CLASS_P (op))
5353 if (TREE_CODE (TREE_OPERAND (op, 0)) == ADDR_EXPR)
5354 ret |= visit_addr (stmt, TREE_OPERAND (TREE_OPERAND (op, 0),
5356 if (TREE_CODE (TREE_OPERAND (op, 1)) == ADDR_EXPR)
5357 ret |= visit_addr (stmt, TREE_OPERAND (TREE_OPERAND (op, 1),
5362 else if (is_gimple_call (stmt))
5366 tree lhs = gimple_call_lhs (stmt);
5369 lhs = get_base_loadstore (lhs);
5371 ret |= visit_store (stmt, lhs, data);
5374 if (visit_load || visit_addr)
5375 for (i = 0; i < gimple_call_num_args (stmt); ++i)
5377 tree rhs = gimple_call_arg (stmt, i);
5379 && TREE_CODE (rhs) == ADDR_EXPR)
5380 ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);
5381 else if (visit_load)
5383 rhs = get_base_loadstore (rhs);
5385 ret |= visit_load (stmt, rhs, data);
5389 && gimple_call_chain (stmt)
5390 && TREE_CODE (gimple_call_chain (stmt)) == ADDR_EXPR)
5391 ret |= visit_addr (stmt, TREE_OPERAND (gimple_call_chain (stmt), 0),
5394 && gimple_call_return_slot_opt_p (stmt)
5395 && gimple_call_lhs (stmt) != NULL_TREE
5396 && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))
5397 ret |= visit_addr (stmt, gimple_call_lhs (stmt), data);
5399 else if (gimple_code (stmt) == GIMPLE_ASM)
5402 const char *constraint;
5403 const char **oconstraints;
5404 bool allows_mem, allows_reg, is_inout;
5405 noutputs = gimple_asm_noutputs (stmt);
5406 oconstraints = XALLOCAVEC (const char *, noutputs);
5407 if (visit_store || visit_addr)
5408 for (i = 0; i < gimple_asm_noutputs (stmt); ++i)
5410 tree link = gimple_asm_output_op (stmt, i);
5411 tree op = get_base_loadstore (TREE_VALUE (link));
5412 if (op && visit_store)
5413 ret |= visit_store (stmt, op, data);
5416 constraint = TREE_STRING_POINTER
5417 (TREE_VALUE (TREE_PURPOSE (link)));
5418 oconstraints[i] = constraint;
5419 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
5420 &allows_reg, &is_inout);
5421 if (op && !allows_reg && allows_mem)
5422 ret |= visit_addr (stmt, op, data);
5425 if (visit_load || visit_addr)
5426 for (i = 0; i < gimple_asm_ninputs (stmt); ++i)
5428 tree link = gimple_asm_input_op (stmt, i);
5429 tree op = TREE_VALUE (link);
5431 && TREE_CODE (op) == ADDR_EXPR)
5432 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
5433 else if (visit_load || visit_addr)
5435 op = get_base_loadstore (op);
5439 ret |= visit_load (stmt, op, data);
5442 constraint = TREE_STRING_POINTER
5443 (TREE_VALUE (TREE_PURPOSE (link)));
5444 parse_input_constraint (&constraint, 0, 0, noutputs,
5446 &allows_mem, &allows_reg);
5447 if (!allows_reg && allows_mem)
5448 ret |= visit_addr (stmt, op, data);
5454 else if (gimple_code (stmt) == GIMPLE_RETURN)
5456 tree op = gimple_return_retval (stmt);
5460 && TREE_CODE (op) == ADDR_EXPR)
5461 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
5462 else if (visit_load)
5464 op = get_base_loadstore (op);
5466 ret |= visit_load (stmt, op, data);
5471 && gimple_code (stmt) == GIMPLE_PHI)
5473 for (i = 0; i < gimple_phi_num_args (stmt); ++i)
5475 tree op = PHI_ARG_DEF (stmt, i);
5476 if (TREE_CODE (op) == ADDR_EXPR)
5477 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
5484 /* Like walk_stmt_load_store_addr_ops but with NULL visit_addr. IPA-CP
5485 should make a faster clone for this case. */
5488 walk_stmt_load_store_ops (gimple stmt, void *data,
5489 bool (*visit_load)(gimple, tree, void *),
5490 bool (*visit_store)(gimple, tree, void *))
5492 return walk_stmt_load_store_addr_ops (stmt, data,
5493 visit_load, visit_store, NULL);
5496 /* Helper for gimple_ior_addresses_taken_1. */
5499 gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED,
5500 tree addr, void *data)
5502 bitmap addresses_taken = (bitmap)data;
5503 addr = get_base_address (addr);
5507 bitmap_set_bit (addresses_taken, DECL_UID (addr));
5513 /* Set the bit for the uid of all decls that have their address taken
5514 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
5515 were any in this stmt. */
5518 gimple_ior_addresses_taken (bitmap addresses_taken, gimple stmt)
5520 return walk_stmt_load_store_addr_ops (stmt, addresses_taken, NULL, NULL,
5521 gimple_ior_addresses_taken_1);
5525 /* Return a printable name for symbol DECL. */
5528 gimple_decl_printable_name (tree decl, int verbosity)
5530 if (!DECL_NAME (decl))
5533 if (DECL_ASSEMBLER_NAME_SET_P (decl))
5535 const char *str, *mangled_str;
5536 int dmgl_opts = DMGL_NO_OPTS;
5540 dmgl_opts = DMGL_VERBOSE
5544 if (TREE_CODE (decl) == FUNCTION_DECL)
5545 dmgl_opts |= DMGL_PARAMS;
5548 mangled_str = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
5549 str = cplus_demangle_v3 (mangled_str, dmgl_opts);
5550 return (str) ? str : mangled_str;
5553 return IDENTIFIER_POINTER (DECL_NAME (decl));
5556 /* Return true when STMT is builtins call to CODE. */
5559 gimple_call_builtin_p (gimple stmt, enum built_in_function code)
5562 return (is_gimple_call (stmt)
5563 && (fndecl = gimple_call_fndecl (stmt)) != NULL
5564 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
5565 && DECL_FUNCTION_CODE (fndecl) == code);
5568 /* Return true if STMT clobbers memory. STMT is required to be a
5572 gimple_asm_clobbers_memory_p (const_gimple stmt)
5576 for (i = 0; i < gimple_asm_nclobbers (stmt); i++)
5578 tree op = gimple_asm_clobber_op (stmt, i);
5579 if (strcmp (TREE_STRING_POINTER (TREE_VALUE (op)), "memory") == 0)
5585 #include "gt-gimple.h"