1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent, but occasionally
28 calls language-dependent routines defined (for C) in typecheck.c. */
32 #include "coretypes.h"
38 #include "double-int.h"
45 #include "fold-const.h"
46 #include "stor-layout.h"
52 #include "hard-reg-set.h"
55 #include "toplev.h" /* get_random_seed */
56 #include "filenames.h"
59 #include "common/common-target.h"
60 #include "langhooks.h"
61 #include "tree-inline.h"
62 #include "tree-iterator.h"
64 #include "dominance.h"
66 #include "basic-block.h"
68 #include "tree-ssa-alias.h"
69 #include "internal-fn.h"
70 #include "gimple-expr.h"
73 #include "gimple-iterator.h"
75 #include "gimple-ssa.h"
77 #include "plugin-api.h"
80 #include "tree-phinodes.h"
81 #include "stringpool.h"
82 #include "tree-ssanames.h"
84 #include "statistics.h"
86 #include "fixed-value.h"
87 #include "insn-config.h"
96 #include "tree-pass.h"
97 #include "langhooks-def.h"
98 #include "diagnostic.h"
99 #include "tree-diagnostic.h"
100 #include "tree-pretty-print.h"
104 #include "builtins.h"
105 #include "print-tree.h"
106 #include "ipa-utils.h"
108 /* Tree code classes. */
110 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
111 #define END_OF_BASE_TREE_CODES tcc_exceptional,
113 const enum tree_code_class tree_code_type
[] = {
114 #include "all-tree.def"
118 #undef END_OF_BASE_TREE_CODES
120 /* Table indexed by tree code giving number of expression
121 operands beyond the fixed part of the node structure.
122 Not used for types or decls. */
124 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
125 #define END_OF_BASE_TREE_CODES 0,
127 const unsigned char tree_code_length
[] = {
128 #include "all-tree.def"
132 #undef END_OF_BASE_TREE_CODES
134 /* Names of tree components.
135 Used for printing out the tree and error messages. */
136 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
137 #define END_OF_BASE_TREE_CODES "@dummy",
139 static const char *const tree_code_name
[] = {
140 #include "all-tree.def"
144 #undef END_OF_BASE_TREE_CODES
146 /* Each tree code class has an associated string representation.
147 These must correspond to the tree_code_class entries. */
149 const char *const tree_code_class_strings
[] =
164 /* obstack.[ch] explicitly declined to prototype this. */
165 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
167 /* Statistics-gathering stuff. */
169 static int tree_code_counts
[MAX_TREE_CODES
];
170 int tree_node_counts
[(int) all_kinds
];
171 int tree_node_sizes
[(int) all_kinds
];
173 /* Keep in sync with tree.h:enum tree_node_kind. */
174 static const char * const tree_node_kind_names
[] = {
193 /* Unique id for next decl created. */
194 static GTY(()) int next_decl_uid
;
195 /* Unique id for next type created. */
196 static GTY(()) int next_type_uid
= 1;
197 /* Unique id for next debug decl created. Use negative numbers,
198 to catch erroneous uses. */
199 static GTY(()) int next_debug_decl_uid
;
201 /* Since we cannot rehash a type after it is in the table, we have to
202 keep the hash code. */
204 struct GTY((for_user
)) type_hash
{
209 /* Initial size of the hash table (rounded to next prime). */
210 #define TYPE_HASH_INITIAL_SIZE 1000
212 struct type_cache_hasher
: ggc_cache_hasher
<type_hash
*>
214 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
215 static bool equal (type_hash
*a
, type_hash
*b
);
218 handle_cache_entry (type_hash
*&t
)
220 extern void gt_ggc_mx (type_hash
*&);
221 if (t
== HTAB_DELETED_ENTRY
|| t
== HTAB_EMPTY_ENTRY
)
223 else if (ggc_marked_p (t
->type
))
226 t
= static_cast<type_hash
*> (HTAB_DELETED_ENTRY
);
230 /* Now here is the hash table. When recording a type, it is added to
231 the slot whose index is the hash code. Note that the hash table is
232 used for several kinds of types (function types, array types and
233 array index range types, for now). While all these live in the
234 same table, they are completely independent, and the hash code is
235 computed differently for each of these. */
237 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
239 /* Hash table and temporary node for larger integer const values. */
240 static GTY (()) tree int_cst_node
;
242 struct int_cst_hasher
: ggc_cache_hasher
<tree
>
244 static hashval_t
hash (tree t
);
245 static bool equal (tree x
, tree y
);
248 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
250 /* Hash table for optimization flags and target option flags. Use the same
251 hash table for both sets of options. Nodes for building the current
252 optimization and target option nodes. The assumption is most of the time
253 the options created will already be in the hash table, so we avoid
254 allocating and freeing up a node repeatably. */
255 static GTY (()) tree cl_optimization_node
;
256 static GTY (()) tree cl_target_option_node
;
258 struct cl_option_hasher
: ggc_cache_hasher
<tree
>
260 static hashval_t
hash (tree t
);
261 static bool equal (tree x
, tree y
);
264 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
266 /* General tree->tree mapping structure for use in hash tables. */
270 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
273 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
275 struct tree_vec_map_cache_hasher
: ggc_cache_hasher
<tree_vec_map
*>
277 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
280 equal (tree_vec_map
*a
, tree_vec_map
*b
)
282 return a
->base
.from
== b
->base
.from
;
286 handle_cache_entry (tree_vec_map
*&m
)
288 extern void gt_ggc_mx (tree_vec_map
*&);
289 if (m
== HTAB_EMPTY_ENTRY
|| m
== HTAB_DELETED_ENTRY
)
291 else if (ggc_marked_p (m
->base
.from
))
294 m
= static_cast<tree_vec_map
*> (HTAB_DELETED_ENTRY
);
299 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
301 static void set_type_quals (tree
, int);
302 static void print_type_hash_statistics (void);
303 static void print_debug_expr_statistics (void);
304 static void print_value_expr_statistics (void);
305 static void type_hash_list (const_tree
, inchash::hash
&);
306 static void attribute_hash_list (const_tree
, inchash::hash
&);
308 tree global_trees
[TI_MAX
];
309 tree integer_types
[itk_none
];
311 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
312 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
314 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
316 /* Number of operands for each OpenMP clause. */
317 unsigned const char omp_clause_num_ops
[] =
319 0, /* OMP_CLAUSE_ERROR */
320 1, /* OMP_CLAUSE_PRIVATE */
321 1, /* OMP_CLAUSE_SHARED */
322 1, /* OMP_CLAUSE_FIRSTPRIVATE */
323 2, /* OMP_CLAUSE_LASTPRIVATE */
324 4, /* OMP_CLAUSE_REDUCTION */
325 1, /* OMP_CLAUSE_COPYIN */
326 1, /* OMP_CLAUSE_COPYPRIVATE */
327 3, /* OMP_CLAUSE_LINEAR */
328 2, /* OMP_CLAUSE_ALIGNED */
329 1, /* OMP_CLAUSE_DEPEND */
330 1, /* OMP_CLAUSE_UNIFORM */
331 2, /* OMP_CLAUSE_FROM */
332 2, /* OMP_CLAUSE_TO */
333 2, /* OMP_CLAUSE_MAP */
334 2, /* OMP_CLAUSE__CACHE_ */
335 1, /* OMP_CLAUSE_DEVICE_RESIDENT */
336 1, /* OMP_CLAUSE_USE_DEVICE */
337 2, /* OMP_CLAUSE_GANG */
338 1, /* OMP_CLAUSE_ASYNC */
339 1, /* OMP_CLAUSE_WAIT */
340 0, /* OMP_CLAUSE_AUTO */
341 0, /* OMP_CLAUSE_SEQ */
342 1, /* OMP_CLAUSE__LOOPTEMP_ */
343 1, /* OMP_CLAUSE_IF */
344 1, /* OMP_CLAUSE_NUM_THREADS */
345 1, /* OMP_CLAUSE_SCHEDULE */
346 0, /* OMP_CLAUSE_NOWAIT */
347 0, /* OMP_CLAUSE_ORDERED */
348 0, /* OMP_CLAUSE_DEFAULT */
349 3, /* OMP_CLAUSE_COLLAPSE */
350 0, /* OMP_CLAUSE_UNTIED */
351 1, /* OMP_CLAUSE_FINAL */
352 0, /* OMP_CLAUSE_MERGEABLE */
353 1, /* OMP_CLAUSE_DEVICE */
354 1, /* OMP_CLAUSE_DIST_SCHEDULE */
355 0, /* OMP_CLAUSE_INBRANCH */
356 0, /* OMP_CLAUSE_NOTINBRANCH */
357 1, /* OMP_CLAUSE_NUM_TEAMS */
358 1, /* OMP_CLAUSE_THREAD_LIMIT */
359 0, /* OMP_CLAUSE_PROC_BIND */
360 1, /* OMP_CLAUSE_SAFELEN */
361 1, /* OMP_CLAUSE_SIMDLEN */
362 0, /* OMP_CLAUSE_FOR */
363 0, /* OMP_CLAUSE_PARALLEL */
364 0, /* OMP_CLAUSE_SECTIONS */
365 0, /* OMP_CLAUSE_TASKGROUP */
366 1, /* OMP_CLAUSE__SIMDUID_ */
367 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
368 0, /* OMP_CLAUSE_INDEPENDENT */
369 1, /* OMP_CLAUSE_WORKER */
370 1, /* OMP_CLAUSE_VECTOR */
371 1, /* OMP_CLAUSE_NUM_GANGS */
372 1, /* OMP_CLAUSE_NUM_WORKERS */
373 1, /* OMP_CLAUSE_VECTOR_LENGTH */
376 const char * const omp_clause_code_name
[] =
436 /* Return the tree node structure used by tree code CODE. */
438 static inline enum tree_node_structure_enum
439 tree_node_structure_for_code (enum tree_code code
)
441 switch (TREE_CODE_CLASS (code
))
443 case tcc_declaration
:
448 return TS_FIELD_DECL
;
454 return TS_LABEL_DECL
;
456 return TS_RESULT_DECL
;
457 case DEBUG_EXPR_DECL
:
460 return TS_CONST_DECL
;
464 return TS_FUNCTION_DECL
;
465 case TRANSLATION_UNIT_DECL
:
466 return TS_TRANSLATION_UNIT_DECL
;
468 return TS_DECL_NON_COMMON
;
472 return TS_TYPE_NON_COMMON
;
481 default: /* tcc_constant and tcc_exceptional */
486 /* tcc_constant cases. */
487 case VOID_CST
: return TS_TYPED
;
488 case INTEGER_CST
: return TS_INT_CST
;
489 case REAL_CST
: return TS_REAL_CST
;
490 case FIXED_CST
: return TS_FIXED_CST
;
491 case COMPLEX_CST
: return TS_COMPLEX
;
492 case VECTOR_CST
: return TS_VECTOR
;
493 case STRING_CST
: return TS_STRING
;
494 /* tcc_exceptional cases. */
495 case ERROR_MARK
: return TS_COMMON
;
496 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
497 case TREE_LIST
: return TS_LIST
;
498 case TREE_VEC
: return TS_VEC
;
499 case SSA_NAME
: return TS_SSA_NAME
;
500 case PLACEHOLDER_EXPR
: return TS_COMMON
;
501 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
502 case BLOCK
: return TS_BLOCK
;
503 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
504 case TREE_BINFO
: return TS_BINFO
;
505 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
506 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
507 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
515 /* Initialize tree_contains_struct to describe the hierarchy of tree
519 initialize_tree_contains_struct (void)
523 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
526 enum tree_node_structure_enum ts_code
;
528 code
= (enum tree_code
) i
;
529 ts_code
= tree_node_structure_for_code (code
);
531 /* Mark the TS structure itself. */
532 tree_contains_struct
[code
][ts_code
] = 1;
534 /* Mark all the structures that TS is derived from. */
552 case TS_STATEMENT_LIST
:
553 MARK_TS_TYPED (code
);
557 case TS_DECL_MINIMAL
:
563 case TS_OPTIMIZATION
:
564 case TS_TARGET_OPTION
:
565 MARK_TS_COMMON (code
);
568 case TS_TYPE_WITH_LANG_SPECIFIC
:
569 MARK_TS_TYPE_COMMON (code
);
572 case TS_TYPE_NON_COMMON
:
573 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
577 MARK_TS_DECL_MINIMAL (code
);
582 MARK_TS_DECL_COMMON (code
);
585 case TS_DECL_NON_COMMON
:
586 MARK_TS_DECL_WITH_VIS (code
);
589 case TS_DECL_WITH_VIS
:
593 MARK_TS_DECL_WRTL (code
);
597 MARK_TS_DECL_COMMON (code
);
601 MARK_TS_DECL_WITH_VIS (code
);
605 case TS_FUNCTION_DECL
:
606 MARK_TS_DECL_NON_COMMON (code
);
609 case TS_TRANSLATION_UNIT_DECL
:
610 MARK_TS_DECL_COMMON (code
);
618 /* Basic consistency checks for attributes used in fold. */
619 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
620 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
621 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
622 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
623 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
624 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
625 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
626 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
628 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
629 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
631 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
632 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
633 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
634 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
635 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
636 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
637 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
638 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
639 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
640 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
641 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
642 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
643 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
645 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
646 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
647 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
648 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
649 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
650 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
651 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
652 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
653 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
654 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
655 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
656 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
657 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
658 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
667 /* Initialize the hash table of types. */
669 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
672 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
675 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
677 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
679 int_cst_node
= make_int_cst (1, 1);
681 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
683 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
684 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
686 /* Initialize the tree_contains_struct array. */
687 initialize_tree_contains_struct ();
688 lang_hooks
.init_ts ();
692 /* The name of the object as the assembler will see it (but before any
693 translations made by ASM_OUTPUT_LABELREF). Often this is the same
694 as DECL_NAME. It is an IDENTIFIER_NODE. */
696 decl_assembler_name (tree decl
)
698 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
699 lang_hooks
.set_decl_assembler_name (decl
);
700 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
703 /* When the target supports COMDAT groups, this indicates which group the
704 DECL is associated with. This can be either an IDENTIFIER_NODE or a
705 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
707 decl_comdat_group (const_tree node
)
709 struct symtab_node
*snode
= symtab_node::get (node
);
712 return snode
->get_comdat_group ();
715 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
717 decl_comdat_group_id (const_tree node
)
719 struct symtab_node
*snode
= symtab_node::get (node
);
722 return snode
->get_comdat_group_id ();
725 /* When the target supports named section, return its name as IDENTIFIER_NODE
726 or NULL if it is in no section. */
728 decl_section_name (const_tree node
)
730 struct symtab_node
*snode
= symtab_node::get (node
);
733 return snode
->get_section ();
736 /* Set section section name of NODE to VALUE (that is expected to
737 be identifier node) */
739 set_decl_section_name (tree node
, const char *value
)
741 struct symtab_node
*snode
;
745 snode
= symtab_node::get (node
);
749 else if (TREE_CODE (node
) == VAR_DECL
)
750 snode
= varpool_node::get_create (node
);
752 snode
= cgraph_node::get_create (node
);
753 snode
->set_section (value
);
756 /* Return TLS model of a variable NODE. */
758 decl_tls_model (const_tree node
)
760 struct varpool_node
*snode
= varpool_node::get (node
);
762 return TLS_MODEL_NONE
;
763 return snode
->tls_model
;
766 /* Set TLS model of variable NODE to MODEL. */
768 set_decl_tls_model (tree node
, enum tls_model model
)
770 struct varpool_node
*vnode
;
772 if (model
== TLS_MODEL_NONE
)
774 vnode
= varpool_node::get (node
);
779 vnode
= varpool_node::get_create (node
);
780 vnode
->tls_model
= model
;
783 /* Compute the number of bytes occupied by a tree with code CODE.
784 This function cannot be used for nodes that have variable sizes,
785 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
787 tree_code_size (enum tree_code code
)
789 switch (TREE_CODE_CLASS (code
))
791 case tcc_declaration
: /* A decl node */
796 return sizeof (struct tree_field_decl
);
798 return sizeof (struct tree_parm_decl
);
800 return sizeof (struct tree_var_decl
);
802 return sizeof (struct tree_label_decl
);
804 return sizeof (struct tree_result_decl
);
806 return sizeof (struct tree_const_decl
);
808 return sizeof (struct tree_type_decl
);
810 return sizeof (struct tree_function_decl
);
811 case DEBUG_EXPR_DECL
:
812 return sizeof (struct tree_decl_with_rtl
);
813 case TRANSLATION_UNIT_DECL
:
814 return sizeof (struct tree_translation_unit_decl
);
818 return sizeof (struct tree_decl_non_common
);
820 return lang_hooks
.tree_size (code
);
824 case tcc_type
: /* a type node */
825 return sizeof (struct tree_type_non_common
);
827 case tcc_reference
: /* a reference */
828 case tcc_expression
: /* an expression */
829 case tcc_statement
: /* an expression with side effects */
830 case tcc_comparison
: /* a comparison expression */
831 case tcc_unary
: /* a unary arithmetic expression */
832 case tcc_binary
: /* a binary arithmetic expression */
833 return (sizeof (struct tree_exp
)
834 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
836 case tcc_constant
: /* a constant */
839 case VOID_CST
: return sizeof (struct tree_typed
);
840 case INTEGER_CST
: gcc_unreachable ();
841 case REAL_CST
: return sizeof (struct tree_real_cst
);
842 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
843 case COMPLEX_CST
: return sizeof (struct tree_complex
);
844 case VECTOR_CST
: return sizeof (struct tree_vector
);
845 case STRING_CST
: gcc_unreachable ();
847 return lang_hooks
.tree_size (code
);
850 case tcc_exceptional
: /* something random, like an identifier. */
853 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
854 case TREE_LIST
: return sizeof (struct tree_list
);
857 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
860 case OMP_CLAUSE
: gcc_unreachable ();
862 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
864 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
865 case BLOCK
: return sizeof (struct tree_block
);
866 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
867 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
868 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
871 return lang_hooks
.tree_size (code
);
879 /* Compute the number of bytes occupied by NODE. This routine only
880 looks at TREE_CODE, except for those nodes that have variable sizes. */
882 tree_size (const_tree node
)
884 const enum tree_code code
= TREE_CODE (node
);
888 return (sizeof (struct tree_int_cst
)
889 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
892 return (offsetof (struct tree_binfo
, base_binfos
)
894 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
897 return (sizeof (struct tree_vec
)
898 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
901 return (sizeof (struct tree_vector
)
902 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
905 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
908 return (sizeof (struct tree_omp_clause
)
909 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
913 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
914 return (sizeof (struct tree_exp
)
915 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
917 return tree_code_size (code
);
921 /* Record interesting allocation statistics for a tree node with CODE
925 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
926 size_t length ATTRIBUTE_UNUSED
)
928 enum tree_code_class type
= TREE_CODE_CLASS (code
);
931 if (!GATHER_STATISTICS
)
936 case tcc_declaration
: /* A decl node */
940 case tcc_type
: /* a type node */
944 case tcc_statement
: /* an expression with side effects */
948 case tcc_reference
: /* a reference */
952 case tcc_expression
: /* an expression */
953 case tcc_comparison
: /* a comparison expression */
954 case tcc_unary
: /* a unary arithmetic expression */
955 case tcc_binary
: /* a binary arithmetic expression */
959 case tcc_constant
: /* a constant */
963 case tcc_exceptional
: /* something random, like an identifier. */
966 case IDENTIFIER_NODE
:
979 kind
= ssa_name_kind
;
991 kind
= omp_clause_kind
;
1008 tree_code_counts
[(int) code
]++;
1009 tree_node_counts
[(int) kind
]++;
1010 tree_node_sizes
[(int) kind
] += length
;
1013 /* Allocate and return a new UID from the DECL_UID namespace. */
1016 allocate_decl_uid (void)
1018 return next_decl_uid
++;
1021 /* Return a newly allocated node of code CODE. For decl and type
1022 nodes, some other fields are initialized. The rest of the node is
1023 initialized to zero. This function cannot be used for TREE_VEC,
1024 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1027 Achoo! I got a code in the node. */
1030 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1033 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1034 size_t length
= tree_code_size (code
);
1036 record_node_allocation_statistics (code
, length
);
1038 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1039 TREE_SET_CODE (t
, code
);
1044 TREE_SIDE_EFFECTS (t
) = 1;
1047 case tcc_declaration
:
1048 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1050 if (code
== FUNCTION_DECL
)
1052 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
1053 DECL_MODE (t
) = FUNCTION_MODE
;
1058 DECL_SOURCE_LOCATION (t
) = input_location
;
1059 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1060 DECL_UID (t
) = --next_debug_decl_uid
;
1063 DECL_UID (t
) = allocate_decl_uid ();
1064 SET_DECL_PT_UID (t
, -1);
1066 if (TREE_CODE (t
) == LABEL_DECL
)
1067 LABEL_DECL_UID (t
) = -1;
1072 TYPE_UID (t
) = next_type_uid
++;
1073 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
1074 TYPE_USER_ALIGN (t
) = 0;
1075 TYPE_MAIN_VARIANT (t
) = t
;
1076 TYPE_CANONICAL (t
) = t
;
1078 /* Default to no attributes for type, but let target change that. */
1079 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1080 targetm
.set_default_type_attributes (t
);
1082 /* We have not yet computed the alias set for this type. */
1083 TYPE_ALIAS_SET (t
) = -1;
1087 TREE_CONSTANT (t
) = 1;
1090 case tcc_expression
:
1096 case PREDECREMENT_EXPR
:
1097 case PREINCREMENT_EXPR
:
1098 case POSTDECREMENT_EXPR
:
1099 case POSTINCREMENT_EXPR
:
1100 /* All of these have side-effects, no matter what their
1102 TREE_SIDE_EFFECTS (t
) = 1;
1111 /* Other classes need no special treatment. */
1118 /* Return a new node with the same contents as NODE except that its
1119 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1122 copy_node_stat (tree node MEM_STAT_DECL
)
1125 enum tree_code code
= TREE_CODE (node
);
1128 gcc_assert (code
!= STATEMENT_LIST
);
1130 length
= tree_size (node
);
1131 record_node_allocation_statistics (code
, length
);
1132 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1133 memcpy (t
, node
, length
);
1135 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1137 TREE_ASM_WRITTEN (t
) = 0;
1138 TREE_VISITED (t
) = 0;
1140 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1142 if (code
== DEBUG_EXPR_DECL
)
1143 DECL_UID (t
) = --next_debug_decl_uid
;
1146 DECL_UID (t
) = allocate_decl_uid ();
1147 if (DECL_PT_UID_SET_P (node
))
1148 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1150 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1151 && DECL_HAS_VALUE_EXPR_P (node
))
1153 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1154 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1156 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1157 if (TREE_CODE (node
) == VAR_DECL
)
1159 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1160 t
->decl_with_vis
.symtab_node
= NULL
;
1162 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1164 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1165 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1167 if (TREE_CODE (node
) == FUNCTION_DECL
)
1169 DECL_STRUCT_FUNCTION (t
) = NULL
;
1170 t
->decl_with_vis
.symtab_node
= NULL
;
1173 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1175 TYPE_UID (t
) = next_type_uid
++;
1176 /* The following is so that the debug code for
1177 the copy is different from the original type.
1178 The two statements usually duplicate each other
1179 (because they clear fields of the same union),
1180 but the optimizer should catch that. */
1181 TYPE_SYMTAB_POINTER (t
) = 0;
1182 TYPE_SYMTAB_ADDRESS (t
) = 0;
1184 /* Do not copy the values cache. */
1185 if (TYPE_CACHED_VALUES_P (t
))
1187 TYPE_CACHED_VALUES_P (t
) = 0;
1188 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1195 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1196 For example, this can copy a list made of TREE_LIST nodes. */
1199 copy_list (tree list
)
1207 head
= prev
= copy_node (list
);
1208 next
= TREE_CHAIN (list
);
1211 TREE_CHAIN (prev
) = copy_node (next
);
1212 prev
= TREE_CHAIN (prev
);
1213 next
= TREE_CHAIN (next
);
1219 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1220 INTEGER_CST with value CST and type TYPE. */
1223 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1225 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1226 /* We need an extra zero HWI if CST is an unsigned integer with its
1227 upper bit set, and if CST occupies a whole number of HWIs. */
1228 if (TYPE_UNSIGNED (type
)
1230 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1231 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1232 return cst
.get_len ();
1235 /* Return a new INTEGER_CST with value CST and type TYPE. */
1238 build_new_int_cst (tree type
, const wide_int
&cst
)
1240 unsigned int len
= cst
.get_len ();
1241 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1242 tree nt
= make_int_cst (len
, ext_len
);
1247 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1248 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1249 TREE_INT_CST_ELT (nt
, i
) = -1;
1251 else if (TYPE_UNSIGNED (type
)
1252 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1255 TREE_INT_CST_ELT (nt
, len
)
1256 = zext_hwi (cst
.elt (len
),
1257 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1260 for (unsigned int i
= 0; i
< len
; i
++)
1261 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1262 TREE_TYPE (nt
) = type
;
1266 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1269 build_int_cst (tree type
, HOST_WIDE_INT low
)
1271 /* Support legacy code. */
1273 type
= integer_type_node
;
1275 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1279 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1281 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1284 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1287 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1290 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1293 /* Constructs tree in type TYPE from with value given by CST. Signedness
1294 of CST is assumed to be the same as the signedness of TYPE. */
1297 double_int_to_tree (tree type
, double_int cst
)
1299 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1302 /* We force the wide_int CST to the range of the type TYPE by sign or
1303 zero extending it. OVERFLOWABLE indicates if we are interested in
1304 overflow of the value, when >0 we are only interested in signed
1305 overflow, for <0 we are interested in any overflow. OVERFLOWED
1306 indicates whether overflow has already occurred. CONST_OVERFLOWED
1307 indicates whether constant overflow has already occurred. We force
1308 T's value to be within range of T's type (by setting to 0 or 1 all
1309 the bits outside the type's range). We set TREE_OVERFLOWED if,
1310 OVERFLOWED is nonzero,
1311 or OVERFLOWABLE is >0 and signed overflow occurs
1312 or OVERFLOWABLE is <0 and any overflow occurs
1313 We return a new tree node for the extended wide_int. The node
1314 is shared if no overflow flags are set. */
1318 force_fit_type (tree type
, const wide_int_ref
&cst
,
1319 int overflowable
, bool overflowed
)
1321 signop sign
= TYPE_SIGN (type
);
1323 /* If we need to set overflow flags, return a new unshared node. */
1324 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1328 || (overflowable
> 0 && sign
== SIGNED
))
1330 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1331 tree t
= build_new_int_cst (type
, tmp
);
1332 TREE_OVERFLOW (t
) = 1;
1337 /* Else build a shared node. */
1338 return wide_int_to_tree (type
, cst
);
1341 /* These are the hash table functions for the hash table of INTEGER_CST
1342 nodes of a sizetype. */
1344 /* Return the hash code code X, an INTEGER_CST. */
1347 int_cst_hasher::hash (tree x
)
1349 const_tree
const t
= x
;
1350 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1353 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1354 code
^= TREE_INT_CST_ELT (t
, i
);
1359 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1360 is the same as that given by *Y, which is the same. */
1363 int_cst_hasher::equal (tree x
, tree y
)
1365 const_tree
const xt
= x
;
1366 const_tree
const yt
= y
;
1368 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1369 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1370 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1373 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1374 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1380 /* Create an INT_CST node of TYPE and value CST.
1381 The returned node is always shared. For small integers we use a
1382 per-type vector cache, for larger ones we use a single hash table.
1383 The value is extended from its precision according to the sign of
1384 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1385 the upper bits and ensures that hashing and value equality based
1386 upon the underlying HOST_WIDE_INTs works without masking. */
1389 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1396 unsigned int prec
= TYPE_PRECISION (type
);
1397 signop sgn
= TYPE_SIGN (type
);
1399 /* Verify that everything is canonical. */
1400 int l
= pcst
.get_len ();
1403 if (pcst
.elt (l
- 1) == 0)
1404 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1405 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1406 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1409 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1410 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1414 /* We just need to store a single HOST_WIDE_INT. */
1416 if (TYPE_UNSIGNED (type
))
1417 hwi
= cst
.to_uhwi ();
1419 hwi
= cst
.to_shwi ();
1421 switch (TREE_CODE (type
))
1424 gcc_assert (hwi
== 0);
1428 case REFERENCE_TYPE
:
1429 case POINTER_BOUNDS_TYPE
:
1430 /* Cache NULL pointer and zero bounds. */
1439 /* Cache false or true. */
1447 if (TYPE_SIGN (type
) == UNSIGNED
)
1450 limit
= INTEGER_SHARE_LIMIT
;
1451 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1456 /* Cache [-1, N). */
1457 limit
= INTEGER_SHARE_LIMIT
+ 1;
1458 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1472 /* Look for it in the type's vector of small shared ints. */
1473 if (!TYPE_CACHED_VALUES_P (type
))
1475 TYPE_CACHED_VALUES_P (type
) = 1;
1476 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1479 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1481 /* Make sure no one is clobbering the shared constant. */
1482 gcc_checking_assert (TREE_TYPE (t
) == type
1483 && TREE_INT_CST_NUNITS (t
) == 1
1484 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1485 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1486 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1489 /* Create a new shared int. */
1490 t
= build_new_int_cst (type
, cst
);
1491 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1496 /* Use the cache of larger shared ints, using int_cst_node as
1499 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1500 TREE_TYPE (int_cst_node
) = type
;
1502 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1506 /* Insert this one into the hash table. */
1509 /* Make a new node for next time round. */
1510 int_cst_node
= make_int_cst (1, 1);
1516 /* The value either hashes properly or we drop it on the floor
1517 for the gc to take care of. There will not be enough of them
1520 tree nt
= build_new_int_cst (type
, cst
);
1521 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1525 /* Insert this one into the hash table. */
1535 cache_integer_cst (tree t
)
1537 tree type
= TREE_TYPE (t
);
1540 int prec
= TYPE_PRECISION (type
);
1542 gcc_assert (!TREE_OVERFLOW (t
));
1544 switch (TREE_CODE (type
))
1547 gcc_assert (integer_zerop (t
));
1551 case REFERENCE_TYPE
:
1552 /* Cache NULL pointer. */
1553 if (integer_zerop (t
))
1561 /* Cache false or true. */
1563 if (wi::ltu_p (t
, 2))
1564 ix
= TREE_INT_CST_ELT (t
, 0);
1569 if (TYPE_UNSIGNED (type
))
1572 limit
= INTEGER_SHARE_LIMIT
;
1574 /* This is a little hokie, but if the prec is smaller than
1575 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1576 obvious test will not get the correct answer. */
1577 if (prec
< HOST_BITS_PER_WIDE_INT
)
1579 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1580 ix
= tree_to_uhwi (t
);
1582 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1583 ix
= tree_to_uhwi (t
);
1588 limit
= INTEGER_SHARE_LIMIT
+ 1;
1590 if (integer_minus_onep (t
))
1592 else if (!wi::neg_p (t
))
1594 if (prec
< HOST_BITS_PER_WIDE_INT
)
1596 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1597 ix
= tree_to_shwi (t
) + 1;
1599 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1600 ix
= tree_to_shwi (t
) + 1;
1614 /* Look for it in the type's vector of small shared ints. */
1615 if (!TYPE_CACHED_VALUES_P (type
))
1617 TYPE_CACHED_VALUES_P (type
) = 1;
1618 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1621 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1622 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1626 /* Use the cache of larger shared ints. */
1627 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1628 /* If there is already an entry for the number verify it's the
1631 gcc_assert (wi::eq_p (tree (*slot
), t
));
1633 /* Otherwise insert this one into the hash table. */
1639 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1640 and the rest are zeros. */
1643 build_low_bits_mask (tree type
, unsigned bits
)
1645 gcc_assert (bits
<= TYPE_PRECISION (type
));
1647 return wide_int_to_tree (type
, wi::mask (bits
, false,
1648 TYPE_PRECISION (type
)));
1651 /* Checks that X is integer constant that can be expressed in (unsigned)
1652 HOST_WIDE_INT without loss of precision. */
1655 cst_and_fits_in_hwi (const_tree x
)
1657 if (TREE_CODE (x
) != INTEGER_CST
)
1660 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1663 return TREE_INT_CST_NUNITS (x
) == 1;
1666 /* Build a newly constructed TREE_VEC node of length LEN. */
1669 make_vector_stat (unsigned len MEM_STAT_DECL
)
1672 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1674 record_node_allocation_statistics (VECTOR_CST
, length
);
1676 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1678 TREE_SET_CODE (t
, VECTOR_CST
);
1679 TREE_CONSTANT (t
) = 1;
1684 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1685 are in a list pointed to by VALS. */
1688 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1692 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1693 TREE_TYPE (v
) = type
;
1695 /* Iterate through elements and check for overflow. */
1696 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1698 tree value
= vals
[cnt
];
1700 VECTOR_CST_ELT (v
, cnt
) = value
;
1702 /* Don't crash if we get an address constant. */
1703 if (!CONSTANT_CLASS_P (value
))
1706 over
|= TREE_OVERFLOW (value
);
1709 TREE_OVERFLOW (v
) = over
;
1713 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1714 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1717 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1719 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1720 unsigned HOST_WIDE_INT idx
;
1723 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1725 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1726 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1728 return build_vector (type
, vec
);
1731 /* Build a vector of type VECTYPE where all the elements are SCs. */
1733 build_vector_from_val (tree vectype
, tree sc
)
1735 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1737 if (sc
== error_mark_node
)
1740 /* Verify that the vector type is suitable for SC. Note that there
1741 is some inconsistency in the type-system with respect to restrict
1742 qualifications of pointers. Vector types always have a main-variant
1743 element type and the qualification is applied to the vector-type.
1744 So TREE_TYPE (vector-type) does not return a properly qualified
1745 vector element-type. */
1746 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1747 TREE_TYPE (vectype
)));
1749 if (CONSTANT_CLASS_P (sc
))
1751 tree
*v
= XALLOCAVEC (tree
, nunits
);
1752 for (i
= 0; i
< nunits
; ++i
)
1754 return build_vector (vectype
, v
);
1758 vec
<constructor_elt
, va_gc
> *v
;
1759 vec_alloc (v
, nunits
);
1760 for (i
= 0; i
< nunits
; ++i
)
1761 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1762 return build_constructor (vectype
, v
);
1766 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1767 are in the vec pointed to by VALS. */
1769 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1771 tree c
= make_node (CONSTRUCTOR
);
1773 constructor_elt
*elt
;
1774 bool constant_p
= true;
1775 bool side_effects_p
= false;
1777 TREE_TYPE (c
) = type
;
1778 CONSTRUCTOR_ELTS (c
) = vals
;
1780 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1782 /* Mostly ctors will have elts that don't have side-effects, so
1783 the usual case is to scan all the elements. Hence a single
1784 loop for both const and side effects, rather than one loop
1785 each (with early outs). */
1786 if (!TREE_CONSTANT (elt
->value
))
1788 if (TREE_SIDE_EFFECTS (elt
->value
))
1789 side_effects_p
= true;
1792 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1793 TREE_CONSTANT (c
) = constant_p
;
1798 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1801 build_constructor_single (tree type
, tree index
, tree value
)
1803 vec
<constructor_elt
, va_gc
> *v
;
1804 constructor_elt elt
= {index
, value
};
1807 v
->quick_push (elt
);
1809 return build_constructor (type
, v
);
1813 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1814 are in a list pointed to by VALS. */
1816 build_constructor_from_list (tree type
, tree vals
)
1819 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1823 vec_alloc (v
, list_length (vals
));
1824 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1825 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1828 return build_constructor (type
, v
);
1831 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1832 of elements, provided as index/value pairs. */
1835 build_constructor_va (tree type
, int nelts
, ...)
1837 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1840 va_start (p
, nelts
);
1841 vec_alloc (v
, nelts
);
1844 tree index
= va_arg (p
, tree
);
1845 tree value
= va_arg (p
, tree
);
1846 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1849 return build_constructor (type
, v
);
1852 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1855 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1858 FIXED_VALUE_TYPE
*fp
;
1860 v
= make_node (FIXED_CST
);
1861 fp
= ggc_alloc
<fixed_value
> ();
1862 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1864 TREE_TYPE (v
) = type
;
1865 TREE_FIXED_CST_PTR (v
) = fp
;
1869 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1872 build_real (tree type
, REAL_VALUE_TYPE d
)
1875 REAL_VALUE_TYPE
*dp
;
1878 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1879 Consider doing it via real_convert now. */
1881 v
= make_node (REAL_CST
);
1882 dp
= ggc_alloc
<real_value
> ();
1883 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1885 TREE_TYPE (v
) = type
;
1886 TREE_REAL_CST_PTR (v
) = dp
;
1887 TREE_OVERFLOW (v
) = overflow
;
1891 /* Return a new REAL_CST node whose type is TYPE
1892 and whose value is the integer value of the INTEGER_CST node I. */
1895 real_value_from_int_cst (const_tree type
, const_tree i
)
1899 /* Clear all bits of the real value type so that we can later do
1900 bitwise comparisons to see if two values are the same. */
1901 memset (&d
, 0, sizeof d
);
1903 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1904 TYPE_SIGN (TREE_TYPE (i
)));
1908 /* Given a tree representing an integer constant I, return a tree
1909 representing the same value as a floating-point constant of type TYPE. */
1912 build_real_from_int_cst (tree type
, const_tree i
)
1915 int overflow
= TREE_OVERFLOW (i
);
1917 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1919 TREE_OVERFLOW (v
) |= overflow
;
1923 /* Return a newly constructed STRING_CST node whose value is
1924 the LEN characters at STR.
1925 Note that for a C string literal, LEN should include the trailing NUL.
1926 The TREE_TYPE is not initialized. */
1929 build_string (int len
, const char *str
)
1934 /* Do not waste bytes provided by padding of struct tree_string. */
1935 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1937 record_node_allocation_statistics (STRING_CST
, length
);
1939 s
= (tree
) ggc_internal_alloc (length
);
1941 memset (s
, 0, sizeof (struct tree_typed
));
1942 TREE_SET_CODE (s
, STRING_CST
);
1943 TREE_CONSTANT (s
) = 1;
1944 TREE_STRING_LENGTH (s
) = len
;
1945 memcpy (s
->string
.str
, str
, len
);
1946 s
->string
.str
[len
] = '\0';
1951 /* Return a newly constructed COMPLEX_CST node whose value is
1952 specified by the real and imaginary parts REAL and IMAG.
1953 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1954 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1957 build_complex (tree type
, tree real
, tree imag
)
1959 tree t
= make_node (COMPLEX_CST
);
1963 TREE_REALPART (t
) = real
;
1964 TREE_IMAGPART (t
) = imag
;
1965 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1966 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1970 /* Return a constant of arithmetic type TYPE which is the
1971 multiplicative identity of the set TYPE. */
1974 build_one_cst (tree type
)
1976 switch (TREE_CODE (type
))
1978 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1979 case POINTER_TYPE
: case REFERENCE_TYPE
:
1981 return build_int_cst (type
, 1);
1984 return build_real (type
, dconst1
);
1986 case FIXED_POINT_TYPE
:
1987 /* We can only generate 1 for accum types. */
1988 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1989 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1993 tree scalar
= build_one_cst (TREE_TYPE (type
));
1995 return build_vector_from_val (type
, scalar
);
1999 return build_complex (type
,
2000 build_one_cst (TREE_TYPE (type
)),
2001 build_zero_cst (TREE_TYPE (type
)));
2008 /* Return an integer of type TYPE containing all 1's in as much precision as
2009 it contains, or a complex or vector whose subparts are such integers. */
2012 build_all_ones_cst (tree type
)
2014 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2016 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2017 return build_complex (type
, scalar
, scalar
);
2020 return build_minus_one_cst (type
);
2023 /* Return a constant of arithmetic type TYPE which is the
2024 opposite of the multiplicative identity of the set TYPE. */
2027 build_minus_one_cst (tree type
)
2029 switch (TREE_CODE (type
))
2031 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2032 case POINTER_TYPE
: case REFERENCE_TYPE
:
2034 return build_int_cst (type
, -1);
2037 return build_real (type
, dconstm1
);
2039 case FIXED_POINT_TYPE
:
2040 /* We can only generate 1 for accum types. */
2041 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2042 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2047 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2049 return build_vector_from_val (type
, scalar
);
2053 return build_complex (type
,
2054 build_minus_one_cst (TREE_TYPE (type
)),
2055 build_zero_cst (TREE_TYPE (type
)));
2062 /* Build 0 constant of type TYPE. This is used by constructor folding
2063 and thus the constant should be represented in memory by
2067 build_zero_cst (tree type
)
2069 switch (TREE_CODE (type
))
2071 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2072 case POINTER_TYPE
: case REFERENCE_TYPE
:
2073 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2074 return build_int_cst (type
, 0);
2077 return build_real (type
, dconst0
);
2079 case FIXED_POINT_TYPE
:
2080 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2084 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2086 return build_vector_from_val (type
, scalar
);
2091 tree zero
= build_zero_cst (TREE_TYPE (type
));
2093 return build_complex (type
, zero
, zero
);
2097 if (!AGGREGATE_TYPE_P (type
))
2098 return fold_convert (type
, integer_zero_node
);
2099 return build_constructor (type
, NULL
);
2104 /* Build a BINFO with LEN language slots. */
2107 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2110 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2111 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2113 record_node_allocation_statistics (TREE_BINFO
, length
);
2115 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2117 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2119 TREE_SET_CODE (t
, TREE_BINFO
);
2121 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2126 /* Create a CASE_LABEL_EXPR tree node and return it. */
2129 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2131 tree t
= make_node (CASE_LABEL_EXPR
);
2133 TREE_TYPE (t
) = void_type_node
;
2134 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2136 CASE_LOW (t
) = low_value
;
2137 CASE_HIGH (t
) = high_value
;
2138 CASE_LABEL (t
) = label_decl
;
2139 CASE_CHAIN (t
) = NULL_TREE
;
2144 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2145 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2146 The latter determines the length of the HOST_WIDE_INT vector. */
2149 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2152 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2153 + sizeof (struct tree_int_cst
));
2156 record_node_allocation_statistics (INTEGER_CST
, length
);
2158 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2160 TREE_SET_CODE (t
, INTEGER_CST
);
2161 TREE_INT_CST_NUNITS (t
) = len
;
2162 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2163 /* to_offset can only be applied to trees that are offset_int-sized
2164 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2165 must be exactly the precision of offset_int and so LEN is correct. */
2166 if (ext_len
<= OFFSET_INT_ELTS
)
2167 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2169 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2171 TREE_CONSTANT (t
) = 1;
2176 /* Build a newly constructed TREE_VEC node of length LEN. */
2179 make_tree_vec_stat (int len MEM_STAT_DECL
)
2182 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2184 record_node_allocation_statistics (TREE_VEC
, length
);
2186 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2188 TREE_SET_CODE (t
, TREE_VEC
);
2189 TREE_VEC_LENGTH (t
) = len
;
2194 /* Grow a TREE_VEC node to new length LEN. */
2197 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2199 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2201 int oldlen
= TREE_VEC_LENGTH (v
);
2202 gcc_assert (len
> oldlen
);
2204 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2205 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2207 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2209 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2211 TREE_VEC_LENGTH (v
) = len
;
2216 /* Return 1 if EXPR is the integer constant zero or a complex constant
2220 integer_zerop (const_tree expr
)
2224 switch (TREE_CODE (expr
))
2227 return wi::eq_p (expr
, 0);
2229 return (integer_zerop (TREE_REALPART (expr
))
2230 && integer_zerop (TREE_IMAGPART (expr
)));
2234 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2235 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2244 /* Return 1 if EXPR is the integer constant one or the corresponding
2245 complex constant. */
2248 integer_onep (const_tree expr
)
2252 switch (TREE_CODE (expr
))
2255 return wi::eq_p (wi::to_widest (expr
), 1);
2257 return (integer_onep (TREE_REALPART (expr
))
2258 && integer_zerop (TREE_IMAGPART (expr
)));
2262 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2263 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2272 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2273 return 1 if every piece is the integer constant one. */
2276 integer_each_onep (const_tree expr
)
2280 if (TREE_CODE (expr
) == COMPLEX_CST
)
2281 return (integer_onep (TREE_REALPART (expr
))
2282 && integer_onep (TREE_IMAGPART (expr
)));
2284 return integer_onep (expr
);
2287 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2288 it contains, or a complex or vector whose subparts are such integers. */
2291 integer_all_onesp (const_tree expr
)
2295 if (TREE_CODE (expr
) == COMPLEX_CST
2296 && integer_all_onesp (TREE_REALPART (expr
))
2297 && integer_all_onesp (TREE_IMAGPART (expr
)))
2300 else if (TREE_CODE (expr
) == VECTOR_CST
)
2303 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2304 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2309 else if (TREE_CODE (expr
) != INTEGER_CST
)
2312 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2315 /* Return 1 if EXPR is the integer constant minus one. */
2318 integer_minus_onep (const_tree expr
)
2322 if (TREE_CODE (expr
) == COMPLEX_CST
)
2323 return (integer_all_onesp (TREE_REALPART (expr
))
2324 && integer_zerop (TREE_IMAGPART (expr
)));
2326 return integer_all_onesp (expr
);
2329 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2333 integer_pow2p (const_tree expr
)
2337 if (TREE_CODE (expr
) == COMPLEX_CST
2338 && integer_pow2p (TREE_REALPART (expr
))
2339 && integer_zerop (TREE_IMAGPART (expr
)))
2342 if (TREE_CODE (expr
) != INTEGER_CST
)
2345 return wi::popcount (expr
) == 1;
2348 /* Return 1 if EXPR is an integer constant other than zero or a
2349 complex constant other than zero. */
2352 integer_nonzerop (const_tree expr
)
2356 return ((TREE_CODE (expr
) == INTEGER_CST
2357 && !wi::eq_p (expr
, 0))
2358 || (TREE_CODE (expr
) == COMPLEX_CST
2359 && (integer_nonzerop (TREE_REALPART (expr
))
2360 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2363 /* Return 1 if EXPR is the integer constant one. For vector,
2364 return 1 if every piece is the integer constant minus one
2365 (representing the value TRUE). */
2368 integer_truep (const_tree expr
)
2372 if (TREE_CODE (expr
) == VECTOR_CST
)
2373 return integer_all_onesp (expr
);
2374 return integer_onep (expr
);
2377 /* Return 1 if EXPR is the fixed-point constant zero. */
2380 fixed_zerop (const_tree expr
)
2382 return (TREE_CODE (expr
) == FIXED_CST
2383 && TREE_FIXED_CST (expr
).data
.is_zero ());
2386 /* Return the power of two represented by a tree node known to be a
2390 tree_log2 (const_tree expr
)
2394 if (TREE_CODE (expr
) == COMPLEX_CST
)
2395 return tree_log2 (TREE_REALPART (expr
));
2397 return wi::exact_log2 (expr
);
2400 /* Similar, but return the largest integer Y such that 2 ** Y is less
2401 than or equal to EXPR. */
2404 tree_floor_log2 (const_tree expr
)
2408 if (TREE_CODE (expr
) == COMPLEX_CST
)
2409 return tree_log2 (TREE_REALPART (expr
));
2411 return wi::floor_log2 (expr
);
2414 /* Return number of known trailing zero bits in EXPR, or, if the value of
2415 EXPR is known to be zero, the precision of it's type. */
2418 tree_ctz (const_tree expr
)
2420 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2421 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2424 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2425 switch (TREE_CODE (expr
))
2428 ret1
= wi::ctz (expr
);
2429 return MIN (ret1
, prec
);
2431 ret1
= wi::ctz (get_nonzero_bits (expr
));
2432 return MIN (ret1
, prec
);
2439 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2442 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2443 return MIN (ret1
, ret2
);
2444 case POINTER_PLUS_EXPR
:
2445 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2446 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2447 /* Second operand is sizetype, which could be in theory
2448 wider than pointer's precision. Make sure we never
2449 return more than prec. */
2450 ret2
= MIN (ret2
, prec
);
2451 return MIN (ret1
, ret2
);
2453 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2454 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2455 return MAX (ret1
, ret2
);
2457 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2458 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2459 return MIN (ret1
+ ret2
, prec
);
2461 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2462 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2463 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2465 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2466 return MIN (ret1
+ ret2
, prec
);
2470 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2471 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2473 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2474 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2479 case TRUNC_DIV_EXPR
:
2481 case FLOOR_DIV_EXPR
:
2482 case ROUND_DIV_EXPR
:
2483 case EXACT_DIV_EXPR
:
2484 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2485 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2487 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2490 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2498 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2499 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2501 return MIN (ret1
, prec
);
2503 return tree_ctz (TREE_OPERAND (expr
, 0));
2505 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2508 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2509 return MIN (ret1
, ret2
);
2511 return tree_ctz (TREE_OPERAND (expr
, 1));
2513 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2514 if (ret1
> BITS_PER_UNIT
)
2516 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2517 return MIN (ret1
, prec
);
2525 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2526 decimal float constants, so don't return 1 for them. */
2529 real_zerop (const_tree expr
)
2533 switch (TREE_CODE (expr
))
2536 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2537 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2539 return real_zerop (TREE_REALPART (expr
))
2540 && real_zerop (TREE_IMAGPART (expr
));
2544 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2545 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2554 /* Return 1 if EXPR is the real constant one in real or complex form.
2555 Trailing zeroes matter for decimal float constants, so don't return
2559 real_onep (const_tree expr
)
2563 switch (TREE_CODE (expr
))
2566 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2567 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2569 return real_onep (TREE_REALPART (expr
))
2570 && real_zerop (TREE_IMAGPART (expr
));
2574 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2575 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2584 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2585 matter for decimal float constants, so don't return 1 for them. */
2588 real_minus_onep (const_tree expr
)
2592 switch (TREE_CODE (expr
))
2595 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2596 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2598 return real_minus_onep (TREE_REALPART (expr
))
2599 && real_zerop (TREE_IMAGPART (expr
));
2603 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2604 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2613 /* Nonzero if EXP is a constant or a cast of a constant. */
2616 really_constant_p (const_tree exp
)
2618 /* This is not quite the same as STRIP_NOPS. It does more. */
2619 while (CONVERT_EXPR_P (exp
)
2620 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2621 exp
= TREE_OPERAND (exp
, 0);
2622 return TREE_CONSTANT (exp
);
2625 /* Return first list element whose TREE_VALUE is ELEM.
2626 Return 0 if ELEM is not in LIST. */
2629 value_member (tree elem
, tree list
)
2633 if (elem
== TREE_VALUE (list
))
2635 list
= TREE_CHAIN (list
);
2640 /* Return first list element whose TREE_PURPOSE is ELEM.
2641 Return 0 if ELEM is not in LIST. */
2644 purpose_member (const_tree elem
, tree list
)
2648 if (elem
== TREE_PURPOSE (list
))
2650 list
= TREE_CHAIN (list
);
2655 /* Return true if ELEM is in V. */
2658 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2662 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2668 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2672 chain_index (int idx
, tree chain
)
2674 for (; chain
&& idx
> 0; --idx
)
2675 chain
= TREE_CHAIN (chain
);
2679 /* Return nonzero if ELEM is part of the chain CHAIN. */
2682 chain_member (const_tree elem
, const_tree chain
)
2688 chain
= DECL_CHAIN (chain
);
2694 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2695 We expect a null pointer to mark the end of the chain.
2696 This is the Lisp primitive `length'. */
2699 list_length (const_tree t
)
2702 #ifdef ENABLE_TREE_CHECKING
2710 #ifdef ENABLE_TREE_CHECKING
2713 gcc_assert (p
!= q
);
2721 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2722 UNION_TYPE TYPE, or NULL_TREE if none. */
2725 first_field (const_tree type
)
2727 tree t
= TYPE_FIELDS (type
);
2728 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2733 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2734 by modifying the last node in chain 1 to point to chain 2.
2735 This is the Lisp primitive `nconc'. */
2738 chainon (tree op1
, tree op2
)
2747 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2749 TREE_CHAIN (t1
) = op2
;
2751 #ifdef ENABLE_TREE_CHECKING
2754 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2755 gcc_assert (t2
!= t1
);
2762 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2765 tree_last (tree chain
)
2769 while ((next
= TREE_CHAIN (chain
)))
2774 /* Reverse the order of elements in the chain T,
2775 and return the new head of the chain (old last element). */
2780 tree prev
= 0, decl
, next
;
2781 for (decl
= t
; decl
; decl
= next
)
2783 /* We shouldn't be using this function to reverse BLOCK chains; we
2784 have blocks_nreverse for that. */
2785 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2786 next
= TREE_CHAIN (decl
);
2787 TREE_CHAIN (decl
) = prev
;
2793 /* Return a newly created TREE_LIST node whose
2794 purpose and value fields are PARM and VALUE. */
2797 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2799 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2800 TREE_PURPOSE (t
) = parm
;
2801 TREE_VALUE (t
) = value
;
2805 /* Build a chain of TREE_LIST nodes from a vector. */
2808 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2810 tree ret
= NULL_TREE
;
2814 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2816 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2817 pp
= &TREE_CHAIN (*pp
);
2822 /* Return a newly created TREE_LIST node whose
2823 purpose and value fields are PURPOSE and VALUE
2824 and whose TREE_CHAIN is CHAIN. */
2827 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2831 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2832 memset (node
, 0, sizeof (struct tree_common
));
2834 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2836 TREE_SET_CODE (node
, TREE_LIST
);
2837 TREE_CHAIN (node
) = chain
;
2838 TREE_PURPOSE (node
) = purpose
;
2839 TREE_VALUE (node
) = value
;
2843 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2847 ctor_to_vec (tree ctor
)
2849 vec
<tree
, va_gc
> *vec
;
2850 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2854 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2855 vec
->quick_push (val
);
2860 /* Return the size nominally occupied by an object of type TYPE
2861 when it resides in memory. The value is measured in units of bytes,
2862 and its data type is that normally used for type sizes
2863 (which is the first type created by make_signed_type or
2864 make_unsigned_type). */
2867 size_in_bytes (const_tree type
)
2871 if (type
== error_mark_node
)
2872 return integer_zero_node
;
2874 type
= TYPE_MAIN_VARIANT (type
);
2875 t
= TYPE_SIZE_UNIT (type
);
2879 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2880 return size_zero_node
;
2886 /* Return the size of TYPE (in bytes) as a wide integer
2887 or return -1 if the size can vary or is larger than an integer. */
2890 int_size_in_bytes (const_tree type
)
2894 if (type
== error_mark_node
)
2897 type
= TYPE_MAIN_VARIANT (type
);
2898 t
= TYPE_SIZE_UNIT (type
);
2900 if (t
&& tree_fits_uhwi_p (t
))
2901 return TREE_INT_CST_LOW (t
);
2906 /* Return the maximum size of TYPE (in bytes) as a wide integer
2907 or return -1 if the size can vary or is larger than an integer. */
2910 max_int_size_in_bytes (const_tree type
)
2912 HOST_WIDE_INT size
= -1;
2915 /* If this is an array type, check for a possible MAX_SIZE attached. */
2917 if (TREE_CODE (type
) == ARRAY_TYPE
)
2919 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2921 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2922 size
= tree_to_uhwi (size_tree
);
2925 /* If we still haven't been able to get a size, see if the language
2926 can compute a maximum size. */
2930 size_tree
= lang_hooks
.types
.max_size (type
);
2932 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2933 size
= tree_to_uhwi (size_tree
);
2939 /* Return the bit position of FIELD, in bits from the start of the record.
2940 This is a tree of type bitsizetype. */
2943 bit_position (const_tree field
)
2945 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2946 DECL_FIELD_BIT_OFFSET (field
));
2949 /* Return the byte position of FIELD, in bytes from the start of the record.
2950 This is a tree of type sizetype. */
2953 byte_position (const_tree field
)
2955 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2956 DECL_FIELD_BIT_OFFSET (field
));
2959 /* Likewise, but return as an integer. It must be representable in
2960 that way (since it could be a signed value, we don't have the
2961 option of returning -1 like int_size_in_byte can. */
2964 int_byte_position (const_tree field
)
2966 return tree_to_shwi (byte_position (field
));
2969 /* Return the strictest alignment, in bits, that T is known to have. */
2972 expr_align (const_tree t
)
2974 unsigned int align0
, align1
;
2976 switch (TREE_CODE (t
))
2978 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2979 /* If we have conversions, we know that the alignment of the
2980 object must meet each of the alignments of the types. */
2981 align0
= expr_align (TREE_OPERAND (t
, 0));
2982 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2983 return MAX (align0
, align1
);
2985 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2986 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2987 case CLEANUP_POINT_EXPR
:
2988 /* These don't change the alignment of an object. */
2989 return expr_align (TREE_OPERAND (t
, 0));
2992 /* The best we can do is say that the alignment is the least aligned
2994 align0
= expr_align (TREE_OPERAND (t
, 1));
2995 align1
= expr_align (TREE_OPERAND (t
, 2));
2996 return MIN (align0
, align1
);
2998 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2999 meaningfully, it's always 1. */
3000 case LABEL_DECL
: case CONST_DECL
:
3001 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3003 gcc_assert (DECL_ALIGN (t
) != 0);
3004 return DECL_ALIGN (t
);
3010 /* Otherwise take the alignment from that of the type. */
3011 return TYPE_ALIGN (TREE_TYPE (t
));
3014 /* Return, as a tree node, the number of elements for TYPE (which is an
3015 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3018 array_type_nelts (const_tree type
)
3020 tree index_type
, min
, max
;
3022 /* If they did it with unspecified bounds, then we should have already
3023 given an error about it before we got here. */
3024 if (! TYPE_DOMAIN (type
))
3025 return error_mark_node
;
3027 index_type
= TYPE_DOMAIN (type
);
3028 min
= TYPE_MIN_VALUE (index_type
);
3029 max
= TYPE_MAX_VALUE (index_type
);
3031 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3033 return error_mark_node
;
3035 return (integer_zerop (min
)
3037 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3040 /* If arg is static -- a reference to an object in static storage -- then
3041 return the object. This is not the same as the C meaning of `static'.
3042 If arg isn't static, return NULL. */
3047 switch (TREE_CODE (arg
))
3050 /* Nested functions are static, even though taking their address will
3051 involve a trampoline as we unnest the nested function and create
3052 the trampoline on the tree level. */
3056 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3057 && ! DECL_THREAD_LOCAL_P (arg
)
3058 && ! DECL_DLLIMPORT_P (arg
)
3062 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3066 return TREE_STATIC (arg
) ? arg
: NULL
;
3073 /* If the thing being referenced is not a field, then it is
3074 something language specific. */
3075 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3077 /* If we are referencing a bitfield, we can't evaluate an
3078 ADDR_EXPR at compile time and so it isn't a constant. */
3079 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3082 return staticp (TREE_OPERAND (arg
, 0));
3088 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3091 case ARRAY_RANGE_REF
:
3092 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3093 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3094 return staticp (TREE_OPERAND (arg
, 0));
3098 case COMPOUND_LITERAL_EXPR
:
3099 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3109 /* Return whether OP is a DECL whose address is function-invariant. */
3112 decl_address_invariant_p (const_tree op
)
3114 /* The conditions below are slightly less strict than the one in
3117 switch (TREE_CODE (op
))
3126 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3127 || DECL_THREAD_LOCAL_P (op
)
3128 || DECL_CONTEXT (op
) == current_function_decl
3129 || decl_function_context (op
) == current_function_decl
)
3134 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3135 || decl_function_context (op
) == current_function_decl
)
3146 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3149 decl_address_ip_invariant_p (const_tree op
)
3151 /* The conditions below are slightly less strict than the one in
3154 switch (TREE_CODE (op
))
3162 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3163 && !DECL_DLLIMPORT_P (op
))
3164 || DECL_THREAD_LOCAL_P (op
))
3169 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3181 /* Return true if T is function-invariant (internal function, does
3182 not handle arithmetic; that's handled in skip_simple_arithmetic and
3183 tree_invariant_p). */
3185 static bool tree_invariant_p (tree t
);
3188 tree_invariant_p_1 (tree t
)
3192 if (TREE_CONSTANT (t
)
3193 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3196 switch (TREE_CODE (t
))
3202 op
= TREE_OPERAND (t
, 0);
3203 while (handled_component_p (op
))
3205 switch (TREE_CODE (op
))
3208 case ARRAY_RANGE_REF
:
3209 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3210 || TREE_OPERAND (op
, 2) != NULL_TREE
3211 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3216 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3222 op
= TREE_OPERAND (op
, 0);
3225 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3234 /* Return true if T is function-invariant. */
3237 tree_invariant_p (tree t
)
3239 tree inner
= skip_simple_arithmetic (t
);
3240 return tree_invariant_p_1 (inner
);
3243 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3244 Do this to any expression which may be used in more than one place,
3245 but must be evaluated only once.
3247 Normally, expand_expr would reevaluate the expression each time.
3248 Calling save_expr produces something that is evaluated and recorded
3249 the first time expand_expr is called on it. Subsequent calls to
3250 expand_expr just reuse the recorded value.
3252 The call to expand_expr that generates code that actually computes
3253 the value is the first call *at compile time*. Subsequent calls
3254 *at compile time* generate code to use the saved value.
3255 This produces correct result provided that *at run time* control
3256 always flows through the insns made by the first expand_expr
3257 before reaching the other places where the save_expr was evaluated.
3258 You, the caller of save_expr, must make sure this is so.
3260 Constants, and certain read-only nodes, are returned with no
3261 SAVE_EXPR because that is safe. Expressions containing placeholders
3262 are not touched; see tree.def for an explanation of what these
3266 save_expr (tree expr
)
3268 tree t
= fold (expr
);
3271 /* If the tree evaluates to a constant, then we don't want to hide that
3272 fact (i.e. this allows further folding, and direct checks for constants).
3273 However, a read-only object that has side effects cannot be bypassed.
3274 Since it is no problem to reevaluate literals, we just return the
3276 inner
= skip_simple_arithmetic (t
);
3277 if (TREE_CODE (inner
) == ERROR_MARK
)
3280 if (tree_invariant_p_1 (inner
))
3283 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3284 it means that the size or offset of some field of an object depends on
3285 the value within another field.
3287 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3288 and some variable since it would then need to be both evaluated once and
3289 evaluated more than once. Front-ends must assure this case cannot
3290 happen by surrounding any such subexpressions in their own SAVE_EXPR
3291 and forcing evaluation at the proper time. */
3292 if (contains_placeholder_p (inner
))
3295 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3296 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3298 /* This expression might be placed ahead of a jump to ensure that the
3299 value was computed on both sides of the jump. So make sure it isn't
3300 eliminated as dead. */
3301 TREE_SIDE_EFFECTS (t
) = 1;
3305 /* Look inside EXPR into any simple arithmetic operations. Return the
3306 outermost non-arithmetic or non-invariant node. */
3309 skip_simple_arithmetic (tree expr
)
3311 /* We don't care about whether this can be used as an lvalue in this
3313 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3314 expr
= TREE_OPERAND (expr
, 0);
3316 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3317 a constant, it will be more efficient to not make another SAVE_EXPR since
3318 it will allow better simplification and GCSE will be able to merge the
3319 computations if they actually occur. */
3322 if (UNARY_CLASS_P (expr
))
3323 expr
= TREE_OPERAND (expr
, 0);
3324 else if (BINARY_CLASS_P (expr
))
3326 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3327 expr
= TREE_OPERAND (expr
, 0);
3328 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3329 expr
= TREE_OPERAND (expr
, 1);
3340 /* Look inside EXPR into simple arithmetic operations involving constants.
3341 Return the outermost non-arithmetic or non-constant node. */
3344 skip_simple_constant_arithmetic (tree expr
)
3346 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3347 expr
= TREE_OPERAND (expr
, 0);
3351 if (UNARY_CLASS_P (expr
))
3352 expr
= TREE_OPERAND (expr
, 0);
3353 else if (BINARY_CLASS_P (expr
))
3355 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3356 expr
= TREE_OPERAND (expr
, 0);
3357 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3358 expr
= TREE_OPERAND (expr
, 1);
3369 /* Return which tree structure is used by T. */
3371 enum tree_node_structure_enum
3372 tree_node_structure (const_tree t
)
3374 const enum tree_code code
= TREE_CODE (t
);
3375 return tree_node_structure_for_code (code
);
3378 /* Set various status flags when building a CALL_EXPR object T. */
3381 process_call_operands (tree t
)
3383 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3384 bool read_only
= false;
3385 int i
= call_expr_flags (t
);
3387 /* Calls have side-effects, except those to const or pure functions. */
3388 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3389 side_effects
= true;
3390 /* Propagate TREE_READONLY of arguments for const functions. */
3394 if (!side_effects
|| read_only
)
3395 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3397 tree op
= TREE_OPERAND (t
, i
);
3398 if (op
&& TREE_SIDE_EFFECTS (op
))
3399 side_effects
= true;
3400 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3404 TREE_SIDE_EFFECTS (t
) = side_effects
;
3405 TREE_READONLY (t
) = read_only
;
3408 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3409 size or offset that depends on a field within a record. */
3412 contains_placeholder_p (const_tree exp
)
3414 enum tree_code code
;
3419 code
= TREE_CODE (exp
);
3420 if (code
== PLACEHOLDER_EXPR
)
3423 switch (TREE_CODE_CLASS (code
))
3426 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3427 position computations since they will be converted into a
3428 WITH_RECORD_EXPR involving the reference, which will assume
3429 here will be valid. */
3430 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3432 case tcc_exceptional
:
3433 if (code
== TREE_LIST
)
3434 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3435 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3440 case tcc_comparison
:
3441 case tcc_expression
:
3445 /* Ignoring the first operand isn't quite right, but works best. */
3446 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3449 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3450 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3451 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3454 /* The save_expr function never wraps anything containing
3455 a PLACEHOLDER_EXPR. */
3462 switch (TREE_CODE_LENGTH (code
))
3465 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3467 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3468 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3479 const_call_expr_arg_iterator iter
;
3480 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3481 if (CONTAINS_PLACEHOLDER_P (arg
))
3495 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3496 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3500 type_contains_placeholder_1 (const_tree type
)
3502 /* If the size contains a placeholder or the parent type (component type in
3503 the case of arrays) type involves a placeholder, this type does. */
3504 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3505 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3506 || (!POINTER_TYPE_P (type
)
3508 && type_contains_placeholder_p (TREE_TYPE (type
))))
3511 /* Now do type-specific checks. Note that the last part of the check above
3512 greatly limits what we have to do below. */
3513 switch (TREE_CODE (type
))
3516 case POINTER_BOUNDS_TYPE
:
3522 case REFERENCE_TYPE
:
3531 case FIXED_POINT_TYPE
:
3532 /* Here we just check the bounds. */
3533 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3534 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3537 /* We have already checked the component type above, so just check the
3539 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3543 case QUAL_UNION_TYPE
:
3547 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3548 if (TREE_CODE (field
) == FIELD_DECL
3549 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3550 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3551 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3552 || type_contains_placeholder_p (TREE_TYPE (field
))))
3563 /* Wrapper around above function used to cache its result. */
3566 type_contains_placeholder_p (tree type
)
3570 /* If the contains_placeholder_bits field has been initialized,
3571 then we know the answer. */
3572 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3573 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3575 /* Indicate that we've seen this type node, and the answer is false.
3576 This is what we want to return if we run into recursion via fields. */
3577 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3579 /* Compute the real value. */
3580 result
= type_contains_placeholder_1 (type
);
3582 /* Store the real value. */
3583 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3588 /* Push tree EXP onto vector QUEUE if it is not already present. */
3591 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3596 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3597 if (simple_cst_equal (iter
, exp
) == 1)
3601 queue
->safe_push (exp
);
3604 /* Given a tree EXP, find all occurrences of references to fields
3605 in a PLACEHOLDER_EXPR and place them in vector REFS without
3606 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3607 we assume here that EXP contains only arithmetic expressions
3608 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3612 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3614 enum tree_code code
= TREE_CODE (exp
);
3618 /* We handle TREE_LIST and COMPONENT_REF separately. */
3619 if (code
== TREE_LIST
)
3621 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3622 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3624 else if (code
== COMPONENT_REF
)
3626 for (inner
= TREE_OPERAND (exp
, 0);
3627 REFERENCE_CLASS_P (inner
);
3628 inner
= TREE_OPERAND (inner
, 0))
3631 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3632 push_without_duplicates (exp
, refs
);
3634 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3637 switch (TREE_CODE_CLASS (code
))
3642 case tcc_declaration
:
3643 /* Variables allocated to static storage can stay. */
3644 if (!TREE_STATIC (exp
))
3645 push_without_duplicates (exp
, refs
);
3648 case tcc_expression
:
3649 /* This is the pattern built in ada/make_aligning_type. */
3650 if (code
== ADDR_EXPR
3651 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3653 push_without_duplicates (exp
, refs
);
3657 /* Fall through... */
3659 case tcc_exceptional
:
3662 case tcc_comparison
:
3664 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3665 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3669 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3670 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3678 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3679 return a tree with all occurrences of references to F in a
3680 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3681 CONST_DECLs. Note that we assume here that EXP contains only
3682 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3683 occurring only in their argument list. */
3686 substitute_in_expr (tree exp
, tree f
, tree r
)
3688 enum tree_code code
= TREE_CODE (exp
);
3689 tree op0
, op1
, op2
, op3
;
3692 /* We handle TREE_LIST and COMPONENT_REF separately. */
3693 if (code
== TREE_LIST
)
3695 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3696 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3697 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3700 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3702 else if (code
== COMPONENT_REF
)
3706 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3707 and it is the right field, replace it with R. */
3708 for (inner
= TREE_OPERAND (exp
, 0);
3709 REFERENCE_CLASS_P (inner
);
3710 inner
= TREE_OPERAND (inner
, 0))
3714 op1
= TREE_OPERAND (exp
, 1);
3716 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3719 /* If this expression hasn't been completed let, leave it alone. */
3720 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3723 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3724 if (op0
== TREE_OPERAND (exp
, 0))
3728 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3731 switch (TREE_CODE_CLASS (code
))
3736 case tcc_declaration
:
3742 case tcc_expression
:
3746 /* Fall through... */
3748 case tcc_exceptional
:
3751 case tcc_comparison
:
3753 switch (TREE_CODE_LENGTH (code
))
3759 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3760 if (op0
== TREE_OPERAND (exp
, 0))
3763 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3767 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3768 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3770 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3773 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3777 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3778 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3779 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3781 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3782 && op2
== TREE_OPERAND (exp
, 2))
3785 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3789 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3790 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3791 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3792 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3794 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3795 && op2
== TREE_OPERAND (exp
, 2)
3796 && op3
== TREE_OPERAND (exp
, 3))
3800 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3812 new_tree
= NULL_TREE
;
3814 /* If we are trying to replace F with a constant, inline back
3815 functions which do nothing else than computing a value from
3816 the arguments they are passed. This makes it possible to
3817 fold partially or entirely the replacement expression. */
3818 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3820 tree t
= maybe_inline_call_in_expr (exp
);
3822 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3825 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3827 tree op
= TREE_OPERAND (exp
, i
);
3828 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3832 new_tree
= copy_node (exp
);
3833 TREE_OPERAND (new_tree
, i
) = new_op
;
3839 new_tree
= fold (new_tree
);
3840 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3841 process_call_operands (new_tree
);
3852 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3854 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3855 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3860 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3861 for it within OBJ, a tree that is an object or a chain of references. */
3864 substitute_placeholder_in_expr (tree exp
, tree obj
)
3866 enum tree_code code
= TREE_CODE (exp
);
3867 tree op0
, op1
, op2
, op3
;
3870 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3871 in the chain of OBJ. */
3872 if (code
== PLACEHOLDER_EXPR
)
3874 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3877 for (elt
= obj
; elt
!= 0;
3878 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3879 || TREE_CODE (elt
) == COND_EXPR
)
3880 ? TREE_OPERAND (elt
, 1)
3881 : (REFERENCE_CLASS_P (elt
)
3882 || UNARY_CLASS_P (elt
)
3883 || BINARY_CLASS_P (elt
)
3884 || VL_EXP_CLASS_P (elt
)
3885 || EXPRESSION_CLASS_P (elt
))
3886 ? TREE_OPERAND (elt
, 0) : 0))
3887 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3890 for (elt
= obj
; elt
!= 0;
3891 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3892 || TREE_CODE (elt
) == COND_EXPR
)
3893 ? TREE_OPERAND (elt
, 1)
3894 : (REFERENCE_CLASS_P (elt
)
3895 || UNARY_CLASS_P (elt
)
3896 || BINARY_CLASS_P (elt
)
3897 || VL_EXP_CLASS_P (elt
)
3898 || EXPRESSION_CLASS_P (elt
))
3899 ? TREE_OPERAND (elt
, 0) : 0))
3900 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3901 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3903 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3905 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3906 survives until RTL generation, there will be an error. */
3910 /* TREE_LIST is special because we need to look at TREE_VALUE
3911 and TREE_CHAIN, not TREE_OPERANDS. */
3912 else if (code
== TREE_LIST
)
3914 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3915 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3916 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3919 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3922 switch (TREE_CODE_CLASS (code
))
3925 case tcc_declaration
:
3928 case tcc_exceptional
:
3931 case tcc_comparison
:
3932 case tcc_expression
:
3935 switch (TREE_CODE_LENGTH (code
))
3941 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3942 if (op0
== TREE_OPERAND (exp
, 0))
3945 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3949 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3950 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3952 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3955 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3959 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3960 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3961 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3963 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3964 && op2
== TREE_OPERAND (exp
, 2))
3967 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3971 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3972 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3973 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3974 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3976 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3977 && op2
== TREE_OPERAND (exp
, 2)
3978 && op3
== TREE_OPERAND (exp
, 3))
3982 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3994 new_tree
= NULL_TREE
;
3996 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3998 tree op
= TREE_OPERAND (exp
, i
);
3999 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4003 new_tree
= copy_node (exp
);
4004 TREE_OPERAND (new_tree
, i
) = new_op
;
4010 new_tree
= fold (new_tree
);
4011 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4012 process_call_operands (new_tree
);
4023 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4025 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4026 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4032 /* Subroutine of stabilize_reference; this is called for subtrees of
4033 references. Any expression with side-effects must be put in a SAVE_EXPR
4034 to ensure that it is only evaluated once.
4036 We don't put SAVE_EXPR nodes around everything, because assigning very
4037 simple expressions to temporaries causes us to miss good opportunities
4038 for optimizations. Among other things, the opportunity to fold in the
4039 addition of a constant into an addressing mode often gets lost, e.g.
4040 "y[i+1] += x;". In general, we take the approach that we should not make
4041 an assignment unless we are forced into it - i.e., that any non-side effect
4042 operator should be allowed, and that cse should take care of coalescing
4043 multiple utterances of the same expression should that prove fruitful. */
4046 stabilize_reference_1 (tree e
)
4049 enum tree_code code
= TREE_CODE (e
);
4051 /* We cannot ignore const expressions because it might be a reference
4052 to a const array but whose index contains side-effects. But we can
4053 ignore things that are actual constant or that already have been
4054 handled by this function. */
4056 if (tree_invariant_p (e
))
4059 switch (TREE_CODE_CLASS (code
))
4061 case tcc_exceptional
:
4063 case tcc_declaration
:
4064 case tcc_comparison
:
4066 case tcc_expression
:
4069 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4070 so that it will only be evaluated once. */
4071 /* The reference (r) and comparison (<) classes could be handled as
4072 below, but it is generally faster to only evaluate them once. */
4073 if (TREE_SIDE_EFFECTS (e
))
4074 return save_expr (e
);
4078 /* Constants need no processing. In fact, we should never reach
4083 /* Division is slow and tends to be compiled with jumps,
4084 especially the division by powers of 2 that is often
4085 found inside of an array reference. So do it just once. */
4086 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4087 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4088 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4089 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4090 return save_expr (e
);
4091 /* Recursively stabilize each operand. */
4092 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4093 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4097 /* Recursively stabilize each operand. */
4098 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4105 TREE_TYPE (result
) = TREE_TYPE (e
);
4106 TREE_READONLY (result
) = TREE_READONLY (e
);
4107 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4108 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4113 /* Stabilize a reference so that we can use it any number of times
4114 without causing its operands to be evaluated more than once.
4115 Returns the stabilized reference. This works by means of save_expr,
4116 so see the caveats in the comments about save_expr.
4118 Also allows conversion expressions whose operands are references.
4119 Any other kind of expression is returned unchanged. */
4122 stabilize_reference (tree ref
)
4125 enum tree_code code
= TREE_CODE (ref
);
4132 /* No action is needed in this case. */
4137 case FIX_TRUNC_EXPR
:
4138 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4142 result
= build_nt (INDIRECT_REF
,
4143 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4147 result
= build_nt (COMPONENT_REF
,
4148 stabilize_reference (TREE_OPERAND (ref
, 0)),
4149 TREE_OPERAND (ref
, 1), NULL_TREE
);
4153 result
= build_nt (BIT_FIELD_REF
,
4154 stabilize_reference (TREE_OPERAND (ref
, 0)),
4155 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4159 result
= build_nt (ARRAY_REF
,
4160 stabilize_reference (TREE_OPERAND (ref
, 0)),
4161 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4162 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4165 case ARRAY_RANGE_REF
:
4166 result
= build_nt (ARRAY_RANGE_REF
,
4167 stabilize_reference (TREE_OPERAND (ref
, 0)),
4168 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4169 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4173 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4174 it wouldn't be ignored. This matters when dealing with
4176 return stabilize_reference_1 (ref
);
4178 /* If arg isn't a kind of lvalue we recognize, make no change.
4179 Caller should recognize the error for an invalid lvalue. */
4184 return error_mark_node
;
4187 TREE_TYPE (result
) = TREE_TYPE (ref
);
4188 TREE_READONLY (result
) = TREE_READONLY (ref
);
4189 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4190 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4195 /* Low-level constructors for expressions. */
4197 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4198 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4201 recompute_tree_invariant_for_addr_expr (tree t
)
4204 bool tc
= true, se
= false;
4206 /* We started out assuming this address is both invariant and constant, but
4207 does not have side effects. Now go down any handled components and see if
4208 any of them involve offsets that are either non-constant or non-invariant.
4209 Also check for side-effects.
4211 ??? Note that this code makes no attempt to deal with the case where
4212 taking the address of something causes a copy due to misalignment. */
4214 #define UPDATE_FLAGS(NODE) \
4215 do { tree _node = (NODE); \
4216 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4217 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4219 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4220 node
= TREE_OPERAND (node
, 0))
4222 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4223 array reference (probably made temporarily by the G++ front end),
4224 so ignore all the operands. */
4225 if ((TREE_CODE (node
) == ARRAY_REF
4226 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4227 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4229 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4230 if (TREE_OPERAND (node
, 2))
4231 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4232 if (TREE_OPERAND (node
, 3))
4233 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4235 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4236 FIELD_DECL, apparently. The G++ front end can put something else
4237 there, at least temporarily. */
4238 else if (TREE_CODE (node
) == COMPONENT_REF
4239 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4241 if (TREE_OPERAND (node
, 2))
4242 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4246 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4248 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4249 the address, since &(*a)->b is a form of addition. If it's a constant, the
4250 address is constant too. If it's a decl, its address is constant if the
4251 decl is static. Everything else is not constant and, furthermore,
4252 taking the address of a volatile variable is not volatile. */
4253 if (TREE_CODE (node
) == INDIRECT_REF
4254 || TREE_CODE (node
) == MEM_REF
)
4255 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4256 else if (CONSTANT_CLASS_P (node
))
4258 else if (DECL_P (node
))
4259 tc
&= (staticp (node
) != NULL_TREE
);
4263 se
|= TREE_SIDE_EFFECTS (node
);
4267 TREE_CONSTANT (t
) = tc
;
4268 TREE_SIDE_EFFECTS (t
) = se
;
4272 /* Build an expression of code CODE, data type TYPE, and operands as
4273 specified. Expressions and reference nodes can be created this way.
4274 Constants, decls, types and misc nodes cannot be.
4276 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4277 enough for all extant tree codes. */
4280 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4284 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4286 t
= make_node_stat (code PASS_MEM_STAT
);
4293 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4295 int length
= sizeof (struct tree_exp
);
4298 record_node_allocation_statistics (code
, length
);
4300 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4302 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4304 memset (t
, 0, sizeof (struct tree_common
));
4306 TREE_SET_CODE (t
, code
);
4308 TREE_TYPE (t
) = type
;
4309 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4310 TREE_OPERAND (t
, 0) = node
;
4311 if (node
&& !TYPE_P (node
))
4313 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4314 TREE_READONLY (t
) = TREE_READONLY (node
);
4317 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4318 TREE_SIDE_EFFECTS (t
) = 1;
4322 /* All of these have side-effects, no matter what their
4324 TREE_SIDE_EFFECTS (t
) = 1;
4325 TREE_READONLY (t
) = 0;
4329 /* Whether a dereference is readonly has nothing to do with whether
4330 its operand is readonly. */
4331 TREE_READONLY (t
) = 0;
4336 recompute_tree_invariant_for_addr_expr (t
);
4340 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4341 && node
&& !TYPE_P (node
)
4342 && TREE_CONSTANT (node
))
4343 TREE_CONSTANT (t
) = 1;
4344 if (TREE_CODE_CLASS (code
) == tcc_reference
4345 && node
&& TREE_THIS_VOLATILE (node
))
4346 TREE_THIS_VOLATILE (t
) = 1;
4353 #define PROCESS_ARG(N) \
4355 TREE_OPERAND (t, N) = arg##N; \
4356 if (arg##N &&!TYPE_P (arg##N)) \
4358 if (TREE_SIDE_EFFECTS (arg##N)) \
4360 if (!TREE_READONLY (arg##N) \
4361 && !CONSTANT_CLASS_P (arg##N)) \
4362 (void) (read_only = 0); \
4363 if (!TREE_CONSTANT (arg##N)) \
4364 (void) (constant = 0); \
4369 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4371 bool constant
, read_only
, side_effects
;
4374 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4376 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4377 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4378 /* When sizetype precision doesn't match that of pointers
4379 we need to be able to build explicit extensions or truncations
4380 of the offset argument. */
4381 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4382 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4383 && TREE_CODE (arg1
) == INTEGER_CST
);
4385 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4386 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4387 && ptrofftype_p (TREE_TYPE (arg1
)));
4389 t
= make_node_stat (code PASS_MEM_STAT
);
4392 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4393 result based on those same flags for the arguments. But if the
4394 arguments aren't really even `tree' expressions, we shouldn't be trying
4397 /* Expressions without side effects may be constant if their
4398 arguments are as well. */
4399 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4400 || TREE_CODE_CLASS (code
) == tcc_binary
);
4402 side_effects
= TREE_SIDE_EFFECTS (t
);
4407 TREE_SIDE_EFFECTS (t
) = side_effects
;
4408 if (code
== MEM_REF
)
4410 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4412 tree o
= TREE_OPERAND (arg0
, 0);
4413 TREE_READONLY (t
) = TREE_READONLY (o
);
4414 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4419 TREE_READONLY (t
) = read_only
;
4420 TREE_CONSTANT (t
) = constant
;
4421 TREE_THIS_VOLATILE (t
)
4422 = (TREE_CODE_CLASS (code
) == tcc_reference
4423 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4431 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4432 tree arg2 MEM_STAT_DECL
)
4434 bool constant
, read_only
, side_effects
;
4437 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4438 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4440 t
= make_node_stat (code PASS_MEM_STAT
);
4445 /* As a special exception, if COND_EXPR has NULL branches, we
4446 assume that it is a gimple statement and always consider
4447 it to have side effects. */
4448 if (code
== COND_EXPR
4449 && tt
== void_type_node
4450 && arg1
== NULL_TREE
4451 && arg2
== NULL_TREE
)
4452 side_effects
= true;
4454 side_effects
= TREE_SIDE_EFFECTS (t
);
4460 if (code
== COND_EXPR
)
4461 TREE_READONLY (t
) = read_only
;
4463 TREE_SIDE_EFFECTS (t
) = side_effects
;
4464 TREE_THIS_VOLATILE (t
)
4465 = (TREE_CODE_CLASS (code
) == tcc_reference
4466 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4472 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4473 tree arg2
, tree arg3 MEM_STAT_DECL
)
4475 bool constant
, read_only
, side_effects
;
4478 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4480 t
= make_node_stat (code PASS_MEM_STAT
);
4483 side_effects
= TREE_SIDE_EFFECTS (t
);
4490 TREE_SIDE_EFFECTS (t
) = side_effects
;
4491 TREE_THIS_VOLATILE (t
)
4492 = (TREE_CODE_CLASS (code
) == tcc_reference
4493 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4499 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4500 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4502 bool constant
, read_only
, side_effects
;
4505 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4507 t
= make_node_stat (code PASS_MEM_STAT
);
4510 side_effects
= TREE_SIDE_EFFECTS (t
);
4518 TREE_SIDE_EFFECTS (t
) = side_effects
;
4519 if (code
== TARGET_MEM_REF
)
4521 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4523 tree o
= TREE_OPERAND (arg0
, 0);
4524 TREE_READONLY (t
) = TREE_READONLY (o
);
4525 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4529 TREE_THIS_VOLATILE (t
)
4530 = (TREE_CODE_CLASS (code
) == tcc_reference
4531 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4536 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4537 on the pointer PTR. */
4540 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4542 HOST_WIDE_INT offset
= 0;
4543 tree ptype
= TREE_TYPE (ptr
);
4545 /* For convenience allow addresses that collapse to a simple base
4547 if (TREE_CODE (ptr
) == ADDR_EXPR
4548 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4549 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4551 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4553 ptr
= build_fold_addr_expr (ptr
);
4554 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4556 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4557 ptr
, build_int_cst (ptype
, offset
));
4558 SET_EXPR_LOCATION (tem
, loc
);
4562 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4565 mem_ref_offset (const_tree t
)
4567 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4570 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4571 offsetted by OFFSET units. */
4574 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4576 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4577 build_fold_addr_expr (base
),
4578 build_int_cst (ptr_type_node
, offset
));
4579 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4580 recompute_tree_invariant_for_addr_expr (addr
);
4584 /* Similar except don't specify the TREE_TYPE
4585 and leave the TREE_SIDE_EFFECTS as 0.
4586 It is permissible for arguments to be null,
4587 or even garbage if their values do not matter. */
4590 build_nt (enum tree_code code
, ...)
4597 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4601 t
= make_node (code
);
4602 length
= TREE_CODE_LENGTH (code
);
4604 for (i
= 0; i
< length
; i
++)
4605 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4611 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4615 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4620 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4621 CALL_EXPR_FN (ret
) = fn
;
4622 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4623 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4624 CALL_EXPR_ARG (ret
, ix
) = t
;
4628 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4629 We do NOT enter this node in any sort of symbol table.
4631 LOC is the location of the decl.
4633 layout_decl is used to set up the decl's storage layout.
4634 Other slots are initialized to 0 or null pointers. */
4637 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4638 tree type MEM_STAT_DECL
)
4642 t
= make_node_stat (code PASS_MEM_STAT
);
4643 DECL_SOURCE_LOCATION (t
) = loc
;
4645 /* if (type == error_mark_node)
4646 type = integer_type_node; */
4647 /* That is not done, deliberately, so that having error_mark_node
4648 as the type can suppress useless errors in the use of this variable. */
4650 DECL_NAME (t
) = name
;
4651 TREE_TYPE (t
) = type
;
4653 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4659 /* Builds and returns function declaration with NAME and TYPE. */
4662 build_fn_decl (const char *name
, tree type
)
4664 tree id
= get_identifier (name
);
4665 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4667 DECL_EXTERNAL (decl
) = 1;
4668 TREE_PUBLIC (decl
) = 1;
4669 DECL_ARTIFICIAL (decl
) = 1;
4670 TREE_NOTHROW (decl
) = 1;
4675 vec
<tree
, va_gc
> *all_translation_units
;
4677 /* Builds a new translation-unit decl with name NAME, queues it in the
4678 global list of translation-unit decls and returns it. */
4681 build_translation_unit_decl (tree name
)
4683 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4685 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4686 vec_safe_push (all_translation_units
, tu
);
4691 /* BLOCK nodes are used to represent the structure of binding contours
4692 and declarations, once those contours have been exited and their contents
4693 compiled. This information is used for outputting debugging info. */
4696 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4698 tree block
= make_node (BLOCK
);
4700 BLOCK_VARS (block
) = vars
;
4701 BLOCK_SUBBLOCKS (block
) = subblocks
;
4702 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4703 BLOCK_CHAIN (block
) = chain
;
4708 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4710 LOC is the location to use in tree T. */
4713 protected_set_expr_location (tree t
, location_t loc
)
4715 if (CAN_HAVE_LOCATION_P (t
))
4716 SET_EXPR_LOCATION (t
, loc
);
4719 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4723 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4725 DECL_ATTRIBUTES (ddecl
) = attribute
;
4729 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4730 is ATTRIBUTE and its qualifiers are QUALS.
4732 Record such modified types already made so we don't make duplicates. */
4735 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4737 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4739 inchash::hash hstate
;
4743 enum tree_code code
= TREE_CODE (ttype
);
4745 /* Building a distinct copy of a tagged type is inappropriate; it
4746 causes breakage in code that expects there to be a one-to-one
4747 relationship between a struct and its fields.
4748 build_duplicate_type is another solution (as used in
4749 handle_transparent_union_attribute), but that doesn't play well
4750 with the stronger C++ type identity model. */
4751 if (TREE_CODE (ttype
) == RECORD_TYPE
4752 || TREE_CODE (ttype
) == UNION_TYPE
4753 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4754 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4756 warning (OPT_Wattributes
,
4757 "ignoring attributes applied to %qT after definition",
4758 TYPE_MAIN_VARIANT (ttype
));
4759 return build_qualified_type (ttype
, quals
);
4762 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4763 ntype
= build_distinct_type_copy (ttype
);
4765 TYPE_ATTRIBUTES (ntype
) = attribute
;
4767 hstate
.add_int (code
);
4768 if (TREE_TYPE (ntype
))
4769 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4770 attribute_hash_list (attribute
, hstate
);
4772 switch (TREE_CODE (ntype
))
4775 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4778 if (TYPE_DOMAIN (ntype
))
4779 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4782 t
= TYPE_MAX_VALUE (ntype
);
4783 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4784 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4787 case FIXED_POINT_TYPE
:
4789 unsigned int precision
= TYPE_PRECISION (ntype
);
4790 hstate
.add_object (precision
);
4797 ntype
= type_hash_canon (hstate
.end(), ntype
);
4799 /* If the target-dependent attributes make NTYPE different from
4800 its canonical type, we will need to use structural equality
4801 checks for this type. */
4802 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4803 || !comp_type_attributes (ntype
, ttype
))
4804 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4805 else if (TYPE_CANONICAL (ntype
) == ntype
)
4806 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4808 ttype
= build_qualified_type (ntype
, quals
);
4810 else if (TYPE_QUALS (ttype
) != quals
)
4811 ttype
= build_qualified_type (ttype
, quals
);
4816 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4820 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4823 for (cl1
= clauses1
, cl2
= clauses2
;
4825 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4827 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4829 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4831 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4832 OMP_CLAUSE_DECL (cl2
)) != 1)
4835 switch (OMP_CLAUSE_CODE (cl1
))
4837 case OMP_CLAUSE_ALIGNED
:
4838 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4839 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4842 case OMP_CLAUSE_LINEAR
:
4843 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4844 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4847 case OMP_CLAUSE_SIMDLEN
:
4848 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4849 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4858 /* Compare two constructor-element-type constants. Return 1 if the lists
4859 are known to be equal; otherwise return 0. */
4862 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4864 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4866 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4869 l1
= TREE_CHAIN (l1
);
4870 l2
= TREE_CHAIN (l2
);
4876 /* Compare two attributes for their value identity. Return true if the
4877 attribute values are known to be equal; otherwise return false.
4881 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4883 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4886 if (TREE_VALUE (attr1
) != NULL_TREE
4887 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4888 && TREE_VALUE (attr2
) != NULL
4889 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4890 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4891 TREE_VALUE (attr2
)) == 1);
4893 if ((flag_openmp
|| flag_openmp_simd
)
4894 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4895 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4896 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4897 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4898 TREE_VALUE (attr2
));
4900 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4903 /* Return 0 if the attributes for two types are incompatible, 1 if they
4904 are compatible, and 2 if they are nearly compatible (which causes a
4905 warning to be generated). */
4907 comp_type_attributes (const_tree type1
, const_tree type2
)
4909 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4910 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4915 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4917 const struct attribute_spec
*as
;
4920 as
= lookup_attribute_spec (get_attribute_name (a
));
4921 if (!as
|| as
->affects_type_identity
== false)
4924 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4925 if (!attr
|| !attribute_value_equal (a
, attr
))
4930 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4932 const struct attribute_spec
*as
;
4934 as
= lookup_attribute_spec (get_attribute_name (a
));
4935 if (!as
|| as
->affects_type_identity
== false)
4938 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4940 /* We don't need to compare trees again, as we did this
4941 already in first loop. */
4943 /* All types - affecting identity - are equal, so
4944 there is no need to call target hook for comparison. */
4948 /* As some type combinations - like default calling-convention - might
4949 be compatible, we have to call the target hook to get the final result. */
4950 return targetm
.comp_type_attributes (type1
, type2
);
4953 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4956 Record such modified types already made so we don't make duplicates. */
4959 build_type_attribute_variant (tree ttype
, tree attribute
)
4961 return build_type_attribute_qual_variant (ttype
, attribute
,
4962 TYPE_QUALS (ttype
));
4966 /* Reset the expression *EXPR_P, a size or position.
4968 ??? We could reset all non-constant sizes or positions. But it's cheap
4969 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4971 We need to reset self-referential sizes or positions because they cannot
4972 be gimplified and thus can contain a CALL_EXPR after the gimplification
4973 is finished, which will run afoul of LTO streaming. And they need to be
4974 reset to something essentially dummy but not constant, so as to preserve
4975 the properties of the object they are attached to. */
4978 free_lang_data_in_one_sizepos (tree
*expr_p
)
4980 tree expr
= *expr_p
;
4981 if (CONTAINS_PLACEHOLDER_P (expr
))
4982 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4986 /* Reset all the fields in a binfo node BINFO. We only keep
4987 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4990 free_lang_data_in_binfo (tree binfo
)
4995 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4997 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4998 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4999 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5000 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5002 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5003 free_lang_data_in_binfo (t
);
5007 /* Reset all language specific information still present in TYPE. */
5010 free_lang_data_in_type (tree type
)
5012 gcc_assert (TYPE_P (type
));
5014 /* Give the FE a chance to remove its own data first. */
5015 lang_hooks
.free_lang_data (type
);
5017 TREE_LANG_FLAG_0 (type
) = 0;
5018 TREE_LANG_FLAG_1 (type
) = 0;
5019 TREE_LANG_FLAG_2 (type
) = 0;
5020 TREE_LANG_FLAG_3 (type
) = 0;
5021 TREE_LANG_FLAG_4 (type
) = 0;
5022 TREE_LANG_FLAG_5 (type
) = 0;
5023 TREE_LANG_FLAG_6 (type
) = 0;
5025 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5027 /* Remove the const and volatile qualifiers from arguments. The
5028 C++ front end removes them, but the C front end does not,
5029 leading to false ODR violation errors when merging two
5030 instances of the same function signature compiled by
5031 different front ends. */
5034 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5036 tree arg_type
= TREE_VALUE (p
);
5038 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5040 int quals
= TYPE_QUALS (arg_type
)
5042 & ~TYPE_QUAL_VOLATILE
;
5043 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5044 free_lang_data_in_type (TREE_VALUE (p
));
5049 /* Remove members that are not actually FIELD_DECLs from the field
5050 list of an aggregate. These occur in C++. */
5051 if (RECORD_OR_UNION_TYPE_P (type
))
5055 /* Note that TYPE_FIELDS can be shared across distinct
5056 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5057 to be removed, we cannot set its TREE_CHAIN to NULL.
5058 Otherwise, we would not be able to find all the other fields
5059 in the other instances of this TREE_TYPE.
5061 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5063 member
= TYPE_FIELDS (type
);
5066 if (TREE_CODE (member
) == FIELD_DECL
5067 || TREE_CODE (member
) == TYPE_DECL
)
5070 TREE_CHAIN (prev
) = member
;
5072 TYPE_FIELDS (type
) = member
;
5076 member
= TREE_CHAIN (member
);
5080 TREE_CHAIN (prev
) = NULL_TREE
;
5082 TYPE_FIELDS (type
) = NULL_TREE
;
5084 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5085 and danagle the pointer from time to time. */
5086 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5087 TYPE_VFIELD (type
) = NULL_TREE
;
5089 TYPE_METHODS (type
) = NULL_TREE
;
5090 if (TYPE_BINFO (type
))
5092 free_lang_data_in_binfo (TYPE_BINFO (type
));
5093 /* We need to preserve link to bases and virtual table for all
5094 polymorphic types to make devirtualization machinery working.
5095 Debug output cares only about bases, but output also
5096 virtual table pointers so merging of -fdevirtualize and
5097 -fno-devirtualize units is easier. */
5098 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5099 || !flag_devirtualize
)
5100 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5101 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5102 || debug_info_level
!= DINFO_LEVEL_NONE
))
5103 TYPE_BINFO (type
) = NULL
;
5108 /* For non-aggregate types, clear out the language slot (which
5109 overloads TYPE_BINFO). */
5110 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5112 if (INTEGRAL_TYPE_P (type
)
5113 || SCALAR_FLOAT_TYPE_P (type
)
5114 || FIXED_POINT_TYPE_P (type
))
5116 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5117 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5121 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5122 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5124 if (TYPE_CONTEXT (type
)
5125 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5127 tree ctx
= TYPE_CONTEXT (type
);
5130 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5132 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5133 TYPE_CONTEXT (type
) = ctx
;
5138 /* Return true if DECL may need an assembler name to be set. */
5141 need_assembler_name_p (tree decl
)
5143 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5145 if (flag_lto_odr_type_mering
5146 && TREE_CODE (decl
) == TYPE_DECL
5148 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5149 && !is_lang_specific (TREE_TYPE (decl
))
5150 /* Save some work. Names of builtin types are always derived from
5151 properties of its main variant. A special case are integer types
5152 where mangling do make differences between char/signed char/unsigned
5153 char etc. Storing name for these makes e.g.
5154 -fno-signed-char/-fsigned-char mismatches to be handled well.
5156 See cp/mangle.c:write_builtin_type for details. */
5157 && (TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
5158 && TREE_CODE (TREE_TYPE (decl
)) != BOOLEAN_TYPE
5159 && TREE_CODE (TREE_TYPE (decl
)) != REAL_TYPE
5160 && TREE_CODE (TREE_TYPE (decl
)) != FIXED_POINT_TYPE
)
5161 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5162 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
)
5163 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5164 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5165 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5166 if (TREE_CODE (decl
) != FUNCTION_DECL
5167 && TREE_CODE (decl
) != VAR_DECL
)
5170 /* If DECL already has its assembler name set, it does not need a
5172 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5173 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5176 /* Abstract decls do not need an assembler name. */
5177 if (DECL_ABSTRACT_P (decl
))
5180 /* For VAR_DECLs, only static, public and external symbols need an
5182 if (TREE_CODE (decl
) == VAR_DECL
5183 && !TREE_STATIC (decl
)
5184 && !TREE_PUBLIC (decl
)
5185 && !DECL_EXTERNAL (decl
))
5188 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5190 /* Do not set assembler name on builtins. Allow RTL expansion to
5191 decide whether to expand inline or via a regular call. */
5192 if (DECL_BUILT_IN (decl
)
5193 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5196 /* Functions represented in the callgraph need an assembler name. */
5197 if (cgraph_node::get (decl
) != NULL
)
5200 /* Unused and not public functions don't need an assembler name. */
5201 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5209 /* Reset all language specific information still present in symbol
5213 free_lang_data_in_decl (tree decl
)
5215 gcc_assert (DECL_P (decl
));
5217 /* Give the FE a chance to remove its own data first. */
5218 lang_hooks
.free_lang_data (decl
);
5220 TREE_LANG_FLAG_0 (decl
) = 0;
5221 TREE_LANG_FLAG_1 (decl
) = 0;
5222 TREE_LANG_FLAG_2 (decl
) = 0;
5223 TREE_LANG_FLAG_3 (decl
) = 0;
5224 TREE_LANG_FLAG_4 (decl
) = 0;
5225 TREE_LANG_FLAG_5 (decl
) = 0;
5226 TREE_LANG_FLAG_6 (decl
) = 0;
5228 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5229 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5230 if (TREE_CODE (decl
) == FIELD_DECL
)
5232 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5233 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5234 DECL_QUALIFIER (decl
) = NULL_TREE
;
5237 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5239 struct cgraph_node
*node
;
5240 if (!(node
= cgraph_node::get (decl
))
5241 || (!node
->definition
&& !node
->clones
))
5244 node
->release_body ();
5247 release_function_body (decl
);
5248 DECL_ARGUMENTS (decl
) = NULL
;
5249 DECL_RESULT (decl
) = NULL
;
5250 DECL_INITIAL (decl
) = error_mark_node
;
5253 if (gimple_has_body_p (decl
))
5257 /* If DECL has a gimple body, then the context for its
5258 arguments must be DECL. Otherwise, it doesn't really
5259 matter, as we will not be emitting any code for DECL. In
5260 general, there may be other instances of DECL created by
5261 the front end and since PARM_DECLs are generally shared,
5262 their DECL_CONTEXT changes as the replicas of DECL are
5263 created. The only time where DECL_CONTEXT is important
5264 is for the FUNCTION_DECLs that have a gimple body (since
5265 the PARM_DECL will be used in the function's body). */
5266 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5267 DECL_CONTEXT (t
) = decl
;
5268 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5269 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5270 = target_option_default_node
;
5271 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5272 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5273 = optimization_default_node
;
5276 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5277 At this point, it is not needed anymore. */
5278 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5280 /* Clear the abstract origin if it refers to a method. Otherwise
5281 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5282 origin will not be output correctly. */
5283 if (DECL_ABSTRACT_ORIGIN (decl
)
5284 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5285 && RECORD_OR_UNION_TYPE_P
5286 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5287 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5289 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5290 DECL_VINDEX referring to itself into a vtable slot number as it
5291 should. Happens with functions that are copied and then forgotten
5292 about. Just clear it, it won't matter anymore. */
5293 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5294 DECL_VINDEX (decl
) = NULL_TREE
;
5296 else if (TREE_CODE (decl
) == VAR_DECL
)
5298 if ((DECL_EXTERNAL (decl
)
5299 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5300 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5301 DECL_INITIAL (decl
) = NULL_TREE
;
5303 else if (TREE_CODE (decl
) == TYPE_DECL
5304 || TREE_CODE (decl
) == FIELD_DECL
)
5305 DECL_INITIAL (decl
) = NULL_TREE
;
5306 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5307 && DECL_INITIAL (decl
)
5308 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5310 /* Strip builtins from the translation-unit BLOCK. We still have targets
5311 without builtin_decl_explicit support and also builtins are shared
5312 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5313 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5317 if (TREE_CODE (var
) == FUNCTION_DECL
5318 && DECL_BUILT_IN (var
))
5319 *nextp
= TREE_CHAIN (var
);
5321 nextp
= &TREE_CHAIN (var
);
5327 /* Data used when collecting DECLs and TYPEs for language data removal. */
5329 struct free_lang_data_d
5331 /* Worklist to avoid excessive recursion. */
5334 /* Set of traversed objects. Used to avoid duplicate visits. */
5335 hash_set
<tree
> *pset
;
5337 /* Array of symbols to process with free_lang_data_in_decl. */
5340 /* Array of types to process with free_lang_data_in_type. */
5345 /* Save all language fields needed to generate proper debug information
5346 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5349 save_debug_info_for_decl (tree t
)
5351 /*struct saved_debug_info_d *sdi;*/
5353 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5355 /* FIXME. Partial implementation for saving debug info removed. */
5359 /* Save all language fields needed to generate proper debug information
5360 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5363 save_debug_info_for_type (tree t
)
5365 /*struct saved_debug_info_d *sdi;*/
5367 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5369 /* FIXME. Partial implementation for saving debug info removed. */
5373 /* Add type or decl T to one of the list of tree nodes that need their
5374 language data removed. The lists are held inside FLD. */
5377 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5381 fld
->decls
.safe_push (t
);
5382 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5383 save_debug_info_for_decl (t
);
5385 else if (TYPE_P (t
))
5387 fld
->types
.safe_push (t
);
5388 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5389 save_debug_info_for_type (t
);
5395 /* Push tree node T into FLD->WORKLIST. */
5398 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5400 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5401 fld
->worklist
.safe_push ((t
));
5405 /* Operand callback helper for free_lang_data_in_node. *TP is the
5406 subtree operand being considered. */
5409 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5412 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5414 if (TREE_CODE (t
) == TREE_LIST
)
5417 /* Language specific nodes will be removed, so there is no need
5418 to gather anything under them. */
5419 if (is_lang_specific (t
))
5427 /* Note that walk_tree does not traverse every possible field in
5428 decls, so we have to do our own traversals here. */
5429 add_tree_to_fld_list (t
, fld
);
5431 fld_worklist_push (DECL_NAME (t
), fld
);
5432 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5433 fld_worklist_push (DECL_SIZE (t
), fld
);
5434 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5436 /* We are going to remove everything under DECL_INITIAL for
5437 TYPE_DECLs. No point walking them. */
5438 if (TREE_CODE (t
) != TYPE_DECL
)
5439 fld_worklist_push (DECL_INITIAL (t
), fld
);
5441 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5442 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5444 if (TREE_CODE (t
) == FUNCTION_DECL
)
5446 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5447 fld_worklist_push (DECL_RESULT (t
), fld
);
5449 else if (TREE_CODE (t
) == TYPE_DECL
)
5451 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5453 else if (TREE_CODE (t
) == FIELD_DECL
)
5455 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5456 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5457 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5458 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5461 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5462 && DECL_HAS_VALUE_EXPR_P (t
))
5463 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5465 if (TREE_CODE (t
) != FIELD_DECL
5466 && TREE_CODE (t
) != TYPE_DECL
)
5467 fld_worklist_push (TREE_CHAIN (t
), fld
);
5470 else if (TYPE_P (t
))
5472 /* Note that walk_tree does not traverse every possible field in
5473 types, so we have to do our own traversals here. */
5474 add_tree_to_fld_list (t
, fld
);
5476 if (!RECORD_OR_UNION_TYPE_P (t
))
5477 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5478 fld_worklist_push (TYPE_SIZE (t
), fld
);
5479 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5480 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5481 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5482 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5483 fld_worklist_push (TYPE_NAME (t
), fld
);
5484 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5485 them and thus do not and want not to reach unused pointer types
5487 if (!POINTER_TYPE_P (t
))
5488 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5489 if (!RECORD_OR_UNION_TYPE_P (t
))
5490 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5491 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5492 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5493 do not and want not to reach unused variants this way. */
5494 if (TYPE_CONTEXT (t
))
5496 tree ctx
= TYPE_CONTEXT (t
);
5497 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5498 So push that instead. */
5499 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5500 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5501 fld_worklist_push (ctx
, fld
);
5503 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5504 and want not to reach unused types this way. */
5506 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5510 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5511 fld_worklist_push (TREE_TYPE (tem
), fld
);
5512 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5514 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5515 && TREE_CODE (tem
) == TREE_LIST
)
5518 fld_worklist_push (TREE_VALUE (tem
), fld
);
5519 tem
= TREE_CHAIN (tem
);
5523 if (RECORD_OR_UNION_TYPE_P (t
))
5526 /* Push all TYPE_FIELDS - there can be interleaving interesting
5527 and non-interesting things. */
5528 tem
= TYPE_FIELDS (t
);
5531 if (TREE_CODE (tem
) == FIELD_DECL
5532 || TREE_CODE (tem
) == TYPE_DECL
)
5533 fld_worklist_push (tem
, fld
);
5534 tem
= TREE_CHAIN (tem
);
5538 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5541 else if (TREE_CODE (t
) == BLOCK
)
5544 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5545 fld_worklist_push (tem
, fld
);
5546 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5547 fld_worklist_push (tem
, fld
);
5548 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5551 if (TREE_CODE (t
) != IDENTIFIER_NODE
5552 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5553 fld_worklist_push (TREE_TYPE (t
), fld
);
5559 /* Find decls and types in T. */
5562 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5566 if (!fld
->pset
->contains (t
))
5567 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5568 if (fld
->worklist
.is_empty ())
5570 t
= fld
->worklist
.pop ();
5574 /* Translate all the types in LIST with the corresponding runtime
5578 get_eh_types_for_runtime (tree list
)
5582 if (list
== NULL_TREE
)
5585 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5587 list
= TREE_CHAIN (list
);
5590 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5591 TREE_CHAIN (prev
) = n
;
5592 prev
= TREE_CHAIN (prev
);
5593 list
= TREE_CHAIN (list
);
5600 /* Find decls and types referenced in EH region R and store them in
5601 FLD->DECLS and FLD->TYPES. */
5604 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5615 /* The types referenced in each catch must first be changed to the
5616 EH types used at runtime. This removes references to FE types
5618 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5620 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5621 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5626 case ERT_ALLOWED_EXCEPTIONS
:
5627 r
->u
.allowed
.type_list
5628 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5629 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5632 case ERT_MUST_NOT_THROW
:
5633 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5634 find_decls_types_r
, fld
, fld
->pset
);
5640 /* Find decls and types referenced in cgraph node N and store them in
5641 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5642 look for *every* kind of DECL and TYPE node reachable from N,
5643 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5644 NAMESPACE_DECLs, etc). */
5647 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5650 struct function
*fn
;
5654 find_decls_types (n
->decl
, fld
);
5656 if (!gimple_has_body_p (n
->decl
))
5659 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5661 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5663 /* Traverse locals. */
5664 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5665 find_decls_types (t
, fld
);
5667 /* Traverse EH regions in FN. */
5670 FOR_ALL_EH_REGION_FN (r
, fn
)
5671 find_decls_types_in_eh_region (r
, fld
);
5674 /* Traverse every statement in FN. */
5675 FOR_EACH_BB_FN (bb
, fn
)
5678 gimple_stmt_iterator si
;
5681 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5683 gphi
*phi
= psi
.phi ();
5685 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5687 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5688 find_decls_types (*arg_p
, fld
);
5692 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5694 gimple stmt
= gsi_stmt (si
);
5696 if (is_gimple_call (stmt
))
5697 find_decls_types (gimple_call_fntype (stmt
), fld
);
5699 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5701 tree arg
= gimple_op (stmt
, i
);
5702 find_decls_types (arg
, fld
);
5709 /* Find decls and types referenced in varpool node N and store them in
5710 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5711 look for *every* kind of DECL and TYPE node reachable from N,
5712 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5713 NAMESPACE_DECLs, etc). */
5716 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5718 find_decls_types (v
->decl
, fld
);
5721 /* If T needs an assembler name, have one created for it. */
5724 assign_assembler_name_if_neeeded (tree t
)
5726 if (need_assembler_name_p (t
))
5728 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5729 diagnostics that use input_location to show locus
5730 information. The problem here is that, at this point,
5731 input_location is generally anchored to the end of the file
5732 (since the parser is long gone), so we don't have a good
5733 position to pin it to.
5735 To alleviate this problem, this uses the location of T's
5736 declaration. Examples of this are
5737 testsuite/g++.dg/template/cond2.C and
5738 testsuite/g++.dg/template/pr35240.C. */
5739 location_t saved_location
= input_location
;
5740 input_location
= DECL_SOURCE_LOCATION (t
);
5742 decl_assembler_name (t
);
5744 input_location
= saved_location
;
5749 /* Free language specific information for every operand and expression
5750 in every node of the call graph. This process operates in three stages:
5752 1- Every callgraph node and varpool node is traversed looking for
5753 decls and types embedded in them. This is a more exhaustive
5754 search than that done by find_referenced_vars, because it will
5755 also collect individual fields, decls embedded in types, etc.
5757 2- All the decls found are sent to free_lang_data_in_decl.
5759 3- All the types found are sent to free_lang_data_in_type.
5761 The ordering between decls and types is important because
5762 free_lang_data_in_decl sets assembler names, which includes
5763 mangling. So types cannot be freed up until assembler names have
5767 free_lang_data_in_cgraph (void)
5769 struct cgraph_node
*n
;
5771 struct free_lang_data_d fld
;
5776 /* Initialize sets and arrays to store referenced decls and types. */
5777 fld
.pset
= new hash_set
<tree
>;
5778 fld
.worklist
.create (0);
5779 fld
.decls
.create (100);
5780 fld
.types
.create (100);
5782 /* Find decls and types in the body of every function in the callgraph. */
5783 FOR_EACH_FUNCTION (n
)
5784 find_decls_types_in_node (n
, &fld
);
5786 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5787 find_decls_types (p
->decl
, &fld
);
5789 /* Find decls and types in every varpool symbol. */
5790 FOR_EACH_VARIABLE (v
)
5791 find_decls_types_in_var (v
, &fld
);
5793 /* Set the assembler name on every decl found. We need to do this
5794 now because free_lang_data_in_decl will invalidate data needed
5795 for mangling. This breaks mangling on interdependent decls. */
5796 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5797 assign_assembler_name_if_neeeded (t
);
5799 /* Traverse every decl found freeing its language data. */
5800 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5801 free_lang_data_in_decl (t
);
5803 /* Traverse every type found freeing its language data. */
5804 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5805 free_lang_data_in_type (t
);
5806 #ifdef ENABLE_CHECKING
5807 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5812 fld
.worklist
.release ();
5813 fld
.decls
.release ();
5814 fld
.types
.release ();
5818 /* Free resources that are used by FE but are not needed once they are done. */
5821 free_lang_data (void)
5825 /* If we are the LTO frontend we have freed lang-specific data already. */
5827 || (!flag_generate_lto
&& !flag_generate_offload
))
5830 /* Allocate and assign alias sets to the standard integer types
5831 while the slots are still in the way the frontends generated them. */
5832 for (i
= 0; i
< itk_none
; ++i
)
5833 if (integer_types
[i
])
5834 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5836 /* Traverse the IL resetting language specific information for
5837 operands, expressions, etc. */
5838 free_lang_data_in_cgraph ();
5840 /* Create gimple variants for common types. */
5841 ptrdiff_type_node
= integer_type_node
;
5842 fileptr_type_node
= ptr_type_node
;
5844 /* Reset some langhooks. Do not reset types_compatible_p, it may
5845 still be used indirectly via the get_alias_set langhook. */
5846 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5847 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5848 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5850 /* We do not want the default decl_assembler_name implementation,
5851 rather if we have fixed everything we want a wrapper around it
5852 asserting that all non-local symbols already got their assembler
5853 name and only produce assembler names for local symbols. Or rather
5854 make sure we never call decl_assembler_name on local symbols and
5855 devise a separate, middle-end private scheme for it. */
5857 /* Reset diagnostic machinery. */
5858 tree_diagnostics_defaults (global_dc
);
5866 const pass_data pass_data_ipa_free_lang_data
=
5868 SIMPLE_IPA_PASS
, /* type */
5869 "*free_lang_data", /* name */
5870 OPTGROUP_NONE
, /* optinfo_flags */
5871 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5872 0, /* properties_required */
5873 0, /* properties_provided */
5874 0, /* properties_destroyed */
5875 0, /* todo_flags_start */
5876 0, /* todo_flags_finish */
5879 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5882 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5883 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5886 /* opt_pass methods: */
5887 virtual unsigned int execute (function
*) { return free_lang_data (); }
5889 }; // class pass_ipa_free_lang_data
5893 simple_ipa_opt_pass
*
5894 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5896 return new pass_ipa_free_lang_data (ctxt
);
5899 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5900 ATTR_NAME. Also used internally by remove_attribute(). */
5902 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5904 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5906 if (ident_len
== attr_len
)
5908 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5911 else if (ident_len
== attr_len
+ 4)
5913 /* There is the possibility that ATTR is 'text' and IDENT is
5915 const char *p
= IDENTIFIER_POINTER (ident
);
5916 if (p
[0] == '_' && p
[1] == '_'
5917 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5918 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5925 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5926 of ATTR_NAME, and LIST is not NULL_TREE. */
5928 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5932 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5934 if (ident_len
== attr_len
)
5936 if (!strcmp (attr_name
,
5937 IDENTIFIER_POINTER (get_attribute_name (list
))))
5940 /* TODO: If we made sure that attributes were stored in the
5941 canonical form without '__...__' (ie, as in 'text' as opposed
5942 to '__text__') then we could avoid the following case. */
5943 else if (ident_len
== attr_len
+ 4)
5945 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5946 if (p
[0] == '_' && p
[1] == '_'
5947 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5948 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5951 list
= TREE_CHAIN (list
);
5957 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5958 return a pointer to the attribute's list first element if the attribute
5959 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5963 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5968 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5970 if (attr_len
> ident_len
)
5972 list
= TREE_CHAIN (list
);
5976 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5978 if (strncmp (attr_name
, p
, attr_len
) == 0)
5981 /* TODO: If we made sure that attributes were stored in the
5982 canonical form without '__...__' (ie, as in 'text' as opposed
5983 to '__text__') then we could avoid the following case. */
5984 if (p
[0] == '_' && p
[1] == '_' &&
5985 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5988 list
= TREE_CHAIN (list
);
5995 /* A variant of lookup_attribute() that can be used with an identifier
5996 as the first argument, and where the identifier can be either
5997 'text' or '__text__'.
5999 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6000 return a pointer to the attribute's list element if the attribute
6001 is part of the list, or NULL_TREE if not found. If the attribute
6002 appears more than once, this only returns the first occurrence; the
6003 TREE_CHAIN of the return value should be passed back in if further
6004 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6005 can be in the form 'text' or '__text__'. */
6007 lookup_ident_attribute (tree attr_identifier
, tree list
)
6009 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6013 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6014 == IDENTIFIER_NODE
);
6016 /* Identifiers can be compared directly for equality. */
6017 if (attr_identifier
== get_attribute_name (list
))
6020 /* If they are not equal, they may still be one in the form
6021 'text' while the other one is in the form '__text__'. TODO:
6022 If we were storing attributes in normalized 'text' form, then
6023 this could all go away and we could take full advantage of
6024 the fact that we're comparing identifiers. :-) */
6026 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
6027 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6029 if (ident_len
== attr_len
+ 4)
6031 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6032 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
6033 if (p
[0] == '_' && p
[1] == '_'
6034 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6035 && strncmp (q
, p
+ 2, attr_len
) == 0)
6038 else if (ident_len
+ 4 == attr_len
)
6040 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6041 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
6042 if (q
[0] == '_' && q
[1] == '_'
6043 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
6044 && strncmp (q
+ 2, p
, ident_len
) == 0)
6048 list
= TREE_CHAIN (list
);
6054 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6058 remove_attribute (const char *attr_name
, tree list
)
6061 size_t attr_len
= strlen (attr_name
);
6063 gcc_checking_assert (attr_name
[0] != '_');
6065 for (p
= &list
; *p
; )
6068 /* TODO: If we were storing attributes in normalized form, here
6069 we could use a simple strcmp(). */
6070 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6071 *p
= TREE_CHAIN (l
);
6073 p
= &TREE_CHAIN (l
);
6079 /* Return an attribute list that is the union of a1 and a2. */
6082 merge_attributes (tree a1
, tree a2
)
6086 /* Either one unset? Take the set one. */
6088 if ((attributes
= a1
) == 0)
6091 /* One that completely contains the other? Take it. */
6093 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6095 if (attribute_list_contained (a2
, a1
))
6099 /* Pick the longest list, and hang on the other list. */
6101 if (list_length (a1
) < list_length (a2
))
6102 attributes
= a2
, a2
= a1
;
6104 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6107 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6109 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6110 a
= lookup_ident_attribute (get_attribute_name (a2
),
6115 a1
= copy_node (a2
);
6116 TREE_CHAIN (a1
) = attributes
;
6125 /* Given types T1 and T2, merge their attributes and return
6129 merge_type_attributes (tree t1
, tree t2
)
6131 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6132 TYPE_ATTRIBUTES (t2
));
6135 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6139 merge_decl_attributes (tree olddecl
, tree newdecl
)
6141 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6142 DECL_ATTRIBUTES (newdecl
));
6145 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6147 /* Specialization of merge_decl_attributes for various Windows targets.
6149 This handles the following situation:
6151 __declspec (dllimport) int foo;
6154 The second instance of `foo' nullifies the dllimport. */
6157 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6160 int delete_dllimport_p
= 1;
6162 /* What we need to do here is remove from `old' dllimport if it doesn't
6163 appear in `new'. dllimport behaves like extern: if a declaration is
6164 marked dllimport and a definition appears later, then the object
6165 is not dllimport'd. We also remove a `new' dllimport if the old list
6166 contains dllexport: dllexport always overrides dllimport, regardless
6167 of the order of declaration. */
6168 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6169 delete_dllimport_p
= 0;
6170 else if (DECL_DLLIMPORT_P (new_tree
)
6171 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6173 DECL_DLLIMPORT_P (new_tree
) = 0;
6174 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6175 "dllimport ignored", new_tree
);
6177 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6179 /* Warn about overriding a symbol that has already been used, e.g.:
6180 extern int __attribute__ ((dllimport)) foo;
6181 int* bar () {return &foo;}
6184 if (TREE_USED (old
))
6186 warning (0, "%q+D redeclared without dllimport attribute "
6187 "after being referenced with dll linkage", new_tree
);
6188 /* If we have used a variable's address with dllimport linkage,
6189 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6190 decl may already have had TREE_CONSTANT computed.
6191 We still remove the attribute so that assembler code refers
6192 to '&foo rather than '_imp__foo'. */
6193 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6194 DECL_DLLIMPORT_P (new_tree
) = 1;
6197 /* Let an inline definition silently override the external reference,
6198 but otherwise warn about attribute inconsistency. */
6199 else if (TREE_CODE (new_tree
) == VAR_DECL
6200 || !DECL_DECLARED_INLINE_P (new_tree
))
6201 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6202 "previous dllimport ignored", new_tree
);
6205 delete_dllimport_p
= 0;
6207 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6209 if (delete_dllimport_p
)
6210 a
= remove_attribute ("dllimport", a
);
6215 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6216 struct attribute_spec.handler. */
6219 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6225 /* These attributes may apply to structure and union types being created,
6226 but otherwise should pass to the declaration involved. */
6229 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6230 | (int) ATTR_FLAG_ARRAY_NEXT
))
6232 *no_add_attrs
= true;
6233 return tree_cons (name
, args
, NULL_TREE
);
6235 if (TREE_CODE (node
) == RECORD_TYPE
6236 || TREE_CODE (node
) == UNION_TYPE
)
6238 node
= TYPE_NAME (node
);
6244 warning (OPT_Wattributes
, "%qE attribute ignored",
6246 *no_add_attrs
= true;
6251 if (TREE_CODE (node
) != FUNCTION_DECL
6252 && TREE_CODE (node
) != VAR_DECL
6253 && TREE_CODE (node
) != TYPE_DECL
)
6255 *no_add_attrs
= true;
6256 warning (OPT_Wattributes
, "%qE attribute ignored",
6261 if (TREE_CODE (node
) == TYPE_DECL
6262 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6263 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6265 *no_add_attrs
= true;
6266 warning (OPT_Wattributes
, "%qE attribute ignored",
6271 is_dllimport
= is_attribute_p ("dllimport", name
);
6273 /* Report error on dllimport ambiguities seen now before they cause
6277 /* Honor any target-specific overrides. */
6278 if (!targetm
.valid_dllimport_attribute_p (node
))
6279 *no_add_attrs
= true;
6281 else if (TREE_CODE (node
) == FUNCTION_DECL
6282 && DECL_DECLARED_INLINE_P (node
))
6284 warning (OPT_Wattributes
, "inline function %q+D declared as "
6285 " dllimport: attribute ignored", node
);
6286 *no_add_attrs
= true;
6288 /* Like MS, treat definition of dllimported variables and
6289 non-inlined functions on declaration as syntax errors. */
6290 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6292 error ("function %q+D definition is marked dllimport", node
);
6293 *no_add_attrs
= true;
6296 else if (TREE_CODE (node
) == VAR_DECL
)
6298 if (DECL_INITIAL (node
))
6300 error ("variable %q+D definition is marked dllimport",
6302 *no_add_attrs
= true;
6305 /* `extern' needn't be specified with dllimport.
6306 Specify `extern' now and hope for the best. Sigh. */
6307 DECL_EXTERNAL (node
) = 1;
6308 /* Also, implicitly give dllimport'd variables declared within
6309 a function global scope, unless declared static. */
6310 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6311 TREE_PUBLIC (node
) = 1;
6314 if (*no_add_attrs
== false)
6315 DECL_DLLIMPORT_P (node
) = 1;
6317 else if (TREE_CODE (node
) == FUNCTION_DECL
6318 && DECL_DECLARED_INLINE_P (node
)
6319 && flag_keep_inline_dllexport
)
6320 /* An exported function, even if inline, must be emitted. */
6321 DECL_EXTERNAL (node
) = 0;
6323 /* Report error if symbol is not accessible at global scope. */
6324 if (!TREE_PUBLIC (node
)
6325 && (TREE_CODE (node
) == VAR_DECL
6326 || TREE_CODE (node
) == FUNCTION_DECL
))
6328 error ("external linkage required for symbol %q+D because of "
6329 "%qE attribute", node
, name
);
6330 *no_add_attrs
= true;
6333 /* A dllexport'd entity must have default visibility so that other
6334 program units (shared libraries or the main executable) can see
6335 it. A dllimport'd entity must have default visibility so that
6336 the linker knows that undefined references within this program
6337 unit can be resolved by the dynamic linker. */
6340 if (DECL_VISIBILITY_SPECIFIED (node
)
6341 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6342 error ("%qE implies default visibility, but %qD has already "
6343 "been declared with a different visibility",
6345 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6346 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6352 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6354 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6355 of the various TYPE_QUAL values. */
6358 set_type_quals (tree type
, int type_quals
)
6360 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6361 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6362 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6363 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6364 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6367 /* Returns true iff unqualified CAND and BASE are equivalent. */
6370 check_base_type (const_tree cand
, const_tree base
)
6372 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6373 /* Apparently this is needed for Objective-C. */
6374 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6375 /* Check alignment. */
6376 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6377 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6378 TYPE_ATTRIBUTES (base
)));
6381 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6384 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6386 return (TYPE_QUALS (cand
) == type_quals
6387 && check_base_type (cand
, base
));
6390 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6393 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6395 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6396 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6397 /* Apparently this is needed for Objective-C. */
6398 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6399 /* Check alignment. */
6400 && TYPE_ALIGN (cand
) == align
6401 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6402 TYPE_ATTRIBUTES (base
)));
6405 /* This function checks to see if TYPE matches the size one of the built-in
6406 atomic types, and returns that core atomic type. */
6409 find_atomic_core_type (tree type
)
6411 tree base_atomic_type
;
6413 /* Only handle complete types. */
6414 if (TYPE_SIZE (type
) == NULL_TREE
)
6417 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6421 base_atomic_type
= atomicQI_type_node
;
6425 base_atomic_type
= atomicHI_type_node
;
6429 base_atomic_type
= atomicSI_type_node
;
6433 base_atomic_type
= atomicDI_type_node
;
6437 base_atomic_type
= atomicTI_type_node
;
6441 base_atomic_type
= NULL_TREE
;
6444 return base_atomic_type
;
6447 /* Return a version of the TYPE, qualified as indicated by the
6448 TYPE_QUALS, if one exists. If no qualified version exists yet,
6449 return NULL_TREE. */
6452 get_qualified_type (tree type
, int type_quals
)
6456 if (TYPE_QUALS (type
) == type_quals
)
6459 /* Search the chain of variants to see if there is already one there just
6460 like the one we need to have. If so, use that existing one. We must
6461 preserve the TYPE_NAME, since there is code that depends on this. */
6462 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6463 if (check_qualified_type (t
, type
, type_quals
))
6469 /* Like get_qualified_type, but creates the type if it does not
6470 exist. This function never returns NULL_TREE. */
6473 build_qualified_type (tree type
, int type_quals
)
6477 /* See if we already have the appropriate qualified variant. */
6478 t
= get_qualified_type (type
, type_quals
);
6480 /* If not, build it. */
6483 t
= build_variant_type_copy (type
);
6484 set_type_quals (t
, type_quals
);
6486 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6488 /* See if this object can map to a basic atomic type. */
6489 tree atomic_type
= find_atomic_core_type (type
);
6492 /* Ensure the alignment of this type is compatible with
6493 the required alignment of the atomic type. */
6494 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6495 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6499 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6500 /* Propagate structural equality. */
6501 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6502 else if (TYPE_CANONICAL (type
) != type
)
6503 /* Build the underlying canonical type, since it is different
6506 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6507 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6510 /* T is its own canonical type. */
6511 TYPE_CANONICAL (t
) = t
;
6518 /* Create a variant of type T with alignment ALIGN. */
6521 build_aligned_type (tree type
, unsigned int align
)
6525 if (TYPE_PACKED (type
)
6526 || TYPE_ALIGN (type
) == align
)
6529 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6530 if (check_aligned_type (t
, type
, align
))
6533 t
= build_variant_type_copy (type
);
6534 TYPE_ALIGN (t
) = align
;
6539 /* Create a new distinct copy of TYPE. The new type is made its own
6540 MAIN_VARIANT. If TYPE requires structural equality checks, the
6541 resulting type requires structural equality checks; otherwise, its
6542 TYPE_CANONICAL points to itself. */
6545 build_distinct_type_copy (tree type
)
6547 tree t
= copy_node (type
);
6549 TYPE_POINTER_TO (t
) = 0;
6550 TYPE_REFERENCE_TO (t
) = 0;
6552 /* Set the canonical type either to a new equivalence class, or
6553 propagate the need for structural equality checks. */
6554 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6555 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6557 TYPE_CANONICAL (t
) = t
;
6559 /* Make it its own variant. */
6560 TYPE_MAIN_VARIANT (t
) = t
;
6561 TYPE_NEXT_VARIANT (t
) = 0;
6563 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6564 whose TREE_TYPE is not t. This can also happen in the Ada
6565 frontend when using subtypes. */
6570 /* Create a new variant of TYPE, equivalent but distinct. This is so
6571 the caller can modify it. TYPE_CANONICAL for the return type will
6572 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6573 are considered equal by the language itself (or that both types
6574 require structural equality checks). */
6577 build_variant_type_copy (tree type
)
6579 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6581 t
= build_distinct_type_copy (type
);
6583 /* Since we're building a variant, assume that it is a non-semantic
6584 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6585 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6587 /* Add the new type to the chain of variants of TYPE. */
6588 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6589 TYPE_NEXT_VARIANT (m
) = t
;
6590 TYPE_MAIN_VARIANT (t
) = m
;
6595 /* Return true if the from tree in both tree maps are equal. */
6598 tree_map_base_eq (const void *va
, const void *vb
)
6600 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6601 *const b
= (const struct tree_map_base
*) vb
;
6602 return (a
->from
== b
->from
);
6605 /* Hash a from tree in a tree_base_map. */
6608 tree_map_base_hash (const void *item
)
6610 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6613 /* Return true if this tree map structure is marked for garbage collection
6614 purposes. We simply return true if the from tree is marked, so that this
6615 structure goes away when the from tree goes away. */
6618 tree_map_base_marked_p (const void *p
)
6620 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6623 /* Hash a from tree in a tree_map. */
6626 tree_map_hash (const void *item
)
6628 return (((const struct tree_map
*) item
)->hash
);
6631 /* Hash a from tree in a tree_decl_map. */
6634 tree_decl_map_hash (const void *item
)
6636 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6639 /* Return the initialization priority for DECL. */
6642 decl_init_priority_lookup (tree decl
)
6644 symtab_node
*snode
= symtab_node::get (decl
);
6647 return DEFAULT_INIT_PRIORITY
;
6649 snode
->get_init_priority ();
6652 /* Return the finalization priority for DECL. */
6655 decl_fini_priority_lookup (tree decl
)
6657 cgraph_node
*node
= cgraph_node::get (decl
);
6660 return DEFAULT_INIT_PRIORITY
;
6662 node
->get_fini_priority ();
6665 /* Set the initialization priority for DECL to PRIORITY. */
6668 decl_init_priority_insert (tree decl
, priority_type priority
)
6670 struct symtab_node
*snode
;
6672 if (priority
== DEFAULT_INIT_PRIORITY
)
6674 snode
= symtab_node::get (decl
);
6678 else if (TREE_CODE (decl
) == VAR_DECL
)
6679 snode
= varpool_node::get_create (decl
);
6681 snode
= cgraph_node::get_create (decl
);
6682 snode
->set_init_priority (priority
);
6685 /* Set the finalization priority for DECL to PRIORITY. */
6688 decl_fini_priority_insert (tree decl
, priority_type priority
)
6690 struct cgraph_node
*node
;
6692 if (priority
== DEFAULT_INIT_PRIORITY
)
6694 node
= cgraph_node::get (decl
);
6699 node
= cgraph_node::get_create (decl
);
6700 node
->set_fini_priority (priority
);
6703 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6706 print_debug_expr_statistics (void)
6708 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6709 (long) debug_expr_for_decl
->size (),
6710 (long) debug_expr_for_decl
->elements (),
6711 debug_expr_for_decl
->collisions ());
6714 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6717 print_value_expr_statistics (void)
6719 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6720 (long) value_expr_for_decl
->size (),
6721 (long) value_expr_for_decl
->elements (),
6722 value_expr_for_decl
->collisions ());
6725 /* Lookup a debug expression for FROM, and return it if we find one. */
6728 decl_debug_expr_lookup (tree from
)
6730 struct tree_decl_map
*h
, in
;
6731 in
.base
.from
= from
;
6733 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6739 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6742 decl_debug_expr_insert (tree from
, tree to
)
6744 struct tree_decl_map
*h
;
6746 h
= ggc_alloc
<tree_decl_map
> ();
6747 h
->base
.from
= from
;
6749 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6752 /* Lookup a value expression for FROM, and return it if we find one. */
6755 decl_value_expr_lookup (tree from
)
6757 struct tree_decl_map
*h
, in
;
6758 in
.base
.from
= from
;
6760 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6766 /* Insert a mapping FROM->TO in the value expression hashtable. */
6769 decl_value_expr_insert (tree from
, tree to
)
6771 struct tree_decl_map
*h
;
6773 h
= ggc_alloc
<tree_decl_map
> ();
6774 h
->base
.from
= from
;
6776 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6779 /* Lookup a vector of debug arguments for FROM, and return it if we
6783 decl_debug_args_lookup (tree from
)
6785 struct tree_vec_map
*h
, in
;
6787 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6789 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6790 in
.base
.from
= from
;
6791 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6797 /* Insert a mapping FROM->empty vector of debug arguments in the value
6798 expression hashtable. */
6801 decl_debug_args_insert (tree from
)
6803 struct tree_vec_map
*h
;
6806 if (DECL_HAS_DEBUG_ARGS_P (from
))
6807 return decl_debug_args_lookup (from
);
6808 if (debug_args_for_decl
== NULL
)
6809 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6810 h
= ggc_alloc
<tree_vec_map
> ();
6811 h
->base
.from
= from
;
6813 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6815 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6819 /* Hashing of types so that we don't make duplicates.
6820 The entry point is `type_hash_canon'. */
6822 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6823 with types in the TREE_VALUE slots), by adding the hash codes
6824 of the individual types. */
6827 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6831 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6832 if (TREE_VALUE (tail
) != error_mark_node
)
6833 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6836 /* These are the Hashtable callback functions. */
6838 /* Returns true iff the types are equivalent. */
6841 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6843 /* First test the things that are the same for all types. */
6844 if (a
->hash
!= b
->hash
6845 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6846 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6847 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6848 TYPE_ATTRIBUTES (b
->type
))
6849 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6850 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6853 /* Be careful about comparing arrays before and after the element type
6854 has been completed; don't compare TYPE_ALIGN unless both types are
6856 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6857 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6858 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6861 switch (TREE_CODE (a
->type
))
6866 case REFERENCE_TYPE
:
6871 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6874 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6875 && !(TYPE_VALUES (a
->type
)
6876 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6877 && TYPE_VALUES (b
->type
)
6878 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6879 && type_list_equal (TYPE_VALUES (a
->type
),
6880 TYPE_VALUES (b
->type
))))
6883 /* ... fall through ... */
6888 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6890 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6891 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6892 TYPE_MAX_VALUE (b
->type
)))
6893 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6894 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6895 TYPE_MIN_VALUE (b
->type
))));
6897 case FIXED_POINT_TYPE
:
6898 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6901 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6904 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6905 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6906 || (TYPE_ARG_TYPES (a
->type
)
6907 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6908 && TYPE_ARG_TYPES (b
->type
)
6909 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6910 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6911 TYPE_ARG_TYPES (b
->type
)))))
6915 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6919 case QUAL_UNION_TYPE
:
6920 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6921 || (TYPE_FIELDS (a
->type
)
6922 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6923 && TYPE_FIELDS (b
->type
)
6924 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6925 && type_list_equal (TYPE_FIELDS (a
->type
),
6926 TYPE_FIELDS (b
->type
))));
6929 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6930 || (TYPE_ARG_TYPES (a
->type
)
6931 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6932 && TYPE_ARG_TYPES (b
->type
)
6933 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6934 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6935 TYPE_ARG_TYPES (b
->type
))))
6943 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6944 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6949 /* Given TYPE, and HASHCODE its hash code, return the canonical
6950 object for an identical type if one already exists.
6951 Otherwise, return TYPE, and record it as the canonical object.
6953 To use this function, first create a type of the sort you want.
6954 Then compute its hash code from the fields of the type that
6955 make it different from other similar types.
6956 Then call this function and use the value. */
6959 type_hash_canon (unsigned int hashcode
, tree type
)
6964 /* The hash table only contains main variants, so ensure that's what we're
6966 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6968 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6969 must call that routine before comparing TYPE_ALIGNs. */
6975 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6978 tree t1
= ((type_hash
*) *loc
)->type
;
6979 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6980 if (GATHER_STATISTICS
)
6982 tree_code_counts
[(int) TREE_CODE (type
)]--;
6983 tree_node_counts
[(int) t_kind
]--;
6984 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6990 struct type_hash
*h
;
6992 h
= ggc_alloc
<type_hash
> ();
7002 print_type_hash_statistics (void)
7004 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7005 (long) type_hash_table
->size (),
7006 (long) type_hash_table
->elements (),
7007 type_hash_table
->collisions ());
7010 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7011 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7012 by adding the hash codes of the individual attributes. */
7015 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7019 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7020 /* ??? Do we want to add in TREE_VALUE too? */
7021 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7024 /* Given two lists of attributes, return true if list l2 is
7025 equivalent to l1. */
7028 attribute_list_equal (const_tree l1
, const_tree l2
)
7033 return attribute_list_contained (l1
, l2
)
7034 && attribute_list_contained (l2
, l1
);
7037 /* Given two lists of attributes, return true if list L2 is
7038 completely contained within L1. */
7039 /* ??? This would be faster if attribute names were stored in a canonicalized
7040 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7041 must be used to show these elements are equivalent (which they are). */
7042 /* ??? It's not clear that attributes with arguments will always be handled
7046 attribute_list_contained (const_tree l1
, const_tree l2
)
7050 /* First check the obvious, maybe the lists are identical. */
7054 /* Maybe the lists are similar. */
7055 for (t1
= l1
, t2
= l2
;
7057 && get_attribute_name (t1
) == get_attribute_name (t2
)
7058 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7059 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7062 /* Maybe the lists are equal. */
7063 if (t1
== 0 && t2
== 0)
7066 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7069 /* This CONST_CAST is okay because lookup_attribute does not
7070 modify its argument and the return value is assigned to a
7072 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7073 CONST_CAST_TREE (l1
));
7074 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7075 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7079 if (attr
== NULL_TREE
)
7086 /* Given two lists of types
7087 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7088 return 1 if the lists contain the same types in the same order.
7089 Also, the TREE_PURPOSEs must match. */
7092 type_list_equal (const_tree l1
, const_tree l2
)
7096 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7097 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7098 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7099 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7100 && (TREE_TYPE (TREE_PURPOSE (t1
))
7101 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7107 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7108 given by TYPE. If the argument list accepts variable arguments,
7109 then this function counts only the ordinary arguments. */
7112 type_num_arguments (const_tree type
)
7117 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7118 /* If the function does not take a variable number of arguments,
7119 the last element in the list will have type `void'. */
7120 if (VOID_TYPE_P (TREE_VALUE (t
)))
7128 /* Nonzero if integer constants T1 and T2
7129 represent the same constant value. */
7132 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7137 if (t1
== 0 || t2
== 0)
7140 if (TREE_CODE (t1
) == INTEGER_CST
7141 && TREE_CODE (t2
) == INTEGER_CST
7142 && wi::to_widest (t1
) == wi::to_widest (t2
))
7148 /* Return true if T is an INTEGER_CST whose numerical value (extended
7149 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7152 tree_fits_shwi_p (const_tree t
)
7154 return (t
!= NULL_TREE
7155 && TREE_CODE (t
) == INTEGER_CST
7156 && wi::fits_shwi_p (wi::to_widest (t
)));
7159 /* Return true if T is an INTEGER_CST whose numerical value (extended
7160 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7163 tree_fits_uhwi_p (const_tree t
)
7165 return (t
!= NULL_TREE
7166 && TREE_CODE (t
) == INTEGER_CST
7167 && wi::fits_uhwi_p (wi::to_widest (t
)));
7170 /* T is an INTEGER_CST whose numerical value (extended according to
7171 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7175 tree_to_shwi (const_tree t
)
7177 gcc_assert (tree_fits_shwi_p (t
));
7178 return TREE_INT_CST_LOW (t
);
7181 /* T is an INTEGER_CST whose numerical value (extended according to
7182 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7185 unsigned HOST_WIDE_INT
7186 tree_to_uhwi (const_tree t
)
7188 gcc_assert (tree_fits_uhwi_p (t
));
7189 return TREE_INT_CST_LOW (t
);
7192 /* Return the most significant (sign) bit of T. */
7195 tree_int_cst_sign_bit (const_tree t
)
7197 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7199 return wi::extract_uhwi (t
, bitno
, 1);
7202 /* Return an indication of the sign of the integer constant T.
7203 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7204 Note that -1 will never be returned if T's type is unsigned. */
7207 tree_int_cst_sgn (const_tree t
)
7209 if (wi::eq_p (t
, 0))
7211 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7213 else if (wi::neg_p (t
))
7219 /* Return the minimum number of bits needed to represent VALUE in a
7220 signed or unsigned type, UNSIGNEDP says which. */
7223 tree_int_cst_min_precision (tree value
, signop sgn
)
7225 /* If the value is negative, compute its negative minus 1. The latter
7226 adjustment is because the absolute value of the largest negative value
7227 is one larger than the largest positive value. This is equivalent to
7228 a bit-wise negation, so use that operation instead. */
7230 if (tree_int_cst_sgn (value
) < 0)
7231 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7233 /* Return the number of bits needed, taking into account the fact
7234 that we need one more bit for a signed than unsigned type.
7235 If value is 0 or -1, the minimum precision is 1 no matter
7236 whether unsignedp is true or false. */
7238 if (integer_zerop (value
))
7241 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7244 /* Return truthvalue of whether T1 is the same tree structure as T2.
7245 Return 1 if they are the same.
7246 Return 0 if they are understandably different.
7247 Return -1 if either contains tree structure not understood by
7251 simple_cst_equal (const_tree t1
, const_tree t2
)
7253 enum tree_code code1
, code2
;
7259 if (t1
== 0 || t2
== 0)
7262 code1
= TREE_CODE (t1
);
7263 code2
= TREE_CODE (t2
);
7265 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7267 if (CONVERT_EXPR_CODE_P (code2
)
7268 || code2
== NON_LVALUE_EXPR
)
7269 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7271 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7274 else if (CONVERT_EXPR_CODE_P (code2
)
7275 || code2
== NON_LVALUE_EXPR
)
7276 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7284 return wi::to_widest (t1
) == wi::to_widest (t2
);
7287 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7290 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7293 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7294 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7295 TREE_STRING_LENGTH (t1
)));
7299 unsigned HOST_WIDE_INT idx
;
7300 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7301 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7303 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7306 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7307 /* ??? Should we handle also fields here? */
7308 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7314 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7317 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7320 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7323 const_tree arg1
, arg2
;
7324 const_call_expr_arg_iterator iter1
, iter2
;
7325 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7326 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7328 arg1
= next_const_call_expr_arg (&iter1
),
7329 arg2
= next_const_call_expr_arg (&iter2
))
7331 cmp
= simple_cst_equal (arg1
, arg2
);
7335 return arg1
== arg2
;
7339 /* Special case: if either target is an unallocated VAR_DECL,
7340 it means that it's going to be unified with whatever the
7341 TARGET_EXPR is really supposed to initialize, so treat it
7342 as being equivalent to anything. */
7343 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7344 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7345 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7346 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7347 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7348 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7351 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7356 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7358 case WITH_CLEANUP_EXPR
:
7359 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7363 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7366 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7367 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7381 /* This general rule works for most tree codes. All exceptions should be
7382 handled above. If this is a language-specific tree code, we can't
7383 trust what might be in the operand, so say we don't know
7385 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7388 switch (TREE_CODE_CLASS (code1
))
7392 case tcc_comparison
:
7393 case tcc_expression
:
7397 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7399 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7411 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7412 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7413 than U, respectively. */
7416 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7418 if (tree_int_cst_sgn (t
) < 0)
7420 else if (!tree_fits_uhwi_p (t
))
7422 else if (TREE_INT_CST_LOW (t
) == u
)
7424 else if (TREE_INT_CST_LOW (t
) < u
)
7430 /* Return true if SIZE represents a constant size that is in bounds of
7431 what the middle-end and the backend accepts (covering not more than
7432 half of the address-space). */
7435 valid_constant_size_p (const_tree size
)
7437 if (! tree_fits_uhwi_p (size
)
7438 || TREE_OVERFLOW (size
)
7439 || tree_int_cst_sign_bit (size
) != 0)
7444 /* Return the precision of the type, or for a complex or vector type the
7445 precision of the type of its elements. */
7448 element_precision (const_tree type
)
7450 enum tree_code code
= TREE_CODE (type
);
7451 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7452 type
= TREE_TYPE (type
);
7454 return TYPE_PRECISION (type
);
7457 /* Return true if CODE represents an associative tree code. Otherwise
7460 associative_tree_code (enum tree_code code
)
7479 /* Return true if CODE represents a commutative tree code. Otherwise
7482 commutative_tree_code (enum tree_code code
)
7488 case MULT_HIGHPART_EXPR
:
7496 case UNORDERED_EXPR
:
7500 case TRUTH_AND_EXPR
:
7501 case TRUTH_XOR_EXPR
:
7503 case WIDEN_MULT_EXPR
:
7504 case VEC_WIDEN_MULT_HI_EXPR
:
7505 case VEC_WIDEN_MULT_LO_EXPR
:
7506 case VEC_WIDEN_MULT_EVEN_EXPR
:
7507 case VEC_WIDEN_MULT_ODD_EXPR
:
7516 /* Return true if CODE represents a ternary tree code for which the
7517 first two operands are commutative. Otherwise return false. */
7519 commutative_ternary_tree_code (enum tree_code code
)
7523 case WIDEN_MULT_PLUS_EXPR
:
7524 case WIDEN_MULT_MINUS_EXPR
:
7538 /* Generate a hash value for an expression. This can be used iteratively
7539 by passing a previous result as the HSTATE argument.
7541 This function is intended to produce the same hash for expressions which
7542 would compare equal using operand_equal_p. */
7544 add_expr (const_tree t
, inchash::hash
&hstate
)
7547 enum tree_code code
;
7548 enum tree_code_class tclass
;
7552 hstate
.merge_hash (0);
7556 code
= TREE_CODE (t
);
7560 /* Alas, constants aren't shared, so we can't rely on pointer
7563 hstate
.merge_hash (0);
7566 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7567 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7571 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7572 hstate
.merge_hash (val2
);
7577 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7578 hstate
.merge_hash (val2
);
7582 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7585 inchash::add_expr (TREE_REALPART (t
), hstate
);
7586 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7591 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7592 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7596 /* We can just compare by pointer. */
7597 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7599 case PLACEHOLDER_EXPR
:
7600 /* The node itself doesn't matter. */
7603 /* A list of expressions, for a CALL_EXPR or as the elements of a
7605 for (; t
; t
= TREE_CHAIN (t
))
7606 inchash::add_expr (TREE_VALUE (t
), hstate
);
7610 unsigned HOST_WIDE_INT idx
;
7612 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7614 inchash::add_expr (field
, hstate
);
7615 inchash::add_expr (value
, hstate
);
7620 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7621 Otherwise nodes that compare equal according to operand_equal_p might
7622 get different hash codes. However, don't do this for machine specific
7623 or front end builtins, since the function code is overloaded in those
7625 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7626 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7628 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7629 code
= TREE_CODE (t
);
7633 tclass
= TREE_CODE_CLASS (code
);
7635 if (tclass
== tcc_declaration
)
7637 /* DECL's have a unique ID */
7638 hstate
.add_wide_int (DECL_UID (t
));
7642 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7644 hstate
.add_object (code
);
7646 /* Don't hash the type, that can lead to having nodes which
7647 compare equal according to operand_equal_p, but which
7648 have different hash codes. */
7649 if (CONVERT_EXPR_CODE_P (code
)
7650 || code
== NON_LVALUE_EXPR
)
7652 /* Make sure to include signness in the hash computation. */
7653 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7654 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7657 else if (commutative_tree_code (code
))
7659 /* It's a commutative expression. We want to hash it the same
7660 however it appears. We do this by first hashing both operands
7661 and then rehashing based on the order of their independent
7663 inchash::hash one
, two
;
7664 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7665 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7666 hstate
.add_commutative (one
, two
);
7669 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7670 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7678 /* Constructors for pointer, array and function types.
7679 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7680 constructed by language-dependent code, not here.) */
7682 /* Construct, lay out and return the type of pointers to TO_TYPE with
7683 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7684 reference all of memory. If such a type has already been
7685 constructed, reuse it. */
7688 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7693 if (to_type
== error_mark_node
)
7694 return error_mark_node
;
7696 /* If the pointed-to type has the may_alias attribute set, force
7697 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7698 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7699 can_alias_all
= true;
7701 /* In some cases, languages will have things that aren't a POINTER_TYPE
7702 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7703 In that case, return that type without regard to the rest of our
7706 ??? This is a kludge, but consistent with the way this function has
7707 always operated and there doesn't seem to be a good way to avoid this
7709 if (TYPE_POINTER_TO (to_type
) != 0
7710 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7711 return TYPE_POINTER_TO (to_type
);
7713 /* First, if we already have a type for pointers to TO_TYPE and it's
7714 the proper mode, use it. */
7715 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7716 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7719 t
= make_node (POINTER_TYPE
);
7721 TREE_TYPE (t
) = to_type
;
7722 SET_TYPE_MODE (t
, mode
);
7723 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7724 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7725 TYPE_POINTER_TO (to_type
) = t
;
7727 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7728 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7729 else if (TYPE_CANONICAL (to_type
) != to_type
)
7731 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7734 /* Lay out the type. This function has many callers that are concerned
7735 with expression-construction, and this simplifies them all. */
7741 /* By default build pointers in ptr_mode. */
7744 build_pointer_type (tree to_type
)
7746 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7747 : TYPE_ADDR_SPACE (to_type
);
7748 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7749 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7752 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7755 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7760 if (to_type
== error_mark_node
)
7761 return error_mark_node
;
7763 /* If the pointed-to type has the may_alias attribute set, force
7764 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7765 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7766 can_alias_all
= true;
7768 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7769 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7770 In that case, return that type without regard to the rest of our
7773 ??? This is a kludge, but consistent with the way this function has
7774 always operated and there doesn't seem to be a good way to avoid this
7776 if (TYPE_REFERENCE_TO (to_type
) != 0
7777 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7778 return TYPE_REFERENCE_TO (to_type
);
7780 /* First, if we already have a type for pointers to TO_TYPE and it's
7781 the proper mode, use it. */
7782 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7783 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7786 t
= make_node (REFERENCE_TYPE
);
7788 TREE_TYPE (t
) = to_type
;
7789 SET_TYPE_MODE (t
, mode
);
7790 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7791 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7792 TYPE_REFERENCE_TO (to_type
) = t
;
7794 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7795 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7796 else if (TYPE_CANONICAL (to_type
) != to_type
)
7798 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7807 /* Build the node for the type of references-to-TO_TYPE by default
7811 build_reference_type (tree to_type
)
7813 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7814 : TYPE_ADDR_SPACE (to_type
);
7815 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7816 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7819 #define MAX_INT_CACHED_PREC \
7820 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7821 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7823 /* Builds a signed or unsigned integer type of precision PRECISION.
7824 Used for C bitfields whose precision does not match that of
7825 built-in target types. */
7827 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7833 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7835 if (precision
<= MAX_INT_CACHED_PREC
)
7837 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7842 itype
= make_node (INTEGER_TYPE
);
7843 TYPE_PRECISION (itype
) = precision
;
7846 fixup_unsigned_type (itype
);
7848 fixup_signed_type (itype
);
7851 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7852 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7853 if (precision
<= MAX_INT_CACHED_PREC
)
7854 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7859 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7860 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7861 is true, reuse such a type that has already been constructed. */
7864 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7866 tree itype
= make_node (INTEGER_TYPE
);
7867 inchash::hash hstate
;
7869 TREE_TYPE (itype
) = type
;
7871 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7872 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7874 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7875 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7876 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7877 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7878 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7879 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7884 if ((TYPE_MIN_VALUE (itype
)
7885 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7886 || (TYPE_MAX_VALUE (itype
)
7887 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7889 /* Since we cannot reliably merge this type, we need to compare it using
7890 structural equality checks. */
7891 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7895 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7896 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7897 hstate
.merge_hash (TYPE_HASH (type
));
7898 itype
= type_hash_canon (hstate
.end (), itype
);
7903 /* Wrapper around build_range_type_1 with SHARED set to true. */
7906 build_range_type (tree type
, tree lowval
, tree highval
)
7908 return build_range_type_1 (type
, lowval
, highval
, true);
7911 /* Wrapper around build_range_type_1 with SHARED set to false. */
7914 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7916 return build_range_type_1 (type
, lowval
, highval
, false);
7919 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7920 MAXVAL should be the maximum value in the domain
7921 (one less than the length of the array).
7923 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7924 We don't enforce this limit, that is up to caller (e.g. language front end).
7925 The limit exists because the result is a signed type and we don't handle
7926 sizes that use more than one HOST_WIDE_INT. */
7929 build_index_type (tree maxval
)
7931 return build_range_type (sizetype
, size_zero_node
, maxval
);
7934 /* Return true if the debug information for TYPE, a subtype, should be emitted
7935 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7936 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7937 debug info and doesn't reflect the source code. */
7940 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7942 tree base_type
= TREE_TYPE (type
), low
, high
;
7944 /* Subrange types have a base type which is an integral type. */
7945 if (!INTEGRAL_TYPE_P (base_type
))
7948 /* Get the real bounds of the subtype. */
7949 if (lang_hooks
.types
.get_subrange_bounds
)
7950 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7953 low
= TYPE_MIN_VALUE (type
);
7954 high
= TYPE_MAX_VALUE (type
);
7957 /* If the type and its base type have the same representation and the same
7958 name, then the type is not a subrange but a copy of the base type. */
7959 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7960 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7961 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7962 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7963 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7964 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7974 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7975 and number of elements specified by the range of values of INDEX_TYPE.
7976 If SHARED is true, reuse such a type that has already been constructed. */
7979 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7983 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7985 error ("arrays of functions are not meaningful");
7986 elt_type
= integer_type_node
;
7989 t
= make_node (ARRAY_TYPE
);
7990 TREE_TYPE (t
) = elt_type
;
7991 TYPE_DOMAIN (t
) = index_type
;
7992 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7995 /* If the element type is incomplete at this point we get marked for
7996 structural equality. Do not record these types in the canonical
7998 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8003 inchash::hash hstate
;
8004 hstate
.add_object (TYPE_HASH (elt_type
));
8006 hstate
.add_object (TYPE_HASH (index_type
));
8007 t
= type_hash_canon (hstate
.end (), t
);
8010 if (TYPE_CANONICAL (t
) == t
)
8012 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8013 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
8014 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8015 else if (TYPE_CANONICAL (elt_type
) != elt_type
8016 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8018 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8020 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8027 /* Wrapper around build_array_type_1 with SHARED set to true. */
8030 build_array_type (tree elt_type
, tree index_type
)
8032 return build_array_type_1 (elt_type
, index_type
, true);
8035 /* Wrapper around build_array_type_1 with SHARED set to false. */
8038 build_nonshared_array_type (tree elt_type
, tree index_type
)
8040 return build_array_type_1 (elt_type
, index_type
, false);
8043 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8047 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8049 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8052 /* Recursively examines the array elements of TYPE, until a non-array
8053 element type is found. */
8056 strip_array_types (tree type
)
8058 while (TREE_CODE (type
) == ARRAY_TYPE
)
8059 type
= TREE_TYPE (type
);
8064 /* Computes the canonical argument types from the argument type list
8067 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8068 on entry to this function, or if any of the ARGTYPES are
8071 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8072 true on entry to this function, or if any of the ARGTYPES are
8075 Returns a canonical argument list, which may be ARGTYPES when the
8076 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8077 true) or would not differ from ARGTYPES. */
8080 maybe_canonicalize_argtypes (tree argtypes
,
8081 bool *any_structural_p
,
8082 bool *any_noncanonical_p
)
8085 bool any_noncanonical_argtypes_p
= false;
8087 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8089 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8090 /* Fail gracefully by stating that the type is structural. */
8091 *any_structural_p
= true;
8092 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8093 *any_structural_p
= true;
8094 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8095 || TREE_PURPOSE (arg
))
8096 /* If the argument has a default argument, we consider it
8097 non-canonical even though the type itself is canonical.
8098 That way, different variants of function and method types
8099 with default arguments will all point to the variant with
8100 no defaults as their canonical type. */
8101 any_noncanonical_argtypes_p
= true;
8104 if (*any_structural_p
)
8107 if (any_noncanonical_argtypes_p
)
8109 /* Build the canonical list of argument types. */
8110 tree canon_argtypes
= NULL_TREE
;
8111 bool is_void
= false;
8113 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8115 if (arg
== void_list_node
)
8118 canon_argtypes
= tree_cons (NULL_TREE
,
8119 TYPE_CANONICAL (TREE_VALUE (arg
)),
8123 canon_argtypes
= nreverse (canon_argtypes
);
8125 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8127 /* There is a non-canonical type. */
8128 *any_noncanonical_p
= true;
8129 return canon_argtypes
;
8132 /* The canonical argument types are the same as ARGTYPES. */
8136 /* Construct, lay out and return
8137 the type of functions returning type VALUE_TYPE
8138 given arguments of types ARG_TYPES.
8139 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8140 are data type nodes for the arguments of the function.
8141 If such a type has already been constructed, reuse it. */
8144 build_function_type (tree value_type
, tree arg_types
)
8147 inchash::hash hstate
;
8148 bool any_structural_p
, any_noncanonical_p
;
8149 tree canon_argtypes
;
8151 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8153 error ("function return type cannot be function");
8154 value_type
= integer_type_node
;
8157 /* Make a node of the sort we want. */
8158 t
= make_node (FUNCTION_TYPE
);
8159 TREE_TYPE (t
) = value_type
;
8160 TYPE_ARG_TYPES (t
) = arg_types
;
8162 /* If we already have such a type, use the old one. */
8163 hstate
.add_object (TYPE_HASH (value_type
));
8164 type_hash_list (arg_types
, hstate
);
8165 t
= type_hash_canon (hstate
.end (), t
);
8167 /* Set up the canonical type. */
8168 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8169 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8170 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8172 &any_noncanonical_p
);
8173 if (any_structural_p
)
8174 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8175 else if (any_noncanonical_p
)
8176 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8179 if (!COMPLETE_TYPE_P (t
))
8184 /* Build a function type. The RETURN_TYPE is the type returned by the
8185 function. If VAARGS is set, no void_type_node is appended to the
8186 the list. ARGP must be always be terminated be a NULL_TREE. */
8189 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8193 t
= va_arg (argp
, tree
);
8194 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8195 args
= tree_cons (NULL_TREE
, t
, args
);
8200 if (args
!= NULL_TREE
)
8201 args
= nreverse (args
);
8202 gcc_assert (last
!= void_list_node
);
8204 else if (args
== NULL_TREE
)
8205 args
= void_list_node
;
8209 args
= nreverse (args
);
8210 TREE_CHAIN (last
) = void_list_node
;
8212 args
= build_function_type (return_type
, args
);
8217 /* Build a function type. The RETURN_TYPE is the type returned by the
8218 function. If additional arguments are provided, they are
8219 additional argument types. The list of argument types must always
8220 be terminated by NULL_TREE. */
8223 build_function_type_list (tree return_type
, ...)
8228 va_start (p
, return_type
);
8229 args
= build_function_type_list_1 (false, return_type
, p
);
8234 /* Build a variable argument function type. The RETURN_TYPE is the
8235 type returned by the function. If additional arguments are provided,
8236 they are additional argument types. The list of argument types must
8237 always be terminated by NULL_TREE. */
8240 build_varargs_function_type_list (tree return_type
, ...)
8245 va_start (p
, return_type
);
8246 args
= build_function_type_list_1 (true, return_type
, p
);
8252 /* Build a function type. RETURN_TYPE is the type returned by the
8253 function; VAARGS indicates whether the function takes varargs. The
8254 function takes N named arguments, the types of which are provided in
8258 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8262 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8264 for (i
= n
- 1; i
>= 0; i
--)
8265 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8267 return build_function_type (return_type
, t
);
8270 /* Build a function type. RETURN_TYPE is the type returned by the
8271 function. The function takes N named arguments, the types of which
8272 are provided in ARG_TYPES. */
8275 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8277 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8280 /* Build a variable argument function type. RETURN_TYPE is the type
8281 returned by the function. The function takes N named arguments, the
8282 types of which are provided in ARG_TYPES. */
8285 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8287 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8290 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8291 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8292 for the method. An implicit additional parameter (of type
8293 pointer-to-BASETYPE) is added to the ARGTYPES. */
8296 build_method_type_directly (tree basetype
,
8302 inchash::hash hstate
;
8303 bool any_structural_p
, any_noncanonical_p
;
8304 tree canon_argtypes
;
8306 /* Make a node of the sort we want. */
8307 t
= make_node (METHOD_TYPE
);
8309 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8310 TREE_TYPE (t
) = rettype
;
8311 ptype
= build_pointer_type (basetype
);
8313 /* The actual arglist for this function includes a "hidden" argument
8314 which is "this". Put it into the list of argument types. */
8315 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8316 TYPE_ARG_TYPES (t
) = argtypes
;
8318 /* If we already have such a type, use the old one. */
8319 hstate
.add_object (TYPE_HASH (basetype
));
8320 hstate
.add_object (TYPE_HASH (rettype
));
8321 type_hash_list (argtypes
, hstate
);
8322 t
= type_hash_canon (hstate
.end (), t
);
8324 /* Set up the canonical type. */
8326 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8327 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8329 = (TYPE_CANONICAL (basetype
) != basetype
8330 || TYPE_CANONICAL (rettype
) != rettype
);
8331 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8333 &any_noncanonical_p
);
8334 if (any_structural_p
)
8335 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8336 else if (any_noncanonical_p
)
8338 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8339 TYPE_CANONICAL (rettype
),
8341 if (!COMPLETE_TYPE_P (t
))
8347 /* Construct, lay out and return the type of methods belonging to class
8348 BASETYPE and whose arguments and values are described by TYPE.
8349 If that type exists already, reuse it.
8350 TYPE must be a FUNCTION_TYPE node. */
8353 build_method_type (tree basetype
, tree type
)
8355 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8357 return build_method_type_directly (basetype
,
8359 TYPE_ARG_TYPES (type
));
8362 /* Construct, lay out and return the type of offsets to a value
8363 of type TYPE, within an object of type BASETYPE.
8364 If a suitable offset type exists already, reuse it. */
8367 build_offset_type (tree basetype
, tree type
)
8370 inchash::hash hstate
;
8372 /* Make a node of the sort we want. */
8373 t
= make_node (OFFSET_TYPE
);
8375 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8376 TREE_TYPE (t
) = type
;
8378 /* If we already have such a type, use the old one. */
8379 hstate
.add_object (TYPE_HASH (basetype
));
8380 hstate
.add_object (TYPE_HASH (type
));
8381 t
= type_hash_canon (hstate
.end (), t
);
8383 if (!COMPLETE_TYPE_P (t
))
8386 if (TYPE_CANONICAL (t
) == t
)
8388 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8389 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8390 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8391 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8392 || TYPE_CANONICAL (type
) != type
)
8394 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8395 TYPE_CANONICAL (type
));
8401 /* Create a complex type whose components are COMPONENT_TYPE. */
8404 build_complex_type (tree component_type
)
8407 inchash::hash hstate
;
8409 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8410 || SCALAR_FLOAT_TYPE_P (component_type
)
8411 || FIXED_POINT_TYPE_P (component_type
));
8413 /* Make a node of the sort we want. */
8414 t
= make_node (COMPLEX_TYPE
);
8416 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8418 /* If we already have such a type, use the old one. */
8419 hstate
.add_object (TYPE_HASH (component_type
));
8420 t
= type_hash_canon (hstate
.end (), t
);
8422 if (!COMPLETE_TYPE_P (t
))
8425 if (TYPE_CANONICAL (t
) == t
)
8427 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8428 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8429 else if (TYPE_CANONICAL (component_type
) != component_type
)
8431 = build_complex_type (TYPE_CANONICAL (component_type
));
8434 /* We need to create a name, since complex is a fundamental type. */
8435 if (! TYPE_NAME (t
))
8438 if (component_type
== char_type_node
)
8439 name
= "complex char";
8440 else if (component_type
== signed_char_type_node
)
8441 name
= "complex signed char";
8442 else if (component_type
== unsigned_char_type_node
)
8443 name
= "complex unsigned char";
8444 else if (component_type
== short_integer_type_node
)
8445 name
= "complex short int";
8446 else if (component_type
== short_unsigned_type_node
)
8447 name
= "complex short unsigned int";
8448 else if (component_type
== integer_type_node
)
8449 name
= "complex int";
8450 else if (component_type
== unsigned_type_node
)
8451 name
= "complex unsigned int";
8452 else if (component_type
== long_integer_type_node
)
8453 name
= "complex long int";
8454 else if (component_type
== long_unsigned_type_node
)
8455 name
= "complex long unsigned int";
8456 else if (component_type
== long_long_integer_type_node
)
8457 name
= "complex long long int";
8458 else if (component_type
== long_long_unsigned_type_node
)
8459 name
= "complex long long unsigned int";
8464 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8465 get_identifier (name
), t
);
8468 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8471 /* If TYPE is a real or complex floating-point type and the target
8472 does not directly support arithmetic on TYPE then return the wider
8473 type to be used for arithmetic on TYPE. Otherwise, return
8477 excess_precision_type (tree type
)
8479 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8481 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8482 switch (TREE_CODE (type
))
8485 switch (flt_eval_method
)
8488 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8489 return double_type_node
;
8492 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8493 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8494 return long_double_type_node
;
8501 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8503 switch (flt_eval_method
)
8506 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8507 return complex_double_type_node
;
8510 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8511 || (TYPE_MODE (TREE_TYPE (type
))
8512 == TYPE_MODE (double_type_node
)))
8513 return complex_long_double_type_node
;
8526 /* Return OP, stripped of any conversions to wider types as much as is safe.
8527 Converting the value back to OP's type makes a value equivalent to OP.
8529 If FOR_TYPE is nonzero, we return a value which, if converted to
8530 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8532 OP must have integer, real or enumeral type. Pointers are not allowed!
8534 There are some cases where the obvious value we could return
8535 would regenerate to OP if converted to OP's type,
8536 but would not extend like OP to wider types.
8537 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8538 For example, if OP is (unsigned short)(signed char)-1,
8539 we avoid returning (signed char)-1 if FOR_TYPE is int,
8540 even though extending that to an unsigned short would regenerate OP,
8541 since the result of extending (signed char)-1 to (int)
8542 is different from (int) OP. */
8545 get_unwidened (tree op
, tree for_type
)
8547 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8548 tree type
= TREE_TYPE (op
);
8550 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8552 = (for_type
!= 0 && for_type
!= type
8553 && final_prec
> TYPE_PRECISION (type
)
8554 && TYPE_UNSIGNED (type
));
8557 while (CONVERT_EXPR_P (op
))
8561 /* TYPE_PRECISION on vector types has different meaning
8562 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8563 so avoid them here. */
8564 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8567 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8568 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8570 /* Truncations are many-one so cannot be removed.
8571 Unless we are later going to truncate down even farther. */
8573 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8576 /* See what's inside this conversion. If we decide to strip it,
8578 op
= TREE_OPERAND (op
, 0);
8580 /* If we have not stripped any zero-extensions (uns is 0),
8581 we can strip any kind of extension.
8582 If we have previously stripped a zero-extension,
8583 only zero-extensions can safely be stripped.
8584 Any extension can be stripped if the bits it would produce
8585 are all going to be discarded later by truncating to FOR_TYPE. */
8589 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8591 /* TYPE_UNSIGNED says whether this is a zero-extension.
8592 Let's avoid computing it if it does not affect WIN
8593 and if UNS will not be needed again. */
8595 || CONVERT_EXPR_P (op
))
8596 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8604 /* If we finally reach a constant see if it fits in for_type and
8605 in that case convert it. */
8607 && TREE_CODE (win
) == INTEGER_CST
8608 && TREE_TYPE (win
) != for_type
8609 && int_fits_type_p (win
, for_type
))
8610 win
= fold_convert (for_type
, win
);
8615 /* Return OP or a simpler expression for a narrower value
8616 which can be sign-extended or zero-extended to give back OP.
8617 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8618 or 0 if the value should be sign-extended. */
8621 get_narrower (tree op
, int *unsignedp_ptr
)
8626 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8628 while (TREE_CODE (op
) == NOP_EXPR
)
8631 = (TYPE_PRECISION (TREE_TYPE (op
))
8632 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8634 /* Truncations are many-one so cannot be removed. */
8638 /* See what's inside this conversion. If we decide to strip it,
8643 op
= TREE_OPERAND (op
, 0);
8644 /* An extension: the outermost one can be stripped,
8645 but remember whether it is zero or sign extension. */
8647 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8648 /* Otherwise, if a sign extension has been stripped,
8649 only sign extensions can now be stripped;
8650 if a zero extension has been stripped, only zero-extensions. */
8651 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8655 else /* bitschange == 0 */
8657 /* A change in nominal type can always be stripped, but we must
8658 preserve the unsignedness. */
8660 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8662 op
= TREE_OPERAND (op
, 0);
8663 /* Keep trying to narrow, but don't assign op to win if it
8664 would turn an integral type into something else. */
8665 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8672 if (TREE_CODE (op
) == COMPONENT_REF
8673 /* Since type_for_size always gives an integer type. */
8674 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8675 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8676 /* Ensure field is laid out already. */
8677 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8678 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8680 unsigned HOST_WIDE_INT innerprec
8681 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8682 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8683 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8684 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8686 /* We can get this structure field in a narrower type that fits it,
8687 but the resulting extension to its nominal type (a fullword type)
8688 must satisfy the same conditions as for other extensions.
8690 Do this only for fields that are aligned (not bit-fields),
8691 because when bit-field insns will be used there is no
8692 advantage in doing this. */
8694 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8695 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8696 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8700 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8701 win
= fold_convert (type
, op
);
8705 *unsignedp_ptr
= uns
;
8709 /* Returns true if integer constant C has a value that is permissible
8710 for type TYPE (an INTEGER_TYPE). */
8713 int_fits_type_p (const_tree c
, const_tree type
)
8715 tree type_low_bound
, type_high_bound
;
8716 bool ok_for_low_bound
, ok_for_high_bound
;
8717 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8720 type_low_bound
= TYPE_MIN_VALUE (type
);
8721 type_high_bound
= TYPE_MAX_VALUE (type
);
8723 /* If at least one bound of the type is a constant integer, we can check
8724 ourselves and maybe make a decision. If no such decision is possible, but
8725 this type is a subtype, try checking against that. Otherwise, use
8726 fits_to_tree_p, which checks against the precision.
8728 Compute the status for each possibly constant bound, and return if we see
8729 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8730 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8731 for "constant known to fit". */
8733 /* Check if c >= type_low_bound. */
8734 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8736 if (tree_int_cst_lt (c
, type_low_bound
))
8738 ok_for_low_bound
= true;
8741 ok_for_low_bound
= false;
8743 /* Check if c <= type_high_bound. */
8744 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8746 if (tree_int_cst_lt (type_high_bound
, c
))
8748 ok_for_high_bound
= true;
8751 ok_for_high_bound
= false;
8753 /* If the constant fits both bounds, the result is known. */
8754 if (ok_for_low_bound
&& ok_for_high_bound
)
8757 /* Perform some generic filtering which may allow making a decision
8758 even if the bounds are not constant. First, negative integers
8759 never fit in unsigned types, */
8760 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8763 /* Second, narrower types always fit in wider ones. */
8764 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8767 /* Third, unsigned integers with top bit set never fit signed types. */
8768 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8770 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8771 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8773 /* When a tree_cst is converted to a wide-int, the precision
8774 is taken from the type. However, if the precision of the
8775 mode underneath the type is smaller than that, it is
8776 possible that the value will not fit. The test below
8777 fails if any bit is set between the sign bit of the
8778 underlying mode and the top bit of the type. */
8779 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8782 else if (wi::neg_p (c
))
8786 /* If we haven't been able to decide at this point, there nothing more we
8787 can check ourselves here. Look at the base type if we have one and it
8788 has the same precision. */
8789 if (TREE_CODE (type
) == INTEGER_TYPE
8790 && TREE_TYPE (type
) != 0
8791 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8793 type
= TREE_TYPE (type
);
8797 /* Or to fits_to_tree_p, if nothing else. */
8798 return wi::fits_to_tree_p (c
, type
);
8801 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8802 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8803 represented (assuming two's-complement arithmetic) within the bit
8804 precision of the type are returned instead. */
8807 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8809 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8810 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8811 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8814 if (TYPE_UNSIGNED (type
))
8815 mpz_set_ui (min
, 0);
8818 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8819 wi::to_mpz (mn
, min
, SIGNED
);
8823 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8824 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8825 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8828 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8829 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8833 /* Return true if VAR is an automatic variable defined in function FN. */
8836 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8838 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8839 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8840 || TREE_CODE (var
) == PARM_DECL
)
8841 && ! TREE_STATIC (var
))
8842 || TREE_CODE (var
) == LABEL_DECL
8843 || TREE_CODE (var
) == RESULT_DECL
));
8846 /* Subprogram of following function. Called by walk_tree.
8848 Return *TP if it is an automatic variable or parameter of the
8849 function passed in as DATA. */
8852 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8854 tree fn
= (tree
) data
;
8859 else if (DECL_P (*tp
)
8860 && auto_var_in_fn_p (*tp
, fn
))
8866 /* Returns true if T is, contains, or refers to a type with variable
8867 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8868 arguments, but not the return type. If FN is nonzero, only return
8869 true if a modifier of the type or position of FN is a variable or
8870 parameter inside FN.
8872 This concept is more general than that of C99 'variably modified types':
8873 in C99, a struct type is never variably modified because a VLA may not
8874 appear as a structure member. However, in GNU C code like:
8876 struct S { int i[f()]; };
8878 is valid, and other languages may define similar constructs. */
8881 variably_modified_type_p (tree type
, tree fn
)
8885 /* Test if T is either variable (if FN is zero) or an expression containing
8886 a variable in FN. If TYPE isn't gimplified, return true also if
8887 gimplify_one_sizepos would gimplify the expression into a local
8889 #define RETURN_TRUE_IF_VAR(T) \
8890 do { tree _t = (T); \
8891 if (_t != NULL_TREE \
8892 && _t != error_mark_node \
8893 && TREE_CODE (_t) != INTEGER_CST \
8894 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8896 || (!TYPE_SIZES_GIMPLIFIED (type) \
8897 && !is_gimple_sizepos (_t)) \
8898 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8899 return true; } while (0)
8901 if (type
== error_mark_node
)
8904 /* If TYPE itself has variable size, it is variably modified. */
8905 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8906 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8908 switch (TREE_CODE (type
))
8911 case REFERENCE_TYPE
:
8913 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8919 /* If TYPE is a function type, it is variably modified if the
8920 return type is variably modified. */
8921 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8927 case FIXED_POINT_TYPE
:
8930 /* Scalar types are variably modified if their end points
8932 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8933 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8938 case QUAL_UNION_TYPE
:
8939 /* We can't see if any of the fields are variably-modified by the
8940 definition we normally use, since that would produce infinite
8941 recursion via pointers. */
8942 /* This is variably modified if some field's type is. */
8943 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8944 if (TREE_CODE (t
) == FIELD_DECL
)
8946 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8947 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8948 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8950 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8951 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8956 /* Do not call ourselves to avoid infinite recursion. This is
8957 variably modified if the element type is. */
8958 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8959 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8966 /* The current language may have other cases to check, but in general,
8967 all other types are not variably modified. */
8968 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8970 #undef RETURN_TRUE_IF_VAR
8973 /* Given a DECL or TYPE, return the scope in which it was declared, or
8974 NULL_TREE if there is no containing scope. */
8977 get_containing_scope (const_tree t
)
8979 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8982 /* Return the innermost context enclosing DECL that is
8983 a FUNCTION_DECL, or zero if none. */
8986 decl_function_context (const_tree decl
)
8990 if (TREE_CODE (decl
) == ERROR_MARK
)
8993 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8994 where we look up the function at runtime. Such functions always take
8995 a first argument of type 'pointer to real context'.
8997 C++ should really be fixed to use DECL_CONTEXT for the real context,
8998 and use something else for the "virtual context". */
8999 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9002 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9004 context
= DECL_CONTEXT (decl
);
9006 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9008 if (TREE_CODE (context
) == BLOCK
)
9009 context
= BLOCK_SUPERCONTEXT (context
);
9011 context
= get_containing_scope (context
);
9017 /* Return the innermost context enclosing DECL that is
9018 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9019 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9022 decl_type_context (const_tree decl
)
9024 tree context
= DECL_CONTEXT (decl
);
9027 switch (TREE_CODE (context
))
9029 case NAMESPACE_DECL
:
9030 case TRANSLATION_UNIT_DECL
:
9035 case QUAL_UNION_TYPE
:
9040 context
= DECL_CONTEXT (context
);
9044 context
= BLOCK_SUPERCONTEXT (context
);
9054 /* CALL is a CALL_EXPR. Return the declaration for the function
9055 called, or NULL_TREE if the called function cannot be
9059 get_callee_fndecl (const_tree call
)
9063 if (call
== error_mark_node
)
9064 return error_mark_node
;
9066 /* It's invalid to call this function with anything but a
9068 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9070 /* The first operand to the CALL is the address of the function
9072 addr
= CALL_EXPR_FN (call
);
9074 /* If there is no function, return early. */
9075 if (addr
== NULL_TREE
)
9080 /* If this is a readonly function pointer, extract its initial value. */
9081 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9082 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9083 && DECL_INITIAL (addr
))
9084 addr
= DECL_INITIAL (addr
);
9086 /* If the address is just `&f' for some function `f', then we know
9087 that `f' is being called. */
9088 if (TREE_CODE (addr
) == ADDR_EXPR
9089 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9090 return TREE_OPERAND (addr
, 0);
9092 /* We couldn't figure out what was being called. */
9096 /* Print debugging information about tree nodes generated during the compile,
9097 and any language-specific information. */
9100 dump_tree_statistics (void)
9102 if (GATHER_STATISTICS
)
9105 int total_nodes
, total_bytes
;
9106 fprintf (stderr
, "Kind Nodes Bytes\n");
9107 fprintf (stderr
, "---------------------------------------\n");
9108 total_nodes
= total_bytes
= 0;
9109 for (i
= 0; i
< (int) all_kinds
; i
++)
9111 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9112 tree_node_counts
[i
], tree_node_sizes
[i
]);
9113 total_nodes
+= tree_node_counts
[i
];
9114 total_bytes
+= tree_node_sizes
[i
];
9116 fprintf (stderr
, "---------------------------------------\n");
9117 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9118 fprintf (stderr
, "---------------------------------------\n");
9119 fprintf (stderr
, "Code Nodes\n");
9120 fprintf (stderr
, "----------------------------\n");
9121 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9122 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9123 tree_code_counts
[i
]);
9124 fprintf (stderr
, "----------------------------\n");
9125 ssanames_print_statistics ();
9126 phinodes_print_statistics ();
9129 fprintf (stderr
, "(No per-node statistics)\n");
9131 print_type_hash_statistics ();
9132 print_debug_expr_statistics ();
9133 print_value_expr_statistics ();
9134 lang_hooks
.print_statistics ();
9137 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9139 /* Generate a crc32 of a byte. */
9142 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9146 for (ix
= bits
; ix
--; value
<<= 1)
9150 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9157 /* Generate a crc32 of a 32-bit unsigned. */
9160 crc32_unsigned (unsigned chksum
, unsigned value
)
9162 return crc32_unsigned_bits (chksum
, value
, 32);
9165 /* Generate a crc32 of a byte. */
9168 crc32_byte (unsigned chksum
, char byte
)
9170 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9173 /* Generate a crc32 of a string. */
9176 crc32_string (unsigned chksum
, const char *string
)
9180 chksum
= crc32_byte (chksum
, *string
);
9186 /* P is a string that will be used in a symbol. Mask out any characters
9187 that are not valid in that context. */
9190 clean_symbol_name (char *p
)
9194 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9197 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9204 /* Generate a name for a special-purpose function.
9205 The generated name may need to be unique across the whole link.
9206 Changes to this function may also require corresponding changes to
9207 xstrdup_mask_random.
9208 TYPE is some string to identify the purpose of this function to the
9209 linker or collect2; it must start with an uppercase letter,
9211 I - for constructors
9213 N - for C++ anonymous namespaces
9214 F - for DWARF unwind frame information. */
9217 get_file_function_name (const char *type
)
9223 /* If we already have a name we know to be unique, just use that. */
9224 if (first_global_object_name
)
9225 p
= q
= ASTRDUP (first_global_object_name
);
9226 /* If the target is handling the constructors/destructors, they
9227 will be local to this file and the name is only necessary for
9229 We also assign sub_I and sub_D sufixes to constructors called from
9230 the global static constructors. These are always local. */
9231 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9232 || (strncmp (type
, "sub_", 4) == 0
9233 && (type
[4] == 'I' || type
[4] == 'D')))
9235 const char *file
= main_input_filename
;
9237 file
= LOCATION_FILE (input_location
);
9238 /* Just use the file's basename, because the full pathname
9239 might be quite long. */
9240 p
= q
= ASTRDUP (lbasename (file
));
9244 /* Otherwise, the name must be unique across the entire link.
9245 We don't have anything that we know to be unique to this translation
9246 unit, so use what we do have and throw in some randomness. */
9248 const char *name
= weak_global_object_name
;
9249 const char *file
= main_input_filename
;
9254 file
= LOCATION_FILE (input_location
);
9256 len
= strlen (file
);
9257 q
= (char *) alloca (9 + 17 + len
+ 1);
9258 memcpy (q
, file
, len
+ 1);
9260 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9261 crc32_string (0, name
), get_random_seed (false));
9266 clean_symbol_name (q
);
9267 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9270 /* Set up the name of the file-level functions we may need.
9271 Use a global object (which is already required to be unique over
9272 the program) rather than the file name (which imposes extra
9274 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9276 return get_identifier (buf
);
9279 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9281 /* Complain that the tree code of NODE does not match the expected 0
9282 terminated list of trailing codes. The trailing code list can be
9283 empty, for a more vague error message. FILE, LINE, and FUNCTION
9284 are of the caller. */
9287 tree_check_failed (const_tree node
, const char *file
,
9288 int line
, const char *function
, ...)
9292 unsigned length
= 0;
9293 enum tree_code code
;
9295 va_start (args
, function
);
9296 while ((code
= (enum tree_code
) va_arg (args
, int)))
9297 length
+= 4 + strlen (get_tree_code_name (code
));
9302 va_start (args
, function
);
9303 length
+= strlen ("expected ");
9304 buffer
= tmp
= (char *) alloca (length
);
9306 while ((code
= (enum tree_code
) va_arg (args
, int)))
9308 const char *prefix
= length
? " or " : "expected ";
9310 strcpy (tmp
+ length
, prefix
);
9311 length
+= strlen (prefix
);
9312 strcpy (tmp
+ length
, get_tree_code_name (code
));
9313 length
+= strlen (get_tree_code_name (code
));
9318 buffer
= "unexpected node";
9320 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9321 buffer
, get_tree_code_name (TREE_CODE (node
)),
9322 function
, trim_filename (file
), line
);
9325 /* Complain that the tree code of NODE does match the expected 0
9326 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9330 tree_not_check_failed (const_tree node
, const char *file
,
9331 int line
, const char *function
, ...)
9335 unsigned length
= 0;
9336 enum tree_code code
;
9338 va_start (args
, function
);
9339 while ((code
= (enum tree_code
) va_arg (args
, int)))
9340 length
+= 4 + strlen (get_tree_code_name (code
));
9342 va_start (args
, function
);
9343 buffer
= (char *) alloca (length
);
9345 while ((code
= (enum tree_code
) va_arg (args
, int)))
9349 strcpy (buffer
+ length
, " or ");
9352 strcpy (buffer
+ length
, get_tree_code_name (code
));
9353 length
+= strlen (get_tree_code_name (code
));
9357 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9358 buffer
, get_tree_code_name (TREE_CODE (node
)),
9359 function
, trim_filename (file
), line
);
9362 /* Similar to tree_check_failed, except that we check for a class of tree
9363 code, given in CL. */
9366 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9367 const char *file
, int line
, const char *function
)
9370 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9371 TREE_CODE_CLASS_STRING (cl
),
9372 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9373 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9376 /* Similar to tree_check_failed, except that instead of specifying a
9377 dozen codes, use the knowledge that they're all sequential. */
9380 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9381 const char *function
, enum tree_code c1
,
9385 unsigned length
= 0;
9388 for (c
= c1
; c
<= c2
; ++c
)
9389 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9391 length
+= strlen ("expected ");
9392 buffer
= (char *) alloca (length
);
9395 for (c
= c1
; c
<= c2
; ++c
)
9397 const char *prefix
= length
? " or " : "expected ";
9399 strcpy (buffer
+ length
, prefix
);
9400 length
+= strlen (prefix
);
9401 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9402 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9405 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9406 buffer
, get_tree_code_name (TREE_CODE (node
)),
9407 function
, trim_filename (file
), line
);
9411 /* Similar to tree_check_failed, except that we check that a tree does
9412 not have the specified code, given in CL. */
9415 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9416 const char *file
, int line
, const char *function
)
9419 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9420 TREE_CODE_CLASS_STRING (cl
),
9421 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9422 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9426 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9429 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9430 const char *function
, enum omp_clause_code code
)
9432 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9433 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9434 function
, trim_filename (file
), line
);
9438 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9441 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9442 const char *function
, enum omp_clause_code c1
,
9443 enum omp_clause_code c2
)
9446 unsigned length
= 0;
9449 for (c
= c1
; c
<= c2
; ++c
)
9450 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9452 length
+= strlen ("expected ");
9453 buffer
= (char *) alloca (length
);
9456 for (c
= c1
; c
<= c2
; ++c
)
9458 const char *prefix
= length
? " or " : "expected ";
9460 strcpy (buffer
+ length
, prefix
);
9461 length
+= strlen (prefix
);
9462 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9463 length
+= strlen (omp_clause_code_name
[c
]);
9466 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9467 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9468 function
, trim_filename (file
), line
);
9472 #undef DEFTREESTRUCT
9473 #define DEFTREESTRUCT(VAL, NAME) NAME,
9475 static const char *ts_enum_names
[] = {
9476 #include "treestruct.def"
9478 #undef DEFTREESTRUCT
9480 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9482 /* Similar to tree_class_check_failed, except that we check for
9483 whether CODE contains the tree structure identified by EN. */
9486 tree_contains_struct_check_failed (const_tree node
,
9487 const enum tree_node_structure_enum en
,
9488 const char *file
, int line
,
9489 const char *function
)
9492 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9494 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9498 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9499 (dynamically sized) vector. */
9502 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9503 const char *function
)
9506 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9507 idx
+ 1, len
, function
, trim_filename (file
), line
);
9510 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9511 (dynamically sized) vector. */
9514 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9515 const char *function
)
9518 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9519 idx
+ 1, len
, function
, trim_filename (file
), line
);
9522 /* Similar to above, except that the check is for the bounds of the operand
9523 vector of an expression node EXP. */
9526 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9527 int line
, const char *function
)
9529 enum tree_code code
= TREE_CODE (exp
);
9531 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9532 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9533 function
, trim_filename (file
), line
);
9536 /* Similar to above, except that the check is for the number of
9537 operands of an OMP_CLAUSE node. */
9540 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9541 int line
, const char *function
)
9544 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9545 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9546 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9547 trim_filename (file
), line
);
9549 #endif /* ENABLE_TREE_CHECKING */
9551 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9552 and mapped to the machine mode MODE. Initialize its fields and build
9553 the information necessary for debugging output. */
9556 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9559 inchash::hash hstate
;
9561 t
= make_node (VECTOR_TYPE
);
9562 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9563 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9564 SET_TYPE_MODE (t
, mode
);
9566 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9567 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9568 else if (TYPE_CANONICAL (innertype
) != innertype
9569 || mode
!= VOIDmode
)
9571 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9575 hstate
.add_wide_int (VECTOR_TYPE
);
9576 hstate
.add_wide_int (nunits
);
9577 hstate
.add_wide_int (mode
);
9578 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9579 t
= type_hash_canon (hstate
.end (), t
);
9581 /* We have built a main variant, based on the main variant of the
9582 inner type. Use it to build the variant we return. */
9583 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9584 && TREE_TYPE (t
) != innertype
)
9585 return build_type_attribute_qual_variant (t
,
9586 TYPE_ATTRIBUTES (innertype
),
9587 TYPE_QUALS (innertype
));
9593 make_or_reuse_type (unsigned size
, int unsignedp
)
9597 if (size
== INT_TYPE_SIZE
)
9598 return unsignedp
? unsigned_type_node
: integer_type_node
;
9599 if (size
== CHAR_TYPE_SIZE
)
9600 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9601 if (size
== SHORT_TYPE_SIZE
)
9602 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9603 if (size
== LONG_TYPE_SIZE
)
9604 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9605 if (size
== LONG_LONG_TYPE_SIZE
)
9606 return (unsignedp
? long_long_unsigned_type_node
9607 : long_long_integer_type_node
);
9609 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9610 if (size
== int_n_data
[i
].bitsize
9611 && int_n_enabled_p
[i
])
9612 return (unsignedp
? int_n_trees
[i
].unsigned_type
9613 : int_n_trees
[i
].signed_type
);
9616 return make_unsigned_type (size
);
9618 return make_signed_type (size
);
9621 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9624 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9628 if (size
== SHORT_FRACT_TYPE_SIZE
)
9629 return unsignedp
? sat_unsigned_short_fract_type_node
9630 : sat_short_fract_type_node
;
9631 if (size
== FRACT_TYPE_SIZE
)
9632 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9633 if (size
== LONG_FRACT_TYPE_SIZE
)
9634 return unsignedp
? sat_unsigned_long_fract_type_node
9635 : sat_long_fract_type_node
;
9636 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9637 return unsignedp
? sat_unsigned_long_long_fract_type_node
9638 : sat_long_long_fract_type_node
;
9642 if (size
== SHORT_FRACT_TYPE_SIZE
)
9643 return unsignedp
? unsigned_short_fract_type_node
9644 : short_fract_type_node
;
9645 if (size
== FRACT_TYPE_SIZE
)
9646 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9647 if (size
== LONG_FRACT_TYPE_SIZE
)
9648 return unsignedp
? unsigned_long_fract_type_node
9649 : long_fract_type_node
;
9650 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9651 return unsignedp
? unsigned_long_long_fract_type_node
9652 : long_long_fract_type_node
;
9655 return make_fract_type (size
, unsignedp
, satp
);
9658 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9661 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9665 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9666 return unsignedp
? sat_unsigned_short_accum_type_node
9667 : sat_short_accum_type_node
;
9668 if (size
== ACCUM_TYPE_SIZE
)
9669 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9670 if (size
== LONG_ACCUM_TYPE_SIZE
)
9671 return unsignedp
? sat_unsigned_long_accum_type_node
9672 : sat_long_accum_type_node
;
9673 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9674 return unsignedp
? sat_unsigned_long_long_accum_type_node
9675 : sat_long_long_accum_type_node
;
9679 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9680 return unsignedp
? unsigned_short_accum_type_node
9681 : short_accum_type_node
;
9682 if (size
== ACCUM_TYPE_SIZE
)
9683 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9684 if (size
== LONG_ACCUM_TYPE_SIZE
)
9685 return unsignedp
? unsigned_long_accum_type_node
9686 : long_accum_type_node
;
9687 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9688 return unsignedp
? unsigned_long_long_accum_type_node
9689 : long_long_accum_type_node
;
9692 return make_accum_type (size
, unsignedp
, satp
);
9696 /* Create an atomic variant node for TYPE. This routine is called
9697 during initialization of data types to create the 5 basic atomic
9698 types. The generic build_variant_type function requires these to
9699 already be set up in order to function properly, so cannot be
9700 called from there. If ALIGN is non-zero, then ensure alignment is
9701 overridden to this value. */
9704 build_atomic_base (tree type
, unsigned int align
)
9708 /* Make sure its not already registered. */
9709 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9712 t
= build_variant_type_copy (type
);
9713 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9716 TYPE_ALIGN (t
) = align
;
9721 /* Create nodes for all integer types (and error_mark_node) using the sizes
9722 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9723 SHORT_DOUBLE specifies whether double should be of the same precision
9727 build_common_tree_nodes (bool signed_char
, bool short_double
)
9731 error_mark_node
= make_node (ERROR_MARK
);
9732 TREE_TYPE (error_mark_node
) = error_mark_node
;
9734 initialize_sizetypes ();
9736 /* Define both `signed char' and `unsigned char'. */
9737 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9738 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9739 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9740 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9742 /* Define `char', which is like either `signed char' or `unsigned char'
9743 but not the same as either. */
9746 ? make_signed_type (CHAR_TYPE_SIZE
)
9747 : make_unsigned_type (CHAR_TYPE_SIZE
));
9748 TYPE_STRING_FLAG (char_type_node
) = 1;
9750 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9751 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9752 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9753 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9754 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9755 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9756 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9757 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9759 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9761 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9762 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9763 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9764 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9766 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9767 && int_n_enabled_p
[i
])
9769 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9770 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9774 /* Define a boolean type. This type only represents boolean values but
9775 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9776 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9777 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9778 TYPE_PRECISION (boolean_type_node
) = 1;
9779 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9781 /* Define what type to use for size_t. */
9782 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9783 size_type_node
= unsigned_type_node
;
9784 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9785 size_type_node
= long_unsigned_type_node
;
9786 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9787 size_type_node
= long_long_unsigned_type_node
;
9788 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9789 size_type_node
= short_unsigned_type_node
;
9794 size_type_node
= NULL_TREE
;
9795 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9796 if (int_n_enabled_p
[i
])
9799 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9801 if (strcmp (name
, SIZE_TYPE
) == 0)
9803 size_type_node
= int_n_trees
[i
].unsigned_type
;
9806 if (size_type_node
== NULL_TREE
)
9810 /* Fill in the rest of the sized types. Reuse existing type nodes
9812 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9813 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9814 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9815 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9816 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9818 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9819 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9820 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9821 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9822 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9824 /* Don't call build_qualified type for atomics. That routine does
9825 special processing for atomics, and until they are initialized
9826 it's better not to make that call.
9828 Check to see if there is a target override for atomic types. */
9830 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9831 targetm
.atomic_align_for_mode (QImode
));
9832 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9833 targetm
.atomic_align_for_mode (HImode
));
9834 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9835 targetm
.atomic_align_for_mode (SImode
));
9836 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9837 targetm
.atomic_align_for_mode (DImode
));
9838 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9839 targetm
.atomic_align_for_mode (TImode
));
9841 access_public_node
= get_identifier ("public");
9842 access_protected_node
= get_identifier ("protected");
9843 access_private_node
= get_identifier ("private");
9845 /* Define these next since types below may used them. */
9846 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9847 integer_one_node
= build_int_cst (integer_type_node
, 1);
9848 integer_three_node
= build_int_cst (integer_type_node
, 3);
9849 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9851 size_zero_node
= size_int (0);
9852 size_one_node
= size_int (1);
9853 bitsize_zero_node
= bitsize_int (0);
9854 bitsize_one_node
= bitsize_int (1);
9855 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9857 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9858 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9860 void_type_node
= make_node (VOID_TYPE
);
9861 layout_type (void_type_node
);
9863 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9865 /* We are not going to have real types in C with less than byte alignment,
9866 so we might as well not have any types that claim to have it. */
9867 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9868 TYPE_USER_ALIGN (void_type_node
) = 0;
9870 void_node
= make_node (VOID_CST
);
9871 TREE_TYPE (void_node
) = void_type_node
;
9873 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9874 layout_type (TREE_TYPE (null_pointer_node
));
9876 ptr_type_node
= build_pointer_type (void_type_node
);
9878 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9879 fileptr_type_node
= ptr_type_node
;
9881 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9883 float_type_node
= make_node (REAL_TYPE
);
9884 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9885 layout_type (float_type_node
);
9887 double_type_node
= make_node (REAL_TYPE
);
9889 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9891 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9892 layout_type (double_type_node
);
9894 long_double_type_node
= make_node (REAL_TYPE
);
9895 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9896 layout_type (long_double_type_node
);
9898 float_ptr_type_node
= build_pointer_type (float_type_node
);
9899 double_ptr_type_node
= build_pointer_type (double_type_node
);
9900 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9901 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9903 /* Fixed size integer types. */
9904 uint16_type_node
= make_or_reuse_type (16, 1);
9905 uint32_type_node
= make_or_reuse_type (32, 1);
9906 uint64_type_node
= make_or_reuse_type (64, 1);
9908 /* Decimal float types. */
9909 dfloat32_type_node
= make_node (REAL_TYPE
);
9910 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9911 layout_type (dfloat32_type_node
);
9912 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9913 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9915 dfloat64_type_node
= make_node (REAL_TYPE
);
9916 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9917 layout_type (dfloat64_type_node
);
9918 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9919 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9921 dfloat128_type_node
= make_node (REAL_TYPE
);
9922 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9923 layout_type (dfloat128_type_node
);
9924 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9925 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9927 complex_integer_type_node
= build_complex_type (integer_type_node
);
9928 complex_float_type_node
= build_complex_type (float_type_node
);
9929 complex_double_type_node
= build_complex_type (double_type_node
);
9930 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9932 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9933 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9934 sat_ ## KIND ## _type_node = \
9935 make_sat_signed_ ## KIND ## _type (SIZE); \
9936 sat_unsigned_ ## KIND ## _type_node = \
9937 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9938 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9939 unsigned_ ## KIND ## _type_node = \
9940 make_unsigned_ ## KIND ## _type (SIZE);
9942 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9943 sat_ ## WIDTH ## KIND ## _type_node = \
9944 make_sat_signed_ ## KIND ## _type (SIZE); \
9945 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9946 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9947 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9948 unsigned_ ## WIDTH ## KIND ## _type_node = \
9949 make_unsigned_ ## KIND ## _type (SIZE);
9951 /* Make fixed-point type nodes based on four different widths. */
9952 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9953 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9954 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9955 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9956 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9958 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9959 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9960 NAME ## _type_node = \
9961 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9962 u ## NAME ## _type_node = \
9963 make_or_reuse_unsigned_ ## KIND ## _type \
9964 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9965 sat_ ## NAME ## _type_node = \
9966 make_or_reuse_sat_signed_ ## KIND ## _type \
9967 (GET_MODE_BITSIZE (MODE ## mode)); \
9968 sat_u ## NAME ## _type_node = \
9969 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9970 (GET_MODE_BITSIZE (U ## MODE ## mode));
9972 /* Fixed-point type and mode nodes. */
9973 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9974 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9975 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9976 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9977 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9978 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9979 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9980 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9981 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9982 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9983 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9986 tree t
= targetm
.build_builtin_va_list ();
9988 /* Many back-ends define record types without setting TYPE_NAME.
9989 If we copied the record type here, we'd keep the original
9990 record type without a name. This breaks name mangling. So,
9991 don't copy record types and let c_common_nodes_and_builtins()
9992 declare the type to be __builtin_va_list. */
9993 if (TREE_CODE (t
) != RECORD_TYPE
)
9994 t
= build_variant_type_copy (t
);
9996 va_list_type_node
= t
;
10000 /* Modify DECL for given flags.
10001 TM_PURE attribute is set only on types, so the function will modify
10002 DECL's type when ECF_TM_PURE is used. */
10005 set_call_expr_flags (tree decl
, int flags
)
10007 if (flags
& ECF_NOTHROW
)
10008 TREE_NOTHROW (decl
) = 1;
10009 if (flags
& ECF_CONST
)
10010 TREE_READONLY (decl
) = 1;
10011 if (flags
& ECF_PURE
)
10012 DECL_PURE_P (decl
) = 1;
10013 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10014 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10015 if (flags
& ECF_NOVOPS
)
10016 DECL_IS_NOVOPS (decl
) = 1;
10017 if (flags
& ECF_NORETURN
)
10018 TREE_THIS_VOLATILE (decl
) = 1;
10019 if (flags
& ECF_MALLOC
)
10020 DECL_IS_MALLOC (decl
) = 1;
10021 if (flags
& ECF_RETURNS_TWICE
)
10022 DECL_IS_RETURNS_TWICE (decl
) = 1;
10023 if (flags
& ECF_LEAF
)
10024 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10025 NULL
, DECL_ATTRIBUTES (decl
));
10026 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10027 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10028 /* Looping const or pure is implied by noreturn.
10029 There is currently no way to declare looping const or looping pure alone. */
10030 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10031 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10035 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10038 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10039 const char *library_name
, int ecf_flags
)
10043 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10044 library_name
, NULL_TREE
);
10045 set_call_expr_flags (decl
, ecf_flags
);
10047 set_builtin_decl (code
, decl
, true);
10050 /* Call this function after instantiating all builtins that the language
10051 front end cares about. This will build the rest of the builtins
10052 and internal functions that are relied upon by the tree optimizers and
10056 build_common_builtin_nodes (void)
10061 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10063 ftype
= build_function_type (void_type_node
, void_list_node
);
10064 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
10065 "__builtin_unreachable",
10066 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10070 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10071 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10073 ftype
= build_function_type_list (ptr_type_node
,
10074 ptr_type_node
, const_ptr_type_node
,
10075 size_type_node
, NULL_TREE
);
10077 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10078 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10079 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
10080 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10081 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10082 "memmove", ECF_NOTHROW
| ECF_LEAF
);
10085 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10087 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10088 const_ptr_type_node
, size_type_node
,
10090 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10091 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10094 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10096 ftype
= build_function_type_list (ptr_type_node
,
10097 ptr_type_node
, integer_type_node
,
10098 size_type_node
, NULL_TREE
);
10099 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10100 "memset", ECF_NOTHROW
| ECF_LEAF
);
10103 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10105 ftype
= build_function_type_list (ptr_type_node
,
10106 size_type_node
, NULL_TREE
);
10107 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10108 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10111 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10112 size_type_node
, NULL_TREE
);
10113 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10114 BUILT_IN_ALLOCA_WITH_ALIGN
,
10115 "__builtin_alloca_with_align",
10116 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10118 /* If we're checking the stack, `alloca' can throw. */
10119 if (flag_stack_check
)
10121 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10122 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10125 ftype
= build_function_type_list (void_type_node
,
10126 ptr_type_node
, ptr_type_node
,
10127 ptr_type_node
, NULL_TREE
);
10128 local_define_builtin ("__builtin_init_trampoline", ftype
,
10129 BUILT_IN_INIT_TRAMPOLINE
,
10130 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10131 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10132 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10133 "__builtin_init_heap_trampoline",
10134 ECF_NOTHROW
| ECF_LEAF
);
10136 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10137 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10138 BUILT_IN_ADJUST_TRAMPOLINE
,
10139 "__builtin_adjust_trampoline",
10140 ECF_CONST
| ECF_NOTHROW
);
10142 ftype
= build_function_type_list (void_type_node
,
10143 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10144 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10145 BUILT_IN_NONLOCAL_GOTO
,
10146 "__builtin_nonlocal_goto",
10147 ECF_NORETURN
| ECF_NOTHROW
);
10149 ftype
= build_function_type_list (void_type_node
,
10150 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10151 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10152 BUILT_IN_SETJMP_SETUP
,
10153 "__builtin_setjmp_setup", ECF_NOTHROW
);
10155 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10156 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10157 BUILT_IN_SETJMP_RECEIVER
,
10158 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10160 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10161 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10162 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10164 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10165 local_define_builtin ("__builtin_stack_restore", ftype
,
10166 BUILT_IN_STACK_RESTORE
,
10167 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10169 /* If there's a possibility that we might use the ARM EABI, build the
10170 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10171 if (targetm
.arm_eabi_unwinder
)
10173 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10174 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10175 BUILT_IN_CXA_END_CLEANUP
,
10176 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10179 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10180 local_define_builtin ("__builtin_unwind_resume", ftype
,
10181 BUILT_IN_UNWIND_RESUME
,
10182 ((targetm_common
.except_unwind_info (&global_options
)
10184 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10187 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10189 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10191 local_define_builtin ("__builtin_return_address", ftype
,
10192 BUILT_IN_RETURN_ADDRESS
,
10193 "__builtin_return_address",
10197 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10198 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10200 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10201 ptr_type_node
, NULL_TREE
);
10202 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10203 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10204 BUILT_IN_PROFILE_FUNC_ENTER
,
10205 "__cyg_profile_func_enter", 0);
10206 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10207 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10208 BUILT_IN_PROFILE_FUNC_EXIT
,
10209 "__cyg_profile_func_exit", 0);
10212 /* The exception object and filter values from the runtime. The argument
10213 must be zero before exception lowering, i.e. from the front end. After
10214 exception lowering, it will be the region number for the exception
10215 landing pad. These functions are PURE instead of CONST to prevent
10216 them from being hoisted past the exception edge that will initialize
10217 its value in the landing pad. */
10218 ftype
= build_function_type_list (ptr_type_node
,
10219 integer_type_node
, NULL_TREE
);
10220 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10221 /* Only use TM_PURE if we we have TM language support. */
10222 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10223 ecf_flags
|= ECF_TM_PURE
;
10224 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10225 "__builtin_eh_pointer", ecf_flags
);
10227 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10228 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10229 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10230 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10232 ftype
= build_function_type_list (void_type_node
,
10233 integer_type_node
, integer_type_node
,
10235 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10236 BUILT_IN_EH_COPY_VALUES
,
10237 "__builtin_eh_copy_values", ECF_NOTHROW
);
10239 /* Complex multiplication and division. These are handled as builtins
10240 rather than optabs because emit_library_call_value doesn't support
10241 complex. Further, we can do slightly better with folding these
10242 beasties if the real and complex parts of the arguments are separate. */
10246 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10248 char mode_name_buf
[4], *q
;
10250 enum built_in_function mcode
, dcode
;
10251 tree type
, inner_type
;
10252 const char *prefix
= "__";
10254 if (targetm
.libfunc_gnu_prefix
)
10257 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10260 inner_type
= TREE_TYPE (type
);
10262 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10263 inner_type
, inner_type
, NULL_TREE
);
10265 mcode
= ((enum built_in_function
)
10266 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10267 dcode
= ((enum built_in_function
)
10268 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10270 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10274 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10276 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10277 built_in_names
[mcode
],
10278 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10280 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10282 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10283 built_in_names
[dcode
],
10284 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10288 init_internal_fns ();
10291 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10294 If we requested a pointer to a vector, build up the pointers that
10295 we stripped off while looking for the inner type. Similarly for
10296 return values from functions.
10298 The argument TYPE is the top of the chain, and BOTTOM is the
10299 new type which we will point to. */
10302 reconstruct_complex_type (tree type
, tree bottom
)
10306 if (TREE_CODE (type
) == POINTER_TYPE
)
10308 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10309 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10310 TYPE_REF_CAN_ALIAS_ALL (type
));
10312 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10314 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10315 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10316 TYPE_REF_CAN_ALIAS_ALL (type
));
10318 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10320 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10321 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10323 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10325 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10326 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10328 else if (TREE_CODE (type
) == METHOD_TYPE
)
10330 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10331 /* The build_method_type_directly() routine prepends 'this' to argument list,
10332 so we must compensate by getting rid of it. */
10334 = build_method_type_directly
10335 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10337 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10339 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10341 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10342 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10347 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10348 TYPE_QUALS (type
));
10351 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10354 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10358 switch (GET_MODE_CLASS (mode
))
10360 case MODE_VECTOR_INT
:
10361 case MODE_VECTOR_FLOAT
:
10362 case MODE_VECTOR_FRACT
:
10363 case MODE_VECTOR_UFRACT
:
10364 case MODE_VECTOR_ACCUM
:
10365 case MODE_VECTOR_UACCUM
:
10366 nunits
= GET_MODE_NUNITS (mode
);
10370 /* Check that there are no leftover bits. */
10371 gcc_assert (GET_MODE_BITSIZE (mode
)
10372 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10374 nunits
= GET_MODE_BITSIZE (mode
)
10375 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10379 gcc_unreachable ();
10382 return make_vector_type (innertype
, nunits
, mode
);
10385 /* Similarly, but takes the inner type and number of units, which must be
10389 build_vector_type (tree innertype
, int nunits
)
10391 return make_vector_type (innertype
, nunits
, VOIDmode
);
10394 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10397 build_opaque_vector_type (tree innertype
, int nunits
)
10399 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10401 /* We always build the non-opaque variant before the opaque one,
10402 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10403 cand
= TYPE_NEXT_VARIANT (t
);
10405 && TYPE_VECTOR_OPAQUE (cand
)
10406 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10408 /* Othewise build a variant type and make sure to queue it after
10409 the non-opaque type. */
10410 cand
= build_distinct_type_copy (t
);
10411 TYPE_VECTOR_OPAQUE (cand
) = true;
10412 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10413 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10414 TYPE_NEXT_VARIANT (t
) = cand
;
10415 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10420 /* Given an initializer INIT, return TRUE if INIT is zero or some
10421 aggregate of zeros. Otherwise return FALSE. */
10423 initializer_zerop (const_tree init
)
10429 switch (TREE_CODE (init
))
10432 return integer_zerop (init
);
10435 /* ??? Note that this is not correct for C4X float formats. There,
10436 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10437 negative exponent. */
10438 return real_zerop (init
)
10439 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10442 return fixed_zerop (init
);
10445 return integer_zerop (init
)
10446 || (real_zerop (init
)
10447 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10448 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10453 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10454 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10461 unsigned HOST_WIDE_INT idx
;
10463 if (TREE_CLOBBER_P (init
))
10465 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10466 if (!initializer_zerop (elt
))
10475 /* We need to loop through all elements to handle cases like
10476 "\0" and "\0foobar". */
10477 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10478 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10489 /* Check if vector VEC consists of all the equal elements and
10490 that the number of elements corresponds to the type of VEC.
10491 The function returns first element of the vector
10492 or NULL_TREE if the vector is not uniform. */
10494 uniform_vector_p (const_tree vec
)
10499 if (vec
== NULL_TREE
)
10502 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10504 if (TREE_CODE (vec
) == VECTOR_CST
)
10506 first
= VECTOR_CST_ELT (vec
, 0);
10507 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10508 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10514 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10516 first
= error_mark_node
;
10518 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10525 if (!operand_equal_p (first
, t
, 0))
10528 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10537 /* Build an empty statement at location LOC. */
10540 build_empty_stmt (location_t loc
)
10542 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10543 SET_EXPR_LOCATION (t
, loc
);
10548 /* Build an OpenMP clause with code CODE. LOC is the location of the
10552 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10557 length
= omp_clause_num_ops
[code
];
10558 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10560 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10562 t
= (tree
) ggc_internal_alloc (size
);
10563 memset (t
, 0, size
);
10564 TREE_SET_CODE (t
, OMP_CLAUSE
);
10565 OMP_CLAUSE_SET_CODE (t
, code
);
10566 OMP_CLAUSE_LOCATION (t
) = loc
;
10571 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10572 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10573 Except for the CODE and operand count field, other storage for the
10574 object is initialized to zeros. */
10577 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10580 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10582 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10583 gcc_assert (len
>= 1);
10585 record_node_allocation_statistics (code
, length
);
10587 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10589 TREE_SET_CODE (t
, code
);
10591 /* Can't use TREE_OPERAND to store the length because if checking is
10592 enabled, it will try to check the length before we store it. :-P */
10593 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10598 /* Helper function for build_call_* functions; build a CALL_EXPR with
10599 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10600 the argument slots. */
10603 build_call_1 (tree return_type
, tree fn
, int nargs
)
10607 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10608 TREE_TYPE (t
) = return_type
;
10609 CALL_EXPR_FN (t
) = fn
;
10610 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10615 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10616 FN and a null static chain slot. NARGS is the number of call arguments
10617 which are specified as "..." arguments. */
10620 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10624 va_start (args
, nargs
);
10625 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10630 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10631 FN and a null static chain slot. NARGS is the number of call arguments
10632 which are specified as a va_list ARGS. */
10635 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10640 t
= build_call_1 (return_type
, fn
, nargs
);
10641 for (i
= 0; i
< nargs
; i
++)
10642 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10643 process_call_operands (t
);
10647 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10648 FN and a null static chain slot. NARGS is the number of call arguments
10649 which are specified as a tree array ARGS. */
10652 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10653 int nargs
, const tree
*args
)
10658 t
= build_call_1 (return_type
, fn
, nargs
);
10659 for (i
= 0; i
< nargs
; i
++)
10660 CALL_EXPR_ARG (t
, i
) = args
[i
];
10661 process_call_operands (t
);
10662 SET_EXPR_LOCATION (t
, loc
);
10666 /* Like build_call_array, but takes a vec. */
10669 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10674 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10675 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10676 CALL_EXPR_ARG (ret
, ix
) = t
;
10677 process_call_operands (ret
);
10681 /* Conveniently construct a function call expression. FNDECL names the
10682 function to be called and N arguments are passed in the array
10686 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10688 tree fntype
= TREE_TYPE (fndecl
);
10689 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10691 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10694 /* Conveniently construct a function call expression. FNDECL names the
10695 function to be called and the arguments are passed in the vector
10699 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10701 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10702 vec_safe_address (vec
));
10706 /* Conveniently construct a function call expression. FNDECL names the
10707 function to be called, N is the number of arguments, and the "..."
10708 parameters are the argument expressions. */
10711 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10714 tree
*argarray
= XALLOCAVEC (tree
, n
);
10718 for (i
= 0; i
< n
; i
++)
10719 argarray
[i
] = va_arg (ap
, tree
);
10721 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10724 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10725 varargs macros aren't supported by all bootstrap compilers. */
10728 build_call_expr (tree fndecl
, int n
, ...)
10731 tree
*argarray
= XALLOCAVEC (tree
, n
);
10735 for (i
= 0; i
< n
; i
++)
10736 argarray
[i
] = va_arg (ap
, tree
);
10738 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10741 /* Build internal call expression. This is just like CALL_EXPR, except
10742 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10743 internal function. */
10746 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10747 tree type
, int n
, ...)
10752 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10754 for (i
= 0; i
< n
; i
++)
10755 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10757 SET_EXPR_LOCATION (fn
, loc
);
10758 CALL_EXPR_IFN (fn
) = ifn
;
10762 /* Create a new constant string literal and return a char* pointer to it.
10763 The STRING_CST value is the LEN characters at STR. */
10765 build_string_literal (int len
, const char *str
)
10767 tree t
, elem
, index
, type
;
10769 t
= build_string (len
, str
);
10770 elem
= build_type_variant (char_type_node
, 1, 0);
10771 index
= build_index_type (size_int (len
- 1));
10772 type
= build_array_type (elem
, index
);
10773 TREE_TYPE (t
) = type
;
10774 TREE_CONSTANT (t
) = 1;
10775 TREE_READONLY (t
) = 1;
10776 TREE_STATIC (t
) = 1;
10778 type
= build_pointer_type (elem
);
10779 t
= build1 (ADDR_EXPR
, type
,
10780 build4 (ARRAY_REF
, elem
,
10781 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10787 /* Return true if T (assumed to be a DECL) must be assigned a memory
10791 needs_to_live_in_memory (const_tree t
)
10793 return (TREE_ADDRESSABLE (t
)
10794 || is_global_var (t
)
10795 || (TREE_CODE (t
) == RESULT_DECL
10796 && !DECL_BY_REFERENCE (t
)
10797 && aggregate_value_p (t
, current_function_decl
)));
10800 /* Return value of a constant X and sign-extend it. */
10803 int_cst_value (const_tree x
)
10805 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10806 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10808 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10809 gcc_assert (cst_and_fits_in_hwi (x
));
10811 if (bits
< HOST_BITS_PER_WIDE_INT
)
10813 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10815 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10817 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10823 /* If TYPE is an integral or pointer type, return an integer type with
10824 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10825 if TYPE is already an integer type of signedness UNSIGNEDP. */
10828 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10830 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10833 if (TREE_CODE (type
) == VECTOR_TYPE
)
10835 tree inner
= TREE_TYPE (type
);
10836 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10839 if (inner
== inner2
)
10841 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10844 if (!INTEGRAL_TYPE_P (type
)
10845 && !POINTER_TYPE_P (type
)
10846 && TREE_CODE (type
) != OFFSET_TYPE
)
10849 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10852 /* If TYPE is an integral or pointer type, return an integer type with
10853 the same precision which is unsigned, or itself if TYPE is already an
10854 unsigned integer type. */
10857 unsigned_type_for (tree type
)
10859 return signed_or_unsigned_type_for (1, type
);
10862 /* If TYPE is an integral or pointer type, return an integer type with
10863 the same precision which is signed, or itself if TYPE is already a
10864 signed integer type. */
10867 signed_type_for (tree type
)
10869 return signed_or_unsigned_type_for (0, type
);
10872 /* If TYPE is a vector type, return a signed integer vector type with the
10873 same width and number of subparts. Otherwise return boolean_type_node. */
10876 truth_type_for (tree type
)
10878 if (TREE_CODE (type
) == VECTOR_TYPE
)
10880 tree elem
= lang_hooks
.types
.type_for_size
10881 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10882 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10885 return boolean_type_node
;
10888 /* Returns the largest value obtainable by casting something in INNER type to
10892 upper_bound_in_type (tree outer
, tree inner
)
10894 unsigned int det
= 0;
10895 unsigned oprec
= TYPE_PRECISION (outer
);
10896 unsigned iprec
= TYPE_PRECISION (inner
);
10899 /* Compute a unique number for every combination. */
10900 det
|= (oprec
> iprec
) ? 4 : 0;
10901 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10902 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10904 /* Determine the exponent to use. */
10909 /* oprec <= iprec, outer: signed, inner: don't care. */
10914 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10918 /* oprec > iprec, outer: signed, inner: signed. */
10922 /* oprec > iprec, outer: signed, inner: unsigned. */
10926 /* oprec > iprec, outer: unsigned, inner: signed. */
10930 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10934 gcc_unreachable ();
10937 return wide_int_to_tree (outer
,
10938 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10941 /* Returns the smallest value obtainable by casting something in INNER type to
10945 lower_bound_in_type (tree outer
, tree inner
)
10947 unsigned oprec
= TYPE_PRECISION (outer
);
10948 unsigned iprec
= TYPE_PRECISION (inner
);
10950 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10952 if (TYPE_UNSIGNED (outer
)
10953 /* If we are widening something of an unsigned type, OUTER type
10954 contains all values of INNER type. In particular, both INNER
10955 and OUTER types have zero in common. */
10956 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10957 return build_int_cst (outer
, 0);
10960 /* If we are widening a signed type to another signed type, we
10961 want to obtain -2^^(iprec-1). If we are keeping the
10962 precision or narrowing to a signed type, we want to obtain
10964 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10965 return wide_int_to_tree (outer
,
10966 wi::mask (prec
- 1, true,
10967 TYPE_PRECISION (outer
)));
10971 /* Return nonzero if two operands that are suitable for PHI nodes are
10972 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10973 SSA_NAME or invariant. Note that this is strictly an optimization.
10974 That is, callers of this function can directly call operand_equal_p
10975 and get the same result, only slower. */
10978 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10982 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10984 return operand_equal_p (arg0
, arg1
, 0);
10987 /* Returns number of zeros at the end of binary representation of X. */
10990 num_ending_zeros (const_tree x
)
10992 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10996 #define WALK_SUBTREE(NODE) \
10999 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11005 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11006 be walked whenever a type is seen in the tree. Rest of operands and return
11007 value are as for walk_tree. */
11010 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11011 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11013 tree result
= NULL_TREE
;
11015 switch (TREE_CODE (type
))
11018 case REFERENCE_TYPE
:
11020 /* We have to worry about mutually recursive pointers. These can't
11021 be written in C. They can in Ada. It's pathological, but
11022 there's an ACATS test (c38102a) that checks it. Deal with this
11023 by checking if we're pointing to another pointer, that one
11024 points to another pointer, that one does too, and we have no htab.
11025 If so, get a hash table. We check three levels deep to avoid
11026 the cost of the hash table if we don't need one. */
11027 if (POINTER_TYPE_P (TREE_TYPE (type
))
11028 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11029 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11032 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11040 /* ... fall through ... */
11043 WALK_SUBTREE (TREE_TYPE (type
));
11047 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11049 /* Fall through. */
11051 case FUNCTION_TYPE
:
11052 WALK_SUBTREE (TREE_TYPE (type
));
11056 /* We never want to walk into default arguments. */
11057 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11058 WALK_SUBTREE (TREE_VALUE (arg
));
11063 /* Don't follow this nodes's type if a pointer for fear that
11064 we'll have infinite recursion. If we have a PSET, then we
11067 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11068 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11069 WALK_SUBTREE (TREE_TYPE (type
));
11070 WALK_SUBTREE (TYPE_DOMAIN (type
));
11074 WALK_SUBTREE (TREE_TYPE (type
));
11075 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11085 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11086 called with the DATA and the address of each sub-tree. If FUNC returns a
11087 non-NULL value, the traversal is stopped, and the value returned by FUNC
11088 is returned. If PSET is non-NULL it is used to record the nodes visited,
11089 and to avoid visiting a node more than once. */
11092 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11093 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11095 enum tree_code code
;
11099 #define WALK_SUBTREE_TAIL(NODE) \
11103 goto tail_recurse; \
11108 /* Skip empty subtrees. */
11112 /* Don't walk the same tree twice, if the user has requested
11113 that we avoid doing so. */
11114 if (pset
&& pset
->add (*tp
))
11117 /* Call the function. */
11119 result
= (*func
) (tp
, &walk_subtrees
, data
);
11121 /* If we found something, return it. */
11125 code
= TREE_CODE (*tp
);
11127 /* Even if we didn't, FUNC may have decided that there was nothing
11128 interesting below this point in the tree. */
11129 if (!walk_subtrees
)
11131 /* But we still need to check our siblings. */
11132 if (code
== TREE_LIST
)
11133 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11134 else if (code
== OMP_CLAUSE
)
11135 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11142 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11143 if (result
|| !walk_subtrees
)
11150 case IDENTIFIER_NODE
:
11157 case PLACEHOLDER_EXPR
:
11161 /* None of these have subtrees other than those already walked
11166 WALK_SUBTREE (TREE_VALUE (*tp
));
11167 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11172 int len
= TREE_VEC_LENGTH (*tp
);
11177 /* Walk all elements but the first. */
11179 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11181 /* Now walk the first one as a tail call. */
11182 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11186 WALK_SUBTREE (TREE_REALPART (*tp
));
11187 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11191 unsigned HOST_WIDE_INT idx
;
11192 constructor_elt
*ce
;
11194 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11196 WALK_SUBTREE (ce
->value
);
11201 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11206 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11208 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11209 into declarations that are just mentioned, rather than
11210 declared; they don't really belong to this part of the tree.
11211 And, we can see cycles: the initializer for a declaration
11212 can refer to the declaration itself. */
11213 WALK_SUBTREE (DECL_INITIAL (decl
));
11214 WALK_SUBTREE (DECL_SIZE (decl
));
11215 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11217 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11220 case STATEMENT_LIST
:
11222 tree_stmt_iterator i
;
11223 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11224 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11229 switch (OMP_CLAUSE_CODE (*tp
))
11231 case OMP_CLAUSE_GANG
:
11232 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11235 case OMP_CLAUSE_DEVICE_RESIDENT
:
11236 case OMP_CLAUSE_USE_DEVICE
:
11237 case OMP_CLAUSE_ASYNC
:
11238 case OMP_CLAUSE_WAIT
:
11239 case OMP_CLAUSE_WORKER
:
11240 case OMP_CLAUSE_VECTOR
:
11241 case OMP_CLAUSE_NUM_GANGS
:
11242 case OMP_CLAUSE_NUM_WORKERS
:
11243 case OMP_CLAUSE_VECTOR_LENGTH
:
11244 case OMP_CLAUSE_PRIVATE
:
11245 case OMP_CLAUSE_SHARED
:
11246 case OMP_CLAUSE_FIRSTPRIVATE
:
11247 case OMP_CLAUSE_COPYIN
:
11248 case OMP_CLAUSE_COPYPRIVATE
:
11249 case OMP_CLAUSE_FINAL
:
11250 case OMP_CLAUSE_IF
:
11251 case OMP_CLAUSE_NUM_THREADS
:
11252 case OMP_CLAUSE_SCHEDULE
:
11253 case OMP_CLAUSE_UNIFORM
:
11254 case OMP_CLAUSE_DEPEND
:
11255 case OMP_CLAUSE_NUM_TEAMS
:
11256 case OMP_CLAUSE_THREAD_LIMIT
:
11257 case OMP_CLAUSE_DEVICE
:
11258 case OMP_CLAUSE_DIST_SCHEDULE
:
11259 case OMP_CLAUSE_SAFELEN
:
11260 case OMP_CLAUSE_SIMDLEN
:
11261 case OMP_CLAUSE__LOOPTEMP_
:
11262 case OMP_CLAUSE__SIMDUID_
:
11263 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11264 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11267 case OMP_CLAUSE_INDEPENDENT
:
11268 case OMP_CLAUSE_NOWAIT
:
11269 case OMP_CLAUSE_ORDERED
:
11270 case OMP_CLAUSE_DEFAULT
:
11271 case OMP_CLAUSE_UNTIED
:
11272 case OMP_CLAUSE_MERGEABLE
:
11273 case OMP_CLAUSE_PROC_BIND
:
11274 case OMP_CLAUSE_INBRANCH
:
11275 case OMP_CLAUSE_NOTINBRANCH
:
11276 case OMP_CLAUSE_FOR
:
11277 case OMP_CLAUSE_PARALLEL
:
11278 case OMP_CLAUSE_SECTIONS
:
11279 case OMP_CLAUSE_TASKGROUP
:
11280 case OMP_CLAUSE_AUTO
:
11281 case OMP_CLAUSE_SEQ
:
11282 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11284 case OMP_CLAUSE_LASTPRIVATE
:
11285 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11286 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11287 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11289 case OMP_CLAUSE_COLLAPSE
:
11292 for (i
= 0; i
< 3; i
++)
11293 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11294 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11297 case OMP_CLAUSE_LINEAR
:
11298 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11299 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11300 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11301 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11303 case OMP_CLAUSE_ALIGNED
:
11304 case OMP_CLAUSE_FROM
:
11305 case OMP_CLAUSE_TO
:
11306 case OMP_CLAUSE_MAP
:
11307 case OMP_CLAUSE__CACHE_
:
11308 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11309 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11310 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11312 case OMP_CLAUSE_REDUCTION
:
11315 for (i
= 0; i
< 4; i
++)
11316 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11317 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11321 gcc_unreachable ();
11329 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11330 But, we only want to walk once. */
11331 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11332 for (i
= 0; i
< len
; ++i
)
11333 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11334 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11338 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11339 defining. We only want to walk into these fields of a type in this
11340 case and not in the general case of a mere reference to the type.
11342 The criterion is as follows: if the field can be an expression, it
11343 must be walked only here. This should be in keeping with the fields
11344 that are directly gimplified in gimplify_type_sizes in order for the
11345 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11346 variable-sized types.
11348 Note that DECLs get walked as part of processing the BIND_EXPR. */
11349 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11351 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11352 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11355 /* Call the function for the type. See if it returns anything or
11356 doesn't want us to continue. If we are to continue, walk both
11357 the normal fields and those for the declaration case. */
11358 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11359 if (result
|| !walk_subtrees
)
11362 /* But do not walk a pointed-to type since it may itself need to
11363 be walked in the declaration case if it isn't anonymous. */
11364 if (!POINTER_TYPE_P (*type_p
))
11366 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11371 /* If this is a record type, also walk the fields. */
11372 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11376 for (field
= TYPE_FIELDS (*type_p
); field
;
11377 field
= DECL_CHAIN (field
))
11379 /* We'd like to look at the type of the field, but we can
11380 easily get infinite recursion. So assume it's pointed
11381 to elsewhere in the tree. Also, ignore things that
11383 if (TREE_CODE (field
) != FIELD_DECL
)
11386 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11387 WALK_SUBTREE (DECL_SIZE (field
));
11388 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11389 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11390 WALK_SUBTREE (DECL_QUALIFIER (field
));
11394 /* Same for scalar types. */
11395 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11396 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11397 || TREE_CODE (*type_p
) == INTEGER_TYPE
11398 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11399 || TREE_CODE (*type_p
) == REAL_TYPE
)
11401 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11402 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11405 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11406 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11411 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11415 /* Walk over all the sub-trees of this operand. */
11416 len
= TREE_OPERAND_LENGTH (*tp
);
11418 /* Go through the subtrees. We need to do this in forward order so
11419 that the scope of a FOR_EXPR is handled properly. */
11422 for (i
= 0; i
< len
- 1; ++i
)
11423 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11424 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11427 /* If this is a type, walk the needed fields in the type. */
11428 else if (TYPE_P (*tp
))
11429 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11433 /* We didn't find what we were looking for. */
11436 #undef WALK_SUBTREE_TAIL
11438 #undef WALK_SUBTREE
11440 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11443 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11448 hash_set
<tree
> pset
;
11449 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11455 tree_block (tree t
)
11457 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11459 if (IS_EXPR_CODE_CLASS (c
))
11460 return LOCATION_BLOCK (t
->exp
.locus
);
11461 gcc_unreachable ();
11466 tree_set_block (tree t
, tree b
)
11468 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11470 if (IS_EXPR_CODE_CLASS (c
))
11473 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11475 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11478 gcc_unreachable ();
11481 /* Create a nameless artificial label and put it in the current
11482 function context. The label has a location of LOC. Returns the
11483 newly created label. */
11486 create_artificial_label (location_t loc
)
11488 tree lab
= build_decl (loc
,
11489 LABEL_DECL
, NULL_TREE
, void_type_node
);
11491 DECL_ARTIFICIAL (lab
) = 1;
11492 DECL_IGNORED_P (lab
) = 1;
11493 DECL_CONTEXT (lab
) = current_function_decl
;
11497 /* Given a tree, try to return a useful variable name that we can use
11498 to prefix a temporary that is being assigned the value of the tree.
11499 I.E. given <temp> = &A, return A. */
11504 tree stripped_decl
;
11507 STRIP_NOPS (stripped_decl
);
11508 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11509 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11510 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11512 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11515 return IDENTIFIER_POINTER (name
);
11519 switch (TREE_CODE (stripped_decl
))
11522 return get_name (TREE_OPERAND (stripped_decl
, 0));
11529 /* Return true if TYPE has a variable argument list. */
11532 stdarg_p (const_tree fntype
)
11534 function_args_iterator args_iter
;
11535 tree n
= NULL_TREE
, t
;
11540 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11545 return n
!= NULL_TREE
&& n
!= void_type_node
;
11548 /* Return true if TYPE has a prototype. */
11551 prototype_p (tree fntype
)
11555 gcc_assert (fntype
!= NULL_TREE
);
11557 t
= TYPE_ARG_TYPES (fntype
);
11558 return (t
!= NULL_TREE
);
11561 /* If BLOCK is inlined from an __attribute__((__artificial__))
11562 routine, return pointer to location from where it has been
11565 block_nonartificial_location (tree block
)
11567 location_t
*ret
= NULL
;
11569 while (block
&& TREE_CODE (block
) == BLOCK
11570 && BLOCK_ABSTRACT_ORIGIN (block
))
11572 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11574 while (TREE_CODE (ao
) == BLOCK
11575 && BLOCK_ABSTRACT_ORIGIN (ao
)
11576 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11577 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11579 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11581 /* If AO is an artificial inline, point RET to the
11582 call site locus at which it has been inlined and continue
11583 the loop, in case AO's caller is also an artificial
11585 if (DECL_DECLARED_INLINE_P (ao
)
11586 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11587 ret
= &BLOCK_SOURCE_LOCATION (block
);
11591 else if (TREE_CODE (ao
) != BLOCK
)
11594 block
= BLOCK_SUPERCONTEXT (block
);
11600 /* If EXP is inlined from an __attribute__((__artificial__))
11601 function, return the location of the original call expression. */
11604 tree_nonartificial_location (tree exp
)
11606 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11611 return EXPR_LOCATION (exp
);
11615 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11618 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11621 cl_option_hasher::hash (tree x
)
11623 const_tree
const t
= x
;
11627 hashval_t hash
= 0;
11629 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11631 p
= (const char *)TREE_OPTIMIZATION (t
);
11632 len
= sizeof (struct cl_optimization
);
11635 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11636 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11639 gcc_unreachable ();
11641 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11643 for (i
= 0; i
< len
; i
++)
11645 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11650 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11651 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11655 cl_option_hasher::equal (tree x
, tree y
)
11657 const_tree
const xt
= x
;
11658 const_tree
const yt
= y
;
11663 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11666 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11668 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11669 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11670 len
= sizeof (struct cl_optimization
);
11673 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11675 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11676 TREE_TARGET_OPTION (yt
));
11680 gcc_unreachable ();
11682 return (memcmp (xp
, yp
, len
) == 0);
11685 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11688 build_optimization_node (struct gcc_options
*opts
)
11692 /* Use the cache of optimization nodes. */
11694 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11697 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11701 /* Insert this one into the hash table. */
11702 t
= cl_optimization_node
;
11705 /* Make a new node for next time round. */
11706 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11712 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11715 build_target_option_node (struct gcc_options
*opts
)
11719 /* Use the cache of optimization nodes. */
11721 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11724 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11728 /* Insert this one into the hash table. */
11729 t
= cl_target_option_node
;
11732 /* Make a new node for next time round. */
11733 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11739 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11740 so that they aren't saved during PCH writing. */
11743 prepare_target_option_nodes_for_pch (void)
11745 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11746 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11747 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11748 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11751 /* Determine the "ultimate origin" of a block. The block may be an inlined
11752 instance of an inlined instance of a block which is local to an inline
11753 function, so we have to trace all of the way back through the origin chain
11754 to find out what sort of node actually served as the original seed for the
11758 block_ultimate_origin (const_tree block
)
11760 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11762 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11763 we're trying to output the abstract instance of this function. */
11764 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11767 if (immediate_origin
== NULL_TREE
)
11772 tree lookahead
= immediate_origin
;
11776 ret_val
= lookahead
;
11777 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11778 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11780 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11782 /* The block's abstract origin chain may not be the *ultimate* origin of
11783 the block. It could lead to a DECL that has an abstract origin set.
11784 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11785 will give us if it has one). Note that DECL's abstract origins are
11786 supposed to be the most distant ancestor (or so decl_ultimate_origin
11787 claims), so we don't need to loop following the DECL origins. */
11788 if (DECL_P (ret_val
))
11789 return DECL_ORIGIN (ret_val
);
11795 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11799 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11801 /* Use precision rather then machine mode when we can, which gives
11802 the correct answer even for submode (bit-field) types. */
11803 if ((INTEGRAL_TYPE_P (outer_type
)
11804 || POINTER_TYPE_P (outer_type
)
11805 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11806 && (INTEGRAL_TYPE_P (inner_type
)
11807 || POINTER_TYPE_P (inner_type
)
11808 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11809 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11811 /* Otherwise fall back on comparing machine modes (e.g. for
11812 aggregate types, floats). */
11813 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11816 /* Return true iff conversion in EXP generates no instruction. Mark
11817 it inline so that we fully inline into the stripping functions even
11818 though we have two uses of this function. */
11821 tree_nop_conversion (const_tree exp
)
11823 tree outer_type
, inner_type
;
11825 if (!CONVERT_EXPR_P (exp
)
11826 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11828 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11831 outer_type
= TREE_TYPE (exp
);
11832 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11837 return tree_nop_conversion_p (outer_type
, inner_type
);
11840 /* Return true iff conversion in EXP generates no instruction. Don't
11841 consider conversions changing the signedness. */
11844 tree_sign_nop_conversion (const_tree exp
)
11846 tree outer_type
, inner_type
;
11848 if (!tree_nop_conversion (exp
))
11851 outer_type
= TREE_TYPE (exp
);
11852 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11854 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11855 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11858 /* Strip conversions from EXP according to tree_nop_conversion and
11859 return the resulting expression. */
11862 tree_strip_nop_conversions (tree exp
)
11864 while (tree_nop_conversion (exp
))
11865 exp
= TREE_OPERAND (exp
, 0);
11869 /* Strip conversions from EXP according to tree_sign_nop_conversion
11870 and return the resulting expression. */
11873 tree_strip_sign_nop_conversions (tree exp
)
11875 while (tree_sign_nop_conversion (exp
))
11876 exp
= TREE_OPERAND (exp
, 0);
11880 /* Avoid any floating point extensions from EXP. */
11882 strip_float_extensions (tree exp
)
11884 tree sub
, expt
, subt
;
11886 /* For floating point constant look up the narrowest type that can hold
11887 it properly and handle it like (type)(narrowest_type)constant.
11888 This way we can optimize for instance a=a*2.0 where "a" is float
11889 but 2.0 is double constant. */
11890 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11892 REAL_VALUE_TYPE orig
;
11895 orig
= TREE_REAL_CST (exp
);
11896 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11897 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11898 type
= float_type_node
;
11899 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11900 > TYPE_PRECISION (double_type_node
)
11901 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11902 type
= double_type_node
;
11904 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11907 if (!CONVERT_EXPR_P (exp
))
11910 sub
= TREE_OPERAND (exp
, 0);
11911 subt
= TREE_TYPE (sub
);
11912 expt
= TREE_TYPE (exp
);
11914 if (!FLOAT_TYPE_P (subt
))
11917 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11920 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11923 return strip_float_extensions (sub
);
11926 /* Strip out all handled components that produce invariant
11930 strip_invariant_refs (const_tree op
)
11932 while (handled_component_p (op
))
11934 switch (TREE_CODE (op
))
11937 case ARRAY_RANGE_REF
:
11938 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11939 || TREE_OPERAND (op
, 2) != NULL_TREE
11940 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11944 case COMPONENT_REF
:
11945 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11951 op
= TREE_OPERAND (op
, 0);
11957 static GTY(()) tree gcc_eh_personality_decl
;
11959 /* Return the GCC personality function decl. */
11962 lhd_gcc_personality (void)
11964 if (!gcc_eh_personality_decl
)
11965 gcc_eh_personality_decl
= build_personality_function ("gcc");
11966 return gcc_eh_personality_decl
;
11969 /* TARGET is a call target of GIMPLE call statement
11970 (obtained by gimple_call_fn). Return true if it is
11971 OBJ_TYPE_REF representing an virtual call of C++ method.
11972 (As opposed to OBJ_TYPE_REF representing objc calls
11973 through a cast where middle-end devirtualization machinery
11977 virtual_method_call_p (tree target
)
11979 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11981 tree t
= TREE_TYPE (target
);
11982 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
11984 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11986 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
11987 /* If we do not have BINFO associated, it means that type was built
11988 without devirtualization enabled. Do not consider this a virtual
11990 if (!TYPE_BINFO (obj_type_ref_class (target
)))
11995 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11998 obj_type_ref_class (tree ref
)
12000 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12001 ref
= TREE_TYPE (ref
);
12002 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12003 ref
= TREE_TYPE (ref
);
12004 /* We look for type THIS points to. ObjC also builds
12005 OBJ_TYPE_REF with non-method calls, Their first parameter
12006 ID however also corresponds to class type. */
12007 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12008 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12009 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12010 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12011 return TREE_TYPE (ref
);
12014 /* Return true if T is in anonymous namespace. */
12017 type_in_anonymous_namespace_p (const_tree t
)
12019 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
12020 bulitin types; those have CONTEXT NULL. */
12021 if (!TYPE_CONTEXT (t
))
12023 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
12026 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12029 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12032 tree base_binfo
, b
;
12034 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12035 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12036 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12038 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12043 /* Try to find a base info of BINFO that would have its field decl at offset
12044 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12045 found, return, otherwise return NULL_TREE. */
12048 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12050 tree type
= BINFO_TYPE (binfo
);
12054 HOST_WIDE_INT pos
, size
;
12058 if (types_same_for_odr (type
, expected_type
))
12063 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12065 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12068 pos
= int_bit_position (fld
);
12069 size
= tree_to_uhwi (DECL_SIZE (fld
));
12070 if (pos
<= offset
&& (pos
+ size
) > offset
)
12073 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12076 /* Offset 0 indicates the primary base, whose vtable contents are
12077 represented in the binfo for the derived class. */
12078 else if (offset
!= 0)
12080 tree found_binfo
= NULL
, base_binfo
;
12081 /* Offsets in BINFO are in bytes relative to the whole structure
12082 while POS is in bits relative to the containing field. */
12083 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12086 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12087 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12088 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12090 found_binfo
= base_binfo
;
12094 binfo
= found_binfo
;
12096 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12100 type
= TREE_TYPE (fld
);
12105 /* Returns true if X is a typedef decl. */
12108 is_typedef_decl (tree x
)
12110 return (x
&& TREE_CODE (x
) == TYPE_DECL
12111 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12114 /* Returns true iff TYPE is a type variant created for a typedef. */
12117 typedef_variant_p (tree type
)
12119 return is_typedef_decl (TYPE_NAME (type
));
12122 /* Warn about a use of an identifier which was marked deprecated. */
12124 warn_deprecated_use (tree node
, tree attr
)
12128 if (node
== 0 || !warn_deprecated_decl
)
12134 attr
= DECL_ATTRIBUTES (node
);
12135 else if (TYPE_P (node
))
12137 tree decl
= TYPE_STUB_DECL (node
);
12139 attr
= lookup_attribute ("deprecated",
12140 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12145 attr
= lookup_attribute ("deprecated", attr
);
12148 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12156 w
= warning (OPT_Wdeprecated_declarations
,
12157 "%qD is deprecated: %s", node
, msg
);
12159 w
= warning (OPT_Wdeprecated_declarations
,
12160 "%qD is deprecated", node
);
12162 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12164 else if (TYPE_P (node
))
12166 tree what
= NULL_TREE
;
12167 tree decl
= TYPE_STUB_DECL (node
);
12169 if (TYPE_NAME (node
))
12171 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12172 what
= TYPE_NAME (node
);
12173 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12174 && DECL_NAME (TYPE_NAME (node
)))
12175 what
= DECL_NAME (TYPE_NAME (node
));
12183 w
= warning (OPT_Wdeprecated_declarations
,
12184 "%qE is deprecated: %s", what
, msg
);
12186 w
= warning (OPT_Wdeprecated_declarations
,
12187 "%qE is deprecated", what
);
12192 w
= warning (OPT_Wdeprecated_declarations
,
12193 "type is deprecated: %s", msg
);
12195 w
= warning (OPT_Wdeprecated_declarations
,
12196 "type is deprecated");
12199 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12206 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12209 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12214 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12217 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12223 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12224 somewhere in it. */
12227 contains_bitfld_component_ref_p (const_tree ref
)
12229 while (handled_component_p (ref
))
12231 if (TREE_CODE (ref
) == COMPONENT_REF
12232 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12234 ref
= TREE_OPERAND (ref
, 0);
12240 /* Try to determine whether a TRY_CATCH expression can fall through.
12241 This is a subroutine of block_may_fallthru. */
12244 try_catch_may_fallthru (const_tree stmt
)
12246 tree_stmt_iterator i
;
12248 /* If the TRY block can fall through, the whole TRY_CATCH can
12250 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12253 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12254 switch (TREE_CODE (tsi_stmt (i
)))
12257 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12258 catch expression and a body. The whole TRY_CATCH may fall
12259 through iff any of the catch bodies falls through. */
12260 for (; !tsi_end_p (i
); tsi_next (&i
))
12262 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12267 case EH_FILTER_EXPR
:
12268 /* The exception filter expression only matters if there is an
12269 exception. If the exception does not match EH_FILTER_TYPES,
12270 we will execute EH_FILTER_FAILURE, and we will fall through
12271 if that falls through. If the exception does match
12272 EH_FILTER_TYPES, the stack unwinder will continue up the
12273 stack, so we will not fall through. We don't know whether we
12274 will throw an exception which matches EH_FILTER_TYPES or not,
12275 so we just ignore EH_FILTER_TYPES and assume that we might
12276 throw an exception which doesn't match. */
12277 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12280 /* This case represents statements to be executed when an
12281 exception occurs. Those statements are implicitly followed
12282 by a RESX statement to resume execution after the exception.
12283 So in this case the TRY_CATCH never falls through. */
12288 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12289 need not be 100% accurate; simply be conservative and return true if we
12290 don't know. This is used only to avoid stupidly generating extra code.
12291 If we're wrong, we'll just delete the extra code later. */
12294 block_may_fallthru (const_tree block
)
12296 /* This CONST_CAST is okay because expr_last returns its argument
12297 unmodified and we assign it to a const_tree. */
12298 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12300 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12304 /* Easy cases. If the last statement of the block implies
12305 control transfer, then we can't fall through. */
12309 /* If SWITCH_LABELS is set, this is lowered, and represents a
12310 branch to a selected label and hence can not fall through.
12311 Otherwise SWITCH_BODY is set, and the switch can fall
12313 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12316 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12318 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12321 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12323 case TRY_CATCH_EXPR
:
12324 return try_catch_may_fallthru (stmt
);
12326 case TRY_FINALLY_EXPR
:
12327 /* The finally clause is always executed after the try clause,
12328 so if it does not fall through, then the try-finally will not
12329 fall through. Otherwise, if the try clause does not fall
12330 through, then when the finally clause falls through it will
12331 resume execution wherever the try clause was going. So the
12332 whole try-finally will only fall through if both the try
12333 clause and the finally clause fall through. */
12334 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12335 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12338 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12339 stmt
= TREE_OPERAND (stmt
, 1);
12345 /* Functions that do not return do not fall through. */
12346 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12348 case CLEANUP_POINT_EXPR
:
12349 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12352 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12358 return lang_hooks
.block_may_fallthru (stmt
);
12362 /* True if we are using EH to handle cleanups. */
12363 static bool using_eh_for_cleanups_flag
= false;
12365 /* This routine is called from front ends to indicate eh should be used for
12368 using_eh_for_cleanups (void)
12370 using_eh_for_cleanups_flag
= true;
12373 /* Query whether EH is used for cleanups. */
12375 using_eh_for_cleanups_p (void)
12377 return using_eh_for_cleanups_flag
;
12380 /* Wrapper for tree_code_name to ensure that tree code is valid */
12382 get_tree_code_name (enum tree_code code
)
12384 const char *invalid
= "<invalid tree code>";
12386 if (code
>= MAX_TREE_CODES
)
12389 return tree_code_name
[code
];
12392 /* Drops the TREE_OVERFLOW flag from T. */
12395 drop_tree_overflow (tree t
)
12397 gcc_checking_assert (TREE_OVERFLOW (t
));
12399 /* For tree codes with a sharing machinery re-build the result. */
12400 if (TREE_CODE (t
) == INTEGER_CST
)
12401 return wide_int_to_tree (TREE_TYPE (t
), t
);
12403 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12404 and drop the flag. */
12406 TREE_OVERFLOW (t
) = 0;
12410 /* Given a memory reference expression T, return its base address.
12411 The base address of a memory reference expression is the main
12412 object being referenced. For instance, the base address for
12413 'array[i].fld[j]' is 'array'. You can think of this as stripping
12414 away the offset part from a memory address.
12416 This function calls handled_component_p to strip away all the inner
12417 parts of the memory reference until it reaches the base object. */
12420 get_base_address (tree t
)
12422 while (handled_component_p (t
))
12423 t
= TREE_OPERAND (t
, 0);
12425 if ((TREE_CODE (t
) == MEM_REF
12426 || TREE_CODE (t
) == TARGET_MEM_REF
)
12427 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12428 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12430 /* ??? Either the alias oracle or all callers need to properly deal
12431 with WITH_SIZE_EXPRs before we can look through those. */
12432 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12438 /* Return the machine mode of T. For vectors, returns the mode of the
12439 inner type. The main use case is to feed the result to HONOR_NANS,
12440 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12443 element_mode (const_tree t
)
12447 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12449 return TYPE_MODE (t
);
12452 /* Veirfy that basic properties of T match TV and thus T can be a variant of
12453 TV. TV should be the more specified variant (i.e. the main variant). */
12456 verify_type_variant (const_tree t
, tree tv
)
12458 if (TREE_CODE (t
) != TREE_CODE (tv
))
12460 error ("type variant has different TREE_CODE");
12464 if (COMPLETE_TYPE_P (t
) && TYPE_SIZE (t
) != TYPE_SIZE (tv
))
12466 error ("type variant has different TYPE_SIZE");
12468 error ("type variant's TYPE_SIZE");
12469 debug_tree (TYPE_SIZE (tv
));
12470 error ("type's TYPE_SIZE");
12471 debug_tree (TYPE_SIZE (t
));
12474 if (COMPLETE_TYPE_P (t
)
12475 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
12476 /* FIXME: ideally we should compare pointer equality, but java FE produce
12477 variants where size is INTEGER_CST of different type (int wrt size_type)
12478 during libjava biuld. */
12479 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
12481 error ("type variant has different TYPE_SIZE_UNIT");
12483 error ("type variant's TYPE_SIZE_UNIT");
12484 debug_tree (TYPE_SIZE_UNIT (tv
));
12485 error ("type's TYPE_SIZE_UNIT");
12486 debug_tree (TYPE_SIZE_UNIT (t
));
12489 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12490 and danagle the pointer from time to time. */
12491 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
12492 && (!TYPE_VFIELD (tv
) || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
12494 error ("type variant has different TYPE_VFIELD");
12498 if (((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
12499 || TREE_CODE (t
) == INTEGER_TYPE
12500 || TREE_CODE (t
) == BOOLEAN_TYPE
12501 || TREE_CODE (t
) == REAL_TYPE
12502 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12503 && (TYPE_MAX_VALUE (t
) != TYPE_MAX_VALUE (tv
)
12504 || TYPE_MIN_VALUE (t
) != TYPE_MIN_VALUE (tv
)))
12506 error ("type variant has different TYPE_MAX_VALUE or TYPE_MIN_VALUE");
12510 if (TREE_CODE (t
) == METHOD_TYPE
12511 && TYPE_METHOD_BASETYPE (t
) != TYPE_METHOD_BASETYPE (tv
))
12513 error ("type variant has different TYPE_METHOD_BASETYPE");
12517 /* FIXME: this check triggers during libstdc++ build that is a bug.
12518 It affects non-LTO debug output only, because free_lang_data clears
12520 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0
12521 && TYPE_METHODS (t
) != TYPE_METHODS (tv
))
12523 error ("type variant has different TYPE_METHODS");
12527 if (TREE_CODE (t
) == OFFSET_TYPE
12528 && TYPE_OFFSET_BASETYPE (t
) != TYPE_OFFSET_BASETYPE (tv
))
12530 error ("type variant has different TYPE_OFFSET_BASETYPE");
12534 if (TREE_CODE (t
) == ARRAY_TYPE
12535 && TYPE_ARRAY_MAX_SIZE (t
) != TYPE_ARRAY_MAX_SIZE (tv
))
12537 error ("type variant has different TYPE_ARRAY_MAX_SIZE");
12541 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
12542 or even type's main variant. This is needed to make bootstrap pass
12543 and the bug seems new in GCC 5.
12544 C++ FE should be updated to make this consistent and we should check
12545 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
12546 is a match with main variant.
12548 Also disable the check for Java for now because of parser hack that builds
12549 first an dummy BINFO and then sometimes replace it by real BINFO in some
12551 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
12552 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
12553 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
12554 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
12555 at LTO time only. */
12556 && (in_lto_p
&& odr_type_p (t
)))
12558 error ("type variant has different TYPE_BINFO");
12560 error ("type variant's TYPE_BINFO");
12561 debug_tree (TYPE_BINFO (tv
));
12562 error ("type's TYPE_BINFO");
12563 debug_tree (TYPE_BINFO (t
));
12569 /* Verify type T. */
12572 verify_type (const_tree t
)
12574 bool error_found
= false;
12575 tree mv
= TYPE_MAIN_VARIANT (t
);
12578 error ("Main variant is not defined");
12579 error_found
= true;
12581 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
12583 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
12585 error_found
= true;
12587 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
12588 error_found
= true;
12590 /* Check various uses of TYPE_MINVAL. */
12591 if (RECORD_OR_UNION_TYPE_P (t
))
12593 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12594 and danagle the pointer from time to time. */
12595 if (TYPE_VFIELD (t
)
12596 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
12597 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
12599 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
12600 debug_tree (TYPE_VFIELD (t
));
12601 error_found
= true;
12604 else if (TREE_CODE (t
) == POINTER_TYPE
)
12606 if (TYPE_NEXT_PTR_TO (t
)
12607 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
12609 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
12610 debug_tree (TYPE_NEXT_PTR_TO (t
));
12611 error_found
= true;
12614 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
12616 if (TYPE_NEXT_REF_TO (t
)
12617 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
12619 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
12620 debug_tree (TYPE_NEXT_REF_TO (t
));
12621 error_found
= true;
12624 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
|| TREE_CODE (t
) == FIXED_POINT_TYPE
)
12626 /* FIXME: The following check should pass:
12627 useless_type_conversion_p (const_cast <tree> (t), TREE_TYPE (TYPE_MIN_VALUE (t))
12628 bud does not for C sizetypes in LTO. */
12630 else if (TYPE_MINVAL (t
))
12632 error ("TYPE_MINVAL non-NULL");
12633 debug_tree (TYPE_MINVAL (t
));
12634 error_found
= true;
12637 /* Check various uses of TYPE_MAXVAL. */
12638 if (RECORD_OR_UNION_TYPE_P (t
))
12640 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
12641 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
)
12643 error ("TYPE_METHODS is not FUNCTION_DECL nor TEMPLATE_DECL");
12644 debug_tree (TYPE_METHODS (t
));
12645 error_found
= true;
12648 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
12650 if (TYPE_METHOD_BASETYPE (t
)
12651 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
12652 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
12654 error ("TYPE_METHOD_BASETYPE is not record nor union");
12655 debug_tree (TYPE_METHOD_BASETYPE (t
));
12656 error_found
= true;
12659 else if (TREE_CODE (t
) == OFFSET_TYPE
)
12661 if (TYPE_OFFSET_BASETYPE (t
)
12662 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
12663 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
12665 error ("TYPE_OFFSET_BASETYPE is not record nor union");
12666 debug_tree (TYPE_OFFSET_BASETYPE (t
));
12667 error_found
= true;
12670 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
|| TREE_CODE (t
) == FIXED_POINT_TYPE
)
12672 /* FIXME: The following check should pass:
12673 useless_type_conversion_p (const_cast <tree> (t), TREE_TYPE (TYPE_MAX_VALUE (t))
12674 bud does not for C sizetypes in LTO. */
12676 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12678 if (TYPE_ARRAY_MAX_SIZE (t
)
12679 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
12681 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
12682 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
12683 error_found
= true;
12686 else if (TYPE_MAXVAL (t
))
12688 error ("TYPE_MAXVAL non-NULL");
12689 debug_tree (TYPE_MAXVAL (t
));
12690 error_found
= true;
12696 debug_tree (const_cast <tree
> (t
));
12697 internal_error ("verify_type failed");
12701 #include "gt-tree.h"