1 /* Gimple IR support functions.
3 Copyright 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
4 Contributed by Aldy Hernandez <aldyh@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
33 #include "diagnostic.h"
34 #include "tree-flow.h"
35 #include "value-prof.h"
40 /* Global type table. FIXME lto, it should be possible to re-use some
41 of the type hashing routines in tree.c (type_hash_canon, type_hash_lookup,
42 etc), but those assume that types were built with the various
43 build_*_type routines which is not the case with the streamer. */
44 static htab_t gimple_types;
45 static struct pointer_map_t *type_hash_cache;
47 /* Global type comparison cache. */
48 static htab_t gtc_visited;
49 static struct obstack gtc_ob;
51 /* All the tuples have their operand vector (if present) at the very bottom
52 of the structure. Therefore, the offset required to find the
53 operands vector the size of the structure minus the size of the 1
54 element tree array at the end (see gimple_ops). */
55 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) \
56 (HAS_TREE_OP ? sizeof (struct STRUCT) - sizeof (tree) : 0),
57 EXPORTED_CONST size_t gimple_ops_offset_[] = {
58 #include "gsstruct.def"
62 #define DEFGSSTRUCT(SYM, STRUCT, HAS_TREE_OP) sizeof(struct STRUCT),
63 static const size_t gsstruct_code_size[] = {
64 #include "gsstruct.def"
68 #define DEFGSCODE(SYM, NAME, GSSCODE) NAME,
69 const char *const gimple_code_name[] = {
74 #define DEFGSCODE(SYM, NAME, GSSCODE) GSSCODE,
75 EXPORTED_CONST enum gimple_statement_structure_enum gss_for_code_[] = {
80 #ifdef GATHER_STATISTICS
83 int gimple_alloc_counts[(int) gimple_alloc_kind_all];
84 int gimple_alloc_sizes[(int) gimple_alloc_kind_all];
86 /* Keep in sync with gimple.h:enum gimple_alloc_kind. */
87 static const char * const gimple_alloc_kind_names[] = {
95 #endif /* GATHER_STATISTICS */
97 /* A cache of gimple_seq objects. Sequences are created and destroyed
98 fairly often during gimplification. */
99 static GTY ((deletable)) struct gimple_seq_d *gimple_seq_cache;
101 /* Private API manipulation functions shared only with some
103 extern void gimple_set_stored_syms (gimple, bitmap, bitmap_obstack *);
104 extern void gimple_set_loaded_syms (gimple, bitmap, bitmap_obstack *);
106 /* Gimple tuple constructors.
107 Note: Any constructor taking a ``gimple_seq'' as a parameter, can
108 be passed a NULL to start with an empty sequence. */
110 /* Set the code for statement G to CODE. */
113 gimple_set_code (gimple g, enum gimple_code code)
115 g->gsbase.code = code;
118 /* Return the number of bytes needed to hold a GIMPLE statement with
122 gimple_size (enum gimple_code code)
124 return gsstruct_code_size[gss_for_code (code)];
127 /* Allocate memory for a GIMPLE statement with code CODE and NUM_OPS
131 gimple_alloc_stat (enum gimple_code code, unsigned num_ops MEM_STAT_DECL)
136 size = gimple_size (code);
138 size += sizeof (tree) * (num_ops - 1);
140 #ifdef GATHER_STATISTICS
142 enum gimple_alloc_kind kind = gimple_alloc_kind (code);
143 gimple_alloc_counts[(int) kind]++;
144 gimple_alloc_sizes[(int) kind] += size;
148 stmt = (gimple) ggc_alloc_cleared_stat (size PASS_MEM_STAT);
149 gimple_set_code (stmt, code);
150 gimple_set_num_ops (stmt, num_ops);
152 /* Do not call gimple_set_modified here as it has other side
153 effects and this tuple is still not completely built. */
154 stmt->gsbase.modified = 1;
159 /* Set SUBCODE to be the code of the expression computed by statement G. */
162 gimple_set_subcode (gimple g, unsigned subcode)
164 /* We only have 16 bits for the RHS code. Assert that we are not
166 gcc_assert (subcode < (1 << 16));
167 g->gsbase.subcode = subcode;
172 /* Build a tuple with operands. CODE is the statement to build (which
173 must be one of the GIMPLE_WITH_OPS tuples). SUBCODE is the sub-code
174 for the new tuple. NUM_OPS is the number of operands to allocate. */
176 #define gimple_build_with_ops(c, s, n) \
177 gimple_build_with_ops_stat (c, s, n MEM_STAT_INFO)
180 gimple_build_with_ops_stat (enum gimple_code code, unsigned subcode,
181 unsigned num_ops MEM_STAT_DECL)
183 gimple s = gimple_alloc_stat (code, num_ops PASS_MEM_STAT);
184 gimple_set_subcode (s, subcode);
190 /* Build a GIMPLE_RETURN statement returning RETVAL. */
193 gimple_build_return (tree retval)
195 gimple s = gimple_build_with_ops (GIMPLE_RETURN, ERROR_MARK, 1);
197 gimple_return_set_retval (s, retval);
201 /* Reset alias information on call S. */
204 gimple_call_reset_alias_info (gimple s)
206 if (gimple_call_flags (s) & ECF_CONST)
207 memset (gimple_call_use_set (s), 0, sizeof (struct pt_solution));
209 pt_solution_reset (gimple_call_use_set (s));
210 if (gimple_call_flags (s) & (ECF_CONST|ECF_PURE|ECF_NOVOPS))
211 memset (gimple_call_clobber_set (s), 0, sizeof (struct pt_solution));
213 pt_solution_reset (gimple_call_clobber_set (s));
216 /* Helper for gimple_build_call, gimple_build_call_vec and
217 gimple_build_call_from_tree. Build the basic components of a
218 GIMPLE_CALL statement to function FN with NARGS arguments. */
221 gimple_build_call_1 (tree fn, unsigned nargs)
223 gimple s = gimple_build_with_ops (GIMPLE_CALL, ERROR_MARK, nargs + 3);
224 if (TREE_CODE (fn) == FUNCTION_DECL)
225 fn = build_fold_addr_expr (fn);
226 gimple_set_op (s, 1, fn);
227 gimple_call_reset_alias_info (s);
232 /* Build a GIMPLE_CALL statement to function FN with the arguments
233 specified in vector ARGS. */
236 gimple_build_call_vec (tree fn, VEC(tree, heap) *args)
239 unsigned nargs = VEC_length (tree, args);
240 gimple call = gimple_build_call_1 (fn, nargs);
242 for (i = 0; i < nargs; i++)
243 gimple_call_set_arg (call, i, VEC_index (tree, args, i));
249 /* Build a GIMPLE_CALL statement to function FN. NARGS is the number of
250 arguments. The ... are the arguments. */
253 gimple_build_call (tree fn, unsigned nargs, ...)
259 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL || is_gimple_call_addr (fn));
261 call = gimple_build_call_1 (fn, nargs);
263 va_start (ap, nargs);
264 for (i = 0; i < nargs; i++)
265 gimple_call_set_arg (call, i, va_arg (ap, tree));
272 /* Build a GIMPLE_CALL statement from CALL_EXPR T. Note that T is
273 assumed to be in GIMPLE form already. Minimal checking is done of
277 gimple_build_call_from_tree (tree t)
281 tree fndecl = get_callee_fndecl (t);
283 gcc_assert (TREE_CODE (t) == CALL_EXPR);
285 nargs = call_expr_nargs (t);
286 call = gimple_build_call_1 (fndecl ? fndecl : CALL_EXPR_FN (t), nargs);
288 for (i = 0; i < nargs; i++)
289 gimple_call_set_arg (call, i, CALL_EXPR_ARG (t, i));
291 gimple_set_block (call, TREE_BLOCK (t));
293 /* Carry all the CALL_EXPR flags to the new GIMPLE_CALL. */
294 gimple_call_set_chain (call, CALL_EXPR_STATIC_CHAIN (t));
295 gimple_call_set_tail (call, CALL_EXPR_TAILCALL (t));
296 gimple_call_set_cannot_inline (call, CALL_CANNOT_INLINE_P (t));
297 gimple_call_set_return_slot_opt (call, CALL_EXPR_RETURN_SLOT_OPT (t));
298 gimple_call_set_from_thunk (call, CALL_FROM_THUNK_P (t));
299 gimple_call_set_va_arg_pack (call, CALL_EXPR_VA_ARG_PACK (t));
300 gimple_set_no_warning (call, TREE_NO_WARNING (t));
306 /* Extract the operands and code for expression EXPR into *SUBCODE_P,
307 *OP1_P and *OP2_P respectively. */
310 extract_ops_from_tree (tree expr, enum tree_code *subcode_p, tree *op1_p,
313 enum gimple_rhs_class grhs_class;
315 *subcode_p = TREE_CODE (expr);
316 grhs_class = get_gimple_rhs_class (*subcode_p);
318 if (grhs_class == GIMPLE_BINARY_RHS)
320 *op1_p = TREE_OPERAND (expr, 0);
321 *op2_p = TREE_OPERAND (expr, 1);
323 else if (grhs_class == GIMPLE_UNARY_RHS)
325 *op1_p = TREE_OPERAND (expr, 0);
328 else if (grhs_class == GIMPLE_SINGLE_RHS)
338 /* Build a GIMPLE_ASSIGN statement.
340 LHS of the assignment.
341 RHS of the assignment which can be unary or binary. */
344 gimple_build_assign_stat (tree lhs, tree rhs MEM_STAT_DECL)
346 enum tree_code subcode;
349 extract_ops_from_tree (rhs, &subcode, &op1, &op2);
350 return gimple_build_assign_with_ops_stat (subcode, lhs, op1, op2
355 /* Build a GIMPLE_ASSIGN statement with sub-code SUBCODE and operands
356 OP1 and OP2. If OP2 is NULL then SUBCODE must be of class
357 GIMPLE_UNARY_RHS or GIMPLE_SINGLE_RHS. */
360 gimple_build_assign_with_ops_stat (enum tree_code subcode, tree lhs, tree op1,
361 tree op2 MEM_STAT_DECL)
366 /* Need 1 operand for LHS and 1 or 2 for the RHS (depending on the
368 num_ops = get_gimple_rhs_num_ops (subcode) + 1;
370 p = gimple_build_with_ops_stat (GIMPLE_ASSIGN, (unsigned)subcode, num_ops
372 gimple_assign_set_lhs (p, lhs);
373 gimple_assign_set_rhs1 (p, op1);
376 gcc_assert (num_ops > 2);
377 gimple_assign_set_rhs2 (p, op2);
384 /* Build a new GIMPLE_ASSIGN tuple and append it to the end of *SEQ_P.
386 DST/SRC are the destination and source respectively. You can pass
387 ungimplified trees in DST or SRC, in which case they will be
388 converted to a gimple operand if necessary.
390 This function returns the newly created GIMPLE_ASSIGN tuple. */
393 gimplify_assign (tree dst, tree src, gimple_seq *seq_p)
395 tree t = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src);
396 gimplify_and_add (t, seq_p);
398 return gimple_seq_last_stmt (*seq_p);
402 /* Build a GIMPLE_COND statement.
404 PRED is the condition used to compare LHS and the RHS.
405 T_LABEL is the label to jump to if the condition is true.
406 F_LABEL is the label to jump to otherwise. */
409 gimple_build_cond (enum tree_code pred_code, tree lhs, tree rhs,
410 tree t_label, tree f_label)
414 gcc_assert (TREE_CODE_CLASS (pred_code) == tcc_comparison);
415 p = gimple_build_with_ops (GIMPLE_COND, pred_code, 4);
416 gimple_cond_set_lhs (p, lhs);
417 gimple_cond_set_rhs (p, rhs);
418 gimple_cond_set_true_label (p, t_label);
419 gimple_cond_set_false_label (p, f_label);
424 /* Extract operands for a GIMPLE_COND statement out of COND_EXPR tree COND. */
427 gimple_cond_get_ops_from_tree (tree cond, enum tree_code *code_p,
428 tree *lhs_p, tree *rhs_p)
430 location_t loc = EXPR_LOCATION (cond);
431 gcc_assert (TREE_CODE_CLASS (TREE_CODE (cond)) == tcc_comparison
432 || TREE_CODE (cond) == TRUTH_NOT_EXPR
433 || is_gimple_min_invariant (cond)
434 || SSA_VAR_P (cond));
436 extract_ops_from_tree (cond, code_p, lhs_p, rhs_p);
438 /* Canonicalize conditionals of the form 'if (!VAL)'. */
439 if (*code_p == TRUTH_NOT_EXPR)
442 gcc_assert (*lhs_p && *rhs_p == NULL_TREE);
443 *rhs_p = fold_convert_loc (loc, TREE_TYPE (*lhs_p), integer_zero_node);
445 /* Canonicalize conditionals of the form 'if (VAL)' */
446 else if (TREE_CODE_CLASS (*code_p) != tcc_comparison)
449 gcc_assert (*lhs_p && *rhs_p == NULL_TREE);
450 *rhs_p = fold_convert_loc (loc, TREE_TYPE (*lhs_p), integer_zero_node);
455 /* Build a GIMPLE_COND statement from the conditional expression tree
456 COND. T_LABEL and F_LABEL are as in gimple_build_cond. */
459 gimple_build_cond_from_tree (tree cond, tree t_label, tree f_label)
464 gimple_cond_get_ops_from_tree (cond, &code, &lhs, &rhs);
465 return gimple_build_cond (code, lhs, rhs, t_label, f_label);
468 /* Set code, lhs, and rhs of a GIMPLE_COND from a suitable
469 boolean expression tree COND. */
472 gimple_cond_set_condition_from_tree (gimple stmt, tree cond)
477 gimple_cond_get_ops_from_tree (cond, &code, &lhs, &rhs);
478 gimple_cond_set_condition (stmt, code, lhs, rhs);
481 /* Build a GIMPLE_LABEL statement for LABEL. */
484 gimple_build_label (tree label)
486 gimple p = gimple_build_with_ops (GIMPLE_LABEL, ERROR_MARK, 1);
487 gimple_label_set_label (p, label);
491 /* Build a GIMPLE_GOTO statement to label DEST. */
494 gimple_build_goto (tree dest)
496 gimple p = gimple_build_with_ops (GIMPLE_GOTO, ERROR_MARK, 1);
497 gimple_goto_set_dest (p, dest);
502 /* Build a GIMPLE_NOP statement. */
505 gimple_build_nop (void)
507 return gimple_alloc (GIMPLE_NOP, 0);
511 /* Build a GIMPLE_BIND statement.
512 VARS are the variables in BODY.
513 BLOCK is the containing block. */
516 gimple_build_bind (tree vars, gimple_seq body, tree block)
518 gimple p = gimple_alloc (GIMPLE_BIND, 0);
519 gimple_bind_set_vars (p, vars);
521 gimple_bind_set_body (p, body);
523 gimple_bind_set_block (p, block);
527 /* Helper function to set the simple fields of a asm stmt.
529 STRING is a pointer to a string that is the asm blocks assembly code.
530 NINPUT is the number of register inputs.
531 NOUTPUT is the number of register outputs.
532 NCLOBBERS is the number of clobbered registers.
536 gimple_build_asm_1 (const char *string, unsigned ninputs, unsigned noutputs,
537 unsigned nclobbers, unsigned nlabels)
540 int size = strlen (string);
542 /* ASMs with labels cannot have outputs. This should have been
543 enforced by the front end. */
544 gcc_assert (nlabels == 0 || noutputs == 0);
546 p = gimple_build_with_ops (GIMPLE_ASM, ERROR_MARK,
547 ninputs + noutputs + nclobbers + nlabels);
549 p->gimple_asm.ni = ninputs;
550 p->gimple_asm.no = noutputs;
551 p->gimple_asm.nc = nclobbers;
552 p->gimple_asm.nl = nlabels;
553 p->gimple_asm.string = ggc_alloc_string (string, size);
555 #ifdef GATHER_STATISTICS
556 gimple_alloc_sizes[(int) gimple_alloc_kind (GIMPLE_ASM)] += size;
562 /* Build a GIMPLE_ASM statement.
564 STRING is the assembly code.
565 NINPUT is the number of register inputs.
566 NOUTPUT is the number of register outputs.
567 NCLOBBERS is the number of clobbered registers.
568 INPUTS is a vector of the input register parameters.
569 OUTPUTS is a vector of the output register parameters.
570 CLOBBERS is a vector of the clobbered register parameters.
571 LABELS is a vector of destination labels. */
574 gimple_build_asm_vec (const char *string, VEC(tree,gc)* inputs,
575 VEC(tree,gc)* outputs, VEC(tree,gc)* clobbers,
576 VEC(tree,gc)* labels)
581 p = gimple_build_asm_1 (string,
582 VEC_length (tree, inputs),
583 VEC_length (tree, outputs),
584 VEC_length (tree, clobbers),
585 VEC_length (tree, labels));
587 for (i = 0; i < VEC_length (tree, inputs); i++)
588 gimple_asm_set_input_op (p, i, VEC_index (tree, inputs, i));
590 for (i = 0; i < VEC_length (tree, outputs); i++)
591 gimple_asm_set_output_op (p, i, VEC_index (tree, outputs, i));
593 for (i = 0; i < VEC_length (tree, clobbers); i++)
594 gimple_asm_set_clobber_op (p, i, VEC_index (tree, clobbers, i));
596 for (i = 0; i < VEC_length (tree, labels); i++)
597 gimple_asm_set_label_op (p, i, VEC_index (tree, labels, i));
602 /* Build a GIMPLE_CATCH statement.
604 TYPES are the catch types.
605 HANDLER is the exception handler. */
608 gimple_build_catch (tree types, gimple_seq handler)
610 gimple p = gimple_alloc (GIMPLE_CATCH, 0);
611 gimple_catch_set_types (p, types);
613 gimple_catch_set_handler (p, handler);
618 /* Build a GIMPLE_EH_FILTER statement.
620 TYPES are the filter's types.
621 FAILURE is the filter's failure action. */
624 gimple_build_eh_filter (tree types, gimple_seq failure)
626 gimple p = gimple_alloc (GIMPLE_EH_FILTER, 0);
627 gimple_eh_filter_set_types (p, types);
629 gimple_eh_filter_set_failure (p, failure);
634 /* Build a GIMPLE_EH_MUST_NOT_THROW statement. */
637 gimple_build_eh_must_not_throw (tree decl)
639 gimple p = gimple_alloc (GIMPLE_EH_MUST_NOT_THROW, 1);
641 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL);
642 gcc_assert (flags_from_decl_or_type (decl) & ECF_NORETURN);
643 gimple_eh_must_not_throw_set_fndecl (p, decl);
648 /* Build a GIMPLE_TRY statement.
650 EVAL is the expression to evaluate.
651 CLEANUP is the cleanup expression.
652 KIND is either GIMPLE_TRY_CATCH or GIMPLE_TRY_FINALLY depending on
653 whether this is a try/catch or a try/finally respectively. */
656 gimple_build_try (gimple_seq eval, gimple_seq cleanup,
657 enum gimple_try_flags kind)
661 gcc_assert (kind == GIMPLE_TRY_CATCH || kind == GIMPLE_TRY_FINALLY);
662 p = gimple_alloc (GIMPLE_TRY, 0);
663 gimple_set_subcode (p, kind);
665 gimple_try_set_eval (p, eval);
667 gimple_try_set_cleanup (p, cleanup);
672 /* Construct a GIMPLE_WITH_CLEANUP_EXPR statement.
674 CLEANUP is the cleanup expression. */
677 gimple_build_wce (gimple_seq cleanup)
679 gimple p = gimple_alloc (GIMPLE_WITH_CLEANUP_EXPR, 0);
681 gimple_wce_set_cleanup (p, cleanup);
687 /* Build a GIMPLE_RESX statement. */
690 gimple_build_resx (int region)
692 gimple p = gimple_build_with_ops (GIMPLE_RESX, ERROR_MARK, 0);
693 p->gimple_eh_ctrl.region = region;
698 /* The helper for constructing a gimple switch statement.
699 INDEX is the switch's index.
700 NLABELS is the number of labels in the switch excluding the default.
701 DEFAULT_LABEL is the default label for the switch statement. */
704 gimple_build_switch_nlabels (unsigned nlabels, tree index, tree default_label)
706 /* nlabels + 1 default label + 1 index. */
707 gimple p = gimple_build_with_ops (GIMPLE_SWITCH, ERROR_MARK,
708 1 + (default_label != NULL) + nlabels);
709 gimple_switch_set_index (p, index);
711 gimple_switch_set_default_label (p, default_label);
716 /* Build a GIMPLE_SWITCH statement.
718 INDEX is the switch's index.
719 NLABELS is the number of labels in the switch excluding the DEFAULT_LABEL.
720 ... are the labels excluding the default. */
723 gimple_build_switch (unsigned nlabels, tree index, tree default_label, ...)
727 gimple p = gimple_build_switch_nlabels (nlabels, index, default_label);
729 /* Store the rest of the labels. */
730 va_start (al, default_label);
731 offset = (default_label != NULL);
732 for (i = 0; i < nlabels; i++)
733 gimple_switch_set_label (p, i + offset, va_arg (al, tree));
740 /* Build a GIMPLE_SWITCH statement.
742 INDEX is the switch's index.
743 DEFAULT_LABEL is the default label
744 ARGS is a vector of labels excluding the default. */
747 gimple_build_switch_vec (tree index, tree default_label, VEC(tree, heap) *args)
749 unsigned i, offset, nlabels = VEC_length (tree, args);
750 gimple p = gimple_build_switch_nlabels (nlabels, index, default_label);
752 /* Copy the labels from the vector to the switch statement. */
753 offset = (default_label != NULL);
754 for (i = 0; i < nlabels; i++)
755 gimple_switch_set_label (p, i + offset, VEC_index (tree, args, i));
760 /* Build a GIMPLE_EH_DISPATCH statement. */
763 gimple_build_eh_dispatch (int region)
765 gimple p = gimple_build_with_ops (GIMPLE_EH_DISPATCH, ERROR_MARK, 0);
766 p->gimple_eh_ctrl.region = region;
770 /* Build a new GIMPLE_DEBUG_BIND statement.
772 VAR is bound to VALUE; block and location are taken from STMT. */
775 gimple_build_debug_bind_stat (tree var, tree value, gimple stmt MEM_STAT_DECL)
777 gimple p = gimple_build_with_ops_stat (GIMPLE_DEBUG,
778 (unsigned)GIMPLE_DEBUG_BIND, 2
781 gimple_debug_bind_set_var (p, var);
782 gimple_debug_bind_set_value (p, value);
785 gimple_set_block (p, gimple_block (stmt));
786 gimple_set_location (p, gimple_location (stmt));
793 /* Build a GIMPLE_OMP_CRITICAL statement.
795 BODY is the sequence of statements for which only one thread can execute.
796 NAME is optional identifier for this critical block. */
799 gimple_build_omp_critical (gimple_seq body, tree name)
801 gimple p = gimple_alloc (GIMPLE_OMP_CRITICAL, 0);
802 gimple_omp_critical_set_name (p, name);
804 gimple_omp_set_body (p, body);
809 /* Build a GIMPLE_OMP_FOR statement.
811 BODY is sequence of statements inside the for loop.
812 CLAUSES, are any of the OMP loop construct's clauses: private, firstprivate,
813 lastprivate, reductions, ordered, schedule, and nowait.
814 COLLAPSE is the collapse count.
815 PRE_BODY is the sequence of statements that are loop invariant. */
818 gimple_build_omp_for (gimple_seq body, tree clauses, size_t collapse,
821 gimple p = gimple_alloc (GIMPLE_OMP_FOR, 0);
823 gimple_omp_set_body (p, body);
824 gimple_omp_for_set_clauses (p, clauses);
825 p->gimple_omp_for.collapse = collapse;
826 p->gimple_omp_for.iter = GGC_CNEWVEC (struct gimple_omp_for_iter, collapse);
828 gimple_omp_for_set_pre_body (p, pre_body);
834 /* Build a GIMPLE_OMP_PARALLEL statement.
836 BODY is sequence of statements which are executed in parallel.
837 CLAUSES, are the OMP parallel construct's clauses.
838 CHILD_FN is the function created for the parallel threads to execute.
839 DATA_ARG are the shared data argument(s). */
842 gimple_build_omp_parallel (gimple_seq body, tree clauses, tree child_fn,
845 gimple p = gimple_alloc (GIMPLE_OMP_PARALLEL, 0);
847 gimple_omp_set_body (p, body);
848 gimple_omp_parallel_set_clauses (p, clauses);
849 gimple_omp_parallel_set_child_fn (p, child_fn);
850 gimple_omp_parallel_set_data_arg (p, data_arg);
856 /* Build a GIMPLE_OMP_TASK statement.
858 BODY is sequence of statements which are executed by the explicit task.
859 CLAUSES, are the OMP parallel construct's clauses.
860 CHILD_FN is the function created for the parallel threads to execute.
861 DATA_ARG are the shared data argument(s).
862 COPY_FN is the optional function for firstprivate initialization.
863 ARG_SIZE and ARG_ALIGN are size and alignment of the data block. */
866 gimple_build_omp_task (gimple_seq body, tree clauses, tree child_fn,
867 tree data_arg, tree copy_fn, tree arg_size,
870 gimple p = gimple_alloc (GIMPLE_OMP_TASK, 0);
872 gimple_omp_set_body (p, body);
873 gimple_omp_task_set_clauses (p, clauses);
874 gimple_omp_task_set_child_fn (p, child_fn);
875 gimple_omp_task_set_data_arg (p, data_arg);
876 gimple_omp_task_set_copy_fn (p, copy_fn);
877 gimple_omp_task_set_arg_size (p, arg_size);
878 gimple_omp_task_set_arg_align (p, arg_align);
884 /* Build a GIMPLE_OMP_SECTION statement for a sections statement.
886 BODY is the sequence of statements in the section. */
889 gimple_build_omp_section (gimple_seq body)
891 gimple p = gimple_alloc (GIMPLE_OMP_SECTION, 0);
893 gimple_omp_set_body (p, body);
899 /* Build a GIMPLE_OMP_MASTER statement.
901 BODY is the sequence of statements to be executed by just the master. */
904 gimple_build_omp_master (gimple_seq body)
906 gimple p = gimple_alloc (GIMPLE_OMP_MASTER, 0);
908 gimple_omp_set_body (p, body);
914 /* Build a GIMPLE_OMP_CONTINUE statement.
916 CONTROL_DEF is the definition of the control variable.
917 CONTROL_USE is the use of the control variable. */
920 gimple_build_omp_continue (tree control_def, tree control_use)
922 gimple p = gimple_alloc (GIMPLE_OMP_CONTINUE, 0);
923 gimple_omp_continue_set_control_def (p, control_def);
924 gimple_omp_continue_set_control_use (p, control_use);
928 /* Build a GIMPLE_OMP_ORDERED statement.
930 BODY is the sequence of statements inside a loop that will executed in
934 gimple_build_omp_ordered (gimple_seq body)
936 gimple p = gimple_alloc (GIMPLE_OMP_ORDERED, 0);
938 gimple_omp_set_body (p, body);
944 /* Build a GIMPLE_OMP_RETURN statement.
945 WAIT_P is true if this is a non-waiting return. */
948 gimple_build_omp_return (bool wait_p)
950 gimple p = gimple_alloc (GIMPLE_OMP_RETURN, 0);
952 gimple_omp_return_set_nowait (p);
958 /* Build a GIMPLE_OMP_SECTIONS statement.
960 BODY is a sequence of section statements.
961 CLAUSES are any of the OMP sections contsruct's clauses: private,
962 firstprivate, lastprivate, reduction, and nowait. */
965 gimple_build_omp_sections (gimple_seq body, tree clauses)
967 gimple p = gimple_alloc (GIMPLE_OMP_SECTIONS, 0);
969 gimple_omp_set_body (p, body);
970 gimple_omp_sections_set_clauses (p, clauses);
976 /* Build a GIMPLE_OMP_SECTIONS_SWITCH. */
979 gimple_build_omp_sections_switch (void)
981 return gimple_alloc (GIMPLE_OMP_SECTIONS_SWITCH, 0);
985 /* Build a GIMPLE_OMP_SINGLE statement.
987 BODY is the sequence of statements that will be executed once.
988 CLAUSES are any of the OMP single construct's clauses: private, firstprivate,
989 copyprivate, nowait. */
992 gimple_build_omp_single (gimple_seq body, tree clauses)
994 gimple p = gimple_alloc (GIMPLE_OMP_SINGLE, 0);
996 gimple_omp_set_body (p, body);
997 gimple_omp_single_set_clauses (p, clauses);
1003 /* Build a GIMPLE_OMP_ATOMIC_LOAD statement. */
1006 gimple_build_omp_atomic_load (tree lhs, tree rhs)
1008 gimple p = gimple_alloc (GIMPLE_OMP_ATOMIC_LOAD, 0);
1009 gimple_omp_atomic_load_set_lhs (p, lhs);
1010 gimple_omp_atomic_load_set_rhs (p, rhs);
1014 /* Build a GIMPLE_OMP_ATOMIC_STORE statement.
1016 VAL is the value we are storing. */
1019 gimple_build_omp_atomic_store (tree val)
1021 gimple p = gimple_alloc (GIMPLE_OMP_ATOMIC_STORE, 0);
1022 gimple_omp_atomic_store_set_val (p, val);
1026 /* Build a GIMPLE_PREDICT statement. PREDICT is one of the predictors from
1027 predict.def, OUTCOME is NOT_TAKEN or TAKEN. */
1030 gimple_build_predict (enum br_predictor predictor, enum prediction outcome)
1032 gimple p = gimple_alloc (GIMPLE_PREDICT, 0);
1033 /* Ensure all the predictors fit into the lower bits of the subcode. */
1034 gcc_assert ((int) END_PREDICTORS <= GF_PREDICT_TAKEN);
1035 gimple_predict_set_predictor (p, predictor);
1036 gimple_predict_set_outcome (p, outcome);
1040 #if defined ENABLE_GIMPLE_CHECKING
1041 /* Complain of a gimple type mismatch and die. */
1044 gimple_check_failed (const_gimple gs, const char *file, int line,
1045 const char *function, enum gimple_code code,
1046 enum tree_code subcode)
1048 internal_error ("gimple check: expected %s(%s), have %s(%s) in %s, at %s:%d",
1049 gimple_code_name[code],
1050 tree_code_name[subcode],
1051 gimple_code_name[gimple_code (gs)],
1052 gs->gsbase.subcode > 0
1053 ? tree_code_name[gs->gsbase.subcode]
1055 function, trim_filename (file), line);
1057 #endif /* ENABLE_GIMPLE_CHECKING */
1060 /* Allocate a new GIMPLE sequence in GC memory and return it. If
1061 there are free sequences in GIMPLE_SEQ_CACHE return one of those
1065 gimple_seq_alloc (void)
1067 gimple_seq seq = gimple_seq_cache;
1070 gimple_seq_cache = gimple_seq_cache->next_free;
1071 gcc_assert (gimple_seq_cache != seq);
1072 memset (seq, 0, sizeof (*seq));
1076 seq = (gimple_seq) ggc_alloc_cleared (sizeof (*seq));
1077 #ifdef GATHER_STATISTICS
1078 gimple_alloc_counts[(int) gimple_alloc_kind_seq]++;
1079 gimple_alloc_sizes[(int) gimple_alloc_kind_seq] += sizeof (*seq);
1086 /* Return SEQ to the free pool of GIMPLE sequences. */
1089 gimple_seq_free (gimple_seq seq)
1094 gcc_assert (gimple_seq_first (seq) == NULL);
1095 gcc_assert (gimple_seq_last (seq) == NULL);
1097 /* If this triggers, it's a sign that the same list is being freed
1099 gcc_assert (seq != gimple_seq_cache || gimple_seq_cache == NULL);
1101 /* Add SEQ to the pool of free sequences. */
1102 seq->next_free = gimple_seq_cache;
1103 gimple_seq_cache = seq;
1107 /* Link gimple statement GS to the end of the sequence *SEQ_P. If
1108 *SEQ_P is NULL, a new sequence is allocated. */
1111 gimple_seq_add_stmt (gimple_seq *seq_p, gimple gs)
1113 gimple_stmt_iterator si;
1119 *seq_p = gimple_seq_alloc ();
1121 si = gsi_last (*seq_p);
1122 gsi_insert_after (&si, gs, GSI_NEW_STMT);
1126 /* Append sequence SRC to the end of sequence *DST_P. If *DST_P is
1127 NULL, a new sequence is allocated. */
1130 gimple_seq_add_seq (gimple_seq *dst_p, gimple_seq src)
1132 gimple_stmt_iterator si;
1138 *dst_p = gimple_seq_alloc ();
1140 si = gsi_last (*dst_p);
1141 gsi_insert_seq_after (&si, src, GSI_NEW_STMT);
1145 /* Helper function of empty_body_p. Return true if STMT is an empty
1149 empty_stmt_p (gimple stmt)
1151 if (gimple_code (stmt) == GIMPLE_NOP)
1153 if (gimple_code (stmt) == GIMPLE_BIND)
1154 return empty_body_p (gimple_bind_body (stmt));
1159 /* Return true if BODY contains nothing but empty statements. */
1162 empty_body_p (gimple_seq body)
1164 gimple_stmt_iterator i;
1166 if (gimple_seq_empty_p (body))
1168 for (i = gsi_start (body); !gsi_end_p (i); gsi_next (&i))
1169 if (!empty_stmt_p (gsi_stmt (i))
1170 && !is_gimple_debug (gsi_stmt (i)))
1177 /* Perform a deep copy of sequence SRC and return the result. */
1180 gimple_seq_copy (gimple_seq src)
1182 gimple_stmt_iterator gsi;
1183 gimple_seq new_seq = gimple_seq_alloc ();
1186 for (gsi = gsi_start (src); !gsi_end_p (gsi); gsi_next (&gsi))
1188 stmt = gimple_copy (gsi_stmt (gsi));
1189 gimple_seq_add_stmt (&new_seq, stmt);
1196 /* Walk all the statements in the sequence SEQ calling walk_gimple_stmt
1197 on each one. WI is as in walk_gimple_stmt.
1199 If walk_gimple_stmt returns non-NULL, the walk is stopped, the
1200 value is stored in WI->CALLBACK_RESULT and the statement that
1201 produced the value is returned.
1203 Otherwise, all the statements are walked and NULL returned. */
1206 walk_gimple_seq (gimple_seq seq, walk_stmt_fn callback_stmt,
1207 walk_tree_fn callback_op, struct walk_stmt_info *wi)
1209 gimple_stmt_iterator gsi;
1211 for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi))
1213 tree ret = walk_gimple_stmt (&gsi, callback_stmt, callback_op, wi);
1216 /* If CALLBACK_STMT or CALLBACK_OP return a value, WI must exist
1219 wi->callback_result = ret;
1220 return gsi_stmt (gsi);
1225 wi->callback_result = NULL_TREE;
1231 /* Helper function for walk_gimple_stmt. Walk operands of a GIMPLE_ASM. */
1234 walk_gimple_asm (gimple stmt, walk_tree_fn callback_op,
1235 struct walk_stmt_info *wi)
1239 const char **oconstraints;
1241 const char *constraint;
1242 bool allows_mem, allows_reg, is_inout;
1244 noutputs = gimple_asm_noutputs (stmt);
1245 oconstraints = (const char **) alloca ((noutputs) * sizeof (const char *));
1250 for (i = 0; i < noutputs; i++)
1252 op = gimple_asm_output_op (stmt, i);
1253 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
1254 oconstraints[i] = constraint;
1255 parse_output_constraint (&constraint, i, 0, 0, &allows_mem, &allows_reg,
1258 wi->val_only = (allows_reg || !allows_mem);
1259 ret = walk_tree (&TREE_VALUE (op), callback_op, wi, NULL);
1264 n = gimple_asm_ninputs (stmt);
1265 for (i = 0; i < n; i++)
1267 op = gimple_asm_input_op (stmt, i);
1268 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (op)));
1269 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
1270 oconstraints, &allows_mem, &allows_reg);
1273 wi->val_only = (allows_reg || !allows_mem);
1274 /* Although input "m" is not really a LHS, we need a lvalue. */
1275 wi->is_lhs = !wi->val_only;
1277 ret = walk_tree (&TREE_VALUE (op), callback_op, wi, NULL);
1285 wi->val_only = true;
1288 n = gimple_asm_nlabels (stmt);
1289 for (i = 0; i < n; i++)
1291 op = gimple_asm_label_op (stmt, i);
1292 ret = walk_tree (&TREE_VALUE (op), callback_op, wi, NULL);
1301 /* Helper function of WALK_GIMPLE_STMT. Walk every tree operand in
1302 STMT. CALLBACK_OP and WI are as in WALK_GIMPLE_STMT.
1304 CALLBACK_OP is called on each operand of STMT via walk_tree.
1305 Additional parameters to walk_tree must be stored in WI. For each operand
1306 OP, walk_tree is called as:
1308 walk_tree (&OP, CALLBACK_OP, WI, WI->PSET)
1310 If CALLBACK_OP returns non-NULL for an operand, the remaining
1311 operands are not scanned.
1313 The return value is that returned by the last call to walk_tree, or
1314 NULL_TREE if no CALLBACK_OP is specified. */
1317 walk_gimple_op (gimple stmt, walk_tree_fn callback_op,
1318 struct walk_stmt_info *wi)
1320 struct pointer_set_t *pset = (wi) ? wi->pset : NULL;
1322 tree ret = NULL_TREE;
1324 switch (gimple_code (stmt))
1327 /* Walk the RHS operands. If the LHS is of a non-renamable type or
1328 is a register variable, we may use a COMPONENT_REF on the RHS. */
1331 tree lhs = gimple_assign_lhs (stmt);
1333 = (is_gimple_reg_type (TREE_TYPE (lhs)) && !is_gimple_reg (lhs))
1334 || !gimple_assign_single_p (stmt);
1337 for (i = 1; i < gimple_num_ops (stmt); i++)
1339 ret = walk_tree (gimple_op_ptr (stmt, i), callback_op, wi,
1345 /* Walk the LHS. If the RHS is appropriate for a memory, we
1346 may use a COMPONENT_REF on the LHS. */
1349 /* If the RHS has more than 1 operand, it is not appropriate
1351 wi->val_only = !is_gimple_mem_rhs (gimple_assign_rhs1 (stmt))
1352 || !gimple_assign_single_p (stmt);
1356 ret = walk_tree (gimple_op_ptr (stmt, 0), callback_op, wi, pset);
1362 wi->val_only = true;
1371 ret = walk_tree (gimple_call_chain_ptr (stmt), callback_op, wi, pset);
1375 ret = walk_tree (gimple_call_fn_ptr (stmt), callback_op, wi, pset);
1379 for (i = 0; i < gimple_call_num_args (stmt); i++)
1381 ret = walk_tree (gimple_call_arg_ptr (stmt, i), callback_op, wi,
1390 ret = walk_tree (gimple_call_lhs_ptr (stmt), callback_op, wi, pset);
1399 ret = walk_tree (gimple_catch_types_ptr (stmt), callback_op, wi,
1405 case GIMPLE_EH_FILTER:
1406 ret = walk_tree (gimple_eh_filter_types_ptr (stmt), callback_op, wi,
1413 ret = walk_gimple_asm (stmt, callback_op, wi);
1418 case GIMPLE_OMP_CONTINUE:
1419 ret = walk_tree (gimple_omp_continue_control_def_ptr (stmt),
1420 callback_op, wi, pset);
1424 ret = walk_tree (gimple_omp_continue_control_use_ptr (stmt),
1425 callback_op, wi, pset);
1430 case GIMPLE_OMP_CRITICAL:
1431 ret = walk_tree (gimple_omp_critical_name_ptr (stmt), callback_op, wi,
1437 case GIMPLE_OMP_FOR:
1438 ret = walk_tree (gimple_omp_for_clauses_ptr (stmt), callback_op, wi,
1442 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
1444 ret = walk_tree (gimple_omp_for_index_ptr (stmt, i), callback_op,
1448 ret = walk_tree (gimple_omp_for_initial_ptr (stmt, i), callback_op,
1452 ret = walk_tree (gimple_omp_for_final_ptr (stmt, i), callback_op,
1456 ret = walk_tree (gimple_omp_for_incr_ptr (stmt, i), callback_op,
1463 case GIMPLE_OMP_PARALLEL:
1464 ret = walk_tree (gimple_omp_parallel_clauses_ptr (stmt), callback_op,
1468 ret = walk_tree (gimple_omp_parallel_child_fn_ptr (stmt), callback_op,
1472 ret = walk_tree (gimple_omp_parallel_data_arg_ptr (stmt), callback_op,
1478 case GIMPLE_OMP_TASK:
1479 ret = walk_tree (gimple_omp_task_clauses_ptr (stmt), callback_op,
1483 ret = walk_tree (gimple_omp_task_child_fn_ptr (stmt), callback_op,
1487 ret = walk_tree (gimple_omp_task_data_arg_ptr (stmt), callback_op,
1491 ret = walk_tree (gimple_omp_task_copy_fn_ptr (stmt), callback_op,
1495 ret = walk_tree (gimple_omp_task_arg_size_ptr (stmt), callback_op,
1499 ret = walk_tree (gimple_omp_task_arg_align_ptr (stmt), callback_op,
1505 case GIMPLE_OMP_SECTIONS:
1506 ret = walk_tree (gimple_omp_sections_clauses_ptr (stmt), callback_op,
1511 ret = walk_tree (gimple_omp_sections_control_ptr (stmt), callback_op,
1518 case GIMPLE_OMP_SINGLE:
1519 ret = walk_tree (gimple_omp_single_clauses_ptr (stmt), callback_op, wi,
1525 case GIMPLE_OMP_ATOMIC_LOAD:
1526 ret = walk_tree (gimple_omp_atomic_load_lhs_ptr (stmt), callback_op, wi,
1531 ret = walk_tree (gimple_omp_atomic_load_rhs_ptr (stmt), callback_op, wi,
1537 case GIMPLE_OMP_ATOMIC_STORE:
1538 ret = walk_tree (gimple_omp_atomic_store_val_ptr (stmt), callback_op,
1544 /* Tuples that do not have operands. */
1547 case GIMPLE_OMP_RETURN:
1548 case GIMPLE_PREDICT:
1553 enum gimple_statement_structure_enum gss;
1554 gss = gimple_statement_structure (stmt);
1555 if (gss == GSS_WITH_OPS || gss == GSS_WITH_MEM_OPS)
1556 for (i = 0; i < gimple_num_ops (stmt); i++)
1558 ret = walk_tree (gimple_op_ptr (stmt, i), callback_op, wi, pset);
1570 /* Walk the current statement in GSI (optionally using traversal state
1571 stored in WI). If WI is NULL, no state is kept during traversal.
1572 The callback CALLBACK_STMT is called. If CALLBACK_STMT indicates
1573 that it has handled all the operands of the statement, its return
1574 value is returned. Otherwise, the return value from CALLBACK_STMT
1575 is discarded and its operands are scanned.
1577 If CALLBACK_STMT is NULL or it didn't handle the operands,
1578 CALLBACK_OP is called on each operand of the statement via
1579 walk_gimple_op. If walk_gimple_op returns non-NULL for any
1580 operand, the remaining operands are not scanned. In this case, the
1581 return value from CALLBACK_OP is returned.
1583 In any other case, NULL_TREE is returned. */
1586 walk_gimple_stmt (gimple_stmt_iterator *gsi, walk_stmt_fn callback_stmt,
1587 walk_tree_fn callback_op, struct walk_stmt_info *wi)
1591 gimple stmt = gsi_stmt (*gsi);
1596 if (wi && wi->want_locations && gimple_has_location (stmt))
1597 input_location = gimple_location (stmt);
1601 /* Invoke the statement callback. Return if the callback handled
1602 all of STMT operands by itself. */
1605 bool handled_ops = false;
1606 tree_ret = callback_stmt (gsi, &handled_ops, wi);
1610 /* If CALLBACK_STMT did not handle operands, it should not have
1611 a value to return. */
1612 gcc_assert (tree_ret == NULL);
1614 /* Re-read stmt in case the callback changed it. */
1615 stmt = gsi_stmt (*gsi);
1618 /* If CALLBACK_OP is defined, invoke it on every operand of STMT. */
1621 tree_ret = walk_gimple_op (stmt, callback_op, wi);
1626 /* If STMT can have statements inside (e.g. GIMPLE_BIND), walk them. */
1627 switch (gimple_code (stmt))
1630 ret = walk_gimple_seq (gimple_bind_body (stmt), callback_stmt,
1633 return wi->callback_result;
1637 ret = walk_gimple_seq (gimple_catch_handler (stmt), callback_stmt,
1640 return wi->callback_result;
1643 case GIMPLE_EH_FILTER:
1644 ret = walk_gimple_seq (gimple_eh_filter_failure (stmt), callback_stmt,
1647 return wi->callback_result;
1651 ret = walk_gimple_seq (gimple_try_eval (stmt), callback_stmt, callback_op,
1654 return wi->callback_result;
1656 ret = walk_gimple_seq (gimple_try_cleanup (stmt), callback_stmt,
1659 return wi->callback_result;
1662 case GIMPLE_OMP_FOR:
1663 ret = walk_gimple_seq (gimple_omp_for_pre_body (stmt), callback_stmt,
1666 return wi->callback_result;
1669 case GIMPLE_OMP_CRITICAL:
1670 case GIMPLE_OMP_MASTER:
1671 case GIMPLE_OMP_ORDERED:
1672 case GIMPLE_OMP_SECTION:
1673 case GIMPLE_OMP_PARALLEL:
1674 case GIMPLE_OMP_TASK:
1675 case GIMPLE_OMP_SECTIONS:
1676 case GIMPLE_OMP_SINGLE:
1677 ret = walk_gimple_seq (gimple_omp_body (stmt), callback_stmt, callback_op,
1680 return wi->callback_result;
1683 case GIMPLE_WITH_CLEANUP_EXPR:
1684 ret = walk_gimple_seq (gimple_wce_cleanup (stmt), callback_stmt,
1687 return wi->callback_result;
1691 gcc_assert (!gimple_has_substatements (stmt));
1699 /* Set sequence SEQ to be the GIMPLE body for function FN. */
1702 gimple_set_body (tree fndecl, gimple_seq seq)
1704 struct function *fn = DECL_STRUCT_FUNCTION (fndecl);
1707 /* If FNDECL still does not have a function structure associated
1708 with it, then it does not make sense for it to receive a
1710 gcc_assert (seq == NULL);
1713 fn->gimple_body = seq;
1717 /* Return the body of GIMPLE statements for function FN. */
1720 gimple_body (tree fndecl)
1722 struct function *fn = DECL_STRUCT_FUNCTION (fndecl);
1723 return fn ? fn->gimple_body : NULL;
1726 /* Return true when FNDECL has Gimple body either in unlowered
1729 gimple_has_body_p (tree fndecl)
1731 struct function *fn = DECL_STRUCT_FUNCTION (fndecl);
1732 return (gimple_body (fndecl) || (fn && fn->cfg));
1735 /* Detect flags from a GIMPLE_CALL. This is just like
1736 call_expr_flags, but for gimple tuples. */
1739 gimple_call_flags (const_gimple stmt)
1742 tree decl = gimple_call_fndecl (stmt);
1746 flags = flags_from_decl_or_type (decl);
1749 t = TREE_TYPE (gimple_call_fn (stmt));
1750 if (t && TREE_CODE (t) == POINTER_TYPE)
1751 flags = flags_from_decl_or_type (TREE_TYPE (t));
1759 /* Detects argument flags for argument number ARG on call STMT. */
1762 gimple_call_arg_flags (const_gimple stmt, unsigned arg)
1764 tree type = TREE_TYPE (TREE_TYPE (gimple_call_fn (stmt)));
1765 tree attr = lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type));
1769 attr = TREE_VALUE (TREE_VALUE (attr));
1770 if (1 + arg >= (unsigned) TREE_STRING_LENGTH (attr))
1773 switch (TREE_STRING_POINTER (attr)[1 + arg])
1780 return EAF_DIRECT | EAF_NOCLOBBER | EAF_NOESCAPE;
1783 return EAF_NOCLOBBER | EAF_NOESCAPE;
1786 return EAF_DIRECT | EAF_NOESCAPE;
1789 return EAF_NOESCAPE;
1797 /* Detects return flags for the call STMT. */
1800 gimple_call_return_flags (const_gimple stmt)
1803 tree attr = NULL_TREE;
1805 if (gimple_call_flags (stmt) & ECF_MALLOC)
1808 type = TREE_TYPE (TREE_TYPE (gimple_call_fn (stmt)));
1809 attr = lookup_attribute ("fn spec", TYPE_ATTRIBUTES (type));
1813 attr = TREE_VALUE (TREE_VALUE (attr));
1814 if (TREE_STRING_LENGTH (attr) < 1)
1817 switch (TREE_STRING_POINTER (attr)[0])
1823 return ERF_RETURNS_ARG | (TREE_STRING_POINTER (attr)[0] - '1');
1834 /* Return true if GS is a copy assignment. */
1837 gimple_assign_copy_p (gimple gs)
1839 return gimple_code (gs) == GIMPLE_ASSIGN
1840 && get_gimple_rhs_class (gimple_assign_rhs_code (gs))
1841 == GIMPLE_SINGLE_RHS
1842 && is_gimple_val (gimple_op (gs, 1));
1846 /* Return true if GS is a SSA_NAME copy assignment. */
1849 gimple_assign_ssa_name_copy_p (gimple gs)
1851 return (gimple_code (gs) == GIMPLE_ASSIGN
1852 && (get_gimple_rhs_class (gimple_assign_rhs_code (gs))
1853 == GIMPLE_SINGLE_RHS)
1854 && TREE_CODE (gimple_assign_lhs (gs)) == SSA_NAME
1855 && TREE_CODE (gimple_assign_rhs1 (gs)) == SSA_NAME);
1859 /* Return true if GS is an assignment with a singleton RHS, i.e.,
1860 there is no operator associated with the assignment itself.
1861 Unlike gimple_assign_copy_p, this predicate returns true for
1862 any RHS operand, including those that perform an operation
1863 and do not have the semantics of a copy, such as COND_EXPR. */
1866 gimple_assign_single_p (gimple gs)
1868 return (gimple_code (gs) == GIMPLE_ASSIGN
1869 && get_gimple_rhs_class (gimple_assign_rhs_code (gs))
1870 == GIMPLE_SINGLE_RHS);
1873 /* Return true if GS is an assignment with a unary RHS, but the
1874 operator has no effect on the assigned value. The logic is adapted
1875 from STRIP_NOPS. This predicate is intended to be used in tuplifying
1876 instances in which STRIP_NOPS was previously applied to the RHS of
1879 NOTE: In the use cases that led to the creation of this function
1880 and of gimple_assign_single_p, it is typical to test for either
1881 condition and to proceed in the same manner. In each case, the
1882 assigned value is represented by the single RHS operand of the
1883 assignment. I suspect there may be cases where gimple_assign_copy_p,
1884 gimple_assign_single_p, or equivalent logic is used where a similar
1885 treatment of unary NOPs is appropriate. */
1888 gimple_assign_unary_nop_p (gimple gs)
1890 return (gimple_code (gs) == GIMPLE_ASSIGN
1891 && (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (gs))
1892 || gimple_assign_rhs_code (gs) == NON_LVALUE_EXPR)
1893 && gimple_assign_rhs1 (gs) != error_mark_node
1894 && (TYPE_MODE (TREE_TYPE (gimple_assign_lhs (gs)))
1895 == TYPE_MODE (TREE_TYPE (gimple_assign_rhs1 (gs)))));
1898 /* Set BB to be the basic block holding G. */
1901 gimple_set_bb (gimple stmt, basic_block bb)
1903 stmt->gsbase.bb = bb;
1905 /* If the statement is a label, add the label to block-to-labels map
1906 so that we can speed up edge creation for GIMPLE_GOTOs. */
1907 if (cfun->cfg && gimple_code (stmt) == GIMPLE_LABEL)
1912 t = gimple_label_label (stmt);
1913 uid = LABEL_DECL_UID (t);
1916 unsigned old_len = VEC_length (basic_block, label_to_block_map);
1917 LABEL_DECL_UID (t) = uid = cfun->cfg->last_label_uid++;
1918 if (old_len <= (unsigned) uid)
1920 unsigned new_len = 3 * uid / 2 + 1;
1922 VEC_safe_grow_cleared (basic_block, gc, label_to_block_map,
1927 VEC_replace (basic_block, label_to_block_map, uid, bb);
1932 /* Modify the RHS of the assignment pointed-to by GSI using the
1933 operands in the expression tree EXPR.
1935 NOTE: The statement pointed-to by GSI may be reallocated if it
1936 did not have enough operand slots.
1938 This function is useful to convert an existing tree expression into
1939 the flat representation used for the RHS of a GIMPLE assignment.
1940 It will reallocate memory as needed to expand or shrink the number
1941 of operand slots needed to represent EXPR.
1943 NOTE: If you find yourself building a tree and then calling this
1944 function, you are most certainly doing it the slow way. It is much
1945 better to build a new assignment or to use the function
1946 gimple_assign_set_rhs_with_ops, which does not require an
1947 expression tree to be built. */
1950 gimple_assign_set_rhs_from_tree (gimple_stmt_iterator *gsi, tree expr)
1952 enum tree_code subcode;
1955 extract_ops_from_tree (expr, &subcode, &op1, &op2);
1956 gimple_assign_set_rhs_with_ops (gsi, subcode, op1, op2);
1960 /* Set the RHS of assignment statement pointed-to by GSI to CODE with
1961 operands OP1 and OP2.
1963 NOTE: The statement pointed-to by GSI may be reallocated if it
1964 did not have enough operand slots. */
1967 gimple_assign_set_rhs_with_ops (gimple_stmt_iterator *gsi, enum tree_code code,
1970 unsigned new_rhs_ops = get_gimple_rhs_num_ops (code);
1971 gimple stmt = gsi_stmt (*gsi);
1973 /* If the new CODE needs more operands, allocate a new statement. */
1974 if (gimple_num_ops (stmt) < new_rhs_ops + 1)
1976 tree lhs = gimple_assign_lhs (stmt);
1977 gimple new_stmt = gimple_alloc (gimple_code (stmt), new_rhs_ops + 1);
1978 memcpy (new_stmt, stmt, gimple_size (gimple_code (stmt)));
1979 gsi_replace (gsi, new_stmt, true);
1982 /* The LHS needs to be reset as this also changes the SSA name
1984 gimple_assign_set_lhs (stmt, lhs);
1987 gimple_set_num_ops (stmt, new_rhs_ops + 1);
1988 gimple_set_subcode (stmt, code);
1989 gimple_assign_set_rhs1 (stmt, op1);
1990 if (new_rhs_ops > 1)
1991 gimple_assign_set_rhs2 (stmt, op2);
1995 /* Return the LHS of a statement that performs an assignment,
1996 either a GIMPLE_ASSIGN or a GIMPLE_CALL. Returns NULL_TREE
1997 for a call to a function that returns no value, or for a
1998 statement other than an assignment or a call. */
2001 gimple_get_lhs (const_gimple stmt)
2003 enum gimple_code code = gimple_code (stmt);
2005 if (code == GIMPLE_ASSIGN)
2006 return gimple_assign_lhs (stmt);
2007 else if (code == GIMPLE_CALL)
2008 return gimple_call_lhs (stmt);
2014 /* Set the LHS of a statement that performs an assignment,
2015 either a GIMPLE_ASSIGN or a GIMPLE_CALL. */
2018 gimple_set_lhs (gimple stmt, tree lhs)
2020 enum gimple_code code = gimple_code (stmt);
2022 if (code == GIMPLE_ASSIGN)
2023 gimple_assign_set_lhs (stmt, lhs);
2024 else if (code == GIMPLE_CALL)
2025 gimple_call_set_lhs (stmt, lhs);
2030 /* Replace the LHS of STMT, an assignment, either a GIMPLE_ASSIGN or a
2031 GIMPLE_CALL, with NLHS, in preparation for modifying the RHS to an
2032 expression with a different value.
2034 This will update any annotations (say debug bind stmts) referring
2035 to the original LHS, so that they use the RHS instead. This is
2036 done even if NLHS and LHS are the same, for it is understood that
2037 the RHS will be modified afterwards, and NLHS will not be assigned
2038 an equivalent value.
2040 Adjusting any non-annotation uses of the LHS, if needed, is a
2041 responsibility of the caller.
2043 The effect of this call should be pretty much the same as that of
2044 inserting a copy of STMT before STMT, and then removing the
2045 original stmt, at which time gsi_remove() would have update
2046 annotations, but using this function saves all the inserting,
2047 copying and removing. */
2050 gimple_replace_lhs (gimple stmt, tree nlhs)
2052 if (MAY_HAVE_DEBUG_STMTS)
2054 tree lhs = gimple_get_lhs (stmt);
2056 gcc_assert (SSA_NAME_DEF_STMT (lhs) == stmt);
2058 insert_debug_temp_for_var_def (NULL, lhs);
2061 gimple_set_lhs (stmt, nlhs);
2064 /* Return a deep copy of statement STMT. All the operands from STMT
2065 are reallocated and copied using unshare_expr. The DEF, USE, VDEF
2066 and VUSE operand arrays are set to empty in the new copy. */
2069 gimple_copy (gimple stmt)
2071 enum gimple_code code = gimple_code (stmt);
2072 unsigned num_ops = gimple_num_ops (stmt);
2073 gimple copy = gimple_alloc (code, num_ops);
2076 /* Shallow copy all the fields from STMT. */
2077 memcpy (copy, stmt, gimple_size (code));
2079 /* If STMT has sub-statements, deep-copy them as well. */
2080 if (gimple_has_substatements (stmt))
2085 switch (gimple_code (stmt))
2088 new_seq = gimple_seq_copy (gimple_bind_body (stmt));
2089 gimple_bind_set_body (copy, new_seq);
2090 gimple_bind_set_vars (copy, unshare_expr (gimple_bind_vars (stmt)));
2091 gimple_bind_set_block (copy, gimple_bind_block (stmt));
2095 new_seq = gimple_seq_copy (gimple_catch_handler (stmt));
2096 gimple_catch_set_handler (copy, new_seq);
2097 t = unshare_expr (gimple_catch_types (stmt));
2098 gimple_catch_set_types (copy, t);
2101 case GIMPLE_EH_FILTER:
2102 new_seq = gimple_seq_copy (gimple_eh_filter_failure (stmt));
2103 gimple_eh_filter_set_failure (copy, new_seq);
2104 t = unshare_expr (gimple_eh_filter_types (stmt));
2105 gimple_eh_filter_set_types (copy, t);
2109 new_seq = gimple_seq_copy (gimple_try_eval (stmt));
2110 gimple_try_set_eval (copy, new_seq);
2111 new_seq = gimple_seq_copy (gimple_try_cleanup (stmt));
2112 gimple_try_set_cleanup (copy, new_seq);
2115 case GIMPLE_OMP_FOR:
2116 new_seq = gimple_seq_copy (gimple_omp_for_pre_body (stmt));
2117 gimple_omp_for_set_pre_body (copy, new_seq);
2118 t = unshare_expr (gimple_omp_for_clauses (stmt));
2119 gimple_omp_for_set_clauses (copy, t);
2120 copy->gimple_omp_for.iter
2121 = GGC_NEWVEC (struct gimple_omp_for_iter,
2122 gimple_omp_for_collapse (stmt));
2123 for (i = 0; i < gimple_omp_for_collapse (stmt); i++)
2125 gimple_omp_for_set_cond (copy, i,
2126 gimple_omp_for_cond (stmt, i));
2127 gimple_omp_for_set_index (copy, i,
2128 gimple_omp_for_index (stmt, i));
2129 t = unshare_expr (gimple_omp_for_initial (stmt, i));
2130 gimple_omp_for_set_initial (copy, i, t);
2131 t = unshare_expr (gimple_omp_for_final (stmt, i));
2132 gimple_omp_for_set_final (copy, i, t);
2133 t = unshare_expr (gimple_omp_for_incr (stmt, i));
2134 gimple_omp_for_set_incr (copy, i, t);
2138 case GIMPLE_OMP_PARALLEL:
2139 t = unshare_expr (gimple_omp_parallel_clauses (stmt));
2140 gimple_omp_parallel_set_clauses (copy, t);
2141 t = unshare_expr (gimple_omp_parallel_child_fn (stmt));
2142 gimple_omp_parallel_set_child_fn (copy, t);
2143 t = unshare_expr (gimple_omp_parallel_data_arg (stmt));
2144 gimple_omp_parallel_set_data_arg (copy, t);
2147 case GIMPLE_OMP_TASK:
2148 t = unshare_expr (gimple_omp_task_clauses (stmt));
2149 gimple_omp_task_set_clauses (copy, t);
2150 t = unshare_expr (gimple_omp_task_child_fn (stmt));
2151 gimple_omp_task_set_child_fn (copy, t);
2152 t = unshare_expr (gimple_omp_task_data_arg (stmt));
2153 gimple_omp_task_set_data_arg (copy, t);
2154 t = unshare_expr (gimple_omp_task_copy_fn (stmt));
2155 gimple_omp_task_set_copy_fn (copy, t);
2156 t = unshare_expr (gimple_omp_task_arg_size (stmt));
2157 gimple_omp_task_set_arg_size (copy, t);
2158 t = unshare_expr (gimple_omp_task_arg_align (stmt));
2159 gimple_omp_task_set_arg_align (copy, t);
2162 case GIMPLE_OMP_CRITICAL:
2163 t = unshare_expr (gimple_omp_critical_name (stmt));
2164 gimple_omp_critical_set_name (copy, t);
2167 case GIMPLE_OMP_SECTIONS:
2168 t = unshare_expr (gimple_omp_sections_clauses (stmt));
2169 gimple_omp_sections_set_clauses (copy, t);
2170 t = unshare_expr (gimple_omp_sections_control (stmt));
2171 gimple_omp_sections_set_control (copy, t);
2174 case GIMPLE_OMP_SINGLE:
2175 case GIMPLE_OMP_SECTION:
2176 case GIMPLE_OMP_MASTER:
2177 case GIMPLE_OMP_ORDERED:
2179 new_seq = gimple_seq_copy (gimple_omp_body (stmt));
2180 gimple_omp_set_body (copy, new_seq);
2183 case GIMPLE_WITH_CLEANUP_EXPR:
2184 new_seq = gimple_seq_copy (gimple_wce_cleanup (stmt));
2185 gimple_wce_set_cleanup (copy, new_seq);
2193 /* Make copy of operands. */
2196 for (i = 0; i < num_ops; i++)
2197 gimple_set_op (copy, i, unshare_expr (gimple_op (stmt, i)));
2199 /* Clear out SSA operand vectors on COPY. */
2200 if (gimple_has_ops (stmt))
2202 gimple_set_def_ops (copy, NULL);
2203 gimple_set_use_ops (copy, NULL);
2206 if (gimple_has_mem_ops (stmt))
2208 gimple_set_vdef (copy, gimple_vdef (stmt));
2209 gimple_set_vuse (copy, gimple_vuse (stmt));
2212 /* SSA operands need to be updated. */
2213 gimple_set_modified (copy, true);
2220 /* Set the MODIFIED flag to MODIFIEDP, iff the gimple statement G has
2221 a MODIFIED field. */
2224 gimple_set_modified (gimple s, bool modifiedp)
2226 if (gimple_has_ops (s))
2228 s->gsbase.modified = (unsigned) modifiedp;
2232 && is_gimple_call (s)
2233 && gimple_call_noreturn_p (s))
2234 VEC_safe_push (gimple, gc, MODIFIED_NORETURN_CALLS (cfun), s);
2239 /* Return true if statement S has side-effects. We consider a
2240 statement to have side effects if:
2242 - It is a GIMPLE_CALL not marked with ECF_PURE or ECF_CONST.
2243 - Any of its operands are marked TREE_THIS_VOLATILE or TREE_SIDE_EFFECTS. */
2246 gimple_has_side_effects (const_gimple s)
2250 if (is_gimple_debug (s))
2253 /* We don't have to scan the arguments to check for
2254 volatile arguments, though, at present, we still
2255 do a scan to check for TREE_SIDE_EFFECTS. */
2256 if (gimple_has_volatile_ops (s))
2259 if (is_gimple_call (s))
2261 unsigned nargs = gimple_call_num_args (s);
2263 if (!(gimple_call_flags (s) & (ECF_CONST | ECF_PURE)))
2265 else if (gimple_call_flags (s) & ECF_LOOPING_CONST_OR_PURE)
2266 /* An infinite loop is considered a side effect. */
2269 if (gimple_call_lhs (s)
2270 && TREE_SIDE_EFFECTS (gimple_call_lhs (s)))
2272 gcc_assert (gimple_has_volatile_ops (s));
2276 if (TREE_SIDE_EFFECTS (gimple_call_fn (s)))
2279 for (i = 0; i < nargs; i++)
2280 if (TREE_SIDE_EFFECTS (gimple_call_arg (s, i)))
2282 gcc_assert (gimple_has_volatile_ops (s));
2290 for (i = 0; i < gimple_num_ops (s); i++)
2291 if (TREE_SIDE_EFFECTS (gimple_op (s, i)))
2293 gcc_assert (gimple_has_volatile_ops (s));
2301 /* Return true if the RHS of statement S has side effects.
2302 We may use it to determine if it is admissable to replace
2303 an assignment or call with a copy of a previously-computed
2304 value. In such cases, side-effects due the the LHS are
2308 gimple_rhs_has_side_effects (const_gimple s)
2312 if (is_gimple_call (s))
2314 unsigned nargs = gimple_call_num_args (s);
2316 if (!(gimple_call_flags (s) & (ECF_CONST | ECF_PURE)))
2319 /* We cannot use gimple_has_volatile_ops here,
2320 because we must ignore a volatile LHS. */
2321 if (TREE_SIDE_EFFECTS (gimple_call_fn (s))
2322 || TREE_THIS_VOLATILE (gimple_call_fn (s)))
2324 gcc_assert (gimple_has_volatile_ops (s));
2328 for (i = 0; i < nargs; i++)
2329 if (TREE_SIDE_EFFECTS (gimple_call_arg (s, i))
2330 || TREE_THIS_VOLATILE (gimple_call_arg (s, i)))
2335 else if (is_gimple_assign (s))
2337 /* Skip the first operand, the LHS. */
2338 for (i = 1; i < gimple_num_ops (s); i++)
2339 if (TREE_SIDE_EFFECTS (gimple_op (s, i))
2340 || TREE_THIS_VOLATILE (gimple_op (s, i)))
2342 gcc_assert (gimple_has_volatile_ops (s));
2346 else if (is_gimple_debug (s))
2350 /* For statements without an LHS, examine all arguments. */
2351 for (i = 0; i < gimple_num_ops (s); i++)
2352 if (TREE_SIDE_EFFECTS (gimple_op (s, i))
2353 || TREE_THIS_VOLATILE (gimple_op (s, i)))
2355 gcc_assert (gimple_has_volatile_ops (s));
2364 /* Helper for gimple_could_trap_p and gimple_assign_rhs_could_trap_p.
2365 Return true if S can trap. If INCLUDE_LHS is true and S is a
2366 GIMPLE_ASSIGN, the LHS of the assignment is also checked.
2367 Otherwise, only the RHS of the assignment is checked. */
2370 gimple_could_trap_p_1 (gimple s, bool include_lhs)
2373 tree t, div = NULL_TREE;
2376 start = (is_gimple_assign (s) && !include_lhs) ? 1 : 0;
2378 for (i = start; i < gimple_num_ops (s); i++)
2379 if (tree_could_trap_p (gimple_op (s, i)))
2382 switch (gimple_code (s))
2385 return gimple_asm_volatile_p (s);
2388 t = gimple_call_fndecl (s);
2389 /* Assume that calls to weak functions may trap. */
2390 if (!t || !DECL_P (t) || DECL_WEAK (t))
2395 t = gimple_expr_type (s);
2396 op = gimple_assign_rhs_code (s);
2397 if (get_gimple_rhs_class (op) == GIMPLE_BINARY_RHS)
2398 div = gimple_assign_rhs2 (s);
2399 return (operation_could_trap_p (op, FLOAT_TYPE_P (t),
2400 (INTEGRAL_TYPE_P (t)
2401 && TYPE_OVERFLOW_TRAPS (t)),
2413 /* Return true if statement S can trap. */
2416 gimple_could_trap_p (gimple s)
2418 return gimple_could_trap_p_1 (s, true);
2422 /* Return true if RHS of a GIMPLE_ASSIGN S can trap. */
2425 gimple_assign_rhs_could_trap_p (gimple s)
2427 gcc_assert (is_gimple_assign (s));
2428 return gimple_could_trap_p_1 (s, false);
2432 /* Print debugging information for gimple stmts generated. */
2435 dump_gimple_statistics (void)
2437 #ifdef GATHER_STATISTICS
2438 int i, total_tuples = 0, total_bytes = 0;
2440 fprintf (stderr, "\nGIMPLE statements\n");
2441 fprintf (stderr, "Kind Stmts Bytes\n");
2442 fprintf (stderr, "---------------------------------------\n");
2443 for (i = 0; i < (int) gimple_alloc_kind_all; ++i)
2445 fprintf (stderr, "%-20s %7d %10d\n", gimple_alloc_kind_names[i],
2446 gimple_alloc_counts[i], gimple_alloc_sizes[i]);
2447 total_tuples += gimple_alloc_counts[i];
2448 total_bytes += gimple_alloc_sizes[i];
2450 fprintf (stderr, "---------------------------------------\n");
2451 fprintf (stderr, "%-20s %7d %10d\n", "Total", total_tuples, total_bytes);
2452 fprintf (stderr, "---------------------------------------\n");
2454 fprintf (stderr, "No gimple statistics\n");
2459 /* Return the number of operands needed on the RHS of a GIMPLE
2460 assignment for an expression with tree code CODE. */
2463 get_gimple_rhs_num_ops (enum tree_code code)
2465 enum gimple_rhs_class rhs_class = get_gimple_rhs_class (code);
2467 if (rhs_class == GIMPLE_UNARY_RHS || rhs_class == GIMPLE_SINGLE_RHS)
2469 else if (rhs_class == GIMPLE_BINARY_RHS)
2475 #define DEFTREECODE(SYM, STRING, TYPE, NARGS) \
2477 ((TYPE) == tcc_unary ? GIMPLE_UNARY_RHS \
2478 : ((TYPE) == tcc_binary \
2479 || (TYPE) == tcc_comparison) ? GIMPLE_BINARY_RHS \
2480 : ((TYPE) == tcc_constant \
2481 || (TYPE) == tcc_declaration \
2482 || (TYPE) == tcc_reference) ? GIMPLE_SINGLE_RHS \
2483 : ((SYM) == TRUTH_AND_EXPR \
2484 || (SYM) == TRUTH_OR_EXPR \
2485 || (SYM) == TRUTH_XOR_EXPR) ? GIMPLE_BINARY_RHS \
2486 : (SYM) == TRUTH_NOT_EXPR ? GIMPLE_UNARY_RHS \
2487 : ((SYM) == COND_EXPR \
2488 || (SYM) == CONSTRUCTOR \
2489 || (SYM) == OBJ_TYPE_REF \
2490 || (SYM) == ASSERT_EXPR \
2491 || (SYM) == ADDR_EXPR \
2492 || (SYM) == WITH_SIZE_EXPR \
2493 || (SYM) == SSA_NAME \
2494 || (SYM) == POLYNOMIAL_CHREC \
2495 || (SYM) == DOT_PROD_EXPR \
2496 || (SYM) == VEC_COND_EXPR \
2497 || (SYM) == REALIGN_LOAD_EXPR) ? GIMPLE_SINGLE_RHS \
2498 : GIMPLE_INVALID_RHS),
2499 #define END_OF_BASE_TREE_CODES (unsigned char) GIMPLE_INVALID_RHS,
2501 const unsigned char gimple_rhs_class_table[] = {
2502 #include "all-tree.def"
2506 #undef END_OF_BASE_TREE_CODES
2508 /* For the definitive definition of GIMPLE, see doc/tree-ssa.texi. */
2510 /* Validation of GIMPLE expressions. */
2512 /* Return true if OP is an acceptable tree node to be used as a GIMPLE
2516 is_gimple_operand (const_tree op)
2518 return op && get_gimple_rhs_class (TREE_CODE (op)) == GIMPLE_SINGLE_RHS;
2521 /* Returns true iff T is a valid RHS for an assignment to a renamed
2522 user -- or front-end generated artificial -- variable. */
2525 is_gimple_reg_rhs (tree t)
2527 return get_gimple_rhs_class (TREE_CODE (t)) != GIMPLE_INVALID_RHS;
2530 /* Returns true iff T is a valid RHS for an assignment to an un-renamed
2531 LHS, or for a call argument. */
2534 is_gimple_mem_rhs (tree t)
2536 /* If we're dealing with a renamable type, either source or dest must be
2537 a renamed variable. */
2538 if (is_gimple_reg_type (TREE_TYPE (t)))
2539 return is_gimple_val (t);
2541 return is_gimple_val (t) || is_gimple_lvalue (t);
2544 /* Return true if T is a valid LHS for a GIMPLE assignment expression. */
2547 is_gimple_lvalue (tree t)
2549 return (is_gimple_addressable (t)
2550 || TREE_CODE (t) == WITH_SIZE_EXPR
2551 /* These are complex lvalues, but don't have addresses, so they
2553 || TREE_CODE (t) == BIT_FIELD_REF);
2556 /* Return true if T is a GIMPLE condition. */
2559 is_gimple_condexpr (tree t)
2561 return (is_gimple_val (t) || (COMPARISON_CLASS_P (t)
2562 && !tree_could_trap_p (t)
2563 && is_gimple_val (TREE_OPERAND (t, 0))
2564 && is_gimple_val (TREE_OPERAND (t, 1))));
2567 /* Return true if T is something whose address can be taken. */
2570 is_gimple_addressable (tree t)
2572 return (is_gimple_id (t) || handled_component_p (t) || INDIRECT_REF_P (t));
2575 /* Return true if T is a valid gimple constant. */
2578 is_gimple_constant (const_tree t)
2580 switch (TREE_CODE (t))
2590 /* Vector constant constructors are gimple invariant. */
2592 if (TREE_TYPE (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2593 return TREE_CONSTANT (t);
2602 /* Return true if T is a gimple address. */
2605 is_gimple_address (const_tree t)
2609 if (TREE_CODE (t) != ADDR_EXPR)
2612 op = TREE_OPERAND (t, 0);
2613 while (handled_component_p (op))
2615 if ((TREE_CODE (op) == ARRAY_REF
2616 || TREE_CODE (op) == ARRAY_RANGE_REF)
2617 && !is_gimple_val (TREE_OPERAND (op, 1)))
2620 op = TREE_OPERAND (op, 0);
2623 if (CONSTANT_CLASS_P (op) || INDIRECT_REF_P (op))
2626 switch (TREE_CODE (op))
2641 /* Strip out all handled components that produce invariant
2645 strip_invariant_refs (const_tree op)
2647 while (handled_component_p (op))
2649 switch (TREE_CODE (op))
2652 case ARRAY_RANGE_REF:
2653 if (!is_gimple_constant (TREE_OPERAND (op, 1))
2654 || TREE_OPERAND (op, 2) != NULL_TREE
2655 || TREE_OPERAND (op, 3) != NULL_TREE)
2660 if (TREE_OPERAND (op, 2) != NULL_TREE)
2666 op = TREE_OPERAND (op, 0);
2672 /* Return true if T is a gimple invariant address. */
2675 is_gimple_invariant_address (const_tree t)
2679 if (TREE_CODE (t) != ADDR_EXPR)
2682 op = strip_invariant_refs (TREE_OPERAND (t, 0));
2684 return op && (CONSTANT_CLASS_P (op) || decl_address_invariant_p (op));
2687 /* Return true if T is a gimple invariant address at IPA level
2688 (so addresses of variables on stack are not allowed). */
2691 is_gimple_ip_invariant_address (const_tree t)
2695 if (TREE_CODE (t) != ADDR_EXPR)
2698 op = strip_invariant_refs (TREE_OPERAND (t, 0));
2700 return op && (CONSTANT_CLASS_P (op) || decl_address_ip_invariant_p (op));
2703 /* Return true if T is a GIMPLE minimal invariant. It's a restricted
2704 form of function invariant. */
2707 is_gimple_min_invariant (const_tree t)
2709 if (TREE_CODE (t) == ADDR_EXPR)
2710 return is_gimple_invariant_address (t);
2712 return is_gimple_constant (t);
2715 /* Return true if T is a GIMPLE interprocedural invariant. It's a restricted
2716 form of gimple minimal invariant. */
2719 is_gimple_ip_invariant (const_tree t)
2721 if (TREE_CODE (t) == ADDR_EXPR)
2722 return is_gimple_ip_invariant_address (t);
2724 return is_gimple_constant (t);
2727 /* Return true if T looks like a valid GIMPLE statement. */
2730 is_gimple_stmt (tree t)
2732 const enum tree_code code = TREE_CODE (t);
2737 /* The only valid NOP_EXPR is the empty statement. */
2738 return IS_EMPTY_STMT (t);
2742 /* These are only valid if they're void. */
2743 return TREE_TYPE (t) == NULL || VOID_TYPE_P (TREE_TYPE (t));
2749 case CASE_LABEL_EXPR:
2750 case TRY_CATCH_EXPR:
2751 case TRY_FINALLY_EXPR:
2752 case EH_FILTER_EXPR:
2755 case STATEMENT_LIST:
2765 /* These are always void. */
2771 /* These are valid regardless of their type. */
2779 /* Return true if T is a variable. */
2782 is_gimple_variable (tree t)
2784 return (TREE_CODE (t) == VAR_DECL
2785 || TREE_CODE (t) == PARM_DECL
2786 || TREE_CODE (t) == RESULT_DECL
2787 || TREE_CODE (t) == SSA_NAME);
2790 /* Return true if T is a GIMPLE identifier (something with an address). */
2793 is_gimple_id (tree t)
2795 return (is_gimple_variable (t)
2796 || TREE_CODE (t) == FUNCTION_DECL
2797 || TREE_CODE (t) == LABEL_DECL
2798 || TREE_CODE (t) == CONST_DECL
2799 /* Allow string constants, since they are addressable. */
2800 || TREE_CODE (t) == STRING_CST);
2803 /* Return true if TYPE is a suitable type for a scalar register variable. */
2806 is_gimple_reg_type (tree type)
2808 return !AGGREGATE_TYPE_P (type);
2811 /* Return true if T is a non-aggregate register variable. */
2814 is_gimple_reg (tree t)
2816 if (TREE_CODE (t) == SSA_NAME)
2817 t = SSA_NAME_VAR (t);
2819 if (!is_gimple_variable (t))
2822 if (!is_gimple_reg_type (TREE_TYPE (t)))
2825 /* A volatile decl is not acceptable because we can't reuse it as
2826 needed. We need to copy it into a temp first. */
2827 if (TREE_THIS_VOLATILE (t))
2830 /* We define "registers" as things that can be renamed as needed,
2831 which with our infrastructure does not apply to memory. */
2832 if (needs_to_live_in_memory (t))
2835 /* Hard register variables are an interesting case. For those that
2836 are call-clobbered, we don't know where all the calls are, since
2837 we don't (want to) take into account which operations will turn
2838 into libcalls at the rtl level. For those that are call-saved,
2839 we don't currently model the fact that calls may in fact change
2840 global hard registers, nor do we examine ASM_CLOBBERS at the tree
2841 level, and so miss variable changes that might imply. All around,
2842 it seems safest to not do too much optimization with these at the
2843 tree level at all. We'll have to rely on the rtl optimizers to
2844 clean this up, as there we've got all the appropriate bits exposed. */
2845 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
2848 /* Complex and vector values must have been put into SSA-like form.
2849 That is, no assignments to the individual components. */
2850 if (TREE_CODE (TREE_TYPE (t)) == COMPLEX_TYPE
2851 || TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2852 return DECL_GIMPLE_REG_P (t);
2858 /* Return true if T is a GIMPLE variable whose address is not needed. */
2861 is_gimple_non_addressable (tree t)
2863 if (TREE_CODE (t) == SSA_NAME)
2864 t = SSA_NAME_VAR (t);
2866 return (is_gimple_variable (t) && ! needs_to_live_in_memory (t));
2869 /* Return true if T is a GIMPLE rvalue, i.e. an identifier or a constant. */
2872 is_gimple_val (tree t)
2874 /* Make loads from volatiles and memory vars explicit. */
2875 if (is_gimple_variable (t)
2876 && is_gimple_reg_type (TREE_TYPE (t))
2877 && !is_gimple_reg (t))
2880 return (is_gimple_variable (t) || is_gimple_min_invariant (t));
2883 /* Similarly, but accept hard registers as inputs to asm statements. */
2886 is_gimple_asm_val (tree t)
2888 if (TREE_CODE (t) == VAR_DECL && DECL_HARD_REGISTER (t))
2891 return is_gimple_val (t);
2894 /* Return true if T is a GIMPLE minimal lvalue. */
2897 is_gimple_min_lval (tree t)
2899 if (!(t = CONST_CAST_TREE (strip_invariant_refs (t))))
2901 return (is_gimple_id (t) || TREE_CODE (t) == INDIRECT_REF);
2904 /* Return true if T is a typecast operation. */
2907 is_gimple_cast (tree t)
2909 return (CONVERT_EXPR_P (t)
2910 || TREE_CODE (t) == FIX_TRUNC_EXPR);
2913 /* Return true if T is a valid function operand of a CALL_EXPR. */
2916 is_gimple_call_addr (tree t)
2918 return (TREE_CODE (t) == OBJ_TYPE_REF || is_gimple_val (t));
2921 /* If T makes a function call, return the corresponding CALL_EXPR operand.
2922 Otherwise, return NULL_TREE. */
2925 get_call_expr_in (tree t)
2927 if (TREE_CODE (t) == MODIFY_EXPR)
2928 t = TREE_OPERAND (t, 1);
2929 if (TREE_CODE (t) == WITH_SIZE_EXPR)
2930 t = TREE_OPERAND (t, 0);
2931 if (TREE_CODE (t) == CALL_EXPR)
2937 /* Given a memory reference expression T, return its base address.
2938 The base address of a memory reference expression is the main
2939 object being referenced. For instance, the base address for
2940 'array[i].fld[j]' is 'array'. You can think of this as stripping
2941 away the offset part from a memory address.
2943 This function calls handled_component_p to strip away all the inner
2944 parts of the memory reference until it reaches the base object. */
2947 get_base_address (tree t)
2949 while (handled_component_p (t))
2950 t = TREE_OPERAND (t, 0);
2953 || TREE_CODE (t) == STRING_CST
2954 || TREE_CODE (t) == CONSTRUCTOR
2955 || INDIRECT_REF_P (t))
2962 recalculate_side_effects (tree t)
2964 enum tree_code code = TREE_CODE (t);
2965 int len = TREE_OPERAND_LENGTH (t);
2968 switch (TREE_CODE_CLASS (code))
2970 case tcc_expression:
2976 case PREDECREMENT_EXPR:
2977 case PREINCREMENT_EXPR:
2978 case POSTDECREMENT_EXPR:
2979 case POSTINCREMENT_EXPR:
2980 /* All of these have side-effects, no matter what their
2989 case tcc_comparison: /* a comparison expression */
2990 case tcc_unary: /* a unary arithmetic expression */
2991 case tcc_binary: /* a binary arithmetic expression */
2992 case tcc_reference: /* a reference */
2993 case tcc_vl_exp: /* a function call */
2994 TREE_SIDE_EFFECTS (t) = TREE_THIS_VOLATILE (t);
2995 for (i = 0; i < len; ++i)
2997 tree op = TREE_OPERAND (t, i);
2998 if (op && TREE_SIDE_EFFECTS (op))
2999 TREE_SIDE_EFFECTS (t) = 1;
3004 /* No side-effects. */
3012 /* Canonicalize a tree T for use in a COND_EXPR as conditional. Returns
3013 a canonicalized tree that is valid for a COND_EXPR or NULL_TREE, if
3014 we failed to create one. */
3017 canonicalize_cond_expr_cond (tree t)
3019 /* Strip conversions around boolean operations. */
3020 if (CONVERT_EXPR_P (t)
3021 && truth_value_p (TREE_CODE (TREE_OPERAND (t, 0))))
3022 t = TREE_OPERAND (t, 0);
3024 /* For (bool)x use x != 0. */
3025 if (CONVERT_EXPR_P (t)
3026 && TREE_CODE (TREE_TYPE (t)) == BOOLEAN_TYPE)
3028 tree top0 = TREE_OPERAND (t, 0);
3029 t = build2 (NE_EXPR, TREE_TYPE (t),
3030 top0, build_int_cst (TREE_TYPE (top0), 0));
3032 /* For !x use x == 0. */
3033 else if (TREE_CODE (t) == TRUTH_NOT_EXPR)
3035 tree top0 = TREE_OPERAND (t, 0);
3036 t = build2 (EQ_EXPR, TREE_TYPE (t),
3037 top0, build_int_cst (TREE_TYPE (top0), 0));
3039 /* For cmp ? 1 : 0 use cmp. */
3040 else if (TREE_CODE (t) == COND_EXPR
3041 && COMPARISON_CLASS_P (TREE_OPERAND (t, 0))
3042 && integer_onep (TREE_OPERAND (t, 1))
3043 && integer_zerop (TREE_OPERAND (t, 2)))
3045 tree top0 = TREE_OPERAND (t, 0);
3046 t = build2 (TREE_CODE (top0), TREE_TYPE (t),
3047 TREE_OPERAND (top0, 0), TREE_OPERAND (top0, 1));
3050 if (is_gimple_condexpr (t))
3056 /* Build a GIMPLE_CALL identical to STMT but skipping the arguments in
3057 the positions marked by the set ARGS_TO_SKIP. */
3060 gimple_call_copy_skip_args (gimple stmt, bitmap args_to_skip)
3063 tree fn = gimple_call_fn (stmt);
3064 int nargs = gimple_call_num_args (stmt);
3065 VEC(tree, heap) *vargs = VEC_alloc (tree, heap, nargs);
3068 for (i = 0; i < nargs; i++)
3069 if (!bitmap_bit_p (args_to_skip, i))
3070 VEC_quick_push (tree, vargs, gimple_call_arg (stmt, i));
3072 new_stmt = gimple_build_call_vec (fn, vargs);
3073 VEC_free (tree, heap, vargs);
3074 if (gimple_call_lhs (stmt))
3075 gimple_call_set_lhs (new_stmt, gimple_call_lhs (stmt));
3077 gimple_set_vuse (new_stmt, gimple_vuse (stmt));
3078 gimple_set_vdef (new_stmt, gimple_vdef (stmt));
3080 gimple_set_block (new_stmt, gimple_block (stmt));
3081 if (gimple_has_location (stmt))
3082 gimple_set_location (new_stmt, gimple_location (stmt));
3084 /* Carry all the flags to the new GIMPLE_CALL. */
3085 gimple_call_set_chain (new_stmt, gimple_call_chain (stmt));
3086 gimple_call_set_tail (new_stmt, gimple_call_tail_p (stmt));
3087 gimple_call_set_cannot_inline (new_stmt, gimple_call_cannot_inline_p (stmt));
3088 gimple_call_set_return_slot_opt (new_stmt, gimple_call_return_slot_opt_p (stmt));
3089 gimple_call_set_from_thunk (new_stmt, gimple_call_from_thunk_p (stmt));
3090 gimple_call_set_va_arg_pack (new_stmt, gimple_call_va_arg_pack_p (stmt));
3092 gimple_set_modified (new_stmt, true);
3098 static hashval_t gimple_type_hash (const void *);
3100 /* Structure used to maintain a cache of some type pairs compared by
3101 gimple_types_compatible_p when comparing aggregate types. There are
3102 four possible values for SAME_P:
3104 -2: The pair (T1, T2) has just been inserted in the table.
3105 -1: The pair (T1, T2) is currently being compared.
3106 0: T1 and T2 are different types.
3107 1: T1 and T2 are the same type.
3109 This table is only used when comparing aggregate types to avoid
3110 infinite recursion due to self-referential types. */
3117 typedef struct type_pair_d *type_pair_t;
3119 /* Return a hash value for the type pair pointed-to by P. */
3122 type_pair_hash (const void *p)
3124 const struct type_pair_d *pair = (const struct type_pair_d *) p;
3125 hashval_t val1 = pair->uid1;
3126 hashval_t val2 = pair->uid2;
3127 return (iterative_hash_hashval_t (val2, val1)
3128 ^ iterative_hash_hashval_t (val1, val2));
3131 /* Compare two type pairs pointed-to by P1 and P2. */
3134 type_pair_eq (const void *p1, const void *p2)
3136 const struct type_pair_d *pair1 = (const struct type_pair_d *) p1;
3137 const struct type_pair_d *pair2 = (const struct type_pair_d *) p2;
3138 return ((pair1->uid1 == pair2->uid1 && pair1->uid2 == pair2->uid2)
3139 || (pair1->uid1 == pair2->uid2 && pair1->uid2 == pair2->uid1));
3142 /* Lookup the pair of types T1 and T2 in *VISITED_P. Insert a new
3143 entry if none existed. */
3146 lookup_type_pair (tree t1, tree t2, htab_t *visited_p, struct obstack *ob_p)
3148 struct type_pair_d pair;
3152 if (*visited_p == NULL)
3154 *visited_p = htab_create (251, type_pair_hash, type_pair_eq, NULL);
3155 gcc_obstack_init (ob_p);
3158 pair.uid1 = TYPE_UID (t1);
3159 pair.uid2 = TYPE_UID (t2);
3160 slot = htab_find_slot (*visited_p, &pair, INSERT);
3163 p = *((type_pair_t *) slot);
3166 p = XOBNEW (ob_p, struct type_pair_d);
3167 p->uid1 = TYPE_UID (t1);
3168 p->uid2 = TYPE_UID (t2);
3177 /* Return true if T1 and T2 have the same name. If FOR_COMPLETION_P is
3178 true then if any type has no name return false, otherwise return
3179 true if both types have no names. */
3182 compare_type_names_p (tree t1, tree t2, bool for_completion_p)
3184 tree name1 = TYPE_NAME (t1);
3185 tree name2 = TYPE_NAME (t2);
3187 /* Consider anonymous types all unique for completion. */
3188 if (for_completion_p
3189 && (!name1 || !name2))
3192 if (name1 && TREE_CODE (name1) == TYPE_DECL)
3194 name1 = DECL_NAME (name1);
3195 if (for_completion_p
3199 gcc_assert (!name1 || TREE_CODE (name1) == IDENTIFIER_NODE);
3201 if (name2 && TREE_CODE (name2) == TYPE_DECL)
3203 name2 = DECL_NAME (name2);
3204 if (for_completion_p
3208 gcc_assert (!name2 || TREE_CODE (name2) == IDENTIFIER_NODE);
3210 /* Identifiers can be compared with pointer equality rather
3211 than a string comparison. */
3218 /* Return true if the field decls F1 and F2 are at the same offset. */
3221 compare_field_offset (tree f1, tree f2)
3223 if (DECL_OFFSET_ALIGN (f1) == DECL_OFFSET_ALIGN (f2))
3224 return (operand_equal_p (DECL_FIELD_OFFSET (f1),
3225 DECL_FIELD_OFFSET (f2), 0)
3226 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (f1),
3227 DECL_FIELD_BIT_OFFSET (f2)));
3229 /* Fortran and C do not always agree on what DECL_OFFSET_ALIGN
3230 should be, so handle differing ones specially by decomposing
3231 the offset into a byte and bit offset manually. */
3232 if (host_integerp (DECL_FIELD_OFFSET (f1), 0)
3233 && host_integerp (DECL_FIELD_OFFSET (f2), 0))
3235 unsigned HOST_WIDE_INT byte_offset1, byte_offset2;
3236 unsigned HOST_WIDE_INT bit_offset1, bit_offset2;
3237 bit_offset1 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f1));
3238 byte_offset1 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f1))
3239 + bit_offset1 / BITS_PER_UNIT);
3240 bit_offset2 = TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (f2));
3241 byte_offset2 = (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (f2))
3242 + bit_offset2 / BITS_PER_UNIT);
3243 if (byte_offset1 != byte_offset2)
3245 return bit_offset1 % BITS_PER_UNIT == bit_offset2 % BITS_PER_UNIT;
3251 /* Return 1 iff T1 and T2 are structurally identical.
3252 Otherwise, return 0. */
3255 gimple_types_compatible_p (tree t1, tree t2)
3257 type_pair_t p = NULL;
3259 /* Check first for the obvious case of pointer identity. */
3263 /* Check that we have two types to compare. */
3264 if (t1 == NULL_TREE || t2 == NULL_TREE)
3267 /* Can't be the same type if the types don't have the same code. */
3268 if (TREE_CODE (t1) != TREE_CODE (t2))
3271 /* Can't be the same type if they have different CV qualifiers. */
3272 if (TYPE_QUALS (t1) != TYPE_QUALS (t2))
3275 /* Void types are always the same. */
3276 if (TREE_CODE (t1) == VOID_TYPE)
3279 /* For numerical types do some simple checks before doing three
3280 hashtable queries. */
3281 if (INTEGRAL_TYPE_P (t1)
3282 || SCALAR_FLOAT_TYPE_P (t1)
3283 || FIXED_POINT_TYPE_P (t1)
3284 || TREE_CODE (t1) == VECTOR_TYPE
3285 || TREE_CODE (t1) == COMPLEX_TYPE
3286 || TREE_CODE (t1) == OFFSET_TYPE)
3288 /* Can't be the same type if they have different alignment,
3289 sign, precision or mode. */
3290 if (TYPE_ALIGN (t1) != TYPE_ALIGN (t2)
3291 || TYPE_PRECISION (t1) != TYPE_PRECISION (t2)
3292 || TYPE_MODE (t1) != TYPE_MODE (t2)
3293 || TYPE_UNSIGNED (t1) != TYPE_UNSIGNED (t2))
3296 if (TREE_CODE (t1) == INTEGER_TYPE
3297 && (TYPE_IS_SIZETYPE (t1) != TYPE_IS_SIZETYPE (t2)
3298 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)))
3301 /* That's all we need to check for float and fixed-point types. */
3302 if (SCALAR_FLOAT_TYPE_P (t1)
3303 || FIXED_POINT_TYPE_P (t1))
3306 /* Perform cheap tail-recursion for vector and complex types. */
3307 if (TREE_CODE (t1) == VECTOR_TYPE
3308 || TREE_CODE (t1) == COMPLEX_TYPE)
3309 return gimple_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2));
3311 /* For integral types fall thru to more complex checks. */
3314 /* If the hash values of t1 and t2 are different the types can't
3315 possibly be the same. This helps keeping the type-pair hashtable
3316 small, only tracking comparisons for hash collisions. */
3317 if (gimple_type_hash (t1) != gimple_type_hash (t2))
3320 /* If we've visited this type pair before (in the case of aggregates
3321 with self-referential types), and we made a decision, return it. */
3322 p = lookup_type_pair (t1, t2, >c_visited, >c_ob);
3323 if (p->same_p == 0 || p->same_p == 1)
3325 /* We have already decided whether T1 and T2 are the
3326 same, return the cached result. */
3327 return p->same_p == 1;
3329 else if (p->same_p == -1)
3331 /* We are currently comparing this pair of types, assume
3332 that they are the same and let the caller decide. */
3336 gcc_assert (p->same_p == -2);
3338 /* Mark the (T1, T2) comparison in progress. */
3341 /* If their attributes are not the same they can't be the same type. */
3342 if (!attribute_list_equal (TYPE_ATTRIBUTES (t1), TYPE_ATTRIBUTES (t2)))
3343 goto different_types;
3345 /* Do type-specific comparisons. */
3346 switch (TREE_CODE (t1))
3349 /* Array types are the same if the element types are the same and
3350 the number of elements are the same. */
3351 if (!gimple_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2))
3352 || TYPE_STRING_FLAG (t1) != TYPE_STRING_FLAG (t2)
3353 || TYPE_NONALIASED_COMPONENT (t1) != TYPE_NONALIASED_COMPONENT (t2))
3354 goto different_types;
3357 tree i1 = TYPE_DOMAIN (t1);
3358 tree i2 = TYPE_DOMAIN (t2);
3360 /* For an incomplete external array, the type domain can be
3361 NULL_TREE. Check this condition also. */
3362 if (i1 == NULL_TREE && i2 == NULL_TREE)
3364 else if (i1 == NULL_TREE || i2 == NULL_TREE)
3365 goto different_types;
3366 /* If for a complete array type the possibly gimplified sizes
3367 are different the types are different. */
3368 else if (((TYPE_SIZE (i1) != NULL) ^ (TYPE_SIZE (i2) != NULL))
3371 && !operand_equal_p (TYPE_SIZE (i1), TYPE_SIZE (i2), 0)))
3372 goto different_types;
3375 tree min1 = TYPE_MIN_VALUE (i1);
3376 tree min2 = TYPE_MIN_VALUE (i2);
3377 tree max1 = TYPE_MAX_VALUE (i1);
3378 tree max2 = TYPE_MAX_VALUE (i2);
3380 /* The minimum/maximum values have to be the same. */
3383 && ((TREE_CODE (min1) == PLACEHOLDER_EXPR
3384 && TREE_CODE (min2) == PLACEHOLDER_EXPR)
3385 || operand_equal_p (min1, min2, 0))))
3388 && ((TREE_CODE (max1) == PLACEHOLDER_EXPR
3389 && TREE_CODE (max2) == PLACEHOLDER_EXPR)
3390 || operand_equal_p (max1, max2, 0)))))
3393 goto different_types;
3398 /* Method types should belong to the same class. */
3399 if (!gimple_types_compatible_p (TYPE_METHOD_BASETYPE (t1),
3400 TYPE_METHOD_BASETYPE (t2)))
3401 goto different_types;
3406 /* Function types are the same if the return type and arguments types
3408 if (!gimple_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
3409 goto different_types;
3412 if (!targetm.comp_type_attributes (t1, t2))
3413 goto different_types;
3415 if (TYPE_ARG_TYPES (t1) == TYPE_ARG_TYPES (t2))
3419 tree parms1, parms2;
3421 for (parms1 = TYPE_ARG_TYPES (t1), parms2 = TYPE_ARG_TYPES (t2);
3423 parms1 = TREE_CHAIN (parms1), parms2 = TREE_CHAIN (parms2))
3425 if (!gimple_types_compatible_p (TREE_VALUE (parms1),
3426 TREE_VALUE (parms2)))
3427 goto different_types;
3430 if (parms1 || parms2)
3431 goto different_types;
3439 if (!gimple_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2))
3440 || !gimple_types_compatible_p (TYPE_OFFSET_BASETYPE (t1),
3441 TYPE_OFFSET_BASETYPE (t2)))
3442 goto different_types;
3448 case REFERENCE_TYPE:
3450 /* If the two pointers have different ref-all attributes,
3451 they can't be the same type. */
3452 if (TYPE_REF_CAN_ALIAS_ALL (t1) != TYPE_REF_CAN_ALIAS_ALL (t2))
3453 goto different_types;
3455 /* If one pointer points to an incomplete type variant of
3456 the other pointed-to type they are the same. */
3457 if (TREE_CODE (TREE_TYPE (t1)) == TREE_CODE (TREE_TYPE (t2))
3458 && RECORD_OR_UNION_TYPE_P (TREE_TYPE (t1))
3459 && (!COMPLETE_TYPE_P (TREE_TYPE (t1))
3460 || !COMPLETE_TYPE_P (TREE_TYPE (t2)))
3461 && compare_type_names_p (TYPE_MAIN_VARIANT (TREE_TYPE (t1)),
3462 TYPE_MAIN_VARIANT (TREE_TYPE (t2)), true))
3464 /* Replace the pointed-to incomplete type with the
3466 if (COMPLETE_TYPE_P (TREE_TYPE (t2)))
3467 TREE_TYPE (t1) = TREE_TYPE (t2);
3469 TREE_TYPE (t2) = TREE_TYPE (t1);
3473 /* Otherwise, pointer and reference types are the same if the
3474 pointed-to types are the same. */
3475 if (gimple_types_compatible_p (TREE_TYPE (t1), TREE_TYPE (t2)))
3478 goto different_types;
3484 tree min1 = TYPE_MIN_VALUE (t1);
3485 tree max1 = TYPE_MAX_VALUE (t1);
3486 tree min2 = TYPE_MIN_VALUE (t2);
3487 tree max2 = TYPE_MAX_VALUE (t2);
3488 bool min_equal_p = false;
3489 bool max_equal_p = false;
3491 /* If either type has a minimum value, the other type must
3493 if (min1 == NULL_TREE && min2 == NULL_TREE)
3495 else if (min1 && min2 && operand_equal_p (min1, min2, 0))
3498 /* Likewise, if either type has a maximum value, the other
3499 type must have the same. */
3500 if (max1 == NULL_TREE && max2 == NULL_TREE)
3502 else if (max1 && max2 && operand_equal_p (max1, max2, 0))
3505 if (!min_equal_p || !max_equal_p)
3506 goto different_types;
3513 /* FIXME lto, we cannot check bounds on enumeral types because
3514 different front ends will produce different values.
3515 In C, enumeral types are integers, while in C++ each element
3516 will have its own symbolic value. We should decide how enums
3517 are to be represented in GIMPLE and have each front end lower
3521 /* For enumeral types, all the values must be the same. */
3522 if (TYPE_VALUES (t1) == TYPE_VALUES (t2))
3525 for (v1 = TYPE_VALUES (t1), v2 = TYPE_VALUES (t2);
3527 v1 = TREE_CHAIN (v1), v2 = TREE_CHAIN (v2))
3529 tree c1 = TREE_VALUE (v1);
3530 tree c2 = TREE_VALUE (v2);
3532 if (TREE_CODE (c1) == CONST_DECL)
3533 c1 = DECL_INITIAL (c1);
3535 if (TREE_CODE (c2) == CONST_DECL)
3536 c2 = DECL_INITIAL (c2);
3538 if (tree_int_cst_equal (c1, c2) != 1)
3539 goto different_types;
3542 /* If one enumeration has more values than the other, they
3543 are not the same. */
3545 goto different_types;
3552 case QUAL_UNION_TYPE:
3556 /* If one type requires structural equality checks and the
3557 other doesn't, do not merge the types. */
3558 if (TYPE_STRUCTURAL_EQUALITY_P (t1)
3559 != TYPE_STRUCTURAL_EQUALITY_P (t2))
3560 goto different_types;
3562 /* The struct tags shall compare equal. */
3563 if (!compare_type_names_p (TYPE_MAIN_VARIANT (t1),
3564 TYPE_MAIN_VARIANT (t2), false))
3565 goto different_types;
3567 /* For aggregate types, all the fields must be the same. */
3568 for (f1 = TYPE_FIELDS (t1), f2 = TYPE_FIELDS (t2);
3570 f1 = TREE_CHAIN (f1), f2 = TREE_CHAIN (f2))
3572 /* The fields must have the same name, offset and type. */
3573 if (DECL_NAME (f1) != DECL_NAME (f2)
3574 || DECL_NONADDRESSABLE_P (f1) != DECL_NONADDRESSABLE_P (f2)
3575 || !compare_field_offset (f1, f2)
3576 || !gimple_types_compatible_p (TREE_TYPE (f1),
3578 goto different_types;
3581 /* If one aggregate has more fields than the other, they
3582 are not the same. */
3584 goto different_types;
3593 /* Common exit path for types that are not compatible. */
3598 /* Common exit path for types that are compatible. */
3607 /* Per pointer state for the SCC finding. The on_sccstack flag
3608 is not strictly required, it is true when there is no hash value
3609 recorded for the type and false otherwise. But querying that
3614 unsigned int dfsnum;
3620 static unsigned int next_dfs_num;
3623 iterative_hash_gimple_type (tree, hashval_t, VEC(tree, heap) **,
3624 struct pointer_map_t *, struct obstack *);
3626 /* DFS visit the edge from the callers type with state *STATE to T.
3627 Update the callers type hash V with the hash for T if it is not part
3628 of the SCC containing the callers type and return it.
3629 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done. */
3632 visit (tree t, struct sccs *state, hashval_t v,
3633 VEC (tree, heap) **sccstack,
3634 struct pointer_map_t *sccstate,
3635 struct obstack *sccstate_obstack)
3637 struct sccs *cstate = NULL;
3640 /* If there is a hash value recorded for this type then it can't
3641 possibly be part of our parent SCC. Simply mix in its hash. */
3642 if ((slot = pointer_map_contains (type_hash_cache, t)))
3643 return iterative_hash_hashval_t ((hashval_t) (size_t) *slot, v);
3645 if ((slot = pointer_map_contains (sccstate, t)) != NULL)
3646 cstate = (struct sccs *)*slot;
3650 /* Not yet visited. DFS recurse. */
3651 tem = iterative_hash_gimple_type (t, v,
3652 sccstack, sccstate, sccstate_obstack);
3654 cstate = (struct sccs *)* pointer_map_contains (sccstate, t);
3655 state->low = MIN (state->low, cstate->low);
3656 /* If the type is no longer on the SCC stack and thus is not part
3657 of the parents SCC mix in its hash value. Otherwise we will
3658 ignore the type for hashing purposes and return the unaltered
3660 if (!cstate->on_sccstack)
3663 if (cstate->dfsnum < state->dfsnum
3664 && cstate->on_sccstack)
3665 state->low = MIN (cstate->dfsnum, state->low);
3667 /* We are part of our parents SCC, skip this type during hashing
3668 and return the unaltered hash value. */
3672 /* Hash NAME with the previous hash value V and return it. */
3675 iterative_hash_name (tree name, hashval_t v)
3679 if (TREE_CODE (name) == TYPE_DECL)
3680 name = DECL_NAME (name);
3683 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
3684 return iterative_hash_object (IDENTIFIER_HASH_VALUE (name), v);
3687 /* Returning a hash value for gimple type TYPE combined with VAL.
3688 SCCSTACK, SCCSTATE and SCCSTATE_OBSTACK are state for the DFS walk done.
3690 To hash a type we end up hashing in types that are reachable.
3691 Through pointers we can end up with cycles which messes up the
3692 required property that we need to compute the same hash value
3693 for structurally equivalent types. To avoid this we have to
3694 hash all types in a cycle (the SCC) in a commutative way. The
3695 easiest way is to not mix in the hashes of the SCC members at
3696 all. To make this work we have to delay setting the hash
3697 values of the SCC until it is complete. */
3700 iterative_hash_gimple_type (tree type, hashval_t val,
3701 VEC(tree, heap) **sccstack,
3702 struct pointer_map_t *sccstate,
3703 struct obstack *sccstate_obstack)
3709 #ifdef ENABLE_CHECKING
3710 /* Not visited during this DFS walk nor during previous walks. */
3711 gcc_assert (!pointer_map_contains (type_hash_cache, type)
3712 && !pointer_map_contains (sccstate, type));
3714 state = XOBNEW (sccstate_obstack, struct sccs);
3715 *pointer_map_insert (sccstate, type) = state;
3717 VEC_safe_push (tree, heap, *sccstack, type);
3718 state->dfsnum = next_dfs_num++;
3719 state->low = state->dfsnum;
3720 state->on_sccstack = true;
3722 /* Combine a few common features of types so that types are grouped into
3723 smaller sets; when searching for existing matching types to merge,
3724 only existing types having the same features as the new type will be
3726 v = iterative_hash_hashval_t (TREE_CODE (type), 0);
3727 v = iterative_hash_hashval_t (TYPE_QUALS (type), v);
3728 v = iterative_hash_hashval_t (TREE_ADDRESSABLE (type), v);
3730 /* Do not hash the types size as this will cause differences in
3731 hash values for the complete vs. the incomplete type variant. */
3733 /* Incorporate common features of numerical types. */
3734 if (INTEGRAL_TYPE_P (type)
3735 || SCALAR_FLOAT_TYPE_P (type)
3736 || FIXED_POINT_TYPE_P (type))
3738 v = iterative_hash_hashval_t (TYPE_PRECISION (type), v);
3739 v = iterative_hash_hashval_t (TYPE_MODE (type), v);
3740 v = iterative_hash_hashval_t (TYPE_UNSIGNED (type), v);
3743 /* For pointer and reference types, fold in information about the type
3744 pointed to but do not recurse into possibly incomplete types to
3745 avoid hash differences for complete vs. incomplete types. */
3746 if (POINTER_TYPE_P (type))
3748 if (RECORD_OR_UNION_TYPE_P (TREE_TYPE (type)))
3750 v = iterative_hash_hashval_t (TREE_CODE (TREE_TYPE (type)), v);
3751 v = iterative_hash_name
3752 (TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (type))), v);
3755 v = visit (TREE_TYPE (type), state, v,
3756 sccstack, sccstate, sccstate_obstack);
3759 /* For integer types hash the types min/max values and the string flag. */
3760 if (TREE_CODE (type) == INTEGER_TYPE)
3762 /* OMP lowering can introduce error_mark_node in place of
3763 random local decls in types. */
3764 if (TYPE_MIN_VALUE (type) != error_mark_node)
3765 v = iterative_hash_expr (TYPE_MIN_VALUE (type), v);
3766 if (TYPE_MAX_VALUE (type) != error_mark_node)
3767 v = iterative_hash_expr (TYPE_MAX_VALUE (type), v);
3768 v = iterative_hash_hashval_t (TYPE_STRING_FLAG (type), v);
3771 /* For array types hash their domain and the string flag. */
3772 if (TREE_CODE (type) == ARRAY_TYPE
3773 && TYPE_DOMAIN (type))
3775 v = iterative_hash_hashval_t (TYPE_STRING_FLAG (type), v);
3776 v = visit (TYPE_DOMAIN (type), state, v,
3777 sccstack, sccstate, sccstate_obstack);
3780 /* Recurse for aggregates with a single element type. */
3781 if (TREE_CODE (type) == ARRAY_TYPE
3782 || TREE_CODE (type) == COMPLEX_TYPE
3783 || TREE_CODE (type) == VECTOR_TYPE)
3784 v = visit (TREE_TYPE (type), state, v,
3785 sccstack, sccstate, sccstate_obstack);
3787 /* Incorporate function return and argument types. */
3788 if (TREE_CODE (type) == FUNCTION_TYPE || TREE_CODE (type) == METHOD_TYPE)
3793 /* For method types also incorporate their parent class. */
3794 if (TREE_CODE (type) == METHOD_TYPE)
3795 v = visit (TYPE_METHOD_BASETYPE (type), state, v,
3796 sccstack, sccstate, sccstate_obstack);
3798 v = visit (TREE_TYPE (type), state, v,
3799 sccstack, sccstate, sccstate_obstack);
3801 for (p = TYPE_ARG_TYPES (type), na = 0; p; p = TREE_CHAIN (p))
3803 v = visit (TREE_VALUE (p), state, v,
3804 sccstack, sccstate, sccstate_obstack);
3808 v = iterative_hash_hashval_t (na, v);
3811 if (TREE_CODE (type) == RECORD_TYPE
3812 || TREE_CODE (type) == UNION_TYPE
3813 || TREE_CODE (type) == QUAL_UNION_TYPE)
3818 v = iterative_hash_name (TYPE_NAME (TYPE_MAIN_VARIANT (type)), v);
3820 for (f = TYPE_FIELDS (type), nf = 0; f; f = TREE_CHAIN (f))
3822 v = iterative_hash_name (DECL_NAME (f), v);
3823 v = visit (TREE_TYPE (f), state, v,
3824 sccstack, sccstate, sccstate_obstack);
3828 v = iterative_hash_hashval_t (nf, v);
3831 /* Record hash for us. */
3834 /* See if we found an SCC. */
3835 if (state->low == state->dfsnum)
3839 /* Pop off the SCC and set its hash values. */
3842 struct sccs *cstate;
3843 x = VEC_pop (tree, *sccstack);
3844 gcc_assert (!pointer_map_contains (type_hash_cache, x));
3845 cstate = (struct sccs *)*pointer_map_contains (sccstate, x);
3846 cstate->on_sccstack = false;
3847 slot = pointer_map_insert (type_hash_cache, x);
3848 *slot = (void *) (size_t) cstate->hash;
3853 return iterative_hash_hashval_t (v, val);
3857 /* Returns a hash value for P (assumed to be a type). The hash value
3858 is computed using some distinguishing features of the type. Note
3859 that we cannot use pointer hashing here as we may be dealing with
3860 two distinct instances of the same type.
3862 This function should produce the same hash value for two compatible
3863 types according to gimple_types_compatible_p. */
3866 gimple_type_hash (const void *p)
3868 const_tree t = (const_tree) p;
3869 VEC(tree, heap) *sccstack = NULL;
3870 struct pointer_map_t *sccstate;
3871 struct obstack sccstate_obstack;
3875 if (type_hash_cache == NULL)
3876 type_hash_cache = pointer_map_create ();
3878 if ((slot = pointer_map_contains (type_hash_cache, p)) != NULL)
3879 return iterative_hash_hashval_t ((hashval_t) (size_t) *slot, 0);
3881 /* Perform a DFS walk and pre-hash all reachable types. */
3883 sccstate = pointer_map_create ();
3884 gcc_obstack_init (&sccstate_obstack);
3885 val = iterative_hash_gimple_type (CONST_CAST_TREE (t), 0,
3886 &sccstack, sccstate, &sccstate_obstack);
3887 VEC_free (tree, heap, sccstack);
3888 pointer_map_destroy (sccstate);
3889 obstack_free (&sccstate_obstack, NULL);
3895 /* Returns nonzero if P1 and P2 are equal. */
3898 gimple_type_eq (const void *p1, const void *p2)
3900 const_tree t1 = (const_tree) p1;
3901 const_tree t2 = (const_tree) p2;
3902 return gimple_types_compatible_p (CONST_CAST_TREE (t1), CONST_CAST_TREE (t2));
3906 /* Register type T in the global type table gimple_types.
3907 If another type T', compatible with T, already existed in
3908 gimple_types then return T', otherwise return T. This is used by
3909 LTO to merge identical types read from different TUs. */
3912 gimple_register_type (tree t)
3916 gcc_assert (TYPE_P (t));
3918 /* Always register the main variant first. This is important so we
3919 pick up the non-typedef variants as canonical, otherwise we'll end
3920 up taking typedef ids for structure tags during comparison. */
3921 if (TYPE_MAIN_VARIANT (t) != t)
3922 gimple_register_type (TYPE_MAIN_VARIANT (t));
3924 if (gimple_types == NULL)
3925 gimple_types = htab_create (16381, gimple_type_hash, gimple_type_eq, 0);
3927 slot = htab_find_slot (gimple_types, t, INSERT);
3929 && *(tree *)slot != t)
3931 tree new_type = (tree) *((tree *) slot);
3933 /* Do not merge types with different addressability. */
3934 gcc_assert (TREE_ADDRESSABLE (t) == TREE_ADDRESSABLE (new_type));
3936 /* If t is not its main variant then make t unreachable from its
3937 main variant list. Otherwise we'd queue up a lot of duplicates
3939 if (t != TYPE_MAIN_VARIANT (t))
3941 tree tem = TYPE_MAIN_VARIANT (t);
3942 while (tem && TYPE_NEXT_VARIANT (tem) != t)
3943 tem = TYPE_NEXT_VARIANT (tem);
3945 TYPE_NEXT_VARIANT (tem) = TYPE_NEXT_VARIANT (t);
3946 TYPE_NEXT_VARIANT (t) = NULL_TREE;
3949 /* If we are a pointer then remove us from the pointer-to or
3950 reference-to chain. Otherwise we'd queue up a lot of duplicates
3952 if (TREE_CODE (t) == POINTER_TYPE)
3954 if (TYPE_POINTER_TO (TREE_TYPE (t)) == t)
3955 TYPE_POINTER_TO (TREE_TYPE (t)) = TYPE_NEXT_PTR_TO (t);
3958 tree tem = TYPE_POINTER_TO (TREE_TYPE (t));
3959 while (tem && TYPE_NEXT_PTR_TO (tem) != t)
3960 tem = TYPE_NEXT_PTR_TO (tem);
3962 TYPE_NEXT_PTR_TO (tem) = TYPE_NEXT_PTR_TO (t);
3964 TYPE_NEXT_PTR_TO (t) = NULL_TREE;
3966 else if (TREE_CODE (t) == REFERENCE_TYPE)
3968 if (TYPE_REFERENCE_TO (TREE_TYPE (t)) == t)
3969 TYPE_REFERENCE_TO (TREE_TYPE (t)) = TYPE_NEXT_REF_TO (t);
3972 tree tem = TYPE_REFERENCE_TO (TREE_TYPE (t));
3973 while (tem && TYPE_NEXT_REF_TO (tem) != t)
3974 tem = TYPE_NEXT_REF_TO (tem);
3976 TYPE_NEXT_REF_TO (tem) = TYPE_NEXT_REF_TO (t);
3978 TYPE_NEXT_REF_TO (t) = NULL_TREE;
3990 /* Show statistics on references to the global type table gimple_types. */
3993 print_gimple_types_stats (void)
3996 fprintf (stderr, "GIMPLE type table: size %ld, %ld elements, "
3997 "%ld searches, %ld collisions (ratio: %f)\n",
3998 (long) htab_size (gimple_types),
3999 (long) htab_elements (gimple_types),
4000 (long) gimple_types->searches,
4001 (long) gimple_types->collisions,
4002 htab_collisions (gimple_types));
4004 fprintf (stderr, "GIMPLE type table is empty\n");
4006 fprintf (stderr, "GIMPLE type comparison table: size %ld, %ld "
4007 "elements, %ld searches, %ld collisions (ratio: %f)\n",
4008 (long) htab_size (gtc_visited),
4009 (long) htab_elements (gtc_visited),
4010 (long) gtc_visited->searches,
4011 (long) gtc_visited->collisions,
4012 htab_collisions (gtc_visited));
4014 fprintf (stderr, "GIMPLE type comparison table is empty\n");
4017 /* Free the gimple type hashtables used for LTO type merging. */
4020 free_gimple_type_tables (void)
4022 /* Last chance to print stats for the tables. */
4023 if (flag_lto_report)
4024 print_gimple_types_stats ();
4028 htab_delete (gimple_types);
4029 gimple_types = NULL;
4031 if (type_hash_cache)
4033 pointer_map_destroy (type_hash_cache);
4034 type_hash_cache = NULL;
4038 htab_delete (gtc_visited);
4039 obstack_free (>c_ob, NULL);
4045 /* Return a type the same as TYPE except unsigned or
4046 signed according to UNSIGNEDP. */
4049 gimple_signed_or_unsigned_type (bool unsignedp, tree type)
4053 type1 = TYPE_MAIN_VARIANT (type);
4054 if (type1 == signed_char_type_node
4055 || type1 == char_type_node
4056 || type1 == unsigned_char_type_node)
4057 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
4058 if (type1 == integer_type_node || type1 == unsigned_type_node)
4059 return unsignedp ? unsigned_type_node : integer_type_node;
4060 if (type1 == short_integer_type_node || type1 == short_unsigned_type_node)
4061 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
4062 if (type1 == long_integer_type_node || type1 == long_unsigned_type_node)
4063 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
4064 if (type1 == long_long_integer_type_node
4065 || type1 == long_long_unsigned_type_node)
4067 ? long_long_unsigned_type_node
4068 : long_long_integer_type_node;
4069 #if HOST_BITS_PER_WIDE_INT >= 64
4070 if (type1 == intTI_type_node || type1 == unsigned_intTI_type_node)
4071 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
4073 if (type1 == intDI_type_node || type1 == unsigned_intDI_type_node)
4074 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
4075 if (type1 == intSI_type_node || type1 == unsigned_intSI_type_node)
4076 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
4077 if (type1 == intHI_type_node || type1 == unsigned_intHI_type_node)
4078 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
4079 if (type1 == intQI_type_node || type1 == unsigned_intQI_type_node)
4080 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
4082 #define GIMPLE_FIXED_TYPES(NAME) \
4083 if (type1 == short_ ## NAME ## _type_node \
4084 || type1 == unsigned_short_ ## NAME ## _type_node) \
4085 return unsignedp ? unsigned_short_ ## NAME ## _type_node \
4086 : short_ ## NAME ## _type_node; \
4087 if (type1 == NAME ## _type_node \
4088 || type1 == unsigned_ ## NAME ## _type_node) \
4089 return unsignedp ? unsigned_ ## NAME ## _type_node \
4090 : NAME ## _type_node; \
4091 if (type1 == long_ ## NAME ## _type_node \
4092 || type1 == unsigned_long_ ## NAME ## _type_node) \
4093 return unsignedp ? unsigned_long_ ## NAME ## _type_node \
4094 : long_ ## NAME ## _type_node; \
4095 if (type1 == long_long_ ## NAME ## _type_node \
4096 || type1 == unsigned_long_long_ ## NAME ## _type_node) \
4097 return unsignedp ? unsigned_long_long_ ## NAME ## _type_node \
4098 : long_long_ ## NAME ## _type_node;
4100 #define GIMPLE_FIXED_MODE_TYPES(NAME) \
4101 if (type1 == NAME ## _type_node \
4102 || type1 == u ## NAME ## _type_node) \
4103 return unsignedp ? u ## NAME ## _type_node \
4104 : NAME ## _type_node;
4106 #define GIMPLE_FIXED_TYPES_SAT(NAME) \
4107 if (type1 == sat_ ## short_ ## NAME ## _type_node \
4108 || type1 == sat_ ## unsigned_short_ ## NAME ## _type_node) \
4109 return unsignedp ? sat_ ## unsigned_short_ ## NAME ## _type_node \
4110 : sat_ ## short_ ## NAME ## _type_node; \
4111 if (type1 == sat_ ## NAME ## _type_node \
4112 || type1 == sat_ ## unsigned_ ## NAME ## _type_node) \
4113 return unsignedp ? sat_ ## unsigned_ ## NAME ## _type_node \
4114 : sat_ ## NAME ## _type_node; \
4115 if (type1 == sat_ ## long_ ## NAME ## _type_node \
4116 || type1 == sat_ ## unsigned_long_ ## NAME ## _type_node) \
4117 return unsignedp ? sat_ ## unsigned_long_ ## NAME ## _type_node \
4118 : sat_ ## long_ ## NAME ## _type_node; \
4119 if (type1 == sat_ ## long_long_ ## NAME ## _type_node \
4120 || type1 == sat_ ## unsigned_long_long_ ## NAME ## _type_node) \
4121 return unsignedp ? sat_ ## unsigned_long_long_ ## NAME ## _type_node \
4122 : sat_ ## long_long_ ## NAME ## _type_node;
4124 #define GIMPLE_FIXED_MODE_TYPES_SAT(NAME) \
4125 if (type1 == sat_ ## NAME ## _type_node \
4126 || type1 == sat_ ## u ## NAME ## _type_node) \
4127 return unsignedp ? sat_ ## u ## NAME ## _type_node \
4128 : sat_ ## NAME ## _type_node;
4130 GIMPLE_FIXED_TYPES (fract);
4131 GIMPLE_FIXED_TYPES_SAT (fract);
4132 GIMPLE_FIXED_TYPES (accum);
4133 GIMPLE_FIXED_TYPES_SAT (accum);
4135 GIMPLE_FIXED_MODE_TYPES (qq);
4136 GIMPLE_FIXED_MODE_TYPES (hq);
4137 GIMPLE_FIXED_MODE_TYPES (sq);
4138 GIMPLE_FIXED_MODE_TYPES (dq);
4139 GIMPLE_FIXED_MODE_TYPES (tq);
4140 GIMPLE_FIXED_MODE_TYPES_SAT (qq);
4141 GIMPLE_FIXED_MODE_TYPES_SAT (hq);
4142 GIMPLE_FIXED_MODE_TYPES_SAT (sq);
4143 GIMPLE_FIXED_MODE_TYPES_SAT (dq);
4144 GIMPLE_FIXED_MODE_TYPES_SAT (tq);
4145 GIMPLE_FIXED_MODE_TYPES (ha);
4146 GIMPLE_FIXED_MODE_TYPES (sa);
4147 GIMPLE_FIXED_MODE_TYPES (da);
4148 GIMPLE_FIXED_MODE_TYPES (ta);
4149 GIMPLE_FIXED_MODE_TYPES_SAT (ha);
4150 GIMPLE_FIXED_MODE_TYPES_SAT (sa);
4151 GIMPLE_FIXED_MODE_TYPES_SAT (da);
4152 GIMPLE_FIXED_MODE_TYPES_SAT (ta);
4154 /* For ENUMERAL_TYPEs in C++, must check the mode of the types, not
4155 the precision; they have precision set to match their range, but
4156 may use a wider mode to match an ABI. If we change modes, we may
4157 wind up with bad conversions. For INTEGER_TYPEs in C, must check
4158 the precision as well, so as to yield correct results for
4159 bit-field types. C++ does not have these separate bit-field
4160 types, and producing a signed or unsigned variant of an
4161 ENUMERAL_TYPE may cause other problems as well. */
4162 if (!INTEGRAL_TYPE_P (type)
4163 || TYPE_UNSIGNED (type) == unsignedp)
4166 #define TYPE_OK(node) \
4167 (TYPE_MODE (type) == TYPE_MODE (node) \
4168 && TYPE_PRECISION (type) == TYPE_PRECISION (node))
4169 if (TYPE_OK (signed_char_type_node))
4170 return unsignedp ? unsigned_char_type_node : signed_char_type_node;
4171 if (TYPE_OK (integer_type_node))
4172 return unsignedp ? unsigned_type_node : integer_type_node;
4173 if (TYPE_OK (short_integer_type_node))
4174 return unsignedp ? short_unsigned_type_node : short_integer_type_node;
4175 if (TYPE_OK (long_integer_type_node))
4176 return unsignedp ? long_unsigned_type_node : long_integer_type_node;
4177 if (TYPE_OK (long_long_integer_type_node))
4179 ? long_long_unsigned_type_node
4180 : long_long_integer_type_node);
4182 #if HOST_BITS_PER_WIDE_INT >= 64
4183 if (TYPE_OK (intTI_type_node))
4184 return unsignedp ? unsigned_intTI_type_node : intTI_type_node;
4186 if (TYPE_OK (intDI_type_node))
4187 return unsignedp ? unsigned_intDI_type_node : intDI_type_node;
4188 if (TYPE_OK (intSI_type_node))
4189 return unsignedp ? unsigned_intSI_type_node : intSI_type_node;
4190 if (TYPE_OK (intHI_type_node))
4191 return unsignedp ? unsigned_intHI_type_node : intHI_type_node;
4192 if (TYPE_OK (intQI_type_node))
4193 return unsignedp ? unsigned_intQI_type_node : intQI_type_node;
4195 #undef GIMPLE_FIXED_TYPES
4196 #undef GIMPLE_FIXED_MODE_TYPES
4197 #undef GIMPLE_FIXED_TYPES_SAT
4198 #undef GIMPLE_FIXED_MODE_TYPES_SAT
4201 return build_nonstandard_integer_type (TYPE_PRECISION (type), unsignedp);
4205 /* Return an unsigned type the same as TYPE in other respects. */
4208 gimple_unsigned_type (tree type)
4210 return gimple_signed_or_unsigned_type (true, type);
4214 /* Return a signed type the same as TYPE in other respects. */
4217 gimple_signed_type (tree type)
4219 return gimple_signed_or_unsigned_type (false, type);
4223 /* Return the typed-based alias set for T, which may be an expression
4224 or a type. Return -1 if we don't do anything special. */
4227 gimple_get_alias_set (tree t)
4231 /* Permit type-punning when accessing a union, provided the access
4232 is directly through the union. For example, this code does not
4233 permit taking the address of a union member and then storing
4234 through it. Even the type-punning allowed here is a GCC
4235 extension, albeit a common and useful one; the C standard says
4236 that such accesses have implementation-defined behavior. */
4238 TREE_CODE (u) == COMPONENT_REF || TREE_CODE (u) == ARRAY_REF;
4239 u = TREE_OPERAND (u, 0))
4240 if (TREE_CODE (u) == COMPONENT_REF
4241 && TREE_CODE (TREE_TYPE (TREE_OPERAND (u, 0))) == UNION_TYPE)
4244 /* That's all the expressions we handle specially. */
4248 /* For convenience, follow the C standard when dealing with
4249 character types. Any object may be accessed via an lvalue that
4250 has character type. */
4251 if (t == char_type_node
4252 || t == signed_char_type_node
4253 || t == unsigned_char_type_node)
4256 /* Allow aliasing between signed and unsigned variants of the same
4257 type. We treat the signed variant as canonical. */
4258 if (TREE_CODE (t) == INTEGER_TYPE && TYPE_UNSIGNED (t))
4260 tree t1 = gimple_signed_type (t);
4262 /* t1 == t can happen for boolean nodes which are always unsigned. */
4264 return get_alias_set (t1);
4266 else if (POINTER_TYPE_P (t))
4268 /* From the common C and C++ langhook implementation:
4270 Unfortunately, there is no canonical form of a pointer type.
4271 In particular, if we have `typedef int I', then `int *', and
4272 `I *' are different types. So, we have to pick a canonical
4273 representative. We do this below.
4275 Technically, this approach is actually more conservative that
4276 it needs to be. In particular, `const int *' and `int *'
4277 should be in different alias sets, according to the C and C++
4278 standard, since their types are not the same, and so,
4279 technically, an `int **' and `const int **' cannot point at
4282 But, the standard is wrong. In particular, this code is
4287 const int* const* cipp = ipp;
4288 And, it doesn't make sense for that to be legal unless you
4289 can dereference IPP and CIPP. So, we ignore cv-qualifiers on
4290 the pointed-to types. This issue has been reported to the
4293 /* In addition to the above canonicalization issue with LTO
4294 we should also canonicalize `T (*)[]' to `T *' avoiding
4295 alias issues with pointer-to element types and pointer-to
4298 Likewise we need to deal with the situation of incomplete
4299 pointed-to types and make `*(struct X **)&a' and
4300 `*(struct X {} **)&a' alias. Otherwise we will have to
4301 guarantee that all pointer-to incomplete type variants
4302 will be replaced by pointer-to complete type variants if
4305 With LTO the convenient situation of using `void *' to
4306 access and store any pointer type will also become
4307 more apparent (and `void *' is just another pointer-to
4308 incomplete type). Assigning alias-set zero to `void *'
4309 and all pointer-to incomplete types is a not appealing
4310 solution. Assigning an effective alias-set zero only
4311 affecting pointers might be - by recording proper subset
4312 relationships of all pointer alias-sets.
4314 Pointer-to function types are another grey area which
4315 needs caution. Globbing them all into one alias-set
4316 or the above effective zero set would work. */
4318 /* For now just assign the same alias-set to all pointers.
4319 That's simple and avoids all the above problems. */
4320 if (t != ptr_type_node)
4321 return get_alias_set (ptr_type_node);
4328 /* Data structure used to count the number of dereferences to PTR
4329 inside an expression. */
4333 unsigned num_stores;
4337 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
4338 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
4341 count_ptr_derefs (tree *tp, int *walk_subtrees, void *data)
4343 struct walk_stmt_info *wi_p = (struct walk_stmt_info *) data;
4344 struct count_ptr_d *count_p = (struct count_ptr_d *) wi_p->info;
4346 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
4347 pointer 'ptr' is *not* dereferenced, it is simply used to compute
4348 the address of 'fld' as 'ptr + offsetof(fld)'. */
4349 if (TREE_CODE (*tp) == ADDR_EXPR)
4355 if (INDIRECT_REF_P (*tp) && TREE_OPERAND (*tp, 0) == count_p->ptr)
4358 count_p->num_stores++;
4360 count_p->num_loads++;
4366 /* Count the number of direct and indirect uses for pointer PTR in
4367 statement STMT. The number of direct uses is stored in
4368 *NUM_USES_P. Indirect references are counted separately depending
4369 on whether they are store or load operations. The counts are
4370 stored in *NUM_STORES_P and *NUM_LOADS_P. */
4373 count_uses_and_derefs (tree ptr, gimple stmt, unsigned *num_uses_p,
4374 unsigned *num_loads_p, unsigned *num_stores_p)
4383 /* Find out the total number of uses of PTR in STMT. */
4384 FOR_EACH_SSA_TREE_OPERAND (use, stmt, i, SSA_OP_USE)
4388 /* Now count the number of indirect references to PTR. This is
4389 truly awful, but we don't have much choice. There are no parent
4390 pointers inside INDIRECT_REFs, so an expression like
4391 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
4392 find all the indirect and direct uses of x_1 inside. The only
4393 shortcut we can take is the fact that GIMPLE only allows
4394 INDIRECT_REFs inside the expressions below. */
4395 if (is_gimple_assign (stmt)
4396 || gimple_code (stmt) == GIMPLE_RETURN
4397 || gimple_code (stmt) == GIMPLE_ASM
4398 || is_gimple_call (stmt))
4400 struct walk_stmt_info wi;
4401 struct count_ptr_d count;
4404 count.num_stores = 0;
4405 count.num_loads = 0;
4407 memset (&wi, 0, sizeof (wi));
4409 walk_gimple_op (stmt, count_ptr_derefs, &wi);
4411 *num_stores_p = count.num_stores;
4412 *num_loads_p = count.num_loads;
4415 gcc_assert (*num_uses_p >= *num_loads_p + *num_stores_p);
4418 /* From a tree operand OP return the base of a load or store operation
4419 or NULL_TREE if OP is not a load or a store. */
4422 get_base_loadstore (tree op)
4424 while (handled_component_p (op))
4425 op = TREE_OPERAND (op, 0);
4427 || INDIRECT_REF_P (op)
4428 || TREE_CODE (op) == TARGET_MEM_REF)
4433 /* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and
4434 VISIT_ADDR if non-NULL on loads, store and address-taken operands
4435 passing the STMT, the base of the operand and DATA to it. The base
4436 will be either a decl, an indirect reference (including TARGET_MEM_REF)
4437 or the argument of an address expression.
4438 Returns the results of these callbacks or'ed. */
4441 walk_stmt_load_store_addr_ops (gimple stmt, void *data,
4442 bool (*visit_load)(gimple, tree, void *),
4443 bool (*visit_store)(gimple, tree, void *),
4444 bool (*visit_addr)(gimple, tree, void *))
4448 if (gimple_assign_single_p (stmt))
4453 lhs = get_base_loadstore (gimple_assign_lhs (stmt));
4455 ret |= visit_store (stmt, lhs, data);
4457 rhs = gimple_assign_rhs1 (stmt);
4458 while (handled_component_p (rhs))
4459 rhs = TREE_OPERAND (rhs, 0);
4462 if (TREE_CODE (rhs) == ADDR_EXPR)
4463 ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);
4464 else if (TREE_CODE (rhs) == TARGET_MEM_REF
4465 && TMR_BASE (rhs) != NULL_TREE
4466 && TREE_CODE (TMR_BASE (rhs)) == ADDR_EXPR)
4467 ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (rhs), 0), data);
4468 else if (TREE_CODE (rhs) == OBJ_TYPE_REF
4469 && TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs)) == ADDR_EXPR)
4470 ret |= visit_addr (stmt, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs),
4472 lhs = gimple_assign_lhs (stmt);
4473 if (TREE_CODE (lhs) == TARGET_MEM_REF
4474 && TMR_BASE (lhs) != NULL_TREE
4475 && TREE_CODE (TMR_BASE (lhs)) == ADDR_EXPR)
4476 ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (lhs), 0), data);
4480 rhs = get_base_loadstore (rhs);
4482 ret |= visit_load (stmt, rhs, data);
4486 && (is_gimple_assign (stmt)
4487 || gimple_code (stmt) == GIMPLE_COND))
4489 for (i = 0; i < gimple_num_ops (stmt); ++i)
4490 if (gimple_op (stmt, i)
4491 && TREE_CODE (gimple_op (stmt, i)) == ADDR_EXPR)
4492 ret |= visit_addr (stmt, TREE_OPERAND (gimple_op (stmt, i), 0), data);
4494 else if (is_gimple_call (stmt))
4498 tree lhs = gimple_call_lhs (stmt);
4501 lhs = get_base_loadstore (lhs);
4503 ret |= visit_store (stmt, lhs, data);
4506 if (visit_load || visit_addr)
4507 for (i = 0; i < gimple_call_num_args (stmt); ++i)
4509 tree rhs = gimple_call_arg (stmt, i);
4511 && TREE_CODE (rhs) == ADDR_EXPR)
4512 ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);
4513 else if (visit_load)
4515 rhs = get_base_loadstore (rhs);
4517 ret |= visit_load (stmt, rhs, data);
4521 && gimple_call_chain (stmt)
4522 && TREE_CODE (gimple_call_chain (stmt)) == ADDR_EXPR)
4523 ret |= visit_addr (stmt, TREE_OPERAND (gimple_call_chain (stmt), 0),
4526 && gimple_call_return_slot_opt_p (stmt)
4527 && gimple_call_lhs (stmt) != NULL_TREE
4528 && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))
4529 ret |= visit_addr (stmt, gimple_call_lhs (stmt), data);
4531 else if (gimple_code (stmt) == GIMPLE_ASM)
4534 const char *constraint;
4535 const char **oconstraints;
4536 bool allows_mem, allows_reg, is_inout;
4537 noutputs = gimple_asm_noutputs (stmt);
4538 oconstraints = XALLOCAVEC (const char *, noutputs);
4539 if (visit_store || visit_addr)
4540 for (i = 0; i < gimple_asm_noutputs (stmt); ++i)
4542 tree link = gimple_asm_output_op (stmt, i);
4543 tree op = get_base_loadstore (TREE_VALUE (link));
4544 if (op && visit_store)
4545 ret |= visit_store (stmt, op, data);
4548 constraint = TREE_STRING_POINTER
4549 (TREE_VALUE (TREE_PURPOSE (link)));
4550 oconstraints[i] = constraint;
4551 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
4552 &allows_reg, &is_inout);
4553 if (op && !allows_reg && allows_mem)
4554 ret |= visit_addr (stmt, op, data);
4557 if (visit_load || visit_addr)
4558 for (i = 0; i < gimple_asm_ninputs (stmt); ++i)
4560 tree link = gimple_asm_input_op (stmt, i);
4561 tree op = TREE_VALUE (link);
4563 && TREE_CODE (op) == ADDR_EXPR)
4564 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
4565 else if (visit_load || visit_addr)
4567 op = get_base_loadstore (op);
4571 ret |= visit_load (stmt, op, data);
4574 constraint = TREE_STRING_POINTER
4575 (TREE_VALUE (TREE_PURPOSE (link)));
4576 parse_input_constraint (&constraint, 0, 0, noutputs,
4578 &allows_mem, &allows_reg);
4579 if (!allows_reg && allows_mem)
4580 ret |= visit_addr (stmt, op, data);
4586 else if (gimple_code (stmt) == GIMPLE_RETURN)
4588 tree op = gimple_return_retval (stmt);
4592 && TREE_CODE (op) == ADDR_EXPR)
4593 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
4594 else if (visit_load)
4596 op = get_base_loadstore (op);
4598 ret |= visit_load (stmt, op, data);
4603 && gimple_code (stmt) == GIMPLE_PHI)
4605 for (i = 0; i < gimple_phi_num_args (stmt); ++i)
4607 tree op = PHI_ARG_DEF (stmt, i);
4608 if (TREE_CODE (op) == ADDR_EXPR)
4609 ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);
4616 /* Like walk_stmt_load_store_addr_ops but with NULL visit_addr. IPA-CP
4617 should make a faster clone for this case. */
4620 walk_stmt_load_store_ops (gimple stmt, void *data,
4621 bool (*visit_load)(gimple, tree, void *),
4622 bool (*visit_store)(gimple, tree, void *))
4624 return walk_stmt_load_store_addr_ops (stmt, data,
4625 visit_load, visit_store, NULL);
4628 /* Helper for gimple_ior_addresses_taken_1. */
4631 gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED,
4632 tree addr, void *data)
4634 bitmap addresses_taken = (bitmap)data;
4635 addr = get_base_address (addr);
4639 bitmap_set_bit (addresses_taken, DECL_UID (addr));
4645 /* Set the bit for the uid of all decls that have their address taken
4646 in STMT in the ADDRESSES_TAKEN bitmap. Returns true if there
4647 were any in this stmt. */
4650 gimple_ior_addresses_taken (bitmap addresses_taken, gimple stmt)
4652 return walk_stmt_load_store_addr_ops (stmt, addresses_taken, NULL, NULL,
4653 gimple_ior_addresses_taken_1);
4657 /* Return a printable name for symbol DECL. */
4660 gimple_decl_printable_name (tree decl, int verbosity)
4662 if (!DECL_NAME (decl))
4665 if (DECL_ASSEMBLER_NAME_SET_P (decl))
4667 const char *str, *mangled_str;
4668 int dmgl_opts = DMGL_NO_OPTS;
4672 dmgl_opts = DMGL_VERBOSE
4676 if (TREE_CODE (decl) == FUNCTION_DECL)
4677 dmgl_opts |= DMGL_PARAMS;
4680 mangled_str = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
4681 str = cplus_demangle_v3 (mangled_str, dmgl_opts);
4682 return (str) ? str : mangled_str;
4685 return IDENTIFIER_POINTER (DECL_NAME (decl));
4689 /* Fold a OBJ_TYPE_REF expression to the address of a function.
4690 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). Adapted
4691 from cp_fold_obj_type_ref, but it tolerates types with no binfo
4695 gimple_fold_obj_type_ref (tree ref, tree known_type)
4697 HOST_WIDE_INT index;
4702 if (TYPE_BINFO (known_type) == NULL_TREE)
4705 v = BINFO_VIRTUALS (TYPE_BINFO (known_type));
4706 index = tree_low_cst (OBJ_TYPE_REF_TOKEN (ref), 1);
4710 i += (TARGET_VTABLE_USES_DESCRIPTORS
4711 ? TARGET_VTABLE_USES_DESCRIPTORS : 1);
4715 fndecl = TREE_VALUE (v);
4717 #ifdef ENABLE_CHECKING
4718 gcc_assert (tree_int_cst_equal (OBJ_TYPE_REF_TOKEN (ref),
4719 DECL_VINDEX (fndecl)));
4722 cgraph_node (fndecl)->local.vtable_method = true;
4724 return build_fold_addr_expr (fndecl);
4727 #include "gt-gimple.h"