1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2013 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"
39 #include "toplev.h" /* get_random_seed */
42 #include "filenames.h"
45 #include "common/common-target.h"
46 #include "langhooks.h"
47 #include "tree-inline.h"
48 #include "tree-iterator.h"
49 #include "basic-block.h"
50 #include "tree-flow.h"
52 #include "pointer-set.h"
53 #include "tree-pass.h"
54 #include "langhooks-def.h"
55 #include "diagnostic.h"
56 #include "tree-diagnostic.h"
57 #include "tree-pretty-print.h"
63 /* Tree code classes. */
65 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
66 #define END_OF_BASE_TREE_CODES tcc_exceptional,
68 const enum tree_code_class tree_code_type
[] = {
69 #include "all-tree.def"
73 #undef END_OF_BASE_TREE_CODES
75 /* Table indexed by tree code giving number of expression
76 operands beyond the fixed part of the node structure.
77 Not used for types or decls. */
79 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
80 #define END_OF_BASE_TREE_CODES 0,
82 const unsigned char tree_code_length
[] = {
83 #include "all-tree.def"
87 #undef END_OF_BASE_TREE_CODES
89 /* Names of tree components.
90 Used for printing out the tree and error messages. */
91 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
92 #define END_OF_BASE_TREE_CODES "@dummy",
94 const char *const tree_code_name
[] = {
95 #include "all-tree.def"
99 #undef END_OF_BASE_TREE_CODES
101 /* Each tree code class has an associated string representation.
102 These must correspond to the tree_code_class entries. */
104 const char *const tree_code_class_strings
[] =
119 /* obstack.[ch] explicitly declined to prototype this. */
120 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
122 /* Statistics-gathering stuff. */
124 static int tree_code_counts
[MAX_TREE_CODES
];
125 int tree_node_counts
[(int) all_kinds
];
126 int tree_node_sizes
[(int) all_kinds
];
128 /* Keep in sync with tree.h:enum tree_node_kind. */
129 static const char * const tree_node_kind_names
[] = {
148 /* Unique id for next decl created. */
149 static GTY(()) int next_decl_uid
;
150 /* Unique id for next type created. */
151 static GTY(()) int next_type_uid
= 1;
152 /* Unique id for next debug decl created. Use negative numbers,
153 to catch erroneous uses. */
154 static GTY(()) int next_debug_decl_uid
;
156 /* Since we cannot rehash a type after it is in the table, we have to
157 keep the hash code. */
159 struct GTY(()) type_hash
{
164 /* Initial size of the hash table (rounded to next prime). */
165 #define TYPE_HASH_INITIAL_SIZE 1000
167 /* Now here is the hash table. When recording a type, it is added to
168 the slot whose index is the hash code. Note that the hash table is
169 used for several kinds of types (function types, array types and
170 array index range types, for now). While all these live in the
171 same table, they are completely independent, and the hash code is
172 computed differently for each of these. */
174 static GTY ((if_marked ("type_hash_marked_p"), param_is (struct type_hash
)))
175 htab_t type_hash_table
;
177 /* Hash table and temporary node for larger integer const values. */
178 static GTY (()) tree int_cst_node
;
179 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
180 htab_t int_cst_hash_table
;
182 /* Hash table for optimization flags and target option flags. Use the same
183 hash table for both sets of options. Nodes for building the current
184 optimization and target option nodes. The assumption is most of the time
185 the options created will already be in the hash table, so we avoid
186 allocating and freeing up a node repeatably. */
187 static GTY (()) tree cl_optimization_node
;
188 static GTY (()) tree cl_target_option_node
;
189 static GTY ((if_marked ("ggc_marked_p"), param_is (union tree_node
)))
190 htab_t cl_option_hash_table
;
192 /* General tree->tree mapping structure for use in hash tables. */
195 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
196 htab_t debug_expr_for_decl
;
198 static GTY ((if_marked ("tree_decl_map_marked_p"), param_is (struct tree_decl_map
)))
199 htab_t value_expr_for_decl
;
201 static GTY ((if_marked ("tree_vec_map_marked_p"), param_is (struct tree_vec_map
)))
202 htab_t debug_args_for_decl
;
204 static GTY ((if_marked ("tree_priority_map_marked_p"),
205 param_is (struct tree_priority_map
)))
206 htab_t init_priority_for_decl
;
208 static void set_type_quals (tree
, int);
209 static int type_hash_eq (const void *, const void *);
210 static hashval_t
type_hash_hash (const void *);
211 static hashval_t
int_cst_hash_hash (const void *);
212 static int int_cst_hash_eq (const void *, const void *);
213 static hashval_t
cl_option_hash_hash (const void *);
214 static int cl_option_hash_eq (const void *, const void *);
215 static void print_type_hash_statistics (void);
216 static void print_debug_expr_statistics (void);
217 static void print_value_expr_statistics (void);
218 static int type_hash_marked_p (const void *);
219 static unsigned int type_hash_list (const_tree
, hashval_t
);
220 static unsigned int attribute_hash_list (const_tree
, hashval_t
);
222 tree global_trees
[TI_MAX
];
223 tree integer_types
[itk_none
];
225 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
227 /* Number of operands for each OpenMP clause. */
228 unsigned const char omp_clause_num_ops
[] =
230 0, /* OMP_CLAUSE_ERROR */
231 1, /* OMP_CLAUSE_PRIVATE */
232 1, /* OMP_CLAUSE_SHARED */
233 1, /* OMP_CLAUSE_FIRSTPRIVATE */
234 2, /* OMP_CLAUSE_LASTPRIVATE */
235 4, /* OMP_CLAUSE_REDUCTION */
236 1, /* OMP_CLAUSE_COPYIN */
237 1, /* OMP_CLAUSE_COPYPRIVATE */
238 1, /* OMP_CLAUSE_IF */
239 1, /* OMP_CLAUSE_NUM_THREADS */
240 1, /* OMP_CLAUSE_SCHEDULE */
241 0, /* OMP_CLAUSE_NOWAIT */
242 0, /* OMP_CLAUSE_ORDERED */
243 0, /* OMP_CLAUSE_DEFAULT */
244 3, /* OMP_CLAUSE_COLLAPSE */
245 0, /* OMP_CLAUSE_UNTIED */
246 1, /* OMP_CLAUSE_FINAL */
247 0 /* OMP_CLAUSE_MERGEABLE */
250 const char * const omp_clause_code_name
[] =
273 /* Return the tree node structure used by tree code CODE. */
275 static inline enum tree_node_structure_enum
276 tree_node_structure_for_code (enum tree_code code
)
278 switch (TREE_CODE_CLASS (code
))
280 case tcc_declaration
:
285 return TS_FIELD_DECL
;
291 return TS_LABEL_DECL
;
293 return TS_RESULT_DECL
;
294 case DEBUG_EXPR_DECL
:
297 return TS_CONST_DECL
;
301 return TS_FUNCTION_DECL
;
302 case TRANSLATION_UNIT_DECL
:
303 return TS_TRANSLATION_UNIT_DECL
;
305 return TS_DECL_NON_COMMON
;
309 return TS_TYPE_NON_COMMON
;
318 default: /* tcc_constant and tcc_exceptional */
323 /* tcc_constant cases. */
324 case INTEGER_CST
: return TS_INT_CST
;
325 case REAL_CST
: return TS_REAL_CST
;
326 case FIXED_CST
: return TS_FIXED_CST
;
327 case COMPLEX_CST
: return TS_COMPLEX
;
328 case VECTOR_CST
: return TS_VECTOR
;
329 case STRING_CST
: return TS_STRING
;
330 /* tcc_exceptional cases. */
331 case ERROR_MARK
: return TS_COMMON
;
332 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
333 case TREE_LIST
: return TS_LIST
;
334 case TREE_VEC
: return TS_VEC
;
335 case SSA_NAME
: return TS_SSA_NAME
;
336 case PLACEHOLDER_EXPR
: return TS_COMMON
;
337 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
338 case BLOCK
: return TS_BLOCK
;
339 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
340 case TREE_BINFO
: return TS_BINFO
;
341 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
342 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
343 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
351 /* Initialize tree_contains_struct to describe the hierarchy of tree
355 initialize_tree_contains_struct (void)
359 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
362 enum tree_node_structure_enum ts_code
;
364 code
= (enum tree_code
) i
;
365 ts_code
= tree_node_structure_for_code (code
);
367 /* Mark the TS structure itself. */
368 tree_contains_struct
[code
][ts_code
] = 1;
370 /* Mark all the structures that TS is derived from. */
388 case TS_STATEMENT_LIST
:
389 MARK_TS_TYPED (code
);
393 case TS_DECL_MINIMAL
:
399 case TS_OPTIMIZATION
:
400 case TS_TARGET_OPTION
:
401 MARK_TS_COMMON (code
);
404 case TS_TYPE_WITH_LANG_SPECIFIC
:
405 MARK_TS_TYPE_COMMON (code
);
408 case TS_TYPE_NON_COMMON
:
409 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
413 MARK_TS_DECL_MINIMAL (code
);
418 MARK_TS_DECL_COMMON (code
);
421 case TS_DECL_NON_COMMON
:
422 MARK_TS_DECL_WITH_VIS (code
);
425 case TS_DECL_WITH_VIS
:
429 MARK_TS_DECL_WRTL (code
);
433 MARK_TS_DECL_COMMON (code
);
437 MARK_TS_DECL_WITH_VIS (code
);
441 case TS_FUNCTION_DECL
:
442 MARK_TS_DECL_NON_COMMON (code
);
445 case TS_TRANSLATION_UNIT_DECL
:
446 MARK_TS_DECL_COMMON (code
);
454 /* Basic consistency checks for attributes used in fold. */
455 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
456 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
457 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
458 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
459 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
460 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
461 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
462 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
463 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
464 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
465 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
466 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
467 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
468 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
469 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
470 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
471 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
472 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
473 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
474 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
475 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
476 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
477 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
478 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
479 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
480 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
481 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
482 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
483 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
484 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
485 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
486 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
487 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
488 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
489 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
490 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
491 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
492 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
501 /* Initialize the hash table of types. */
502 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
505 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
506 tree_decl_map_eq
, 0);
508 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
509 tree_decl_map_eq
, 0);
510 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
511 tree_priority_map_eq
, 0);
513 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
514 int_cst_hash_eq
, NULL
);
516 int_cst_node
= make_node (INTEGER_CST
);
518 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
519 cl_option_hash_eq
, NULL
);
521 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
522 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
524 /* Initialize the tree_contains_struct array. */
525 initialize_tree_contains_struct ();
526 lang_hooks
.init_ts ();
530 /* The name of the object as the assembler will see it (but before any
531 translations made by ASM_OUTPUT_LABELREF). Often this is the same
532 as DECL_NAME. It is an IDENTIFIER_NODE. */
534 decl_assembler_name (tree decl
)
536 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
537 lang_hooks
.set_decl_assembler_name (decl
);
538 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
541 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
544 decl_assembler_name_equal (tree decl
, const_tree asmname
)
546 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
547 const char *decl_str
;
548 const char *asmname_str
;
551 if (decl_asmname
== asmname
)
554 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
555 asmname_str
= IDENTIFIER_POINTER (asmname
);
558 /* If the target assembler name was set by the user, things are trickier.
559 We have a leading '*' to begin with. After that, it's arguable what
560 is the correct thing to do with -fleading-underscore. Arguably, we've
561 historically been doing the wrong thing in assemble_alias by always
562 printing the leading underscore. Since we're not changing that, make
563 sure user_label_prefix follows the '*' before matching. */
564 if (decl_str
[0] == '*')
566 size_t ulp_len
= strlen (user_label_prefix
);
572 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
573 decl_str
+= ulp_len
, test
=true;
577 if (asmname_str
[0] == '*')
579 size_t ulp_len
= strlen (user_label_prefix
);
585 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
586 asmname_str
+= ulp_len
, test
=true;
593 return strcmp (decl_str
, asmname_str
) == 0;
596 /* Hash asmnames ignoring the user specified marks. */
599 decl_assembler_name_hash (const_tree asmname
)
601 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
603 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
604 size_t ulp_len
= strlen (user_label_prefix
);
608 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
611 return htab_hash_string (decl_str
);
614 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
617 /* Compute the number of bytes occupied by a tree with code CODE.
618 This function cannot be used for nodes that have variable sizes,
619 including TREE_VEC, STRING_CST, and CALL_EXPR. */
621 tree_code_size (enum tree_code code
)
623 switch (TREE_CODE_CLASS (code
))
625 case tcc_declaration
: /* A decl node */
630 return sizeof (struct tree_field_decl
);
632 return sizeof (struct tree_parm_decl
);
634 return sizeof (struct tree_var_decl
);
636 return sizeof (struct tree_label_decl
);
638 return sizeof (struct tree_result_decl
);
640 return sizeof (struct tree_const_decl
);
642 return sizeof (struct tree_type_decl
);
644 return sizeof (struct tree_function_decl
);
645 case DEBUG_EXPR_DECL
:
646 return sizeof (struct tree_decl_with_rtl
);
648 return sizeof (struct tree_decl_non_common
);
652 case tcc_type
: /* a type node */
653 return sizeof (struct tree_type_non_common
);
655 case tcc_reference
: /* a reference */
656 case tcc_expression
: /* an expression */
657 case tcc_statement
: /* an expression with side effects */
658 case tcc_comparison
: /* a comparison expression */
659 case tcc_unary
: /* a unary arithmetic expression */
660 case tcc_binary
: /* a binary arithmetic expression */
661 return (sizeof (struct tree_exp
)
662 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
664 case tcc_constant
: /* a constant */
667 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
668 case REAL_CST
: return sizeof (struct tree_real_cst
);
669 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
670 case COMPLEX_CST
: return sizeof (struct tree_complex
);
671 case VECTOR_CST
: return sizeof (struct tree_vector
);
672 case STRING_CST
: gcc_unreachable ();
674 return lang_hooks
.tree_size (code
);
677 case tcc_exceptional
: /* something random, like an identifier. */
680 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
681 case TREE_LIST
: return sizeof (struct tree_list
);
684 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
687 case OMP_CLAUSE
: gcc_unreachable ();
689 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
691 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
692 case BLOCK
: return sizeof (struct tree_block
);
693 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
694 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
695 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
698 return lang_hooks
.tree_size (code
);
706 /* Compute the number of bytes occupied by NODE. This routine only
707 looks at TREE_CODE, except for those nodes that have variable sizes. */
709 tree_size (const_tree node
)
711 const enum tree_code code
= TREE_CODE (node
);
715 return (offsetof (struct tree_binfo
, base_binfos
)
717 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
720 return (sizeof (struct tree_vec
)
721 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
724 return (sizeof (struct tree_vector
)
725 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
728 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
731 return (sizeof (struct tree_omp_clause
)
732 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
736 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
737 return (sizeof (struct tree_exp
)
738 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
740 return tree_code_size (code
);
744 /* Record interesting allocation statistics for a tree node with CODE
748 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
749 size_t length ATTRIBUTE_UNUSED
)
751 enum tree_code_class type
= TREE_CODE_CLASS (code
);
754 if (!GATHER_STATISTICS
)
759 case tcc_declaration
: /* A decl node */
763 case tcc_type
: /* a type node */
767 case tcc_statement
: /* an expression with side effects */
771 case tcc_reference
: /* a reference */
775 case tcc_expression
: /* an expression */
776 case tcc_comparison
: /* a comparison expression */
777 case tcc_unary
: /* a unary arithmetic expression */
778 case tcc_binary
: /* a binary arithmetic expression */
782 case tcc_constant
: /* a constant */
786 case tcc_exceptional
: /* something random, like an identifier. */
789 case IDENTIFIER_NODE
:
802 kind
= ssa_name_kind
;
814 kind
= omp_clause_kind
;
831 tree_code_counts
[(int) code
]++;
832 tree_node_counts
[(int) kind
]++;
833 tree_node_sizes
[(int) kind
] += length
;
836 /* Allocate and return a new UID from the DECL_UID namespace. */
839 allocate_decl_uid (void)
841 return next_decl_uid
++;
844 /* Return a newly allocated node of code CODE. For decl and type
845 nodes, some other fields are initialized. The rest of the node is
846 initialized to zero. This function cannot be used for TREE_VEC or
847 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
849 Achoo! I got a code in the node. */
852 make_node_stat (enum tree_code code MEM_STAT_DECL
)
855 enum tree_code_class type
= TREE_CODE_CLASS (code
);
856 size_t length
= tree_code_size (code
);
858 record_node_allocation_statistics (code
, length
);
860 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
861 TREE_SET_CODE (t
, code
);
866 TREE_SIDE_EFFECTS (t
) = 1;
869 case tcc_declaration
:
870 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
872 if (code
== FUNCTION_DECL
)
874 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
875 DECL_MODE (t
) = FUNCTION_MODE
;
880 DECL_SOURCE_LOCATION (t
) = input_location
;
881 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
882 DECL_UID (t
) = --next_debug_decl_uid
;
885 DECL_UID (t
) = allocate_decl_uid ();
886 SET_DECL_PT_UID (t
, -1);
888 if (TREE_CODE (t
) == LABEL_DECL
)
889 LABEL_DECL_UID (t
) = -1;
894 TYPE_UID (t
) = next_type_uid
++;
895 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
896 TYPE_USER_ALIGN (t
) = 0;
897 TYPE_MAIN_VARIANT (t
) = t
;
898 TYPE_CANONICAL (t
) = t
;
900 /* Default to no attributes for type, but let target change that. */
901 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
902 targetm
.set_default_type_attributes (t
);
904 /* We have not yet computed the alias set for this type. */
905 TYPE_ALIAS_SET (t
) = -1;
909 TREE_CONSTANT (t
) = 1;
918 case PREDECREMENT_EXPR
:
919 case PREINCREMENT_EXPR
:
920 case POSTDECREMENT_EXPR
:
921 case POSTINCREMENT_EXPR
:
922 /* All of these have side-effects, no matter what their
924 TREE_SIDE_EFFECTS (t
) = 1;
933 /* Other classes need no special treatment. */
940 /* Return a new node with the same contents as NODE except that its
941 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
944 copy_node_stat (tree node MEM_STAT_DECL
)
947 enum tree_code code
= TREE_CODE (node
);
950 gcc_assert (code
!= STATEMENT_LIST
);
952 length
= tree_size (node
);
953 record_node_allocation_statistics (code
, length
);
954 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
955 memcpy (t
, node
, length
);
957 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
959 TREE_ASM_WRITTEN (t
) = 0;
960 TREE_VISITED (t
) = 0;
962 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
964 if (code
== DEBUG_EXPR_DECL
)
965 DECL_UID (t
) = --next_debug_decl_uid
;
968 DECL_UID (t
) = allocate_decl_uid ();
969 if (DECL_PT_UID_SET_P (node
))
970 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
972 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
973 && DECL_HAS_VALUE_EXPR_P (node
))
975 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
976 DECL_HAS_VALUE_EXPR_P (t
) = 1;
978 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
979 if (TREE_CODE (node
) == VAR_DECL
)
980 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
981 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
983 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
984 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
986 if (TREE_CODE (node
) == FUNCTION_DECL
)
987 DECL_STRUCT_FUNCTION (t
) = NULL
;
989 else if (TREE_CODE_CLASS (code
) == tcc_type
)
991 TYPE_UID (t
) = next_type_uid
++;
992 /* The following is so that the debug code for
993 the copy is different from the original type.
994 The two statements usually duplicate each other
995 (because they clear fields of the same union),
996 but the optimizer should catch that. */
997 TYPE_SYMTAB_POINTER (t
) = 0;
998 TYPE_SYMTAB_ADDRESS (t
) = 0;
1000 /* Do not copy the values cache. */
1001 if (TYPE_CACHED_VALUES_P(t
))
1003 TYPE_CACHED_VALUES_P (t
) = 0;
1004 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1011 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1012 For example, this can copy a list made of TREE_LIST nodes. */
1015 copy_list (tree list
)
1023 head
= prev
= copy_node (list
);
1024 next
= TREE_CHAIN (list
);
1027 TREE_CHAIN (prev
) = copy_node (next
);
1028 prev
= TREE_CHAIN (prev
);
1029 next
= TREE_CHAIN (next
);
1035 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1038 build_int_cst (tree type
, HOST_WIDE_INT low
)
1040 /* Support legacy code. */
1042 type
= integer_type_node
;
1044 return double_int_to_tree (type
, double_int::from_shwi (low
));
1047 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1050 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1054 return double_int_to_tree (type
, double_int::from_shwi (low
));
1057 /* Constructs tree in type TYPE from with value given by CST. Signedness
1058 of CST is assumed to be the same as the signedness of TYPE. */
1061 double_int_to_tree (tree type
, double_int cst
)
1063 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1065 cst
= cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1067 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1070 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1071 to be the same as the signedness of TYPE. */
1074 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1076 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1079 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1084 /* We force the double_int CST to the range of the type TYPE by sign or
1085 zero extending it. OVERFLOWABLE indicates if we are interested in
1086 overflow of the value, when >0 we are only interested in signed
1087 overflow, for <0 we are interested in any overflow. OVERFLOWED
1088 indicates whether overflow has already occurred. CONST_OVERFLOWED
1089 indicates whether constant overflow has already occurred. We force
1090 T's value to be within range of T's type (by setting to 0 or 1 all
1091 the bits outside the type's range). We set TREE_OVERFLOWED if,
1092 OVERFLOWED is nonzero,
1093 or OVERFLOWABLE is >0 and signed overflow occurs
1094 or OVERFLOWABLE is <0 and any overflow occurs
1095 We return a new tree node for the extended double_int. The node
1096 is shared if no overflow flags are set. */
1100 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1103 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1105 /* If we need to set overflow flags, return a new unshared node. */
1106 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1110 || (overflowable
> 0 && sign_extended_type
))
1112 tree t
= make_node (INTEGER_CST
);
1114 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1115 TREE_TYPE (t
) = type
;
1116 TREE_OVERFLOW (t
) = 1;
1121 /* Else build a shared node. */
1122 return double_int_to_tree (type
, cst
);
1125 /* These are the hash table functions for the hash table of INTEGER_CST
1126 nodes of a sizetype. */
1128 /* Return the hash code code X, an INTEGER_CST. */
1131 int_cst_hash_hash (const void *x
)
1133 const_tree
const t
= (const_tree
) x
;
1135 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1136 ^ htab_hash_pointer (TREE_TYPE (t
)));
1139 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1140 is the same as that given by *Y, which is the same. */
1143 int_cst_hash_eq (const void *x
, const void *y
)
1145 const_tree
const xt
= (const_tree
) x
;
1146 const_tree
const yt
= (const_tree
) y
;
1148 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1149 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1150 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1153 /* Create an INT_CST node of TYPE and value HI:LOW.
1154 The returned node is always shared. For small integers we use a
1155 per-type vector cache, for larger ones we use a single hash table. */
1158 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1166 switch (TREE_CODE (type
))
1169 gcc_assert (hi
== 0 && low
== 0);
1173 case REFERENCE_TYPE
:
1174 /* Cache NULL pointer. */
1183 /* Cache false or true. */
1191 if (TYPE_UNSIGNED (type
))
1194 limit
= INTEGER_SHARE_LIMIT
;
1195 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1201 limit
= INTEGER_SHARE_LIMIT
+ 1;
1202 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1204 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1218 /* Look for it in the type's vector of small shared ints. */
1219 if (!TYPE_CACHED_VALUES_P (type
))
1221 TYPE_CACHED_VALUES_P (type
) = 1;
1222 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1225 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1228 /* Make sure no one is clobbering the shared constant. */
1229 gcc_assert (TREE_TYPE (t
) == type
);
1230 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1231 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1235 /* Create a new shared int. */
1236 t
= make_node (INTEGER_CST
);
1238 TREE_INT_CST_LOW (t
) = low
;
1239 TREE_INT_CST_HIGH (t
) = hi
;
1240 TREE_TYPE (t
) = type
;
1242 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1247 /* Use the cache of larger shared ints. */
1250 TREE_INT_CST_LOW (int_cst_node
) = low
;
1251 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1252 TREE_TYPE (int_cst_node
) = type
;
1254 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1258 /* Insert this one into the hash table. */
1261 /* Make a new node for next time round. */
1262 int_cst_node
= make_node (INTEGER_CST
);
1269 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1270 and the rest are zeros. */
1273 build_low_bits_mask (tree type
, unsigned bits
)
1277 gcc_assert (bits
<= TYPE_PRECISION (type
));
1279 if (bits
== TYPE_PRECISION (type
)
1280 && !TYPE_UNSIGNED (type
))
1281 /* Sign extended all-ones mask. */
1282 mask
= double_int_minus_one
;
1284 mask
= double_int::mask (bits
);
1286 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1289 /* Checks that X is integer constant that can be expressed in (unsigned)
1290 HOST_WIDE_INT without loss of precision. */
1293 cst_and_fits_in_hwi (const_tree x
)
1295 if (TREE_CODE (x
) != INTEGER_CST
)
1298 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1301 return (TREE_INT_CST_HIGH (x
) == 0
1302 || TREE_INT_CST_HIGH (x
) == -1);
1305 /* Build a newly constructed TREE_VEC node of length LEN. */
1308 make_vector_stat (unsigned len MEM_STAT_DECL
)
1311 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1313 record_node_allocation_statistics (VECTOR_CST
, length
);
1315 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1317 TREE_SET_CODE (t
, VECTOR_CST
);
1318 TREE_CONSTANT (t
) = 1;
1323 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1324 are in a list pointed to by VALS. */
1327 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1331 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1332 TREE_TYPE (v
) = type
;
1334 /* Iterate through elements and check for overflow. */
1335 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1337 tree value
= vals
[cnt
];
1339 VECTOR_CST_ELT (v
, cnt
) = value
;
1341 /* Don't crash if we get an address constant. */
1342 if (!CONSTANT_CLASS_P (value
))
1345 over
|= TREE_OVERFLOW (value
);
1348 TREE_OVERFLOW (v
) = over
;
1352 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1353 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1356 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1358 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1359 unsigned HOST_WIDE_INT idx
;
1362 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1364 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1365 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1367 return build_vector (type
, vec
);
1370 /* Build a vector of type VECTYPE where all the elements are SCs. */
1372 build_vector_from_val (tree vectype
, tree sc
)
1374 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1376 if (sc
== error_mark_node
)
1379 /* Verify that the vector type is suitable for SC. Note that there
1380 is some inconsistency in the type-system with respect to restrict
1381 qualifications of pointers. Vector types always have a main-variant
1382 element type and the qualification is applied to the vector-type.
1383 So TREE_TYPE (vector-type) does not return a properly qualified
1384 vector element-type. */
1385 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1386 TREE_TYPE (vectype
)));
1388 if (CONSTANT_CLASS_P (sc
))
1390 tree
*v
= XALLOCAVEC (tree
, nunits
);
1391 for (i
= 0; i
< nunits
; ++i
)
1393 return build_vector (vectype
, v
);
1397 vec
<constructor_elt
, va_gc
> *v
;
1398 vec_alloc (v
, nunits
);
1399 for (i
= 0; i
< nunits
; ++i
)
1400 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1401 return build_constructor (vectype
, v
);
1405 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1406 are in the vec pointed to by VALS. */
1408 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1410 tree c
= make_node (CONSTRUCTOR
);
1412 constructor_elt
*elt
;
1413 bool constant_p
= true;
1414 bool side_effects_p
= false;
1416 TREE_TYPE (c
) = type
;
1417 CONSTRUCTOR_ELTS (c
) = vals
;
1419 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1421 /* Mostly ctors will have elts that don't have side-effects, so
1422 the usual case is to scan all the elements. Hence a single
1423 loop for both const and side effects, rather than one loop
1424 each (with early outs). */
1425 if (!TREE_CONSTANT (elt
->value
))
1427 if (TREE_SIDE_EFFECTS (elt
->value
))
1428 side_effects_p
= true;
1431 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1432 TREE_CONSTANT (c
) = constant_p
;
1437 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1440 build_constructor_single (tree type
, tree index
, tree value
)
1442 vec
<constructor_elt
, va_gc
> *v
;
1443 constructor_elt elt
= {index
, value
};
1446 v
->quick_push (elt
);
1448 return build_constructor (type
, v
);
1452 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1453 are in a list pointed to by VALS. */
1455 build_constructor_from_list (tree type
, tree vals
)
1458 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1462 vec_alloc (v
, list_length (vals
));
1463 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1464 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1467 return build_constructor (type
, v
);
1470 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1473 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1476 FIXED_VALUE_TYPE
*fp
;
1478 v
= make_node (FIXED_CST
);
1479 fp
= ggc_alloc_fixed_value ();
1480 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1482 TREE_TYPE (v
) = type
;
1483 TREE_FIXED_CST_PTR (v
) = fp
;
1487 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1490 build_real (tree type
, REAL_VALUE_TYPE d
)
1493 REAL_VALUE_TYPE
*dp
;
1496 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1497 Consider doing it via real_convert now. */
1499 v
= make_node (REAL_CST
);
1500 dp
= ggc_alloc_real_value ();
1501 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1503 TREE_TYPE (v
) = type
;
1504 TREE_REAL_CST_PTR (v
) = dp
;
1505 TREE_OVERFLOW (v
) = overflow
;
1509 /* Return a new REAL_CST node whose type is TYPE
1510 and whose value is the integer value of the INTEGER_CST node I. */
1513 real_value_from_int_cst (const_tree type
, const_tree i
)
1517 /* Clear all bits of the real value type so that we can later do
1518 bitwise comparisons to see if two values are the same. */
1519 memset (&d
, 0, sizeof d
);
1521 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1522 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1523 TYPE_UNSIGNED (TREE_TYPE (i
)));
1527 /* Given a tree representing an integer constant I, return a tree
1528 representing the same value as a floating-point constant of type TYPE. */
1531 build_real_from_int_cst (tree type
, const_tree i
)
1534 int overflow
= TREE_OVERFLOW (i
);
1536 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1538 TREE_OVERFLOW (v
) |= overflow
;
1542 /* Return a newly constructed STRING_CST node whose value is
1543 the LEN characters at STR.
1544 Note that for a C string literal, LEN should include the trailing NUL.
1545 The TREE_TYPE is not initialized. */
1548 build_string (int len
, const char *str
)
1553 /* Do not waste bytes provided by padding of struct tree_string. */
1554 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1556 record_node_allocation_statistics (STRING_CST
, length
);
1558 s
= ggc_alloc_tree_node (length
);
1560 memset (s
, 0, sizeof (struct tree_typed
));
1561 TREE_SET_CODE (s
, STRING_CST
);
1562 TREE_CONSTANT (s
) = 1;
1563 TREE_STRING_LENGTH (s
) = len
;
1564 memcpy (s
->string
.str
, str
, len
);
1565 s
->string
.str
[len
] = '\0';
1570 /* Return a newly constructed COMPLEX_CST node whose value is
1571 specified by the real and imaginary parts REAL and IMAG.
1572 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1573 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1576 build_complex (tree type
, tree real
, tree imag
)
1578 tree t
= make_node (COMPLEX_CST
);
1580 TREE_REALPART (t
) = real
;
1581 TREE_IMAGPART (t
) = imag
;
1582 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1583 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1587 /* Return a constant of arithmetic type TYPE which is the
1588 multiplicative identity of the set TYPE. */
1591 build_one_cst (tree type
)
1593 switch (TREE_CODE (type
))
1595 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1596 case POINTER_TYPE
: case REFERENCE_TYPE
:
1598 return build_int_cst (type
, 1);
1601 return build_real (type
, dconst1
);
1603 case FIXED_POINT_TYPE
:
1604 /* We can only generate 1 for accum types. */
1605 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1606 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1610 tree scalar
= build_one_cst (TREE_TYPE (type
));
1612 return build_vector_from_val (type
, scalar
);
1616 return build_complex (type
,
1617 build_one_cst (TREE_TYPE (type
)),
1618 build_zero_cst (TREE_TYPE (type
)));
1625 /* Build 0 constant of type TYPE. This is used by constructor folding
1626 and thus the constant should be represented in memory by
1630 build_zero_cst (tree type
)
1632 switch (TREE_CODE (type
))
1634 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1635 case POINTER_TYPE
: case REFERENCE_TYPE
:
1636 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1637 return build_int_cst (type
, 0);
1640 return build_real (type
, dconst0
);
1642 case FIXED_POINT_TYPE
:
1643 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1647 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1649 return build_vector_from_val (type
, scalar
);
1654 tree zero
= build_zero_cst (TREE_TYPE (type
));
1656 return build_complex (type
, zero
, zero
);
1660 if (!AGGREGATE_TYPE_P (type
))
1661 return fold_convert (type
, integer_zero_node
);
1662 return build_constructor (type
, NULL
);
1667 /* Build a BINFO with LEN language slots. */
1670 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1673 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1674 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1676 record_node_allocation_statistics (TREE_BINFO
, length
);
1678 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1680 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1682 TREE_SET_CODE (t
, TREE_BINFO
);
1684 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1689 /* Create a CASE_LABEL_EXPR tree node and return it. */
1692 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1694 tree t
= make_node (CASE_LABEL_EXPR
);
1696 TREE_TYPE (t
) = void_type_node
;
1697 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1699 CASE_LOW (t
) = low_value
;
1700 CASE_HIGH (t
) = high_value
;
1701 CASE_LABEL (t
) = label_decl
;
1702 CASE_CHAIN (t
) = NULL_TREE
;
1707 /* Build a newly constructed TREE_VEC node of length LEN. */
1710 make_tree_vec_stat (int len MEM_STAT_DECL
)
1713 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1715 record_node_allocation_statistics (TREE_VEC
, length
);
1717 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1719 TREE_SET_CODE (t
, TREE_VEC
);
1720 TREE_VEC_LENGTH (t
) = len
;
1725 /* Return 1 if EXPR is the integer constant zero or a complex constant
1729 integer_zerop (const_tree expr
)
1733 switch (TREE_CODE (expr
))
1736 return (TREE_INT_CST_LOW (expr
) == 0
1737 && TREE_INT_CST_HIGH (expr
) == 0);
1739 return (integer_zerop (TREE_REALPART (expr
))
1740 && integer_zerop (TREE_IMAGPART (expr
)));
1744 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1745 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1754 /* Return 1 if EXPR is the integer constant one or the corresponding
1755 complex constant. */
1758 integer_onep (const_tree expr
)
1762 switch (TREE_CODE (expr
))
1765 return (TREE_INT_CST_LOW (expr
) == 1
1766 && TREE_INT_CST_HIGH (expr
) == 0);
1768 return (integer_onep (TREE_REALPART (expr
))
1769 && integer_zerop (TREE_IMAGPART (expr
)));
1773 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1774 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1783 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1784 it contains, or a complex or vector whose subparts are such integers. */
1787 integer_all_onesp (const_tree expr
)
1794 if (TREE_CODE (expr
) == COMPLEX_CST
1795 && integer_all_onesp (TREE_REALPART (expr
))
1796 && integer_all_onesp (TREE_IMAGPART (expr
)))
1799 else if (TREE_CODE (expr
) == VECTOR_CST
)
1802 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1803 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1808 else if (TREE_CODE (expr
) != INTEGER_CST
)
1811 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1812 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1813 && TREE_INT_CST_HIGH (expr
) == -1)
1818 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1819 if (prec
>= HOST_BITS_PER_WIDE_INT
)
1821 HOST_WIDE_INT high_value
;
1824 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
1826 /* Can not handle precisions greater than twice the host int size. */
1827 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
1828 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
1829 /* Shifting by the host word size is undefined according to the ANSI
1830 standard, so we must handle this as a special case. */
1833 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
1835 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1836 && TREE_INT_CST_HIGH (expr
) == high_value
);
1839 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
1842 /* Return 1 if EXPR is the integer constant minus one. */
1845 integer_minus_onep (const_tree expr
)
1849 if (TREE_CODE (expr
) == COMPLEX_CST
)
1850 return (integer_all_onesp (TREE_REALPART (expr
))
1851 && integer_zerop (TREE_IMAGPART (expr
)));
1853 return integer_all_onesp (expr
);
1856 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
1860 integer_pow2p (const_tree expr
)
1863 unsigned HOST_WIDE_INT high
, low
;
1867 if (TREE_CODE (expr
) == COMPLEX_CST
1868 && integer_pow2p (TREE_REALPART (expr
))
1869 && integer_zerop (TREE_IMAGPART (expr
)))
1872 if (TREE_CODE (expr
) != INTEGER_CST
)
1875 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1876 high
= TREE_INT_CST_HIGH (expr
);
1877 low
= TREE_INT_CST_LOW (expr
);
1879 /* First clear all bits that are beyond the type's precision in case
1880 we've been sign extended. */
1882 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1884 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1885 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1889 if (prec
< HOST_BITS_PER_WIDE_INT
)
1890 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1893 if (high
== 0 && low
== 0)
1896 return ((high
== 0 && (low
& (low
- 1)) == 0)
1897 || (low
== 0 && (high
& (high
- 1)) == 0));
1900 /* Return 1 if EXPR is an integer constant other than zero or a
1901 complex constant other than zero. */
1904 integer_nonzerop (const_tree expr
)
1908 return ((TREE_CODE (expr
) == INTEGER_CST
1909 && (TREE_INT_CST_LOW (expr
) != 0
1910 || TREE_INT_CST_HIGH (expr
) != 0))
1911 || (TREE_CODE (expr
) == COMPLEX_CST
1912 && (integer_nonzerop (TREE_REALPART (expr
))
1913 || integer_nonzerop (TREE_IMAGPART (expr
)))));
1916 /* Return 1 if EXPR is the fixed-point constant zero. */
1919 fixed_zerop (const_tree expr
)
1921 return (TREE_CODE (expr
) == FIXED_CST
1922 && TREE_FIXED_CST (expr
).data
.is_zero ());
1925 /* Return the power of two represented by a tree node known to be a
1929 tree_log2 (const_tree expr
)
1932 HOST_WIDE_INT high
, low
;
1936 if (TREE_CODE (expr
) == COMPLEX_CST
)
1937 return tree_log2 (TREE_REALPART (expr
));
1939 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1940 high
= TREE_INT_CST_HIGH (expr
);
1941 low
= TREE_INT_CST_LOW (expr
);
1943 /* First clear all bits that are beyond the type's precision in case
1944 we've been sign extended. */
1946 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
1948 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1949 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1953 if (prec
< HOST_BITS_PER_WIDE_INT
)
1954 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1957 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
1958 : exact_log2 (low
));
1961 /* Similar, but return the largest integer Y such that 2 ** Y is less
1962 than or equal to EXPR. */
1965 tree_floor_log2 (const_tree expr
)
1968 HOST_WIDE_INT high
, low
;
1972 if (TREE_CODE (expr
) == COMPLEX_CST
)
1973 return tree_log2 (TREE_REALPART (expr
));
1975 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1976 high
= TREE_INT_CST_HIGH (expr
);
1977 low
= TREE_INT_CST_LOW (expr
);
1979 /* First clear all bits that are beyond the type's precision in case
1980 we've been sign extended. Ignore if type's precision hasn't been set
1981 since what we are doing is setting it. */
1983 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
1985 else if (prec
> HOST_BITS_PER_WIDE_INT
)
1986 high
&= ~((HOST_WIDE_INT
) (-1) << (prec
- HOST_BITS_PER_WIDE_INT
));
1990 if (prec
< HOST_BITS_PER_WIDE_INT
)
1991 low
&= ~((HOST_WIDE_INT
) (-1) << prec
);
1994 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
1995 : floor_log2 (low
));
1998 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
1999 decimal float constants, so don't return 1 for them. */
2002 real_zerop (const_tree expr
)
2006 switch (TREE_CODE (expr
))
2009 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2010 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2012 return real_zerop (TREE_REALPART (expr
))
2013 && real_zerop (TREE_IMAGPART (expr
));
2017 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2018 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2027 /* Return 1 if EXPR is the real constant one in real or complex form.
2028 Trailing zeroes matter for decimal float constants, so don't return
2032 real_onep (const_tree expr
)
2036 switch (TREE_CODE (expr
))
2039 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2040 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2042 return real_onep (TREE_REALPART (expr
))
2043 && real_zerop (TREE_IMAGPART (expr
));
2047 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2048 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2057 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2058 for decimal float constants, so don't return 1 for them. */
2061 real_twop (const_tree expr
)
2065 switch (TREE_CODE (expr
))
2068 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2069 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2071 return real_twop (TREE_REALPART (expr
))
2072 && real_zerop (TREE_IMAGPART (expr
));
2076 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2077 if (!real_twop (VECTOR_CST_ELT (expr
, i
)))
2086 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2087 matter for decimal float constants, so don't return 1 for them. */
2090 real_minus_onep (const_tree expr
)
2094 switch (TREE_CODE (expr
))
2097 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2098 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2100 return real_minus_onep (TREE_REALPART (expr
))
2101 && real_zerop (TREE_IMAGPART (expr
));
2105 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2106 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2115 /* Nonzero if EXP is a constant or a cast of a constant. */
2118 really_constant_p (const_tree exp
)
2120 /* This is not quite the same as STRIP_NOPS. It does more. */
2121 while (CONVERT_EXPR_P (exp
)
2122 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2123 exp
= TREE_OPERAND (exp
, 0);
2124 return TREE_CONSTANT (exp
);
2127 /* Return first list element whose TREE_VALUE is ELEM.
2128 Return 0 if ELEM is not in LIST. */
2131 value_member (tree elem
, tree list
)
2135 if (elem
== TREE_VALUE (list
))
2137 list
= TREE_CHAIN (list
);
2142 /* Return first list element whose TREE_PURPOSE is ELEM.
2143 Return 0 if ELEM is not in LIST. */
2146 purpose_member (const_tree elem
, tree list
)
2150 if (elem
== TREE_PURPOSE (list
))
2152 list
= TREE_CHAIN (list
);
2157 /* Return true if ELEM is in V. */
2160 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2164 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2170 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2174 chain_index (int idx
, tree chain
)
2176 for (; chain
&& idx
> 0; --idx
)
2177 chain
= TREE_CHAIN (chain
);
2181 /* Return nonzero if ELEM is part of the chain CHAIN. */
2184 chain_member (const_tree elem
, const_tree chain
)
2190 chain
= DECL_CHAIN (chain
);
2196 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2197 We expect a null pointer to mark the end of the chain.
2198 This is the Lisp primitive `length'. */
2201 list_length (const_tree t
)
2204 #ifdef ENABLE_TREE_CHECKING
2212 #ifdef ENABLE_TREE_CHECKING
2215 gcc_assert (p
!= q
);
2223 /* Returns the number of FIELD_DECLs in TYPE. */
2226 fields_length (const_tree type
)
2228 tree t
= TYPE_FIELDS (type
);
2231 for (; t
; t
= DECL_CHAIN (t
))
2232 if (TREE_CODE (t
) == FIELD_DECL
)
2238 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2239 UNION_TYPE TYPE, or NULL_TREE if none. */
2242 first_field (const_tree type
)
2244 tree t
= TYPE_FIELDS (type
);
2245 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2250 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2251 by modifying the last node in chain 1 to point to chain 2.
2252 This is the Lisp primitive `nconc'. */
2255 chainon (tree op1
, tree op2
)
2264 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2266 TREE_CHAIN (t1
) = op2
;
2268 #ifdef ENABLE_TREE_CHECKING
2271 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2272 gcc_assert (t2
!= t1
);
2279 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2282 tree_last (tree chain
)
2286 while ((next
= TREE_CHAIN (chain
)))
2291 /* Reverse the order of elements in the chain T,
2292 and return the new head of the chain (old last element). */
2297 tree prev
= 0, decl
, next
;
2298 for (decl
= t
; decl
; decl
= next
)
2300 /* We shouldn't be using this function to reverse BLOCK chains; we
2301 have blocks_nreverse for that. */
2302 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2303 next
= TREE_CHAIN (decl
);
2304 TREE_CHAIN (decl
) = prev
;
2310 /* Return a newly created TREE_LIST node whose
2311 purpose and value fields are PARM and VALUE. */
2314 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2316 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2317 TREE_PURPOSE (t
) = parm
;
2318 TREE_VALUE (t
) = value
;
2322 /* Build a chain of TREE_LIST nodes from a vector. */
2325 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2327 tree ret
= NULL_TREE
;
2331 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2333 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2334 pp
= &TREE_CHAIN (*pp
);
2339 /* Return a newly created TREE_LIST node whose
2340 purpose and value fields are PURPOSE and VALUE
2341 and whose TREE_CHAIN is CHAIN. */
2344 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2348 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2349 memset (node
, 0, sizeof (struct tree_common
));
2351 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2353 TREE_SET_CODE (node
, TREE_LIST
);
2354 TREE_CHAIN (node
) = chain
;
2355 TREE_PURPOSE (node
) = purpose
;
2356 TREE_VALUE (node
) = value
;
2360 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2364 ctor_to_vec (tree ctor
)
2366 vec
<tree
, va_gc
> *vec
;
2367 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2371 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2372 vec
->quick_push (val
);
2377 /* Return the size nominally occupied by an object of type TYPE
2378 when it resides in memory. The value is measured in units of bytes,
2379 and its data type is that normally used for type sizes
2380 (which is the first type created by make_signed_type or
2381 make_unsigned_type). */
2384 size_in_bytes (const_tree type
)
2388 if (type
== error_mark_node
)
2389 return integer_zero_node
;
2391 type
= TYPE_MAIN_VARIANT (type
);
2392 t
= TYPE_SIZE_UNIT (type
);
2396 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2397 return size_zero_node
;
2403 /* Return the size of TYPE (in bytes) as a wide integer
2404 or return -1 if the size can vary or is larger than an integer. */
2407 int_size_in_bytes (const_tree type
)
2411 if (type
== error_mark_node
)
2414 type
= TYPE_MAIN_VARIANT (type
);
2415 t
= TYPE_SIZE_UNIT (type
);
2417 || TREE_CODE (t
) != INTEGER_CST
2418 || TREE_INT_CST_HIGH (t
) != 0
2419 /* If the result would appear negative, it's too big to represent. */
2420 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2423 return TREE_INT_CST_LOW (t
);
2426 /* Return the maximum size of TYPE (in bytes) as a wide integer
2427 or return -1 if the size can vary or is larger than an integer. */
2430 max_int_size_in_bytes (const_tree type
)
2432 HOST_WIDE_INT size
= -1;
2435 /* If this is an array type, check for a possible MAX_SIZE attached. */
2437 if (TREE_CODE (type
) == ARRAY_TYPE
)
2439 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2441 if (size_tree
&& host_integerp (size_tree
, 1))
2442 size
= tree_low_cst (size_tree
, 1);
2445 /* If we still haven't been able to get a size, see if the language
2446 can compute a maximum size. */
2450 size_tree
= lang_hooks
.types
.max_size (type
);
2452 if (size_tree
&& host_integerp (size_tree
, 1))
2453 size
= tree_low_cst (size_tree
, 1);
2459 /* Returns a tree for the size of EXP in bytes. */
2462 tree_expr_size (const_tree exp
)
2465 && DECL_SIZE_UNIT (exp
) != 0)
2466 return DECL_SIZE_UNIT (exp
);
2468 return size_in_bytes (TREE_TYPE (exp
));
2471 /* Return the bit position of FIELD, in bits from the start of the record.
2472 This is a tree of type bitsizetype. */
2475 bit_position (const_tree field
)
2477 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2478 DECL_FIELD_BIT_OFFSET (field
));
2481 /* Likewise, but return as an integer. It must be representable in
2482 that way (since it could be a signed value, we don't have the
2483 option of returning -1 like int_size_in_byte can. */
2486 int_bit_position (const_tree field
)
2488 return tree_low_cst (bit_position (field
), 0);
2491 /* Return the byte position of FIELD, in bytes from the start of the record.
2492 This is a tree of type sizetype. */
2495 byte_position (const_tree field
)
2497 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2498 DECL_FIELD_BIT_OFFSET (field
));
2501 /* Likewise, but return as an integer. It must be representable in
2502 that way (since it could be a signed value, we don't have the
2503 option of returning -1 like int_size_in_byte can. */
2506 int_byte_position (const_tree field
)
2508 return tree_low_cst (byte_position (field
), 0);
2511 /* Return the strictest alignment, in bits, that T is known to have. */
2514 expr_align (const_tree t
)
2516 unsigned int align0
, align1
;
2518 switch (TREE_CODE (t
))
2520 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2521 /* If we have conversions, we know that the alignment of the
2522 object must meet each of the alignments of the types. */
2523 align0
= expr_align (TREE_OPERAND (t
, 0));
2524 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2525 return MAX (align0
, align1
);
2527 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2528 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2529 case CLEANUP_POINT_EXPR
:
2530 /* These don't change the alignment of an object. */
2531 return expr_align (TREE_OPERAND (t
, 0));
2534 /* The best we can do is say that the alignment is the least aligned
2536 align0
= expr_align (TREE_OPERAND (t
, 1));
2537 align1
= expr_align (TREE_OPERAND (t
, 2));
2538 return MIN (align0
, align1
);
2540 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2541 meaningfully, it's always 1. */
2542 case LABEL_DECL
: case CONST_DECL
:
2543 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2545 gcc_assert (DECL_ALIGN (t
) != 0);
2546 return DECL_ALIGN (t
);
2552 /* Otherwise take the alignment from that of the type. */
2553 return TYPE_ALIGN (TREE_TYPE (t
));
2556 /* Return, as a tree node, the number of elements for TYPE (which is an
2557 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2560 array_type_nelts (const_tree type
)
2562 tree index_type
, min
, max
;
2564 /* If they did it with unspecified bounds, then we should have already
2565 given an error about it before we got here. */
2566 if (! TYPE_DOMAIN (type
))
2567 return error_mark_node
;
2569 index_type
= TYPE_DOMAIN (type
);
2570 min
= TYPE_MIN_VALUE (index_type
);
2571 max
= TYPE_MAX_VALUE (index_type
);
2573 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2575 return error_mark_node
;
2577 return (integer_zerop (min
)
2579 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2582 /* If arg is static -- a reference to an object in static storage -- then
2583 return the object. This is not the same as the C meaning of `static'.
2584 If arg isn't static, return NULL. */
2589 switch (TREE_CODE (arg
))
2592 /* Nested functions are static, even though taking their address will
2593 involve a trampoline as we unnest the nested function and create
2594 the trampoline on the tree level. */
2598 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2599 && ! DECL_THREAD_LOCAL_P (arg
)
2600 && ! DECL_DLLIMPORT_P (arg
)
2604 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2608 return TREE_STATIC (arg
) ? arg
: NULL
;
2615 /* If the thing being referenced is not a field, then it is
2616 something language specific. */
2617 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2619 /* If we are referencing a bitfield, we can't evaluate an
2620 ADDR_EXPR at compile time and so it isn't a constant. */
2621 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2624 return staticp (TREE_OPERAND (arg
, 0));
2630 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2633 case ARRAY_RANGE_REF
:
2634 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2635 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2636 return staticp (TREE_OPERAND (arg
, 0));
2640 case COMPOUND_LITERAL_EXPR
:
2641 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2651 /* Return whether OP is a DECL whose address is function-invariant. */
2654 decl_address_invariant_p (const_tree op
)
2656 /* The conditions below are slightly less strict than the one in
2659 switch (TREE_CODE (op
))
2668 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2669 || DECL_THREAD_LOCAL_P (op
)
2670 || DECL_CONTEXT (op
) == current_function_decl
2671 || decl_function_context (op
) == current_function_decl
)
2676 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2677 || decl_function_context (op
) == current_function_decl
)
2688 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2691 decl_address_ip_invariant_p (const_tree op
)
2693 /* The conditions below are slightly less strict than the one in
2696 switch (TREE_CODE (op
))
2704 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2705 && !DECL_DLLIMPORT_P (op
))
2706 || DECL_THREAD_LOCAL_P (op
))
2711 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2723 /* Return true if T is function-invariant (internal function, does
2724 not handle arithmetic; that's handled in skip_simple_arithmetic and
2725 tree_invariant_p). */
2727 static bool tree_invariant_p (tree t
);
2730 tree_invariant_p_1 (tree t
)
2734 if (TREE_CONSTANT (t
)
2735 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2738 switch (TREE_CODE (t
))
2744 op
= TREE_OPERAND (t
, 0);
2745 while (handled_component_p (op
))
2747 switch (TREE_CODE (op
))
2750 case ARRAY_RANGE_REF
:
2751 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2752 || TREE_OPERAND (op
, 2) != NULL_TREE
2753 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2758 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2764 op
= TREE_OPERAND (op
, 0);
2767 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2776 /* Return true if T is function-invariant. */
2779 tree_invariant_p (tree t
)
2781 tree inner
= skip_simple_arithmetic (t
);
2782 return tree_invariant_p_1 (inner
);
2785 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2786 Do this to any expression which may be used in more than one place,
2787 but must be evaluated only once.
2789 Normally, expand_expr would reevaluate the expression each time.
2790 Calling save_expr produces something that is evaluated and recorded
2791 the first time expand_expr is called on it. Subsequent calls to
2792 expand_expr just reuse the recorded value.
2794 The call to expand_expr that generates code that actually computes
2795 the value is the first call *at compile time*. Subsequent calls
2796 *at compile time* generate code to use the saved value.
2797 This produces correct result provided that *at run time* control
2798 always flows through the insns made by the first expand_expr
2799 before reaching the other places where the save_expr was evaluated.
2800 You, the caller of save_expr, must make sure this is so.
2802 Constants, and certain read-only nodes, are returned with no
2803 SAVE_EXPR because that is safe. Expressions containing placeholders
2804 are not touched; see tree.def for an explanation of what these
2808 save_expr (tree expr
)
2810 tree t
= fold (expr
);
2813 /* If the tree evaluates to a constant, then we don't want to hide that
2814 fact (i.e. this allows further folding, and direct checks for constants).
2815 However, a read-only object that has side effects cannot be bypassed.
2816 Since it is no problem to reevaluate literals, we just return the
2818 inner
= skip_simple_arithmetic (t
);
2819 if (TREE_CODE (inner
) == ERROR_MARK
)
2822 if (tree_invariant_p_1 (inner
))
2825 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
2826 it means that the size or offset of some field of an object depends on
2827 the value within another field.
2829 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
2830 and some variable since it would then need to be both evaluated once and
2831 evaluated more than once. Front-ends must assure this case cannot
2832 happen by surrounding any such subexpressions in their own SAVE_EXPR
2833 and forcing evaluation at the proper time. */
2834 if (contains_placeholder_p (inner
))
2837 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
2838 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
2840 /* This expression might be placed ahead of a jump to ensure that the
2841 value was computed on both sides of the jump. So make sure it isn't
2842 eliminated as dead. */
2843 TREE_SIDE_EFFECTS (t
) = 1;
2847 /* Look inside EXPR into any simple arithmetic operations. Return the
2848 outermost non-arithmetic or non-invariant node. */
2851 skip_simple_arithmetic (tree expr
)
2853 /* We don't care about whether this can be used as an lvalue in this
2855 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2856 expr
= TREE_OPERAND (expr
, 0);
2858 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
2859 a constant, it will be more efficient to not make another SAVE_EXPR since
2860 it will allow better simplification and GCSE will be able to merge the
2861 computations if they actually occur. */
2864 if (UNARY_CLASS_P (expr
))
2865 expr
= TREE_OPERAND (expr
, 0);
2866 else if (BINARY_CLASS_P (expr
))
2868 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
2869 expr
= TREE_OPERAND (expr
, 0);
2870 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
2871 expr
= TREE_OPERAND (expr
, 1);
2882 /* Look inside EXPR into simple arithmetic operations involving constants.
2883 Return the outermost non-arithmetic or non-constant node. */
2886 skip_simple_constant_arithmetic (tree expr
)
2888 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
2889 expr
= TREE_OPERAND (expr
, 0);
2893 if (UNARY_CLASS_P (expr
))
2894 expr
= TREE_OPERAND (expr
, 0);
2895 else if (BINARY_CLASS_P (expr
))
2897 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
2898 expr
= TREE_OPERAND (expr
, 0);
2899 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
2900 expr
= TREE_OPERAND (expr
, 1);
2911 /* Return which tree structure is used by T. */
2913 enum tree_node_structure_enum
2914 tree_node_structure (const_tree t
)
2916 const enum tree_code code
= TREE_CODE (t
);
2917 return tree_node_structure_for_code (code
);
2920 /* Set various status flags when building a CALL_EXPR object T. */
2923 process_call_operands (tree t
)
2925 bool side_effects
= TREE_SIDE_EFFECTS (t
);
2926 bool read_only
= false;
2927 int i
= call_expr_flags (t
);
2929 /* Calls have side-effects, except those to const or pure functions. */
2930 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
2931 side_effects
= true;
2932 /* Propagate TREE_READONLY of arguments for const functions. */
2936 if (!side_effects
|| read_only
)
2937 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
2939 tree op
= TREE_OPERAND (t
, i
);
2940 if (op
&& TREE_SIDE_EFFECTS (op
))
2941 side_effects
= true;
2942 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
2946 TREE_SIDE_EFFECTS (t
) = side_effects
;
2947 TREE_READONLY (t
) = read_only
;
2950 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
2951 size or offset that depends on a field within a record. */
2954 contains_placeholder_p (const_tree exp
)
2956 enum tree_code code
;
2961 code
= TREE_CODE (exp
);
2962 if (code
== PLACEHOLDER_EXPR
)
2965 switch (TREE_CODE_CLASS (code
))
2968 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
2969 position computations since they will be converted into a
2970 WITH_RECORD_EXPR involving the reference, which will assume
2971 here will be valid. */
2972 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
2974 case tcc_exceptional
:
2975 if (code
== TREE_LIST
)
2976 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
2977 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
2982 case tcc_comparison
:
2983 case tcc_expression
:
2987 /* Ignoring the first operand isn't quite right, but works best. */
2988 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
2991 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
2992 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
2993 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
2996 /* The save_expr function never wraps anything containing
2997 a PLACEHOLDER_EXPR. */
3004 switch (TREE_CODE_LENGTH (code
))
3007 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3009 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3010 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3021 const_call_expr_arg_iterator iter
;
3022 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3023 if (CONTAINS_PLACEHOLDER_P (arg
))
3037 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3038 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3042 type_contains_placeholder_1 (const_tree type
)
3044 /* If the size contains a placeholder or the parent type (component type in
3045 the case of arrays) type involves a placeholder, this type does. */
3046 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3047 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3048 || (!POINTER_TYPE_P (type
)
3050 && type_contains_placeholder_p (TREE_TYPE (type
))))
3053 /* Now do type-specific checks. Note that the last part of the check above
3054 greatly limits what we have to do below. */
3055 switch (TREE_CODE (type
))
3063 case REFERENCE_TYPE
:
3072 case FIXED_POINT_TYPE
:
3073 /* Here we just check the bounds. */
3074 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3075 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3078 /* We have already checked the component type above, so just check the
3080 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3084 case QUAL_UNION_TYPE
:
3088 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3089 if (TREE_CODE (field
) == FIELD_DECL
3090 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3091 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3092 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3093 || type_contains_placeholder_p (TREE_TYPE (field
))))
3104 /* Wrapper around above function used to cache its result. */
3107 type_contains_placeholder_p (tree type
)
3111 /* If the contains_placeholder_bits field has been initialized,
3112 then we know the answer. */
3113 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3114 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3116 /* Indicate that we've seen this type node, and the answer is false.
3117 This is what we want to return if we run into recursion via fields. */
3118 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3120 /* Compute the real value. */
3121 result
= type_contains_placeholder_1 (type
);
3123 /* Store the real value. */
3124 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3129 /* Push tree EXP onto vector QUEUE if it is not already present. */
3132 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3137 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3138 if (simple_cst_equal (iter
, exp
) == 1)
3142 queue
->safe_push (exp
);
3145 /* Given a tree EXP, find all occurrences of references to fields
3146 in a PLACEHOLDER_EXPR and place them in vector REFS without
3147 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3148 we assume here that EXP contains only arithmetic expressions
3149 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3153 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3155 enum tree_code code
= TREE_CODE (exp
);
3159 /* We handle TREE_LIST and COMPONENT_REF separately. */
3160 if (code
== TREE_LIST
)
3162 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3163 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3165 else if (code
== COMPONENT_REF
)
3167 for (inner
= TREE_OPERAND (exp
, 0);
3168 REFERENCE_CLASS_P (inner
);
3169 inner
= TREE_OPERAND (inner
, 0))
3172 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3173 push_without_duplicates (exp
, refs
);
3175 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3178 switch (TREE_CODE_CLASS (code
))
3183 case tcc_declaration
:
3184 /* Variables allocated to static storage can stay. */
3185 if (!TREE_STATIC (exp
))
3186 push_without_duplicates (exp
, refs
);
3189 case tcc_expression
:
3190 /* This is the pattern built in ada/make_aligning_type. */
3191 if (code
== ADDR_EXPR
3192 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3194 push_without_duplicates (exp
, refs
);
3198 /* Fall through... */
3200 case tcc_exceptional
:
3203 case tcc_comparison
:
3205 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3206 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3210 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3211 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3219 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3220 return a tree with all occurrences of references to F in a
3221 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3222 CONST_DECLs. Note that we assume here that EXP contains only
3223 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3224 occurring only in their argument list. */
3227 substitute_in_expr (tree exp
, tree f
, tree r
)
3229 enum tree_code code
= TREE_CODE (exp
);
3230 tree op0
, op1
, op2
, op3
;
3233 /* We handle TREE_LIST and COMPONENT_REF separately. */
3234 if (code
== TREE_LIST
)
3236 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3237 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3238 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3241 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3243 else if (code
== COMPONENT_REF
)
3247 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3248 and it is the right field, replace it with R. */
3249 for (inner
= TREE_OPERAND (exp
, 0);
3250 REFERENCE_CLASS_P (inner
);
3251 inner
= TREE_OPERAND (inner
, 0))
3255 op1
= TREE_OPERAND (exp
, 1);
3257 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3260 /* If this expression hasn't been completed let, leave it alone. */
3261 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3264 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3265 if (op0
== TREE_OPERAND (exp
, 0))
3269 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3272 switch (TREE_CODE_CLASS (code
))
3277 case tcc_declaration
:
3283 case tcc_expression
:
3287 /* Fall through... */
3289 case tcc_exceptional
:
3292 case tcc_comparison
:
3294 switch (TREE_CODE_LENGTH (code
))
3300 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3301 if (op0
== TREE_OPERAND (exp
, 0))
3304 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3308 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3309 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3311 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3314 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3318 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3319 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3320 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3322 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3323 && op2
== TREE_OPERAND (exp
, 2))
3326 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3330 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3331 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3332 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3333 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3335 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3336 && op2
== TREE_OPERAND (exp
, 2)
3337 && op3
== TREE_OPERAND (exp
, 3))
3341 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3353 new_tree
= NULL_TREE
;
3355 /* If we are trying to replace F with a constant, inline back
3356 functions which do nothing else than computing a value from
3357 the arguments they are passed. This makes it possible to
3358 fold partially or entirely the replacement expression. */
3359 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3361 tree t
= maybe_inline_call_in_expr (exp
);
3363 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3366 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3368 tree op
= TREE_OPERAND (exp
, i
);
3369 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3373 new_tree
= copy_node (exp
);
3374 TREE_OPERAND (new_tree
, i
) = new_op
;
3380 new_tree
= fold (new_tree
);
3381 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3382 process_call_operands (new_tree
);
3393 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3395 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3396 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3401 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3402 for it within OBJ, a tree that is an object or a chain of references. */
3405 substitute_placeholder_in_expr (tree exp
, tree obj
)
3407 enum tree_code code
= TREE_CODE (exp
);
3408 tree op0
, op1
, op2
, op3
;
3411 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3412 in the chain of OBJ. */
3413 if (code
== PLACEHOLDER_EXPR
)
3415 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3418 for (elt
= obj
; elt
!= 0;
3419 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3420 || TREE_CODE (elt
) == COND_EXPR
)
3421 ? TREE_OPERAND (elt
, 1)
3422 : (REFERENCE_CLASS_P (elt
)
3423 || UNARY_CLASS_P (elt
)
3424 || BINARY_CLASS_P (elt
)
3425 || VL_EXP_CLASS_P (elt
)
3426 || EXPRESSION_CLASS_P (elt
))
3427 ? TREE_OPERAND (elt
, 0) : 0))
3428 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3431 for (elt
= obj
; elt
!= 0;
3432 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3433 || TREE_CODE (elt
) == COND_EXPR
)
3434 ? TREE_OPERAND (elt
, 1)
3435 : (REFERENCE_CLASS_P (elt
)
3436 || UNARY_CLASS_P (elt
)
3437 || BINARY_CLASS_P (elt
)
3438 || VL_EXP_CLASS_P (elt
)
3439 || EXPRESSION_CLASS_P (elt
))
3440 ? TREE_OPERAND (elt
, 0) : 0))
3441 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3442 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3444 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3446 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3447 survives until RTL generation, there will be an error. */
3451 /* TREE_LIST is special because we need to look at TREE_VALUE
3452 and TREE_CHAIN, not TREE_OPERANDS. */
3453 else if (code
== TREE_LIST
)
3455 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3456 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3457 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3460 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3463 switch (TREE_CODE_CLASS (code
))
3466 case tcc_declaration
:
3469 case tcc_exceptional
:
3472 case tcc_comparison
:
3473 case tcc_expression
:
3476 switch (TREE_CODE_LENGTH (code
))
3482 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3483 if (op0
== TREE_OPERAND (exp
, 0))
3486 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3490 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3491 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3493 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3496 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3500 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3501 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3502 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3504 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3505 && op2
== TREE_OPERAND (exp
, 2))
3508 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3512 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3513 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3514 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3515 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3517 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3518 && op2
== TREE_OPERAND (exp
, 2)
3519 && op3
== TREE_OPERAND (exp
, 3))
3523 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3535 new_tree
= NULL_TREE
;
3537 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3539 tree op
= TREE_OPERAND (exp
, i
);
3540 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3544 new_tree
= copy_node (exp
);
3545 TREE_OPERAND (new_tree
, i
) = new_op
;
3551 new_tree
= fold (new_tree
);
3552 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3553 process_call_operands (new_tree
);
3564 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3566 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3567 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3572 /* Stabilize a reference so that we can use it any number of times
3573 without causing its operands to be evaluated more than once.
3574 Returns the stabilized reference. This works by means of save_expr,
3575 so see the caveats in the comments about save_expr.
3577 Also allows conversion expressions whose operands are references.
3578 Any other kind of expression is returned unchanged. */
3581 stabilize_reference (tree ref
)
3584 enum tree_code code
= TREE_CODE (ref
);
3591 /* No action is needed in this case. */
3596 case FIX_TRUNC_EXPR
:
3597 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3601 result
= build_nt (INDIRECT_REF
,
3602 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3606 result
= build_nt (COMPONENT_REF
,
3607 stabilize_reference (TREE_OPERAND (ref
, 0)),
3608 TREE_OPERAND (ref
, 1), NULL_TREE
);
3612 result
= build_nt (BIT_FIELD_REF
,
3613 stabilize_reference (TREE_OPERAND (ref
, 0)),
3614 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3618 result
= build_nt (ARRAY_REF
,
3619 stabilize_reference (TREE_OPERAND (ref
, 0)),
3620 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3621 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3624 case ARRAY_RANGE_REF
:
3625 result
= build_nt (ARRAY_RANGE_REF
,
3626 stabilize_reference (TREE_OPERAND (ref
, 0)),
3627 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3628 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3632 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3633 it wouldn't be ignored. This matters when dealing with
3635 return stabilize_reference_1 (ref
);
3637 /* If arg isn't a kind of lvalue we recognize, make no change.
3638 Caller should recognize the error for an invalid lvalue. */
3643 return error_mark_node
;
3646 TREE_TYPE (result
) = TREE_TYPE (ref
);
3647 TREE_READONLY (result
) = TREE_READONLY (ref
);
3648 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3649 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3654 /* Subroutine of stabilize_reference; this is called for subtrees of
3655 references. Any expression with side-effects must be put in a SAVE_EXPR
3656 to ensure that it is only evaluated once.
3658 We don't put SAVE_EXPR nodes around everything, because assigning very
3659 simple expressions to temporaries causes us to miss good opportunities
3660 for optimizations. Among other things, the opportunity to fold in the
3661 addition of a constant into an addressing mode often gets lost, e.g.
3662 "y[i+1] += x;". In general, we take the approach that we should not make
3663 an assignment unless we are forced into it - i.e., that any non-side effect
3664 operator should be allowed, and that cse should take care of coalescing
3665 multiple utterances of the same expression should that prove fruitful. */
3668 stabilize_reference_1 (tree e
)
3671 enum tree_code code
= TREE_CODE (e
);
3673 /* We cannot ignore const expressions because it might be a reference
3674 to a const array but whose index contains side-effects. But we can
3675 ignore things that are actual constant or that already have been
3676 handled by this function. */
3678 if (tree_invariant_p (e
))
3681 switch (TREE_CODE_CLASS (code
))
3683 case tcc_exceptional
:
3685 case tcc_declaration
:
3686 case tcc_comparison
:
3688 case tcc_expression
:
3691 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3692 so that it will only be evaluated once. */
3693 /* The reference (r) and comparison (<) classes could be handled as
3694 below, but it is generally faster to only evaluate them once. */
3695 if (TREE_SIDE_EFFECTS (e
))
3696 return save_expr (e
);
3700 /* Constants need no processing. In fact, we should never reach
3705 /* Division is slow and tends to be compiled with jumps,
3706 especially the division by powers of 2 that is often
3707 found inside of an array reference. So do it just once. */
3708 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3709 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3710 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3711 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3712 return save_expr (e
);
3713 /* Recursively stabilize each operand. */
3714 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3715 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3719 /* Recursively stabilize each operand. */
3720 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3727 TREE_TYPE (result
) = TREE_TYPE (e
);
3728 TREE_READONLY (result
) = TREE_READONLY (e
);
3729 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3730 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3735 /* Low-level constructors for expressions. */
3737 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3738 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3741 recompute_tree_invariant_for_addr_expr (tree t
)
3744 bool tc
= true, se
= false;
3746 /* We started out assuming this address is both invariant and constant, but
3747 does not have side effects. Now go down any handled components and see if
3748 any of them involve offsets that are either non-constant or non-invariant.
3749 Also check for side-effects.
3751 ??? Note that this code makes no attempt to deal with the case where
3752 taking the address of something causes a copy due to misalignment. */
3754 #define UPDATE_FLAGS(NODE) \
3755 do { tree _node = (NODE); \
3756 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3757 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3759 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3760 node
= TREE_OPERAND (node
, 0))
3762 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3763 array reference (probably made temporarily by the G++ front end),
3764 so ignore all the operands. */
3765 if ((TREE_CODE (node
) == ARRAY_REF
3766 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3767 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3769 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3770 if (TREE_OPERAND (node
, 2))
3771 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3772 if (TREE_OPERAND (node
, 3))
3773 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3775 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3776 FIELD_DECL, apparently. The G++ front end can put something else
3777 there, at least temporarily. */
3778 else if (TREE_CODE (node
) == COMPONENT_REF
3779 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3781 if (TREE_OPERAND (node
, 2))
3782 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3786 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3788 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3789 the address, since &(*a)->b is a form of addition. If it's a constant, the
3790 address is constant too. If it's a decl, its address is constant if the
3791 decl is static. Everything else is not constant and, furthermore,
3792 taking the address of a volatile variable is not volatile. */
3793 if (TREE_CODE (node
) == INDIRECT_REF
3794 || TREE_CODE (node
) == MEM_REF
)
3795 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3796 else if (CONSTANT_CLASS_P (node
))
3798 else if (DECL_P (node
))
3799 tc
&= (staticp (node
) != NULL_TREE
);
3803 se
|= TREE_SIDE_EFFECTS (node
);
3807 TREE_CONSTANT (t
) = tc
;
3808 TREE_SIDE_EFFECTS (t
) = se
;
3812 /* Build an expression of code CODE, data type TYPE, and operands as
3813 specified. Expressions and reference nodes can be created this way.
3814 Constants, decls, types and misc nodes cannot be.
3816 We define 5 non-variadic functions, from 0 to 4 arguments. This is
3817 enough for all extant tree codes. */
3820 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
3824 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
3826 t
= make_node_stat (code PASS_MEM_STAT
);
3833 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
3835 int length
= sizeof (struct tree_exp
);
3838 record_node_allocation_statistics (code
, length
);
3840 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
3842 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
3844 memset (t
, 0, sizeof (struct tree_common
));
3846 TREE_SET_CODE (t
, code
);
3848 TREE_TYPE (t
) = type
;
3849 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
3850 TREE_OPERAND (t
, 0) = node
;
3851 if (node
&& !TYPE_P (node
))
3853 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
3854 TREE_READONLY (t
) = TREE_READONLY (node
);
3857 if (TREE_CODE_CLASS (code
) == tcc_statement
)
3858 TREE_SIDE_EFFECTS (t
) = 1;
3862 /* All of these have side-effects, no matter what their
3864 TREE_SIDE_EFFECTS (t
) = 1;
3865 TREE_READONLY (t
) = 0;
3869 /* Whether a dereference is readonly has nothing to do with whether
3870 its operand is readonly. */
3871 TREE_READONLY (t
) = 0;
3876 recompute_tree_invariant_for_addr_expr (t
);
3880 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
3881 && node
&& !TYPE_P (node
)
3882 && TREE_CONSTANT (node
))
3883 TREE_CONSTANT (t
) = 1;
3884 if (TREE_CODE_CLASS (code
) == tcc_reference
3885 && node
&& TREE_THIS_VOLATILE (node
))
3886 TREE_THIS_VOLATILE (t
) = 1;
3893 #define PROCESS_ARG(N) \
3895 TREE_OPERAND (t, N) = arg##N; \
3896 if (arg##N &&!TYPE_P (arg##N)) \
3898 if (TREE_SIDE_EFFECTS (arg##N)) \
3900 if (!TREE_READONLY (arg##N) \
3901 && !CONSTANT_CLASS_P (arg##N)) \
3902 (void) (read_only = 0); \
3903 if (!TREE_CONSTANT (arg##N)) \
3904 (void) (constant = 0); \
3909 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
3911 bool constant
, read_only
, side_effects
;
3914 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
3916 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
3917 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
3918 /* When sizetype precision doesn't match that of pointers
3919 we need to be able to build explicit extensions or truncations
3920 of the offset argument. */
3921 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
3922 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
3923 && TREE_CODE (arg1
) == INTEGER_CST
);
3925 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
3926 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
3927 && ptrofftype_p (TREE_TYPE (arg1
)));
3929 t
= make_node_stat (code PASS_MEM_STAT
);
3932 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
3933 result based on those same flags for the arguments. But if the
3934 arguments aren't really even `tree' expressions, we shouldn't be trying
3937 /* Expressions without side effects may be constant if their
3938 arguments are as well. */
3939 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
3940 || TREE_CODE_CLASS (code
) == tcc_binary
);
3942 side_effects
= TREE_SIDE_EFFECTS (t
);
3947 TREE_READONLY (t
) = read_only
;
3948 TREE_CONSTANT (t
) = constant
;
3949 TREE_SIDE_EFFECTS (t
) = side_effects
;
3950 TREE_THIS_VOLATILE (t
)
3951 = (TREE_CODE_CLASS (code
) == tcc_reference
3952 && arg0
&& TREE_THIS_VOLATILE (arg0
));
3959 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
3960 tree arg2 MEM_STAT_DECL
)
3962 bool constant
, read_only
, side_effects
;
3965 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
3966 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
3968 t
= make_node_stat (code PASS_MEM_STAT
);
3973 /* As a special exception, if COND_EXPR has NULL branches, we
3974 assume that it is a gimple statement and always consider
3975 it to have side effects. */
3976 if (code
== COND_EXPR
3977 && tt
== void_type_node
3978 && arg1
== NULL_TREE
3979 && arg2
== NULL_TREE
)
3980 side_effects
= true;
3982 side_effects
= TREE_SIDE_EFFECTS (t
);
3988 if (code
== COND_EXPR
)
3989 TREE_READONLY (t
) = read_only
;
3991 TREE_SIDE_EFFECTS (t
) = side_effects
;
3992 TREE_THIS_VOLATILE (t
)
3993 = (TREE_CODE_CLASS (code
) == tcc_reference
3994 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4000 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4001 tree arg2
, tree arg3 MEM_STAT_DECL
)
4003 bool constant
, read_only
, side_effects
;
4006 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4008 t
= make_node_stat (code PASS_MEM_STAT
);
4011 side_effects
= TREE_SIDE_EFFECTS (t
);
4018 TREE_SIDE_EFFECTS (t
) = side_effects
;
4019 TREE_THIS_VOLATILE (t
)
4020 = (TREE_CODE_CLASS (code
) == tcc_reference
4021 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4027 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4028 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4030 bool constant
, read_only
, side_effects
;
4033 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4035 t
= make_node_stat (code PASS_MEM_STAT
);
4038 side_effects
= TREE_SIDE_EFFECTS (t
);
4046 TREE_SIDE_EFFECTS (t
) = side_effects
;
4047 TREE_THIS_VOLATILE (t
)
4048 = (TREE_CODE_CLASS (code
) == tcc_reference
4049 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4054 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4055 on the pointer PTR. */
4058 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4060 HOST_WIDE_INT offset
= 0;
4061 tree ptype
= TREE_TYPE (ptr
);
4063 /* For convenience allow addresses that collapse to a simple base
4065 if (TREE_CODE (ptr
) == ADDR_EXPR
4066 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4067 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4069 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4071 ptr
= build_fold_addr_expr (ptr
);
4072 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4074 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4075 ptr
, build_int_cst (ptype
, offset
));
4076 SET_EXPR_LOCATION (tem
, loc
);
4080 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4083 mem_ref_offset (const_tree t
)
4085 tree toff
= TREE_OPERAND (t
, 1);
4086 return tree_to_double_int (toff
).sext (TYPE_PRECISION (TREE_TYPE (toff
)));
4089 /* Return the pointer-type relevant for TBAA purposes from the
4090 gimple memory reference tree T. This is the type to be used for
4091 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4094 reference_alias_ptr_type (const_tree t
)
4096 const_tree base
= t
;
4097 while (handled_component_p (base
))
4098 base
= TREE_OPERAND (base
, 0);
4099 if (TREE_CODE (base
) == MEM_REF
)
4100 return TREE_TYPE (TREE_OPERAND (base
, 1));
4101 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4102 return TREE_TYPE (TMR_OFFSET (base
));
4104 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4107 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4108 offsetted by OFFSET units. */
4111 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4113 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4114 build_fold_addr_expr (base
),
4115 build_int_cst (ptr_type_node
, offset
));
4116 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4117 recompute_tree_invariant_for_addr_expr (addr
);
4121 /* Similar except don't specify the TREE_TYPE
4122 and leave the TREE_SIDE_EFFECTS as 0.
4123 It is permissible for arguments to be null,
4124 or even garbage if their values do not matter. */
4127 build_nt (enum tree_code code
, ...)
4134 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4138 t
= make_node (code
);
4139 length
= TREE_CODE_LENGTH (code
);
4141 for (i
= 0; i
< length
; i
++)
4142 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4148 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4152 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4157 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4158 CALL_EXPR_FN (ret
) = fn
;
4159 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4160 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4161 CALL_EXPR_ARG (ret
, ix
) = t
;
4165 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4166 We do NOT enter this node in any sort of symbol table.
4168 LOC is the location of the decl.
4170 layout_decl is used to set up the decl's storage layout.
4171 Other slots are initialized to 0 or null pointers. */
4174 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4175 tree type MEM_STAT_DECL
)
4179 t
= make_node_stat (code PASS_MEM_STAT
);
4180 DECL_SOURCE_LOCATION (t
) = loc
;
4182 /* if (type == error_mark_node)
4183 type = integer_type_node; */
4184 /* That is not done, deliberately, so that having error_mark_node
4185 as the type can suppress useless errors in the use of this variable. */
4187 DECL_NAME (t
) = name
;
4188 TREE_TYPE (t
) = type
;
4190 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4196 /* Builds and returns function declaration with NAME and TYPE. */
4199 build_fn_decl (const char *name
, tree type
)
4201 tree id
= get_identifier (name
);
4202 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4204 DECL_EXTERNAL (decl
) = 1;
4205 TREE_PUBLIC (decl
) = 1;
4206 DECL_ARTIFICIAL (decl
) = 1;
4207 TREE_NOTHROW (decl
) = 1;
4212 vec
<tree
, va_gc
> *all_translation_units
;
4214 /* Builds a new translation-unit decl with name NAME, queues it in the
4215 global list of translation-unit decls and returns it. */
4218 build_translation_unit_decl (tree name
)
4220 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4222 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4223 vec_safe_push (all_translation_units
, tu
);
4228 /* BLOCK nodes are used to represent the structure of binding contours
4229 and declarations, once those contours have been exited and their contents
4230 compiled. This information is used for outputting debugging info. */
4233 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4235 tree block
= make_node (BLOCK
);
4237 BLOCK_VARS (block
) = vars
;
4238 BLOCK_SUBBLOCKS (block
) = subblocks
;
4239 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4240 BLOCK_CHAIN (block
) = chain
;
4245 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4247 LOC is the location to use in tree T. */
4250 protected_set_expr_location (tree t
, location_t loc
)
4252 if (t
&& CAN_HAVE_LOCATION_P (t
))
4253 SET_EXPR_LOCATION (t
, loc
);
4256 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4260 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4262 DECL_ATTRIBUTES (ddecl
) = attribute
;
4266 /* Borrowed from hashtab.c iterative_hash implementation. */
4267 #define mix(a,b,c) \
4269 a -= b; a -= c; a ^= (c>>13); \
4270 b -= c; b -= a; b ^= (a<< 8); \
4271 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4272 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4273 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4274 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4275 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4276 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4277 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4281 /* Produce good hash value combining VAL and VAL2. */
4283 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4285 /* the golden ratio; an arbitrary value. */
4286 hashval_t a
= 0x9e3779b9;
4292 /* Produce good hash value combining VAL and VAL2. */
4294 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4296 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4297 return iterative_hash_hashval_t (val
, val2
);
4300 hashval_t a
= (hashval_t
) val
;
4301 /* Avoid warnings about shifting of more than the width of the type on
4302 hosts that won't execute this path. */
4304 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4306 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4308 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4309 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4316 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4317 is ATTRIBUTE and its qualifiers are QUALS.
4319 Record such modified types already made so we don't make duplicates. */
4322 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4324 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4326 hashval_t hashcode
= 0;
4328 enum tree_code code
= TREE_CODE (ttype
);
4330 /* Building a distinct copy of a tagged type is inappropriate; it
4331 causes breakage in code that expects there to be a one-to-one
4332 relationship between a struct and its fields.
4333 build_duplicate_type is another solution (as used in
4334 handle_transparent_union_attribute), but that doesn't play well
4335 with the stronger C++ type identity model. */
4336 if (TREE_CODE (ttype
) == RECORD_TYPE
4337 || TREE_CODE (ttype
) == UNION_TYPE
4338 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4339 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4341 warning (OPT_Wattributes
,
4342 "ignoring attributes applied to %qT after definition",
4343 TYPE_MAIN_VARIANT (ttype
));
4344 return build_qualified_type (ttype
, quals
);
4347 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4348 ntype
= build_distinct_type_copy (ttype
);
4350 TYPE_ATTRIBUTES (ntype
) = attribute
;
4352 hashcode
= iterative_hash_object (code
, hashcode
);
4353 if (TREE_TYPE (ntype
))
4354 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4356 hashcode
= attribute_hash_list (attribute
, hashcode
);
4358 switch (TREE_CODE (ntype
))
4361 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4364 if (TYPE_DOMAIN (ntype
))
4365 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4369 hashcode
= iterative_hash_object
4370 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4371 hashcode
= iterative_hash_object
4372 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4375 case FIXED_POINT_TYPE
:
4377 unsigned int precision
= TYPE_PRECISION (ntype
);
4378 hashcode
= iterative_hash_object (precision
, hashcode
);
4385 ntype
= type_hash_canon (hashcode
, ntype
);
4387 /* If the target-dependent attributes make NTYPE different from
4388 its canonical type, we will need to use structural equality
4389 checks for this type. */
4390 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4391 || !comp_type_attributes (ntype
, ttype
))
4392 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4393 else if (TYPE_CANONICAL (ntype
) == ntype
)
4394 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4396 ttype
= build_qualified_type (ntype
, quals
);
4398 else if (TYPE_QUALS (ttype
) != quals
)
4399 ttype
= build_qualified_type (ttype
, quals
);
4404 /* Compare two attributes for their value identity. Return true if the
4405 attribute values are known to be equal; otherwise return false.
4409 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4411 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4414 if (TREE_VALUE (attr1
) != NULL_TREE
4415 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4416 && TREE_VALUE (attr2
) != NULL
4417 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4418 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4419 TREE_VALUE (attr2
)) == 1);
4421 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4424 /* Return 0 if the attributes for two types are incompatible, 1 if they
4425 are compatible, and 2 if they are nearly compatible (which causes a
4426 warning to be generated). */
4428 comp_type_attributes (const_tree type1
, const_tree type2
)
4430 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4431 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4436 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4438 const struct attribute_spec
*as
;
4441 as
= lookup_attribute_spec (get_attribute_name (a
));
4442 if (!as
|| as
->affects_type_identity
== false)
4445 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4446 if (!attr
|| !attribute_value_equal (a
, attr
))
4451 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4453 const struct attribute_spec
*as
;
4455 as
= lookup_attribute_spec (get_attribute_name (a
));
4456 if (!as
|| as
->affects_type_identity
== false)
4459 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4461 /* We don't need to compare trees again, as we did this
4462 already in first loop. */
4464 /* All types - affecting identity - are equal, so
4465 there is no need to call target hook for comparison. */
4469 /* As some type combinations - like default calling-convention - might
4470 be compatible, we have to call the target hook to get the final result. */
4471 return targetm
.comp_type_attributes (type1
, type2
);
4474 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4477 Record such modified types already made so we don't make duplicates. */
4480 build_type_attribute_variant (tree ttype
, tree attribute
)
4482 return build_type_attribute_qual_variant (ttype
, attribute
,
4483 TYPE_QUALS (ttype
));
4487 /* Reset the expression *EXPR_P, a size or position.
4489 ??? We could reset all non-constant sizes or positions. But it's cheap
4490 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4492 We need to reset self-referential sizes or positions because they cannot
4493 be gimplified and thus can contain a CALL_EXPR after the gimplification
4494 is finished, which will run afoul of LTO streaming. And they need to be
4495 reset to something essentially dummy but not constant, so as to preserve
4496 the properties of the object they are attached to. */
4499 free_lang_data_in_one_sizepos (tree
*expr_p
)
4501 tree expr
= *expr_p
;
4502 if (CONTAINS_PLACEHOLDER_P (expr
))
4503 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4507 /* Reset all the fields in a binfo node BINFO. We only keep
4508 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4511 free_lang_data_in_binfo (tree binfo
)
4516 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4518 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4519 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4520 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4521 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4523 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4524 free_lang_data_in_binfo (t
);
4528 /* Reset all language specific information still present in TYPE. */
4531 free_lang_data_in_type (tree type
)
4533 gcc_assert (TYPE_P (type
));
4535 /* Give the FE a chance to remove its own data first. */
4536 lang_hooks
.free_lang_data (type
);
4538 TREE_LANG_FLAG_0 (type
) = 0;
4539 TREE_LANG_FLAG_1 (type
) = 0;
4540 TREE_LANG_FLAG_2 (type
) = 0;
4541 TREE_LANG_FLAG_3 (type
) = 0;
4542 TREE_LANG_FLAG_4 (type
) = 0;
4543 TREE_LANG_FLAG_5 (type
) = 0;
4544 TREE_LANG_FLAG_6 (type
) = 0;
4546 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4548 /* Remove the const and volatile qualifiers from arguments. The
4549 C++ front end removes them, but the C front end does not,
4550 leading to false ODR violation errors when merging two
4551 instances of the same function signature compiled by
4552 different front ends. */
4555 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4557 tree arg_type
= TREE_VALUE (p
);
4559 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4561 int quals
= TYPE_QUALS (arg_type
)
4563 & ~TYPE_QUAL_VOLATILE
;
4564 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4565 free_lang_data_in_type (TREE_VALUE (p
));
4570 /* Remove members that are not actually FIELD_DECLs from the field
4571 list of an aggregate. These occur in C++. */
4572 if (RECORD_OR_UNION_TYPE_P (type
))
4576 /* Note that TYPE_FIELDS can be shared across distinct
4577 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4578 to be removed, we cannot set its TREE_CHAIN to NULL.
4579 Otherwise, we would not be able to find all the other fields
4580 in the other instances of this TREE_TYPE.
4582 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4584 member
= TYPE_FIELDS (type
);
4587 if (TREE_CODE (member
) == FIELD_DECL
4588 || TREE_CODE (member
) == TYPE_DECL
)
4591 TREE_CHAIN (prev
) = member
;
4593 TYPE_FIELDS (type
) = member
;
4597 member
= TREE_CHAIN (member
);
4601 TREE_CHAIN (prev
) = NULL_TREE
;
4603 TYPE_FIELDS (type
) = NULL_TREE
;
4605 TYPE_METHODS (type
) = NULL_TREE
;
4606 if (TYPE_BINFO (type
))
4607 free_lang_data_in_binfo (TYPE_BINFO (type
));
4611 /* For non-aggregate types, clear out the language slot (which
4612 overloads TYPE_BINFO). */
4613 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4615 if (INTEGRAL_TYPE_P (type
)
4616 || SCALAR_FLOAT_TYPE_P (type
)
4617 || FIXED_POINT_TYPE_P (type
))
4619 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4620 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4624 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4625 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4627 if (TYPE_CONTEXT (type
)
4628 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4630 tree ctx
= TYPE_CONTEXT (type
);
4633 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4635 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4636 TYPE_CONTEXT (type
) = ctx
;
4641 /* Return true if DECL may need an assembler name to be set. */
4644 need_assembler_name_p (tree decl
)
4646 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4647 if (TREE_CODE (decl
) != FUNCTION_DECL
4648 && TREE_CODE (decl
) != VAR_DECL
)
4651 /* If DECL already has its assembler name set, it does not need a
4653 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4654 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4657 /* Abstract decls do not need an assembler name. */
4658 if (DECL_ABSTRACT (decl
))
4661 /* For VAR_DECLs, only static, public and external symbols need an
4663 if (TREE_CODE (decl
) == VAR_DECL
4664 && !TREE_STATIC (decl
)
4665 && !TREE_PUBLIC (decl
)
4666 && !DECL_EXTERNAL (decl
))
4669 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4671 /* Do not set assembler name on builtins. Allow RTL expansion to
4672 decide whether to expand inline or via a regular call. */
4673 if (DECL_BUILT_IN (decl
)
4674 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4677 /* Functions represented in the callgraph need an assembler name. */
4678 if (cgraph_get_node (decl
) != NULL
)
4681 /* Unused and not public functions don't need an assembler name. */
4682 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4690 /* Reset all language specific information still present in symbol
4694 free_lang_data_in_decl (tree decl
)
4696 gcc_assert (DECL_P (decl
));
4698 /* Give the FE a chance to remove its own data first. */
4699 lang_hooks
.free_lang_data (decl
);
4701 TREE_LANG_FLAG_0 (decl
) = 0;
4702 TREE_LANG_FLAG_1 (decl
) = 0;
4703 TREE_LANG_FLAG_2 (decl
) = 0;
4704 TREE_LANG_FLAG_3 (decl
) = 0;
4705 TREE_LANG_FLAG_4 (decl
) = 0;
4706 TREE_LANG_FLAG_5 (decl
) = 0;
4707 TREE_LANG_FLAG_6 (decl
) = 0;
4709 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4710 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4711 if (TREE_CODE (decl
) == FIELD_DECL
)
4713 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4714 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4715 DECL_QUALIFIER (decl
) = NULL_TREE
;
4718 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4720 if (gimple_has_body_p (decl
))
4724 /* If DECL has a gimple body, then the context for its
4725 arguments must be DECL. Otherwise, it doesn't really
4726 matter, as we will not be emitting any code for DECL. In
4727 general, there may be other instances of DECL created by
4728 the front end and since PARM_DECLs are generally shared,
4729 their DECL_CONTEXT changes as the replicas of DECL are
4730 created. The only time where DECL_CONTEXT is important
4731 is for the FUNCTION_DECLs that have a gimple body (since
4732 the PARM_DECL will be used in the function's body). */
4733 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4734 DECL_CONTEXT (t
) = decl
;
4737 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4738 At this point, it is not needed anymore. */
4739 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4741 /* Clear the abstract origin if it refers to a method. Otherwise
4742 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4743 origin will not be output correctly. */
4744 if (DECL_ABSTRACT_ORIGIN (decl
)
4745 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4746 && RECORD_OR_UNION_TYPE_P
4747 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4748 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4750 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4751 DECL_VINDEX referring to itself into a vtable slot number as it
4752 should. Happens with functions that are copied and then forgotten
4753 about. Just clear it, it won't matter anymore. */
4754 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4755 DECL_VINDEX (decl
) = NULL_TREE
;
4757 else if (TREE_CODE (decl
) == VAR_DECL
)
4759 if ((DECL_EXTERNAL (decl
)
4760 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4761 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4762 DECL_INITIAL (decl
) = NULL_TREE
;
4764 else if (TREE_CODE (decl
) == TYPE_DECL
4765 || TREE_CODE (decl
) == FIELD_DECL
)
4766 DECL_INITIAL (decl
) = NULL_TREE
;
4767 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4768 && DECL_INITIAL (decl
)
4769 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4771 /* Strip builtins from the translation-unit BLOCK. We still have targets
4772 without builtin_decl_explicit support and also builtins are shared
4773 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4774 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4778 if (TREE_CODE (var
) == FUNCTION_DECL
4779 && DECL_BUILT_IN (var
))
4780 *nextp
= TREE_CHAIN (var
);
4782 nextp
= &TREE_CHAIN (var
);
4788 /* Data used when collecting DECLs and TYPEs for language data removal. */
4790 struct free_lang_data_d
4792 /* Worklist to avoid excessive recursion. */
4795 /* Set of traversed objects. Used to avoid duplicate visits. */
4796 struct pointer_set_t
*pset
;
4798 /* Array of symbols to process with free_lang_data_in_decl. */
4801 /* Array of types to process with free_lang_data_in_type. */
4806 /* Save all language fields needed to generate proper debug information
4807 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
4810 save_debug_info_for_decl (tree t
)
4812 /*struct saved_debug_info_d *sdi;*/
4814 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
4816 /* FIXME. Partial implementation for saving debug info removed. */
4820 /* Save all language fields needed to generate proper debug information
4821 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
4824 save_debug_info_for_type (tree t
)
4826 /*struct saved_debug_info_d *sdi;*/
4828 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
4830 /* FIXME. Partial implementation for saving debug info removed. */
4834 /* Add type or decl T to one of the list of tree nodes that need their
4835 language data removed. The lists are held inside FLD. */
4838 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
4842 fld
->decls
.safe_push (t
);
4843 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4844 save_debug_info_for_decl (t
);
4846 else if (TYPE_P (t
))
4848 fld
->types
.safe_push (t
);
4849 if (debug_info_level
> DINFO_LEVEL_TERSE
)
4850 save_debug_info_for_type (t
);
4856 /* Push tree node T into FLD->WORKLIST. */
4859 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
4861 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
4862 fld
->worklist
.safe_push ((t
));
4866 /* Operand callback helper for free_lang_data_in_node. *TP is the
4867 subtree operand being considered. */
4870 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
4873 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
4875 if (TREE_CODE (t
) == TREE_LIST
)
4878 /* Language specific nodes will be removed, so there is no need
4879 to gather anything under them. */
4880 if (is_lang_specific (t
))
4888 /* Note that walk_tree does not traverse every possible field in
4889 decls, so we have to do our own traversals here. */
4890 add_tree_to_fld_list (t
, fld
);
4892 fld_worklist_push (DECL_NAME (t
), fld
);
4893 fld_worklist_push (DECL_CONTEXT (t
), fld
);
4894 fld_worklist_push (DECL_SIZE (t
), fld
);
4895 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
4897 /* We are going to remove everything under DECL_INITIAL for
4898 TYPE_DECLs. No point walking them. */
4899 if (TREE_CODE (t
) != TYPE_DECL
)
4900 fld_worklist_push (DECL_INITIAL (t
), fld
);
4902 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
4903 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
4905 if (TREE_CODE (t
) == FUNCTION_DECL
)
4907 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
4908 fld_worklist_push (DECL_RESULT (t
), fld
);
4910 else if (TREE_CODE (t
) == TYPE_DECL
)
4912 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
4913 fld_worklist_push (DECL_VINDEX (t
), fld
);
4914 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
4916 else if (TREE_CODE (t
) == FIELD_DECL
)
4918 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
4919 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
4920 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
4921 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
4923 else if (TREE_CODE (t
) == VAR_DECL
)
4925 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
4926 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
4929 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
4930 && DECL_HAS_VALUE_EXPR_P (t
))
4931 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
4933 if (TREE_CODE (t
) != FIELD_DECL
4934 && TREE_CODE (t
) != TYPE_DECL
)
4935 fld_worklist_push (TREE_CHAIN (t
), fld
);
4938 else if (TYPE_P (t
))
4940 /* Note that walk_tree does not traverse every possible field in
4941 types, so we have to do our own traversals here. */
4942 add_tree_to_fld_list (t
, fld
);
4944 if (!RECORD_OR_UNION_TYPE_P (t
))
4945 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
4946 fld_worklist_push (TYPE_SIZE (t
), fld
);
4947 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
4948 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
4949 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
4950 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
4951 fld_worklist_push (TYPE_NAME (t
), fld
);
4952 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
4953 them and thus do not and want not to reach unused pointer types
4955 if (!POINTER_TYPE_P (t
))
4956 fld_worklist_push (TYPE_MINVAL (t
), fld
);
4957 if (!RECORD_OR_UNION_TYPE_P (t
))
4958 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
4959 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
4960 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
4961 do not and want not to reach unused variants this way. */
4962 if (TYPE_CONTEXT (t
))
4964 tree ctx
= TYPE_CONTEXT (t
);
4965 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
4966 So push that instead. */
4967 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
4968 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4969 fld_worklist_push (ctx
, fld
);
4971 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
4972 and want not to reach unused types this way. */
4974 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
4978 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
4979 fld_worklist_push (TREE_TYPE (tem
), fld
);
4980 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
4982 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
4983 && TREE_CODE (tem
) == TREE_LIST
)
4986 fld_worklist_push (TREE_VALUE (tem
), fld
);
4987 tem
= TREE_CHAIN (tem
);
4991 if (RECORD_OR_UNION_TYPE_P (t
))
4994 /* Push all TYPE_FIELDS - there can be interleaving interesting
4995 and non-interesting things. */
4996 tem
= TYPE_FIELDS (t
);
4999 if (TREE_CODE (tem
) == FIELD_DECL
5000 || TREE_CODE (tem
) == TYPE_DECL
)
5001 fld_worklist_push (tem
, fld
);
5002 tem
= TREE_CHAIN (tem
);
5006 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5009 else if (TREE_CODE (t
) == BLOCK
)
5012 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5013 fld_worklist_push (tem
, fld
);
5014 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5015 fld_worklist_push (tem
, fld
);
5016 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5019 if (TREE_CODE (t
) != IDENTIFIER_NODE
5020 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5021 fld_worklist_push (TREE_TYPE (t
), fld
);
5027 /* Find decls and types in T. */
5030 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5034 if (!pointer_set_contains (fld
->pset
, t
))
5035 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5036 if (fld
->worklist
.is_empty ())
5038 t
= fld
->worklist
.pop ();
5042 /* Translate all the types in LIST with the corresponding runtime
5046 get_eh_types_for_runtime (tree list
)
5050 if (list
== NULL_TREE
)
5053 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5055 list
= TREE_CHAIN (list
);
5058 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5059 TREE_CHAIN (prev
) = n
;
5060 prev
= TREE_CHAIN (prev
);
5061 list
= TREE_CHAIN (list
);
5068 /* Find decls and types referenced in EH region R and store them in
5069 FLD->DECLS and FLD->TYPES. */
5072 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5083 /* The types referenced in each catch must first be changed to the
5084 EH types used at runtime. This removes references to FE types
5086 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5088 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5089 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5094 case ERT_ALLOWED_EXCEPTIONS
:
5095 r
->u
.allowed
.type_list
5096 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5097 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5100 case ERT_MUST_NOT_THROW
:
5101 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5102 find_decls_types_r
, fld
, fld
->pset
);
5108 /* Find decls and types referenced in cgraph node N and store them in
5109 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5110 look for *every* kind of DECL and TYPE node reachable from N,
5111 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5112 NAMESPACE_DECLs, etc). */
5115 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5118 struct function
*fn
;
5122 find_decls_types (n
->symbol
.decl
, fld
);
5124 if (!gimple_has_body_p (n
->symbol
.decl
))
5127 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5129 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5131 /* Traverse locals. */
5132 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5133 find_decls_types (t
, fld
);
5135 /* Traverse EH regions in FN. */
5138 FOR_ALL_EH_REGION_FN (r
, fn
)
5139 find_decls_types_in_eh_region (r
, fld
);
5142 /* Traverse every statement in FN. */
5143 FOR_EACH_BB_FN (bb
, fn
)
5145 gimple_stmt_iterator si
;
5148 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5150 gimple phi
= gsi_stmt (si
);
5152 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5154 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5155 find_decls_types (*arg_p
, fld
);
5159 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5161 gimple stmt
= gsi_stmt (si
);
5163 if (is_gimple_call (stmt
))
5164 find_decls_types (gimple_call_fntype (stmt
), fld
);
5166 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5168 tree arg
= gimple_op (stmt
, i
);
5169 find_decls_types (arg
, fld
);
5176 /* Find decls and types referenced in varpool node N and store them in
5177 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5178 look for *every* kind of DECL and TYPE node reachable from N,
5179 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5180 NAMESPACE_DECLs, etc). */
5183 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5185 find_decls_types (v
->symbol
.decl
, fld
);
5188 /* If T needs an assembler name, have one created for it. */
5191 assign_assembler_name_if_neeeded (tree t
)
5193 if (need_assembler_name_p (t
))
5195 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5196 diagnostics that use input_location to show locus
5197 information. The problem here is that, at this point,
5198 input_location is generally anchored to the end of the file
5199 (since the parser is long gone), so we don't have a good
5200 position to pin it to.
5202 To alleviate this problem, this uses the location of T's
5203 declaration. Examples of this are
5204 testsuite/g++.dg/template/cond2.C and
5205 testsuite/g++.dg/template/pr35240.C. */
5206 location_t saved_location
= input_location
;
5207 input_location
= DECL_SOURCE_LOCATION (t
);
5209 decl_assembler_name (t
);
5211 input_location
= saved_location
;
5216 /* Free language specific information for every operand and expression
5217 in every node of the call graph. This process operates in three stages:
5219 1- Every callgraph node and varpool node is traversed looking for
5220 decls and types embedded in them. This is a more exhaustive
5221 search than that done by find_referenced_vars, because it will
5222 also collect individual fields, decls embedded in types, etc.
5224 2- All the decls found are sent to free_lang_data_in_decl.
5226 3- All the types found are sent to free_lang_data_in_type.
5228 The ordering between decls and types is important because
5229 free_lang_data_in_decl sets assembler names, which includes
5230 mangling. So types cannot be freed up until assembler names have
5234 free_lang_data_in_cgraph (void)
5236 struct cgraph_node
*n
;
5237 struct varpool_node
*v
;
5238 struct free_lang_data_d fld
;
5243 /* Initialize sets and arrays to store referenced decls and types. */
5244 fld
.pset
= pointer_set_create ();
5245 fld
.worklist
.create (0);
5246 fld
.decls
.create (100);
5247 fld
.types
.create (100);
5249 /* Find decls and types in the body of every function in the callgraph. */
5250 FOR_EACH_FUNCTION (n
)
5251 find_decls_types_in_node (n
, &fld
);
5253 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5254 find_decls_types (p
->decl
, &fld
);
5256 /* Find decls and types in every varpool symbol. */
5257 FOR_EACH_VARIABLE (v
)
5258 find_decls_types_in_var (v
, &fld
);
5260 /* Set the assembler name on every decl found. We need to do this
5261 now because free_lang_data_in_decl will invalidate data needed
5262 for mangling. This breaks mangling on interdependent decls. */
5263 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5264 assign_assembler_name_if_neeeded (t
);
5266 /* Traverse every decl found freeing its language data. */
5267 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5268 free_lang_data_in_decl (t
);
5270 /* Traverse every type found freeing its language data. */
5271 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5272 free_lang_data_in_type (t
);
5274 pointer_set_destroy (fld
.pset
);
5275 fld
.worklist
.release ();
5276 fld
.decls
.release ();
5277 fld
.types
.release ();
5281 /* Free resources that are used by FE but are not needed once they are done. */
5284 free_lang_data (void)
5288 /* If we are the LTO frontend we have freed lang-specific data already. */
5290 || !flag_generate_lto
)
5293 /* Allocate and assign alias sets to the standard integer types
5294 while the slots are still in the way the frontends generated them. */
5295 for (i
= 0; i
< itk_none
; ++i
)
5296 if (integer_types
[i
])
5297 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5299 /* Traverse the IL resetting language specific information for
5300 operands, expressions, etc. */
5301 free_lang_data_in_cgraph ();
5303 /* Create gimple variants for common types. */
5304 ptrdiff_type_node
= integer_type_node
;
5305 fileptr_type_node
= ptr_type_node
;
5307 /* Reset some langhooks. Do not reset types_compatible_p, it may
5308 still be used indirectly via the get_alias_set langhook. */
5309 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5310 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5311 /* We do not want the default decl_assembler_name implementation,
5312 rather if we have fixed everything we want a wrapper around it
5313 asserting that all non-local symbols already got their assembler
5314 name and only produce assembler names for local symbols. Or rather
5315 make sure we never call decl_assembler_name on local symbols and
5316 devise a separate, middle-end private scheme for it. */
5318 /* Reset diagnostic machinery. */
5319 tree_diagnostics_defaults (global_dc
);
5325 struct simple_ipa_opt_pass pass_ipa_free_lang_data
=
5329 "*free_lang_data", /* name */
5330 OPTGROUP_NONE
, /* optinfo_flags */
5332 free_lang_data
, /* execute */
5335 0, /* static_pass_number */
5336 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5337 0, /* properties_required */
5338 0, /* properties_provided */
5339 0, /* properties_destroyed */
5340 0, /* todo_flags_start */
5341 0 /* todo_flags_finish */
5345 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5346 ATTR_NAME. Also used internally by remove_attribute(). */
5348 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5350 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5352 if (ident_len
== attr_len
)
5354 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5357 else if (ident_len
== attr_len
+ 4)
5359 /* There is the possibility that ATTR is 'text' and IDENT is
5361 const char *p
= IDENTIFIER_POINTER (ident
);
5362 if (p
[0] == '_' && p
[1] == '_'
5363 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5364 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5371 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5372 of ATTR_NAME, and LIST is not NULL_TREE. */
5374 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5378 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5380 if (ident_len
== attr_len
)
5382 if (!strcmp (attr_name
,
5383 IDENTIFIER_POINTER (get_attribute_name (list
))))
5386 /* TODO: If we made sure that attributes were stored in the
5387 canonical form without '__...__' (ie, as in 'text' as opposed
5388 to '__text__') then we could avoid the following case. */
5389 else if (ident_len
== attr_len
+ 4)
5391 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5392 if (p
[0] == '_' && p
[1] == '_'
5393 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5394 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5397 list
= TREE_CHAIN (list
);
5403 /* A variant of lookup_attribute() that can be used with an identifier
5404 as the first argument, and where the identifier can be either
5405 'text' or '__text__'.
5407 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5408 return a pointer to the attribute's list element if the attribute
5409 is part of the list, or NULL_TREE if not found. If the attribute
5410 appears more than once, this only returns the first occurrence; the
5411 TREE_CHAIN of the return value should be passed back in if further
5412 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5413 can be in the form 'text' or '__text__'. */
5415 lookup_ident_attribute (tree attr_identifier
, tree list
)
5417 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5421 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5422 == IDENTIFIER_NODE
);
5424 /* Identifiers can be compared directly for equality. */
5425 if (attr_identifier
== get_attribute_name (list
))
5428 /* If they are not equal, they may still be one in the form
5429 'text' while the other one is in the form '__text__'. TODO:
5430 If we were storing attributes in normalized 'text' form, then
5431 this could all go away and we could take full advantage of
5432 the fact that we're comparing identifiers. :-) */
5434 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5435 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5437 if (ident_len
== attr_len
+ 4)
5439 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5440 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5441 if (p
[0] == '_' && p
[1] == '_'
5442 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5443 && strncmp (q
, p
+ 2, attr_len
) == 0)
5446 else if (ident_len
+ 4 == attr_len
)
5448 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5449 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5450 if (q
[0] == '_' && q
[1] == '_'
5451 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5452 && strncmp (q
+ 2, p
, ident_len
) == 0)
5456 list
= TREE_CHAIN (list
);
5462 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5466 remove_attribute (const char *attr_name
, tree list
)
5469 size_t attr_len
= strlen (attr_name
);
5471 gcc_checking_assert (attr_name
[0] != '_');
5473 for (p
= &list
; *p
; )
5476 /* TODO: If we were storing attributes in normalized form, here
5477 we could use a simple strcmp(). */
5478 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5479 *p
= TREE_CHAIN (l
);
5481 p
= &TREE_CHAIN (l
);
5487 /* Return an attribute list that is the union of a1 and a2. */
5490 merge_attributes (tree a1
, tree a2
)
5494 /* Either one unset? Take the set one. */
5496 if ((attributes
= a1
) == 0)
5499 /* One that completely contains the other? Take it. */
5501 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5503 if (attribute_list_contained (a2
, a1
))
5507 /* Pick the longest list, and hang on the other list. */
5509 if (list_length (a1
) < list_length (a2
))
5510 attributes
= a2
, a2
= a1
;
5512 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5515 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5517 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5518 a
= lookup_ident_attribute (get_attribute_name (a2
),
5523 a1
= copy_node (a2
);
5524 TREE_CHAIN (a1
) = attributes
;
5533 /* Given types T1 and T2, merge their attributes and return
5537 merge_type_attributes (tree t1
, tree t2
)
5539 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5540 TYPE_ATTRIBUTES (t2
));
5543 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5547 merge_decl_attributes (tree olddecl
, tree newdecl
)
5549 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5550 DECL_ATTRIBUTES (newdecl
));
5553 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5555 /* Specialization of merge_decl_attributes for various Windows targets.
5557 This handles the following situation:
5559 __declspec (dllimport) int foo;
5562 The second instance of `foo' nullifies the dllimport. */
5565 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5568 int delete_dllimport_p
= 1;
5570 /* What we need to do here is remove from `old' dllimport if it doesn't
5571 appear in `new'. dllimport behaves like extern: if a declaration is
5572 marked dllimport and a definition appears later, then the object
5573 is not dllimport'd. We also remove a `new' dllimport if the old list
5574 contains dllexport: dllexport always overrides dllimport, regardless
5575 of the order of declaration. */
5576 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5577 delete_dllimport_p
= 0;
5578 else if (DECL_DLLIMPORT_P (new_tree
)
5579 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5581 DECL_DLLIMPORT_P (new_tree
) = 0;
5582 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5583 "dllimport ignored", new_tree
);
5585 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5587 /* Warn about overriding a symbol that has already been used, e.g.:
5588 extern int __attribute__ ((dllimport)) foo;
5589 int* bar () {return &foo;}
5592 if (TREE_USED (old
))
5594 warning (0, "%q+D redeclared without dllimport attribute "
5595 "after being referenced with dll linkage", new_tree
);
5596 /* If we have used a variable's address with dllimport linkage,
5597 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5598 decl may already have had TREE_CONSTANT computed.
5599 We still remove the attribute so that assembler code refers
5600 to '&foo rather than '_imp__foo'. */
5601 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5602 DECL_DLLIMPORT_P (new_tree
) = 1;
5605 /* Let an inline definition silently override the external reference,
5606 but otherwise warn about attribute inconsistency. */
5607 else if (TREE_CODE (new_tree
) == VAR_DECL
5608 || !DECL_DECLARED_INLINE_P (new_tree
))
5609 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5610 "previous dllimport ignored", new_tree
);
5613 delete_dllimport_p
= 0;
5615 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5617 if (delete_dllimport_p
)
5618 a
= remove_attribute ("dllimport", a
);
5623 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5624 struct attribute_spec.handler. */
5627 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5633 /* These attributes may apply to structure and union types being created,
5634 but otherwise should pass to the declaration involved. */
5637 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5638 | (int) ATTR_FLAG_ARRAY_NEXT
))
5640 *no_add_attrs
= true;
5641 return tree_cons (name
, args
, NULL_TREE
);
5643 if (TREE_CODE (node
) == RECORD_TYPE
5644 || TREE_CODE (node
) == UNION_TYPE
)
5646 node
= TYPE_NAME (node
);
5652 warning (OPT_Wattributes
, "%qE attribute ignored",
5654 *no_add_attrs
= true;
5659 if (TREE_CODE (node
) != FUNCTION_DECL
5660 && TREE_CODE (node
) != VAR_DECL
5661 && TREE_CODE (node
) != TYPE_DECL
)
5663 *no_add_attrs
= true;
5664 warning (OPT_Wattributes
, "%qE attribute ignored",
5669 if (TREE_CODE (node
) == TYPE_DECL
5670 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5671 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5673 *no_add_attrs
= true;
5674 warning (OPT_Wattributes
, "%qE attribute ignored",
5679 is_dllimport
= is_attribute_p ("dllimport", name
);
5681 /* Report error on dllimport ambiguities seen now before they cause
5685 /* Honor any target-specific overrides. */
5686 if (!targetm
.valid_dllimport_attribute_p (node
))
5687 *no_add_attrs
= true;
5689 else if (TREE_CODE (node
) == FUNCTION_DECL
5690 && DECL_DECLARED_INLINE_P (node
))
5692 warning (OPT_Wattributes
, "inline function %q+D declared as "
5693 " dllimport: attribute ignored", node
);
5694 *no_add_attrs
= true;
5696 /* Like MS, treat definition of dllimported variables and
5697 non-inlined functions on declaration as syntax errors. */
5698 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5700 error ("function %q+D definition is marked dllimport", node
);
5701 *no_add_attrs
= true;
5704 else if (TREE_CODE (node
) == VAR_DECL
)
5706 if (DECL_INITIAL (node
))
5708 error ("variable %q+D definition is marked dllimport",
5710 *no_add_attrs
= true;
5713 /* `extern' needn't be specified with dllimport.
5714 Specify `extern' now and hope for the best. Sigh. */
5715 DECL_EXTERNAL (node
) = 1;
5716 /* Also, implicitly give dllimport'd variables declared within
5717 a function global scope, unless declared static. */
5718 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5719 TREE_PUBLIC (node
) = 1;
5722 if (*no_add_attrs
== false)
5723 DECL_DLLIMPORT_P (node
) = 1;
5725 else if (TREE_CODE (node
) == FUNCTION_DECL
5726 && DECL_DECLARED_INLINE_P (node
)
5727 && flag_keep_inline_dllexport
)
5728 /* An exported function, even if inline, must be emitted. */
5729 DECL_EXTERNAL (node
) = 0;
5731 /* Report error if symbol is not accessible at global scope. */
5732 if (!TREE_PUBLIC (node
)
5733 && (TREE_CODE (node
) == VAR_DECL
5734 || TREE_CODE (node
) == FUNCTION_DECL
))
5736 error ("external linkage required for symbol %q+D because of "
5737 "%qE attribute", node
, name
);
5738 *no_add_attrs
= true;
5741 /* A dllexport'd entity must have default visibility so that other
5742 program units (shared libraries or the main executable) can see
5743 it. A dllimport'd entity must have default visibility so that
5744 the linker knows that undefined references within this program
5745 unit can be resolved by the dynamic linker. */
5748 if (DECL_VISIBILITY_SPECIFIED (node
)
5749 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5750 error ("%qE implies default visibility, but %qD has already "
5751 "been declared with a different visibility",
5753 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5754 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5760 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5762 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5763 of the various TYPE_QUAL values. */
5766 set_type_quals (tree type
, int type_quals
)
5768 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5769 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5770 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5771 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5774 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5777 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5779 return (TYPE_QUALS (cand
) == type_quals
5780 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5781 /* Apparently this is needed for Objective-C. */
5782 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5783 /* Check alignment. */
5784 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5785 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5786 TYPE_ATTRIBUTES (base
)));
5789 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5792 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5794 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5795 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5796 /* Apparently this is needed for Objective-C. */
5797 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5798 /* Check alignment. */
5799 && TYPE_ALIGN (cand
) == align
5800 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5801 TYPE_ATTRIBUTES (base
)));
5804 /* Return a version of the TYPE, qualified as indicated by the
5805 TYPE_QUALS, if one exists. If no qualified version exists yet,
5806 return NULL_TREE. */
5809 get_qualified_type (tree type
, int type_quals
)
5813 if (TYPE_QUALS (type
) == type_quals
)
5816 /* Search the chain of variants to see if there is already one there just
5817 like the one we need to have. If so, use that existing one. We must
5818 preserve the TYPE_NAME, since there is code that depends on this. */
5819 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5820 if (check_qualified_type (t
, type
, type_quals
))
5826 /* Like get_qualified_type, but creates the type if it does not
5827 exist. This function never returns NULL_TREE. */
5830 build_qualified_type (tree type
, int type_quals
)
5834 /* See if we already have the appropriate qualified variant. */
5835 t
= get_qualified_type (type
, type_quals
);
5837 /* If not, build it. */
5840 t
= build_variant_type_copy (type
);
5841 set_type_quals (t
, type_quals
);
5843 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5844 /* Propagate structural equality. */
5845 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5846 else if (TYPE_CANONICAL (type
) != type
)
5847 /* Build the underlying canonical type, since it is different
5849 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
5852 /* T is its own canonical type. */
5853 TYPE_CANONICAL (t
) = t
;
5860 /* Create a variant of type T with alignment ALIGN. */
5863 build_aligned_type (tree type
, unsigned int align
)
5867 if (TYPE_PACKED (type
)
5868 || TYPE_ALIGN (type
) == align
)
5871 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5872 if (check_aligned_type (t
, type
, align
))
5875 t
= build_variant_type_copy (type
);
5876 TYPE_ALIGN (t
) = align
;
5881 /* Create a new distinct copy of TYPE. The new type is made its own
5882 MAIN_VARIANT. If TYPE requires structural equality checks, the
5883 resulting type requires structural equality checks; otherwise, its
5884 TYPE_CANONICAL points to itself. */
5887 build_distinct_type_copy (tree type
)
5889 tree t
= copy_node (type
);
5891 TYPE_POINTER_TO (t
) = 0;
5892 TYPE_REFERENCE_TO (t
) = 0;
5894 /* Set the canonical type either to a new equivalence class, or
5895 propagate the need for structural equality checks. */
5896 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5897 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5899 TYPE_CANONICAL (t
) = t
;
5901 /* Make it its own variant. */
5902 TYPE_MAIN_VARIANT (t
) = t
;
5903 TYPE_NEXT_VARIANT (t
) = 0;
5905 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5906 whose TREE_TYPE is not t. This can also happen in the Ada
5907 frontend when using subtypes. */
5912 /* Create a new variant of TYPE, equivalent but distinct. This is so
5913 the caller can modify it. TYPE_CANONICAL for the return type will
5914 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5915 are considered equal by the language itself (or that both types
5916 require structural equality checks). */
5919 build_variant_type_copy (tree type
)
5921 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5923 t
= build_distinct_type_copy (type
);
5925 /* Since we're building a variant, assume that it is a non-semantic
5926 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5927 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5929 /* Add the new type to the chain of variants of TYPE. */
5930 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
5931 TYPE_NEXT_VARIANT (m
) = t
;
5932 TYPE_MAIN_VARIANT (t
) = m
;
5937 /* Return true if the from tree in both tree maps are equal. */
5940 tree_map_base_eq (const void *va
, const void *vb
)
5942 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
5943 *const b
= (const struct tree_map_base
*) vb
;
5944 return (a
->from
== b
->from
);
5947 /* Hash a from tree in a tree_base_map. */
5950 tree_map_base_hash (const void *item
)
5952 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
5955 /* Return true if this tree map structure is marked for garbage collection
5956 purposes. We simply return true if the from tree is marked, so that this
5957 structure goes away when the from tree goes away. */
5960 tree_map_base_marked_p (const void *p
)
5962 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
5965 /* Hash a from tree in a tree_map. */
5968 tree_map_hash (const void *item
)
5970 return (((const struct tree_map
*) item
)->hash
);
5973 /* Hash a from tree in a tree_decl_map. */
5976 tree_decl_map_hash (const void *item
)
5978 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
5981 /* Return the initialization priority for DECL. */
5984 decl_init_priority_lookup (tree decl
)
5986 struct tree_priority_map
*h
;
5987 struct tree_map_base in
;
5989 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
5991 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
5992 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
5995 /* Return the finalization priority for DECL. */
5998 decl_fini_priority_lookup (tree decl
)
6000 struct tree_priority_map
*h
;
6001 struct tree_map_base in
;
6003 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6005 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6006 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6009 /* Return the initialization and finalization priority information for
6010 DECL. If there is no previous priority information, a freshly
6011 allocated structure is returned. */
6013 static struct tree_priority_map
*
6014 decl_priority_info (tree decl
)
6016 struct tree_priority_map in
;
6017 struct tree_priority_map
*h
;
6020 in
.base
.from
= decl
;
6021 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6022 h
= (struct tree_priority_map
*) *loc
;
6025 h
= ggc_alloc_cleared_tree_priority_map ();
6027 h
->base
.from
= decl
;
6028 h
->init
= DEFAULT_INIT_PRIORITY
;
6029 h
->fini
= DEFAULT_INIT_PRIORITY
;
6035 /* Set the initialization priority for DECL to PRIORITY. */
6038 decl_init_priority_insert (tree decl
, priority_type priority
)
6040 struct tree_priority_map
*h
;
6042 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6043 if (priority
== DEFAULT_INIT_PRIORITY
)
6045 h
= decl_priority_info (decl
);
6049 /* Set the finalization priority for DECL to PRIORITY. */
6052 decl_fini_priority_insert (tree decl
, priority_type priority
)
6054 struct tree_priority_map
*h
;
6056 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6057 if (priority
== DEFAULT_INIT_PRIORITY
)
6059 h
= decl_priority_info (decl
);
6063 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6066 print_debug_expr_statistics (void)
6068 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6069 (long) htab_size (debug_expr_for_decl
),
6070 (long) htab_elements (debug_expr_for_decl
),
6071 htab_collisions (debug_expr_for_decl
));
6074 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6077 print_value_expr_statistics (void)
6079 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6080 (long) htab_size (value_expr_for_decl
),
6081 (long) htab_elements (value_expr_for_decl
),
6082 htab_collisions (value_expr_for_decl
));
6085 /* Lookup a debug expression for FROM, and return it if we find one. */
6088 decl_debug_expr_lookup (tree from
)
6090 struct tree_decl_map
*h
, in
;
6091 in
.base
.from
= from
;
6093 h
= (struct tree_decl_map
*)
6094 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6100 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6103 decl_debug_expr_insert (tree from
, tree to
)
6105 struct tree_decl_map
*h
;
6108 h
= ggc_alloc_tree_decl_map ();
6109 h
->base
.from
= from
;
6111 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6113 *(struct tree_decl_map
**) loc
= h
;
6116 /* Lookup a value expression for FROM, and return it if we find one. */
6119 decl_value_expr_lookup (tree from
)
6121 struct tree_decl_map
*h
, in
;
6122 in
.base
.from
= from
;
6124 h
= (struct tree_decl_map
*)
6125 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6131 /* Insert a mapping FROM->TO in the value expression hashtable. */
6134 decl_value_expr_insert (tree from
, tree to
)
6136 struct tree_decl_map
*h
;
6139 h
= ggc_alloc_tree_decl_map ();
6140 h
->base
.from
= from
;
6142 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6144 *(struct tree_decl_map
**) loc
= h
;
6147 /* Lookup a vector of debug arguments for FROM, and return it if we
6151 decl_debug_args_lookup (tree from
)
6153 struct tree_vec_map
*h
, in
;
6155 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6157 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6158 in
.base
.from
= from
;
6159 h
= (struct tree_vec_map
*)
6160 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6166 /* Insert a mapping FROM->empty vector of debug arguments in the value
6167 expression hashtable. */
6170 decl_debug_args_insert (tree from
)
6172 struct tree_vec_map
*h
;
6175 if (DECL_HAS_DEBUG_ARGS_P (from
))
6176 return decl_debug_args_lookup (from
);
6177 if (debug_args_for_decl
== NULL
)
6178 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6179 tree_vec_map_eq
, 0);
6180 h
= ggc_alloc_tree_vec_map ();
6181 h
->base
.from
= from
;
6183 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6185 *(struct tree_vec_map
**) loc
= h
;
6186 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6190 /* Hashing of types so that we don't make duplicates.
6191 The entry point is `type_hash_canon'. */
6193 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6194 with types in the TREE_VALUE slots), by adding the hash codes
6195 of the individual types. */
6198 type_hash_list (const_tree list
, hashval_t hashcode
)
6202 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6203 if (TREE_VALUE (tail
) != error_mark_node
)
6204 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6210 /* These are the Hashtable callback functions. */
6212 /* Returns true iff the types are equivalent. */
6215 type_hash_eq (const void *va
, const void *vb
)
6217 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6218 *const b
= (const struct type_hash
*) vb
;
6220 /* First test the things that are the same for all types. */
6221 if (a
->hash
!= b
->hash
6222 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6223 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6224 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6225 TYPE_ATTRIBUTES (b
->type
))
6226 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6227 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6230 /* Be careful about comparing arrays before and after the element type
6231 has been completed; don't compare TYPE_ALIGN unless both types are
6233 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6234 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6235 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6238 switch (TREE_CODE (a
->type
))
6243 case REFERENCE_TYPE
:
6248 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6251 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6252 && !(TYPE_VALUES (a
->type
)
6253 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6254 && TYPE_VALUES (b
->type
)
6255 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6256 && type_list_equal (TYPE_VALUES (a
->type
),
6257 TYPE_VALUES (b
->type
))))
6260 /* ... fall through ... */
6265 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6266 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6267 TYPE_MAX_VALUE (b
->type
)))
6268 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6269 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6270 TYPE_MIN_VALUE (b
->type
))));
6272 case FIXED_POINT_TYPE
:
6273 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6276 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6279 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6280 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6281 || (TYPE_ARG_TYPES (a
->type
)
6282 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6283 && TYPE_ARG_TYPES (b
->type
)
6284 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6285 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6286 TYPE_ARG_TYPES (b
->type
)))))
6290 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6294 case QUAL_UNION_TYPE
:
6295 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6296 || (TYPE_FIELDS (a
->type
)
6297 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6298 && TYPE_FIELDS (b
->type
)
6299 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6300 && type_list_equal (TYPE_FIELDS (a
->type
),
6301 TYPE_FIELDS (b
->type
))));
6304 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6305 || (TYPE_ARG_TYPES (a
->type
)
6306 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6307 && TYPE_ARG_TYPES (b
->type
)
6308 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6309 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6310 TYPE_ARG_TYPES (b
->type
))))
6318 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6319 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6324 /* Return the cached hash value. */
6327 type_hash_hash (const void *item
)
6329 return ((const struct type_hash
*) item
)->hash
;
6332 /* Look in the type hash table for a type isomorphic to TYPE.
6333 If one is found, return it. Otherwise return 0. */
6336 type_hash_lookup (hashval_t hashcode
, tree type
)
6338 struct type_hash
*h
, in
;
6340 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6341 must call that routine before comparing TYPE_ALIGNs. */
6347 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6354 /* Add an entry to the type-hash-table
6355 for a type TYPE whose hash code is HASHCODE. */
6358 type_hash_add (hashval_t hashcode
, tree type
)
6360 struct type_hash
*h
;
6363 h
= ggc_alloc_type_hash ();
6366 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6370 /* Given TYPE, and HASHCODE its hash code, return the canonical
6371 object for an identical type if one already exists.
6372 Otherwise, return TYPE, and record it as the canonical object.
6374 To use this function, first create a type of the sort you want.
6375 Then compute its hash code from the fields of the type that
6376 make it different from other similar types.
6377 Then call this function and use the value. */
6380 type_hash_canon (unsigned int hashcode
, tree type
)
6384 /* The hash table only contains main variants, so ensure that's what we're
6386 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6388 /* See if the type is in the hash table already. If so, return it.
6389 Otherwise, add the type. */
6390 t1
= type_hash_lookup (hashcode
, type
);
6393 if (GATHER_STATISTICS
)
6395 tree_code_counts
[(int) TREE_CODE (type
)]--;
6396 tree_node_counts
[(int) t_kind
]--;
6397 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6403 type_hash_add (hashcode
, type
);
6408 /* See if the data pointed to by the type hash table is marked. We consider
6409 it marked if the type is marked or if a debug type number or symbol
6410 table entry has been made for the type. */
6413 type_hash_marked_p (const void *p
)
6415 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6417 return ggc_marked_p (type
);
6421 print_type_hash_statistics (void)
6423 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6424 (long) htab_size (type_hash_table
),
6425 (long) htab_elements (type_hash_table
),
6426 htab_collisions (type_hash_table
));
6429 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6430 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6431 by adding the hash codes of the individual attributes. */
6434 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6438 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6439 /* ??? Do we want to add in TREE_VALUE too? */
6440 hashcode
= iterative_hash_object
6441 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6445 /* Given two lists of attributes, return true if list l2 is
6446 equivalent to l1. */
6449 attribute_list_equal (const_tree l1
, const_tree l2
)
6454 return attribute_list_contained (l1
, l2
)
6455 && attribute_list_contained (l2
, l1
);
6458 /* Given two lists of attributes, return true if list L2 is
6459 completely contained within L1. */
6460 /* ??? This would be faster if attribute names were stored in a canonicalized
6461 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6462 must be used to show these elements are equivalent (which they are). */
6463 /* ??? It's not clear that attributes with arguments will always be handled
6467 attribute_list_contained (const_tree l1
, const_tree l2
)
6471 /* First check the obvious, maybe the lists are identical. */
6475 /* Maybe the lists are similar. */
6476 for (t1
= l1
, t2
= l2
;
6478 && get_attribute_name (t1
) == get_attribute_name (t2
)
6479 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6480 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6483 /* Maybe the lists are equal. */
6484 if (t1
== 0 && t2
== 0)
6487 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6490 /* This CONST_CAST is okay because lookup_attribute does not
6491 modify its argument and the return value is assigned to a
6493 for (attr
= lookup_ident_attribute (get_attribute_name (t2
), CONST_CAST_TREE(l1
));
6494 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6495 attr
= lookup_ident_attribute (get_attribute_name (t2
), TREE_CHAIN (attr
)))
6498 if (attr
== NULL_TREE
)
6505 /* Given two lists of types
6506 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6507 return 1 if the lists contain the same types in the same order.
6508 Also, the TREE_PURPOSEs must match. */
6511 type_list_equal (const_tree l1
, const_tree l2
)
6515 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6516 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6517 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6518 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6519 && (TREE_TYPE (TREE_PURPOSE (t1
))
6520 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6526 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6527 given by TYPE. If the argument list accepts variable arguments,
6528 then this function counts only the ordinary arguments. */
6531 type_num_arguments (const_tree type
)
6536 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6537 /* If the function does not take a variable number of arguments,
6538 the last element in the list will have type `void'. */
6539 if (VOID_TYPE_P (TREE_VALUE (t
)))
6547 /* Nonzero if integer constants T1 and T2
6548 represent the same constant value. */
6551 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6556 if (t1
== 0 || t2
== 0)
6559 if (TREE_CODE (t1
) == INTEGER_CST
6560 && TREE_CODE (t2
) == INTEGER_CST
6561 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6562 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6568 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6569 The precise way of comparison depends on their data type. */
6572 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6577 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6579 int t1_sgn
= tree_int_cst_sgn (t1
);
6580 int t2_sgn
= tree_int_cst_sgn (t2
);
6582 if (t1_sgn
< t2_sgn
)
6584 else if (t1_sgn
> t2_sgn
)
6586 /* Otherwise, both are non-negative, so we compare them as
6587 unsigned just in case one of them would overflow a signed
6590 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6591 return INT_CST_LT (t1
, t2
);
6593 return INT_CST_LT_UNSIGNED (t1
, t2
);
6596 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6599 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6601 if (tree_int_cst_lt (t1
, t2
))
6603 else if (tree_int_cst_lt (t2
, t1
))
6609 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6610 the host. If POS is zero, the value can be represented in a single
6611 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6612 be represented in a single unsigned HOST_WIDE_INT. */
6615 host_integerp (const_tree t
, int pos
)
6620 return (TREE_CODE (t
) == INTEGER_CST
6621 && ((TREE_INT_CST_HIGH (t
) == 0
6622 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6623 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6624 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6625 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6626 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6629 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6630 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6631 be non-negative. We must be able to satisfy the above conditions. */
6634 tree_low_cst (const_tree t
, int pos
)
6636 gcc_assert (host_integerp (t
, pos
));
6637 return TREE_INT_CST_LOW (t
);
6640 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6641 kind INTEGER_CST. This makes sure to properly sign-extend the
6645 size_low_cst (const_tree t
)
6647 double_int d
= tree_to_double_int (t
);
6648 return d
.sext (TYPE_PRECISION (TREE_TYPE (t
))).low
;
6651 /* Return the most significant (sign) bit of T. */
6654 tree_int_cst_sign_bit (const_tree t
)
6656 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6657 unsigned HOST_WIDE_INT w
;
6659 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6660 w
= TREE_INT_CST_LOW (t
);
6663 w
= TREE_INT_CST_HIGH (t
);
6664 bitno
-= HOST_BITS_PER_WIDE_INT
;
6667 return (w
>> bitno
) & 1;
6670 /* Return an indication of the sign of the integer constant T.
6671 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6672 Note that -1 will never be returned if T's type is unsigned. */
6675 tree_int_cst_sgn (const_tree t
)
6677 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6679 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6681 else if (TREE_INT_CST_HIGH (t
) < 0)
6687 /* Return the minimum number of bits needed to represent VALUE in a
6688 signed or unsigned type, UNSIGNEDP says which. */
6691 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6693 /* If the value is negative, compute its negative minus 1. The latter
6694 adjustment is because the absolute value of the largest negative value
6695 is one larger than the largest positive value. This is equivalent to
6696 a bit-wise negation, so use that operation instead. */
6698 if (tree_int_cst_sgn (value
) < 0)
6699 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6701 /* Return the number of bits needed, taking into account the fact
6702 that we need one more bit for a signed than unsigned type.
6703 If value is 0 or -1, the minimum precision is 1 no matter
6704 whether unsignedp is true or false. */
6706 if (integer_zerop (value
))
6709 return tree_floor_log2 (value
) + 1 + !unsignedp
;
6712 /* Compare two constructor-element-type constants. Return 1 if the lists
6713 are known to be equal; otherwise return 0. */
6716 simple_cst_list_equal (const_tree l1
, const_tree l2
)
6718 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
6720 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
6723 l1
= TREE_CHAIN (l1
);
6724 l2
= TREE_CHAIN (l2
);
6730 /* Return truthvalue of whether T1 is the same tree structure as T2.
6731 Return 1 if they are the same.
6732 Return 0 if they are understandably different.
6733 Return -1 if either contains tree structure not understood by
6737 simple_cst_equal (const_tree t1
, const_tree t2
)
6739 enum tree_code code1
, code2
;
6745 if (t1
== 0 || t2
== 0)
6748 code1
= TREE_CODE (t1
);
6749 code2
= TREE_CODE (t2
);
6751 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6753 if (CONVERT_EXPR_CODE_P (code2
)
6754 || code2
== NON_LVALUE_EXPR
)
6755 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6757 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6760 else if (CONVERT_EXPR_CODE_P (code2
)
6761 || code2
== NON_LVALUE_EXPR
)
6762 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6770 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6771 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
6774 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
6777 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6780 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6781 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6782 TREE_STRING_LENGTH (t1
)));
6786 unsigned HOST_WIDE_INT idx
;
6787 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6788 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6790 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6793 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6794 /* ??? Should we handle also fields here? */
6795 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6801 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6804 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6807 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6810 const_tree arg1
, arg2
;
6811 const_call_expr_arg_iterator iter1
, iter2
;
6812 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6813 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6815 arg1
= next_const_call_expr_arg (&iter1
),
6816 arg2
= next_const_call_expr_arg (&iter2
))
6818 cmp
= simple_cst_equal (arg1
, arg2
);
6822 return arg1
== arg2
;
6826 /* Special case: if either target is an unallocated VAR_DECL,
6827 it means that it's going to be unified with whatever the
6828 TARGET_EXPR is really supposed to initialize, so treat it
6829 as being equivalent to anything. */
6830 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6831 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6832 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6833 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6834 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6835 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6838 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6843 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6845 case WITH_CLEANUP_EXPR
:
6846 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6850 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6853 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6854 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6868 /* This general rule works for most tree codes. All exceptions should be
6869 handled above. If this is a language-specific tree code, we can't
6870 trust what might be in the operand, so say we don't know
6872 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6875 switch (TREE_CODE_CLASS (code1
))
6879 case tcc_comparison
:
6880 case tcc_expression
:
6884 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6886 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6898 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6899 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6900 than U, respectively. */
6903 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6905 if (tree_int_cst_sgn (t
) < 0)
6907 else if (TREE_INT_CST_HIGH (t
) != 0)
6909 else if (TREE_INT_CST_LOW (t
) == u
)
6911 else if (TREE_INT_CST_LOW (t
) < u
)
6917 /* Return true if SIZE represents a constant size that is in bounds of
6918 what the middle-end and the backend accepts (covering not more than
6919 half of the address-space). */
6922 valid_constant_size_p (const_tree size
)
6924 if (! host_integerp (size
, 1)
6925 || TREE_OVERFLOW (size
)
6926 || tree_int_cst_sign_bit (size
) != 0)
6931 /* Return true if CODE represents an associative tree code. Otherwise
6934 associative_tree_code (enum tree_code code
)
6953 /* Return true if CODE represents a commutative tree code. Otherwise
6956 commutative_tree_code (enum tree_code code
)
6962 case MULT_HIGHPART_EXPR
:
6970 case UNORDERED_EXPR
:
6974 case TRUTH_AND_EXPR
:
6975 case TRUTH_XOR_EXPR
:
6977 case WIDEN_MULT_EXPR
:
6978 case VEC_WIDEN_MULT_HI_EXPR
:
6979 case VEC_WIDEN_MULT_LO_EXPR
:
6980 case VEC_WIDEN_MULT_EVEN_EXPR
:
6981 case VEC_WIDEN_MULT_ODD_EXPR
:
6990 /* Return true if CODE represents a ternary tree code for which the
6991 first two operands are commutative. Otherwise return false. */
6993 commutative_ternary_tree_code (enum tree_code code
)
6997 case WIDEN_MULT_PLUS_EXPR
:
6998 case WIDEN_MULT_MINUS_EXPR
:
7007 /* Generate a hash value for an expression. This can be used iteratively
7008 by passing a previous result as the VAL argument.
7010 This function is intended to produce the same hash for expressions which
7011 would compare equal using operand_equal_p. */
7014 iterative_hash_expr (const_tree t
, hashval_t val
)
7017 enum tree_code code
;
7021 return iterative_hash_hashval_t (0, val
);
7023 code
= TREE_CODE (t
);
7027 /* Alas, constants aren't shared, so we can't rely on pointer
7030 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
7031 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
7034 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7036 return iterative_hash_hashval_t (val2
, val
);
7040 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7042 return iterative_hash_hashval_t (val2
, val
);
7045 return iterative_hash (TREE_STRING_POINTER (t
),
7046 TREE_STRING_LENGTH (t
), val
);
7048 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7049 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7053 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7054 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7058 /* We can just compare by pointer. */
7059 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7060 case PLACEHOLDER_EXPR
:
7061 /* The node itself doesn't matter. */
7064 /* A list of expressions, for a CALL_EXPR or as the elements of a
7066 for (; t
; t
= TREE_CHAIN (t
))
7067 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7071 unsigned HOST_WIDE_INT idx
;
7073 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7075 val
= iterative_hash_expr (field
, val
);
7076 val
= iterative_hash_expr (value
, val
);
7082 /* The type of the second operand is relevant, except for
7083 its top-level qualifiers. */
7084 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7086 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7088 /* We could use the standard hash computation from this point
7090 val
= iterative_hash_object (code
, val
);
7091 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7092 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7096 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7097 Otherwise nodes that compare equal according to operand_equal_p might
7098 get different hash codes. However, don't do this for machine specific
7099 or front end builtins, since the function code is overloaded in those
7101 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7102 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7104 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7105 code
= TREE_CODE (t
);
7109 tclass
= TREE_CODE_CLASS (code
);
7111 if (tclass
== tcc_declaration
)
7113 /* DECL's have a unique ID */
7114 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7118 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7120 val
= iterative_hash_object (code
, val
);
7122 /* Don't hash the type, that can lead to having nodes which
7123 compare equal according to operand_equal_p, but which
7124 have different hash codes. */
7125 if (CONVERT_EXPR_CODE_P (code
)
7126 || code
== NON_LVALUE_EXPR
)
7128 /* Make sure to include signness in the hash computation. */
7129 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7130 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7133 else if (commutative_tree_code (code
))
7135 /* It's a commutative expression. We want to hash it the same
7136 however it appears. We do this by first hashing both operands
7137 and then rehashing based on the order of their independent
7139 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7140 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7144 t
= one
, one
= two
, two
= t
;
7146 val
= iterative_hash_hashval_t (one
, val
);
7147 val
= iterative_hash_hashval_t (two
, val
);
7150 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7151 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7157 /* Generate a hash value for a pair of expressions. This can be used
7158 iteratively by passing a previous result as the VAL argument.
7160 The same hash value is always returned for a given pair of expressions,
7161 regardless of the order in which they are presented. This is useful in
7162 hashing the operands of commutative functions. */
7165 iterative_hash_exprs_commutative (const_tree t1
,
7166 const_tree t2
, hashval_t val
)
7168 hashval_t one
= iterative_hash_expr (t1
, 0);
7169 hashval_t two
= iterative_hash_expr (t2
, 0);
7173 t
= one
, one
= two
, two
= t
;
7174 val
= iterative_hash_hashval_t (one
, val
);
7175 val
= iterative_hash_hashval_t (two
, val
);
7180 /* Constructors for pointer, array and function types.
7181 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7182 constructed by language-dependent code, not here.) */
7184 /* Construct, lay out and return the type of pointers to TO_TYPE with
7185 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7186 reference all of memory. If such a type has already been
7187 constructed, reuse it. */
7190 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7195 if (to_type
== error_mark_node
)
7196 return error_mark_node
;
7198 /* If the pointed-to type has the may_alias attribute set, force
7199 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7200 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7201 can_alias_all
= true;
7203 /* In some cases, languages will have things that aren't a POINTER_TYPE
7204 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7205 In that case, return that type without regard to the rest of our
7208 ??? This is a kludge, but consistent with the way this function has
7209 always operated and there doesn't seem to be a good way to avoid this
7211 if (TYPE_POINTER_TO (to_type
) != 0
7212 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7213 return TYPE_POINTER_TO (to_type
);
7215 /* First, if we already have a type for pointers to TO_TYPE and it's
7216 the proper mode, use it. */
7217 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7218 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7221 t
= make_node (POINTER_TYPE
);
7223 TREE_TYPE (t
) = to_type
;
7224 SET_TYPE_MODE (t
, mode
);
7225 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7226 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7227 TYPE_POINTER_TO (to_type
) = t
;
7229 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7230 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7231 else if (TYPE_CANONICAL (to_type
) != to_type
)
7233 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7234 mode
, can_alias_all
);
7236 /* Lay out the type. This function has many callers that are concerned
7237 with expression-construction, and this simplifies them all. */
7243 /* By default build pointers in ptr_mode. */
7246 build_pointer_type (tree to_type
)
7248 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7249 : TYPE_ADDR_SPACE (to_type
);
7250 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7251 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7254 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7257 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7262 if (to_type
== error_mark_node
)
7263 return error_mark_node
;
7265 /* If the pointed-to type has the may_alias attribute set, force
7266 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7267 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7268 can_alias_all
= true;
7270 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7271 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7272 In that case, return that type without regard to the rest of our
7275 ??? This is a kludge, but consistent with the way this function has
7276 always operated and there doesn't seem to be a good way to avoid this
7278 if (TYPE_REFERENCE_TO (to_type
) != 0
7279 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7280 return TYPE_REFERENCE_TO (to_type
);
7282 /* First, if we already have a type for pointers to TO_TYPE and it's
7283 the proper mode, use it. */
7284 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7285 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7288 t
= make_node (REFERENCE_TYPE
);
7290 TREE_TYPE (t
) = to_type
;
7291 SET_TYPE_MODE (t
, mode
);
7292 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7293 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7294 TYPE_REFERENCE_TO (to_type
) = t
;
7296 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7297 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7298 else if (TYPE_CANONICAL (to_type
) != to_type
)
7300 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7301 mode
, can_alias_all
);
7309 /* Build the node for the type of references-to-TO_TYPE by default
7313 build_reference_type (tree to_type
)
7315 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7316 : TYPE_ADDR_SPACE (to_type
);
7317 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7318 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7321 /* Build a type that is compatible with t but has no cv quals anywhere
7324 const char *const *const * -> char ***. */
7327 build_type_no_quals (tree t
)
7329 switch (TREE_CODE (t
))
7332 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7334 TYPE_REF_CAN_ALIAS_ALL (t
));
7335 case REFERENCE_TYPE
:
7337 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7339 TYPE_REF_CAN_ALIAS_ALL (t
));
7341 return TYPE_MAIN_VARIANT (t
);
7345 #define MAX_INT_CACHED_PREC \
7346 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7347 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7349 /* Builds a signed or unsigned integer type of precision PRECISION.
7350 Used for C bitfields whose precision does not match that of
7351 built-in target types. */
7353 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7359 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7361 if (precision
<= MAX_INT_CACHED_PREC
)
7363 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7368 itype
= make_node (INTEGER_TYPE
);
7369 TYPE_PRECISION (itype
) = precision
;
7372 fixup_unsigned_type (itype
);
7374 fixup_signed_type (itype
);
7377 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7378 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7379 if (precision
<= MAX_INT_CACHED_PREC
)
7380 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7385 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7386 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7387 is true, reuse such a type that has already been constructed. */
7390 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7392 tree itype
= make_node (INTEGER_TYPE
);
7393 hashval_t hashcode
= 0;
7395 TREE_TYPE (itype
) = type
;
7397 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7398 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7400 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7401 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7402 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7403 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7404 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7405 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7410 if ((TYPE_MIN_VALUE (itype
)
7411 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7412 || (TYPE_MAX_VALUE (itype
)
7413 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7415 /* Since we cannot reliably merge this type, we need to compare it using
7416 structural equality checks. */
7417 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7421 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7422 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7423 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7424 itype
= type_hash_canon (hashcode
, itype
);
7429 /* Wrapper around build_range_type_1 with SHARED set to true. */
7432 build_range_type (tree type
, tree lowval
, tree highval
)
7434 return build_range_type_1 (type
, lowval
, highval
, true);
7437 /* Wrapper around build_range_type_1 with SHARED set to false. */
7440 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7442 return build_range_type_1 (type
, lowval
, highval
, false);
7445 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7446 MAXVAL should be the maximum value in the domain
7447 (one less than the length of the array).
7449 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7450 We don't enforce this limit, that is up to caller (e.g. language front end).
7451 The limit exists because the result is a signed type and we don't handle
7452 sizes that use more than one HOST_WIDE_INT. */
7455 build_index_type (tree maxval
)
7457 return build_range_type (sizetype
, size_zero_node
, maxval
);
7460 /* Return true if the debug information for TYPE, a subtype, should be emitted
7461 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7462 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7463 debug info and doesn't reflect the source code. */
7466 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7468 tree base_type
= TREE_TYPE (type
), low
, high
;
7470 /* Subrange types have a base type which is an integral type. */
7471 if (!INTEGRAL_TYPE_P (base_type
))
7474 /* Get the real bounds of the subtype. */
7475 if (lang_hooks
.types
.get_subrange_bounds
)
7476 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7479 low
= TYPE_MIN_VALUE (type
);
7480 high
= TYPE_MAX_VALUE (type
);
7483 /* If the type and its base type have the same representation and the same
7484 name, then the type is not a subrange but a copy of the base type. */
7485 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7486 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7487 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7488 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7489 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7491 tree type_name
= TYPE_NAME (type
);
7492 tree base_type_name
= TYPE_NAME (base_type
);
7494 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7495 type_name
= DECL_NAME (type_name
);
7497 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7498 base_type_name
= DECL_NAME (base_type_name
);
7500 if (type_name
== base_type_name
)
7511 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7512 and number of elements specified by the range of values of INDEX_TYPE.
7513 If SHARED is true, reuse such a type that has already been constructed. */
7516 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7520 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7522 error ("arrays of functions are not meaningful");
7523 elt_type
= integer_type_node
;
7526 t
= make_node (ARRAY_TYPE
);
7527 TREE_TYPE (t
) = elt_type
;
7528 TYPE_DOMAIN (t
) = index_type
;
7529 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7532 /* If the element type is incomplete at this point we get marked for
7533 structural equality. Do not record these types in the canonical
7535 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7540 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7542 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7543 t
= type_hash_canon (hashcode
, t
);
7546 if (TYPE_CANONICAL (t
) == t
)
7548 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7549 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7550 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7551 else if (TYPE_CANONICAL (elt_type
) != elt_type
7552 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7554 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7556 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7563 /* Wrapper around build_array_type_1 with SHARED set to true. */
7566 build_array_type (tree elt_type
, tree index_type
)
7568 return build_array_type_1 (elt_type
, index_type
, true);
7571 /* Wrapper around build_array_type_1 with SHARED set to false. */
7574 build_nonshared_array_type (tree elt_type
, tree index_type
)
7576 return build_array_type_1 (elt_type
, index_type
, false);
7579 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7583 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7585 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7588 /* Recursively examines the array elements of TYPE, until a non-array
7589 element type is found. */
7592 strip_array_types (tree type
)
7594 while (TREE_CODE (type
) == ARRAY_TYPE
)
7595 type
= TREE_TYPE (type
);
7600 /* Computes the canonical argument types from the argument type list
7603 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7604 on entry to this function, or if any of the ARGTYPES are
7607 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7608 true on entry to this function, or if any of the ARGTYPES are
7611 Returns a canonical argument list, which may be ARGTYPES when the
7612 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7613 true) or would not differ from ARGTYPES. */
7616 maybe_canonicalize_argtypes(tree argtypes
,
7617 bool *any_structural_p
,
7618 bool *any_noncanonical_p
)
7621 bool any_noncanonical_argtypes_p
= false;
7623 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7625 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7626 /* Fail gracefully by stating that the type is structural. */
7627 *any_structural_p
= true;
7628 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7629 *any_structural_p
= true;
7630 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7631 || TREE_PURPOSE (arg
))
7632 /* If the argument has a default argument, we consider it
7633 non-canonical even though the type itself is canonical.
7634 That way, different variants of function and method types
7635 with default arguments will all point to the variant with
7636 no defaults as their canonical type. */
7637 any_noncanonical_argtypes_p
= true;
7640 if (*any_structural_p
)
7643 if (any_noncanonical_argtypes_p
)
7645 /* Build the canonical list of argument types. */
7646 tree canon_argtypes
= NULL_TREE
;
7647 bool is_void
= false;
7649 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7651 if (arg
== void_list_node
)
7654 canon_argtypes
= tree_cons (NULL_TREE
,
7655 TYPE_CANONICAL (TREE_VALUE (arg
)),
7659 canon_argtypes
= nreverse (canon_argtypes
);
7661 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7663 /* There is a non-canonical type. */
7664 *any_noncanonical_p
= true;
7665 return canon_argtypes
;
7668 /* The canonical argument types are the same as ARGTYPES. */
7672 /* Construct, lay out and return
7673 the type of functions returning type VALUE_TYPE
7674 given arguments of types ARG_TYPES.
7675 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7676 are data type nodes for the arguments of the function.
7677 If such a type has already been constructed, reuse it. */
7680 build_function_type (tree value_type
, tree arg_types
)
7683 hashval_t hashcode
= 0;
7684 bool any_structural_p
, any_noncanonical_p
;
7685 tree canon_argtypes
;
7687 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7689 error ("function return type cannot be function");
7690 value_type
= integer_type_node
;
7693 /* Make a node of the sort we want. */
7694 t
= make_node (FUNCTION_TYPE
);
7695 TREE_TYPE (t
) = value_type
;
7696 TYPE_ARG_TYPES (t
) = arg_types
;
7698 /* If we already have such a type, use the old one. */
7699 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
7700 hashcode
= type_hash_list (arg_types
, hashcode
);
7701 t
= type_hash_canon (hashcode
, t
);
7703 /* Set up the canonical type. */
7704 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7705 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7706 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7708 &any_noncanonical_p
);
7709 if (any_structural_p
)
7710 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7711 else if (any_noncanonical_p
)
7712 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7715 if (!COMPLETE_TYPE_P (t
))
7720 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
7721 return value if SKIP_RETURN is true. */
7724 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
7727 tree new_type
= NULL
;
7728 tree args
, new_args
= NULL
, t
;
7732 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
7733 args
= TREE_CHAIN (args
), i
++)
7734 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
7735 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
7737 new_reversed
= nreverse (new_args
);
7741 TREE_CHAIN (new_args
) = void_list_node
;
7743 new_reversed
= void_list_node
;
7746 /* Use copy_node to preserve as much as possible from original type
7747 (debug info, attribute lists etc.)
7748 Exception is METHOD_TYPEs must have THIS argument.
7749 When we are asked to remove it, we need to build new FUNCTION_TYPE
7751 if (TREE_CODE (orig_type
) != METHOD_TYPE
7753 || !bitmap_bit_p (args_to_skip
, 0))
7755 new_type
= build_distinct_type_copy (orig_type
);
7756 TYPE_ARG_TYPES (new_type
) = new_reversed
;
7761 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
7763 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
7767 TREE_TYPE (new_type
) = void_type_node
;
7769 /* This is a new type, not a copy of an old type. Need to reassociate
7770 variants. We can handle everything except the main variant lazily. */
7771 t
= TYPE_MAIN_VARIANT (orig_type
);
7774 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
7775 TYPE_MAIN_VARIANT (new_type
) = t
;
7776 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
7777 TYPE_NEXT_VARIANT (t
) = new_type
;
7781 TYPE_MAIN_VARIANT (new_type
) = new_type
;
7782 TYPE_NEXT_VARIANT (new_type
) = NULL
;
7788 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
7789 return value if SKIP_RETURN is true.
7791 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
7792 linked by TREE_CHAIN directly. The caller is responsible for eliminating
7793 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
7796 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
7799 tree new_decl
= copy_node (orig_decl
);
7802 new_type
= TREE_TYPE (orig_decl
);
7803 if (prototype_p (new_type
)
7804 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
7806 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
7807 TREE_TYPE (new_decl
) = new_type
;
7809 /* For declarations setting DECL_VINDEX (i.e. methods)
7810 we expect first argument to be THIS pointer. */
7811 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
7812 DECL_VINDEX (new_decl
) = NULL_TREE
;
7814 /* When signature changes, we need to clear builtin info. */
7815 if (DECL_BUILT_IN (new_decl
)
7817 && !bitmap_empty_p (args_to_skip
))
7819 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
7820 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
7825 /* Build a function type. The RETURN_TYPE is the type returned by the
7826 function. If VAARGS is set, no void_type_node is appended to the
7827 the list. ARGP must be always be terminated be a NULL_TREE. */
7830 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7834 t
= va_arg (argp
, tree
);
7835 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7836 args
= tree_cons (NULL_TREE
, t
, args
);
7841 if (args
!= NULL_TREE
)
7842 args
= nreverse (args
);
7843 gcc_assert (last
!= void_list_node
);
7845 else if (args
== NULL_TREE
)
7846 args
= void_list_node
;
7850 args
= nreverse (args
);
7851 TREE_CHAIN (last
) = void_list_node
;
7853 args
= build_function_type (return_type
, args
);
7858 /* Build a function type. The RETURN_TYPE is the type returned by the
7859 function. If additional arguments are provided, they are
7860 additional argument types. The list of argument types must always
7861 be terminated by NULL_TREE. */
7864 build_function_type_list (tree return_type
, ...)
7869 va_start (p
, return_type
);
7870 args
= build_function_type_list_1 (false, return_type
, p
);
7875 /* Build a variable argument function type. The RETURN_TYPE is the
7876 type returned by the function. If additional arguments are provided,
7877 they are additional argument types. The list of argument types must
7878 always be terminated by NULL_TREE. */
7881 build_varargs_function_type_list (tree return_type
, ...)
7886 va_start (p
, return_type
);
7887 args
= build_function_type_list_1 (true, return_type
, p
);
7893 /* Build a function type. RETURN_TYPE is the type returned by the
7894 function; VAARGS indicates whether the function takes varargs. The
7895 function takes N named arguments, the types of which are provided in
7899 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7903 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7905 for (i
= n
- 1; i
>= 0; i
--)
7906 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7908 return build_function_type (return_type
, t
);
7911 /* Build a function type. RETURN_TYPE is the type returned by the
7912 function. The function takes N named arguments, the types of which
7913 are provided in ARG_TYPES. */
7916 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7918 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7921 /* Build a variable argument function type. RETURN_TYPE is the type
7922 returned by the function. The function takes N named arguments, the
7923 types of which are provided in ARG_TYPES. */
7926 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7928 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7931 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7932 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7933 for the method. An implicit additional parameter (of type
7934 pointer-to-BASETYPE) is added to the ARGTYPES. */
7937 build_method_type_directly (tree basetype
,
7944 bool any_structural_p
, any_noncanonical_p
;
7945 tree canon_argtypes
;
7947 /* Make a node of the sort we want. */
7948 t
= make_node (METHOD_TYPE
);
7950 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7951 TREE_TYPE (t
) = rettype
;
7952 ptype
= build_pointer_type (basetype
);
7954 /* The actual arglist for this function includes a "hidden" argument
7955 which is "this". Put it into the list of argument types. */
7956 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7957 TYPE_ARG_TYPES (t
) = argtypes
;
7959 /* If we already have such a type, use the old one. */
7960 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
7961 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
7962 hashcode
= type_hash_list (argtypes
, hashcode
);
7963 t
= type_hash_canon (hashcode
, t
);
7965 /* Set up the canonical type. */
7967 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7968 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7970 = (TYPE_CANONICAL (basetype
) != basetype
7971 || TYPE_CANONICAL (rettype
) != rettype
);
7972 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7974 &any_noncanonical_p
);
7975 if (any_structural_p
)
7976 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7977 else if (any_noncanonical_p
)
7979 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7980 TYPE_CANONICAL (rettype
),
7982 if (!COMPLETE_TYPE_P (t
))
7988 /* Construct, lay out and return the type of methods belonging to class
7989 BASETYPE and whose arguments and values are described by TYPE.
7990 If that type exists already, reuse it.
7991 TYPE must be a FUNCTION_TYPE node. */
7994 build_method_type (tree basetype
, tree type
)
7996 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7998 return build_method_type_directly (basetype
,
8000 TYPE_ARG_TYPES (type
));
8003 /* Construct, lay out and return the type of offsets to a value
8004 of type TYPE, within an object of type BASETYPE.
8005 If a suitable offset type exists already, reuse it. */
8008 build_offset_type (tree basetype
, tree type
)
8011 hashval_t hashcode
= 0;
8013 /* Make a node of the sort we want. */
8014 t
= make_node (OFFSET_TYPE
);
8016 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8017 TREE_TYPE (t
) = type
;
8019 /* If we already have such a type, use the old one. */
8020 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8021 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8022 t
= type_hash_canon (hashcode
, t
);
8024 if (!COMPLETE_TYPE_P (t
))
8027 if (TYPE_CANONICAL (t
) == t
)
8029 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8030 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8031 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8032 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8033 || TYPE_CANONICAL (type
) != type
)
8035 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8036 TYPE_CANONICAL (type
));
8042 /* Create a complex type whose components are COMPONENT_TYPE. */
8045 build_complex_type (tree component_type
)
8050 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8051 || SCALAR_FLOAT_TYPE_P (component_type
)
8052 || FIXED_POINT_TYPE_P (component_type
));
8054 /* Make a node of the sort we want. */
8055 t
= make_node (COMPLEX_TYPE
);
8057 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8059 /* If we already have such a type, use the old one. */
8060 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8061 t
= type_hash_canon (hashcode
, t
);
8063 if (!COMPLETE_TYPE_P (t
))
8066 if (TYPE_CANONICAL (t
) == t
)
8068 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8069 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8070 else if (TYPE_CANONICAL (component_type
) != component_type
)
8072 = build_complex_type (TYPE_CANONICAL (component_type
));
8075 /* We need to create a name, since complex is a fundamental type. */
8076 if (! TYPE_NAME (t
))
8079 if (component_type
== char_type_node
)
8080 name
= "complex char";
8081 else if (component_type
== signed_char_type_node
)
8082 name
= "complex signed char";
8083 else if (component_type
== unsigned_char_type_node
)
8084 name
= "complex unsigned char";
8085 else if (component_type
== short_integer_type_node
)
8086 name
= "complex short int";
8087 else if (component_type
== short_unsigned_type_node
)
8088 name
= "complex short unsigned int";
8089 else if (component_type
== integer_type_node
)
8090 name
= "complex int";
8091 else if (component_type
== unsigned_type_node
)
8092 name
= "complex unsigned int";
8093 else if (component_type
== long_integer_type_node
)
8094 name
= "complex long int";
8095 else if (component_type
== long_unsigned_type_node
)
8096 name
= "complex long unsigned int";
8097 else if (component_type
== long_long_integer_type_node
)
8098 name
= "complex long long int";
8099 else if (component_type
== long_long_unsigned_type_node
)
8100 name
= "complex long long unsigned int";
8105 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8106 get_identifier (name
), t
);
8109 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8112 /* If TYPE is a real or complex floating-point type and the target
8113 does not directly support arithmetic on TYPE then return the wider
8114 type to be used for arithmetic on TYPE. Otherwise, return
8118 excess_precision_type (tree type
)
8120 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8122 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8123 switch (TREE_CODE (type
))
8126 switch (flt_eval_method
)
8129 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8130 return double_type_node
;
8133 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8134 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8135 return long_double_type_node
;
8142 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8144 switch (flt_eval_method
)
8147 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8148 return complex_double_type_node
;
8151 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8152 || (TYPE_MODE (TREE_TYPE (type
))
8153 == TYPE_MODE (double_type_node
)))
8154 return complex_long_double_type_node
;
8167 /* Return OP, stripped of any conversions to wider types as much as is safe.
8168 Converting the value back to OP's type makes a value equivalent to OP.
8170 If FOR_TYPE is nonzero, we return a value which, if converted to
8171 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8173 OP must have integer, real or enumeral type. Pointers are not allowed!
8175 There are some cases where the obvious value we could return
8176 would regenerate to OP if converted to OP's type,
8177 but would not extend like OP to wider types.
8178 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8179 For example, if OP is (unsigned short)(signed char)-1,
8180 we avoid returning (signed char)-1 if FOR_TYPE is int,
8181 even though extending that to an unsigned short would regenerate OP,
8182 since the result of extending (signed char)-1 to (int)
8183 is different from (int) OP. */
8186 get_unwidened (tree op
, tree for_type
)
8188 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8189 tree type
= TREE_TYPE (op
);
8191 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8193 = (for_type
!= 0 && for_type
!= type
8194 && final_prec
> TYPE_PRECISION (type
)
8195 && TYPE_UNSIGNED (type
));
8198 while (CONVERT_EXPR_P (op
))
8202 /* TYPE_PRECISION on vector types has different meaning
8203 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8204 so avoid them here. */
8205 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8208 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8209 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8211 /* Truncations are many-one so cannot be removed.
8212 Unless we are later going to truncate down even farther. */
8214 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8217 /* See what's inside this conversion. If we decide to strip it,
8219 op
= TREE_OPERAND (op
, 0);
8221 /* If we have not stripped any zero-extensions (uns is 0),
8222 we can strip any kind of extension.
8223 If we have previously stripped a zero-extension,
8224 only zero-extensions can safely be stripped.
8225 Any extension can be stripped if the bits it would produce
8226 are all going to be discarded later by truncating to FOR_TYPE. */
8230 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8232 /* TYPE_UNSIGNED says whether this is a zero-extension.
8233 Let's avoid computing it if it does not affect WIN
8234 and if UNS will not be needed again. */
8236 || CONVERT_EXPR_P (op
))
8237 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8245 /* If we finally reach a constant see if it fits in for_type and
8246 in that case convert it. */
8248 && TREE_CODE (win
) == INTEGER_CST
8249 && TREE_TYPE (win
) != for_type
8250 && int_fits_type_p (win
, for_type
))
8251 win
= fold_convert (for_type
, win
);
8256 /* Return OP or a simpler expression for a narrower value
8257 which can be sign-extended or zero-extended to give back OP.
8258 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8259 or 0 if the value should be sign-extended. */
8262 get_narrower (tree op
, int *unsignedp_ptr
)
8267 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8269 while (TREE_CODE (op
) == NOP_EXPR
)
8272 = (TYPE_PRECISION (TREE_TYPE (op
))
8273 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8275 /* Truncations are many-one so cannot be removed. */
8279 /* See what's inside this conversion. If we decide to strip it,
8284 op
= TREE_OPERAND (op
, 0);
8285 /* An extension: the outermost one can be stripped,
8286 but remember whether it is zero or sign extension. */
8288 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8289 /* Otherwise, if a sign extension has been stripped,
8290 only sign extensions can now be stripped;
8291 if a zero extension has been stripped, only zero-extensions. */
8292 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8296 else /* bitschange == 0 */
8298 /* A change in nominal type can always be stripped, but we must
8299 preserve the unsignedness. */
8301 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8303 op
= TREE_OPERAND (op
, 0);
8304 /* Keep trying to narrow, but don't assign op to win if it
8305 would turn an integral type into something else. */
8306 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8313 if (TREE_CODE (op
) == COMPONENT_REF
8314 /* Since type_for_size always gives an integer type. */
8315 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8316 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8317 /* Ensure field is laid out already. */
8318 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8319 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8321 unsigned HOST_WIDE_INT innerprec
8322 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8323 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8324 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8325 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8327 /* We can get this structure field in a narrower type that fits it,
8328 but the resulting extension to its nominal type (a fullword type)
8329 must satisfy the same conditions as for other extensions.
8331 Do this only for fields that are aligned (not bit-fields),
8332 because when bit-field insns will be used there is no
8333 advantage in doing this. */
8335 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8336 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8337 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8341 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8342 win
= fold_convert (type
, op
);
8346 *unsignedp_ptr
= uns
;
8350 /* Returns true if integer constant C has a value that is permissible
8351 for type TYPE (an INTEGER_TYPE). */
8354 int_fits_type_p (const_tree c
, const_tree type
)
8356 tree type_low_bound
, type_high_bound
;
8357 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8360 dc
= tree_to_double_int (c
);
8361 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8364 type_low_bound
= TYPE_MIN_VALUE (type
);
8365 type_high_bound
= TYPE_MAX_VALUE (type
);
8367 /* If at least one bound of the type is a constant integer, we can check
8368 ourselves and maybe make a decision. If no such decision is possible, but
8369 this type is a subtype, try checking against that. Otherwise, use
8370 double_int_fits_to_tree_p, which checks against the precision.
8372 Compute the status for each possibly constant bound, and return if we see
8373 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8374 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8375 for "constant known to fit". */
8377 /* Check if c >= type_low_bound. */
8378 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8380 dd
= tree_to_double_int (type_low_bound
);
8381 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8383 int c_neg
= (!unsc
&& dc
.is_negative ());
8384 int t_neg
= (unsc
&& dd
.is_negative ());
8386 if (c_neg
&& !t_neg
)
8388 if ((c_neg
|| !t_neg
) && dc
.ult (dd
))
8391 else if (dc
.cmp (dd
, unsc
) < 0)
8393 ok_for_low_bound
= true;
8396 ok_for_low_bound
= false;
8398 /* Check if c <= type_high_bound. */
8399 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8401 dd
= tree_to_double_int (type_high_bound
);
8402 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8404 int c_neg
= (!unsc
&& dc
.is_negative ());
8405 int t_neg
= (unsc
&& dd
.is_negative ());
8407 if (t_neg
&& !c_neg
)
8409 if ((t_neg
|| !c_neg
) && dc
.ugt (dd
))
8412 else if (dc
.cmp (dd
, unsc
) > 0)
8414 ok_for_high_bound
= true;
8417 ok_for_high_bound
= false;
8419 /* If the constant fits both bounds, the result is known. */
8420 if (ok_for_low_bound
&& ok_for_high_bound
)
8423 /* Perform some generic filtering which may allow making a decision
8424 even if the bounds are not constant. First, negative integers
8425 never fit in unsigned types, */
8426 if (TYPE_UNSIGNED (type
) && !unsc
&& dc
.is_negative ())
8429 /* Second, narrower types always fit in wider ones. */
8430 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8433 /* Third, unsigned integers with top bit set never fit signed types. */
8434 if (! TYPE_UNSIGNED (type
) && unsc
)
8436 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8437 if (prec
< HOST_BITS_PER_WIDE_INT
)
8439 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8442 else if (((((unsigned HOST_WIDE_INT
) 1)
8443 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8447 /* If we haven't been able to decide at this point, there nothing more we
8448 can check ourselves here. Look at the base type if we have one and it
8449 has the same precision. */
8450 if (TREE_CODE (type
) == INTEGER_TYPE
8451 && TREE_TYPE (type
) != 0
8452 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8454 type
= TREE_TYPE (type
);
8458 /* Or to double_int_fits_to_tree_p, if nothing else. */
8459 return double_int_fits_to_tree_p (type
, dc
);
8462 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8463 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8464 represented (assuming two's-complement arithmetic) within the bit
8465 precision of the type are returned instead. */
8468 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8470 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8471 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8472 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8473 TYPE_UNSIGNED (type
));
8476 if (TYPE_UNSIGNED (type
))
8477 mpz_set_ui (min
, 0);
8481 mn
= double_int::mask (TYPE_PRECISION (type
) - 1);
8482 mn
= (mn
+ double_int_one
).sext (TYPE_PRECISION (type
));
8483 mpz_set_double_int (min
, mn
, false);
8487 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8488 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8489 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8490 TYPE_UNSIGNED (type
));
8493 if (TYPE_UNSIGNED (type
))
8494 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
)),
8497 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
) - 1),
8502 /* Return true if VAR is an automatic variable defined in function FN. */
8505 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8507 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8508 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8509 || TREE_CODE (var
) == PARM_DECL
)
8510 && ! TREE_STATIC (var
))
8511 || TREE_CODE (var
) == LABEL_DECL
8512 || TREE_CODE (var
) == RESULT_DECL
));
8515 /* Subprogram of following function. Called by walk_tree.
8517 Return *TP if it is an automatic variable or parameter of the
8518 function passed in as DATA. */
8521 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8523 tree fn
= (tree
) data
;
8528 else if (DECL_P (*tp
)
8529 && auto_var_in_fn_p (*tp
, fn
))
8535 /* Returns true if T is, contains, or refers to a type with variable
8536 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8537 arguments, but not the return type. If FN is nonzero, only return
8538 true if a modifier of the type or position of FN is a variable or
8539 parameter inside FN.
8541 This concept is more general than that of C99 'variably modified types':
8542 in C99, a struct type is never variably modified because a VLA may not
8543 appear as a structure member. However, in GNU C code like:
8545 struct S { int i[f()]; };
8547 is valid, and other languages may define similar constructs. */
8550 variably_modified_type_p (tree type
, tree fn
)
8554 /* Test if T is either variable (if FN is zero) or an expression containing
8555 a variable in FN. If TYPE isn't gimplified, return true also if
8556 gimplify_one_sizepos would gimplify the expression into a local
8558 #define RETURN_TRUE_IF_VAR(T) \
8559 do { tree _t = (T); \
8560 if (_t != NULL_TREE \
8561 && _t != error_mark_node \
8562 && TREE_CODE (_t) != INTEGER_CST \
8563 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8565 || (!TYPE_SIZES_GIMPLIFIED (type) \
8566 && !is_gimple_sizepos (_t)) \
8567 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8568 return true; } while (0)
8570 if (type
== error_mark_node
)
8573 /* If TYPE itself has variable size, it is variably modified. */
8574 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8575 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8577 switch (TREE_CODE (type
))
8580 case REFERENCE_TYPE
:
8582 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8588 /* If TYPE is a function type, it is variably modified if the
8589 return type is variably modified. */
8590 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8596 case FIXED_POINT_TYPE
:
8599 /* Scalar types are variably modified if their end points
8601 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8602 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8607 case QUAL_UNION_TYPE
:
8608 /* We can't see if any of the fields are variably-modified by the
8609 definition we normally use, since that would produce infinite
8610 recursion via pointers. */
8611 /* This is variably modified if some field's type is. */
8612 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8613 if (TREE_CODE (t
) == FIELD_DECL
)
8615 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8616 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8617 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8619 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8620 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8625 /* Do not call ourselves to avoid infinite recursion. This is
8626 variably modified if the element type is. */
8627 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8628 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8635 /* The current language may have other cases to check, but in general,
8636 all other types are not variably modified. */
8637 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8639 #undef RETURN_TRUE_IF_VAR
8642 /* Given a DECL or TYPE, return the scope in which it was declared, or
8643 NULL_TREE if there is no containing scope. */
8646 get_containing_scope (const_tree t
)
8648 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8651 /* Return the innermost context enclosing DECL that is
8652 a FUNCTION_DECL, or zero if none. */
8655 decl_function_context (const_tree decl
)
8659 if (TREE_CODE (decl
) == ERROR_MARK
)
8662 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8663 where we look up the function at runtime. Such functions always take
8664 a first argument of type 'pointer to real context'.
8666 C++ should really be fixed to use DECL_CONTEXT for the real context,
8667 and use something else for the "virtual context". */
8668 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8671 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8673 context
= DECL_CONTEXT (decl
);
8675 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8677 if (TREE_CODE (context
) == BLOCK
)
8678 context
= BLOCK_SUPERCONTEXT (context
);
8680 context
= get_containing_scope (context
);
8686 /* Return the innermost context enclosing DECL that is
8687 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8688 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8691 decl_type_context (const_tree decl
)
8693 tree context
= DECL_CONTEXT (decl
);
8696 switch (TREE_CODE (context
))
8698 case NAMESPACE_DECL
:
8699 case TRANSLATION_UNIT_DECL
:
8704 case QUAL_UNION_TYPE
:
8709 context
= DECL_CONTEXT (context
);
8713 context
= BLOCK_SUPERCONTEXT (context
);
8723 /* CALL is a CALL_EXPR. Return the declaration for the function
8724 called, or NULL_TREE if the called function cannot be
8728 get_callee_fndecl (const_tree call
)
8732 if (call
== error_mark_node
)
8733 return error_mark_node
;
8735 /* It's invalid to call this function with anything but a
8737 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8739 /* The first operand to the CALL is the address of the function
8741 addr
= CALL_EXPR_FN (call
);
8745 /* If this is a readonly function pointer, extract its initial value. */
8746 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8747 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8748 && DECL_INITIAL (addr
))
8749 addr
= DECL_INITIAL (addr
);
8751 /* If the address is just `&f' for some function `f', then we know
8752 that `f' is being called. */
8753 if (TREE_CODE (addr
) == ADDR_EXPR
8754 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8755 return TREE_OPERAND (addr
, 0);
8757 /* We couldn't figure out what was being called. */
8761 /* Print debugging information about tree nodes generated during the compile,
8762 and any language-specific information. */
8765 dump_tree_statistics (void)
8767 if (GATHER_STATISTICS
)
8770 int total_nodes
, total_bytes
;
8771 fprintf (stderr
, "Kind Nodes Bytes\n");
8772 fprintf (stderr
, "---------------------------------------\n");
8773 total_nodes
= total_bytes
= 0;
8774 for (i
= 0; i
< (int) all_kinds
; i
++)
8776 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8777 tree_node_counts
[i
], tree_node_sizes
[i
]);
8778 total_nodes
+= tree_node_counts
[i
];
8779 total_bytes
+= tree_node_sizes
[i
];
8781 fprintf (stderr
, "---------------------------------------\n");
8782 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8783 fprintf (stderr
, "---------------------------------------\n");
8784 fprintf (stderr
, "Code Nodes\n");
8785 fprintf (stderr
, "----------------------------\n");
8786 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8787 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
8788 fprintf (stderr
, "----------------------------\n");
8789 ssanames_print_statistics ();
8790 phinodes_print_statistics ();
8793 fprintf (stderr
, "(No per-node statistics)\n");
8795 print_type_hash_statistics ();
8796 print_debug_expr_statistics ();
8797 print_value_expr_statistics ();
8798 lang_hooks
.print_statistics ();
8801 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8803 /* Generate a crc32 of a byte. */
8806 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
8810 for (ix
= bits
; ix
--; value
<<= 1)
8814 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
8821 /* Generate a crc32 of a 32-bit unsigned. */
8824 crc32_unsigned (unsigned chksum
, unsigned value
)
8826 return crc32_unsigned_bits (chksum
, value
, 32);
8829 /* Generate a crc32 of a byte. */
8832 crc32_byte (unsigned chksum
, char byte
)
8834 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
8837 /* Generate a crc32 of a string. */
8840 crc32_string (unsigned chksum
, const char *string
)
8844 chksum
= crc32_byte (chksum
, *string
);
8850 /* P is a string that will be used in a symbol. Mask out any characters
8851 that are not valid in that context. */
8854 clean_symbol_name (char *p
)
8858 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8861 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8868 /* Generate a name for a special-purpose function.
8869 The generated name may need to be unique across the whole link.
8870 Changes to this function may also require corresponding changes to
8871 xstrdup_mask_random.
8872 TYPE is some string to identify the purpose of this function to the
8873 linker or collect2; it must start with an uppercase letter,
8875 I - for constructors
8877 N - for C++ anonymous namespaces
8878 F - for DWARF unwind frame information. */
8881 get_file_function_name (const char *type
)
8887 /* If we already have a name we know to be unique, just use that. */
8888 if (first_global_object_name
)
8889 p
= q
= ASTRDUP (first_global_object_name
);
8890 /* If the target is handling the constructors/destructors, they
8891 will be local to this file and the name is only necessary for
8893 We also assign sub_I and sub_D sufixes to constructors called from
8894 the global static constructors. These are always local. */
8895 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8896 || (strncmp (type
, "sub_", 4) == 0
8897 && (type
[4] == 'I' || type
[4] == 'D')))
8899 const char *file
= main_input_filename
;
8901 file
= input_filename
;
8902 /* Just use the file's basename, because the full pathname
8903 might be quite long. */
8904 p
= q
= ASTRDUP (lbasename (file
));
8908 /* Otherwise, the name must be unique across the entire link.
8909 We don't have anything that we know to be unique to this translation
8910 unit, so use what we do have and throw in some randomness. */
8912 const char *name
= weak_global_object_name
;
8913 const char *file
= main_input_filename
;
8918 file
= input_filename
;
8920 len
= strlen (file
);
8921 q
= (char *) alloca (9 + 17 + len
+ 1);
8922 memcpy (q
, file
, len
+ 1);
8924 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
8925 crc32_string (0, name
), get_random_seed (false));
8930 clean_symbol_name (q
);
8931 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
8934 /* Set up the name of the file-level functions we may need.
8935 Use a global object (which is already required to be unique over
8936 the program) rather than the file name (which imposes extra
8938 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
8940 return get_identifier (buf
);
8943 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
8945 /* Complain that the tree code of NODE does not match the expected 0
8946 terminated list of trailing codes. The trailing code list can be
8947 empty, for a more vague error message. FILE, LINE, and FUNCTION
8948 are of the caller. */
8951 tree_check_failed (const_tree node
, const char *file
,
8952 int line
, const char *function
, ...)
8956 unsigned length
= 0;
8959 va_start (args
, function
);
8960 while ((code
= va_arg (args
, int)))
8961 length
+= 4 + strlen (tree_code_name
[code
]);
8966 va_start (args
, function
);
8967 length
+= strlen ("expected ");
8968 buffer
= tmp
= (char *) alloca (length
);
8970 while ((code
= va_arg (args
, int)))
8972 const char *prefix
= length
? " or " : "expected ";
8974 strcpy (tmp
+ length
, prefix
);
8975 length
+= strlen (prefix
);
8976 strcpy (tmp
+ length
, tree_code_name
[code
]);
8977 length
+= strlen (tree_code_name
[code
]);
8982 buffer
= "unexpected node";
8984 internal_error ("tree check: %s, have %s in %s, at %s:%d",
8985 buffer
, tree_code_name
[TREE_CODE (node
)],
8986 function
, trim_filename (file
), line
);
8989 /* Complain that the tree code of NODE does match the expected 0
8990 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
8994 tree_not_check_failed (const_tree node
, const char *file
,
8995 int line
, const char *function
, ...)
8999 unsigned length
= 0;
9002 va_start (args
, function
);
9003 while ((code
= va_arg (args
, int)))
9004 length
+= 4 + strlen (tree_code_name
[code
]);
9006 va_start (args
, function
);
9007 buffer
= (char *) alloca (length
);
9009 while ((code
= va_arg (args
, int)))
9013 strcpy (buffer
+ length
, " or ");
9016 strcpy (buffer
+ length
, tree_code_name
[code
]);
9017 length
+= strlen (tree_code_name
[code
]);
9021 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9022 buffer
, tree_code_name
[TREE_CODE (node
)],
9023 function
, trim_filename (file
), line
);
9026 /* Similar to tree_check_failed, except that we check for a class of tree
9027 code, given in CL. */
9030 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9031 const char *file
, int line
, const char *function
)
9034 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9035 TREE_CODE_CLASS_STRING (cl
),
9036 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9037 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9040 /* Similar to tree_check_failed, except that instead of specifying a
9041 dozen codes, use the knowledge that they're all sequential. */
9044 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9045 const char *function
, enum tree_code c1
,
9049 unsigned length
= 0;
9052 for (c
= c1
; c
<= c2
; ++c
)
9053 length
+= 4 + strlen (tree_code_name
[c
]);
9055 length
+= strlen ("expected ");
9056 buffer
= (char *) alloca (length
);
9059 for (c
= c1
; c
<= c2
; ++c
)
9061 const char *prefix
= length
? " or " : "expected ";
9063 strcpy (buffer
+ length
, prefix
);
9064 length
+= strlen (prefix
);
9065 strcpy (buffer
+ length
, tree_code_name
[c
]);
9066 length
+= strlen (tree_code_name
[c
]);
9069 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9070 buffer
, tree_code_name
[TREE_CODE (node
)],
9071 function
, trim_filename (file
), line
);
9075 /* Similar to tree_check_failed, except that we check that a tree does
9076 not have the specified code, given in CL. */
9079 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9080 const char *file
, int line
, const char *function
)
9083 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9084 TREE_CODE_CLASS_STRING (cl
),
9085 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9086 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9090 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9093 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9094 const char *function
, enum omp_clause_code code
)
9096 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9097 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9098 function
, trim_filename (file
), line
);
9102 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9105 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9106 const char *function
, enum omp_clause_code c1
,
9107 enum omp_clause_code c2
)
9110 unsigned length
= 0;
9113 for (c
= c1
; c
<= c2
; ++c
)
9114 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9116 length
+= strlen ("expected ");
9117 buffer
= (char *) alloca (length
);
9120 for (c
= c1
; c
<= c2
; ++c
)
9122 const char *prefix
= length
? " or " : "expected ";
9124 strcpy (buffer
+ length
, prefix
);
9125 length
+= strlen (prefix
);
9126 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9127 length
+= strlen (omp_clause_code_name
[c
]);
9130 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9131 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9132 function
, trim_filename (file
), line
);
9136 #undef DEFTREESTRUCT
9137 #define DEFTREESTRUCT(VAL, NAME) NAME,
9139 static const char *ts_enum_names
[] = {
9140 #include "treestruct.def"
9142 #undef DEFTREESTRUCT
9144 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9146 /* Similar to tree_class_check_failed, except that we check for
9147 whether CODE contains the tree structure identified by EN. */
9150 tree_contains_struct_check_failed (const_tree node
,
9151 const enum tree_node_structure_enum en
,
9152 const char *file
, int line
,
9153 const char *function
)
9156 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9158 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9162 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9163 (dynamically sized) vector. */
9166 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9167 const char *function
)
9170 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9171 idx
+ 1, len
, function
, trim_filename (file
), line
);
9174 /* Similar to above, except that the check is for the bounds of the operand
9175 vector of an expression node EXP. */
9178 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9179 int line
, const char *function
)
9181 int code
= TREE_CODE (exp
);
9183 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9184 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9185 function
, trim_filename (file
), line
);
9188 /* Similar to above, except that the check is for the number of
9189 operands of an OMP_CLAUSE node. */
9192 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9193 int line
, const char *function
)
9196 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9197 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9198 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9199 trim_filename (file
), line
);
9201 #endif /* ENABLE_TREE_CHECKING */
9203 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9204 and mapped to the machine mode MODE. Initialize its fields and build
9205 the information necessary for debugging output. */
9208 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9211 hashval_t hashcode
= 0;
9213 t
= make_node (VECTOR_TYPE
);
9214 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9215 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9216 SET_TYPE_MODE (t
, mode
);
9218 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9219 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9220 else if (TYPE_CANONICAL (innertype
) != innertype
9221 || mode
!= VOIDmode
)
9223 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9227 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9228 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9229 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9230 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9231 t
= type_hash_canon (hashcode
, t
);
9233 /* We have built a main variant, based on the main variant of the
9234 inner type. Use it to build the variant we return. */
9235 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9236 && TREE_TYPE (t
) != innertype
)
9237 return build_type_attribute_qual_variant (t
,
9238 TYPE_ATTRIBUTES (innertype
),
9239 TYPE_QUALS (innertype
));
9245 make_or_reuse_type (unsigned size
, int unsignedp
)
9247 if (size
== INT_TYPE_SIZE
)
9248 return unsignedp
? unsigned_type_node
: integer_type_node
;
9249 if (size
== CHAR_TYPE_SIZE
)
9250 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9251 if (size
== SHORT_TYPE_SIZE
)
9252 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9253 if (size
== LONG_TYPE_SIZE
)
9254 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9255 if (size
== LONG_LONG_TYPE_SIZE
)
9256 return (unsignedp
? long_long_unsigned_type_node
9257 : long_long_integer_type_node
);
9258 if (size
== 128 && int128_integer_type_node
)
9259 return (unsignedp
? int128_unsigned_type_node
9260 : int128_integer_type_node
);
9263 return make_unsigned_type (size
);
9265 return make_signed_type (size
);
9268 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9271 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9275 if (size
== SHORT_FRACT_TYPE_SIZE
)
9276 return unsignedp
? sat_unsigned_short_fract_type_node
9277 : sat_short_fract_type_node
;
9278 if (size
== FRACT_TYPE_SIZE
)
9279 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9280 if (size
== LONG_FRACT_TYPE_SIZE
)
9281 return unsignedp
? sat_unsigned_long_fract_type_node
9282 : sat_long_fract_type_node
;
9283 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9284 return unsignedp
? sat_unsigned_long_long_fract_type_node
9285 : sat_long_long_fract_type_node
;
9289 if (size
== SHORT_FRACT_TYPE_SIZE
)
9290 return unsignedp
? unsigned_short_fract_type_node
9291 : short_fract_type_node
;
9292 if (size
== FRACT_TYPE_SIZE
)
9293 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9294 if (size
== LONG_FRACT_TYPE_SIZE
)
9295 return unsignedp
? unsigned_long_fract_type_node
9296 : long_fract_type_node
;
9297 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9298 return unsignedp
? unsigned_long_long_fract_type_node
9299 : long_long_fract_type_node
;
9302 return make_fract_type (size
, unsignedp
, satp
);
9305 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9308 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9312 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9313 return unsignedp
? sat_unsigned_short_accum_type_node
9314 : sat_short_accum_type_node
;
9315 if (size
== ACCUM_TYPE_SIZE
)
9316 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9317 if (size
== LONG_ACCUM_TYPE_SIZE
)
9318 return unsignedp
? sat_unsigned_long_accum_type_node
9319 : sat_long_accum_type_node
;
9320 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9321 return unsignedp
? sat_unsigned_long_long_accum_type_node
9322 : sat_long_long_accum_type_node
;
9326 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9327 return unsignedp
? unsigned_short_accum_type_node
9328 : short_accum_type_node
;
9329 if (size
== ACCUM_TYPE_SIZE
)
9330 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9331 if (size
== LONG_ACCUM_TYPE_SIZE
)
9332 return unsignedp
? unsigned_long_accum_type_node
9333 : long_accum_type_node
;
9334 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9335 return unsignedp
? unsigned_long_long_accum_type_node
9336 : long_long_accum_type_node
;
9339 return make_accum_type (size
, unsignedp
, satp
);
9342 /* Create nodes for all integer types (and error_mark_node) using the sizes
9343 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9344 SHORT_DOUBLE specifies whether double should be of the same precision
9348 build_common_tree_nodes (bool signed_char
, bool short_double
)
9350 error_mark_node
= make_node (ERROR_MARK
);
9351 TREE_TYPE (error_mark_node
) = error_mark_node
;
9353 initialize_sizetypes ();
9355 /* Define both `signed char' and `unsigned char'. */
9356 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9357 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9358 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9359 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9361 /* Define `char', which is like either `signed char' or `unsigned char'
9362 but not the same as either. */
9365 ? make_signed_type (CHAR_TYPE_SIZE
)
9366 : make_unsigned_type (CHAR_TYPE_SIZE
));
9367 TYPE_STRING_FLAG (char_type_node
) = 1;
9369 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9370 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9371 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9372 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9373 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9374 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9375 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9376 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9377 #if HOST_BITS_PER_WIDE_INT >= 64
9378 /* TODO: This isn't correct, but as logic depends at the moment on
9379 host's instead of target's wide-integer.
9380 If there is a target not supporting TImode, but has an 128-bit
9381 integer-scalar register, this target check needs to be adjusted. */
9382 if (targetm
.scalar_mode_supported_p (TImode
))
9384 int128_integer_type_node
= make_signed_type (128);
9385 int128_unsigned_type_node
= make_unsigned_type (128);
9389 /* Define a boolean type. This type only represents boolean values but
9390 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9391 Front ends which want to override this size (i.e. Java) can redefine
9392 boolean_type_node before calling build_common_tree_nodes_2. */
9393 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9394 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9395 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9396 TYPE_PRECISION (boolean_type_node
) = 1;
9398 /* Define what type to use for size_t. */
9399 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9400 size_type_node
= unsigned_type_node
;
9401 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9402 size_type_node
= long_unsigned_type_node
;
9403 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9404 size_type_node
= long_long_unsigned_type_node
;
9405 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9406 size_type_node
= short_unsigned_type_node
;
9410 /* Fill in the rest of the sized types. Reuse existing type nodes
9412 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9413 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9414 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9415 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9416 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9418 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9419 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9420 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9421 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9422 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9424 access_public_node
= get_identifier ("public");
9425 access_protected_node
= get_identifier ("protected");
9426 access_private_node
= get_identifier ("private");
9428 /* Define these next since types below may used them. */
9429 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9430 integer_one_node
= build_int_cst (integer_type_node
, 1);
9431 integer_three_node
= build_int_cst (integer_type_node
, 3);
9432 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9434 size_zero_node
= size_int (0);
9435 size_one_node
= size_int (1);
9436 bitsize_zero_node
= bitsize_int (0);
9437 bitsize_one_node
= bitsize_int (1);
9438 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9440 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9441 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9443 void_type_node
= make_node (VOID_TYPE
);
9444 layout_type (void_type_node
);
9446 /* We are not going to have real types in C with less than byte alignment,
9447 so we might as well not have any types that claim to have it. */
9448 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9449 TYPE_USER_ALIGN (void_type_node
) = 0;
9451 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9452 layout_type (TREE_TYPE (null_pointer_node
));
9454 ptr_type_node
= build_pointer_type (void_type_node
);
9456 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9457 fileptr_type_node
= ptr_type_node
;
9459 float_type_node
= make_node (REAL_TYPE
);
9460 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9461 layout_type (float_type_node
);
9463 double_type_node
= make_node (REAL_TYPE
);
9465 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9467 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9468 layout_type (double_type_node
);
9470 long_double_type_node
= make_node (REAL_TYPE
);
9471 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9472 layout_type (long_double_type_node
);
9474 float_ptr_type_node
= build_pointer_type (float_type_node
);
9475 double_ptr_type_node
= build_pointer_type (double_type_node
);
9476 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9477 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9479 /* Fixed size integer types. */
9480 uint16_type_node
= build_nonstandard_integer_type (16, true);
9481 uint32_type_node
= build_nonstandard_integer_type (32, true);
9482 uint64_type_node
= build_nonstandard_integer_type (64, true);
9484 /* Decimal float types. */
9485 dfloat32_type_node
= make_node (REAL_TYPE
);
9486 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9487 layout_type (dfloat32_type_node
);
9488 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9489 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9491 dfloat64_type_node
= make_node (REAL_TYPE
);
9492 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9493 layout_type (dfloat64_type_node
);
9494 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9495 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9497 dfloat128_type_node
= make_node (REAL_TYPE
);
9498 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9499 layout_type (dfloat128_type_node
);
9500 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9501 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9503 complex_integer_type_node
= build_complex_type (integer_type_node
);
9504 complex_float_type_node
= build_complex_type (float_type_node
);
9505 complex_double_type_node
= build_complex_type (double_type_node
);
9506 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9508 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9509 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9510 sat_ ## KIND ## _type_node = \
9511 make_sat_signed_ ## KIND ## _type (SIZE); \
9512 sat_unsigned_ ## KIND ## _type_node = \
9513 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9514 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9515 unsigned_ ## KIND ## _type_node = \
9516 make_unsigned_ ## KIND ## _type (SIZE);
9518 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9519 sat_ ## WIDTH ## KIND ## _type_node = \
9520 make_sat_signed_ ## KIND ## _type (SIZE); \
9521 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9522 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9523 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9524 unsigned_ ## WIDTH ## KIND ## _type_node = \
9525 make_unsigned_ ## KIND ## _type (SIZE);
9527 /* Make fixed-point type nodes based on four different widths. */
9528 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9529 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9530 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9531 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9532 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9534 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9535 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9536 NAME ## _type_node = \
9537 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9538 u ## NAME ## _type_node = \
9539 make_or_reuse_unsigned_ ## KIND ## _type \
9540 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9541 sat_ ## NAME ## _type_node = \
9542 make_or_reuse_sat_signed_ ## KIND ## _type \
9543 (GET_MODE_BITSIZE (MODE ## mode)); \
9544 sat_u ## NAME ## _type_node = \
9545 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9546 (GET_MODE_BITSIZE (U ## MODE ## mode));
9548 /* Fixed-point type and mode nodes. */
9549 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9550 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9551 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9552 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9553 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9554 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9555 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9556 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9557 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9558 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9559 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9562 tree t
= targetm
.build_builtin_va_list ();
9564 /* Many back-ends define record types without setting TYPE_NAME.
9565 If we copied the record type here, we'd keep the original
9566 record type without a name. This breaks name mangling. So,
9567 don't copy record types and let c_common_nodes_and_builtins()
9568 declare the type to be __builtin_va_list. */
9569 if (TREE_CODE (t
) != RECORD_TYPE
)
9570 t
= build_variant_type_copy (t
);
9572 va_list_type_node
= t
;
9576 /* Modify DECL for given flags. */
9578 set_call_expr_flags (tree decl
, int flags
)
9580 if (flags
& ECF_NOTHROW
)
9581 TREE_NOTHROW (decl
) = 1;
9582 if (flags
& ECF_CONST
)
9583 TREE_READONLY (decl
) = 1;
9584 if (flags
& ECF_PURE
)
9585 DECL_PURE_P (decl
) = 1;
9586 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9587 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9588 if (flags
& ECF_NOVOPS
)
9589 DECL_IS_NOVOPS (decl
) = 1;
9590 if (flags
& ECF_NORETURN
)
9591 TREE_THIS_VOLATILE (decl
) = 1;
9592 if (flags
& ECF_MALLOC
)
9593 DECL_IS_MALLOC (decl
) = 1;
9594 if (flags
& ECF_RETURNS_TWICE
)
9595 DECL_IS_RETURNS_TWICE (decl
) = 1;
9596 if (flags
& ECF_LEAF
)
9597 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9598 NULL
, DECL_ATTRIBUTES (decl
));
9599 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9600 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("transaction_pure"),
9601 NULL
, DECL_ATTRIBUTES (decl
));
9602 /* Looping const or pure is implied by noreturn.
9603 There is currently no way to declare looping const or looping pure alone. */
9604 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9605 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9609 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9612 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9613 const char *library_name
, int ecf_flags
)
9617 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9618 library_name
, NULL_TREE
);
9619 set_call_expr_flags (decl
, ecf_flags
);
9621 set_builtin_decl (code
, decl
, true);
9624 /* Call this function after instantiating all builtins that the language
9625 front end cares about. This will build the rest of the builtins that
9626 are relied upon by the tree optimizers and the middle-end. */
9629 build_common_builtin_nodes (void)
9634 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9636 ftype
= build_function_type (void_type_node
, void_list_node
);
9637 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9638 "__builtin_unreachable",
9639 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9640 | ECF_CONST
| ECF_LEAF
);
9643 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9644 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9646 ftype
= build_function_type_list (ptr_type_node
,
9647 ptr_type_node
, const_ptr_type_node
,
9648 size_type_node
, NULL_TREE
);
9650 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9651 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9652 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9653 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9654 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9655 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9658 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9660 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9661 const_ptr_type_node
, size_type_node
,
9663 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9664 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9667 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9669 ftype
= build_function_type_list (ptr_type_node
,
9670 ptr_type_node
, integer_type_node
,
9671 size_type_node
, NULL_TREE
);
9672 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9673 "memset", ECF_NOTHROW
| ECF_LEAF
);
9676 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9678 ftype
= build_function_type_list (ptr_type_node
,
9679 size_type_node
, NULL_TREE
);
9680 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9681 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9684 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9685 size_type_node
, NULL_TREE
);
9686 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9687 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9688 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9690 /* If we're checking the stack, `alloca' can throw. */
9691 if (flag_stack_check
)
9693 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
9694 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
9697 ftype
= build_function_type_list (void_type_node
,
9698 ptr_type_node
, ptr_type_node
,
9699 ptr_type_node
, NULL_TREE
);
9700 local_define_builtin ("__builtin_init_trampoline", ftype
,
9701 BUILT_IN_INIT_TRAMPOLINE
,
9702 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9703 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9704 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9705 "__builtin_init_heap_trampoline",
9706 ECF_NOTHROW
| ECF_LEAF
);
9708 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9709 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9710 BUILT_IN_ADJUST_TRAMPOLINE
,
9711 "__builtin_adjust_trampoline",
9712 ECF_CONST
| ECF_NOTHROW
);
9714 ftype
= build_function_type_list (void_type_node
,
9715 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9716 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9717 BUILT_IN_NONLOCAL_GOTO
,
9718 "__builtin_nonlocal_goto",
9719 ECF_NORETURN
| ECF_NOTHROW
);
9721 ftype
= build_function_type_list (void_type_node
,
9722 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9723 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9724 BUILT_IN_SETJMP_SETUP
,
9725 "__builtin_setjmp_setup", ECF_NOTHROW
);
9727 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9728 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
9729 BUILT_IN_SETJMP_DISPATCHER
,
9730 "__builtin_setjmp_dispatcher",
9731 ECF_PURE
| ECF_NOTHROW
);
9733 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9734 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
9735 BUILT_IN_SETJMP_RECEIVER
,
9736 "__builtin_setjmp_receiver", ECF_NOTHROW
);
9738 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
9739 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
9740 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
9742 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9743 local_define_builtin ("__builtin_stack_restore", ftype
,
9744 BUILT_IN_STACK_RESTORE
,
9745 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
9747 /* If there's a possibility that we might use the ARM EABI, build the
9748 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
9749 if (targetm
.arm_eabi_unwinder
)
9751 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
9752 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
9753 BUILT_IN_CXA_END_CLEANUP
,
9754 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
9757 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
9758 local_define_builtin ("__builtin_unwind_resume", ftype
,
9759 BUILT_IN_UNWIND_RESUME
,
9760 ((targetm_common
.except_unwind_info (&global_options
)
9762 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
9765 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
9767 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
9769 local_define_builtin ("__builtin_return_address", ftype
,
9770 BUILT_IN_RETURN_ADDRESS
,
9771 "__builtin_return_address",
9775 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
9776 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9778 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
9779 ptr_type_node
, NULL_TREE
);
9780 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
9781 local_define_builtin ("__cyg_profile_func_enter", ftype
,
9782 BUILT_IN_PROFILE_FUNC_ENTER
,
9783 "__cyg_profile_func_enter", 0);
9784 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
9785 local_define_builtin ("__cyg_profile_func_exit", ftype
,
9786 BUILT_IN_PROFILE_FUNC_EXIT
,
9787 "__cyg_profile_func_exit", 0);
9790 /* The exception object and filter values from the runtime. The argument
9791 must be zero before exception lowering, i.e. from the front end. After
9792 exception lowering, it will be the region number for the exception
9793 landing pad. These functions are PURE instead of CONST to prevent
9794 them from being hoisted past the exception edge that will initialize
9795 its value in the landing pad. */
9796 ftype
= build_function_type_list (ptr_type_node
,
9797 integer_type_node
, NULL_TREE
);
9798 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
9799 /* Only use TM_PURE if we we have TM language support. */
9800 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
9801 ecf_flags
|= ECF_TM_PURE
;
9802 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
9803 "__builtin_eh_pointer", ecf_flags
);
9805 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
9806 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
9807 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
9808 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9810 ftype
= build_function_type_list (void_type_node
,
9811 integer_type_node
, integer_type_node
,
9813 local_define_builtin ("__builtin_eh_copy_values", ftype
,
9814 BUILT_IN_EH_COPY_VALUES
,
9815 "__builtin_eh_copy_values", ECF_NOTHROW
);
9817 /* Complex multiplication and division. These are handled as builtins
9818 rather than optabs because emit_library_call_value doesn't support
9819 complex. Further, we can do slightly better with folding these
9820 beasties if the real and complex parts of the arguments are separate. */
9824 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
9826 char mode_name_buf
[4], *q
;
9828 enum built_in_function mcode
, dcode
;
9829 tree type
, inner_type
;
9830 const char *prefix
= "__";
9832 if (targetm
.libfunc_gnu_prefix
)
9835 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
9838 inner_type
= TREE_TYPE (type
);
9840 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
9841 inner_type
, inner_type
, NULL_TREE
);
9843 mcode
= ((enum built_in_function
)
9844 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9845 dcode
= ((enum built_in_function
)
9846 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
9848 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
9852 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
9854 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
9855 built_in_names
[mcode
],
9856 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9858 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
9860 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
9861 built_in_names
[dcode
],
9862 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
9867 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
9870 If we requested a pointer to a vector, build up the pointers that
9871 we stripped off while looking for the inner type. Similarly for
9872 return values from functions.
9874 The argument TYPE is the top of the chain, and BOTTOM is the
9875 new type which we will point to. */
9878 reconstruct_complex_type (tree type
, tree bottom
)
9882 if (TREE_CODE (type
) == POINTER_TYPE
)
9884 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9885 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
9886 TYPE_REF_CAN_ALIAS_ALL (type
));
9888 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
9890 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9891 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
9892 TYPE_REF_CAN_ALIAS_ALL (type
));
9894 else if (TREE_CODE (type
) == ARRAY_TYPE
)
9896 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9897 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
9899 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
9901 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9902 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
9904 else if (TREE_CODE (type
) == METHOD_TYPE
)
9906 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9907 /* The build_method_type_directly() routine prepends 'this' to argument list,
9908 so we must compensate by getting rid of it. */
9910 = build_method_type_directly
9911 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
9913 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
9915 else if (TREE_CODE (type
) == OFFSET_TYPE
)
9917 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
9918 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
9923 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
9927 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
9930 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
9934 switch (GET_MODE_CLASS (mode
))
9936 case MODE_VECTOR_INT
:
9937 case MODE_VECTOR_FLOAT
:
9938 case MODE_VECTOR_FRACT
:
9939 case MODE_VECTOR_UFRACT
:
9940 case MODE_VECTOR_ACCUM
:
9941 case MODE_VECTOR_UACCUM
:
9942 nunits
= GET_MODE_NUNITS (mode
);
9946 /* Check that there are no leftover bits. */
9947 gcc_assert (GET_MODE_BITSIZE (mode
)
9948 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
9950 nunits
= GET_MODE_BITSIZE (mode
)
9951 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
9958 return make_vector_type (innertype
, nunits
, mode
);
9961 /* Similarly, but takes the inner type and number of units, which must be
9965 build_vector_type (tree innertype
, int nunits
)
9967 return make_vector_type (innertype
, nunits
, VOIDmode
);
9970 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
9973 build_opaque_vector_type (tree innertype
, int nunits
)
9975 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
9977 /* We always build the non-opaque variant before the opaque one,
9978 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
9979 cand
= TYPE_NEXT_VARIANT (t
);
9981 && TYPE_VECTOR_OPAQUE (cand
)
9982 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
9984 /* Othewise build a variant type and make sure to queue it after
9985 the non-opaque type. */
9986 cand
= build_distinct_type_copy (t
);
9987 TYPE_VECTOR_OPAQUE (cand
) = true;
9988 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
9989 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
9990 TYPE_NEXT_VARIANT (t
) = cand
;
9991 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
9996 /* Given an initializer INIT, return TRUE if INIT is zero or some
9997 aggregate of zeros. Otherwise return FALSE. */
9999 initializer_zerop (const_tree init
)
10005 switch (TREE_CODE (init
))
10008 return integer_zerop (init
);
10011 /* ??? Note that this is not correct for C4X float formats. There,
10012 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10013 negative exponent. */
10014 return real_zerop (init
)
10015 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10018 return fixed_zerop (init
);
10021 return integer_zerop (init
)
10022 || (real_zerop (init
)
10023 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10024 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10029 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10030 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10037 unsigned HOST_WIDE_INT idx
;
10039 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10040 if (!initializer_zerop (elt
))
10049 /* We need to loop through all elements to handle cases like
10050 "\0" and "\0foobar". */
10051 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10052 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10063 /* Build an empty statement at location LOC. */
10066 build_empty_stmt (location_t loc
)
10068 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10069 SET_EXPR_LOCATION (t
, loc
);
10074 /* Build an OpenMP clause with code CODE. LOC is the location of the
10078 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10083 length
= omp_clause_num_ops
[code
];
10084 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10086 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10088 t
= ggc_alloc_tree_node (size
);
10089 memset (t
, 0, size
);
10090 TREE_SET_CODE (t
, OMP_CLAUSE
);
10091 OMP_CLAUSE_SET_CODE (t
, code
);
10092 OMP_CLAUSE_LOCATION (t
) = loc
;
10097 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10098 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10099 Except for the CODE and operand count field, other storage for the
10100 object is initialized to zeros. */
10103 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10106 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10108 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10109 gcc_assert (len
>= 1);
10111 record_node_allocation_statistics (code
, length
);
10113 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10115 TREE_SET_CODE (t
, code
);
10117 /* Can't use TREE_OPERAND to store the length because if checking is
10118 enabled, it will try to check the length before we store it. :-P */
10119 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10124 /* Helper function for build_call_* functions; build a CALL_EXPR with
10125 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10126 the argument slots. */
10129 build_call_1 (tree return_type
, tree fn
, int nargs
)
10133 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10134 TREE_TYPE (t
) = return_type
;
10135 CALL_EXPR_FN (t
) = fn
;
10136 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10141 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10142 FN and a null static chain slot. NARGS is the number of call arguments
10143 which are specified as "..." arguments. */
10146 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10150 va_start (args
, nargs
);
10151 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10156 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10157 FN and a null static chain slot. NARGS is the number of call arguments
10158 which are specified as a va_list ARGS. */
10161 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10166 t
= build_call_1 (return_type
, fn
, nargs
);
10167 for (i
= 0; i
< nargs
; i
++)
10168 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10169 process_call_operands (t
);
10173 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10174 FN and a null static chain slot. NARGS is the number of call arguments
10175 which are specified as a tree array ARGS. */
10178 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10179 int nargs
, const tree
*args
)
10184 t
= build_call_1 (return_type
, fn
, nargs
);
10185 for (i
= 0; i
< nargs
; i
++)
10186 CALL_EXPR_ARG (t
, i
) = args
[i
];
10187 process_call_operands (t
);
10188 SET_EXPR_LOCATION (t
, loc
);
10192 /* Like build_call_array, but takes a vec. */
10195 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10200 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10201 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10202 CALL_EXPR_ARG (ret
, ix
) = t
;
10203 process_call_operands (ret
);
10208 /* Returns true if it is possible to prove that the index of
10209 an array access REF (an ARRAY_REF expression) falls into the
10213 in_array_bounds_p (tree ref
)
10215 tree idx
= TREE_OPERAND (ref
, 1);
10218 if (TREE_CODE (idx
) != INTEGER_CST
)
10221 min
= array_ref_low_bound (ref
);
10222 max
= array_ref_up_bound (ref
);
10225 || TREE_CODE (min
) != INTEGER_CST
10226 || TREE_CODE (max
) != INTEGER_CST
)
10229 if (tree_int_cst_lt (idx
, min
)
10230 || tree_int_cst_lt (max
, idx
))
10236 /* Returns true if it is possible to prove that the range of
10237 an array access REF (an ARRAY_RANGE_REF expression) falls
10238 into the array bounds. */
10241 range_in_array_bounds_p (tree ref
)
10243 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10244 tree range_min
, range_max
, min
, max
;
10246 range_min
= TYPE_MIN_VALUE (domain_type
);
10247 range_max
= TYPE_MAX_VALUE (domain_type
);
10250 || TREE_CODE (range_min
) != INTEGER_CST
10251 || TREE_CODE (range_max
) != INTEGER_CST
)
10254 min
= array_ref_low_bound (ref
);
10255 max
= array_ref_up_bound (ref
);
10258 || TREE_CODE (min
) != INTEGER_CST
10259 || TREE_CODE (max
) != INTEGER_CST
)
10262 if (tree_int_cst_lt (range_min
, min
)
10263 || tree_int_cst_lt (max
, range_max
))
10269 /* Return true if T (assumed to be a DECL) must be assigned a memory
10273 needs_to_live_in_memory (const_tree t
)
10275 return (TREE_ADDRESSABLE (t
)
10276 || is_global_var (t
)
10277 || (TREE_CODE (t
) == RESULT_DECL
10278 && !DECL_BY_REFERENCE (t
)
10279 && aggregate_value_p (t
, current_function_decl
)));
10282 /* Return value of a constant X and sign-extend it. */
10285 int_cst_value (const_tree x
)
10287 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10288 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10290 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10291 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10292 || TREE_INT_CST_HIGH (x
) == -1);
10294 if (bits
< HOST_BITS_PER_WIDE_INT
)
10296 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10298 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10300 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10306 /* Return value of a constant X and sign-extend it. */
10309 widest_int_cst_value (const_tree x
)
10311 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10312 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10314 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10315 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10316 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10317 << HOST_BITS_PER_WIDE_INT
);
10319 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10320 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10321 || TREE_INT_CST_HIGH (x
) == -1);
10324 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10326 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10328 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10330 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10336 /* If TYPE is an integral or pointer type, return an integer type with
10337 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10338 if TYPE is already an integer type of signedness UNSIGNEDP. */
10341 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10343 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10346 if (TREE_CODE (type
) == VECTOR_TYPE
)
10348 tree inner
= TREE_TYPE (type
);
10349 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10352 if (inner
== inner2
)
10354 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10357 if (!INTEGRAL_TYPE_P (type
)
10358 && !POINTER_TYPE_P (type
))
10361 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10364 /* If TYPE is an integral or pointer type, return an integer type with
10365 the same precision which is unsigned, or itself if TYPE is already an
10366 unsigned integer type. */
10369 unsigned_type_for (tree type
)
10371 return signed_or_unsigned_type_for (1, type
);
10374 /* If TYPE is an integral or pointer type, return an integer type with
10375 the same precision which is signed, or itself if TYPE is already a
10376 signed integer type. */
10379 signed_type_for (tree type
)
10381 return signed_or_unsigned_type_for (0, type
);
10384 /* If TYPE is a vector type, return a signed integer vector type with the
10385 same width and number of subparts. Otherwise return boolean_type_node. */
10388 truth_type_for (tree type
)
10390 if (TREE_CODE (type
) == VECTOR_TYPE
)
10392 tree elem
= lang_hooks
.types
.type_for_size
10393 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10394 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10397 return boolean_type_node
;
10400 /* Returns the largest value obtainable by casting something in INNER type to
10404 upper_bound_in_type (tree outer
, tree inner
)
10407 unsigned int det
= 0;
10408 unsigned oprec
= TYPE_PRECISION (outer
);
10409 unsigned iprec
= TYPE_PRECISION (inner
);
10412 /* Compute a unique number for every combination. */
10413 det
|= (oprec
> iprec
) ? 4 : 0;
10414 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10415 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10417 /* Determine the exponent to use. */
10422 /* oprec <= iprec, outer: signed, inner: don't care. */
10427 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10431 /* oprec > iprec, outer: signed, inner: signed. */
10435 /* oprec > iprec, outer: signed, inner: unsigned. */
10439 /* oprec > iprec, outer: unsigned, inner: signed. */
10443 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10447 gcc_unreachable ();
10450 /* Compute 2^^prec - 1. */
10451 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10454 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10455 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10459 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10460 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10461 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10464 return double_int_to_tree (outer
, high
);
10467 /* Returns the smallest value obtainable by casting something in INNER type to
10471 lower_bound_in_type (tree outer
, tree inner
)
10474 unsigned oprec
= TYPE_PRECISION (outer
);
10475 unsigned iprec
= TYPE_PRECISION (inner
);
10477 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10479 if (TYPE_UNSIGNED (outer
)
10480 /* If we are widening something of an unsigned type, OUTER type
10481 contains all values of INNER type. In particular, both INNER
10482 and OUTER types have zero in common. */
10483 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10484 low
.low
= low
.high
= 0;
10487 /* If we are widening a signed type to another signed type, we
10488 want to obtain -2^^(iprec-1). If we are keeping the
10489 precision or narrowing to a signed type, we want to obtain
10491 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10493 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10495 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10496 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10500 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10501 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10506 return double_int_to_tree (outer
, low
);
10509 /* Return nonzero if two operands that are suitable for PHI nodes are
10510 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10511 SSA_NAME or invariant. Note that this is strictly an optimization.
10512 That is, callers of this function can directly call operand_equal_p
10513 and get the same result, only slower. */
10516 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10520 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10522 return operand_equal_p (arg0
, arg1
, 0);
10525 /* Returns number of zeros at the end of binary representation of X.
10527 ??? Use ffs if available? */
10530 num_ending_zeros (const_tree x
)
10532 unsigned HOST_WIDE_INT fr
, nfr
;
10533 unsigned num
, abits
;
10534 tree type
= TREE_TYPE (x
);
10536 if (TREE_INT_CST_LOW (x
) == 0)
10538 num
= HOST_BITS_PER_WIDE_INT
;
10539 fr
= TREE_INT_CST_HIGH (x
);
10544 fr
= TREE_INT_CST_LOW (x
);
10547 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10550 if (nfr
<< abits
== fr
)
10557 if (num
> TYPE_PRECISION (type
))
10558 num
= TYPE_PRECISION (type
);
10560 return build_int_cst_type (type
, num
);
10564 #define WALK_SUBTREE(NODE) \
10567 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10573 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10574 be walked whenever a type is seen in the tree. Rest of operands and return
10575 value are as for walk_tree. */
10578 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10579 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10581 tree result
= NULL_TREE
;
10583 switch (TREE_CODE (type
))
10586 case REFERENCE_TYPE
:
10587 /* We have to worry about mutually recursive pointers. These can't
10588 be written in C. They can in Ada. It's pathological, but
10589 there's an ACATS test (c38102a) that checks it. Deal with this
10590 by checking if we're pointing to another pointer, that one
10591 points to another pointer, that one does too, and we have no htab.
10592 If so, get a hash table. We check three levels deep to avoid
10593 the cost of the hash table if we don't need one. */
10594 if (POINTER_TYPE_P (TREE_TYPE (type
))
10595 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10596 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10599 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10607 /* ... fall through ... */
10610 WALK_SUBTREE (TREE_TYPE (type
));
10614 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10616 /* Fall through. */
10618 case FUNCTION_TYPE
:
10619 WALK_SUBTREE (TREE_TYPE (type
));
10623 /* We never want to walk into default arguments. */
10624 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10625 WALK_SUBTREE (TREE_VALUE (arg
));
10630 /* Don't follow this nodes's type if a pointer for fear that
10631 we'll have infinite recursion. If we have a PSET, then we
10634 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10635 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10636 WALK_SUBTREE (TREE_TYPE (type
));
10637 WALK_SUBTREE (TYPE_DOMAIN (type
));
10641 WALK_SUBTREE (TREE_TYPE (type
));
10642 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
10652 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
10653 called with the DATA and the address of each sub-tree. If FUNC returns a
10654 non-NULL value, the traversal is stopped, and the value returned by FUNC
10655 is returned. If PSET is non-NULL it is used to record the nodes visited,
10656 and to avoid visiting a node more than once. */
10659 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10660 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10662 enum tree_code code
;
10666 #define WALK_SUBTREE_TAIL(NODE) \
10670 goto tail_recurse; \
10675 /* Skip empty subtrees. */
10679 /* Don't walk the same tree twice, if the user has requested
10680 that we avoid doing so. */
10681 if (pset
&& pointer_set_insert (pset
, *tp
))
10684 /* Call the function. */
10686 result
= (*func
) (tp
, &walk_subtrees
, data
);
10688 /* If we found something, return it. */
10692 code
= TREE_CODE (*tp
);
10694 /* Even if we didn't, FUNC may have decided that there was nothing
10695 interesting below this point in the tree. */
10696 if (!walk_subtrees
)
10698 /* But we still need to check our siblings. */
10699 if (code
== TREE_LIST
)
10700 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10701 else if (code
== OMP_CLAUSE
)
10702 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10709 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
10710 if (result
|| !walk_subtrees
)
10717 case IDENTIFIER_NODE
:
10724 case PLACEHOLDER_EXPR
:
10728 /* None of these have subtrees other than those already walked
10733 WALK_SUBTREE (TREE_VALUE (*tp
));
10734 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
10739 int len
= TREE_VEC_LENGTH (*tp
);
10744 /* Walk all elements but the first. */
10746 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
10748 /* Now walk the first one as a tail call. */
10749 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
10753 WALK_SUBTREE (TREE_REALPART (*tp
));
10754 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
10758 unsigned HOST_WIDE_INT idx
;
10759 constructor_elt
*ce
;
10761 for (idx
= 0; vec_safe_iterate(CONSTRUCTOR_ELTS (*tp
), idx
, &ce
); idx
++)
10762 WALK_SUBTREE (ce
->value
);
10767 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
10772 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
10774 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
10775 into declarations that are just mentioned, rather than
10776 declared; they don't really belong to this part of the tree.
10777 And, we can see cycles: the initializer for a declaration
10778 can refer to the declaration itself. */
10779 WALK_SUBTREE (DECL_INITIAL (decl
));
10780 WALK_SUBTREE (DECL_SIZE (decl
));
10781 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
10783 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
10786 case STATEMENT_LIST
:
10788 tree_stmt_iterator i
;
10789 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
10790 WALK_SUBTREE (*tsi_stmt_ptr (i
));
10795 switch (OMP_CLAUSE_CODE (*tp
))
10797 case OMP_CLAUSE_PRIVATE
:
10798 case OMP_CLAUSE_SHARED
:
10799 case OMP_CLAUSE_FIRSTPRIVATE
:
10800 case OMP_CLAUSE_COPYIN
:
10801 case OMP_CLAUSE_COPYPRIVATE
:
10802 case OMP_CLAUSE_FINAL
:
10803 case OMP_CLAUSE_IF
:
10804 case OMP_CLAUSE_NUM_THREADS
:
10805 case OMP_CLAUSE_SCHEDULE
:
10806 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
10809 case OMP_CLAUSE_NOWAIT
:
10810 case OMP_CLAUSE_ORDERED
:
10811 case OMP_CLAUSE_DEFAULT
:
10812 case OMP_CLAUSE_UNTIED
:
10813 case OMP_CLAUSE_MERGEABLE
:
10814 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10816 case OMP_CLAUSE_LASTPRIVATE
:
10817 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
10818 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
10819 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10821 case OMP_CLAUSE_COLLAPSE
:
10824 for (i
= 0; i
< 3; i
++)
10825 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10826 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10829 case OMP_CLAUSE_REDUCTION
:
10832 for (i
= 0; i
< 4; i
++)
10833 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
10834 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
10838 gcc_unreachable ();
10846 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
10847 But, we only want to walk once. */
10848 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
10849 for (i
= 0; i
< len
; ++i
)
10850 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10851 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
10855 /* If this is a TYPE_DECL, walk into the fields of the type that it's
10856 defining. We only want to walk into these fields of a type in this
10857 case and not in the general case of a mere reference to the type.
10859 The criterion is as follows: if the field can be an expression, it
10860 must be walked only here. This should be in keeping with the fields
10861 that are directly gimplified in gimplify_type_sizes in order for the
10862 mark/copy-if-shared/unmark machinery of the gimplifier to work with
10863 variable-sized types.
10865 Note that DECLs get walked as part of processing the BIND_EXPR. */
10866 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
10868 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
10869 if (TREE_CODE (*type_p
) == ERROR_MARK
)
10872 /* Call the function for the type. See if it returns anything or
10873 doesn't want us to continue. If we are to continue, walk both
10874 the normal fields and those for the declaration case. */
10875 result
= (*func
) (type_p
, &walk_subtrees
, data
);
10876 if (result
|| !walk_subtrees
)
10879 /* But do not walk a pointed-to type since it may itself need to
10880 be walked in the declaration case if it isn't anonymous. */
10881 if (!POINTER_TYPE_P (*type_p
))
10883 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
10888 /* If this is a record type, also walk the fields. */
10889 if (RECORD_OR_UNION_TYPE_P (*type_p
))
10893 for (field
= TYPE_FIELDS (*type_p
); field
;
10894 field
= DECL_CHAIN (field
))
10896 /* We'd like to look at the type of the field, but we can
10897 easily get infinite recursion. So assume it's pointed
10898 to elsewhere in the tree. Also, ignore things that
10900 if (TREE_CODE (field
) != FIELD_DECL
)
10903 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
10904 WALK_SUBTREE (DECL_SIZE (field
));
10905 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
10906 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
10907 WALK_SUBTREE (DECL_QUALIFIER (field
));
10911 /* Same for scalar types. */
10912 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
10913 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
10914 || TREE_CODE (*type_p
) == INTEGER_TYPE
10915 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
10916 || TREE_CODE (*type_p
) == REAL_TYPE
)
10918 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
10919 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
10922 WALK_SUBTREE (TYPE_SIZE (*type_p
));
10923 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
10928 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
10932 /* Walk over all the sub-trees of this operand. */
10933 len
= TREE_OPERAND_LENGTH (*tp
);
10935 /* Go through the subtrees. We need to do this in forward order so
10936 that the scope of a FOR_EXPR is handled properly. */
10939 for (i
= 0; i
< len
- 1; ++i
)
10940 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
10941 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
10944 /* If this is a type, walk the needed fields in the type. */
10945 else if (TYPE_P (*tp
))
10946 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
10950 /* We didn't find what we were looking for. */
10953 #undef WALK_SUBTREE_TAIL
10955 #undef WALK_SUBTREE
10957 /* Like walk_tree, but does not walk duplicate nodes more than once. */
10960 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
10964 struct pointer_set_t
*pset
;
10966 pset
= pointer_set_create ();
10967 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
10968 pointer_set_destroy (pset
);
10974 tree_block (tree t
)
10976 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10978 if (IS_EXPR_CODE_CLASS (c
))
10979 return LOCATION_BLOCK (t
->exp
.locus
);
10980 gcc_unreachable ();
10985 tree_set_block (tree t
, tree b
)
10987 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
10989 if (IS_EXPR_CODE_CLASS (c
))
10992 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
10994 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
10997 gcc_unreachable ();
11000 /* Create a nameless artificial label and put it in the current
11001 function context. The label has a location of LOC. Returns the
11002 newly created label. */
11005 create_artificial_label (location_t loc
)
11007 tree lab
= build_decl (loc
,
11008 LABEL_DECL
, NULL_TREE
, void_type_node
);
11010 DECL_ARTIFICIAL (lab
) = 1;
11011 DECL_IGNORED_P (lab
) = 1;
11012 DECL_CONTEXT (lab
) = current_function_decl
;
11016 /* Given a tree, try to return a useful variable name that we can use
11017 to prefix a temporary that is being assigned the value of the tree.
11018 I.E. given <temp> = &A, return A. */
11023 tree stripped_decl
;
11026 STRIP_NOPS (stripped_decl
);
11027 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11028 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11029 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11031 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11034 return IDENTIFIER_POINTER (name
);
11038 switch (TREE_CODE (stripped_decl
))
11041 return get_name (TREE_OPERAND (stripped_decl
, 0));
11048 /* Return true if TYPE has a variable argument list. */
11051 stdarg_p (const_tree fntype
)
11053 function_args_iterator args_iter
;
11054 tree n
= NULL_TREE
, t
;
11059 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
11064 return n
!= NULL_TREE
&& n
!= void_type_node
;
11067 /* Return true if TYPE has a prototype. */
11070 prototype_p (tree fntype
)
11074 gcc_assert (fntype
!= NULL_TREE
);
11076 t
= TYPE_ARG_TYPES (fntype
);
11077 return (t
!= NULL_TREE
);
11080 /* If BLOCK is inlined from an __attribute__((__artificial__))
11081 routine, return pointer to location from where it has been
11084 block_nonartificial_location (tree block
)
11086 location_t
*ret
= NULL
;
11088 while (block
&& TREE_CODE (block
) == BLOCK
11089 && BLOCK_ABSTRACT_ORIGIN (block
))
11091 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11093 while (TREE_CODE (ao
) == BLOCK
11094 && BLOCK_ABSTRACT_ORIGIN (ao
)
11095 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11096 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11098 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11100 /* If AO is an artificial inline, point RET to the
11101 call site locus at which it has been inlined and continue
11102 the loop, in case AO's caller is also an artificial
11104 if (DECL_DECLARED_INLINE_P (ao
)
11105 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11106 ret
= &BLOCK_SOURCE_LOCATION (block
);
11110 else if (TREE_CODE (ao
) != BLOCK
)
11113 block
= BLOCK_SUPERCONTEXT (block
);
11119 /* If EXP is inlined from an __attribute__((__artificial__))
11120 function, return the location of the original call expression. */
11123 tree_nonartificial_location (tree exp
)
11125 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11130 return EXPR_LOCATION (exp
);
11134 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11137 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11140 cl_option_hash_hash (const void *x
)
11142 const_tree
const t
= (const_tree
) x
;
11146 hashval_t hash
= 0;
11148 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11150 p
= (const char *)TREE_OPTIMIZATION (t
);
11151 len
= sizeof (struct cl_optimization
);
11154 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11156 p
= (const char *)TREE_TARGET_OPTION (t
);
11157 len
= sizeof (struct cl_target_option
);
11161 gcc_unreachable ();
11163 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11165 for (i
= 0; i
< len
; i
++)
11167 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11172 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11173 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11177 cl_option_hash_eq (const void *x
, const void *y
)
11179 const_tree
const xt
= (const_tree
) x
;
11180 const_tree
const yt
= (const_tree
) y
;
11185 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11188 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11190 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11191 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11192 len
= sizeof (struct cl_optimization
);
11195 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11197 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11198 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11199 len
= sizeof (struct cl_target_option
);
11203 gcc_unreachable ();
11205 return (memcmp (xp
, yp
, len
) == 0);
11208 /* Build an OPTIMIZATION_NODE based on the current options. */
11211 build_optimization_node (void)
11216 /* Use the cache of optimization nodes. */
11218 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11221 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11225 /* Insert this one into the hash table. */
11226 t
= cl_optimization_node
;
11229 /* Make a new node for next time round. */
11230 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11236 /* Build a TARGET_OPTION_NODE based on the current options. */
11239 build_target_option_node (void)
11244 /* Use the cache of optimization nodes. */
11246 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11249 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11253 /* Insert this one into the hash table. */
11254 t
= cl_target_option_node
;
11257 /* Make a new node for next time round. */
11258 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11264 /* Determine the "ultimate origin" of a block. The block may be an inlined
11265 instance of an inlined instance of a block which is local to an inline
11266 function, so we have to trace all of the way back through the origin chain
11267 to find out what sort of node actually served as the original seed for the
11271 block_ultimate_origin (const_tree block
)
11273 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11275 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11276 nodes in the function to point to themselves; ignore that if
11277 we're trying to output the abstract instance of this function. */
11278 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11281 if (immediate_origin
== NULL_TREE
)
11286 tree lookahead
= immediate_origin
;
11290 ret_val
= lookahead
;
11291 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11292 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11294 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11296 /* The block's abstract origin chain may not be the *ultimate* origin of
11297 the block. It could lead to a DECL that has an abstract origin set.
11298 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11299 will give us if it has one). Note that DECL's abstract origins are
11300 supposed to be the most distant ancestor (or so decl_ultimate_origin
11301 claims), so we don't need to loop following the DECL origins. */
11302 if (DECL_P (ret_val
))
11303 return DECL_ORIGIN (ret_val
);
11309 /* Return true if T1 and T2 are equivalent lists. */
11312 list_equal_p (const_tree t1
, const_tree t2
)
11314 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11315 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11320 /* Return true iff conversion in EXP generates no instruction. Mark
11321 it inline so that we fully inline into the stripping functions even
11322 though we have two uses of this function. */
11325 tree_nop_conversion (const_tree exp
)
11327 tree outer_type
, inner_type
;
11329 if (!CONVERT_EXPR_P (exp
)
11330 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11332 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11335 outer_type
= TREE_TYPE (exp
);
11336 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11341 /* Use precision rather then machine mode when we can, which gives
11342 the correct answer even for submode (bit-field) types. */
11343 if ((INTEGRAL_TYPE_P (outer_type
)
11344 || POINTER_TYPE_P (outer_type
)
11345 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11346 && (INTEGRAL_TYPE_P (inner_type
)
11347 || POINTER_TYPE_P (inner_type
)
11348 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11349 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11351 /* Otherwise fall back on comparing machine modes (e.g. for
11352 aggregate types, floats). */
11353 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11356 /* Return true iff conversion in EXP generates no instruction. Don't
11357 consider conversions changing the signedness. */
11360 tree_sign_nop_conversion (const_tree exp
)
11362 tree outer_type
, inner_type
;
11364 if (!tree_nop_conversion (exp
))
11367 outer_type
= TREE_TYPE (exp
);
11368 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11370 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11371 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11374 /* Strip conversions from EXP according to tree_nop_conversion and
11375 return the resulting expression. */
11378 tree_strip_nop_conversions (tree exp
)
11380 while (tree_nop_conversion (exp
))
11381 exp
= TREE_OPERAND (exp
, 0);
11385 /* Strip conversions from EXP according to tree_sign_nop_conversion
11386 and return the resulting expression. */
11389 tree_strip_sign_nop_conversions (tree exp
)
11391 while (tree_sign_nop_conversion (exp
))
11392 exp
= TREE_OPERAND (exp
, 0);
11396 /* Avoid any floating point extensions from EXP. */
11398 strip_float_extensions (tree exp
)
11400 tree sub
, expt
, subt
;
11402 /* For floating point constant look up the narrowest type that can hold
11403 it properly and handle it like (type)(narrowest_type)constant.
11404 This way we can optimize for instance a=a*2.0 where "a" is float
11405 but 2.0 is double constant. */
11406 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11408 REAL_VALUE_TYPE orig
;
11411 orig
= TREE_REAL_CST (exp
);
11412 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11413 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11414 type
= float_type_node
;
11415 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11416 > TYPE_PRECISION (double_type_node
)
11417 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11418 type
= double_type_node
;
11420 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11423 if (!CONVERT_EXPR_P (exp
))
11426 sub
= TREE_OPERAND (exp
, 0);
11427 subt
= TREE_TYPE (sub
);
11428 expt
= TREE_TYPE (exp
);
11430 if (!FLOAT_TYPE_P (subt
))
11433 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11436 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11439 return strip_float_extensions (sub
);
11442 /* Strip out all handled components that produce invariant
11446 strip_invariant_refs (const_tree op
)
11448 while (handled_component_p (op
))
11450 switch (TREE_CODE (op
))
11453 case ARRAY_RANGE_REF
:
11454 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11455 || TREE_OPERAND (op
, 2) != NULL_TREE
11456 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11460 case COMPONENT_REF
:
11461 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11467 op
= TREE_OPERAND (op
, 0);
11473 static GTY(()) tree gcc_eh_personality_decl
;
11475 /* Return the GCC personality function decl. */
11478 lhd_gcc_personality (void)
11480 if (!gcc_eh_personality_decl
)
11481 gcc_eh_personality_decl
= build_personality_function ("gcc");
11482 return gcc_eh_personality_decl
;
11485 /* Try to find a base info of BINFO that would have its field decl at offset
11486 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
11487 found, return, otherwise return NULL_TREE. */
11490 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
11492 tree type
= BINFO_TYPE (binfo
);
11496 HOST_WIDE_INT pos
, size
;
11500 if (TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (expected_type
))
11505 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
11507 if (TREE_CODE (fld
) != FIELD_DECL
)
11510 pos
= int_bit_position (fld
);
11511 size
= tree_low_cst (DECL_SIZE (fld
), 1);
11512 if (pos
<= offset
&& (pos
+ size
) > offset
)
11515 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
11518 if (!DECL_ARTIFICIAL (fld
))
11520 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
11524 /* Offset 0 indicates the primary base, whose vtable contents are
11525 represented in the binfo for the derived class. */
11526 else if (offset
!= 0)
11528 tree base_binfo
, found_binfo
= NULL_TREE
;
11529 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11530 if (TREE_TYPE (base_binfo
) == TREE_TYPE (fld
))
11532 found_binfo
= base_binfo
;
11537 binfo
= found_binfo
;
11540 type
= TREE_TYPE (fld
);
11545 /* Returns true if X is a typedef decl. */
11548 is_typedef_decl (tree x
)
11550 return (x
&& TREE_CODE (x
) == TYPE_DECL
11551 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
11554 /* Returns true iff TYPE is a type variant created for a typedef. */
11557 typedef_variant_p (tree type
)
11559 return is_typedef_decl (TYPE_NAME (type
));
11562 /* Warn about a use of an identifier which was marked deprecated. */
11564 warn_deprecated_use (tree node
, tree attr
)
11568 if (node
== 0 || !warn_deprecated_decl
)
11574 attr
= DECL_ATTRIBUTES (node
);
11575 else if (TYPE_P (node
))
11577 tree decl
= TYPE_STUB_DECL (node
);
11579 attr
= lookup_attribute ("deprecated",
11580 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
11585 attr
= lookup_attribute ("deprecated", attr
);
11588 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
11594 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
11596 warning (OPT_Wdeprecated_declarations
,
11597 "%qD is deprecated (declared at %s:%d): %s",
11598 node
, xloc
.file
, xloc
.line
, msg
);
11600 warning (OPT_Wdeprecated_declarations
,
11601 "%qD is deprecated (declared at %s:%d)",
11602 node
, xloc
.file
, xloc
.line
);
11604 else if (TYPE_P (node
))
11606 tree what
= NULL_TREE
;
11607 tree decl
= TYPE_STUB_DECL (node
);
11609 if (TYPE_NAME (node
))
11611 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
11612 what
= TYPE_NAME (node
);
11613 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
11614 && DECL_NAME (TYPE_NAME (node
)))
11615 what
= DECL_NAME (TYPE_NAME (node
));
11620 expanded_location xloc
11621 = expand_location (DECL_SOURCE_LOCATION (decl
));
11625 warning (OPT_Wdeprecated_declarations
,
11626 "%qE is deprecated (declared at %s:%d): %s",
11627 what
, xloc
.file
, xloc
.line
, msg
);
11629 warning (OPT_Wdeprecated_declarations
,
11630 "%qE is deprecated (declared at %s:%d)", what
,
11631 xloc
.file
, xloc
.line
);
11636 warning (OPT_Wdeprecated_declarations
,
11637 "type is deprecated (declared at %s:%d): %s",
11638 xloc
.file
, xloc
.line
, msg
);
11640 warning (OPT_Wdeprecated_declarations
,
11641 "type is deprecated (declared at %s:%d)",
11642 xloc
.file
, xloc
.line
);
11650 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
11653 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
11658 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
11661 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
11667 #include "gt-tree.h"