1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2014 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"
36 #include "stor-layout.h"
43 #include "toplev.h" /* get_random_seed */
45 #include "filenames.h"
48 #include "common/common-target.h"
49 #include "langhooks.h"
50 #include "tree-inline.h"
51 #include "tree-iterator.h"
52 #include "basic-block.h"
54 #include "pointer-set.h"
55 #include "tree-ssa-alias.h"
56 #include "internal-fn.h"
57 #include "gimple-expr.h"
60 #include "gimple-iterator.h"
62 #include "gimple-ssa.h"
64 #include "tree-phinodes.h"
65 #include "stringpool.h"
66 #include "tree-ssanames.h"
70 #include "tree-pass.h"
71 #include "langhooks-def.h"
72 #include "diagnostic.h"
73 #include "tree-diagnostic.h"
74 #include "tree-pretty-print.h"
81 /* Tree code classes. */
83 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
84 #define END_OF_BASE_TREE_CODES tcc_exceptional,
86 const enum tree_code_class tree_code_type
[] = {
87 #include "all-tree.def"
91 #undef END_OF_BASE_TREE_CODES
93 /* Table indexed by tree code giving number of expression
94 operands beyond the fixed part of the node structure.
95 Not used for types or decls. */
97 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
98 #define END_OF_BASE_TREE_CODES 0,
100 const unsigned char tree_code_length
[] = {
101 #include "all-tree.def"
105 #undef END_OF_BASE_TREE_CODES
107 /* Names of tree components.
108 Used for printing out the tree and error messages. */
109 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
110 #define END_OF_BASE_TREE_CODES "@dummy",
112 static const char *const tree_code_name
[] = {
113 #include "all-tree.def"
117 #undef END_OF_BASE_TREE_CODES
119 /* Each tree code class has an associated string representation.
120 These must correspond to the tree_code_class entries. */
122 const char *const tree_code_class_strings
[] =
137 /* obstack.[ch] explicitly declined to prototype this. */
138 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
140 /* Statistics-gathering stuff. */
142 static int tree_code_counts
[MAX_TREE_CODES
];
143 int tree_node_counts
[(int) all_kinds
];
144 int tree_node_sizes
[(int) all_kinds
];
146 /* Keep in sync with tree.h:enum tree_node_kind. */
147 static const char * const tree_node_kind_names
[] = {
166 /* Unique id for next decl created. */
167 static GTY(()) int next_decl_uid
;
168 /* Unique id for next type created. */
169 static GTY(()) int next_type_uid
= 1;
170 /* Unique id for next debug decl created. Use negative numbers,
171 to catch erroneous uses. */
172 static GTY(()) int next_debug_decl_uid
;
174 /* Since we cannot rehash a type after it is in the table, we have to
175 keep the hash code. */
177 struct GTY(()) type_hash
{
182 /* Initial size of the hash table (rounded to next prime). */
183 #define TYPE_HASH_INITIAL_SIZE 1000
185 /* Now here is the hash table. When recording a type, it is added to
186 the slot whose index is the hash code. Note that the hash table is
187 used for several kinds of types (function types, array types and
188 array index range types, for now). While all these live in the
189 same table, they are completely independent, and the hash code is
190 computed differently for each of these. */
192 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
193 htab_t type_hash_table
;
195 /* Hash table and temporary node for larger integer const values. */
196 static GTY (()) tree int_cst_node
;
197 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
198 htab_t int_cst_hash_table
;
200 /* Hash table for optimization flags and target option flags. Use the same
201 hash table for both sets of options. Nodes for building the current
202 optimization and target option nodes. The assumption is most of the time
203 the options created will already be in the hash table, so we avoid
204 allocating and freeing up a node repeatably. */
205 static GTY (()) tree cl_optimization_node
;
206 static GTY (()) tree cl_target_option_node
;
207 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
208 htab_t cl_option_hash_table
;
210 /* General tree->tree mapping structure for use in hash tables. */
213 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
214 htab_t debug_expr_for_decl
;
216 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
217 htab_t value_expr_for_decl
;
219 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
220 htab_t debug_args_for_decl
;
222 static void set_type_quals (tree
, int);
223 static int type_hash_eq (const void *, const void *);
224 static hashval_t
type_hash_hash (const void *);
225 static hashval_t
int_cst_hash_hash (const void *);
226 static int int_cst_hash_eq (const void *, const void *);
227 static hashval_t
cl_option_hash_hash (const void *);
228 static int cl_option_hash_eq (const void *, const void *);
229 static void print_type_hash_statistics (void);
230 static void print_debug_expr_statistics (void);
231 static void print_value_expr_statistics (void);
232 static int type_hash_marked_p (const void *);
233 static unsigned int type_hash_list (const_tree
, hashval_t
);
234 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
236 tree global_trees
[TI_MAX
];
237 tree integer_types
[itk_none
];
239 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
241 /* Number of operands for each OpenMP clause. */
242 unsigned const char omp_clause_num_ops
[] =
244 0, /* OMP_CLAUSE_ERROR */
245 1, /* OMP_CLAUSE_PRIVATE */
246 1, /* OMP_CLAUSE_SHARED */
247 1, /* OMP_CLAUSE_FIRSTPRIVATE */
248 2, /* OMP_CLAUSE_LASTPRIVATE */
249 4, /* OMP_CLAUSE_REDUCTION */
250 1, /* OMP_CLAUSE_COPYIN */
251 1, /* OMP_CLAUSE_COPYPRIVATE */
252 3, /* OMP_CLAUSE_LINEAR */
253 2, /* OMP_CLAUSE_ALIGNED */
254 1, /* OMP_CLAUSE_DEPEND */
255 1, /* OMP_CLAUSE_UNIFORM */
256 2, /* OMP_CLAUSE_FROM */
257 2, /* OMP_CLAUSE_TO */
258 2, /* OMP_CLAUSE_MAP */
259 1, /* OMP_CLAUSE__LOOPTEMP_ */
260 1, /* OMP_CLAUSE_IF */
261 1, /* OMP_CLAUSE_NUM_THREADS */
262 1, /* OMP_CLAUSE_SCHEDULE */
263 0, /* OMP_CLAUSE_NOWAIT */
264 0, /* OMP_CLAUSE_ORDERED */
265 0, /* OMP_CLAUSE_DEFAULT */
266 3, /* OMP_CLAUSE_COLLAPSE */
267 0, /* OMP_CLAUSE_UNTIED */
268 1, /* OMP_CLAUSE_FINAL */
269 0, /* OMP_CLAUSE_MERGEABLE */
270 1, /* OMP_CLAUSE_DEVICE */
271 1, /* OMP_CLAUSE_DIST_SCHEDULE */
272 0, /* OMP_CLAUSE_INBRANCH */
273 0, /* OMP_CLAUSE_NOTINBRANCH */
274 1, /* OMP_CLAUSE_NUM_TEAMS */
275 1, /* OMP_CLAUSE_THREAD_LIMIT */
276 0, /* OMP_CLAUSE_PROC_BIND */
277 1, /* OMP_CLAUSE_SAFELEN */
278 1, /* OMP_CLAUSE_SIMDLEN */
279 0, /* OMP_CLAUSE_FOR */
280 0, /* OMP_CLAUSE_PARALLEL */
281 0, /* OMP_CLAUSE_SECTIONS */
282 0, /* OMP_CLAUSE_TASKGROUP */
283 1, /* OMP_CLAUSE__SIMDUID_ */
286 const char * const omp_clause_code_name
[] =
331 /* Return the tree node structure used by tree code CODE. */
333 static inline enum tree_node_structure_enum
334 tree_node_structure_for_code (enum tree_code code
)
336 switch (TREE_CODE_CLASS (code
))
338 case tcc_declaration
:
343 return TS_FIELD_DECL
;
349 return TS_LABEL_DECL
;
351 return TS_RESULT_DECL
;
352 case DEBUG_EXPR_DECL
:
355 return TS_CONST_DECL
;
359 return TS_FUNCTION_DECL
;
360 case TRANSLATION_UNIT_DECL
:
361 return TS_TRANSLATION_UNIT_DECL
;
363 return TS_DECL_NON_COMMON
;
367 return TS_TYPE_NON_COMMON
;
376 default: /* tcc_constant and tcc_exceptional */
381 /* tcc_constant cases. */
382 case VOID_CST
: return TS_TYPED
;
383 case INTEGER_CST
: return TS_INT_CST
;
384 case REAL_CST
: return TS_REAL_CST
;
385 case FIXED_CST
: return TS_FIXED_CST
;
386 case COMPLEX_CST
: return TS_COMPLEX
;
387 case VECTOR_CST
: return TS_VECTOR
;
388 case STRING_CST
: return TS_STRING
;
389 /* tcc_exceptional cases. */
390 case ERROR_MARK
: return TS_COMMON
;
391 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
392 case TREE_LIST
: return TS_LIST
;
393 case TREE_VEC
: return TS_VEC
;
394 case SSA_NAME
: return TS_SSA_NAME
;
395 case PLACEHOLDER_EXPR
: return TS_COMMON
;
396 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
397 case BLOCK
: return TS_BLOCK
;
398 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
399 case TREE_BINFO
: return TS_BINFO
;
400 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
401 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
402 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
410 /* Initialize tree_contains_struct to describe the hierarchy of tree
414 initialize_tree_contains_struct (void)
418 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
421 enum tree_node_structure_enum ts_code
;
423 code
= (enum tree_code
) i
;
424 ts_code
= tree_node_structure_for_code (code
);
426 /* Mark the TS structure itself. */
427 tree_contains_struct
[code
][ts_code
] = 1;
429 /* Mark all the structures that TS is derived from. */
447 case TS_STATEMENT_LIST
:
448 MARK_TS_TYPED (code
);
452 case TS_DECL_MINIMAL
:
458 case TS_OPTIMIZATION
:
459 case TS_TARGET_OPTION
:
460 MARK_TS_COMMON (code
);
463 case TS_TYPE_WITH_LANG_SPECIFIC
:
464 MARK_TS_TYPE_COMMON (code
);
467 case TS_TYPE_NON_COMMON
:
468 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
472 MARK_TS_DECL_MINIMAL (code
);
477 MARK_TS_DECL_COMMON (code
);
480 case TS_DECL_NON_COMMON
:
481 MARK_TS_DECL_WITH_VIS (code
);
484 case TS_DECL_WITH_VIS
:
488 MARK_TS_DECL_WRTL (code
);
492 MARK_TS_DECL_COMMON (code
);
496 MARK_TS_DECL_WITH_VIS (code
);
500 case TS_FUNCTION_DECL
:
501 MARK_TS_DECL_NON_COMMON (code
);
504 case TS_TRANSLATION_UNIT_DECL
:
505 MARK_TS_DECL_COMMON (code
);
513 /* Basic consistency checks for attributes used in fold. */
514 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
515 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
516 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
517 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
518 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
519 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
520 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
521 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
522 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
523 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
524 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
525 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
526 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
527 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
528 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
529 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
530 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
531 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
532 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
533 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
534 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
535 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
536 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
537 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
538 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
539 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
540 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
541 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
542 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
543 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
544 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
545 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
546 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
547 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
548 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
549 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
550 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
551 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
552 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
553 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
562 /* Initialize the hash table of types. */
563 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
566 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
567 tree_decl_map_eq
, 0);
569 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
570 tree_decl_map_eq
, 0);
572 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
573 int_cst_hash_eq
, NULL
);
575 int_cst_node
= make_int_cst (1, 1);
577 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
578 cl_option_hash_eq
, NULL
);
580 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
581 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
583 /* Initialize the tree_contains_struct array. */
584 initialize_tree_contains_struct ();
585 lang_hooks
.init_ts ();
589 /* The name of the object as the assembler will see it (but before any
590 translations made by ASM_OUTPUT_LABELREF). Often this is the same
591 as DECL_NAME. It is an IDENTIFIER_NODE. */
593 decl_assembler_name (tree decl
)
595 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
596 lang_hooks
.set_decl_assembler_name (decl
);
597 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
600 /* When the target supports COMDAT groups, this indicates which group the
601 DECL is associated with. This can be either an IDENTIFIER_NODE or a
602 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
604 decl_comdat_group (const_tree node
)
606 struct symtab_node
*snode
= symtab_get_node (node
);
609 return snode
->get_comdat_group ();
612 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
614 decl_comdat_group_id (const_tree node
)
616 struct symtab_node
*snode
= symtab_get_node (node
);
619 return snode
->get_comdat_group_id ();
622 /* When the target supports named section, return its name as IDENTIFIER_NODE
623 or NULL if it is in no section. */
625 decl_section_name (const_tree node
)
627 struct symtab_node
*snode
= symtab_get_node (node
);
630 return snode
->get_section ();
633 /* Set section section name of NODE to VALUE (that is expected to
634 be identifier node) */
636 set_decl_section_name (tree node
, const char *value
)
638 struct symtab_node
*snode
;
642 snode
= symtab_get_node (node
);
646 else if (TREE_CODE (node
) == VAR_DECL
)
647 snode
= varpool_node_for_decl (node
);
649 snode
= cgraph_get_create_node (node
);
650 snode
->set_section (value
);
653 /* Return TLS model of a variable NODE. */
655 decl_tls_model (const_tree node
)
657 struct varpool_node
*snode
= varpool_get_node (node
);
659 return TLS_MODEL_NONE
;
660 return snode
->tls_model
;
663 /* Set TLS model of variable NODE to MODEL. */
665 set_decl_tls_model (tree node
, enum tls_model model
)
667 struct varpool_node
*vnode
;
669 if (model
== TLS_MODEL_NONE
)
671 vnode
= varpool_get_node (node
);
676 vnode
= varpool_node_for_decl (node
);
677 vnode
->tls_model
= model
;
680 /* Compute the number of bytes occupied by a tree with code CODE.
681 This function cannot be used for nodes that have variable sizes,
682 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
684 tree_code_size (enum tree_code code
)
686 switch (TREE_CODE_CLASS (code
))
688 case tcc_declaration
: /* A decl node */
693 return sizeof (struct tree_field_decl
);
695 return sizeof (struct tree_parm_decl
);
697 return sizeof (struct tree_var_decl
);
699 return sizeof (struct tree_label_decl
);
701 return sizeof (struct tree_result_decl
);
703 return sizeof (struct tree_const_decl
);
705 return sizeof (struct tree_type_decl
);
707 return sizeof (struct tree_function_decl
);
708 case DEBUG_EXPR_DECL
:
709 return sizeof (struct tree_decl_with_rtl
);
711 return sizeof (struct tree_decl_non_common
);
715 case tcc_type
: /* a type node */
716 return sizeof (struct tree_type_non_common
);
718 case tcc_reference
: /* a reference */
719 case tcc_expression
: /* an expression */
720 case tcc_statement
: /* an expression with side effects */
721 case tcc_comparison
: /* a comparison expression */
722 case tcc_unary
: /* a unary arithmetic expression */
723 case tcc_binary
: /* a binary arithmetic expression */
724 return (sizeof (struct tree_exp
)
725 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
727 case tcc_constant
: /* a constant */
730 case VOID_CST
: return sizeof (struct tree_typed
);
731 case INTEGER_CST
: gcc_unreachable ();
732 case REAL_CST
: return sizeof (struct tree_real_cst
);
733 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
734 case COMPLEX_CST
: return sizeof (struct tree_complex
);
735 case VECTOR_CST
: return sizeof (struct tree_vector
);
736 case STRING_CST
: gcc_unreachable ();
738 return lang_hooks
.tree_size (code
);
741 case tcc_exceptional
: /* something random, like an identifier. */
744 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
745 case TREE_LIST
: return sizeof (struct tree_list
);
748 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
751 case OMP_CLAUSE
: gcc_unreachable ();
753 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
755 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
756 case BLOCK
: return sizeof (struct tree_block
);
757 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
758 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
759 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
762 return lang_hooks
.tree_size (code
);
770 /* Compute the number of bytes occupied by NODE. This routine only
771 looks at TREE_CODE, except for those nodes that have variable sizes. */
773 tree_size (const_tree node
)
775 const enum tree_code code
= TREE_CODE (node
);
779 return (sizeof (struct tree_int_cst
)
780 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
783 return (offsetof (struct tree_binfo
, base_binfos
)
785 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
788 return (sizeof (struct tree_vec
)
789 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
792 return (sizeof (struct tree_vector
)
793 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
796 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
799 return (sizeof (struct tree_omp_clause
)
800 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
804 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
805 return (sizeof (struct tree_exp
)
806 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
808 return tree_code_size (code
);
812 /* Record interesting allocation statistics for a tree node with CODE
816 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
817 size_t length ATTRIBUTE_UNUSED
)
819 enum tree_code_class type
= TREE_CODE_CLASS (code
);
822 if (!GATHER_STATISTICS
)
827 case tcc_declaration
: /* A decl node */
831 case tcc_type
: /* a type node */
835 case tcc_statement
: /* an expression with side effects */
839 case tcc_reference
: /* a reference */
843 case tcc_expression
: /* an expression */
844 case tcc_comparison
: /* a comparison expression */
845 case tcc_unary
: /* a unary arithmetic expression */
846 case tcc_binary
: /* a binary arithmetic expression */
850 case tcc_constant
: /* a constant */
854 case tcc_exceptional
: /* something random, like an identifier. */
857 case IDENTIFIER_NODE
:
870 kind
= ssa_name_kind
;
882 kind
= omp_clause_kind
;
899 tree_code_counts
[(int) code
]++;
900 tree_node_counts
[(int) kind
]++;
901 tree_node_sizes
[(int) kind
] += length
;
904 /* Allocate and return a new UID from the DECL_UID namespace. */
907 allocate_decl_uid (void)
909 return next_decl_uid
++;
912 /* Return a newly allocated node of code CODE. For decl and type
913 nodes, some other fields are initialized. The rest of the node is
914 initialized to zero. This function cannot be used for TREE_VEC,
915 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
918 Achoo! I got a code in the node. */
921 make_node_stat (enum tree_code code MEM_STAT_DECL
)
924 enum tree_code_class type
= TREE_CODE_CLASS (code
);
925 size_t length
= tree_code_size (code
);
927 record_node_allocation_statistics (code
, length
);
929 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
930 TREE_SET_CODE (t
, code
);
935 TREE_SIDE_EFFECTS (t
) = 1;
938 case tcc_declaration
:
939 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
941 if (code
== FUNCTION_DECL
)
943 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
944 DECL_MODE (t
) = FUNCTION_MODE
;
949 DECL_SOURCE_LOCATION (t
) = input_location
;
950 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
951 DECL_UID (t
) = --next_debug_decl_uid
;
954 DECL_UID (t
) = allocate_decl_uid ();
955 SET_DECL_PT_UID (t
, -1);
957 if (TREE_CODE (t
) == LABEL_DECL
)
958 LABEL_DECL_UID (t
) = -1;
963 TYPE_UID (t
) = next_type_uid
++;
964 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
965 TYPE_USER_ALIGN (t
) = 0;
966 TYPE_MAIN_VARIANT (t
) = t
;
967 TYPE_CANONICAL (t
) = t
;
969 /* Default to no attributes for type, but let target change that. */
970 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
971 targetm
.set_default_type_attributes (t
);
973 /* We have not yet computed the alias set for this type. */
974 TYPE_ALIAS_SET (t
) = -1;
978 TREE_CONSTANT (t
) = 1;
987 case PREDECREMENT_EXPR
:
988 case PREINCREMENT_EXPR
:
989 case POSTDECREMENT_EXPR
:
990 case POSTINCREMENT_EXPR
:
991 /* All of these have side-effects, no matter what their
993 TREE_SIDE_EFFECTS (t
) = 1;
1002 /* Other classes need no special treatment. */
1009 /* Return a new node with the same contents as NODE except that its
1010 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1013 copy_node_stat (tree node MEM_STAT_DECL
)
1016 enum tree_code code
= TREE_CODE (node
);
1019 gcc_assert (code
!= STATEMENT_LIST
);
1021 length
= tree_size (node
);
1022 record_node_allocation_statistics (code
, length
);
1023 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1024 memcpy (t
, node
, length
);
1026 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1028 TREE_ASM_WRITTEN (t
) = 0;
1029 TREE_VISITED (t
) = 0;
1031 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1033 if (code
== DEBUG_EXPR_DECL
)
1034 DECL_UID (t
) = --next_debug_decl_uid
;
1037 DECL_UID (t
) = allocate_decl_uid ();
1038 if (DECL_PT_UID_SET_P (node
))
1039 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1041 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1042 && DECL_HAS_VALUE_EXPR_P (node
))
1044 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1045 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1047 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1048 if (TREE_CODE (node
) == VAR_DECL
)
1050 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1051 t
->decl_with_vis
.symtab_node
= NULL
;
1053 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1055 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1056 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1058 if (TREE_CODE (node
) == FUNCTION_DECL
)
1060 DECL_STRUCT_FUNCTION (t
) = NULL
;
1061 t
->decl_with_vis
.symtab_node
= NULL
;
1064 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1066 TYPE_UID (t
) = next_type_uid
++;
1067 /* The following is so that the debug code for
1068 the copy is different from the original type.
1069 The two statements usually duplicate each other
1070 (because they clear fields of the same union),
1071 but the optimizer should catch that. */
1072 TYPE_SYMTAB_POINTER (t
) = 0;
1073 TYPE_SYMTAB_ADDRESS (t
) = 0;
1075 /* Do not copy the values cache. */
1076 if (TYPE_CACHED_VALUES_P (t
))
1078 TYPE_CACHED_VALUES_P (t
) = 0;
1079 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1086 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1087 For example, this can copy a list made of TREE_LIST nodes. */
1090 copy_list (tree list
)
1098 head
= prev
= copy_node (list
);
1099 next
= TREE_CHAIN (list
);
1102 TREE_CHAIN (prev
) = copy_node (next
);
1103 prev
= TREE_CHAIN (prev
);
1104 next
= TREE_CHAIN (next
);
1110 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1111 INTEGER_CST with value CST and type TYPE. */
1114 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1116 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1117 /* We need an extra zero HWI if CST is an unsigned integer with its
1118 upper bit set, and if CST occupies a whole number of HWIs. */
1119 if (TYPE_UNSIGNED (type
)
1121 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1122 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1123 return cst
.get_len ();
1126 /* Return a new INTEGER_CST with value CST and type TYPE. */
1129 build_new_int_cst (tree type
, const wide_int
&cst
)
1131 unsigned int len
= cst
.get_len ();
1132 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1133 tree nt
= make_int_cst (len
, ext_len
);
1138 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1139 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1140 TREE_INT_CST_ELT (nt
, i
) = -1;
1142 else if (TYPE_UNSIGNED (type
)
1143 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1146 TREE_INT_CST_ELT (nt
, len
)
1147 = zext_hwi (cst
.elt (len
),
1148 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1151 for (unsigned int i
= 0; i
< len
; i
++)
1152 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1153 TREE_TYPE (nt
) = type
;
1157 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1160 build_int_cst (tree type
, HOST_WIDE_INT low
)
1162 /* Support legacy code. */
1164 type
= integer_type_node
;
1166 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1170 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1172 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1175 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1178 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1181 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1184 /* Constructs tree in type TYPE from with value given by CST. Signedness
1185 of CST is assumed to be the same as the signedness of TYPE. */
1188 double_int_to_tree (tree type
, double_int cst
)
1190 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1193 /* We force the wide_int CST to the range of the type TYPE by sign or
1194 zero extending it. OVERFLOWABLE indicates if we are interested in
1195 overflow of the value, when >0 we are only interested in signed
1196 overflow, for <0 we are interested in any overflow. OVERFLOWED
1197 indicates whether overflow has already occurred. CONST_OVERFLOWED
1198 indicates whether constant overflow has already occurred. We force
1199 T's value to be within range of T's type (by setting to 0 or 1 all
1200 the bits outside the type's range). We set TREE_OVERFLOWED if,
1201 OVERFLOWED is nonzero,
1202 or OVERFLOWABLE is >0 and signed overflow occurs
1203 or OVERFLOWABLE is <0 and any overflow occurs
1204 We return a new tree node for the extended wide_int. The node
1205 is shared if no overflow flags are set. */
1209 force_fit_type (tree type
, const wide_int_ref
&cst
,
1210 int overflowable
, bool overflowed
)
1212 signop sign
= TYPE_SIGN (type
);
1214 /* If we need to set overflow flags, return a new unshared node. */
1215 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1219 || (overflowable
> 0 && sign
== SIGNED
))
1221 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1222 tree t
= build_new_int_cst (type
, tmp
);
1223 TREE_OVERFLOW (t
) = 1;
1228 /* Else build a shared node. */
1229 return wide_int_to_tree (type
, cst
);
1232 /* These are the hash table functions for the hash table of INTEGER_CST
1233 nodes of a sizetype. */
1235 /* Return the hash code code X, an INTEGER_CST. */
1238 int_cst_hash_hash (const void *x
)
1240 const_tree
const t
= (const_tree
) x
;
1241 hashval_t code
= htab_hash_pointer (TREE_TYPE (t
));
1244 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1245 code
^= TREE_INT_CST_ELT (t
, i
);
1250 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1251 is the same as that given by *Y, which is the same. */
1254 int_cst_hash_eq (const void *x
, const void *y
)
1256 const_tree
const xt
= (const_tree
) x
;
1257 const_tree
const yt
= (const_tree
) y
;
1259 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1260 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1261 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1264 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1265 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1271 /* Create an INT_CST node of TYPE and value CST.
1272 The returned node is always shared. For small integers we use a
1273 per-type vector cache, for larger ones we use a single hash table.
1274 The value is extended from its precision according to the sign of
1275 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1276 the upper bits and ensures that hashing and value equality based
1277 upon the underlying HOST_WIDE_INTs works without masking. */
1280 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1287 unsigned int prec
= TYPE_PRECISION (type
);
1288 signop sgn
= TYPE_SIGN (type
);
1290 /* Verify that everything is canonical. */
1291 int l
= pcst
.get_len ();
1294 if (pcst
.elt (l
- 1) == 0)
1295 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1296 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1297 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1300 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1301 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1305 /* We just need to store a single HOST_WIDE_INT. */
1307 if (TYPE_UNSIGNED (type
))
1308 hwi
= cst
.to_uhwi ();
1310 hwi
= cst
.to_shwi ();
1312 switch (TREE_CODE (type
))
1315 gcc_assert (hwi
== 0);
1319 case REFERENCE_TYPE
:
1320 /* Cache NULL pointer. */
1329 /* Cache false or true. */
1337 if (TYPE_SIGN (type
) == UNSIGNED
)
1340 limit
= INTEGER_SHARE_LIMIT
;
1341 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1346 /* Cache [-1, N). */
1347 limit
= INTEGER_SHARE_LIMIT
+ 1;
1348 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1362 /* Look for it in the type's vector of small shared ints. */
1363 if (!TYPE_CACHED_VALUES_P (type
))
1365 TYPE_CACHED_VALUES_P (type
) = 1;
1366 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1369 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1371 /* Make sure no one is clobbering the shared constant. */
1372 gcc_checking_assert (TREE_TYPE (t
) == type
1373 && TREE_INT_CST_NUNITS (t
) == 1
1374 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1375 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1376 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1379 /* Create a new shared int. */
1380 t
= build_new_int_cst (type
, cst
);
1381 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1386 /* Use the cache of larger shared ints, using int_cst_node as
1390 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1391 TREE_TYPE (int_cst_node
) = type
;
1393 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1397 /* Insert this one into the hash table. */
1400 /* Make a new node for next time round. */
1401 int_cst_node
= make_int_cst (1, 1);
1407 /* The value either hashes properly or we drop it on the floor
1408 for the gc to take care of. There will not be enough of them
1412 tree nt
= build_new_int_cst (type
, cst
);
1413 slot
= htab_find_slot (int_cst_hash_table
, nt
, INSERT
);
1417 /* Insert this one into the hash table. */
1427 cache_integer_cst (tree t
)
1429 tree type
= TREE_TYPE (t
);
1432 int prec
= TYPE_PRECISION (type
);
1434 gcc_assert (!TREE_OVERFLOW (t
));
1436 switch (TREE_CODE (type
))
1439 gcc_assert (integer_zerop (t
));
1443 case REFERENCE_TYPE
:
1444 /* Cache NULL pointer. */
1445 if (integer_zerop (t
))
1453 /* Cache false or true. */
1455 if (wi::ltu_p (t
, 2))
1456 ix
= TREE_INT_CST_ELT (t
, 0);
1461 if (TYPE_UNSIGNED (type
))
1464 limit
= INTEGER_SHARE_LIMIT
;
1466 /* This is a little hokie, but if the prec is smaller than
1467 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1468 obvious test will not get the correct answer. */
1469 if (prec
< HOST_BITS_PER_WIDE_INT
)
1471 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1472 ix
= tree_to_uhwi (t
);
1474 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1475 ix
= tree_to_uhwi (t
);
1480 limit
= INTEGER_SHARE_LIMIT
+ 1;
1482 if (integer_minus_onep (t
))
1484 else if (!wi::neg_p (t
))
1486 if (prec
< HOST_BITS_PER_WIDE_INT
)
1488 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1489 ix
= tree_to_shwi (t
) + 1;
1491 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1492 ix
= tree_to_shwi (t
) + 1;
1506 /* Look for it in the type's vector of small shared ints. */
1507 if (!TYPE_CACHED_VALUES_P (type
))
1509 TYPE_CACHED_VALUES_P (type
) = 1;
1510 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1513 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1514 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1518 /* Use the cache of larger shared ints. */
1521 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1522 /* If there is already an entry for the number verify it's the
1525 gcc_assert (wi::eq_p (tree (*slot
), t
));
1527 /* Otherwise insert this one into the hash table. */
1533 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1534 and the rest are zeros. */
1537 build_low_bits_mask (tree type
, unsigned bits
)
1539 gcc_assert (bits
<= TYPE_PRECISION (type
));
1541 return wide_int_to_tree (type
, wi::mask (bits
, false,
1542 TYPE_PRECISION (type
)));
1545 /* Checks that X is integer constant that can be expressed in (unsigned)
1546 HOST_WIDE_INT without loss of precision. */
1549 cst_and_fits_in_hwi (const_tree x
)
1551 if (TREE_CODE (x
) != INTEGER_CST
)
1554 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1557 return TREE_INT_CST_NUNITS (x
) == 1;
1560 /* Build a newly constructed TREE_VEC node of length LEN. */
1563 make_vector_stat (unsigned len MEM_STAT_DECL
)
1566 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1568 record_node_allocation_statistics (VECTOR_CST
, length
);
1570 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1572 TREE_SET_CODE (t
, VECTOR_CST
);
1573 TREE_CONSTANT (t
) = 1;
1578 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1579 are in a list pointed to by VALS. */
1582 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1586 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1587 TREE_TYPE (v
) = type
;
1589 /* Iterate through elements and check for overflow. */
1590 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1592 tree value
= vals
[cnt
];
1594 VECTOR_CST_ELT (v
, cnt
) = value
;
1596 /* Don't crash if we get an address constant. */
1597 if (!CONSTANT_CLASS_P (value
))
1600 over
|= TREE_OVERFLOW (value
);
1603 TREE_OVERFLOW (v
) = over
;
1607 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1608 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1611 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1613 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1614 unsigned HOST_WIDE_INT idx
;
1617 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1619 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1620 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1622 return build_vector (type
, vec
);
1625 /* Build a vector of type VECTYPE where all the elements are SCs. */
1627 build_vector_from_val (tree vectype
, tree sc
)
1629 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1631 if (sc
== error_mark_node
)
1634 /* Verify that the vector type is suitable for SC. Note that there
1635 is some inconsistency in the type-system with respect to restrict
1636 qualifications of pointers. Vector types always have a main-variant
1637 element type and the qualification is applied to the vector-type.
1638 So TREE_TYPE (vector-type) does not return a properly qualified
1639 vector element-type. */
1640 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1641 TREE_TYPE (vectype
)));
1643 if (CONSTANT_CLASS_P (sc
))
1645 tree
*v
= XALLOCAVEC (tree
, nunits
);
1646 for (i
= 0; i
< nunits
; ++i
)
1648 return build_vector (vectype
, v
);
1652 vec
<constructor_elt
, va_gc
> *v
;
1653 vec_alloc (v
, nunits
);
1654 for (i
= 0; i
< nunits
; ++i
)
1655 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1656 return build_constructor (vectype
, v
);
1660 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1661 are in the vec pointed to by VALS. */
1663 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1665 tree c
= make_node (CONSTRUCTOR
);
1667 constructor_elt
*elt
;
1668 bool constant_p
= true;
1669 bool side_effects_p
= false;
1671 TREE_TYPE (c
) = type
;
1672 CONSTRUCTOR_ELTS (c
) = vals
;
1674 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1676 /* Mostly ctors will have elts that don't have side-effects, so
1677 the usual case is to scan all the elements. Hence a single
1678 loop for both const and side effects, rather than one loop
1679 each (with early outs). */
1680 if (!TREE_CONSTANT (elt
->value
))
1682 if (TREE_SIDE_EFFECTS (elt
->value
))
1683 side_effects_p
= true;
1686 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1687 TREE_CONSTANT (c
) = constant_p
;
1692 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1695 build_constructor_single (tree type
, tree index
, tree value
)
1697 vec
<constructor_elt
, va_gc
> *v
;
1698 constructor_elt elt
= {index
, value
};
1701 v
->quick_push (elt
);
1703 return build_constructor (type
, v
);
1707 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1708 are in a list pointed to by VALS. */
1710 build_constructor_from_list (tree type
, tree vals
)
1713 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1717 vec_alloc (v
, list_length (vals
));
1718 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1719 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1722 return build_constructor (type
, v
);
1725 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1726 of elements, provided as index/value pairs. */
1729 build_constructor_va (tree type
, int nelts
, ...)
1731 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1734 va_start (p
, nelts
);
1735 vec_alloc (v
, nelts
);
1738 tree index
= va_arg (p
, tree
);
1739 tree value
= va_arg (p
, tree
);
1740 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1743 return build_constructor (type
, v
);
1746 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1749 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1752 FIXED_VALUE_TYPE
*fp
;
1754 v
= make_node (FIXED_CST
);
1755 fp
= ggc_alloc
<fixed_value
> ();
1756 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1758 TREE_TYPE (v
) = type
;
1759 TREE_FIXED_CST_PTR (v
) = fp
;
1763 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1766 build_real (tree type
, REAL_VALUE_TYPE d
)
1769 REAL_VALUE_TYPE
*dp
;
1772 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1773 Consider doing it via real_convert now. */
1775 v
= make_node (REAL_CST
);
1776 dp
= ggc_alloc
<real_value
> ();
1777 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1779 TREE_TYPE (v
) = type
;
1780 TREE_REAL_CST_PTR (v
) = dp
;
1781 TREE_OVERFLOW (v
) = overflow
;
1785 /* Return a new REAL_CST node whose type is TYPE
1786 and whose value is the integer value of the INTEGER_CST node I. */
1789 real_value_from_int_cst (const_tree type
, const_tree i
)
1793 /* Clear all bits of the real value type so that we can later do
1794 bitwise comparisons to see if two values are the same. */
1795 memset (&d
, 0, sizeof d
);
1797 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1798 TYPE_SIGN (TREE_TYPE (i
)));
1802 /* Given a tree representing an integer constant I, return a tree
1803 representing the same value as a floating-point constant of type TYPE. */
1806 build_real_from_int_cst (tree type
, const_tree i
)
1809 int overflow
= TREE_OVERFLOW (i
);
1811 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1813 TREE_OVERFLOW (v
) |= overflow
;
1817 /* Return a newly constructed STRING_CST node whose value is
1818 the LEN characters at STR.
1819 Note that for a C string literal, LEN should include the trailing NUL.
1820 The TREE_TYPE is not initialized. */
1823 build_string (int len
, const char *str
)
1828 /* Do not waste bytes provided by padding of struct tree_string. */
1829 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1831 record_node_allocation_statistics (STRING_CST
, length
);
1833 s
= (tree
) ggc_internal_alloc (length
);
1835 memset (s
, 0, sizeof (struct tree_typed
));
1836 TREE_SET_CODE (s
, STRING_CST
);
1837 TREE_CONSTANT (s
) = 1;
1838 TREE_STRING_LENGTH (s
) = len
;
1839 memcpy (s
->string
.str
, str
, len
);
1840 s
->string
.str
[len
] = '\0';
1845 /* Return a newly constructed COMPLEX_CST node whose value is
1846 specified by the real and imaginary parts REAL and IMAG.
1847 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1848 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1851 build_complex (tree type
, tree real
, tree imag
)
1853 tree t
= make_node (COMPLEX_CST
);
1855 TREE_REALPART (t
) = real
;
1856 TREE_IMAGPART (t
) = imag
;
1857 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1858 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1862 /* Return a constant of arithmetic type TYPE which is the
1863 multiplicative identity of the set TYPE. */
1866 build_one_cst (tree type
)
1868 switch (TREE_CODE (type
))
1870 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1871 case POINTER_TYPE
: case REFERENCE_TYPE
:
1873 return build_int_cst (type
, 1);
1876 return build_real (type
, dconst1
);
1878 case FIXED_POINT_TYPE
:
1879 /* We can only generate 1 for accum types. */
1880 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1881 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1885 tree scalar
= build_one_cst (TREE_TYPE (type
));
1887 return build_vector_from_val (type
, scalar
);
1891 return build_complex (type
,
1892 build_one_cst (TREE_TYPE (type
)),
1893 build_zero_cst (TREE_TYPE (type
)));
1900 /* Return an integer of type TYPE containing all 1's in as much precision as
1901 it contains, or a complex or vector whose subparts are such integers. */
1904 build_all_ones_cst (tree type
)
1906 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1908 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1909 return build_complex (type
, scalar
, scalar
);
1912 return build_minus_one_cst (type
);
1915 /* Return a constant of arithmetic type TYPE which is the
1916 opposite of the multiplicative identity of the set TYPE. */
1919 build_minus_one_cst (tree type
)
1921 switch (TREE_CODE (type
))
1923 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1924 case POINTER_TYPE
: case REFERENCE_TYPE
:
1926 return build_int_cst (type
, -1);
1929 return build_real (type
, dconstm1
);
1931 case FIXED_POINT_TYPE
:
1932 /* We can only generate 1 for accum types. */
1933 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1934 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1939 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1941 return build_vector_from_val (type
, scalar
);
1945 return build_complex (type
,
1946 build_minus_one_cst (TREE_TYPE (type
)),
1947 build_zero_cst (TREE_TYPE (type
)));
1954 /* Build 0 constant of type TYPE. This is used by constructor folding
1955 and thus the constant should be represented in memory by
1959 build_zero_cst (tree type
)
1961 switch (TREE_CODE (type
))
1963 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1964 case POINTER_TYPE
: case REFERENCE_TYPE
:
1965 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1966 return build_int_cst (type
, 0);
1969 return build_real (type
, dconst0
);
1971 case FIXED_POINT_TYPE
:
1972 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1976 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1978 return build_vector_from_val (type
, scalar
);
1983 tree zero
= build_zero_cst (TREE_TYPE (type
));
1985 return build_complex (type
, zero
, zero
);
1989 if (!AGGREGATE_TYPE_P (type
))
1990 return fold_convert (type
, integer_zero_node
);
1991 return build_constructor (type
, NULL
);
1996 /* Build a BINFO with LEN language slots. */
1999 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2002 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2003 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2005 record_node_allocation_statistics (TREE_BINFO
, length
);
2007 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2009 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2011 TREE_SET_CODE (t
, TREE_BINFO
);
2013 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2018 /* Create a CASE_LABEL_EXPR tree node and return it. */
2021 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2023 tree t
= make_node (CASE_LABEL_EXPR
);
2025 TREE_TYPE (t
) = void_type_node
;
2026 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2028 CASE_LOW (t
) = low_value
;
2029 CASE_HIGH (t
) = high_value
;
2030 CASE_LABEL (t
) = label_decl
;
2031 CASE_CHAIN (t
) = NULL_TREE
;
2036 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2037 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2038 The latter determines the length of the HOST_WIDE_INT vector. */
2041 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2044 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2045 + sizeof (struct tree_int_cst
));
2048 record_node_allocation_statistics (INTEGER_CST
, length
);
2050 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2052 TREE_SET_CODE (t
, INTEGER_CST
);
2053 TREE_INT_CST_NUNITS (t
) = len
;
2054 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2055 /* to_offset can only be applied to trees that are offset_int-sized
2056 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2057 must be exactly the precision of offset_int and so LEN is correct. */
2058 if (ext_len
<= OFFSET_INT_ELTS
)
2059 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2061 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2063 TREE_CONSTANT (t
) = 1;
2068 /* Build a newly constructed TREE_VEC node of length LEN. */
2071 make_tree_vec_stat (int len MEM_STAT_DECL
)
2074 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2076 record_node_allocation_statistics (TREE_VEC
, length
);
2078 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2080 TREE_SET_CODE (t
, TREE_VEC
);
2081 TREE_VEC_LENGTH (t
) = len
;
2086 /* Grow a TREE_VEC node to new length LEN. */
2089 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2091 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2093 int oldlen
= TREE_VEC_LENGTH (v
);
2094 gcc_assert (len
> oldlen
);
2096 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2097 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2099 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2101 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2103 TREE_VEC_LENGTH (v
) = len
;
2108 /* Return 1 if EXPR is the integer constant zero or a complex constant
2112 integer_zerop (const_tree expr
)
2116 switch (TREE_CODE (expr
))
2119 return wi::eq_p (expr
, 0);
2121 return (integer_zerop (TREE_REALPART (expr
))
2122 && integer_zerop (TREE_IMAGPART (expr
)));
2126 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2127 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2136 /* Return 1 if EXPR is the integer constant one or the corresponding
2137 complex constant. */
2140 integer_onep (const_tree expr
)
2144 switch (TREE_CODE (expr
))
2147 return wi::eq_p (wi::to_widest (expr
), 1);
2149 return (integer_onep (TREE_REALPART (expr
))
2150 && integer_zerop (TREE_IMAGPART (expr
)));
2154 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2155 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2164 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2165 it contains, or a complex or vector whose subparts are such integers. */
2168 integer_all_onesp (const_tree expr
)
2172 if (TREE_CODE (expr
) == COMPLEX_CST
2173 && integer_all_onesp (TREE_REALPART (expr
))
2174 && integer_all_onesp (TREE_IMAGPART (expr
)))
2177 else if (TREE_CODE (expr
) == VECTOR_CST
)
2180 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2181 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2186 else if (TREE_CODE (expr
) != INTEGER_CST
)
2189 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2192 /* Return 1 if EXPR is the integer constant minus one. */
2195 integer_minus_onep (const_tree expr
)
2199 if (TREE_CODE (expr
) == COMPLEX_CST
)
2200 return (integer_all_onesp (TREE_REALPART (expr
))
2201 && integer_zerop (TREE_IMAGPART (expr
)));
2203 return integer_all_onesp (expr
);
2206 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2210 integer_pow2p (const_tree expr
)
2214 if (TREE_CODE (expr
) == COMPLEX_CST
2215 && integer_pow2p (TREE_REALPART (expr
))
2216 && integer_zerop (TREE_IMAGPART (expr
)))
2219 if (TREE_CODE (expr
) != INTEGER_CST
)
2222 return wi::popcount (expr
) == 1;
2225 /* Return 1 if EXPR is an integer constant other than zero or a
2226 complex constant other than zero. */
2229 integer_nonzerop (const_tree expr
)
2233 return ((TREE_CODE (expr
) == INTEGER_CST
2234 && !wi::eq_p (expr
, 0))
2235 || (TREE_CODE (expr
) == COMPLEX_CST
2236 && (integer_nonzerop (TREE_REALPART (expr
))
2237 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2240 /* Return 1 if EXPR is the fixed-point constant zero. */
2243 fixed_zerop (const_tree expr
)
2245 return (TREE_CODE (expr
) == FIXED_CST
2246 && TREE_FIXED_CST (expr
).data
.is_zero ());
2249 /* Return the power of two represented by a tree node known to be a
2253 tree_log2 (const_tree expr
)
2257 if (TREE_CODE (expr
) == COMPLEX_CST
)
2258 return tree_log2 (TREE_REALPART (expr
));
2260 return wi::exact_log2 (expr
);
2263 /* Similar, but return the largest integer Y such that 2 ** Y is less
2264 than or equal to EXPR. */
2267 tree_floor_log2 (const_tree expr
)
2271 if (TREE_CODE (expr
) == COMPLEX_CST
)
2272 return tree_log2 (TREE_REALPART (expr
));
2274 return wi::floor_log2 (expr
);
2277 /* Return number of known trailing zero bits in EXPR, or, if the value of
2278 EXPR is known to be zero, the precision of it's type. */
2281 tree_ctz (const_tree expr
)
2283 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2284 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2287 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2288 switch (TREE_CODE (expr
))
2291 ret1
= wi::ctz (expr
);
2292 return MIN (ret1
, prec
);
2294 ret1
= wi::ctz (get_nonzero_bits (expr
));
2295 return MIN (ret1
, prec
);
2302 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2305 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2306 return MIN (ret1
, ret2
);
2307 case POINTER_PLUS_EXPR
:
2308 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2309 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2310 /* Second operand is sizetype, which could be in theory
2311 wider than pointer's precision. Make sure we never
2312 return more than prec. */
2313 ret2
= MIN (ret2
, prec
);
2314 return MIN (ret1
, ret2
);
2316 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2317 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2318 return MAX (ret1
, ret2
);
2320 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2321 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2322 return MIN (ret1
+ ret2
, prec
);
2324 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2325 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2326 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2328 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2329 return MIN (ret1
+ ret2
, prec
);
2333 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2334 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2336 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2337 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2342 case TRUNC_DIV_EXPR
:
2344 case FLOOR_DIV_EXPR
:
2345 case ROUND_DIV_EXPR
:
2346 case EXACT_DIV_EXPR
:
2347 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2348 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2350 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2353 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2361 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2362 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2364 return MIN (ret1
, prec
);
2366 return tree_ctz (TREE_OPERAND (expr
, 0));
2368 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2371 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2372 return MIN (ret1
, ret2
);
2374 return tree_ctz (TREE_OPERAND (expr
, 1));
2376 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2377 if (ret1
> BITS_PER_UNIT
)
2379 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2380 return MIN (ret1
, prec
);
2388 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2389 decimal float constants, so don't return 1 for them. */
2392 real_zerop (const_tree expr
)
2396 switch (TREE_CODE (expr
))
2399 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2400 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2402 return real_zerop (TREE_REALPART (expr
))
2403 && real_zerop (TREE_IMAGPART (expr
));
2407 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2408 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2417 /* Return 1 if EXPR is the real constant one in real or complex form.
2418 Trailing zeroes matter for decimal float constants, so don't return
2422 real_onep (const_tree expr
)
2426 switch (TREE_CODE (expr
))
2429 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2430 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2432 return real_onep (TREE_REALPART (expr
))
2433 && real_zerop (TREE_IMAGPART (expr
));
2437 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2438 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2447 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2448 matter for decimal float constants, so don't return 1 for them. */
2451 real_minus_onep (const_tree expr
)
2455 switch (TREE_CODE (expr
))
2458 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2459 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2461 return real_minus_onep (TREE_REALPART (expr
))
2462 && real_zerop (TREE_IMAGPART (expr
));
2466 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2467 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2476 /* Nonzero if EXP is a constant or a cast of a constant. */
2479 really_constant_p (const_tree exp
)
2481 /* This is not quite the same as STRIP_NOPS. It does more. */
2482 while (CONVERT_EXPR_P (exp
)
2483 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2484 exp
= TREE_OPERAND (exp
, 0);
2485 return TREE_CONSTANT (exp
);
2488 /* Return first list element whose TREE_VALUE is ELEM.
2489 Return 0 if ELEM is not in LIST. */
2492 value_member (tree elem
, tree list
)
2496 if (elem
== TREE_VALUE (list
))
2498 list
= TREE_CHAIN (list
);
2503 /* Return first list element whose TREE_PURPOSE is ELEM.
2504 Return 0 if ELEM is not in LIST. */
2507 purpose_member (const_tree elem
, tree list
)
2511 if (elem
== TREE_PURPOSE (list
))
2513 list
= TREE_CHAIN (list
);
2518 /* Return true if ELEM is in V. */
2521 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2525 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2531 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2535 chain_index (int idx
, tree chain
)
2537 for (; chain
&& idx
> 0; --idx
)
2538 chain
= TREE_CHAIN (chain
);
2542 /* Return nonzero if ELEM is part of the chain CHAIN. */
2545 chain_member (const_tree elem
, const_tree chain
)
2551 chain
= DECL_CHAIN (chain
);
2557 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2558 We expect a null pointer to mark the end of the chain.
2559 This is the Lisp primitive `length'. */
2562 list_length (const_tree t
)
2565 #ifdef ENABLE_TREE_CHECKING
2573 #ifdef ENABLE_TREE_CHECKING
2576 gcc_assert (p
!= q
);
2584 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2585 UNION_TYPE TYPE, or NULL_TREE if none. */
2588 first_field (const_tree type
)
2590 tree t
= TYPE_FIELDS (type
);
2591 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2596 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2597 by modifying the last node in chain 1 to point to chain 2.
2598 This is the Lisp primitive `nconc'. */
2601 chainon (tree op1
, tree op2
)
2610 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2612 TREE_CHAIN (t1
) = op2
;
2614 #ifdef ENABLE_TREE_CHECKING
2617 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2618 gcc_assert (t2
!= t1
);
2625 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2628 tree_last (tree chain
)
2632 while ((next
= TREE_CHAIN (chain
)))
2637 /* Reverse the order of elements in the chain T,
2638 and return the new head of the chain (old last element). */
2643 tree prev
= 0, decl
, next
;
2644 for (decl
= t
; decl
; decl
= next
)
2646 /* We shouldn't be using this function to reverse BLOCK chains; we
2647 have blocks_nreverse for that. */
2648 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2649 next
= TREE_CHAIN (decl
);
2650 TREE_CHAIN (decl
) = prev
;
2656 /* Return a newly created TREE_LIST node whose
2657 purpose and value fields are PARM and VALUE. */
2660 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2662 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2663 TREE_PURPOSE (t
) = parm
;
2664 TREE_VALUE (t
) = value
;
2668 /* Build a chain of TREE_LIST nodes from a vector. */
2671 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2673 tree ret
= NULL_TREE
;
2677 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2679 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2680 pp
= &TREE_CHAIN (*pp
);
2685 /* Return a newly created TREE_LIST node whose
2686 purpose and value fields are PURPOSE and VALUE
2687 and whose TREE_CHAIN is CHAIN. */
2690 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2694 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2695 memset (node
, 0, sizeof (struct tree_common
));
2697 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2699 TREE_SET_CODE (node
, TREE_LIST
);
2700 TREE_CHAIN (node
) = chain
;
2701 TREE_PURPOSE (node
) = purpose
;
2702 TREE_VALUE (node
) = value
;
2706 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2710 ctor_to_vec (tree ctor
)
2712 vec
<tree
, va_gc
> *vec
;
2713 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2717 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2718 vec
->quick_push (val
);
2723 /* Return the size nominally occupied by an object of type TYPE
2724 when it resides in memory. The value is measured in units of bytes,
2725 and its data type is that normally used for type sizes
2726 (which is the first type created by make_signed_type or
2727 make_unsigned_type). */
2730 size_in_bytes (const_tree type
)
2734 if (type
== error_mark_node
)
2735 return integer_zero_node
;
2737 type
= TYPE_MAIN_VARIANT (type
);
2738 t
= TYPE_SIZE_UNIT (type
);
2742 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2743 return size_zero_node
;
2749 /* Return the size of TYPE (in bytes) as a wide integer
2750 or return -1 if the size can vary or is larger than an integer. */
2753 int_size_in_bytes (const_tree type
)
2757 if (type
== error_mark_node
)
2760 type
= TYPE_MAIN_VARIANT (type
);
2761 t
= TYPE_SIZE_UNIT (type
);
2763 if (t
&& tree_fits_uhwi_p (t
))
2764 return TREE_INT_CST_LOW (t
);
2769 /* Return the maximum size of TYPE (in bytes) as a wide integer
2770 or return -1 if the size can vary or is larger than an integer. */
2773 max_int_size_in_bytes (const_tree type
)
2775 HOST_WIDE_INT size
= -1;
2778 /* If this is an array type, check for a possible MAX_SIZE attached. */
2780 if (TREE_CODE (type
) == ARRAY_TYPE
)
2782 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2784 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2785 size
= tree_to_uhwi (size_tree
);
2788 /* If we still haven't been able to get a size, see if the language
2789 can compute a maximum size. */
2793 size_tree
= lang_hooks
.types
.max_size (type
);
2795 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2796 size
= tree_to_uhwi (size_tree
);
2802 /* Return the bit position of FIELD, in bits from the start of the record.
2803 This is a tree of type bitsizetype. */
2806 bit_position (const_tree field
)
2808 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2809 DECL_FIELD_BIT_OFFSET (field
));
2812 /* Likewise, but return as an integer. It must be representable in
2813 that way (since it could be a signed value, we don't have the
2814 option of returning -1 like int_size_in_byte can. */
2817 int_bit_position (const_tree field
)
2819 return tree_to_shwi (bit_position (field
));
2822 /* Return the byte position of FIELD, in bytes from the start of the record.
2823 This is a tree of type sizetype. */
2826 byte_position (const_tree field
)
2828 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2829 DECL_FIELD_BIT_OFFSET (field
));
2832 /* Likewise, but return as an integer. It must be representable in
2833 that way (since it could be a signed value, we don't have the
2834 option of returning -1 like int_size_in_byte can. */
2837 int_byte_position (const_tree field
)
2839 return tree_to_shwi (byte_position (field
));
2842 /* Return the strictest alignment, in bits, that T is known to have. */
2845 expr_align (const_tree t
)
2847 unsigned int align0
, align1
;
2849 switch (TREE_CODE (t
))
2851 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2852 /* If we have conversions, we know that the alignment of the
2853 object must meet each of the alignments of the types. */
2854 align0
= expr_align (TREE_OPERAND (t
, 0));
2855 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2856 return MAX (align0
, align1
);
2858 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2859 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2860 case CLEANUP_POINT_EXPR
:
2861 /* These don't change the alignment of an object. */
2862 return expr_align (TREE_OPERAND (t
, 0));
2865 /* The best we can do is say that the alignment is the least aligned
2867 align0
= expr_align (TREE_OPERAND (t
, 1));
2868 align1
= expr_align (TREE_OPERAND (t
, 2));
2869 return MIN (align0
, align1
);
2871 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2872 meaningfully, it's always 1. */
2873 case LABEL_DECL
: case CONST_DECL
:
2874 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2876 gcc_assert (DECL_ALIGN (t
) != 0);
2877 return DECL_ALIGN (t
);
2883 /* Otherwise take the alignment from that of the type. */
2884 return TYPE_ALIGN (TREE_TYPE (t
));
2887 /* Return, as a tree node, the number of elements for TYPE (which is an
2888 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2891 array_type_nelts (const_tree type
)
2893 tree index_type
, min
, max
;
2895 /* If they did it with unspecified bounds, then we should have already
2896 given an error about it before we got here. */
2897 if (! TYPE_DOMAIN (type
))
2898 return error_mark_node
;
2900 index_type
= TYPE_DOMAIN (type
);
2901 min
= TYPE_MIN_VALUE (index_type
);
2902 max
= TYPE_MAX_VALUE (index_type
);
2904 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2906 return error_mark_node
;
2908 return (integer_zerop (min
)
2910 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2913 /* If arg is static -- a reference to an object in static storage -- then
2914 return the object. This is not the same as the C meaning of `static'.
2915 If arg isn't static, return NULL. */
2920 switch (TREE_CODE (arg
))
2923 /* Nested functions are static, even though taking their address will
2924 involve a trampoline as we unnest the nested function and create
2925 the trampoline on the tree level. */
2929 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2930 && ! DECL_THREAD_LOCAL_P (arg
)
2931 && ! DECL_DLLIMPORT_P (arg
)
2935 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2939 return TREE_STATIC (arg
) ? arg
: NULL
;
2946 /* If the thing being referenced is not a field, then it is
2947 something language specific. */
2948 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2950 /* If we are referencing a bitfield, we can't evaluate an
2951 ADDR_EXPR at compile time and so it isn't a constant. */
2952 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2955 return staticp (TREE_OPERAND (arg
, 0));
2961 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2964 case ARRAY_RANGE_REF
:
2965 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2966 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2967 return staticp (TREE_OPERAND (arg
, 0));
2971 case COMPOUND_LITERAL_EXPR
:
2972 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2982 /* Return whether OP is a DECL whose address is function-invariant. */
2985 decl_address_invariant_p (const_tree op
)
2987 /* The conditions below are slightly less strict than the one in
2990 switch (TREE_CODE (op
))
2999 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3000 || DECL_THREAD_LOCAL_P (op
)
3001 || DECL_CONTEXT (op
) == current_function_decl
3002 || decl_function_context (op
) == current_function_decl
)
3007 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3008 || decl_function_context (op
) == current_function_decl
)
3019 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3022 decl_address_ip_invariant_p (const_tree op
)
3024 /* The conditions below are slightly less strict than the one in
3027 switch (TREE_CODE (op
))
3035 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3036 && !DECL_DLLIMPORT_P (op
))
3037 || DECL_THREAD_LOCAL_P (op
))
3042 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3054 /* Return true if T is function-invariant (internal function, does
3055 not handle arithmetic; that's handled in skip_simple_arithmetic and
3056 tree_invariant_p). */
3058 static bool tree_invariant_p (tree t
);
3061 tree_invariant_p_1 (tree t
)
3065 if (TREE_CONSTANT (t
)
3066 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3069 switch (TREE_CODE (t
))
3075 op
= TREE_OPERAND (t
, 0);
3076 while (handled_component_p (op
))
3078 switch (TREE_CODE (op
))
3081 case ARRAY_RANGE_REF
:
3082 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3083 || TREE_OPERAND (op
, 2) != NULL_TREE
3084 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3089 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3095 op
= TREE_OPERAND (op
, 0);
3098 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3107 /* Return true if T is function-invariant. */
3110 tree_invariant_p (tree t
)
3112 tree inner
= skip_simple_arithmetic (t
);
3113 return tree_invariant_p_1 (inner
);
3116 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3117 Do this to any expression which may be used in more than one place,
3118 but must be evaluated only once.
3120 Normally, expand_expr would reevaluate the expression each time.
3121 Calling save_expr produces something that is evaluated and recorded
3122 the first time expand_expr is called on it. Subsequent calls to
3123 expand_expr just reuse the recorded value.
3125 The call to expand_expr that generates code that actually computes
3126 the value is the first call *at compile time*. Subsequent calls
3127 *at compile time* generate code to use the saved value.
3128 This produces correct result provided that *at run time* control
3129 always flows through the insns made by the first expand_expr
3130 before reaching the other places where the save_expr was evaluated.
3131 You, the caller of save_expr, must make sure this is so.
3133 Constants, and certain read-only nodes, are returned with no
3134 SAVE_EXPR because that is safe. Expressions containing placeholders
3135 are not touched; see tree.def for an explanation of what these
3139 save_expr (tree expr
)
3141 tree t
= fold (expr
);
3144 /* If the tree evaluates to a constant, then we don't want to hide that
3145 fact (i.e. this allows further folding, and direct checks for constants).
3146 However, a read-only object that has side effects cannot be bypassed.
3147 Since it is no problem to reevaluate literals, we just return the
3149 inner
= skip_simple_arithmetic (t
);
3150 if (TREE_CODE (inner
) == ERROR_MARK
)
3153 if (tree_invariant_p_1 (inner
))
3156 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3157 it means that the size or offset of some field of an object depends on
3158 the value within another field.
3160 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3161 and some variable since it would then need to be both evaluated once and
3162 evaluated more than once. Front-ends must assure this case cannot
3163 happen by surrounding any such subexpressions in their own SAVE_EXPR
3164 and forcing evaluation at the proper time. */
3165 if (contains_placeholder_p (inner
))
3168 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3169 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3171 /* This expression might be placed ahead of a jump to ensure that the
3172 value was computed on both sides of the jump. So make sure it isn't
3173 eliminated as dead. */
3174 TREE_SIDE_EFFECTS (t
) = 1;
3178 /* Look inside EXPR into any simple arithmetic operations. Return the
3179 outermost non-arithmetic or non-invariant node. */
3182 skip_simple_arithmetic (tree expr
)
3184 /* We don't care about whether this can be used as an lvalue in this
3186 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3187 expr
= TREE_OPERAND (expr
, 0);
3189 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3190 a constant, it will be more efficient to not make another SAVE_EXPR since
3191 it will allow better simplification and GCSE will be able to merge the
3192 computations if they actually occur. */
3195 if (UNARY_CLASS_P (expr
))
3196 expr
= TREE_OPERAND (expr
, 0);
3197 else if (BINARY_CLASS_P (expr
))
3199 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3200 expr
= TREE_OPERAND (expr
, 0);
3201 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3202 expr
= TREE_OPERAND (expr
, 1);
3213 /* Look inside EXPR into simple arithmetic operations involving constants.
3214 Return the outermost non-arithmetic or non-constant node. */
3217 skip_simple_constant_arithmetic (tree expr
)
3219 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3220 expr
= TREE_OPERAND (expr
, 0);
3224 if (UNARY_CLASS_P (expr
))
3225 expr
= TREE_OPERAND (expr
, 0);
3226 else if (BINARY_CLASS_P (expr
))
3228 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3229 expr
= TREE_OPERAND (expr
, 0);
3230 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3231 expr
= TREE_OPERAND (expr
, 1);
3242 /* Return which tree structure is used by T. */
3244 enum tree_node_structure_enum
3245 tree_node_structure (const_tree t
)
3247 const enum tree_code code
= TREE_CODE (t
);
3248 return tree_node_structure_for_code (code
);
3251 /* Set various status flags when building a CALL_EXPR object T. */
3254 process_call_operands (tree t
)
3256 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3257 bool read_only
= false;
3258 int i
= call_expr_flags (t
);
3260 /* Calls have side-effects, except those to const or pure functions. */
3261 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3262 side_effects
= true;
3263 /* Propagate TREE_READONLY of arguments for const functions. */
3267 if (!side_effects
|| read_only
)
3268 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3270 tree op
= TREE_OPERAND (t
, i
);
3271 if (op
&& TREE_SIDE_EFFECTS (op
))
3272 side_effects
= true;
3273 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3277 TREE_SIDE_EFFECTS (t
) = side_effects
;
3278 TREE_READONLY (t
) = read_only
;
3281 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3282 size or offset that depends on a field within a record. */
3285 contains_placeholder_p (const_tree exp
)
3287 enum tree_code code
;
3292 code
= TREE_CODE (exp
);
3293 if (code
== PLACEHOLDER_EXPR
)
3296 switch (TREE_CODE_CLASS (code
))
3299 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3300 position computations since they will be converted into a
3301 WITH_RECORD_EXPR involving the reference, which will assume
3302 here will be valid. */
3303 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3305 case tcc_exceptional
:
3306 if (code
== TREE_LIST
)
3307 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3308 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3313 case tcc_comparison
:
3314 case tcc_expression
:
3318 /* Ignoring the first operand isn't quite right, but works best. */
3319 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3322 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3323 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3324 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3327 /* The save_expr function never wraps anything containing
3328 a PLACEHOLDER_EXPR. */
3335 switch (TREE_CODE_LENGTH (code
))
3338 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3340 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3341 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3352 const_call_expr_arg_iterator iter
;
3353 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3354 if (CONTAINS_PLACEHOLDER_P (arg
))
3368 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3369 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3373 type_contains_placeholder_1 (const_tree type
)
3375 /* If the size contains a placeholder or the parent type (component type in
3376 the case of arrays) type involves a placeholder, this type does. */
3377 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3378 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3379 || (!POINTER_TYPE_P (type
)
3381 && type_contains_placeholder_p (TREE_TYPE (type
))))
3384 /* Now do type-specific checks. Note that the last part of the check above
3385 greatly limits what we have to do below. */
3386 switch (TREE_CODE (type
))
3394 case REFERENCE_TYPE
:
3403 case FIXED_POINT_TYPE
:
3404 /* Here we just check the bounds. */
3405 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3406 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3409 /* We have already checked the component type above, so just check the
3411 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3415 case QUAL_UNION_TYPE
:
3419 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3420 if (TREE_CODE (field
) == FIELD_DECL
3421 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3422 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3423 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3424 || type_contains_placeholder_p (TREE_TYPE (field
))))
3435 /* Wrapper around above function used to cache its result. */
3438 type_contains_placeholder_p (tree type
)
3442 /* If the contains_placeholder_bits field has been initialized,
3443 then we know the answer. */
3444 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3445 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3447 /* Indicate that we've seen this type node, and the answer is false.
3448 This is what we want to return if we run into recursion via fields. */
3449 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3451 /* Compute the real value. */
3452 result
= type_contains_placeholder_1 (type
);
3454 /* Store the real value. */
3455 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3460 /* Push tree EXP onto vector QUEUE if it is not already present. */
3463 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3468 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3469 if (simple_cst_equal (iter
, exp
) == 1)
3473 queue
->safe_push (exp
);
3476 /* Given a tree EXP, find all occurrences of references to fields
3477 in a PLACEHOLDER_EXPR and place them in vector REFS without
3478 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3479 we assume here that EXP contains only arithmetic expressions
3480 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3484 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3486 enum tree_code code
= TREE_CODE (exp
);
3490 /* We handle TREE_LIST and COMPONENT_REF separately. */
3491 if (code
== TREE_LIST
)
3493 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3494 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3496 else if (code
== COMPONENT_REF
)
3498 for (inner
= TREE_OPERAND (exp
, 0);
3499 REFERENCE_CLASS_P (inner
);
3500 inner
= TREE_OPERAND (inner
, 0))
3503 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3504 push_without_duplicates (exp
, refs
);
3506 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3509 switch (TREE_CODE_CLASS (code
))
3514 case tcc_declaration
:
3515 /* Variables allocated to static storage can stay. */
3516 if (!TREE_STATIC (exp
))
3517 push_without_duplicates (exp
, refs
);
3520 case tcc_expression
:
3521 /* This is the pattern built in ada/make_aligning_type. */
3522 if (code
== ADDR_EXPR
3523 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3525 push_without_duplicates (exp
, refs
);
3529 /* Fall through... */
3531 case tcc_exceptional
:
3534 case tcc_comparison
:
3536 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3537 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3541 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3542 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3550 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3551 return a tree with all occurrences of references to F in a
3552 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3553 CONST_DECLs. Note that we assume here that EXP contains only
3554 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3555 occurring only in their argument list. */
3558 substitute_in_expr (tree exp
, tree f
, tree r
)
3560 enum tree_code code
= TREE_CODE (exp
);
3561 tree op0
, op1
, op2
, op3
;
3564 /* We handle TREE_LIST and COMPONENT_REF separately. */
3565 if (code
== TREE_LIST
)
3567 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3568 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3569 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3572 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3574 else if (code
== COMPONENT_REF
)
3578 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3579 and it is the right field, replace it with R. */
3580 for (inner
= TREE_OPERAND (exp
, 0);
3581 REFERENCE_CLASS_P (inner
);
3582 inner
= TREE_OPERAND (inner
, 0))
3586 op1
= TREE_OPERAND (exp
, 1);
3588 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3591 /* If this expression hasn't been completed let, leave it alone. */
3592 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3595 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3596 if (op0
== TREE_OPERAND (exp
, 0))
3600 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3603 switch (TREE_CODE_CLASS (code
))
3608 case tcc_declaration
:
3614 case tcc_expression
:
3618 /* Fall through... */
3620 case tcc_exceptional
:
3623 case tcc_comparison
:
3625 switch (TREE_CODE_LENGTH (code
))
3631 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3632 if (op0
== TREE_OPERAND (exp
, 0))
3635 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3639 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3640 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3642 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3645 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3649 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3650 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3651 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3653 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3654 && op2
== TREE_OPERAND (exp
, 2))
3657 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3661 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3662 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3663 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3664 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3666 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3667 && op2
== TREE_OPERAND (exp
, 2)
3668 && op3
== TREE_OPERAND (exp
, 3))
3672 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3684 new_tree
= NULL_TREE
;
3686 /* If we are trying to replace F with a constant, inline back
3687 functions which do nothing else than computing a value from
3688 the arguments they are passed. This makes it possible to
3689 fold partially or entirely the replacement expression. */
3690 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3692 tree t
= maybe_inline_call_in_expr (exp
);
3694 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3697 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3699 tree op
= TREE_OPERAND (exp
, i
);
3700 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3704 new_tree
= copy_node (exp
);
3705 TREE_OPERAND (new_tree
, i
) = new_op
;
3711 new_tree
= fold (new_tree
);
3712 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3713 process_call_operands (new_tree
);
3724 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3726 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3727 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3732 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3733 for it within OBJ, a tree that is an object or a chain of references. */
3736 substitute_placeholder_in_expr (tree exp
, tree obj
)
3738 enum tree_code code
= TREE_CODE (exp
);
3739 tree op0
, op1
, op2
, op3
;
3742 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3743 in the chain of OBJ. */
3744 if (code
== PLACEHOLDER_EXPR
)
3746 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3749 for (elt
= obj
; elt
!= 0;
3750 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3751 || TREE_CODE (elt
) == COND_EXPR
)
3752 ? TREE_OPERAND (elt
, 1)
3753 : (REFERENCE_CLASS_P (elt
)
3754 || UNARY_CLASS_P (elt
)
3755 || BINARY_CLASS_P (elt
)
3756 || VL_EXP_CLASS_P (elt
)
3757 || EXPRESSION_CLASS_P (elt
))
3758 ? TREE_OPERAND (elt
, 0) : 0))
3759 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3762 for (elt
= obj
; elt
!= 0;
3763 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3764 || TREE_CODE (elt
) == COND_EXPR
)
3765 ? TREE_OPERAND (elt
, 1)
3766 : (REFERENCE_CLASS_P (elt
)
3767 || UNARY_CLASS_P (elt
)
3768 || BINARY_CLASS_P (elt
)
3769 || VL_EXP_CLASS_P (elt
)
3770 || EXPRESSION_CLASS_P (elt
))
3771 ? TREE_OPERAND (elt
, 0) : 0))
3772 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3773 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3775 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3777 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3778 survives until RTL generation, there will be an error. */
3782 /* TREE_LIST is special because we need to look at TREE_VALUE
3783 and TREE_CHAIN, not TREE_OPERANDS. */
3784 else if (code
== TREE_LIST
)
3786 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3787 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3788 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3791 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3794 switch (TREE_CODE_CLASS (code
))
3797 case tcc_declaration
:
3800 case tcc_exceptional
:
3803 case tcc_comparison
:
3804 case tcc_expression
:
3807 switch (TREE_CODE_LENGTH (code
))
3813 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3814 if (op0
== TREE_OPERAND (exp
, 0))
3817 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3821 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3822 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3824 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3827 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3831 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3832 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3833 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3835 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3836 && op2
== TREE_OPERAND (exp
, 2))
3839 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3843 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3844 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3845 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3846 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3848 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3849 && op2
== TREE_OPERAND (exp
, 2)
3850 && op3
== TREE_OPERAND (exp
, 3))
3854 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3866 new_tree
= NULL_TREE
;
3868 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3870 tree op
= TREE_OPERAND (exp
, i
);
3871 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3875 new_tree
= copy_node (exp
);
3876 TREE_OPERAND (new_tree
, i
) = new_op
;
3882 new_tree
= fold (new_tree
);
3883 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3884 process_call_operands (new_tree
);
3895 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3897 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3898 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3904 /* Subroutine of stabilize_reference; this is called for subtrees of
3905 references. Any expression with side-effects must be put in a SAVE_EXPR
3906 to ensure that it is only evaluated once.
3908 We don't put SAVE_EXPR nodes around everything, because assigning very
3909 simple expressions to temporaries causes us to miss good opportunities
3910 for optimizations. Among other things, the opportunity to fold in the
3911 addition of a constant into an addressing mode often gets lost, e.g.
3912 "y[i+1] += x;". In general, we take the approach that we should not make
3913 an assignment unless we are forced into it - i.e., that any non-side effect
3914 operator should be allowed, and that cse should take care of coalescing
3915 multiple utterances of the same expression should that prove fruitful. */
3918 stabilize_reference_1 (tree e
)
3921 enum tree_code code
= TREE_CODE (e
);
3923 /* We cannot ignore const expressions because it might be a reference
3924 to a const array but whose index contains side-effects. But we can
3925 ignore things that are actual constant or that already have been
3926 handled by this function. */
3928 if (tree_invariant_p (e
))
3931 switch (TREE_CODE_CLASS (code
))
3933 case tcc_exceptional
:
3935 case tcc_declaration
:
3936 case tcc_comparison
:
3938 case tcc_expression
:
3941 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3942 so that it will only be evaluated once. */
3943 /* The reference (r) and comparison (<) classes could be handled as
3944 below, but it is generally faster to only evaluate them once. */
3945 if (TREE_SIDE_EFFECTS (e
))
3946 return save_expr (e
);
3950 /* Constants need no processing. In fact, we should never reach
3955 /* Division is slow and tends to be compiled with jumps,
3956 especially the division by powers of 2 that is often
3957 found inside of an array reference. So do it just once. */
3958 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3959 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3960 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3961 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3962 return save_expr (e
);
3963 /* Recursively stabilize each operand. */
3964 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3965 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3969 /* Recursively stabilize each operand. */
3970 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3977 TREE_TYPE (result
) = TREE_TYPE (e
);
3978 TREE_READONLY (result
) = TREE_READONLY (e
);
3979 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3980 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3985 /* Stabilize a reference so that we can use it any number of times
3986 without causing its operands to be evaluated more than once.
3987 Returns the stabilized reference. This works by means of save_expr,
3988 so see the caveats in the comments about save_expr.
3990 Also allows conversion expressions whose operands are references.
3991 Any other kind of expression is returned unchanged. */
3994 stabilize_reference (tree ref
)
3997 enum tree_code code
= TREE_CODE (ref
);
4004 /* No action is needed in this case. */
4009 case FIX_TRUNC_EXPR
:
4010 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4014 result
= build_nt (INDIRECT_REF
,
4015 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4019 result
= build_nt (COMPONENT_REF
,
4020 stabilize_reference (TREE_OPERAND (ref
, 0)),
4021 TREE_OPERAND (ref
, 1), NULL_TREE
);
4025 result
= build_nt (BIT_FIELD_REF
,
4026 stabilize_reference (TREE_OPERAND (ref
, 0)),
4027 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4031 result
= build_nt (ARRAY_REF
,
4032 stabilize_reference (TREE_OPERAND (ref
, 0)),
4033 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4034 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4037 case ARRAY_RANGE_REF
:
4038 result
= build_nt (ARRAY_RANGE_REF
,
4039 stabilize_reference (TREE_OPERAND (ref
, 0)),
4040 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4041 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4045 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4046 it wouldn't be ignored. This matters when dealing with
4048 return stabilize_reference_1 (ref
);
4050 /* If arg isn't a kind of lvalue we recognize, make no change.
4051 Caller should recognize the error for an invalid lvalue. */
4056 return error_mark_node
;
4059 TREE_TYPE (result
) = TREE_TYPE (ref
);
4060 TREE_READONLY (result
) = TREE_READONLY (ref
);
4061 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4062 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4067 /* Low-level constructors for expressions. */
4069 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4070 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4073 recompute_tree_invariant_for_addr_expr (tree t
)
4076 bool tc
= true, se
= false;
4078 /* We started out assuming this address is both invariant and constant, but
4079 does not have side effects. Now go down any handled components and see if
4080 any of them involve offsets that are either non-constant or non-invariant.
4081 Also check for side-effects.
4083 ??? Note that this code makes no attempt to deal with the case where
4084 taking the address of something causes a copy due to misalignment. */
4086 #define UPDATE_FLAGS(NODE) \
4087 do { tree _node = (NODE); \
4088 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4089 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4091 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4092 node
= TREE_OPERAND (node
, 0))
4094 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4095 array reference (probably made temporarily by the G++ front end),
4096 so ignore all the operands. */
4097 if ((TREE_CODE (node
) == ARRAY_REF
4098 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4099 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4101 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4102 if (TREE_OPERAND (node
, 2))
4103 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4104 if (TREE_OPERAND (node
, 3))
4105 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4107 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4108 FIELD_DECL, apparently. The G++ front end can put something else
4109 there, at least temporarily. */
4110 else if (TREE_CODE (node
) == COMPONENT_REF
4111 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4113 if (TREE_OPERAND (node
, 2))
4114 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4118 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4120 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4121 the address, since &(*a)->b is a form of addition. If it's a constant, the
4122 address is constant too. If it's a decl, its address is constant if the
4123 decl is static. Everything else is not constant and, furthermore,
4124 taking the address of a volatile variable is not volatile. */
4125 if (TREE_CODE (node
) == INDIRECT_REF
4126 || TREE_CODE (node
) == MEM_REF
)
4127 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4128 else if (CONSTANT_CLASS_P (node
))
4130 else if (DECL_P (node
))
4131 tc
&= (staticp (node
) != NULL_TREE
);
4135 se
|= TREE_SIDE_EFFECTS (node
);
4139 TREE_CONSTANT (t
) = tc
;
4140 TREE_SIDE_EFFECTS (t
) = se
;
4144 /* Build an expression of code CODE, data type TYPE, and operands as
4145 specified. Expressions and reference nodes can be created this way.
4146 Constants, decls, types and misc nodes cannot be.
4148 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4149 enough for all extant tree codes. */
4152 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4156 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4158 t
= make_node_stat (code PASS_MEM_STAT
);
4165 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4167 int length
= sizeof (struct tree_exp
);
4170 record_node_allocation_statistics (code
, length
);
4172 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4174 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4176 memset (t
, 0, sizeof (struct tree_common
));
4178 TREE_SET_CODE (t
, code
);
4180 TREE_TYPE (t
) = type
;
4181 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4182 TREE_OPERAND (t
, 0) = node
;
4183 if (node
&& !TYPE_P (node
))
4185 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4186 TREE_READONLY (t
) = TREE_READONLY (node
);
4189 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4190 TREE_SIDE_EFFECTS (t
) = 1;
4194 /* All of these have side-effects, no matter what their
4196 TREE_SIDE_EFFECTS (t
) = 1;
4197 TREE_READONLY (t
) = 0;
4201 /* Whether a dereference is readonly has nothing to do with whether
4202 its operand is readonly. */
4203 TREE_READONLY (t
) = 0;
4208 recompute_tree_invariant_for_addr_expr (t
);
4212 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4213 && node
&& !TYPE_P (node
)
4214 && TREE_CONSTANT (node
))
4215 TREE_CONSTANT (t
) = 1;
4216 if (TREE_CODE_CLASS (code
) == tcc_reference
4217 && node
&& TREE_THIS_VOLATILE (node
))
4218 TREE_THIS_VOLATILE (t
) = 1;
4225 #define PROCESS_ARG(N) \
4227 TREE_OPERAND (t, N) = arg##N; \
4228 if (arg##N &&!TYPE_P (arg##N)) \
4230 if (TREE_SIDE_EFFECTS (arg##N)) \
4232 if (!TREE_READONLY (arg##N) \
4233 && !CONSTANT_CLASS_P (arg##N)) \
4234 (void) (read_only = 0); \
4235 if (!TREE_CONSTANT (arg##N)) \
4236 (void) (constant = 0); \
4241 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4243 bool constant
, read_only
, side_effects
;
4246 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4248 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4249 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4250 /* When sizetype precision doesn't match that of pointers
4251 we need to be able to build explicit extensions or truncations
4252 of the offset argument. */
4253 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4254 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4255 && TREE_CODE (arg1
) == INTEGER_CST
);
4257 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4258 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4259 && ptrofftype_p (TREE_TYPE (arg1
)));
4261 t
= make_node_stat (code PASS_MEM_STAT
);
4264 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4265 result based on those same flags for the arguments. But if the
4266 arguments aren't really even `tree' expressions, we shouldn't be trying
4269 /* Expressions without side effects may be constant if their
4270 arguments are as well. */
4271 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4272 || TREE_CODE_CLASS (code
) == tcc_binary
);
4274 side_effects
= TREE_SIDE_EFFECTS (t
);
4279 TREE_READONLY (t
) = read_only
;
4280 TREE_CONSTANT (t
) = constant
;
4281 TREE_SIDE_EFFECTS (t
) = side_effects
;
4282 TREE_THIS_VOLATILE (t
)
4283 = (TREE_CODE_CLASS (code
) == tcc_reference
4284 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4291 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4292 tree arg2 MEM_STAT_DECL
)
4294 bool constant
, read_only
, side_effects
;
4297 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4298 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4300 t
= make_node_stat (code PASS_MEM_STAT
);
4305 /* As a special exception, if COND_EXPR has NULL branches, we
4306 assume that it is a gimple statement and always consider
4307 it to have side effects. */
4308 if (code
== COND_EXPR
4309 && tt
== void_type_node
4310 && arg1
== NULL_TREE
4311 && arg2
== NULL_TREE
)
4312 side_effects
= true;
4314 side_effects
= TREE_SIDE_EFFECTS (t
);
4320 if (code
== COND_EXPR
)
4321 TREE_READONLY (t
) = read_only
;
4323 TREE_SIDE_EFFECTS (t
) = side_effects
;
4324 TREE_THIS_VOLATILE (t
)
4325 = (TREE_CODE_CLASS (code
) == tcc_reference
4326 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4332 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4333 tree arg2
, tree arg3 MEM_STAT_DECL
)
4335 bool constant
, read_only
, side_effects
;
4338 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4340 t
= make_node_stat (code PASS_MEM_STAT
);
4343 side_effects
= TREE_SIDE_EFFECTS (t
);
4350 TREE_SIDE_EFFECTS (t
) = side_effects
;
4351 TREE_THIS_VOLATILE (t
)
4352 = (TREE_CODE_CLASS (code
) == tcc_reference
4353 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4359 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4360 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4362 bool constant
, read_only
, side_effects
;
4365 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4367 t
= make_node_stat (code PASS_MEM_STAT
);
4370 side_effects
= TREE_SIDE_EFFECTS (t
);
4378 TREE_SIDE_EFFECTS (t
) = side_effects
;
4379 TREE_THIS_VOLATILE (t
)
4380 = (TREE_CODE_CLASS (code
) == tcc_reference
4381 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4386 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4387 on the pointer PTR. */
4390 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4392 HOST_WIDE_INT offset
= 0;
4393 tree ptype
= TREE_TYPE (ptr
);
4395 /* For convenience allow addresses that collapse to a simple base
4397 if (TREE_CODE (ptr
) == ADDR_EXPR
4398 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4399 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4401 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4403 ptr
= build_fold_addr_expr (ptr
);
4404 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4406 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4407 ptr
, build_int_cst (ptype
, offset
));
4408 SET_EXPR_LOCATION (tem
, loc
);
4412 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4415 mem_ref_offset (const_tree t
)
4417 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4420 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4421 offsetted by OFFSET units. */
4424 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4426 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4427 build_fold_addr_expr (base
),
4428 build_int_cst (ptr_type_node
, offset
));
4429 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4430 recompute_tree_invariant_for_addr_expr (addr
);
4434 /* Similar except don't specify the TREE_TYPE
4435 and leave the TREE_SIDE_EFFECTS as 0.
4436 It is permissible for arguments to be null,
4437 or even garbage if their values do not matter. */
4440 build_nt (enum tree_code code
, ...)
4447 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4451 t
= make_node (code
);
4452 length
= TREE_CODE_LENGTH (code
);
4454 for (i
= 0; i
< length
; i
++)
4455 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4461 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4465 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4470 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4471 CALL_EXPR_FN (ret
) = fn
;
4472 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4473 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4474 CALL_EXPR_ARG (ret
, ix
) = t
;
4478 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4479 We do NOT enter this node in any sort of symbol table.
4481 LOC is the location of the decl.
4483 layout_decl is used to set up the decl's storage layout.
4484 Other slots are initialized to 0 or null pointers. */
4487 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4488 tree type MEM_STAT_DECL
)
4492 t
= make_node_stat (code PASS_MEM_STAT
);
4493 DECL_SOURCE_LOCATION (t
) = loc
;
4495 /* if (type == error_mark_node)
4496 type = integer_type_node; */
4497 /* That is not done, deliberately, so that having error_mark_node
4498 as the type can suppress useless errors in the use of this variable. */
4500 DECL_NAME (t
) = name
;
4501 TREE_TYPE (t
) = type
;
4503 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4509 /* Builds and returns function declaration with NAME and TYPE. */
4512 build_fn_decl (const char *name
, tree type
)
4514 tree id
= get_identifier (name
);
4515 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4517 DECL_EXTERNAL (decl
) = 1;
4518 TREE_PUBLIC (decl
) = 1;
4519 DECL_ARTIFICIAL (decl
) = 1;
4520 TREE_NOTHROW (decl
) = 1;
4525 vec
<tree
, va_gc
> *all_translation_units
;
4527 /* Builds a new translation-unit decl with name NAME, queues it in the
4528 global list of translation-unit decls and returns it. */
4531 build_translation_unit_decl (tree name
)
4533 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4535 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4536 vec_safe_push (all_translation_units
, tu
);
4541 /* BLOCK nodes are used to represent the structure of binding contours
4542 and declarations, once those contours have been exited and their contents
4543 compiled. This information is used for outputting debugging info. */
4546 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4548 tree block
= make_node (BLOCK
);
4550 BLOCK_VARS (block
) = vars
;
4551 BLOCK_SUBBLOCKS (block
) = subblocks
;
4552 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4553 BLOCK_CHAIN (block
) = chain
;
4558 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4560 LOC is the location to use in tree T. */
4563 protected_set_expr_location (tree t
, location_t loc
)
4565 if (t
&& CAN_HAVE_LOCATION_P (t
))
4566 SET_EXPR_LOCATION (t
, loc
);
4569 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4573 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4575 DECL_ATTRIBUTES (ddecl
) = attribute
;
4579 /* Borrowed from hashtab.c iterative_hash implementation. */
4580 #define mix(a,b,c) \
4582 a -= b; a -= c; a ^= (c>>13); \
4583 b -= c; b -= a; b ^= (a<< 8); \
4584 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4585 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4586 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4587 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4588 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4589 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4590 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4594 /* Produce good hash value combining VAL and VAL2. */
4596 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4598 /* the golden ratio; an arbitrary value. */
4599 hashval_t a
= 0x9e3779b9;
4605 /* Produce good hash value combining VAL and VAL2. */
4607 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4609 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4610 return iterative_hash_hashval_t (val
, val2
);
4613 hashval_t a
= (hashval_t
) val
;
4614 /* Avoid warnings about shifting of more than the width of the type on
4615 hosts that won't execute this path. */
4617 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4619 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4621 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4622 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4629 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4630 is ATTRIBUTE and its qualifiers are QUALS.
4632 Record such modified types already made so we don't make duplicates. */
4635 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4637 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4639 hashval_t hashcode
= 0;
4643 enum tree_code code
= TREE_CODE (ttype
);
4645 /* Building a distinct copy of a tagged type is inappropriate; it
4646 causes breakage in code that expects there to be a one-to-one
4647 relationship between a struct and its fields.
4648 build_duplicate_type is another solution (as used in
4649 handle_transparent_union_attribute), but that doesn't play well
4650 with the stronger C++ type identity model. */
4651 if (TREE_CODE (ttype
) == RECORD_TYPE
4652 || TREE_CODE (ttype
) == UNION_TYPE
4653 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4654 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4656 warning (OPT_Wattributes
,
4657 "ignoring attributes applied to %qT after definition",
4658 TYPE_MAIN_VARIANT (ttype
));
4659 return build_qualified_type (ttype
, quals
);
4662 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4663 ntype
= build_distinct_type_copy (ttype
);
4665 TYPE_ATTRIBUTES (ntype
) = attribute
;
4667 hashcode
= iterative_hash_object (code
, hashcode
);
4668 if (TREE_TYPE (ntype
))
4669 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4671 hashcode
= attribute_hash_list (attribute
, hashcode
);
4673 switch (TREE_CODE (ntype
))
4676 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4679 if (TYPE_DOMAIN (ntype
))
4680 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4684 t
= TYPE_MAX_VALUE (ntype
);
4685 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4686 hashcode
= iterative_hash_object (TREE_INT_CST_ELT (t
, i
), hashcode
);
4689 case FIXED_POINT_TYPE
:
4691 unsigned int precision
= TYPE_PRECISION (ntype
);
4692 hashcode
= iterative_hash_object (precision
, hashcode
);
4699 ntype
= type_hash_canon (hashcode
, ntype
);
4701 /* If the target-dependent attributes make NTYPE different from
4702 its canonical type, we will need to use structural equality
4703 checks for this type. */
4704 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4705 || !comp_type_attributes (ntype
, ttype
))
4706 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4707 else if (TYPE_CANONICAL (ntype
) == ntype
)
4708 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4710 ttype
= build_qualified_type (ntype
, quals
);
4712 else if (TYPE_QUALS (ttype
) != quals
)
4713 ttype
= build_qualified_type (ttype
, quals
);
4718 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4722 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4725 for (cl1
= clauses1
, cl2
= clauses2
;
4727 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4729 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4731 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4733 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4734 OMP_CLAUSE_DECL (cl2
)) != 1)
4737 switch (OMP_CLAUSE_CODE (cl1
))
4739 case OMP_CLAUSE_ALIGNED
:
4740 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4741 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4744 case OMP_CLAUSE_LINEAR
:
4745 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4746 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4749 case OMP_CLAUSE_SIMDLEN
:
4750 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4751 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4760 /* Compare two constructor-element-type constants. Return 1 if the lists
4761 are known to be equal; otherwise return 0. */
4764 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4766 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4768 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4771 l1
= TREE_CHAIN (l1
);
4772 l2
= TREE_CHAIN (l2
);
4778 /* Compare two attributes for their value identity. Return true if the
4779 attribute values are known to be equal; otherwise return false.
4783 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4785 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4788 if (TREE_VALUE (attr1
) != NULL_TREE
4789 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4790 && TREE_VALUE (attr2
) != NULL
4791 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4792 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4793 TREE_VALUE (attr2
)) == 1);
4795 if ((flag_openmp
|| flag_openmp_simd
)
4796 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4797 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4798 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4799 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4800 TREE_VALUE (attr2
));
4802 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4805 /* Return 0 if the attributes for two types are incompatible, 1 if they
4806 are compatible, and 2 if they are nearly compatible (which causes a
4807 warning to be generated). */
4809 comp_type_attributes (const_tree type1
, const_tree type2
)
4811 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4812 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4817 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4819 const struct attribute_spec
*as
;
4822 as
= lookup_attribute_spec (get_attribute_name (a
));
4823 if (!as
|| as
->affects_type_identity
== false)
4826 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4827 if (!attr
|| !attribute_value_equal (a
, attr
))
4832 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4834 const struct attribute_spec
*as
;
4836 as
= lookup_attribute_spec (get_attribute_name (a
));
4837 if (!as
|| as
->affects_type_identity
== false)
4840 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4842 /* We don't need to compare trees again, as we did this
4843 already in first loop. */
4845 /* All types - affecting identity - are equal, so
4846 there is no need to call target hook for comparison. */
4850 /* As some type combinations - like default calling-convention - might
4851 be compatible, we have to call the target hook to get the final result. */
4852 return targetm
.comp_type_attributes (type1
, type2
);
4855 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4858 Record such modified types already made so we don't make duplicates. */
4861 build_type_attribute_variant (tree ttype
, tree attribute
)
4863 return build_type_attribute_qual_variant (ttype
, attribute
,
4864 TYPE_QUALS (ttype
));
4868 /* Reset the expression *EXPR_P, a size or position.
4870 ??? We could reset all non-constant sizes or positions. But it's cheap
4871 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4873 We need to reset self-referential sizes or positions because they cannot
4874 be gimplified and thus can contain a CALL_EXPR after the gimplification
4875 is finished, which will run afoul of LTO streaming. And they need to be
4876 reset to something essentially dummy but not constant, so as to preserve
4877 the properties of the object they are attached to. */
4880 free_lang_data_in_one_sizepos (tree
*expr_p
)
4882 tree expr
= *expr_p
;
4883 if (CONTAINS_PLACEHOLDER_P (expr
))
4884 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4888 /* Reset all the fields in a binfo node BINFO. We only keep
4889 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4892 free_lang_data_in_binfo (tree binfo
)
4897 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4899 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4900 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4901 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4902 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4904 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4905 free_lang_data_in_binfo (t
);
4909 /* Reset all language specific information still present in TYPE. */
4912 free_lang_data_in_type (tree type
)
4914 gcc_assert (TYPE_P (type
));
4916 /* Give the FE a chance to remove its own data first. */
4917 lang_hooks
.free_lang_data (type
);
4919 TREE_LANG_FLAG_0 (type
) = 0;
4920 TREE_LANG_FLAG_1 (type
) = 0;
4921 TREE_LANG_FLAG_2 (type
) = 0;
4922 TREE_LANG_FLAG_3 (type
) = 0;
4923 TREE_LANG_FLAG_4 (type
) = 0;
4924 TREE_LANG_FLAG_5 (type
) = 0;
4925 TREE_LANG_FLAG_6 (type
) = 0;
4927 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4929 /* Remove the const and volatile qualifiers from arguments. The
4930 C++ front end removes them, but the C front end does not,
4931 leading to false ODR violation errors when merging two
4932 instances of the same function signature compiled by
4933 different front ends. */
4936 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4938 tree arg_type
= TREE_VALUE (p
);
4940 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4942 int quals
= TYPE_QUALS (arg_type
)
4944 & ~TYPE_QUAL_VOLATILE
;
4945 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4946 free_lang_data_in_type (TREE_VALUE (p
));
4951 /* Remove members that are not actually FIELD_DECLs from the field
4952 list of an aggregate. These occur in C++. */
4953 if (RECORD_OR_UNION_TYPE_P (type
))
4957 /* Note that TYPE_FIELDS can be shared across distinct
4958 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4959 to be removed, we cannot set its TREE_CHAIN to NULL.
4960 Otherwise, we would not be able to find all the other fields
4961 in the other instances of this TREE_TYPE.
4963 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4965 member
= TYPE_FIELDS (type
);
4968 if (TREE_CODE (member
) == FIELD_DECL
4969 || TREE_CODE (member
) == TYPE_DECL
)
4972 TREE_CHAIN (prev
) = member
;
4974 TYPE_FIELDS (type
) = member
;
4978 member
= TREE_CHAIN (member
);
4982 TREE_CHAIN (prev
) = NULL_TREE
;
4984 TYPE_FIELDS (type
) = NULL_TREE
;
4986 TYPE_METHODS (type
) = NULL_TREE
;
4987 if (TYPE_BINFO (type
))
4988 free_lang_data_in_binfo (TYPE_BINFO (type
));
4992 /* For non-aggregate types, clear out the language slot (which
4993 overloads TYPE_BINFO). */
4994 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4996 if (INTEGRAL_TYPE_P (type
)
4997 || SCALAR_FLOAT_TYPE_P (type
)
4998 || FIXED_POINT_TYPE_P (type
))
5000 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5001 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5005 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5006 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5008 if (TYPE_CONTEXT (type
)
5009 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5011 tree ctx
= TYPE_CONTEXT (type
);
5014 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5016 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5017 TYPE_CONTEXT (type
) = ctx
;
5022 /* Return true if DECL may need an assembler name to be set. */
5025 need_assembler_name_p (tree decl
)
5027 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5028 if (TREE_CODE (decl
) != FUNCTION_DECL
5029 && TREE_CODE (decl
) != VAR_DECL
)
5032 /* If DECL already has its assembler name set, it does not need a
5034 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5035 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5038 /* Abstract decls do not need an assembler name. */
5039 if (DECL_ABSTRACT (decl
))
5042 /* For VAR_DECLs, only static, public and external symbols need an
5044 if (TREE_CODE (decl
) == VAR_DECL
5045 && !TREE_STATIC (decl
)
5046 && !TREE_PUBLIC (decl
)
5047 && !DECL_EXTERNAL (decl
))
5050 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5052 /* Do not set assembler name on builtins. Allow RTL expansion to
5053 decide whether to expand inline or via a regular call. */
5054 if (DECL_BUILT_IN (decl
)
5055 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5058 /* Functions represented in the callgraph need an assembler name. */
5059 if (cgraph_get_node (decl
) != NULL
)
5062 /* Unused and not public functions don't need an assembler name. */
5063 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5071 /* Reset all language specific information still present in symbol
5075 free_lang_data_in_decl (tree decl
)
5077 gcc_assert (DECL_P (decl
));
5079 /* Give the FE a chance to remove its own data first. */
5080 lang_hooks
.free_lang_data (decl
);
5082 TREE_LANG_FLAG_0 (decl
) = 0;
5083 TREE_LANG_FLAG_1 (decl
) = 0;
5084 TREE_LANG_FLAG_2 (decl
) = 0;
5085 TREE_LANG_FLAG_3 (decl
) = 0;
5086 TREE_LANG_FLAG_4 (decl
) = 0;
5087 TREE_LANG_FLAG_5 (decl
) = 0;
5088 TREE_LANG_FLAG_6 (decl
) = 0;
5090 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5091 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5092 if (TREE_CODE (decl
) == FIELD_DECL
)
5094 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5095 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5096 DECL_QUALIFIER (decl
) = NULL_TREE
;
5099 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5101 struct cgraph_node
*node
;
5102 if (!(node
= cgraph_get_node (decl
))
5103 || (!node
->definition
&& !node
->clones
))
5106 cgraph_release_function_body (node
);
5109 release_function_body (decl
);
5110 DECL_ARGUMENTS (decl
) = NULL
;
5111 DECL_RESULT (decl
) = NULL
;
5112 DECL_INITIAL (decl
) = error_mark_node
;
5115 if (gimple_has_body_p (decl
))
5119 /* If DECL has a gimple body, then the context for its
5120 arguments must be DECL. Otherwise, it doesn't really
5121 matter, as we will not be emitting any code for DECL. In
5122 general, there may be other instances of DECL created by
5123 the front end and since PARM_DECLs are generally shared,
5124 their DECL_CONTEXT changes as the replicas of DECL are
5125 created. The only time where DECL_CONTEXT is important
5126 is for the FUNCTION_DECLs that have a gimple body (since
5127 the PARM_DECL will be used in the function's body). */
5128 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5129 DECL_CONTEXT (t
) = decl
;
5132 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5133 At this point, it is not needed anymore. */
5134 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5136 /* Clear the abstract origin if it refers to a method. Otherwise
5137 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5138 origin will not be output correctly. */
5139 if (DECL_ABSTRACT_ORIGIN (decl
)
5140 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5141 && RECORD_OR_UNION_TYPE_P
5142 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5143 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5145 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5146 DECL_VINDEX referring to itself into a vtable slot number as it
5147 should. Happens with functions that are copied and then forgotten
5148 about. Just clear it, it won't matter anymore. */
5149 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5150 DECL_VINDEX (decl
) = NULL_TREE
;
5152 else if (TREE_CODE (decl
) == VAR_DECL
)
5154 if ((DECL_EXTERNAL (decl
)
5155 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5156 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5157 DECL_INITIAL (decl
) = NULL_TREE
;
5159 else if (TREE_CODE (decl
) == TYPE_DECL
5160 || TREE_CODE (decl
) == FIELD_DECL
)
5161 DECL_INITIAL (decl
) = NULL_TREE
;
5162 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5163 && DECL_INITIAL (decl
)
5164 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5166 /* Strip builtins from the translation-unit BLOCK. We still have targets
5167 without builtin_decl_explicit support and also builtins are shared
5168 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5169 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5173 if (TREE_CODE (var
) == FUNCTION_DECL
5174 && DECL_BUILT_IN (var
))
5175 *nextp
= TREE_CHAIN (var
);
5177 nextp
= &TREE_CHAIN (var
);
5183 /* Data used when collecting DECLs and TYPEs for language data removal. */
5185 struct free_lang_data_d
5187 /* Worklist to avoid excessive recursion. */
5190 /* Set of traversed objects. Used to avoid duplicate visits. */
5191 struct pointer_set_t
*pset
;
5193 /* Array of symbols to process with free_lang_data_in_decl. */
5196 /* Array of types to process with free_lang_data_in_type. */
5201 /* Save all language fields needed to generate proper debug information
5202 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5205 save_debug_info_for_decl (tree t
)
5207 /*struct saved_debug_info_d *sdi;*/
5209 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5211 /* FIXME. Partial implementation for saving debug info removed. */
5215 /* Save all language fields needed to generate proper debug information
5216 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5219 save_debug_info_for_type (tree t
)
5221 /*struct saved_debug_info_d *sdi;*/
5223 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5225 /* FIXME. Partial implementation for saving debug info removed. */
5229 /* Add type or decl T to one of the list of tree nodes that need their
5230 language data removed. The lists are held inside FLD. */
5233 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5237 fld
->decls
.safe_push (t
);
5238 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5239 save_debug_info_for_decl (t
);
5241 else if (TYPE_P (t
))
5243 fld
->types
.safe_push (t
);
5244 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5245 save_debug_info_for_type (t
);
5251 /* Push tree node T into FLD->WORKLIST. */
5254 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5256 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5257 fld
->worklist
.safe_push ((t
));
5261 /* Operand callback helper for free_lang_data_in_node. *TP is the
5262 subtree operand being considered. */
5265 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5268 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5270 if (TREE_CODE (t
) == TREE_LIST
)
5273 /* Language specific nodes will be removed, so there is no need
5274 to gather anything under them. */
5275 if (is_lang_specific (t
))
5283 /* Note that walk_tree does not traverse every possible field in
5284 decls, so we have to do our own traversals here. */
5285 add_tree_to_fld_list (t
, fld
);
5287 fld_worklist_push (DECL_NAME (t
), fld
);
5288 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5289 fld_worklist_push (DECL_SIZE (t
), fld
);
5290 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5292 /* We are going to remove everything under DECL_INITIAL for
5293 TYPE_DECLs. No point walking them. */
5294 if (TREE_CODE (t
) != TYPE_DECL
)
5295 fld_worklist_push (DECL_INITIAL (t
), fld
);
5297 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5298 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5300 if (TREE_CODE (t
) == FUNCTION_DECL
)
5302 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5303 fld_worklist_push (DECL_RESULT (t
), fld
);
5305 else if (TREE_CODE (t
) == TYPE_DECL
)
5307 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5308 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5310 else if (TREE_CODE (t
) == FIELD_DECL
)
5312 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5313 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5314 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5315 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5318 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5319 && DECL_HAS_VALUE_EXPR_P (t
))
5320 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5322 if (TREE_CODE (t
) != FIELD_DECL
5323 && TREE_CODE (t
) != TYPE_DECL
)
5324 fld_worklist_push (TREE_CHAIN (t
), fld
);
5327 else if (TYPE_P (t
))
5329 /* Note that walk_tree does not traverse every possible field in
5330 types, so we have to do our own traversals here. */
5331 add_tree_to_fld_list (t
, fld
);
5333 if (!RECORD_OR_UNION_TYPE_P (t
))
5334 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5335 fld_worklist_push (TYPE_SIZE (t
), fld
);
5336 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5337 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5338 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5339 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5340 fld_worklist_push (TYPE_NAME (t
), fld
);
5341 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5342 them and thus do not and want not to reach unused pointer types
5344 if (!POINTER_TYPE_P (t
))
5345 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5346 if (!RECORD_OR_UNION_TYPE_P (t
))
5347 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5348 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5349 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5350 do not and want not to reach unused variants this way. */
5351 if (TYPE_CONTEXT (t
))
5353 tree ctx
= TYPE_CONTEXT (t
);
5354 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5355 So push that instead. */
5356 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5357 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5358 fld_worklist_push (ctx
, fld
);
5360 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5361 and want not to reach unused types this way. */
5363 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5367 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5368 fld_worklist_push (TREE_TYPE (tem
), fld
);
5369 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5371 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5372 && TREE_CODE (tem
) == TREE_LIST
)
5375 fld_worklist_push (TREE_VALUE (tem
), fld
);
5376 tem
= TREE_CHAIN (tem
);
5380 if (RECORD_OR_UNION_TYPE_P (t
))
5383 /* Push all TYPE_FIELDS - there can be interleaving interesting
5384 and non-interesting things. */
5385 tem
= TYPE_FIELDS (t
);
5388 if (TREE_CODE (tem
) == FIELD_DECL
5389 || TREE_CODE (tem
) == TYPE_DECL
)
5390 fld_worklist_push (tem
, fld
);
5391 tem
= TREE_CHAIN (tem
);
5395 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5398 else if (TREE_CODE (t
) == BLOCK
)
5401 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5402 fld_worklist_push (tem
, fld
);
5403 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5404 fld_worklist_push (tem
, fld
);
5405 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5408 if (TREE_CODE (t
) != IDENTIFIER_NODE
5409 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5410 fld_worklist_push (TREE_TYPE (t
), fld
);
5416 /* Find decls and types in T. */
5419 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5423 if (!pointer_set_contains (fld
->pset
, t
))
5424 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5425 if (fld
->worklist
.is_empty ())
5427 t
= fld
->worklist
.pop ();
5431 /* Translate all the types in LIST with the corresponding runtime
5435 get_eh_types_for_runtime (tree list
)
5439 if (list
== NULL_TREE
)
5442 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5444 list
= TREE_CHAIN (list
);
5447 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5448 TREE_CHAIN (prev
) = n
;
5449 prev
= TREE_CHAIN (prev
);
5450 list
= TREE_CHAIN (list
);
5457 /* Find decls and types referenced in EH region R and store them in
5458 FLD->DECLS and FLD->TYPES. */
5461 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5472 /* The types referenced in each catch must first be changed to the
5473 EH types used at runtime. This removes references to FE types
5475 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5477 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5478 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5483 case ERT_ALLOWED_EXCEPTIONS
:
5484 r
->u
.allowed
.type_list
5485 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5486 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5489 case ERT_MUST_NOT_THROW
:
5490 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5491 find_decls_types_r
, fld
, fld
->pset
);
5497 /* Find decls and types referenced in cgraph node N and store them in
5498 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5499 look for *every* kind of DECL and TYPE node reachable from N,
5500 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5501 NAMESPACE_DECLs, etc). */
5504 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5507 struct function
*fn
;
5511 find_decls_types (n
->decl
, fld
);
5513 if (!gimple_has_body_p (n
->decl
))
5516 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5518 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5520 /* Traverse locals. */
5521 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5522 find_decls_types (t
, fld
);
5524 /* Traverse EH regions in FN. */
5527 FOR_ALL_EH_REGION_FN (r
, fn
)
5528 find_decls_types_in_eh_region (r
, fld
);
5531 /* Traverse every statement in FN. */
5532 FOR_EACH_BB_FN (bb
, fn
)
5534 gimple_stmt_iterator si
;
5537 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5539 gimple phi
= gsi_stmt (si
);
5541 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5543 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5544 find_decls_types (*arg_p
, fld
);
5548 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5550 gimple stmt
= gsi_stmt (si
);
5552 if (is_gimple_call (stmt
))
5553 find_decls_types (gimple_call_fntype (stmt
), fld
);
5555 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5557 tree arg
= gimple_op (stmt
, i
);
5558 find_decls_types (arg
, fld
);
5565 /* Find decls and types referenced in varpool node N and store them in
5566 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5567 look for *every* kind of DECL and TYPE node reachable from N,
5568 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5569 NAMESPACE_DECLs, etc). */
5572 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5574 find_decls_types (v
->decl
, fld
);
5577 /* If T needs an assembler name, have one created for it. */
5580 assign_assembler_name_if_neeeded (tree t
)
5582 if (need_assembler_name_p (t
))
5584 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5585 diagnostics that use input_location to show locus
5586 information. The problem here is that, at this point,
5587 input_location is generally anchored to the end of the file
5588 (since the parser is long gone), so we don't have a good
5589 position to pin it to.
5591 To alleviate this problem, this uses the location of T's
5592 declaration. Examples of this are
5593 testsuite/g++.dg/template/cond2.C and
5594 testsuite/g++.dg/template/pr35240.C. */
5595 location_t saved_location
= input_location
;
5596 input_location
= DECL_SOURCE_LOCATION (t
);
5598 decl_assembler_name (t
);
5600 input_location
= saved_location
;
5605 /* Free language specific information for every operand and expression
5606 in every node of the call graph. This process operates in three stages:
5608 1- Every callgraph node and varpool node is traversed looking for
5609 decls and types embedded in them. This is a more exhaustive
5610 search than that done by find_referenced_vars, because it will
5611 also collect individual fields, decls embedded in types, etc.
5613 2- All the decls found are sent to free_lang_data_in_decl.
5615 3- All the types found are sent to free_lang_data_in_type.
5617 The ordering between decls and types is important because
5618 free_lang_data_in_decl sets assembler names, which includes
5619 mangling. So types cannot be freed up until assembler names have
5623 free_lang_data_in_cgraph (void)
5625 struct cgraph_node
*n
;
5627 struct free_lang_data_d fld
;
5632 /* Initialize sets and arrays to store referenced decls and types. */
5633 fld
.pset
= pointer_set_create ();
5634 fld
.worklist
.create (0);
5635 fld
.decls
.create (100);
5636 fld
.types
.create (100);
5638 /* Find decls and types in the body of every function in the callgraph. */
5639 FOR_EACH_FUNCTION (n
)
5640 find_decls_types_in_node (n
, &fld
);
5642 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5643 find_decls_types (p
->decl
, &fld
);
5645 /* Find decls and types in every varpool symbol. */
5646 FOR_EACH_VARIABLE (v
)
5647 find_decls_types_in_var (v
, &fld
);
5649 /* Set the assembler name on every decl found. We need to do this
5650 now because free_lang_data_in_decl will invalidate data needed
5651 for mangling. This breaks mangling on interdependent decls. */
5652 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5653 assign_assembler_name_if_neeeded (t
);
5655 /* Traverse every decl found freeing its language data. */
5656 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5657 free_lang_data_in_decl (t
);
5659 /* Traverse every type found freeing its language data. */
5660 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5661 free_lang_data_in_type (t
);
5663 pointer_set_destroy (fld
.pset
);
5664 fld
.worklist
.release ();
5665 fld
.decls
.release ();
5666 fld
.types
.release ();
5670 /* Free resources that are used by FE but are not needed once they are done. */
5673 free_lang_data (void)
5677 /* If we are the LTO frontend we have freed lang-specific data already. */
5679 || !flag_generate_lto
)
5682 /* Allocate and assign alias sets to the standard integer types
5683 while the slots are still in the way the frontends generated them. */
5684 for (i
= 0; i
< itk_none
; ++i
)
5685 if (integer_types
[i
])
5686 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5688 /* Traverse the IL resetting language specific information for
5689 operands, expressions, etc. */
5690 free_lang_data_in_cgraph ();
5692 /* Create gimple variants for common types. */
5693 ptrdiff_type_node
= integer_type_node
;
5694 fileptr_type_node
= ptr_type_node
;
5696 /* Reset some langhooks. Do not reset types_compatible_p, it may
5697 still be used indirectly via the get_alias_set langhook. */
5698 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5699 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5700 /* We do not want the default decl_assembler_name implementation,
5701 rather if we have fixed everything we want a wrapper around it
5702 asserting that all non-local symbols already got their assembler
5703 name and only produce assembler names for local symbols. Or rather
5704 make sure we never call decl_assembler_name on local symbols and
5705 devise a separate, middle-end private scheme for it. */
5707 /* Reset diagnostic machinery. */
5708 tree_diagnostics_defaults (global_dc
);
5716 const pass_data pass_data_ipa_free_lang_data
=
5718 SIMPLE_IPA_PASS
, /* type */
5719 "*free_lang_data", /* name */
5720 OPTGROUP_NONE
, /* optinfo_flags */
5721 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5722 0, /* properties_required */
5723 0, /* properties_provided */
5724 0, /* properties_destroyed */
5725 0, /* todo_flags_start */
5726 0, /* todo_flags_finish */
5729 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5732 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5733 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5736 /* opt_pass methods: */
5737 virtual unsigned int execute (function
*) { return free_lang_data (); }
5739 }; // class pass_ipa_free_lang_data
5743 simple_ipa_opt_pass
*
5744 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5746 return new pass_ipa_free_lang_data (ctxt
);
5749 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5750 ATTR_NAME. Also used internally by remove_attribute(). */
5752 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5754 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5756 if (ident_len
== attr_len
)
5758 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5761 else if (ident_len
== attr_len
+ 4)
5763 /* There is the possibility that ATTR is 'text' and IDENT is
5765 const char *p
= IDENTIFIER_POINTER (ident
);
5766 if (p
[0] == '_' && p
[1] == '_'
5767 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5768 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5775 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5776 of ATTR_NAME, and LIST is not NULL_TREE. */
5778 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5782 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5784 if (ident_len
== attr_len
)
5786 if (!strcmp (attr_name
,
5787 IDENTIFIER_POINTER (get_attribute_name (list
))))
5790 /* TODO: If we made sure that attributes were stored in the
5791 canonical form without '__...__' (ie, as in 'text' as opposed
5792 to '__text__') then we could avoid the following case. */
5793 else if (ident_len
== attr_len
+ 4)
5795 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5796 if (p
[0] == '_' && p
[1] == '_'
5797 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5798 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5801 list
= TREE_CHAIN (list
);
5807 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5808 return a pointer to the attribute's list first element if the attribute
5809 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5813 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5818 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5820 if (attr_len
> ident_len
)
5822 list
= TREE_CHAIN (list
);
5826 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5828 if (strncmp (attr_name
, p
, attr_len
) == 0)
5831 /* TODO: If we made sure that attributes were stored in the
5832 canonical form without '__...__' (ie, as in 'text' as opposed
5833 to '__text__') then we could avoid the following case. */
5834 if (p
[0] == '_' && p
[1] == '_' &&
5835 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5838 list
= TREE_CHAIN (list
);
5845 /* A variant of lookup_attribute() that can be used with an identifier
5846 as the first argument, and where the identifier can be either
5847 'text' or '__text__'.
5849 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5850 return a pointer to the attribute's list element if the attribute
5851 is part of the list, or NULL_TREE if not found. If the attribute
5852 appears more than once, this only returns the first occurrence; the
5853 TREE_CHAIN of the return value should be passed back in if further
5854 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5855 can be in the form 'text' or '__text__'. */
5857 lookup_ident_attribute (tree attr_identifier
, tree list
)
5859 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5863 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5864 == IDENTIFIER_NODE
);
5866 /* Identifiers can be compared directly for equality. */
5867 if (attr_identifier
== get_attribute_name (list
))
5870 /* If they are not equal, they may still be one in the form
5871 'text' while the other one is in the form '__text__'. TODO:
5872 If we were storing attributes in normalized 'text' form, then
5873 this could all go away and we could take full advantage of
5874 the fact that we're comparing identifiers. :-) */
5876 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5877 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5879 if (ident_len
== attr_len
+ 4)
5881 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5882 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5883 if (p
[0] == '_' && p
[1] == '_'
5884 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5885 && strncmp (q
, p
+ 2, attr_len
) == 0)
5888 else if (ident_len
+ 4 == attr_len
)
5890 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5891 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5892 if (q
[0] == '_' && q
[1] == '_'
5893 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5894 && strncmp (q
+ 2, p
, ident_len
) == 0)
5898 list
= TREE_CHAIN (list
);
5904 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5908 remove_attribute (const char *attr_name
, tree list
)
5911 size_t attr_len
= strlen (attr_name
);
5913 gcc_checking_assert (attr_name
[0] != '_');
5915 for (p
= &list
; *p
; )
5918 /* TODO: If we were storing attributes in normalized form, here
5919 we could use a simple strcmp(). */
5920 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5921 *p
= TREE_CHAIN (l
);
5923 p
= &TREE_CHAIN (l
);
5929 /* Return an attribute list that is the union of a1 and a2. */
5932 merge_attributes (tree a1
, tree a2
)
5936 /* Either one unset? Take the set one. */
5938 if ((attributes
= a1
) == 0)
5941 /* One that completely contains the other? Take it. */
5943 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5945 if (attribute_list_contained (a2
, a1
))
5949 /* Pick the longest list, and hang on the other list. */
5951 if (list_length (a1
) < list_length (a2
))
5952 attributes
= a2
, a2
= a1
;
5954 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5957 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5959 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5960 a
= lookup_ident_attribute (get_attribute_name (a2
),
5965 a1
= copy_node (a2
);
5966 TREE_CHAIN (a1
) = attributes
;
5975 /* Given types T1 and T2, merge their attributes and return
5979 merge_type_attributes (tree t1
, tree t2
)
5981 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5982 TYPE_ATTRIBUTES (t2
));
5985 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5989 merge_decl_attributes (tree olddecl
, tree newdecl
)
5991 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5992 DECL_ATTRIBUTES (newdecl
));
5995 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5997 /* Specialization of merge_decl_attributes for various Windows targets.
5999 This handles the following situation:
6001 __declspec (dllimport) int foo;
6004 The second instance of `foo' nullifies the dllimport. */
6007 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6010 int delete_dllimport_p
= 1;
6012 /* What we need to do here is remove from `old' dllimport if it doesn't
6013 appear in `new'. dllimport behaves like extern: if a declaration is
6014 marked dllimport and a definition appears later, then the object
6015 is not dllimport'd. We also remove a `new' dllimport if the old list
6016 contains dllexport: dllexport always overrides dllimport, regardless
6017 of the order of declaration. */
6018 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6019 delete_dllimport_p
= 0;
6020 else if (DECL_DLLIMPORT_P (new_tree
)
6021 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6023 DECL_DLLIMPORT_P (new_tree
) = 0;
6024 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6025 "dllimport ignored", new_tree
);
6027 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6029 /* Warn about overriding a symbol that has already been used, e.g.:
6030 extern int __attribute__ ((dllimport)) foo;
6031 int* bar () {return &foo;}
6034 if (TREE_USED (old
))
6036 warning (0, "%q+D redeclared without dllimport attribute "
6037 "after being referenced with dll linkage", new_tree
);
6038 /* If we have used a variable's address with dllimport linkage,
6039 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6040 decl may already have had TREE_CONSTANT computed.
6041 We still remove the attribute so that assembler code refers
6042 to '&foo rather than '_imp__foo'. */
6043 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6044 DECL_DLLIMPORT_P (new_tree
) = 1;
6047 /* Let an inline definition silently override the external reference,
6048 but otherwise warn about attribute inconsistency. */
6049 else if (TREE_CODE (new_tree
) == VAR_DECL
6050 || !DECL_DECLARED_INLINE_P (new_tree
))
6051 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6052 "previous dllimport ignored", new_tree
);
6055 delete_dllimport_p
= 0;
6057 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6059 if (delete_dllimport_p
)
6060 a
= remove_attribute ("dllimport", a
);
6065 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6066 struct attribute_spec.handler. */
6069 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6075 /* These attributes may apply to structure and union types being created,
6076 but otherwise should pass to the declaration involved. */
6079 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6080 | (int) ATTR_FLAG_ARRAY_NEXT
))
6082 *no_add_attrs
= true;
6083 return tree_cons (name
, args
, NULL_TREE
);
6085 if (TREE_CODE (node
) == RECORD_TYPE
6086 || TREE_CODE (node
) == UNION_TYPE
)
6088 node
= TYPE_NAME (node
);
6094 warning (OPT_Wattributes
, "%qE attribute ignored",
6096 *no_add_attrs
= true;
6101 if (TREE_CODE (node
) != FUNCTION_DECL
6102 && TREE_CODE (node
) != VAR_DECL
6103 && TREE_CODE (node
) != TYPE_DECL
)
6105 *no_add_attrs
= true;
6106 warning (OPT_Wattributes
, "%qE attribute ignored",
6111 if (TREE_CODE (node
) == TYPE_DECL
6112 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6113 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6115 *no_add_attrs
= true;
6116 warning (OPT_Wattributes
, "%qE attribute ignored",
6121 is_dllimport
= is_attribute_p ("dllimport", name
);
6123 /* Report error on dllimport ambiguities seen now before they cause
6127 /* Honor any target-specific overrides. */
6128 if (!targetm
.valid_dllimport_attribute_p (node
))
6129 *no_add_attrs
= true;
6131 else if (TREE_CODE (node
) == FUNCTION_DECL
6132 && DECL_DECLARED_INLINE_P (node
))
6134 warning (OPT_Wattributes
, "inline function %q+D declared as "
6135 " dllimport: attribute ignored", node
);
6136 *no_add_attrs
= true;
6138 /* Like MS, treat definition of dllimported variables and
6139 non-inlined functions on declaration as syntax errors. */
6140 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6142 error ("function %q+D definition is marked dllimport", node
);
6143 *no_add_attrs
= true;
6146 else if (TREE_CODE (node
) == VAR_DECL
)
6148 if (DECL_INITIAL (node
))
6150 error ("variable %q+D definition is marked dllimport",
6152 *no_add_attrs
= true;
6155 /* `extern' needn't be specified with dllimport.
6156 Specify `extern' now and hope for the best. Sigh. */
6157 DECL_EXTERNAL (node
) = 1;
6158 /* Also, implicitly give dllimport'd variables declared within
6159 a function global scope, unless declared static. */
6160 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6161 TREE_PUBLIC (node
) = 1;
6164 if (*no_add_attrs
== false)
6165 DECL_DLLIMPORT_P (node
) = 1;
6167 else if (TREE_CODE (node
) == FUNCTION_DECL
6168 && DECL_DECLARED_INLINE_P (node
)
6169 && flag_keep_inline_dllexport
)
6170 /* An exported function, even if inline, must be emitted. */
6171 DECL_EXTERNAL (node
) = 0;
6173 /* Report error if symbol is not accessible at global scope. */
6174 if (!TREE_PUBLIC (node
)
6175 && (TREE_CODE (node
) == VAR_DECL
6176 || TREE_CODE (node
) == FUNCTION_DECL
))
6178 error ("external linkage required for symbol %q+D because of "
6179 "%qE attribute", node
, name
);
6180 *no_add_attrs
= true;
6183 /* A dllexport'd entity must have default visibility so that other
6184 program units (shared libraries or the main executable) can see
6185 it. A dllimport'd entity must have default visibility so that
6186 the linker knows that undefined references within this program
6187 unit can be resolved by the dynamic linker. */
6190 if (DECL_VISIBILITY_SPECIFIED (node
)
6191 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6192 error ("%qE implies default visibility, but %qD has already "
6193 "been declared with a different visibility",
6195 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6196 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6202 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6204 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6205 of the various TYPE_QUAL values. */
6208 set_type_quals (tree type
, int type_quals
)
6210 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6211 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6212 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6213 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6214 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6217 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6220 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6222 return (TYPE_QUALS (cand
) == type_quals
6223 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6224 /* Apparently this is needed for Objective-C. */
6225 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6226 /* Check alignment. */
6227 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6228 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6229 TYPE_ATTRIBUTES (base
)));
6232 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6235 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6237 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6238 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6239 /* Apparently this is needed for Objective-C. */
6240 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6241 /* Check alignment. */
6242 && TYPE_ALIGN (cand
) == align
6243 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6244 TYPE_ATTRIBUTES (base
)));
6247 /* This function checks to see if TYPE matches the size one of the built-in
6248 atomic types, and returns that core atomic type. */
6251 find_atomic_core_type (tree type
)
6253 tree base_atomic_type
;
6255 /* Only handle complete types. */
6256 if (TYPE_SIZE (type
) == NULL_TREE
)
6259 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6263 base_atomic_type
= atomicQI_type_node
;
6267 base_atomic_type
= atomicHI_type_node
;
6271 base_atomic_type
= atomicSI_type_node
;
6275 base_atomic_type
= atomicDI_type_node
;
6279 base_atomic_type
= atomicTI_type_node
;
6283 base_atomic_type
= NULL_TREE
;
6286 return base_atomic_type
;
6289 /* Return a version of the TYPE, qualified as indicated by the
6290 TYPE_QUALS, if one exists. If no qualified version exists yet,
6291 return NULL_TREE. */
6294 get_qualified_type (tree type
, int type_quals
)
6298 if (TYPE_QUALS (type
) == type_quals
)
6301 /* Search the chain of variants to see if there is already one there just
6302 like the one we need to have. If so, use that existing one. We must
6303 preserve the TYPE_NAME, since there is code that depends on this. */
6304 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6305 if (check_qualified_type (t
, type
, type_quals
))
6311 /* Like get_qualified_type, but creates the type if it does not
6312 exist. This function never returns NULL_TREE. */
6315 build_qualified_type (tree type
, int type_quals
)
6319 /* See if we already have the appropriate qualified variant. */
6320 t
= get_qualified_type (type
, type_quals
);
6322 /* If not, build it. */
6325 t
= build_variant_type_copy (type
);
6326 set_type_quals (t
, type_quals
);
6328 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6330 /* See if this object can map to a basic atomic type. */
6331 tree atomic_type
= find_atomic_core_type (type
);
6334 /* Ensure the alignment of this type is compatible with
6335 the required alignment of the atomic type. */
6336 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6337 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6341 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6342 /* Propagate structural equality. */
6343 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6344 else if (TYPE_CANONICAL (type
) != type
)
6345 /* Build the underlying canonical type, since it is different
6348 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6349 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6352 /* T is its own canonical type. */
6353 TYPE_CANONICAL (t
) = t
;
6360 /* Create a variant of type T with alignment ALIGN. */
6363 build_aligned_type (tree type
, unsigned int align
)
6367 if (TYPE_PACKED (type
)
6368 || TYPE_ALIGN (type
) == align
)
6371 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6372 if (check_aligned_type (t
, type
, align
))
6375 t
= build_variant_type_copy (type
);
6376 TYPE_ALIGN (t
) = align
;
6381 /* Create a new distinct copy of TYPE. The new type is made its own
6382 MAIN_VARIANT. If TYPE requires structural equality checks, the
6383 resulting type requires structural equality checks; otherwise, its
6384 TYPE_CANONICAL points to itself. */
6387 build_distinct_type_copy (tree type
)
6389 tree t
= copy_node (type
);
6391 TYPE_POINTER_TO (t
) = 0;
6392 TYPE_REFERENCE_TO (t
) = 0;
6394 /* Set the canonical type either to a new equivalence class, or
6395 propagate the need for structural equality checks. */
6396 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6397 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6399 TYPE_CANONICAL (t
) = t
;
6401 /* Make it its own variant. */
6402 TYPE_MAIN_VARIANT (t
) = t
;
6403 TYPE_NEXT_VARIANT (t
) = 0;
6405 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6406 whose TREE_TYPE is not t. This can also happen in the Ada
6407 frontend when using subtypes. */
6412 /* Create a new variant of TYPE, equivalent but distinct. This is so
6413 the caller can modify it. TYPE_CANONICAL for the return type will
6414 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6415 are considered equal by the language itself (or that both types
6416 require structural equality checks). */
6419 build_variant_type_copy (tree type
)
6421 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6423 t
= build_distinct_type_copy (type
);
6425 /* Since we're building a variant, assume that it is a non-semantic
6426 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6427 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6429 /* Add the new type to the chain of variants of TYPE. */
6430 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6431 TYPE_NEXT_VARIANT (m
) = t
;
6432 TYPE_MAIN_VARIANT (t
) = m
;
6437 /* Return true if the from tree in both tree maps are equal. */
6440 tree_map_base_eq (const void *va
, const void *vb
)
6442 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6443 *const b
= (const struct tree_map_base
*) vb
;
6444 return (a
->from
== b
->from
);
6447 /* Hash a from tree in a tree_base_map. */
6450 tree_map_base_hash (const void *item
)
6452 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6455 /* Return true if this tree map structure is marked for garbage collection
6456 purposes. We simply return true if the from tree is marked, so that this
6457 structure goes away when the from tree goes away. */
6460 tree_map_base_marked_p (const void *p
)
6462 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6465 /* Hash a from tree in a tree_map. */
6468 tree_map_hash (const void *item
)
6470 return (((const struct tree_map
*) item
)->hash
);
6473 /* Hash a from tree in a tree_decl_map. */
6476 tree_decl_map_hash (const void *item
)
6478 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6481 /* Return the initialization priority for DECL. */
6484 decl_init_priority_lookup (tree decl
)
6486 symtab_node
*snode
= symtab_get_node (decl
);
6489 return DEFAULT_INIT_PRIORITY
;
6491 snode
->get_init_priority ();
6494 /* Return the finalization priority for DECL. */
6497 decl_fini_priority_lookup (tree decl
)
6499 cgraph_node
*node
= cgraph_get_node (decl
);
6502 return DEFAULT_INIT_PRIORITY
;
6504 node
->get_fini_priority ();
6507 /* Set the initialization priority for DECL to PRIORITY. */
6510 decl_init_priority_insert (tree decl
, priority_type priority
)
6512 struct symtab_node
*snode
;
6514 if (priority
== DEFAULT_INIT_PRIORITY
)
6516 snode
= symtab_get_node (decl
);
6520 else if (TREE_CODE (decl
) == VAR_DECL
)
6521 snode
= varpool_node_for_decl (decl
);
6523 snode
= cgraph_get_create_node (decl
);
6524 snode
->set_init_priority (priority
);
6527 /* Set the finalization priority for DECL to PRIORITY. */
6530 decl_fini_priority_insert (tree decl
, priority_type priority
)
6532 struct cgraph_node
*node
;
6534 if (priority
== DEFAULT_INIT_PRIORITY
)
6536 node
= cgraph_get_node (decl
);
6541 node
= cgraph_get_create_node (decl
);
6542 node
->set_fini_priority (priority
);
6545 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6548 print_debug_expr_statistics (void)
6550 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6551 (long) htab_size (debug_expr_for_decl
),
6552 (long) htab_elements (debug_expr_for_decl
),
6553 htab_collisions (debug_expr_for_decl
));
6556 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6559 print_value_expr_statistics (void)
6561 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6562 (long) htab_size (value_expr_for_decl
),
6563 (long) htab_elements (value_expr_for_decl
),
6564 htab_collisions (value_expr_for_decl
));
6567 /* Lookup a debug expression for FROM, and return it if we find one. */
6570 decl_debug_expr_lookup (tree from
)
6572 struct tree_decl_map
*h
, in
;
6573 in
.base
.from
= from
;
6575 h
= (struct tree_decl_map
*)
6576 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6582 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6585 decl_debug_expr_insert (tree from
, tree to
)
6587 struct tree_decl_map
*h
;
6590 h
= ggc_alloc
<tree_decl_map
> ();
6591 h
->base
.from
= from
;
6593 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6595 *(struct tree_decl_map
**) loc
= h
;
6598 /* Lookup a value expression for FROM, and return it if we find one. */
6601 decl_value_expr_lookup (tree from
)
6603 struct tree_decl_map
*h
, in
;
6604 in
.base
.from
= from
;
6606 h
= (struct tree_decl_map
*)
6607 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6613 /* Insert a mapping FROM->TO in the value expression hashtable. */
6616 decl_value_expr_insert (tree from
, tree to
)
6618 struct tree_decl_map
*h
;
6621 h
= ggc_alloc
<tree_decl_map
> ();
6622 h
->base
.from
= from
;
6624 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6626 *(struct tree_decl_map
**) loc
= h
;
6629 /* Lookup a vector of debug arguments for FROM, and return it if we
6633 decl_debug_args_lookup (tree from
)
6635 struct tree_vec_map
*h
, in
;
6637 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6639 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6640 in
.base
.from
= from
;
6641 h
= (struct tree_vec_map
*)
6642 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6648 /* Insert a mapping FROM->empty vector of debug arguments in the value
6649 expression hashtable. */
6652 decl_debug_args_insert (tree from
)
6654 struct tree_vec_map
*h
;
6657 if (DECL_HAS_DEBUG_ARGS_P (from
))
6658 return decl_debug_args_lookup (from
);
6659 if (debug_args_for_decl
== NULL
)
6660 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6661 tree_vec_map_eq
, 0);
6662 h
= ggc_alloc
<tree_vec_map
> ();
6663 h
->base
.from
= from
;
6665 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6667 *(struct tree_vec_map
**) loc
= h
;
6668 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6672 /* Hashing of types so that we don't make duplicates.
6673 The entry point is `type_hash_canon'. */
6675 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6676 with types in the TREE_VALUE slots), by adding the hash codes
6677 of the individual types. */
6680 type_hash_list (const_tree list
, hashval_t hashcode
)
6684 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6685 if (TREE_VALUE (tail
) != error_mark_node
)
6686 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6692 /* These are the Hashtable callback functions. */
6694 /* Returns true iff the types are equivalent. */
6697 type_hash_eq (const void *va
, const void *vb
)
6699 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6700 *const b
= (const struct type_hash
*) vb
;
6702 /* First test the things that are the same for all types. */
6703 if (a
->hash
!= b
->hash
6704 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6705 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6706 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6707 TYPE_ATTRIBUTES (b
->type
))
6708 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6709 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6712 /* Be careful about comparing arrays before and after the element type
6713 has been completed; don't compare TYPE_ALIGN unless both types are
6715 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6716 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6717 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6720 switch (TREE_CODE (a
->type
))
6725 case REFERENCE_TYPE
:
6730 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6733 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6734 && !(TYPE_VALUES (a
->type
)
6735 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6736 && TYPE_VALUES (b
->type
)
6737 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6738 && type_list_equal (TYPE_VALUES (a
->type
),
6739 TYPE_VALUES (b
->type
))))
6742 /* ... fall through ... */
6747 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6749 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6750 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6751 TYPE_MAX_VALUE (b
->type
)))
6752 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6753 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6754 TYPE_MIN_VALUE (b
->type
))));
6756 case FIXED_POINT_TYPE
:
6757 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6760 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6763 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6764 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6765 || (TYPE_ARG_TYPES (a
->type
)
6766 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6767 && TYPE_ARG_TYPES (b
->type
)
6768 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6769 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6770 TYPE_ARG_TYPES (b
->type
)))))
6774 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6778 case QUAL_UNION_TYPE
:
6779 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6780 || (TYPE_FIELDS (a
->type
)
6781 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6782 && TYPE_FIELDS (b
->type
)
6783 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6784 && type_list_equal (TYPE_FIELDS (a
->type
),
6785 TYPE_FIELDS (b
->type
))));
6788 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6789 || (TYPE_ARG_TYPES (a
->type
)
6790 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6791 && TYPE_ARG_TYPES (b
->type
)
6792 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6793 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6794 TYPE_ARG_TYPES (b
->type
))))
6802 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6803 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6808 /* Return the cached hash value. */
6811 type_hash_hash (const void *item
)
6813 return ((const struct type_hash
*) item
)->hash
;
6816 /* Look in the type hash table for a type isomorphic to TYPE.
6817 If one is found, return it. Otherwise return 0. */
6820 type_hash_lookup (hashval_t hashcode
, tree type
)
6822 struct type_hash
*h
, in
;
6824 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6825 must call that routine before comparing TYPE_ALIGNs. */
6831 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6838 /* Add an entry to the type-hash-table
6839 for a type TYPE whose hash code is HASHCODE. */
6842 type_hash_add (hashval_t hashcode
, tree type
)
6844 struct type_hash
*h
;
6847 h
= ggc_alloc
<type_hash
> ();
6850 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6854 /* Given TYPE, and HASHCODE its hash code, return the canonical
6855 object for an identical type if one already exists.
6856 Otherwise, return TYPE, and record it as the canonical object.
6858 To use this function, first create a type of the sort you want.
6859 Then compute its hash code from the fields of the type that
6860 make it different from other similar types.
6861 Then call this function and use the value. */
6864 type_hash_canon (unsigned int hashcode
, tree type
)
6868 /* The hash table only contains main variants, so ensure that's what we're
6870 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6872 /* See if the type is in the hash table already. If so, return it.
6873 Otherwise, add the type. */
6874 t1
= type_hash_lookup (hashcode
, type
);
6877 if (GATHER_STATISTICS
)
6879 tree_code_counts
[(int) TREE_CODE (type
)]--;
6880 tree_node_counts
[(int) t_kind
]--;
6881 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6887 type_hash_add (hashcode
, type
);
6892 /* See if the data pointed to by the type hash table is marked. We consider
6893 it marked if the type is marked or if a debug type number or symbol
6894 table entry has been made for the type. */
6897 type_hash_marked_p (const void *p
)
6899 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6901 return ggc_marked_p (type
);
6905 print_type_hash_statistics (void)
6907 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6908 (long) htab_size (type_hash_table
),
6909 (long) htab_elements (type_hash_table
),
6910 htab_collisions (type_hash_table
));
6913 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6914 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6915 by adding the hash codes of the individual attributes. */
6918 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6922 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6923 /* ??? Do we want to add in TREE_VALUE too? */
6924 hashcode
= iterative_hash_object
6925 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6929 /* Given two lists of attributes, return true if list l2 is
6930 equivalent to l1. */
6933 attribute_list_equal (const_tree l1
, const_tree l2
)
6938 return attribute_list_contained (l1
, l2
)
6939 && attribute_list_contained (l2
, l1
);
6942 /* Given two lists of attributes, return true if list L2 is
6943 completely contained within L1. */
6944 /* ??? This would be faster if attribute names were stored in a canonicalized
6945 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6946 must be used to show these elements are equivalent (which they are). */
6947 /* ??? It's not clear that attributes with arguments will always be handled
6951 attribute_list_contained (const_tree l1
, const_tree l2
)
6955 /* First check the obvious, maybe the lists are identical. */
6959 /* Maybe the lists are similar. */
6960 for (t1
= l1
, t2
= l2
;
6962 && get_attribute_name (t1
) == get_attribute_name (t2
)
6963 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6964 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6967 /* Maybe the lists are equal. */
6968 if (t1
== 0 && t2
== 0)
6971 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6974 /* This CONST_CAST is okay because lookup_attribute does not
6975 modify its argument and the return value is assigned to a
6977 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
6978 CONST_CAST_TREE (l1
));
6979 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6980 attr
= lookup_ident_attribute (get_attribute_name (t2
),
6984 if (attr
== NULL_TREE
)
6991 /* Given two lists of types
6992 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6993 return 1 if the lists contain the same types in the same order.
6994 Also, the TREE_PURPOSEs must match. */
6997 type_list_equal (const_tree l1
, const_tree l2
)
7001 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7002 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7003 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7004 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7005 && (TREE_TYPE (TREE_PURPOSE (t1
))
7006 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7012 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7013 given by TYPE. If the argument list accepts variable arguments,
7014 then this function counts only the ordinary arguments. */
7017 type_num_arguments (const_tree type
)
7022 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7023 /* If the function does not take a variable number of arguments,
7024 the last element in the list will have type `void'. */
7025 if (VOID_TYPE_P (TREE_VALUE (t
)))
7033 /* Nonzero if integer constants T1 and T2
7034 represent the same constant value. */
7037 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7042 if (t1
== 0 || t2
== 0)
7045 if (TREE_CODE (t1
) == INTEGER_CST
7046 && TREE_CODE (t2
) == INTEGER_CST
7047 && wi::to_widest (t1
) == wi::to_widest (t2
))
7053 /* Return true if T is an INTEGER_CST whose numerical value (extended
7054 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7057 tree_fits_shwi_p (const_tree t
)
7059 return (t
!= NULL_TREE
7060 && TREE_CODE (t
) == INTEGER_CST
7061 && wi::fits_shwi_p (wi::to_widest (t
)));
7064 /* Return true if T is an INTEGER_CST whose numerical value (extended
7065 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7068 tree_fits_uhwi_p (const_tree t
)
7070 return (t
!= NULL_TREE
7071 && TREE_CODE (t
) == INTEGER_CST
7072 && wi::fits_uhwi_p (wi::to_widest (t
)));
7075 /* T is an INTEGER_CST whose numerical value (extended according to
7076 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7080 tree_to_shwi (const_tree t
)
7082 gcc_assert (tree_fits_shwi_p (t
));
7083 return TREE_INT_CST_LOW (t
);
7086 /* T is an INTEGER_CST whose numerical value (extended according to
7087 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7090 unsigned HOST_WIDE_INT
7091 tree_to_uhwi (const_tree t
)
7093 gcc_assert (tree_fits_uhwi_p (t
));
7094 return TREE_INT_CST_LOW (t
);
7097 /* Return the most significant (sign) bit of T. */
7100 tree_int_cst_sign_bit (const_tree t
)
7102 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7104 return wi::extract_uhwi (t
, bitno
, 1);
7107 /* Return an indication of the sign of the integer constant T.
7108 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7109 Note that -1 will never be returned if T's type is unsigned. */
7112 tree_int_cst_sgn (const_tree t
)
7114 if (wi::eq_p (t
, 0))
7116 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7118 else if (wi::neg_p (t
))
7124 /* Return the minimum number of bits needed to represent VALUE in a
7125 signed or unsigned type, UNSIGNEDP says which. */
7128 tree_int_cst_min_precision (tree value
, signop sgn
)
7130 /* If the value is negative, compute its negative minus 1. The latter
7131 adjustment is because the absolute value of the largest negative value
7132 is one larger than the largest positive value. This is equivalent to
7133 a bit-wise negation, so use that operation instead. */
7135 if (tree_int_cst_sgn (value
) < 0)
7136 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7138 /* Return the number of bits needed, taking into account the fact
7139 that we need one more bit for a signed than unsigned type.
7140 If value is 0 or -1, the minimum precision is 1 no matter
7141 whether unsignedp is true or false. */
7143 if (integer_zerop (value
))
7146 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7149 /* Return truthvalue of whether T1 is the same tree structure as T2.
7150 Return 1 if they are the same.
7151 Return 0 if they are understandably different.
7152 Return -1 if either contains tree structure not understood by
7156 simple_cst_equal (const_tree t1
, const_tree t2
)
7158 enum tree_code code1
, code2
;
7164 if (t1
== 0 || t2
== 0)
7167 code1
= TREE_CODE (t1
);
7168 code2
= TREE_CODE (t2
);
7170 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7172 if (CONVERT_EXPR_CODE_P (code2
)
7173 || code2
== NON_LVALUE_EXPR
)
7174 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7176 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7179 else if (CONVERT_EXPR_CODE_P (code2
)
7180 || code2
== NON_LVALUE_EXPR
)
7181 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7189 return wi::to_widest (t1
) == wi::to_widest (t2
);
7192 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7195 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7198 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7199 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7200 TREE_STRING_LENGTH (t1
)));
7204 unsigned HOST_WIDE_INT idx
;
7205 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7206 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7208 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7211 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7212 /* ??? Should we handle also fields here? */
7213 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7219 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7222 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7225 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7228 const_tree arg1
, arg2
;
7229 const_call_expr_arg_iterator iter1
, iter2
;
7230 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7231 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7233 arg1
= next_const_call_expr_arg (&iter1
),
7234 arg2
= next_const_call_expr_arg (&iter2
))
7236 cmp
= simple_cst_equal (arg1
, arg2
);
7240 return arg1
== arg2
;
7244 /* Special case: if either target is an unallocated VAR_DECL,
7245 it means that it's going to be unified with whatever the
7246 TARGET_EXPR is really supposed to initialize, so treat it
7247 as being equivalent to anything. */
7248 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7249 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7250 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7251 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7252 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7253 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7256 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7261 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7263 case WITH_CLEANUP_EXPR
:
7264 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7268 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7271 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7272 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7286 /* This general rule works for most tree codes. All exceptions should be
7287 handled above. If this is a language-specific tree code, we can't
7288 trust what might be in the operand, so say we don't know
7290 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7293 switch (TREE_CODE_CLASS (code1
))
7297 case tcc_comparison
:
7298 case tcc_expression
:
7302 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7304 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7316 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7317 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7318 than U, respectively. */
7321 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7323 if (tree_int_cst_sgn (t
) < 0)
7325 else if (!tree_fits_uhwi_p (t
))
7327 else if (TREE_INT_CST_LOW (t
) == u
)
7329 else if (TREE_INT_CST_LOW (t
) < u
)
7335 /* Return true if SIZE represents a constant size that is in bounds of
7336 what the middle-end and the backend accepts (covering not more than
7337 half of the address-space). */
7340 valid_constant_size_p (const_tree size
)
7342 if (! tree_fits_uhwi_p (size
)
7343 || TREE_OVERFLOW (size
)
7344 || tree_int_cst_sign_bit (size
) != 0)
7349 /* Return the precision of the type, or for a complex or vector type the
7350 precision of the type of its elements. */
7353 element_precision (const_tree type
)
7355 enum tree_code code
= TREE_CODE (type
);
7356 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7357 type
= TREE_TYPE (type
);
7359 return TYPE_PRECISION (type
);
7362 /* Return true if CODE represents an associative tree code. Otherwise
7365 associative_tree_code (enum tree_code code
)
7384 /* Return true if CODE represents a commutative tree code. Otherwise
7387 commutative_tree_code (enum tree_code code
)
7393 case MULT_HIGHPART_EXPR
:
7401 case UNORDERED_EXPR
:
7405 case TRUTH_AND_EXPR
:
7406 case TRUTH_XOR_EXPR
:
7408 case WIDEN_MULT_EXPR
:
7409 case VEC_WIDEN_MULT_HI_EXPR
:
7410 case VEC_WIDEN_MULT_LO_EXPR
:
7411 case VEC_WIDEN_MULT_EVEN_EXPR
:
7412 case VEC_WIDEN_MULT_ODD_EXPR
:
7421 /* Return true if CODE represents a ternary tree code for which the
7422 first two operands are commutative. Otherwise return false. */
7424 commutative_ternary_tree_code (enum tree_code code
)
7428 case WIDEN_MULT_PLUS_EXPR
:
7429 case WIDEN_MULT_MINUS_EXPR
:
7438 /* Generate a hash value for an expression. This can be used iteratively
7439 by passing a previous result as the VAL argument.
7441 This function is intended to produce the same hash for expressions which
7442 would compare equal using operand_equal_p. */
7445 iterative_hash_expr (const_tree t
, hashval_t val
)
7448 enum tree_code code
;
7449 enum tree_code_class tclass
;
7452 return iterative_hash_hashval_t (0, val
);
7454 code
= TREE_CODE (t
);
7458 /* Alas, constants aren't shared, so we can't rely on pointer
7461 return iterative_hash_hashval_t (0, val
);
7463 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7464 val
= iterative_hash_host_wide_int (TREE_INT_CST_ELT (t
, i
), val
);
7468 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7470 return iterative_hash_hashval_t (val2
, val
);
7474 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7476 return iterative_hash_hashval_t (val2
, val
);
7479 return iterative_hash (TREE_STRING_POINTER (t
),
7480 TREE_STRING_LENGTH (t
), val
);
7482 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7483 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7487 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7488 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7492 /* We can just compare by pointer. */
7493 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7494 case PLACEHOLDER_EXPR
:
7495 /* The node itself doesn't matter. */
7498 /* A list of expressions, for a CALL_EXPR or as the elements of a
7500 for (; t
; t
= TREE_CHAIN (t
))
7501 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7505 unsigned HOST_WIDE_INT idx
;
7507 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7509 val
= iterative_hash_expr (field
, val
);
7510 val
= iterative_hash_expr (value
, val
);
7515 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7516 Otherwise nodes that compare equal according to operand_equal_p might
7517 get different hash codes. However, don't do this for machine specific
7518 or front end builtins, since the function code is overloaded in those
7520 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7521 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7523 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7524 code
= TREE_CODE (t
);
7528 tclass
= TREE_CODE_CLASS (code
);
7530 if (tclass
== tcc_declaration
)
7532 /* DECL's have a unique ID */
7533 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7537 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7539 val
= iterative_hash_object (code
, val
);
7541 /* Don't hash the type, that can lead to having nodes which
7542 compare equal according to operand_equal_p, but which
7543 have different hash codes. */
7544 if (CONVERT_EXPR_CODE_P (code
)
7545 || code
== NON_LVALUE_EXPR
)
7547 /* Make sure to include signness in the hash computation. */
7548 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7549 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7552 else if (commutative_tree_code (code
))
7554 /* It's a commutative expression. We want to hash it the same
7555 however it appears. We do this by first hashing both operands
7556 and then rehashing based on the order of their independent
7558 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7559 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7563 t
= one
, one
= two
, two
= t
;
7565 val
= iterative_hash_hashval_t (one
, val
);
7566 val
= iterative_hash_hashval_t (two
, val
);
7569 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7570 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7576 /* Constructors for pointer, array and function types.
7577 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7578 constructed by language-dependent code, not here.) */
7580 /* Construct, lay out and return the type of pointers to TO_TYPE with
7581 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7582 reference all of memory. If such a type has already been
7583 constructed, reuse it. */
7586 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7591 if (to_type
== error_mark_node
)
7592 return error_mark_node
;
7594 /* If the pointed-to type has the may_alias attribute set, force
7595 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7596 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7597 can_alias_all
= true;
7599 /* In some cases, languages will have things that aren't a POINTER_TYPE
7600 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7601 In that case, return that type without regard to the rest of our
7604 ??? This is a kludge, but consistent with the way this function has
7605 always operated and there doesn't seem to be a good way to avoid this
7607 if (TYPE_POINTER_TO (to_type
) != 0
7608 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7609 return TYPE_POINTER_TO (to_type
);
7611 /* First, if we already have a type for pointers to TO_TYPE and it's
7612 the proper mode, use it. */
7613 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7614 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7617 t
= make_node (POINTER_TYPE
);
7619 TREE_TYPE (t
) = to_type
;
7620 SET_TYPE_MODE (t
, mode
);
7621 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7622 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7623 TYPE_POINTER_TO (to_type
) = t
;
7625 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7626 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7627 else if (TYPE_CANONICAL (to_type
) != to_type
)
7629 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7630 mode
, can_alias_all
);
7632 /* Lay out the type. This function has many callers that are concerned
7633 with expression-construction, and this simplifies them all. */
7639 /* By default build pointers in ptr_mode. */
7642 build_pointer_type (tree to_type
)
7644 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7645 : TYPE_ADDR_SPACE (to_type
);
7646 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7647 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7650 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7653 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7658 if (to_type
== error_mark_node
)
7659 return error_mark_node
;
7661 /* If the pointed-to type has the may_alias attribute set, force
7662 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7663 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7664 can_alias_all
= true;
7666 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7667 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7668 In that case, return that type without regard to the rest of our
7671 ??? This is a kludge, but consistent with the way this function has
7672 always operated and there doesn't seem to be a good way to avoid this
7674 if (TYPE_REFERENCE_TO (to_type
) != 0
7675 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7676 return TYPE_REFERENCE_TO (to_type
);
7678 /* First, if we already have a type for pointers to TO_TYPE and it's
7679 the proper mode, use it. */
7680 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7681 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7684 t
= make_node (REFERENCE_TYPE
);
7686 TREE_TYPE (t
) = to_type
;
7687 SET_TYPE_MODE (t
, mode
);
7688 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7689 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7690 TYPE_REFERENCE_TO (to_type
) = t
;
7692 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7693 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7694 else if (TYPE_CANONICAL (to_type
) != to_type
)
7696 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7697 mode
, can_alias_all
);
7705 /* Build the node for the type of references-to-TO_TYPE by default
7709 build_reference_type (tree to_type
)
7711 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7712 : TYPE_ADDR_SPACE (to_type
);
7713 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7714 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7717 #define MAX_INT_CACHED_PREC \
7718 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7719 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7721 /* Builds a signed or unsigned integer type of precision PRECISION.
7722 Used for C bitfields whose precision does not match that of
7723 built-in target types. */
7725 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7731 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7733 if (precision
<= MAX_INT_CACHED_PREC
)
7735 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7740 itype
= make_node (INTEGER_TYPE
);
7741 TYPE_PRECISION (itype
) = precision
;
7744 fixup_unsigned_type (itype
);
7746 fixup_signed_type (itype
);
7749 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7750 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7751 if (precision
<= MAX_INT_CACHED_PREC
)
7752 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7757 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7758 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7759 is true, reuse such a type that has already been constructed. */
7762 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7764 tree itype
= make_node (INTEGER_TYPE
);
7765 hashval_t hashcode
= 0;
7767 TREE_TYPE (itype
) = type
;
7769 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7770 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7772 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7773 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7774 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7775 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7776 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7777 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7782 if ((TYPE_MIN_VALUE (itype
)
7783 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7784 || (TYPE_MAX_VALUE (itype
)
7785 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7787 /* Since we cannot reliably merge this type, we need to compare it using
7788 structural equality checks. */
7789 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7793 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7794 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7795 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7796 itype
= type_hash_canon (hashcode
, itype
);
7801 /* Wrapper around build_range_type_1 with SHARED set to true. */
7804 build_range_type (tree type
, tree lowval
, tree highval
)
7806 return build_range_type_1 (type
, lowval
, highval
, true);
7809 /* Wrapper around build_range_type_1 with SHARED set to false. */
7812 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7814 return build_range_type_1 (type
, lowval
, highval
, false);
7817 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7818 MAXVAL should be the maximum value in the domain
7819 (one less than the length of the array).
7821 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7822 We don't enforce this limit, that is up to caller (e.g. language front end).
7823 The limit exists because the result is a signed type and we don't handle
7824 sizes that use more than one HOST_WIDE_INT. */
7827 build_index_type (tree maxval
)
7829 return build_range_type (sizetype
, size_zero_node
, maxval
);
7832 /* Return true if the debug information for TYPE, a subtype, should be emitted
7833 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7834 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7835 debug info and doesn't reflect the source code. */
7838 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7840 tree base_type
= TREE_TYPE (type
), low
, high
;
7842 /* Subrange types have a base type which is an integral type. */
7843 if (!INTEGRAL_TYPE_P (base_type
))
7846 /* Get the real bounds of the subtype. */
7847 if (lang_hooks
.types
.get_subrange_bounds
)
7848 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7851 low
= TYPE_MIN_VALUE (type
);
7852 high
= TYPE_MAX_VALUE (type
);
7855 /* If the type and its base type have the same representation and the same
7856 name, then the type is not a subrange but a copy of the base type. */
7857 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7858 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7859 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7860 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7861 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7862 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7872 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7873 and number of elements specified by the range of values of INDEX_TYPE.
7874 If SHARED is true, reuse such a type that has already been constructed. */
7877 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7881 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7883 error ("arrays of functions are not meaningful");
7884 elt_type
= integer_type_node
;
7887 t
= make_node (ARRAY_TYPE
);
7888 TREE_TYPE (t
) = elt_type
;
7889 TYPE_DOMAIN (t
) = index_type
;
7890 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7893 /* If the element type is incomplete at this point we get marked for
7894 structural equality. Do not record these types in the canonical
7896 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7901 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7903 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7904 t
= type_hash_canon (hashcode
, t
);
7907 if (TYPE_CANONICAL (t
) == t
)
7909 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7910 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7911 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7912 else if (TYPE_CANONICAL (elt_type
) != elt_type
7913 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7915 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7917 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7924 /* Wrapper around build_array_type_1 with SHARED set to true. */
7927 build_array_type (tree elt_type
, tree index_type
)
7929 return build_array_type_1 (elt_type
, index_type
, true);
7932 /* Wrapper around build_array_type_1 with SHARED set to false. */
7935 build_nonshared_array_type (tree elt_type
, tree index_type
)
7937 return build_array_type_1 (elt_type
, index_type
, false);
7940 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7944 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7946 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7949 /* Recursively examines the array elements of TYPE, until a non-array
7950 element type is found. */
7953 strip_array_types (tree type
)
7955 while (TREE_CODE (type
) == ARRAY_TYPE
)
7956 type
= TREE_TYPE (type
);
7961 /* Computes the canonical argument types from the argument type list
7964 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7965 on entry to this function, or if any of the ARGTYPES are
7968 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7969 true on entry to this function, or if any of the ARGTYPES are
7972 Returns a canonical argument list, which may be ARGTYPES when the
7973 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7974 true) or would not differ from ARGTYPES. */
7977 maybe_canonicalize_argtypes (tree argtypes
,
7978 bool *any_structural_p
,
7979 bool *any_noncanonical_p
)
7982 bool any_noncanonical_argtypes_p
= false;
7984 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7986 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7987 /* Fail gracefully by stating that the type is structural. */
7988 *any_structural_p
= true;
7989 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7990 *any_structural_p
= true;
7991 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7992 || TREE_PURPOSE (arg
))
7993 /* If the argument has a default argument, we consider it
7994 non-canonical even though the type itself is canonical.
7995 That way, different variants of function and method types
7996 with default arguments will all point to the variant with
7997 no defaults as their canonical type. */
7998 any_noncanonical_argtypes_p
= true;
8001 if (*any_structural_p
)
8004 if (any_noncanonical_argtypes_p
)
8006 /* Build the canonical list of argument types. */
8007 tree canon_argtypes
= NULL_TREE
;
8008 bool is_void
= false;
8010 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8012 if (arg
== void_list_node
)
8015 canon_argtypes
= tree_cons (NULL_TREE
,
8016 TYPE_CANONICAL (TREE_VALUE (arg
)),
8020 canon_argtypes
= nreverse (canon_argtypes
);
8022 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8024 /* There is a non-canonical type. */
8025 *any_noncanonical_p
= true;
8026 return canon_argtypes
;
8029 /* The canonical argument types are the same as ARGTYPES. */
8033 /* Construct, lay out and return
8034 the type of functions returning type VALUE_TYPE
8035 given arguments of types ARG_TYPES.
8036 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8037 are data type nodes for the arguments of the function.
8038 If such a type has already been constructed, reuse it. */
8041 build_function_type (tree value_type
, tree arg_types
)
8044 hashval_t hashcode
= 0;
8045 bool any_structural_p
, any_noncanonical_p
;
8046 tree canon_argtypes
;
8048 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8050 error ("function return type cannot be function");
8051 value_type
= integer_type_node
;
8054 /* Make a node of the sort we want. */
8055 t
= make_node (FUNCTION_TYPE
);
8056 TREE_TYPE (t
) = value_type
;
8057 TYPE_ARG_TYPES (t
) = arg_types
;
8059 /* If we already have such a type, use the old one. */
8060 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
8061 hashcode
= type_hash_list (arg_types
, hashcode
);
8062 t
= type_hash_canon (hashcode
, t
);
8064 /* Set up the canonical type. */
8065 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8066 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8067 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8069 &any_noncanonical_p
);
8070 if (any_structural_p
)
8071 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8072 else if (any_noncanonical_p
)
8073 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8076 if (!COMPLETE_TYPE_P (t
))
8081 /* Build a function type. The RETURN_TYPE is the type returned by the
8082 function. If VAARGS is set, no void_type_node is appended to the
8083 the list. ARGP must be always be terminated be a NULL_TREE. */
8086 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8090 t
= va_arg (argp
, tree
);
8091 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8092 args
= tree_cons (NULL_TREE
, t
, args
);
8097 if (args
!= NULL_TREE
)
8098 args
= nreverse (args
);
8099 gcc_assert (last
!= void_list_node
);
8101 else if (args
== NULL_TREE
)
8102 args
= void_list_node
;
8106 args
= nreverse (args
);
8107 TREE_CHAIN (last
) = void_list_node
;
8109 args
= build_function_type (return_type
, args
);
8114 /* Build a function type. The RETURN_TYPE is the type returned by the
8115 function. If additional arguments are provided, they are
8116 additional argument types. The list of argument types must always
8117 be terminated by NULL_TREE. */
8120 build_function_type_list (tree return_type
, ...)
8125 va_start (p
, return_type
);
8126 args
= build_function_type_list_1 (false, return_type
, p
);
8131 /* Build a variable argument function type. The RETURN_TYPE is the
8132 type returned by the function. If additional arguments are provided,
8133 they are additional argument types. The list of argument types must
8134 always be terminated by NULL_TREE. */
8137 build_varargs_function_type_list (tree return_type
, ...)
8142 va_start (p
, return_type
);
8143 args
= build_function_type_list_1 (true, return_type
, p
);
8149 /* Build a function type. RETURN_TYPE is the type returned by the
8150 function; VAARGS indicates whether the function takes varargs. The
8151 function takes N named arguments, the types of which are provided in
8155 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8159 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8161 for (i
= n
- 1; i
>= 0; i
--)
8162 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8164 return build_function_type (return_type
, t
);
8167 /* Build a function type. RETURN_TYPE is the type returned by the
8168 function. The function takes N named arguments, the types of which
8169 are provided in ARG_TYPES. */
8172 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8174 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8177 /* Build a variable argument function type. RETURN_TYPE is the type
8178 returned by the function. The function takes N named arguments, the
8179 types of which are provided in ARG_TYPES. */
8182 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8184 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8187 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8188 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8189 for the method. An implicit additional parameter (of type
8190 pointer-to-BASETYPE) is added to the ARGTYPES. */
8193 build_method_type_directly (tree basetype
,
8200 bool any_structural_p
, any_noncanonical_p
;
8201 tree canon_argtypes
;
8203 /* Make a node of the sort we want. */
8204 t
= make_node (METHOD_TYPE
);
8206 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8207 TREE_TYPE (t
) = rettype
;
8208 ptype
= build_pointer_type (basetype
);
8210 /* The actual arglist for this function includes a "hidden" argument
8211 which is "this". Put it into the list of argument types. */
8212 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8213 TYPE_ARG_TYPES (t
) = argtypes
;
8215 /* If we already have such a type, use the old one. */
8216 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8217 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8218 hashcode
= type_hash_list (argtypes
, hashcode
);
8219 t
= type_hash_canon (hashcode
, t
);
8221 /* Set up the canonical type. */
8223 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8224 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8226 = (TYPE_CANONICAL (basetype
) != basetype
8227 || TYPE_CANONICAL (rettype
) != rettype
);
8228 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8230 &any_noncanonical_p
);
8231 if (any_structural_p
)
8232 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8233 else if (any_noncanonical_p
)
8235 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8236 TYPE_CANONICAL (rettype
),
8238 if (!COMPLETE_TYPE_P (t
))
8244 /* Construct, lay out and return the type of methods belonging to class
8245 BASETYPE and whose arguments and values are described by TYPE.
8246 If that type exists already, reuse it.
8247 TYPE must be a FUNCTION_TYPE node. */
8250 build_method_type (tree basetype
, tree type
)
8252 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8254 return build_method_type_directly (basetype
,
8256 TYPE_ARG_TYPES (type
));
8259 /* Construct, lay out and return the type of offsets to a value
8260 of type TYPE, within an object of type BASETYPE.
8261 If a suitable offset type exists already, reuse it. */
8264 build_offset_type (tree basetype
, tree type
)
8267 hashval_t hashcode
= 0;
8269 /* Make a node of the sort we want. */
8270 t
= make_node (OFFSET_TYPE
);
8272 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8273 TREE_TYPE (t
) = type
;
8275 /* If we already have such a type, use the old one. */
8276 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8277 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8278 t
= type_hash_canon (hashcode
, t
);
8280 if (!COMPLETE_TYPE_P (t
))
8283 if (TYPE_CANONICAL (t
) == t
)
8285 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8286 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8287 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8288 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8289 || TYPE_CANONICAL (type
) != type
)
8291 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8292 TYPE_CANONICAL (type
));
8298 /* Create a complex type whose components are COMPONENT_TYPE. */
8301 build_complex_type (tree component_type
)
8306 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8307 || SCALAR_FLOAT_TYPE_P (component_type
)
8308 || FIXED_POINT_TYPE_P (component_type
));
8310 /* Make a node of the sort we want. */
8311 t
= make_node (COMPLEX_TYPE
);
8313 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8315 /* If we already have such a type, use the old one. */
8316 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8317 t
= type_hash_canon (hashcode
, t
);
8319 if (!COMPLETE_TYPE_P (t
))
8322 if (TYPE_CANONICAL (t
) == t
)
8324 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8325 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8326 else if (TYPE_CANONICAL (component_type
) != component_type
)
8328 = build_complex_type (TYPE_CANONICAL (component_type
));
8331 /* We need to create a name, since complex is a fundamental type. */
8332 if (! TYPE_NAME (t
))
8335 if (component_type
== char_type_node
)
8336 name
= "complex char";
8337 else if (component_type
== signed_char_type_node
)
8338 name
= "complex signed char";
8339 else if (component_type
== unsigned_char_type_node
)
8340 name
= "complex unsigned char";
8341 else if (component_type
== short_integer_type_node
)
8342 name
= "complex short int";
8343 else if (component_type
== short_unsigned_type_node
)
8344 name
= "complex short unsigned int";
8345 else if (component_type
== integer_type_node
)
8346 name
= "complex int";
8347 else if (component_type
== unsigned_type_node
)
8348 name
= "complex unsigned int";
8349 else if (component_type
== long_integer_type_node
)
8350 name
= "complex long int";
8351 else if (component_type
== long_unsigned_type_node
)
8352 name
= "complex long unsigned int";
8353 else if (component_type
== long_long_integer_type_node
)
8354 name
= "complex long long int";
8355 else if (component_type
== long_long_unsigned_type_node
)
8356 name
= "complex long long unsigned int";
8361 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8362 get_identifier (name
), t
);
8365 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8368 /* If TYPE is a real or complex floating-point type and the target
8369 does not directly support arithmetic on TYPE then return the wider
8370 type to be used for arithmetic on TYPE. Otherwise, return
8374 excess_precision_type (tree type
)
8376 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8378 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8379 switch (TREE_CODE (type
))
8382 switch (flt_eval_method
)
8385 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8386 return double_type_node
;
8389 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8390 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8391 return long_double_type_node
;
8398 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8400 switch (flt_eval_method
)
8403 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8404 return complex_double_type_node
;
8407 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8408 || (TYPE_MODE (TREE_TYPE (type
))
8409 == TYPE_MODE (double_type_node
)))
8410 return complex_long_double_type_node
;
8423 /* Return OP, stripped of any conversions to wider types as much as is safe.
8424 Converting the value back to OP's type makes a value equivalent to OP.
8426 If FOR_TYPE is nonzero, we return a value which, if converted to
8427 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8429 OP must have integer, real or enumeral type. Pointers are not allowed!
8431 There are some cases where the obvious value we could return
8432 would regenerate to OP if converted to OP's type,
8433 but would not extend like OP to wider types.
8434 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8435 For example, if OP is (unsigned short)(signed char)-1,
8436 we avoid returning (signed char)-1 if FOR_TYPE is int,
8437 even though extending that to an unsigned short would regenerate OP,
8438 since the result of extending (signed char)-1 to (int)
8439 is different from (int) OP. */
8442 get_unwidened (tree op
, tree for_type
)
8444 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8445 tree type
= TREE_TYPE (op
);
8447 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8449 = (for_type
!= 0 && for_type
!= type
8450 && final_prec
> TYPE_PRECISION (type
)
8451 && TYPE_UNSIGNED (type
));
8454 while (CONVERT_EXPR_P (op
))
8458 /* TYPE_PRECISION on vector types has different meaning
8459 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8460 so avoid them here. */
8461 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8464 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8465 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8467 /* Truncations are many-one so cannot be removed.
8468 Unless we are later going to truncate down even farther. */
8470 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8473 /* See what's inside this conversion. If we decide to strip it,
8475 op
= TREE_OPERAND (op
, 0);
8477 /* If we have not stripped any zero-extensions (uns is 0),
8478 we can strip any kind of extension.
8479 If we have previously stripped a zero-extension,
8480 only zero-extensions can safely be stripped.
8481 Any extension can be stripped if the bits it would produce
8482 are all going to be discarded later by truncating to FOR_TYPE. */
8486 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8488 /* TYPE_UNSIGNED says whether this is a zero-extension.
8489 Let's avoid computing it if it does not affect WIN
8490 and if UNS will not be needed again. */
8492 || CONVERT_EXPR_P (op
))
8493 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8501 /* If we finally reach a constant see if it fits in for_type and
8502 in that case convert it. */
8504 && TREE_CODE (win
) == INTEGER_CST
8505 && TREE_TYPE (win
) != for_type
8506 && int_fits_type_p (win
, for_type
))
8507 win
= fold_convert (for_type
, win
);
8512 /* Return OP or a simpler expression for a narrower value
8513 which can be sign-extended or zero-extended to give back OP.
8514 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8515 or 0 if the value should be sign-extended. */
8518 get_narrower (tree op
, int *unsignedp_ptr
)
8523 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8525 while (TREE_CODE (op
) == NOP_EXPR
)
8528 = (TYPE_PRECISION (TREE_TYPE (op
))
8529 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8531 /* Truncations are many-one so cannot be removed. */
8535 /* See what's inside this conversion. If we decide to strip it,
8540 op
= TREE_OPERAND (op
, 0);
8541 /* An extension: the outermost one can be stripped,
8542 but remember whether it is zero or sign extension. */
8544 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8545 /* Otherwise, if a sign extension has been stripped,
8546 only sign extensions can now be stripped;
8547 if a zero extension has been stripped, only zero-extensions. */
8548 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8552 else /* bitschange == 0 */
8554 /* A change in nominal type can always be stripped, but we must
8555 preserve the unsignedness. */
8557 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8559 op
= TREE_OPERAND (op
, 0);
8560 /* Keep trying to narrow, but don't assign op to win if it
8561 would turn an integral type into something else. */
8562 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8569 if (TREE_CODE (op
) == COMPONENT_REF
8570 /* Since type_for_size always gives an integer type. */
8571 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8572 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8573 /* Ensure field is laid out already. */
8574 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8575 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8577 unsigned HOST_WIDE_INT innerprec
8578 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8579 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8580 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8581 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8583 /* We can get this structure field in a narrower type that fits it,
8584 but the resulting extension to its nominal type (a fullword type)
8585 must satisfy the same conditions as for other extensions.
8587 Do this only for fields that are aligned (not bit-fields),
8588 because when bit-field insns will be used there is no
8589 advantage in doing this. */
8591 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8592 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8593 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8597 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8598 win
= fold_convert (type
, op
);
8602 *unsignedp_ptr
= uns
;
8606 /* Returns true if integer constant C has a value that is permissible
8607 for type TYPE (an INTEGER_TYPE). */
8610 int_fits_type_p (const_tree c
, const_tree type
)
8612 tree type_low_bound
, type_high_bound
;
8613 bool ok_for_low_bound
, ok_for_high_bound
;
8614 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8617 type_low_bound
= TYPE_MIN_VALUE (type
);
8618 type_high_bound
= TYPE_MAX_VALUE (type
);
8620 /* If at least one bound of the type is a constant integer, we can check
8621 ourselves and maybe make a decision. If no such decision is possible, but
8622 this type is a subtype, try checking against that. Otherwise, use
8623 fits_to_tree_p, which checks against the precision.
8625 Compute the status for each possibly constant bound, and return if we see
8626 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8627 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8628 for "constant known to fit". */
8630 /* Check if c >= type_low_bound. */
8631 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8633 if (tree_int_cst_lt (c
, type_low_bound
))
8635 ok_for_low_bound
= true;
8638 ok_for_low_bound
= false;
8640 /* Check if c <= type_high_bound. */
8641 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8643 if (tree_int_cst_lt (type_high_bound
, c
))
8645 ok_for_high_bound
= true;
8648 ok_for_high_bound
= false;
8650 /* If the constant fits both bounds, the result is known. */
8651 if (ok_for_low_bound
&& ok_for_high_bound
)
8654 /* Perform some generic filtering which may allow making a decision
8655 even if the bounds are not constant. First, negative integers
8656 never fit in unsigned types, */
8657 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8660 /* Second, narrower types always fit in wider ones. */
8661 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8664 /* Third, unsigned integers with top bit set never fit signed types. */
8665 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8667 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8668 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8670 /* When a tree_cst is converted to a wide-int, the precision
8671 is taken from the type. However, if the precision of the
8672 mode underneath the type is smaller than that, it is
8673 possible that the value will not fit. The test below
8674 fails if any bit is set between the sign bit of the
8675 underlying mode and the top bit of the type. */
8676 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8679 else if (wi::neg_p (c
))
8683 /* If we haven't been able to decide at this point, there nothing more we
8684 can check ourselves here. Look at the base type if we have one and it
8685 has the same precision. */
8686 if (TREE_CODE (type
) == INTEGER_TYPE
8687 && TREE_TYPE (type
) != 0
8688 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8690 type
= TREE_TYPE (type
);
8694 /* Or to fits_to_tree_p, if nothing else. */
8695 return wi::fits_to_tree_p (c
, type
);
8698 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8699 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8700 represented (assuming two's-complement arithmetic) within the bit
8701 precision of the type are returned instead. */
8704 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8706 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8707 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8708 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8711 if (TYPE_UNSIGNED (type
))
8712 mpz_set_ui (min
, 0);
8715 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8716 wi::to_mpz (mn
, min
, SIGNED
);
8720 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8721 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8722 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8725 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8726 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8730 /* Return true if VAR is an automatic variable defined in function FN. */
8733 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8735 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8736 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8737 || TREE_CODE (var
) == PARM_DECL
)
8738 && ! TREE_STATIC (var
))
8739 || TREE_CODE (var
) == LABEL_DECL
8740 || TREE_CODE (var
) == RESULT_DECL
));
8743 /* Subprogram of following function. Called by walk_tree.
8745 Return *TP if it is an automatic variable or parameter of the
8746 function passed in as DATA. */
8749 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8751 tree fn
= (tree
) data
;
8756 else if (DECL_P (*tp
)
8757 && auto_var_in_fn_p (*tp
, fn
))
8763 /* Returns true if T is, contains, or refers to a type with variable
8764 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8765 arguments, but not the return type. If FN is nonzero, only return
8766 true if a modifier of the type or position of FN is a variable or
8767 parameter inside FN.
8769 This concept is more general than that of C99 'variably modified types':
8770 in C99, a struct type is never variably modified because a VLA may not
8771 appear as a structure member. However, in GNU C code like:
8773 struct S { int i[f()]; };
8775 is valid, and other languages may define similar constructs. */
8778 variably_modified_type_p (tree type
, tree fn
)
8782 /* Test if T is either variable (if FN is zero) or an expression containing
8783 a variable in FN. If TYPE isn't gimplified, return true also if
8784 gimplify_one_sizepos would gimplify the expression into a local
8786 #define RETURN_TRUE_IF_VAR(T) \
8787 do { tree _t = (T); \
8788 if (_t != NULL_TREE \
8789 && _t != error_mark_node \
8790 && TREE_CODE (_t) != INTEGER_CST \
8791 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8793 || (!TYPE_SIZES_GIMPLIFIED (type) \
8794 && !is_gimple_sizepos (_t)) \
8795 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8796 return true; } while (0)
8798 if (type
== error_mark_node
)
8801 /* If TYPE itself has variable size, it is variably modified. */
8802 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8803 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8805 switch (TREE_CODE (type
))
8808 case REFERENCE_TYPE
:
8810 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8816 /* If TYPE is a function type, it is variably modified if the
8817 return type is variably modified. */
8818 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8824 case FIXED_POINT_TYPE
:
8827 /* Scalar types are variably modified if their end points
8829 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8830 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8835 case QUAL_UNION_TYPE
:
8836 /* We can't see if any of the fields are variably-modified by the
8837 definition we normally use, since that would produce infinite
8838 recursion via pointers. */
8839 /* This is variably modified if some field's type is. */
8840 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8841 if (TREE_CODE (t
) == FIELD_DECL
)
8843 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8844 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8845 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8847 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8848 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8853 /* Do not call ourselves to avoid infinite recursion. This is
8854 variably modified if the element type is. */
8855 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8856 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8863 /* The current language may have other cases to check, but in general,
8864 all other types are not variably modified. */
8865 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8867 #undef RETURN_TRUE_IF_VAR
8870 /* Given a DECL or TYPE, return the scope in which it was declared, or
8871 NULL_TREE if there is no containing scope. */
8874 get_containing_scope (const_tree t
)
8876 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8879 /* Return the innermost context enclosing DECL that is
8880 a FUNCTION_DECL, or zero if none. */
8883 decl_function_context (const_tree decl
)
8887 if (TREE_CODE (decl
) == ERROR_MARK
)
8890 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8891 where we look up the function at runtime. Such functions always take
8892 a first argument of type 'pointer to real context'.
8894 C++ should really be fixed to use DECL_CONTEXT for the real context,
8895 and use something else for the "virtual context". */
8896 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8899 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8901 context
= DECL_CONTEXT (decl
);
8903 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8905 if (TREE_CODE (context
) == BLOCK
)
8906 context
= BLOCK_SUPERCONTEXT (context
);
8908 context
= get_containing_scope (context
);
8914 /* Return the innermost context enclosing DECL that is
8915 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8916 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8919 decl_type_context (const_tree decl
)
8921 tree context
= DECL_CONTEXT (decl
);
8924 switch (TREE_CODE (context
))
8926 case NAMESPACE_DECL
:
8927 case TRANSLATION_UNIT_DECL
:
8932 case QUAL_UNION_TYPE
:
8937 context
= DECL_CONTEXT (context
);
8941 context
= BLOCK_SUPERCONTEXT (context
);
8951 /* CALL is a CALL_EXPR. Return the declaration for the function
8952 called, or NULL_TREE if the called function cannot be
8956 get_callee_fndecl (const_tree call
)
8960 if (call
== error_mark_node
)
8961 return error_mark_node
;
8963 /* It's invalid to call this function with anything but a
8965 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8967 /* The first operand to the CALL is the address of the function
8969 addr
= CALL_EXPR_FN (call
);
8971 /* If there is no function, return early. */
8972 if (addr
== NULL_TREE
)
8977 /* If this is a readonly function pointer, extract its initial value. */
8978 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8979 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8980 && DECL_INITIAL (addr
))
8981 addr
= DECL_INITIAL (addr
);
8983 /* If the address is just `&f' for some function `f', then we know
8984 that `f' is being called. */
8985 if (TREE_CODE (addr
) == ADDR_EXPR
8986 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8987 return TREE_OPERAND (addr
, 0);
8989 /* We couldn't figure out what was being called. */
8993 /* Print debugging information about tree nodes generated during the compile,
8994 and any language-specific information. */
8997 dump_tree_statistics (void)
8999 if (GATHER_STATISTICS
)
9002 int total_nodes
, total_bytes
;
9003 fprintf (stderr
, "Kind Nodes Bytes\n");
9004 fprintf (stderr
, "---------------------------------------\n");
9005 total_nodes
= total_bytes
= 0;
9006 for (i
= 0; i
< (int) all_kinds
; i
++)
9008 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9009 tree_node_counts
[i
], tree_node_sizes
[i
]);
9010 total_nodes
+= tree_node_counts
[i
];
9011 total_bytes
+= tree_node_sizes
[i
];
9013 fprintf (stderr
, "---------------------------------------\n");
9014 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9015 fprintf (stderr
, "---------------------------------------\n");
9016 fprintf (stderr
, "Code Nodes\n");
9017 fprintf (stderr
, "----------------------------\n");
9018 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9019 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9020 tree_code_counts
[i
]);
9021 fprintf (stderr
, "----------------------------\n");
9022 ssanames_print_statistics ();
9023 phinodes_print_statistics ();
9026 fprintf (stderr
, "(No per-node statistics)\n");
9028 print_type_hash_statistics ();
9029 print_debug_expr_statistics ();
9030 print_value_expr_statistics ();
9031 lang_hooks
.print_statistics ();
9034 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9036 /* Generate a crc32 of a byte. */
9039 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9043 for (ix
= bits
; ix
--; value
<<= 1)
9047 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9054 /* Generate a crc32 of a 32-bit unsigned. */
9057 crc32_unsigned (unsigned chksum
, unsigned value
)
9059 return crc32_unsigned_bits (chksum
, value
, 32);
9062 /* Generate a crc32 of a byte. */
9065 crc32_byte (unsigned chksum
, char byte
)
9067 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9070 /* Generate a crc32 of a string. */
9073 crc32_string (unsigned chksum
, const char *string
)
9077 chksum
= crc32_byte (chksum
, *string
);
9083 /* P is a string that will be used in a symbol. Mask out any characters
9084 that are not valid in that context. */
9087 clean_symbol_name (char *p
)
9091 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9094 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9101 /* Generate a name for a special-purpose function.
9102 The generated name may need to be unique across the whole link.
9103 Changes to this function may also require corresponding changes to
9104 xstrdup_mask_random.
9105 TYPE is some string to identify the purpose of this function to the
9106 linker or collect2; it must start with an uppercase letter,
9108 I - for constructors
9110 N - for C++ anonymous namespaces
9111 F - for DWARF unwind frame information. */
9114 get_file_function_name (const char *type
)
9120 /* If we already have a name we know to be unique, just use that. */
9121 if (first_global_object_name
)
9122 p
= q
= ASTRDUP (first_global_object_name
);
9123 /* If the target is handling the constructors/destructors, they
9124 will be local to this file and the name is only necessary for
9126 We also assign sub_I and sub_D sufixes to constructors called from
9127 the global static constructors. These are always local. */
9128 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9129 || (strncmp (type
, "sub_", 4) == 0
9130 && (type
[4] == 'I' || type
[4] == 'D')))
9132 const char *file
= main_input_filename
;
9134 file
= LOCATION_FILE (input_location
);
9135 /* Just use the file's basename, because the full pathname
9136 might be quite long. */
9137 p
= q
= ASTRDUP (lbasename (file
));
9141 /* Otherwise, the name must be unique across the entire link.
9142 We don't have anything that we know to be unique to this translation
9143 unit, so use what we do have and throw in some randomness. */
9145 const char *name
= weak_global_object_name
;
9146 const char *file
= main_input_filename
;
9151 file
= LOCATION_FILE (input_location
);
9153 len
= strlen (file
);
9154 q
= (char *) alloca (9 + 17 + len
+ 1);
9155 memcpy (q
, file
, len
+ 1);
9157 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9158 crc32_string (0, name
), get_random_seed (false));
9163 clean_symbol_name (q
);
9164 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9167 /* Set up the name of the file-level functions we may need.
9168 Use a global object (which is already required to be unique over
9169 the program) rather than the file name (which imposes extra
9171 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9173 return get_identifier (buf
);
9176 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9178 /* Complain that the tree code of NODE does not match the expected 0
9179 terminated list of trailing codes. The trailing code list can be
9180 empty, for a more vague error message. FILE, LINE, and FUNCTION
9181 are of the caller. */
9184 tree_check_failed (const_tree node
, const char *file
,
9185 int line
, const char *function
, ...)
9189 unsigned length
= 0;
9190 enum tree_code code
;
9192 va_start (args
, function
);
9193 while ((code
= (enum tree_code
) va_arg (args
, int)))
9194 length
+= 4 + strlen (get_tree_code_name (code
));
9199 va_start (args
, function
);
9200 length
+= strlen ("expected ");
9201 buffer
= tmp
= (char *) alloca (length
);
9203 while ((code
= (enum tree_code
) va_arg (args
, int)))
9205 const char *prefix
= length
? " or " : "expected ";
9207 strcpy (tmp
+ length
, prefix
);
9208 length
+= strlen (prefix
);
9209 strcpy (tmp
+ length
, get_tree_code_name (code
));
9210 length
+= strlen (get_tree_code_name (code
));
9215 buffer
= "unexpected node";
9217 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9218 buffer
, get_tree_code_name (TREE_CODE (node
)),
9219 function
, trim_filename (file
), line
);
9222 /* Complain that the tree code of NODE does match the expected 0
9223 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9227 tree_not_check_failed (const_tree node
, const char *file
,
9228 int line
, const char *function
, ...)
9232 unsigned length
= 0;
9233 enum tree_code code
;
9235 va_start (args
, function
);
9236 while ((code
= (enum tree_code
) va_arg (args
, int)))
9237 length
+= 4 + strlen (get_tree_code_name (code
));
9239 va_start (args
, function
);
9240 buffer
= (char *) alloca (length
);
9242 while ((code
= (enum tree_code
) va_arg (args
, int)))
9246 strcpy (buffer
+ length
, " or ");
9249 strcpy (buffer
+ length
, get_tree_code_name (code
));
9250 length
+= strlen (get_tree_code_name (code
));
9254 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9255 buffer
, get_tree_code_name (TREE_CODE (node
)),
9256 function
, trim_filename (file
), line
);
9259 /* Similar to tree_check_failed, except that we check for a class of tree
9260 code, given in CL. */
9263 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9264 const char *file
, int line
, const char *function
)
9267 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9268 TREE_CODE_CLASS_STRING (cl
),
9269 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9270 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9273 /* Similar to tree_check_failed, except that instead of specifying a
9274 dozen codes, use the knowledge that they're all sequential. */
9277 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9278 const char *function
, enum tree_code c1
,
9282 unsigned length
= 0;
9285 for (c
= c1
; c
<= c2
; ++c
)
9286 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9288 length
+= strlen ("expected ");
9289 buffer
= (char *) alloca (length
);
9292 for (c
= c1
; c
<= c2
; ++c
)
9294 const char *prefix
= length
? " or " : "expected ";
9296 strcpy (buffer
+ length
, prefix
);
9297 length
+= strlen (prefix
);
9298 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9299 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9302 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9303 buffer
, get_tree_code_name (TREE_CODE (node
)),
9304 function
, trim_filename (file
), line
);
9308 /* Similar to tree_check_failed, except that we check that a tree does
9309 not have the specified code, given in CL. */
9312 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9313 const char *file
, int line
, const char *function
)
9316 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9317 TREE_CODE_CLASS_STRING (cl
),
9318 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9319 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9323 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9326 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9327 const char *function
, enum omp_clause_code code
)
9329 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9330 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9331 function
, trim_filename (file
), line
);
9335 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9338 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9339 const char *function
, enum omp_clause_code c1
,
9340 enum omp_clause_code c2
)
9343 unsigned length
= 0;
9346 for (c
= c1
; c
<= c2
; ++c
)
9347 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9349 length
+= strlen ("expected ");
9350 buffer
= (char *) alloca (length
);
9353 for (c
= c1
; c
<= c2
; ++c
)
9355 const char *prefix
= length
? " or " : "expected ";
9357 strcpy (buffer
+ length
, prefix
);
9358 length
+= strlen (prefix
);
9359 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9360 length
+= strlen (omp_clause_code_name
[c
]);
9363 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9364 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9365 function
, trim_filename (file
), line
);
9369 #undef DEFTREESTRUCT
9370 #define DEFTREESTRUCT(VAL, NAME) NAME,
9372 static const char *ts_enum_names
[] = {
9373 #include "treestruct.def"
9375 #undef DEFTREESTRUCT
9377 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9379 /* Similar to tree_class_check_failed, except that we check for
9380 whether CODE contains the tree structure identified by EN. */
9383 tree_contains_struct_check_failed (const_tree node
,
9384 const enum tree_node_structure_enum en
,
9385 const char *file
, int line
,
9386 const char *function
)
9389 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9391 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9395 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9396 (dynamically sized) vector. */
9399 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9400 const char *function
)
9403 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9404 idx
+ 1, len
, function
, trim_filename (file
), line
);
9407 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9408 (dynamically sized) vector. */
9411 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9412 const char *function
)
9415 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9416 idx
+ 1, len
, function
, trim_filename (file
), line
);
9419 /* Similar to above, except that the check is for the bounds of the operand
9420 vector of an expression node EXP. */
9423 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9424 int line
, const char *function
)
9426 enum tree_code code
= TREE_CODE (exp
);
9428 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9429 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9430 function
, trim_filename (file
), line
);
9433 /* Similar to above, except that the check is for the number of
9434 operands of an OMP_CLAUSE node. */
9437 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9438 int line
, const char *function
)
9441 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9442 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9443 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9444 trim_filename (file
), line
);
9446 #endif /* ENABLE_TREE_CHECKING */
9448 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9449 and mapped to the machine mode MODE. Initialize its fields and build
9450 the information necessary for debugging output. */
9453 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9456 hashval_t hashcode
= 0;
9458 t
= make_node (VECTOR_TYPE
);
9459 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9460 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9461 SET_TYPE_MODE (t
, mode
);
9463 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9464 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9465 else if (TYPE_CANONICAL (innertype
) != innertype
9466 || mode
!= VOIDmode
)
9468 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9472 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9473 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9474 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9475 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9476 t
= type_hash_canon (hashcode
, t
);
9478 /* We have built a main variant, based on the main variant of the
9479 inner type. Use it to build the variant we return. */
9480 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9481 && TREE_TYPE (t
) != innertype
)
9482 return build_type_attribute_qual_variant (t
,
9483 TYPE_ATTRIBUTES (innertype
),
9484 TYPE_QUALS (innertype
));
9490 make_or_reuse_type (unsigned size
, int unsignedp
)
9492 if (size
== INT_TYPE_SIZE
)
9493 return unsignedp
? unsigned_type_node
: integer_type_node
;
9494 if (size
== CHAR_TYPE_SIZE
)
9495 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9496 if (size
== SHORT_TYPE_SIZE
)
9497 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9498 if (size
== LONG_TYPE_SIZE
)
9499 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9500 if (size
== LONG_LONG_TYPE_SIZE
)
9501 return (unsignedp
? long_long_unsigned_type_node
9502 : long_long_integer_type_node
);
9503 if (size
== 128 && int128_integer_type_node
)
9504 return (unsignedp
? int128_unsigned_type_node
9505 : int128_integer_type_node
);
9508 return make_unsigned_type (size
);
9510 return make_signed_type (size
);
9513 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9516 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9520 if (size
== SHORT_FRACT_TYPE_SIZE
)
9521 return unsignedp
? sat_unsigned_short_fract_type_node
9522 : sat_short_fract_type_node
;
9523 if (size
== FRACT_TYPE_SIZE
)
9524 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9525 if (size
== LONG_FRACT_TYPE_SIZE
)
9526 return unsignedp
? sat_unsigned_long_fract_type_node
9527 : sat_long_fract_type_node
;
9528 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9529 return unsignedp
? sat_unsigned_long_long_fract_type_node
9530 : sat_long_long_fract_type_node
;
9534 if (size
== SHORT_FRACT_TYPE_SIZE
)
9535 return unsignedp
? unsigned_short_fract_type_node
9536 : short_fract_type_node
;
9537 if (size
== FRACT_TYPE_SIZE
)
9538 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9539 if (size
== LONG_FRACT_TYPE_SIZE
)
9540 return unsignedp
? unsigned_long_fract_type_node
9541 : long_fract_type_node
;
9542 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9543 return unsignedp
? unsigned_long_long_fract_type_node
9544 : long_long_fract_type_node
;
9547 return make_fract_type (size
, unsignedp
, satp
);
9550 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9553 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9557 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9558 return unsignedp
? sat_unsigned_short_accum_type_node
9559 : sat_short_accum_type_node
;
9560 if (size
== ACCUM_TYPE_SIZE
)
9561 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9562 if (size
== LONG_ACCUM_TYPE_SIZE
)
9563 return unsignedp
? sat_unsigned_long_accum_type_node
9564 : sat_long_accum_type_node
;
9565 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9566 return unsignedp
? sat_unsigned_long_long_accum_type_node
9567 : sat_long_long_accum_type_node
;
9571 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9572 return unsignedp
? unsigned_short_accum_type_node
9573 : short_accum_type_node
;
9574 if (size
== ACCUM_TYPE_SIZE
)
9575 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9576 if (size
== LONG_ACCUM_TYPE_SIZE
)
9577 return unsignedp
? unsigned_long_accum_type_node
9578 : long_accum_type_node
;
9579 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9580 return unsignedp
? unsigned_long_long_accum_type_node
9581 : long_long_accum_type_node
;
9584 return make_accum_type (size
, unsignedp
, satp
);
9588 /* Create an atomic variant node for TYPE. This routine is called
9589 during initialization of data types to create the 5 basic atomic
9590 types. The generic build_variant_type function requires these to
9591 already be set up in order to function properly, so cannot be
9592 called from there. If ALIGN is non-zero, then ensure alignment is
9593 overridden to this value. */
9596 build_atomic_base (tree type
, unsigned int align
)
9600 /* Make sure its not already registered. */
9601 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9604 t
= build_variant_type_copy (type
);
9605 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9608 TYPE_ALIGN (t
) = align
;
9613 /* Create nodes for all integer types (and error_mark_node) using the sizes
9614 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9615 SHORT_DOUBLE specifies whether double should be of the same precision
9619 build_common_tree_nodes (bool signed_char
, bool short_double
)
9621 error_mark_node
= make_node (ERROR_MARK
);
9622 TREE_TYPE (error_mark_node
) = error_mark_node
;
9624 initialize_sizetypes ();
9626 /* Define both `signed char' and `unsigned char'. */
9627 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9628 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9629 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9630 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9632 /* Define `char', which is like either `signed char' or `unsigned char'
9633 but not the same as either. */
9636 ? make_signed_type (CHAR_TYPE_SIZE
)
9637 : make_unsigned_type (CHAR_TYPE_SIZE
));
9638 TYPE_STRING_FLAG (char_type_node
) = 1;
9640 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9641 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9642 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9643 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9644 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9645 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9646 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9647 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9648 #if HOST_BITS_PER_WIDE_INT >= 64
9649 /* TODO: This isn't correct, but as logic depends at the moment on
9650 host's instead of target's wide-integer.
9651 If there is a target not supporting TImode, but has an 128-bit
9652 integer-scalar register, this target check needs to be adjusted. */
9653 if (targetm
.scalar_mode_supported_p (TImode
))
9655 int128_integer_type_node
= make_signed_type (128);
9656 int128_unsigned_type_node
= make_unsigned_type (128);
9660 /* Define a boolean type. This type only represents boolean values but
9661 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9662 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9663 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9664 TYPE_PRECISION (boolean_type_node
) = 1;
9665 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9667 /* Define what type to use for size_t. */
9668 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9669 size_type_node
= unsigned_type_node
;
9670 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9671 size_type_node
= long_unsigned_type_node
;
9672 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9673 size_type_node
= long_long_unsigned_type_node
;
9674 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9675 size_type_node
= short_unsigned_type_node
;
9679 /* Fill in the rest of the sized types. Reuse existing type nodes
9681 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9682 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9683 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9684 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9685 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9687 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9688 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9689 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9690 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9691 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9693 /* Don't call build_qualified type for atomics. That routine does
9694 special processing for atomics, and until they are initialized
9695 it's better not to make that call.
9697 Check to see if there is a target override for atomic types. */
9699 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9700 targetm
.atomic_align_for_mode (QImode
));
9701 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9702 targetm
.atomic_align_for_mode (HImode
));
9703 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9704 targetm
.atomic_align_for_mode (SImode
));
9705 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9706 targetm
.atomic_align_for_mode (DImode
));
9707 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9708 targetm
.atomic_align_for_mode (TImode
));
9710 access_public_node
= get_identifier ("public");
9711 access_protected_node
= get_identifier ("protected");
9712 access_private_node
= get_identifier ("private");
9714 /* Define these next since types below may used them. */
9715 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9716 integer_one_node
= build_int_cst (integer_type_node
, 1);
9717 integer_three_node
= build_int_cst (integer_type_node
, 3);
9718 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9720 size_zero_node
= size_int (0);
9721 size_one_node
= size_int (1);
9722 bitsize_zero_node
= bitsize_int (0);
9723 bitsize_one_node
= bitsize_int (1);
9724 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9726 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9727 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9729 void_type_node
= make_node (VOID_TYPE
);
9730 layout_type (void_type_node
);
9732 /* We are not going to have real types in C with less than byte alignment,
9733 so we might as well not have any types that claim to have it. */
9734 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9735 TYPE_USER_ALIGN (void_type_node
) = 0;
9737 void_node
= make_node (VOID_CST
);
9738 TREE_TYPE (void_node
) = void_type_node
;
9740 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9741 layout_type (TREE_TYPE (null_pointer_node
));
9743 ptr_type_node
= build_pointer_type (void_type_node
);
9745 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9746 fileptr_type_node
= ptr_type_node
;
9748 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9750 float_type_node
= make_node (REAL_TYPE
);
9751 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9752 layout_type (float_type_node
);
9754 double_type_node
= make_node (REAL_TYPE
);
9756 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9758 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9759 layout_type (double_type_node
);
9761 long_double_type_node
= make_node (REAL_TYPE
);
9762 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9763 layout_type (long_double_type_node
);
9765 float_ptr_type_node
= build_pointer_type (float_type_node
);
9766 double_ptr_type_node
= build_pointer_type (double_type_node
);
9767 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9768 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9770 /* Fixed size integer types. */
9771 uint16_type_node
= build_nonstandard_integer_type (16, true);
9772 uint32_type_node
= build_nonstandard_integer_type (32, true);
9773 uint64_type_node
= build_nonstandard_integer_type (64, true);
9775 /* Decimal float types. */
9776 dfloat32_type_node
= make_node (REAL_TYPE
);
9777 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9778 layout_type (dfloat32_type_node
);
9779 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9780 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9782 dfloat64_type_node
= make_node (REAL_TYPE
);
9783 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9784 layout_type (dfloat64_type_node
);
9785 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9786 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9788 dfloat128_type_node
= make_node (REAL_TYPE
);
9789 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9790 layout_type (dfloat128_type_node
);
9791 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9792 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9794 complex_integer_type_node
= build_complex_type (integer_type_node
);
9795 complex_float_type_node
= build_complex_type (float_type_node
);
9796 complex_double_type_node
= build_complex_type (double_type_node
);
9797 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9799 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9800 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9801 sat_ ## KIND ## _type_node = \
9802 make_sat_signed_ ## KIND ## _type (SIZE); \
9803 sat_unsigned_ ## KIND ## _type_node = \
9804 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9805 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9806 unsigned_ ## KIND ## _type_node = \
9807 make_unsigned_ ## KIND ## _type (SIZE);
9809 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9810 sat_ ## WIDTH ## KIND ## _type_node = \
9811 make_sat_signed_ ## KIND ## _type (SIZE); \
9812 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9813 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9814 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9815 unsigned_ ## WIDTH ## KIND ## _type_node = \
9816 make_unsigned_ ## KIND ## _type (SIZE);
9818 /* Make fixed-point type nodes based on four different widths. */
9819 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9820 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9821 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9822 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9823 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9825 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9826 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9827 NAME ## _type_node = \
9828 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9829 u ## NAME ## _type_node = \
9830 make_or_reuse_unsigned_ ## KIND ## _type \
9831 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9832 sat_ ## NAME ## _type_node = \
9833 make_or_reuse_sat_signed_ ## KIND ## _type \
9834 (GET_MODE_BITSIZE (MODE ## mode)); \
9835 sat_u ## NAME ## _type_node = \
9836 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9837 (GET_MODE_BITSIZE (U ## MODE ## mode));
9839 /* Fixed-point type and mode nodes. */
9840 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9841 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9842 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9843 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9844 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9845 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9846 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9847 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9848 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9849 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9850 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9853 tree t
= targetm
.build_builtin_va_list ();
9855 /* Many back-ends define record types without setting TYPE_NAME.
9856 If we copied the record type here, we'd keep the original
9857 record type without a name. This breaks name mangling. So,
9858 don't copy record types and let c_common_nodes_and_builtins()
9859 declare the type to be __builtin_va_list. */
9860 if (TREE_CODE (t
) != RECORD_TYPE
)
9861 t
= build_variant_type_copy (t
);
9863 va_list_type_node
= t
;
9867 /* Modify DECL for given flags.
9868 TM_PURE attribute is set only on types, so the function will modify
9869 DECL's type when ECF_TM_PURE is used. */
9872 set_call_expr_flags (tree decl
, int flags
)
9874 if (flags
& ECF_NOTHROW
)
9875 TREE_NOTHROW (decl
) = 1;
9876 if (flags
& ECF_CONST
)
9877 TREE_READONLY (decl
) = 1;
9878 if (flags
& ECF_PURE
)
9879 DECL_PURE_P (decl
) = 1;
9880 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9881 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9882 if (flags
& ECF_NOVOPS
)
9883 DECL_IS_NOVOPS (decl
) = 1;
9884 if (flags
& ECF_NORETURN
)
9885 TREE_THIS_VOLATILE (decl
) = 1;
9886 if (flags
& ECF_MALLOC
)
9887 DECL_IS_MALLOC (decl
) = 1;
9888 if (flags
& ECF_RETURNS_TWICE
)
9889 DECL_IS_RETURNS_TWICE (decl
) = 1;
9890 if (flags
& ECF_LEAF
)
9891 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9892 NULL
, DECL_ATTRIBUTES (decl
));
9893 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9894 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9895 /* Looping const or pure is implied by noreturn.
9896 There is currently no way to declare looping const or looping pure alone. */
9897 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9898 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9902 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9905 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9906 const char *library_name
, int ecf_flags
)
9910 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9911 library_name
, NULL_TREE
);
9912 set_call_expr_flags (decl
, ecf_flags
);
9914 set_builtin_decl (code
, decl
, true);
9917 /* Call this function after instantiating all builtins that the language
9918 front end cares about. This will build the rest of the builtins that
9919 are relied upon by the tree optimizers and the middle-end. */
9922 build_common_builtin_nodes (void)
9927 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9929 ftype
= build_function_type (void_type_node
, void_list_node
);
9930 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9931 "__builtin_unreachable",
9932 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9933 | ECF_CONST
| ECF_LEAF
);
9936 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9937 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9939 ftype
= build_function_type_list (ptr_type_node
,
9940 ptr_type_node
, const_ptr_type_node
,
9941 size_type_node
, NULL_TREE
);
9943 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9944 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9945 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9946 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9947 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9948 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9951 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9953 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9954 const_ptr_type_node
, size_type_node
,
9956 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9957 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9960 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9962 ftype
= build_function_type_list (ptr_type_node
,
9963 ptr_type_node
, integer_type_node
,
9964 size_type_node
, NULL_TREE
);
9965 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9966 "memset", ECF_NOTHROW
| ECF_LEAF
);
9969 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9971 ftype
= build_function_type_list (ptr_type_node
,
9972 size_type_node
, NULL_TREE
);
9973 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9974 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9977 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9978 size_type_node
, NULL_TREE
);
9979 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9980 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9981 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9983 /* If we're checking the stack, `alloca' can throw. */
9984 if (flag_stack_check
)
9986 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9987 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9990 ftype
= build_function_type_list (void_type_node
,
9991 ptr_type_node
, ptr_type_node
,
9992 ptr_type_node
, NULL_TREE
);
9993 local_define_builtin ("__builtin_init_trampoline", ftype
,
9994 BUILT_IN_INIT_TRAMPOLINE
,
9995 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9996 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9997 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9998 "__builtin_init_heap_trampoline",
9999 ECF_NOTHROW
| ECF_LEAF
);
10001 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10002 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10003 BUILT_IN_ADJUST_TRAMPOLINE
,
10004 "__builtin_adjust_trampoline",
10005 ECF_CONST
| ECF_NOTHROW
);
10007 ftype
= build_function_type_list (void_type_node
,
10008 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10009 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10010 BUILT_IN_NONLOCAL_GOTO
,
10011 "__builtin_nonlocal_goto",
10012 ECF_NORETURN
| ECF_NOTHROW
);
10014 ftype
= build_function_type_list (void_type_node
,
10015 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10016 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10017 BUILT_IN_SETJMP_SETUP
,
10018 "__builtin_setjmp_setup", ECF_NOTHROW
);
10020 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10021 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10022 BUILT_IN_SETJMP_RECEIVER
,
10023 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10025 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10026 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10027 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10029 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10030 local_define_builtin ("__builtin_stack_restore", ftype
,
10031 BUILT_IN_STACK_RESTORE
,
10032 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10034 /* If there's a possibility that we might use the ARM EABI, build the
10035 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10036 if (targetm
.arm_eabi_unwinder
)
10038 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10039 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10040 BUILT_IN_CXA_END_CLEANUP
,
10041 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10044 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10045 local_define_builtin ("__builtin_unwind_resume", ftype
,
10046 BUILT_IN_UNWIND_RESUME
,
10047 ((targetm_common
.except_unwind_info (&global_options
)
10049 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10052 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10054 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10056 local_define_builtin ("__builtin_return_address", ftype
,
10057 BUILT_IN_RETURN_ADDRESS
,
10058 "__builtin_return_address",
10062 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10063 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10065 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10066 ptr_type_node
, NULL_TREE
);
10067 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10068 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10069 BUILT_IN_PROFILE_FUNC_ENTER
,
10070 "__cyg_profile_func_enter", 0);
10071 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10072 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10073 BUILT_IN_PROFILE_FUNC_EXIT
,
10074 "__cyg_profile_func_exit", 0);
10077 /* The exception object and filter values from the runtime. The argument
10078 must be zero before exception lowering, i.e. from the front end. After
10079 exception lowering, it will be the region number for the exception
10080 landing pad. These functions are PURE instead of CONST to prevent
10081 them from being hoisted past the exception edge that will initialize
10082 its value in the landing pad. */
10083 ftype
= build_function_type_list (ptr_type_node
,
10084 integer_type_node
, NULL_TREE
);
10085 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10086 /* Only use TM_PURE if we we have TM language support. */
10087 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10088 ecf_flags
|= ECF_TM_PURE
;
10089 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10090 "__builtin_eh_pointer", ecf_flags
);
10092 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10093 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10094 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10095 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10097 ftype
= build_function_type_list (void_type_node
,
10098 integer_type_node
, integer_type_node
,
10100 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10101 BUILT_IN_EH_COPY_VALUES
,
10102 "__builtin_eh_copy_values", ECF_NOTHROW
);
10104 /* Complex multiplication and division. These are handled as builtins
10105 rather than optabs because emit_library_call_value doesn't support
10106 complex. Further, we can do slightly better with folding these
10107 beasties if the real and complex parts of the arguments are separate. */
10111 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10113 char mode_name_buf
[4], *q
;
10115 enum built_in_function mcode
, dcode
;
10116 tree type
, inner_type
;
10117 const char *prefix
= "__";
10119 if (targetm
.libfunc_gnu_prefix
)
10122 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10125 inner_type
= TREE_TYPE (type
);
10127 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10128 inner_type
, inner_type
, NULL_TREE
);
10130 mcode
= ((enum built_in_function
)
10131 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10132 dcode
= ((enum built_in_function
)
10133 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10135 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10139 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10141 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10142 built_in_names
[mcode
],
10143 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10145 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10147 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10148 built_in_names
[dcode
],
10149 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10154 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10157 If we requested a pointer to a vector, build up the pointers that
10158 we stripped off while looking for the inner type. Similarly for
10159 return values from functions.
10161 The argument TYPE is the top of the chain, and BOTTOM is the
10162 new type which we will point to. */
10165 reconstruct_complex_type (tree type
, tree bottom
)
10169 if (TREE_CODE (type
) == POINTER_TYPE
)
10171 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10172 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10173 TYPE_REF_CAN_ALIAS_ALL (type
));
10175 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10177 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10178 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10179 TYPE_REF_CAN_ALIAS_ALL (type
));
10181 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10183 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10184 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10186 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10188 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10189 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10191 else if (TREE_CODE (type
) == METHOD_TYPE
)
10193 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10194 /* The build_method_type_directly() routine prepends 'this' to argument list,
10195 so we must compensate by getting rid of it. */
10197 = build_method_type_directly
10198 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10200 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10202 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10204 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10205 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10210 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10211 TYPE_QUALS (type
));
10214 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10217 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10221 switch (GET_MODE_CLASS (mode
))
10223 case MODE_VECTOR_INT
:
10224 case MODE_VECTOR_FLOAT
:
10225 case MODE_VECTOR_FRACT
:
10226 case MODE_VECTOR_UFRACT
:
10227 case MODE_VECTOR_ACCUM
:
10228 case MODE_VECTOR_UACCUM
:
10229 nunits
= GET_MODE_NUNITS (mode
);
10233 /* Check that there are no leftover bits. */
10234 gcc_assert (GET_MODE_BITSIZE (mode
)
10235 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10237 nunits
= GET_MODE_BITSIZE (mode
)
10238 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10242 gcc_unreachable ();
10245 return make_vector_type (innertype
, nunits
, mode
);
10248 /* Similarly, but takes the inner type and number of units, which must be
10252 build_vector_type (tree innertype
, int nunits
)
10254 return make_vector_type (innertype
, nunits
, VOIDmode
);
10257 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10260 build_opaque_vector_type (tree innertype
, int nunits
)
10262 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10264 /* We always build the non-opaque variant before the opaque one,
10265 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10266 cand
= TYPE_NEXT_VARIANT (t
);
10268 && TYPE_VECTOR_OPAQUE (cand
)
10269 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10271 /* Othewise build a variant type and make sure to queue it after
10272 the non-opaque type. */
10273 cand
= build_distinct_type_copy (t
);
10274 TYPE_VECTOR_OPAQUE (cand
) = true;
10275 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10276 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10277 TYPE_NEXT_VARIANT (t
) = cand
;
10278 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10283 /* Given an initializer INIT, return TRUE if INIT is zero or some
10284 aggregate of zeros. Otherwise return FALSE. */
10286 initializer_zerop (const_tree init
)
10292 switch (TREE_CODE (init
))
10295 return integer_zerop (init
);
10298 /* ??? Note that this is not correct for C4X float formats. There,
10299 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10300 negative exponent. */
10301 return real_zerop (init
)
10302 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10305 return fixed_zerop (init
);
10308 return integer_zerop (init
)
10309 || (real_zerop (init
)
10310 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10311 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10316 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10317 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10324 unsigned HOST_WIDE_INT idx
;
10326 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10327 if (!initializer_zerop (elt
))
10336 /* We need to loop through all elements to handle cases like
10337 "\0" and "\0foobar". */
10338 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10339 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10350 /* Check if vector VEC consists of all the equal elements and
10351 that the number of elements corresponds to the type of VEC.
10352 The function returns first element of the vector
10353 or NULL_TREE if the vector is not uniform. */
10355 uniform_vector_p (const_tree vec
)
10360 if (vec
== NULL_TREE
)
10363 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10365 if (TREE_CODE (vec
) == VECTOR_CST
)
10367 first
= VECTOR_CST_ELT (vec
, 0);
10368 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10369 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10375 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10377 first
= error_mark_node
;
10379 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10386 if (!operand_equal_p (first
, t
, 0))
10389 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10398 /* Build an empty statement at location LOC. */
10401 build_empty_stmt (location_t loc
)
10403 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10404 SET_EXPR_LOCATION (t
, loc
);
10409 /* Build an OpenMP clause with code CODE. LOC is the location of the
10413 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10418 length
= omp_clause_num_ops
[code
];
10419 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10421 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10423 t
= (tree
) ggc_internal_alloc (size
);
10424 memset (t
, 0, size
);
10425 TREE_SET_CODE (t
, OMP_CLAUSE
);
10426 OMP_CLAUSE_SET_CODE (t
, code
);
10427 OMP_CLAUSE_LOCATION (t
) = loc
;
10432 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10433 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10434 Except for the CODE and operand count field, other storage for the
10435 object is initialized to zeros. */
10438 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10441 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10443 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10444 gcc_assert (len
>= 1);
10446 record_node_allocation_statistics (code
, length
);
10448 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10450 TREE_SET_CODE (t
, code
);
10452 /* Can't use TREE_OPERAND to store the length because if checking is
10453 enabled, it will try to check the length before we store it. :-P */
10454 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10459 /* Helper function for build_call_* functions; build a CALL_EXPR with
10460 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10461 the argument slots. */
10464 build_call_1 (tree return_type
, tree fn
, int nargs
)
10468 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10469 TREE_TYPE (t
) = return_type
;
10470 CALL_EXPR_FN (t
) = fn
;
10471 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10476 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10477 FN and a null static chain slot. NARGS is the number of call arguments
10478 which are specified as "..." arguments. */
10481 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10485 va_start (args
, nargs
);
10486 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10491 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10492 FN and a null static chain slot. NARGS is the number of call arguments
10493 which are specified as a va_list ARGS. */
10496 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10501 t
= build_call_1 (return_type
, fn
, nargs
);
10502 for (i
= 0; i
< nargs
; i
++)
10503 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10504 process_call_operands (t
);
10508 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10509 FN and a null static chain slot. NARGS is the number of call arguments
10510 which are specified as a tree array ARGS. */
10513 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10514 int nargs
, const tree
*args
)
10519 t
= build_call_1 (return_type
, fn
, nargs
);
10520 for (i
= 0; i
< nargs
; i
++)
10521 CALL_EXPR_ARG (t
, i
) = args
[i
];
10522 process_call_operands (t
);
10523 SET_EXPR_LOCATION (t
, loc
);
10527 /* Like build_call_array, but takes a vec. */
10530 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10535 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10536 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10537 CALL_EXPR_ARG (ret
, ix
) = t
;
10538 process_call_operands (ret
);
10542 /* Conveniently construct a function call expression. FNDECL names the
10543 function to be called and N arguments are passed in the array
10547 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10549 tree fntype
= TREE_TYPE (fndecl
);
10550 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10552 return fold_builtin_call_array (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10555 /* Conveniently construct a function call expression. FNDECL names the
10556 function to be called and the arguments are passed in the vector
10560 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10562 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10563 vec_safe_address (vec
));
10567 /* Conveniently construct a function call expression. FNDECL names the
10568 function to be called, N is the number of arguments, and the "..."
10569 parameters are the argument expressions. */
10572 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10575 tree
*argarray
= XALLOCAVEC (tree
, n
);
10579 for (i
= 0; i
< n
; i
++)
10580 argarray
[i
] = va_arg (ap
, tree
);
10582 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10585 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10586 varargs macros aren't supported by all bootstrap compilers. */
10589 build_call_expr (tree fndecl
, int n
, ...)
10592 tree
*argarray
= XALLOCAVEC (tree
, n
);
10596 for (i
= 0; i
< n
; i
++)
10597 argarray
[i
] = va_arg (ap
, tree
);
10599 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10602 /* Build internal call expression. This is just like CALL_EXPR, except
10603 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10604 internal function. */
10607 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10608 tree type
, int n
, ...)
10613 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10615 for (i
= 0; i
< n
; i
++)
10616 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10618 SET_EXPR_LOCATION (fn
, loc
);
10619 CALL_EXPR_IFN (fn
) = ifn
;
10623 /* Create a new constant string literal and return a char* pointer to it.
10624 The STRING_CST value is the LEN characters at STR. */
10626 build_string_literal (int len
, const char *str
)
10628 tree t
, elem
, index
, type
;
10630 t
= build_string (len
, str
);
10631 elem
= build_type_variant (char_type_node
, 1, 0);
10632 index
= build_index_type (size_int (len
- 1));
10633 type
= build_array_type (elem
, index
);
10634 TREE_TYPE (t
) = type
;
10635 TREE_CONSTANT (t
) = 1;
10636 TREE_READONLY (t
) = 1;
10637 TREE_STATIC (t
) = 1;
10639 type
= build_pointer_type (elem
);
10640 t
= build1 (ADDR_EXPR
, type
,
10641 build4 (ARRAY_REF
, elem
,
10642 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10648 /* Return true if T (assumed to be a DECL) must be assigned a memory
10652 needs_to_live_in_memory (const_tree t
)
10654 return (TREE_ADDRESSABLE (t
)
10655 || is_global_var (t
)
10656 || (TREE_CODE (t
) == RESULT_DECL
10657 && !DECL_BY_REFERENCE (t
)
10658 && aggregate_value_p (t
, current_function_decl
)));
10661 /* Return value of a constant X and sign-extend it. */
10664 int_cst_value (const_tree x
)
10666 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10667 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10669 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10670 gcc_assert (cst_and_fits_in_hwi (x
));
10672 if (bits
< HOST_BITS_PER_WIDE_INT
)
10674 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10676 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10678 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10684 /* If TYPE is an integral or pointer type, return an integer type with
10685 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10686 if TYPE is already an integer type of signedness UNSIGNEDP. */
10689 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10691 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10694 if (TREE_CODE (type
) == VECTOR_TYPE
)
10696 tree inner
= TREE_TYPE (type
);
10697 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10700 if (inner
== inner2
)
10702 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10705 if (!INTEGRAL_TYPE_P (type
)
10706 && !POINTER_TYPE_P (type
)
10707 && TREE_CODE (type
) != OFFSET_TYPE
)
10710 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10713 /* If TYPE is an integral or pointer type, return an integer type with
10714 the same precision which is unsigned, or itself if TYPE is already an
10715 unsigned integer type. */
10718 unsigned_type_for (tree type
)
10720 return signed_or_unsigned_type_for (1, type
);
10723 /* If TYPE is an integral or pointer type, return an integer type with
10724 the same precision which is signed, or itself if TYPE is already a
10725 signed integer type. */
10728 signed_type_for (tree type
)
10730 return signed_or_unsigned_type_for (0, type
);
10733 /* If TYPE is a vector type, return a signed integer vector type with the
10734 same width and number of subparts. Otherwise return boolean_type_node. */
10737 truth_type_for (tree type
)
10739 if (TREE_CODE (type
) == VECTOR_TYPE
)
10741 tree elem
= lang_hooks
.types
.type_for_size
10742 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10743 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10746 return boolean_type_node
;
10749 /* Returns the largest value obtainable by casting something in INNER type to
10753 upper_bound_in_type (tree outer
, tree inner
)
10755 unsigned int det
= 0;
10756 unsigned oprec
= TYPE_PRECISION (outer
);
10757 unsigned iprec
= TYPE_PRECISION (inner
);
10760 /* Compute a unique number for every combination. */
10761 det
|= (oprec
> iprec
) ? 4 : 0;
10762 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10763 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10765 /* Determine the exponent to use. */
10770 /* oprec <= iprec, outer: signed, inner: don't care. */
10775 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10779 /* oprec > iprec, outer: signed, inner: signed. */
10783 /* oprec > iprec, outer: signed, inner: unsigned. */
10787 /* oprec > iprec, outer: unsigned, inner: signed. */
10791 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10795 gcc_unreachable ();
10798 return wide_int_to_tree (outer
,
10799 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10802 /* Returns the smallest value obtainable by casting something in INNER type to
10806 lower_bound_in_type (tree outer
, tree inner
)
10808 unsigned oprec
= TYPE_PRECISION (outer
);
10809 unsigned iprec
= TYPE_PRECISION (inner
);
10811 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10813 if (TYPE_UNSIGNED (outer
)
10814 /* If we are widening something of an unsigned type, OUTER type
10815 contains all values of INNER type. In particular, both INNER
10816 and OUTER types have zero in common. */
10817 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10818 return build_int_cst (outer
, 0);
10821 /* If we are widening a signed type to another signed type, we
10822 want to obtain -2^^(iprec-1). If we are keeping the
10823 precision or narrowing to a signed type, we want to obtain
10825 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10826 return wide_int_to_tree (outer
,
10827 wi::mask (prec
- 1, true,
10828 TYPE_PRECISION (outer
)));
10832 /* Return nonzero if two operands that are suitable for PHI nodes are
10833 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10834 SSA_NAME or invariant. Note that this is strictly an optimization.
10835 That is, callers of this function can directly call operand_equal_p
10836 and get the same result, only slower. */
10839 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10843 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10845 return operand_equal_p (arg0
, arg1
, 0);
10848 /* Returns number of zeros at the end of binary representation of X. */
10851 num_ending_zeros (const_tree x
)
10853 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10857 #define WALK_SUBTREE(NODE) \
10860 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10866 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10867 be walked whenever a type is seen in the tree. Rest of operands and return
10868 value are as for walk_tree. */
10871 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10872 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10874 tree result
= NULL_TREE
;
10876 switch (TREE_CODE (type
))
10879 case REFERENCE_TYPE
:
10881 /* We have to worry about mutually recursive pointers. These can't
10882 be written in C. They can in Ada. It's pathological, but
10883 there's an ACATS test (c38102a) that checks it. Deal with this
10884 by checking if we're pointing to another pointer, that one
10885 points to another pointer, that one does too, and we have no htab.
10886 If so, get a hash table. We check three levels deep to avoid
10887 the cost of the hash table if we don't need one. */
10888 if (POINTER_TYPE_P (TREE_TYPE (type
))
10889 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10890 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10893 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10901 /* ... fall through ... */
10904 WALK_SUBTREE (TREE_TYPE (type
));
10908 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10910 /* Fall through. */
10912 case FUNCTION_TYPE
:
10913 WALK_SUBTREE (TREE_TYPE (type
));
10917 /* We never want to walk into default arguments. */
10918 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10919 WALK_SUBTREE (TREE_VALUE (arg
));
10924 /* Don't follow this nodes's type if a pointer for fear that
10925 we'll have infinite recursion. If we have a PSET, then we
10928 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10929 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10930 WALK_SUBTREE (TREE_TYPE (type
));
10931 WALK_SUBTREE (TYPE_DOMAIN (type
));
10935 WALK_SUBTREE (TREE_TYPE (type
));
10936 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10946 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10947 called with the DATA and the address of each sub-tree. If FUNC returns a
10948 non-NULL value, the traversal is stopped, and the value returned by FUNC
10949 is returned. If PSET is non-NULL it is used to record the nodes visited,
10950 and to avoid visiting a node more than once. */
10953 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10954 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10956 enum tree_code code
;
10960 #define WALK_SUBTREE_TAIL(NODE) \
10964 goto tail_recurse; \
10969 /* Skip empty subtrees. */
10973 /* Don't walk the same tree twice, if the user has requested
10974 that we avoid doing so. */
10975 if (pset
&& pointer_set_insert (pset
, *tp
))
10978 /* Call the function. */
10980 result
= (*func
) (tp
, &walk_subtrees
, data
);
10982 /* If we found something, return it. */
10986 code
= TREE_CODE (*tp
);
10988 /* Even if we didn't, FUNC may have decided that there was nothing
10989 interesting below this point in the tree. */
10990 if (!walk_subtrees
)
10992 /* But we still need to check our siblings. */
10993 if (code
== TREE_LIST
)
10994 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10995 else if (code
== OMP_CLAUSE
)
10996 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11003 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11004 if (result
|| !walk_subtrees
)
11011 case IDENTIFIER_NODE
:
11018 case PLACEHOLDER_EXPR
:
11022 /* None of these have subtrees other than those already walked
11027 WALK_SUBTREE (TREE_VALUE (*tp
));
11028 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11033 int len
= TREE_VEC_LENGTH (*tp
);
11038 /* Walk all elements but the first. */
11040 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11042 /* Now walk the first one as a tail call. */
11043 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11047 WALK_SUBTREE (TREE_REALPART (*tp
));
11048 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11052 unsigned HOST_WIDE_INT idx
;
11053 constructor_elt
*ce
;
11055 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11057 WALK_SUBTREE (ce
->value
);
11062 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11067 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11069 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11070 into declarations that are just mentioned, rather than
11071 declared; they don't really belong to this part of the tree.
11072 And, we can see cycles: the initializer for a declaration
11073 can refer to the declaration itself. */
11074 WALK_SUBTREE (DECL_INITIAL (decl
));
11075 WALK_SUBTREE (DECL_SIZE (decl
));
11076 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11078 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11081 case STATEMENT_LIST
:
11083 tree_stmt_iterator i
;
11084 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11085 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11090 switch (OMP_CLAUSE_CODE (*tp
))
11092 case OMP_CLAUSE_PRIVATE
:
11093 case OMP_CLAUSE_SHARED
:
11094 case OMP_CLAUSE_FIRSTPRIVATE
:
11095 case OMP_CLAUSE_COPYIN
:
11096 case OMP_CLAUSE_COPYPRIVATE
:
11097 case OMP_CLAUSE_FINAL
:
11098 case OMP_CLAUSE_IF
:
11099 case OMP_CLAUSE_NUM_THREADS
:
11100 case OMP_CLAUSE_SCHEDULE
:
11101 case OMP_CLAUSE_UNIFORM
:
11102 case OMP_CLAUSE_DEPEND
:
11103 case OMP_CLAUSE_NUM_TEAMS
:
11104 case OMP_CLAUSE_THREAD_LIMIT
:
11105 case OMP_CLAUSE_DEVICE
:
11106 case OMP_CLAUSE_DIST_SCHEDULE
:
11107 case OMP_CLAUSE_SAFELEN
:
11108 case OMP_CLAUSE_SIMDLEN
:
11109 case OMP_CLAUSE__LOOPTEMP_
:
11110 case OMP_CLAUSE__SIMDUID_
:
11111 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11114 case OMP_CLAUSE_NOWAIT
:
11115 case OMP_CLAUSE_ORDERED
:
11116 case OMP_CLAUSE_DEFAULT
:
11117 case OMP_CLAUSE_UNTIED
:
11118 case OMP_CLAUSE_MERGEABLE
:
11119 case OMP_CLAUSE_PROC_BIND
:
11120 case OMP_CLAUSE_INBRANCH
:
11121 case OMP_CLAUSE_NOTINBRANCH
:
11122 case OMP_CLAUSE_FOR
:
11123 case OMP_CLAUSE_PARALLEL
:
11124 case OMP_CLAUSE_SECTIONS
:
11125 case OMP_CLAUSE_TASKGROUP
:
11126 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11128 case OMP_CLAUSE_LASTPRIVATE
:
11129 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11130 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11131 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11133 case OMP_CLAUSE_COLLAPSE
:
11136 for (i
= 0; i
< 3; i
++)
11137 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11138 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11141 case OMP_CLAUSE_LINEAR
:
11142 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11143 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11144 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11145 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11147 case OMP_CLAUSE_ALIGNED
:
11148 case OMP_CLAUSE_FROM
:
11149 case OMP_CLAUSE_TO
:
11150 case OMP_CLAUSE_MAP
:
11151 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11152 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11153 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11155 case OMP_CLAUSE_REDUCTION
:
11158 for (i
= 0; i
< 4; i
++)
11159 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11160 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11164 gcc_unreachable ();
11172 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11173 But, we only want to walk once. */
11174 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11175 for (i
= 0; i
< len
; ++i
)
11176 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11177 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11181 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11182 defining. We only want to walk into these fields of a type in this
11183 case and not in the general case of a mere reference to the type.
11185 The criterion is as follows: if the field can be an expression, it
11186 must be walked only here. This should be in keeping with the fields
11187 that are directly gimplified in gimplify_type_sizes in order for the
11188 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11189 variable-sized types.
11191 Note that DECLs get walked as part of processing the BIND_EXPR. */
11192 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11194 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11195 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11198 /* Call the function for the type. See if it returns anything or
11199 doesn't want us to continue. If we are to continue, walk both
11200 the normal fields and those for the declaration case. */
11201 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11202 if (result
|| !walk_subtrees
)
11205 /* But do not walk a pointed-to type since it may itself need to
11206 be walked in the declaration case if it isn't anonymous. */
11207 if (!POINTER_TYPE_P (*type_p
))
11209 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11214 /* If this is a record type, also walk the fields. */
11215 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11219 for (field
= TYPE_FIELDS (*type_p
); field
;
11220 field
= DECL_CHAIN (field
))
11222 /* We'd like to look at the type of the field, but we can
11223 easily get infinite recursion. So assume it's pointed
11224 to elsewhere in the tree. Also, ignore things that
11226 if (TREE_CODE (field
) != FIELD_DECL
)
11229 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11230 WALK_SUBTREE (DECL_SIZE (field
));
11231 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11232 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11233 WALK_SUBTREE (DECL_QUALIFIER (field
));
11237 /* Same for scalar types. */
11238 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11239 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11240 || TREE_CODE (*type_p
) == INTEGER_TYPE
11241 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11242 || TREE_CODE (*type_p
) == REAL_TYPE
)
11244 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11245 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11248 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11249 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11254 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11258 /* Walk over all the sub-trees of this operand. */
11259 len
= TREE_OPERAND_LENGTH (*tp
);
11261 /* Go through the subtrees. We need to do this in forward order so
11262 that the scope of a FOR_EXPR is handled properly. */
11265 for (i
= 0; i
< len
- 1; ++i
)
11266 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11267 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11270 /* If this is a type, walk the needed fields in the type. */
11271 else if (TYPE_P (*tp
))
11272 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11276 /* We didn't find what we were looking for. */
11279 #undef WALK_SUBTREE_TAIL
11281 #undef WALK_SUBTREE
11283 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11286 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11290 struct pointer_set_t
*pset
;
11292 pset
= pointer_set_create ();
11293 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11294 pointer_set_destroy (pset
);
11300 tree_block (tree t
)
11302 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11304 if (IS_EXPR_CODE_CLASS (c
))
11305 return LOCATION_BLOCK (t
->exp
.locus
);
11306 gcc_unreachable ();
11311 tree_set_block (tree t
, tree b
)
11313 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11315 if (IS_EXPR_CODE_CLASS (c
))
11318 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11320 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11323 gcc_unreachable ();
11326 /* Create a nameless artificial label and put it in the current
11327 function context. The label has a location of LOC. Returns the
11328 newly created label. */
11331 create_artificial_label (location_t loc
)
11333 tree lab
= build_decl (loc
,
11334 LABEL_DECL
, NULL_TREE
, void_type_node
);
11336 DECL_ARTIFICIAL (lab
) = 1;
11337 DECL_IGNORED_P (lab
) = 1;
11338 DECL_CONTEXT (lab
) = current_function_decl
;
11342 /* Given a tree, try to return a useful variable name that we can use
11343 to prefix a temporary that is being assigned the value of the tree.
11344 I.E. given <temp> = &A, return A. */
11349 tree stripped_decl
;
11352 STRIP_NOPS (stripped_decl
);
11353 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11354 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11355 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11357 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11360 return IDENTIFIER_POINTER (name
);
11364 switch (TREE_CODE (stripped_decl
))
11367 return get_name (TREE_OPERAND (stripped_decl
, 0));
11374 /* Return true if TYPE has a variable argument list. */
11377 stdarg_p (const_tree fntype
)
11379 function_args_iterator args_iter
;
11380 tree n
= NULL_TREE
, t
;
11385 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11390 return n
!= NULL_TREE
&& n
!= void_type_node
;
11393 /* Return true if TYPE has a prototype. */
11396 prototype_p (tree fntype
)
11400 gcc_assert (fntype
!= NULL_TREE
);
11402 t
= TYPE_ARG_TYPES (fntype
);
11403 return (t
!= NULL_TREE
);
11406 /* If BLOCK is inlined from an __attribute__((__artificial__))
11407 routine, return pointer to location from where it has been
11410 block_nonartificial_location (tree block
)
11412 location_t
*ret
= NULL
;
11414 while (block
&& TREE_CODE (block
) == BLOCK
11415 && BLOCK_ABSTRACT_ORIGIN (block
))
11417 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11419 while (TREE_CODE (ao
) == BLOCK
11420 && BLOCK_ABSTRACT_ORIGIN (ao
)
11421 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11422 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11424 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11426 /* If AO is an artificial inline, point RET to the
11427 call site locus at which it has been inlined and continue
11428 the loop, in case AO's caller is also an artificial
11430 if (DECL_DECLARED_INLINE_P (ao
)
11431 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11432 ret
= &BLOCK_SOURCE_LOCATION (block
);
11436 else if (TREE_CODE (ao
) != BLOCK
)
11439 block
= BLOCK_SUPERCONTEXT (block
);
11445 /* If EXP is inlined from an __attribute__((__artificial__))
11446 function, return the location of the original call expression. */
11449 tree_nonartificial_location (tree exp
)
11451 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11456 return EXPR_LOCATION (exp
);
11460 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11463 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11466 cl_option_hash_hash (const void *x
)
11468 const_tree
const t
= (const_tree
) x
;
11472 hashval_t hash
= 0;
11474 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11476 p
= (const char *)TREE_OPTIMIZATION (t
);
11477 len
= sizeof (struct cl_optimization
);
11480 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11482 p
= (const char *)TREE_TARGET_OPTION (t
);
11483 len
= sizeof (struct cl_target_option
);
11487 gcc_unreachable ();
11489 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11491 for (i
= 0; i
< len
; i
++)
11493 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11498 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11499 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11503 cl_option_hash_eq (const void *x
, const void *y
)
11505 const_tree
const xt
= (const_tree
) x
;
11506 const_tree
const yt
= (const_tree
) y
;
11511 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11514 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11516 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11517 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11518 len
= sizeof (struct cl_optimization
);
11521 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11523 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11524 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11525 len
= sizeof (struct cl_target_option
);
11529 gcc_unreachable ();
11531 return (memcmp (xp
, yp
, len
) == 0);
11534 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11537 build_optimization_node (struct gcc_options
*opts
)
11542 /* Use the cache of optimization nodes. */
11544 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11547 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11551 /* Insert this one into the hash table. */
11552 t
= cl_optimization_node
;
11555 /* Make a new node for next time round. */
11556 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11562 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11565 build_target_option_node (struct gcc_options
*opts
)
11570 /* Use the cache of optimization nodes. */
11572 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11575 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11579 /* Insert this one into the hash table. */
11580 t
= cl_target_option_node
;
11583 /* Make a new node for next time round. */
11584 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11590 /* Reset TREE_TARGET_GLOBALS cache for TARGET_OPTION_NODE.
11591 Called through htab_traverse. */
11594 prepare_target_option_node_for_pch (void **slot
, void *)
11596 tree node
= (tree
) *slot
;
11597 if (TREE_CODE (node
) == TARGET_OPTION_NODE
)
11598 TREE_TARGET_GLOBALS (node
) = NULL
;
11602 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11603 so that they aren't saved during PCH writing. */
11606 prepare_target_option_nodes_for_pch (void)
11608 htab_traverse (cl_option_hash_table
, prepare_target_option_node_for_pch
,
11612 /* Determine the "ultimate origin" of a block. The block may be an inlined
11613 instance of an inlined instance of a block which is local to an inline
11614 function, so we have to trace all of the way back through the origin chain
11615 to find out what sort of node actually served as the original seed for the
11619 block_ultimate_origin (const_tree block
)
11621 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11623 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11624 nodes in the function to point to themselves; ignore that if
11625 we're trying to output the abstract instance of this function. */
11626 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11629 if (immediate_origin
== NULL_TREE
)
11634 tree lookahead
= immediate_origin
;
11638 ret_val
= lookahead
;
11639 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11640 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11642 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11644 /* The block's abstract origin chain may not be the *ultimate* origin of
11645 the block. It could lead to a DECL that has an abstract origin set.
11646 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11647 will give us if it has one). Note that DECL's abstract origins are
11648 supposed to be the most distant ancestor (or so decl_ultimate_origin
11649 claims), so we don't need to loop following the DECL origins. */
11650 if (DECL_P (ret_val
))
11651 return DECL_ORIGIN (ret_val
);
11657 /* Return true iff conversion in EXP generates no instruction. Mark
11658 it inline so that we fully inline into the stripping functions even
11659 though we have two uses of this function. */
11662 tree_nop_conversion (const_tree exp
)
11664 tree outer_type
, inner_type
;
11666 if (!CONVERT_EXPR_P (exp
)
11667 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11669 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11672 outer_type
= TREE_TYPE (exp
);
11673 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11678 /* Use precision rather then machine mode when we can, which gives
11679 the correct answer even for submode (bit-field) types. */
11680 if ((INTEGRAL_TYPE_P (outer_type
)
11681 || POINTER_TYPE_P (outer_type
)
11682 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11683 && (INTEGRAL_TYPE_P (inner_type
)
11684 || POINTER_TYPE_P (inner_type
)
11685 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11686 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11688 /* Otherwise fall back on comparing machine modes (e.g. for
11689 aggregate types, floats). */
11690 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11693 /* Return true iff conversion in EXP generates no instruction. Don't
11694 consider conversions changing the signedness. */
11697 tree_sign_nop_conversion (const_tree exp
)
11699 tree outer_type
, inner_type
;
11701 if (!tree_nop_conversion (exp
))
11704 outer_type
= TREE_TYPE (exp
);
11705 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11707 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11708 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11711 /* Strip conversions from EXP according to tree_nop_conversion and
11712 return the resulting expression. */
11715 tree_strip_nop_conversions (tree exp
)
11717 while (tree_nop_conversion (exp
))
11718 exp
= TREE_OPERAND (exp
, 0);
11722 /* Strip conversions from EXP according to tree_sign_nop_conversion
11723 and return the resulting expression. */
11726 tree_strip_sign_nop_conversions (tree exp
)
11728 while (tree_sign_nop_conversion (exp
))
11729 exp
= TREE_OPERAND (exp
, 0);
11733 /* Avoid any floating point extensions from EXP. */
11735 strip_float_extensions (tree exp
)
11737 tree sub
, expt
, subt
;
11739 /* For floating point constant look up the narrowest type that can hold
11740 it properly and handle it like (type)(narrowest_type)constant.
11741 This way we can optimize for instance a=a*2.0 where "a" is float
11742 but 2.0 is double constant. */
11743 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11745 REAL_VALUE_TYPE orig
;
11748 orig
= TREE_REAL_CST (exp
);
11749 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11750 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11751 type
= float_type_node
;
11752 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11753 > TYPE_PRECISION (double_type_node
)
11754 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11755 type
= double_type_node
;
11757 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11760 if (!CONVERT_EXPR_P (exp
))
11763 sub
= TREE_OPERAND (exp
, 0);
11764 subt
= TREE_TYPE (sub
);
11765 expt
= TREE_TYPE (exp
);
11767 if (!FLOAT_TYPE_P (subt
))
11770 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11773 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11776 return strip_float_extensions (sub
);
11779 /* Strip out all handled components that produce invariant
11783 strip_invariant_refs (const_tree op
)
11785 while (handled_component_p (op
))
11787 switch (TREE_CODE (op
))
11790 case ARRAY_RANGE_REF
:
11791 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11792 || TREE_OPERAND (op
, 2) != NULL_TREE
11793 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11797 case COMPONENT_REF
:
11798 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11804 op
= TREE_OPERAND (op
, 0);
11810 static GTY(()) tree gcc_eh_personality_decl
;
11812 /* Return the GCC personality function decl. */
11815 lhd_gcc_personality (void)
11817 if (!gcc_eh_personality_decl
)
11818 gcc_eh_personality_decl
= build_personality_function ("gcc");
11819 return gcc_eh_personality_decl
;
11822 /* TARGET is a call target of GIMPLE call statement
11823 (obtained by gimple_call_fn). Return true if it is
11824 OBJ_TYPE_REF representing an virtual call of C++ method.
11825 (As opposed to OBJ_TYPE_REF representing objc calls
11826 through a cast where middle-end devirtualization machinery
11830 virtual_method_call_p (tree target
)
11832 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11834 target
= TREE_TYPE (target
);
11835 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
11836 target
= TREE_TYPE (target
);
11837 if (TREE_CODE (target
) == FUNCTION_TYPE
)
11839 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
11843 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11846 obj_type_ref_class (tree ref
)
11848 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11849 ref
= TREE_TYPE (ref
);
11850 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11851 ref
= TREE_TYPE (ref
);
11852 /* We look for type THIS points to. ObjC also builds
11853 OBJ_TYPE_REF with non-method calls, Their first parameter
11854 ID however also corresponds to class type. */
11855 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11856 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11857 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11858 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11859 return TREE_TYPE (ref
);
11862 /* Return true if T is in anonymous namespace. */
11865 type_in_anonymous_namespace_p (const_tree t
)
11867 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
11868 bulitin types; those have CONTEXT NULL. */
11869 if (!TYPE_CONTEXT (t
))
11871 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
11874 /* Try to find a base info of BINFO that would have its field decl at offset
11875 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11876 found, return, otherwise return NULL_TREE. */
11879 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11881 tree type
= BINFO_TYPE (binfo
);
11885 HOST_WIDE_INT pos
, size
;
11889 if (types_same_for_odr (type
, expected_type
))
11894 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11896 if (TREE_CODE (fld
) != FIELD_DECL
)
11899 pos
= int_bit_position (fld
);
11900 size
= tree_to_uhwi (DECL_SIZE (fld
));
11901 if (pos
<= offset
&& (pos
+ size
) > offset
)
11904 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11907 if (!DECL_ARTIFICIAL (fld
))
11909 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11913 /* Offset 0 indicates the primary base, whose vtable contents are
11914 represented in the binfo for the derived class. */
11915 else if (offset
!= 0)
11917 tree base_binfo
, binfo2
= binfo
;
11919 /* Find BINFO corresponding to FLD. This is bit harder
11920 by a fact that in virtual inheritance we may need to walk down
11921 the non-virtual inheritance chain. */
11924 tree containing_binfo
= NULL
, found_binfo
= NULL
;
11925 for (i
= 0; BINFO_BASE_ITERATE (binfo2
, i
, base_binfo
); i
++)
11926 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
11928 found_binfo
= base_binfo
;
11932 if ((tree_to_shwi (BINFO_OFFSET (base_binfo
))
11933 - tree_to_shwi (BINFO_OFFSET (binfo
)))
11934 * BITS_PER_UNIT
< pos
11935 /* Rule out types with no virtual methods or we can get confused
11936 here by zero sized bases. */
11937 && BINFO_VTABLE (TYPE_BINFO (BINFO_TYPE (base_binfo
)))
11938 && (!containing_binfo
11939 || (tree_to_shwi (BINFO_OFFSET (containing_binfo
))
11940 < tree_to_shwi (BINFO_OFFSET (base_binfo
)))))
11941 containing_binfo
= base_binfo
;
11944 binfo
= found_binfo
;
11947 if (!containing_binfo
)
11949 binfo2
= containing_binfo
;
11953 type
= TREE_TYPE (fld
);
11958 /* Returns true if X is a typedef decl. */
11961 is_typedef_decl (tree x
)
11963 return (x
&& TREE_CODE (x
) == TYPE_DECL
11964 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11967 /* Returns true iff TYPE is a type variant created for a typedef. */
11970 typedef_variant_p (tree type
)
11972 return is_typedef_decl (TYPE_NAME (type
));
11975 /* Warn about a use of an identifier which was marked deprecated. */
11977 warn_deprecated_use (tree node
, tree attr
)
11981 if (node
== 0 || !warn_deprecated_decl
)
11987 attr
= DECL_ATTRIBUTES (node
);
11988 else if (TYPE_P (node
))
11990 tree decl
= TYPE_STUB_DECL (node
);
11992 attr
= lookup_attribute ("deprecated",
11993 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11998 attr
= lookup_attribute ("deprecated", attr
);
12001 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12007 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12009 warning (OPT_Wdeprecated_declarations
,
12010 "%qD is deprecated (declared at %r%s:%d%R): %s",
12011 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12013 warning (OPT_Wdeprecated_declarations
,
12014 "%qD is deprecated (declared at %r%s:%d%R)",
12015 node
, "locus", xloc
.file
, xloc
.line
);
12017 else if (TYPE_P (node
))
12019 tree what
= NULL_TREE
;
12020 tree decl
= TYPE_STUB_DECL (node
);
12022 if (TYPE_NAME (node
))
12024 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12025 what
= TYPE_NAME (node
);
12026 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12027 && DECL_NAME (TYPE_NAME (node
)))
12028 what
= DECL_NAME (TYPE_NAME (node
));
12033 expanded_location xloc
12034 = expand_location (DECL_SOURCE_LOCATION (decl
));
12038 warning (OPT_Wdeprecated_declarations
,
12039 "%qE is deprecated (declared at %r%s:%d%R): %s",
12040 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12042 warning (OPT_Wdeprecated_declarations
,
12043 "%qE is deprecated (declared at %r%s:%d%R)",
12044 what
, "locus", xloc
.file
, xloc
.line
);
12049 warning (OPT_Wdeprecated_declarations
,
12050 "type is deprecated (declared at %r%s:%d%R): %s",
12051 "locus", xloc
.file
, xloc
.line
, msg
);
12053 warning (OPT_Wdeprecated_declarations
,
12054 "type is deprecated (declared at %r%s:%d%R)",
12055 "locus", xloc
.file
, xloc
.line
);
12063 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12066 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12071 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12074 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12080 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12081 somewhere in it. */
12084 contains_bitfld_component_ref_p (const_tree ref
)
12086 while (handled_component_p (ref
))
12088 if (TREE_CODE (ref
) == COMPONENT_REF
12089 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12091 ref
= TREE_OPERAND (ref
, 0);
12097 /* Try to determine whether a TRY_CATCH expression can fall through.
12098 This is a subroutine of block_may_fallthru. */
12101 try_catch_may_fallthru (const_tree stmt
)
12103 tree_stmt_iterator i
;
12105 /* If the TRY block can fall through, the whole TRY_CATCH can
12107 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12110 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12111 switch (TREE_CODE (tsi_stmt (i
)))
12114 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12115 catch expression and a body. The whole TRY_CATCH may fall
12116 through iff any of the catch bodies falls through. */
12117 for (; !tsi_end_p (i
); tsi_next (&i
))
12119 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12124 case EH_FILTER_EXPR
:
12125 /* The exception filter expression only matters if there is an
12126 exception. If the exception does not match EH_FILTER_TYPES,
12127 we will execute EH_FILTER_FAILURE, and we will fall through
12128 if that falls through. If the exception does match
12129 EH_FILTER_TYPES, the stack unwinder will continue up the
12130 stack, so we will not fall through. We don't know whether we
12131 will throw an exception which matches EH_FILTER_TYPES or not,
12132 so we just ignore EH_FILTER_TYPES and assume that we might
12133 throw an exception which doesn't match. */
12134 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12137 /* This case represents statements to be executed when an
12138 exception occurs. Those statements are implicitly followed
12139 by a RESX statement to resume execution after the exception.
12140 So in this case the TRY_CATCH never falls through. */
12145 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12146 need not be 100% accurate; simply be conservative and return true if we
12147 don't know. This is used only to avoid stupidly generating extra code.
12148 If we're wrong, we'll just delete the extra code later. */
12151 block_may_fallthru (const_tree block
)
12153 /* This CONST_CAST is okay because expr_last returns its argument
12154 unmodified and we assign it to a const_tree. */
12155 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12157 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12161 /* Easy cases. If the last statement of the block implies
12162 control transfer, then we can't fall through. */
12166 /* If SWITCH_LABELS is set, this is lowered, and represents a
12167 branch to a selected label and hence can not fall through.
12168 Otherwise SWITCH_BODY is set, and the switch can fall
12170 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12173 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12175 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12178 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12180 case TRY_CATCH_EXPR
:
12181 return try_catch_may_fallthru (stmt
);
12183 case TRY_FINALLY_EXPR
:
12184 /* The finally clause is always executed after the try clause,
12185 so if it does not fall through, then the try-finally will not
12186 fall through. Otherwise, if the try clause does not fall
12187 through, then when the finally clause falls through it will
12188 resume execution wherever the try clause was going. So the
12189 whole try-finally will only fall through if both the try
12190 clause and the finally clause fall through. */
12191 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12192 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12195 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12196 stmt
= TREE_OPERAND (stmt
, 1);
12202 /* Functions that do not return do not fall through. */
12203 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12205 case CLEANUP_POINT_EXPR
:
12206 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12209 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12215 return lang_hooks
.block_may_fallthru (stmt
);
12219 /* True if we are using EH to handle cleanups. */
12220 static bool using_eh_for_cleanups_flag
= false;
12222 /* This routine is called from front ends to indicate eh should be used for
12225 using_eh_for_cleanups (void)
12227 using_eh_for_cleanups_flag
= true;
12230 /* Query whether EH is used for cleanups. */
12232 using_eh_for_cleanups_p (void)
12234 return using_eh_for_cleanups_flag
;
12237 /* Wrapper for tree_code_name to ensure that tree code is valid */
12239 get_tree_code_name (enum tree_code code
)
12241 const char *invalid
= "<invalid tree code>";
12243 if (code
>= MAX_TREE_CODES
)
12246 return tree_code_name
[code
];
12249 /* Drops the TREE_OVERFLOW flag from T. */
12252 drop_tree_overflow (tree t
)
12254 gcc_checking_assert (TREE_OVERFLOW (t
));
12256 /* For tree codes with a sharing machinery re-build the result. */
12257 if (TREE_CODE (t
) == INTEGER_CST
)
12258 return wide_int_to_tree (TREE_TYPE (t
), t
);
12260 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12261 and drop the flag. */
12263 TREE_OVERFLOW (t
) = 0;
12267 /* Given a memory reference expression T, return its base address.
12268 The base address of a memory reference expression is the main
12269 object being referenced. For instance, the base address for
12270 'array[i].fld[j]' is 'array'. You can think of this as stripping
12271 away the offset part from a memory address.
12273 This function calls handled_component_p to strip away all the inner
12274 parts of the memory reference until it reaches the base object. */
12277 get_base_address (tree t
)
12279 while (handled_component_p (t
))
12280 t
= TREE_OPERAND (t
, 0);
12282 if ((TREE_CODE (t
) == MEM_REF
12283 || TREE_CODE (t
) == TARGET_MEM_REF
)
12284 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12285 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12287 /* ??? Either the alias oracle or all callers need to properly deal
12288 with WITH_SIZE_EXPRs before we can look through those. */
12289 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12295 #include "gt-tree.h"