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"
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, tree
);
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
);
221 static bool decls_same_for_odr (tree decl1
, tree decl2
);
223 tree global_trees
[TI_MAX
];
224 tree integer_types
[itk_none
];
226 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
228 /* Number of operands for each OpenMP clause. */
229 unsigned const char omp_clause_num_ops
[] =
231 0, /* OMP_CLAUSE_ERROR */
232 1, /* OMP_CLAUSE_PRIVATE */
233 1, /* OMP_CLAUSE_SHARED */
234 1, /* OMP_CLAUSE_FIRSTPRIVATE */
235 2, /* OMP_CLAUSE_LASTPRIVATE */
236 4, /* OMP_CLAUSE_REDUCTION */
237 1, /* OMP_CLAUSE_COPYIN */
238 1, /* OMP_CLAUSE_COPYPRIVATE */
239 2, /* OMP_CLAUSE_LINEAR */
240 1, /* OMP_CLAUSE_UNIFORM */
241 1, /* OMP_CLAUSE_IF */
242 1, /* OMP_CLAUSE_NUM_THREADS */
243 1, /* OMP_CLAUSE_SCHEDULE */
244 0, /* OMP_CLAUSE_NOWAIT */
245 0, /* OMP_CLAUSE_ORDERED */
246 0, /* OMP_CLAUSE_DEFAULT */
247 3, /* OMP_CLAUSE_COLLAPSE */
248 0, /* OMP_CLAUSE_UNTIED */
249 1, /* OMP_CLAUSE_FINAL */
250 0, /* OMP_CLAUSE_MERGEABLE */
251 1, /* OMP_CLAUSE_SAFELEN */
252 1, /* OMP_CLAUSE__SIMDUID_ */
255 const char * const omp_clause_code_name
[] =
282 /* Return the tree node structure used by tree code CODE. */
284 static inline enum tree_node_structure_enum
285 tree_node_structure_for_code (enum tree_code code
)
287 switch (TREE_CODE_CLASS (code
))
289 case tcc_declaration
:
294 return TS_FIELD_DECL
;
300 return TS_LABEL_DECL
;
302 return TS_RESULT_DECL
;
303 case DEBUG_EXPR_DECL
:
306 return TS_CONST_DECL
;
310 return TS_FUNCTION_DECL
;
311 case TRANSLATION_UNIT_DECL
:
312 return TS_TRANSLATION_UNIT_DECL
;
314 return TS_DECL_NON_COMMON
;
318 return TS_TYPE_NON_COMMON
;
327 default: /* tcc_constant and tcc_exceptional */
332 /* tcc_constant cases. */
333 case INTEGER_CST
: return TS_INT_CST
;
334 case REAL_CST
: return TS_REAL_CST
;
335 case FIXED_CST
: return TS_FIXED_CST
;
336 case COMPLEX_CST
: return TS_COMPLEX
;
337 case VECTOR_CST
: return TS_VECTOR
;
338 case STRING_CST
: return TS_STRING
;
339 /* tcc_exceptional cases. */
340 case ERROR_MARK
: return TS_COMMON
;
341 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
342 case TREE_LIST
: return TS_LIST
;
343 case TREE_VEC
: return TS_VEC
;
344 case SSA_NAME
: return TS_SSA_NAME
;
345 case PLACEHOLDER_EXPR
: return TS_COMMON
;
346 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
347 case BLOCK
: return TS_BLOCK
;
348 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
349 case TREE_BINFO
: return TS_BINFO
;
350 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
351 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
352 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
360 /* Initialize tree_contains_struct to describe the hierarchy of tree
364 initialize_tree_contains_struct (void)
368 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
371 enum tree_node_structure_enum ts_code
;
373 code
= (enum tree_code
) i
;
374 ts_code
= tree_node_structure_for_code (code
);
376 /* Mark the TS structure itself. */
377 tree_contains_struct
[code
][ts_code
] = 1;
379 /* Mark all the structures that TS is derived from. */
397 case TS_STATEMENT_LIST
:
398 MARK_TS_TYPED (code
);
402 case TS_DECL_MINIMAL
:
408 case TS_OPTIMIZATION
:
409 case TS_TARGET_OPTION
:
410 MARK_TS_COMMON (code
);
413 case TS_TYPE_WITH_LANG_SPECIFIC
:
414 MARK_TS_TYPE_COMMON (code
);
417 case TS_TYPE_NON_COMMON
:
418 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
422 MARK_TS_DECL_MINIMAL (code
);
427 MARK_TS_DECL_COMMON (code
);
430 case TS_DECL_NON_COMMON
:
431 MARK_TS_DECL_WITH_VIS (code
);
434 case TS_DECL_WITH_VIS
:
438 MARK_TS_DECL_WRTL (code
);
442 MARK_TS_DECL_COMMON (code
);
446 MARK_TS_DECL_WITH_VIS (code
);
450 case TS_FUNCTION_DECL
:
451 MARK_TS_DECL_NON_COMMON (code
);
454 case TS_TRANSLATION_UNIT_DECL
:
455 MARK_TS_DECL_COMMON (code
);
463 /* Basic consistency checks for attributes used in fold. */
464 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
465 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
466 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
467 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
468 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
469 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
470 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
471 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
472 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
473 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
474 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
475 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
476 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
477 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
478 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
479 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
480 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
481 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
482 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
483 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
484 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
485 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
486 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
487 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
488 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
489 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
490 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
491 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
492 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
493 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
494 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
495 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
496 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
497 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
498 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
499 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
500 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
501 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
510 /* Initialize the hash table of types. */
511 type_hash_table
= htab_create_ggc (TYPE_HASH_INITIAL_SIZE
, type_hash_hash
,
514 debug_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
515 tree_decl_map_eq
, 0);
517 value_expr_for_decl
= htab_create_ggc (512, tree_decl_map_hash
,
518 tree_decl_map_eq
, 0);
519 init_priority_for_decl
= htab_create_ggc (512, tree_priority_map_hash
,
520 tree_priority_map_eq
, 0);
522 int_cst_hash_table
= htab_create_ggc (1024, int_cst_hash_hash
,
523 int_cst_hash_eq
, NULL
);
525 int_cst_node
= make_node (INTEGER_CST
);
527 cl_option_hash_table
= htab_create_ggc (64, cl_option_hash_hash
,
528 cl_option_hash_eq
, NULL
);
530 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
531 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
533 /* Initialize the tree_contains_struct array. */
534 initialize_tree_contains_struct ();
535 lang_hooks
.init_ts ();
539 /* The name of the object as the assembler will see it (but before any
540 translations made by ASM_OUTPUT_LABELREF). Often this is the same
541 as DECL_NAME. It is an IDENTIFIER_NODE. */
543 decl_assembler_name (tree decl
)
545 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
546 lang_hooks
.set_decl_assembler_name (decl
);
547 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
550 /* Compare ASMNAME with the DECL_ASSEMBLER_NAME of DECL. */
553 decl_assembler_name_equal (tree decl
, const_tree asmname
)
555 tree decl_asmname
= DECL_ASSEMBLER_NAME (decl
);
556 const char *decl_str
;
557 const char *asmname_str
;
560 if (decl_asmname
== asmname
)
563 decl_str
= IDENTIFIER_POINTER (decl_asmname
);
564 asmname_str
= IDENTIFIER_POINTER (asmname
);
567 /* If the target assembler name was set by the user, things are trickier.
568 We have a leading '*' to begin with. After that, it's arguable what
569 is the correct thing to do with -fleading-underscore. Arguably, we've
570 historically been doing the wrong thing in assemble_alias by always
571 printing the leading underscore. Since we're not changing that, make
572 sure user_label_prefix follows the '*' before matching. */
573 if (decl_str
[0] == '*')
575 size_t ulp_len
= strlen (user_label_prefix
);
581 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
582 decl_str
+= ulp_len
, test
=true;
586 if (asmname_str
[0] == '*')
588 size_t ulp_len
= strlen (user_label_prefix
);
594 else if (strncmp (asmname_str
, user_label_prefix
, ulp_len
) == 0)
595 asmname_str
+= ulp_len
, test
=true;
602 return strcmp (decl_str
, asmname_str
) == 0;
605 /* Hash asmnames ignoring the user specified marks. */
608 decl_assembler_name_hash (const_tree asmname
)
610 if (IDENTIFIER_POINTER (asmname
)[0] == '*')
612 const char *decl_str
= IDENTIFIER_POINTER (asmname
) + 1;
613 size_t ulp_len
= strlen (user_label_prefix
);
617 else if (strncmp (decl_str
, user_label_prefix
, ulp_len
) == 0)
620 return htab_hash_string (decl_str
);
623 return htab_hash_string (IDENTIFIER_POINTER (asmname
));
626 /* Compute the number of bytes occupied by a tree with code CODE.
627 This function cannot be used for nodes that have variable sizes,
628 including TREE_VEC, STRING_CST, and CALL_EXPR. */
630 tree_code_size (enum tree_code code
)
632 switch (TREE_CODE_CLASS (code
))
634 case tcc_declaration
: /* A decl node */
639 return sizeof (struct tree_field_decl
);
641 return sizeof (struct tree_parm_decl
);
643 return sizeof (struct tree_var_decl
);
645 return sizeof (struct tree_label_decl
);
647 return sizeof (struct tree_result_decl
);
649 return sizeof (struct tree_const_decl
);
651 return sizeof (struct tree_type_decl
);
653 return sizeof (struct tree_function_decl
);
654 case DEBUG_EXPR_DECL
:
655 return sizeof (struct tree_decl_with_rtl
);
657 return sizeof (struct tree_decl_non_common
);
661 case tcc_type
: /* a type node */
662 return sizeof (struct tree_type_non_common
);
664 case tcc_reference
: /* a reference */
665 case tcc_expression
: /* an expression */
666 case tcc_statement
: /* an expression with side effects */
667 case tcc_comparison
: /* a comparison expression */
668 case tcc_unary
: /* a unary arithmetic expression */
669 case tcc_binary
: /* a binary arithmetic expression */
670 return (sizeof (struct tree_exp
)
671 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
673 case tcc_constant
: /* a constant */
676 case INTEGER_CST
: return sizeof (struct tree_int_cst
);
677 case REAL_CST
: return sizeof (struct tree_real_cst
);
678 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
679 case COMPLEX_CST
: return sizeof (struct tree_complex
);
680 case VECTOR_CST
: return sizeof (struct tree_vector
);
681 case STRING_CST
: gcc_unreachable ();
683 return lang_hooks
.tree_size (code
);
686 case tcc_exceptional
: /* something random, like an identifier. */
689 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
690 case TREE_LIST
: return sizeof (struct tree_list
);
693 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
696 case OMP_CLAUSE
: gcc_unreachable ();
698 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
700 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
701 case BLOCK
: return sizeof (struct tree_block
);
702 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
703 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
704 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
707 return lang_hooks
.tree_size (code
);
715 /* Compute the number of bytes occupied by NODE. This routine only
716 looks at TREE_CODE, except for those nodes that have variable sizes. */
718 tree_size (const_tree node
)
720 const enum tree_code code
= TREE_CODE (node
);
724 return (offsetof (struct tree_binfo
, base_binfos
)
726 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
729 return (sizeof (struct tree_vec
)
730 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
733 return (sizeof (struct tree_vector
)
734 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
737 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
740 return (sizeof (struct tree_omp_clause
)
741 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
745 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
746 return (sizeof (struct tree_exp
)
747 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
749 return tree_code_size (code
);
753 /* Record interesting allocation statistics for a tree node with CODE
757 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
758 size_t length ATTRIBUTE_UNUSED
)
760 enum tree_code_class type
= TREE_CODE_CLASS (code
);
763 if (!GATHER_STATISTICS
)
768 case tcc_declaration
: /* A decl node */
772 case tcc_type
: /* a type node */
776 case tcc_statement
: /* an expression with side effects */
780 case tcc_reference
: /* a reference */
784 case tcc_expression
: /* an expression */
785 case tcc_comparison
: /* a comparison expression */
786 case tcc_unary
: /* a unary arithmetic expression */
787 case tcc_binary
: /* a binary arithmetic expression */
791 case tcc_constant
: /* a constant */
795 case tcc_exceptional
: /* something random, like an identifier. */
798 case IDENTIFIER_NODE
:
811 kind
= ssa_name_kind
;
823 kind
= omp_clause_kind
;
840 tree_code_counts
[(int) code
]++;
841 tree_node_counts
[(int) kind
]++;
842 tree_node_sizes
[(int) kind
] += length
;
845 /* Allocate and return a new UID from the DECL_UID namespace. */
848 allocate_decl_uid (void)
850 return next_decl_uid
++;
853 /* Return a newly allocated node of code CODE. For decl and type
854 nodes, some other fields are initialized. The rest of the node is
855 initialized to zero. This function cannot be used for TREE_VEC or
856 OMP_CLAUSE nodes, which is enforced by asserts in tree_code_size.
858 Achoo! I got a code in the node. */
861 make_node_stat (enum tree_code code MEM_STAT_DECL
)
864 enum tree_code_class type
= TREE_CODE_CLASS (code
);
865 size_t length
= tree_code_size (code
);
867 record_node_allocation_statistics (code
, length
);
869 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
870 TREE_SET_CODE (t
, code
);
875 TREE_SIDE_EFFECTS (t
) = 1;
878 case tcc_declaration
:
879 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
881 if (code
== FUNCTION_DECL
)
883 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
884 DECL_MODE (t
) = FUNCTION_MODE
;
889 DECL_SOURCE_LOCATION (t
) = input_location
;
890 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
891 DECL_UID (t
) = --next_debug_decl_uid
;
894 DECL_UID (t
) = allocate_decl_uid ();
895 SET_DECL_PT_UID (t
, -1);
897 if (TREE_CODE (t
) == LABEL_DECL
)
898 LABEL_DECL_UID (t
) = -1;
903 TYPE_UID (t
) = next_type_uid
++;
904 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
905 TYPE_USER_ALIGN (t
) = 0;
906 TYPE_MAIN_VARIANT (t
) = t
;
907 TYPE_CANONICAL (t
) = t
;
909 /* Default to no attributes for type, but let target change that. */
910 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
911 targetm
.set_default_type_attributes (t
);
913 /* We have not yet computed the alias set for this type. */
914 TYPE_ALIAS_SET (t
) = -1;
918 TREE_CONSTANT (t
) = 1;
927 case PREDECREMENT_EXPR
:
928 case PREINCREMENT_EXPR
:
929 case POSTDECREMENT_EXPR
:
930 case POSTINCREMENT_EXPR
:
931 /* All of these have side-effects, no matter what their
933 TREE_SIDE_EFFECTS (t
) = 1;
942 /* Other classes need no special treatment. */
949 /* Return a new node with the same contents as NODE except that its
950 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
953 copy_node_stat (tree node MEM_STAT_DECL
)
956 enum tree_code code
= TREE_CODE (node
);
959 gcc_assert (code
!= STATEMENT_LIST
);
961 length
= tree_size (node
);
962 record_node_allocation_statistics (code
, length
);
963 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
964 memcpy (t
, node
, length
);
966 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
968 TREE_ASM_WRITTEN (t
) = 0;
969 TREE_VISITED (t
) = 0;
971 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
973 if (code
== DEBUG_EXPR_DECL
)
974 DECL_UID (t
) = --next_debug_decl_uid
;
977 DECL_UID (t
) = allocate_decl_uid ();
978 if (DECL_PT_UID_SET_P (node
))
979 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
981 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
982 && DECL_HAS_VALUE_EXPR_P (node
))
984 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
985 DECL_HAS_VALUE_EXPR_P (t
) = 1;
987 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
988 if (TREE_CODE (node
) == VAR_DECL
)
989 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
990 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
992 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
993 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
995 if (TREE_CODE (node
) == FUNCTION_DECL
)
996 DECL_STRUCT_FUNCTION (t
) = NULL
;
998 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1000 TYPE_UID (t
) = next_type_uid
++;
1001 /* The following is so that the debug code for
1002 the copy is different from the original type.
1003 The two statements usually duplicate each other
1004 (because they clear fields of the same union),
1005 but the optimizer should catch that. */
1006 TYPE_SYMTAB_POINTER (t
) = 0;
1007 TYPE_SYMTAB_ADDRESS (t
) = 0;
1009 /* Do not copy the values cache. */
1010 if (TYPE_CACHED_VALUES_P(t
))
1012 TYPE_CACHED_VALUES_P (t
) = 0;
1013 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1016 if (TYPE_HAS_BLOCK_FACTOR (node
))
1017 SET_TYPE_BLOCK_FACTOR (t
, TYPE_BLOCK_FACTOR (node
));
1023 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1024 For example, this can copy a list made of TREE_LIST nodes. */
1027 copy_list (tree list
)
1035 head
= prev
= copy_node (list
);
1036 next
= TREE_CHAIN (list
);
1039 TREE_CHAIN (prev
) = copy_node (next
);
1040 prev
= TREE_CHAIN (prev
);
1041 next
= TREE_CHAIN (next
);
1047 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1050 build_int_cst (tree type
, HOST_WIDE_INT low
)
1052 /* Support legacy code. */
1054 type
= integer_type_node
;
1056 return double_int_to_tree (type
, double_int::from_shwi (low
));
1059 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1062 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1066 return double_int_to_tree (type
, double_int::from_shwi (low
));
1069 /* Constructs tree in type TYPE from with value given by CST. Signedness
1070 of CST is assumed to be the same as the signedness of TYPE. */
1073 double_int_to_tree (tree type
, double_int cst
)
1075 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1077 cst
= cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1079 return build_int_cst_wide (type
, cst
.low
, cst
.high
);
1082 /* Returns true if CST fits into range of TYPE. Signedness of CST is assumed
1083 to be the same as the signedness of TYPE. */
1086 double_int_fits_to_tree_p (const_tree type
, double_int cst
)
1088 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1091 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1096 /* We force the double_int CST to the range of the type TYPE by sign or
1097 zero extending it. OVERFLOWABLE indicates if we are interested in
1098 overflow of the value, when >0 we are only interested in signed
1099 overflow, for <0 we are interested in any overflow. OVERFLOWED
1100 indicates whether overflow has already occurred. CONST_OVERFLOWED
1101 indicates whether constant overflow has already occurred. We force
1102 T's value to be within range of T's type (by setting to 0 or 1 all
1103 the bits outside the type's range). We set TREE_OVERFLOWED if,
1104 OVERFLOWED is nonzero,
1105 or OVERFLOWABLE is >0 and signed overflow occurs
1106 or OVERFLOWABLE is <0 and any overflow occurs
1107 We return a new tree node for the extended double_int. The node
1108 is shared if no overflow flags are set. */
1112 force_fit_type_double (tree type
, double_int cst
, int overflowable
,
1115 bool sign_extended_type
= !TYPE_UNSIGNED (type
);
1117 /* If we need to set overflow flags, return a new unshared node. */
1118 if (overflowed
|| !double_int_fits_to_tree_p(type
, cst
))
1122 || (overflowable
> 0 && sign_extended_type
))
1124 tree t
= make_node (INTEGER_CST
);
1126 = cst
.ext (TYPE_PRECISION (type
), !sign_extended_type
);
1127 TREE_TYPE (t
) = type
;
1128 TREE_OVERFLOW (t
) = 1;
1133 /* Else build a shared node. */
1134 return double_int_to_tree (type
, cst
);
1137 /* These are the hash table functions for the hash table of INTEGER_CST
1138 nodes of a sizetype. */
1140 /* Return the hash code code X, an INTEGER_CST. */
1143 int_cst_hash_hash (const void *x
)
1145 const_tree
const t
= (const_tree
) x
;
1147 return (TREE_INT_CST_HIGH (t
) ^ TREE_INT_CST_LOW (t
)
1148 ^ htab_hash_pointer (TREE_TYPE (t
)));
1151 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1152 is the same as that given by *Y, which is the same. */
1155 int_cst_hash_eq (const void *x
, const void *y
)
1157 const_tree
const xt
= (const_tree
) x
;
1158 const_tree
const yt
= (const_tree
) y
;
1160 return (TREE_TYPE (xt
) == TREE_TYPE (yt
)
1161 && TREE_INT_CST_HIGH (xt
) == TREE_INT_CST_HIGH (yt
)
1162 && TREE_INT_CST_LOW (xt
) == TREE_INT_CST_LOW (yt
));
1165 /* Create an INT_CST node of TYPE and value HI:LOW.
1166 The returned node is always shared. For small integers we use a
1167 per-type vector cache, for larger ones we use a single hash table. */
1170 build_int_cst_wide (tree type
, unsigned HOST_WIDE_INT low
, HOST_WIDE_INT hi
)
1178 switch (TREE_CODE (type
))
1181 gcc_assert (hi
== 0 && low
== 0);
1185 case REFERENCE_TYPE
:
1186 /* Cache NULL pointer. */
1195 /* Cache false or true. */
1203 if (TYPE_UNSIGNED (type
))
1206 limit
= INTEGER_SHARE_LIMIT
;
1207 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1213 limit
= INTEGER_SHARE_LIMIT
+ 1;
1214 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1216 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1230 /* Look for it in the type's vector of small shared ints. */
1231 if (!TYPE_CACHED_VALUES_P (type
))
1233 TYPE_CACHED_VALUES_P (type
) = 1;
1234 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1237 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1240 /* Make sure no one is clobbering the shared constant. */
1241 gcc_assert (TREE_TYPE (t
) == type
);
1242 gcc_assert (TREE_INT_CST_LOW (t
) == low
);
1243 gcc_assert (TREE_INT_CST_HIGH (t
) == hi
);
1247 /* Create a new shared int. */
1248 t
= make_node (INTEGER_CST
);
1250 TREE_INT_CST_LOW (t
) = low
;
1251 TREE_INT_CST_HIGH (t
) = hi
;
1252 TREE_TYPE (t
) = type
;
1254 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1259 /* Use the cache of larger shared ints. */
1262 TREE_INT_CST_LOW (int_cst_node
) = low
;
1263 TREE_INT_CST_HIGH (int_cst_node
) = hi
;
1264 TREE_TYPE (int_cst_node
) = type
;
1266 slot
= htab_find_slot (int_cst_hash_table
, int_cst_node
, INSERT
);
1270 /* Insert this one into the hash table. */
1273 /* Make a new node for next time round. */
1274 int_cst_node
= make_node (INTEGER_CST
);
1282 cache_integer_cst (tree t
)
1284 tree type
= TREE_TYPE (t
);
1285 HOST_WIDE_INT hi
= TREE_INT_CST_HIGH (t
);
1286 unsigned HOST_WIDE_INT low
= TREE_INT_CST_LOW (t
);
1290 gcc_assert (!TREE_OVERFLOW (t
));
1292 switch (TREE_CODE (type
))
1295 gcc_assert (hi
== 0 && low
== 0);
1299 case REFERENCE_TYPE
:
1300 /* Cache NULL pointer. */
1309 /* Cache false or true. */
1317 if (TYPE_UNSIGNED (type
))
1320 limit
= INTEGER_SHARE_LIMIT
;
1321 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1327 limit
= INTEGER_SHARE_LIMIT
+ 1;
1328 if (!hi
&& low
< (unsigned HOST_WIDE_INT
)INTEGER_SHARE_LIMIT
)
1330 else if (hi
== -1 && low
== -(unsigned HOST_WIDE_INT
)1)
1344 /* Look for it in the type's vector of small shared ints. */
1345 if (!TYPE_CACHED_VALUES_P (type
))
1347 TYPE_CACHED_VALUES_P (type
) = 1;
1348 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1351 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1352 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1356 /* Use the cache of larger shared ints. */
1359 slot
= htab_find_slot (int_cst_hash_table
, t
, INSERT
);
1360 /* If there is already an entry for the number verify it's the
1364 gcc_assert (TREE_INT_CST_LOW ((tree
)*slot
) == low
1365 && TREE_INT_CST_HIGH ((tree
)*slot
) == hi
);
1368 /* Otherwise insert this one into the hash table. */
1374 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1375 and the rest are zeros. */
1378 build_low_bits_mask (tree type
, unsigned bits
)
1382 gcc_assert (bits
<= TYPE_PRECISION (type
));
1384 if (bits
== TYPE_PRECISION (type
)
1385 && !TYPE_UNSIGNED (type
))
1386 /* Sign extended all-ones mask. */
1387 mask
= double_int_minus_one
;
1389 mask
= double_int::mask (bits
);
1391 return build_int_cst_wide (type
, mask
.low
, mask
.high
);
1394 /* Checks that X is integer constant that can be expressed in (unsigned)
1395 HOST_WIDE_INT without loss of precision. */
1398 cst_and_fits_in_hwi (const_tree x
)
1400 if (TREE_CODE (x
) != INTEGER_CST
)
1403 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1406 return (TREE_INT_CST_HIGH (x
) == 0
1407 || TREE_INT_CST_HIGH (x
) == -1);
1410 /* Build a newly constructed TREE_VEC node of length LEN. */
1413 make_vector_stat (unsigned len MEM_STAT_DECL
)
1416 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1418 record_node_allocation_statistics (VECTOR_CST
, length
);
1420 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1422 TREE_SET_CODE (t
, VECTOR_CST
);
1423 TREE_CONSTANT (t
) = 1;
1428 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1429 are in a list pointed to by VALS. */
1432 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1436 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1437 TREE_TYPE (v
) = type
;
1439 /* Iterate through elements and check for overflow. */
1440 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1442 tree value
= vals
[cnt
];
1444 VECTOR_CST_ELT (v
, cnt
) = value
;
1446 /* Don't crash if we get an address constant. */
1447 if (!CONSTANT_CLASS_P (value
))
1450 over
|= TREE_OVERFLOW (value
);
1453 TREE_OVERFLOW (v
) = over
;
1457 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1458 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1461 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1463 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1464 unsigned HOST_WIDE_INT idx
;
1467 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1469 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1470 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1472 return build_vector (type
, vec
);
1475 /* Build a vector of type VECTYPE where all the elements are SCs. */
1477 build_vector_from_val (tree vectype
, tree sc
)
1479 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1481 if (sc
== error_mark_node
)
1484 /* Verify that the vector type is suitable for SC. Note that there
1485 is some inconsistency in the type-system with respect to restrict
1486 qualifications of pointers. Vector types always have a main-variant
1487 element type and the qualification is applied to the vector-type.
1488 So TREE_TYPE (vector-type) does not return a properly qualified
1489 vector element-type. */
1490 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1491 TREE_TYPE (vectype
)));
1493 if (CONSTANT_CLASS_P (sc
))
1495 tree
*v
= XALLOCAVEC (tree
, nunits
);
1496 for (i
= 0; i
< nunits
; ++i
)
1498 return build_vector (vectype
, v
);
1502 vec
<constructor_elt
, va_gc
> *v
;
1503 vec_alloc (v
, nunits
);
1504 for (i
= 0; i
< nunits
; ++i
)
1505 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1506 return build_constructor (vectype
, v
);
1510 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1511 are in the vec pointed to by VALS. */
1513 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1515 tree c
= make_node (CONSTRUCTOR
);
1517 constructor_elt
*elt
;
1518 bool constant_p
= true;
1519 bool side_effects_p
= false;
1521 TREE_TYPE (c
) = type
;
1522 CONSTRUCTOR_ELTS (c
) = vals
;
1524 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1526 /* Mostly ctors will have elts that don't have side-effects, so
1527 the usual case is to scan all the elements. Hence a single
1528 loop for both const and side effects, rather than one loop
1529 each (with early outs). */
1530 if (!TREE_CONSTANT (elt
->value
))
1532 if (TREE_SIDE_EFFECTS (elt
->value
))
1533 side_effects_p
= true;
1536 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1537 TREE_CONSTANT (c
) = constant_p
;
1542 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1545 build_constructor_single (tree type
, tree index
, tree value
)
1547 vec
<constructor_elt
, va_gc
> *v
;
1548 constructor_elt elt
= {index
, value
};
1551 v
->quick_push (elt
);
1553 return build_constructor (type
, v
);
1557 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1558 are in a list pointed to by VALS. */
1560 build_constructor_from_list (tree type
, tree vals
)
1563 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1567 vec_alloc (v
, list_length (vals
));
1568 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1569 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1572 return build_constructor (type
, v
);
1575 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1576 of elements, provided as index/value pairs. */
1579 build_constructor_va (tree type
, int nelts
, ...)
1581 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1584 va_start (p
, nelts
);
1585 vec_alloc (v
, nelts
);
1588 tree index
= va_arg (p
, tree
);
1589 tree value
= va_arg (p
, tree
);
1590 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1593 return build_constructor (type
, v
);
1596 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1599 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1602 FIXED_VALUE_TYPE
*fp
;
1604 v
= make_node (FIXED_CST
);
1605 fp
= ggc_alloc_fixed_value ();
1606 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1608 TREE_TYPE (v
) = type
;
1609 TREE_FIXED_CST_PTR (v
) = fp
;
1613 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1616 build_real (tree type
, REAL_VALUE_TYPE d
)
1619 REAL_VALUE_TYPE
*dp
;
1622 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1623 Consider doing it via real_convert now. */
1625 v
= make_node (REAL_CST
);
1626 dp
= ggc_alloc_real_value ();
1627 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1629 TREE_TYPE (v
) = type
;
1630 TREE_REAL_CST_PTR (v
) = dp
;
1631 TREE_OVERFLOW (v
) = overflow
;
1635 /* Return a new REAL_CST node whose type is TYPE
1636 and whose value is the integer value of the INTEGER_CST node I. */
1639 real_value_from_int_cst (const_tree type
, const_tree i
)
1643 /* Clear all bits of the real value type so that we can later do
1644 bitwise comparisons to see if two values are the same. */
1645 memset (&d
, 0, sizeof d
);
1647 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
,
1648 TREE_INT_CST_LOW (i
), TREE_INT_CST_HIGH (i
),
1649 TYPE_UNSIGNED (TREE_TYPE (i
)));
1653 /* Given a tree representing an integer constant I, return a tree
1654 representing the same value as a floating-point constant of type TYPE. */
1657 build_real_from_int_cst (tree type
, const_tree i
)
1660 int overflow
= TREE_OVERFLOW (i
);
1662 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1664 TREE_OVERFLOW (v
) |= overflow
;
1668 /* Return a newly constructed STRING_CST node whose value is
1669 the LEN characters at STR.
1670 Note that for a C string literal, LEN should include the trailing NUL.
1671 The TREE_TYPE is not initialized. */
1674 build_string (int len
, const char *str
)
1679 /* Do not waste bytes provided by padding of struct tree_string. */
1680 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1682 record_node_allocation_statistics (STRING_CST
, length
);
1684 s
= ggc_alloc_tree_node (length
);
1686 memset (s
, 0, sizeof (struct tree_typed
));
1687 TREE_SET_CODE (s
, STRING_CST
);
1688 TREE_CONSTANT (s
) = 1;
1689 TREE_STRING_LENGTH (s
) = len
;
1690 memcpy (s
->string
.str
, str
, len
);
1691 s
->string
.str
[len
] = '\0';
1696 /* Return a newly constructed COMPLEX_CST node whose value is
1697 specified by the real and imaginary parts REAL and IMAG.
1698 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1699 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1702 build_complex (tree type
, tree real
, tree imag
)
1704 tree t
= make_node (COMPLEX_CST
);
1706 TREE_REALPART (t
) = real
;
1707 TREE_IMAGPART (t
) = imag
;
1708 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1709 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1713 /* Return a constant of arithmetic type TYPE which is the
1714 multiplicative identity of the set TYPE. */
1717 build_one_cst (tree type
)
1719 switch (TREE_CODE (type
))
1721 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1722 case POINTER_TYPE
: case REFERENCE_TYPE
:
1724 return build_int_cst (type
, 1);
1727 return build_real (type
, dconst1
);
1729 case FIXED_POINT_TYPE
:
1730 /* We can only generate 1 for accum types. */
1731 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1732 return build_fixed (type
, FCONST1(TYPE_MODE (type
)));
1736 tree scalar
= build_one_cst (TREE_TYPE (type
));
1738 return build_vector_from_val (type
, scalar
);
1742 return build_complex (type
,
1743 build_one_cst (TREE_TYPE (type
)),
1744 build_zero_cst (TREE_TYPE (type
)));
1751 /* Return an integer of type TYPE containing all 1's in as much precision as
1752 it contains, or a complex or vector whose subparts are such integers. */
1755 build_all_ones_cst (tree type
)
1757 if (TREE_CODE (type
) == COMPLEX_TYPE
)
1759 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
1760 return build_complex (type
, scalar
, scalar
);
1763 return build_minus_one_cst (type
);
1766 /* Return a constant of arithmetic type TYPE which is the
1767 opposite of the multiplicative identity of the set TYPE. */
1770 build_minus_one_cst (tree type
)
1772 switch (TREE_CODE (type
))
1774 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1775 case POINTER_TYPE
: case REFERENCE_TYPE
:
1777 return build_int_cst (type
, -1);
1780 return build_real (type
, dconstm1
);
1782 case FIXED_POINT_TYPE
:
1783 /* We can only generate 1 for accum types. */
1784 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1785 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
1790 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
1792 return build_vector_from_val (type
, scalar
);
1796 return build_complex (type
,
1797 build_minus_one_cst (TREE_TYPE (type
)),
1798 build_zero_cst (TREE_TYPE (type
)));
1805 /* Build 0 constant of type TYPE. This is used by constructor folding
1806 and thus the constant should be represented in memory by
1810 build_zero_cst (tree type
)
1812 switch (TREE_CODE (type
))
1814 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1815 case POINTER_TYPE
: case REFERENCE_TYPE
:
1816 case OFFSET_TYPE
: case NULLPTR_TYPE
:
1817 return build_int_cst (type
, 0);
1820 return build_real (type
, dconst0
);
1822 case FIXED_POINT_TYPE
:
1823 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
1827 tree scalar
= build_zero_cst (TREE_TYPE (type
));
1829 return build_vector_from_val (type
, scalar
);
1834 tree zero
= build_zero_cst (TREE_TYPE (type
));
1836 return build_complex (type
, zero
, zero
);
1840 if (!AGGREGATE_TYPE_P (type
))
1841 return fold_convert (type
, integer_zero_node
);
1842 return build_constructor (type
, NULL
);
1847 /* Build a BINFO with LEN language slots. */
1850 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
1853 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
1854 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
1856 record_node_allocation_statistics (TREE_BINFO
, length
);
1858 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1860 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
1862 TREE_SET_CODE (t
, TREE_BINFO
);
1864 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
1869 /* Create a CASE_LABEL_EXPR tree node and return it. */
1872 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
1874 tree t
= make_node (CASE_LABEL_EXPR
);
1876 TREE_TYPE (t
) = void_type_node
;
1877 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
1879 CASE_LOW (t
) = low_value
;
1880 CASE_HIGH (t
) = high_value
;
1881 CASE_LABEL (t
) = label_decl
;
1882 CASE_CHAIN (t
) = NULL_TREE
;
1887 /* Build a newly constructed TREE_VEC node of length LEN. */
1890 make_tree_vec_stat (int len MEM_STAT_DECL
)
1893 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
1895 record_node_allocation_statistics (TREE_VEC
, length
);
1897 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1899 TREE_SET_CODE (t
, TREE_VEC
);
1900 TREE_VEC_LENGTH (t
) = len
;
1905 /* Return 1 if EXPR is the integer constant zero or a complex constant
1909 integer_zerop (const_tree expr
)
1913 switch (TREE_CODE (expr
))
1916 return (TREE_INT_CST_LOW (expr
) == 0
1917 && TREE_INT_CST_HIGH (expr
) == 0);
1919 return (integer_zerop (TREE_REALPART (expr
))
1920 && integer_zerop (TREE_IMAGPART (expr
)));
1924 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1925 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
1934 /* Return 1 if EXPR is the integer constant one or the corresponding
1935 complex constant. */
1938 integer_onep (const_tree expr
)
1942 switch (TREE_CODE (expr
))
1945 return (TREE_INT_CST_LOW (expr
) == 1
1946 && TREE_INT_CST_HIGH (expr
) == 0);
1948 return (integer_onep (TREE_REALPART (expr
))
1949 && integer_zerop (TREE_IMAGPART (expr
)));
1953 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1954 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
1963 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
1964 it contains, or a complex or vector whose subparts are such integers. */
1967 integer_all_onesp (const_tree expr
)
1974 if (TREE_CODE (expr
) == COMPLEX_CST
1975 && integer_all_onesp (TREE_REALPART (expr
))
1976 && integer_all_onesp (TREE_IMAGPART (expr
)))
1979 else if (TREE_CODE (expr
) == VECTOR_CST
)
1982 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
1983 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
1988 else if (TREE_CODE (expr
) != INTEGER_CST
)
1991 uns
= TYPE_UNSIGNED (TREE_TYPE (expr
));
1992 if (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
1993 && TREE_INT_CST_HIGH (expr
) == -1)
1998 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
1999 if (prec
>= HOST_BITS_PER_WIDE_INT
)
2001 HOST_WIDE_INT high_value
;
2004 shift_amount
= prec
- HOST_BITS_PER_WIDE_INT
;
2006 /* Can not handle precisions greater than twice the host int size. */
2007 gcc_assert (shift_amount
<= HOST_BITS_PER_WIDE_INT
);
2008 if (shift_amount
== HOST_BITS_PER_WIDE_INT
)
2009 /* Shifting by the host word size is undefined according to the ANSI
2010 standard, so we must handle this as a special case. */
2013 high_value
= ((HOST_WIDE_INT
) 1 << shift_amount
) - 1;
2015 return (TREE_INT_CST_LOW (expr
) == ~(unsigned HOST_WIDE_INT
) 0
2016 && TREE_INT_CST_HIGH (expr
) == high_value
);
2019 return TREE_INT_CST_LOW (expr
) == ((unsigned HOST_WIDE_INT
) 1 << prec
) - 1;
2022 /* Return 1 if EXPR is the integer constant minus one. */
2025 integer_minus_onep (const_tree expr
)
2029 if (TREE_CODE (expr
) == COMPLEX_CST
)
2030 return (integer_all_onesp (TREE_REALPART (expr
))
2031 && integer_zerop (TREE_IMAGPART (expr
)));
2033 return integer_all_onesp (expr
);
2036 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2040 integer_pow2p (const_tree expr
)
2043 unsigned HOST_WIDE_INT high
, low
;
2047 if (TREE_CODE (expr
) == COMPLEX_CST
2048 && integer_pow2p (TREE_REALPART (expr
))
2049 && integer_zerop (TREE_IMAGPART (expr
)))
2052 if (TREE_CODE (expr
) != INTEGER_CST
)
2055 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2056 high
= TREE_INT_CST_HIGH (expr
);
2057 low
= TREE_INT_CST_LOW (expr
);
2059 /* First clear all bits that are beyond the type's precision in case
2060 we've been sign extended. */
2062 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
2064 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2065 high
&= ~(HOST_WIDE_INT_M1U
<< (prec
- HOST_BITS_PER_WIDE_INT
));
2069 if (prec
< HOST_BITS_PER_WIDE_INT
)
2070 low
&= ~(HOST_WIDE_INT_M1U
<< prec
);
2073 if (high
== 0 && low
== 0)
2076 return ((high
== 0 && (low
& (low
- 1)) == 0)
2077 || (low
== 0 && (high
& (high
- 1)) == 0));
2080 /* Return 1 if EXPR is an integer constant other than zero or a
2081 complex constant other than zero. */
2084 integer_nonzerop (const_tree expr
)
2088 return ((TREE_CODE (expr
) == INTEGER_CST
2089 && (TREE_INT_CST_LOW (expr
) != 0
2090 || TREE_INT_CST_HIGH (expr
) != 0))
2091 || (TREE_CODE (expr
) == COMPLEX_CST
2092 && (integer_nonzerop (TREE_REALPART (expr
))
2093 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2096 /* Return 1 if EXPR is the fixed-point constant zero. */
2099 fixed_zerop (const_tree expr
)
2101 return (TREE_CODE (expr
) == FIXED_CST
2102 && TREE_FIXED_CST (expr
).data
.is_zero ());
2105 /* Return the power of two represented by a tree node known to be a
2109 tree_log2 (const_tree expr
)
2112 HOST_WIDE_INT high
, low
;
2116 if (TREE_CODE (expr
) == COMPLEX_CST
)
2117 return tree_log2 (TREE_REALPART (expr
));
2119 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2120 high
= TREE_INT_CST_HIGH (expr
);
2121 low
= TREE_INT_CST_LOW (expr
);
2123 /* First clear all bits that are beyond the type's precision in case
2124 we've been sign extended. */
2126 if (prec
== HOST_BITS_PER_DOUBLE_INT
)
2128 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2129 high
&= ~(HOST_WIDE_INT_M1U
<< (prec
- HOST_BITS_PER_WIDE_INT
));
2133 if (prec
< HOST_BITS_PER_WIDE_INT
)
2134 low
&= ~(HOST_WIDE_INT_M1U
<< prec
);
2137 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ exact_log2 (high
)
2138 : exact_log2 (low
));
2141 /* Similar, but return the largest integer Y such that 2 ** Y is less
2142 than or equal to EXPR. */
2145 tree_floor_log2 (const_tree expr
)
2148 HOST_WIDE_INT high
, low
;
2152 if (TREE_CODE (expr
) == COMPLEX_CST
)
2153 return tree_log2 (TREE_REALPART (expr
));
2155 prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2156 high
= TREE_INT_CST_HIGH (expr
);
2157 low
= TREE_INT_CST_LOW (expr
);
2159 /* First clear all bits that are beyond the type's precision in case
2160 we've been sign extended. Ignore if type's precision hasn't been set
2161 since what we are doing is setting it. */
2163 if (prec
== HOST_BITS_PER_DOUBLE_INT
|| prec
== 0)
2165 else if (prec
> HOST_BITS_PER_WIDE_INT
)
2166 high
&= ~(HOST_WIDE_INT_M1U
<< (prec
- HOST_BITS_PER_WIDE_INT
));
2170 if (prec
< HOST_BITS_PER_WIDE_INT
)
2171 low
&= ~(HOST_WIDE_INT_M1U
<< prec
);
2174 return (high
!= 0 ? HOST_BITS_PER_WIDE_INT
+ floor_log2 (high
)
2175 : floor_log2 (low
));
2178 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2179 decimal float constants, so don't return 1 for them. */
2182 real_zerop (const_tree expr
)
2186 switch (TREE_CODE (expr
))
2189 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2190 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2192 return real_zerop (TREE_REALPART (expr
))
2193 && real_zerop (TREE_IMAGPART (expr
));
2197 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2198 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2207 /* Return 1 if EXPR is the real constant one in real or complex form.
2208 Trailing zeroes matter for decimal float constants, so don't return
2212 real_onep (const_tree expr
)
2216 switch (TREE_CODE (expr
))
2219 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2220 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2222 return real_onep (TREE_REALPART (expr
))
2223 && real_zerop (TREE_IMAGPART (expr
));
2227 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2228 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2237 /* Return 1 if EXPR is the real constant two. Trailing zeroes matter
2238 for decimal float constants, so don't return 1 for them. */
2241 real_twop (const_tree expr
)
2245 switch (TREE_CODE (expr
))
2248 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst2
)
2249 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2251 return real_twop (TREE_REALPART (expr
))
2252 && real_zerop (TREE_IMAGPART (expr
));
2256 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2257 if (!real_twop (VECTOR_CST_ELT (expr
, i
)))
2266 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2267 matter for decimal float constants, so don't return 1 for them. */
2270 real_minus_onep (const_tree expr
)
2274 switch (TREE_CODE (expr
))
2277 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2278 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2280 return real_minus_onep (TREE_REALPART (expr
))
2281 && real_zerop (TREE_IMAGPART (expr
));
2285 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2286 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2295 /* Nonzero if EXP is a constant or a cast of a constant. */
2298 really_constant_p (const_tree exp
)
2300 /* This is not quite the same as STRIP_NOPS. It does more. */
2301 while (CONVERT_EXPR_P (exp
)
2302 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2303 exp
= TREE_OPERAND (exp
, 0);
2304 return TREE_CONSTANT (exp
);
2307 /* Return first list element whose TREE_VALUE is ELEM.
2308 Return 0 if ELEM is not in LIST. */
2311 value_member (tree elem
, tree list
)
2315 if (elem
== TREE_VALUE (list
))
2317 list
= TREE_CHAIN (list
);
2322 /* Return first list element whose TREE_PURPOSE is ELEM.
2323 Return 0 if ELEM is not in LIST. */
2326 purpose_member (const_tree elem
, tree list
)
2330 if (elem
== TREE_PURPOSE (list
))
2332 list
= TREE_CHAIN (list
);
2337 /* Return true if ELEM is in V. */
2340 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2344 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2350 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2354 chain_index (int idx
, tree chain
)
2356 for (; chain
&& idx
> 0; --idx
)
2357 chain
= TREE_CHAIN (chain
);
2361 /* Return nonzero if ELEM is part of the chain CHAIN. */
2364 chain_member (const_tree elem
, const_tree chain
)
2370 chain
= DECL_CHAIN (chain
);
2376 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2377 We expect a null pointer to mark the end of the chain.
2378 This is the Lisp primitive `length'. */
2381 list_length (const_tree t
)
2384 #ifdef ENABLE_TREE_CHECKING
2392 #ifdef ENABLE_TREE_CHECKING
2395 gcc_assert (p
!= q
);
2403 /* Returns the number of FIELD_DECLs in TYPE. */
2406 fields_length (const_tree type
)
2408 tree t
= TYPE_FIELDS (type
);
2411 for (; t
; t
= DECL_CHAIN (t
))
2412 if (TREE_CODE (t
) == FIELD_DECL
)
2418 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2419 UNION_TYPE TYPE, or NULL_TREE if none. */
2422 first_field (const_tree type
)
2424 tree t
= TYPE_FIELDS (type
);
2425 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2430 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2431 by modifying the last node in chain 1 to point to chain 2.
2432 This is the Lisp primitive `nconc'. */
2435 chainon (tree op1
, tree op2
)
2444 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2446 TREE_CHAIN (t1
) = op2
;
2448 #ifdef ENABLE_TREE_CHECKING
2451 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2452 gcc_assert (t2
!= t1
);
2459 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2462 tree_last (tree chain
)
2466 while ((next
= TREE_CHAIN (chain
)))
2471 /* Reverse the order of elements in the chain T,
2472 and return the new head of the chain (old last element). */
2477 tree prev
= 0, decl
, next
;
2478 for (decl
= t
; decl
; decl
= next
)
2480 /* We shouldn't be using this function to reverse BLOCK chains; we
2481 have blocks_nreverse for that. */
2482 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2483 next
= TREE_CHAIN (decl
);
2484 TREE_CHAIN (decl
) = prev
;
2490 /* Return a newly created TREE_LIST node whose
2491 purpose and value fields are PARM and VALUE. */
2494 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2496 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2497 TREE_PURPOSE (t
) = parm
;
2498 TREE_VALUE (t
) = value
;
2502 /* Build a chain of TREE_LIST nodes from a vector. */
2505 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2507 tree ret
= NULL_TREE
;
2511 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2513 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2514 pp
= &TREE_CHAIN (*pp
);
2519 /* Return a newly created TREE_LIST node whose
2520 purpose and value fields are PURPOSE and VALUE
2521 and whose TREE_CHAIN is CHAIN. */
2524 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2528 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2529 memset (node
, 0, sizeof (struct tree_common
));
2531 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2533 TREE_SET_CODE (node
, TREE_LIST
);
2534 TREE_CHAIN (node
) = chain
;
2535 TREE_PURPOSE (node
) = purpose
;
2536 TREE_VALUE (node
) = value
;
2540 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2544 ctor_to_vec (tree ctor
)
2546 vec
<tree
, va_gc
> *vec
;
2547 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2551 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2552 vec
->quick_push (val
);
2557 /* Return the size nominally occupied by an object of type TYPE
2558 when it resides in memory. The value is measured in units of bytes,
2559 and its data type is that normally used for type sizes
2560 (which is the first type created by make_signed_type or
2561 make_unsigned_type). */
2564 size_in_bytes (const_tree type
)
2568 if (type
== error_mark_node
)
2569 return integer_zero_node
;
2571 type
= TYPE_MAIN_VARIANT (type
);
2572 t
= TYPE_SIZE_UNIT (type
);
2576 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2577 return size_zero_node
;
2583 /* Return the size of TYPE (in bytes) as a wide integer
2584 or return -1 if the size can vary or is larger than an integer. */
2587 int_size_in_bytes (const_tree type
)
2591 if (type
== error_mark_node
)
2594 type
= TYPE_MAIN_VARIANT (type
);
2595 t
= TYPE_SIZE_UNIT (type
);
2597 || TREE_CODE (t
) != INTEGER_CST
2598 || TREE_INT_CST_HIGH (t
) != 0
2599 /* If the result would appear negative, it's too big to represent. */
2600 || (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0)
2603 return TREE_INT_CST_LOW (t
);
2606 /* Return the maximum size of TYPE (in bytes) as a wide integer
2607 or return -1 if the size can vary or is larger than an integer. */
2610 max_int_size_in_bytes (const_tree type
)
2612 HOST_WIDE_INT size
= -1;
2615 /* If this is an array type, check for a possible MAX_SIZE attached. */
2617 if (TREE_CODE (type
) == ARRAY_TYPE
)
2619 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2621 if (size_tree
&& host_integerp (size_tree
, 1))
2622 size
= tree_low_cst (size_tree
, 1);
2625 /* If we still haven't been able to get a size, see if the language
2626 can compute a maximum size. */
2630 size_tree
= lang_hooks
.types
.max_size (type
);
2632 if (size_tree
&& host_integerp (size_tree
, 1))
2633 size
= tree_low_cst (size_tree
, 1);
2639 /* Returns a tree for the size of EXP in bytes. */
2642 tree_expr_size (const_tree exp
)
2645 && DECL_SIZE_UNIT (exp
) != 0)
2646 return DECL_SIZE_UNIT (exp
);
2648 return size_in_bytes (TREE_TYPE (exp
));
2651 /* Return the bit position of FIELD, in bits from the start of the record.
2652 This is a tree of type bitsizetype. */
2655 bit_position (const_tree field
)
2657 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2658 DECL_FIELD_BIT_OFFSET (field
));
2661 /* Likewise, but return as an integer. It must be representable in
2662 that way (since it could be a signed value, we don't have the
2663 option of returning -1 like int_size_in_byte can. */
2666 int_bit_position (const_tree field
)
2668 return tree_low_cst (bit_position (field
), 0);
2671 /* Return the byte position of FIELD, in bytes from the start of the record.
2672 This is a tree of type sizetype. */
2675 byte_position (const_tree field
)
2677 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2678 DECL_FIELD_BIT_OFFSET (field
));
2681 /* Likewise, but return as an integer. It must be representable in
2682 that way (since it could be a signed value, we don't have the
2683 option of returning -1 like int_size_in_byte can. */
2686 int_byte_position (const_tree field
)
2688 return tree_low_cst (byte_position (field
), 0);
2691 /* Return the strictest alignment, in bits, that T is known to have. */
2694 expr_align (const_tree t
)
2696 unsigned int align0
, align1
;
2698 switch (TREE_CODE (t
))
2700 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2701 /* If we have conversions, we know that the alignment of the
2702 object must meet each of the alignments of the types. */
2703 align0
= expr_align (TREE_OPERAND (t
, 0));
2704 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2705 return MAX (align0
, align1
);
2707 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2708 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2709 case CLEANUP_POINT_EXPR
:
2710 /* These don't change the alignment of an object. */
2711 return expr_align (TREE_OPERAND (t
, 0));
2714 /* The best we can do is say that the alignment is the least aligned
2716 align0
= expr_align (TREE_OPERAND (t
, 1));
2717 align1
= expr_align (TREE_OPERAND (t
, 2));
2718 return MIN (align0
, align1
);
2720 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2721 meaningfully, it's always 1. */
2722 case LABEL_DECL
: case CONST_DECL
:
2723 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
2725 gcc_assert (DECL_ALIGN (t
) != 0);
2726 return DECL_ALIGN (t
);
2732 /* Otherwise take the alignment from that of the type. */
2733 return TYPE_ALIGN (TREE_TYPE (t
));
2736 /* Return, as a tree node, the number of elements for TYPE (which is an
2737 ARRAY_TYPE) minus one. This counts only elements of the top array. */
2740 array_type_nelts (const_tree type
)
2742 tree index_type
, min
, max
;
2744 /* If they did it with unspecified bounds, then we should have already
2745 given an error about it before we got here. */
2746 if (! TYPE_DOMAIN (type
))
2747 return error_mark_node
;
2749 index_type
= TYPE_DOMAIN (type
);
2750 min
= TYPE_MIN_VALUE (index_type
);
2751 max
= TYPE_MAX_VALUE (index_type
);
2753 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
2755 return error_mark_node
;
2757 return (integer_zerop (min
)
2759 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
2762 /* If arg is static -- a reference to an object in static storage -- then
2763 return the object. This is not the same as the C meaning of `static'.
2764 If arg isn't static, return NULL. */
2769 switch (TREE_CODE (arg
))
2772 /* Nested functions are static, even though taking their address will
2773 involve a trampoline as we unnest the nested function and create
2774 the trampoline on the tree level. */
2778 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2779 && ! DECL_THREAD_LOCAL_P (arg
)
2780 && ! DECL_DLLIMPORT_P (arg
)
2784 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
2788 return TREE_STATIC (arg
) ? arg
: NULL
;
2795 /* If the thing being referenced is not a field, then it is
2796 something language specific. */
2797 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
2799 /* If we are referencing a bitfield, we can't evaluate an
2800 ADDR_EXPR at compile time and so it isn't a constant. */
2801 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
2804 return staticp (TREE_OPERAND (arg
, 0));
2810 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
2813 case ARRAY_RANGE_REF
:
2814 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
2815 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
2816 return staticp (TREE_OPERAND (arg
, 0));
2820 case COMPOUND_LITERAL_EXPR
:
2821 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
2831 /* Return whether OP is a DECL whose address is function-invariant. */
2834 decl_address_invariant_p (const_tree op
)
2836 /* The conditions below are slightly less strict than the one in
2839 switch (TREE_CODE (op
))
2848 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2849 || DECL_THREAD_LOCAL_P (op
)
2850 || DECL_CONTEXT (op
) == current_function_decl
2851 || decl_function_context (op
) == current_function_decl
)
2856 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2857 || decl_function_context (op
) == current_function_decl
)
2868 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
2871 decl_address_ip_invariant_p (const_tree op
)
2873 /* The conditions below are slightly less strict than the one in
2876 switch (TREE_CODE (op
))
2884 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
2885 && !DECL_DLLIMPORT_P (op
))
2886 || DECL_THREAD_LOCAL_P (op
))
2891 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
2903 /* Return true if T is function-invariant (internal function, does
2904 not handle arithmetic; that's handled in skip_simple_arithmetic and
2905 tree_invariant_p). */
2907 static bool tree_invariant_p (tree t
);
2910 tree_invariant_p_1 (tree t
)
2914 if (TREE_CONSTANT (t
)
2915 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
2918 switch (TREE_CODE (t
))
2924 op
= TREE_OPERAND (t
, 0);
2925 while (handled_component_p (op
))
2927 switch (TREE_CODE (op
))
2930 case ARRAY_RANGE_REF
:
2931 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
2932 || TREE_OPERAND (op
, 2) != NULL_TREE
2933 || TREE_OPERAND (op
, 3) != NULL_TREE
)
2938 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
2944 op
= TREE_OPERAND (op
, 0);
2947 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
2956 /* Return true if T is function-invariant. */
2959 tree_invariant_p (tree t
)
2961 tree inner
= skip_simple_arithmetic (t
);
2962 return tree_invariant_p_1 (inner
);
2965 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
2966 Do this to any expression which may be used in more than one place,
2967 but must be evaluated only once.
2969 Normally, expand_expr would reevaluate the expression each time.
2970 Calling save_expr produces something that is evaluated and recorded
2971 the first time expand_expr is called on it. Subsequent calls to
2972 expand_expr just reuse the recorded value.
2974 The call to expand_expr that generates code that actually computes
2975 the value is the first call *at compile time*. Subsequent calls
2976 *at compile time* generate code to use the saved value.
2977 This produces correct result provided that *at run time* control
2978 always flows through the insns made by the first expand_expr
2979 before reaching the other places where the save_expr was evaluated.
2980 You, the caller of save_expr, must make sure this is so.
2982 Constants, and certain read-only nodes, are returned with no
2983 SAVE_EXPR because that is safe. Expressions containing placeholders
2984 are not touched; see tree.def for an explanation of what these
2988 save_expr (tree expr
)
2990 tree t
= fold (expr
);
2993 /* If the tree evaluates to a constant, then we don't want to hide that
2994 fact (i.e. this allows further folding, and direct checks for constants).
2995 However, a read-only object that has side effects cannot be bypassed.
2996 Since it is no problem to reevaluate literals, we just return the
2998 inner
= skip_simple_arithmetic (t
);
2999 if (TREE_CODE (inner
) == ERROR_MARK
)
3002 if (tree_invariant_p_1 (inner
))
3005 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3006 it means that the size or offset of some field of an object depends on
3007 the value within another field.
3009 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3010 and some variable since it would then need to be both evaluated once and
3011 evaluated more than once. Front-ends must assure this case cannot
3012 happen by surrounding any such subexpressions in their own SAVE_EXPR
3013 and forcing evaluation at the proper time. */
3014 if (contains_placeholder_p (inner
))
3017 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3018 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3020 /* This expression might be placed ahead of a jump to ensure that the
3021 value was computed on both sides of the jump. So make sure it isn't
3022 eliminated as dead. */
3023 TREE_SIDE_EFFECTS (t
) = 1;
3027 /* Look inside EXPR into any simple arithmetic operations. Return the
3028 outermost non-arithmetic or non-invariant node. */
3031 skip_simple_arithmetic (tree expr
)
3033 /* We don't care about whether this can be used as an lvalue in this
3035 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3036 expr
= TREE_OPERAND (expr
, 0);
3038 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3039 a constant, it will be more efficient to not make another SAVE_EXPR since
3040 it will allow better simplification and GCSE will be able to merge the
3041 computations if they actually occur. */
3044 if (UNARY_CLASS_P (expr
))
3045 expr
= TREE_OPERAND (expr
, 0);
3046 else if (BINARY_CLASS_P (expr
))
3048 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3049 expr
= TREE_OPERAND (expr
, 0);
3050 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3051 expr
= TREE_OPERAND (expr
, 1);
3062 /* Look inside EXPR into simple arithmetic operations involving constants.
3063 Return the outermost non-arithmetic or non-constant node. */
3066 skip_simple_constant_arithmetic (tree expr
)
3068 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3069 expr
= TREE_OPERAND (expr
, 0);
3073 if (UNARY_CLASS_P (expr
))
3074 expr
= TREE_OPERAND (expr
, 0);
3075 else if (BINARY_CLASS_P (expr
))
3077 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3078 expr
= TREE_OPERAND (expr
, 0);
3079 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3080 expr
= TREE_OPERAND (expr
, 1);
3091 /* Return which tree structure is used by T. */
3093 enum tree_node_structure_enum
3094 tree_node_structure (const_tree t
)
3096 const enum tree_code code
= TREE_CODE (t
);
3097 return tree_node_structure_for_code (code
);
3100 /* Set various status flags when building a CALL_EXPR object T. */
3103 process_call_operands (tree t
)
3105 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3106 bool read_only
= false;
3107 int i
= call_expr_flags (t
);
3109 /* Calls have side-effects, except those to const or pure functions. */
3110 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3111 side_effects
= true;
3112 /* Propagate TREE_READONLY of arguments for const functions. */
3116 if (!side_effects
|| read_only
)
3117 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3119 tree op
= TREE_OPERAND (t
, i
);
3120 if (op
&& TREE_SIDE_EFFECTS (op
))
3121 side_effects
= true;
3122 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3126 TREE_SIDE_EFFECTS (t
) = side_effects
;
3127 TREE_READONLY (t
) = read_only
;
3130 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3131 size or offset that depends on a field within a record. */
3134 contains_placeholder_p (const_tree exp
)
3136 enum tree_code code
;
3141 code
= TREE_CODE (exp
);
3142 if (code
== PLACEHOLDER_EXPR
)
3145 switch (TREE_CODE_CLASS (code
))
3148 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3149 position computations since they will be converted into a
3150 WITH_RECORD_EXPR involving the reference, which will assume
3151 here will be valid. */
3152 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3154 case tcc_exceptional
:
3155 if (code
== TREE_LIST
)
3156 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3157 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3162 case tcc_comparison
:
3163 case tcc_expression
:
3167 /* Ignoring the first operand isn't quite right, but works best. */
3168 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3171 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3172 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3173 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3176 /* The save_expr function never wraps anything containing
3177 a PLACEHOLDER_EXPR. */
3184 switch (TREE_CODE_LENGTH (code
))
3187 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3189 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3190 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3201 const_call_expr_arg_iterator iter
;
3202 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3203 if (CONTAINS_PLACEHOLDER_P (arg
))
3217 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3218 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3222 type_contains_placeholder_1 (const_tree type
)
3224 /* If the size contains a placeholder or the parent type (component type in
3225 the case of arrays) type involves a placeholder, this type does. */
3226 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3227 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3228 || (!POINTER_TYPE_P (type
)
3230 && type_contains_placeholder_p (TREE_TYPE (type
))))
3233 /* Now do type-specific checks. Note that the last part of the check above
3234 greatly limits what we have to do below. */
3235 switch (TREE_CODE (type
))
3243 case REFERENCE_TYPE
:
3252 case FIXED_POINT_TYPE
:
3253 /* Here we just check the bounds. */
3254 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3255 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3258 /* We have already checked the component type above, so just check the
3260 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3264 case QUAL_UNION_TYPE
:
3268 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3269 if (TREE_CODE (field
) == FIELD_DECL
3270 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3271 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3272 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3273 || type_contains_placeholder_p (TREE_TYPE (field
))))
3284 /* Wrapper around above function used to cache its result. */
3287 type_contains_placeholder_p (tree type
)
3291 /* If the contains_placeholder_bits field has been initialized,
3292 then we know the answer. */
3293 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3294 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3296 /* Indicate that we've seen this type node, and the answer is false.
3297 This is what we want to return if we run into recursion via fields. */
3298 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3300 /* Compute the real value. */
3301 result
= type_contains_placeholder_1 (type
);
3303 /* Store the real value. */
3304 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3309 /* Push tree EXP onto vector QUEUE if it is not already present. */
3312 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3317 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3318 if (simple_cst_equal (iter
, exp
) == 1)
3322 queue
->safe_push (exp
);
3325 /* Given a tree EXP, find all occurrences of references to fields
3326 in a PLACEHOLDER_EXPR and place them in vector REFS without
3327 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3328 we assume here that EXP contains only arithmetic expressions
3329 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3333 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3335 enum tree_code code
= TREE_CODE (exp
);
3339 /* We handle TREE_LIST and COMPONENT_REF separately. */
3340 if (code
== TREE_LIST
)
3342 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3343 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3345 else if (code
== COMPONENT_REF
)
3347 for (inner
= TREE_OPERAND (exp
, 0);
3348 REFERENCE_CLASS_P (inner
);
3349 inner
= TREE_OPERAND (inner
, 0))
3352 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3353 push_without_duplicates (exp
, refs
);
3355 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3358 switch (TREE_CODE_CLASS (code
))
3363 case tcc_declaration
:
3364 /* Variables allocated to static storage can stay. */
3365 if (!TREE_STATIC (exp
))
3366 push_without_duplicates (exp
, refs
);
3369 case tcc_expression
:
3370 /* This is the pattern built in ada/make_aligning_type. */
3371 if (code
== ADDR_EXPR
3372 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3374 push_without_duplicates (exp
, refs
);
3378 /* Fall through... */
3380 case tcc_exceptional
:
3383 case tcc_comparison
:
3385 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3386 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3390 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3391 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3399 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3400 return a tree with all occurrences of references to F in a
3401 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3402 CONST_DECLs. Note that we assume here that EXP contains only
3403 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3404 occurring only in their argument list. */
3407 substitute_in_expr (tree exp
, tree f
, tree r
)
3409 enum tree_code code
= TREE_CODE (exp
);
3410 tree op0
, op1
, op2
, op3
;
3413 /* We handle TREE_LIST and COMPONENT_REF separately. */
3414 if (code
== TREE_LIST
)
3416 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3417 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3418 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3421 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3423 else if (code
== COMPONENT_REF
)
3427 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3428 and it is the right field, replace it with R. */
3429 for (inner
= TREE_OPERAND (exp
, 0);
3430 REFERENCE_CLASS_P (inner
);
3431 inner
= TREE_OPERAND (inner
, 0))
3435 op1
= TREE_OPERAND (exp
, 1);
3437 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3440 /* If this expression hasn't been completed let, leave it alone. */
3441 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3444 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3445 if (op0
== TREE_OPERAND (exp
, 0))
3449 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3452 switch (TREE_CODE_CLASS (code
))
3457 case tcc_declaration
:
3463 case tcc_expression
:
3467 /* Fall through... */
3469 case tcc_exceptional
:
3472 case tcc_comparison
:
3474 switch (TREE_CODE_LENGTH (code
))
3480 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3481 if (op0
== TREE_OPERAND (exp
, 0))
3484 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3488 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3489 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3491 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3494 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3498 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3499 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3500 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3502 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3503 && op2
== TREE_OPERAND (exp
, 2))
3506 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3510 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3511 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3512 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3513 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3515 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3516 && op2
== TREE_OPERAND (exp
, 2)
3517 && op3
== TREE_OPERAND (exp
, 3))
3521 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3533 new_tree
= NULL_TREE
;
3535 /* If we are trying to replace F with a constant, inline back
3536 functions which do nothing else than computing a value from
3537 the arguments they are passed. This makes it possible to
3538 fold partially or entirely the replacement expression. */
3539 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3541 tree t
= maybe_inline_call_in_expr (exp
);
3543 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3546 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3548 tree op
= TREE_OPERAND (exp
, i
);
3549 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3553 new_tree
= copy_node (exp
);
3554 TREE_OPERAND (new_tree
, i
) = new_op
;
3560 new_tree
= fold (new_tree
);
3561 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3562 process_call_operands (new_tree
);
3573 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3575 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3576 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3581 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3582 for it within OBJ, a tree that is an object or a chain of references. */
3585 substitute_placeholder_in_expr (tree exp
, tree obj
)
3587 enum tree_code code
= TREE_CODE (exp
);
3588 tree op0
, op1
, op2
, op3
;
3591 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3592 in the chain of OBJ. */
3593 if (code
== PLACEHOLDER_EXPR
)
3595 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3598 for (elt
= obj
; elt
!= 0;
3599 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3600 || TREE_CODE (elt
) == COND_EXPR
)
3601 ? TREE_OPERAND (elt
, 1)
3602 : (REFERENCE_CLASS_P (elt
)
3603 || UNARY_CLASS_P (elt
)
3604 || BINARY_CLASS_P (elt
)
3605 || VL_EXP_CLASS_P (elt
)
3606 || EXPRESSION_CLASS_P (elt
))
3607 ? TREE_OPERAND (elt
, 0) : 0))
3608 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3611 for (elt
= obj
; elt
!= 0;
3612 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3613 || TREE_CODE (elt
) == COND_EXPR
)
3614 ? TREE_OPERAND (elt
, 1)
3615 : (REFERENCE_CLASS_P (elt
)
3616 || UNARY_CLASS_P (elt
)
3617 || BINARY_CLASS_P (elt
)
3618 || VL_EXP_CLASS_P (elt
)
3619 || EXPRESSION_CLASS_P (elt
))
3620 ? TREE_OPERAND (elt
, 0) : 0))
3621 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3622 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3624 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3626 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3627 survives until RTL generation, there will be an error. */
3631 /* TREE_LIST is special because we need to look at TREE_VALUE
3632 and TREE_CHAIN, not TREE_OPERANDS. */
3633 else if (code
== TREE_LIST
)
3635 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3636 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3637 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3640 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3643 switch (TREE_CODE_CLASS (code
))
3646 case tcc_declaration
:
3649 case tcc_exceptional
:
3652 case tcc_comparison
:
3653 case tcc_expression
:
3656 switch (TREE_CODE_LENGTH (code
))
3662 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3663 if (op0
== TREE_OPERAND (exp
, 0))
3666 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3670 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3671 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3673 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3676 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3680 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3681 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3682 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3684 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3685 && op2
== TREE_OPERAND (exp
, 2))
3688 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3692 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3693 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3694 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3695 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3697 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3698 && op2
== TREE_OPERAND (exp
, 2)
3699 && op3
== TREE_OPERAND (exp
, 3))
3703 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3715 new_tree
= NULL_TREE
;
3717 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3719 tree op
= TREE_OPERAND (exp
, i
);
3720 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
3724 new_tree
= copy_node (exp
);
3725 TREE_OPERAND (new_tree
, i
) = new_op
;
3731 new_tree
= fold (new_tree
);
3732 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3733 process_call_operands (new_tree
);
3744 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3746 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3747 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3752 /* Stabilize a reference so that we can use it any number of times
3753 without causing its operands to be evaluated more than once.
3754 Returns the stabilized reference. This works by means of save_expr,
3755 so see the caveats in the comments about save_expr.
3757 Also allows conversion expressions whose operands are references.
3758 Any other kind of expression is returned unchanged. */
3761 stabilize_reference (tree ref
)
3764 enum tree_code code
= TREE_CODE (ref
);
3771 /* No action is needed in this case. */
3776 case FIX_TRUNC_EXPR
:
3777 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
3781 result
= build_nt (INDIRECT_REF
,
3782 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
3786 result
= build_nt (COMPONENT_REF
,
3787 stabilize_reference (TREE_OPERAND (ref
, 0)),
3788 TREE_OPERAND (ref
, 1), NULL_TREE
);
3792 result
= build_nt (BIT_FIELD_REF
,
3793 stabilize_reference (TREE_OPERAND (ref
, 0)),
3794 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
3798 result
= build_nt (ARRAY_REF
,
3799 stabilize_reference (TREE_OPERAND (ref
, 0)),
3800 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3801 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3804 case ARRAY_RANGE_REF
:
3805 result
= build_nt (ARRAY_RANGE_REF
,
3806 stabilize_reference (TREE_OPERAND (ref
, 0)),
3807 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
3808 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
3812 /* We cannot wrap the first expression in a SAVE_EXPR, as then
3813 it wouldn't be ignored. This matters when dealing with
3815 return stabilize_reference_1 (ref
);
3817 /* If arg isn't a kind of lvalue we recognize, make no change.
3818 Caller should recognize the error for an invalid lvalue. */
3823 return error_mark_node
;
3826 TREE_TYPE (result
) = TREE_TYPE (ref
);
3827 TREE_READONLY (result
) = TREE_READONLY (ref
);
3828 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
3829 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
3830 TREE_SHARED (result
) = TREE_SHARED (ref
);
3831 TREE_STRICT (result
) = TREE_STRICT (ref
);
3832 TREE_RELAXED (result
) = TREE_RELAXED (ref
);
3837 /* Subroutine of stabilize_reference; this is called for subtrees of
3838 references. Any expression with side-effects must be put in a SAVE_EXPR
3839 to ensure that it is only evaluated once.
3841 We don't put SAVE_EXPR nodes around everything, because assigning very
3842 simple expressions to temporaries causes us to miss good opportunities
3843 for optimizations. Among other things, the opportunity to fold in the
3844 addition of a constant into an addressing mode often gets lost, e.g.
3845 "y[i+1] += x;". In general, we take the approach that we should not make
3846 an assignment unless we are forced into it - i.e., that any non-side effect
3847 operator should be allowed, and that cse should take care of coalescing
3848 multiple utterances of the same expression should that prove fruitful. */
3851 stabilize_reference_1 (tree e
)
3854 enum tree_code code
= TREE_CODE (e
);
3856 /* We cannot ignore const expressions because it might be a reference
3857 to a const array but whose index contains side-effects. But we can
3858 ignore things that are actual constant or that already have been
3859 handled by this function. */
3861 if (tree_invariant_p (e
))
3864 switch (TREE_CODE_CLASS (code
))
3866 case tcc_exceptional
:
3868 case tcc_declaration
:
3869 case tcc_comparison
:
3871 case tcc_expression
:
3874 /* If the expression has side-effects, then encase it in a SAVE_EXPR
3875 so that it will only be evaluated once. */
3876 /* The reference (r) and comparison (<) classes could be handled as
3877 below, but it is generally faster to only evaluate them once. */
3878 if (TREE_SIDE_EFFECTS (e
))
3879 return save_expr (e
);
3883 /* Constants need no processing. In fact, we should never reach
3888 /* Division is slow and tends to be compiled with jumps,
3889 especially the division by powers of 2 that is often
3890 found inside of an array reference. So do it just once. */
3891 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
3892 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
3893 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
3894 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
3895 return save_expr (e
);
3896 /* Recursively stabilize each operand. */
3897 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
3898 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
3902 /* Recursively stabilize each operand. */
3903 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
3910 TREE_TYPE (result
) = TREE_TYPE (e
);
3911 TREE_READONLY (result
) = TREE_READONLY (e
);
3912 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
3913 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
3914 TREE_SHARED (result
) = TREE_SHARED (e
);
3915 TREE_STRICT (result
) = TREE_STRICT (e
);
3916 TREE_RELAXED (result
) = TREE_RELAXED (e
);
3921 /* Low-level constructors for expressions. */
3923 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
3924 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
3927 recompute_tree_invariant_for_addr_expr (tree t
)
3930 bool tc
= true, se
= false;
3932 /* We started out assuming this address is both invariant and constant, but
3933 does not have side effects. Now go down any handled components and see if
3934 any of them involve offsets that are either non-constant or non-invariant.
3935 Also check for side-effects.
3937 ??? Note that this code makes no attempt to deal with the case where
3938 taking the address of something causes a copy due to misalignment. */
3940 #define UPDATE_FLAGS(NODE) \
3941 do { tree _node = (NODE); \
3942 if (_node && !TREE_CONSTANT (_node)) tc = false; \
3943 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
3945 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
3946 node
= TREE_OPERAND (node
, 0))
3948 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
3949 array reference (probably made temporarily by the G++ front end),
3950 so ignore all the operands. */
3951 if ((TREE_CODE (node
) == ARRAY_REF
3952 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
3953 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
3955 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
3956 if (TREE_OPERAND (node
, 2))
3957 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3958 if (TREE_OPERAND (node
, 3))
3959 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
3961 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
3962 FIELD_DECL, apparently. The G++ front end can put something else
3963 there, at least temporarily. */
3964 else if (TREE_CODE (node
) == COMPONENT_REF
3965 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
3967 if (TREE_OPERAND (node
, 2))
3968 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
3972 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
3974 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
3975 the address, since &(*a)->b is a form of addition. If it's a constant, the
3976 address is constant too. If it's a decl, its address is constant if the
3977 decl is static. Everything else is not constant and, furthermore,
3978 taking the address of a volatile variable is not volatile. */
3979 if (TREE_CODE (node
) == INDIRECT_REF
3980 || TREE_CODE (node
) == MEM_REF
)
3981 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
3982 else if (CONSTANT_CLASS_P (node
))
3984 else if (DECL_P (node
))
3985 tc
&= (staticp (node
) != NULL_TREE
);
3989 se
|= TREE_SIDE_EFFECTS (node
);
3993 TREE_CONSTANT (t
) = tc
;
3994 TREE_SIDE_EFFECTS (t
) = se
;
3998 /* Build an expression of code CODE, data type TYPE, and operands as
3999 specified. Expressions and reference nodes can be created this way.
4000 Constants, decls, types and misc nodes cannot be.
4002 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4003 enough for all extant tree codes. */
4006 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4010 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4012 t
= make_node_stat (code PASS_MEM_STAT
);
4019 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4021 int length
= sizeof (struct tree_exp
);
4024 record_node_allocation_statistics (code
, length
);
4026 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4028 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4030 memset (t
, 0, sizeof (struct tree_common
));
4032 TREE_SET_CODE (t
, code
);
4034 TREE_TYPE (t
) = type
;
4035 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4036 TREE_OPERAND (t
, 0) = node
;
4037 if (node
&& !TYPE_P (node
))
4039 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4040 TREE_READONLY (t
) = TREE_READONLY (node
);
4043 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4044 TREE_SIDE_EFFECTS (t
) = 1;
4048 /* All of these have side-effects, no matter what their
4050 TREE_SIDE_EFFECTS (t
) = 1;
4051 TREE_READONLY (t
) = 0;
4055 /* Whether a dereference is readonly has nothing to do with whether
4056 its operand is readonly. */
4057 TREE_READONLY (t
) = 0;
4058 TREE_SHARED (t
) = upc_shared_type_p (type
);
4063 recompute_tree_invariant_for_addr_expr (t
);
4067 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4068 && node
&& !TYPE_P (node
)
4069 && TREE_CONSTANT (node
))
4070 TREE_CONSTANT (t
) = 1;
4071 if (TREE_CODE_CLASS (code
) == tcc_reference
4072 && node
&& TREE_THIS_VOLATILE (node
))
4073 TREE_THIS_VOLATILE (t
) = 1;
4074 /* Drop the UPC "shared" type qualifier for
4075 expressions involving UPC shared objects. */
4076 if (TREE_CODE_CLASS (code
) == tcc_unary
4077 && node
&& !TYPE_P (node
)
4078 && upc_shared_type_p (type
))
4079 TREE_TYPE (t
) = build_upc_unshared_type (type
);
4086 #define PROCESS_ARG(N) \
4088 TREE_OPERAND (t, N) = arg##N; \
4089 if (arg##N &&!TYPE_P (arg##N)) \
4091 if (TREE_SIDE_EFFECTS (arg##N)) \
4093 if (!TREE_READONLY (arg##N) \
4094 && !CONSTANT_CLASS_P (arg##N)) \
4095 (void) (read_only = 0); \
4096 if (!TREE_CONSTANT (arg##N)) \
4097 (void) (constant = 0); \
4102 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4104 bool constant
, read_only
, side_effects
;
4107 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4109 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4110 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4111 /* When sizetype precision doesn't match that of pointers
4112 we need to be able to build explicit extensions or truncations
4113 of the offset argument. */
4114 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4115 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4116 && TREE_CODE (arg1
) == INTEGER_CST
);
4118 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4119 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4120 && ptrofftype_p (TREE_TYPE (arg1
)));
4122 t
= make_node_stat (code PASS_MEM_STAT
);
4124 /* Remove UPC shared type qualifiers from the result type. */
4125 if (upc_shared_type_p (tt
))
4126 tt
= build_upc_unshared_type (tt
);
4129 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4130 result based on those same flags for the arguments. But if the
4131 arguments aren't really even `tree' expressions, we shouldn't be trying
4134 /* Expressions without side effects may be constant if their
4135 arguments are as well. */
4136 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4137 || TREE_CODE_CLASS (code
) == tcc_binary
);
4139 side_effects
= TREE_SIDE_EFFECTS (t
);
4144 TREE_READONLY (t
) = read_only
;
4145 TREE_CONSTANT (t
) = constant
;
4146 TREE_SIDE_EFFECTS (t
) = side_effects
;
4147 TREE_THIS_VOLATILE (t
)
4148 = (TREE_CODE_CLASS (code
) == tcc_reference
4149 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4156 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4157 tree arg2 MEM_STAT_DECL
)
4159 bool constant
, read_only
, side_effects
;
4162 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4163 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4165 t
= make_node_stat (code PASS_MEM_STAT
);
4170 /* As a special exception, if COND_EXPR has NULL branches, we
4171 assume that it is a gimple statement and always consider
4172 it to have side effects. */
4173 if (code
== COND_EXPR
4174 && tt
== void_type_node
4175 && arg1
== NULL_TREE
4176 && arg2
== NULL_TREE
)
4177 side_effects
= true;
4179 side_effects
= TREE_SIDE_EFFECTS (t
);
4185 if (code
== COND_EXPR
)
4186 TREE_READONLY (t
) = read_only
;
4188 TREE_SIDE_EFFECTS (t
) = side_effects
;
4189 TREE_THIS_VOLATILE (t
)
4190 = (TREE_CODE_CLASS (code
) == tcc_reference
4191 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4193 = (TREE_CODE_CLASS (code
) == tcc_reference
4194 && arg0
&& TREE_SHARED (arg0
));
4195 if (TREE_SHARED (t
))
4197 TREE_STRICT (t
) = TREE_STRICT (arg0
);
4198 TREE_RELAXED (t
) = TREE_RELAXED (arg0
);
4205 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4206 tree arg2
, tree arg3 MEM_STAT_DECL
)
4208 bool constant
, read_only
, side_effects
;
4211 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4213 t
= make_node_stat (code PASS_MEM_STAT
);
4216 side_effects
= TREE_SIDE_EFFECTS (t
);
4223 TREE_SIDE_EFFECTS (t
) = side_effects
;
4224 TREE_THIS_VOLATILE (t
)
4225 = (TREE_CODE_CLASS (code
) == tcc_reference
4226 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4232 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4233 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4235 bool constant
, read_only
, side_effects
;
4238 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4240 t
= make_node_stat (code PASS_MEM_STAT
);
4243 side_effects
= TREE_SIDE_EFFECTS (t
);
4251 TREE_SIDE_EFFECTS (t
) = side_effects
;
4252 TREE_THIS_VOLATILE (t
)
4253 = (TREE_CODE_CLASS (code
) == tcc_reference
4254 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4259 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4260 on the pointer PTR. */
4263 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4265 HOST_WIDE_INT offset
= 0;
4266 tree ptype
= TREE_TYPE (ptr
);
4268 /* For convenience allow addresses that collapse to a simple base
4270 if (TREE_CODE (ptr
) == ADDR_EXPR
4271 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4272 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4274 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4276 ptr
= build_fold_addr_expr (ptr
);
4277 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4279 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4280 ptr
, build_int_cst (ptype
, offset
));
4281 SET_EXPR_LOCATION (tem
, loc
);
4285 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4288 mem_ref_offset (const_tree t
)
4290 tree toff
= TREE_OPERAND (t
, 1);
4291 return tree_to_double_int (toff
).sext (TYPE_PRECISION (TREE_TYPE (toff
)));
4294 /* Return the pointer-type relevant for TBAA purposes from the
4295 gimple memory reference tree T. This is the type to be used for
4296 the offset operand of MEM_REF or TARGET_MEM_REF replacements of T. */
4299 reference_alias_ptr_type (const_tree t
)
4301 const_tree base
= t
;
4302 while (handled_component_p (base
))
4303 base
= TREE_OPERAND (base
, 0);
4304 if (TREE_CODE (base
) == MEM_REF
)
4305 return TREE_TYPE (TREE_OPERAND (base
, 1));
4306 else if (TREE_CODE (base
) == TARGET_MEM_REF
)
4307 return TREE_TYPE (TMR_OFFSET (base
));
4309 return build_pointer_type (TYPE_MAIN_VARIANT (TREE_TYPE (base
)));
4312 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4313 offsetted by OFFSET units. */
4316 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4318 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4319 build_fold_addr_expr (base
),
4320 build_int_cst (ptr_type_node
, offset
));
4321 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4322 recompute_tree_invariant_for_addr_expr (addr
);
4326 /* Similar except don't specify the TREE_TYPE
4327 and leave the TREE_SIDE_EFFECTS as 0.
4328 It is permissible for arguments to be null,
4329 or even garbage if their values do not matter. */
4332 build_nt (enum tree_code code
, ...)
4339 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4343 t
= make_node (code
);
4344 length
= TREE_CODE_LENGTH (code
);
4346 for (i
= 0; i
< length
; i
++)
4347 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4353 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4357 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4362 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4363 CALL_EXPR_FN (ret
) = fn
;
4364 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4365 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4366 CALL_EXPR_ARG (ret
, ix
) = t
;
4370 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4371 We do NOT enter this node in any sort of symbol table.
4373 LOC is the location of the decl.
4375 layout_decl is used to set up the decl's storage layout.
4376 Other slots are initialized to 0 or null pointers. */
4379 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4380 tree type MEM_STAT_DECL
)
4384 t
= make_node_stat (code PASS_MEM_STAT
);
4385 DECL_SOURCE_LOCATION (t
) = loc
;
4387 /* if (type == error_mark_node)
4388 type = integer_type_node; */
4389 /* That is not done, deliberately, so that having error_mark_node
4390 as the type can suppress useless errors in the use of this variable. */
4392 DECL_NAME (t
) = name
;
4393 TREE_TYPE (t
) = type
;
4395 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4401 /* Builds and returns function declaration with NAME and TYPE. */
4404 build_fn_decl (const char *name
, tree type
)
4406 tree id
= get_identifier (name
);
4407 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4409 DECL_EXTERNAL (decl
) = 1;
4410 TREE_PUBLIC (decl
) = 1;
4411 DECL_ARTIFICIAL (decl
) = 1;
4412 TREE_NOTHROW (decl
) = 1;
4417 vec
<tree
, va_gc
> *all_translation_units
;
4419 /* Builds a new translation-unit decl with name NAME, queues it in the
4420 global list of translation-unit decls and returns it. */
4423 build_translation_unit_decl (tree name
)
4425 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4427 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4428 vec_safe_push (all_translation_units
, tu
);
4433 /* BLOCK nodes are used to represent the structure of binding contours
4434 and declarations, once those contours have been exited and their contents
4435 compiled. This information is used for outputting debugging info. */
4438 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4440 tree block
= make_node (BLOCK
);
4442 BLOCK_VARS (block
) = vars
;
4443 BLOCK_SUBBLOCKS (block
) = subblocks
;
4444 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4445 BLOCK_CHAIN (block
) = chain
;
4450 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4452 LOC is the location to use in tree T. */
4455 protected_set_expr_location (tree t
, location_t loc
)
4457 if (t
&& CAN_HAVE_LOCATION_P (t
))
4458 SET_EXPR_LOCATION (t
, loc
);
4461 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4465 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4467 DECL_ATTRIBUTES (ddecl
) = attribute
;
4471 /* Borrowed from hashtab.c iterative_hash implementation. */
4472 #define mix(a,b,c) \
4474 a -= b; a -= c; a ^= (c>>13); \
4475 b -= c; b -= a; b ^= (a<< 8); \
4476 c -= a; c -= b; c ^= ((b&0xffffffff)>>13); \
4477 a -= b; a -= c; a ^= ((c&0xffffffff)>>12); \
4478 b -= c; b -= a; b = (b ^ (a<<16)) & 0xffffffff; \
4479 c -= a; c -= b; c = (c ^ (b>> 5)) & 0xffffffff; \
4480 a -= b; a -= c; a = (a ^ (c>> 3)) & 0xffffffff; \
4481 b -= c; b -= a; b = (b ^ (a<<10)) & 0xffffffff; \
4482 c -= a; c -= b; c = (c ^ (b>>15)) & 0xffffffff; \
4486 /* Produce good hash value combining VAL and VAL2. */
4488 iterative_hash_hashval_t (hashval_t val
, hashval_t val2
)
4490 /* the golden ratio; an arbitrary value. */
4491 hashval_t a
= 0x9e3779b9;
4497 /* Produce good hash value combining VAL and VAL2. */
4499 iterative_hash_host_wide_int (HOST_WIDE_INT val
, hashval_t val2
)
4501 if (sizeof (HOST_WIDE_INT
) == sizeof (hashval_t
))
4502 return iterative_hash_hashval_t (val
, val2
);
4505 hashval_t a
= (hashval_t
) val
;
4506 /* Avoid warnings about shifting of more than the width of the type on
4507 hosts that won't execute this path. */
4509 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 8 + zero
));
4511 if (sizeof (HOST_WIDE_INT
) > 2 * sizeof (hashval_t
))
4513 hashval_t a
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 16 + zero
));
4514 hashval_t b
= (hashval_t
) (val
>> (sizeof (hashval_t
) * 24 + zero
));
4521 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4522 is ATTRIBUTE and its qualifiers are QUALS.
4524 Record such modified types already made so we don't make duplicates. */
4527 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4529 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4531 hashval_t hashcode
= 0;
4533 enum tree_code code
= TREE_CODE (ttype
);
4535 /* Building a distinct copy of a tagged type is inappropriate; it
4536 causes breakage in code that expects there to be a one-to-one
4537 relationship between a struct and its fields.
4538 build_duplicate_type is another solution (as used in
4539 handle_transparent_union_attribute), but that doesn't play well
4540 with the stronger C++ type identity model. */
4541 if (TREE_CODE (ttype
) == RECORD_TYPE
4542 || TREE_CODE (ttype
) == UNION_TYPE
4543 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4544 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4546 warning (OPT_Wattributes
,
4547 "ignoring attributes applied to %qT after definition",
4548 TYPE_MAIN_VARIANT (ttype
));
4549 return build_qualified_type (ttype
, quals
);
4552 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4553 ntype
= build_distinct_type_copy (ttype
);
4555 TYPE_ATTRIBUTES (ntype
) = attribute
;
4557 hashcode
= iterative_hash_object (code
, hashcode
);
4558 if (TREE_TYPE (ntype
))
4559 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype
)),
4561 hashcode
= attribute_hash_list (attribute
, hashcode
);
4563 switch (TREE_CODE (ntype
))
4566 hashcode
= type_hash_list (TYPE_ARG_TYPES (ntype
), hashcode
);
4569 if (TYPE_DOMAIN (ntype
))
4570 hashcode
= iterative_hash_object (TYPE_HASH (TYPE_DOMAIN (ntype
)),
4574 hashcode
= iterative_hash_object
4575 (TREE_INT_CST_LOW (TYPE_MAX_VALUE (ntype
)), hashcode
);
4576 hashcode
= iterative_hash_object
4577 (TREE_INT_CST_HIGH (TYPE_MAX_VALUE (ntype
)), hashcode
);
4580 case FIXED_POINT_TYPE
:
4582 unsigned int precision
= TYPE_PRECISION (ntype
);
4583 hashcode
= iterative_hash_object (precision
, hashcode
);
4590 ntype
= type_hash_canon (hashcode
, ntype
);
4592 /* If the target-dependent attributes make NTYPE different from
4593 its canonical type, we will need to use structural equality
4594 checks for this type. */
4595 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4596 || !comp_type_attributes (ntype
, ttype
))
4597 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4598 else if (TYPE_CANONICAL (ntype
) == ntype
)
4599 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4601 ttype
= build_qualified_type (ntype
, quals
);
4603 else if (TYPE_QUALS (ttype
) != quals
)
4604 ttype
= build_qualified_type (ttype
, quals
);
4609 /* Compare two attributes for their value identity. Return true if the
4610 attribute values are known to be equal; otherwise return false.
4614 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4616 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4619 if (TREE_VALUE (attr1
) != NULL_TREE
4620 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4621 && TREE_VALUE (attr2
) != NULL
4622 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4623 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4624 TREE_VALUE (attr2
)) == 1);
4626 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4629 /* Return 0 if the attributes for two types are incompatible, 1 if they
4630 are compatible, and 2 if they are nearly compatible (which causes a
4631 warning to be generated). */
4633 comp_type_attributes (const_tree type1
, const_tree type2
)
4635 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4636 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4641 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4643 const struct attribute_spec
*as
;
4646 as
= lookup_attribute_spec (get_attribute_name (a
));
4647 if (!as
|| as
->affects_type_identity
== false)
4650 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4651 if (!attr
|| !attribute_value_equal (a
, attr
))
4656 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4658 const struct attribute_spec
*as
;
4660 as
= lookup_attribute_spec (get_attribute_name (a
));
4661 if (!as
|| as
->affects_type_identity
== false)
4664 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4666 /* We don't need to compare trees again, as we did this
4667 already in first loop. */
4669 /* All types - affecting identity - are equal, so
4670 there is no need to call target hook for comparison. */
4674 /* As some type combinations - like default calling-convention - might
4675 be compatible, we have to call the target hook to get the final result. */
4676 return targetm
.comp_type_attributes (type1
, type2
);
4679 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4682 Record such modified types already made so we don't make duplicates. */
4685 build_type_attribute_variant (tree ttype
, tree attribute
)
4687 return build_type_attribute_qual_variant (ttype
, attribute
,
4688 TYPE_QUALS (ttype
));
4692 /* Reset the expression *EXPR_P, a size or position.
4694 ??? We could reset all non-constant sizes or positions. But it's cheap
4695 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4697 We need to reset self-referential sizes or positions because they cannot
4698 be gimplified and thus can contain a CALL_EXPR after the gimplification
4699 is finished, which will run afoul of LTO streaming. And they need to be
4700 reset to something essentially dummy but not constant, so as to preserve
4701 the properties of the object they are attached to. */
4704 free_lang_data_in_one_sizepos (tree
*expr_p
)
4706 tree expr
= *expr_p
;
4707 if (CONTAINS_PLACEHOLDER_P (expr
))
4708 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4712 /* Reset all the fields in a binfo node BINFO. We only keep
4713 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4716 free_lang_data_in_binfo (tree binfo
)
4721 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4723 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4724 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4725 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4726 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4728 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4729 free_lang_data_in_binfo (t
);
4733 /* Reset all language specific information still present in TYPE. */
4736 free_lang_data_in_type (tree type
)
4738 gcc_assert (TYPE_P (type
));
4740 /* Give the FE a chance to remove its own data first. */
4741 lang_hooks
.free_lang_data (type
);
4743 TREE_LANG_FLAG_0 (type
) = 0;
4744 TREE_LANG_FLAG_1 (type
) = 0;
4745 TREE_LANG_FLAG_2 (type
) = 0;
4746 TREE_LANG_FLAG_3 (type
) = 0;
4747 TREE_LANG_FLAG_4 (type
) = 0;
4748 TREE_LANG_FLAG_5 (type
) = 0;
4749 TREE_LANG_FLAG_6 (type
) = 0;
4751 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4753 /* Remove the const and volatile qualifiers from arguments. The
4754 C++ front end removes them, but the C front end does not,
4755 leading to false ODR violation errors when merging two
4756 instances of the same function signature compiled by
4757 different front ends. */
4760 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4762 tree arg_type
= TREE_VALUE (p
);
4764 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4766 int quals
= TYPE_QUALS (arg_type
)
4768 & ~TYPE_QUAL_VOLATILE
;
4769 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4770 free_lang_data_in_type (TREE_VALUE (p
));
4775 /* Remove members that are not actually FIELD_DECLs from the field
4776 list of an aggregate. These occur in C++. */
4777 if (RECORD_OR_UNION_TYPE_P (type
))
4781 /* Note that TYPE_FIELDS can be shared across distinct
4782 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
4783 to be removed, we cannot set its TREE_CHAIN to NULL.
4784 Otherwise, we would not be able to find all the other fields
4785 in the other instances of this TREE_TYPE.
4787 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
4789 member
= TYPE_FIELDS (type
);
4792 if (TREE_CODE (member
) == FIELD_DECL
4793 || TREE_CODE (member
) == TYPE_DECL
)
4796 TREE_CHAIN (prev
) = member
;
4798 TYPE_FIELDS (type
) = member
;
4802 member
= TREE_CHAIN (member
);
4806 TREE_CHAIN (prev
) = NULL_TREE
;
4808 TYPE_FIELDS (type
) = NULL_TREE
;
4810 TYPE_METHODS (type
) = NULL_TREE
;
4811 if (TYPE_BINFO (type
))
4812 free_lang_data_in_binfo (TYPE_BINFO (type
));
4816 /* For non-aggregate types, clear out the language slot (which
4817 overloads TYPE_BINFO). */
4818 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4820 if (INTEGRAL_TYPE_P (type
)
4821 || SCALAR_FLOAT_TYPE_P (type
)
4822 || FIXED_POINT_TYPE_P (type
))
4824 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4825 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4829 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4830 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4832 if (TYPE_CONTEXT (type
)
4833 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4835 tree ctx
= TYPE_CONTEXT (type
);
4838 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4840 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4841 TYPE_CONTEXT (type
) = ctx
;
4846 /* Return true if DECL may need an assembler name to be set. */
4849 need_assembler_name_p (tree decl
)
4851 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
4852 if (TREE_CODE (decl
) != FUNCTION_DECL
4853 && TREE_CODE (decl
) != VAR_DECL
)
4856 /* If DECL already has its assembler name set, it does not need a
4858 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
4859 || DECL_ASSEMBLER_NAME_SET_P (decl
))
4862 /* Abstract decls do not need an assembler name. */
4863 if (DECL_ABSTRACT (decl
))
4866 /* For VAR_DECLs, only static, public and external symbols need an
4868 if (TREE_CODE (decl
) == VAR_DECL
4869 && !TREE_STATIC (decl
)
4870 && !TREE_PUBLIC (decl
)
4871 && !DECL_EXTERNAL (decl
))
4874 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4876 /* Do not set assembler name on builtins. Allow RTL expansion to
4877 decide whether to expand inline or via a regular call. */
4878 if (DECL_BUILT_IN (decl
)
4879 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
4882 /* Functions represented in the callgraph need an assembler name. */
4883 if (cgraph_get_node (decl
) != NULL
)
4886 /* Unused and not public functions don't need an assembler name. */
4887 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
4895 /* Reset all language specific information still present in symbol
4899 free_lang_data_in_decl (tree decl
)
4901 gcc_assert (DECL_P (decl
));
4903 /* Give the FE a chance to remove its own data first. */
4904 lang_hooks
.free_lang_data (decl
);
4906 TREE_LANG_FLAG_0 (decl
) = 0;
4907 TREE_LANG_FLAG_1 (decl
) = 0;
4908 TREE_LANG_FLAG_2 (decl
) = 0;
4909 TREE_LANG_FLAG_3 (decl
) = 0;
4910 TREE_LANG_FLAG_4 (decl
) = 0;
4911 TREE_LANG_FLAG_5 (decl
) = 0;
4912 TREE_LANG_FLAG_6 (decl
) = 0;
4914 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
4915 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
4916 if (TREE_CODE (decl
) == FIELD_DECL
)
4918 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
4919 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
4920 DECL_QUALIFIER (decl
) = NULL_TREE
;
4923 if (TREE_CODE (decl
) == FUNCTION_DECL
)
4925 struct cgraph_node
*node
;
4926 if (!(node
= cgraph_get_node (decl
))
4927 || (!node
->symbol
.definition
&& !node
->clones
))
4930 cgraph_release_function_body (node
);
4933 release_function_body (decl
);
4934 DECL_ARGUMENTS (decl
) = NULL
;
4935 DECL_RESULT (decl
) = NULL
;
4936 DECL_INITIAL (decl
) = error_mark_node
;
4939 if (gimple_has_body_p (decl
))
4943 /* If DECL has a gimple body, then the context for its
4944 arguments must be DECL. Otherwise, it doesn't really
4945 matter, as we will not be emitting any code for DECL. In
4946 general, there may be other instances of DECL created by
4947 the front end and since PARM_DECLs are generally shared,
4948 their DECL_CONTEXT changes as the replicas of DECL are
4949 created. The only time where DECL_CONTEXT is important
4950 is for the FUNCTION_DECLs that have a gimple body (since
4951 the PARM_DECL will be used in the function's body). */
4952 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
4953 DECL_CONTEXT (t
) = decl
;
4956 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
4957 At this point, it is not needed anymore. */
4958 DECL_SAVED_TREE (decl
) = NULL_TREE
;
4960 /* Clear the abstract origin if it refers to a method. Otherwise
4961 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
4962 origin will not be output correctly. */
4963 if (DECL_ABSTRACT_ORIGIN (decl
)
4964 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
4965 && RECORD_OR_UNION_TYPE_P
4966 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
4967 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
4969 /* Sometimes the C++ frontend doesn't manage to transform a temporary
4970 DECL_VINDEX referring to itself into a vtable slot number as it
4971 should. Happens with functions that are copied and then forgotten
4972 about. Just clear it, it won't matter anymore. */
4973 if (DECL_VINDEX (decl
) && !host_integerp (DECL_VINDEX (decl
), 0))
4974 DECL_VINDEX (decl
) = NULL_TREE
;
4976 else if (TREE_CODE (decl
) == VAR_DECL
)
4978 if ((DECL_EXTERNAL (decl
)
4979 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
4980 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
4981 DECL_INITIAL (decl
) = NULL_TREE
;
4983 else if (TREE_CODE (decl
) == TYPE_DECL
4984 || TREE_CODE (decl
) == FIELD_DECL
)
4985 DECL_INITIAL (decl
) = NULL_TREE
;
4986 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
4987 && DECL_INITIAL (decl
)
4988 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
4990 /* Strip builtins from the translation-unit BLOCK. We still have targets
4991 without builtin_decl_explicit support and also builtins are shared
4992 nodes and thus we can't use TREE_CHAIN in multiple lists. */
4993 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
4997 if (TREE_CODE (var
) == FUNCTION_DECL
4998 && DECL_BUILT_IN (var
))
4999 *nextp
= TREE_CHAIN (var
);
5001 nextp
= &TREE_CHAIN (var
);
5007 /* Data used when collecting DECLs and TYPEs for language data removal. */
5009 struct free_lang_data_d
5011 /* Worklist to avoid excessive recursion. */
5014 /* Set of traversed objects. Used to avoid duplicate visits. */
5015 struct pointer_set_t
*pset
;
5017 /* Array of symbols to process with free_lang_data_in_decl. */
5020 /* Array of types to process with free_lang_data_in_type. */
5025 /* Save all language fields needed to generate proper debug information
5026 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5029 save_debug_info_for_decl (tree t
)
5031 /*struct saved_debug_info_d *sdi;*/
5033 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5035 /* FIXME. Partial implementation for saving debug info removed. */
5039 /* Save all language fields needed to generate proper debug information
5040 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5043 save_debug_info_for_type (tree t
)
5045 /*struct saved_debug_info_d *sdi;*/
5047 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5049 /* FIXME. Partial implementation for saving debug info removed. */
5053 /* Add type or decl T to one of the list of tree nodes that need their
5054 language data removed. The lists are held inside FLD. */
5057 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5061 fld
->decls
.safe_push (t
);
5062 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5063 save_debug_info_for_decl (t
);
5065 else if (TYPE_P (t
))
5067 fld
->types
.safe_push (t
);
5068 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5069 save_debug_info_for_type (t
);
5075 /* Push tree node T into FLD->WORKLIST. */
5078 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5080 if (t
&& !is_lang_specific (t
) && !pointer_set_contains (fld
->pset
, t
))
5081 fld
->worklist
.safe_push ((t
));
5085 /* Operand callback helper for free_lang_data_in_node. *TP is the
5086 subtree operand being considered. */
5089 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5092 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5094 if (TREE_CODE (t
) == TREE_LIST
)
5097 /* Language specific nodes will be removed, so there is no need
5098 to gather anything under them. */
5099 if (is_lang_specific (t
))
5107 /* Note that walk_tree does not traverse every possible field in
5108 decls, so we have to do our own traversals here. */
5109 add_tree_to_fld_list (t
, fld
);
5111 fld_worklist_push (DECL_NAME (t
), fld
);
5112 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5113 fld_worklist_push (DECL_SIZE (t
), fld
);
5114 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5116 /* We are going to remove everything under DECL_INITIAL for
5117 TYPE_DECLs. No point walking them. */
5118 if (TREE_CODE (t
) != TYPE_DECL
)
5119 fld_worklist_push (DECL_INITIAL (t
), fld
);
5121 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5122 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5124 if (TREE_CODE (t
) == FUNCTION_DECL
)
5126 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5127 fld_worklist_push (DECL_RESULT (t
), fld
);
5129 else if (TREE_CODE (t
) == TYPE_DECL
)
5131 fld_worklist_push (DECL_ARGUMENT_FLD (t
), fld
);
5132 fld_worklist_push (DECL_VINDEX (t
), fld
);
5133 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5135 else if (TREE_CODE (t
) == FIELD_DECL
)
5137 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5138 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5139 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5140 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5142 else if (TREE_CODE (t
) == VAR_DECL
)
5144 fld_worklist_push (DECL_SECTION_NAME (t
), fld
);
5145 fld_worklist_push (DECL_COMDAT_GROUP (t
), fld
);
5148 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5149 && DECL_HAS_VALUE_EXPR_P (t
))
5150 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5152 if (TREE_CODE (t
) != FIELD_DECL
5153 && TREE_CODE (t
) != TYPE_DECL
)
5154 fld_worklist_push (TREE_CHAIN (t
), fld
);
5157 else if (TYPE_P (t
))
5159 /* Note that walk_tree does not traverse every possible field in
5160 types, so we have to do our own traversals here. */
5161 add_tree_to_fld_list (t
, fld
);
5163 if (!RECORD_OR_UNION_TYPE_P (t
))
5164 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5165 fld_worklist_push (TYPE_SIZE (t
), fld
);
5166 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5167 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5168 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5169 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5170 fld_worklist_push (TYPE_NAME (t
), fld
);
5171 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5172 them and thus do not and want not to reach unused pointer types
5174 if (!POINTER_TYPE_P (t
))
5175 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5176 if (!RECORD_OR_UNION_TYPE_P (t
))
5177 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5178 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5179 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5180 do not and want not to reach unused variants this way. */
5181 if (TYPE_CONTEXT (t
))
5183 tree ctx
= TYPE_CONTEXT (t
);
5184 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5185 So push that instead. */
5186 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5187 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5188 fld_worklist_push (ctx
, fld
);
5190 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5191 and want not to reach unused types this way. */
5193 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5197 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5198 fld_worklist_push (TREE_TYPE (tem
), fld
);
5199 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5201 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5202 && TREE_CODE (tem
) == TREE_LIST
)
5205 fld_worklist_push (TREE_VALUE (tem
), fld
);
5206 tem
= TREE_CHAIN (tem
);
5210 if (RECORD_OR_UNION_TYPE_P (t
))
5213 /* Push all TYPE_FIELDS - there can be interleaving interesting
5214 and non-interesting things. */
5215 tem
= TYPE_FIELDS (t
);
5218 if (TREE_CODE (tem
) == FIELD_DECL
5219 || TREE_CODE (tem
) == TYPE_DECL
)
5220 fld_worklist_push (tem
, fld
);
5221 tem
= TREE_CHAIN (tem
);
5225 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5228 else if (TREE_CODE (t
) == BLOCK
)
5231 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5232 fld_worklist_push (tem
, fld
);
5233 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5234 fld_worklist_push (tem
, fld
);
5235 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5238 if (TREE_CODE (t
) != IDENTIFIER_NODE
5239 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5240 fld_worklist_push (TREE_TYPE (t
), fld
);
5246 /* Find decls and types in T. */
5249 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5253 if (!pointer_set_contains (fld
->pset
, t
))
5254 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5255 if (fld
->worklist
.is_empty ())
5257 t
= fld
->worklist
.pop ();
5261 /* Translate all the types in LIST with the corresponding runtime
5265 get_eh_types_for_runtime (tree list
)
5269 if (list
== NULL_TREE
)
5272 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5274 list
= TREE_CHAIN (list
);
5277 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5278 TREE_CHAIN (prev
) = n
;
5279 prev
= TREE_CHAIN (prev
);
5280 list
= TREE_CHAIN (list
);
5287 /* Find decls and types referenced in EH region R and store them in
5288 FLD->DECLS and FLD->TYPES. */
5291 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5302 /* The types referenced in each catch must first be changed to the
5303 EH types used at runtime. This removes references to FE types
5305 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5307 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5308 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5313 case ERT_ALLOWED_EXCEPTIONS
:
5314 r
->u
.allowed
.type_list
5315 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5316 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5319 case ERT_MUST_NOT_THROW
:
5320 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5321 find_decls_types_r
, fld
, fld
->pset
);
5327 /* Find decls and types referenced in cgraph node N and store them in
5328 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5329 look for *every* kind of DECL and TYPE node reachable from N,
5330 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5331 NAMESPACE_DECLs, etc). */
5334 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5337 struct function
*fn
;
5341 find_decls_types (n
->symbol
.decl
, fld
);
5343 if (!gimple_has_body_p (n
->symbol
.decl
))
5346 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5348 fn
= DECL_STRUCT_FUNCTION (n
->symbol
.decl
);
5350 /* Traverse locals. */
5351 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5352 find_decls_types (t
, fld
);
5354 /* Traverse EH regions in FN. */
5357 FOR_ALL_EH_REGION_FN (r
, fn
)
5358 find_decls_types_in_eh_region (r
, fld
);
5361 /* Traverse every statement in FN. */
5362 FOR_EACH_BB_FN (bb
, fn
)
5364 gimple_stmt_iterator si
;
5367 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); gsi_next (&si
))
5369 gimple phi
= gsi_stmt (si
);
5371 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5373 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5374 find_decls_types (*arg_p
, fld
);
5378 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5380 gimple stmt
= gsi_stmt (si
);
5382 if (is_gimple_call (stmt
))
5383 find_decls_types (gimple_call_fntype (stmt
), fld
);
5385 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5387 tree arg
= gimple_op (stmt
, i
);
5388 find_decls_types (arg
, fld
);
5395 /* Find decls and types referenced in varpool node N and store them in
5396 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5397 look for *every* kind of DECL and TYPE node reachable from N,
5398 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5399 NAMESPACE_DECLs, etc). */
5402 find_decls_types_in_var (struct varpool_node
*v
, struct free_lang_data_d
*fld
)
5404 find_decls_types (v
->symbol
.decl
, fld
);
5407 /* If T needs an assembler name, have one created for it. */
5410 assign_assembler_name_if_neeeded (tree t
)
5412 if (need_assembler_name_p (t
))
5414 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5415 diagnostics that use input_location to show locus
5416 information. The problem here is that, at this point,
5417 input_location is generally anchored to the end of the file
5418 (since the parser is long gone), so we don't have a good
5419 position to pin it to.
5421 To alleviate this problem, this uses the location of T's
5422 declaration. Examples of this are
5423 testsuite/g++.dg/template/cond2.C and
5424 testsuite/g++.dg/template/pr35240.C. */
5425 location_t saved_location
= input_location
;
5426 input_location
= DECL_SOURCE_LOCATION (t
);
5428 decl_assembler_name (t
);
5430 input_location
= saved_location
;
5435 /* Free language specific information for every operand and expression
5436 in every node of the call graph. This process operates in three stages:
5438 1- Every callgraph node and varpool node is traversed looking for
5439 decls and types embedded in them. This is a more exhaustive
5440 search than that done by find_referenced_vars, because it will
5441 also collect individual fields, decls embedded in types, etc.
5443 2- All the decls found are sent to free_lang_data_in_decl.
5445 3- All the types found are sent to free_lang_data_in_type.
5447 The ordering between decls and types is important because
5448 free_lang_data_in_decl sets assembler names, which includes
5449 mangling. So types cannot be freed up until assembler names have
5453 free_lang_data_in_cgraph (void)
5455 struct cgraph_node
*n
;
5456 struct varpool_node
*v
;
5457 struct free_lang_data_d fld
;
5462 /* Initialize sets and arrays to store referenced decls and types. */
5463 fld
.pset
= pointer_set_create ();
5464 fld
.worklist
.create (0);
5465 fld
.decls
.create (100);
5466 fld
.types
.create (100);
5468 /* Find decls and types in the body of every function in the callgraph. */
5469 FOR_EACH_FUNCTION (n
)
5470 find_decls_types_in_node (n
, &fld
);
5472 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5473 find_decls_types (p
->decl
, &fld
);
5475 /* Find decls and types in every varpool symbol. */
5476 FOR_EACH_VARIABLE (v
)
5477 find_decls_types_in_var (v
, &fld
);
5479 /* Set the assembler name on every decl found. We need to do this
5480 now because free_lang_data_in_decl will invalidate data needed
5481 for mangling. This breaks mangling on interdependent decls. */
5482 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5483 assign_assembler_name_if_neeeded (t
);
5485 /* Traverse every decl found freeing its language data. */
5486 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5487 free_lang_data_in_decl (t
);
5489 /* Traverse every type found freeing its language data. */
5490 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5491 free_lang_data_in_type (t
);
5493 pointer_set_destroy (fld
.pset
);
5494 fld
.worklist
.release ();
5495 fld
.decls
.release ();
5496 fld
.types
.release ();
5500 /* Free resources that are used by FE but are not needed once they are done. */
5503 free_lang_data (void)
5507 /* If we are the LTO frontend we have freed lang-specific data already. */
5509 || !flag_generate_lto
)
5512 /* Allocate and assign alias sets to the standard integer types
5513 while the slots are still in the way the frontends generated them. */
5514 for (i
= 0; i
< itk_none
; ++i
)
5515 if (integer_types
[i
])
5516 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5518 /* Traverse the IL resetting language specific information for
5519 operands, expressions, etc. */
5520 free_lang_data_in_cgraph ();
5522 /* Create gimple variants for common types. */
5523 ptrdiff_type_node
= integer_type_node
;
5524 fileptr_type_node
= ptr_type_node
;
5526 /* Reset some langhooks. Do not reset types_compatible_p, it may
5527 still be used indirectly via the get_alias_set langhook. */
5528 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5529 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5530 /* We do not want the default decl_assembler_name implementation,
5531 rather if we have fixed everything we want a wrapper around it
5532 asserting that all non-local symbols already got their assembler
5533 name and only produce assembler names for local symbols. Or rather
5534 make sure we never call decl_assembler_name on local symbols and
5535 devise a separate, middle-end private scheme for it. */
5537 /* Reset diagnostic machinery. */
5538 tree_diagnostics_defaults (global_dc
);
5546 const pass_data pass_data_ipa_free_lang_data
=
5548 SIMPLE_IPA_PASS
, /* type */
5549 "*free_lang_data", /* name */
5550 OPTGROUP_NONE
, /* optinfo_flags */
5551 false, /* has_gate */
5552 true, /* has_execute */
5553 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5554 0, /* properties_required */
5555 0, /* properties_provided */
5556 0, /* properties_destroyed */
5557 0, /* todo_flags_start */
5558 0, /* todo_flags_finish */
5561 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5564 pass_ipa_free_lang_data(gcc::context
*ctxt
)
5565 : simple_ipa_opt_pass(pass_data_ipa_free_lang_data
, ctxt
)
5568 /* opt_pass methods: */
5569 unsigned int execute () { return free_lang_data (); }
5571 }; // class pass_ipa_free_lang_data
5575 simple_ipa_opt_pass
*
5576 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5578 return new pass_ipa_free_lang_data (ctxt
);
5581 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5582 ATTR_NAME. Also used internally by remove_attribute(). */
5584 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5586 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5588 if (ident_len
== attr_len
)
5590 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5593 else if (ident_len
== attr_len
+ 4)
5595 /* There is the possibility that ATTR is 'text' and IDENT is
5597 const char *p
= IDENTIFIER_POINTER (ident
);
5598 if (p
[0] == '_' && p
[1] == '_'
5599 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5600 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5607 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5608 of ATTR_NAME, and LIST is not NULL_TREE. */
5610 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5614 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5616 if (ident_len
== attr_len
)
5618 if (!strcmp (attr_name
,
5619 IDENTIFIER_POINTER (get_attribute_name (list
))))
5622 /* TODO: If we made sure that attributes were stored in the
5623 canonical form without '__...__' (ie, as in 'text' as opposed
5624 to '__text__') then we could avoid the following case. */
5625 else if (ident_len
== attr_len
+ 4)
5627 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5628 if (p
[0] == '_' && p
[1] == '_'
5629 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5630 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5633 list
= TREE_CHAIN (list
);
5639 /* A variant of lookup_attribute() that can be used with an identifier
5640 as the first argument, and where the identifier can be either
5641 'text' or '__text__'.
5643 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
5644 return a pointer to the attribute's list element if the attribute
5645 is part of the list, or NULL_TREE if not found. If the attribute
5646 appears more than once, this only returns the first occurrence; the
5647 TREE_CHAIN of the return value should be passed back in if further
5648 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
5649 can be in the form 'text' or '__text__'. */
5651 lookup_ident_attribute (tree attr_identifier
, tree list
)
5653 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
5657 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
5658 == IDENTIFIER_NODE
);
5660 /* Identifiers can be compared directly for equality. */
5661 if (attr_identifier
== get_attribute_name (list
))
5664 /* If they are not equal, they may still be one in the form
5665 'text' while the other one is in the form '__text__'. TODO:
5666 If we were storing attributes in normalized 'text' form, then
5667 this could all go away and we could take full advantage of
5668 the fact that we're comparing identifiers. :-) */
5670 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
5671 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5673 if (ident_len
== attr_len
+ 4)
5675 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5676 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5677 if (p
[0] == '_' && p
[1] == '_'
5678 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5679 && strncmp (q
, p
+ 2, attr_len
) == 0)
5682 else if (ident_len
+ 4 == attr_len
)
5684 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5685 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
5686 if (q
[0] == '_' && q
[1] == '_'
5687 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
5688 && strncmp (q
+ 2, p
, ident_len
) == 0)
5692 list
= TREE_CHAIN (list
);
5698 /* Remove any instances of attribute ATTR_NAME in LIST and return the
5702 remove_attribute (const char *attr_name
, tree list
)
5705 size_t attr_len
= strlen (attr_name
);
5707 gcc_checking_assert (attr_name
[0] != '_');
5709 for (p
= &list
; *p
; )
5712 /* TODO: If we were storing attributes in normalized form, here
5713 we could use a simple strcmp(). */
5714 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
5715 *p
= TREE_CHAIN (l
);
5717 p
= &TREE_CHAIN (l
);
5723 /* Return an attribute list that is the union of a1 and a2. */
5726 merge_attributes (tree a1
, tree a2
)
5730 /* Either one unset? Take the set one. */
5732 if ((attributes
= a1
) == 0)
5735 /* One that completely contains the other? Take it. */
5737 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
5739 if (attribute_list_contained (a2
, a1
))
5743 /* Pick the longest list, and hang on the other list. */
5745 if (list_length (a1
) < list_length (a2
))
5746 attributes
= a2
, a2
= a1
;
5748 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
5751 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
5753 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
5754 a
= lookup_ident_attribute (get_attribute_name (a2
),
5759 a1
= copy_node (a2
);
5760 TREE_CHAIN (a1
) = attributes
;
5769 /* Given types T1 and T2, merge their attributes and return
5773 merge_type_attributes (tree t1
, tree t2
)
5775 return merge_attributes (TYPE_ATTRIBUTES (t1
),
5776 TYPE_ATTRIBUTES (t2
));
5779 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
5783 merge_decl_attributes (tree olddecl
, tree newdecl
)
5785 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
5786 DECL_ATTRIBUTES (newdecl
));
5789 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
5791 /* Specialization of merge_decl_attributes for various Windows targets.
5793 This handles the following situation:
5795 __declspec (dllimport) int foo;
5798 The second instance of `foo' nullifies the dllimport. */
5801 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
5804 int delete_dllimport_p
= 1;
5806 /* What we need to do here is remove from `old' dllimport if it doesn't
5807 appear in `new'. dllimport behaves like extern: if a declaration is
5808 marked dllimport and a definition appears later, then the object
5809 is not dllimport'd. We also remove a `new' dllimport if the old list
5810 contains dllexport: dllexport always overrides dllimport, regardless
5811 of the order of declaration. */
5812 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
5813 delete_dllimport_p
= 0;
5814 else if (DECL_DLLIMPORT_P (new_tree
)
5815 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
5817 DECL_DLLIMPORT_P (new_tree
) = 0;
5818 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
5819 "dllimport ignored", new_tree
);
5821 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
5823 /* Warn about overriding a symbol that has already been used, e.g.:
5824 extern int __attribute__ ((dllimport)) foo;
5825 int* bar () {return &foo;}
5828 if (TREE_USED (old
))
5830 warning (0, "%q+D redeclared without dllimport attribute "
5831 "after being referenced with dll linkage", new_tree
);
5832 /* If we have used a variable's address with dllimport linkage,
5833 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
5834 decl may already have had TREE_CONSTANT computed.
5835 We still remove the attribute so that assembler code refers
5836 to '&foo rather than '_imp__foo'. */
5837 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
5838 DECL_DLLIMPORT_P (new_tree
) = 1;
5841 /* Let an inline definition silently override the external reference,
5842 but otherwise warn about attribute inconsistency. */
5843 else if (TREE_CODE (new_tree
) == VAR_DECL
5844 || !DECL_DECLARED_INLINE_P (new_tree
))
5845 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
5846 "previous dllimport ignored", new_tree
);
5849 delete_dllimport_p
= 0;
5851 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
5853 if (delete_dllimport_p
)
5854 a
= remove_attribute ("dllimport", a
);
5859 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
5860 struct attribute_spec.handler. */
5863 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
5869 /* These attributes may apply to structure and union types being created,
5870 but otherwise should pass to the declaration involved. */
5873 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
5874 | (int) ATTR_FLAG_ARRAY_NEXT
))
5876 *no_add_attrs
= true;
5877 return tree_cons (name
, args
, NULL_TREE
);
5879 if (TREE_CODE (node
) == RECORD_TYPE
5880 || TREE_CODE (node
) == UNION_TYPE
)
5882 node
= TYPE_NAME (node
);
5888 warning (OPT_Wattributes
, "%qE attribute ignored",
5890 *no_add_attrs
= true;
5895 if (TREE_CODE (node
) != FUNCTION_DECL
5896 && TREE_CODE (node
) != VAR_DECL
5897 && TREE_CODE (node
) != TYPE_DECL
)
5899 *no_add_attrs
= true;
5900 warning (OPT_Wattributes
, "%qE attribute ignored",
5905 if (TREE_CODE (node
) == TYPE_DECL
5906 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
5907 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
5909 *no_add_attrs
= true;
5910 warning (OPT_Wattributes
, "%qE attribute ignored",
5915 is_dllimport
= is_attribute_p ("dllimport", name
);
5917 /* Report error on dllimport ambiguities seen now before they cause
5921 /* Honor any target-specific overrides. */
5922 if (!targetm
.valid_dllimport_attribute_p (node
))
5923 *no_add_attrs
= true;
5925 else if (TREE_CODE (node
) == FUNCTION_DECL
5926 && DECL_DECLARED_INLINE_P (node
))
5928 warning (OPT_Wattributes
, "inline function %q+D declared as "
5929 " dllimport: attribute ignored", node
);
5930 *no_add_attrs
= true;
5932 /* Like MS, treat definition of dllimported variables and
5933 non-inlined functions on declaration as syntax errors. */
5934 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
5936 error ("function %q+D definition is marked dllimport", node
);
5937 *no_add_attrs
= true;
5940 else if (TREE_CODE (node
) == VAR_DECL
)
5942 if (DECL_INITIAL (node
))
5944 error ("variable %q+D definition is marked dllimport",
5946 *no_add_attrs
= true;
5949 /* `extern' needn't be specified with dllimport.
5950 Specify `extern' now and hope for the best. Sigh. */
5951 DECL_EXTERNAL (node
) = 1;
5952 /* Also, implicitly give dllimport'd variables declared within
5953 a function global scope, unless declared static. */
5954 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
5955 TREE_PUBLIC (node
) = 1;
5958 if (*no_add_attrs
== false)
5959 DECL_DLLIMPORT_P (node
) = 1;
5961 else if (TREE_CODE (node
) == FUNCTION_DECL
5962 && DECL_DECLARED_INLINE_P (node
)
5963 && flag_keep_inline_dllexport
)
5964 /* An exported function, even if inline, must be emitted. */
5965 DECL_EXTERNAL (node
) = 0;
5967 /* Report error if symbol is not accessible at global scope. */
5968 if (!TREE_PUBLIC (node
)
5969 && (TREE_CODE (node
) == VAR_DECL
5970 || TREE_CODE (node
) == FUNCTION_DECL
))
5972 error ("external linkage required for symbol %q+D because of "
5973 "%qE attribute", node
, name
);
5974 *no_add_attrs
= true;
5977 /* A dllexport'd entity must have default visibility so that other
5978 program units (shared libraries or the main executable) can see
5979 it. A dllimport'd entity must have default visibility so that
5980 the linker knows that undefined references within this program
5981 unit can be resolved by the dynamic linker. */
5984 if (DECL_VISIBILITY_SPECIFIED (node
)
5985 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
5986 error ("%qE implies default visibility, but %qD has already "
5987 "been declared with a different visibility",
5989 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
5990 DECL_VISIBILITY_SPECIFIED (node
) = 1;
5996 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
5998 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5999 of the various TYPE_QUAL values. Also, set the UPC layout qualifier,
6000 which is either null or a reference to an integral constant. */
6003 set_type_quals (tree type
, int type_quals
, tree layout_qualifier
)
6005 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6006 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6007 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6008 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6009 TYPE_SHARED (type
) = (type_quals
& TYPE_QUAL_SHARED
) != 0;
6010 TYPE_STRICT (type
) = (type_quals
& TYPE_QUAL_STRICT
) != 0;
6011 TYPE_RELAXED (type
) = (type_quals
& TYPE_QUAL_RELAXED
) != 0;
6012 if (TYPE_SHARED (type
))
6013 SET_TYPE_BLOCK_FACTOR (type
, layout_qualifier
);
6016 /* Returns true iff CAND is equivalent to BASE with
6017 TYPE_QUALS and LAYOUT_QUALIFIER. */
6020 check_qualified_type (const_tree cand
, const_tree base
,
6021 int type_quals
, tree layout_qualifier
)
6023 return (TYPE_QUALS (cand
) == type_quals
6024 && (TYPE_BLOCK_FACTOR (cand
) == layout_qualifier
6025 || tree_int_cst_equal (TYPE_BLOCK_FACTOR (cand
),
6027 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6028 /* Apparently this is needed for Objective-C. */
6029 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6030 /* Check alignment. */
6031 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6032 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6033 TYPE_ATTRIBUTES (base
)));
6036 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6039 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6041 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6042 && (TYPE_BLOCK_FACTOR (cand
) == TYPE_BLOCK_FACTOR (base
)
6043 || tree_int_cst_equal (TYPE_BLOCK_FACTOR (cand
),
6044 TYPE_BLOCK_FACTOR (base
)))
6045 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6046 /* Apparently this is needed for Objective-C. */
6047 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6048 /* Check alignment. */
6049 && TYPE_ALIGN (cand
) == align
6050 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6051 TYPE_ATTRIBUTES (base
)));
6054 /* Return a version of the TYPE, qualified as indicated by the
6055 TYPE_QUALS, if one exists. If no qualified version exists yet,
6056 return NULL_TREE. */
6059 get_qualified_type_1 (tree type
, int type_quals
, tree layout_qualifier
)
6063 if (TYPE_QUALS (type
) == type_quals
)
6066 /* Search the chain of variants to see if there is already one there just
6067 like the one we need to have. If so, use that existing one. We must
6068 preserve the TYPE_NAME, since there is code that depends on this. */
6069 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6070 if (check_qualified_type (t
, type
, type_quals
, layout_qualifier
))
6076 /* Like get_qualified_type_1, but creates the type if it does not
6077 exist. This function never returns NULL_TREE. */
6080 build_qualified_type_1 (tree type
, int type_quals
, tree layout_qualifier
)
6084 /* See if we already have the appropriate qualified variant. */
6085 t
= get_qualified_type_1 (type
, type_quals
, layout_qualifier
);
6087 /* If not, build it. */
6090 t
= build_variant_type_copy (type
);
6091 set_type_quals (t
, type_quals
, layout_qualifier
);
6093 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6094 /* Propagate structural equality. */
6095 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6096 else if (TYPE_CANONICAL (type
) != type
)
6097 /* Build the underlying canonical type, since it is different
6099 TYPE_CANONICAL (t
) = build_qualified_type (TYPE_CANONICAL (type
),
6102 /* T is its own canonical type. */
6103 TYPE_CANONICAL (t
) = t
;
6110 /* Return a variant of TYPE, where all UPC qualifiers
6111 have been removed. */
6114 build_upc_unshared_type (tree type
)
6117 if (TREE_CODE (type
) == ARRAY_TYPE
)
6119 const tree elem_type
= TREE_TYPE(type
);
6120 const tree u_elem_type
= build_upc_unshared_type (elem_type
);
6121 if (u_elem_type
!= elem_type
)
6123 for (u_type
= TYPE_MAIN_VARIANT (type
);
6124 u_type
&& TREE_TYPE(u_type
) != u_elem_type
;
6125 u_type
= TYPE_NEXT_VARIANT (u_type
)) /* loop */;
6128 u_type
= build_variant_type_copy (type
);
6129 TREE_TYPE (u_type
) = u_elem_type
;
6135 const int quals
= TYPE_QUALS (type
);
6136 const int u_quals
= quals
& ~(TYPE_QUAL_SHARED
6138 | TYPE_QUAL_STRICT
);
6139 u_type
= build_qualified_type (type
, u_quals
);
6144 /* Create a variant of type T with alignment ALIGN. */
6147 build_aligned_type (tree type
, unsigned int align
)
6151 if (TYPE_PACKED (type
)
6152 || TYPE_ALIGN (type
) == align
)
6155 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6156 if (check_aligned_type (t
, type
, align
))
6159 t
= build_variant_type_copy (type
);
6160 TYPE_ALIGN (t
) = align
;
6165 /* Create a new distinct copy of TYPE. The new type is made its own
6166 MAIN_VARIANT. If TYPE requires structural equality checks, the
6167 resulting type requires structural equality checks; otherwise, its
6168 TYPE_CANONICAL points to itself. */
6171 build_distinct_type_copy (tree type
)
6173 tree t
= copy_node (type
);
6175 TYPE_POINTER_TO (t
) = 0;
6176 TYPE_REFERENCE_TO (t
) = 0;
6178 /* Set the canonical type either to a new equivalence class, or
6179 propagate the need for structural equality checks. */
6180 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6181 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6183 TYPE_CANONICAL (t
) = t
;
6185 /* Make it its own variant. */
6186 TYPE_MAIN_VARIANT (t
) = t
;
6187 TYPE_NEXT_VARIANT (t
) = 0;
6189 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6190 whose TREE_TYPE is not t. This can also happen in the Ada
6191 frontend when using subtypes. */
6196 /* Create a new variant of TYPE, equivalent but distinct. This is so
6197 the caller can modify it. TYPE_CANONICAL for the return type will
6198 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6199 are considered equal by the language itself (or that both types
6200 require structural equality checks). */
6203 build_variant_type_copy (tree type
)
6205 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6207 t
= build_distinct_type_copy (type
);
6209 /* Since we're building a variant, assume that it is a non-semantic
6210 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6211 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6213 /* Add the new type to the chain of variants of TYPE. */
6214 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6215 TYPE_NEXT_VARIANT (m
) = t
;
6216 TYPE_MAIN_VARIANT (t
) = m
;
6221 /* Return true if the from tree in both tree maps are equal. */
6224 tree_map_base_eq (const void *va
, const void *vb
)
6226 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6227 *const b
= (const struct tree_map_base
*) vb
;
6228 return (a
->from
== b
->from
);
6231 /* Hash a from tree in a tree_base_map. */
6234 tree_map_base_hash (const void *item
)
6236 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6239 /* Return true if this tree map structure is marked for garbage collection
6240 purposes. We simply return true if the from tree is marked, so that this
6241 structure goes away when the from tree goes away. */
6244 tree_map_base_marked_p (const void *p
)
6246 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6249 /* Hash a from tree in a tree_map. */
6252 tree_map_hash (const void *item
)
6254 return (((const struct tree_map
*) item
)->hash
);
6257 /* Hash a from tree in a tree_decl_map. */
6260 tree_decl_map_hash (const void *item
)
6262 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6265 /* Return the initialization priority for DECL. */
6268 decl_init_priority_lookup (tree decl
)
6270 struct tree_priority_map
*h
;
6271 struct tree_map_base in
;
6273 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6275 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6276 return h
? h
->init
: DEFAULT_INIT_PRIORITY
;
6279 /* Return the finalization priority for DECL. */
6282 decl_fini_priority_lookup (tree decl
)
6284 struct tree_priority_map
*h
;
6285 struct tree_map_base in
;
6287 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6289 h
= (struct tree_priority_map
*) htab_find (init_priority_for_decl
, &in
);
6290 return h
? h
->fini
: DEFAULT_INIT_PRIORITY
;
6293 /* Return the initialization and finalization priority information for
6294 DECL. If there is no previous priority information, a freshly
6295 allocated structure is returned. */
6297 static struct tree_priority_map
*
6298 decl_priority_info (tree decl
)
6300 struct tree_priority_map in
;
6301 struct tree_priority_map
*h
;
6304 in
.base
.from
= decl
;
6305 loc
= htab_find_slot (init_priority_for_decl
, &in
, INSERT
);
6306 h
= (struct tree_priority_map
*) *loc
;
6309 h
= ggc_alloc_cleared_tree_priority_map ();
6311 h
->base
.from
= decl
;
6312 h
->init
= DEFAULT_INIT_PRIORITY
;
6313 h
->fini
= DEFAULT_INIT_PRIORITY
;
6319 /* Set the initialization priority for DECL to PRIORITY. */
6322 decl_init_priority_insert (tree decl
, priority_type priority
)
6324 struct tree_priority_map
*h
;
6326 gcc_assert (VAR_OR_FUNCTION_DECL_P (decl
));
6327 if (priority
== DEFAULT_INIT_PRIORITY
)
6329 h
= decl_priority_info (decl
);
6333 /* Set the finalization priority for DECL to PRIORITY. */
6336 decl_fini_priority_insert (tree decl
, priority_type priority
)
6338 struct tree_priority_map
*h
;
6340 gcc_assert (TREE_CODE (decl
) == FUNCTION_DECL
);
6341 if (priority
== DEFAULT_INIT_PRIORITY
)
6343 h
= decl_priority_info (decl
);
6347 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6350 print_debug_expr_statistics (void)
6352 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6353 (long) htab_size (debug_expr_for_decl
),
6354 (long) htab_elements (debug_expr_for_decl
),
6355 htab_collisions (debug_expr_for_decl
));
6358 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6361 print_value_expr_statistics (void)
6363 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6364 (long) htab_size (value_expr_for_decl
),
6365 (long) htab_elements (value_expr_for_decl
),
6366 htab_collisions (value_expr_for_decl
));
6369 /* Lookup a debug expression for FROM, and return it if we find one. */
6372 decl_debug_expr_lookup (tree from
)
6374 struct tree_decl_map
*h
, in
;
6375 in
.base
.from
= from
;
6377 h
= (struct tree_decl_map
*)
6378 htab_find_with_hash (debug_expr_for_decl
, &in
, DECL_UID (from
));
6384 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6387 decl_debug_expr_insert (tree from
, tree to
)
6389 struct tree_decl_map
*h
;
6392 h
= ggc_alloc_tree_decl_map ();
6393 h
->base
.from
= from
;
6395 loc
= htab_find_slot_with_hash (debug_expr_for_decl
, h
, DECL_UID (from
),
6397 *(struct tree_decl_map
**) loc
= h
;
6400 /* Lookup a value expression for FROM, and return it if we find one. */
6403 decl_value_expr_lookup (tree from
)
6405 struct tree_decl_map
*h
, in
;
6406 in
.base
.from
= from
;
6408 h
= (struct tree_decl_map
*)
6409 htab_find_with_hash (value_expr_for_decl
, &in
, DECL_UID (from
));
6415 /* Insert a mapping FROM->TO in the value expression hashtable. */
6418 decl_value_expr_insert (tree from
, tree to
)
6420 struct tree_decl_map
*h
;
6423 h
= ggc_alloc_tree_decl_map ();
6424 h
->base
.from
= from
;
6426 loc
= htab_find_slot_with_hash (value_expr_for_decl
, h
, DECL_UID (from
),
6428 *(struct tree_decl_map
**) loc
= h
;
6431 /* Lookup a vector of debug arguments for FROM, and return it if we
6435 decl_debug_args_lookup (tree from
)
6437 struct tree_vec_map
*h
, in
;
6439 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6441 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6442 in
.base
.from
= from
;
6443 h
= (struct tree_vec_map
*)
6444 htab_find_with_hash (debug_args_for_decl
, &in
, DECL_UID (from
));
6450 /* Insert a mapping FROM->empty vector of debug arguments in the value
6451 expression hashtable. */
6454 decl_debug_args_insert (tree from
)
6456 struct tree_vec_map
*h
;
6459 if (DECL_HAS_DEBUG_ARGS_P (from
))
6460 return decl_debug_args_lookup (from
);
6461 if (debug_args_for_decl
== NULL
)
6462 debug_args_for_decl
= htab_create_ggc (64, tree_vec_map_hash
,
6463 tree_vec_map_eq
, 0);
6464 h
= ggc_alloc_tree_vec_map ();
6465 h
->base
.from
= from
;
6467 loc
= htab_find_slot_with_hash (debug_args_for_decl
, h
, DECL_UID (from
),
6469 *(struct tree_vec_map
**) loc
= h
;
6470 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6474 /* Hashing of types so that we don't make duplicates.
6475 The entry point is `type_hash_canon'. */
6477 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6478 with types in the TREE_VALUE slots), by adding the hash codes
6479 of the individual types. */
6482 type_hash_list (const_tree list
, hashval_t hashcode
)
6486 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6487 if (TREE_VALUE (tail
) != error_mark_node
)
6488 hashcode
= iterative_hash_object (TYPE_HASH (TREE_VALUE (tail
)),
6494 /* These are the Hashtable callback functions. */
6496 /* Returns true iff the types are equivalent. */
6499 type_hash_eq (const void *va
, const void *vb
)
6501 const struct type_hash
*const a
= (const struct type_hash
*) va
,
6502 *const b
= (const struct type_hash
*) vb
;
6504 /* First test the things that are the same for all types. */
6505 if (a
->hash
!= b
->hash
6506 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6507 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6508 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6509 TYPE_ATTRIBUTES (b
->type
))
6510 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6511 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6514 /* Be careful about comparing arrays before and after the element type
6515 has been completed; don't compare TYPE_ALIGN unless both types are
6517 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6518 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6519 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6522 switch (TREE_CODE (a
->type
))
6527 case REFERENCE_TYPE
:
6532 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6535 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6536 && !(TYPE_VALUES (a
->type
)
6537 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6538 && TYPE_VALUES (b
->type
)
6539 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6540 && type_list_equal (TYPE_VALUES (a
->type
),
6541 TYPE_VALUES (b
->type
))))
6544 /* ... fall through ... */
6549 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6550 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6551 TYPE_MAX_VALUE (b
->type
)))
6552 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6553 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6554 TYPE_MIN_VALUE (b
->type
))));
6556 case FIXED_POINT_TYPE
:
6557 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6560 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6563 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6564 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6565 || (TYPE_ARG_TYPES (a
->type
)
6566 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6567 && TYPE_ARG_TYPES (b
->type
)
6568 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6569 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6570 TYPE_ARG_TYPES (b
->type
)))))
6574 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6578 case QUAL_UNION_TYPE
:
6579 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6580 || (TYPE_FIELDS (a
->type
)
6581 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6582 && TYPE_FIELDS (b
->type
)
6583 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6584 && type_list_equal (TYPE_FIELDS (a
->type
),
6585 TYPE_FIELDS (b
->type
))));
6588 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6589 || (TYPE_ARG_TYPES (a
->type
)
6590 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6591 && TYPE_ARG_TYPES (b
->type
)
6592 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6593 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6594 TYPE_ARG_TYPES (b
->type
))))
6602 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6603 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6608 /* Return the cached hash value. */
6611 type_hash_hash (const void *item
)
6613 return ((const struct type_hash
*) item
)->hash
;
6616 /* Look in the type hash table for a type isomorphic to TYPE.
6617 If one is found, return it. Otherwise return 0. */
6620 type_hash_lookup (hashval_t hashcode
, tree type
)
6622 struct type_hash
*h
, in
;
6624 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6625 must call that routine before comparing TYPE_ALIGNs. */
6631 h
= (struct type_hash
*) htab_find_with_hash (type_hash_table
, &in
,
6638 /* Add an entry to the type-hash-table
6639 for a type TYPE whose hash code is HASHCODE. */
6642 type_hash_add (hashval_t hashcode
, tree type
)
6644 struct type_hash
*h
;
6647 h
= ggc_alloc_type_hash ();
6650 loc
= htab_find_slot_with_hash (type_hash_table
, h
, hashcode
, INSERT
);
6654 /* Given TYPE, and HASHCODE its hash code, return the canonical
6655 object for an identical type if one already exists.
6656 Otherwise, return TYPE, and record it as the canonical object.
6658 To use this function, first create a type of the sort you want.
6659 Then compute its hash code from the fields of the type that
6660 make it different from other similar types.
6661 Then call this function and use the value. */
6664 type_hash_canon (unsigned int hashcode
, tree type
)
6668 /* The hash table only contains main variants, so ensure that's what we're
6670 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6672 /* See if the type is in the hash table already. If so, return it.
6673 Otherwise, add the type. */
6674 t1
= type_hash_lookup (hashcode
, type
);
6677 if (GATHER_STATISTICS
)
6679 tree_code_counts
[(int) TREE_CODE (type
)]--;
6680 tree_node_counts
[(int) t_kind
]--;
6681 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
6687 type_hash_add (hashcode
, type
);
6692 /* See if the data pointed to by the type hash table is marked. We consider
6693 it marked if the type is marked or if a debug type number or symbol
6694 table entry has been made for the type. */
6697 type_hash_marked_p (const void *p
)
6699 const_tree
const type
= ((const struct type_hash
*) p
)->type
;
6701 return ggc_marked_p (type
);
6705 print_type_hash_statistics (void)
6707 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6708 (long) htab_size (type_hash_table
),
6709 (long) htab_elements (type_hash_table
),
6710 htab_collisions (type_hash_table
));
6713 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
6714 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
6715 by adding the hash codes of the individual attributes. */
6718 attribute_hash_list (const_tree list
, hashval_t hashcode
)
6722 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6723 /* ??? Do we want to add in TREE_VALUE too? */
6724 hashcode
= iterative_hash_object
6725 (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)), hashcode
);
6729 /* Given two lists of attributes, return true if list l2 is
6730 equivalent to l1. */
6733 attribute_list_equal (const_tree l1
, const_tree l2
)
6738 return attribute_list_contained (l1
, l2
)
6739 && attribute_list_contained (l2
, l1
);
6742 /* Given two lists of attributes, return true if list L2 is
6743 completely contained within L1. */
6744 /* ??? This would be faster if attribute names were stored in a canonicalized
6745 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
6746 must be used to show these elements are equivalent (which they are). */
6747 /* ??? It's not clear that attributes with arguments will always be handled
6751 attribute_list_contained (const_tree l1
, const_tree l2
)
6755 /* First check the obvious, maybe the lists are identical. */
6759 /* Maybe the lists are similar. */
6760 for (t1
= l1
, t2
= l2
;
6762 && get_attribute_name (t1
) == get_attribute_name (t2
)
6763 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
6764 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6767 /* Maybe the lists are equal. */
6768 if (t1
== 0 && t2
== 0)
6771 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
6774 /* This CONST_CAST is okay because lookup_attribute does not
6775 modify its argument and the return value is assigned to a
6777 for (attr
= lookup_ident_attribute (get_attribute_name (t2
), CONST_CAST_TREE(l1
));
6778 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
6779 attr
= lookup_ident_attribute (get_attribute_name (t2
), TREE_CHAIN (attr
)))
6782 if (attr
== NULL_TREE
)
6789 /* Given two lists of types
6790 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6791 return 1 if the lists contain the same types in the same order.
6792 Also, the TREE_PURPOSEs must match. */
6795 type_list_equal (const_tree l1
, const_tree l2
)
6799 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6800 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6801 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6802 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6803 && (TREE_TYPE (TREE_PURPOSE (t1
))
6804 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6810 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6811 given by TYPE. If the argument list accepts variable arguments,
6812 then this function counts only the ordinary arguments. */
6815 type_num_arguments (const_tree type
)
6820 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6821 /* If the function does not take a variable number of arguments,
6822 the last element in the list will have type `void'. */
6823 if (VOID_TYPE_P (TREE_VALUE (t
)))
6831 /* Nonzero if integer constants T1 and T2
6832 represent the same constant value. */
6835 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6840 if (t1
== 0 || t2
== 0)
6843 if (TREE_CODE (t1
) == INTEGER_CST
6844 && TREE_CODE (t2
) == INTEGER_CST
6845 && TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
6846 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
))
6852 /* Nonzero if integer constants T1 and T2 represent values that satisfy <.
6853 The precise way of comparison depends on their data type. */
6856 tree_int_cst_lt (const_tree t1
, const_tree t2
)
6861 if (TYPE_UNSIGNED (TREE_TYPE (t1
)) != TYPE_UNSIGNED (TREE_TYPE (t2
)))
6863 int t1_sgn
= tree_int_cst_sgn (t1
);
6864 int t2_sgn
= tree_int_cst_sgn (t2
);
6866 if (t1_sgn
< t2_sgn
)
6868 else if (t1_sgn
> t2_sgn
)
6870 /* Otherwise, both are non-negative, so we compare them as
6871 unsigned just in case one of them would overflow a signed
6874 else if (!TYPE_UNSIGNED (TREE_TYPE (t1
)))
6875 return INT_CST_LT (t1
, t2
);
6877 return INT_CST_LT_UNSIGNED (t1
, t2
);
6880 /* Returns -1 if T1 < T2, 0 if T1 == T2, and 1 if T1 > T2. */
6883 tree_int_cst_compare (const_tree t1
, const_tree t2
)
6885 if (tree_int_cst_lt (t1
, t2
))
6887 else if (tree_int_cst_lt (t2
, t1
))
6893 /* Return 1 if T is an INTEGER_CST that can be manipulated efficiently on
6894 the host. If POS is zero, the value can be represented in a single
6895 HOST_WIDE_INT. If POS is nonzero, the value must be non-negative and can
6896 be represented in a single unsigned HOST_WIDE_INT. */
6899 host_integerp (const_tree t
, int pos
)
6904 return (TREE_CODE (t
) == INTEGER_CST
6905 && ((TREE_INT_CST_HIGH (t
) == 0
6906 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) >= 0)
6907 || (! pos
&& TREE_INT_CST_HIGH (t
) == -1
6908 && (HOST_WIDE_INT
) TREE_INT_CST_LOW (t
) < 0
6909 && !TYPE_UNSIGNED (TREE_TYPE (t
)))
6910 || (pos
&& TREE_INT_CST_HIGH (t
) == 0)));
6913 /* Return the HOST_WIDE_INT least significant bits of T if it is an
6914 INTEGER_CST and there is no overflow. POS is nonzero if the result must
6915 be non-negative. We must be able to satisfy the above conditions. */
6918 tree_low_cst (const_tree t
, int pos
)
6920 gcc_assert (host_integerp (t
, pos
));
6921 return TREE_INT_CST_LOW (t
);
6924 /* Return the HOST_WIDE_INT least significant bits of T, a sizetype
6925 kind INTEGER_CST. This makes sure to properly sign-extend the
6929 size_low_cst (const_tree t
)
6931 double_int d
= tree_to_double_int (t
);
6932 return d
.sext (TYPE_PRECISION (TREE_TYPE (t
))).low
;
6935 /* Return the most significant (sign) bit of T. */
6938 tree_int_cst_sign_bit (const_tree t
)
6940 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6941 unsigned HOST_WIDE_INT w
;
6943 if (bitno
< HOST_BITS_PER_WIDE_INT
)
6944 w
= TREE_INT_CST_LOW (t
);
6947 w
= TREE_INT_CST_HIGH (t
);
6948 bitno
-= HOST_BITS_PER_WIDE_INT
;
6951 return (w
>> bitno
) & 1;
6954 /* Return an indication of the sign of the integer constant T.
6955 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6956 Note that -1 will never be returned if T's type is unsigned. */
6959 tree_int_cst_sgn (const_tree t
)
6961 if (TREE_INT_CST_LOW (t
) == 0 && TREE_INT_CST_HIGH (t
) == 0)
6963 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6965 else if (TREE_INT_CST_HIGH (t
) < 0)
6971 /* Return the minimum number of bits needed to represent VALUE in a
6972 signed or unsigned type, UNSIGNEDP says which. */
6975 tree_int_cst_min_precision (tree value
, bool unsignedp
)
6977 /* If the value is negative, compute its negative minus 1. The latter
6978 adjustment is because the absolute value of the largest negative value
6979 is one larger than the largest positive value. This is equivalent to
6980 a bit-wise negation, so use that operation instead. */
6982 if (tree_int_cst_sgn (value
) < 0)
6983 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6985 /* Return the number of bits needed, taking into account the fact
6986 that we need one more bit for a signed than unsigned type.
6987 If value is 0 or -1, the minimum precision is 1 no matter
6988 whether unsignedp is true or false. */
6990 if (integer_zerop (value
))
6993 return tree_floor_log2 (value
) + 1 + !unsignedp
;
6996 /* Compare two constructor-element-type constants. Return 1 if the lists
6997 are known to be equal; otherwise return 0. */
7000 simple_cst_list_equal (const_tree l1
, const_tree l2
)
7002 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
7004 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
7007 l1
= TREE_CHAIN (l1
);
7008 l2
= TREE_CHAIN (l2
);
7014 /* Return truthvalue of whether T1 is the same tree structure as T2.
7015 Return 1 if they are the same.
7016 Return 0 if they are understandably different.
7017 Return -1 if either contains tree structure not understood by
7021 simple_cst_equal (const_tree t1
, const_tree t2
)
7023 enum tree_code code1
, code2
;
7029 if (t1
== 0 || t2
== 0)
7032 code1
= TREE_CODE (t1
);
7033 code2
= TREE_CODE (t2
);
7035 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7037 if (CONVERT_EXPR_CODE_P (code2
)
7038 || code2
== NON_LVALUE_EXPR
)
7039 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7041 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7044 else if (CONVERT_EXPR_CODE_P (code2
)
7045 || code2
== NON_LVALUE_EXPR
)
7046 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7054 return (TREE_INT_CST_LOW (t1
) == TREE_INT_CST_LOW (t2
)
7055 && TREE_INT_CST_HIGH (t1
) == TREE_INT_CST_HIGH (t2
));
7058 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7061 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7064 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7065 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7066 TREE_STRING_LENGTH (t1
)));
7070 unsigned HOST_WIDE_INT idx
;
7071 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7072 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7074 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7077 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7078 /* ??? Should we handle also fields here? */
7079 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7085 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7088 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7091 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7094 const_tree arg1
, arg2
;
7095 const_call_expr_arg_iterator iter1
, iter2
;
7096 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7097 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7099 arg1
= next_const_call_expr_arg (&iter1
),
7100 arg2
= next_const_call_expr_arg (&iter2
))
7102 cmp
= simple_cst_equal (arg1
, arg2
);
7106 return arg1
== arg2
;
7110 /* Special case: if either target is an unallocated VAR_DECL,
7111 it means that it's going to be unified with whatever the
7112 TARGET_EXPR is really supposed to initialize, so treat it
7113 as being equivalent to anything. */
7114 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7115 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7116 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7117 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7118 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7119 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7122 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7127 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7129 case WITH_CLEANUP_EXPR
:
7130 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7134 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7137 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7138 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7152 /* This general rule works for most tree codes. All exceptions should be
7153 handled above. If this is a language-specific tree code, we can't
7154 trust what might be in the operand, so say we don't know
7156 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7159 switch (TREE_CODE_CLASS (code1
))
7163 case tcc_comparison
:
7164 case tcc_expression
:
7168 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7170 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7182 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7183 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7184 than U, respectively. */
7187 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7189 if (tree_int_cst_sgn (t
) < 0)
7191 else if (TREE_INT_CST_HIGH (t
) != 0)
7193 else if (TREE_INT_CST_LOW (t
) == u
)
7195 else if (TREE_INT_CST_LOW (t
) < u
)
7201 /* Return true if SIZE represents a constant size that is in bounds of
7202 what the middle-end and the backend accepts (covering not more than
7203 half of the address-space). */
7206 valid_constant_size_p (const_tree size
)
7208 if (! host_integerp (size
, 1)
7209 || TREE_OVERFLOW (size
)
7210 || tree_int_cst_sign_bit (size
) != 0)
7215 /* Return the precision of the type, or for a complex or vector type the
7216 precision of the type of its elements. */
7219 element_precision (const_tree type
)
7221 enum tree_code code
= TREE_CODE (type
);
7222 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7223 type
= TREE_TYPE (type
);
7225 return TYPE_PRECISION (type
);
7228 /* Return true if CODE represents an associative tree code. Otherwise
7231 associative_tree_code (enum tree_code code
)
7250 /* Return true if CODE represents a commutative tree code. Otherwise
7253 commutative_tree_code (enum tree_code code
)
7259 case MULT_HIGHPART_EXPR
:
7267 case UNORDERED_EXPR
:
7271 case TRUTH_AND_EXPR
:
7272 case TRUTH_XOR_EXPR
:
7274 case WIDEN_MULT_EXPR
:
7275 case VEC_WIDEN_MULT_HI_EXPR
:
7276 case VEC_WIDEN_MULT_LO_EXPR
:
7277 case VEC_WIDEN_MULT_EVEN_EXPR
:
7278 case VEC_WIDEN_MULT_ODD_EXPR
:
7287 /* Return true if CODE represents a ternary tree code for which the
7288 first two operands are commutative. Otherwise return false. */
7290 commutative_ternary_tree_code (enum tree_code code
)
7294 case WIDEN_MULT_PLUS_EXPR
:
7295 case WIDEN_MULT_MINUS_EXPR
:
7304 /* Generate a hash value for an expression. This can be used iteratively
7305 by passing a previous result as the VAL argument.
7307 This function is intended to produce the same hash for expressions which
7308 would compare equal using operand_equal_p. */
7311 iterative_hash_expr (const_tree t
, hashval_t val
)
7314 enum tree_code code
;
7318 return iterative_hash_hashval_t (0, val
);
7320 code
= TREE_CODE (t
);
7324 /* Alas, constants aren't shared, so we can't rely on pointer
7327 val
= iterative_hash_host_wide_int (TREE_INT_CST_LOW (t
), val
);
7328 return iterative_hash_host_wide_int (TREE_INT_CST_HIGH (t
), val
);
7331 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7333 return iterative_hash_hashval_t (val2
, val
);
7337 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7339 return iterative_hash_hashval_t (val2
, val
);
7342 return iterative_hash (TREE_STRING_POINTER (t
),
7343 TREE_STRING_LENGTH (t
), val
);
7345 val
= iterative_hash_expr (TREE_REALPART (t
), val
);
7346 return iterative_hash_expr (TREE_IMAGPART (t
), val
);
7350 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7351 val
= iterative_hash_expr (VECTOR_CST_ELT (t
, i
), val
);
7355 /* We can just compare by pointer. */
7356 return iterative_hash_host_wide_int (SSA_NAME_VERSION (t
), val
);
7357 case PLACEHOLDER_EXPR
:
7358 /* The node itself doesn't matter. */
7361 /* A list of expressions, for a CALL_EXPR or as the elements of a
7363 for (; t
; t
= TREE_CHAIN (t
))
7364 val
= iterative_hash_expr (TREE_VALUE (t
), val
);
7368 unsigned HOST_WIDE_INT idx
;
7370 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7372 val
= iterative_hash_expr (field
, val
);
7373 val
= iterative_hash_expr (value
, val
);
7379 /* The type of the second operand is relevant, except for
7380 its top-level qualifiers. */
7381 tree type
= TYPE_MAIN_VARIANT (TREE_TYPE (TREE_OPERAND (t
, 1)));
7383 val
= iterative_hash_object (TYPE_HASH (type
), val
);
7385 /* We could use the standard hash computation from this point
7387 val
= iterative_hash_object (code
, val
);
7388 val
= iterative_hash_expr (TREE_OPERAND (t
, 1), val
);
7389 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7393 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7394 Otherwise nodes that compare equal according to operand_equal_p might
7395 get different hash codes. However, don't do this for machine specific
7396 or front end builtins, since the function code is overloaded in those
7398 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7399 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7401 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7402 code
= TREE_CODE (t
);
7406 tclass
= TREE_CODE_CLASS (code
);
7408 if (tclass
== tcc_declaration
)
7410 /* DECL's have a unique ID */
7411 val
= iterative_hash_host_wide_int (DECL_UID (t
), val
);
7415 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7417 val
= iterative_hash_object (code
, val
);
7419 /* Don't hash the type, that can lead to having nodes which
7420 compare equal according to operand_equal_p, but which
7421 have different hash codes. */
7422 if (CONVERT_EXPR_CODE_P (code
)
7423 || code
== NON_LVALUE_EXPR
)
7425 /* Make sure to include signness in the hash computation. */
7426 val
+= TYPE_UNSIGNED (TREE_TYPE (t
));
7427 val
= iterative_hash_expr (TREE_OPERAND (t
, 0), val
);
7430 else if (commutative_tree_code (code
))
7432 /* It's a commutative expression. We want to hash it the same
7433 however it appears. We do this by first hashing both operands
7434 and then rehashing based on the order of their independent
7436 hashval_t one
= iterative_hash_expr (TREE_OPERAND (t
, 0), 0);
7437 hashval_t two
= iterative_hash_expr (TREE_OPERAND (t
, 1), 0);
7441 t
= one
, one
= two
, two
= t
;
7443 val
= iterative_hash_hashval_t (one
, val
);
7444 val
= iterative_hash_hashval_t (two
, val
);
7447 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7448 val
= iterative_hash_expr (TREE_OPERAND (t
, i
), val
);
7454 /* Generate a hash value for a pair of expressions. This can be used
7455 iteratively by passing a previous result as the VAL argument.
7457 The same hash value is always returned for a given pair of expressions,
7458 regardless of the order in which they are presented. This is useful in
7459 hashing the operands of commutative functions. */
7462 iterative_hash_exprs_commutative (const_tree t1
,
7463 const_tree t2
, hashval_t val
)
7465 hashval_t one
= iterative_hash_expr (t1
, 0);
7466 hashval_t two
= iterative_hash_expr (t2
, 0);
7470 t
= one
, one
= two
, two
= t
;
7471 val
= iterative_hash_hashval_t (one
, val
);
7472 val
= iterative_hash_hashval_t (two
, val
);
7477 /* Constructors for pointer, array and function types.
7478 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7479 constructed by language-dependent code, not here.) */
7481 /* Construct, lay out and return the type of pointers to TO_TYPE with
7482 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7483 reference all of memory. If such a type has already been
7484 constructed, reuse it. */
7487 build_pointer_type_for_mode (tree to_type
, enum machine_mode mode
,
7492 if (to_type
== error_mark_node
)
7493 return error_mark_node
;
7495 /* If the pointed-to type has the may_alias attribute set, force
7496 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7497 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7498 can_alias_all
= true;
7500 /* In some cases, languages will have things that aren't a POINTER_TYPE
7501 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7502 In that case, return that type without regard to the rest of our
7505 ??? This is a kludge, but consistent with the way this function has
7506 always operated and there doesn't seem to be a good way to avoid this
7508 if (TYPE_POINTER_TO (to_type
) != 0
7509 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7510 return TYPE_POINTER_TO (to_type
);
7512 /* First, if we already have a type for pointers to TO_TYPE and it's
7513 the proper mode, use it. */
7514 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7515 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7518 t
= make_node (POINTER_TYPE
);
7520 TREE_TYPE (t
) = to_type
;
7521 SET_TYPE_MODE (t
, mode
);
7522 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7523 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7524 TYPE_POINTER_TO (to_type
) = t
;
7526 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7527 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7528 else if (TYPE_CANONICAL (to_type
) != to_type
)
7530 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7531 mode
, can_alias_all
);
7533 /* Lay out the type. This function has many callers that are concerned
7534 with expression-construction, and this simplifies them all. */
7540 /* By default build pointers in ptr_mode. */
7543 build_pointer_type (tree to_type
)
7545 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7546 : TYPE_ADDR_SPACE (to_type
);
7547 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7548 if (upc_shared_type_p (to_type
))
7551 pointer_mode
= TYPE_MODE (upc_pts_rep_type_node
);
7552 upc_pts_type
= build_pointer_type_for_mode (to_type
, pointer_mode
,
7554 TYPE_USER_ALIGN (upc_pts_type
) = TYPE_USER_ALIGN (upc_pts_rep_type_node
);
7555 TYPE_ALIGN (upc_pts_type
) = TYPE_ALIGN (upc_pts_rep_type_node
);
7556 return upc_pts_type
;
7558 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7561 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7564 build_reference_type_for_mode (tree to_type
, enum machine_mode mode
,
7569 if (to_type
== error_mark_node
)
7570 return error_mark_node
;
7572 /* If the pointed-to type has the may_alias attribute set, force
7573 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7574 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7575 can_alias_all
= true;
7577 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7578 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7579 In that case, return that type without regard to the rest of our
7582 ??? This is a kludge, but consistent with the way this function has
7583 always operated and there doesn't seem to be a good way to avoid this
7585 if (TYPE_REFERENCE_TO (to_type
) != 0
7586 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7587 return TYPE_REFERENCE_TO (to_type
);
7589 /* First, if we already have a type for pointers to TO_TYPE and it's
7590 the proper mode, use it. */
7591 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7592 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7595 t
= make_node (REFERENCE_TYPE
);
7597 TREE_TYPE (t
) = to_type
;
7598 SET_TYPE_MODE (t
, mode
);
7599 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7600 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7601 TYPE_REFERENCE_TO (to_type
) = t
;
7603 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7604 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7605 else if (TYPE_CANONICAL (to_type
) != to_type
)
7607 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7608 mode
, can_alias_all
);
7616 /* Build the node for the type of references-to-TO_TYPE by default
7620 build_reference_type (tree to_type
)
7622 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7623 : TYPE_ADDR_SPACE (to_type
);
7624 enum machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7625 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7628 /* Build a type that is compatible with t but has no cv quals anywhere
7631 const char *const *const * -> char ***. */
7634 build_type_no_quals (tree t
)
7636 switch (TREE_CODE (t
))
7639 return build_pointer_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7641 TYPE_REF_CAN_ALIAS_ALL (t
));
7642 case REFERENCE_TYPE
:
7644 build_reference_type_for_mode (build_type_no_quals (TREE_TYPE (t
)),
7646 TYPE_REF_CAN_ALIAS_ALL (t
));
7648 return TYPE_MAIN_VARIANT (t
);
7652 #define MAX_INT_CACHED_PREC \
7653 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7654 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7656 /* Builds a signed or unsigned integer type of precision PRECISION.
7657 Used for C bitfields whose precision does not match that of
7658 built-in target types. */
7660 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7666 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7668 if (precision
<= MAX_INT_CACHED_PREC
)
7670 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7675 itype
= make_node (INTEGER_TYPE
);
7676 TYPE_PRECISION (itype
) = precision
;
7679 fixup_unsigned_type (itype
);
7681 fixup_signed_type (itype
);
7684 if (host_integerp (TYPE_MAX_VALUE (itype
), 1))
7685 ret
= type_hash_canon (tree_low_cst (TYPE_MAX_VALUE (itype
), 1), itype
);
7686 if (precision
<= MAX_INT_CACHED_PREC
)
7687 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7692 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7693 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7694 is true, reuse such a type that has already been constructed. */
7697 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7699 tree itype
= make_node (INTEGER_TYPE
);
7700 hashval_t hashcode
= 0;
7702 TREE_TYPE (itype
) = type
;
7704 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7705 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7707 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7708 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7709 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7710 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7711 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7712 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7717 if ((TYPE_MIN_VALUE (itype
)
7718 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7719 || (TYPE_MAX_VALUE (itype
)
7720 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7722 /* Since we cannot reliably merge this type, we need to compare it using
7723 structural equality checks. */
7724 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7728 hashcode
= iterative_hash_expr (TYPE_MIN_VALUE (itype
), hashcode
);
7729 hashcode
= iterative_hash_expr (TYPE_MAX_VALUE (itype
), hashcode
);
7730 hashcode
= iterative_hash_hashval_t (TYPE_HASH (type
), hashcode
);
7731 itype
= type_hash_canon (hashcode
, itype
);
7736 /* Wrapper around build_range_type_1 with SHARED set to true. */
7739 build_range_type (tree type
, tree lowval
, tree highval
)
7741 return build_range_type_1 (type
, lowval
, highval
, true);
7744 /* Wrapper around build_range_type_1 with SHARED set to false. */
7747 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7749 return build_range_type_1 (type
, lowval
, highval
, false);
7752 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7753 MAXVAL should be the maximum value in the domain
7754 (one less than the length of the array).
7756 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7757 We don't enforce this limit, that is up to caller (e.g. language front end).
7758 The limit exists because the result is a signed type and we don't handle
7759 sizes that use more than one HOST_WIDE_INT. */
7762 build_index_type (tree maxval
)
7764 return build_range_type (sizetype
, size_zero_node
, maxval
);
7767 /* Return true if the debug information for TYPE, a subtype, should be emitted
7768 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7769 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7770 debug info and doesn't reflect the source code. */
7773 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7775 tree base_type
= TREE_TYPE (type
), low
, high
;
7777 /* Subrange types have a base type which is an integral type. */
7778 if (!INTEGRAL_TYPE_P (base_type
))
7781 /* Get the real bounds of the subtype. */
7782 if (lang_hooks
.types
.get_subrange_bounds
)
7783 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7786 low
= TYPE_MIN_VALUE (type
);
7787 high
= TYPE_MAX_VALUE (type
);
7790 /* If the type and its base type have the same representation and the same
7791 name, then the type is not a subrange but a copy of the base type. */
7792 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7793 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7794 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7795 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7796 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
)))
7798 tree type_name
= TYPE_NAME (type
);
7799 tree base_type_name
= TYPE_NAME (base_type
);
7801 if (type_name
&& TREE_CODE (type_name
) == TYPE_DECL
)
7802 type_name
= DECL_NAME (type_name
);
7804 if (base_type_name
&& TREE_CODE (base_type_name
) == TYPE_DECL
)
7805 base_type_name
= DECL_NAME (base_type_name
);
7807 if (type_name
== base_type_name
)
7818 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7819 and number of elements specified by the range of values of INDEX_TYPE.
7820 If SHARED is true, reuse such a type that has already been constructed. */
7823 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
7827 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7829 error ("arrays of functions are not meaningful");
7830 elt_type
= integer_type_node
;
7833 t
= make_node (ARRAY_TYPE
);
7834 TREE_TYPE (t
) = elt_type
;
7835 TYPE_DOMAIN (t
) = index_type
;
7836 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7839 /* If the element type is incomplete at this point we get marked for
7840 structural equality. Do not record these types in the canonical
7842 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7847 hashval_t hashcode
= iterative_hash_object (TYPE_HASH (elt_type
), 0);
7849 hashcode
= iterative_hash_object (TYPE_HASH (index_type
), hashcode
);
7850 t
= type_hash_canon (hashcode
, t
);
7853 if (TYPE_CANONICAL (t
) == t
)
7855 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7856 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
7857 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7858 else if (TYPE_CANONICAL (elt_type
) != elt_type
7859 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7861 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7863 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7870 /* Wrapper around build_array_type_1 with SHARED set to true. */
7873 build_array_type (tree elt_type
, tree index_type
)
7875 return build_array_type_1 (elt_type
, index_type
, true);
7878 /* Wrapper around build_array_type_1 with SHARED set to false. */
7881 build_nonshared_array_type (tree elt_type
, tree index_type
)
7883 return build_array_type_1 (elt_type
, index_type
, false);
7886 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7890 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7892 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7895 /* Recursively examines the array elements of TYPE, until a non-array
7896 element type is found. */
7899 strip_array_types (tree type
)
7901 while (TREE_CODE (type
) == ARRAY_TYPE
)
7902 type
= TREE_TYPE (type
);
7907 /* Computes the canonical argument types from the argument type list
7910 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7911 on entry to this function, or if any of the ARGTYPES are
7914 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7915 true on entry to this function, or if any of the ARGTYPES are
7918 Returns a canonical argument list, which may be ARGTYPES when the
7919 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7920 true) or would not differ from ARGTYPES. */
7923 maybe_canonicalize_argtypes(tree argtypes
,
7924 bool *any_structural_p
,
7925 bool *any_noncanonical_p
)
7928 bool any_noncanonical_argtypes_p
= false;
7930 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7932 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7933 /* Fail gracefully by stating that the type is structural. */
7934 *any_structural_p
= true;
7935 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7936 *any_structural_p
= true;
7937 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7938 || TREE_PURPOSE (arg
))
7939 /* If the argument has a default argument, we consider it
7940 non-canonical even though the type itself is canonical.
7941 That way, different variants of function and method types
7942 with default arguments will all point to the variant with
7943 no defaults as their canonical type. */
7944 any_noncanonical_argtypes_p
= true;
7947 if (*any_structural_p
)
7950 if (any_noncanonical_argtypes_p
)
7952 /* Build the canonical list of argument types. */
7953 tree canon_argtypes
= NULL_TREE
;
7954 bool is_void
= false;
7956 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7958 if (arg
== void_list_node
)
7961 canon_argtypes
= tree_cons (NULL_TREE
,
7962 TYPE_CANONICAL (TREE_VALUE (arg
)),
7966 canon_argtypes
= nreverse (canon_argtypes
);
7968 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7970 /* There is a non-canonical type. */
7971 *any_noncanonical_p
= true;
7972 return canon_argtypes
;
7975 /* The canonical argument types are the same as ARGTYPES. */
7979 /* Construct, lay out and return
7980 the type of functions returning type VALUE_TYPE
7981 given arguments of types ARG_TYPES.
7982 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7983 are data type nodes for the arguments of the function.
7984 If such a type has already been constructed, reuse it. */
7987 build_function_type (tree value_type
, tree arg_types
)
7990 hashval_t hashcode
= 0;
7991 bool any_structural_p
, any_noncanonical_p
;
7992 tree canon_argtypes
;
7994 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7996 error ("function return type cannot be function");
7997 value_type
= integer_type_node
;
8000 /* Make a node of the sort we want. */
8001 t
= make_node (FUNCTION_TYPE
);
8002 TREE_TYPE (t
) = value_type
;
8003 TYPE_ARG_TYPES (t
) = arg_types
;
8005 /* If we already have such a type, use the old one. */
8006 hashcode
= iterative_hash_object (TYPE_HASH (value_type
), hashcode
);
8007 hashcode
= type_hash_list (arg_types
, hashcode
);
8008 t
= type_hash_canon (hashcode
, t
);
8010 /* Set up the canonical type. */
8011 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8012 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8013 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8015 &any_noncanonical_p
);
8016 if (any_structural_p
)
8017 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8018 else if (any_noncanonical_p
)
8019 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8022 if (!COMPLETE_TYPE_P (t
))
8027 /* Build variant of function type ORIG_TYPE skipping ARGS_TO_SKIP and the
8028 return value if SKIP_RETURN is true. */
8031 build_function_type_skip_args (tree orig_type
, bitmap args_to_skip
,
8034 tree new_type
= NULL
;
8035 tree args
, new_args
= NULL
, t
;
8039 for (args
= TYPE_ARG_TYPES (orig_type
); args
&& args
!= void_list_node
;
8040 args
= TREE_CHAIN (args
), i
++)
8041 if (!args_to_skip
|| !bitmap_bit_p (args_to_skip
, i
))
8042 new_args
= tree_cons (NULL_TREE
, TREE_VALUE (args
), new_args
);
8044 new_reversed
= nreverse (new_args
);
8048 TREE_CHAIN (new_args
) = void_list_node
;
8050 new_reversed
= void_list_node
;
8053 /* Use copy_node to preserve as much as possible from original type
8054 (debug info, attribute lists etc.)
8055 Exception is METHOD_TYPEs must have THIS argument.
8056 When we are asked to remove it, we need to build new FUNCTION_TYPE
8058 if (TREE_CODE (orig_type
) != METHOD_TYPE
8060 || !bitmap_bit_p (args_to_skip
, 0))
8062 new_type
= build_distinct_type_copy (orig_type
);
8063 TYPE_ARG_TYPES (new_type
) = new_reversed
;
8068 = build_distinct_type_copy (build_function_type (TREE_TYPE (orig_type
),
8070 TYPE_CONTEXT (new_type
) = TYPE_CONTEXT (orig_type
);
8074 TREE_TYPE (new_type
) = void_type_node
;
8076 /* This is a new type, not a copy of an old type. Need to reassociate
8077 variants. We can handle everything except the main variant lazily. */
8078 t
= TYPE_MAIN_VARIANT (orig_type
);
8081 t
= build_function_type_skip_args (t
, args_to_skip
, skip_return
);
8082 TYPE_MAIN_VARIANT (new_type
) = t
;
8083 TYPE_NEXT_VARIANT (new_type
) = TYPE_NEXT_VARIANT (t
);
8084 TYPE_NEXT_VARIANT (t
) = new_type
;
8088 TYPE_MAIN_VARIANT (new_type
) = new_type
;
8089 TYPE_NEXT_VARIANT (new_type
) = NULL
;
8095 /* Build variant of function decl ORIG_DECL skipping ARGS_TO_SKIP and the
8096 return value if SKIP_RETURN is true.
8098 Arguments from DECL_ARGUMENTS list can't be removed now, since they are
8099 linked by TREE_CHAIN directly. The caller is responsible for eliminating
8100 them when they are being duplicated (i.e. copy_arguments_for_versioning). */
8103 build_function_decl_skip_args (tree orig_decl
, bitmap args_to_skip
,
8106 tree new_decl
= copy_node (orig_decl
);
8109 new_type
= TREE_TYPE (orig_decl
);
8110 if (prototype_p (new_type
)
8111 || (skip_return
&& !VOID_TYPE_P (TREE_TYPE (new_type
))))
8113 = build_function_type_skip_args (new_type
, args_to_skip
, skip_return
);
8114 TREE_TYPE (new_decl
) = new_type
;
8116 /* For declarations setting DECL_VINDEX (i.e. methods)
8117 we expect first argument to be THIS pointer. */
8118 if (args_to_skip
&& bitmap_bit_p (args_to_skip
, 0))
8119 DECL_VINDEX (new_decl
) = NULL_TREE
;
8121 /* When signature changes, we need to clear builtin info. */
8122 if (DECL_BUILT_IN (new_decl
)
8124 && !bitmap_empty_p (args_to_skip
))
8126 DECL_BUILT_IN_CLASS (new_decl
) = NOT_BUILT_IN
;
8127 DECL_FUNCTION_CODE (new_decl
) = (enum built_in_function
) 0;
8132 /* Build a function type. The RETURN_TYPE is the type returned by the
8133 function. If VAARGS is set, no void_type_node is appended to the
8134 the list. ARGP must be always be terminated be a NULL_TREE. */
8137 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8141 t
= va_arg (argp
, tree
);
8142 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8143 args
= tree_cons (NULL_TREE
, t
, args
);
8148 if (args
!= NULL_TREE
)
8149 args
= nreverse (args
);
8150 gcc_assert (last
!= void_list_node
);
8152 else if (args
== NULL_TREE
)
8153 args
= void_list_node
;
8157 args
= nreverse (args
);
8158 TREE_CHAIN (last
) = void_list_node
;
8160 args
= build_function_type (return_type
, args
);
8165 /* Build a function type. The RETURN_TYPE is the type returned by the
8166 function. If additional arguments are provided, they are
8167 additional argument types. The list of argument types must always
8168 be terminated by NULL_TREE. */
8171 build_function_type_list (tree return_type
, ...)
8176 va_start (p
, return_type
);
8177 args
= build_function_type_list_1 (false, return_type
, p
);
8182 /* Build a variable argument function type. The RETURN_TYPE is the
8183 type returned by the function. If additional arguments are provided,
8184 they are additional argument types. The list of argument types must
8185 always be terminated by NULL_TREE. */
8188 build_varargs_function_type_list (tree return_type
, ...)
8193 va_start (p
, return_type
);
8194 args
= build_function_type_list_1 (true, return_type
, p
);
8200 /* Build a function type. RETURN_TYPE is the type returned by the
8201 function; VAARGS indicates whether the function takes varargs. The
8202 function takes N named arguments, the types of which are provided in
8206 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8210 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8212 for (i
= n
- 1; i
>= 0; i
--)
8213 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8215 return build_function_type (return_type
, t
);
8218 /* Build a function type. RETURN_TYPE is the type returned by the
8219 function. The function takes N named arguments, the types of which
8220 are provided in ARG_TYPES. */
8223 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8225 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8228 /* Build a variable argument function type. RETURN_TYPE is the type
8229 returned by the function. The function takes N named arguments, the
8230 types of which are provided in ARG_TYPES. */
8233 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8235 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8238 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8239 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8240 for the method. An implicit additional parameter (of type
8241 pointer-to-BASETYPE) is added to the ARGTYPES. */
8244 build_method_type_directly (tree basetype
,
8251 bool any_structural_p
, any_noncanonical_p
;
8252 tree canon_argtypes
;
8254 /* Make a node of the sort we want. */
8255 t
= make_node (METHOD_TYPE
);
8257 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8258 TREE_TYPE (t
) = rettype
;
8259 ptype
= build_pointer_type (basetype
);
8261 /* The actual arglist for this function includes a "hidden" argument
8262 which is "this". Put it into the list of argument types. */
8263 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8264 TYPE_ARG_TYPES (t
) = argtypes
;
8266 /* If we already have such a type, use the old one. */
8267 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8268 hashcode
= iterative_hash_object (TYPE_HASH (rettype
), hashcode
);
8269 hashcode
= type_hash_list (argtypes
, hashcode
);
8270 t
= type_hash_canon (hashcode
, t
);
8272 /* Set up the canonical type. */
8274 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8275 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8277 = (TYPE_CANONICAL (basetype
) != basetype
8278 || TYPE_CANONICAL (rettype
) != rettype
);
8279 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8281 &any_noncanonical_p
);
8282 if (any_structural_p
)
8283 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8284 else if (any_noncanonical_p
)
8286 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8287 TYPE_CANONICAL (rettype
),
8289 if (!COMPLETE_TYPE_P (t
))
8295 /* Construct, lay out and return the type of methods belonging to class
8296 BASETYPE and whose arguments and values are described by TYPE.
8297 If that type exists already, reuse it.
8298 TYPE must be a FUNCTION_TYPE node. */
8301 build_method_type (tree basetype
, tree type
)
8303 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8305 return build_method_type_directly (basetype
,
8307 TYPE_ARG_TYPES (type
));
8310 /* Construct, lay out and return the type of offsets to a value
8311 of type TYPE, within an object of type BASETYPE.
8312 If a suitable offset type exists already, reuse it. */
8315 build_offset_type (tree basetype
, tree type
)
8318 hashval_t hashcode
= 0;
8320 /* Make a node of the sort we want. */
8321 t
= make_node (OFFSET_TYPE
);
8323 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8324 TREE_TYPE (t
) = type
;
8326 /* If we already have such a type, use the old one. */
8327 hashcode
= iterative_hash_object (TYPE_HASH (basetype
), hashcode
);
8328 hashcode
= iterative_hash_object (TYPE_HASH (type
), hashcode
);
8329 t
= type_hash_canon (hashcode
, t
);
8331 if (!COMPLETE_TYPE_P (t
))
8334 if (TYPE_CANONICAL (t
) == t
)
8336 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8337 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8338 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8339 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8340 || TYPE_CANONICAL (type
) != type
)
8342 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8343 TYPE_CANONICAL (type
));
8349 /* Create a complex type whose components are COMPONENT_TYPE. */
8352 build_complex_type (tree component_type
)
8357 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8358 || SCALAR_FLOAT_TYPE_P (component_type
)
8359 || FIXED_POINT_TYPE_P (component_type
));
8361 /* Make a node of the sort we want. */
8362 t
= make_node (COMPLEX_TYPE
);
8364 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8366 /* If we already have such a type, use the old one. */
8367 hashcode
= iterative_hash_object (TYPE_HASH (component_type
), 0);
8368 t
= type_hash_canon (hashcode
, t
);
8370 if (!COMPLETE_TYPE_P (t
))
8373 if (TYPE_CANONICAL (t
) == t
)
8375 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8376 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8377 else if (TYPE_CANONICAL (component_type
) != component_type
)
8379 = build_complex_type (TYPE_CANONICAL (component_type
));
8382 /* We need to create a name, since complex is a fundamental type. */
8383 if (! TYPE_NAME (t
))
8386 if (component_type
== char_type_node
)
8387 name
= "complex char";
8388 else if (component_type
== signed_char_type_node
)
8389 name
= "complex signed char";
8390 else if (component_type
== unsigned_char_type_node
)
8391 name
= "complex unsigned char";
8392 else if (component_type
== short_integer_type_node
)
8393 name
= "complex short int";
8394 else if (component_type
== short_unsigned_type_node
)
8395 name
= "complex short unsigned int";
8396 else if (component_type
== integer_type_node
)
8397 name
= "complex int";
8398 else if (component_type
== unsigned_type_node
)
8399 name
= "complex unsigned int";
8400 else if (component_type
== long_integer_type_node
)
8401 name
= "complex long int";
8402 else if (component_type
== long_unsigned_type_node
)
8403 name
= "complex long unsigned int";
8404 else if (component_type
== long_long_integer_type_node
)
8405 name
= "complex long long int";
8406 else if (component_type
== long_long_unsigned_type_node
)
8407 name
= "complex long long unsigned int";
8412 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8413 get_identifier (name
), t
);
8416 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8419 /* If TYPE is a real or complex floating-point type and the target
8420 does not directly support arithmetic on TYPE then return the wider
8421 type to be used for arithmetic on TYPE. Otherwise, return
8425 excess_precision_type (tree type
)
8427 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8429 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8430 switch (TREE_CODE (type
))
8433 switch (flt_eval_method
)
8436 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8437 return double_type_node
;
8440 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8441 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8442 return long_double_type_node
;
8449 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8451 switch (flt_eval_method
)
8454 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8455 return complex_double_type_node
;
8458 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8459 || (TYPE_MODE (TREE_TYPE (type
))
8460 == TYPE_MODE (double_type_node
)))
8461 return complex_long_double_type_node
;
8474 /* Return OP, stripped of any conversions to wider types as much as is safe.
8475 Converting the value back to OP's type makes a value equivalent to OP.
8477 If FOR_TYPE is nonzero, we return a value which, if converted to
8478 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8480 OP must have integer, real or enumeral type. Pointers are not allowed!
8482 There are some cases where the obvious value we could return
8483 would regenerate to OP if converted to OP's type,
8484 but would not extend like OP to wider types.
8485 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8486 For example, if OP is (unsigned short)(signed char)-1,
8487 we avoid returning (signed char)-1 if FOR_TYPE is int,
8488 even though extending that to an unsigned short would regenerate OP,
8489 since the result of extending (signed char)-1 to (int)
8490 is different from (int) OP. */
8493 get_unwidened (tree op
, tree for_type
)
8495 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8496 tree type
= TREE_TYPE (op
);
8498 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8500 = (for_type
!= 0 && for_type
!= type
8501 && final_prec
> TYPE_PRECISION (type
)
8502 && TYPE_UNSIGNED (type
));
8505 while (CONVERT_EXPR_P (op
))
8509 /* TYPE_PRECISION on vector types has different meaning
8510 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8511 so avoid them here. */
8512 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8515 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8516 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8518 /* Truncations are many-one so cannot be removed.
8519 Unless we are later going to truncate down even farther. */
8521 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8524 /* See what's inside this conversion. If we decide to strip it,
8526 op
= TREE_OPERAND (op
, 0);
8528 /* If we have not stripped any zero-extensions (uns is 0),
8529 we can strip any kind of extension.
8530 If we have previously stripped a zero-extension,
8531 only zero-extensions can safely be stripped.
8532 Any extension can be stripped if the bits it would produce
8533 are all going to be discarded later by truncating to FOR_TYPE. */
8537 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8539 /* TYPE_UNSIGNED says whether this is a zero-extension.
8540 Let's avoid computing it if it does not affect WIN
8541 and if UNS will not be needed again. */
8543 || CONVERT_EXPR_P (op
))
8544 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8552 /* If we finally reach a constant see if it fits in for_type and
8553 in that case convert it. */
8555 && TREE_CODE (win
) == INTEGER_CST
8556 && TREE_TYPE (win
) != for_type
8557 && int_fits_type_p (win
, for_type
))
8558 win
= fold_convert (for_type
, win
);
8563 /* Return OP or a simpler expression for a narrower value
8564 which can be sign-extended or zero-extended to give back OP.
8565 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8566 or 0 if the value should be sign-extended. */
8569 get_narrower (tree op
, int *unsignedp_ptr
)
8574 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8576 while (TREE_CODE (op
) == NOP_EXPR
)
8579 = (TYPE_PRECISION (TREE_TYPE (op
))
8580 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8582 /* Truncations are many-one so cannot be removed. */
8586 /* See what's inside this conversion. If we decide to strip it,
8591 op
= TREE_OPERAND (op
, 0);
8592 /* An extension: the outermost one can be stripped,
8593 but remember whether it is zero or sign extension. */
8595 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8596 /* Otherwise, if a sign extension has been stripped,
8597 only sign extensions can now be stripped;
8598 if a zero extension has been stripped, only zero-extensions. */
8599 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8603 else /* bitschange == 0 */
8605 /* A change in nominal type can always be stripped, but we must
8606 preserve the unsignedness. */
8608 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8610 op
= TREE_OPERAND (op
, 0);
8611 /* Keep trying to narrow, but don't assign op to win if it
8612 would turn an integral type into something else. */
8613 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8620 if (TREE_CODE (op
) == COMPONENT_REF
8621 /* Since type_for_size always gives an integer type. */
8622 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8623 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8624 /* Ensure field is laid out already. */
8625 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8626 && host_integerp (DECL_SIZE (TREE_OPERAND (op
, 1)), 1))
8628 unsigned HOST_WIDE_INT innerprec
8629 = tree_low_cst (DECL_SIZE (TREE_OPERAND (op
, 1)), 1);
8630 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8631 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8632 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8634 /* We can get this structure field in a narrower type that fits it,
8635 but the resulting extension to its nominal type (a fullword type)
8636 must satisfy the same conditions as for other extensions.
8638 Do this only for fields that are aligned (not bit-fields),
8639 because when bit-field insns will be used there is no
8640 advantage in doing this. */
8642 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8643 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8644 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8648 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8649 win
= fold_convert (type
, op
);
8653 *unsignedp_ptr
= uns
;
8657 /* Returns true if integer constant C has a value that is permissible
8658 for type TYPE (an INTEGER_TYPE). */
8661 int_fits_type_p (const_tree c
, const_tree type
)
8663 tree type_low_bound
, type_high_bound
;
8664 bool ok_for_low_bound
, ok_for_high_bound
, unsc
;
8667 dc
= tree_to_double_int (c
);
8668 unsc
= TYPE_UNSIGNED (TREE_TYPE (c
));
8671 type_low_bound
= TYPE_MIN_VALUE (type
);
8672 type_high_bound
= TYPE_MAX_VALUE (type
);
8674 /* If at least one bound of the type is a constant integer, we can check
8675 ourselves and maybe make a decision. If no such decision is possible, but
8676 this type is a subtype, try checking against that. Otherwise, use
8677 double_int_fits_to_tree_p, which checks against the precision.
8679 Compute the status for each possibly constant bound, and return if we see
8680 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8681 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8682 for "constant known to fit". */
8684 /* Check if c >= type_low_bound. */
8685 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8687 dd
= tree_to_double_int (type_low_bound
);
8688 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_low_bound
)))
8690 int c_neg
= (!unsc
&& dc
.is_negative ());
8691 int t_neg
= (unsc
&& dd
.is_negative ());
8693 if (c_neg
&& !t_neg
)
8695 if ((c_neg
|| !t_neg
) && dc
.ult (dd
))
8698 else if (dc
.cmp (dd
, unsc
) < 0)
8700 ok_for_low_bound
= true;
8703 ok_for_low_bound
= false;
8705 /* Check if c <= type_high_bound. */
8706 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8708 dd
= tree_to_double_int (type_high_bound
);
8709 if (unsc
!= TYPE_UNSIGNED (TREE_TYPE (type_high_bound
)))
8711 int c_neg
= (!unsc
&& dc
.is_negative ());
8712 int t_neg
= (unsc
&& dd
.is_negative ());
8714 if (t_neg
&& !c_neg
)
8716 if ((t_neg
|| !c_neg
) && dc
.ugt (dd
))
8719 else if (dc
.cmp (dd
, unsc
) > 0)
8721 ok_for_high_bound
= true;
8724 ok_for_high_bound
= false;
8726 /* If the constant fits both bounds, the result is known. */
8727 if (ok_for_low_bound
&& ok_for_high_bound
)
8730 /* Perform some generic filtering which may allow making a decision
8731 even if the bounds are not constant. First, negative integers
8732 never fit in unsigned types, */
8733 if (TYPE_UNSIGNED (type
) && !unsc
&& dc
.is_negative ())
8736 /* Second, narrower types always fit in wider ones. */
8737 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8740 /* Third, unsigned integers with top bit set never fit signed types. */
8741 if (! TYPE_UNSIGNED (type
) && unsc
)
8743 int prec
= GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (c
))) - 1;
8744 if (prec
< HOST_BITS_PER_WIDE_INT
)
8746 if (((((unsigned HOST_WIDE_INT
) 1) << prec
) & dc
.low
) != 0)
8749 else if (((((unsigned HOST_WIDE_INT
) 1)
8750 << (prec
- HOST_BITS_PER_WIDE_INT
)) & dc
.high
) != 0)
8754 /* If we haven't been able to decide at this point, there nothing more we
8755 can check ourselves here. Look at the base type if we have one and it
8756 has the same precision. */
8757 if (TREE_CODE (type
) == INTEGER_TYPE
8758 && TREE_TYPE (type
) != 0
8759 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8761 type
= TREE_TYPE (type
);
8765 /* Or to double_int_fits_to_tree_p, if nothing else. */
8766 return double_int_fits_to_tree_p (type
, dc
);
8769 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8770 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8771 represented (assuming two's-complement arithmetic) within the bit
8772 precision of the type are returned instead. */
8775 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8777 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8778 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8779 mpz_set_double_int (min
, tree_to_double_int (TYPE_MIN_VALUE (type
)),
8780 TYPE_UNSIGNED (type
));
8783 if (TYPE_UNSIGNED (type
))
8784 mpz_set_ui (min
, 0);
8788 mn
= double_int::mask (TYPE_PRECISION (type
) - 1);
8789 mn
= (mn
+ double_int_one
).sext (TYPE_PRECISION (type
));
8790 mpz_set_double_int (min
, mn
, false);
8794 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8795 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8796 mpz_set_double_int (max
, tree_to_double_int (TYPE_MAX_VALUE (type
)),
8797 TYPE_UNSIGNED (type
));
8800 if (TYPE_UNSIGNED (type
))
8801 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
)),
8804 mpz_set_double_int (max
, double_int::mask (TYPE_PRECISION (type
) - 1),
8809 /* Return true if VAR is an automatic variable defined in function FN. */
8812 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8814 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8815 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8816 || TREE_CODE (var
) == PARM_DECL
)
8817 && ! TREE_STATIC (var
))
8818 || TREE_CODE (var
) == LABEL_DECL
8819 || TREE_CODE (var
) == RESULT_DECL
));
8822 /* Subprogram of following function. Called by walk_tree.
8824 Return *TP if it is an automatic variable or parameter of the
8825 function passed in as DATA. */
8828 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8830 tree fn
= (tree
) data
;
8835 else if (DECL_P (*tp
)
8836 && auto_var_in_fn_p (*tp
, fn
))
8842 /* Returns true if T is, contains, or refers to a type with variable
8843 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8844 arguments, but not the return type. If FN is nonzero, only return
8845 true if a modifier of the type or position of FN is a variable or
8846 parameter inside FN.
8848 This concept is more general than that of C99 'variably modified types':
8849 in C99, a struct type is never variably modified because a VLA may not
8850 appear as a structure member. However, in GNU C code like:
8852 struct S { int i[f()]; };
8854 is valid, and other languages may define similar constructs. */
8857 variably_modified_type_p (tree type
, tree fn
)
8861 /* Test if T is either variable (if FN is zero) or an expression containing
8862 a variable in FN. If TYPE isn't gimplified, return true also if
8863 gimplify_one_sizepos would gimplify the expression into a local
8865 #define RETURN_TRUE_IF_VAR(T) \
8866 do { tree _t = (T); \
8867 if (_t != NULL_TREE \
8868 && _t != error_mark_node \
8869 && TREE_CODE (_t) != INTEGER_CST \
8870 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8872 || (!TYPE_SIZES_GIMPLIFIED (type) \
8873 && !is_gimple_sizepos (_t)) \
8874 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8875 return true; } while (0)
8877 if (type
== error_mark_node
)
8880 /* If TYPE itself has variable size, it is variably modified. */
8881 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8882 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8884 switch (TREE_CODE (type
))
8887 case REFERENCE_TYPE
:
8889 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8895 /* If TYPE is a function type, it is variably modified if the
8896 return type is variably modified. */
8897 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8903 case FIXED_POINT_TYPE
:
8906 /* Scalar types are variably modified if their end points
8908 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8909 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8914 case QUAL_UNION_TYPE
:
8915 /* We can't see if any of the fields are variably-modified by the
8916 definition we normally use, since that would produce infinite
8917 recursion via pointers. */
8918 /* This is variably modified if some field's type is. */
8919 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8920 if (TREE_CODE (t
) == FIELD_DECL
)
8922 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8923 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8924 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8926 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8927 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8932 /* Do not call ourselves to avoid infinite recursion. This is
8933 variably modified if the element type is. */
8934 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8935 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8942 /* The current language may have other cases to check, but in general,
8943 all other types are not variably modified. */
8944 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8946 #undef RETURN_TRUE_IF_VAR
8949 /* Given a DECL or TYPE, return the scope in which it was declared, or
8950 NULL_TREE if there is no containing scope. */
8953 get_containing_scope (const_tree t
)
8955 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8958 /* Return the innermost context enclosing DECL that is
8959 a FUNCTION_DECL, or zero if none. */
8962 decl_function_context (const_tree decl
)
8966 if (TREE_CODE (decl
) == ERROR_MARK
)
8969 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8970 where we look up the function at runtime. Such functions always take
8971 a first argument of type 'pointer to real context'.
8973 C++ should really be fixed to use DECL_CONTEXT for the real context,
8974 and use something else for the "virtual context". */
8975 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8978 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8980 context
= DECL_CONTEXT (decl
);
8982 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8984 if (TREE_CODE (context
) == BLOCK
)
8985 context
= BLOCK_SUPERCONTEXT (context
);
8987 context
= get_containing_scope (context
);
8993 /* Return the innermost context enclosing DECL that is
8994 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8995 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8998 decl_type_context (const_tree decl
)
9000 tree context
= DECL_CONTEXT (decl
);
9003 switch (TREE_CODE (context
))
9005 case NAMESPACE_DECL
:
9006 case TRANSLATION_UNIT_DECL
:
9011 case QUAL_UNION_TYPE
:
9016 context
= DECL_CONTEXT (context
);
9020 context
= BLOCK_SUPERCONTEXT (context
);
9030 /* CALL is a CALL_EXPR. Return the declaration for the function
9031 called, or NULL_TREE if the called function cannot be
9035 get_callee_fndecl (const_tree call
)
9039 if (call
== error_mark_node
)
9040 return error_mark_node
;
9042 /* It's invalid to call this function with anything but a
9044 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9046 /* The first operand to the CALL is the address of the function
9048 addr
= CALL_EXPR_FN (call
);
9052 /* If this is a readonly function pointer, extract its initial value. */
9053 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9054 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9055 && DECL_INITIAL (addr
))
9056 addr
= DECL_INITIAL (addr
);
9058 /* If the address is just `&f' for some function `f', then we know
9059 that `f' is being called. */
9060 if (TREE_CODE (addr
) == ADDR_EXPR
9061 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9062 return TREE_OPERAND (addr
, 0);
9064 /* We couldn't figure out what was being called. */
9068 /* Print debugging information about tree nodes generated during the compile,
9069 and any language-specific information. */
9072 dump_tree_statistics (void)
9074 if (GATHER_STATISTICS
)
9077 int total_nodes
, total_bytes
;
9078 fprintf (stderr
, "Kind Nodes Bytes\n");
9079 fprintf (stderr
, "---------------------------------------\n");
9080 total_nodes
= total_bytes
= 0;
9081 for (i
= 0; i
< (int) all_kinds
; i
++)
9083 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9084 tree_node_counts
[i
], tree_node_sizes
[i
]);
9085 total_nodes
+= tree_node_counts
[i
];
9086 total_bytes
+= tree_node_sizes
[i
];
9088 fprintf (stderr
, "---------------------------------------\n");
9089 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9090 fprintf (stderr
, "---------------------------------------\n");
9091 fprintf (stderr
, "Code Nodes\n");
9092 fprintf (stderr
, "----------------------------\n");
9093 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9094 fprintf (stderr
, "%-20s %7d\n", tree_code_name
[i
], tree_code_counts
[i
]);
9095 fprintf (stderr
, "----------------------------\n");
9096 ssanames_print_statistics ();
9097 phinodes_print_statistics ();
9100 fprintf (stderr
, "(No per-node statistics)\n");
9102 print_type_hash_statistics ();
9103 print_debug_expr_statistics ();
9104 print_value_expr_statistics ();
9105 lang_hooks
.print_statistics ();
9108 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9110 /* Generate a crc32 of a byte. */
9113 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9117 for (ix
= bits
; ix
--; value
<<= 1)
9121 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9128 /* Generate a crc32 of a 32-bit unsigned. */
9131 crc32_unsigned (unsigned chksum
, unsigned value
)
9133 return crc32_unsigned_bits (chksum
, value
, 32);
9136 /* Generate a crc32 of a byte. */
9139 crc32_byte (unsigned chksum
, char byte
)
9141 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9144 /* Generate a crc32 of a string. */
9147 crc32_string (unsigned chksum
, const char *string
)
9151 chksum
= crc32_byte (chksum
, *string
);
9157 /* P is a string that will be used in a symbol. Mask out any characters
9158 that are not valid in that context. */
9161 clean_symbol_name (char *p
)
9165 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9168 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9175 /* Generate a name for a special-purpose function.
9176 The generated name may need to be unique across the whole link.
9177 Changes to this function may also require corresponding changes to
9178 xstrdup_mask_random.
9179 TYPE is some string to identify the purpose of this function to the
9180 linker or collect2; it must start with an uppercase letter,
9182 I - for constructors
9184 N - for C++ anonymous namespaces
9185 F - for DWARF unwind frame information. */
9188 get_file_function_name (const char *type
)
9194 /* If we already have a name we know to be unique, just use that. */
9195 if (first_global_object_name
)
9196 p
= q
= ASTRDUP (first_global_object_name
);
9197 /* If the target is handling the constructors/destructors, they
9198 will be local to this file and the name is only necessary for
9200 We also assign sub_I and sub_D sufixes to constructors called from
9201 the global static constructors. These are always local. */
9202 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9203 || (strncmp (type
, "sub_", 4) == 0
9204 && (type
[4] == 'I' || type
[4] == 'D')))
9206 const char *file
= main_input_filename
;
9208 file
= input_filename
;
9209 /* Just use the file's basename, because the full pathname
9210 might be quite long. */
9211 p
= q
= ASTRDUP (lbasename (file
));
9215 /* Otherwise, the name must be unique across the entire link.
9216 We don't have anything that we know to be unique to this translation
9217 unit, so use what we do have and throw in some randomness. */
9219 const char *name
= weak_global_object_name
;
9220 const char *file
= main_input_filename
;
9225 file
= input_filename
;
9227 len
= strlen (file
);
9228 q
= (char *) alloca (9 + 17 + len
+ 1);
9229 memcpy (q
, file
, len
+ 1);
9231 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9232 crc32_string (0, name
), get_random_seed (false));
9237 clean_symbol_name (q
);
9238 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9241 /* Set up the name of the file-level functions we may need.
9242 Use a global object (which is already required to be unique over
9243 the program) rather than the file name (which imposes extra
9245 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9247 return get_identifier (buf
);
9250 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9252 /* Complain that the tree code of NODE does not match the expected 0
9253 terminated list of trailing codes. The trailing code list can be
9254 empty, for a more vague error message. FILE, LINE, and FUNCTION
9255 are of the caller. */
9258 tree_check_failed (const_tree node
, const char *file
,
9259 int line
, const char *function
, ...)
9263 unsigned length
= 0;
9266 va_start (args
, function
);
9267 while ((code
= va_arg (args
, int)))
9268 length
+= 4 + strlen (tree_code_name
[code
]);
9273 va_start (args
, function
);
9274 length
+= strlen ("expected ");
9275 buffer
= tmp
= (char *) alloca (length
);
9277 while ((code
= va_arg (args
, int)))
9279 const char *prefix
= length
? " or " : "expected ";
9281 strcpy (tmp
+ length
, prefix
);
9282 length
+= strlen (prefix
);
9283 strcpy (tmp
+ length
, tree_code_name
[code
]);
9284 length
+= strlen (tree_code_name
[code
]);
9289 buffer
= "unexpected node";
9291 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9292 buffer
, tree_code_name
[TREE_CODE (node
)],
9293 function
, trim_filename (file
), line
);
9296 /* Complain that the tree code of NODE does match the expected 0
9297 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9301 tree_not_check_failed (const_tree node
, const char *file
,
9302 int line
, const char *function
, ...)
9306 unsigned length
= 0;
9309 va_start (args
, function
);
9310 while ((code
= va_arg (args
, int)))
9311 length
+= 4 + strlen (tree_code_name
[code
]);
9313 va_start (args
, function
);
9314 buffer
= (char *) alloca (length
);
9316 while ((code
= va_arg (args
, int)))
9320 strcpy (buffer
+ length
, " or ");
9323 strcpy (buffer
+ length
, tree_code_name
[code
]);
9324 length
+= strlen (tree_code_name
[code
]);
9328 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9329 buffer
, tree_code_name
[TREE_CODE (node
)],
9330 function
, trim_filename (file
), line
);
9333 /* Similar to tree_check_failed, except that we check for a class of tree
9334 code, given in CL. */
9337 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9338 const char *file
, int line
, const char *function
)
9341 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9342 TREE_CODE_CLASS_STRING (cl
),
9343 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9344 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9347 /* Similar to tree_check_failed, except that instead of specifying a
9348 dozen codes, use the knowledge that they're all sequential. */
9351 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9352 const char *function
, enum tree_code c1
,
9356 unsigned length
= 0;
9359 for (c
= c1
; c
<= c2
; ++c
)
9360 length
+= 4 + strlen (tree_code_name
[c
]);
9362 length
+= strlen ("expected ");
9363 buffer
= (char *) alloca (length
);
9366 for (c
= c1
; c
<= c2
; ++c
)
9368 const char *prefix
= length
? " or " : "expected ";
9370 strcpy (buffer
+ length
, prefix
);
9371 length
+= strlen (prefix
);
9372 strcpy (buffer
+ length
, tree_code_name
[c
]);
9373 length
+= strlen (tree_code_name
[c
]);
9376 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9377 buffer
, tree_code_name
[TREE_CODE (node
)],
9378 function
, trim_filename (file
), line
);
9382 /* Similar to tree_check_failed, except that we check that a tree does
9383 not have the specified code, given in CL. */
9386 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9387 const char *file
, int line
, const char *function
)
9390 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9391 TREE_CODE_CLASS_STRING (cl
),
9392 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9393 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9397 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9400 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9401 const char *function
, enum omp_clause_code code
)
9403 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9404 omp_clause_code_name
[code
], tree_code_name
[TREE_CODE (node
)],
9405 function
, trim_filename (file
), line
);
9409 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9412 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9413 const char *function
, enum omp_clause_code c1
,
9414 enum omp_clause_code c2
)
9417 unsigned length
= 0;
9420 for (c
= c1
; c
<= c2
; ++c
)
9421 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9423 length
+= strlen ("expected ");
9424 buffer
= (char *) alloca (length
);
9427 for (c
= c1
; c
<= c2
; ++c
)
9429 const char *prefix
= length
? " or " : "expected ";
9431 strcpy (buffer
+ length
, prefix
);
9432 length
+= strlen (prefix
);
9433 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9434 length
+= strlen (omp_clause_code_name
[c
]);
9437 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9438 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9439 function
, trim_filename (file
), line
);
9443 #undef DEFTREESTRUCT
9444 #define DEFTREESTRUCT(VAL, NAME) NAME,
9446 static const char *ts_enum_names
[] = {
9447 #include "treestruct.def"
9449 #undef DEFTREESTRUCT
9451 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9453 /* Similar to tree_class_check_failed, except that we check for
9454 whether CODE contains the tree structure identified by EN. */
9457 tree_contains_struct_check_failed (const_tree node
,
9458 const enum tree_node_structure_enum en
,
9459 const char *file
, int line
,
9460 const char *function
)
9463 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9465 tree_code_name
[TREE_CODE (node
)], function
, trim_filename (file
), line
);
9469 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9470 (dynamically sized) vector. */
9473 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9474 const char *function
)
9477 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9478 idx
+ 1, len
, function
, trim_filename (file
), line
);
9481 /* Similar to above, except that the check is for the bounds of the operand
9482 vector of an expression node EXP. */
9485 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9486 int line
, const char *function
)
9488 int code
= TREE_CODE (exp
);
9490 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9491 idx
+ 1, tree_code_name
[code
], TREE_OPERAND_LENGTH (exp
),
9492 function
, trim_filename (file
), line
);
9495 /* Similar to above, except that the check is for the number of
9496 operands of an OMP_CLAUSE node. */
9499 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9500 int line
, const char *function
)
9503 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9504 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9505 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9506 trim_filename (file
), line
);
9508 #endif /* ENABLE_TREE_CHECKING */
9510 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9511 and mapped to the machine mode MODE. Initialize its fields and build
9512 the information necessary for debugging output. */
9515 make_vector_type (tree innertype
, int nunits
, enum machine_mode mode
)
9518 hashval_t hashcode
= 0;
9520 t
= make_node (VECTOR_TYPE
);
9521 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9522 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9523 SET_TYPE_MODE (t
, mode
);
9525 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9526 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9527 else if (TYPE_CANONICAL (innertype
) != innertype
9528 || mode
!= VOIDmode
)
9530 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9534 hashcode
= iterative_hash_host_wide_int (VECTOR_TYPE
, hashcode
);
9535 hashcode
= iterative_hash_host_wide_int (nunits
, hashcode
);
9536 hashcode
= iterative_hash_host_wide_int (mode
, hashcode
);
9537 hashcode
= iterative_hash_object (TYPE_HASH (TREE_TYPE (t
)), hashcode
);
9538 t
= type_hash_canon (hashcode
, t
);
9540 /* We have built a main variant, based on the main variant of the
9541 inner type. Use it to build the variant we return. */
9542 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9543 && TREE_TYPE (t
) != innertype
)
9544 return build_type_attribute_qual_variant (t
,
9545 TYPE_ATTRIBUTES (innertype
),
9546 TYPE_QUALS (innertype
));
9552 make_or_reuse_type (unsigned size
, int unsignedp
)
9554 if (size
== INT_TYPE_SIZE
)
9555 return unsignedp
? unsigned_type_node
: integer_type_node
;
9556 if (size
== CHAR_TYPE_SIZE
)
9557 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9558 if (size
== SHORT_TYPE_SIZE
)
9559 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9560 if (size
== LONG_TYPE_SIZE
)
9561 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9562 if (size
== LONG_LONG_TYPE_SIZE
)
9563 return (unsignedp
? long_long_unsigned_type_node
9564 : long_long_integer_type_node
);
9565 if (size
== 128 && int128_integer_type_node
)
9566 return (unsignedp
? int128_unsigned_type_node
9567 : int128_integer_type_node
);
9570 return make_unsigned_type (size
);
9572 return make_signed_type (size
);
9575 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9578 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9582 if (size
== SHORT_FRACT_TYPE_SIZE
)
9583 return unsignedp
? sat_unsigned_short_fract_type_node
9584 : sat_short_fract_type_node
;
9585 if (size
== FRACT_TYPE_SIZE
)
9586 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9587 if (size
== LONG_FRACT_TYPE_SIZE
)
9588 return unsignedp
? sat_unsigned_long_fract_type_node
9589 : sat_long_fract_type_node
;
9590 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9591 return unsignedp
? sat_unsigned_long_long_fract_type_node
9592 : sat_long_long_fract_type_node
;
9596 if (size
== SHORT_FRACT_TYPE_SIZE
)
9597 return unsignedp
? unsigned_short_fract_type_node
9598 : short_fract_type_node
;
9599 if (size
== FRACT_TYPE_SIZE
)
9600 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9601 if (size
== LONG_FRACT_TYPE_SIZE
)
9602 return unsignedp
? unsigned_long_fract_type_node
9603 : long_fract_type_node
;
9604 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9605 return unsignedp
? unsigned_long_long_fract_type_node
9606 : long_long_fract_type_node
;
9609 return make_fract_type (size
, unsignedp
, satp
);
9612 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9615 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9619 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9620 return unsignedp
? sat_unsigned_short_accum_type_node
9621 : sat_short_accum_type_node
;
9622 if (size
== ACCUM_TYPE_SIZE
)
9623 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9624 if (size
== LONG_ACCUM_TYPE_SIZE
)
9625 return unsignedp
? sat_unsigned_long_accum_type_node
9626 : sat_long_accum_type_node
;
9627 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9628 return unsignedp
? sat_unsigned_long_long_accum_type_node
9629 : sat_long_long_accum_type_node
;
9633 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9634 return unsignedp
? unsigned_short_accum_type_node
9635 : short_accum_type_node
;
9636 if (size
== ACCUM_TYPE_SIZE
)
9637 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9638 if (size
== LONG_ACCUM_TYPE_SIZE
)
9639 return unsignedp
? unsigned_long_accum_type_node
9640 : long_accum_type_node
;
9641 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9642 return unsignedp
? unsigned_long_long_accum_type_node
9643 : long_long_accum_type_node
;
9646 return make_accum_type (size
, unsignedp
, satp
);
9649 /* Create nodes for all integer types (and error_mark_node) using the sizes
9650 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9651 SHORT_DOUBLE specifies whether double should be of the same precision
9655 build_common_tree_nodes (bool signed_char
, bool short_double
)
9657 error_mark_node
= make_node (ERROR_MARK
);
9658 TREE_TYPE (error_mark_node
) = error_mark_node
;
9660 initialize_sizetypes ();
9662 /* Define both `signed char' and `unsigned char'. */
9663 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9664 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9665 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9666 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9668 /* Define `char', which is like either `signed char' or `unsigned char'
9669 but not the same as either. */
9672 ? make_signed_type (CHAR_TYPE_SIZE
)
9673 : make_unsigned_type (CHAR_TYPE_SIZE
));
9674 TYPE_STRING_FLAG (char_type_node
) = 1;
9676 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9677 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9678 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9679 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9680 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9681 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9682 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9683 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9684 #if HOST_BITS_PER_WIDE_INT >= 64
9685 /* TODO: This isn't correct, but as logic depends at the moment on
9686 host's instead of target's wide-integer.
9687 If there is a target not supporting TImode, but has an 128-bit
9688 integer-scalar register, this target check needs to be adjusted. */
9689 if (targetm
.scalar_mode_supported_p (TImode
))
9691 int128_integer_type_node
= make_signed_type (128);
9692 int128_unsigned_type_node
= make_unsigned_type (128);
9696 /* Define a boolean type. This type only represents boolean values but
9697 may be larger than char depending on the value of BOOL_TYPE_SIZE.
9698 Front ends which want to override this size (i.e. Java) can redefine
9699 boolean_type_node before calling build_common_tree_nodes_2. */
9700 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9701 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9702 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9703 TYPE_PRECISION (boolean_type_node
) = 1;
9705 /* Define what type to use for size_t. */
9706 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9707 size_type_node
= unsigned_type_node
;
9708 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9709 size_type_node
= long_unsigned_type_node
;
9710 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9711 size_type_node
= long_long_unsigned_type_node
;
9712 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9713 size_type_node
= short_unsigned_type_node
;
9717 /* Fill in the rest of the sized types. Reuse existing type nodes
9719 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9720 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9721 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9722 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9723 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9725 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9726 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9727 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9728 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9729 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9731 access_public_node
= get_identifier ("public");
9732 access_protected_node
= get_identifier ("protected");
9733 access_private_node
= get_identifier ("private");
9735 /* Define these next since types below may used them. */
9736 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9737 integer_one_node
= build_int_cst (integer_type_node
, 1);
9738 integer_three_node
= build_int_cst (integer_type_node
, 3);
9739 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9741 size_zero_node
= size_int (0);
9742 size_one_node
= size_int (1);
9743 bitsize_zero_node
= bitsize_int (0);
9744 bitsize_one_node
= bitsize_int (1);
9745 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9747 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9748 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9750 void_type_node
= make_node (VOID_TYPE
);
9751 layout_type (void_type_node
);
9753 /* We are not going to have real types in C with less than byte alignment,
9754 so we might as well not have any types that claim to have it. */
9755 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9756 TYPE_USER_ALIGN (void_type_node
) = 0;
9758 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9759 layout_type (TREE_TYPE (null_pointer_node
));
9761 ptr_type_node
= build_pointer_type (void_type_node
);
9763 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9764 fileptr_type_node
= ptr_type_node
;
9766 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9768 float_type_node
= make_node (REAL_TYPE
);
9769 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9770 layout_type (float_type_node
);
9772 double_type_node
= make_node (REAL_TYPE
);
9774 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9776 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9777 layout_type (double_type_node
);
9779 long_double_type_node
= make_node (REAL_TYPE
);
9780 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9781 layout_type (long_double_type_node
);
9783 float_ptr_type_node
= build_pointer_type (float_type_node
);
9784 double_ptr_type_node
= build_pointer_type (double_type_node
);
9785 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9786 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9788 /* Fixed size integer types. */
9789 uint16_type_node
= build_nonstandard_integer_type (16, true);
9790 uint32_type_node
= build_nonstandard_integer_type (32, true);
9791 uint64_type_node
= build_nonstandard_integer_type (64, true);
9793 /* Decimal float types. */
9794 dfloat32_type_node
= make_node (REAL_TYPE
);
9795 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9796 layout_type (dfloat32_type_node
);
9797 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9798 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9800 dfloat64_type_node
= make_node (REAL_TYPE
);
9801 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9802 layout_type (dfloat64_type_node
);
9803 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9804 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9806 dfloat128_type_node
= make_node (REAL_TYPE
);
9807 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9808 layout_type (dfloat128_type_node
);
9809 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9810 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9812 complex_integer_type_node
= build_complex_type (integer_type_node
);
9813 complex_float_type_node
= build_complex_type (float_type_node
);
9814 complex_double_type_node
= build_complex_type (double_type_node
);
9815 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9817 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9818 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9819 sat_ ## KIND ## _type_node = \
9820 make_sat_signed_ ## KIND ## _type (SIZE); \
9821 sat_unsigned_ ## KIND ## _type_node = \
9822 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9823 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9824 unsigned_ ## KIND ## _type_node = \
9825 make_unsigned_ ## KIND ## _type (SIZE);
9827 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9828 sat_ ## WIDTH ## KIND ## _type_node = \
9829 make_sat_signed_ ## KIND ## _type (SIZE); \
9830 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9831 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9832 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9833 unsigned_ ## WIDTH ## KIND ## _type_node = \
9834 make_unsigned_ ## KIND ## _type (SIZE);
9836 /* Make fixed-point type nodes based on four different widths. */
9837 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9838 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9839 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9840 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9841 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9843 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9844 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9845 NAME ## _type_node = \
9846 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9847 u ## NAME ## _type_node = \
9848 make_or_reuse_unsigned_ ## KIND ## _type \
9849 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9850 sat_ ## NAME ## _type_node = \
9851 make_or_reuse_sat_signed_ ## KIND ## _type \
9852 (GET_MODE_BITSIZE (MODE ## mode)); \
9853 sat_u ## NAME ## _type_node = \
9854 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9855 (GET_MODE_BITSIZE (U ## MODE ## mode));
9857 /* Fixed-point type and mode nodes. */
9858 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9859 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9860 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9861 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9862 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9863 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9864 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9865 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9866 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9867 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9868 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9871 tree t
= targetm
.build_builtin_va_list ();
9873 /* Many back-ends define record types without setting TYPE_NAME.
9874 If we copied the record type here, we'd keep the original
9875 record type without a name. This breaks name mangling. So,
9876 don't copy record types and let c_common_nodes_and_builtins()
9877 declare the type to be __builtin_va_list. */
9878 if (TREE_CODE (t
) != RECORD_TYPE
)
9879 t
= build_variant_type_copy (t
);
9881 va_list_type_node
= t
;
9885 /* Modify DECL for given flags.
9886 TM_PURE attribute is set only on types, so the function will modify
9887 DECL's type when ECF_TM_PURE is used. */
9890 set_call_expr_flags (tree decl
, int flags
)
9892 if (flags
& ECF_NOTHROW
)
9893 TREE_NOTHROW (decl
) = 1;
9894 if (flags
& ECF_CONST
)
9895 TREE_READONLY (decl
) = 1;
9896 if (flags
& ECF_PURE
)
9897 DECL_PURE_P (decl
) = 1;
9898 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9899 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9900 if (flags
& ECF_NOVOPS
)
9901 DECL_IS_NOVOPS (decl
) = 1;
9902 if (flags
& ECF_NORETURN
)
9903 TREE_THIS_VOLATILE (decl
) = 1;
9904 if (flags
& ECF_MALLOC
)
9905 DECL_IS_MALLOC (decl
) = 1;
9906 if (flags
& ECF_RETURNS_TWICE
)
9907 DECL_IS_RETURNS_TWICE (decl
) = 1;
9908 if (flags
& ECF_LEAF
)
9909 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9910 NULL
, DECL_ATTRIBUTES (decl
));
9911 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9912 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9913 /* Looping const or pure is implied by noreturn.
9914 There is currently no way to declare looping const or looping pure alone. */
9915 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9916 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9920 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9923 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9924 const char *library_name
, int ecf_flags
)
9928 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9929 library_name
, NULL_TREE
);
9930 set_call_expr_flags (decl
, ecf_flags
);
9932 set_builtin_decl (code
, decl
, true);
9935 /* Call this function after instantiating all builtins that the language
9936 front end cares about. This will build the rest of the builtins that
9937 are relied upon by the tree optimizers and the middle-end. */
9940 build_common_builtin_nodes (void)
9945 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9947 ftype
= build_function_type (void_type_node
, void_list_node
);
9948 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
9949 "__builtin_unreachable",
9950 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9951 | ECF_CONST
| ECF_LEAF
);
9954 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9955 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9957 ftype
= build_function_type_list (ptr_type_node
,
9958 ptr_type_node
, const_ptr_type_node
,
9959 size_type_node
, NULL_TREE
);
9961 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9962 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9963 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
9964 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9965 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9966 "memmove", ECF_NOTHROW
| ECF_LEAF
);
9969 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9971 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9972 const_ptr_type_node
, size_type_node
,
9974 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9975 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9978 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9980 ftype
= build_function_type_list (ptr_type_node
,
9981 ptr_type_node
, integer_type_node
,
9982 size_type_node
, NULL_TREE
);
9983 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9984 "memset", ECF_NOTHROW
| ECF_LEAF
);
9987 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9989 ftype
= build_function_type_list (ptr_type_node
,
9990 size_type_node
, NULL_TREE
);
9991 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9992 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
9995 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9996 size_type_node
, NULL_TREE
);
9997 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9998 BUILT_IN_ALLOCA_WITH_ALIGN
, "alloca",
9999 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10001 /* If we're checking the stack, `alloca' can throw. */
10002 if (flag_stack_check
)
10004 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10005 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10008 ftype
= build_function_type_list (void_type_node
,
10009 ptr_type_node
, ptr_type_node
,
10010 ptr_type_node
, NULL_TREE
);
10011 local_define_builtin ("__builtin_init_trampoline", ftype
,
10012 BUILT_IN_INIT_TRAMPOLINE
,
10013 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10014 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10015 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10016 "__builtin_init_heap_trampoline",
10017 ECF_NOTHROW
| ECF_LEAF
);
10019 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10020 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10021 BUILT_IN_ADJUST_TRAMPOLINE
,
10022 "__builtin_adjust_trampoline",
10023 ECF_CONST
| ECF_NOTHROW
);
10025 ftype
= build_function_type_list (void_type_node
,
10026 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10027 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10028 BUILT_IN_NONLOCAL_GOTO
,
10029 "__builtin_nonlocal_goto",
10030 ECF_NORETURN
| ECF_NOTHROW
);
10032 ftype
= build_function_type_list (void_type_node
,
10033 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10034 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10035 BUILT_IN_SETJMP_SETUP
,
10036 "__builtin_setjmp_setup", ECF_NOTHROW
);
10038 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10039 local_define_builtin ("__builtin_setjmp_dispatcher", ftype
,
10040 BUILT_IN_SETJMP_DISPATCHER
,
10041 "__builtin_setjmp_dispatcher",
10042 ECF_PURE
| ECF_NOTHROW
);
10044 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10045 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10046 BUILT_IN_SETJMP_RECEIVER
,
10047 "__builtin_setjmp_receiver", ECF_NOTHROW
);
10049 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10050 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10051 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10053 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10054 local_define_builtin ("__builtin_stack_restore", ftype
,
10055 BUILT_IN_STACK_RESTORE
,
10056 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10058 /* If there's a possibility that we might use the ARM EABI, build the
10059 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10060 if (targetm
.arm_eabi_unwinder
)
10062 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10063 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10064 BUILT_IN_CXA_END_CLEANUP
,
10065 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10068 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10069 local_define_builtin ("__builtin_unwind_resume", ftype
,
10070 BUILT_IN_UNWIND_RESUME
,
10071 ((targetm_common
.except_unwind_info (&global_options
)
10073 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10076 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10078 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10080 local_define_builtin ("__builtin_return_address", ftype
,
10081 BUILT_IN_RETURN_ADDRESS
,
10082 "__builtin_return_address",
10086 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10087 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10089 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10090 ptr_type_node
, NULL_TREE
);
10091 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10092 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10093 BUILT_IN_PROFILE_FUNC_ENTER
,
10094 "__cyg_profile_func_enter", 0);
10095 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10096 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10097 BUILT_IN_PROFILE_FUNC_EXIT
,
10098 "__cyg_profile_func_exit", 0);
10101 /* The exception object and filter values from the runtime. The argument
10102 must be zero before exception lowering, i.e. from the front end. After
10103 exception lowering, it will be the region number for the exception
10104 landing pad. These functions are PURE instead of CONST to prevent
10105 them from being hoisted past the exception edge that will initialize
10106 its value in the landing pad. */
10107 ftype
= build_function_type_list (ptr_type_node
,
10108 integer_type_node
, NULL_TREE
);
10109 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10110 /* Only use TM_PURE if we we have TM language support. */
10111 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10112 ecf_flags
|= ECF_TM_PURE
;
10113 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10114 "__builtin_eh_pointer", ecf_flags
);
10116 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10117 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10118 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10119 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10121 ftype
= build_function_type_list (void_type_node
,
10122 integer_type_node
, integer_type_node
,
10124 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10125 BUILT_IN_EH_COPY_VALUES
,
10126 "__builtin_eh_copy_values", ECF_NOTHROW
);
10128 /* Complex multiplication and division. These are handled as builtins
10129 rather than optabs because emit_library_call_value doesn't support
10130 complex. Further, we can do slightly better with folding these
10131 beasties if the real and complex parts of the arguments are separate. */
10135 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10137 char mode_name_buf
[4], *q
;
10139 enum built_in_function mcode
, dcode
;
10140 tree type
, inner_type
;
10141 const char *prefix
= "__";
10143 if (targetm
.libfunc_gnu_prefix
)
10146 type
= lang_hooks
.types
.type_for_mode ((enum machine_mode
) mode
, 0);
10149 inner_type
= TREE_TYPE (type
);
10151 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10152 inner_type
, inner_type
, NULL_TREE
);
10154 mcode
= ((enum built_in_function
)
10155 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10156 dcode
= ((enum built_in_function
)
10157 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10159 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10163 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10165 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10166 built_in_names
[mcode
],
10167 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10169 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10171 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10172 built_in_names
[dcode
],
10173 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10178 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10181 If we requested a pointer to a vector, build up the pointers that
10182 we stripped off while looking for the inner type. Similarly for
10183 return values from functions.
10185 The argument TYPE is the top of the chain, and BOTTOM is the
10186 new type which we will point to. */
10189 reconstruct_complex_type (tree type
, tree bottom
)
10193 if (TREE_CODE (type
) == POINTER_TYPE
)
10195 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10196 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10197 TYPE_REF_CAN_ALIAS_ALL (type
));
10199 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10201 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10202 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10203 TYPE_REF_CAN_ALIAS_ALL (type
));
10205 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10207 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10208 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10210 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10212 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10213 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10215 else if (TREE_CODE (type
) == METHOD_TYPE
)
10217 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10218 /* The build_method_type_directly() routine prepends 'this' to argument list,
10219 so we must compensate by getting rid of it. */
10221 = build_method_type_directly
10222 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10224 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10226 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10228 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10229 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10234 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10235 TYPE_QUALS (type
));
10238 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10241 build_vector_type_for_mode (tree innertype
, enum machine_mode mode
)
10245 switch (GET_MODE_CLASS (mode
))
10247 case MODE_VECTOR_INT
:
10248 case MODE_VECTOR_FLOAT
:
10249 case MODE_VECTOR_FRACT
:
10250 case MODE_VECTOR_UFRACT
:
10251 case MODE_VECTOR_ACCUM
:
10252 case MODE_VECTOR_UACCUM
:
10253 nunits
= GET_MODE_NUNITS (mode
);
10257 /* Check that there are no leftover bits. */
10258 gcc_assert (GET_MODE_BITSIZE (mode
)
10259 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10261 nunits
= GET_MODE_BITSIZE (mode
)
10262 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10266 gcc_unreachable ();
10269 return make_vector_type (innertype
, nunits
, mode
);
10272 /* Similarly, but takes the inner type and number of units, which must be
10276 build_vector_type (tree innertype
, int nunits
)
10278 return make_vector_type (innertype
, nunits
, VOIDmode
);
10281 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10284 build_opaque_vector_type (tree innertype
, int nunits
)
10286 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10288 /* We always build the non-opaque variant before the opaque one,
10289 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10290 cand
= TYPE_NEXT_VARIANT (t
);
10292 && TYPE_VECTOR_OPAQUE (cand
)
10293 && check_qualified_type (cand
, t
, TYPE_QUALS (t
), NULL_TREE
))
10295 /* Othewise build a variant type and make sure to queue it after
10296 the non-opaque type. */
10297 cand
= build_distinct_type_copy (t
);
10298 TYPE_VECTOR_OPAQUE (cand
) = true;
10299 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10300 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10301 TYPE_NEXT_VARIANT (t
) = cand
;
10302 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10307 /* Given an initializer INIT, return TRUE if INIT is zero or some
10308 aggregate of zeros. Otherwise return FALSE. */
10310 initializer_zerop (const_tree init
)
10316 switch (TREE_CODE (init
))
10319 return integer_zerop (init
);
10322 /* ??? Note that this is not correct for C4X float formats. There,
10323 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10324 negative exponent. */
10325 return real_zerop (init
)
10326 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10329 return fixed_zerop (init
);
10332 return integer_zerop (init
)
10333 || (real_zerop (init
)
10334 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10335 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10340 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10341 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10348 unsigned HOST_WIDE_INT idx
;
10350 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10351 if (!initializer_zerop (elt
))
10360 /* We need to loop through all elements to handle cases like
10361 "\0" and "\0foobar". */
10362 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10363 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10374 /* Check if vector VEC consists of all the equal elements and
10375 that the number of elements corresponds to the type of VEC.
10376 The function returns first element of the vector
10377 or NULL_TREE if the vector is not uniform. */
10379 uniform_vector_p (const_tree vec
)
10384 if (vec
== NULL_TREE
)
10387 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10389 if (TREE_CODE (vec
) == VECTOR_CST
)
10391 first
= VECTOR_CST_ELT (vec
, 0);
10392 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10393 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10399 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10401 first
= error_mark_node
;
10403 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10410 if (!operand_equal_p (first
, t
, 0))
10413 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10422 /* Build an empty statement at location LOC. */
10425 build_empty_stmt (location_t loc
)
10427 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10428 SET_EXPR_LOCATION (t
, loc
);
10433 /* Build an OpenMP clause with code CODE. LOC is the location of the
10437 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10442 length
= omp_clause_num_ops
[code
];
10443 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10445 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10447 t
= ggc_alloc_tree_node (size
);
10448 memset (t
, 0, size
);
10449 TREE_SET_CODE (t
, OMP_CLAUSE
);
10450 OMP_CLAUSE_SET_CODE (t
, code
);
10451 OMP_CLAUSE_LOCATION (t
) = loc
;
10456 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10457 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10458 Except for the CODE and operand count field, other storage for the
10459 object is initialized to zeros. */
10462 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10465 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10467 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10468 gcc_assert (len
>= 1);
10470 record_node_allocation_statistics (code
, length
);
10472 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10474 TREE_SET_CODE (t
, code
);
10476 /* Can't use TREE_OPERAND to store the length because if checking is
10477 enabled, it will try to check the length before we store it. :-P */
10478 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10483 /* Helper function for build_call_* functions; build a CALL_EXPR with
10484 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10485 the argument slots. */
10488 build_call_1 (tree return_type
, tree fn
, int nargs
)
10492 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10493 TREE_TYPE (t
) = return_type
;
10494 CALL_EXPR_FN (t
) = fn
;
10495 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10500 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10501 FN and a null static chain slot. NARGS is the number of call arguments
10502 which are specified as "..." arguments. */
10505 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10509 va_start (args
, nargs
);
10510 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10515 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10516 FN and a null static chain slot. NARGS is the number of call arguments
10517 which are specified as a va_list ARGS. */
10520 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10525 t
= build_call_1 (return_type
, fn
, nargs
);
10526 for (i
= 0; i
< nargs
; i
++)
10527 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10528 process_call_operands (t
);
10532 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10533 FN and a null static chain slot. NARGS is the number of call arguments
10534 which are specified as a tree array ARGS. */
10537 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10538 int nargs
, const tree
*args
)
10543 t
= build_call_1 (return_type
, fn
, nargs
);
10544 for (i
= 0; i
< nargs
; i
++)
10545 CALL_EXPR_ARG (t
, i
) = args
[i
];
10546 process_call_operands (t
);
10547 SET_EXPR_LOCATION (t
, loc
);
10551 /* Like build_call_array, but takes a vec. */
10554 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10559 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10560 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10561 CALL_EXPR_ARG (ret
, ix
) = t
;
10562 process_call_operands (ret
);
10567 /* Returns true if it is possible to prove that the index of
10568 an array access REF (an ARRAY_REF expression) falls into the
10572 in_array_bounds_p (tree ref
)
10574 tree idx
= TREE_OPERAND (ref
, 1);
10577 if (TREE_CODE (idx
) != INTEGER_CST
)
10580 min
= array_ref_low_bound (ref
);
10581 max
= array_ref_up_bound (ref
);
10584 || TREE_CODE (min
) != INTEGER_CST
10585 || TREE_CODE (max
) != INTEGER_CST
)
10588 if (tree_int_cst_lt (idx
, min
)
10589 || tree_int_cst_lt (max
, idx
))
10595 /* Returns true if it is possible to prove that the range of
10596 an array access REF (an ARRAY_RANGE_REF expression) falls
10597 into the array bounds. */
10600 range_in_array_bounds_p (tree ref
)
10602 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (ref
));
10603 tree range_min
, range_max
, min
, max
;
10605 range_min
= TYPE_MIN_VALUE (domain_type
);
10606 range_max
= TYPE_MAX_VALUE (domain_type
);
10609 || TREE_CODE (range_min
) != INTEGER_CST
10610 || TREE_CODE (range_max
) != INTEGER_CST
)
10613 min
= array_ref_low_bound (ref
);
10614 max
= array_ref_up_bound (ref
);
10617 || TREE_CODE (min
) != INTEGER_CST
10618 || TREE_CODE (max
) != INTEGER_CST
)
10621 if (tree_int_cst_lt (range_min
, min
)
10622 || tree_int_cst_lt (max
, range_max
))
10628 /* Return true if T (assumed to be a DECL) must be assigned a memory
10632 needs_to_live_in_memory (const_tree t
)
10634 return (TREE_ADDRESSABLE (t
)
10635 || is_global_var (t
)
10636 || (TREE_CODE (t
) == RESULT_DECL
10637 && !DECL_BY_REFERENCE (t
)
10638 && aggregate_value_p (t
, current_function_decl
)));
10641 /* Return value of a constant X and sign-extend it. */
10644 int_cst_value (const_tree x
)
10646 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10647 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10649 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10650 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10651 || TREE_INT_CST_HIGH (x
) == -1);
10653 if (bits
< HOST_BITS_PER_WIDE_INT
)
10655 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10657 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10659 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10665 /* Return value of a constant X and sign-extend it. */
10668 widest_int_cst_value (const_tree x
)
10670 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10671 unsigned HOST_WIDEST_INT val
= TREE_INT_CST_LOW (x
);
10673 #if HOST_BITS_PER_WIDEST_INT > HOST_BITS_PER_WIDE_INT
10674 gcc_assert (HOST_BITS_PER_WIDEST_INT
>= HOST_BITS_PER_DOUBLE_INT
);
10675 val
|= (((unsigned HOST_WIDEST_INT
) TREE_INT_CST_HIGH (x
))
10676 << HOST_BITS_PER_WIDE_INT
);
10678 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10679 gcc_assert (TREE_INT_CST_HIGH (x
) == 0
10680 || TREE_INT_CST_HIGH (x
) == -1);
10683 if (bits
< HOST_BITS_PER_WIDEST_INT
)
10685 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10687 val
|= (~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1;
10689 val
&= ~((~(unsigned HOST_WIDEST_INT
) 0) << (bits
- 1) << 1);
10695 /* If TYPE is an integral or pointer type, return an integer type with
10696 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10697 if TYPE is already an integer type of signedness UNSIGNEDP. */
10700 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10702 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10705 if (TREE_CODE (type
) == VECTOR_TYPE
)
10707 tree inner
= TREE_TYPE (type
);
10708 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10711 if (inner
== inner2
)
10713 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10716 if (!INTEGRAL_TYPE_P (type
)
10717 && !POINTER_TYPE_P (type
))
10720 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10723 /* If TYPE is an integral or pointer type, return an integer type with
10724 the same precision which is unsigned, or itself if TYPE is already an
10725 unsigned integer type. */
10728 unsigned_type_for (tree type
)
10730 return signed_or_unsigned_type_for (1, type
);
10733 /* If TYPE is an integral or pointer type, return an integer type with
10734 the same precision which is signed, or itself if TYPE is already a
10735 signed integer type. */
10738 signed_type_for (tree type
)
10740 return signed_or_unsigned_type_for (0, type
);
10743 /* If TYPE is a vector type, return a signed integer vector type with the
10744 same width and number of subparts. Otherwise return boolean_type_node. */
10747 truth_type_for (tree type
)
10749 if (TREE_CODE (type
) == VECTOR_TYPE
)
10751 tree elem
= lang_hooks
.types
.type_for_size
10752 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10753 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10756 return boolean_type_node
;
10759 /* Returns the largest value obtainable by casting something in INNER type to
10763 upper_bound_in_type (tree outer
, tree inner
)
10766 unsigned int det
= 0;
10767 unsigned oprec
= TYPE_PRECISION (outer
);
10768 unsigned iprec
= TYPE_PRECISION (inner
);
10771 /* Compute a unique number for every combination. */
10772 det
|= (oprec
> iprec
) ? 4 : 0;
10773 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10774 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10776 /* Determine the exponent to use. */
10781 /* oprec <= iprec, outer: signed, inner: don't care. */
10786 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10790 /* oprec > iprec, outer: signed, inner: signed. */
10794 /* oprec > iprec, outer: signed, inner: unsigned. */
10798 /* oprec > iprec, outer: unsigned, inner: signed. */
10802 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10806 gcc_unreachable ();
10809 /* Compute 2^^prec - 1. */
10810 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10813 high
.low
= ((~(unsigned HOST_WIDE_INT
) 0)
10814 >> (HOST_BITS_PER_WIDE_INT
- prec
));
10818 high
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10819 >> (HOST_BITS_PER_DOUBLE_INT
- prec
));
10820 high
.low
= ~(unsigned HOST_WIDE_INT
) 0;
10823 return double_int_to_tree (outer
, high
);
10826 /* Returns the smallest value obtainable by casting something in INNER type to
10830 lower_bound_in_type (tree outer
, tree inner
)
10833 unsigned oprec
= TYPE_PRECISION (outer
);
10834 unsigned iprec
= TYPE_PRECISION (inner
);
10836 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10838 if (TYPE_UNSIGNED (outer
)
10839 /* If we are widening something of an unsigned type, OUTER type
10840 contains all values of INNER type. In particular, both INNER
10841 and OUTER types have zero in common. */
10842 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10843 low
.low
= low
.high
= 0;
10846 /* If we are widening a signed type to another signed type, we
10847 want to obtain -2^^(iprec-1). If we are keeping the
10848 precision or narrowing to a signed type, we want to obtain
10850 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10852 if (prec
<= HOST_BITS_PER_WIDE_INT
)
10854 low
.high
= ~(unsigned HOST_WIDE_INT
) 0;
10855 low
.low
= (~(unsigned HOST_WIDE_INT
) 0) << (prec
- 1);
10859 low
.high
= ((~(unsigned HOST_WIDE_INT
) 0)
10860 << (prec
- HOST_BITS_PER_WIDE_INT
- 1));
10865 return double_int_to_tree (outer
, low
);
10868 /* Return nonzero if two operands that are suitable for PHI nodes are
10869 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10870 SSA_NAME or invariant. Note that this is strictly an optimization.
10871 That is, callers of this function can directly call operand_equal_p
10872 and get the same result, only slower. */
10875 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10879 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10881 return operand_equal_p (arg0
, arg1
, 0);
10884 /* Returns number of zeros at the end of binary representation of X.
10886 ??? Use ffs if available? */
10889 num_ending_zeros (const_tree x
)
10891 unsigned HOST_WIDE_INT fr
, nfr
;
10892 unsigned num
, abits
;
10893 tree type
= TREE_TYPE (x
);
10895 if (TREE_INT_CST_LOW (x
) == 0)
10897 num
= HOST_BITS_PER_WIDE_INT
;
10898 fr
= TREE_INT_CST_HIGH (x
);
10903 fr
= TREE_INT_CST_LOW (x
);
10906 for (abits
= HOST_BITS_PER_WIDE_INT
/ 2; abits
; abits
/= 2)
10909 if (nfr
<< abits
== fr
)
10916 if (num
> TYPE_PRECISION (type
))
10917 num
= TYPE_PRECISION (type
);
10919 return build_int_cst_type (type
, num
);
10923 #define WALK_SUBTREE(NODE) \
10926 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10932 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10933 be walked whenever a type is seen in the tree. Rest of operands and return
10934 value are as for walk_tree. */
10937 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10938 struct pointer_set_t
*pset
, walk_tree_lh lh
)
10940 tree result
= NULL_TREE
;
10942 switch (TREE_CODE (type
))
10945 case REFERENCE_TYPE
:
10946 /* We have to worry about mutually recursive pointers. These can't
10947 be written in C. They can in Ada. It's pathological, but
10948 there's an ACATS test (c38102a) that checks it. Deal with this
10949 by checking if we're pointing to another pointer, that one
10950 points to another pointer, that one does too, and we have no htab.
10951 If so, get a hash table. We check three levels deep to avoid
10952 the cost of the hash table if we don't need one. */
10953 if (POINTER_TYPE_P (TREE_TYPE (type
))
10954 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10955 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10958 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10966 /* ... fall through ... */
10969 WALK_SUBTREE (TREE_TYPE (type
));
10973 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10975 /* Fall through. */
10977 case FUNCTION_TYPE
:
10978 WALK_SUBTREE (TREE_TYPE (type
));
10982 /* We never want to walk into default arguments. */
10983 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
10984 WALK_SUBTREE (TREE_VALUE (arg
));
10989 /* Don't follow this nodes's type if a pointer for fear that
10990 we'll have infinite recursion. If we have a PSET, then we
10993 || (!POINTER_TYPE_P (TREE_TYPE (type
))
10994 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
10995 WALK_SUBTREE (TREE_TYPE (type
));
10996 WALK_SUBTREE (TYPE_DOMAIN (type
));
11000 WALK_SUBTREE (TREE_TYPE (type
));
11001 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11011 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11012 called with the DATA and the address of each sub-tree. If FUNC returns a
11013 non-NULL value, the traversal is stopped, and the value returned by FUNC
11014 is returned. If PSET is non-NULL it is used to record the nodes visited,
11015 and to avoid visiting a node more than once. */
11018 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11019 struct pointer_set_t
*pset
, walk_tree_lh lh
)
11021 enum tree_code code
;
11025 #define WALK_SUBTREE_TAIL(NODE) \
11029 goto tail_recurse; \
11034 /* Skip empty subtrees. */
11038 /* Don't walk the same tree twice, if the user has requested
11039 that we avoid doing so. */
11040 if (pset
&& pointer_set_insert (pset
, *tp
))
11043 /* Call the function. */
11045 result
= (*func
) (tp
, &walk_subtrees
, data
);
11047 /* If we found something, return it. */
11051 code
= TREE_CODE (*tp
);
11053 /* Even if we didn't, FUNC may have decided that there was nothing
11054 interesting below this point in the tree. */
11055 if (!walk_subtrees
)
11057 /* But we still need to check our siblings. */
11058 if (code
== TREE_LIST
)
11059 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11060 else if (code
== OMP_CLAUSE
)
11061 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11068 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11069 if (result
|| !walk_subtrees
)
11076 case IDENTIFIER_NODE
:
11083 case PLACEHOLDER_EXPR
:
11087 /* None of these have subtrees other than those already walked
11092 WALK_SUBTREE (TREE_VALUE (*tp
));
11093 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11098 int len
= TREE_VEC_LENGTH (*tp
);
11103 /* Walk all elements but the first. */
11105 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11107 /* Now walk the first one as a tail call. */
11108 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11112 WALK_SUBTREE (TREE_REALPART (*tp
));
11113 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11117 unsigned HOST_WIDE_INT idx
;
11118 constructor_elt
*ce
;
11120 for (idx
= 0; vec_safe_iterate(CONSTRUCTOR_ELTS (*tp
), idx
, &ce
); idx
++)
11121 WALK_SUBTREE (ce
->value
);
11126 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11131 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11133 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11134 into declarations that are just mentioned, rather than
11135 declared; they don't really belong to this part of the tree.
11136 And, we can see cycles: the initializer for a declaration
11137 can refer to the declaration itself. */
11138 WALK_SUBTREE (DECL_INITIAL (decl
));
11139 WALK_SUBTREE (DECL_SIZE (decl
));
11140 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11142 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11145 case STATEMENT_LIST
:
11147 tree_stmt_iterator i
;
11148 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11149 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11154 switch (OMP_CLAUSE_CODE (*tp
))
11156 case OMP_CLAUSE_PRIVATE
:
11157 case OMP_CLAUSE_SHARED
:
11158 case OMP_CLAUSE_FIRSTPRIVATE
:
11159 case OMP_CLAUSE_COPYIN
:
11160 case OMP_CLAUSE_COPYPRIVATE
:
11161 case OMP_CLAUSE_FINAL
:
11162 case OMP_CLAUSE_IF
:
11163 case OMP_CLAUSE_NUM_THREADS
:
11164 case OMP_CLAUSE_SCHEDULE
:
11165 case OMP_CLAUSE_UNIFORM
:
11166 case OMP_CLAUSE_SAFELEN
:
11167 case OMP_CLAUSE__SIMDUID_
:
11168 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11171 case OMP_CLAUSE_NOWAIT
:
11172 case OMP_CLAUSE_ORDERED
:
11173 case OMP_CLAUSE_DEFAULT
:
11174 case OMP_CLAUSE_UNTIED
:
11175 case OMP_CLAUSE_MERGEABLE
:
11176 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11178 case OMP_CLAUSE_LASTPRIVATE
:
11179 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11180 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11181 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11183 case OMP_CLAUSE_COLLAPSE
:
11186 for (i
= 0; i
< 3; i
++)
11187 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11188 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11191 case OMP_CLAUSE_LINEAR
:
11192 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11193 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11194 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11196 case OMP_CLAUSE_REDUCTION
:
11199 for (i
= 0; i
< 4; i
++)
11200 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11201 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11205 gcc_unreachable ();
11213 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11214 But, we only want to walk once. */
11215 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11216 for (i
= 0; i
< len
; ++i
)
11217 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11218 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11222 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11223 defining. We only want to walk into these fields of a type in this
11224 case and not in the general case of a mere reference to the type.
11226 The criterion is as follows: if the field can be an expression, it
11227 must be walked only here. This should be in keeping with the fields
11228 that are directly gimplified in gimplify_type_sizes in order for the
11229 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11230 variable-sized types.
11232 Note that DECLs get walked as part of processing the BIND_EXPR. */
11233 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11235 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11236 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11239 /* Call the function for the type. See if it returns anything or
11240 doesn't want us to continue. If we are to continue, walk both
11241 the normal fields and those for the declaration case. */
11242 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11243 if (result
|| !walk_subtrees
)
11246 /* But do not walk a pointed-to type since it may itself need to
11247 be walked in the declaration case if it isn't anonymous. */
11248 if (!POINTER_TYPE_P (*type_p
))
11250 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11255 /* If this is a record type, also walk the fields. */
11256 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11260 for (field
= TYPE_FIELDS (*type_p
); field
;
11261 field
= DECL_CHAIN (field
))
11263 /* We'd like to look at the type of the field, but we can
11264 easily get infinite recursion. So assume it's pointed
11265 to elsewhere in the tree. Also, ignore things that
11267 if (TREE_CODE (field
) != FIELD_DECL
)
11270 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11271 WALK_SUBTREE (DECL_SIZE (field
));
11272 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11273 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11274 WALK_SUBTREE (DECL_QUALIFIER (field
));
11278 /* Same for scalar types. */
11279 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11280 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11281 || TREE_CODE (*type_p
) == INTEGER_TYPE
11282 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11283 || TREE_CODE (*type_p
) == REAL_TYPE
)
11285 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11286 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11289 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11290 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11295 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11299 /* Walk over all the sub-trees of this operand. */
11300 len
= TREE_OPERAND_LENGTH (*tp
);
11302 /* Go through the subtrees. We need to do this in forward order so
11303 that the scope of a FOR_EXPR is handled properly. */
11306 for (i
= 0; i
< len
- 1; ++i
)
11307 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11308 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11311 /* If this is a type, walk the needed fields in the type. */
11312 else if (TYPE_P (*tp
))
11313 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11317 /* We didn't find what we were looking for. */
11320 #undef WALK_SUBTREE_TAIL
11322 #undef WALK_SUBTREE
11324 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11327 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11331 struct pointer_set_t
*pset
;
11333 pset
= pointer_set_create ();
11334 result
= walk_tree_1 (tp
, func
, data
, pset
, lh
);
11335 pointer_set_destroy (pset
);
11341 tree_block (tree t
)
11343 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11345 if (IS_EXPR_CODE_CLASS (c
))
11346 return LOCATION_BLOCK (t
->exp
.locus
);
11347 gcc_unreachable ();
11352 tree_set_block (tree t
, tree b
)
11354 char const c
= TREE_CODE_CLASS (TREE_CODE (t
));
11356 if (IS_EXPR_CODE_CLASS (c
))
11359 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11361 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11364 gcc_unreachable ();
11367 /* Create a nameless artificial label and put it in the current
11368 function context. The label has a location of LOC. Returns the
11369 newly created label. */
11372 create_artificial_label (location_t loc
)
11374 tree lab
= build_decl (loc
,
11375 LABEL_DECL
, NULL_TREE
, void_type_node
);
11377 DECL_ARTIFICIAL (lab
) = 1;
11378 DECL_IGNORED_P (lab
) = 1;
11379 DECL_CONTEXT (lab
) = current_function_decl
;
11383 /* Given a tree, try to return a useful variable name that we can use
11384 to prefix a temporary that is being assigned the value of the tree.
11385 I.E. given <temp> = &A, return A. */
11390 tree stripped_decl
;
11393 STRIP_NOPS (stripped_decl
);
11394 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11395 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11396 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11398 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11401 return IDENTIFIER_POINTER (name
);
11405 switch (TREE_CODE (stripped_decl
))
11408 return get_name (TREE_OPERAND (stripped_decl
, 0));
11415 /* Return true if TYPE has a variable argument list. */
11418 stdarg_p (const_tree fntype
)
11420 function_args_iterator args_iter
;
11421 tree n
= NULL_TREE
, t
;
11426 FOREACH_FUNCTION_ARGS(fntype
, t
, args_iter
)
11431 return n
!= NULL_TREE
&& n
!= void_type_node
;
11434 /* Return true if TYPE has a prototype. */
11437 prototype_p (tree fntype
)
11441 gcc_assert (fntype
!= NULL_TREE
);
11443 t
= TYPE_ARG_TYPES (fntype
);
11444 return (t
!= NULL_TREE
);
11447 /* If BLOCK is inlined from an __attribute__((__artificial__))
11448 routine, return pointer to location from where it has been
11451 block_nonartificial_location (tree block
)
11453 location_t
*ret
= NULL
;
11455 while (block
&& TREE_CODE (block
) == BLOCK
11456 && BLOCK_ABSTRACT_ORIGIN (block
))
11458 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11460 while (TREE_CODE (ao
) == BLOCK
11461 && BLOCK_ABSTRACT_ORIGIN (ao
)
11462 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11463 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11465 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11467 /* If AO is an artificial inline, point RET to the
11468 call site locus at which it has been inlined and continue
11469 the loop, in case AO's caller is also an artificial
11471 if (DECL_DECLARED_INLINE_P (ao
)
11472 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11473 ret
= &BLOCK_SOURCE_LOCATION (block
);
11477 else if (TREE_CODE (ao
) != BLOCK
)
11480 block
= BLOCK_SUPERCONTEXT (block
);
11486 /* If EXP is inlined from an __attribute__((__artificial__))
11487 function, return the location of the original call expression. */
11490 tree_nonartificial_location (tree exp
)
11492 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11497 return EXPR_LOCATION (exp
);
11501 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11504 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11507 cl_option_hash_hash (const void *x
)
11509 const_tree
const t
= (const_tree
) x
;
11513 hashval_t hash
= 0;
11515 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11517 p
= (const char *)TREE_OPTIMIZATION (t
);
11518 len
= sizeof (struct cl_optimization
);
11521 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11523 p
= (const char *)TREE_TARGET_OPTION (t
);
11524 len
= sizeof (struct cl_target_option
);
11528 gcc_unreachable ();
11530 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11532 for (i
= 0; i
< len
; i
++)
11534 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11539 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11540 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11544 cl_option_hash_eq (const void *x
, const void *y
)
11546 const_tree
const xt
= (const_tree
) x
;
11547 const_tree
const yt
= (const_tree
) y
;
11552 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11555 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11557 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11558 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11559 len
= sizeof (struct cl_optimization
);
11562 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11564 xp
= (const char *)TREE_TARGET_OPTION (xt
);
11565 yp
= (const char *)TREE_TARGET_OPTION (yt
);
11566 len
= sizeof (struct cl_target_option
);
11570 gcc_unreachable ();
11572 return (memcmp (xp
, yp
, len
) == 0);
11575 /* Build an OPTIMIZATION_NODE based on the current options. */
11578 build_optimization_node (void)
11583 /* Use the cache of optimization nodes. */
11585 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11588 slot
= htab_find_slot (cl_option_hash_table
, cl_optimization_node
, INSERT
);
11592 /* Insert this one into the hash table. */
11593 t
= cl_optimization_node
;
11596 /* Make a new node for next time round. */
11597 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11603 /* Build a TARGET_OPTION_NODE based on the current options. */
11606 build_target_option_node (void)
11611 /* Use the cache of optimization nodes. */
11613 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11616 slot
= htab_find_slot (cl_option_hash_table
, cl_target_option_node
, INSERT
);
11620 /* Insert this one into the hash table. */
11621 t
= cl_target_option_node
;
11624 /* Make a new node for next time round. */
11625 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11631 /* Determine the "ultimate origin" of a block. The block may be an inlined
11632 instance of an inlined instance of a block which is local to an inline
11633 function, so we have to trace all of the way back through the origin chain
11634 to find out what sort of node actually served as the original seed for the
11638 block_ultimate_origin (const_tree block
)
11640 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11642 /* output_inline_function sets BLOCK_ABSTRACT_ORIGIN for all the
11643 nodes in the function to point to themselves; ignore that if
11644 we're trying to output the abstract instance of this function. */
11645 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11648 if (immediate_origin
== NULL_TREE
)
11653 tree lookahead
= immediate_origin
;
11657 ret_val
= lookahead
;
11658 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11659 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11661 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11663 /* The block's abstract origin chain may not be the *ultimate* origin of
11664 the block. It could lead to a DECL that has an abstract origin set.
11665 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11666 will give us if it has one). Note that DECL's abstract origins are
11667 supposed to be the most distant ancestor (or so decl_ultimate_origin
11668 claims), so we don't need to loop following the DECL origins. */
11669 if (DECL_P (ret_val
))
11670 return DECL_ORIGIN (ret_val
);
11676 /* Return true if T1 and T2 are equivalent lists. */
11679 list_equal_p (const_tree t1
, const_tree t2
)
11681 for (; t1
&& t2
; t1
= TREE_CHAIN (t1
) , t2
= TREE_CHAIN (t2
))
11682 if (TREE_VALUE (t1
) != TREE_VALUE (t2
))
11687 /* Return true iff conversion in EXP generates no instruction. Mark
11688 it inline so that we fully inline into the stripping functions even
11689 though we have two uses of this function. */
11692 tree_nop_conversion (const_tree exp
)
11694 tree outer_type
, inner_type
;
11695 int outer_is_pts_p
, inner_is_pts_p
;
11697 if (!CONVERT_EXPR_P (exp
)
11698 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11700 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11703 outer_type
= TREE_TYPE (exp
);
11704 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11709 outer_is_pts_p
= (POINTER_TYPE_P (outer_type
)
11710 && upc_shared_type_p (TREE_TYPE (outer_type
)));
11711 inner_is_pts_p
= (POINTER_TYPE_P (inner_type
)
11712 && upc_shared_type_p (TREE_TYPE (inner_type
)));
11714 /* UPC pointer-to-shared types have special
11715 equivalence rules that must be checked. */
11716 if (outer_is_pts_p
&& inner_is_pts_p
11717 && lang_hooks
.types_compatible_p
)
11718 return lang_hooks
.types_compatible_p (outer_type
, inner_type
);
11720 /* UPC pointer-to-shared types are not interchangeable
11721 with integral types. */
11722 if (outer_is_pts_p
|| inner_is_pts_p
)
11725 /* Use precision rather then machine mode when we can, which gives
11726 the correct answer even for submode (bit-field) types. */
11727 if ((INTEGRAL_TYPE_P (outer_type
)
11728 || POINTER_TYPE_P (outer_type
)
11729 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11730 && (INTEGRAL_TYPE_P (inner_type
)
11731 || POINTER_TYPE_P (inner_type
)
11732 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11733 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11735 /* Otherwise fall back on comparing machine modes (e.g. for
11736 aggregate types, floats). */
11737 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11740 /* Return true iff conversion in EXP generates no instruction. Don't
11741 consider conversions changing the signedness. */
11744 tree_sign_nop_conversion (const_tree exp
)
11746 tree outer_type
, inner_type
;
11748 if (!tree_nop_conversion (exp
))
11751 outer_type
= TREE_TYPE (exp
);
11752 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11754 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11755 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11758 /* Strip conversions from EXP according to tree_nop_conversion and
11759 return the resulting expression. */
11762 tree_strip_nop_conversions (tree exp
)
11764 while (tree_nop_conversion (exp
))
11765 exp
= TREE_OPERAND (exp
, 0);
11769 /* Strip conversions from EXP according to tree_sign_nop_conversion
11770 and return the resulting expression. */
11773 tree_strip_sign_nop_conversions (tree exp
)
11775 while (tree_sign_nop_conversion (exp
))
11776 exp
= TREE_OPERAND (exp
, 0);
11780 /* Avoid any floating point extensions from EXP. */
11782 strip_float_extensions (tree exp
)
11784 tree sub
, expt
, subt
;
11786 /* For floating point constant look up the narrowest type that can hold
11787 it properly and handle it like (type)(narrowest_type)constant.
11788 This way we can optimize for instance a=a*2.0 where "a" is float
11789 but 2.0 is double constant. */
11790 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11792 REAL_VALUE_TYPE orig
;
11795 orig
= TREE_REAL_CST (exp
);
11796 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11797 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11798 type
= float_type_node
;
11799 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11800 > TYPE_PRECISION (double_type_node
)
11801 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11802 type
= double_type_node
;
11804 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11807 if (!CONVERT_EXPR_P (exp
))
11810 sub
= TREE_OPERAND (exp
, 0);
11811 subt
= TREE_TYPE (sub
);
11812 expt
= TREE_TYPE (exp
);
11814 if (!FLOAT_TYPE_P (subt
))
11817 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11820 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11823 return strip_float_extensions (sub
);
11826 /* Strip out all handled components that produce invariant
11830 strip_invariant_refs (const_tree op
)
11832 while (handled_component_p (op
))
11834 switch (TREE_CODE (op
))
11837 case ARRAY_RANGE_REF
:
11838 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11839 || TREE_OPERAND (op
, 2) != NULL_TREE
11840 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11844 case COMPONENT_REF
:
11845 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11851 op
= TREE_OPERAND (op
, 0);
11857 static GTY(()) tree gcc_eh_personality_decl
;
11859 /* Return the GCC personality function decl. */
11862 lhd_gcc_personality (void)
11864 if (!gcc_eh_personality_decl
)
11865 gcc_eh_personality_decl
= build_personality_function ("gcc");
11866 return gcc_eh_personality_decl
;
11869 /* For languages with One Definition Rule, work out if
11870 trees are actually the same even if the tree representation
11871 differs. This handles only decls appearing in TYPE_NAME
11872 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11873 RECORD_TYPE and IDENTIFIER_NODE. */
11876 same_for_odr (tree t1
, tree t2
)
11882 /* C and C++ FEs differ by using IDENTIFIER_NODE and TYPE_DECL. */
11883 if (TREE_CODE (t1
) == IDENTIFIER_NODE
11884 && TREE_CODE (t2
) == TYPE_DECL
11885 && DECL_FILE_SCOPE_P (t1
))
11887 t2
= DECL_NAME (t2
);
11888 gcc_assert (TREE_CODE (t2
) == IDENTIFIER_NODE
);
11890 if (TREE_CODE (t2
) == IDENTIFIER_NODE
11891 && TREE_CODE (t1
) == TYPE_DECL
11892 && DECL_FILE_SCOPE_P (t2
))
11894 t1
= DECL_NAME (t1
);
11895 gcc_assert (TREE_CODE (t1
) == IDENTIFIER_NODE
);
11897 if (TREE_CODE (t1
) != TREE_CODE (t2
))
11900 return types_same_for_odr (t1
, t2
);
11902 return decls_same_for_odr (t1
, t2
);
11906 /* For languages with One Definition Rule, work out if
11907 decls are actually the same even if the tree representation
11908 differs. This handles only decls appearing in TYPE_NAME
11909 and TYPE_CONTEXT. That is NAMESPACE_DECL, TYPE_DECL,
11910 RECORD_TYPE and IDENTIFIER_NODE. */
11913 decls_same_for_odr (tree decl1
, tree decl2
)
11915 if (decl1
&& TREE_CODE (decl1
) == TYPE_DECL
11916 && DECL_ORIGINAL_TYPE (decl1
))
11917 decl1
= DECL_ORIGINAL_TYPE (decl1
);
11918 if (decl2
&& TREE_CODE (decl2
) == TYPE_DECL
11919 && DECL_ORIGINAL_TYPE (decl2
))
11920 decl2
= DECL_ORIGINAL_TYPE (decl2
);
11921 if (decl1
== decl2
)
11923 if (!decl1
|| !decl2
)
11925 gcc_checking_assert (DECL_P (decl1
) && DECL_P (decl2
));
11926 if (TREE_CODE (decl1
) != TREE_CODE (decl2
))
11928 if (TREE_CODE (decl1
) == TRANSLATION_UNIT_DECL
)
11930 if (TREE_CODE (decl1
) != NAMESPACE_DECL
11931 && TREE_CODE (decl1
) != TYPE_DECL
)
11933 if (!DECL_NAME (decl1
))
11935 gcc_checking_assert (TREE_CODE (DECL_NAME (decl1
)) == IDENTIFIER_NODE
);
11936 gcc_checking_assert (!DECL_NAME (decl2
)
11937 || TREE_CODE (DECL_NAME (decl2
)) == IDENTIFIER_NODE
);
11938 if (DECL_NAME (decl1
) != DECL_NAME (decl2
))
11940 return same_for_odr (DECL_CONTEXT (decl1
),
11941 DECL_CONTEXT (decl2
));
11944 /* For languages with One Definition Rule, work out if
11945 types are same even if the tree representation differs.
11946 This is non-trivial for LTO where minnor differences in
11947 the type representation may have prevented type merging
11948 to merge two copies of otherwise equivalent type. */
11951 types_same_for_odr (tree type1
, tree type2
)
11953 gcc_checking_assert (TYPE_P (type1
) && TYPE_P (type2
));
11954 type1
= TYPE_MAIN_VARIANT (type1
);
11955 type2
= TYPE_MAIN_VARIANT (type2
);
11956 if (type1
== type2
)
11959 #ifndef ENABLE_CHECKING
11964 /* Check for anonymous namespaces. Those have !TREE_PUBLIC
11965 on the corresponding TYPE_STUB_DECL. */
11966 if (type_in_anonymous_namespace_p (type1
)
11967 || type_in_anonymous_namespace_p (type2
))
11969 /* When assembler name of virtual table is available, it is
11970 easy to compare types for equivalence. */
11971 if (TYPE_BINFO (type1
) && TYPE_BINFO (type2
)
11972 && BINFO_VTABLE (TYPE_BINFO (type1
))
11973 && BINFO_VTABLE (TYPE_BINFO (type2
)))
11975 tree v1
= BINFO_VTABLE (TYPE_BINFO (type1
));
11976 tree v2
= BINFO_VTABLE (TYPE_BINFO (type2
));
11978 if (TREE_CODE (v1
) == POINTER_PLUS_EXPR
)
11980 if (TREE_CODE (v2
) != POINTER_PLUS_EXPR
11981 || !operand_equal_p (TREE_OPERAND (v1
, 1),
11982 TREE_OPERAND (v2
, 1), 0))
11984 v1
= TREE_OPERAND (TREE_OPERAND (v1
, 0), 0);
11985 v2
= TREE_OPERAND (TREE_OPERAND (v2
, 0), 0);
11987 v1
= DECL_ASSEMBLER_NAME (v1
);
11988 v2
= DECL_ASSEMBLER_NAME (v2
);
11992 /* FIXME: the code comparing type names consider all instantiations of the
11993 same template to have same name. This is because we have no access
11994 to template parameters. For types with no virtual method tables
11995 we thus can return false positives. At the moment we do not need
11996 to compare types in other scenarios than devirtualization. */
11998 /* If types are not structuraly same, do not bother to contnue.
11999 Match in the remainder of code would mean ODR violation. */
12000 if (!types_compatible_p (type1
, type2
))
12002 if (!TYPE_NAME (type1
))
12004 if (!decls_same_for_odr (TYPE_NAME (type1
), TYPE_NAME (type2
)))
12006 if (!same_for_odr (TYPE_CONTEXT (type1
), TYPE_CONTEXT (type2
)))
12008 /* When not in LTO the MAIN_VARIANT check should be the same. */
12009 gcc_assert (in_lto_p
);
12014 /* TARGET is a call target of GIMPLE call statement
12015 (obtained by gimple_call_fn). Return true if it is
12016 OBJ_TYPE_REF representing an virtual call of C++ method.
12017 (As opposed to OBJ_TYPE_REF representing objc calls
12018 through a cast where middle-end devirtualization machinery
12022 virtual_method_call_p (tree target
)
12024 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12026 target
= TREE_TYPE (target
);
12027 gcc_checking_assert (TREE_CODE (target
) == POINTER_TYPE
);
12028 target
= TREE_TYPE (target
);
12029 if (TREE_CODE (target
) == FUNCTION_TYPE
)
12031 gcc_checking_assert (TREE_CODE (target
) == METHOD_TYPE
);
12035 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12038 obj_type_ref_class (tree ref
)
12040 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12041 ref
= TREE_TYPE (ref
);
12042 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12043 ref
= TREE_TYPE (ref
);
12044 /* We look for type THIS points to. ObjC also builds
12045 OBJ_TYPE_REF with non-method calls, Their first parameter
12046 ID however also corresponds to class type. */
12047 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12048 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12049 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12050 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12051 return TREE_TYPE (ref
);
12054 /* Return true if T is in anonymous namespace. */
12057 type_in_anonymous_namespace_p (tree t
)
12059 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
12062 /* Try to find a base info of BINFO that would have its field decl at offset
12063 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12064 found, return, otherwise return NULL_TREE. */
12067 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12069 tree type
= BINFO_TYPE (binfo
);
12073 HOST_WIDE_INT pos
, size
;
12077 if (types_same_for_odr (type
, expected_type
))
12082 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12084 if (TREE_CODE (fld
) != FIELD_DECL
)
12087 pos
= int_bit_position (fld
);
12088 size
= tree_low_cst (DECL_SIZE (fld
), 1);
12089 if (pos
<= offset
&& (pos
+ size
) > offset
)
12092 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12095 if (!DECL_ARTIFICIAL (fld
))
12097 binfo
= TYPE_BINFO (TREE_TYPE (fld
));
12101 /* Offset 0 indicates the primary base, whose vtable contents are
12102 represented in the binfo for the derived class. */
12103 else if (offset
!= 0)
12105 tree base_binfo
, found_binfo
= NULL_TREE
;
12106 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12107 if (types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12109 found_binfo
= base_binfo
;
12114 binfo
= found_binfo
;
12117 type
= TREE_TYPE (fld
);
12122 /* Returns true if X is a typedef decl. */
12125 is_typedef_decl (tree x
)
12127 return (x
&& TREE_CODE (x
) == TYPE_DECL
12128 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12131 /* Returns true iff TYPE is a type variant created for a typedef. */
12134 typedef_variant_p (tree type
)
12136 return is_typedef_decl (TYPE_NAME (type
));
12139 /* Warn about a use of an identifier which was marked deprecated. */
12141 warn_deprecated_use (tree node
, tree attr
)
12145 if (node
== 0 || !warn_deprecated_decl
)
12151 attr
= DECL_ATTRIBUTES (node
);
12152 else if (TYPE_P (node
))
12154 tree decl
= TYPE_STUB_DECL (node
);
12156 attr
= lookup_attribute ("deprecated",
12157 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12162 attr
= lookup_attribute ("deprecated", attr
);
12165 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12171 expanded_location xloc
= expand_location (DECL_SOURCE_LOCATION (node
));
12173 warning (OPT_Wdeprecated_declarations
,
12174 "%qD is deprecated (declared at %r%s:%d%R): %s",
12175 node
, "locus", xloc
.file
, xloc
.line
, msg
);
12177 warning (OPT_Wdeprecated_declarations
,
12178 "%qD is deprecated (declared at %r%s:%d%R)",
12179 node
, "locus", xloc
.file
, xloc
.line
);
12181 else if (TYPE_P (node
))
12183 tree what
= NULL_TREE
;
12184 tree decl
= TYPE_STUB_DECL (node
);
12186 if (TYPE_NAME (node
))
12188 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12189 what
= TYPE_NAME (node
);
12190 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12191 && DECL_NAME (TYPE_NAME (node
)))
12192 what
= DECL_NAME (TYPE_NAME (node
));
12197 expanded_location xloc
12198 = expand_location (DECL_SOURCE_LOCATION (decl
));
12202 warning (OPT_Wdeprecated_declarations
,
12203 "%qE is deprecated (declared at %r%s:%d%R): %s",
12204 what
, "locus", xloc
.file
, xloc
.line
, msg
);
12206 warning (OPT_Wdeprecated_declarations
,
12207 "%qE is deprecated (declared at %r%s:%d%R)",
12208 what
, "locus", xloc
.file
, xloc
.line
);
12213 warning (OPT_Wdeprecated_declarations
,
12214 "type is deprecated (declared at %r%s:%d%R): %s",
12215 "locus", xloc
.file
, xloc
.line
, msg
);
12217 warning (OPT_Wdeprecated_declarations
,
12218 "type is deprecated (declared at %r%s:%d%R)",
12219 "locus", xloc
.file
, xloc
.line
);
12227 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12230 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12235 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12238 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12244 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12245 somewhere in it. */
12248 contains_bitfld_component_ref_p (const_tree ref
)
12250 while (handled_component_p (ref
))
12252 if (TREE_CODE (ref
) == COMPONENT_REF
12253 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12255 ref
= TREE_OPERAND (ref
, 0);
12261 #include "gt-tree.h"